Datasets:

Modalities:
Text
Formats:
parquet
ArXiv:
Libraries:
Datasets
Dask
License:
Dataset Viewer
Auto-converted to Parquet
id
int64
text
string
metadata
dict
line_start_n_end_idx
dict
quality_signals
dict
eai_taxonomy
dict
pid
string
-4,041,170,850,086,211,600
OSNews: http://www.osnews.com/story/17169/OpenOffice_org_2_0_RC1_for_OS_2_eComStation Exploring the Future of Computing en-us Copyright 2001-2015, David Adams [email protected] Wed, 25 Nov 2015 20:51:04 GMT http://www.osnews.com/images/osnews.gif OSNews.com http://www.osnews.com FYI http://www.osnews.com/thread?209426 http://www.osnews.com/thread?209426 OpenOffice 2.0 really thrives on a JFS partition; if you have one, install it there. On HPFS it is slooooooooooooooow. eCom 2.0 will be bootable JFS so you may want to wait until then. Mon, 05 Feb 2007 20:41:00 GMT [email protected] (zizban) Comments Whats the point? http://www.osnews.com/thread?209446 http://www.osnews.com/thread?209446 Why bother to put the time, money, and manpower into a build for an OS with a minimal user-base? Mon, 05 Feb 2007 21:43:00 GMT [email protected] (JonInAtlanta) Comments What ever happened http://www.osnews.com/thread?209459 http://www.osnews.com/thread?209459 To Kim Cheung? The other eComStation guy. Mon, 05 Feb 2007 22:09:00 GMT [email protected] (ronaldst) Comments Because they want to :) http://www.osnews.com/thread?209460 http://www.osnews.com/thread?209460 JonInAtlanta, There are many OSes out there with minimal userbases that get updates all the time. In the case of Serenity Systems, they have paying customers who want this functionality. The continued development of their OS allows them to fund this development. There are many people out there who run Operating Systems with what would be considered a minimal user-base, and there are too many of those operating systems to mention in one single posting. There are also unique reasons for each person wanting to do what they want. It's called Free Will or the pursuit of knowledge. These people do what they want because they want to do it, and may learn something from the process. While you or I may not agree with the choices that some people make for a choice of operating environment to use, or what software to port to it, its not up to us to criticize them, or their reasons, for doing what they do. Otherwise, this is an accomplishment that's quite interesting, as this came out long before a native OpenOffice for OS X ;) . Mon, 05 Feb 2007 22:11:00 GMT [email protected] (mbpark) Comments RE: Whats the point? http://www.osnews.com/thread?209462 http://www.osnews.com/thread?209462 They actually have a pretty good installed user base. They have picked up a lot of OS2 customers that IBM no longer supports. For a big company it's no money, but for a small company with a small staff I am sure they are making a few hundred thousand dollars a year. I would like to have that coming in. More money then me and my staff make. :-( I actually bet they bring in more money then companies like Ununtu, Linspire and others who are putting in a LOT more money, time and manpower. Mon, 05 Feb 2007 22:18:00 GMT [email protected] (Windows Sucks) Comments RE: Whats the point? http://www.osnews.com/thread?209464 http://www.osnews.com/thread?209464 If it wasn't worth their while, I suspect they wouldn't be doing it. As it is, though, why not? I think it's nice to see at least one solid alternative OS which is not derived from UNIX continue to live. Mon, 05 Feb 2007 22:26:00 GMT [email protected] (rcsteiner) Comments RE: Whats the point? http://www.osnews.com/thread?209470 http://www.osnews.com/thread?209470 Why bother to put the time, money, and manpower into a build for an OS with a minimal user-base? May I ask you a very sincere question... What are you doing here? No, seriously, what are you doing here? Mon, 05 Feb 2007 22:43:00 GMT [email protected] (Thom_Holwerda) Comments Standard Answer http://www.osnews.com/thread?209472 http://www.osnews.com/thread?209472 Why bother to put the time, money, and manpower into a build for an OS with a minimal user-base? Why [insert whatever you want] for a OS like [insert small-market OS] Answer: It's OSNews.com dude! People do stuff like this becauses they like it, love it, want to do it, feel compelled, or whatever. Some make money, some don't. If that rattles you, then just head on over to MSN and have fun! I hear they have Pics of Paris Hilton! Mon, 05 Feb 2007 22:52:00 GMT [email protected] (fretinator) Comments Too bad... http://www.osnews.com/thread?209473 http://www.osnews.com/thread?209473 Too bad it's so expensive... Warp was awesome on my Pentium 100MHz back 10 years ago... No way I'll pay $189 for an academic version now though. Mon, 05 Feb 2007 23:09:00 GMT [email protected] (Ventajou) Comments RE: Too bad... http://www.osnews.com/thread?209504 http://www.osnews.com/thread?209504 It's more cost-effective if you can find an old copy of Warp 4 somewhere. US$79 isn't too bad. Tue, 06 Feb 2007 01:00:00 GMT [email protected] (rcsteiner) Comments Innotek is evil... http://www.osnews.com/thread?209507 http://www.osnews.com/thread?209507 They actually charge for their builds of a a free product and ruthlessly anybody who might even THINK of providing a free build. Various people tried this with builds GIMP for Windows, but it never really had an effect as the official GIMP webpage makes no mention of this travesty and provides it's own builds for free as is good and natural. Tue, 06 Feb 2007 01:04:00 GMT [email protected] (madcrow) Comments RE: Innotek is evil... http://www.osnews.com/thread?209524 http://www.osnews.com/thread?209524 Not so evil. Innotek wrote a library that allows OS/2 (eCS, whatever) to simulate many of the library calls of another OS. They integrated OpenOffice with this library (and probably made significant alterations to the library). This is what they're charing for. I'm happy to pay it. How do they go after others that provide a free build? Are you mixing them up with GoldenCode? Tue, 06 Feb 2007 01:40:00 GMT [email protected] (MNBill) Comments RE[2]: Whats the point? http://www.osnews.com/thread?209526 http://www.osnews.com/thread?209526 Unless you're a totally pompous ass Thom, it's a legitimate question Thom. For a company to put resources into a product that has little to no chance of making a profit is BAD BUSINESS Thom (ask Yellow Tab). Hobby OSs' are fine, no argument, but they aren't a smart business move, Thom. Tue, 06 Feb 2007 01:43:00 GMT [email protected] (JonInAtlanta) Comments RE[3]: Whats the point? http://www.osnews.com/thread?209566 http://www.osnews.com/thread?209566 Because there are still companies out there using OS/2. Isn't this obvious to you? O_o There are a lot companies using OS/2 in the embedded field. Tue, 06 Feb 2007 05:29:00 GMT [email protected] (ronaldst) Comments RE[3]: Whats the point? http://www.osnews.com/thread?209609 http://www.osnews.com/thread?209609 Unless you're a totally pompous ass Thom, it's a legitimate question Thom. For a company to put resources into a product that has little to no chance of making a profit is BAD BUSINESS Thom (ask Yellow Tab). Hobby OSs' are fine, no argument, but they aren't a smart business move, Thom. First of all, what concern is it of yours if these businesses make any money or not? (Serenity Systems obviously does make money by the way.) Secondly, have you ever used eComStation? It actually is a pretty decent OS. Not something I could use everyday, but that's more because I'm a *NIX-head. Serenity Systems have done a lot of great things for the OS/2 community, and yes there are a lot of businesses still running mission critical code on OS/2 or eComStation today. It is difficult and probably not cost effective to port legacy applications off of this platform because the OS/2 APIs are very different from the rest of the OSes out there today. Additionally, in the business world, a lot of people (rightly so) subscribe to the mantra "if it ain't broke, don't fix it". By porting code that has worked flawlessly for a decade or more, you have a HUGE potential for introducing subtle bugs. This is not acceptable for many applications. Additionally, a lot of in-house software is poorly documented and difficult to work with and understand, especially if the person who originally wrote that code has gone on to greener pastures. In these cases, legacy binary compatibility is a must. Thirdly, if you see something posted on this site as useless, do the rest of us a favor and ignore it. Don't tell us it's useless, just say to yourself, wow, that's useless, and move on to a story that you can contribute positive discussion to. If you want to read stories with this formula: if(topic=="Linux"||topic=="Windows"||topic=="Mac") then post() ...then I suggest you take a look at Slashdot.org Most of the rest of us like reading about obscure OSes. Tue, 06 Feb 2007 09:21:00 GMT [email protected] (the_trapper) Comments RE: Innotek is evil... http://www.osnews.com/thread?209611 http://www.osnews.com/thread?209611 Innotek is not evil: they have all the right to make you pay for the runtime library that allows OS/2-eCS to run Win32 binaries. It's something like CrossOver on Linux. And they are NOT preventing anybody from providing a free build... there were in fact a few dudes running OpenOffice on the free Odin runtime (Odin=wine, Innotek=CrossOver), but it was not working as well. Anyway, the build we're talking about here is a NATIVE build, and AFAIK it's not done by Innotek. Tue, 06 Feb 2007 09:48:00 GMT [email protected] (Cris) Comments RE[3]: Whats the point? http://www.osnews.com/thread?209612 http://www.osnews.com/thread?209612 Jon, not only they are making profit, but they are making it even BEFORE releasing the final port: this port was realized because of a lot of people was interested. They issued a "support agreement", where people would buy the final product (and have right to all the betas and to the previous 1.1.5 release) for a reduced price, but paid BEFORE the start of the actual development. ...and BTW, calling OS/2 a "hobby OS" is frankly ridiculous. Tue, 06 Feb 2007 09:54:00 GMT [email protected] (Cris) Comments RE[3]: Whats the point? http://www.osnews.com/thread?209687 http://www.osnews.com/thread?209687 The fact that you're calling an OS from IBM a "hobby OS" is rather interesting. Are you that out of touch with OS/2's rather lengthy history in business? Tue, 06 Feb 2007 17:02:00 GMT [email protected] (rcsteiner) Comments RE: What ever happened http://www.osnews.com/thread?209690 http://www.osnews.com/thread?209690 Good question. He hasn't been active on the eCS mailing lists for quite a while (since 2001?). Tue, 06 Feb 2007 17:08:00 GMT [email protected] (rcsteiner) Comments RE: Whats the point? http://www.osnews.com/thread?210155 http://www.osnews.com/thread?210155 Why bother to put time into complaining about something you know nothing about? What do you get out of it? Does it make you feel better? Do you feel more like a man? Do you often take time to complain about every other operating system that isn't microsoft based? If you do then you already understand your own question and should apply it to what you do. I defend your right to whine and complain about everything, but I will tell you most people have given that up by the time they reach 8 years old. How old are you? Nathan Wed, 07 Feb 2007 16:25:00 GMT [email protected] (NathanInAtlanta) Comments Ironies in origins http://www.osnews.com/thread?210163 http://www.osnews.com/thread?210163 Open Office arose from Sun's release of code--I'm showing I don't know the legally and technically correct expression--for an office productivity suite, Sun Office, which Sun still develops and distributes. Which came from? Inhouse work in porting Star Office from and by a German company, Star, which Sun had purchased several years earlier. And for what OS had Star created its most extensive --(or only?--version of Star Office, (including a browser)? The predecessor of ecomstation, IBM's OS/2. Wed, 07 Feb 2007 17:03:00 GMT [email protected] (htravis) Comments RE: Get OpenOffice.org preloaded and no Microsoft tax http://www.osnews.com/thread?210416 http://www.osnews.com/thread?210416 Instead of getting VISTA buy a computer preloaded with eComStation and OpenOffice. Good software on good hardware. Instead of a cheaply made DELL. Get a machine that will last. eComStation is more stable than any windows yet easier than Linux. http://www.curtissystemssoftware.com/preloads.htm One of the only vendors that sells desktop computers with ECC memory too. Why buy DELL junk when there are good suppliers you can buy from. Dell Laptops Have Shocking New Problem http://www.engadget.com/2007/02/06/dells-17-inchers-packing-a-jolt/ http://www.notebookforums.com/thread188600.html Dell laptop explodes http://www.engadget.com/2006/09/20/dell-battery-explodes-at-yahoo-h... "Exploding" Dell Laptop Destroys Truck, Imperils Outsdoorsmen Vintage Truck Burns to Ground, Strands Fishermen in Desert Canyon http://www.consumeraffairs.com/news04/2006/08/dell_fire.html Thu, 08 Feb 2007 02:57:00 GMT [email protected] (user_ecs) Comments What's the point ? http://www.osnews.com/thread?211639 http://www.osnews.com/thread?211639 What's the point ?, someone asked. (And -- by implication -- not just in developing for the OS, but in anyone bothering to run it.) Oh, I dunno, maybe the **near total immunity** from tons of malware and ongoing, ubiquitous exploit holes out there in the Redmond products ?! It's not simply a matter of stability, because W2K and XP finally reached a point of being much better than what MS had done before. It will likely take Vista a good couple years to get to that point. But big market share always makes you a target worth going after, so it becomes a big plus to be little known and essentially invisible. This is particularly the case in regard to mainstream business apps, such as are covered by Open Office, where you only need to be able to work compatibly with the prevalent file formats. For other apps, such as in some multi-media areas, I'm afraid you'll just have to keep strapping that gigantic neon bullseye onto your back ! Or head on over to the 'Nix.Edited 2007-02-11 21:44 Sun, 11 Feb 2007 21:42:00 GMT [email protected] (bystander11) Comments
{ "url": "http://www.osnews.com/story/17169/OpenOffice_org_2_0_RC1_for_OS_2_eComStation/feed", "source_domain": "www.osnews.com", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "20263", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FAASWXM7JNPJEOD26AMHKKVE24UKLW7F", "WARC-Concurrent-To": "<urn:uuid:ad9d35de-bd92-4fe6-82ab-e1efead2ea7e>", "WARC-Date": "2015-11-25T20:51:05Z", "WARC-IP-Address": "148.251.13.74", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:T2MBFO5KWFVBRCE66N42Y6HNACZWBOZA", "WARC-Record-ID": "<urn:uuid:2bd20cc4-d275-47b1-a1ab-5b431162ad76>", "WARC-Target-URI": "http://www.osnews.com/story/17169/OpenOffice_org_2_0_RC1_for_OS_2_eComStation/feed", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:5065eedd-a789-4957-ac25-ab2e1e95c4f1>" }, "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, 1193, 1194, 1443, 1444, 1637, 1638, 1866, 1867, 2091, 2092, 2218, 2288, 2507, 2508, 2649, 2650, 2729, 2730, 2874, 2951, 3113, 3114, 3249, 3322, 3512, 3513, 3554, 3555, 3620, 3697, 3882, 3883, 3953, 3954, 4219, 4293, 5732, 5733, 5828, 5898, 6202, 6203, 6282, 6358, 6541, 6542, 6602, 6674, 6978, 6979, 7058, 7059, 7201, 7202, 8254, 8255, 8500, 8501, 8548, 8549, 8612, 8613, 8663, 8664, 8720, 8795, 9059, 9265, 9363, 9431, 9910, 9911, 9972, 10040, 10885, 10886, 11076, 11077, 11241, 11242, 11249, 11328, 12359, 12360, 12410, 12411, 12485, 12486, 12552, 12553, 12592, 12660, 12708, 12709, 12730, 12801, 12802, 12864, 12930, 12991, 13063, 13630, 13631, 14150 ], "line_end_idx": [ 1193, 1194, 1443, 1444, 1637, 1638, 1866, 1867, 2091, 2092, 2218, 2288, 2507, 2508, 2649, 2650, 2729, 2730, 2874, 2951, 3113, 3114, 3249, 3322, 3512, 3513, 3554, 3555, 3620, 3697, 3882, 3883, 3953, 3954, 4219, 4293, 5732, 5733, 5828, 5898, 6202, 6203, 6282, 6358, 6541, 6542, 6602, 6674, 6978, 6979, 7058, 7059, 7201, 7202, 8254, 8255, 8500, 8501, 8548, 8549, 8612, 8613, 8663, 8664, 8720, 8795, 9059, 9265, 9363, 9431, 9910, 9911, 9972, 10040, 10885, 10886, 11076, 11077, 11241, 11242, 11249, 11328, 12359, 12360, 12410, 12411, 12485, 12486, 12552, 12553, 12592, 12660, 12708, 12709, 12730, 12801, 12802, 12864, 12930, 12991, 13063, 13630, 13631, 14150, 14224 ] }
{ "red_pajama_v2": { "ccnet_original_length": 14224, "ccnet_original_nlines": 104, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 3, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3135643005371094, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.034351151436567307, "rps_doc_frac_lines_end_with_ellipsis": 0.01904761977493763, "rps_doc_frac_no_alph_words": 0.3059307038784027, "rps_doc_frac_unique_words": 0.3503580093383789, "rps_doc_mean_word_length": 5.281622886657715, "rps_doc_num_sentences": 324, "rps_doc_symbol_to_word_ratio": 0.003523190040141344, "rps_doc_unigram_entropy": 5.842690944671631, "rps_doc_word_count": 2095, "rps_doc_frac_chars_dupe_10grams": 0.06018979102373123, "rps_doc_frac_chars_dupe_5grams": 0.09877993911504745, "rps_doc_frac_chars_dupe_6grams": 0.07898779958486557, "rps_doc_frac_chars_dupe_7grams": 0.07898779958486557, "rps_doc_frac_chars_dupe_8grams": 0.07898779958486557, "rps_doc_frac_chars_dupe_9grams": 0.06018979102373123, "rps_doc_frac_chars_top_2gram": 0.014550380408763885, "rps_doc_frac_chars_top_3gram": 0.014098510146141052, "rps_doc_frac_chars_top_4gram": 0.010845010168850422, "rps_doc_books_importance": -1634.6973876953125, "rps_doc_books_importance_length_correction": -1634.6973876953125, "rps_doc_openwebtext_importance": -926.8932495117188, "rps_doc_openwebtext_importance_length_correction": -926.8932495117188, "rps_doc_wikipedia_importance": -752.00341796875, "rps_doc_wikipedia_importance_length_correction": -752.00341796875 }, "fasttext": { "dclm": 0.2026653289794922, "english": 0.9115996360778809, "fineweb_edu_approx": 1.4368221759796143, "eai_general_math": 0.03720378875732422, "eai_open_web_math": 0.21532511711120605, "eai_web_code": 0.007175209932029247 } }
{ "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": "004.019", "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": "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": "3", "label": "Mostly Correct" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
e3c4dd7183f5f028f56d5a7988cc68c4
8,252,207,289,312,992,000
Posts Tagged β€˜nokia lumia 520 vs samsung galaxy s3’ Nokia Lumia 920 vs Samsung Galaxy S3 vs HTC One X September 8th, 2012 The mobile world has changed a lot since Nokia last put out a phone that truly wowed large amounts of people. Its tie in with Microsoft spawned some half decent handsets but despite Nokia’s best efforts, the world was never truly set alight. Cue Nokia World 2012 and the announcement of the Nokia Lumia 920. Make no mistake, this is more than a big deal for both Nokia and Microsoft, with both having a lot riding on their respective contributions. Many see it as Nokia’s big throw of the dice: make Windows Phone 8 into a top OS and the rewards are huge… fail, and things look ropey for the Finns. Β» Read more: Nokia Lumia 920 vs Samsung Galaxy S3 vs HTC One X Related Posts Plugin for WordPress, Blogger... %d bloggers like this:
{ "url": "http://www.freshersbeat.com/tag/nokia-lumia-520-vs-samsung-galaxy-s3", "source_domain": "www.freshersbeat.com", "snapshot_id": "crawl=CC-MAIN-2013-20", "warc_metadata": { "Content-Length": "28810", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OHHJHEJGUQY6CWOKSHJQDCYR4C7JDD7T", "WARC-Concurrent-To": "<urn:uuid:5ec933c1-ec5e-4955-ba5d-24ce0510875b>", "WARC-Date": "2013-05-21T21:54:51Z", "WARC-IP-Address": "216.227.218.25", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:GB4BRNREQCCOOZJOARVMTF2QN2P4HEIW", "WARC-Record-ID": "<urn:uuid:73daadb7-b7e5-443a-9bbb-602789b40455>", "WARC-Target-URI": "http://www.freshersbeat.com/tag/nokia-lumia-520-vs-samsung-galaxy-s3", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2ffb47a7-24a4-4540-b2b4-abc31f98cffc>" }, "warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 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, 52, 53, 103, 104, 124, 125, 367, 368, 725, 788, 789, 836, 837 ], "line_end_idx": [ 52, 53, 103, 104, 124, 125, 367, 368, 725, 788, 789, 836, 837, 859 ] }
{ "red_pajama_v2": { "ccnet_original_length": 859, "ccnet_original_nlines": 13, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3535911738872528, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03867403045296669, "rps_doc_frac_lines_end_with_ellipsis": 0.0714285671710968, "rps_doc_frac_no_alph_words": 0.16022099554538727, "rps_doc_frac_unique_words": 0.6582278609275818, "rps_doc_mean_word_length": 4.291139125823975, "rps_doc_num_sentences": 7, "rps_doc_symbol_to_word_ratio": 0.011049720458686352, "rps_doc_unigram_entropy": 4.461970329284668, "rps_doc_word_count": 158, "rps_doc_frac_chars_dupe_10grams": 0.1150442510843277, "rps_doc_frac_chars_dupe_5grams": 0.1150442510843277, "rps_doc_frac_chars_dupe_6grams": 0.1150442510843277, "rps_doc_frac_chars_dupe_7grams": 0.1150442510843277, "rps_doc_frac_chars_dupe_8grams": 0.1150442510843277, "rps_doc_frac_chars_dupe_9grams": 0.1150442510843277, "rps_doc_frac_chars_top_2gram": 0.0398230105638504, "rps_doc_frac_chars_top_3gram": 0.06637167930603027, "rps_doc_frac_chars_top_4gram": 0.044247791171073914, "rps_doc_books_importance": -79.5807876586914, "rps_doc_books_importance_length_correction": -79.5807876586914, "rps_doc_openwebtext_importance": -47.98320007324219, "rps_doc_openwebtext_importance_length_correction": -43.8315544128418, "rps_doc_wikipedia_importance": -36.45817565917969, "rps_doc_wikipedia_importance_length_correction": -36.45817565917969 }, "fasttext": { "dclm": 0.05436247959733009, "english": 0.9088054895401001, "fineweb_edu_approx": 0.9204340577125549, "eai_general_math": 0.000025749999622348696, "eai_open_web_math": 0.03218752145767212, "eai_web_code": -0.000009180000233754981 } }
{ "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": "658.85", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "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": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "1", "label": "Truncated Snippets" }, "secondary": { "code": "2", "label": "Click Here References" } }, "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": "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
-2,439,845,835,742,470,700
Unlimited Plugins, WordPress themes, videos & courses! Unlimited asset downloads! From $16.50/m Advertisement 1. Code 2. HTML5 HTML5 Mastery: Encoding by Difficulty:IntermediateLength:MediumLanguages: This post is part of a series called HTML5 Mastery Class. HTML5 Mastery: Scoping Rules HTML5 Mastery: Fragments HTML5 Mastery Encoding is just one of those things that need to be done right. If done wrong, everything seems to be broken and nothing works. If done right, no one will notice. This makes dealing with encoding so annoying. Nevertheless, we are quite lucky and most of the things are already really well-prepared. We only need to ensure that our documents are saved (and transmitted) with the right encoding. The right encoding is the one we specify. It could be anything, as long as it contains all characters we need, and as long as we stay consistent. There are three important text encoding rules for HTML: 1. Load the content with the right encoding. 2. Transmit the content with the same encoding. 3. Ensure that the client reads the content with the specified encoding. In this article we will have a closer look at all three rules in more detail, especially the second and the third. In the end we will also look at form encoding, which has nothing to do with text encoding directly, but does indirectly. We will see why there is some connection. Choosing the Right Encoding Either we know directly that our content should be delivered in some exotic encoding or we should just pick UTF-8. There are many reasons why we would want to use UTF-8. It is not a great format for storing characters in memory, but it is just wonderful as a basis for data exchange and content transmission. It is basically a no-brainer. Nevertheless, one of the more common mistakes is to save files without proper encoding. As there is no text without encoding, we should choose the encoding carefully. Users of Sublime Text and most other text editors have probably never faced a problem with wrong encoding, since these editors save in UTF-8 by default. There are editors, mostly for the Windows platform, which a use different default format, e.g., Windows-1252. Even in Sublime Text it is one of the more standard operations to change the encoding of the file. In the File menu we select Save with Encoding and select the one we want. That’s it! Saving Text Encoding Sublime Text In principle every more advanced editor should have such options. Sometimes they are contained in an advanced save menu. For instance, the editor for Microsoft’s Visual Studio triggers a special dialog after clicking Advanced Save Options… in the File menu. Visual Studio Advanced Save We should make sure to use the right encoding. This will use the corresponding bytes for our content. UTF-8 has the major advantage of only requiring a single byte if we do not use a special character. At most 4 bytes per character are consumed. This is dynamic and makes UTF-8 an ideal format for text storage and transmission. The caveat is, however, that UTF-8 is not the best format for using strings from memory. Controlling the Transmission The HTTP protocol transmits data as plain text. Even if we decide to encode the transmitted content as GZip or if we use HTTPS, which encrypts the content, the underlying content is still just plain text. We’ve already learned that there is no such thing as just plain text. We always need to associate the content with some encoding to get a text representation. An HTTP message is split in two parts. The upper part is called the headers. Separated by an empty line is the lower part: the body. There are always at least two HTTP messages: a request and its associated response. Both types of messages share this structure. The body of a response is the content we want to transmit. The body of a request is only of interest for form submission, which we’ll care about later. If we want to provide some information on the encoding of the content, we have to supply some information in the header. The following header tells the receiving side that the body contains a special text format called HTML, using the UTF-8 character set. There is also the Content-Encoding header. We can easily confuse the content encoding with the actual text encoding of the content. The former is used to specify encoding of the whole package, e.g. GZip, while the latter is used as an initial setting for, e.g., parsing the provided content. If we care about the correctness of this step we have to make sure that our web server sends the correct header. Most web frameworks offer such an ability. In PHP we could write: In Node.js we may want to use the following, where res is the variable representing the request: The transmitted header will set the text scanner of the HTML input to the provided setting. In the case of the previous example we use UTF-8. But wait: Initial setting! There are many ways to override this. If the actual content is not UTF-8, the scanner may recognize this and change the setting. Such a change may be triggered by Byte-Order-Mark (known as BOM) detection or by finding encoding-specific patterns in the content. In contrast, the former looks for artificially prepended patterns. Finally, the encoding may change due to our HTML code. This can only be changed once. Fixing the Encoding Once the DOM constructor hits a meta tag, it will look for a charset declaration. If one is found, the character set will be extracted. If we can extract it successfully and if the encoding is valid, we set the new encoding for scanning further characters. At this point the encoding will be frozen, and no further changes are possible. There is just one caveat. To check if the previous scanning was alright, we need to compare the characters that have already been scanned with the characters that would have been scanned. Hence we need to see if changing the encoding earlier would have made some difference. If we find a difference, we need to restart the whole parsing procedure. Otherwise the whole DOM structure may be wrong up to this point. As a consequence we’ve already learned two lessons: 1. Place the <meta charset="utf-8"> (or some other encoding) tag as soon as possible. 2. Only use ASCII characters before specifying the charset attribute in HTML. Finally, a good starter for a boilerplate looks as follows. As we learned in the previous article, we can omit the head and body tags. The snippet does two things right: It uses the correct document type, and it selects the character set as soon as possible. The only remaining question is: What happens if I forget one of these three steps? Well, the first and third steps are the most important ones. The transmission is actually not that bad. If no initial encoding is given from the HTTP headers, the browser will select the initial encoding based on the user’s locale. With a German locale we get Windows-1252. This is actually the default for most countries. Some countries, like Poland or Hungary, select Latin2, also known as iso-8859-2. In principle we do not have to worry about this initial encoding if we followed the best practices described earlier. ASCII is a subset of Unicode, and most of the listed encodings are actually just ASCII extensions to satisfy the specific needs of one or more countries. If we only use basic ASCII characters until the character set is specified, we should be fine. Much more severe is a conflict between the stored / read or generated data, which is delivered to the client, and the statement in the meta tag. If something went wrong we may see renderings like the following. This is not a pleasant user experience. Encoding Problem Coming back to determining the right encoding, there are many reasons why UTF-8 would be the best choice. Any other encoding should at least be sufficient for the characters we want to display. However, if we provide form input fields, we may be in trouble. At this point we do not control the characters that are used any more. Users are allowed to input anything here. Let’s see how we can control the encoding for form input. Submitting Forms A form is submitted with a certain encoding type, which is not the same as the encoding type of a server’s response, e.g. GZip. The form’s encoding type determines how the form is serialized before sending it to the server. It is particularly useful in conjunction with the HTTP verb. Ordinary form submissions use POST as HTTP verb, but GET, PUT and DELETE are also common. Only POST and PUT are supposed to use the body for content transmission in the request. The browser will construct the content with respect to the choice of the enctype attribute of the <form> element, specifying the encoding type. The encoding type is transported by setting the Content-Type header in the HTTP request. There are three well-established encoding types: 1. URL encoded (default value, explicitly application/x-www-form-urlencoded) 2. Plain text (text/plain) 3. Multipart (multipart/form-data) The first and the second are quite similar, but they have subtle (and very important) differences. The third variant is the most powerful method. It even allows the transporting of arbitrary files as attachments. The key difference between the first two types is that URL encoded form transmission percent-encodes all names and values, which is not done by plain text. The percent-encoding guarantees that the receiving side can distinguish between names and values. This guarantee does not exist with plain text form submission. The third variant uses a boundary string to separate the entries, which is unique by construction. Let’s visualize the differences by submitting a simple form. The form contains the following code: Submitting the form without specifying any encoding type transmits the following body: The URL encoding transforms the white-space characters to plus signs. Existing plus signs, like all β€œspecial” characters, are transformed by the percent-encoding rules. This especially applies to new lines, originally represented by \r\n, which are now displayed as %0D%0A. Let’s see what the outcome for plain text encoding looks like. The pairs are split by new lines. This is especially problematic for multi-line content and may lead to incorrect representations. In a way the multipart encoding combines the advantages of plain text submission with a defined boundary, which essentially solves the problems of the plain text encoding. The only drawback is the increased content length. The last two form encoding methods also displayed special characters exactly as we’ve entered them. Form transmission primarily uses the accept-charset attribute of the corresponding `</form> ` element. If no such attribute is given, the encoding of the page is used. Again, setting the correct encoding is important. In the future we will see a fourth encoding type, called `application/json`. As the name suggests, it will pack the form content into a JSON string. ## Conclusion Choosing the right encoding can be as easy as just picking UTF-8. Typical problems can be avoided by using the same encoding consistently. Declaring the encoding during transport is certainly useful, although not required, especially if we follow best practices for placing a `` element with the `charset` attribute. Form submission is a process that relies on the right encoding choiceβ€”not only for the text, but for the submission itself. In general we can always choose `multipart/form-data` as `enctype`, even though the default encoding type might be better (smaller) in most scenarios. In production we should never use `text/plain`. ## References * [UTF-8: The Secret of Character Encoding](https://htmlpurifier.org/docs/enduser-utf8.html) * [W3C Specification: Form Submission](http://www.w3.org/TR/html5/forms.html#attr-fs-enctype) * [W3C Specification: Encoding](http://www.w3.org/TR/encoding/) * [W3C Specification: Initial Encoding Determination](http://www.w3.org/TR/html51/syntax.html#the-input-byte-stream) * [StackOverflow: What is the boundary in multipart/form-data?](https://stackoverflow.com/questions/3508338/what-is-the-boundary-in-multipart-form-data) Advertisement Advertisement Advertisement Looking for something to help kick start your next project? Envato Market has a range of items for sale to help get you started.
{ "url": "https://code.tutsplus.com/tutorials/html5-mastery-encoding--cms-24841", "source_domain": "code.tutsplus.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "108873", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DEYFWD7JHO723UAUY7D3CPXKDDV2VMGW", "WARC-Concurrent-To": "<urn:uuid:a4a99f5f-4673-4f58-9bd4-8767fb9996fe>", "WARC-Date": "2021-04-12T23:22:14Z", "WARC-IP-Address": "104.17.233.79", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IYDLLHN544I5755OQK7QI65QADDIWBPY", "WARC-Record-ID": "<urn:uuid:47dfbbc7-4bbb-4f89-b470-066babc6cf34>", "WARC-Target-URI": "https://code.tutsplus.com/tutorials/html5-mastery-encoding--cms-24841", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:098df20e-2a83-4950-bd30-f66c97b6d065>" }, "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-184.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, 96, 110, 120, 131, 132, 156, 157, 160, 207, 265, 294, 319, 333, 334, 544, 545, 876, 877, 933, 934, 981, 1031, 1106, 1107, 1385, 1386, 1414, 1415, 1921, 1922, 2185, 2186, 2370, 2371, 2405, 2406, 2664, 2665, 2693, 2694, 3112, 3113, 3142, 3143, 3507, 3508, 3641, 3642, 4044, 4045, 4180, 4181, 4473, 4474, 4653, 4654, 4751, 4752, 5249, 5250, 5336, 5337, 5357, 5358, 5695, 5696, 6109, 6110, 6162, 6163, 6251, 6331, 6332, 6591, 6592, 7079, 7080, 7447, 7448, 7699, 7700, 7717, 7718, 8147, 8148, 8165, 8166, 8451, 8452, 8863, 8864, 8913, 8914, 8993, 9022, 9059, 9060, 9273, 9274, 9690, 9691, 9790, 9791, 9878, 9879, 10153, 10154, 10217, 10218, 10349, 10350, 10573, 10574, 10766, 10767, 12231, 12245, 12259, 12273, 12333 ], "line_end_idx": [ 96, 110, 120, 131, 132, 156, 157, 160, 207, 265, 294, 319, 333, 334, 544, 545, 876, 877, 933, 934, 981, 1031, 1106, 1107, 1385, 1386, 1414, 1415, 1921, 1922, 2185, 2186, 2370, 2371, 2405, 2406, 2664, 2665, 2693, 2694, 3112, 3113, 3142, 3143, 3507, 3508, 3641, 3642, 4044, 4045, 4180, 4181, 4473, 4474, 4653, 4654, 4751, 4752, 5249, 5250, 5336, 5337, 5357, 5358, 5695, 5696, 6109, 6110, 6162, 6163, 6251, 6331, 6332, 6591, 6592, 7079, 7080, 7447, 7448, 7699, 7700, 7717, 7718, 8147, 8148, 8165, 8166, 8451, 8452, 8863, 8864, 8913, 8914, 8993, 9022, 9059, 9060, 9273, 9274, 9690, 9691, 9790, 9791, 9878, 9879, 10153, 10154, 10217, 10218, 10349, 10350, 10573, 10574, 10766, 10767, 12231, 12245, 12259, 12273, 12333, 12401 ] }
{ "red_pajama_v2": { "ccnet_original_length": 12401, "ccnet_original_nlines": 120, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41379308700561523, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023384859785437584, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17796273529529572, "rps_doc_frac_unique_words": 0.312028169631958, "rps_doc_mean_word_length": 4.983392238616943, "rps_doc_num_sentences": 166, "rps_doc_symbol_to_word_ratio": 0.002774470020085573, "rps_doc_unigram_entropy": 5.470749855041504, "rps_doc_word_count": 1987, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.004443550016731024, "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.007574229966849089, "rps_doc_frac_chars_top_3gram": 0.012926680035889149, "rps_doc_frac_chars_top_4gram": 0.0051504699513316154, "rps_doc_books_importance": -1137.114013671875, "rps_doc_books_importance_length_correction": -1137.114013671875, "rps_doc_openwebtext_importance": -664.271484375, "rps_doc_openwebtext_importance_length_correction": -664.271484375, "rps_doc_wikipedia_importance": -475.44158935546875, "rps_doc_wikipedia_importance_length_correction": -475.44158935546875 }, "fasttext": { "dclm": 0.30883145332336426, "english": 0.9030333161354065, "fineweb_edu_approx": 2.446892499923706, "eai_general_math": 0.9358707070350647, "eai_open_web_math": 0.4563288688659668, "eai_web_code": 0.8477330803871155 } }
{ "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": "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": "-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
8,217,648,156,204,675,000
Program of bug simulation , JAVA Programming You will be creating a World that consists of ants and doodlebugs. Each time you click the board each bug will do some of the following: move, bread, eat, and starve. Ants will function in a certain way, and doodlebugs in another. This assignment is based on Absolute Java. 900_Bug Simulation 1.png Bug Rules Ants Move 1. Every time step the ant will attempt to move. 2. Pick a random direction using a random generator (up, right, down, or left). 3. If the space is on the grid, and not occupied then the ant will move there. Breed 1. If an ant survives 3 time steps he will attempt to breed. 2. He breeds by creating a new ant in a space adjacent to himself. 3. If there is no empty space adjacent to himself to breed then he will not do so. 4. He will then wait 3 more time steps until tries to breed again. Doodlebugs Move 1. Every time step the doodlebug will move. 2. First he will check out each direction. If there is an ant in an adjacent space he will move there (consequently taking up the ants space and eating him!) 3. If there was no ant in an adjacent space he will move just like ants do. 4. Note: doodlebugs can't eat other doodlebugs Breed 1. If a doodlebug survives 8 time steps he will attempt to breed. 2. He breeds in the same manner as an ant. Starve 1. If an ant has not eaten an ant within the last 3 time steps, then at the end of the last time step he will die of starvation. You will remove him from the grid. UML Ants and Doodlebugs will extend from a generic Organism. Create a UML diagram for the Organism, Ant and Doodlebug. This diagram may change as you develop your design, but having a basic flow will greatly help in the implementation. Provided Files 1. World.java 2. Organism.java 3. Ant.java 4. Doodlebug.java 5. ant.png 6. doodlebug.png Word Methods you will use in your classes. Don't modify this class. public Organism getAt(int x, int y) 1. Returns the Organism at the x, y position in the grid. 2. If there is no organism it returns null public void setAt(int x, int y, Organism bug) 1. Sets the entry at the x, y position in the grid to the specified organism public boolean pointInGrid(int x, int y) 1. Returns true if the point x, y is in the grid and false if it goes beyond the grid space (e.g. if x = -1 that is not in the grid) Images 1. Put the two images in an images folder within your src What you need to edit 1. Organism.java 2. Ant.java 3. Doodlebug.java Organims Here are the methods that the World calls on the Organisms. I assume you will want to make more methods, such as move... Organism(World world, int x, int y) 1. Creates a new Organism 2. The coordinates in the grid (X and Y) are required so you can pick a new location relative to its current to move to, and breed at. 3. The World is required so you can call methods like getAt(x, y), setAt(x, y), and pointInGrid(x, y) on it. public abstract String toString() 1. This method is written for you 2. Returns the string representation of the organism ("ant", "doodlebug"). Used by the World to determine which type of organism it is. public void resetSimulation() 1. This method has been written for you 2. You will need to keep track of weather the organism has simulated this time step or not in an attribute of the class. This is important as it stops an organism from moving to a new place in the grid and then simulating again. public boolean simulate() 1. This will set the attribute that keeps track of weather it has simulated to true. This method returns true if it simulates, and false if it doesn't (has already simulated) 2. If the organism was created this time step don't do the rest 3. Call move, then breed, then starve (only for doodlebugs). 4. You will then increment a time step counter Ant and DoodleBug 1. I want you to figure out what goes here Posted Date: 2/20/2013 1:08:00 AM | Location : United States Related Discussions:- Program of bug simulation , Assignment Help, Ask Question on Program of bug simulation , Get Answer, Expert's Help, Program of bug simulation Discussions Write discussion on Program of bug simulation Your posts are moderated Related Questions Write nonrecursive implementations of the min() and floor() methods in BST.java.Β Make sure to use only one return in your method. Use an insertion sort (discussed in class)Β to s Decode the Code Smugglers are becoming very smart day by day. Now they have developed a new technique of sending their messages from one smuggler to another. In their new techn i have got project of Vending machine. would you please help me about how to start and how to use coding.thanks Write code in JavaScript language to show the odd numbers among 20 to 100 using FOR statement. Note: No requirement to write whole HTML program. Just JavaScript code of need p Indeed API integration and search bar fix (Java, Wordpress and PHP) I start a job portal on WP developed out of a customized template. We need an expert in integrating Indeed AP Objective: create a simple object, put that object in a simple collection class, use that object and collection in a simple GUI application. Specification:Β  Consider a Librar How many JSP scripting elements and what are they? Ans) Three scripting language elements are there: a)Β Β Β Β Β  declarations, b)Β Β Β Β Β  scriptlets, c)Β Β Β Β Β Β  expressions. What are the different messaging paradigms JMS supports? Ans) Publish and Subscribe i.e. pub/suc and Point to Point i.e. p2p. A value, the data assigned to a variable, may contain any sort of data. Though, JavaScript considers data to fall into many possible types. Based on the type of data, certain opera
{ "url": "http://www.expertsmind.com/questions/program-of-bug-simulation-30135070.aspx", "source_domain": "www.expertsmind.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "35840", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M2FM35EOM6F6JSKHMAMUNTJ3M4AOWIHN", "WARC-Concurrent-To": "<urn:uuid:73623581-11ce-4234-8ffc-919b05b638b4>", "WARC-Date": "2017-02-23T20:48:30Z", "WARC-IP-Address": "166.63.31.122", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:G6P3LSYKWK5EWVRDLXLLDJNDSKJCI2LV", "WARC-Record-ID": "<urn:uuid:9626b3e9-c4c0-4b5d-8b9e-ba1b4c6b371c>", "WARC-Target-URI": "http://www.expertsmind.com/questions/program-of-bug-simulation-30135070.aspx", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1d67a701-a1b2-4d70-8af9-8e76308b49a4>" }, "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, 45, 46, 213, 214, 278, 279, 322, 323, 348, 349, 359, 360, 365, 366, 371, 372, 423, 505, 586, 587, 593, 594, 657, 726, 811, 880, 881, 892, 893, 898, 899, 945, 1105, 1183, 1232, 1233, 1239, 1240, 1308, 1353, 1354, 1361, 1362, 1528, 1529, 1533, 1534, 1591, 1592, 1767, 1768, 1783, 1784, 1800, 1819, 1833, 1853, 1866, 1885, 1886, 1891, 1892, 1955, 1956, 1992, 1993, 2053, 2098, 2099, 2145, 2146, 2225, 2226, 2267, 2268, 2403, 2404, 2411, 2412, 2472, 2473, 2495, 2496, 2515, 2529, 2549, 2550, 2559, 2560, 2681, 2682, 2718, 2719, 2747, 2884, 2995, 2996, 3030, 3031, 3067, 3205, 3206, 3236, 3237, 3279, 3510, 3511, 3537, 3538, 3715, 3781, 3844, 3893, 3894, 3912, 3913, 3958, 4019, 4020, 4021, 4022, 4023, 4024, 4025, 4026, 4202, 4203, 4249, 4274, 4292, 4470, 4471, 4648, 4649, 4761, 4762, 4938, 4939, 5117, 5118, 5293, 5294, 5459, 5460, 5461, 5587, 5588 ], "line_end_idx": [ 45, 46, 213, 214, 278, 279, 322, 323, 348, 349, 359, 360, 365, 366, 371, 372, 423, 505, 586, 587, 593, 594, 657, 726, 811, 880, 881, 892, 893, 898, 899, 945, 1105, 1183, 1232, 1233, 1239, 1240, 1308, 1353, 1354, 1361, 1362, 1528, 1529, 1533, 1534, 1591, 1592, 1767, 1768, 1783, 1784, 1800, 1819, 1833, 1853, 1866, 1885, 1886, 1891, 1892, 1955, 1956, 1992, 1993, 2053, 2098, 2099, 2145, 2146, 2225, 2226, 2267, 2268, 2403, 2404, 2411, 2412, 2472, 2473, 2495, 2496, 2515, 2529, 2549, 2550, 2559, 2560, 2681, 2682, 2718, 2719, 2747, 2884, 2995, 2996, 3030, 3031, 3067, 3205, 3206, 3236, 3237, 3279, 3510, 3511, 3537, 3538, 3715, 3781, 3844, 3893, 3894, 3912, 3913, 3958, 4019, 4020, 4021, 4022, 4023, 4024, 4025, 4026, 4202, 4203, 4249, 4274, 4292, 4470, 4471, 4648, 4649, 4761, 4762, 4938, 4939, 5117, 5118, 5293, 5294, 5459, 5460, 5461, 5587, 5588, 5768 ] }
{ "red_pajama_v2": { "ccnet_original_length": 5768, "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.3774940073490143, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01596168987452984, "rps_doc_frac_lines_end_with_ellipsis": 0.0067567601799964905, "rps_doc_frac_no_alph_words": 0.21308858692646027, "rps_doc_frac_unique_words": 0.3670634925365448, "rps_doc_mean_word_length": 4.329365253448486, "rps_doc_num_sentences": 109, "rps_doc_symbol_to_word_ratio": 0.0007980800000950694, "rps_doc_unigram_entropy": 5.300192832946777, "rps_doc_word_count": 1008, "rps_doc_frac_chars_dupe_10grams": 0.01741521991789341, "rps_doc_frac_chars_dupe_5grams": 0.06874427199363708, "rps_doc_frac_chars_dupe_6grams": 0.051787350326776505, "rps_doc_frac_chars_dupe_7grams": 0.042163148522377014, "rps_doc_frac_chars_dupe_8grams": 0.042163148522377014, "rps_doc_frac_chars_dupe_9grams": 0.01741521991789341, "rps_doc_frac_chars_top_2gram": 0.014436299912631512, "rps_doc_frac_chars_top_3gram": 0.01237396989017725, "rps_doc_frac_chars_top_4gram": 0.025206230580806732, "rps_doc_books_importance": -477.5892333984375, "rps_doc_books_importance_length_correction": -477.5892333984375, "rps_doc_openwebtext_importance": -232.46913146972656, "rps_doc_openwebtext_importance_length_correction": -232.46913146972656, "rps_doc_wikipedia_importance": -211.3258819580078, "rps_doc_wikipedia_importance_length_correction": -211.3258819580078 }, "fasttext": { "dclm": 0.8614693880081177, "english": 0.8672841191291809, "fineweb_edu_approx": 2.5790164470672607, "eai_general_math": 0.4941464066505432, "eai_open_web_math": 0.2465229630470276, "eai_web_code": 0.09913892298936844 } }
{ "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": "595.79", "labels": { "level_1": "Science and Natural history", "level_2": "Zoology", "level_3": "Arthropoda and Worms" } } }, "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": "-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": "3", "label": "Academic Writing" } }, "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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }
e3c4dd7183f5f028f56d5a7988cc68c4
3,872,857,292,200,175,600
Kennwortmanager KeePassX Weiterentwicklung der Version 1 You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long. This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests. Β  Β  Β  Β  Β  keepassx1/src/res/docs/quickstart.html 249 lines 9.4 KiB <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html> <head> <title>KeePassX Quick-start Guide</title> </head> <body> <a name="top" /> <h1>KeePassX Quick-start Guide</h1> <p> This guide helps you to manage your passwords efficiently and securely with KeePassX. </p> <a name="startup" /> <h2>Starting up</h2> <p> After starting KeePassX for the first time, you are presented with the main window with no open database file. If you have used KeePassX (or KeePass Classic on Windows) previously, you can open your existing database. Otherwise we begin with creating a new password database. </p> <a name="database_create" /> <h2>Creating a new password database</h2> <p> KeePassX stores your password entries into a password database file when the it's not running. To create a new password database, click the <span class="gui">&quot;New Database&quot;</span> icon on the program toolbar (it is the first icon from the left on the toolbar). </p> <p> Second, you need to set the <b>master key</b> for the password database. This key is used to encrypt (ie. lock) the password database so it cannot be read by anybody else but you. The master key can be a password or a key file or both. If you check both, you must provide both the password and the key file to every time you want to unlock the database. </p> <p> If you decide to use a password, <a href="http://www.us-cert.gov/cas/tips/ST04-002.html"> choose and protect it carefully</a> <img src="external.png" />. The password should be strong, ie. long enough (at least 8 characters) and preferably contain lower and uppercase characters, numbers and special characters (e.g. !#?). You should also memorize the password well, because if you forget it, there is no way retrieving it later from the locked database. You will be asked to give the password twice to ensure that there is no typing errors in the password. </p> <p> The key file can be any file on your computer, e.g. a picture or a text document. You can also create a randomly-generated key file by first selecting the key file check box and clicking <span class="gui">&quot;Generate Key File...&quot;</span>. You can store the key file for example on a USB memory stick, to keep it with you everywhere. </p> <a name="password_add" /> <h2>Adding password entries</h2> <p> After you have created or opened a database, you can add password entries to the database. A password entry essentially consists of a title, user name and password. It may have other entries as well, such as URL (Internet link) and comments. To add a new password entry, select a group from the list on the left first, then click the <span class="gui"> &quot;Add New Entry&quot;</span> icon on the program toolbar. </p> <p> In the &quot;New Entry&quot; dialog you can enter the information you want to into respective text boxes. If you are creating a new account to e.g. a web forum, you can use the password generator to generate strong random passwords for you. </p> <a name="database_save" /> <h2>Saving the database</h2> <p> If you have added or edited entries in your database, they are not automatically save to the database file by default. You can save the database by clicking the <span class="gui"> &quot;Save Database&quot;</span> icon. </p> <p> You may also want to enable <span class="gui">&quot;Automatically save database after every change&quot;</span> option from the <span class="gui">&quot;Extras&quot;</span> &gt; <span class="gui">&quot;Settings...&quot;</span> &gt; <span class="gui">&quot;General (2)&quot;</span> page. (On OS X, the page is found from <span class="gui">&quot;KeePassX&quot;</span> (Application menu) &gt; <span class="gui">&quot;Preferences&quot;</span>.) </p> <a name="database_open" /> <h2>Opening a database</h2> <p> By default, on next startup, KeePassX opens a <span class="gui">&quot;Enter Master Key&quot;</span> dialog for the last used password database. If you wish to open another password database, click <span class="gui">&quot;Cancel&quot;</span> and click <span class="gui">&quot;Open Database&quot;</span> icon on the program toolbar and select the wanted password database file from the file system. You can, of course, do this at any point when the KeePassX main window is active. </p> <a name="password_edit" /> <h2>Editing and removing password entries</h2> <p> If you wish to edit a password entry, you can do so by double-clicking on the entry title, or by selecting the entry and then clicking the <span class="gui">&quot;View/Edit Entry&quot;</span> icon on the program toolbar. </p> <p> To delete a password entry, first select the entry and click <span class="gui">&quot;Delete Entry&quot;</span> icon on the program toolbar or hit <tt>Ctrl-D</tt> (<tt>Cmd+D</tt> on OS X) on the keyboard. </p> <a name="password_copy" /> <h2>Copying password (and user name) to the clipboard</h2> <p> You can copy the currently selected password by hitting <tt>Ctrl-C</tt> (<tt>Cmd-C</tt> on OS X) and user name with <tt>Ctrl-B</tt> (<tt>Cmd-B</tt> on OS X) on the keyboard. Then you can hit <tt>Ctrl-V</tt> (<tt>Cmd-V</tt> on OS X) to paste the password or username to any program that supports pasting from the clipboard. </p> <a name="autotype" /> <h2>Setup Auto-Type (currently Linux and OS X only)</h2> <p> <b>Auto-Type</b> is a feature that allows you to e.g. log in to web page by hitting only one key combination. KeePassX does the rest of the typing for you. Auto-Type reads the title of currently active window on your screen and matches it to the configured database entries. If a matching window title is found from the password database, it executes a predefined key sequence (by default your username, <tt>TAB</tt>, password, <tt>ENTER</tt>) in the active window. This feature is currently available in the Linux and OS X versions only. </p> <p> To enable Auto-Type, first go to <span class="gui">&quot;Extras&quot;</span> &gt; <span class="gui">&quot;Settings...&quot;</span> &gt; <span class="gui">&quot;Advanced&quot;</span> page and set the <span class="gui">&quot;Global Auto-Type Shortcut&quot;</span> by clicking the text box and typing the desired keyboard shortcut (e.g. <tt>Ctrl-Shift-N</tt>). Click <span class="gui">&quot;OK&quot;</span> to exit the dialog. </p> <p> Then, for example, open the web page where you want to be able to log in with Auto-Type. Let's for example open Google.com into Firefox and try to do automated search with Auto-Type. Go to Google.com in Firefox and you'll notice that your window title is now &quot;Google - Mozilla Firefox&quot; </p> <p> Now, create new password entry, that contains user name &quot;test&quot;. Then, click the small <span class="gui">&quot;Tools&quot;</span> button at the bottom of the <span class="gui">&quot;New Entry&quot;</span> dialog, and select <span class="gui">&quot;Auto-Type: Select target window&quot;</span> Select &quot;Google - Mozilla Firefox&quot; from the dropdown menu and click <span class="gui">&quot;OK&quot;</span>. You should see now a new line in the <span class="gui">&quot;Comment:&quot;</span> box, which reads:<br/><br/> <tt>Auto-Type-Window: Google - Mozilla Firefox</tt><br/><br/> Now you have associated that window title to this entry. </p> <p> Finally, let's customize the Auto-Type key sequence to just enter your username and hit <tt>ENTER</tt>. Click again <span class="gui">&quot;Tools&quot;</span> and select <span class="gui">&quot;Auto-Type: Customize Sequence&quot;</span>. Now there's another new line in the <span class="gui">&quot;Comment:&quot;</span> box, which reads:<br/><br/> <tt>Auto-Type: {USERNAME}{TAB}{PASSWORD}{ENTER}</tt><br/><br/> Change this line to:<br/><br/> <tt>Auto-Type: {USERNAME}{ENTER}</tt><br/><br/> So that it would just type in your username and hit <tt>ENTER</tt>. Click <span class="gui">&quot;OK&quot;</span> to save the entry. </p> <p> Now, you can test the Auto-Type by returning to the Firefox window and hitting the global Auto-Type keyboard shortcut (e.g. <tt>Ctrl-Shift-N</tt>) in it. If everything went correctly, KeePassX should now enter &quot;test&quot; in the search box and start the search query by hitting <tt>ENTER</tt>. </p> <p> By modifing the Auto-Type key sequence you can tailor Auto-Type to suit almost every web login page you'll enter. </p> <p> For OS X, there are two additional Auto-Type elements: <tt>{CLEARFIELD}</tt> and <tt>{MACSENDKEYCODES}</tt>. <tt>{CLEARFIELD}</tt> clears the typing target to ensure it is empty before typing into it. <tt>{MACSENDKEYCODES}</tt> should be put at the beginning of an Auto-Type string to force the use of a more primitive typing mechanism when the normal mechanism fails. A known case where this is required is a web site where the login dialog is implemented in flash. The following is an example:<br><br> <tt>{MACSENDKEYCODES}{USERNAME}{TAB}{PASSWORD}{ENTER}</tt> </p> <p> Also note that the use of <tt>{CLEARFIELD}</tt> may require the user to define a somewhat larger Key Stroke Delay in Preferences when specified for a site with flash-based login fields. </p> <!-- <a name="" /> <h2></h2> <p> </p> --> </body> </html>
{ "url": "https://git.piratenpartei-sh.de/thooge/keepassx1/src/branch/master/src/res/docs/quickstart.html", "source_domain": "git.piratenpartei-sh.de", "snapshot_id": "CC-MAIN-2024-18", "warc_metadata": { "Content-Length": "128123", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HR36V5HUSFGIV263TKKHWC65OGLYKQAM", "WARC-Concurrent-To": "<urn:uuid:8dd4a207-599b-4cc2-999a-9316e425b90b>", "WARC-Date": "2024-04-19T00:39:09Z", "WARC-IP-Address": "81.7.3.185", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:Q6GATDHB5DTFFPIEXEKWUGK37LHNCR5L", "WARC-Record-ID": "<urn:uuid:848ab922-5321-46f3-9372-b72d299a1d68>", "WARC-Target-URI": "https://git.piratenpartei-sh.de/thooge/keepassx1/src/branch/master/src/res/docs/quickstart.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:cb070c94-65a6-4b43-9cfb-a95507a9d6b6>" }, "warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-234\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, 57, 201, 303, 305, 307, 309, 311, 313, 352, 353, 363, 371, 372, 429, 482, 489, 496, 538, 546, 553, 570, 606, 610, 646, 696, 701, 722, 743, 747, 795, 835, 884, 936, 984, 1023, 1028, 1057, 1099, 1103, 1146, 1198, 1243, 1293, 1352, 1374, 1379, 1383, 1437, 1495, 1549, 1596, 1619, 1673, 1737, 1742, 1746, 1779, 1836, 1900, 1947, 2004, 2069, 2121, 2175, 2219, 2261, 2304, 2309, 2313, 2378, 2395, 2454, 2500, 2559, 2621, 2653, 2658, 2684, 2717, 2721, 2770, 2812, 2862, 2912, 2963, 3012, 3045, 3074, 3136, 3141, 3145, 3195, 3251, 3306, 3360, 3386, 3391, 3418, 3447, 3451, 3505, 3570, 3631, 3670, 3675, 3679, 3700, 3759, 3807, 3856, 3910, 3965, 3998, 4068, 4119, 4124, 4151, 4179, 4183, 4229, 4283, 4339, 4380, 4424, 4490, 4544, 4600, 4662, 4667, 4694, 4741, 4745, 4794, 4836, 4884, 4942, 4966, 4971, 4975, 5020, 5091, 5162, 5179, 5184, 5211, 5270, 5274, 5346, 5422, 5481, 5540, 5597, 5602, 5624, 5681, 5685, 5746, 5795, 5857, 5909, 5960, 6014, 6062, 6132, 6187, 6224, 6229, 6233, 6266, 6315, 6369, 6420, 6495, 6543, 6591, 6657, 6662, 6666, 6713, 6761, 6806, 6852, 6895, 6962, 6967, 6971, 7008, 7045, 7110, 7185, 7273, 7344, 7416, 7502, 7564, 7621, 7626, 7630, 7682, 7734, 7789, 7868, 7955, 7978, 8041, 8072, 8120, 8188, 8253, 8258, 8262, 8314, 8371, 8416, 8472, 8534, 8561, 8566, 8570, 8624, 8684, 8689, 8693, 8774, 8859, 8942, 9019, 9098, 9174, 9197, 9256, 9261, 9265, 9344, 9420, 9451, 9456, 9461, 9475, 9485, 9489, 9494, 9498, 9506 ], "line_end_idx": [ 57, 201, 303, 305, 307, 309, 311, 313, 352, 353, 363, 371, 372, 429, 482, 489, 496, 538, 546, 553, 570, 606, 610, 646, 696, 701, 722, 743, 747, 795, 835, 884, 936, 984, 1023, 1028, 1057, 1099, 1103, 1146, 1198, 1243, 1293, 1352, 1374, 1379, 1383, 1437, 1495, 1549, 1596, 1619, 1673, 1737, 1742, 1746, 1779, 1836, 1900, 1947, 2004, 2069, 2121, 2175, 2219, 2261, 2304, 2309, 2313, 2378, 2395, 2454, 2500, 2559, 2621, 2653, 2658, 2684, 2717, 2721, 2770, 2812, 2862, 2912, 2963, 3012, 3045, 3074, 3136, 3141, 3145, 3195, 3251, 3306, 3360, 3386, 3391, 3418, 3447, 3451, 3505, 3570, 3631, 3670, 3675, 3679, 3700, 3759, 3807, 3856, 3910, 3965, 3998, 4068, 4119, 4124, 4151, 4179, 4183, 4229, 4283, 4339, 4380, 4424, 4490, 4544, 4600, 4662, 4667, 4694, 4741, 4745, 4794, 4836, 4884, 4942, 4966, 4971, 4975, 5020, 5091, 5162, 5179, 5184, 5211, 5270, 5274, 5346, 5422, 5481, 5540, 5597, 5602, 5624, 5681, 5685, 5746, 5795, 5857, 5909, 5960, 6014, 6062, 6132, 6187, 6224, 6229, 6233, 6266, 6315, 6369, 6420, 6495, 6543, 6591, 6657, 6662, 6666, 6713, 6761, 6806, 6852, 6895, 6962, 6967, 6971, 7008, 7045, 7110, 7185, 7273, 7344, 7416, 7502, 7564, 7621, 7626, 7630, 7682, 7734, 7789, 7868, 7955, 7978, 8041, 8072, 8120, 8188, 8253, 8258, 8262, 8314, 8371, 8416, 8472, 8534, 8561, 8566, 8570, 8624, 8684, 8689, 8693, 8774, 8859, 8942, 9019, 9098, 9174, 9197, 9256, 9261, 9265, 9344, 9420, 9451, 9456, 9461, 9475, 9485, 9489, 9494, 9498, 9506, 9513 ] }
{ "red_pajama_v2": { "ccnet_original_length": 9513, "ccnet_original_nlines": 244, "rps_doc_curly_bracket": 0.0033638200256973505, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2645992934703827, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02537252940237522, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.32380184531211853, "rps_doc_frac_unique_words": 0.33086052536964417, "rps_doc_mean_word_length": 5.190652847290039, "rps_doc_num_sentences": 92, "rps_doc_symbol_to_word_ratio": 0.0016109499847516418, "rps_doc_unigram_entropy": 5.250284194946289, "rps_doc_word_count": 1348, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07860512286424637, "rps_doc_frac_chars_dupe_6grams": 0.07860512286424637, "rps_doc_frac_chars_dupe_7grams": 0.04802057892084122, "rps_doc_frac_chars_dupe_8grams": 0.02801200933754444, "rps_doc_frac_chars_dupe_9grams": 0.017150210216641426, "rps_doc_frac_chars_top_2gram": 0.012862659990787506, "rps_doc_frac_chars_top_3gram": 0.006431329995393753, "rps_doc_frac_chars_top_4gram": 0.01143347006291151, "rps_doc_books_importance": -1042.2293701171875, "rps_doc_books_importance_length_correction": -1042.2293701171875, "rps_doc_openwebtext_importance": -701.1267700195312, "rps_doc_openwebtext_importance_length_correction": -701.1267700195312, "rps_doc_wikipedia_importance": -465.5957946777344, "rps_doc_wikipedia_importance_length_correction": -465.5957946777344 }, "fasttext": { "dclm": 0.11705899238586426, "english": 0.7563261389732361, "fineweb_edu_approx": 2.2264955043792725, "eai_general_math": 0.18369752168655396, "eai_open_web_math": 0.1399756669998169, "eai_web_code": 0.5213780403137207 } }
{ "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": "005.82", "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": "1", "label": "Leftover HTML" }, "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": "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,359,282,950,657,512,000
tirsdag 16. februar 2010 Minority Report computer interface designer demos the real thing (video) At the big-think, big-demo TED conference in Long Beach last week, MIT Media Lab alumnus John Underkoffler demonstrated a real working version of the memorable grab-it-and-throw-it computer interface he designed for Tom Cruise in the hit science fiction movie Minority Report. One reason Cruise’s gesture-based interface was so striking was that it was based on Underkoffler’s serious deep-end work in user interfaces. The g-speak Spatial Operating Environment requires gloves much like the ones Cruise wore as Precrime murder-prevention officer John Anderton. g-speak’s website is hard to follow if you don’t already work in the field. Here’s my edit of their description of what the Spatial Operating Environment does, and why it’s useful: Modern computers have high-definition, large-display graphical output. By contrast, the old mouse and keyboard are very narrow channels for input by humans. Gestural input and output lets humans input data and commands to a computer system at a much higher rate than a keyboard and mouse ever could. Where does gestural input win big over a mouse? Gestural input is measurably more efficient at performing complex navigation, sorting and selection tasks. (Notice they didn’t say it’s faster at letting you compose a message than a QWERTY keyboard. Better speech recognition will probably be the solution for high-speed word input.) Every graphical and input object in a g-speak environment has real-world spatial identity and position. Anything on-screen can be manipulated directly. For a g-speak user, β€œpointing” is literal. You reach out with the special gloves and point at, or touch, or grab, or manipulate objects visible in the display. g-speak is designed to work on all kinds of displays. Wall-sized 3D screens can co-exist with desktop monitors, table-top screens and hand-held devices. Every display can be used simultaneously. g-speak moves data selectively to the displays that are most appropriate. If you think gesture controls are hot, don’t miss Damian Rollison’s giant VentureBeat post on 16 companies building gesture-control tech. [Photo: TED/James Duncan Davidson via The New York Times] Ingen kommentarer: Legg inn en kommentar
{ "url": "http://norgenews.blogspot.com/2010/02/minority-report-computer-interface.html", "source_domain": "norgenews.blogspot.com", "snapshot_id": "crawl=CC-MAIN-2018-30", "warc_metadata": { "Content-Length": "57936", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DSYCR3ASNH2PHRWXPH6MPCJODCU5N6JG", "WARC-Concurrent-To": "<urn:uuid:9e297d4d-1c99-4fc9-8480-f4dc9cb78a45>", "WARC-Date": "2018-07-19T05:53:51Z", "WARC-IP-Address": "172.217.7.161", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:NBZ2XXURKT76PJFAJV4HACPCYMGBIQT6", "WARC-Record-ID": "<urn:uuid:5205dcaa-02f1-425b-8da7-b68dc81d64bb>", "WARC-Target-URI": "http://norgenews.blogspot.com/2010/02/minority-report-computer-interface.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:07425330-0bbf-4000-a06d-f739402c589f>" }, "warc_info": "robots: classic\r\nhostname: ip-10-183-42-153.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, 25, 26, 99, 100, 377, 661, 842, 999, 1142, 1297, 1474, 1786, 2055, 2193, 2251, 2252, 2271, 2272 ], "line_end_idx": [ 25, 26, 99, 100, 377, 661, 842, 999, 1142, 1297, 1474, 1786, 2055, 2193, 2251, 2252, 2271, 2272, 2293 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2293, "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.3146551847457886, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.010775860399007797, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1767241358757019, "rps_doc_frac_unique_words": 0.6590257883071899, "rps_doc_mean_word_length": 5.366762161254883, "rps_doc_num_sentences": 22, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.191715240478516, "rps_doc_word_count": 349, "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.00800853967666626, "rps_doc_frac_chars_top_3gram": 0.028830749914050102, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -253.79209899902344, "rps_doc_books_importance_length_correction": -253.79209899902344, "rps_doc_openwebtext_importance": -119.99300384521484, "rps_doc_openwebtext_importance_length_correction": -119.99300384521484, "rps_doc_wikipedia_importance": -73.02330780029297, "rps_doc_wikipedia_importance_length_correction": -73.02330780029297 }, "fasttext": { "dclm": 0.22514718770980835, "english": 0.8838858604431152, "fineweb_edu_approx": 2.187579870223999, "eai_general_math": 0.17222797870635986, "eai_open_web_math": 0.054001931101083755, "eai_web_code": 0.019342010840773582 } }
{ "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": "791.4372", "labels": { "level_1": "Arts", "level_2": "Amusements and Recreation", "level_3": "" } } }, "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": "1", "label": "News/Editorial" }, "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": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "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": "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
-7,295,809,349,029,438,000
Blogs Drone On Well, I finally built me a drone so's I could fit in with all the cool kids. What follows is a short description of my experience with helpful links for someone else who would like to build a substantially similar quad. I built basically the cheapest quadcopter you could use for anything more than just crashing into stuff, a SK450 whose parts were primarily sourced from eBay β€” and usually with the very cheapest parts. Keep that command running - keeprunning I wanted to keep some programs running, which is to say restart them if they crashed, but I also wanted them to be able to exit normally. The platform is Linux, the problem is compiz, the solution is a very small shell script. Surely the internets will let me know if there is something grossly wrong with it. This script is not meant for long-running daemons, there are plenty of tools for that already. Garbage Computers are Great! For all my life, most of my computers have been hand-me-downs or upgrades. I've built a handful of PCs from scratch, but even most of the ones I built with new processors and motherboards had some hand-me-down parts. But it seems like recently a threshold was crossed where the computers available to just anyone (and not someone who knows "someone") for basically nothing began to be pretty good. CarPC power: via relay When you're putting together a so-called "Car PC", by which we usually mean a contemporary ATX-derivative computer installed into an automobile, you have a few hurdles to cross. The enclosure, interface, storage devices, and even the power management all become special problems. The power problems can largely be solved through the use of a Wide Input picoPSU, but what about systems outside of a 120W envelope, or systems where you need to switch more than the PC power? The answer is just one typical automotive relay. CMS users don't care about Mobilegeddon Right now, there is a massive flap occurring in the blogosphere which is known as "Mobilegeddon". Google is going to increase the relative ranking of pages which are available in both desktop and mobile themes, as opposed to only one or the other. This has got a lot of incompetent amateurs worried about whether their sites will vanish off the search landscape, but any Drupal (or other adequate CMS) user can solve this problem with a few clicks. Windows XP: vmware to KVM migration Like many others, I've become somewhat dependent on virtualization to reduce the number of computers and windows installs I have in my home. I recently took another stab at using open source virtualization, and I've had some success with WebVirtMgr, a libvirt-based VM management solution for Linux. This made me want to migrate some XP guests from vmware player to KVM, and I'm happy to say that this is relatively simple today once you figure out the precise sequence of events. lspci for linux as a shell script I needed a quick version of lspci for looking at some linux systems without pciutils, so I threw this one together in a couple of minutes. It's very simple, it doesn't tell you what the devices are, but it does tell you what kind of devices they are and what their PCI ID is. Then you can go look that up online to figure out what they are. It wouldn't be a horrible stretch to add support for the pci.ids file, but it wasn't necessary for my purposes. Wrong drive letter and can't boot Windows 7 after disk swap I just got a nice Samsung EVO 850 SSD, and therefore got the chance to remove two spinning disks from my PC. But in order to make this happen, I had to move Windows to the SSD I had in my PC already. So I mounted the new SSD and formatted it ext4, and transferred Linux without a hitch. Then I booted up and used gparted to transfer Windows to the old SSD I'd just vacated, and it wouldn't boot. I thought these problems were over? I used my Linux install (with vmware player) to fix the problem just as I had used it (with gparted) to copy Windows from one volume to another. Nexus 4 to Moto G: What's it like? My LG E960, better known as the Google Nexus 4, decided to let me down. Around the same time, the radio stopped working properly and the digitizer stopped recognizing touches right in a fairly important spot β€” above the "e" key. Clearly it was time to take a right-hand turn and buy a new device from a different manufacturer. At just this moment, Amazon offered a discount on the second-generation (2014) Moto G, and the sale was made. Pages Subscribe to RSS - blogs
{ "url": "http://hyperlogos.org/blog?page=2", "source_domain": "hyperlogos.org", "snapshot_id": "crawl=CC-MAIN-2017-39", "warc_metadata": { "Content-Length": "40860", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JQJJONCLO5CA3YUCGATR3I34IN6ATAR3", "WARC-Concurrent-To": "<urn:uuid:831717dd-1a7b-4a66-a48c-bab4cafa48ad>", "WARC-Date": "2017-09-25T20:29:05Z", "WARC-IP-Address": "216.51.232.98", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5OD7TQGLT3DQV6VM7GB7HDEYEKJXEZQR", "WARC-Record-ID": "<urn:uuid:f2fff326-6e19-47e3-b0cb-34223913a82f>", "WARC-Target-URI": "http://hyperlogos.org/blog?page=2", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2b780a10-df95-4717-83b7-6b9c2b0501d0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-234-233-162.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, 6, 7, 16, 17, 439, 440, 480, 481, 886, 887, 916, 917, 1315, 1316, 1339, 1340, 1862, 1863, 1903, 1904, 2353, 2354, 2390, 2391, 2872, 2873, 2907, 2908, 3047, 3048, 3362, 3363, 3423, 3424, 4001, 4002, 4037, 4038, 4475, 4476, 4482, 4483 ], "line_end_idx": [ 6, 7, 16, 17, 439, 440, 480, 481, 886, 887, 916, 917, 1315, 1316, 1339, 1340, 1862, 1863, 1903, 1904, 2353, 2354, 2390, 2391, 2872, 2873, 2907, 2908, 3047, 3048, 3362, 3363, 3423, 3424, 4001, 4002, 4037, 4038, 4475, 4476, 4482, 4483, 4507 ] }
{ "red_pajama_v2": { "ccnet_original_length": 4507, "ccnet_original_nlines": 42, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.47089946269989014, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.051851850003004074, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.13227513432502747, "rps_doc_frac_unique_words": 0.4956304728984833, "rps_doc_mean_word_length": 4.448189735412598, "rps_doc_num_sentences": 38, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.467040538787842, "rps_doc_word_count": 801, "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.0025259600952267647, "rps_doc_frac_chars_top_3gram": 0.007858550176024437, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -487.28460693359375, "rps_doc_books_importance_length_correction": -487.28460693359375, "rps_doc_openwebtext_importance": -305.5205078125, "rps_doc_openwebtext_importance_length_correction": -305.5205078125, "rps_doc_wikipedia_importance": -207.72686767578125, "rps_doc_wikipedia_importance_length_correction": -207.72686767578125 }, "fasttext": { "dclm": 0.06724733114242554, "english": 0.9740052223205566, "fineweb_edu_approx": 1.5922900438308716, "eai_general_math": 0.7897993326187134, "eai_open_web_math": 0.27693355083465576, "eai_web_code": 0.3313731551170349 } }
{ "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": "629.117", "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": "9", "label": "Personal/Misc" }, "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": "16", "label": "Personal Blog" }, "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
5,915,462,743,057,457,000
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. Say there is such table: mysql> SELECT * FROM tags; +---------+--------+ | post_id | tag_id | +---------+--------+ | 1 | 2 | | 1 | 3 | | 1 | 1 | | 2 | 1 | | 2 | 2 | +---------+--------+ 5 rows in set (0.00 sec) Field names are pretty self-explanatory. I want to select post_ids that have both 1 and 3 tag_ids, so in this example it's only 1. I thought of something like SELECT post_id FROM tags GROUP BY post_id HAVING ... After having I'd like to list tag_ids that are present in this group. How do I do that? share|improve this question add comment 6 Answers up vote 3 down vote accepted If post_id and tag_id both have an unique constraint, that should work too: SELECT post_id FROM tags WHERE tag_id = 1 OR tag_id = 3 GROUP BY post_id HAVING count(*) = 2; If there aren't any unique constraints try: SELECT DISTINCT post_id FROM tags WHERE tag_id = 1 OR tag_id = 3 GROUP BY post_id HAVING count(DISTINCT tag_id) = 2; share|improve this answer Β  Thanks, I decided to go with SELECT post_id FROM tags WHERE tag_id IN (1,3) GROUP BY post_id HAVING COUNT(1) = 2;, which scales well and is the closest to your solution –  htf Jun 21 '10 at 10:09 add comment You could try a self join (N tag_id -> N join) but probably it's not fast SELECT t1.post_id FROM tags t1 INNER JOIN tags t2 ON t1.post_id = t2.post_id WHERE t1.tag_id = 1 AND t2.tag_id = 3 share|improve this answer Β  +1 but i'll add a select distinct to your request. –  Fred Jun 21 '10 at 9:41 1 Β  Doesn't really scale for an arbitrary amount of tags though. –  Martin Smith Jun 21 '10 at 9:42 add comment I've made some assumptions about your other tables. (i.e. that you have a table for posts that I have called posts and one with tag_id as the PK which I have called tag_table to avoid a nameclash with the posts/tags table that I can see you already call tags) You want posts where there does not exist a tag in the list {1,3} for which there does not exist a matching record with the corresponding post_id/tag_id so you can use a double NOT EXISTS construct as below. SELECT post_id FROM posts p WHERE NOT EXISTS (SELECT * FROM tag_table tt WHERE tag_id IN (1,3) AND NOT EXISTS (SELECT * FROM tags t WHERE t.tag_id = tt.tag_id and p.post_id = t.post_id) ) Another alternative approach is to use Group By and Count. A review of approaches to this problem is here. share|improve this answer Β  +1 for the awesomest link) –  htf Jun 21 '10 at 10:11 add comment SELECT post_id FROM ( SELECT post_id, count(tag_id) AS counter FROM tags WHERE tag_id IN (1,3) GROUP BY post_id ) WHERE counter = 2 Use GROUP_CONCAT() for the second part of your question SELECT post_id, GROUP_CONCAT(tag_id ORDER BY tag_id ASC SEPARATOR ',') FROM tags share|improve this answer add comment How about SELECT * FROM tags WHERE post_id in (SELECT post_id AS pid FROM tags WHERE 1 IN (SELECT tag_id FROM tags WHERE post_id = pid) AND 3 IN (SELECT tag_id FROM tags WHERE post_id = pid) ); share|improve this answer add comment WHERE version of @Keeper's solution SELECT DISTINCT t1.post_id FROM tags t1, tags t2 WHERE t1.post_id = t2.post_id AND t1.tag_id = 1 AND t2.tag_id = 3 share|improve this answer Β  Don't think that the second clause of your OR is useful. –  Fred Jun 21 '10 at 9:45 Β  @Fred hmm.. yeah, you're right - will update –  Amarghosh Jun 21 '10 at 9:49 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://stackoverflow.com/questions/3083409/mysql-how-to-select-groups-having-certain-values", "source_domain": "stackoverflow.com", "snapshot_id": "crawl=CC-MAIN-2014-10", "warc_metadata": { "Content-Length": "82233", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DB5PVVWFACUWLU5TSX75J7KTGPPY3C3U", "WARC-Concurrent-To": "<urn:uuid:7806f069-0d3e-49e2-b547-7b956bde5ed9>", "WARC-Date": "2014-03-09T21:57:31Z", "WARC-IP-Address": "198.252.206.140", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:MEOAWLUYYOA4Z3AXK5GSYU442KZJXW3B", "WARC-Record-ID": "<urn:uuid:3b4e2d62-d91d-4127-bfed-18f485d7cb0c>", "WARC-Target-URI": "http://stackoverflow.com/questions/3083409/mysql-how-to-select-groups-having-certain-values", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:98d2b1b7-8ca8-49ab-98b8-93b39cbfb888>" }, "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, 183, 184, 211, 232, 253, 274, 295, 316, 337, 358, 379, 400, 425, 426, 726, 727, 755, 767, 768, 778, 779, 808, 809, 885, 886, 902, 913, 945, 963, 984, 985, 1029, 1030, 1055, 1066, 1098, 1116, 1151, 1177, 1179, 1375, 1387, 1388, 1462, 1463, 1482, 1542, 1580, 1606, 1608, 1686, 1690, 1786, 1798, 1799, 2059, 2060, 2268, 2269, 2284, 2297, 2315, 2347, 2373, 2392, 2422, 2462, 2501, 2507, 2508, 2615, 2616, 2642, 2644, 2698, 2710, 2725, 2750, 2791, 2812, 2844, 2871, 2880, 2899, 2900, 2956, 2957, 2973, 3035, 3047, 3073, 3085, 3086, 3096, 3097, 3107, 3118, 3136, 3162, 3176, 3237, 3295, 3300, 3326, 3338, 3339, 3375, 3376, 3404, 3426, 3433, 3465, 3499, 3525, 3527, 3611, 3613, 3690, 3702, 3703, 3715, 3716, 3718, 3726, 3727, 3805, 3806 ], "line_end_idx": [ 25, 157, 158, 183, 184, 211, 232, 253, 274, 295, 316, 337, 358, 379, 400, 425, 426, 726, 727, 755, 767, 768, 778, 779, 808, 809, 885, 886, 902, 913, 945, 963, 984, 985, 1029, 1030, 1055, 1066, 1098, 1116, 1151, 1177, 1179, 1375, 1387, 1388, 1462, 1463, 1482, 1542, 1580, 1606, 1608, 1686, 1690, 1786, 1798, 1799, 2059, 2060, 2268, 2269, 2284, 2297, 2315, 2347, 2373, 2392, 2422, 2462, 2501, 2507, 2508, 2615, 2616, 2642, 2644, 2698, 2710, 2725, 2750, 2791, 2812, 2844, 2871, 2880, 2899, 2900, 2956, 2957, 2973, 3035, 3047, 3073, 3085, 3086, 3096, 3097, 3107, 3118, 3136, 3162, 3176, 3237, 3295, 3300, 3326, 3338, 3339, 3375, 3376, 3404, 3426, 3433, 3465, 3499, 3525, 3527, 3611, 3613, 3690, 3702, 3703, 3715, 3716, 3718, 3726, 3727, 3805, 3806, 3896 ] }
{ "red_pajama_v2": { "ccnet_original_length": 3896, "ccnet_original_nlines": 130, "rps_doc_curly_bracket": 0.0005133500089868903, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.24231678247451782, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.13002364337444305, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3014184534549713, "rps_doc_frac_unique_words": 0.3804877996444702, "rps_doc_mean_word_length": 4.341463565826416, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0.0011820299550890923, "rps_doc_unigram_entropy": 4.93007230758667, "rps_doc_word_count": 615, "rps_doc_frac_chars_dupe_10grams": 0.03895131126046181, "rps_doc_frac_chars_dupe_5grams": 0.18651685118675232, "rps_doc_frac_chars_dupe_6grams": 0.14906367659568787, "rps_doc_frac_chars_dupe_7grams": 0.12209738045930862, "rps_doc_frac_chars_dupe_8grams": 0.12209738045930862, "rps_doc_frac_chars_dupe_9grams": 0.06516853719949722, "rps_doc_frac_chars_top_2gram": 0.04194756969809532, "rps_doc_frac_chars_top_3gram": 0.03895131126046181, "rps_doc_frac_chars_top_4gram": 0.020224720239639282, "rps_doc_books_importance": -327.9773254394531, "rps_doc_books_importance_length_correction": -327.9773254394531, "rps_doc_openwebtext_importance": -224.8041534423828, "rps_doc_openwebtext_importance_length_correction": -224.8041534423828, "rps_doc_wikipedia_importance": -126.46458435058594, "rps_doc_wikipedia_importance_length_correction": -126.46458435058594 }, "fasttext": { "dclm": 0.8291615843772888, "english": 0.7980822920799255, "fineweb_edu_approx": 0.9453698992729187, "eai_general_math": 0.009616260416805744, "eai_open_web_math": 0.08715713024139404, "eai_web_code": 0.006443200167268515 } }
{ "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": "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": "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
6,129,714,596,294,449,000
IRC log of css on 2011-02-16 Timestamps are in UTC. 16:42:21 [RRSAgent] RRSAgent has joined #css 16:42:21 [RRSAgent] logging to http://www.w3.org/2011/02/16-css-irc 16:42:28 [glazou] Zakim, this will be Style 16:42:28 [Zakim] ok, glazou; I see Style_CSS FP()12:00PM scheduled to start in 18 minutes 16:42:33 [glazou] RRSAgent, make logs public 16:42:38 [glazou] Zakim, code ? 16:42:39 [Zakim] the conference code is 78953 (tel:+1.617.761.6200 tel:+33.4.26.46.79.03 tel:+44.203.318.0479), glazou 16:43:52 [dbaron] dbaron has joined #css 16:57:30 [oyvind] oyvind has joined #css 16:57:38 [Zakim] Style_CSS FP()12:00PM has now started 16:57:41 [Zakim] +[Microsoft] 16:57:45 [Zakim] +??P0 16:57:55 [glazou] Zakim, ??P0 is me 16:57:55 [Zakim] +glazou; got it 16:58:09 [arronei] zakim, Microsoft is me 16:58:09 [Zakim] +arronei; got it 16:59:57 [TabAtkins_] TabAtkins_ has joined #css 17:00:01 [Zakim] + +1.858.216.aaaa 17:00:11 [plinss] zakim, aaaa is me 17:00:11 [Zakim] +plinss; got it 17:00:22 [smfr] smfr has joined #css 17:00:35 [Zakim] +smfr 17:00:38 [Zakim] +[Microsoft] 17:00:41 [alexmog] alexmog has joined #css 17:00:41 [Zakim] +TabAtkins_ 17:01:07 [johnjan] johnjan has joined #css 17:01:13 [cesar] cesar has joined #css 17:01:14 [johnjan] zakim, microsoft is johnjan 17:01:14 [Zakim] +johnjan; got it 17:02:22 [sylvaing] sylvaing has joined #css 17:02:22 [Zakim] + +1.206.324.aabb 17:02:28 [Zakim] +fantasai 17:03:09 [Zakim] +Bert 17:03:36 [Zakim] + +46.0.94.0.aacc 17:03:55 [Zakim] +??P24 17:04:01 [Zakim] +??P25 17:04:11 [kojiishi] zakim, ??p24 is me 17:04:11 [Zakim] +kojiishi; got it 17:04:14 [cesar] Zakim, aacc is me. 17:04:14 [Zakim] +cesar; got it 17:04:15 [Zakim] -kojiishi 17:04:40 [TabAtkins_] ScribeNick: TabAtkins_ 17:04:48 [Zakim] +??P24 17:04:51 [kojiishi] zakim, ??p24 is me 17:04:51 [Zakim] +kojiishi; got it 17:05:19 [ChrisL] ChrisL has joined #css 17:05:28 [TabAtkins_] glazou: Extra agenda item sent to the list from Koji. 17:05:43 [TabAtkins_] glazou: Asking to resurrect CSS Line Grid, with him assuming editorship. 17:06:00 [Zakim] +ChrisL 17:06:19 [TabAtkins_] glazou: Any objection to this? 17:06:45 [TabAtkins_] [no objections] 17:06:48 [TabAtkins_] glazou: Welcome, Koji. 17:06:56 [glazou] http://idpf.org/epub/30/spec/epub30-contentdocs.html#sec-css-profile 17:07:02 [TabAtkins_] glazou: Next topic. Epub wants us to review the CSS-related section of their doc and send comments. 17:07:15 [Zakim] +SteveZ 17:07:23 [TabAtkins_] fantasai: I'm pretty sure we'll have some reasonably amount of time to discuss it. 17:07:34 [szilles] szilles has joined #css 17:07:45 [TabAtkins_] glazou: The CSS section is mostly a profile, right? 17:07:55 [TabAtkins_] fantasai: Yes, so we want to make sure they're profiling correctly. 17:08:09 [ChrisL] its also a profile of CSS 2.1, while EPUB2 was CSS2 iirc 17:08:11 [TabAtkins_] fantasai: jdaggett had some concerns, but I think they were addressed before publishing. 17:08:18 [Zakim] + +1.650.275.aadd 17:08:27 [TabAtkins_] fantasai: There are several features not in CR yet, so we need to make sure we're okay with dealing with that. 17:08:42 [bradk] bradk has joined #css 17:09:23 [TabAtkins_] ACTION on everyone: Review the CSS-related section of the epub document. 17:09:23 [trackbot] Sorry, couldn't find user - on 17:09:24 [fantasai] I don't see any mention of a deadline for comments. 17:09:39 [TabAtkins_] Topic: CSS 2.1 issues 17:09:41 [Zakim] +David_Baron 17:09:48 [TabAtkins_] glazou: Peter, you got a message from web2pdf. 17:09:56 [TabAtkins_] plinss: They're fixing a bunch of bugs in our blocked tests. 17:09:57 [glazou] WebToPDF.NET 17:10:00 [fantasai] Probably one month is good, so that they have time to address them and can make it in before their next draft (which I'm guessing will be more than one month out). 17:10:06 [TabAtkins_] plinss: They'll have a public beta release that fixes several of our blockers. 17:10:20 [glazou] http://test.csswg.org/harness/results?s=CSS21_HTML&t=0&f[]=1&f[]=1 17:10:32 [TabAtkins_] plinss: We're on 15 blocked tests now. 17:10:59 [TabAtkins_] plinss: I know they have fixes on two of them, and regressions on two more that they'll go back and fix. 17:11:14 [TabAtkins_] glazou: Any other 2.1 comments? 17:11:45 [TabAtkins_] johnjan: Looks like Elika's done a bunch of updates to the current issues list. 17:11:55 [TabAtkins_] fantasai: I just copied over the LC comments from the page I was stashing them on. 17:12:57 [Zakim] -glazou 17:13:20 [TabAtkins_] fantasai: There's a bunch of issues over clearance and margins that need a closer look at. 17:13:23 [glazou] one sec please 17:13:32 [fantasai] http://wiki.csswg.org/spec/css2.1#issue-209 17:13:33 [TabAtkins_] fantasai: Issue 209 should be easy to resolve. 17:13:37 [Zakim] +??P0 17:13:43 [glazou] Zakim, ??P0 is me 17:13:43 [Zakim] +glazou; got it 17:13:52 [fantasai] http://wiki.csswg.org/spec/css2.1#issue-207 probably requres some investigation by WG members; it involves clearance 17:13:58 [glazou] ChrisL: free.fr still cutting at 15mn despite of reregister settings... 17:14:01 [fantasai] also http://wiki.csswg.org/spec/css2.1#issue-211 is margin collapsing 17:15:46 [TabAtkins_] dbaron: The issue with the root element is that we never say what precisely establishes the root BFC, whether it's the root element or osmething above it. 17:16:22 [TabAtkins_] dbaron: The only place I've found that matters is if the root contains floats that extend below its normal content, or if the root has a background image vertically positioned anywhere other than "top". 17:16:33 [fantasai] s/or/and/ 17:16:45 [TabAtkins_] dbaron: Gecko treats it as the root establishes a new BFC. Opera and Webkit don't. 17:17:02 [TabAtkins_] fantasai: My inclination is to treat it as a BFC, since its margins don't collapse. It would make things more consistent. 17:17:32 [TabAtkins_] alexmog: In IE we have a pagination problem, since if the root is a BFC then it won't break across pages. 17:18:04 [TabAtkins_] fantasai: Why would the root take the size of the page? 17:18:49 [TabAtkins_] alexmog: The root's layout box (whatever gets the scrollbar) gets set to the size of the first page. 17:19:02 [TabAtkins_] alexmog: I may not be able to describe the problems properly, and they may be impl-specific. 17:19:44 [glazou] https://bug590491.bugzilla.mozilla.org/attachment.cgi?id=469029 17:19:47 [dbaron] https://bug590491.bugzilla.mozilla.org/attachment.cgi?id=469029 17:20:04 [fantasai] http://software.hixie.ch/utilities/js/live-dom-viewer/?%3C!DOCTYPE%20html%3E%0A%3Cstyle%3E%0A%20%20html%20{%20border%3A%20solid%20blue%3B%20}%0A%20%20.float%20{%20float%3A%20left%3B%20height%3A%2016in%3B%20border%3A%20solid%20orange%3B%20}%0A%3C%2Fstyle%3E%0A%0A%3Cdiv%20class%3D%22float%22%3E%3C%2Fdiv%3E 17:20:07 [TabAtkins_] dbaron: What matters in the test is the position of the orange stripe 17:20:14 [dbaron] in first test, what matters is position of orange stripe 17:20:34 [TabAtkins_] fantasai: In my test, if the blue box is large enough to hold the yellow, it's a BFC. 17:21:14 [TabAtkins_] alexmog: It's not a BFC in IE9 or IE8. It was in IE7. 17:21:25 [TabAtkins_] fantasai: I suspect this isn't a web compat issue, since we have differeing implementations. 17:21:47 [TabAtkins_] fantasai: So I suggest to make it a BFC, because authors would get confused otherwise when root backgrounds don't contain their floats. 17:22:06 [TabAtkins_] alexmog: Can I check with Paged Media issues and get back to you on that? 17:22:08 [TabAtkins_] fantasai: Yup. 17:22:37 [TabAtkins_] alexmog: Another issue. When pages change width, usually you take the width of the page where the BFC starts, and it stays that width. This is how we treat tables and such. 17:22:55 [TabAtkins_] alexmog: But if the root is a BFC it has to act differently, so it can get larger if the page gets larger. 17:23:15 [TabAtkins_] Bert: Related, we have 'overflow' which can't apply to <body>. 17:24:27 [TabAtkins_] glazou: So do we need more time to decide on exactly how to handle this? 17:25:01 [TabAtkins_] dbaron: I'm okay with changing Moz, though we do need to define where the root BFC comes from. 17:25:52 [shan] shan has joined #css 17:26:05 [TabAtkins_] glazou: Is that okay with everyone? 17:26:12 [dbaron] I don't really understand alexmog's paged media issue, though. 17:26:42 [TabAtkins_] alexmog: Is it okay to say that the root is not a BFC in paged media? 17:27:01 [dbaron] I don't see any reference to block formatting contexts in the CSS 2.1 paged media chapter or in css3-page. 17:28:11 [TabAtkins_] alexmog: It's not written anywhere, but it's something that people will have to solve as they implement Paged Media. 17:28:27 [TabAtkins_] dbaron: is it related to BFCs specifically, or just to certian types of things that establish BFCs? 17:28:50 [TabAtkins_] alexmog: It's certainly easier to say that everything that establishes a BFC has that behavior. 17:29:02 [Zakim] -glazou 17:29:20 [TabAtkins_] fantasai: You say IE has special behavior for tables and such across pages to make their widths stay the same across pages? 17:29:27 [TabAtkins_] fantasai: You also do that for overflow:hidden? 17:29:29 [Zakim] +??P0 17:29:32 [glazou] Zakim, ??P0 is me 17:29:32 [Zakim] +glazou; got it 17:30:03 [TabAtkins_] alexmog: Yes, overflow:hidden elements also have this behavior. 17:30:28 [TabAtkins_] fantasai: I'd prefer that overflow:hidden elements act like normal elements. 17:30:45 [TabAtkins_] alexmog: So I don't strongly object to the root being a BFC, it would just make its pagination rules somewhat special. 17:31:14 [TabAtkins_] fantasai: Yeah, the pagination rules aren't clear in the first place. We wrote something aobut chaning page widths into paged media, though it's not quite the same that you have. 17:31:16 [Zakim] +??P9 17:31:27 [TabAtkins_] alexmog: It's unlikely we'll make changes to IE9 in this regard, btw. 17:31:49 [TabAtkins_] glazou: So what do we do? 17:32:16 [shan] Zakim, ??P9 is me 17:32:16 [Zakim] +shan; got it 17:33:28 [TabAtkins_] TabAtkins_: It sounds like nobody has great disagreements, we just need to have some careful consideration of the issues and decide what to specify. 17:33:56 [TabAtkins_] johnjan: Is this really something we want to change right now? 17:35:03 [TabAtkins_] glazou: FF4 and IE9 are shipping with different behavior, so no matter what's decided there will be differeing impls. 17:35:12 [ChrisL] erratum for CSS 2.1 then? 17:35:20 [TabAtkins_] dbaron: I'm okay with waiting siz months and putting this into the next revision of 2.1, but I'm not okay with waiting for CSS3. 17:35:33 [TabAtkins_] RESOLVED: Discuss issue, resolve in CSS 2.1 errata. 17:35:44 [TabAtkins_] Topic: Gamma section in CSS 2.1 spec 17:36:04 [TabAtkins_] ChrisL: There was a discussion a few years ago from Chris Murphy, as a result of which we removed the section on gamma from CSS3 Color. 17:36:13 [TabAtkins_] ChrisL: It was confusing and outdated. 17:36:29 [TabAtkins_] ChrisL: It was recently pointed out to me that the same section is still there in CSS 2.1 as an informative note. 17:36:50 [TabAtkins_] ChrisL: It has no conformance weight, but it's still confusing and outdated and has negative value. So we should delete it from CSS 2.1 as well. 17:37:21 [TabAtkins_] RESOLVED: Remove the gamma note from 2.1. 17:38:44 [arronei] http://wiki.csswg.org/spec/css2.1#issue-215 17:38:47 [arronei] http://wiki.csswg.org/spec/css2.1#issue-216 17:39:01 [TabAtkins_] arronei: There are two issues on the issues list that are super simple, 215 or 216. We discussed at the testing f2f, and I think we all agreed to kill them. 17:39:44 [TabAtkins_] arronei: I'm not hearing any objections to leaving 215 undefined. 17:40:07 [TabAtkins_] arronei: dbaron, you said FF is the only one that passes 216, and everyone else goes the other way. Do you object to dropping it? 17:40:24 [TabAtkins_] dbaron: I'm fine with that. It can fall into a MAY. 17:40:44 [TabAtkins_] RESOLVED: Resolve issue 215 as undefined, and drop issue 216. 17:40:49 [TabAtkins_] Topic: Multicol algorithm. 17:40:51 [ChrisL] the comment from Chris Murphy about being ignored at W3C 17:40:52 [ChrisL] http://lists.freedesktop.org/archives/openicc/2011q1/002969.html 17:41:02 [TabAtkins_] glazou: howcome's not on the call, but he quoted two of his messages. 17:41:25 [TabAtkins_] alexmog: There are a few ways to treat a situation when there's no usable layout that satisfies the constraints. 17:41:41 [TabAtkins_] alexmog: One way is to honor everything that is exactly defined, and just overflow if necessary. 17:41:42 [plinss] s/drop issue 216/accept proposal for issue 216/ 17:42:14 [TabAtkins_] alexmog: Another is to keep content visible, so users on a phone dn't get a pretty layout, but it's usable. 17:42:32 [TabAtkins_] alexmog: I think that nowhere in CSS do we alter the way we interpret properties based on whether an overflow is about to happen. 17:43:29 [TabAtkins_] alexmog: If we really care about the end-user and want to show them content, when the design intent totally fails, the best thing for the user is to just drop to a single column as soon as possible when the multicol properties can't be satisfied. 17:43:44 [TabAtkins_] alexmog: So once we shrink down to 0 col width, the next step should be to drop straight to 1 column. 17:44:39 [TabAtkins_] alexmog: I think these are the only two situations (honor exactly, or drop to 1col quickly), and not to try and gradually relax properties, hovering around unusable states. 17:44:44 [Zakim] -glazou 17:44:52 [TabAtkins_] Bert: I like the principle, but what's the practical effect of 0-width columns? 17:44:59 [Zakim] +??P0 17:45:05 [glazou] Zakim, ??P0 is me 17:45:05 [Zakim] +glazou; got it 17:45:09 [TabAtkins_] alexmog: I think the page becomes unusable before 0px-wide columns. 17:46:01 [TabAtkins_] alexmog: If the column is too small, the overflow just intrudes into the column-gap. 17:46:22 [Zakim] -ChrisL 17:46:31 [TabAtkins_] alexmog: If there's a single 0-width column, you'll see the overflow content. With multiple columns you won't. 17:46:47 [TabAtkins_] szilles: I thought we discussed overflow columns just going to the right. Does that help in this case? 17:46:55 [Zakim] +ChrisL 17:47:11 [TabAtkins_] alexmog: Different situation - that's where column width is specified, but not count. This case is where column-count is specified, but not width. 17:48:14 [TabAtkins_] szilles: So really, if you want to service multiple screens, setting a fixed number of columns is a bad idea. 17:48:26 [TabAtkins_] alexmog: Without using media queries, yeah. Setting column-width is a better approach in general. 17:50:02 [TabAtkins_] TabAtkins_: I think we should just honor things exactly. It can produce an unusable situation, but that's easy to fix right with media queries. 17:50:10 [TabAtkins_] szilles: And what happens if I set both -width and -count? 17:50:15 [TabAtkins_] alexmog: Current spec ignores -count in that case. 17:50:29 [TabAtkins_] alexmog: I don't think that this extreme case is a good enough reason to add column-min-width. 17:50:35 [fantasai] I thought the -count became the maximum column count? 17:50:51 [TabAtkins_] alexmog: So we have two in favor of treating things exactly as specified. 17:50:54 [TabAtkins_] bradk: Me to. 17:50:58 [TabAtkins_] s/to/too/ 17:51:01 [TabAtkins_] szilles: i could live with it. 17:51:09 [TabAtkins_] glazou: What's the option preferred by howcome? 17:51:24 [TabAtkins_] alexmog: I'd prefer to ask him directly, but I think he was okay with either option, and just wanted consensus. 17:51:36 [TabAtkins_] szilles: "Treating things exactly" is how the spec is now, right? 17:51:53 [TabAtkins_] alexmog: No, the current spec somewhat relaxes count in some situations. It would remove 3 lines from the pseudo-algorithm. 17:52:24 [Zakim] -cesar 17:53:04 [TabAtkins_] fantasai: -count sets a minimum number of columns when used with -width, so if you set both values you effectively get a minimum width anyway. 17:53:19 [fantasai] s/minimum number/maximum number/ 17:53:30 [TabAtkins_] alexmog: So I think we should ask howcome if he agrees with the consensus here. 17:53:35 [fantasai] You get your column count combined with a minimum width for the columns 17:53:53 [TabAtkins_] ACTION howcome to read the minutes from today and confirm if he agrees or not with the Multicol algo consensus. 17:53:53 [trackbot] Created ACTION-297 - Read the minutes from today and confirm if he agrees or not with the Multicol algo consensus. [on HΓ₯kon Wium Lie - due 2011-02-23]. 17:54:01 [fantasai] So if is not room for all the columns given your -width, the algorithm drops columns until -width is honored 17:54:25 [TabAtkins_] Topic: :active disagreement between CSS and HTML 17:54:43 [fantasai] Could even recommend that authors set -width when setting -count, so that the columns don't get too narrow. 17:54:52 [TabAtkins_] Bert: I think the trouble is the definition of the word "activate". 17:55:04 [fantasai] http://lists.w3.org/Archives/Public/www-style/2011Feb/0426.html 17:55:16 [TabAtkins_] Bert: We thought we needed some indirection at the time of speccing, so we just used the word "activate" and let the source language define that. 17:55:25 [TabAtkins_] Bert: But HTML already uses the word "activate" for something else. 17:55:50 [TabAtkins_] Bert: So this is just a wording problem. They have to invent a new word for this or something, as the word "activate" is already taken in that spec. 17:55:54 [fantasai] http://lists.w3.org/Archives/Member/w3c-css-wg/2011JanMar/0176.html 17:56:10 [TabAtkins_] ChrisL: So it seems that HTML can just say "For CSS purpose, 'activate' means XXX" 17:56:36 [TabAtkins_] Bert: Right. Another option is for HTML to use a different word for what they currently call "activate", and then use "activate" in the CSS sense. 17:57:26 [TabAtkins_] TabAtkins_: I pinged Hixie this morning to ask him to change the wording. 17:58:07 [TabAtkins_] ACTION TabAtkins to report back to the group on the progress of this issue. 17:58:07 [trackbot] Sorry, couldn't find user - TabAtkins 17:58:15 [TabAtkins_] ACTION tab to report back to the group on the progress of this issue. 17:58:15 [trackbot] Created ACTION-298 - Report back to the group on the progress of this issue. [on Tab Atkins Jr. - due 2011-02-23]. 18:00:25 [Zakim] -glazou 18:00:32 [glazou] shit 18:00:35 [glazou] cannotrejoin 18:00:36 [TabAtkins_] [discussion about communication between WGs] 18:00:50 [glazou] guys, end of call, will summarize by email 18:01:12 [glazou] sorry for that, blame my SIP client:( 18:01:12 [Zakim] -David_Baron 18:01:34 [Zakim] -ChrisL 18:01:55 [Zakim] -johnjan 18:01:57 [Zakim] -smfr 18:02:01 [Zakim] -plinss 18:02:02 [Zakim] -SteveZ 18:02:02 [Zakim] -kojiishi 18:02:03 [Zakim] -??P25 18:02:04 [Zakim] -Bert 18:02:11 [Zakim] -fantasai 18:02:12 [Zakim] - +1.650.275.aadd 18:02:12 [Zakim] -TabAtkins_ 18:02:16 [Zakim] -shan 18:02:26 [Zakim] -arronei 18:02:32 [fantasai] Bert: can you forward your message to www-style? 18:02:43 [cesar] I'm sorry too: it seems I finished my Skype credit. :( (I have to try a SIP client). Bye! 18:07:27 [Zakim] disconnecting the lone participant, +1.206.324.aabb, in Style_CSS FP()12:00PM 18:07:29 [Zakim] Style_CSS FP()12:00PM has ended 18:07:32 [Zakim] Attendees were glazou, arronei, +1.858.216.aaaa, plinss, smfr, TabAtkins_, johnjan, +1.206.324.aabb, fantasai, Bert, +46.0.94.0.aacc, kojiishi, cesar, ChrisL, SteveZ, 18:07:35 [Zakim] ... +1.650.275.aadd, David_Baron, shan 18:07:51 [TabAtkins] Bert: Image Values should be all ready for WD publishing now, btw. 18:07:57 [TabAtkins] Bert: Anything else I need to do? 18:08:52 [fantasai] Bert: (Tab made a couple extra editorial edits yesterday) 18:10:38 [Bert] I'll try to have it published tomorrow. 18:12:18 [TabAtkins] Bert: Cool, thanks. 18:12:43 [Bert] Do you remember at what telcon we decided to publish it? Was it in January? 18:13:35 [Bert] Found it, Jan 26 18:16:06 [smfr] smfr has joined #css 18:28:51 [arronei] arronei has joined #CSS 19:02:59 [dbaron] dbaron has joined #css 19:07:42 [hey] hey has joined #css 19:09:14 [plinss] plinss has joined #css 19:12:19 [oickoame] oickoame has joined #css 19:12:40 [hey] hola 19:12:49 [hey] esto es una prueba 19:13:06 [hey] chao 19:13:16 [hey] hey has left #css 19:17:38 [smfr] smfr has joined #css 19:17:44 [smfr] smfr has left #css 19:24:21 [hober] hober has joined #css 19:38:21 [ChrisL] ChrisL has joined #css 20:12:42 [Zakim] Zakim has left #css 21:03:25 [jdaggett] jdaggett has joined #css 21:10:29 [sylvaing] sylvaing has left #css 21:25:58 [smfr_] smfr_ has joined #css 21:35:25 [myakura] myakura has joined #css 21:35:49 [myakura_] myakura_ has joined #css 23:08:13 [homata] homata has joined #CSS 23:22:39 [jdaggett] jdaggett has joined #css 23:23:41 [jdaggett_] jdaggett_ has joined #css 23:43:51 [plinss] plinss has joined #css
{ "url": "http://www.w3.org/2011/02/16-css-irc", "source_domain": "www.w3.org", "snapshot_id": "crawl=CC-MAIN-2014-10", "warc_metadata": { "Content-Length": "31968", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5MOPXULU5JV52YTUR3BOKUXVQWY7QOL6", "WARC-Concurrent-To": "<urn:uuid:59836bea-2f96-4601-9af4-be9a3a7f8a45>", "WARC-Date": "2014-03-12T14:26:38Z", "WARC-IP-Address": "128.30.52.37", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:M4NERKVZX5A26AOBNJLQH2WWI2TR542P", "WARC-Record-ID": "<urn:uuid:99a6b34d-f2e6-4c87-9bbb-1edc00418c2b>", "WARC-Target-URI": "http://www.w3.org/2011/02/16-css-irc", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a975fb61-638a-4b59-a171-a871a24f2a21>" }, "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, 29, 30, 53, 54, 74, 99, 119, 167, 185, 211, 228, 301, 319, 346, 364, 378, 395, 497, 515, 538, 556, 579, 596, 634, 651, 664, 681, 687, 705, 723, 740, 756, 775, 798, 815, 832, 854, 881, 898, 916, 934, 952, 969, 985, 1001, 1022, 1039, 1045, 1062, 1075, 1094, 1118, 1135, 1147, 1166, 1190, 1207, 1229, 1248, 1276, 1293, 1310, 1330, 1355, 1372, 1390, 1407, 1417, 1434, 1440, 1457, 1475, 1492, 1499, 1516, 1523, 1543, 1562, 1579, 1597, 1614, 1633, 1650, 1665, 1682, 1692, 1714, 1737, 1754, 1761, 1781, 1800, 1817, 1835, 1853, 1876, 1898, 1952, 1974, 2047, 2064, 2072, 2094, 2125, 2147, 2163, 2185, 2208, 2226, 2295, 2317, 2417, 2434, 2442, 2464, 2547, 2566, 2590, 2612, 2664, 2686, 2754, 2772, 2829, 2851, 2940, 2957, 2975, 2997, 3108, 3125, 3147, 3169, 3242, 3262, 3293, 3313, 3365, 3387, 3409, 3426, 3439, 3461, 3508, 3530, 3591, 3609, 3622, 3642, 3806, 3828, 3907, 3925, 3992, 4014, 4053, 4075, 4180, 4202, 4234, 4256, 4336, 4358, 4441, 4458, 4466, 4488, 4579, 4597, 4612, 4632, 4676, 4698, 4745, 4762, 4768, 4786, 4804, 4821, 4837, 4857, 4974, 4992, 5064, 5084, 5154, 5176, 5331, 5353, 5556, 5576, 5586, 5608, 5691, 5713, 5835, 5857, 5963, 5985, 6041, 6063, 6164, 6186, 6279, 6297, 6361, 6379, 6443, 6463, 6769, 6791, 6861, 6879, 6936, 6958, 7044, 7066, 7120, 7142, 7235, 7257, 7393, 7415, 7489, 7511, 7526, 7548, 7721, 7743, 7850, 7872, 7935, 7957, 8030, 8052, 8147, 8163, 8184, 8206, 8242, 8260, 8323, 8345, 8415, 8433, 8540, 8562, 8679, 8701, 8801, 8823, 8919, 8936, 8944, 8966, 9090, 9112, 9160, 9177, 9183, 9201, 9219, 9236, 9252, 9274, 9338, 9360, 9437, 9459, 9578, 9600, 9779, 9796, 9802, 9824, 9894, 9916, 9942, 9958, 9976, 9993, 10007, 10029, 10178, 10200, 10263, 10285, 10403, 10421, 10447, 10469, 10598, 10620, 10672, 10694, 10731, 10753, 10889, 10911, 10950, 10972, 11086, 11108, 11253, 11275, 11317, 11336, 11380, 11399, 11443, 11465, 11622, 11644, 11710, 11732, 11862, 11884, 11936, 11958, 12020, 12042, 12069, 12087, 12144, 12162, 12227, 12249, 12319, 12341, 12454, 12476, 12573, 12591, 12639, 12661, 12769, 12791, 12921, 12943, 13190, 13212, 13314, 13336, 13509, 13526, 13534, 13556, 13636, 13653, 13659, 13677, 13695, 13712, 13728, 13750, 13818, 13840, 13925, 13942, 13950, 13972, 14083, 14105, 14208, 14225, 14233, 14255, 14402, 14424, 14534, 14556, 14654, 14676, 14820, 14842, 14901, 14923, 14974, 14996, 15091, 15111, 15165, 15187, 15261, 15283, 15297, 15319, 15329, 15351, 15382, 15404, 15452, 15474, 15586, 15608, 15674, 15696, 15820, 15837, 15844, 15866, 16009, 16029, 16062, 16084, 16164, 16184, 16256, 16278, 16390, 16410, 16563, 16583, 16692, 16714, 16763, 16783, 16891, 16913, 16981, 17001, 17065, 17087, 17233, 17255, 17323, 17345, 17494, 17514, 17582, 17604, 17687, 17709, 17856, 17878, 17952, 17974, 18050, 18070, 18108, 18130, 18200, 18220, 18335, 18352, 18360, 18378, 18383, 18401, 18414, 18436, 18481, 18499, 18542, 18560, 18598, 18615, 18628, 18645, 18653, 18670, 18679, 18696, 18702, 18719, 18727, 18744, 18752, 18769, 18779, 18796, 18803, 18820, 18826, 18843, 18853, 18870, 18888, 18905, 18917, 18934, 18940, 18957, 18966, 18986, 19035, 19052, 19142, 19159, 19237, 19254, 19286, 19303, 19470, 19487, 19526, 19547, 19614, 19635, 19669, 19689, 19747, 19763, 19803, 19824, 19844, 19860, 19936, 19952, 19969, 19985, 20006, 20025, 20049, 20067, 20090, 20105, 20125, 20143, 20166, 20186, 20211, 20226, 20231, 20246, 20265, 20280, 20285, 20300, 20318, 20334, 20355, 20371, 20390, 20407, 20429, 20447, 20470, 20487, 20507, 20527, 20552, 20572, 20595, 20612, 20634, 20653, 20677, 20697, 20722, 20740, 20763, 20783, 20808, 20829, 20855, 20873 ], "line_end_idx": [ 29, 30, 53, 54, 74, 99, 119, 167, 185, 211, 228, 301, 319, 346, 364, 378, 395, 497, 515, 538, 556, 579, 596, 634, 651, 664, 681, 687, 705, 723, 740, 756, 775, 798, 815, 832, 854, 881, 898, 916, 934, 952, 969, 985, 1001, 1022, 1039, 1045, 1062, 1075, 1094, 1118, 1135, 1147, 1166, 1190, 1207, 1229, 1248, 1276, 1293, 1310, 1330, 1355, 1372, 1390, 1407, 1417, 1434, 1440, 1457, 1475, 1492, 1499, 1516, 1523, 1543, 1562, 1579, 1597, 1614, 1633, 1650, 1665, 1682, 1692, 1714, 1737, 1754, 1761, 1781, 1800, 1817, 1835, 1853, 1876, 1898, 1952, 1974, 2047, 2064, 2072, 2094, 2125, 2147, 2163, 2185, 2208, 2226, 2295, 2317, 2417, 2434, 2442, 2464, 2547, 2566, 2590, 2612, 2664, 2686, 2754, 2772, 2829, 2851, 2940, 2957, 2975, 2997, 3108, 3125, 3147, 3169, 3242, 3262, 3293, 3313, 3365, 3387, 3409, 3426, 3439, 3461, 3508, 3530, 3591, 3609, 3622, 3642, 3806, 3828, 3907, 3925, 3992, 4014, 4053, 4075, 4180, 4202, 4234, 4256, 4336, 4358, 4441, 4458, 4466, 4488, 4579, 4597, 4612, 4632, 4676, 4698, 4745, 4762, 4768, 4786, 4804, 4821, 4837, 4857, 4974, 4992, 5064, 5084, 5154, 5176, 5331, 5353, 5556, 5576, 5586, 5608, 5691, 5713, 5835, 5857, 5963, 5985, 6041, 6063, 6164, 6186, 6279, 6297, 6361, 6379, 6443, 6463, 6769, 6791, 6861, 6879, 6936, 6958, 7044, 7066, 7120, 7142, 7235, 7257, 7393, 7415, 7489, 7511, 7526, 7548, 7721, 7743, 7850, 7872, 7935, 7957, 8030, 8052, 8147, 8163, 8184, 8206, 8242, 8260, 8323, 8345, 8415, 8433, 8540, 8562, 8679, 8701, 8801, 8823, 8919, 8936, 8944, 8966, 9090, 9112, 9160, 9177, 9183, 9201, 9219, 9236, 9252, 9274, 9338, 9360, 9437, 9459, 9578, 9600, 9779, 9796, 9802, 9824, 9894, 9916, 9942, 9958, 9976, 9993, 10007, 10029, 10178, 10200, 10263, 10285, 10403, 10421, 10447, 10469, 10598, 10620, 10672, 10694, 10731, 10753, 10889, 10911, 10950, 10972, 11086, 11108, 11253, 11275, 11317, 11336, 11380, 11399, 11443, 11465, 11622, 11644, 11710, 11732, 11862, 11884, 11936, 11958, 12020, 12042, 12069, 12087, 12144, 12162, 12227, 12249, 12319, 12341, 12454, 12476, 12573, 12591, 12639, 12661, 12769, 12791, 12921, 12943, 13190, 13212, 13314, 13336, 13509, 13526, 13534, 13556, 13636, 13653, 13659, 13677, 13695, 13712, 13728, 13750, 13818, 13840, 13925, 13942, 13950, 13972, 14083, 14105, 14208, 14225, 14233, 14255, 14402, 14424, 14534, 14556, 14654, 14676, 14820, 14842, 14901, 14923, 14974, 14996, 15091, 15111, 15165, 15187, 15261, 15283, 15297, 15319, 15329, 15351, 15382, 15404, 15452, 15474, 15586, 15608, 15674, 15696, 15820, 15837, 15844, 15866, 16009, 16029, 16062, 16084, 16164, 16184, 16256, 16278, 16390, 16410, 16563, 16583, 16692, 16714, 16763, 16783, 16891, 16913, 16981, 17001, 17065, 17087, 17233, 17255, 17323, 17345, 17494, 17514, 17582, 17604, 17687, 17709, 17856, 17878, 17952, 17974, 18050, 18070, 18108, 18130, 18200, 18220, 18335, 18352, 18360, 18378, 18383, 18401, 18414, 18436, 18481, 18499, 18542, 18560, 18598, 18615, 18628, 18645, 18653, 18670, 18679, 18696, 18702, 18719, 18727, 18744, 18752, 18769, 18779, 18796, 18803, 18820, 18826, 18843, 18853, 18870, 18888, 18905, 18917, 18934, 18940, 18957, 18966, 18986, 19035, 19052, 19142, 19159, 19237, 19254, 19286, 19303, 19470, 19487, 19526, 19547, 19614, 19635, 19669, 19689, 19747, 19763, 19803, 19824, 19844, 19860, 19936, 19952, 19969, 19985, 20006, 20025, 20049, 20067, 20090, 20105, 20125, 20143, 20166, 20186, 20211, 20226, 20231, 20246, 20265, 20280, 20285, 20300, 20318, 20334, 20355, 20371, 20390, 20407, 20429, 20447, 20470, 20487, 20507, 20527, 20552, 20572, 20595, 20612, 20634, 20653, 20677, 20697, 20722, 20740, 20763, 20783, 20808, 20829, 20855, 20873, 20895 ] }
{ "red_pajama_v2": { "ccnet_original_length": 20895, "ccnet_original_nlines": 557, "rps_doc_curly_bracket": 0.00019142999371979386, "rps_doc_ldnoobw_words": 2, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2037786841392517, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026653170585632324, "rps_doc_frac_lines_end_with_ellipsis": 0.0017921100370585918, "rps_doc_frac_no_alph_words": 0.5015182495117188, "rps_doc_frac_unique_words": 0.33487603068351746, "rps_doc_mean_word_length": 5.162644863128662, "rps_doc_num_sentences": 272, "rps_doc_symbol_to_word_ratio": 0.007085020188242197, "rps_doc_unigram_entropy": 5.953563690185547, "rps_doc_word_count": 3025, "rps_doc_frac_chars_dupe_10grams": 0.018441440537571907, "rps_doc_frac_chars_dupe_5grams": 0.060703080147504807, "rps_doc_frac_chars_dupe_6grams": 0.020362429320812225, "rps_doc_frac_chars_dupe_7grams": 0.018441440537571907, "rps_doc_frac_chars_dupe_8grams": 0.018441440537571907, "rps_doc_frac_chars_dupe_9grams": 0.018441440537571907, "rps_doc_frac_chars_top_2gram": 0.031760260462760925, "rps_doc_frac_chars_top_3gram": 0.023051800206303596, "rps_doc_frac_chars_top_4gram": 0.0038419701159000397, "rps_doc_books_importance": -2902.8935546875, "rps_doc_books_importance_length_correction": -2902.8935546875, "rps_doc_openwebtext_importance": -1495.9608154296875, "rps_doc_openwebtext_importance_length_correction": -1495.9608154296875, "rps_doc_wikipedia_importance": -1024.3946533203125, "rps_doc_wikipedia_importance_length_correction": -1024.3946533203125 }, "fasttext": { "dclm": 0.31096673011779785, "english": 0.8567808866500854, "fineweb_edu_approx": 1.2007914781570435, "eai_general_math": 0.38646918535232544, "eai_open_web_math": 0.3252568244934082, "eai_web_code": 0.45743101835250854 } }
{ "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.019", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "5", "label": "Evaluate" } }, "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": "-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": "6", "label": "Content Listing" } }, "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": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }
e3c4dd7183f5f028f56d5a7988cc68c4
-9,190,456,498,215,951,000
File: vt_text.sql package info (click to toggle) virtuoso-opensource 6.1.6+dfsg2-4 β€’ links: PTS, VCS β€’ area: main β€’ in suites: bullseye, buster, sid, stretch β€’ size: 260,992 kB β€’ ctags: 125,220 β€’ sloc: ansic: 652,748; sql: 458,419; xml: 282,834; java: 61,031; sh: 40,031; cpp: 36,890; cs: 25,240; php: 12,692; yacc: 9,523; lex: 7,018; makefile: 6,157; jsp: 4,484; awk: 1,643; perl: 1,013; ruby: 1,003; python: 326 file content (481 lines) | stat: -rw-r--r-- 17,952 bytes parent folder | download | duplicates (2) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 -- -- vt_text.sql -- -- $Id$ -- -- Text triggers support. -- -- This file is part of the OpenLink Software Virtuoso Open-Source (VOS) -- project. -- -- Copyright (C) 1998-2012 OpenLink Software -- -- This project is free software; you can redistribute it and/or modify it -- under the terms of the GNU General Public License as published by the -- Free Software Foundation; only version 2 of the License, dated June 1991. -- -- This program is distributed in the hope that it will be useful, but -- WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- General Public License for more details. -- -- You should have received a copy of the GNU General Public License along -- with this program; if not, write to the Free Software Foundation, Inc., -- 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA -- -- create procedure DB.DBA.execstmt (in stmt varchar, out stat varchar, out msg varchar) { stat := '00000'; exec (stmt, stat, msg, vector (), 0, null, null); if (stat <> '00000') { return 1; } return 0; } ; create procedure DB.DBA.vt_create_ftt (in tb varchar, in id varchar, in dbcol varchar, in is_intr integer) { declare stmt, stat, msg, verr varchar; declare tbn0, tbn1, tbn2, data_table_suffix, theuser varchar; -- tb := complete_table_name (fix_identifier_case (tb), 1); verr := ''; tb := complete_table_name ((tb), 1); tbn0 := name_part (tb, 0); tbn1 := name_part (tb, 1); tbn2 := name_part (tb, 2); data_table_suffix := concat (tbn0, '_', tbn1, '_', tbn2); data_table_suffix := DB.DBA.SYS_ALFANUM_NAME (replace (data_table_suffix, ' ', '_')); theuser := user; if (theuser = 'dba') theuser := 'DBA'; if (not exists (select 1 from DB.DBA.SYS_VT_INDEX where 0 = casemode_strcmp (VI_TABLE, tb))) { verr := 'FT035'; stat := '42S02'; msg := sprintf ('Text index should be enabled for the table "%s"', tb); goto err; } if (not isstring (id)) select VI_ID_COL into id from DB.DBA.SYS_VT_INDEX where 0 = casemode_strcmp (VI_TABLE, tb); if (not isstring (dbcol)) select VI_COL into dbcol from DB.DBA.SYS_VT_INDEX where 0 = casemode_strcmp (VI_TABLE, tb); if (not exists (select 1 from DB.DBA.SYS_COLS where "TABLE" = tb and "COLUMN" = id)) { stat := '42S22'; verr := 'FT036'; msg := sprintf ('The id column "%s" does not exist in table "%s" definition', id, tb); goto err; } if (not exists (select 1 from DB.DBA.SYS_COLS where "TABLE" = tb and "COLUMN" = dbcol)) { stat := '42S22'; verr := 'FT037'; msg := sprintf ('The data column "%s" does not exist in table "%s" definition', dbcol, tb); goto err; } -- prevent making of error messages if creation is internal if (is_intr = 2 and exists (select 1 from DB.DBA.SYS_KEYS where KEY_TABLE = sprintf ('%s.%s.%s_%s_QUERY', tbn0, tbn1, tbn2, dbcol))) return; -- Upgrade an old database if (not exists (select 1 from DB.DBA.SYS_PROCEDURES where P_NAME = sprintf ('%I.%I.VT_HITS_%I', tbn0, tbn1, tbn2))) { stmt := concat ( sprintf ( 'create procedure "%I"."%I"."VT_BATCH_PROCESS_%s" (inout vtb any, in doc_id int) {\n',tbn0, tbn1, data_table_suffix), 'declare invd any;\n invd := vt_batch_strings_array (vtb);\n if (length (invd) < 1) return;\n', sprintf ('"%I"."%I"."VT_HITS_%I" (vtb, invd);\n', tbn0, tbn1, tbn2), sprintf ( 'log_text (''"%I"."%I"."VT_BATCH_REAL_PROCESS_%s" (?, ?)'', invd, doc_id);\n', tbn0, tbn1, data_table_suffix), 'log_enable (0);\n', sprintf ( '"%I"."%I"."VT_BATCH_REAL_PROCESS_%s" (invd, doc_id);\n',tbn0, tbn1, data_table_suffix), 'log_enable (1);}\n'); DB.DBA.execstr (stmt); } -- Tables definition stmt := sprintf ('CREATE TABLE "%I"."%I"."%I" (TT_WORD VARCHAR, TT_ID INTEGER, TT_QUERY VARCHAR, TT_CD VARCHAR, TT_COMMENT VARCHAR, TT_XPATH VARCHAR, TT_PREDICATE VARCHAR, PRIMARY KEY (TT_WORD, TT_ID))', tbn0, tbn1, concat (tbn2, '_', dbcol, '_QUERY')); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf ('CREATE TABLE "%I"."%I"."%I" (TTU_T_ID INTEGER, TTU_U_ID INTEGER, TTU_NOTIFY VARCHAR, TTU_COMMENT VARCHAR, PRIMARY KEY (TTU_T_ID, TTU_U_ID))', tbn0, tbn1, concat (tbn2, '_', dbcol, '_USER')); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf ('CREATE TABLE "%I"."%I"."%I" (TTH_U_ID INTEGER, TTH_D_ID any, TTH_T_ID INTEGER, TTH_TITLE VARCHAR, TTH_URL VARCHAR, TTH_TS TIMESTAMP, TTH_NOTIFY VARCHAR, PRIMARY KEY (TTH_U_ID, TTH_TS, TTH_D_ID, TTH_T_ID))', tbn0, tbn1, concat (tbn2, '_', dbcol, '_HIT')); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; -- Trigger definition stmt := sprintf ('CREATE TRIGGER "%I_FTT_D" AFTER DELETE ON "%I"."%I"."%I" ORDER 3 %s DELETE FROM "%I"."%I"."%I_%I_HIT" WHERE TTH_D_ID = "%I"; %s', tbn2, tbn0, tbn1, tbn2, '{', tbn0, tbn1, tbn2, dbcol, id, '}'); -- Procedures definition if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := concat ( sprintf ('create procedure "%I"."%I"."VT_HITS_%I"', tbn0, tbn1, tbn2), '(inout vtb any, inout strs any) { declare tried, hits, doc_id, u_id integer; declare len, inx int; inx := 0;len := length (strs);tried := 0;', sprintf ('if (registry_get (''tt_%s_%s_%s'') = ''OFF'') return;', tbn0, tbn1, tbn2), 'while (inx < len) { for select TT_ID, TT_QUERY, TT_COMMENT, TT_CD, TT_XPATH from ', sprintf ('"%I"."%I"."%I"', tbn0, tbn1, concat(tbn2, '_', dbcol, '_QUERY')), ' where TT_WORD = aref (strs, inx) do { declare ids, ntf, xp any; tried := tried + 1; declare ii, is_xp int; is_xp := 0; if (TT_XPATH is not null and TT_XPATH <> '''') { xp := deserialize (TT_QUERY); ids := vt_batch_match (vtb, xp); is_xp := 1; } else ids := vt_batch_match (vtb, TT_QUERY); hits := hits + length (ids); ii := 0;', sprintf ('select TTU_NOTIFY, TTU_U_ID into ntf, u_id from "%I"."%I"."%I_%I_USER" where TTU_T_ID = TT_ID;', tbn0, tbn1, tbn2, dbcol), 'while (ii < length (ids)) { doc_id := aref (ids, ii); if (<INSERT_COND>) { ', sprintf ('if ((is_xp = 0) or (is_xp = 1 and exists (select 1 from "%I"."%I"."%I" where "%I" = doc_id and xpath_contains ("%I", TT_XPATH))))', tbn0, tbn1, tbn2, id, dbcol), sprintf ('insert soft "%I"."%I"."%I" (TTH_U_ID, TTH_T_ID, TTH_D_ID, TTH_NOTIFY) select TTU_U_ID, TT_ID, doc_id, ntf from "%I"."%I"."%I" where TTU_T_ID = TT_ID; } ii := ii + 1; } } inx := inx + 2; } --dbg_obj_print ('' batch '', length (strs) / 2, ''distinct tried '', tried, '' hits '', hits); }', tbn0, tbn1, concat (tbn2, '_', dbcol, '_HIT'), tbn0, tbn1, concat (tbn2, '_', dbcol, '_USER'))); -- for WebDAV resources display only if user have read access if (0 <> casemode_strcmp (tb, 'WS.WS.SYS_DAV_RES')) stmt := replace (stmt, '<INSERT_COND>', '1 = 1'); else stmt := replace (stmt, '<INSERT_COND>', 'WS.WS.CHECK_READ_ACCESS (u_id, doc_id)'); -- dbg_obj_print (stmt); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf (' create procedure "%I"."%I"."TT_WORD_FREQ_%I" (in w varchar) { declare l1, l2 integer; l1 := 0; l2 := 0; whenever not found goto none; select sum (length (VT_DATA)), sum (length (VT_LONG_DATA)) into l1, l2 from "%I"."%I"."%I_%I_WORDS" where VT_WORD = w; none: return (coalesce (l1, 0) + coalesce (l2, 0)); }', tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf ('create procedure "%I"."%I"."TT_QUERY_%I" (in exp varchar, in u_id int, in comment varchar, in notify varchar, in user_data varchar := null, in predicate varchar := null) { declare t_id, ix, len integer; declare w any; t_id := coalesce ((select top 1 TT_ID + 1 from "%I"."%I"."%I_%I_QUERY" order by TT_ID desc), 1); w := "%I"."%I"."TT_QUERY_WORD_%I" (exp, 0); len := length (w); ix := 0; while (ix < len) { insert into "%I"."%I"."%I_%I_QUERY" (TT_ID, TT_QUERY, TT_WORD, TT_COMMENT, TT_CD, TT_PREDICATE) values (t_id, exp, aref (w, ix), comment, user_data, predicate); ix := ix + 1; } insert soft "%I"."%I"."%I_%I_USER" (TTU_T_ID, TTU_U_ID, TTU_NOTIFY, TTU_COMMENT) values (t_id, u_id, notify, comment); }', tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, dbcol); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; -- XPATH search stmt := sprintf ('create procedure "%I"."%I"."TT_XPATH_QUERY_%I" (in exp varchar, in u_id int, in comment varchar, in notify varchar, in user_data varchar := null, in predicate varchar := null) { declare t_id, ix, len integer; declare w any; declare xp any; xp := xpath_text (exp); t_id := coalesce ((select top 1 TT_ID + 1 from "%I"."%I"."%I_%I_QUERY" order by TT_ID desc), 1); w := "%I"."%I"."TT_QUERY_WORD_%I" (xp, 1); len := length (w); ix := 0; while (ix < len) { insert into "%I"."%I"."%I_%I_QUERY" (TT_ID, TT_QUERY, TT_WORD, TT_COMMENT, TT_XPATH, TT_CD, TT_PREDICATE) values (t_id, serialize (xp), aref (w, ix), comment, exp, user_data, predicate); ix := ix + 1; } insert soft "%I"."%I"."%I_%I_USER" (TTU_T_ID, TTU_U_ID, TTU_NOTIFY, TTU_COMMENT) values (t_id, u_id, notify, comment); }', tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, dbcol); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; -- end XPATH search declare pname varchar; pname := sprintf ('"%I"."%I"."TT_QUERY_WORD_1_%I"', tbn0, tbn1, tbn2); stmt := sprintf ('create procedure %s (in tree any, inout best_w varchar, inout score integer, in topop integer, inout words any) { declare op integer; if (isarray (tree)) { op := aref (tree, 0); if (op = 4 or op = 1210 or op = 1209) { declare inx int; inx := 0; while (inx < length (tree)) { %s (aref (tree, inx), best_w, score, op, words); inx := inx + 1; } } else if (op = 1211) { %s (aref (tree, 2), best_w, score, op, words); } else if (op = 1) { declare ct int; declare searched_word varchar; searched_word := aref (tree, 2); if (strchr (searched_word, ''*'') is not null) return; ct := "%I"."%I"."TT_WORD_FREQ_%I" (searched_word); if (ct < score and topop <> 3) { score := ct; best_w := searched_word; } else if (topop = 3) best_w := searched_word; } else if (op = 3) { declare inx, sc1 int; inx := 0; while (inx < length (tree)) { best_w := null; sc1 := score; score := 1000000000; %s (aref (tree, inx), best_w, score, op, words); if (words is null and best_w is not null) words := vector (best_w); else if (best_w is not null) words := vector_concat (words, vector (best_w)); score := sc1; best_w := null; inx := inx + 1; } } } }', pname, pname, pname, tbn0, tbn1, tbn2, pname); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf ('create procedure "%I"."%I"."TT_QUERY_WORD_%I" (in exp varchar, in is_xpath integer) { declare tree, ws1 any; declare w varchar; declare sc int; sc := 1000000000; w := ''__''; ws1 := null; if (is_xpath = 0) tree := vt_parse (exp); else tree := exp; %s (tree, w, sc, 0, ws1); if (w is not null) return vector (w); else if (isarray (ws1)) return ws1; return vector (''__''); }', tbn0, tbn1, tbn2, pname); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; stmt := sprintf ('create procedure "%I"."%I"."TT_NOTIFY_%I" () { declare stat, msg, ntf, comment varchar; declare _u_id, _ts, _d_id, _t_id, rc_call any; for select distinct TTH_NOTIFY as _tt_notify from "%I"."%I"."%I_%I_HIT" where TTH_NOTIFY like ''%%@%%'' do { declare _message, _msg_tit varchar; declare _cnt_hits integer; declare _short_text varchar; declare hits_data any; _cnt_hits := 0; _message := ''\\r\\nQuery/Hit Date/Document ID''; hits_data := vector (); for select TTH_U_ID, TTH_TS, TTH_D_ID, TTH_T_ID, TTH_NOTIFY from "%I"."%I"."%I_%I_HIT" where TTH_NOTIFY = _tt_notify order by TTH_TS do { whenever not found goto nfq; select coalesce (TT_COMMENT, TT_QUERY) into comment from "%I"."%I"."%I_%I_QUERY" where TT_ID = TTH_T_ID; nfq: if (comment is null) comment := ''*** no query ***''; _cnt_hits := _cnt_hits + 1; hits_data := vector_concat (hits_data, vector (vector (comment, TTH_TS, TTH_D_ID))); _message := concat (_message, ''\\r\\n'', comment, ''/'', substring (datestring (TTH_TS), 1, 19), ''/'', cast (TTH_D_ID as varchar)); } stat := ''00000''; _msg_tit := concat (''Subject: Text trigger notification: New '', cast (_cnt_hits as varchar) , '' hit(s) registered\\r\\n''); _message := concat (_msg_tit, _message); rc_call := 0; if (__proc_exists (''%s.%s.%s_INFO_TEXT'')) { rc_call := call (''%s.%s.%s_INFO_TEXT'') (_tt_notify, hits_data); } if (not rc_call) { exec (''smtp_send (null,?,?,?)'', stat, msg, vector (_tt_notify, _tt_notify, _message)); } update "%I"."%I"."%I_%I_HIT" set TTH_NOTIFY = '''' where TTH_NOTIFY = _tt_notify; } return; }', tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, dbcol, tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, tbn0, tbn1, tbn2, dbcol); --dbg_obj_print (stmt); if (DB.DBA.execstmt (stmt, stat, msg)) goto err; insert into DB.DBA.SYS_SCHEDULED_EVENT (SE_NAME, SE_START, SE_SQL, SE_INTERVAL) values (sprintf ('Notification for text hits on "%s.%s.%s"', tbn0, tbn1, tbn2), now (), sprintf ('"%I"."%I"."TT_NOTIFY_%I"()', tbn0, tbn1, tbn2), 10); return 0; err: if (stat <> '42S01' and verr <> 'FT035' and verr <> 'FTT036' and verr <> 'FT037') DB.DBA.vt_drop_ftt (tb, dbcol); if (is_intr <> 2 and verr <> '') { signal (stat, msg, verr); } else if (is_intr <> 2 and verr = '') { signal (stat, msg); } } ; create procedure DB.DBA.vt_drop_ftt (in tb varchar, in dbcol varchar) { declare stmt, stat, msg varchar; declare tbn0, tbn1, tbn2 varchar; -- tb := complete_table_name (fix_identifier_case (tb), 1); tb := complete_table_name ((tb), 1); tbn0 := name_part (tb, 0); tbn1 := name_part (tb, 1); tbn2 := name_part (tb, 2); if (not exists (select 1 from DB.DBA.SYS_VT_INDEX where 0 = casemode_strcmp (VI_TABLE, tb))) signal ('42S02', sprintf ('Text index not defined for "%s"', tb), 'FT034'); if (not isstring (dbcol)) select VI_COL into dbcol from DB.DBA.SYS_VT_INDEX where 0 = casemode_strcmp (VI_TABLE, tb); stmt := sprintf ('DROP TRIGGER "%I"."%I"."%I_FTT_D"', tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."VT_HITS_%I"' , tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_WORD_FREQ_%I"', tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_QUERY_%I"', tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_XPATH_QUERY_%I"', tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_QUERY_WORD_1_%I"', tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_QUERY_WORD_%I"',tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP PROCEDURE "%I"."%I"."TT_NOTIFY_%I"',tbn0, tbn1, tbn2); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP TABLE "%I"."%I"."%I"', tbn0, tbn1, concat (tbn2, '_', dbcol,'_QUERY')); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP TABLE "%I"."%I"."%I"', tbn0, tbn1, concat (tbn2, '_', dbcol, '_USER')); DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('DROP TABLE "%I"."%I"."%I"', tbn0, tbn1, concat (tbn2, '_', dbcol, '_HIT')); -- make an empty procedure DB.DBA.execstmt (stmt, stat, msg); stmt := sprintf ('create procedure "%I"."%I"."VT_HITS_%I" (inout vtb any, inout strs any) { return; }', tbn0, tbn1, tbn2 ); DB.DBA.execstmt (stmt, stat, msg); delete from DB.DBA.SYS_SCHEDULED_EVENT where SE_NAME = sprintf ('Notification for text hits on "%s.%s.%s"', tbn0, tbn1, tbn2); return; } ; --#IF VER=5 --!AFTER --#ENDIF grant execute on DB.DBA.vt_create_text_index to public ;
{ "url": "https://sources.debian.org/src/virtuoso-opensource/6.1.6+dfsg2-4/libsrc/Wi/vt_text.sql/", "source_domain": "sources.debian.org", "snapshot_id": "crawl=CC-MAIN-2020-05", "warc_metadata": { "Content-Length": "69346", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M6YIHUWQJ7IRUSHQPHWZBAWWHEV5RVFJ", "WARC-Concurrent-To": "<urn:uuid:a5f9bcc3-2770-4716-9c2c-56cf7b2d8fd5>", "WARC-Date": "2020-01-17T19:04:40Z", "WARC-IP-Address": "5.153.231.38", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ODWSV6LC24UJVW76TV7AQBF5EI45ADVP", "WARC-Record-ID": "<urn:uuid:131e3db1-5d8a-4169-87a0-fc50617d5884>", "WARC-Target-URI": "https://sources.debian.org/src/virtuoso-opensource/6.1.6+dfsg2-4/libsrc/Wi/vt_text.sql/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e187e773-47b9-46d2-82c7-a47ea8513d47>" }, "warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.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, 18, 19, 50, 84, 104, 119, 165, 186, 205, 427, 526, 528, 530, 532, 534, 536, 538, 540, 542, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 818, 822, 826, 830, 834, 838, 842, 846, 850, 854, 858, 862, 866, 870, 874, 878, 882, 886, 890, 894, 898, 902, 906, 910, 914, 918, 922, 926, 930, 934, 938, 942, 946, 950, 954, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1154, 1158, 1162, 1166, 1170, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1226, 1230, 1234, 1238, 1242, 1246, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1298, 1302, 1306, 1310, 1314, 1318, 1322, 1326, 1330, 1334, 1338, 1342, 1346, 1350, 1354, 1358, 1362, 1366, 1370, 1374, 1378, 1382, 1386, 1390, 1394, 1398, 1402, 1406, 1410, 1414, 1418, 1422, 1426, 1430, 1434, 1438, 1442, 1446, 1450, 1454, 1458, 1462, 1466, 1470, 1474, 1478, 1482, 1486, 1490, 1494, 1498, 1502, 1506, 1510, 1514, 1518, 1522, 1526, 1530, 1534, 1538, 1542, 1546, 1550, 1554, 1558, 1562, 1566, 1570, 1574, 1578, 1582, 1586, 1590, 1594, 1598, 1602, 1606, 1610, 1614, 1618, 1622, 1626, 1630, 1634, 1638, 1642, 1646, 1650, 1654, 1658, 1662, 1666, 1670, 1674, 1678, 1682, 1686, 1690, 1694, 1698, 1702, 1706, 1710, 1714, 1718, 1722, 1726, 1730, 1734, 1738, 1742, 1746, 1750, 1754, 1758, 1762, 1766, 1770, 1774, 1778, 1782, 1786, 1790, 1794, 1798, 1802, 1806, 1810, 1814, 1818, 1822, 1826, 1830, 1834, 1838, 1842, 1846, 1850, 1854, 1858, 1862, 1866, 1870, 1874, 1878, 1882, 1886, 1890, 1894, 1898, 1902, 1906, 1910, 1914, 1918, 1922, 1926, 1930, 1934, 1938, 1942, 1946, 1950, 1954, 1958, 1962, 1966, 1970, 1974, 1978, 1982, 1986, 1990, 1994, 1998, 2002, 2006, 2010, 2014, 2018, 2022, 2026, 2030, 2034, 2038, 2042, 2046, 2050, 2054, 2058, 2062, 2066, 2070, 2074, 2078, 2082, 2086, 2090, 2094, 2098, 2102, 2106, 2110, 2114, 2118, 2122, 2126, 2130, 2134, 2138, 2142, 2146, 2150, 2154, 2158, 2162, 2166, 2170, 2174, 2178, 2182, 2186, 2190, 2194, 2198, 2202, 2206, 2210, 2214, 2218, 2222, 2226, 2230, 2234, 2238, 2242, 2246, 2250, 2254, 2258, 2262, 2266, 2270, 2274, 2278, 2282, 2286, 2290, 2294, 2298, 2302, 2306, 2310, 2314, 2318, 2322, 2326, 2330, 2334, 2338, 2342, 2345, 2361, 2364, 2373, 2376, 2403, 2406, 2480, 2493, 2496, 2542, 2545, 2621, 2695, 2773, 2776, 2848, 2911, 2980, 3025, 3028, 3104, 3180, 3239, 3242, 3245, 3246, 3332, 3334, 3353, 3405, 3428, 3434, 3450, 3456, 3468, 3470, 3472, 3473, 3580, 3582, 3623, 3687, 3748, 3762, 3801, 3830, 3859, 3888, 3948, 4036, 4055, 4096, 4097, 4193, 4199, 4222, 4245, 4323, 4339, 4345, 4346, 4371, 4468, 4469, 4497, 4594, 4595, 4682, 4688, 4711, 4734, 4827, 4843, 4849, 4850, 4940, 4946, 4969, 4992, 5090, 5106, 5112, 5113, 5175, 5235, 5311, 5323, 5324, 5353, 5370, 5477, 5483, 5506, 5519, 5642, 5670, 5718, 5761, 5837, 5850, 5966, 5992, 6005, 6099, 6127, 6156, 6162, 6163, 6186, 6234, 6322, 6391, 6431, 6487, 6528, 6542, 6590, 6690, 6734, 6789, 6790, 6831, 6845, 6893, 6985, 7049, 7111, 7165, 7206, 7220, 7221, 7245, 7333, 7408, 7482, 7483, 7510, 7551, 7565, 7688, 7695, 7745, 7774, 7832, 7924, 7950, 7954, 8022, 8104, 8146, 8156, 8185, 8208, 8234, 8270, 8320, 8327, 8364, 8404, 8444, 8451, 8459, 8503, 8535, 8549, 8685, 8715, 8720, 8751, 8775, 8784, 8822, 8883, 8954, 8990, 9080, 9170, 9179, 9198, 9203, 9213, 9233, 9237, 9340, 9395, 9452, 9523, 9577, 9638, 9645, 9739, 9765, 9806, 9820, 9901, 9909, 9941, 9967, 10005, 10044, 10128, 10150, 10151, 10164, 10219, 10273, 10314, 10328, 10439, 10532, 10540, 10579, 10602, 10681, 10711, 10777, 10827, 10854, 10962, 11032, 11071, 11076, 11165, 11218, 11246, 11281, 11302, 11330, 11359, 11400, 11414, 11430, 11547, 11640, 11648, 11687, 11710, 11734, 11780, 11859, 11889, 11954, 12004, 12031, 12149, 12235, 12274, 12279, 12368, 12421, 12449, 12484, 12505, 12533, 12562, 12603, 12617, 12637, 12638, 12663, 12736, 12776, 12886, 12891, 12916, 12941, 12950, 12981, 13028, 13034, 13057, 13075, 13109, 13119, 13178, 13204, 13214, 13220, 13249, 13255, 13308, 13314, 13340, 13346, 13368, 13405, 13444, 13497, 13513, 13570, 13607, 13617, 13640, 13675, 13685, 13711, 13744, 13750, 13775, 13787, 13814, 13829, 13862, 13871, 13896, 13919, 13949, 14007, 14058, 14095, 14133, 14193, 14216, 14241, 14266, 14275, 14287, 14296, 14350, 14391, 14405, 14509, 14514, 14542, 14566, 14587, 14610, 14628, 14667, 14690, 14721, 14731, 14751, 14782, 14806, 14832, 14861, 14880, 14909, 14942, 14983, 14997, 14998, 15065, 15112, 15165, 15166, 15294, 15305, 15345, 15376, 15409, 15436, 15477, 15552, 15601, 15672, 15737, 15760, 15770, 15777, 15813, 15877, 15935, 15947, 15975, 16017, 16073, 16186, 16272, 16328, 16366, 16373, 16395, 16484, 16555, 16620, 16621, 16659, 16706, 16713, 16807, 16814, 16834, 16841, 16893, 16946, 16953, 17039, 17050, 17061, 17075, 17096, 17124, 17152, 17180, 17201, 17222, 17251, 17252, 17278, 17279, 17320, 17334, 17335, 17336, 17418, 17575, 17576, 17588, 17589, 17594, 17679, 17715, 17750, 17756, 17788, 17794, 17833, 17839, 17865, 17871, 17873, 17875, 17876, 17877, 17947, 17949, 17984, 18020, 18021, 18082, 18121, 18150, 18179, 18208, 18209, 18305, 18385, 18386, 18414, 18511, 18512, 18587, 18624, 18704, 18741, 18825, 18862, 18942, 18979, 19065, 19102, 19189, 19226, 19310, 19347, 19427, 19464, 19561, 19598, 19695, 19732, 19828, 19857, 19894, 19986, 20025, 20062, 20063, 20192, 20202, 20204, 20206, 20207, 20219, 20228, 20237, 20292 ], "line_end_idx": [ 18, 19, 50, 84, 104, 119, 165, 186, 205, 427, 526, 528, 530, 532, 534, 536, 538, 540, 542, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 818, 822, 826, 830, 834, 838, 842, 846, 850, 854, 858, 862, 866, 870, 874, 878, 882, 886, 890, 894, 898, 902, 906, 910, 914, 918, 922, 926, 930, 934, 938, 942, 946, 950, 954, 958, 962, 966, 970, 974, 978, 982, 986, 990, 994, 998, 1002, 1006, 1010, 1014, 1018, 1022, 1026, 1030, 1034, 1038, 1042, 1046, 1050, 1054, 1058, 1062, 1066, 1070, 1074, 1078, 1082, 1086, 1090, 1094, 1098, 1102, 1106, 1110, 1114, 1118, 1122, 1126, 1130, 1134, 1138, 1142, 1146, 1150, 1154, 1158, 1162, 1166, 1170, 1174, 1178, 1182, 1186, 1190, 1194, 1198, 1202, 1206, 1210, 1214, 1218, 1222, 1226, 1230, 1234, 1238, 1242, 1246, 1250, 1254, 1258, 1262, 1266, 1270, 1274, 1278, 1282, 1286, 1290, 1294, 1298, 1302, 1306, 1310, 1314, 1318, 1322, 1326, 1330, 1334, 1338, 1342, 1346, 1350, 1354, 1358, 1362, 1366, 1370, 1374, 1378, 1382, 1386, 1390, 1394, 1398, 1402, 1406, 1410, 1414, 1418, 1422, 1426, 1430, 1434, 1438, 1442, 1446, 1450, 1454, 1458, 1462, 1466, 1470, 1474, 1478, 1482, 1486, 1490, 1494, 1498, 1502, 1506, 1510, 1514, 1518, 1522, 1526, 1530, 1534, 1538, 1542, 1546, 1550, 1554, 1558, 1562, 1566, 1570, 1574, 1578, 1582, 1586, 1590, 1594, 1598, 1602, 1606, 1610, 1614, 1618, 1622, 1626, 1630, 1634, 1638, 1642, 1646, 1650, 1654, 1658, 1662, 1666, 1670, 1674, 1678, 1682, 1686, 1690, 1694, 1698, 1702, 1706, 1710, 1714, 1718, 1722, 1726, 1730, 1734, 1738, 1742, 1746, 1750, 1754, 1758, 1762, 1766, 1770, 1774, 1778, 1782, 1786, 1790, 1794, 1798, 1802, 1806, 1810, 1814, 1818, 1822, 1826, 1830, 1834, 1838, 1842, 1846, 1850, 1854, 1858, 1862, 1866, 1870, 1874, 1878, 1882, 1886, 1890, 1894, 1898, 1902, 1906, 1910, 1914, 1918, 1922, 1926, 1930, 1934, 1938, 1942, 1946, 1950, 1954, 1958, 1962, 1966, 1970, 1974, 1978, 1982, 1986, 1990, 1994, 1998, 2002, 2006, 2010, 2014, 2018, 2022, 2026, 2030, 2034, 2038, 2042, 2046, 2050, 2054, 2058, 2062, 2066, 2070, 2074, 2078, 2082, 2086, 2090, 2094, 2098, 2102, 2106, 2110, 2114, 2118, 2122, 2126, 2130, 2134, 2138, 2142, 2146, 2150, 2154, 2158, 2162, 2166, 2170, 2174, 2178, 2182, 2186, 2190, 2194, 2198, 2202, 2206, 2210, 2214, 2218, 2222, 2226, 2230, 2234, 2238, 2242, 2246, 2250, 2254, 2258, 2262, 2266, 2270, 2274, 2278, 2282, 2286, 2290, 2294, 2298, 2302, 2306, 2310, 2314, 2318, 2322, 2326, 2330, 2334, 2338, 2342, 2345, 2361, 2364, 2373, 2376, 2403, 2406, 2480, 2493, 2496, 2542, 2545, 2621, 2695, 2773, 2776, 2848, 2911, 2980, 3025, 3028, 3104, 3180, 3239, 3242, 3245, 3246, 3332, 3334, 3353, 3405, 3428, 3434, 3450, 3456, 3468, 3470, 3472, 3473, 3580, 3582, 3623, 3687, 3748, 3762, 3801, 3830, 3859, 3888, 3948, 4036, 4055, 4096, 4097, 4193, 4199, 4222, 4245, 4323, 4339, 4345, 4346, 4371, 4468, 4469, 4497, 4594, 4595, 4682, 4688, 4711, 4734, 4827, 4843, 4849, 4850, 4940, 4946, 4969, 4992, 5090, 5106, 5112, 5113, 5175, 5235, 5311, 5323, 5324, 5353, 5370, 5477, 5483, 5506, 5519, 5642, 5670, 5718, 5761, 5837, 5850, 5966, 5992, 6005, 6099, 6127, 6156, 6162, 6163, 6186, 6234, 6322, 6391, 6431, 6487, 6528, 6542, 6590, 6690, 6734, 6789, 6790, 6831, 6845, 6893, 6985, 7049, 7111, 7165, 7206, 7220, 7221, 7245, 7333, 7408, 7482, 7483, 7510, 7551, 7565, 7688, 7695, 7745, 7774, 7832, 7924, 7950, 7954, 8022, 8104, 8146, 8156, 8185, 8208, 8234, 8270, 8320, 8327, 8364, 8404, 8444, 8451, 8459, 8503, 8535, 8549, 8685, 8715, 8720, 8751, 8775, 8784, 8822, 8883, 8954, 8990, 9080, 9170, 9179, 9198, 9203, 9213, 9233, 9237, 9340, 9395, 9452, 9523, 9577, 9638, 9645, 9739, 9765, 9806, 9820, 9901, 9909, 9941, 9967, 10005, 10044, 10128, 10150, 10151, 10164, 10219, 10273, 10314, 10328, 10439, 10532, 10540, 10579, 10602, 10681, 10711, 10777, 10827, 10854, 10962, 11032, 11071, 11076, 11165, 11218, 11246, 11281, 11302, 11330, 11359, 11400, 11414, 11430, 11547, 11640, 11648, 11687, 11710, 11734, 11780, 11859, 11889, 11954, 12004, 12031, 12149, 12235, 12274, 12279, 12368, 12421, 12449, 12484, 12505, 12533, 12562, 12603, 12617, 12637, 12638, 12663, 12736, 12776, 12886, 12891, 12916, 12941, 12950, 12981, 13028, 13034, 13057, 13075, 13109, 13119, 13178, 13204, 13214, 13220, 13249, 13255, 13308, 13314, 13340, 13346, 13368, 13405, 13444, 13497, 13513, 13570, 13607, 13617, 13640, 13675, 13685, 13711, 13744, 13750, 13775, 13787, 13814, 13829, 13862, 13871, 13896, 13919, 13949, 14007, 14058, 14095, 14133, 14193, 14216, 14241, 14266, 14275, 14287, 14296, 14350, 14391, 14405, 14509, 14514, 14542, 14566, 14587, 14610, 14628, 14667, 14690, 14721, 14731, 14751, 14782, 14806, 14832, 14861, 14880, 14909, 14942, 14983, 14997, 14998, 15065, 15112, 15165, 15166, 15294, 15305, 15345, 15376, 15409, 15436, 15477, 15552, 15601, 15672, 15737, 15760, 15770, 15777, 15813, 15877, 15935, 15947, 15975, 16017, 16073, 16186, 16272, 16328, 16366, 16373, 16395, 16484, 16555, 16620, 16621, 16659, 16706, 16713, 16807, 16814, 16834, 16841, 16893, 16946, 16953, 17039, 17050, 17061, 17075, 17096, 17124, 17152, 17180, 17201, 17222, 17251, 17252, 17278, 17279, 17320, 17334, 17335, 17336, 17418, 17575, 17576, 17588, 17589, 17594, 17679, 17715, 17750, 17756, 17788, 17794, 17833, 17839, 17865, 17871, 17873, 17875, 17876, 17877, 17947, 17949, 17984, 18020, 18021, 18082, 18121, 18150, 18179, 18208, 18209, 18305, 18385, 18386, 18414, 18511, 18512, 18587, 18624, 18704, 18741, 18825, 18862, 18942, 18979, 19065, 19102, 19189, 19226, 19310, 19347, 19427, 19464, 19561, 19598, 19695, 19732, 19828, 19857, 19894, 19986, 20025, 20062, 20063, 20192, 20202, 20204, 20206, 20207, 20219, 20228, 20237, 20292, 20293 ] }
{ "red_pajama_v2": { "ccnet_original_length": 20293, "ccnet_original_nlines": 972, "rps_doc_curly_bracket": 0.003843690035864711, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.07587961107492447, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.10852055996656418, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5451462268829346, "rps_doc_frac_unique_words": 0.3657947778701782, "rps_doc_mean_word_length": 4.584708213806152, "rps_doc_num_sentences": 208, "rps_doc_symbol_to_word_ratio": 0.000423910008976236, "rps_doc_unigram_entropy": 5.926826477050781, "rps_doc_word_count": 2485, "rps_doc_frac_chars_dupe_10grams": 0.23619766533374786, "rps_doc_frac_chars_dupe_5grams": 0.34222766757011414, "rps_doc_frac_chars_dupe_6grams": 0.31440359354019165, "rps_doc_frac_chars_dupe_7grams": 0.28245413303375244, "rps_doc_frac_chars_dupe_8grams": 0.2709558606147766, "rps_doc_frac_chars_dupe_9grams": 0.25313788652420044, "rps_doc_frac_chars_top_2gram": 0.03791802003979683, "rps_doc_frac_chars_top_3gram": 0.046344250440597534, "rps_doc_frac_chars_top_4gram": 0.04845080152153969, "rps_doc_books_importance": -2483.490478515625, "rps_doc_books_importance_length_correction": -2483.490478515625, "rps_doc_openwebtext_importance": -1574.859619140625, "rps_doc_openwebtext_importance_length_correction": -1574.859619140625, "rps_doc_wikipedia_importance": -1340.934326171875, "rps_doc_wikipedia_importance_length_correction": -1340.934326171875 }, "fasttext": { "dclm": 0.7448822259902954, "english": 0.42897775769233704, "fineweb_edu_approx": 2.017298698425293, "eai_general_math": 0.7182693481445312, "eai_open_web_math": 0.21271681785583496, "eai_web_code": 0.5221544504165649 } }
{ "free_decimal_correspondence": { "primary": { "code": "005.746", "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": "-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": "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
-2,500,094,439,207,875,000
Get the most out of your Centmin Mod LEMP stack Become a Member MariaDB Why does 123.08centos7beta02 my.cnf not include `innodb_buffer_pool_instances` variable? Discussion in 'Nginx, PHP-FPM & MariaDB MySQL' started by jeffwidman, Apr 18, 2015. 1. jeffwidman jeffwidman Active Member 152 27 28 Dec 3, 2014 Ratings: +51 Local Time: 9:02 AM Hey George, Setting up a new server, and was just poking through the default my.cnf for centos7 beta2 and noticed there's no `innodb_buffer_pool_instances` variable: XtraDB/InnoDB Server System Variables - MariaDB Knowledge Base Curious why you didn't include that? Seems like a reasonable thing to include--it's the second thing I tweak in my.cnf normally after increasing the innodb_buffer_pool_size. You've got a number of other variables in there that are commented out for optional tweaking that I never touch. FYI--the new default in MariaDB 10 is 8 instead of the old 1. It's a bit high for the VPSs that most folks on here run, but Maria seems smart enough that `SHOW ENGINE INNODB STATUS` on my 2GB VPS looks like there's only 1 instance. I don't know how it handles when it's a 4GB RAM (where I'd normally set instances at 2-3 depending on how much RAM I give MariaDB). Β  2. eva2000 eva2000 Administrator Staff Member 46,661 10,590 113 May 24, 2014 Brisbane, Australia Ratings: +16,435 Local Time: 2:02 AM Nginx 1.19.x MariaDB 5.5/10.x As per official doc MariaDB 10 already defaults innodb_buffer_pool_instances to 8 and that happens regardless of whether variable is set in /etc/my.cnf and has some smart auto detecting for >1GB buffer pools. Centmin Mod default innodb buffer pool = 48MB in size, so would hardly trigger innodb_buffer_pool_instances division automatically. So setting innodb_buffer_pool_instances would have no effect on default out of box Centmin Mod .08 beta install with MariaDB 10. Some settings are left to end users to tune for their specific needs. If are messing around with InnoDB specific /etc/my.cnf settings, then you should at least be this much clued into tuning for InnoDB performance in MySQL. Afterall, Centmin Mod is provided as is :) also see XtraDB/InnoDB Buffer Pool - MariaDB Knowledge Base Β  3. jeffwidman jeffwidman Active Member 152 27 28 Dec 3, 2014 Ratings: +51 Local Time: 9:02 AM Yeah, it's more I was hoping you could just add it as a commented out line. I have an Ansible script that wraps Centminmod so I don't forget my various customizations that are scattered throughout various parts of centminmod (mysql character set utf8, turnoff ftp, increase memcache cache size, etc). And easy to wrap in ntpd, disabling passwords for sshd, etc. I basically just converted my "Notes_on_setting_up_a_server.txt" into code, so it's both faster and correctly documented. For the my.cnf, I used a regex to find and replace a couple of lines. I considered using my own template, but you're always adding little tweaks here and there, and I don't want to miss anything. :D So I figured a regex using Ansible's lineinfile module was better than using my own template. But if innodb_buffer_pool_instances isn't in there, there's nothing for the regex to match against. :( Definitely not worth worrying about if you don't want to, the two production VPSs that I run centminmod are both <8gb, so MariaDB defaults are fine. Mostly it just bothers my OCD that I can't parameterize the value. :whistle: Β  4. eva2000 eva2000 Administrator Staff Member 46,661 10,590 113 May 24, 2014 Brisbane, Australia Ratings: +16,435 Local Time: 2:02 AM Nginx 1.19.x MariaDB 5.5/10.x 5. jeffwidman jeffwidman Active Member 152 27 28 Dec 3, 2014 Ratings: +51 Local Time: 9:02 AM Zero worries mate. Get well and no rush on this. I'd be happy if it even got added in the next month. :) Β  6. rdan rdan Well-Known Member 5,048 1,242 113 May 25, 2014 Ratings: +1,880 Local Time: 12:02 AM Mainline 10.2 I have this innodb_buffer_pool_instances on my my.cnf since switching to MariaDb 10, but only set to 4 as I only allow 4GB buffer poll. Β  7. jeffwidman jeffwidman Active Member 152 27 28 Dec 3, 2014 Ratings: +51 Local Time: 9:02 AM Did some testing. As long as innodb_buffer_pool_size is less than 1GB, there's only 1 buffer pool. As soon as it increases beyond 1 GB, MariaDB immediately defaults to 8 buffer pools, which is too high for most VPS's. For anyone in the 2gb-8gb RAM VPS range, since you'll likely be setting innodb_buffer_pool size > 1 GB, but less than 8gb, so be sure to also manually set innodb_buffer_pool_instances... ideally around 1GB each. Otherwise you'll think you're increasing performance, but you're probably actually decreasing it. @eva2000 maybe make a note in the wiki page on mysql about this? Β  8. rdan rdan Well-Known Member 5,048 1,242 113 May 25, 2014 Ratings: +1,880 Local Time: 12:02 AM Mainline 10.2 Yes, I have it like this: innodb_buffer_pool_size = 4G innodb_buffer_pool_instances = 4 Β  9. eva2000 eva2000 Administrator Staff Member 46,661 10,590 113 May 24, 2014 Brisbane, Australia Ratings: +16,435 Local Time: 2:02 AM Nginx 1.19.x MariaDB 5.5/10.x yup my quoted info at MariaDB - Why does 123.08centos7beta02 my.cnf not include `innodb_buffer_pool_instances` variable? | Centmin Mod Community mentions this it goes back to my initial assumption with regards to not enabling innodb by default, it is assumed that folks enabling innodb are versed and know innodb specific tuning requirements and that they would know or read innodb docs as such. It's why just blindly switching to innodb from myisam isn't a magic bullet that would give you the performance you may expect. You still need to know how to tune innodb parameters specifically. Centmin Mod only provides the tools, the rest such as software optimisation like nginx, php-fpm and mariadb mysql is up to end user :) Β 
{ "url": "https://community.centminmod.com/threads/why-does-123-08centos7beta02-my-cnf-not-include-innodb_buffer_pool_instances-variable.2796/", "source_domain": "community.centminmod.com", "snapshot_id": "crawl=CC-MAIN-2021-21", "warc_metadata": { "Content-Length": "152249", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XRGAGON3PGEQ44ZJTEXAQGJLGQCG2W7Y", "WARC-Concurrent-To": "<urn:uuid:334eb8b6-8631-4311-b63d-90d5e4790914>", "WARC-Date": "2021-05-14T16:02:10Z", "WARC-IP-Address": "104.18.11.170", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IV7SG7WOBJWMJFVHPE26UFBCHXB6SPRX", "WARC-Record-ID": "<urn:uuid:c795bbdd-9984-4ae3-9da5-c0279b92a55e>", "WARC-Target-URI": "https://community.centminmod.com/threads/why-does-123-08centos7beta02-my-cnf-not-include-innodb_buffer_pool_instances-variable.2796/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:194d87d5-d82b-4cad-af4e-cde6d10518ba>" }, "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-25.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, 48, 64, 65, 162, 163, 247, 248, 264, 265, 294, 295, 303, 310, 317, 333, 346, 354, 370, 382, 398, 619, 620, 661, 662, 916, 917, 1285, 1286, 1292, 1305, 1306, 1345, 1346, 1357, 1368, 1376, 1393, 1417, 1430, 1442, 1458, 1470, 1487, 1508, 2249, 2250, 2314, 2315, 2321, 2337, 2338, 2367, 2368, 2376, 2383, 2390, 2406, 2419, 2427, 2443, 2455, 2535, 2536, 2948, 2949, 3349, 3350, 3580, 3586, 3599, 3600, 3639, 3640, 3651, 3662, 3670, 3687, 3711, 3724, 3736, 3752, 3764, 3781, 3802, 3818, 3819, 3848, 3849, 3857, 3864, 3871, 3887, 3900, 3908, 3924, 3936, 4045, 4051, 4061, 4062, 4089, 4090, 4100, 4110, 4118, 4135, 4148, 4159, 4175, 4188, 4201, 4210, 4350, 4356, 4372, 4373, 4402, 4403, 4411, 4418, 4425, 4441, 4454, 4462, 4478, 4490, 4512, 4513, 4598, 4721, 4722, 5036, 5037, 5106, 5112, 5122, 5123, 5150, 5151, 5161, 5171, 5179, 5196, 5209, 5220, 5236, 5249, 5262, 5271, 5301, 5334, 5371, 5377, 5390, 5391, 5430, 5431, 5442, 5453, 5461, 5478, 5502, 5515, 5527, 5543, 5555, 5572, 5593, 5756, 5757, 6327 ], "line_end_idx": [ 48, 64, 65, 162, 163, 247, 248, 264, 265, 294, 295, 303, 310, 317, 333, 346, 354, 370, 382, 398, 619, 620, 661, 662, 916, 917, 1285, 1286, 1292, 1305, 1306, 1345, 1346, 1357, 1368, 1376, 1393, 1417, 1430, 1442, 1458, 1470, 1487, 1508, 2249, 2250, 2314, 2315, 2321, 2337, 2338, 2367, 2368, 2376, 2383, 2390, 2406, 2419, 2427, 2443, 2455, 2535, 2536, 2948, 2949, 3349, 3350, 3580, 3586, 3599, 3600, 3639, 3640, 3651, 3662, 3670, 3687, 3711, 3724, 3736, 3752, 3764, 3781, 3802, 3818, 3819, 3848, 3849, 3857, 3864, 3871, 3887, 3900, 3908, 3924, 3936, 4045, 4051, 4061, 4062, 4089, 4090, 4100, 4110, 4118, 4135, 4148, 4159, 4175, 4188, 4201, 4210, 4350, 4356, 4372, 4373, 4402, 4403, 4411, 4418, 4425, 4441, 4454, 4462, 4478, 4490, 4512, 4513, 4598, 4721, 4722, 5036, 5037, 5106, 5112, 5122, 5123, 5150, 5151, 5161, 5171, 5179, 5196, 5209, 5220, 5236, 5249, 5262, 5271, 5301, 5334, 5371, 5377, 5390, 5391, 5430, 5431, 5442, 5453, 5461, 5478, 5502, 5515, 5527, 5543, 5555, 5572, 5593, 5756, 5757, 6327, 6332 ] }
{ "red_pajama_v2": { "ccnet_original_length": 6332, "ccnet_original_nlines": 171, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3147566616535187, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.042386189103126526, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.30298271775245667, "rps_doc_frac_unique_words": 0.42274677753448486, "rps_doc_mean_word_length": 4.843347549438477, "rps_doc_num_sentences": 74, "rps_doc_symbol_to_word_ratio": 0.0007849300163798034, "rps_doc_unigram_entropy": 5.573556423187256, "rps_doc_word_count": 932, "rps_doc_frac_chars_dupe_10grams": 0.17988480627536774, "rps_doc_frac_chars_dupe_5grams": 0.22463446855545044, "rps_doc_frac_chars_dupe_6grams": 0.2153300791978836, "rps_doc_frac_chars_dupe_7grams": 0.2153300791978836, "rps_doc_frac_chars_dupe_8grams": 0.2153300791978836, "rps_doc_frac_chars_dupe_9grams": 0.2153300791978836, "rps_doc_frac_chars_top_2gram": 0.01794417016208172, "rps_doc_frac_chars_top_3gram": 0.023039430379867554, "rps_doc_frac_chars_top_4gram": 0.02835622988641262, "rps_doc_books_importance": -672.712158203125, "rps_doc_books_importance_length_correction": -672.712158203125, "rps_doc_openwebtext_importance": -312.26055908203125, "rps_doc_openwebtext_importance_length_correction": -312.26055908203125, "rps_doc_wikipedia_importance": -234.47264099121094, "rps_doc_wikipedia_importance_length_correction": -234.47264099121094 }, "fasttext": { "dclm": 0.05964953079819679, "english": 0.9075554013252258, "fineweb_edu_approx": 1.1097341775894165, "eai_general_math": 0.3075416088104248, "eai_open_web_math": 0.28950226306915283, "eai_web_code": 0.1121668815612793 } }
{ "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.72", "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": "-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,242,514,781,259,357,000
reddit's stories are created by its users join the community, vote, and change the world. learn more β€Ί Why is there both an e-mail AND a Gmail app??? by chka in Android [–]dajmeister 0 points1 point Β (0 children) sorry, this has been archived and can no longer be voted on Honestly i just pull all my email into gmail using either pop3 or forwarding and manage it all through the gmail app. The gmail app even allows you to set what email to reply from (if you have set them all up on the web). Why does Reddit look like this on Honeycomb? by Nico_ in Android [–]dajmeister 0 points1 point Β (0 children) sorry, this has been archived and can no longer be voted on There is a free version, that's the one I linked to. Android Is Destroying Everyone, Especially RIM -- iPhone Dead In Water by gst in Android [–]dajmeister 0 points1 point Β (0 children) sorry, this has been archived and can no longer be voted on Yeah even if they keep 25% share forever they are still growing their numbers, the smartphone market as a total is exploding. Asus EeePad Transformer with Keyboard dock for 429GBP (16Gb) by dajmeister in Android [–]dajmeister[S] 0 points1 point Β (0 children) sorry, this has been archived and can no longer be voted on This definitely is interesting given that the Xoom 32gig wifi version is retailing for 499 in the UK. Why can't I start researching the f-80A? by [deleted] in Warthunder [–]dajmeister -1 points0 points Β (0 children) sorry, this has been archived and can no longer be voted on There are a lot of great, fun to fly planes in that line, so when you don't have such a hankering for jets you should totally check them out! How do I deal with turn fighers? by SCREECH95 in Warthunder [–]dajmeister -1 points0 points Β (0 children) sorry, this has been archived and can no longer be voted on you are faster than them in the horizontal. drag them towards friendlies. or run away far enough to get some altitude. Just bought a new Samsung Galaxy S2, what next? by [deleted] in Android [–]dajmeister 1 point2 points *Β (0 children) sorry, this has been archived and can no longer be voted on Well seeing where we are you should definately get in on the open alpha of baconreader http://www.baconreader.com/ (imo the best reddit app for android phones) Edit: Tweetdeck is my favorite Twitter client (with some buzz/facebook/foursquare thrown in for good measure) Beautiful Widgets is a really nice skinnable set of clock and weather widgets. Some more to look at: Tasker TuneIn Radio Also have a browse through the installed apps on my phone How to manually update Nexus S to Android 2.3.4 by had1 in Android [–]dajmeister 1 point2 points Β (0 children) sorry, this has been archived and can no longer be voted on Seeing as Nexus phones have unlocked bootloaders, there is no need to wait for a rooted rom (if you are afraid it will never be rooted). Because you can just flash back to whatever rom/recovery you want.
{ "url": "http://www.reddit.com/user/dajmeister?sort=controversial", "source_domain": "www.reddit.com", "snapshot_id": "crawl=CC-MAIN-2015-11", "warc_metadata": { "Content-Length": "93921", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:Y5NHIBXY6GP5WSCIYUOG7VA5KOKR2SN2", "WARC-Concurrent-To": "<urn:uuid:ecae9a96-e6d4-4b98-bc7e-2c3384012218>", "WARC-Date": "2015-02-28T12:48:56Z", "WARC-IP-Address": "198.41.209.139", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:5UILWOJHX4HM22YSRKQBMQWUCN4KOPWS", "WARC-Record-ID": "<urn:uuid:2f5b062e-2b29-4e24-9520-f6b2a173e39e>", "WARC-Target-URI": "http://www.reddit.com/user/dajmeister?sort=controversial", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7872418f-9eb2-4dd2-8d94-5230c7ae800f>" }, "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, 42, 43, 91, 92, 105, 106, 172, 173, 217, 218, 278, 279, 397, 398, 502, 503, 568, 569, 613, 614, 674, 675, 728, 729, 818, 819, 863, 864, 924, 925, 1051, 1052, 1138, 1139, 1186, 1187, 1247, 1248, 1350, 1351, 1419, 1420, 1466, 1467, 1527, 1528, 1670, 1671, 1731, 1732, 1778, 1779, 1839, 1840, 1959, 1960, 2032, 2033, 2078, 2079, 2139, 2140, 2300, 2301, 2411, 2412, 2491, 2492, 2514, 2515, 2535, 2536, 2594, 2595, 2662, 2663, 2707, 2708, 2768, 2769 ], "line_end_idx": [ 42, 43, 91, 92, 105, 106, 172, 173, 217, 218, 278, 279, 397, 398, 502, 503, 568, 569, 613, 614, 674, 675, 728, 729, 818, 819, 863, 864, 924, 925, 1051, 1052, 1138, 1139, 1186, 1187, 1247, 1248, 1350, 1351, 1419, 1420, 1466, 1467, 1527, 1528, 1670, 1671, 1731, 1732, 1778, 1779, 1839, 1840, 1959, 1960, 2032, 2033, 2078, 2079, 2139, 2140, 2300, 2301, 2411, 2412, 2491, 2492, 2514, 2515, 2535, 2536, 2594, 2595, 2662, 2663, 2707, 2708, 2768, 2769, 2972 ] }
{ "red_pajama_v2": { "ccnet_original_length": 2972, "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.4283439517021179, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.019108280539512634, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18630573153495789, "rps_doc_frac_unique_words": 0.45945945382118225, "rps_doc_mean_word_length": 4.430501937866211, "rps_doc_num_sentences": 22, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.0128045082092285, "rps_doc_word_count": 518, "rps_doc_frac_chars_dupe_10grams": 0.30936819314956665, "rps_doc_frac_chars_dupe_5grams": 0.30936819314956665, "rps_doc_frac_chars_dupe_6grams": 0.30936819314956665, "rps_doc_frac_chars_dupe_7grams": 0.30936819314956665, "rps_doc_frac_chars_dupe_8grams": 0.30936819314956665, "rps_doc_frac_chars_dupe_9grams": 0.30936819314956665, "rps_doc_frac_chars_top_2gram": 0.0313725508749485, "rps_doc_frac_chars_top_3gram": 0.048801738768815994, "rps_doc_frac_chars_top_4gram": 0.062745101749897, "rps_doc_books_importance": -348.7764892578125, "rps_doc_books_importance_length_correction": -348.7764892578125, "rps_doc_openwebtext_importance": -165.62603759765625, "rps_doc_openwebtext_importance_length_correction": -165.62603759765625, "rps_doc_wikipedia_importance": -141.80638122558594, "rps_doc_wikipedia_importance_length_correction": -141.80638122558594 }, "fasttext": { "dclm": 0.14473140239715576, "english": 0.9415808320045471, "fineweb_edu_approx": 1.1816933155059814, "eai_general_math": 0.01744895987212658, "eai_open_web_math": 0.19831925630569458, "eai_web_code": 0.0001702900044620037 } }
{ "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": "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": "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": "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
End of preview. Expand in Data Studio

πŸ’» EAI-Taxonomy Code w/ DCLM

πŸ† Website | πŸ–₯️ Code | πŸ“– Paper

A 564 billion token dataset of high-quality code curated from web data using taxonomy-based filtering.

🎯 Dataset Overview

This dataset is part of the Essential-Web project, which introduces a new paradigm for dataset curation using expressive metadata and simple semantic filters. Unlike traditional code datasets that require complex domain-specific pipelines, our approach leverages a 12-category taxonomy to efficiently identify and extract high-quality code data.

πŸ’‘ EAI-Taxonomy Code w/ DCLM (564B tokens): Documents targeting code that exhibit intermediate to advanced reasoning, combined with the DCLM classifier to filter for instruction-dense documents. Also includes mathematics content (51 - Mathematics) to match the scope of existing code datasets.

πŸ† Performance

Our taxonomy-based approach achieves competitive results with significantly less curation effort:

Dataset HumanEval+ MBPP+ MMLU-CS Curation Complexity
DCLM-baseline 28.0% 45.5% 32.0% General web filtering
OpenCoder FW 26.2% 45.8% 27.7% Complex domain pipeline
EAI-Taxonomy Code 27.4% 46.6% 29.0% Simple semantic filter
EAI-Taxonomy Code w/ DCLM 28.7% 45.0% 47.0% + DCLM classifier

Results show competitive code generation performance with a +46.8% improvement in computer science knowledge (MMLU-CS) compared to baseline.

πŸ” Key Findings

  • Code Generation: All datasets perform within statistical error on single-function generation benchmarks (HumanEval+, MBPP+)
  • Code Knowledge: Clear impact on general computer science knowledge when using taxonomy-curated data
  • Efficiency: Achieves strong performance without complex domain-specific curation pipelines

Dataset Schema Documentation

Overview

This dataset contains web-crawled text data with comprehensive metadata, quality signals, and taxonomic classifications. Each record represents a document extracted from web archives with detailed provenance tracking and quality assessment metrics.

Core Fields

Field Type Description Path
id Int64 Unique identifier based on document hash id
text String The main textual content of the document text

EAI Taxonomy Classification

Comprehensive hierarchical classification system with primary and secondary labels - the most important feature of this dataset. The taxonomy is designed to provide detailed subject categorization, document type identification, content quality assessment, and extraction quality indicators.

Free Decimal Correspondence (FDC)

A Dewey Decimal-inspired classification system with 3-level hierarchical labels. The FDC provides nested categories where each successive level refines its parent category. It's designed to be compatible with the Dewey Decimal System for library cataloging.

Level Structure:

  • Level 1: Top-level categories (0-9) covering broad subject areas like General works, Philosophy, Religion, Social Sciences, etc.
  • Level 2: Sub-divisions (00-99) that refine Level 1 categories
  • Level 3: Specific categories (000-999) that further refine Level 2 categories
Component Description Path
Primary Code Main classification code eai_taxonomy.free_decimal_correspondence.primary.code
Primary Level 1 Top-level category (0=General works, 1=Philosophy, 2=Religion, 3=Social Sciences, 4=Language, 5=Science, 6=Technology, 7=Arts, 8=Literature, 9=History/Geography) eai_taxonomy.free_decimal_correspondence.primary.labels.level_1
Primary Level 2 Mid-level category eai_taxonomy.free_decimal_correspondence.primary.labels.level_2
Primary Level 3 Specific category eai_taxonomy.free_decimal_correspondence.primary.labels.level_3
Secondary Code Alternative classification code eai_taxonomy.free_decimal_correspondence.secondary.code
Secondary Level 1 Alternative top-level category eai_taxonomy.free_decimal_correspondence.secondary.labels.level_1
Secondary Level 2 Alternative mid-level category eai_taxonomy.free_decimal_correspondence.secondary.labels.level_2
Secondary Level 3 Alternative specific category eai_taxonomy.free_decimal_correspondence.secondary.labels.level_3

We recommend this viewer for easily navigating the FDC categories when curating filters: https://www.librarything.com/mds

Bloom's Taxonomy Integration

Based on Anderson and Krathwohl's 2001 revision of Bloom's Taxonomy of Educational Objectives, providing two complementary categorization dimensions for educational content analysis.

Knowledge Domain

Categorizes the type of knowledge demonstrated in the document:

Component Description Path
Primary Code Main knowledge domain code eai_taxonomy.bloom_knowledge_domain.primary.code
Primary Label Main knowledge domain label eai_taxonomy.bloom_knowledge_domain.primary.label
Secondary Code Alternative knowledge domain code eai_taxonomy.bloom_knowledge_domain.secondary.code
Secondary Label Alternative knowledge domain label eai_taxonomy.bloom_knowledge_domain.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
1 Factual Basic elements to learn or solve problems
2 Conceptual Interrelationships between basic elements within larger context
3 Procedural Methods and techniques in the discipline
4 Metacognitive Awareness of how learning works in relation to oneself

Cognitive Processing Level

Assesses the learning and thinking skill levels demonstrated by the document author:

Component Description Path
Primary Code Main cognitive process code eai_taxonomy.bloom_cognitive_process.primary.code
Primary Label Main cognitive process label eai_taxonomy.bloom_cognitive_process.primary.label
Secondary Code Alternative cognitive process code eai_taxonomy.bloom_cognitive_process.secondary.code
Secondary Label Alternative cognitive process label eai_taxonomy.bloom_cognitive_process.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
1 Remember Retrieve relevant knowledge from memory
2 Understand Determine meaning of instructional messages
3 Apply Use a procedure in a given situation
4 Analyze Break materials into components and determine relationships
5 Evaluate Make judgments based on criteria and standards
6 Create Create new or original work
Document Characteristics

Document Type v1

In-house classification of common web document types and formats:

Component Description Path
Primary Code Main document type code eai_taxonomy.document_type_v1.primary.code
Primary Label Main document type label eai_taxonomy.document_type_v1.primary.label
Secondary Code Alternative document type code eai_taxonomy.document_type_v1.secondary.code
Secondary Label Alternative document type label eai_taxonomy.document_type_v1.secondary.label

Possible Values:

Code Label Examples
-1 Abstain Unable to classify
1 News/Editorial CNN articles, opinion columns
2 Academic/Research ArXiv papers, research articles
3 Reference/Encyclopedic/Educational FAQs, Wikipedia entries
4 Code/Software GitHub repos, code examples
5 Social/Forum Conversation threads, Q&A boards
6 Promotional/Advertisement Product pages, calls to action
7 Search/Directory/Bibliography Link pages, search results
8 Adult/Pornographic Adult content
9 Personal/Misc Blogs, user profiles
10 Machine-Generated Lorem ipsum, garbled text
11 Legal/Regulatory Contracts, terms of service
12 Government/Political Legislation, press releases
13 Literary/Creative Poems, short stories
14 Reviews/Critiques Film critiques, product reviews
15 E-Commerce/Marketplace eBay listings, Amazon pages
16 Images/Videos/Audio YouTube videos, Imgur pages
17 Other/Unclassified Documents that resist classification

Document Type v2

Updated classification based on WebOrganizer taxonomy with refined categories for improved document classification accuracy:

Component Description Path
Primary Code Main document type code (v2) eai_taxonomy.document_type_v2.primary.code
Primary Label Main document type label (v2) eai_taxonomy.document_type_v2.primary.label
Secondary Code Alternative document type code (v2) eai_taxonomy.document_type_v2.secondary.code
Secondary Label Alternative document type label (v2) eai_taxonomy.document_type_v2.secondary.label

Complete Value Mapping:

Code Label Examples
-1 Abstain Documents requiring human review
1 About (Org.) Company about pages, mission statements
2 About (Personal) Personal bios, LinkedIn profiles
3 Academic Writing Research papers, abstracts, dissertations
4 Audio Transcript Interview transcripts, court records, captions
5 Comment Section Reddit threads, blog comments
6 Content Listing Site maps, product catalogs, directory listings
7 Creative Writing Song lyrics, novel excerpts, poetry
8 Documentation API docs, README files, user manuals
9 FAQ FAQ pages, Q&A lists
10 Knowledge Article Wikipedia articles, Britannica entries
11 Legal Notices Privacy policies, license agreements, terms of service
12 Listicle Buzzfeed-style articles, "Top 10" lists
13 News (Org.) Government blog posts, corporate announcements
14 News Article Newspaper articles, CNN content, breaking news
15 Nonfiction Writing Editorials, obituaries, memoirs, opinion pieces
16 Personal Blog Personal journals, diary entries, lifestyle blogs
17 Product Page Product descriptions, course offerings, sales pages
18 Q&A Forum Quora posts, Stack Exchange discussions
19 Spam / Ads SEO keyword stuffing, promotional spam
20 Structured Data Datasheets, glossaries, JSON files, databases
21 Customer Support Help articles, troubleshooting guides
22 Truncated Paywalled sites, image galleries, partial content
23 Tutorial Cooking recipes, WikiHow pages, step-by-step guides
24 User Review Yelp reviews, TripAdvisor feedback, product reviews
25 Other/Unclassified Miscellaneous documents not fitting other categories

Extraction Artifacts

Assessment of technical extraction quality, identifying issues from HTML-to-text conversion:

Component Description Path
Primary Code Main extraction artifact code eai_taxonomy.extraction_artifacts.primary.code
Primary Label Main extraction artifact label eai_taxonomy.extraction_artifacts.primary.label
Secondary Code Alternative extraction artifact code eai_taxonomy.extraction_artifacts.secondary.code
Secondary Label Alternative extraction artifact label eai_taxonomy.extraction_artifacts.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
0 No Artifacts Clean text with no leftover HTML or irrelevant elements
1 Leftover HTML HTML/code artifacts remaining after extraction
2 Text Extraction Errors Broken math expressions, encoding errors, improperly parsed tables
3 Irrelevant Content Headers, footers, nav menus extracted by mistake
4 Indeterminate Insufficient content to judge

Missing Content

Assessment of content completeness and extraction success:

Component Description Path
Primary Code Main missing content code eai_taxonomy.missing_content.primary.code
Primary Label Main missing content label eai_taxonomy.missing_content.primary.label
Secondary Code Alternative missing content code eai_taxonomy.missing_content.secondary.code
Secondary Label Alternative missing content label eai_taxonomy.missing_content.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
0 No Missing Content Complete and coherent text
1 Truncated Snippets Obvious "...", incomplete paragraphs, cut-off text
2 Click Here References "Download here", "Click here" without linked content
3 Incoherent Flow Unreadable or illogical flow due to missing context
4 Missing Images or Figures Placeholders or references to missing visual content
5 Missing Referenced Data References to absent tables/datasets (e.g., "See Table 3")
6 Indeterminate Insufficient content to judge

Text Structure Information

Field Type Description Path
Line Start Indices List[Int32] Starting indices of each line line_start_n_end_idx.line_start_idx
Line End Indices List[Int32] Ending indices of each line line_start_n_end_idx.line_end_idx
Content Quality Dimensions

Quality assessment inspired by NaturalReasoning and FineWeb efforts to categorize web data by information sophistication.

Reasoning Depth

Assesses the complexity and sophistication of logical reasoning in the document:

Component Description Path
Primary Code Main reasoning depth code eai_taxonomy.reasoning_depth.primary.code
Primary Label Main reasoning depth label eai_taxonomy.reasoning_depth.primary.label
Secondary Code Alternative reasoning depth code eai_taxonomy.reasoning_depth.secondary.code
Secondary Label Alternative reasoning depth label eai_taxonomy.reasoning_depth.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
1 No Reasoning Facts present but no evidence of reasoning
2 Basic Reasoning Basic analysis with minimal explanation and summarization
3 Intermediate Reasoning Some logical steps connecting ideas and structured thinking
4 Advanced Reasoning Multi-step reasoning and thorough analysis with well-developed explanations
5 Exceptional Reasoning Novel abstractions, theoretical frameworks, long chain-of-thought, original insights, or proofs
6 Indeterminate Insufficient context to judge

Technical Correctness

Evaluates the accuracy and precision of technical information:

Component Description Path
Primary Code Main technical correctness code eai_taxonomy.technical_correctness.primary.code
Primary Label Main technical correctness label eai_taxonomy.technical_correctness.primary.label
Secondary Code Alternative technical correctness code eai_taxonomy.technical_correctness.secondary.code
Secondary Label Alternative technical correctness label eai_taxonomy.technical_correctness.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
1 Technically Flawed Significant errors undermining content validity
2 Partially Correct Some correctness but contains flaws, omissions, or errors
3 Mostly Correct Technical correctness with minor flaws or incomplete explanations
4 Highly Correct High technical correctness with precise definitions and clear explanations
5 Exceptionally Correct Exceptional technical correctness with formal proofs and flawless content
6 Not Applicable/Indeterminate No technical content or insufficient context

Education Level

Assesses the appropriate educational background required to comprehend the content:

Component Description Path
Primary Code Main education level code eai_taxonomy.education_level.primary.code
Primary Label Main education level label eai_taxonomy.education_level.primary.label
Secondary Code Alternative education level code eai_taxonomy.education_level.secondary.code
Secondary Label Alternative education level label eai_taxonomy.education_level.secondary.label

Possible Values:

Code Label Description
-1 Abstain Unable to determine
1 General Audience Accessible to anyone with basic literacy; simple terms
2 High School Level Requires high school education; specialized terminology explained for non-experts
3 Undergraduate Level Requires college education; uses specialized terminology and assumes background knowledge
4 Graduate/Expert Level Requires graduate education or domain expertise; assumes deep background knowledge
5 Indeterminate Insufficient content to judge educational level
Metadata

Metadata Structure

The metadata field contains a nested structure with web archive information:

Field Type Description Path
URL Information
URL String Original URL of the document metadata.url
Source Domain String Domain name of the source metadata.source_domain
Snapshot ID String Identifier for the web archive snapshot metadata.snapshot_id
WARC Metadata WARC (Web ARChive) format metadata
Content Length String Size of the content metadata.warc_metadata.Content-Length
Content Type String MIME type of the content metadata.warc_metadata.Content-Type
Block Digest String Checksum of the WARC block metadata.warc_metadata.WARC-Block-Digest
Concurrent To String Related WARC records metadata.warc_metadata.WARC-Concurrent-To
Date String Timestamp of the crawl metadata.warc_metadata.WARC-Date
IP Address String Source server IP address metadata.warc_metadata.WARC-IP-Address
Payload Type String Identified content type metadata.warc_metadata.WARC-Identified-Payload-Type
Payload Digest String Checksum of the payload metadata.warc_metadata.WARC-Payload-Digest
Record ID String Unique WARC record identifier metadata.warc_metadata.WARC-Record-ID
Target URI String Original target URL metadata.warc_metadata.WARC-Target-URI
Truncated String Truncation status metadata.warc_metadata.WARC-Truncated
Type String WARC record type metadata.warc_metadata.WARC-Type
Warcinfo ID String Associated warcinfo record metadata.warc_metadata.WARC-Warcinfo-ID
Additional Info
WARC Info String Additional WARC information metadata.warc_info
Quality Signals

The dataset includes two comprehensive quality assessment frameworks:

Red Pajama v2 Quality Metrics

Text quality indicators derived from the Red Pajama v2 filtering pipeline:

Content Structure Metrics

Metric Description Path
Original Length Original document length quality_signals.red_pajama_v2.ccnet_original_length
Original Lines Number of lines in original document quality_signals.red_pajama_v2.ccnet_original_nlines
Sentence Count Total sentence count quality_signals.red_pajama_v2.rps_doc_num_sentences
Word Count Total word count quality_signals.red_pajama_v2.rps_doc_word_count
Mean Word Length Average word length quality_signals.red_pajama_v2.rps_doc_mean_word_length

Language Quality Metrics

Metric Description Path
Stop Word Fraction Proportion of stop words quality_signals.red_pajama_v2.rps_doc_stop_word_fraction
Unique Words Fraction Fraction of unique words quality_signals.red_pajama_v2.rps_doc_frac_unique_words
All Caps Words Fraction of words in all capitals quality_signals.red_pajama_v2.rps_doc_frac_all_caps_words
Non-Alphabetic Words Fraction of non-alphabetic words quality_signals.red_pajama_v2.rps_doc_frac_no_alph_words
Unigram Entropy Entropy measure of word distribution quality_signals.red_pajama_v2.rps_doc_unigram_entropy

Content Pattern Analysis

Metric Description Path
Curly Bracket Density Curly bracket density (code indicator) quality_signals.red_pajama_v2.rps_doc_curly_bracket
Symbol-to-Word Ratio Symbol-to-word ratio quality_signals.red_pajama_v2.rps_doc_symbol_to_word_ratio
Ellipsis Line Endings Lines ending with ellipsis quality_signals.red_pajama_v2.rps_doc_frac_lines_end_with_ellipsis
Lorem Ipsum Detection Lorem ipsum text detection quality_signals.red_pajama_v2.rps_doc_lorem_ipsum
Offensive Content Potentially offensive content detection quality_signals.red_pajama_v2.rps_doc_ldnoobw_words
UT1 Blacklist UT1 blacklist filtering score quality_signals.red_pajama_v2.rps_doc_ut1_blacklist

Duplication Detection

Metric Description Path
5-gram Duplication Character-level duplication for 5-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_5grams
6-gram Duplication Character-level duplication for 6-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_6grams
7-gram Duplication Character-level duplication for 7-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_7grams
8-gram Duplication Character-level duplication for 8-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_8grams
9-gram Duplication Character-level duplication for 9-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_9grams
10-gram Duplication Character-level duplication for 10-grams quality_signals.red_pajama_v2.rps_doc_frac_chars_dupe_10grams
Top 2-gram Coverage Most frequent 2-gram coverage quality_signals.red_pajama_v2.rps_doc_frac_chars_top_2gram
Top 3-gram Coverage Most frequent 3-gram coverage quality_signals.red_pajama_v2.rps_doc_frac_chars_top_3gram
Top 4-gram Coverage Most frequent 4-gram coverage quality_signals.red_pajama_v2.rps_doc_frac_chars_top_4gram

Domain Importance Scores

Metric Description Path
Books Importance Similarity to book content quality_signals.red_pajama_v2.rps_doc_books_importance
Books Importance (Length Corrected) Length-corrected books similarity quality_signals.red_pajama_v2.rps_doc_books_importance_length_correction
OpenWebText Importance Similarity to OpenWebText quality_signals.red_pajama_v2.rps_doc_openwebtext_importance
OpenWebText Importance (Length Corrected) Length-corrected OpenWebText similarity quality_signals.red_pajama_v2.rps_doc_openwebtext_importance_length_correction
Wikipedia Importance Similarity to Wikipedia quality_signals.red_pajama_v2.rps_doc_wikipedia_importance
Wikipedia Importance (Length Corrected) Length-corrected Wikipedia similarity quality_signals.red_pajama_v2.rps_doc_wikipedia_importance_length_correction

FastText Classification Scores

Domain and content type classification probabilities:

Metric Description Path
DCLM Score DataComp-LM classifier score quality_signals.fasttext.dclm
English Confidence English language confidence quality_signals.fasttext.english
Educational Content Educational content approximation quality_signals.fasttext.fineweb_edu_approx
General Math General mathematics content quality_signals.fasttext.eai_general_math
Web Math OWM Web-based mathematics content quality_signals.fasttext.eai_open_web_math
Code Content Code content detection quality_signals.fasttext.eai_web_code

How to Load the Dataset

This section provides examples of how to load the EssentialAI/eai-taxonomy-code-w-dclm dataset using different Python libraries and frameworks.

Using Hugging Face Datasets (Standard Method)

The simplest way to load the dataset is using the Hugging Face datasets library:

from datasets import load_dataset

# Load the entire dataset
dataset = load_dataset("EssentialAI/eai-taxonomy-code-w-dclm")

# View dataset structure
print(dataset)
print(f"Number of examples: {len(dataset['train'])}")

You can also load the dataset in streaming mode to avoid downloading the entire dataset at once:

from datasets import load_dataset

# Load in streaming mode
dataset = load_dataset("EssentialAI/eai-taxonomy-code-w-dclm", streaming=True)
data_stream = dataset["train"]

# Iterate through examples
for example in data_stream.take(5):
    print(example)

Using PySpark

For large-scale distributed processing, you can load the dataset using PySpark with the pyspark_huggingface library:

# First install the required library:
# pip install pyspark_huggingface

import pyspark_huggingface
from pyspark.sql import SparkSession

# Initialize Spark session
spark = SparkSession.builder.appName("EAI-Taxonomy-Code-w-DCLM").getOrCreate()

# Load the dataset using the "huggingface" data source
df = spark.read.format("huggingface").load("EssentialAI/eai-taxonomy-code-w-dclm")

# Basic dataset exploration
print(f"Dataset shape: {df.count()} rows, {len(df.columns)} columns")
df.show(10)
df.printSchema()

# Load only specific columns for efficiency
df_subset = (
    spark.read.format("huggingface")
    .option("columns", '["column1", "column2"]')  # Replace with actual column names
    .load("EssentialAI/eai-taxonomy-code-w-dclm")
)

# Run SQL queries on the dataset
df.createOrReplaceTempView("eai_taxonomy_code_w_dclm_dataset")
result = spark.sql("""
    SELECT COUNT(*) as total_examples
    FROM eai_taxonomy_code_w_dclm_dataset
""")
result.show()

Using Daft

Daft provides a modern DataFrame library optimized for machine learning workloads. You can load the dataset directly from Hugging Face:

import daft

# Load the entire dataset
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-code-w-dclm")

# Basic exploration
print("Dataset schema:")
df.schema()

print("First 5 rows:")
df.show(5)

If you need to access private datasets or use authentication:

import daft
from daft.io import IOConfig, HTTPConfig

io_config = IOConfig(http=HTTPConfig(bearer_token="your_token"))
df = daft.read_parquet("hf://datasets/EssentialAI/eai-taxonomy-code-w-dclm", io_config=io_config)

Installation Requirements

Make sure you have the required libraries installed:

# For Hugging Face datasets
pip install datasets

# For PySpark with Hugging Face integration
pip install pyspark_huggingface

# For Daft
pip install daft

πŸ“ Citation

@misc{ai2025essentialwebv1024ttokens,
      title={Essential-Web v1.0: 24T tokens of organized web data}, 
      author={Essential AI and : and Andrew Hojel and Michael Pust and Tim Romanski and Yash Vanjani and Ritvik Kapila and Mohit Parmar and Adarsh Chaluvaraju and Alok Tripathy and Anil Thomas and Ashish Tanwer and Darsh J Shah and Ishaan Shah and Karl Stratos and Khoi Nguyen and Kurt Smith and Michael Callahan and Peter Rushton and Philip Monk and Platon Mazarakis and Saad Jamal and Saurabh Srivastava and Somanshu Singla and Ashish Vaswani},
      year={2025},
      eprint={2506.14111},
      archivePrefix={arXiv},
      primaryClass={cs.CL},
      url={https://arxiv.org/abs/2506.14111}, 
}
Downloads last month
536

Collection including EssentialAI/eai-taxonomy-code-w-dclm