EssentialAI/eai-taxonomy-code-w-dclm · Datasets at Hugging Face

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 adam+nospam@osnews.com 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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 (info@commoncrawl.org)\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">"New Database"</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">"Generate Key File..."</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"> "Add New Entry"</span> icon on the program toolbar. </p> <p> In the "New Entry" 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"> "Save Database"</span> icon. </p> <p> You may also want to enable <span class="gui">"Automatically save database after every change"</span> option from the <span class="gui">"Extras"</span> > <span class="gui">"Settings..."</span> > <span class="gui">"General (2)"</span> page. (On OS X, the page is found from <span class="gui">"KeePassX"</span> (Application menu) > <span class="gui">"Preferences"</span>.) </p> <a name="database_open" /> <h2>Opening a database</h2> <p> By default, on next startup, KeePassX opens a <span class="gui">"Enter Master Key"</span> dialog for the last used password database. If you wish to open another password database, click <span class="gui">"Cancel"</span> and click <span class="gui">"Open Database"</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">"View/Edit Entry"</span> icon on the program toolbar. </p> <p> To delete a password entry, first select the entry and click <span class="gui">"Delete Entry"</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">"Extras"</span> > <span class="gui">"Settings..."</span> > <span class="gui">"Advanced"</span> page and set the <span class="gui">"Global Auto-Type Shortcut"</span> by clicking the text box and typing the desired keyboard shortcut (e.g. <tt>Ctrl-Shift-N</tt>). Click <span class="gui">"OK"</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 "Google - Mozilla Firefox" </p> <p> Now, create new password entry, that contains user name "test". Then, click the small <span class="gui">"Tools"</span> button at the bottom of the <span class="gui">"New Entry"</span> dialog, and select <span class="gui">"Auto-Type: Select target window"</span> Select "Google - Mozilla Firefox" from the dropdown menu and click <span class="gui">"OK"</span>. You should see now a new line in the <span class="gui">"Comment:"</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">"Tools"</span> and select <span class="gui">"Auto-Type: Customize Sequence"</span>. Now there's another new line in the <span class="gui">"Comment:"</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">"OK"</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 "test" 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 (info@commoncrawl.org)\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 (info@commoncrawl.org)\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 (info@commoncrawl.org)\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
-8,469,200,646,904,988,000	• Gelöst NEW UPDATE - Didn't solve - Ebay does not work with Firefox 74.0 (Windows) 'Hi, is this a known issue? Ebay will not render inside my Firefow browser. Still looks like some parts of the page don't load, tried all the individual line items in 'pa… (Lesen Sie mehr) 'Hi, is this a known issue? Ebay will not render inside my Firefow browser. Still looks like some parts of the page don't load, tried all the individual line items in 'page info' without success. Seems to forget that the security was overwritten. Gefragt von irishtoon vor 4 Monaten Beantwortet von jscher2000 vor 4 Monaten • Gelöst Attention: Mr Wesley Branton or anyone if Wesley is not available - making scroll bars wider Some eighteen months ago I asked you how to make the scroll bars wider in Outlook. But at the time I was using Windows 7 and I cannot find your answer in my saved emails.… (Lesen Sie mehr) Some eighteen months ago I asked you how to make the scroll bars wider in Outlook. But at the time I was using Windows 7 and I cannot find your answer in my saved emails. Now I am using Windows 10 and I would again like to widen the scroll bars in Outlook.com my email account. Your help would be greatly appreciated. Please remember I am old and not at all computer savvy and would be so grateful for a slow and easy to follow method. Thank you so much in advance for your help. Anthony Gefragt von avwood vor 1 Tag Beantwortet von avwood vor 14 Stunden • Gelöst Why does fire fox show usernames for a secure site? I have Win 7 . I use the Fire Fox browser. Someone could go to my secure site and click the login box and retrieve all my user names. Why is this necessary to show these … (Lesen Sie mehr) I have Win 7 . I use the Fire Fox browser. Someone could go to my secure site and click the login box and retrieve all my user names. Why is this necessary to show these on a secure site? Gefragt von woodust vor 5 Monaten Beantwortet von cor-el vor 5 Monaten • Gelöst Restore Session Broken In my main profile, restore session stopped working. The option is set, but it doesn't work. It worked for 3 years since I created this profile, but now it doesn't work… (Lesen Sie mehr) In my main profile, restore session stopped working. The option is set, but it doesn't work. It worked for 3 years since I created this profile, but now it doesn't work. Recently, this profile has been crashing regularly on quit. I quit (CRTL-Q) and the window does away, then 10 seconds later, I get a pop up message saying that firefox crashed. Just a moment ago, I had a system crash and now this profile refuses to restore my session. When I started it, there was a new session and all the backup session files contain new sessions, not my tabs. Lost all tabs. Anyone else seeing this? Gefragt von Paul 2017 vor 17 Stunden Beantwortet von Paul 2017 vor 13 Stunden • Gelöst can't add Yippy.com as default search engine Yippy.com search engine recommends mozilla firefox and has a large button in the corner to make it default search on mozilla. This does not work and this search bar does … (Lesen Sie mehr) Yippy.com search engine recommends mozilla firefox and has a large button in the corner to make it default search on mozilla. This does not work and this search bar does not appear to be an option on mozilla? It is a search bar by IBM powered by Watson. Anyone know whats going on? Gefragt von emgiasson vor 4 Tagen Beantwortet von emgiasson vor 11 Stunden • Gelöst Yahoo has hijacked my search function Today, when I went to use Google, both the search bar and the address bar had been hijacked by Yahoo. Steps I took: 1. checked to make sure Google had been selected (it h… (Lesen Sie mehr) Today, when I went to use Google, both the search bar and the address bar had been hijacked by Yahoo. Steps I took: 1. checked to make sure Google had been selected (it had) 2. cleared all cache and history and rebooted (didn't help) 3. Ran Malware Bytes (found nothing) 4. deleted Firefox from my computer and downloaded a fresh version (didn't help) 5. searched for suspicious applications, etc. on my hard drive At this point, I became suspicious of Enhanced Tracking Protection, but I can't turn it off because I cannot locate either Options or Menu. I remain suspicious that ETP is what is causing this issue, but welcome any insight. Gefragt von Diane vor 1 Monat Beantwortet von jscher2000 vor 1 Monat • Gelöst Lost bookmarks after update Win 7Pro, 64 bit Firefox has been increasingly unstable over the past weeks. After installing the latest Version, all my bookmarks are lost. Is there a way to retrieve th… (Lesen Sie mehr) Win 7Pro, 64 bit Firefox has been increasingly unstable over the past weeks. After installing the latest Version, all my bookmarks are lost. Is there a way to retrieve them? Hugo Scheer Gefragt von hugo.scheer vor 16 Stunden Beantwortet von FredMcD vor 15 Stunden • Gelöst Roblox webpage only partially loads Hi not sure if this may have to do with Xsolla who apparently manages the reciept emails for robux but last month we started having problems paying for robux in firefox. … (Lesen Sie mehr) Hi not sure if this may have to do with Xsolla who apparently manages the reciept emails for robux but last month we started having problems paying for robux in firefox. The purchase page loaded the upper elements but the parts of the page where you put in the credit card info would not load in firefox. That part of the page showed only the background colour. So we had to switch to opera or edge in order to purchase the robux. This happened in firefox on both a mac os mojave and separtely on a windows 10 machine as well. Many thanks, Phil [Edit: I accidentally clicked on the "this solved my problem" button in my first support email but it was the second reply by cor-el that came closer to solving it. Not sure how to change this] Gefragt von philsawa vor 1 Monat Beantwortet von cor-el vor 1 Monat • Gesperrt Bookmarks thread is over here https://support.mozilla.org/en-US/questions/1299043 I am responding to jscher2000, who posted to my question a short while ago about the loss of my bo… (Lesen Sie mehr) thread is over here https://support.mozilla.org/en-US/questions/1299043 I am responding to jscher2000, who posted to my question a short while ago about the loss of my bookmarks and being unable to restore. Thanks very much for the fast response. I checked the Places Database section of Troubleshooting, and as you suggested it does say "The places.sqlite database is sane", and "The favicons.sqlite database is sane". So I assume that's good? Now what do I do? Again, many thanks for the assistance. Gefragt von idrabego vor 18 Stunden • Gelöst ebay webpage displays as text and is unusable. Works fine in Chrome. Just installed Win 10 Pro on a new machine, and as the subject line says, the ebay webpage shows up as text only in Mozilla. Works fine/as expected in Chrome. I've opene… (Lesen Sie mehr) Just installed Win 10 Pro on a new machine, and as the subject line says, the ebay webpage shows up as text only in Mozilla. Works fine/as expected in Chrome. I've opened Mozilla in safe mode, purged the cache, adjusted font size. No joy. Gefragt von jim_bosley vor 21 Stunden Beantwortet von stan_evans33 vor 19 Stunden • Gelöst How do I set the general zoom level programmatically When I use Firefox on the external monitor, I set the zoom level to 150%. When I leave home a take my laptop with me, I set the zoom level to 100% to use with a smaller s… (Lesen Sie mehr) When I use Firefox on the external monitor, I set the zoom level to 150%. When I leave home a take my laptop with me, I set the zoom level to 100% to use with a smaller screen. I want to automate setting the zoom level. Is there a way to programmatically set the zoom level from a script? Does Firefox expose such an API / command-line tool? Thanks! Gefragt von Pierre vor 20 Stunden Beantwortet von jscher2000 vor 19 Stunden • Gelöst Eno for Firefox I used this app on Firefox which provides "aliases" for my credit card for online purchases. After an update, it was no longer available on Firefox; I now use Chrome f… (Lesen Sie mehr) I used this app on Firefox which provides "aliases" for my credit card for online purchases. After an update, it was no longer available on Firefox; I now use Chrome for all purchases. Does anyone know what happened to Eno and if it will return to Firefox? I'm a user and not a technician so I'd appreciate non-technical language if possible. Thanks. Gefragt von a.raisis vor 21 Stunden Beantwortet von Enigma vor 20 Stunden • Gelöst Folders in my bookmarks do not save Hello everyone, So I have a problem when I create a folder in my bookmark bar. I create a folder by category (unnamed for aesthetics). Once I have classified my favorites… (Lesen Sie mehr) Hello everyone, So I have a problem when I create a folder in my bookmark bar. I create a folder by category (unnamed for aesthetics). Once I have classified my favorites in these different folders after reopening Firefox, all my favorites are in a single folder. I specify that all these favorites were mostly imported from Chrome but that the problem persists with favorites added from firefox Gefragt von durandm04 vor 1 Tag Beantwortet von cor-el vor 1 Tag • Gelöst Some bookmark link does not respond immediately after startup When I launch Firefox, the first click is ignored. So I must click it once again, it's a little frustrating... I'm having this problem with Twitter, Gmail, and Google new… (Lesen Sie mehr) When I launch Firefox, the first click is ignored. So I must click it once again, it's a little frustrating... I'm having this problem with Twitter, Gmail, and Google news, and I can open it in Facebook, StackOverFlow, and Tumblr with no problems. This does not occur when opening in a private window or in windows opened using Ctrl-N. I checked in the "network" tab of the development tools and the transfer volume says "blocked". Disabling Windows Security doesn't effect anything.(I don't install other security tools) What is the problem? Gefragt von smilkobuta vor 1 Tag Beantwortet von smilkobuta vor 1 Tag • Gelöst How can I view all the times I visited a website in Firefox history, instead of just its most recent visit? Let's say I visit google.com at 6PM, then later at 9PM. Firefox would only in history when I visited the site at 9PM, could I make it show when I visited it at both 6PM a… (Lesen Sie mehr) Let's say I visit google.com at 6PM, then later at 9PM. Firefox would only in history when I visited the site at 9PM, could I make it show when I visited it at both 6PM and 9PM? Gefragt von Yousuf vor 2 Monaten Beantwortet von jscher2000 vor 2 Monaten	{ "url": "https://support.mozilla.org/de/questions/firefox?sort=desc&show=done&order=updated&owner=all", "source_domain": "support.mozilla.org", "snapshot_id": "crawl=CC-MAIN-2020-34", "warc_metadata": { "Content-Length": "110400", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DQVCJ34TAHRTXQPQF4Z6PQIXNOCSGLQN", "WARC-Concurrent-To": "<urn:uuid:f8716ba3-6f17-428d-a4c6-b5ac12fd69bf>", "WARC-Date": "2020-08-13T11:37:42Z", "WARC-IP-Address": "34.209.184.5", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AXCDGUX775DZMD6FNMF75VOQUYCLIRWU", "WARC-Record-ID": "<urn:uuid:17961a31-dc54-4d03-8836-ea885857a22e>", "WARC-Target-URI": "https://support.mozilla.org/de/questions/firefox?sort=desc&show=done&order=updated&owner=all", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:111239ba-32ab-4d3d-9545-20269486dfe6>" }, "warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-212.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 11, 12, 87, 88, 277, 278, 354, 355, 475, 476, 527, 528, 564, 565, 606, 607, 618, 619, 712, 713, 902, 903, 1074, 1075, 1182, 1183, 1223, 1224, 1342, 1343, 1387, 1388, 1396, 1397, 1426, 1427, 1465, 1466, 1477, 1478, 1530, 1531, 1720, 1721, 1909, 1910, 1944, 1945, 1982, 1983, 1994, 1995, 2018, 2019, 2206, 2207, 2377, 2378, 2555, 2556, 2774, 2775, 2800, 2801, 2838, 2839, 2880, 2881, 2892, 2893, 2938, 2939, 3128, 3129, 3411, 3412, 3446, 3447, 3488, 3489, 3500, 3501, 3539, 3540, 3729, 3730, 4145, 4146, 4371, 4372, 4402, 4403, 4442, 4443, 4454, 4455, 4483, 4484, 4673, 4674, 4860, 4861, 4900, 4901, 4940, 4941, 4952, 4953, 4989, 4990, 5179, 5180, 5725, 5726, 5920, 5921, 5954, 5955, 5990, 5991, 6004, 6005, 6015, 6016, 6205, 6206, 6278, 6279, 6709, 6710, 6746, 6747, 6758, 6759, 6828, 6829, 7017, 7018, 7257, 7258, 7296, 7297, 7341, 7342, 7353, 7354, 7407, 7408, 7597, 7598, 7775, 7776, 7819, 7820, 7942, 7943, 7951, 7952, 7986, 7987, 8029, 8030, 8041, 8042, 8058, 8059, 8245, 8246, 8597, 8598, 8634, 8635, 8673, 8674, 8685, 8686, 8722, 8723, 8912, 8913, 9309, 9310, 9342, 9343, 9376, 9377, 9388, 9389, 9451, 9452, 9641, 9642, 9753, 9754, 9891, 9892, 10076, 10077, 10188, 10189, 10222, 10223, 10260, 10261, 10272, 10273, 10381, 10382, 10571, 10572, 10750, 10751, 10784, 10785 ], "line_end_idx": [ 11, 12, 87, 88, 277, 278, 354, 355, 475, 476, 527, 528, 564, 565, 606, 607, 618, 619, 712, 713, 902, 903, 1074, 1075, 1182, 1183, 1223, 1224, 1342, 1343, 1387, 1388, 1396, 1397, 1426, 1427, 1465, 1466, 1477, 1478, 1530, 1531, 1720, 1721, 1909, 1910, 1944, 1945, 1982, 1983, 1994, 1995, 2018, 2019, 2206, 2207, 2377, 2378, 2555, 2556, 2774, 2775, 2800, 2801, 2838, 2839, 2880, 2881, 2892, 2893, 2938, 2939, 3128, 3129, 3411, 3412, 3446, 3447, 3488, 3489, 3500, 3501, 3539, 3540, 3729, 3730, 4145, 4146, 4371, 4372, 4402, 4403, 4442, 4443, 4454, 4455, 4483, 4484, 4673, 4674, 4860, 4861, 4900, 4901, 4940, 4941, 4952, 4953, 4989, 4990, 5179, 5180, 5725, 5726, 5920, 5921, 5954, 5955, 5990, 5991, 6004, 6005, 6015, 6016, 6205, 6206, 6278, 6279, 6709, 6710, 6746, 6747, 6758, 6759, 6828, 6829, 7017, 7018, 7257, 7258, 7296, 7297, 7341, 7342, 7353, 7354, 7407, 7408, 7597, 7598, 7775, 7776, 7819, 7820, 7942, 7943, 7951, 7952, 7986, 7987, 8029, 8030, 8041, 8042, 8058, 8059, 8245, 8246, 8597, 8598, 8634, 8635, 8673, 8674, 8685, 8686, 8722, 8723, 8912, 8913, 9309, 9310, 9342, 9343, 9376, 9377, 9388, 9389, 9451, 9452, 9641, 9642, 9753, 9754, 9891, 9892, 10076, 10077, 10188, 10189, 10222, 10223, 10260, 10261, 10272, 10273, 10381, 10382, 10571, 10572, 10750, 10751, 10784, 10785, 10825 ] }	{ "red_pajama_v2": { "ccnet_original_length": 10825, "ccnet_original_nlines": 214, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3512575924396515, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04249782860279083, "rps_doc_frac_lines_end_with_ellipsis": 0.004651159979403019, "rps_doc_frac_no_alph_words": 0.17042498290538788, "rps_doc_frac_unique_words": 0.28875064849853516, "rps_doc_mean_word_length": 4.377397537231445, "rps_doc_num_sentences": 122, "rps_doc_symbol_to_word_ratio": 0.007372070103883743, "rps_doc_unigram_entropy": 5.621340751647949, "rps_doc_word_count": 1929, "rps_doc_frac_chars_dupe_10grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_5grams": 0.5081714987754822, "rps_doc_frac_chars_dupe_6grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_7grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_8grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_9grams": 0.46399810910224915, "rps_doc_frac_chars_top_2gram": 0.014211270026862621, "rps_doc_frac_chars_top_3gram": 0.021316910162568092, "rps_doc_frac_chars_top_4gram": 0.008882050402462482, "rps_doc_books_importance": -1149.7608642578125, "rps_doc_books_importance_length_correction": -1149.7608642578125, "rps_doc_openwebtext_importance": -648.2748413085938, "rps_doc_openwebtext_importance_length_correction": -648.2748413085938, "rps_doc_wikipedia_importance": -475.6280212402344, "rps_doc_wikipedia_importance_length_correction": -475.6280212402344 }, "fasttext": { "dclm": 0.018606480211019516, "english": 0.8565710186958313, "fineweb_edu_approx": 1.0647904872894287, "eai_general_math": 0.10171669721603394, "eai_open_web_math": 0.09668135643005371, "eai_web_code": 0.0890992283821106 } }	{ "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.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "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
-2,977,971,877,594,529,300	EP2514150A1 - Distributed routing architecture - Google Patents Distributed routing architecture Info Publication number EP2514150A1 EP2514150A1 EP20100795898 EP10795898A EP2514150A1 EP 2514150 A1 EP2514150 A1 EP 2514150A1 EP 20100795898 EP20100795898 EP 20100795898 EP 10795898 A EP10795898 A EP 10795898A EP 2514150 A1 EP2514150 A1 EP 2514150A1 Authority EP Grant status Application Patent type Prior art keywords router level components component routing Prior art date Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Granted Application number EP20100795898 Other languages German (de) French (fr) Other versions EP2514150B1 (en ) Inventor Alan M. Judge David J. Mcgaugh James R. Hamilton Justin O. Pietsch David J. O'meara Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.) Amazon Technologies Inc Original Assignee Amazon Technologies Inc Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Links Classifications • HELECTRICITY • H04ELECTRIC COMMUNICATION TECHNIQUE • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION • H04L45/00Routing or path finding of packets in data switching networks • H04L45/58Association of routers • HELECTRICITY • H04ELECTRIC COMMUNICATION TECHNIQUE • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION • H04L45/00Routing or path finding of packets in data switching networks • H04L45/04Interdomain routing, e.g. hierarchical routing Abstract A hierarchical distributed routing architecture including at least three levels, or layers, for receiving, processing and forwarding data packets between network components is provided. The core level router components receive an incoming packet from a network component and identify a distribution level router component based on processing a subset of the destination address associated with the received packet. The distribution level router components that receiving a forwarded packet and identify a transit level router component based a second processing of at least a subset of the destination address associated with the received packet. The distribution level router components maintain address routing information a first and second memory. The transit level router components receive the forwarded packet and forward the packet to a respective network. The mapping, or other assignment, of portions of the FIB associated with the distributed routing environment is managed by a router management component. Description DISTRIBUTED ROUTING ARCHITECTURE BACKGROUND [0001] Generally described, computing devices utilize a communication network, or a series of communication networks, to exchange data. In a common embodiment, data to be exchanged is divided into a series of packets that can be transmitted between a sending computing device and a recipient computing device. In general, each packet can be considered to include two primary components, namely, control information and payload data. The control information corresponds to information utilized by one or more communication networks to deliver the payload data. For example, control information can include source and destination network addresses, error detection codes, and packet sequencing identification, and the like. Typically, control information is found in packet headers and trailers included within the packet and adjacent to the payload data. [0002] In practice, in a packet-switched communication network, packets are transmitted between multiple physical networks, or sub-networks. Generally, the physical networks include a number of hardware devices that receive packets from a source network component and forward the packet to a recipient network component. The packet routing hardware devices are typically referred to as routers. Generally described, routers can operate with two primary functions or planes. The first function corresponds to a control plane, in which the router learns the set of outgoing interfaces that are most appropriate for forwarding received packets to specific destinations. The second function is a forwarding plane, in which the router sends the received packet to an outbound interface. [0003] To execute the control plane functionality, routers can maintain a forwarding information base ("FIB") that identifies, among other packet attribute information, destination information for at least a subset of possible network addresses, such as Internet Protocol ("IP") addresses. In a typical embodiment, the FIB corresponds to a table of values specifying network forwarding information for the router. In one aspect, commercial level routing hardware components can include customized chipsets, memory components, and software that allows a single router to support millions of entries in the FIB. However, such commercial level routing hardware components are typically very expensive and often require extensive customization. In another aspect, commodity-based routing hardware components are made of more generic components and can be less expensive than commercial level routing hardware components by a significant order of magnitude. However, such commodity-based routing hardware components typically only support FIBs on the order of thousands of entries. BRIEF DESCRIPTION OF THE DRAWINGS [0004] The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein: [0005] FIGURE 1 A is a block diagram illustrative of one embodiment of a distributed routing environment including a router management component and a hierarchical, distributed routing component architecture; [0006] FIGURE IB is a block diagram illustrative of components of a router component utilized in accordance with the distributed routing environment of FIGURE 1A; [0007] FIGURES 2A-2C are block diagrams illustrative of the distributed routing environment of FIGURE 1 A illustrating the routing of a received packet within the hierarchical distributed routing component architecture; [0008] FIGURE 3 is a flow diagram illustrative of a distributed router architecture routing routine implemented within a distributed routing environment; and [0009] FIGURE 4 is a flow diagram illustrative of a distributed router architecture routing routine implemented within a distributed routing environment DETAILED DESCRIPTION [0010] Generally described, the present disclosure corresponds to a distributed routing architecture. Specifically, the present disclosure corresponds to a hierarchical distributed routing architecture including at least three logical levels, or layers, for receiving, processing and forwarding data packets between network components. In one embodiment, the three logical levels can corresponds to a core level, a distribution level and a transit level. Illustratively, the core level corresponds to one or more router components that receive an incoming packet from a network component and processes the destination address information associated with the received packet. The core level router component then identifies a distribution level router component based on a subset of the destination address associated with the received packet. The distribution level corresponds to one or more router components that receive a forwarded packet from a core level router component and further processes the destination address information associated with the received packet. The distribution level router component identifies a transit level router component based on at least a subset of the destination address associated with the received packet. Each distribution level router component is associated with, or otherwise corresponds to, a subset of the FIB associated with the distributed routing architecture. Finally, the transit level router components correspond to one or more router components that receive the forwarded packet from a distribution level router component and forward the packet "upstream" to a respective network, or network node. The mapping, or other assignment, of portions of the FIB associated with the distributed routing environment is managed by a router management component. [0011] In one embodiment, each of the router components associated with the core level, distribution level and transit level can correspond more closely to commodity based router components/hardware. In another embodiment, the core level, distribution level and transit level router components correspond to logical router components that do no necessarily have a corresponding hardware router component. For example, one or more logical router components within each level may be implemented in the same hardware router component. Likewise, the logical router components associated with different levels of the distributed routing architecture may be implemented in the same hardware router component. In both embodiments, however, because responsibility for maintaining the FIB associated with the distributed routing environment is divided among several router components, the processing and memory restraints associated with commodity based router components/hardware can be mitigated. Various implementations, combination, and applications for dividing the FIB associated with the distributed routing environment will be described in accordance with the distributed routing environment. However, one skilled in the relevant art will appreciate that such embodiment and examples are illustrative in nature and should not be construed as limiting. [0012] Turning now to FIGURE 1 A, a distributed routing environment 100 for implemented a hierarchical distributed routing architecture will be described. The distributed routing environment 100 includes a router management component 102 for controlling the routing information utilized by the distributed routing environment 100. Specifically, the router managed component 102 can receive all upstream routing information to be used by the distributed routing environment 100 and allocate the assignment of the upstream routing information among the components of the distributed routing environment 100 as will be described. In one embodiment, the router management component 102 can correspond to a computing device in communication with one or more components of the distributed routing environment 100. Illustrative computing devices can include server computing devices, personal computing devices or other computing devices that include a processor, memory and other components for executing instructions associated with the function of the router management component 102. In another embodiment, the router management component 102 may be implemented as a software component that is executed on one or more of the router components described below. Illustratively, the router management component 102 maintains and updates the FIB associated with the distributed routing environment 100. Additionally, the router management component 102 can allocate responsibility for portions of the FIB entries to the various layers of the distributed routing environment 100, as will be described below. In one embodiment, the router management component 102 can partition the FIB according to the distribution to the various router components of the distributed routing environment 100 and distribute respective portions of the FIB to be maintained in a memory associated with the various router components. [0013] With continued reference to FIGURE 1A, the distributed routing environment 100 includes a first communication network 104 that transmits data packets to the distributed routing environment 100. The first communication network 104 may encompass any suitable combination of networking hardware and protocols necessary to establish packet-based communications to the distributed routing environment 100. For example, the communication network 104 may include private networks such as local area networks (LANs) or wide area networks (WANs) as well as public or private wireless networks. In such an embodiment, the communication network 104 may include the hardware (e.g., modems, routers, switches, load balancers, proxy servers, etc.) and software (e.g., protocol stacks, accounting software, firewall/security software, etc.) necessary to establish a networking link with the distributed routing environment 100. Additionally, the communication network 104 may implement one of various communication protocols for transmitting data between computing devices. As will be explained in greater detail below, the communication protocols can include protocols that define packet flow information, such as network address information corresponding to the Internet Protocol version 4 (IPv4) and the Internet Protocol version 6 (IPv6) Internet Layer communication network protocols. One skilled in the relevant art will appreciate, however, that present disclosure may be applicable with additional or alternative protocols and that the illustrated examples should not be construed as limiting. [0014] In communication with the first communication network 104 is a first level of the distributed routing environment 100, generally referred to as the core layer or core level. In one embodiment, the core level corresponds to one or more logical router components, generally referred to as core level routers 106A, 106B, and 106C. As previously described, within the distributed routing environment 100, the core level routers 106A, 106B, 106C receive an incoming packet from a component from the network 104 and process the destination address by identifying a distribution level router component based on a subset of the destination address associated with the received packet. Illustratively, the subset of the destination address can correspond to less than the entire destination IP address, such as the highest most values of the IP address. As previously described, the core level routers 106A, 106B, 106C can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100. In an alternative embodiment, at least some portion of the core layer may be implemented by components outside the distributed routing environment 100. In such an embodiment, such external components would directly address a distribution level router component (described below) of the distributed routing environment 100. [0015] The distributed routing environment 100 can further include a second level of logical router components, generally referred to as the distribution layer or distribution level. In one embodiment, the distribution level corresponds to one or more router components, generally referred to as distribution level routers 108A, 108B, and 108C. As previously described, within the distributed routing environment 100 the distribution level routers 108 A, 108B and 108C receiving an incoming packet from a core routing component 102 and process the destination address by identifying a transit level router component based on at least a subset of the destination address associated with the received packet. Illustratively, the subset of the destination address can correspond to a larger subset of the destination IP address used by the core level routers 106A, 106B, 106C. In this embodiment, the routing preformed by the distribution level can correspond to a more refined routing of the received packet relative to the core level routing. As described above with the core level routers 106 A, 106B, 106C, the distribution level routers 108A, 108B, and 108C can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100. [0016] In communication with the distribution level router components is a third level of router components, generally referred to as the transmit layer or transit level. In one embodiment, the transit level corresponds to one or more router components, generally referred to as transit level routers 1 1 OA, HOB, and HOC. As previously described, the transit level routers 11 OA, HOB, H OC receive the forwarded packet from a distribution level router component 108A, 108B, 108C and forward the packet "upstream" to another communication network 1 12 node. Illustratively, each transit level router 11 OA, HOB, HOC can be configured to communicate with one or more upstream peers such that all packets destined for an associated peer network component will be transmitted through the assigned transit level router 1 1 OA, HOB, 1 IOC (or a redundant router). As described above with the core level routers 106A, 106B, 106C and the distribution level routers 108A, 108B and 108C, the transit level routers 11 OA, 1 10B, and HOC can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100 [0017] Similar to communication network 102, communication network 112 may encompass any suitable combination of networking hardware and protocols necessary to establish packet-based communications to the distributed routing environment 100. For example, the communication network 1 12 may include private networks such as local area networks (LANs) or wide area networks (WANs) as well as public or private wireless networks. In such an embodiment, the communication network 1 12 may include the hardware (e.g., modems, routers, switches, load balancers, proxy servers, etc.) and software (e.g., protocol stacks, accounting software, firewall/security software, etc.) necessary to establish a networking link with the distributed routing environment 100. As described above with regard to the communication network 104, the communication network 112 may implement one of various communication protocols for transmitting data between computing devices. One skilled in the relevant art will appreciate, however, that present disclosure may be applicable with additional or alternative protocols and that the illustrated examples should not be construed as limiting. [0018] In an illustrative embodiment, the logical router components (106, 108, 1 10) in FIGURE 1A may correspond to a computing device having processing resources, memory resources, networking interfaces, and other hardware/software for carrying the described functionality for each of the logical router components. With reference now to FIGURE IB, a block diagram illustrative of components of a router component 150 utilized in accordance with the distributed routing environment 100 of FIGURE 1A will be described. The general architecture of the router component 150 depicted in FIGURE IB includes an arrangement of computer hardware and software components that may be used to implement one or more logical router components 106, 108, 110. Those skilled in the art will appreciate that the router component 150 may include many more (or fewer) components than those shown in FIGURE IB. It is not necessary, however, that all of these generally conventional components be shown in order to provide an enabling disclosure. [0019] As illustrated in FIGURE IB, the router component 150 includes a processing unit 152, at least one network interface 156, and at least one computer readable medium drive 158, all of which may communicate with one another by way of a communication bus. The processing unit 152 may thus receive information and instructions from other computing systems or services via a network. The processing unit 152 may also be associated with a first memory component 154 for recalling information utilized in the processing of destination address information, such as at least a portion of a FIB associated with the distributed routing environment 100. The memory 154 generally includes RAM, ROM and/or other persistent memory. The processing unit 152 may also communicate to and from memory 160. The network interface 156 may provide connectivity to one or more networks or computing systems. The at least one computer readable medium drive 158 can also correspond to RAM, ROM, optical memory, and/or other persistent memory that may persists at least a portion of the FIB associated with the distributed routing environment 100. In an illustrative embodiment, the access time associated with the memory component 154. may be faster than the access time associated with the computer readable medium driver 158. Still further, the computer readable medium drive 158 may be implemented in a networked environment in which multiple router components 150 share access to the information persisted on the computer readable medium drive 158. [0020] The memory 160 contains computer program instructions that the processing unit 152 executes in order to operate the dynamic classifier. The memory 160 generally includes RAM, ROM and/or other persistent memory. The memory 160 may store an operating system 162 that provides computer program instructions for use by the processing unit 152 in the general administration and operation of the router component 150. The memory 160 may further include computer program instructions and other information for implementing one or more of the logical router components in the distributed routing environment 100. For example, in one embodiment, the memory 160 includes a router module 164 that implements the functionality associated with any of the routers 106, 108, 1 10. In the event that multiple logical routers are implemented by the same router component 150, memory 160 may have each instance of a router module 164. [0021] In an illustrative embodiment, each router component 150 may be embodied as an individual hardware component for implementing one or more logical routers 106, 108, 1 10. Alternatively, multiple router components 150 may be grouped and implemented together. For example, each router component 150 may correspond to an application-specific integrated circuit (ASIC) having a processing unit 152, memory 154 and memory 160 (or other components with similar functionality). The router components 150 may share one or more components, such as the network interface 156 and computer readable medium 158, via a common communication bus. [0022] With reference now to FIGURES 2A-2C, the processing of receiving packets by the distributed routing environment 100 will be described. With reference first to FIGURE 2A, an incoming packet is received from the communication network 104 to a core level router 106. The core level router 106 that receives the incoming packet may be selected according to a variety of techniques including, but not limited to, load balancing, random selection, round robin, hashing, and other packet distribution techniques. Upon receipt, the core level router 106 processes destination IP address and utilizes a subset of the destination IP address to identify a second level destination router component that will perform a second level of routing. In an illustrative embodiment, the core level router 106 utilizes the most significant bits of the IP address, such as the eight most significant bits of the destination address. The selection of the subset of IP addresses corresponding to a selection of the most significant bits is generally referred to as prefix. For example, selection of the eight most significant bits corresponds to a prefix length of "8." Selection of the sixteen most significant bits corresponds to a prefix length of "16." One skilled in the relevant art will appreciate that the number of bits utilized by the core level router 106 may vary. Additionally, in an alternative embodiment, the core level router 106 may use different methodologies to allocate, or otherwise subdivide, the address space serviced by the distributed routing environment 100. [0023] Based on the processing of the first subset of the destination address, the core level router 106 forwards the packet to a distribution level router, in this case illustratively 108A. As previously described, the receiving distribution level router 108A processes the destination address of the received packet and also utilizes a subset of the destination IP address to identify a third level router component that will forward the packet to a next network destination (outside of the distributed routing environment 100). Similar to the core level router 106, the receiving distribution level router can be configured to utilize a selection of the most significant bits of the IP address (e.g., the prefix) to route the packet. In an illustrative embodiment, the prefix used by the distribution level router 108 A is greater than the prefix used by the core level router 106. Based on the processing by the distribution level router 106A, the transit level router HOB receives the forwarded packet and forwards the packet to a designated designation associated with the communication network 1 12. [0024] Turning now to FIGURES 2B and 2C, the allocation of IP addresses or subsets of IP addresses within the distributed routing environment 100 will be described. With reference to FIGURE 2B, the core level router 106 distributes some portion of the subset of destination IP addresses to distribution level router 108A (illustrated at 202). Distribution level router 108A in turn further distributes the portions of the IP addresses to transit level routers 1 10A, HOB, and 1 IOC (illustrated at 204, 206, and 208). With reference to FIGURE 2C, the core level router 106 distributes a different portion of the subset of destination IP addresses to distribution level router 108B (illustrated at 210). Distribution level router 108B in turn further distributes the portions of the IP addresses to transit level routers 11 OA and 1 10B (illustrated at 212 and 214). [0025] In an illustrative embodiment, the router management component 102 (FIGURE 1) can allocate responsibility of subsets of IP addresses to the distribution level routers in a variety of manners. In one embodiment, the router management component 102 can allocate responsibility for the entire set of IP addresses in accordance with assignment of IP addresses equally, or substantially equally, among available routers. In this embodiment, each distribution level router 108 becomes responsible for an equal subset of IP addresses or substantially equal if the IP addresses cannot be divided equally. In another embodiment, the router management component 102 can specify specific distribution level router 108 to handle high traffic IP addresses or prefixes. In this example, the entire subset of IP addresses may be custom selected by the router management component 102. Alternatively, only the subset of IP addresses meeting a traffic threshold may be custom selected with the remaining portions of IP address automatically distributed. [0026] In still a further embodiment, multiple distribution level routers 108 may be selected for a subset of IP addresses. In this embodiment, each core level router 106 can select from multiple distribution level routers 108 based on an equal cost multi-path routing (ECMP) technique in which a specific distribution level router 108 is selected based on a standard load sharing technique. Other factors that can be utilized to select from multiple assigned distribution level router 108 include carrier preference, Internet weather, resource utilization/health reports, an allocated or determine routing cost, service level agreements (SLAs), or other criteria. [0027] In one embodiment, each distribution router 108 can maintain the portion of the FIB that is associated with the subset of IP addresses assigned the respective distribution level router 108. In another embodiment, each distribution level router 108 can maintain the entire FIB associated with the distributed routing environment 100 in a memory component, such as computer readable medium 158 (FIGURE IB). Once a subset of IP addresses are assigned to each respective distribution level router 108 (or otherwise updated), the applicable portions of the FIB are loaded in a different memory components, such as memory component 154 (FIGURE IB) utilized by the router (e.g., a routing chip level content addressable memory or a processor level cache memory). The maintenance of the applicable portions of the FIB in a memory component facilitates better router performance by faster memory access times for the applicable portion of the FIB. However, in this embodiment, the allocation of FIBs to each distribution level router 108 can be modified by loading different portions of the stored FIB from a first memory component storing the entire FIB (e.g., the computer readable medium 158) to the memory component maintaining the portion of the FIB allocated to the distribution level router 108 (e.g., memory component 154). Accordingly, this embodiment facilitates the dynamic allocation of distribution level routers 108, the creation of redundant distribution level routers, and additional failover for distribution level routers. Additionally, one or more core level routers 106 can utilize a similar technique in performing the functions associated with the core level of the distributed routing environment 100. [0028] In still a further embodiment, as a variation to the above embodiment, each distribution level router can be allocated a larger portion of the FIB associated with the distributed routing environment 100 than is capable of being maintained in a first memory component of the router, such as memory component 154 (e.g., a processor level cache memory). If a core level router 106 routes to a distribution level router 108 and the corresponding prefixes of the destination IP address do not correspond to the FIB maintained in the first memory component of the distribution level router, the distribution level router can recall the necessary information from the larger subset of the FIB maintained in a different memory component (e.g., computer readable medium 158 (FIGURE IB)). The FIB maintained in the first memory component (e.g., memory component 152) may be updated to store the prefix in the primary memory component. Alternatively, the FIB in the first memory component may not be automatically updated based on a single request, but based on increases in traffic for a given prefix. [0029] In yet another embodiment, lower traffic prefixes may be assigned to multiple distribution level routers 108. In one example, each assigned distribution level router 108 does not maintain the lower traffic routing portion of the assigned FIB in the primary memory component. Rather, routing requests for the lower traffic prefixes can be directed to a specific distribution level router based on selection techniques, such as ECMP, and can be processed by a selected distribution level router 108 based on the larger FIB maintained in a different memory component within the selected distribution level router. [0030] With reference now to FIGURE 3, a routine 300 for routing packets and implemented in a distributed routing environment 100 will be described. At block 302, the distributed routing environment 100 obtains a routing request. As previously described, the routing request is received from a first network 102 (FIGURE 1) and includes information identifying a destination IP address. At block 304, a core level router 106 corresponding to a first level of the distributed routing environment 100 is selected and receives the routing request. In an illustrative embodiment, each core level router 106 can perform the same function and can selected in accordance with standard selection techniques, including, but not limited to, random selection, round robin selection, load balancing selection and the like. [0031] At block 306, the selected core level router 106 identifies a distribution level router 108 corresponding to a second level of the distributed routing environment 100. The core level router 108 selects the distribution level router 108 based on processing the destination IP address and utilizing a subset of the destination IP addresses (e.g., the prefix) to determine the appropriate distribution level router 108. Illustratively, in accordance with an embodiment corresponding to the IPv4 communication protocol, the core level router 106 processing can be based on consideration of a prefix of the eight most significant bits. At block 308, the selected distribution level router 108 identifies a transit level router 1 10 based on processing the destination IP address and utilizing a subset of the destination IP address to determine the appropriate transit level router 1 10. Illustratively, in accordance with an embodiment corresponding to the IPv4 communication protocol, the distribution level router 108 processing can be based on a larger subset of IP address (e.g., a longer prefix such as 16 or 24 bits, as needed to select the appropriate transit level router 1 10). One skilled in the relevant art will appreciate, however, the blocks 306 and 308 may be implemented in a manner such the core level router 106 and distribution level router 108 may utilize additional or alternative attributes (including different portions of a destination IP address) of received packets in identifying the next router component to forward the received packet. [0032] At block 310, the selected transit level router 1 10 transmits the receive packet to the destination recipient associated, or otherwise configured, with the transit level router 1 10. At block 312, the routine 300 terminates. [0033] With reference now to FIGURE 4, another routine 400 for routing packets and implemented in a distributed routing environment 100 will be described. In an illustrative embodiment, routine 400 may be implemented in embodiments in which less than all the FIB associated with a particular distribution router 108 is maintained in a primary memory component. At block 402, a routing request is received at a distribution level router 108. The selection and routing to a distribution level router 108 was previously described above. Although routine 400 will be described with regard to implementation by a distribution level router 108, one skilled in the relevant art will appreciate that at least portions of routine 400 may be implemented by other components of the distributed routing environment 100, such as core level routers 106 or transit level router 1 10. At decision block 404, a test is conducted to determine whether the subset of the destination IP address associated with the routing request is in the portion of the FIB table maintained in the primary memory of the selected distribution level router 108. If so, at block 406, the distribution level router 108 obtains the transit layer routing information from the FIB maintained in the first memory component (e.g., memory component 152 (FIGURE IB)). At block 408, the distribution level router 108 forwards the packet to the selected transit level router 1 10. [0034] Alternatively, if at decision block 404 the subset of the destination IP address associated with the routing request is not maintained in the portion of the FIB table maintained in the primary memory of the selected distribution level router 108, at block 410, distribution level router 108 attempts to obtain additional transit routing information from a separate memory component associated with the distribution level router. At block 410, the distribution level router 108 can update the forwarding table information maintained in the primary memory component with the information obtained from the other memory component. Alternatively, block 410 can be omitted or is otherwise optional. At block 412, the routine terminates. [0035] While illustrative embodiments have been disclosed and discussed, one skilled in the relevant art will appreciate that additional or alternative embodiments may be implemented within the spirit and scope of the present disclosure. Additionally, although many embodiments have been indicated as illustrative, one skilled in the relevant art will appreciate that the illustrative embodiments do not need to be combined or implemented together. As such, some illustrative embodiments do not need to be utilized or implemented in accordance with the scope of variations to the present disclosure. [0036] Conditional language, such as, among others, "can," "could," "might," or "may," unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements, or steps. Thus, such conditional language is not generally intended to imply that features, elements or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements or steps are included or are to be performed in any particular embodiment. Moreover, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey utilization of the conjunction "or" in enumerating a list of elements does not limit the selection of only a single element and can include the combination of two or more elements. [0037] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art. It will further be appreciated that the data and/or components described above may be stored on a computer-readable medium and loaded into memory of the computing device using a drive mechanism associated with a computer-readable medium storing the computer executable components, such as a CD-ROM, DVD-ROM, or network interface. Further, the component and/or data can be included in a single device or distributed in any manner. Accordingly, general purpose computing devices may be configured to implement the processes, algorithms, and methodology of the present disclosure with the processing and/or execution of the various data and/or components described above. Alternatively, some or all of the methods described herein may alternatively be embodied in specialized computer hardware. In addition, the components referred to herein may be implemented in hardware, software, firmware or a combination thereof. [0038] It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims. Claims WHAT IS CLAIMED IS: 1. A system for routing packets comprising: a router management component, executed on a computing device, for associating destination address information to a router hierarchy; one or more router components corresponding to a first level of the router hierarchy, the first level of the router hierarchy for receiving an incoming packet for routing; one or more router components corresponding to a second level of a router hierarchy, the second level of the router hierarchy for processing an incoming packet for routing received from at least one of the one or more router components corresponding to the first level of a router hierarchy, wherein the one or more router components corresponding to the second level of the router hierarchy are associated with a first memory and a second memory for storing destination address information, the first memory associated with a faster access time than the second memory; one or more router components corresponding to a third level of a router hierarchy, the third level of the router hierarchy for processing an incoming packet for routing received from at least one of the one or more router components corresponding to the second level of a router hierarchy; wherein the one or more router components corresponding to the first level of a router hierarchy identifies one or more router components from the one or more router components corresponding to the second level of a router hierarchy based on a first subset of a destination address associated with the incoming packet, wherein the first subset is assigned by the router management component; wherein each of the one or more router components corresponding to the second level of a router hierarchy correspond to portions of the first subset of the destination address associated with the incoming packet; wherein the one or more router components corresponding to the second level of a router hierarchy identifies one or more router components from the one or more router components corresponding to third level of a router hierarchy based on a second subset of a destination address associated with the incoming packet, wherein the second subset of the destination address is greater than the first subset of the destination address; and wherein the one or more router components attempt to identify the one or more router components from address information persisted in the first memory associated with the wherein the one or more router components and if the address information is not available in the first memory component, the one or more router components attempt to identify the one or more router components from address information persisted in the second memory component. 2. The system as recited in Claim 1, wherein the one or more router components corresponding to the second level of a router hierarchy is allocated to correspond to approximately equal portions of the first subset of the destination addresses associated with the incoming packet. 3. The system as recited in Claim 2, wherein the approximately equal portions of the first subset of destination addresses correspond to more address information than can be persisted in the first memory of the one or more router components corresponding to a second level of a router hierarchy. 4. The system as recited in Claim 1, wherein the one or more router components corresponding to the second level of a router hierarchy is allocated to correspond to portions of the first subset of the destination address associated with the incoming packet based on traffic volumes attributed to the destination address. 5. The system as recited in Claim 1, wherein the one or more router components corresponding to a first level of a router hierarchy are selected in accordance with one of random selection, round robin selection, hashing, and load balancing. 6. The system as recited in Claim 1 , wherein the destination address corresponds to an IP address. 7. The system as recited in Claim 6, wherein first subset of the IP address corresponds to the eight most significant bits of the IP address. 8. The system as recited in Claim 6, wherein first subset of the IP address corresponds to at least one of the sixteen or twenty four most significant bits of the IP address. 9. The system as recited in Claim 1, wherein at least two of the one or more router components corresponding to a first level of the router hierarchy are implemented in a common physical router component. 10. The system as recited in Claim 1 , wherein at least two of the one or more router components corresponding to a second level of the router hierarchy are implemented in a common physical router component. 1 1. The system as recited in Claim 1 , wherein at least two of the one or more router components corresponding to a third level of the router hierarchy are implemented in a common physical router component. 12. The system as recited in Claim 1, wherein at least one physical router component implements at least two of a first level router, a second level router and a third level router. 13. The system as recited in Claim 1, the one or more router components corresponding to the first level of the router hierarchy are associated with a first memory and a second memory for storing destination address information, the first memory associated with a faster access time than the second memory and wherein the one or more router components corresponding to the first level of the router hierarchy attempt to identify the one or more router components from address information persisted in the first memory associated with the wherein the one or more router components and if the address information is not available in the first memory component, the one or more router components attempt to identify the one or more router components from address information persisted in the second memory component. 14. A system for routing packets comprising: a first set of logical router components for receiving an incoming packet for routing; a second set of logical router components for routing packet received from the first set of router components, the second set of logical router component associated with a physical router having a first memory and a second memory; a third set of router logical components for routing packets received from the second set of router components wherein the first set of logical router components identify a router from the second set of logical router components based on a correlation by a router management component of a subset of the destination address associated with the incoming packet to the selected router; wherein each of the one or more router components corresponding to the second set of logical router components is allocated by the router management component to correspond to portions of the first subset of the destination address associated with the incoming packet such that address information provided by the router management component cannot be persisted entirely in the first memory component; and wherein the second set of logical router components identify a router from the third set of logical router components based on a correlation by the router management component of a second subset of a destination address associated with the incoming packet to the second selected router by examining address information in the first memory and if the address information is not persisted in the first memory component, by examining address information persisted in the second memory. 15. The system as recited in Claim 14, wherein the correlation of routers from the second set of router components is based on a substantially equal allocation of possible destination addresses. 16. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on an association of traffic volumes for destination addresses. 17. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on a combination of an association of traffic volumes for destination addresses and an equal allocation of remaining destination addresses. 18. The system as recited in Claim 14, wherein each of the routers from the second set of logical router components are associated with a threshold number of destination addresses and wherein the correlation of routers from the second set of logical router components is based on allocation of a number greater than the threshold number of destination addresses associated with the second set of logical router components. 19. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on an association of low traffic volumes for destination addresses. 20. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components includes an allocation of a plurality of routers for the same subset of destination addresses. 21. The system as recited in Claim 14, wherein first set of router components are selected in accordance with one of random selection, round robin selection, hash selection and load balancing. 22. The system as recited in Claim 14, wherein the destination address corresponds to an IP address. 23. The system as recited in Claim 22, wherein first subset of the IP address corresponds to the eight most significant bits of the IP address. 24. The system as recited in Claim 23, wherein first subset of the IP address corresponds to at least one of the sixteen or twenty four most significant bits of the IP address. 25. The system as recited in Claim 14, wherein each of the first set of logical router components correspond to a physical router component. 26. The system as recited in Claim 14, wherein two or more of the first set of logical router components correspond to a single physical router component. 27. The system as recited in Claim 14, wherein each of the second set of logical router components correspond to a physical router component. 28. The system as recited in Claim 14, wherein two or more of the second set of logical router components correspond to a single physical router component. 29. The system as recited in Claim 14, wherein each of the third set of logical router components correspond to a physical router component. 30. The system as recited in Claim 14, wherein two or more of the third set of logical router components correspond to a single physical router component. 31. The system as recited in Claim 14, wherein at least one of the set of first logical components, at least one of the second set of logical components, and at least one of the third set of logical router components correspond to a single physical router component. 32. The system as recited in Claim 14, wherein the router management component dynamically modifies the address information in the first memory component. 33. The system as recited in Claim 14, wherein the first set of logical router component associated with a physical router having a first memory and a second memory. 34. The system as recited in Claim 33, wherein the first set of logical router components identify a router from the second set of logical router components based on a correlation by the router management component of a second subset of a destination address associated with the incoming packet to the second selected router by examining address information in the first memory and if the address information is not persisted in the first memory component, by examining address information persisted in the second memory. 35. A method for routing packets comprising of the one or more router components corresponding to the second set of logical router components. obtaining a routing request corresponding to a data packet received from a first communication network; identifying a first router corresponding to a first level of a router hierarchy, the first level of the router hierarchy corresponding to one or more router components; forwarding the received data packet to the identified first router; identifying a second router corresponding to a second level of the router hierarchy, the second level of the router hierarchy corresponding to one or more router components; forwarding the received data packet to the identified second router; and identifying a third router corresponding to a third level of the router hierarchy, the third level of the router hierarchy corresponding to one or more router components, wherein identifying a third router corresponding to a third level of the router hierarchy corresponds to examining address information persisted in a first memory component associated with the identified second router and if the address information is not available, examining address information persisted in a second memory associated with the identified second router component; wherein identifying the second router corresponding to a second level of the router hierarchy is based on a correlation of a subset of the destination address associated with the received data packet to the selected router; wherein address information provided by the router management component cannot be persisted entirely in the first memory component; and wherein identifying a third router corresponding to a third level of the router hierarchy is based on a correlation of a second subset of a destination address associated with the incoming packet to the second selected router. 36. The method as recited in Claim 35, wherein each of the one or more router components corresponding to the second level of the router hierarchy is allocated to correspond to portions of the first subset of the destination address associated with the incoming packet. 37. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on at least a substantially equal allocation of possible destination addresses. 38. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on an association of traffic volumes for destination addresses. 39. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on a combination of an association of traffic volumes for destination addresses and an equal allocation of remaining destination addresses. 40. The method as recited in Claim 36, wherein each of the routers from the second level of the router hierarchy are associated with a threshold number of destination addresses and wherein the correlation of routers from the second level of the router hierarchy is based on allocation of a number greater than the threshold number of destination addresses associated with the second level of the router hierarchy. . 41. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on an association of low traffic volumes for destination addresses. 42. The method as recited in Claim 36, wherein the correlation of routers from the second set of router components includes an allocation of a plurality of routers for the same subset of destination addresses. 43. The method as recited in Claim 35, wherein first set of router components are selected in accordance with one of random selection, round robin selection, hash selection and load balancing. 44. The method as recited in Claim 35, wherein the destination address corresponds to an IP address. 45. The method as recited in Claim 35 further comprising dynamically modifying the address information provided by the router management component and persisted in the first memory component, wherein all the address information provided by the router management component cannot be persisted entirely in the first memory component. EP20100795898 2009-12-17 2010-12-15 Distributed routing architecture Active EP2514150B1 (en) Priority Applications (2) Application Number Priority Date Filing Date Title US12641280 US8325730B2 (en) 2009-12-17 2009-12-17 Distributed routing architecture PCT/US2010/060573 WO2011084520A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Applications Claiming Priority (1) Application Number Priority Date Filing Date Title EP20160001481 EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Related Child Applications (1) Application Number Title Priority Date Filing Date EP20160001481 Division EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Publications (2) Publication Number Publication Date EP2514150A1 true true EP2514150A1 (en) 2012-10-24 EP2514150B1 EP2514150B1 (en) 2016-07-06 Family ID=43567888 Family Applications (2) Application Number Title Priority Date Filing Date EP20100795898 Active EP2514150B1 (en) 2009-12-17 2010-12-15 Distributed routing architecture EP20160001481 Pending EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Family Applications After (1) Application Number Title Priority Date Filing Date EP20160001481 Pending EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Country Status (7) Country Link US (1) US8325730B2 (en) EP (2) EP2514150B1 (en) JP (1) JP5964241B2 (en) CN (1) CN102792644B (en) CA (1) CA2784707C (en) ES (1) ES2582534T3 (en) WO (1) WO2011084520A1 (en) Families Citing this family (5) * Cited by examiner, † Cited by third party Publication number Priority date Publication date Assignee Title KR101556031B1 (en) 2012-01-30 2015-10-01 한국전자통신연구원 Method and system of distributed mobility control on network US9647883B2 (en) 2014-03-21 2017-05-09 Nicria, Inc. Multiple levels of logical routers US9503321B2 (en) 2014-03-21 2016-11-22 Nicira, Inc. Dynamic routing for logical routers US20160226700A1 (en) 2015-01-30 2016-08-04 Nicira, Inc. Transit logical switch within logical router WO2016123550A1 (en) * 2015-01-30 2016-08-04 Nicira, Inc. Logical router with multiple routing components Family Cites Families (83) * Cited by examiner, † Cited by third party Publication number Priority date Publication date Assignee Title JPH04310188A (en) * 1991-03-01 1992-11-02 Internatl Business Mach Corp <Ibm> Library service method for document/image library JP3371006B2 (en) * 1993-03-03 2003-01-27 株式会社日立製作所 Table search method and router device US5664106A (en) * 1993-06-04 1997-09-02 Digital Equipment Corporation Phase-space surface representation of server computer performance in a computer network US6581090B1 (en) * 1996-10-14 2003-06-17 Mirror Image Internet, Inc. Internet communication system US5796952A (en) * 1997-03-21 1998-08-18 Dot Com Development, Inc. Method and apparatus for tracking client interaction with a network resource and creating client profiles and resource database US6185598B1 (en) * 1998-02-10 2001-02-06 Digital Island, Inc. Optimized network resource location US8060613B2 (en) * 1998-02-10 2011-11-15 Level 3 Communications, Llc Resource invalidation in a content delivery network US6438592B1 (en) * 1998-02-25 2002-08-20 Michael G. Killian Systems for monitoring and improving performance on the world wide web US6256398B1 (en) * 1998-08-22 2001-07-03 Kenneth H. P. Chang Encoding and decoding a message within an image US6192051B1 (en) * 1999-02-26 2001-02-20 Redstone Communications, Inc. Network router search engine using compressed tree forwarding table US6978418B1 (en) * 1999-04-13 2005-12-20 Hewlett-Packard Development Company, L.P. Dynamic-adaptive client-side image map US6560610B1 (en) * 1999-08-10 2003-05-06 Washington University Data structure using a tree bitmap and method for rapid classification of data in a database US7120871B1 (en) * 1999-09-15 2006-10-10 Actv, Inc. Enhanced video programming system and method utilizing a web page staging area US7748005B2 (en) * 2000-01-28 2010-06-29 Hewlett-Packard Development Company, L.P. System and method for allocating a plurality of resources between a plurality of computing domains US6553419B1 (en) * 2000-02-02 2003-04-22 International Business Machines Corporation System and method for computer system performance data pause and resume consuming minimum display area US7650376B1 (en) * 2000-03-27 2010-01-19 Blumenau Trevor I Content distribution system for distributing content over a network, with particular applicability to distributing high-bandwidth content US7240100B1 (en) * 2000-04-14 2007-07-03 Akamai Technologies, Inc. Content delivery network (CDN) content server request handling mechanism with metadata framework support US6996616B1 (en) * 2000-04-17 2006-02-07 Akamai Technologies, Inc. HTML delivery from edge-of-network servers in a content delivery network (CDN) US6698013B1 (en) * 2000-10-04 2004-02-24 Mintaka Technology Group Real time monitoring system for tracking and documenting changes made by programmer's during maintenance or development of computer readable code on a line by line basis and/or by point of focus US7756032B2 (en) * 2000-10-17 2010-07-13 Avaya Inc. Method and apparatus for communicating data within measurement traffic US20020150094A1 (en) * 2000-10-27 2002-10-17 Matthew Cheng Hierarchical level-based internet protocol multicasting US20020064136A1 (en) * 2000-11-02 2002-05-30 O'neil Timothy M. Conferencing network resource optimization for multi-point conferences US7840652B2 (en) * 2001-03-21 2010-11-23 Ascentive Llc System and method for determining network configuration settings that provide optimal network performance US7085825B1 (en) * 2001-03-26 2006-08-01 Freewebs Corp. Apparatus, method and system for improving application performance across a communications network US7664119B2 (en) * 2001-03-30 2010-02-16 Intel Corporation Method and apparatus to perform network routing EP1410217A4 (en) * 2001-04-02 2006-09-20 Akamai Tech Inc Scalable, high performance and highly available distributed storage system for internet content US7146560B2 (en) * 2001-05-18 2006-12-05 Xerox Corporation Systems and methods for managing identity information US7159014B2 (en) * 2001-06-04 2007-01-02 Fineground Networks Method and system for efficient and automated version management of embedded objects in web documents US7320131B1 (en) * 2001-06-06 2008-01-15 Cisco Technology, Inc. Methods and apparatus for selecting a server to process a request US7343399B2 (en) * 2001-06-25 2008-03-11 Nortel Networks Limited Apparatus and method for managing internet resource requests US7024477B2 (en) * 2001-06-29 2006-04-04 International Business Machines Corporation Service time analysis methods for the WSM QOS monitor US6981029B1 (en) * 2001-07-17 2005-12-27 Cisco Technology, Inc. System and method for processing a request for information in a network US6633324B2 (en) * 2001-07-31 2003-10-14 Forgent Networks, Inc. System and method for video call configuration and scheduling US7023465B2 (en) * 2001-07-31 2006-04-04 Tandberg Telecom As System and method for communication device configuration, scheduling and access control JP3748216B2 (en) * 2001-08-02 2006-02-22 日本電信電話株式会社 Packet transfer method and a packet transceiver US7133368B2 (en) * 2002-02-01 2006-11-07 Microsoft Corporation Peer-to-peer method of quality of service (QoS) probing and analysis and infrastructure employing same US7065496B2 (en) * 2002-02-13 2006-06-20 Tangoe, Inc. System for managing equipment, services and service provider agreements US7433871B2 (en) * 2002-02-14 2008-10-07 Transwitch Corporation Efficient ipv4/ipv6 best matching prefix method and apparatus US9167036B2 (en) * 2002-02-14 2015-10-20 Level 3 Communications, Llc Managed object replication and delivery US9137324B2 (en) * 2002-04-10 2015-09-15 International Business Machines Corporation Capacity on-demand in distributed computing environments US20040194085A1 (en) * 2002-05-09 2004-09-30 Globespanvirata Incorporated Method and system for providing capability management and prioritization in a computer system US7269657B1 (en) * 2002-05-10 2007-09-11 Rockwell Collins, Inc. Method and system for providing a mobile IP network with non-path dependent intra domain quality of service US20030221000A1 (en) * 2002-05-16 2003-11-27 Ludmila Cherkasova System and method for measuring web service performance using captured network packets US7899067B2 (en) * 2002-05-31 2011-03-01 Cisco Technology, Inc. Method and apparatus for generating and using enhanced tree bitmap data structures in determining a longest prefix match US7120874B2 (en) * 2002-06-18 2006-10-10 National Instruments Corporation Filtering graphical program elements based on configured or targeted resources US20030149581A1 (en) * 2002-08-28 2003-08-07 Imran Chaudhri Method and system for providing intelligent network content delivery US6826661B2 (en) * 2002-08-30 2004-11-30 Veritas Operating Corporation Methods and systems for storage architectures US20040064558A1 (en) * 2002-09-26 2004-04-01 Hitachi Ltd. Resource distribution management method over inter-networks US7961736B2 (en) * 2002-09-26 2011-06-14 Sharp Laboratories Of America, Inc. Convergence and classification of data packets in a centralized communication system US6975963B2 (en) * 2002-09-30 2005-12-13 Mcdata Corporation Method and system for storing and reporting network performance metrics using histograms US7310686B2 (en) * 2002-10-27 2007-12-18 Paxfire, Inc. Apparatus and method for transparent selection of an Internet server based on geographic location of a user US7752301B1 (en) * 2003-01-23 2010-07-06 Gomez Acquisition Corporation System and interface for monitoring information technology assets US7581224B2 (en) * 2003-07-10 2009-08-25 Hewlett-Packard Development Company, L.P. Systems and methods for monitoring resource utilization and application performance JP4421230B2 (en) * 2003-08-12 2010-02-24 株式会社日立製作所 Performance information analysis method US7565655B2 (en) 2003-10-17 2009-07-21 International Business Machines Corporation Methods and systems for control discovery in computing systems JP4516306B2 (en) * 2003-11-28 2010-08-04 株式会社日立製作所 How to collect the performance information of the storage network US9032096B2 (en) * 2003-12-17 2015-05-12 Cisco Technology, Inc. Reducing the impact of network latency on application performance US7773596B1 (en) * 2004-02-19 2010-08-10 Juniper Networks, Inc. Distribution of traffic flow criteria US7606236B2 (en) * 2004-05-21 2009-10-20 Intel Corporation Forwarding information base lookup method US20050273507A1 (en) * 2004-06-08 2005-12-08 Yong Yan Method and system for managing heterogeneous resources across a distributed computer network US8526446B2 (en) * 2005-02-04 2013-09-03 Level 3 Communications, Llc Ethernet-based systems and methods for improved network routing US8064467B2 (en) * 2005-02-04 2011-11-22 Level 3 Communications, Llc Systems and methods for network routing in a multiple backbone network architecture US8589561B2 (en) * 2005-03-22 2013-11-19 Alcatel Lucent Session level technique for improving web browsing performance on low speed links JP2006279466A (en) * 2005-03-29 2006-10-12 Fujitsu Ltd System, program, and method for monitoring US7685270B1 (en) * 2005-03-31 2010-03-23 Amazon Technologies, Inc. Method and apparatus for measuring latency in web services US7519200B2 (en) * 2005-05-09 2009-04-14 Like.Com System and method for enabling the use of captured images through recognition US7853871B2 (en) * 2005-06-10 2010-12-14 Nokia Corporation System and method for identifying segments in a web resource US7904875B2 (en) * 2005-12-12 2011-03-08 Microsoft Corporation Configuring and allocating software product technical services US20070219795A1 (en) * 2006-03-20 2007-09-20 Park Joseph C Facilitating content generation via paid participation US20070245010A1 (en) * 2006-03-24 2007-10-18 Robert Arn Systems and methods for multi-perspective optimization of data transfers in heterogeneous networks such as the internet US20070250611A1 (en) * 2006-04-20 2007-10-25 Bhogal Kulvir S Method of and System for Providing Performance Information in a UDDI System US7522595B2 (en) * 2006-06-16 2009-04-21 Cisco Technology, Inc. Communicating packets between forwarding contexts using virtual interfaces US7787380B1 (en) * 2006-06-30 2010-08-31 Juniper Networks, Inc. Resource reservation protocol with traffic engineering point to multi-point label switched path hierarchy JP4317995B2 (en) * 2007-05-11 2009-08-19 テクトロニクス・インコーポレイテッドＴｅｋｔｒｏｎｉｘ，Ｉｎｃ． Stream analysis apparatus and stream analysis display method US7937456B2 (en) * 2008-01-18 2011-05-03 Red Hat, Inc. Configuration profiling for remote clients US7979447B2 (en) * 2008-01-18 2011-07-12 Sony Corporation Method and apparatus for use in providing information to accessing content US8156243B2 (en) * 2008-03-31 2012-04-10 Amazon Technologies, Inc. Request routing US7925782B2 (en) * 2008-06-30 2011-04-12 Amazon Technologies, Inc. Request routing using network computing components US7930393B1 (en) * 2008-09-29 2011-04-19 Amazon Technologies, Inc. Monitoring domain allocation performance US8117306B1 (en) * 2008-09-29 2012-02-14 Amazon Technologies, Inc. Optimizing content management US8051166B1 (en) * 2008-09-29 2011-11-01 Amazon Technologies, Inc. Service provider optimization of content management US7865594B1 (en) * 2008-09-29 2011-01-04 Amazon Technologies, Inc. Managing resources consolidation configurations US7936754B2 (en) * 2008-12-12 2011-05-03 At&T Intellectual Property I, L.P. Methods and apparatus to dynamically store network routes for a communication network Non-Patent Citations (1) * Cited by examiner, † Cited by third party Title See references of WO2011084520A1 * Also Published As Publication number Publication date Type CN102792644B (en) 2016-03-09 grant EP2514150B1 (en) 2016-07-06 grant JP2013514745A (en) 2013-04-25 application ES2582534T3 (en) 2016-09-13 grant JP5964241B2 (en) 2016-08-03 grant US20110149965A1 (en) 2011-06-23 application US8325730B2 (en) 2012-12-04 grant EP3122010A1 (en) 2017-01-25 application CA2784707C (en) 2016-02-02 grant CN102792644A (en) 2012-11-21 application WO2011084520A1 (en) 2011-07-14 application CA2784707A1 (en) 2011-07-14 application Similar Documents Publication Publication Date Title US7184437B1 (en) Scalable route resolution US8239572B1 (en) Custom routing decisions US6804233B1 (en) Method and system for link level server/switch trunking US7535826B1 (en) Routing protocols for accommodating nodes with redundant routing facilities US8160063B2 (en) Data center interconnect and traffic engineering US7171681B1 (en) System and method for providing expandable proxy firewall services US20030023701A1 (en) Methods and apparatus for storage and processing of routing information US20060268869A1 (en) Designated router assginment per multicast group address/range US20080002588A1 (en) Method and apparatus for routing data packets in a global IP network WO2012093429A1 (en) Communication control system, control server, forwarding node, communication control method, and communication control program US20110286462A1 (en) Systems and methods for equal-cost multi-path virtual private lan service US20080198849A1 (en) Scaling virtual private networks using service insertion architecture US8693344B1 (en) Systems and methods for generating packet forwarding rules based on network policy US20070260746A1 (en) Maintaining IGP transparency of VPN routes when BGP is used as a PE-CE protocol US5983281A (en) Load balancing in a multiple network environment US7522603B2 (en) Technique for efficiently routing IP traffic on CE-CE paths across a provider network US20080144511A1 (en) Method and system for bandwidth allocation using router feedback US20080075089A1 (en) Snooping of on-path ip reservation protocols for layer 2 nodes US20100306408A1 (en) Agile data center network architecture US20050080923A1 (en) System and method for load balancing and fail over US7720061B1 (en) Distributed solution for managing periodic communications in a multi-chassis routing system US20040258074A1 (en) Method and apparatus for allocating addresses in integrated zero-configured and manually configured networks US8259585B1 (en) Dynamic link load balancing US20140192645A1 (en) Method for Internet Traffic Management Using a Central Traffic Controller US20050044141A1 (en) Method and system for multiple hosts anycast routing Legal Events Date Code Title Description AK Designated contracting states: Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR 17P Request for examination filed Effective date: 20120717 DAX Request for extension of the european patent (to any country) deleted 17Q First examination report Effective date: 20130828 REG Reference to a national code Ref country code: DE Ref legal event code: R079 Ref document number: 602010034537 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012560000 Ipc: H04L0012775000 RIC1 Classification (correction) Ipc: H04L 12/715 20130101ALI20160104BHEP Ipc: H04L 12/775 20130101AFI20160104BHEP INTG Announcement of intention to grant Effective date: 20160125 REG Reference to a national code Ref country code: GB Ref legal event code: FG4D AK Designated contracting states: Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR REG Reference to a national code Ref country code: AT Ref legal event code: REF Ref document number: 811381 Country of ref document: AT Kind code of ref document: T Effective date: 20160715 Ref country code: CH Ref legal event code: EP Ref country code: CH Ref legal event code: NV Representative=s name: STOLMAR AND PARTNER INTELLECTUAL PROPERTY S.A., CH REG Reference to a national code Ref country code: IE Ref legal event code: FG4D Ref country code: NL Ref legal event code: FP REG Reference to a national code Ref country code: DE Ref legal event code: R096 Ref document number: 602010034537 Country of ref document: DE REG Reference to a national code Ref country code: SE Ref legal event code: TRGR REG Reference to a national code Ref country code: ES Ref legal event code: FG2A Ref document number: 2582534 Country of ref document: ES Kind code of ref document: T3 Effective date: 20160913 REG Reference to a national code Ref country code: DE Ref legal event code: R082 Ref document number: 602010034537 Country of ref document: DE Representative=s name: BOSCH JEHLE PATENTANWALTSGESELLSCHAFT MBH, DE REG Reference to a national code Ref country code: LT Ref legal event code: MG4D REG Reference to a national code Ref country code: AT Ref legal event code: MK05 Ref document number: 811381 Country of ref document: AT Kind code of ref document: T Effective date: 20160706 REG Reference to a national code Ref country code: FR Ref legal event code: PLFP Year of fee payment: 7 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161006 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161106 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161107 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161007 REG Reference to a national code Ref country code: DE Ref legal event code: R097 Ref document number: 602010034537 Country of ref document: DE PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161006 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 26N No opposition filed Effective date: 20170407 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 REG Reference to a national code Ref country code: CH Ref legal event code: PCAR Free format text: NEW ADDRESS: RUE DU CENDRIER 15 CP 1489, 1201 GENEVE (CH) REG Reference to a national code Ref country code: FR Ref legal event code: PLFP Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: FI Payment date: 20171227 Year of fee payment: 8 Ref country code: LU Payment date: 20171226 Year of fee payment: 8 Ref country code: NL Payment date: 20171226 Year of fee payment: 8 Ref country code: FR Payment date: 20171227 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: IE Payment date: 20171228 Year of fee payment: 8 Ref country code: GB Payment date: 20171227 Year of fee payment: 8 Ref country code: BE Payment date: 20171227 Year of fee payment: 8 Ref country code: CH Payment date: 20171227 Year of fee payment: 8 Ref country code: SE Payment date: 20171229 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: ES Payment date: 20180102 Year of fee payment: 8 Ref country code: DE Payment date: 20171229 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: IT Payment date: 20171221 Year of fee payment: 8 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20101215	{ "url": "https://patents.google.com/patent/EP2514150A1", "source_domain": "patents.google.com", "snapshot_id": "crawl=CC-MAIN-2018-30", "warc_metadata": { "Content-Length": "217902", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LE3O64ZLLOIMUEZ5LCPPH3WQQQTV3334", "WARC-Concurrent-To": "<urn:uuid:eb357c15-3201-41d5-9fe8-1c7355b794cb>", "WARC-Date": "2018-07-18T18:42:52Z", "WARC-IP-Address": "172.217.7.142", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IPF7OBSNFQHIBCOM4NIIJWB72QYUFEA4", "WARC-Record-ID": "<urn:uuid:133dd5d2-4f67-4df4-8552-06ea9604cc7a>", "WARC-Target-URI": "https://patents.google.com/patent/EP2514150A1", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3ebb5b08-7530-435d-8089-0113bc384be3>" }, "warc_info": "robots: classic\r\nhostname: ip-10-13-227-44.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, 64, 65, 98, 99, 104, 105, 124, 136, 350, 360, 363, 376, 388, 400, 419, 426, 432, 443, 453, 461, 476, 667, 675, 694, 708, 724, 736, 748, 763, 781, 790, 804, 821, 839, 857, 874, 1047, 1071, 1089, 1113, 1304, 1316, 1333, 1334, 1340, 1341, 1357, 1358, 1377, 1419, 1497, 1574, 1612, 1631, 1673, 1751, 1828, 1890, 1891, 1900, 1901, 2920, 2921, 2933, 2934, 2967, 2968, 2979, 2980, 3834, 3835, 4617, 4618, 5695, 5696, 5730, 5731, 6008, 6009, 6218, 6219, 6382, 6383, 6603, 6604, 6762, 6763, 6916, 6917, 6938, 6939, 8747, 8748, 10099, 10100, 12005, 12006, 13600, 13601, 15237, 15238, 16794, 16795, 18217, 18218, 19383, 19384, 20411, 20412, 21944, 21945, 22869, 22870, 25077, 25078, 27051, 27052, 28096, 28097, 30485, 30486, 31585, 31586, 32204, 32205, 33015, 33016, 34584, 34585, 34818, 34819, 36252, 36253, 36991, 36992, 37592, 37593, 38600, 38601, 40197, 40198, 40549, 40550, 40557, 40558, 40578, 40622, 40756, 40928, 41498, 41789, 42181, 42394, 42828, 43275, 43555, 43851, 44172, 44413, 44513, 44655, 44830, 45035, 45243, 45451, 45633, 46447, 46492, 46579, 46810, 46921, 47194, 47600, 48083, 48278, 48474, 48746, 49169, 49369, 49587, 49780, 49881, 50025, 50202, 50343, 50498, 50640, 50796, 50937, 51092, 51359, 51514, 51680, 52202, 52345, 52449, 52618, 52686, 52933, 53486, 53710, 54073, 54343, 54552, 54745, 55014, 55430, 55627, 55837, 56030, 56131, 56463, 56556, 56557, 56583, 56584, 56635, 56718, 56811, 56812, 56847, 56848, 56899, 56985, 56986, 57017, 57018, 57069, 57164, 57165, 57182, 57183, 57219, 57269, 57309, 57310, 57317, 57318, 57330, 57331, 57355, 57356, 57407, 57500, 57594, 57595, 57625, 57626, 57677, 57771, 57772, 57791, 57792, 57805, 57829, 57853, 57877, 57902, 57925, 57949, 57976, 57977, 58009, 58010, 58054, 58119, 58231, 58318, 58406, 58507, 58612, 58613, 58640, 58641, 58685, 58750, 58877, 58966, 59124, 59223, 59417, 59515, 59636, 59767, 59876, 60015, 60137, 60293, 60424, 60606, 60794, 60991, 61163, 61309, 61570, 61693, 61808, 61942, 62103, 62258, 62365, 62518, 62631, 62794, 62924, 63050, 63189, 63325, 63451, 63600, 63700, 63866, 63992, 64118, 64227, 64369, 64537, 64709, 64860, 65045, 65198, 65327, 65444, 65562, 65724, 65873, 66036, 66173, 66340, 66431, 66577, 66694, 66824, 66926, 67027, 67174, 67307, 67460, 67598, 67696, 67822, 67950, 68070, 68196, 68310, 68486, 68623, 68762, 68932, 69067, 69165, 69298, 69381, 69499, 69607, 69704, 69823, 69938, 70100, 70101, 70126, 70127, 70171, 70177, 70212, 70213, 70231, 70232, 70273, 70308, 70342, 70384, 70418, 70452, 70496, 70530, 70570, 70603, 70644, 70687, 70727, 70728, 70746, 70747, 70782, 70825, 70867, 70940, 71033, 71099, 71183, 71276, 71360, 71450, 71597, 71692, 71783, 71883, 71984, 72049, 72152, 72238, 72322, 72382, 72454, 72563, 72693, 72738, 72833, 72907, 72908, 72921, 72922, 72950, 72984, 72985, 73015, 73016, 73151, 73152, 73186, 73187, 73212, 73213, 73287, 73316, 73317, 73342, 73343, 73376, 73377, 73398, 73399, 73426, 73427, 73461, 73462, 73490, 73491, 73545, 73546, 73566, 73567, 73600, 73601, 73642, 73643, 73684, 73685, 73725, 73726, 73751, 73752, 73785, 73786, 73807, 73808, 73835, 73836, 73870, 73871, 73901, 73902, 74037, 74038, 74071, 74072, 74093, 74094, 74120, 74121, 74149, 74150, 74178, 74179, 74208, 74209, 74234, 74235, 74256, 74257, 74282, 74283, 74304, 74305, 74330, 74331, 74405, 74406, 74439, 74440, 74461, 74462, 74489, 74490, 74511, 74512, 74537, 74538, 74571, 74572, 74593, 74594, 74621, 74622, 74656, 74657, 74685, 74686, 74719, 74720, 74741, 74742, 74769, 74770, 74803, 74804, 74825, 74826, 74853, 74854, 74883, 74884, 74912, 74913, 74943, 74944, 74969, 74970, 75003, 75004, 75025, 75026, 75053, 75054, 75088, 75089, 75117, 75118, 75187, 75188, 75221, 75222, 75243, 75244, 75271, 75272, 75305, 75306, 75327, 75328, 75355, 75356, 75384, 75385, 75413, 75414, 75443, 75444, 75469, 75470, 75503, 75504, 75525, 75526, 75553, 75554, 75577, 75578, 75669, 75670, 75691, 75692, 75829, 75830, 75855, 75856, 75877, 75878, 76015, 76016, 76041, 76042, 76063, 76064, 76201, 76202, 76227, 76228, 76249, 76250, 76387, 76388, 76413, 76414, 76435, 76436, 76573, 76574, 76599, 76600, 76691, 76692, 76713, 76714, 76851, 76852, 76877, 76878, 76899, 76900, 77037, 77038, 77063, 77064, 77085, 77086, 77223, 77224, 77249, 77250, 77271, 77272, 77409, 77410, 77435, 77436, 77457, 77458, 77595, 77596, 77621, 77622, 77655, 77656, 77677, 77678, 77705, 77706, 77740, 77741, 77769, 77770, 77861, 77862, 77883, 77884, 78021, 78022, 78047, 78048, 78069, 78070, 78207, 78208, 78233, 78234, 78325, 78326, 78347, 78348, 78485, 78486, 78511, 78512, 78533, 78534, 78671, 78672, 78697, 78698, 78719, 78720, 78857, 78858, 78883, 78884, 78905, 78906, 79043, 79044, 79069, 79070, 79091, 79092, 79229, 79230, 79255, 79256, 79280, 79281, 79306, 79307, 79398, 79399, 79420, 79421, 79558, 79559, 79584, 79585, 79676, 79677, 79698, 79699, 79836, 79837, 79862, 79863, 79896, 79897, 79918, 79919, 79946, 79947, 80023, 80024, 80057, 80058, 80079, 80080, 80107, 80108, 80131, 80132, 80184, 80185, 80206, 80207, 80230, 80231, 80254, 80255, 80276, 80277, 80300, 80301, 80324, 80325, 80346, 80347, 80370, 80371, 80394, 80395, 80416, 80417, 80440, 80441, 80464, 80465, 80517, 80518, 80539, 80540, 80563, 80564, 80587, 80588, 80609, 80610, 80633, 80634, 80657, 80658, 80679, 80680, 80703, 80704, 80727, 80728, 80749, 80750, 80773, 80774, 80797, 80798, 80819, 80820, 80843, 80844, 80867, 80868, 80920, 80921, 80942, 80943, 80966, 80967, 80990, 80991, 81012, 81013, 81036, 81037, 81060, 81061, 81113, 81114, 81135, 81136, 81159, 81160, 81183, 81184, 81275, 81276, 81297, 81298, 81435, 81436, 81461, 81462, 81483, 81484, 81640, 81641 ], "line_end_idx": [ 64, 65, 98, 99, 104, 105, 124, 136, 350, 360, 363, 376, 388, 400, 419, 426, 432, 443, 453, 461, 476, 667, 675, 694, 708, 724, 736, 748, 763, 781, 790, 804, 821, 839, 857, 874, 1047, 1071, 1089, 1113, 1304, 1316, 1333, 1334, 1340, 1341, 1357, 1358, 1377, 1419, 1497, 1574, 1612, 1631, 1673, 1751, 1828, 1890, 1891, 1900, 1901, 2920, 2921, 2933, 2934, 2967, 2968, 2979, 2980, 3834, 3835, 4617, 4618, 5695, 5696, 5730, 5731, 6008, 6009, 6218, 6219, 6382, 6383, 6603, 6604, 6762, 6763, 6916, 6917, 6938, 6939, 8747, 8748, 10099, 10100, 12005, 12006, 13600, 13601, 15237, 15238, 16794, 16795, 18217, 18218, 19383, 19384, 20411, 20412, 21944, 21945, 22869, 22870, 25077, 25078, 27051, 27052, 28096, 28097, 30485, 30486, 31585, 31586, 32204, 32205, 33015, 33016, 34584, 34585, 34818, 34819, 36252, 36253, 36991, 36992, 37592, 37593, 38600, 38601, 40197, 40198, 40549, 40550, 40557, 40558, 40578, 40622, 40756, 40928, 41498, 41789, 42181, 42394, 42828, 43275, 43555, 43851, 44172, 44413, 44513, 44655, 44830, 45035, 45243, 45451, 45633, 46447, 46492, 46579, 46810, 46921, 47194, 47600, 48083, 48278, 48474, 48746, 49169, 49369, 49587, 49780, 49881, 50025, 50202, 50343, 50498, 50640, 50796, 50937, 51092, 51359, 51514, 51680, 52202, 52345, 52449, 52618, 52686, 52933, 53486, 53710, 54073, 54343, 54552, 54745, 55014, 55430, 55627, 55837, 56030, 56131, 56463, 56556, 56557, 56583, 56584, 56635, 56718, 56811, 56812, 56847, 56848, 56899, 56985, 56986, 57017, 57018, 57069, 57164, 57165, 57182, 57183, 57219, 57269, 57309, 57310, 57317, 57318, 57330, 57331, 57355, 57356, 57407, 57500, 57594, 57595, 57625, 57626, 57677, 57771, 57772, 57791, 57792, 57805, 57829, 57853, 57877, 57902, 57925, 57949, 57976, 57977, 58009, 58010, 58054, 58119, 58231, 58318, 58406, 58507, 58612, 58613, 58640, 58641, 58685, 58750, 58877, 58966, 59124, 59223, 59417, 59515, 59636, 59767, 59876, 60015, 60137, 60293, 60424, 60606, 60794, 60991, 61163, 61309, 61570, 61693, 61808, 61942, 62103, 62258, 62365, 62518, 62631, 62794, 62924, 63050, 63189, 63325, 63451, 63600, 63700, 63866, 63992, 64118, 64227, 64369, 64537, 64709, 64860, 65045, 65198, 65327, 65444, 65562, 65724, 65873, 66036, 66173, 66340, 66431, 66577, 66694, 66824, 66926, 67027, 67174, 67307, 67460, 67598, 67696, 67822, 67950, 68070, 68196, 68310, 68486, 68623, 68762, 68932, 69067, 69165, 69298, 69381, 69499, 69607, 69704, 69823, 69938, 70100, 70101, 70126, 70127, 70171, 70177, 70212, 70213, 70231, 70232, 70273, 70308, 70342, 70384, 70418, 70452, 70496, 70530, 70570, 70603, 70644, 70687, 70727, 70728, 70746, 70747, 70782, 70825, 70867, 70940, 71033, 71099, 71183, 71276, 71360, 71450, 71597, 71692, 71783, 71883, 71984, 72049, 72152, 72238, 72322, 72382, 72454, 72563, 72693, 72738, 72833, 72907, 72908, 72921, 72922, 72950, 72984, 72985, 73015, 73016, 73151, 73152, 73186, 73187, 73212, 73213, 73287, 73316, 73317, 73342, 73343, 73376, 73377, 73398, 73399, 73426, 73427, 73461, 73462, 73490, 73491, 73545, 73546, 73566, 73567, 73600, 73601, 73642, 73643, 73684, 73685, 73725, 73726, 73751, 73752, 73785, 73786, 73807, 73808, 73835, 73836, 73870, 73871, 73901, 73902, 74037, 74038, 74071, 74072, 74093, 74094, 74120, 74121, 74149, 74150, 74178, 74179, 74208, 74209, 74234, 74235, 74256, 74257, 74282, 74283, 74304, 74305, 74330, 74331, 74405, 74406, 74439, 74440, 74461, 74462, 74489, 74490, 74511, 74512, 74537, 74538, 74571, 74572, 74593, 74594, 74621, 74622, 74656, 74657, 74685, 74686, 74719, 74720, 74741, 74742, 74769, 74770, 74803, 74804, 74825, 74826, 74853, 74854, 74883, 74884, 74912, 74913, 74943, 74944, 74969, 74970, 75003, 75004, 75025, 75026, 75053, 75054, 75088, 75089, 75117, 75118, 75187, 75188, 75221, 75222, 75243, 75244, 75271, 75272, 75305, 75306, 75327, 75328, 75355, 75356, 75384, 75385, 75413, 75414, 75443, 75444, 75469, 75470, 75503, 75504, 75525, 75526, 75553, 75554, 75577, 75578, 75669, 75670, 75691, 75692, 75829, 75830, 75855, 75856, 75877, 75878, 76015, 76016, 76041, 76042, 76063, 76064, 76201, 76202, 76227, 76228, 76249, 76250, 76387, 76388, 76413, 76414, 76435, 76436, 76573, 76574, 76599, 76600, 76691, 76692, 76713, 76714, 76851, 76852, 76877, 76878, 76899, 76900, 77037, 77038, 77063, 77064, 77085, 77086, 77223, 77224, 77249, 77250, 77271, 77272, 77409, 77410, 77435, 77436, 77457, 77458, 77595, 77596, 77621, 77622, 77655, 77656, 77677, 77678, 77705, 77706, 77740, 77741, 77769, 77770, 77861, 77862, 77883, 77884, 78021, 78022, 78047, 78048, 78069, 78070, 78207, 78208, 78233, 78234, 78325, 78326, 78347, 78348, 78485, 78486, 78511, 78512, 78533, 78534, 78671, 78672, 78697, 78698, 78719, 78720, 78857, 78858, 78883, 78884, 78905, 78906, 79043, 79044, 79069, 79070, 79091, 79092, 79229, 79230, 79255, 79256, 79280, 79281, 79306, 79307, 79398, 79399, 79420, 79421, 79558, 79559, 79584, 79585, 79676, 79677, 79698, 79699, 79836, 79837, 79862, 79863, 79896, 79897, 79918, 79919, 79946, 79947, 80023, 80024, 80057, 80058, 80079, 80080, 80107, 80108, 80131, 80132, 80184, 80185, 80206, 80207, 80230, 80231, 80254, 80255, 80276, 80277, 80300, 80301, 80324, 80325, 80346, 80347, 80370, 80371, 80394, 80395, 80416, 80417, 80440, 80441, 80464, 80465, 80517, 80518, 80539, 80540, 80563, 80564, 80587, 80588, 80609, 80610, 80633, 80634, 80657, 80658, 80679, 80680, 80703, 80704, 80727, 80728, 80749, 80750, 80773, 80774, 80797, 80798, 80819, 80820, 80843, 80844, 80867, 80868, 80920, 80921, 80942, 80943, 80966, 80967, 80990, 80991, 81012, 81013, 81036, 81037, 81060, 81061, 81113, 81114, 81135, 81136, 81159, 81160, 81183, 81184, 81275, 81276, 81297, 81298, 81435, 81436, 81461, 81462, 81483, 81484, 81640, 81641, 81665 ] }	{ "red_pajama_v2": { "ccnet_original_length": 81665, "ccnet_original_nlines": 817, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2853958308696747, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0775466114282608, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2234531193971634, "rps_doc_frac_unique_words": 0.14060044288635254, "rps_doc_mean_word_length": 5.537507057189941, "rps_doc_num_sentences": 397, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.764464855194092, "rps_doc_word_count": 12091, "rps_doc_frac_chars_dupe_10grams": 0.3401738405227661, "rps_doc_frac_chars_dupe_5grams": 0.5375033617019653, "rps_doc_frac_chars_dupe_6grams": 0.46579742431640625, "rps_doc_frac_chars_dupe_7grams": 0.4300713837146759, "rps_doc_frac_chars_dupe_8grams": 0.4028586745262146, "rps_doc_frac_chars_dupe_9grams": 0.37612390518188477, "rps_doc_frac_chars_top_2gram": 0.013890130445361137, "rps_doc_frac_chars_top_3gram": 0.008065240457654, "rps_doc_frac_chars_top_4gram": 0.020073480904102325, "rps_doc_books_importance": -7482.51611328125, "rps_doc_books_importance_length_correction": -7482.51611328125, "rps_doc_openwebtext_importance": -4623.283203125, "rps_doc_openwebtext_importance_length_correction": -4623.283203125, "rps_doc_wikipedia_importance": -3389.7861328125, "rps_doc_wikipedia_importance_length_correction": -3389.7861328125 }, "fasttext": { "dclm": 0.11493874341249466, "english": 0.8517946600914001, "fineweb_edu_approx": 2.557751417160034, "eai_general_math": 0.12556272745132446, "eai_open_web_math": 0.044044379144907, "eai_web_code": 0.10765749216079712 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.4", "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": "11", "label": "Legal/Regulatory" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "11", "label": "Legal Notices" } }, "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
9,042,921,916,750,535,000	How to copy a single file to multiple directories in Linux or Unix in Categories , , , , , , , , last updated January 17, 2017 If I want to copy a single file into three locations (directories), by using a single cp command (e.g. cp file /dir1/ /dir2/ /dir3/. Would that be possible? If yes, please provide the command for GNU/Linux or Unix operating systems. The short answer is no. You can not use GNU/cp or BSD/cp to copy a single file to multiple directories. However, you can use combination of cp and xargs/parallel and other commands to copy a single file to multiple directories in MacOS, Linux, FreeBSD, OpenBSD, NetBSD and Unix-like systems. Copying one file to multiple directories The cp command The basic cp command syntax is as follows to copy multiple files to a single directory: cp file1 /dir1/ cp file1 file2 file3 /dir1/ Copy file to multiple directories in Unix or Linux The trick is to use the xargs command or GNU parallel command. Copying one file named foo.txt to multiple directories called /tmp/1/, /tmp/2/, and /tmp/3 using xargs The xargs command construct argument list(s) and execute utility such as cp or mv. The syntax is: xargs -n 1 cp -v filename<<<"/dir1/ /dir2/ /dir3/" ## OR ## echo "/dir1/ /dir2/ /dir3/" \| xargs -n 1 cp -v filename In this example copy /etc/passwd to /tmp/1/, /tmp/2/, and $HOME/3/ as follows: xargs -n 1 cp -v /etc/passwd<<<"/tmp/1/ /tmp/2/ $HOME/3/" OR echo "/tmp/1/ /tmp/2/ $HOME/3/" \| xargs -n 1 cp -v /etc/passwd Sample outputs: Fig.01: Copy multiple files in different directories using the Linux/Unix cp command Fig.01: Copy multiple files in different directories using the Linux/Unix cp command Copying one file named foo.txt to multiple directories called /tmp/1/, /tmp/2/, and /tmp/3 using parallel GNU parallel is a shell tool for executing jobs in parallel using one or more computers. The syntax is: parallel cp fileNameHere ::: /dir1/ /dir2/ /dir3/ In this example copy /etc/resolv.conf to /tmp/1/, /tmp/2/, and $HOME/3/ as follows: parallel cp -v /etc/resolv.conf ::: /tmp/1/ /tmp/2/ $HOME/3/ Sample outputs: /etc/resolv.conf -> /tmp/2/resolv.conf /etc/resolv.conf -> /tmp/1/resolv.conf /etc/resolv.conf -> /Users/vivek/3/resolv.conf How to use tee command to copy file to multiple folders Say you want to copy /etc/resolv.conf to /tmp/1/ and /tmp/2/, you run the tee command as follows: tee /tmp/1/resolv.conf /tmp/2/resolv.conf < /etc/resolv.conf tee /tmp/1/resolv.conf /tmp/2/resolv.conf < /etc/resolv.conf >/dev/null You need to specify full path like /tmp/1/resolv.conf, otherwise you get the following error: tee: /tmp/1/: Is a directory How to use find command to copy files to multiple dirs simultaneously The syntax is as follows for the find command: find /dir1/ /dir2/ -maxdepth 0 -exec cp filename {} \; To copy /etc/hosts simultaneously to /tmp/{1,2}/ and $HOME/3/ folders under a Linux/Unix/MacOS/FreeBSD etc, enter: find /tmp/1/ /tmp/2/ $HOME/3/ -maxdepth 0 -exec cp /etc/hosts {} \; Sample outputs: /etc/hosts -> /tmp/1/hosts /etc/hosts -> /tmp/2/hosts /etc/hosts -> /Users/vivek/3/hosts Shell loop You can also use bash for loop as follows: for dest in /dir1/ /dir2/ ; do cp -v file "$dest" ; done for dest in /tmp/1/ /tmp2/ $HOME/3/ ; do cp -v "/etc/resolv.conf" "$dest" ; done Posted by: Vivek Gite The author is the creator of nixCraft and a seasoned sysadmin, DevOps engineer, and a trainer for the Linux operating system/Unix shell scripting. Get the latest tutorials on SysAdmin, Linux/Unix and open source topics via RSS/XML feed or weekly email newsletter. Share this on (or read 5 comments/add one below): 5 comment Have a question? Post it on our forum!	{ "url": "https://www.cyberciti.biz/faq/linux-unix-copy-a-file-to-multiple-directories-using-cp-command/", "source_domain": "www.cyberciti.biz", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "49201", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:IZKQAWPXZRMY5N6LGZWBFHTQFYMOFAL2", "WARC-Concurrent-To": "<urn:uuid:741e55ce-81d1-427a-9f69-665aacf3206c>", "WARC-Date": "2018-02-22T23:01:08Z", "WARC-IP-Address": "104.20.186.5", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:BRT5556LS7GFXO6AWRHVLQMF6L45OJLK", "WARC-Record-ID": "<urn:uuid:a31ca598-49c4-4012-920c-8a65f77c35c0>", "WARC-Target-URI": "https://www.cyberciti.biz/faq/linux-unix-copy-a-file-to-multiple-directories-using-cp-command/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3e4b70a4-f1b0-4dbc-8991-9fd1153e453f>" }, "warc_info": "robots: classic\r\nhostname: ip-10-136-53-50.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 67, 68, 128, 129, 362, 363, 655, 656, 697, 698, 713, 714, 802, 818, 846, 847, 898, 899, 962, 963, 1066, 1067, 1165, 1166, 1218, 1220, 1229, 1285, 1286, 1365, 1423, 1426, 1489, 1505, 1506, 1591, 1676, 1677, 1783, 1784, 1888, 1889, 1939, 1940, 2024, 2085, 2101, 2102, 2141, 2180, 2227, 2228, 2284, 2285, 2383, 2516, 2610, 2611, 2640, 2641, 2711, 2712, 2759, 2814, 2929, 2930, 2998, 2999, 3015, 3016, 3043, 3070, 3105, 3106, 3117, 3118, 3161, 3162, 3219, 3300, 3301, 3323, 3324, 3588, 3589, 3639, 3640, 3650, 3651 ], "line_end_idx": [ 67, 68, 128, 129, 362, 363, 655, 656, 697, 698, 713, 714, 802, 818, 846, 847, 898, 899, 962, 963, 1066, 1067, 1165, 1166, 1218, 1220, 1229, 1285, 1286, 1365, 1423, 1426, 1489, 1505, 1506, 1591, 1676, 1677, 1783, 1784, 1888, 1889, 1939, 1940, 2024, 2085, 2101, 2102, 2141, 2180, 2227, 2228, 2284, 2285, 2383, 2516, 2610, 2611, 2640, 2641, 2711, 2712, 2759, 2814, 2929, 2930, 2998, 2999, 3015, 3016, 3043, 3070, 3105, 3106, 3117, 3118, 3161, 3162, 3219, 3300, 3301, 3323, 3324, 3588, 3589, 3639, 3640, 3650, 3651, 3693 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3693, "ccnet_original_nlines": 89, "rps_doc_curly_bracket": 0.0016247000312432647, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20879121124744415, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01798201911151409, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.39060938358306885, "rps_doc_frac_unique_words": 0.3496376872062683, "rps_doc_mean_word_length": 4.865942001342773, "rps_doc_num_sentences": 36, "rps_doc_symbol_to_word_ratio": 0.003996000159531832, "rps_doc_unigram_entropy": 4.736308574676514, "rps_doc_word_count": 552, "rps_doc_frac_chars_dupe_10grams": 0.10833954066038132, "rps_doc_frac_chars_dupe_5grams": 0.20364855229854584, "rps_doc_frac_chars_dupe_6grams": 0.17237527668476105, "rps_doc_frac_chars_dupe_7grams": 0.17237527668476105, "rps_doc_frac_chars_dupe_8grams": 0.15227103233337402, "rps_doc_frac_chars_dupe_9grams": 0.13812360167503357, "rps_doc_frac_chars_top_2gram": 0.020104240626096725, "rps_doc_frac_chars_top_3gram": 0.05472822114825249, "rps_doc_frac_chars_top_4gram": 0.046537600457668304, "rps_doc_books_importance": -327.55291748046875, "rps_doc_books_importance_length_correction": -327.55291748046875, "rps_doc_openwebtext_importance": -221.1742706298828, "rps_doc_openwebtext_importance_length_correction": -221.1742706298828, "rps_doc_wikipedia_importance": -158.0078125, "rps_doc_wikipedia_importance_length_correction": -158.0078125 }, "fasttext": { "dclm": 0.8073555827140808, "english": 0.7885155081748962, "fineweb_edu_approx": 2.7204668521881104, "eai_general_math": 0.952221155166626, "eai_open_web_math": 0.3794100284576416, "eai_web_code": 0.7633244395256042 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,097,214,138,249,679,000	Welcome :: Homework Help and Answers :: Mathskey.com Welcome to Mathskey.com Question & Answers Community. Ask any math/science homework question and receive answers from other members of the community. 13,434 questions 17,804 answers 1,438 comments 59,225 users Standard and General Form of the Circle's Equation? +3 votes Standard and General Form of the Circle's Equation? Write the standard form of the equation and the general form of the equation of each circle of radius r and center (h, k). (1) r = 3; (h, k) = (0, 0 ) (2) r = 5; (h, k) = (-5, 2) asked Jan 16, 2013 in ALGEBRA 1 by homeworkhelp Mentor 1 Answer +5 votes Best answer (1) r = 3; (h, k) = (0, 0 ) General Form equation is x2 + y2 – 2hx – 2ky + h2 + k2 – r2 = 0, where (h, k) is the centre and r, the radius. x2 + y2 + 2(0)x – 2(0)y + 02 + 02 – 32 = 0 x2 + y2 – 32 = 0 x2 + y2 – 9 = 0 Standard Form Equation is (x – h)2 + (y – k)2 = r2 where (h, k) is the centre and r, the radius. (x – 0) 2 + (y – 0) 2 = 32 x2 + y2 = 9 . 2) r = 5; (h, k) = (-5, 2) General Form equation is x2 + y2 – 2hx – 2ky + h2 + k2 – r2 = 0, where (h, k) is the centre and r, the radius. x2 + y2 –2(–5)x – 2(2)y + (–5)2 + 22 – 52 = 0 x2 + y2 + 10x – 4y + 25 + 4 – 25 = 0 x2 + y2 + 10x – 4y + 4 = 0 Standard Form Equation is (x – h)2 + (y – k)2 = r2 where (h, k) is the centre and r, the radius. (x – (–5)) 2 + (y–2)2 = 52 (x + 5)2 + (y – 2)2 = 25 source: http://answers.yahoo.com/question/index?qid=20071125073022AADwDqu answered Jan 16, 2013 by Naren Answers Apprentice selected Jan 23, 2013 by homeworkhelp Thank you!!! it helped a lot... Related questions ...	{ "url": "http://www.mathskey.com/question2answer/741/standard-and-general-form-of-the-circles-equation", "source_domain": "www.mathskey.com", "snapshot_id": "crawl=CC-MAIN-2021-04", "warc_metadata": { "Content-Length": "80975", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:WNJO4JBBU7C5J2PAZ7MSWA33NF5NDWJI", "WARC-Concurrent-To": "<urn:uuid:760e96f4-5e74-4c29-becb-df192dcdde6d>", "WARC-Date": "2021-01-18T00:33:06Z", "WARC-IP-Address": "108.161.128.73", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:A2ZTWJT7WVTVEURIY6CYC3SRYLSCUX7O", "WARC-Record-ID": "<urn:uuid:d460aff9-bd62-44cd-bb2c-113b3e8695b7>", "WARC-Target-URI": "http://www.mathskey.com/question2answer/741/standard-and-general-form-of-the-circles-equation", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bde4ce17-5af4-4db3-b2f3-0d8274c4c27e>" }, "warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 53, 203, 204, 221, 222, 237, 238, 253, 254, 267, 268, 320, 321, 330, 331, 383, 384, 507, 508, 536, 537, 565, 620, 621, 630, 631, 640, 642, 654, 655, 683, 794, 837, 854, 870, 871, 968, 995, 1009, 1010, 1037, 1148, 1194, 1231, 1258, 1259, 1356, 1357, 1384, 1409, 1410, 1412, 1413, 1487, 1488, 1538, 1576, 1608, 1609, 1627, 1628 ], "line_end_idx": [ 53, 203, 204, 221, 222, 237, 238, 253, 254, 267, 268, 320, 321, 330, 331, 383, 384, 507, 508, 536, 537, 565, 620, 621, 630, 631, 640, 642, 654, 655, 683, 794, 837, 854, 870, 871, 968, 995, 1009, 1010, 1037, 1148, 1194, 1231, 1258, 1259, 1356, 1357, 1384, 1409, 1410, 1412, 1413, 1487, 1488, 1538, 1576, 1608, 1609, 1627, 1628, 1631 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1631, "ccnet_original_nlines": 61, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20502901077270508, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0019342399900779128, "rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495, "rps_doc_frac_no_alph_words": 0.5473887920379639, "rps_doc_frac_unique_words": 0.319218248128891, "rps_doc_mean_word_length": 3.4267101287841797, "rps_doc_num_sentences": 18, "rps_doc_symbol_to_word_ratio": 0.0038684699684381485, "rps_doc_unigram_entropy": 4.1462483406066895, "rps_doc_word_count": 307, "rps_doc_frac_chars_dupe_10grams": 0.26996198296546936, "rps_doc_frac_chars_dupe_5grams": 0.4134981036186218, "rps_doc_frac_chars_dupe_6grams": 0.4134981036186218, "rps_doc_frac_chars_dupe_7grams": 0.3764258623123169, "rps_doc_frac_chars_dupe_8grams": 0.3498098850250244, "rps_doc_frac_chars_dupe_9grams": 0.26996198296546936, "rps_doc_frac_chars_top_2gram": 0.017110269516706467, "rps_doc_frac_chars_top_3gram": 0.034220531582832336, "rps_doc_frac_chars_top_4gram": 0.034220531582832336, "rps_doc_books_importance": -229.9741668701172, "rps_doc_books_importance_length_correction": -216.18353271484375, "rps_doc_openwebtext_importance": -102.61990356445312, "rps_doc_openwebtext_importance_length_correction": -102.61990356445312, "rps_doc_wikipedia_importance": -74.31477355957031, "rps_doc_wikipedia_importance_length_correction": -61.37637710571289 }, "fasttext": { "dclm": 0.06963943690061569, "english": 0.8601978421211243, "fineweb_edu_approx": 1.8463858366012573, "eai_general_math": 0.9316676259040833, "eai_open_web_math": 0.6628491282463074, "eai_web_code": 0.056333720684051514 } }	{ "free_decimal_correspondence": { "primary": { "code": "516.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } }, "secondary": { "code": "512.9", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Algebra" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-6,318,460,014,703,200,000	Navigating Privacy and Security Concerns in Metaverse Apps The rise of metaverse apps has ushered in a new era of virtual experiences and interactions. From gaming to socializing, these immersive platforms offer endless possibilities. However, with this new frontier comes a set of privacy and security concerns that users must navigate. In this article, we will explore the key issues surrounding privacy and security in metaverse apps and provide insights on how users can protect themselves. Understanding Data Collection Practices Metaverse apps often require users to create accounts and provide personal information. This data is collected for various purposes, such as user authentication, customization of virtual avatars, or targeted advertising. It is crucial for users to understand what data is being collected and how it will be used. To ensure transparency, metaverse app developers should provide clear privacy policies that outline their data collection practices. Users should take the time to read these policies carefully before signing up or using the app. Additionally, it is advisable to choose apps that have a good track record of handling user data responsibly. Safeguarding Personal Information Protecting personal information is paramount when using metaverse apps. Users should be cautious about sharing sensitive data such as their full name, address, or financial information within these platforms unless absolutely necessary. One way to safeguard personal information is by utilizing strong passwords for metaverse app accounts and enabling two-factor authentication whenever possible. This adds an extra layer of security by requiring users to verify their identity through another device or method. Furthermore, it is essential to regularly update the metaverse app to ensure that any security vulnerabilities are patched promptly. Staying vigilant against phishing attempts or suspicious links within the app can also help prevent unauthorized access to personal information. Managing Social Interactions Metaverse apps thrive on social interactions between users, but this also opens up opportunities for potential privacy breaches or cyberbullying. Users should be mindful of the information they share with others and be cautious about accepting friend requests or engaging in private conversations with unknown individuals. Most metaverse apps provide privacy settings that allow users to customize who can see their profile, interact with them, or access their personal information. Reviewing and adjusting these settings regularly can help users maintain control over their privacy within the virtual world. In cases where inappropriate behavior or harassment occurs, users should report the incident to the app’s support team immediately. Metaverse app developers have a responsibility to address such issues promptly and take appropriate actions against offenders. Staying Informed about App Updates Metaverse apps are continuously evolving, which means that privacy and security concerns may arise as new features are introduced. It is essential for users to stay informed about app updates, especially those related to privacy and security enhancements. Following official announcements from the app developer or joining user communities where updates are shared can provide valuable insights into any changes that may affect user privacy. By staying up-to-date, users can take proactive measures to protect themselves and adjust their privacy settings accordingly. In conclusion, while metaverse apps offer exciting virtual experiences, it is crucial for users to navigate privacy and security concerns effectively. Understanding data collection practices, safeguarding personal information, managing social interactions, and staying informed about app updates are key steps towards ensuring a safe and secure metaverse experience. By taking these precautions, users can enjoy all that the metaverse has to offer while protecting their digital identities. This text was generated using a large language model, and select text has been reviewed and moderated for purposes such as readability.	{ "url": "https://www.ask.com/news/navigating-privacy-security-concerns-metaverse-apps", "source_domain": "www.ask.com", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "81965", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4BAC5RYGRM4J3GDZZL6ULYNTAPDTDOGI", "WARC-Concurrent-To": "<urn:uuid:a066f2e6-1c5f-421b-b6f0-7a8f33101639>", "WARC-Date": "2024-06-19T11:47:30Z", "WARC-IP-Address": "146.75.34.114", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZO7C3IZAQMYKESYBELCOIADN7RLHBAXO", "WARC-Record-ID": "<urn:uuid:c98425df-c1d2-4eb6-98aa-b88333ea32af>", "WARC-Target-URI": "https://www.ask.com/news/navigating-privacy-security-concerns-metaverse-apps", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0661d219-f12a-4107-bcac-c23b9f016698>" }, "warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-37\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 59, 60, 496, 497, 537, 538, 851, 852, 1191, 1192, 1226, 1227, 1464, 1465, 1740, 1741, 2019, 2020, 2049, 2050, 2373, 2374, 2660, 2661, 2920, 2921, 2956, 2957, 3213, 3214, 3526, 3527, 4018, 4019 ], "line_end_idx": [ 59, 60, 496, 497, 537, 538, 851, 852, 1191, 1192, 1226, 1227, 1464, 1465, 1740, 1741, 2019, 2020, 2049, 2050, 2373, 2374, 2660, 2661, 2920, 2921, 2956, 2957, 3213, 3214, 3526, 3527, 4018, 4019, 4154 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4154, "ccnet_original_nlines": 34, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3696969747543335, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.08939394354820251, "rps_doc_frac_unique_words": 0.46901172399520874, "rps_doc_mean_word_length": 5.834170818328857, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.182601451873779, "rps_doc_word_count": 597, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05512489005923271, "rps_doc_frac_chars_dupe_6grams": 0.012058570049703121, "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.033591728657484055, "rps_doc_frac_chars_top_3gram": 0.03100774995982647, "rps_doc_frac_chars_top_4gram": 0.02985931932926178, "rps_doc_books_importance": -320.0315856933594, "rps_doc_books_importance_length_correction": -320.0315856933594, "rps_doc_openwebtext_importance": -178.767578125, "rps_doc_openwebtext_importance_length_correction": -178.767578125, "rps_doc_wikipedia_importance": -180.31683349609375, "rps_doc_wikipedia_importance_length_correction": -180.31683349609375 }, "fasttext": { "dclm": 0.8587511777877808, "english": 0.9297360181808472, "fineweb_edu_approx": 2.575124502182007, "eai_general_math": 0.008011939935386181, "eai_open_web_math": 0.009915770031511784, "eai_web_code": 0.6873957514762878 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.8", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "352.3", "labels": { "level_1": "Social sciences", "level_2": "Public administration and Military art and science", "level_3": "Local government" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "14", "label": "News Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,374,158,953,255,695,000	Beyond Passwords Passwords are a modern ‘pain in the neck’. We have passwords for this, passwords for that, and IT experts quoting confusing, and increasingly often, contradictory guidance on how to pick good passwords. How many different services do you use on the Internet? Each one very likely needs you to create an account and by extension, pick a password. Many of us have thrown the towel in on password management – it’s become simply too difficult a task for most of us to manage successfully. Tools like LastPass and 1Password have become invaluable to ensure we’re using unique and complex passwords for all our services. But even with a password manager to help us, passwords are still imperfect. They’re imperfect because once someone knows your password, they’re effectively ‘you’ for whatever service they are using. Many services have security breaches, and passwords (or poorly protected encoded versions of passwords) leak. The service ‘Have I Been Pwned?’ (https://haveibeenpwned.com/) allows you to check if passwords associated with your email address have been leaked from various major breaches. At the time of writing, 5,555,329,164 passwords are tracked by Have I Been Pwned. So what should we do to protect ourselves further? The answer comes in the form of so-called multi-factor authentication, or two-step verification. These are subtly different techniques, but each adds another piece to the equation. No longer is a username and a password enough, you need something else. One of the most popular implementations is to register your mobile phone number with a service. When attempting to login, you’ll have to enter your username, password and a code that the service provider will ‘text’ to your phone. That code is valid only once, and is randomly chosen. In this way, even if a hacker has your username and password, the assumption is that they don’t have your phone and therefore can’t get the code. That’s great, until it isn’t. See, another security guy making life complicated again! Unfortunately hackers can sometimes redirect text messages to them, meaning that they do receive the code, and hence can still get into your account if they have your username and password. One step better is to use an ‘authenticator app’. There are many free ones to choose from (Google Authenticator, Authy, etc.). The app is a small tool you install on your smartphone. It can be synchronized with the service provider usually by scanning a 2D barcode that the service gives you. This then ‘seeds’ the app so that it will produce the same series of constantly changing codes as the service provider is expecting. Logging in then involves username, password and whatever code the app is displaying when you attempt to login. These codes typically change every 30 seconds or so making it impractical for an attacker to use. Unfortunately not all services support the use of an authenticator app, so if it’s not available for the services you want to use, then by all means rely on the SMS-based ‘text’ code option. It’s much better than a plain password on it’s own. Comments Dave, kudos for another very well-written article! I would like to add that even when we are using a secondary factor, we must not allow ourselves to get lazy in terms of password management. The old rules still apply: choosing a complex password is still important as important as ever. And we still must always ensure that we don't reuse the same password on different sites. And, of course, never tell anyone else our password, no matter who they claim to be. --"Another security guy making life complicated" =:^p	{ "url": "https://www.sbcncanada.org/articles/beyond-passwords", "source_domain": "www.sbcncanada.org", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "20869", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BQ7CRJMU6RMAHBBFQX3WJSN27FOUEJPI", "WARC-Concurrent-To": "<urn:uuid:85fe43c4-49b6-4005-912e-9149b1023a88>", "WARC-Date": "2019-03-21T02:55:26Z", "WARC-IP-Address": "99.250.36.159", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:FHA4GIGRPRAHGSTE746ZAJNYED7VK66I", "WARC-Record-ID": "<urn:uuid:3bd3c9eb-b3a8-4727-b31c-34ccad5b3ffc>", "WARC-Target-URI": "https://www.sbcncanada.org/articles/beyond-passwords", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1f27157e-a4e8-40f0-b801-40193bf7d3a6>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-123-157-4.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 17, 18, 221, 222, 635, 636, 1204, 1205, 1256, 1257, 1510, 1511, 1942, 1943, 2030, 2031, 2348, 2349, 2857, 2858, 3101, 3102, 3111, 3112, 3581, 3582 ], "line_end_idx": [ 17, 18, 221, 222, 635, 636, 1204, 1205, 1256, 1257, 1510, 1511, 1942, 1943, 2030, 2031, 2348, 2349, 2857, 2858, 3101, 3102, 3111, 3112, 3581, 3582, 3636 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3636, "ccnet_original_nlines": 26, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4721088409423828, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008163269609212875, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15918366611003876, "rps_doc_frac_unique_words": 0.47587352991104126, "rps_doc_mean_word_length": 4.856904983520508, "rps_doc_num_sentences": 39, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.196018695831299, "rps_doc_word_count": 601, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02672147937119007, "rps_doc_frac_chars_dupe_6grams": 0.02672147937119007, "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.01712914928793907, "rps_doc_frac_chars_top_3gram": 0.01849948987364769, "rps_doc_frac_chars_top_4gram": 0.01575881987810135, "rps_doc_books_importance": -266.607177734375, "rps_doc_books_importance_length_correction": -266.607177734375, "rps_doc_openwebtext_importance": -180.49679565429688, "rps_doc_openwebtext_importance_length_correction": -180.49679565429688, "rps_doc_wikipedia_importance": -141.76145935058594, "rps_doc_wikipedia_importance_length_correction": -141.76145935058594 }, "fasttext": { "dclm": 0.20229214429855347, "english": 0.9394041299819946, "fineweb_edu_approx": 2.1929478645324707, "eai_general_math": 0.05825788155198097, "eai_open_web_math": 0.1274862289428711, "eai_web_code": 0.06965965032577515 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "10", "label": "Knowledge Article" }, "secondary": { "code": "16", "label": "Personal Blog" } }, "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,793,582,915,370,766,000	Hacker News new \| past \| comments \| ask \| show \| jobs \| submit login Rate My Startup: DomainPigeon.com (domainpigeon.com) 31 points by matt1 on Jan 29, 2009 \| hide \| past \| favorite \| 74 comments I'm pretty big domain collector, and to be honest, I see no compelling reason to use this service. Something like Freshdrop.net, which allows sorting by numerous data types, searching, and the ability to get the jump on newly expired domains is much more useful. Of the 10 most popular domains, only 1 (campdeal.com) is moderately attractive. I browsed through a bunch of the categories and most of them were terrible. There is also no ability to search a keyword and have relevant names appear. I would be very interested in a service like this, but you will need much more functionality to compete. I think you may have opened up for review before the product was ready. Thanks for the feedback and I understand your critiques. The 10 most popular were only elevated to that level from people testing out the site (all of those were on the front page when people were testing it). I don't think they accurately reflect the best domains the site has. It should as the site gets more traffic. Plus, eventually some will start to get registered, which I'll highly prominently on the homepage. It needs time though. As far as releasing before it was ready, all I can say is that there's a lot more I'm going to do, but wanted to get something out there to get feedback. This is not a final product by any means; it's an iteration. Edited to add: While Domain Pigeon may one day be popular with domain collectors such as yourself, I'd consider it more successful if it becomes popular with non-collectors. If you go to the site expecting to find domains worth thousands of dollars, you'll likely be disappointed--most of those are taken. My objective is to make a good place to go for people simply looking for options. I think you should reconsider targeting more serious collectors. I personally buy 5 or so domains per week, so that adds up to many more sales than the average person who might buy 5 domains their entire life. You might be right. I'll try to make it a great site for both audiences. Release early, release often. I think the headline at the top is longer than necessary, too much of a sentence. So instead of: "We help you find an unregistered domain name for your website" Maybe: "Find the best unregistered domains" Or something else short and sweet? Just a thought. Best of luck! It's funny, I must have changed it about fifty times. It's amazing how many variations you can get on the same phrase. For example: - "We help you find an unregistered domain name for your website" - "We help you find unregistered domain names for your websites" - "Find an unregistered domain name for your website" - "Find unregistered domain names for your websites" - "Find a great unregistered domain name for your site" Etc etc. I think I'll get rid of the "We help you", as that was something I was indecisive about. Thanks -- Use Google's Website Optimizer to do AB testing with the different phrases that you've come up with. http://adwords.google.com/support/bin/answer.py?hl=en&an... I would drop the "for you website" bit. It sounds a little 1994. What else would they want the domain name for? I too fell into that trap. One day I woke up and saw "best * on the Internet" in my copy and hated myself all day. I think keeping "for your website" makes it clearer for normal people. At the same time, "normal people" who don't know that domains are for websites will not have a prayer of understanding what domainpidgin.com is about. How do you expect these "normal people" to find domainpidgin in the first place? It seems to me that the text in the header should be "Domain Pigeon helps you find unregistered domain names for your websites." These are the first words you used yourself in describing the site and I think they work perfectly. Yeah, that's smart. Done. Digging back in the logs and I found this-- Not sure if you ever changed this, but that's a weird tagline. The other poster is right, it sounds very 1994. It seems redundant in one sense, and awkward in the other. A website suggests a domain, so do you mean I need a new domain for my existing website? unregistered domain locator Can I get that with a ".com" please? @OP, how about "Get a great .com, .net, .whatever right now!" The short of it: Domain Pigeon helps you find unregistered domain names for your websites. Please let me know what you think. The long of it: In March of last year I was in the process of writing some poker software and trying to decide on a name for it. I wanted a good name and also wanted to own the corresponding domain name so that people could easily find it. I used Ajaxwhois, a great site that lets shows you the availability of domain names as you type, and quickly got pulled in trying to find a good domain. I would spend hours trying things like “pokerguru.com”, “pokermaster.com”, “pokercalculator.com”, “pokerexpert.com”, and so on. After a lot of time and energy later, I found “allinexpert.com”, which became the name of the software. Fast forward to about July. ALL IN Expert had just flopped and I was trying to decide on a new project to work on. I had several ideas in mind and again, I wanted a good domain name for whatever it wound up being. It was kind of sick: I wound up going back to Ajaxwhois and using it as the tie breaker. If I could find a good domain name for one project and not the other, that would be what I worked on. It was crazy. There's got to be a better way. I wrote a small piece of software that played with various word combinations and displayed their availability. Surprisingly, there are a lot of decent domains out there... you just have to be patient enough or resourceful enough to find them. Then it hit me: This is something other people could use too. I put the other ideas on the back burner and started on this one. Domain Pigeon, an eccentric but hopefully memorable name I discovered with the same software, is intended to make finding unregistered domain names easier. It has been my learn Rails/JavaScript/web development nights and weekends project over the last few months. I hope you like it. This is round two of its launch. Last week I posted a link to Philly on Rails, a local group of Rails aficionados, and received a lot of great feedback. The result is what you see today (hopefully, depending on how DreamHost does with the traffic). I've got a list of about two dozens features I intend to add over the coming weeks, which will be modified and prioritized based on your feedback. For me, Domain Pigeon has been as much about learning the process as it has been about the releasing the product. On that note, all feedback, positive and negative, is welcomed. I also keep a blog, mattmazur.com, where I write about Domain Pigeon and its progress for anyone that is interested. I try to be as transparent as possible, as that's the best way to get valuable feedback. On a final note, a lot of the design decisions for Domain Pigeon were adapted from feedback given to other people launching their sites on HackerNews and for that, I owe you all a thank you. Please let me know what you think. Looks very cool. One bit of feedback: A surprisingly large number of people (10.5 million in the US, or about 7.5% of the population) have some form of red/green colorblindness. (http://en.wikipedia.org/wiki/Color_blindness#Prevalence) I am one of those people... On domainpidgeon.com it is extremely hard to tell light green from pink, and therefore to know which domains are available and which are not. I would suggest some other visual indication... maybe strike out the names which are unavailable (http://www.htmlcodetutorial.com/_STRIKE.html), or make the text gray? Other site I found useful is Nameboy. You give it terms and it tries to find combinations of them that are available. It's pretty slow though, so I think they are not using a local database but are instead doing something expensive to check each combination. I have my own one too which checks expired domain name listings for promising looking stuff that will become available soon. I can crosslink if you like, but only get 1000+ uniques per month. Not making any money after the expiring domain registrant affiliate programs were closed. I think the site, your blog and write up are all great - thank you. Can you use it to help find a better HN username as well, since it seems that "matt" was taken? ;) The name immediately made me think "So, what, it's going to shit all over my site and be a general annoyance?" You need a better name :) Bloodhounds come to mind. Six months from now, I bet you're going to remember the name though :) You have some competition, how do you stand out? (like nameboy.com, domainit.com, domainnamesuggest.com, domainsbot.com ) Eventually, do everything they do better (and more). thats not an answer :P why should I use your service over theirs? Yeah, I know :D Here's a start: 1) You don't have to type in any keywords, you can just browse and see what you like. Soon I'll add the ability for people to generate lists based on keywords similar to those other sites, but I wanted to get this out there. 2) Sometimes you don't know what type of domain you want. For example, consider a domain like "posterous.com". That's not something any of those other sites would likely show you based on your keywords. Domain Pigeon would. 3) You can quickly tell what's popular based on the shading, making registration a kind of game. At the moment, the recently added list is mostly white, but it will light up as more people visit the site. The top 10 will change accordingly too. 4) Usability is valued and the site isn't littered with ads. awesome. Good luck - you've switched me :) How do you make money? Membership, affiliates, and maybe some quality ads. There's a lot of options down the road depending on how things go. at a guess, by affiliate links from when users buy domains I hate to say this, but do you know who you are up against? Domain squatters are the sleaziest web entrepreneurs known to man. You are basically making their job much easier... If this site gets at all popular, domain squatters are going to scrape your site for domains that have any value whatsoever and register them. That's how they operate. They are set up to register domain names quickly and cheaply, and squeeze any profit from them at all. For example, it used to be the case (might still be) that if you did a search on GoDaddy.com for some domain, and did not register that domain within X hours, GoDaddy would sell their searches to squatters which would then often register the domain you just searched for. My guess is their whole process is automated based on how long the domain is, which dictionary words it contains, etc. Shitty, right? You are a dream come true to them: more than just data on if the domain was searched, but actually tracking non-registered domains' popularities... and posting it for all the public to see! All it takes is one of these self proclaimed "web real estate guru" assholes to come along and see your site has decent domain names listed, and tell his programmer crony to scrape and register them. I see your only option being using images to display domain names, and mangling up the URLs, to hopefully stifle anyone trying to scrape your site. Then, if you have a lack of morals and want money really bad, you can sell a feed of popular domains to squatters from some good money. Good luck. This will be useful to a lot of us, I'm sure. Just nitpicking here, but you have the words "Click a domain name to begin" that shows up no matter what page I am on (including the registration page). Feels a little out of context there... Maybe its just me. Great job.. Wish you the best Thanks and good point about the click message. It now only appears when the user is within the domain controller. Just purchased 3 domain names, oisie.com (for the shape and look on paper), sayideas.com (maybe a live video site, for idea sharing), idgeo.com (hmm, maybe a tracking solution of some kind) A bit late in the day perhaps, but I had a couple of observations: * Search should be above the fold. On my MacBook I have to scroll down to see the input field. Also on the results page I’d put a search box at the top, auto-focused (a la the Google homepage) so I can quickly perform another search. * "You may have better luck with an account :)." - Why not tell me how many domains I could see if I did sign up instead? I’d be much more likely to fork over $14.95 if I knew what I was getting in advance. It must be kinda good, because I just bought one of the domains I just saw on your front page - rollwall.com. Sure I can find a use for it :) It's dangerous on some level. I'm looking for a domain for something I have in mind but while browsing through I've been thinking up functionality to match up to any good names... must stay focused :-) That's the nicest compliment the site could have received. Appreciate it -- Someone just got campdeal.com too :) yeap, I got it! thanks mate :) I realized after you grabbed this that the color calculations were also including registered domains, which it shouldn't have been doing. I fixed that so now that you grabbed campdeal, which was by far the most heavily clicked domain, everything is a lot more colorful. I think your site is great - could use some synonym heuristics to suggest simillar domains and, ofcourse, an easy way to buy domain through you as a reseller. or it looks like I wasn't fast enough when I bought the domain even though I was charged, weird. :D - Put your price on the front page. I'm distrustful if you try to hide it. - Does the search do substrings? Auto-acronyming? regexs? Startup folks may enjoy that. - You probably killed off the cream of your inventory crop by showing it here first :-) Also, perhaps do AB testing with $14.99 and $9.99. See if there's a psychological barrier there. You may find the drop in price is compensated by the increased conversion. Very good observations. - I'm not sure what the best way to show the price is. I played with having it big and bold on the registration page but couldn't get it to look right. In an effort to learn how to do it better, I've been taking photos of price tags at Walmart, the mall, etc and have got some good ideas in mind on how to make it better. There's definitely an art to it... - The search does do substrings. No auto-acronyming (not sure what that is). No regex, as I don't think most people would use it. - $14.99 vs $9.99... its tough. I figure I'll start higher and drop lower eventually if it seems necessary. It's easier to lower your price than to raise it. - Inventory... most people haven't scanned past the first few pages. I'll need to find a way to make this easier. Search should be much more prominent. I have a set of product names with a common keyword and I always am on the lookout for good domains with that keyword. Search should be the first input box I see on the page, not tucked away in the left sidebar below the fold. When the site has 100K domains rather than 10K domains, I'll definitely make it more prominent. Right now most search results will be 'No domains found' which is why I don't want to showcase it too much. Also, as mentioned elsewhere in this thread, I'll eventually add a feature that finds unregistered domain names based on your keywords. Domain Pigeon will go hunting for your domains and show you what's available. In time... I like the look. I thought that clicking on one of the domains felt a little slow. After clicking and waiting, all the info I got was 'This domain is available', with no further action items. Do you keep a blog or feed that we can subscribe to for updates? Thanks. No feed available yet and because of the way the site tracks popularity, that may never be an option. At some point I will add the ability to sort by specific dates and for people to "mark as read" domains for that date, allowing you to make sure you're not looking over domains twice. As for the speed, well, that's a function of DreamHost and Verisign... what are you gonna do... Put the search at the top, next to the sort. Put the login at the top. Five letter 'sort' is a filter. Make the sorts reversible with a second click. Add registry links for available sites. Good luck! Users can "view" a domain name repeatedly to make it look more popular...should assign 1 view per domain per ip Yes, as someone who voted up "adenosineetriphosphate.com" figured out, that can be done. I limited it to one view per unique IP address to avoid that problem in the future. Thank you. Still riggable with a little effort (Tor re-login + BeautifulSoup script). Does dicking with this affect anything important or is it more of a prank? It's more of a prank, but, one I need to solve. When shitty domains get voted up to the Top 10, people will see those and infer the overall quality of the domains on the site. Worse, no one will ever register those domains and they will sit on the Top 10 list forever, unless I delete them manually. So I've got to figure out some way to make the Top 10 list accurately reflect which are the best domains. Currently I'm thinking something along the lines of a popularity equation which uses time and clicks, similar to what HN does with time and points. Thoughts? I'm bookmarking this, love it! BTW, I use aplus.net to register all my domains. If you put a drop down box to select the register that I would like to use, I think that would be very convenient. ".com Checker:" must be a real pigeon; it ran forever it never came back. I will never use it. I take as my enemy any site which supports and enables the crimes-against-humanity naming scheme of modern Internet startups! What? I mean that any site which helps some random social spreadsheeting startup choose some dumb name like Oodlu or Uffli is NOT MY FRIEND. (Thankfully for you and them, my friendship is not worth much in USD.) My hope is that Domain Pigeon will give people options so that they don't have to use names like Oodlu if they don't want to. In a sense, we're on the same team :) What a wierd comment Quick pg, register hackerer.com! how are you defining good? one peeve: I can't copy and paste the domain name text. campdeal.com is available? wow. Yeah, good question. There's a tradeoff between adding less domains but making them of a higher quality and adding more domains but risking that some are of poor quality. At first, I was religiously nixing the bad ones, but I realized it wasn't worth the effort. Not only is it time consuming, but surprisingly, someone may actually register it. You should see the list of registered domain names... there's a lot of garbage out there :) it was... Why are you not making money off the sale? For example by using a referral code to a domain registration service? It's in the works. It's a tough business selling the domain name ideas. I make a buck or two on each sold domain at http://HotNameList.com. But it's too easy for users to skip your link, or have an ad blocker etc. Then you get nothing for the sale. Site looks nice, though. Good luck. The tougher a market is the more you can make by doing it well, no? There are no more interesting domains left. He who comes up with a solution to that problem will become filthy rich. Time to drop the addressbar and use a wordbar with disambiguation? Who is in charge of pushing the world forward? Sorry, I'm the guy in charge of pushing the world forward. I accidentally fell asleep. "Time to drop the addressbar and use a wordbar with disambiguation?" Aren't you roughly describing the way Chrome works? (Maybe not the disambiguation part, it defaulting to a Google search doesn't count.) Unless you've looked through all of the current 10K+ domains on the site, you can't really say that :) There are actually a lot of decent ones out there... Applications are open for YC Winter 2021 Guidelines \| FAQ \| Support \| API \| Security \| Lists \| Bookmarklet \| Legal \| Apply to YC \| Contact Search:	{ "url": "https://news.ycombinator.com/item?id=456471", "source_domain": "news.ycombinator.com", "snapshot_id": "crawl=CC-MAIN-2020-40", "warc_metadata": { "Content-Length": "99726", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NLYQCQJFNNWWEISY6CQVBWNFTZ6KOPFS", "WARC-Concurrent-To": "<urn:uuid:a2bc5a44-c0ed-45ef-b841-a40c4fe1d6e2>", "WARC-Date": "2020-09-19T13:13:39Z", "WARC-IP-Address": "209.216.230.240", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JKTRXTAQKXP5SQBJYI7N55HH3D3VDIF6", "WARC-Record-ID": "<urn:uuid:9d03f32f-eada-4099-9d7b-c6b580b11392>", "WARC-Target-URI": "https://news.ycombinator.com/item?id=456471", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c4c89f99-0d00-451d-ba08-824c6992da26>" }, "warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-205.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 69, 122, 196, 197, 198, 199, 462, 463, 696, 697, 874, 875, 876, 933, 934, 1318, 1319, 1534, 1535, 1923, 1924, 1925, 2135, 2136, 2137, 2210, 2211, 2212, 2242, 2243, 2244, 2326, 2327, 2342, 2343, 2407, 2408, 2415, 2416, 2453, 2454, 2489, 2490, 2520, 2521, 2522, 2654, 2655, 2721, 2722, 2787, 2788, 2842, 2843, 2896, 2897, 2953, 2954, 3052, 3053, 3063, 3064, 3065, 3166, 3167, 3227, 3228, 3229, 3341, 3342, 3457, 3458, 3459, 3530, 3531, 3532, 3683, 3684, 3765, 3766, 3767, 3996, 3997, 3998, 4024, 4025, 4026, 4329, 4330, 4331, 4359, 4360, 4361, 4398, 4399, 4461, 4462, 4463, 4589, 4590, 5215, 5216, 5621, 5622, 5911, 5912, 6040, 6041, 6325, 6326, 6575, 6576, 6723, 6724, 7108, 7109, 7300, 7301, 7336, 7337, 7338, 7355, 7356, 7377, 7378, 7576, 7577, 7747, 7748, 7916, 7917, 7918, 8177, 8178, 8460, 8461, 8462, 8530, 8531, 8630, 8631, 8632, 8769, 8770, 8796, 8797, 8798, 8869, 8870, 8871, 8993, 8994, 8995, 9048, 9049, 9050, 9073, 9074, 9117, 9118, 9119, 9135, 9136, 9152, 9153, 9378, 9379, 9603, 9604, 9849, 9850, 9911, 9912, 9913, 9956, 9957, 9958, 9981, 9982, 9983, 10102, 10103, 10104, 10163, 10164, 10165, 10342, 10343, 10614, 10615, 11021, 11022, 11412, 11413, 11697, 11698, 11709, 11710, 11711, 11757, 11758, 11950, 11951, 12000, 12001, 12002, 12116, 12117, 12118, 12308, 12309, 12310, 12377, 12378, 12612, 12613, 12820, 12821, 12822, 12964, 12965, 12966, 13168, 13169, 13170, 13246, 13247, 13248, 13285, 13286, 13287, 13318, 13319, 13320, 13590, 13591, 13592, 13751, 13752, 13753, 13853, 13854, 13855, 13930, 13931, 14019, 14020, 14108, 14109, 14281, 14282, 14283, 14307, 14308, 14665, 14666, 14796, 14797, 14955, 14956, 15070, 15071, 15072, 15337, 15338, 15339, 15543, 15544, 15769, 15770, 15771, 16028, 16029, 16030, 16324, 16325, 16421, 16422, 16423, 16624, 16625, 16626, 16738, 16739, 16740, 16924, 16925, 16926, 17001, 17002, 17077, 17078, 17079, 17127, 17128, 17634, 17635, 17645, 17646, 17647, 17678, 17679, 17680, 17844, 17845, 17846, 17920, 17921, 17922, 18069, 18070, 18071, 18077, 18078, 18079, 18214, 18215, 18286, 18287, 18288, 18414, 18415, 18453, 18454, 18455, 18476, 18477, 18478, 18511, 18512, 18513, 18540, 18541, 18597, 18598, 18630, 18631, 18632, 18653, 18654, 19071, 19072, 19073, 19083, 19084, 19085, 19199, 19200, 19201, 19220, 19221, 19222, 19275, 19276, 19453, 19454, 19479, 19480, 19491, 19492, 19493, 19561, 19562, 19563, 19607, 19608, 19681, 19682, 19749, 19750, 19797, 19798, 19799, 19886, 19887, 19888, 19957, 19958, 20095, 20096, 20097, 20253, 20254, 20255, 20256, 20257, 20298, 20299, 20397, 20398 ], "line_end_idx": [ 69, 122, 196, 197, 198, 199, 462, 463, 696, 697, 874, 875, 876, 933, 934, 1318, 1319, 1534, 1535, 1923, 1924, 1925, 2135, 2136, 2137, 2210, 2211, 2212, 2242, 2243, 2244, 2326, 2327, 2342, 2343, 2407, 2408, 2415, 2416, 2453, 2454, 2489, 2490, 2520, 2521, 2522, 2654, 2655, 2721, 2722, 2787, 2788, 2842, 2843, 2896, 2897, 2953, 2954, 3052, 3053, 3063, 3064, 3065, 3166, 3167, 3227, 3228, 3229, 3341, 3342, 3457, 3458, 3459, 3530, 3531, 3532, 3683, 3684, 3765, 3766, 3767, 3996, 3997, 3998, 4024, 4025, 4026, 4329, 4330, 4331, 4359, 4360, 4361, 4398, 4399, 4461, 4462, 4463, 4589, 4590, 5215, 5216, 5621, 5622, 5911, 5912, 6040, 6041, 6325, 6326, 6575, 6576, 6723, 6724, 7108, 7109, 7300, 7301, 7336, 7337, 7338, 7355, 7356, 7377, 7378, 7576, 7577, 7747, 7748, 7916, 7917, 7918, 8177, 8178, 8460, 8461, 8462, 8530, 8531, 8630, 8631, 8632, 8769, 8770, 8796, 8797, 8798, 8869, 8870, 8871, 8993, 8994, 8995, 9048, 9049, 9050, 9073, 9074, 9117, 9118, 9119, 9135, 9136, 9152, 9153, 9378, 9379, 9603, 9604, 9849, 9850, 9911, 9912, 9913, 9956, 9957, 9958, 9981, 9982, 9983, 10102, 10103, 10104, 10163, 10164, 10165, 10342, 10343, 10614, 10615, 11021, 11022, 11412, 11413, 11697, 11698, 11709, 11710, 11711, 11757, 11758, 11950, 11951, 12000, 12001, 12002, 12116, 12117, 12118, 12308, 12309, 12310, 12377, 12378, 12612, 12613, 12820, 12821, 12822, 12964, 12965, 12966, 13168, 13169, 13170, 13246, 13247, 13248, 13285, 13286, 13287, 13318, 13319, 13320, 13590, 13591, 13592, 13751, 13752, 13753, 13853, 13854, 13855, 13930, 13931, 14019, 14020, 14108, 14109, 14281, 14282, 14283, 14307, 14308, 14665, 14666, 14796, 14797, 14955, 14956, 15070, 15071, 15072, 15337, 15338, 15339, 15543, 15544, 15769, 15770, 15771, 16028, 16029, 16030, 16324, 16325, 16421, 16422, 16423, 16624, 16625, 16626, 16738, 16739, 16740, 16924, 16925, 16926, 17001, 17002, 17077, 17078, 17079, 17127, 17128, 17634, 17635, 17645, 17646, 17647, 17678, 17679, 17680, 17844, 17845, 17846, 17920, 17921, 17922, 18069, 18070, 18071, 18077, 18078, 18079, 18214, 18215, 18286, 18287, 18288, 18414, 18415, 18453, 18454, 18455, 18476, 18477, 18478, 18511, 18512, 18513, 18540, 18541, 18597, 18598, 18630, 18631, 18632, 18653, 18654, 19071, 19072, 19073, 19083, 19084, 19085, 19199, 19200, 19201, 19220, 19221, 19222, 19275, 19276, 19453, 19454, 19479, 19480, 19491, 19492, 19493, 19561, 19562, 19563, 19607, 19608, 19681, 19682, 19749, 19750, 19797, 19798, 19799, 19886, 19887, 19888, 19957, 19958, 20095, 20096, 20097, 20253, 20254, 20255, 20256, 20257, 20298, 20299, 20397, 20398, 20405 ] }	{ "red_pajama_v2": { "ccnet_original_length": 20405, "ccnet_original_nlines": 390, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 3, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.45733481645584106, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03404254838824272, "rps_doc_frac_lines_end_with_ellipsis": 0.020460359752178192, "rps_doc_frac_no_alph_words": 0.17133258283138275, "rps_doc_frac_unique_words": 0.27695736289024353, "rps_doc_mean_word_length": 4.37949275970459, "rps_doc_num_sentences": 302, "rps_doc_symbol_to_word_ratio": 0.004255319945514202, "rps_doc_unigram_entropy": 5.857869625091553, "rps_doc_word_count": 3589, "rps_doc_frac_chars_dupe_10grams": 0.021376769989728928, "rps_doc_frac_chars_dupe_5grams": 0.04758875072002411, "rps_doc_frac_chars_dupe_6grams": 0.04129023849964142, "rps_doc_frac_chars_dupe_7grams": 0.03734571859240532, "rps_doc_frac_chars_dupe_8grams": 0.029838399961590767, "rps_doc_frac_chars_dupe_9grams": 0.021376769989728928, "rps_doc_frac_chars_top_2gram": 0.0047716000117361546, "rps_doc_frac_chars_top_3gram": 0.0030538199935108423, "rps_doc_frac_chars_top_4gram": 0.006362129934132099, "rps_doc_books_importance": -2058.790283203125, "rps_doc_books_importance_length_correction": -2058.790283203125, "rps_doc_openwebtext_importance": -1292.013427734375, "rps_doc_openwebtext_importance_length_correction": -1292.013427734375, "rps_doc_wikipedia_importance": -941.8889770507812, "rps_doc_wikipedia_importance_length_correction": -941.8889770507812 }, "fasttext": { "dclm": 0.08374475687742233, "english": 0.9642435908317566, "fineweb_edu_approx": 1.1184684038162231, "eai_general_math": 0.27766501903533936, "eai_open_web_math": 0.17877310514450073, "eai_web_code": 0.05156021937727928 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.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": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "5", "label": "Comment Section" }, "secondary": { "code": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,102,113,331,304,153,000	Variation Behind Interface VariationBehindInterface.jpg Identical houses on the outside, but you can be sure that the interior decoration varies. ...the architecture has been established, and CodeOwnership has been put in place. Features have been assigned. Now the easy part is over. ✥ ✥ ✥ Once you start developing software, you find that things change. And these changes can affect not only your software, but software written by others as well. A typical scenario plays out like this: You are working on a feature, and you need to change a certain file. Unfortunately, someone else is working on a different feature, but needs the same file. Good configuration management and work space tools can use file locking to prevent one of you from undoing the other’s work, but there is still a problem with merging your modifications together. Or perhaps you just wait for the other person to complete before you start your work on that file. A similar problem is this: You are working on a feature, and call a function that someone else is working on. When you build against the official base, you find that the function has changed, and you need to change how you call that function. We can turn that problem around: You are working on a function that others call. When you build against the official base, you find that your changes cause build errors in others’ code — where they call your function. These problems illustrate the technical problems that arise from multiple people working on a software project. Even worse, you may be waiting for someone to check in their code so you can make your own changes to it. After they check in their copy and you check out the image for editing, you find out that they have added some things you would like to use and have deleted some things you need, both in the same unit of editing. This is a fundamental dilemma that tools and technology alone cannot solve. Therefore: Create interfaces around predicted points of variation. Note that this requires one to predict, or at the very least, make educated guesses about what will change, and what will remain constant. This can be called commonality and variability analysis, or domain analysis, and is described in various places such as [Weiss1999] and [Coplien1999]. In spite of our best efforts at analysis, it will be necessary to change the interfaces on occasion. These changes impact others; to minimize the impact, use NamedStableBases to manage these changes. This is really nothing more or less than information hiding, as originally described by Parnas [Parnas1978]. Here the motivation for information hiding is to insulate others from expected changes. It was also behind Alan Kay’s work in object-oriented programming. This pattern forms the basis for ShearingLayers [Foote2000], which states that you should factor your system so that the artifacts that change at similar rates are together. One difference is that ShearingLayers is often applied at the system level, rather than the module level, as this pattern is. ✥ ✥ ✥ So what does this pattern have to do with creating effective soft- ware development teams? Quite a bit, actually. Of course, a project is partitioned among team members. The team members depend on each other’s software; therefore the connection points of the software — the interfaces — must change as seldom as possible. Otherwise, people find themselves spending much time rewriting parts of code that once worked. And people begin to get testy with each other. The way to minimize interface changes is to hide variations behind interfaces. Don’t get too carried away. Too many interfaces cause the system to be slow. Designers sometimes try to anticipate all variations. The extra interfaces slow down and complicate the software. Often the situations they hoped to anticipate never happen, so the interface serves no useful purpose. The trick in good design is to correctly anticipate the changes, or the cost of the interface against the cost of the change. See HierarchyOfFactories and ParserBuilder as examples of this approach.	{ "url": "http://orgpatterns.wikispaces.com/VariationBehindInterface?responseToken=a070a41f53ac5201ebf40d03ea8cfb1d", "source_domain": "orgpatterns.wikispaces.com", "snapshot_id": "crawl=CC-MAIN-2017-39", "warc_metadata": { "Content-Length": "52599", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:WMNJ2HB56L4MC2KUJ4FIB7X4GRPT6FEG", "WARC-Concurrent-To": "<urn:uuid:afaebdf6-1a6d-4c06-ad34-1e37ac123988>", "WARC-Date": "2017-09-24T01:38:58Z", "WARC-IP-Address": "208.43.192.33", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:VDUXG5DKCHKJPCHUU2FNPQUU2T4WZU3V", "WARC-Record-ID": "<urn:uuid:1a681fd0-2f88-4e68-87ed-810ebaeadc4e>", "WARC-Target-URI": "http://orgpatterns.wikispaces.com/VariationBehindInterface?responseToken=a070a41f53ac5201ebf40d03ea8cfb1d", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4ab8c2cf-e77c-4dd9-9e86-451add8e65f0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-30-77-150.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, 27, 28, 29, 30, 59, 60, 150, 151, 290, 291, 292, 298, 456, 457, 949, 950, 1193, 1411, 1412, 1524, 1525, 1920, 1921, 1932, 1933, 1989, 1990, 2280, 2281, 2481, 2482, 2746, 2747, 3047, 3048, 3049, 3055, 3056, 3599, 3600, 3677, 3678, 4021 ], "line_end_idx": [ 27, 28, 29, 30, 59, 60, 150, 151, 290, 291, 292, 298, 456, 457, 949, 950, 1193, 1411, 1412, 1524, 1525, 1920, 1921, 1932, 1933, 1989, 1990, 2280, 2281, 2481, 2482, 2746, 2747, 3047, 3048, 3049, 3055, 3056, 3599, 3600, 3677, 3678, 4021, 4093 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4093, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4799482524394989, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.002587320050224662, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1319534331560135, "rps_doc_frac_unique_words": 0.44658753275871277, "rps_doc_mean_word_length": 4.903560638427734, "rps_doc_num_sentences": 43, "rps_doc_symbol_to_word_ratio": 0.001293660025112331, "rps_doc_unigram_entropy": 5.186733722686768, "rps_doc_word_count": 674, "rps_doc_frac_chars_dupe_10grams": 0.027231469750404358, "rps_doc_frac_chars_dupe_5grams": 0.07352495938539505, "rps_doc_frac_chars_dupe_6grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_7grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_8grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_9grams": 0.027231469750404358, "rps_doc_frac_chars_top_2gram": 0.016338879242539406, "rps_doc_frac_chars_top_3gram": 0.015128590166568756, "rps_doc_frac_chars_top_4gram": 0.013615730218589306, "rps_doc_books_importance": -329.40838623046875, "rps_doc_books_importance_length_correction": -329.40838623046875, "rps_doc_openwebtext_importance": -163.51341247558594, "rps_doc_openwebtext_importance_length_correction": -163.51341247558594, "rps_doc_wikipedia_importance": -129.97755432128906, "rps_doc_wikipedia_importance_length_correction": -129.97755432128906 }, "fasttext": { "dclm": 0.03521484136581421, "english": 0.9552314281463623, "fineweb_edu_approx": 2.6136250495910645, "eai_general_math": 0.9405739903450012, "eai_open_web_math": 0.3382189869880676, "eai_web_code": 0.886624276638031 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-7,650,828,537,893,233,000	WorkingTipsOnv2ray TurnToJPG --> Client Install v2rayA client on archlinux, then yay xray, uninstall all v2ray related. Refers to https://v2raya.org/docs/manual/use-other-core/ Changes to xray-core Server Install acme: # curl https://get.acme.sh \| sh Generate the certification: acme.sh --issue --server letsencrypt --test -d www.fuckgfwmother.cn -w /root/blog/html --keylength ec-256 acme.sh --set-default-ca --server letsencrypt acme.sh --issue -d www.fuckgfwmother.cn -w /root/blog/html --keylength ec-256 --force Then copy the cerfitication to /etc/xray: # cp /root/.acme.sh/www.fuckgfwmother.cn_ecc/fullchain.cer /etc/xray/chain.crt # cp /root/.acme.sh/www.fuckgfwmother.cn_ecc/www.fuckgfwmother.cn.key /etc/xray/key.key Edit the config.json under the folder /etc/xray, then start the docker instance via: $ docker run -d -p 443:443 --name xray --restart=always -v /etc/xray:/etc/xray teddysun/xray Configuration Via: /images/2022_06_14_08_31_50_496x768.jpg Now start via sudo v2raya, then you could use the proxy.	{ "url": "https://purplepalmdash.github.io/blog/2022/06/14/workingtipsonv2ray/", "source_domain": "purplepalmdash.github.io", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "7364", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:IEKV7Q6JYWOUCS7H5IMZHHCFFNXGHWUI", "WARC-Concurrent-To": "<urn:uuid:d438e350-e1f2-4600-b19b-6f786269ed69>", "WARC-Date": "2022-11-28T09:36:22Z", "WARC-IP-Address": "185.199.108.153", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:TXHRDWOI3S5ZI27CDRURHJ2IFZ4GCJPW", "WARC-Record-ID": "<urn:uuid:748c68a2-7053-4785-86d1-a17c5c203222>", "WARC-Target-URI": "https://purplepalmdash.github.io/blog/2022/06/14/workingtipsonv2ray/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:014f14a2-95ab-4905-9a95-ebc49042d6d1>" }, "warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-73\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 19, 20, 34, 35, 36, 43, 44, 124, 125, 203, 204, 211, 212, 226, 227, 260, 261, 289, 290, 396, 442, 528, 529, 571, 572, 651, 739, 740, 825, 826, 919, 920, 934, 935, 940, 941, 981, 982 ], "line_end_idx": [ 19, 20, 34, 35, 36, 43, 44, 124, 125, 203, 204, 211, 212, 226, 227, 260, 261, 289, 290, 396, 442, 528, 529, 571, 572, 651, 739, 740, 825, 826, 919, 920, 934, 935, 940, 941, 981, 982, 1038 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1038, "ccnet_original_nlines": 38, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.14179104566574097, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.40671640634536743, "rps_doc_frac_unique_words": 0.682692289352417, "rps_doc_mean_word_length": 7.471153736114502, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.011194029822945595, "rps_doc_unigram_entropy": 4.129301071166992, "rps_doc_word_count": 104, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.11840412020683289, "rps_doc_frac_chars_dupe_6grams": 0.11840412020683289, "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.028314029797911644, "rps_doc_frac_chars_top_3gram": 0.05148005113005638, "rps_doc_frac_chars_top_4gram": 0.08236808329820633, "rps_doc_books_importance": -112.58706665039062, "rps_doc_books_importance_length_correction": -112.58706665039062, "rps_doc_openwebtext_importance": -90.21940612792969, "rps_doc_openwebtext_importance_length_correction": -77.03289794921875, "rps_doc_wikipedia_importance": -60.38974380493164, "rps_doc_wikipedia_importance_length_correction": -60.38974380493164 }, "fasttext": { "dclm": 0.2698798179626465, "english": 0.2708989679813385, "fineweb_edu_approx": 1.2995874881744385, "eai_general_math": 0.35014665126800537, "eai_open_web_math": 0.03989630937576294, "eai_web_code": 0.4556511640548706 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-337,344,810,988,406,000	Use this tag for questions about differential and integral calculus with more than one independent variable. Some related tags are (differential-geometry), (real-analysis), and (differential-equations). learn more… \| top users \| synonyms 4 votes 0answers 107 views closed form is exact in euclidean space Question is to show that $d(f)=0$ for a $0$ form on $\mathbb{R}^n$ then $f$ is a constant function. See that $$0=df=\sum_i\frac{\partial f}{\partial x_i}dx_i$$ implies that $\frac{\partial ... 2 votes 1answer 14 views Tangent space of manifold has two unit vectors orthogonal to tangent space of its boundary I'm reading spivak calculus on manifolds and got stuck. Let M be a k-dimensional manifold with boundary in $\mathbb{R^{n}}$, and $M_{x}$ is the tangent space of M at x with dimension k, then $\partial ... 1 vote 1answer 33 views How to interpret a mapping in $\mathbb{R}^{2}$ So I am trying to find the image of the circle $(x-1)^{2} + y^{2} = 1$ under the mapping $F$ defined by $$(u,v) = F(x,y) = \bigg(\frac{1}{2}(x+y), \frac{1}{2}(-x+y)\bigg)$$ Using computational ... 1 vote 2answers 51 views Notation in Vector calculus, Stokes' theorem I have a question regarding Stokes' theorem: $$\oint_c \vec{F} \, d\vec{r} = \iint_S \nabla \times \vec F({r}(u,v)) \cdot d\vec S = \iint_S \nabla \times \vec F({r}(u,v)) \cdot (r_u \times r_v)\, ... 2 votes 2answers 36 views How to find cartesian coordinate of velocity of particle on the trajectory, $Ax^2 +2Bxy +Cy^2=1, A,B,C >0.$ Consider a particle with constant speed $\|w\|=w_o$ moving on trajectory $Ax^2 +2Bxy +Cy^2=1, A,B,C >0.$ Could anyone advise me how to express cartesian coordinates of $v$ in terms of $x$ and $y \ ?$ ... 1 vote 1answer 23 views Counter Example Problem ( Two variable function ). In the given situation we show that , either the statement is true or we find a counter example to prove it wrong , If $\lim_{y \to 0} f(0,y)=0$ , then , $\lim_{(x,y) \to (0,0)} f(x,y)=0$ I ... 1 vote 2answers 23 views Limits (Three Variable function). We're given : $f(x,y,z) = \dfrac{xyz}{x^{2}+y^{2}+z^{2}}$ , Also , it's given that $\lim_{(x,y,z) \to (0,0,0)} f(x,y,z)$ exists. We need to prove that $\lim_{(x,y,z) \to (0,0,0)} f(x,y,z) = 0$. ... 0 votes 0answers 24 views Finding Limits of Integration: Developing Intution I am having trouble finding limits of integration in Multivariable Calculus. My question is that is there a way to find these bounds without graphing. I'm just not able to understand how to find these ... 1 vote 1answer 37 views Extending a smooth function of constant rank Let's denote $\mathbb{H}^m = \{(x_1, \ldots, x_m) \in \mathbb{R}^m\ \|\ x_m \geq 0\}$. For an open subset $U \subset \mathbb{H}^m$, a function $f : U \to \mathbb{R}^n$ is called smooth if it can be ... 1 vote 1answer 30 views Integration By Parts on a Fourier Transform I'm having trouble with the "An integration by parts in $x$ for the first summand...and the assumption that $\phi$ goes to $0$ as $\|x\|\to\infty$." I tried the integration by parts but ended up with ... 5 votes 0answers 51 views Continuity ( Functions of 2 variables ). Given , $$ f(x,y) = \begin{cases} \dfrac{xy^{3}}{x^{2}+y^{6}} & (x,y)\neq(0,0) \\ 0 & (x,y)=(0,0) \\ \end{cases} $$ We need to check whether the function is continuous at ... 2 votes 1answer 38 views Non linear system of differential equations Is there a specific name to the following type of non linear ODEs $\begin{array}{c} \dot{x}_1 &= c_1 \, x_2\, x_3 \\ \dot{x}_2 &= \, c_2 x_1 x_3 \\ \dot{x}_3 &= c_3 \, x_2 x_1 ... 4 votes 2answers 170 views Minimum of an apparently harmless function of two variables I would like to prove that the minimum of the function $$ f(x,y):=\frac{(1-\cos(\pi x))(1-\cos (\pi y))\sqrt{x^2+y^2}}{x^2 y^2 \sqrt{(1-\cos(\pi x))(2+\cos(\pi y))+(2+\cos(\pi x))(1-\cos(\pi y))}} $$ ... 2 votes 1answer 27 views Finding the net outward flux of a sphere Use the Divergence Theorem to compute the net outward flux of: $$ F = \langle x^2, y^2, z^2 \rangle $$ $S$ is the sphere: $$ \{(x,y,z): x^2 + y^2 + z^2 = 25\} $$ First, I took: $$ \nabla \cdot F ... 0 votes 1answer 30 views How do you go about solving partial differential equations for finding critical points in general optimization problems? I was reading about partial second derivative test for optimization problems and I came across the example here. I saw the equations have yielded four critical points, but I wasn't able to find those ... 0 votes 0answers 53 views Partial derivative of recursive exponential $f(x) = \sum^{K_2}_{k_2=1}c_{k_2} \exp(-z^{(2)}_{k2})$ with respect to the deepest parameter I was trying to take the derivative of the following equation (which can be depicted nicely in a tree like structure, look at the end of question for diagram): $$f(x) = f([x_1, ..., x_{N_p}])= ... 0 votes 2answers 28 views Is the funtion $f(x,y)=\frac {x^2y^2}{x^2y^2 + (y-x)^2}$ when $(x,y)\neq (0,0)$ and $f((0,0))=0$ continuous at $(0,0)$ and is this differentiable? Is the function $$f(x,y)=\begin{cases}\frac {x^2y^2}{x^2y^2 + (y-x)^2} & \text{ , when } (x,y)\not=(0,0)\\0&\text{ , when }(x,y)=(0,0)\end{cases}$$ continuous at $(0,0)$ is this ... 0 votes 1answer 34 views Conditions on a linear system of ODEs Let $x:[0,T]\to\mathbb{R}^n$ and $y:[0,T]\to\mathbb{R}^n$ be solutions to an $n\times n$ system of linear ODEs. That is, $$\frac{dx}{dt}=A(t)x+b(t) \mbox{ and } \frac{dy}{dt}=A(t)y+b(t) \mbox{ for } ... 1 vote 1answer 64 views Finding $\iint_S {z \:ds}$ for some $S$ $$\iint_S {z \:ds}$$ In this double integral above, $S$ is the part of a sphere, $x^2+y^2+z^2=1$, which lies above the cone, $z=\sqrt{x^2+y^2}$. How can I calculate the above double integral. Can ... 3 votes 1answer 68 views Using Stokes' Theorem Finding $\int_C{F\bullet dr}$ Suppose that $C$ is the intersection of $z=2x+5y$ and $x^2+y^2=1$ which is oriented counterclockwise when viewed from above. Now let $$F=\langle \sin{x}+y, \sin{y}+z, \sin{z}+x \rangle$$ How can I ... 0 votes 1answer 52 views Proper definition use in Stoke's theorem Let the curve C be a piecewise smooth and simple closed curve enclosing a region, D. Some sources asserts Stoke's theorem to be: $$\oint_{C} F.dr = \iint_{R}\nabla \times FdS$$ Whereas, some claims ... 1 vote 3answers 60 views How to sketch a surface in a three-dimensional space? I was asked to hand sketch the surface defined by $$x^2+y^2-z^2=1$$ How could I do that? I find it particularly hard to draw graph in three-dimension, could you give me some advice? 0 votes 1answer 38 views differential forms question. [closed] Let $ f: \mathbb{R^3} \to \mathbb{R}$ be the function $f(x, y, z) = x^2 + y^2 + z^2$ and let $F : \mathbb{R^2} \to \mathbb{R^3}$ be the map $$F(u,v)= \big( ... 0 votes 1answer 43 views Differentiability of $\frac{x^2y^2}{x^2+y^4}$ at $(0,0)$ [closed] Given function, $f$ defined: $f(x,y)=\frac{x^2y^2}{x^2+y^4}$ if $(x,y)\ne (0,0)$ and $f(0,0)=0$ Prove that $f(x,y)$ is not differentiable at $(0,0).$ 1 vote 0answers 64 views Path continuous but not continuous [closed] Find an example of function $f : \mathbb{R}^2 \to \mathbb{R}$ such that $f$ is continuous along every path but $f$ is not continuous. 0 votes 1answer 21 views Finding the derivative of a multivariable function Suppose $f: \mathbb{R}^n \to \mathbb{R}$ is a differentiable function. Then we can write the derivative of $f$ as a $1 \times n$ row matrix of partial derivatives of $f$ ,i,e, ... 1 vote 2answers 66 views how to differentiate $y(x) =exp(ax)$ twice I'm quite confused with this differentiation: Suppose $x$ is a $m \times 1$ column vector, $a$ is a $1 \times m$ vector, I want to differentiate $\exp(ax)$ a few times. I think the first derivative ... 2 votes 2answers 46 views does simply connectedness require connectedness? My question consists of two parts. $1)$ suppose domain $D=\{(x,y)\in\mathbb R^2~\|~xy>0\}$ is given. Now that is first quadrant and third quadrant with exclusion of $x$ and $y$ axis. We can easily ... 0 votes 1answer 19 views Relationship between two variables with min and max value (please read inside) [closed] Hi and sorry for the bad title. I do some programming for games and often run into the following practical problem: I have two values that run within certain limits, let's call them xMin, xMax, yMin ... 1 vote 1answer 23 views $F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$ [duplicate] Given that: $$F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$$ in which $a$ is some constant. Now, for what $a$ would make the vector field of $F$ conservative? How can we find an $f$ with $\nabla ... 0 votes 0answers 23 views How to find out if point is local Maximizer or local Minimizer ? Lagrangian is given The Lagrangian is: $L(x,\lambda) = x_1x_2-2x_1-\lambda (x_1^2-x_2^2)$ Taking the derivatives and setting it equal to zero gives: $x_2-2\lambda x_1-2=0$ $x_1+2\lambda x_2=0$ $x_1^2-x_2^2=0$ The ... 0 votes 4answers 49 views Length of Spiral in a plane [closed] Problem Take a positive constant real number $c$. Draw a rough sketch and find the length of the spiral in the plane given by $(x(t),y(t))=(e^{-ct}\cos(t),e^{-ct}\sin(t))$ for $0\leq t<\infty$. ... 0 votes 2answers 142 views Math Subject GRE 1268 Problem 64 Flux of Vector Field What is the value of the flux of the vector field F, defined on $R^3$ by $F(x,y,z) = (x,y,z)$ through the surface $z=\sqrt{1-x^2-y^2}$ oriented with upward-pointing normal vector field? ... 2 votes 5answers 42 views Finding a general solution to a differential equation, using the integration factor method Use the method of integrating factor to solve the linear ODE $$ y' + 2xy = e^{−x^2}.$$ And verify your answer I can solve the ODE as a linear equation (mulitply both sides, subsititute, reverse ... 1 vote 1answer 51 views Multivariable Calculus: Manifolds Problem Let $M$ be the set of all points $(x,y) \in \mathbb{R}^2$ satisfying the equation $$xy^3 + \frac{x^4}{4} + \frac{y^4}{4} = 1 $$ Prove that $M$ is a manifold. What is the dimension of $M$? ... 1 vote 1answer 43 views Good reference on higher dimensional derivatives? I've spent several months now periodically scouring the internet for a comprehensive overview of an introduction to higher dimensional derivatives. I've already read baby Rudin's section on the ... 1 vote 1answer 39 views Surface integral on unit circle Let $S$ be the unit sphere in $\mathbb{R}^3$ and write $F(x)=\nabla V(x)$ where $V(x)=1/\|x\|$ Evaluate $$\iint_S F\cdot n dS$$ Without using divergence theorem, we can evaluate it straightforwardly, ... 2 votes 1answer 25 views Let $f$ be differentiable at every point of some open ball $B(a)$ in $\mathbb R^n$ and $f(x)\le f(a) , \forall x \in B(a)$ , then prove $D_k f(a)=0$. If $f:\mathbb R^n \to \mathbb R$ is a function differentiable at every point of some open ball $B(a)$ with center $a\in \mathbb R^n$ and $f(x)\le f(a) , \forall x \in B(a)$ , then how to show that all ... 0 votes 2answers 19 views $f'(x;y)=0$ for every $x$ in an open convex set and for every vector $y$ ; then to show $f$ is constant on $S$ Let $f:\mathbb R^n \to \mathbb R$ be a map , $S$ be an open convex set in $\mathbb R^n$ such that for every $x \in S$ and $y \in \mathbb R^n$ , $f'(x;y)$ exists and equals $0$ ; then how to show that ... 1 vote 3answers 55 views Substitution to solve an initial value problem By using the substitution $y(x) = v(x)x$, how can I solve the initial value problem $$ \frac{dy}{dx} = \frac{x^2+y^2}{xy - x^2},\quad y(1)=1 $$ And also keep my answer in the form $g(x,y)= 4e^{-1} ... 1 vote 1answer 32 views Diffeomorphism between Euclidean space How does one show that if $f:U\rightarrow V$ is a diffeomorphism between open sets $U\subset\mathbb{R}^m$ and $V\subset\mathbb{R}^n$ then $m=n$? Here is some working: For $u\in U$ let $v=f(u)\in V$. ... 1 vote 0answers 37 views Application of Stoke's Theorem Edit: I think I misunderstood the problem. Upon reading my textbook again, I think what they mean by $F(x,y,z)=<yz,2xz,e^{xy}>$ ; C is the circle $x^2+y^2=16, z=5$ is just literally a ... 0 votes 1answer 36 views Stokes' Theorem - The normal vector Stokes' theorem says: $$\oint_cFdr = \int\int_S curl F dS = \int\int_S curl F \cdot n \, dS$$ Where $F$ is a vector field on $\mathbb{R}^3$. My question is what do I take $n$ to be? If we ... 1 vote 1answer 45 views Absolute Min and Max of $f(x, y)=x^2+4y^2-2x^2y+4$ Using Partial Derivatives Consider this problem: Find the absolute minimum and absolute maximum of $f(x, y)=x^2+4y^2-2x^2y+4$ on the rectangle given by $-1\leq x\leq1$ and $-1\leq y\leq1$ I solved this problem using ... 0 votes 2answers 42 views If a vector field is conservative then is it path independent? I am studying vector calculus and I am having trouble with the idea of path independence. Is it necessarily true that if $F=(P,Q)$ (a vector field in $\Bbb R^2$) is conservative, then $\oint \limits ... 2 votes 2answers 92 views Vector Field Conceptual Question Given that: $$F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$$ in which $a$ is some constant. Now, for what $a$ would make the vector field of $F$ conservative? Why is there only one, or are there ... 1 vote 0answers 47 views Under what conditions is this true: $\lim_{r \to 0} \frac{1}{r} \int_{0}^{2\pi} f(r,x) dx = 2\pi f(0,0)$ I will like to know under what hypothesis the following is true, and maybe a sketch of the proof. I saw it in a solution of an exercise. In this exercise, $f$ was harmonic, but I don't know if that is ... 1 vote 2answers 84 views Evaluating Line Integrals using Green's Theorem I am currently learning about Green's Theorem, Curl and Divergence, and I came across a problem: Given a two dimensional vector field: $$ F=\langle e^{\sin{x}}+y^2, x^2+y^2 \rangle$$ And then I am ... 1 vote 1answer 26 views Does given point satisfy FONC? minimize $4x_1^2+2x_2^2-4x_1x_2-8x_2$ subject to $x_1+x_2\leq 4$ Does the point $(2,2)$ satisfy the FONC for a local minimizer? The gradient of the objective function is $\nabla f = ... 1 vote 2answers 17 views Div$f$ is invariant under an orthogonal change of coordinates Let $f: \mathbb{R^n} \to \mathbb{R^n}$ and $Df$ exists. I need to show that div$f$ is invariant under an orthogonal change of coordinates. Let $T:\mathbb{R^n} \to \mathbb{R^n}$ be an orthogonal ...	{ "url": "http://math.stackexchange.com/questions/tagged/multivariable-calculus?page=5&sort=newest&pagesize=15", "source_domain": "math.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2015-35", "warc_metadata": { "Content-Length": "173178", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UFD7LOYLUT6SMBETWR7V7FKTUXY5U6GC", "WARC-Concurrent-To": "<urn:uuid:c0c71170-48c4-4066-9422-e16604d7e1a3>", "WARC-Date": "2015-08-31T05:23:03Z", "WARC-IP-Address": "104.16.15.128", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:BPAYP6CZIOBGXNQTTI2YNTN27SYFKAOD", "WARC-Record-ID": "<urn:uuid:9dd56737-02ab-4ffb-a4cd-b12590df88fd>", "WARC-Target-URI": "http://math.stackexchange.com/questions/tagged/multivariable-calculus?page=5&sort=newest&pagesize=15", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f6752957-81c3-4c0a-8567-add102b30452>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 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, 203, 204, 239, 240, 242, 248, 257, 267, 268, 308, 309, 502, 504, 510, 518, 527, 528, 619, 620, 825, 827, 832, 840, 849, 850, 897, 898, 1095, 1097, 1102, 1111, 1120, 1121, 1166, 1167, 1367, 1369, 1375, 1384, 1393, 1394, 1502, 1503, 1705, 1707, 1712, 1720, 1729, 1730, 1781, 1782, 1976, 1978, 1983, 1992, 2001, 2002, 2036, 2037, 2235, 2237, 2243, 2252, 2261, 2262, 2313, 2314, 2519, 2521, 2526, 2534, 2543, 2544, 2589, 2590, 2791, 2793, 2798, 2806, 2815, 2816, 2860, 2861, 3063, 3065, 3071, 3080, 3089, 3090, 3131, 3132, 3307, 3309, 3315, 3323, 3332, 3333, 3377, 3378, 3558, 3560, 3566, 3575, 3585, 3586, 3646, 3647, 3851, 3853, 3859, 3867, 3876, 3877, 3918, 3919, 4118, 4120, 4126, 4134, 4143, 4144, 4265, 4266, 4470, 4472, 4478, 4487, 4496, 4497, 4634, 4635, 4832, 4834, 4840, 4849, 4858, 4859, 5006, 5007, 5189, 5191, 5197, 5205, 5214, 5215, 5253, 5254, 5457, 5459, 5464, 5472, 5481, 5482, 5522, 5523, 5723, 5725, 5731, 5739, 5748, 5749, 5801, 5802, 6003, 6005, 6011, 6019, 6028, 6029, 6070, 6071, 6273, 6275, 6280, 6289, 6298, 6299, 6353, 6354, 6536, 6538, 6544, 6552, 6561, 6562, 6600, 6601, 6761, 6763, 6769, 6777, 6786, 6787, 6853, 6854, 7004, 7006, 7011, 7020, 7029, 7030, 7074, 7075, 7209, 7211, 7217, 7225, 7234, 7235, 7286, 7287, 7467, 7469, 7474, 7483, 7492, 7493, 7536, 7537, 7739, 7741, 7747, 7756, 7765, 7766, 7815, 7816, 8016, 8018, 8024, 8032, 8041, 8042, 8130, 8131, 8334, 8336, 8341, 8349, 8358, 8359, 8421, 8422, 8624, 8626, 8632, 8641, 8650, 8651, 8736, 8737, 8934, 8936, 8942, 8951, 8960, 8961, 8998, 8999, 9197, 9199, 9205, 9214, 9224, 9225, 9279, 9280, 9470, 9472, 9478, 9487, 9496, 9497, 9588, 9589, 9787, 9789, 9794, 9802, 9811, 9812, 9846, 9847, 10047, 10049, 10054, 10062, 10071, 10072, 10122, 10123, 10321, 10323, 10328, 10336, 10345, 10346, 10378, 10379, 10581, 10583, 10589, 10597, 10606, 10607, 10757, 10758, 10963, 10965, 10971, 10980, 10989, 10990, 11101, 11102, 11306, 11308, 11313, 11322, 11331, 11332, 11379, 11380, 11581, 11583, 11588, 11596, 11605, 11606, 11645, 11646, 11849, 11851, 11856, 11865, 11874, 11875, 11906, 11907, 12095, 12097, 12103, 12111, 12120, 12121, 12157, 12158, 12350, 12352, 12357, 12365, 12374, 12375, 12452, 12453, 12647, 12649, 12655, 12664, 12673, 12674, 12737, 12738, 12941, 12943, 12949, 12958, 12967, 12968, 13001, 13002, 13204, 13206, 13211, 13220, 13229, 13230, 13335, 13336, 13541, 13543, 13548, 13557, 13566, 13567, 13615, 13616, 13817, 13819, 13824, 13832, 13841, 13842, 13873, 13874, 14060, 14062, 14067, 14076, 14085, 14086, 14148, 14149 ], "line_end_idx": [ 203, 204, 239, 240, 242, 248, 257, 267, 268, 308, 309, 502, 504, 510, 518, 527, 528, 619, 620, 825, 827, 832, 840, 849, 850, 897, 898, 1095, 1097, 1102, 1111, 1120, 1121, 1166, 1167, 1367, 1369, 1375, 1384, 1393, 1394, 1502, 1503, 1705, 1707, 1712, 1720, 1729, 1730, 1781, 1782, 1976, 1978, 1983, 1992, 2001, 2002, 2036, 2037, 2235, 2237, 2243, 2252, 2261, 2262, 2313, 2314, 2519, 2521, 2526, 2534, 2543, 2544, 2589, 2590, 2791, 2793, 2798, 2806, 2815, 2816, 2860, 2861, 3063, 3065, 3071, 3080, 3089, 3090, 3131, 3132, 3307, 3309, 3315, 3323, 3332, 3333, 3377, 3378, 3558, 3560, 3566, 3575, 3585, 3586, 3646, 3647, 3851, 3853, 3859, 3867, 3876, 3877, 3918, 3919, 4118, 4120, 4126, 4134, 4143, 4144, 4265, 4266, 4470, 4472, 4478, 4487, 4496, 4497, 4634, 4635, 4832, 4834, 4840, 4849, 4858, 4859, 5006, 5007, 5189, 5191, 5197, 5205, 5214, 5215, 5253, 5254, 5457, 5459, 5464, 5472, 5481, 5482, 5522, 5523, 5723, 5725, 5731, 5739, 5748, 5749, 5801, 5802, 6003, 6005, 6011, 6019, 6028, 6029, 6070, 6071, 6273, 6275, 6280, 6289, 6298, 6299, 6353, 6354, 6536, 6538, 6544, 6552, 6561, 6562, 6600, 6601, 6761, 6763, 6769, 6777, 6786, 6787, 6853, 6854, 7004, 7006, 7011, 7020, 7029, 7030, 7074, 7075, 7209, 7211, 7217, 7225, 7234, 7235, 7286, 7287, 7467, 7469, 7474, 7483, 7492, 7493, 7536, 7537, 7739, 7741, 7747, 7756, 7765, 7766, 7815, 7816, 8016, 8018, 8024, 8032, 8041, 8042, 8130, 8131, 8334, 8336, 8341, 8349, 8358, 8359, 8421, 8422, 8624, 8626, 8632, 8641, 8650, 8651, 8736, 8737, 8934, 8936, 8942, 8951, 8960, 8961, 8998, 8999, 9197, 9199, 9205, 9214, 9224, 9225, 9279, 9280, 9470, 9472, 9478, 9487, 9496, 9497, 9588, 9589, 9787, 9789, 9794, 9802, 9811, 9812, 9846, 9847, 10047, 10049, 10054, 10062, 10071, 10072, 10122, 10123, 10321, 10323, 10328, 10336, 10345, 10346, 10378, 10379, 10581, 10583, 10589, 10597, 10606, 10607, 10757, 10758, 10963, 10965, 10971, 10980, 10989, 10990, 11101, 11102, 11306, 11308, 11313, 11322, 11331, 11332, 11379, 11380, 11581, 11583, 11588, 11596, 11605, 11606, 11645, 11646, 11849, 11851, 11856, 11865, 11874, 11875, 11906, 11907, 12095, 12097, 12103, 12111, 12120, 12121, 12157, 12158, 12350, 12352, 12357, 12365, 12374, 12375, 12452, 12453, 12647, 12649, 12655, 12664, 12673, 12674, 12737, 12738, 12941, 12943, 12949, 12958, 12967, 12968, 13001, 13002, 13204, 13206, 13211, 13220, 13229, 13230, 13335, 13336, 13541, 13543, 13548, 13557, 13566, 13567, 13615, 13616, 13817, 13819, 13824, 13832, 13841, 13842, 13873, 13874, 14060, 14062, 14067, 14076, 14085, 14086, 14148, 14149, 14346 ] }	{ "red_pajama_v2": { "ccnet_original_length": 14346, "ccnet_original_nlines": 403, "rps_doc_curly_bracket": 0.01721733994781971, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.26853179931640625, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.038737449795007706, "rps_doc_frac_lines_end_with_ellipsis": 0.1163366287946701, "rps_doc_frac_no_alph_words": 0.4117647111415863, "rps_doc_frac_unique_words": 0.3246336877346039, "rps_doc_mean_word_length": 4.538461685180664, "rps_doc_num_sentences": 108, "rps_doc_symbol_to_word_ratio": 0.01195599976927042, "rps_doc_unigram_entropy": 5.7539191246032715, "rps_doc_word_count": 2184, "rps_doc_frac_chars_dupe_10grams": 0.03954802080988884, "rps_doc_frac_chars_dupe_5grams": 0.07949960231781006, "rps_doc_frac_chars_dupe_6grams": 0.061339788138866425, "rps_doc_frac_chars_dupe_7grams": 0.04802260175347328, "rps_doc_frac_chars_dupe_8grams": 0.04802260175347328, "rps_doc_frac_chars_dupe_9grams": 0.04802260175347328, "rps_doc_frac_chars_top_2gram": 0.011097660288214684, "rps_doc_frac_chars_top_3gram": 0.014527849853038788, "rps_doc_frac_chars_top_4gram": 0.006355930119752884, "rps_doc_books_importance": -1225.1988525390625, "rps_doc_books_importance_length_correction": -1225.1988525390625, "rps_doc_openwebtext_importance": -599.1793212890625, "rps_doc_openwebtext_importance_length_correction": -599.1793212890625, "rps_doc_wikipedia_importance": -567.980224609375, "rps_doc_wikipedia_importance_length_correction": -567.980224609375 }, "fasttext": { "dclm": 0.7439944744110107, "english": 0.832928478717804, "fineweb_edu_approx": 1.885359287261963, "eai_general_math": 0.9823523163795471, "eai_open_web_math": 0.976479709148407, "eai_web_code": 0.018592240288853645 } }	{ "free_decimal_correspondence": { "primary": { "code": "515.35", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Calculus and Mathematical analysis" } }, "secondary": { "code": "515.3", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Calculus and Mathematical analysis" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-355,111,608,175,393,000	The Junk Factory Navi's Personal Blog Arch, Debian, Suckless and wrapping up the Linux experience tony If you want to read the spanish version visit the following link After spending some time tinkering with a second-hand ThinkPad T480 that I ended up buying in a remote corner of the city where I live, I’ve been trying out different Linux distributions and desktop environments, but overall I’ll focus on two distributions that in my opinion are the most important: Debian and Arch. In addition to this, I wanted to try out a new Tiling Window Manager that had also caught my attention, as well as a set of software that embodies an interesting philosophy: Suckless. Some experiences with Arch and Debian To start with the distributions, Debian is incredibly simple to get started with, the installation is approachable, and I must admit that I like that it is (or pretends to be) 100% free software. Furthermore, once you go through the installation process, the desktop you choose just works, no surprises, it’s rock solid, and of course, you don’t expect much on the horizon regarding updates. In fact, every time I did an apt update, everything was simply up to date. So it’s a rather boring distribution if you want to be constantly surprised with new things, but for me, this is quite positive, as it maintains certainty in the system, you know it won’t fail unless you do something stupid. Regarding the software you install, obviously this is where you notice the gap, since Debian is quite conservative when it comes to bringing software into its main repository and therefore it’s not uncommon to have software versions that may be 10 or 12 months behind the current development version. This may not be a big problem, but each software has a different development speed, and in a year you can have significant differences. Also, if you’ve been carrying more updated versions of programs that have some kind of config file, that can be a problem. An example where I noticed this was when I wanted to install Alacritty and port my .toml file with my configurations, when using it, I realized that the changes weren’t applied. The reason was that the version of Alacritty that comes from Debian’s apt was an old version that used .yml files, so I had to 1) adapt my configuration files to this version, which for this case wasn’t complicated, or 2) compile from source. Compiling from source isn’t a bad approach, however, it means that you’re at the mercy of your package manager taking care of future updates, and obviously that can represent a risk. An important issue with a system like Linux is that you have your software updated and operating harmoniously with your operating system. Of course, there’s nothing wrong with compiling from source, I’ve done it with some software, but it’s important to note that it’s not the most desirable. However, a positive aspect to recognize is that Debian has a vast repository, which reduces the chances of having to resort to installing from source code. On the other hand, I’m now using Arch (btw) so I’m still in a process of experimentation with this variant. Arch is different in its installation process, although now there’s a script that simplifies the process, the manual installation is in the terminal by typing commands and where you have to follow the instructions from the wiki, it’s not that difficult, but obviously it’s more likely that you can make a mistake along the way and therefore mess up, in fact, I messed up a couple of times because I didn’t configure the Nvidia driver properly and therefore my system failed, so I had to start the process again. If you want up-to-date software, this is the distribution and even if you want to access proprietary software, Arch has no problems, it’s a distribution agnostic and therefore has a laissez-faire mentality towards users, I can run the analog of apt update which in this case is Pacman -Syu every day and there may be new updates. Obviously with software like Alacritty or Neovim I didn’t have to resort to compiling it from source because Arch itself provides recent updates which is also a pleasure not to have to directly intervene with the code, another thing is that in addition to the base repository, Arch has the AUR which is another repository where the community can upload software and of course that allows your possibilities to expand, however in my experience, it’s in the AUR where you have more chances of software failure. Here are some other examples of software that allowed me to compare distributions. As I like to watch anime, I wanted to install ani-cli which is an application to watch content from the terminal (you have to thank that the hacker community is quite otaku), unfortunately, this software in Debian is not considered in its main repository yet and will apparently be added in version 13, so one option was to compile it, but I finally gave up on it. On the other hand, with Arch there was no problem, the repo was in AUR so the installation was quite simple. The second case was Anki, a flashcard application, which I like and have used a lot to learn languages so I thought about installing it on my pc as well (although the Android app is quite good to be honest), unfortunately Anki is a mess, I went to the documentation and tried to install it following the instructions but had problems in the process, fortunately Debian has Anki in its main repository, so installing it with apt was the best option, on the other hand Arch had it in the AUR, however, I had problems with the installation so I didn’t continue with it. The third and last case was Librewolf, in this case Debian had no problems, by following the steps in the documentation the issue worked without problems, Arch had it in the AUR, and the installation process took quite some time and finally I had problems with that but the binary worked fine. As a side note, I must praise the Arch Linux Wiki, you may or may not like Arch, but I think no one can deny that its documentation is of a high level, it helped me to see a specific case where I wanted to see how to install the Japanese keyboard on it with the kanas specific to the writing of this language, I checked the documentation in Debian and Arch, finally the latter gave me clear instructions on how to configure it correctly, besides that on other occasions when I’ve had problems with something in Debian/Ubuntu/Fedora or even Arch itself the Wiki has been helpful. Finally, I want to highlight that both have the possibility of minimal installations, so if you have a laptop with hardware restrictions, I think there’s no problem with any of these variants for you to do a minimal installation and instead of using a bloated desktop environment, you can use a window manager that will be much lighter and more efficient in resources like Sway, i3, or dwm. Although I wrote about Sway in another post, now I want to focus on dwm and another set of software that belongs to suckless. Suckless: Software that suckless Suckless is a community of hackers who have built a set of software based on the concepts of minimalism, simplicity, and frugality, part of this decision you can read in their philosophy, but to try to get to the point, all the code is written in C, and there are no configuration files, if you want to install this, you download the code and compile it, if you want to make modifications to something, you go straight to the C source code and modify it and recompile it. The most important software (in my opinion) are: 1. st a terminal emulator 2. dwm the window manager 3. dmenu the dynamic menu that you can use to run your programs Something you have to notice is that this software has minimal features, for example, St doesn’t have a way to scroll, nor does it have a way to make your terminal transparent, if you want to achieve this, you have two options: the first is to write the code yourself, but if you’re like me and have no idea about C then accessing the patches that the community has created and improved over time is the option, so for example, to the terminal I can add transparency with alpha and a gruvbox color scheme. To dwm I can add patches to add gaps with useless gaps. all this just with the command patch -p1 < path/to/patch It should be noted that starting to add patches can lead to errors, so you will have to be the one to make the corresponding adjustments for the failures, and in some cases if you have several patches in mind, you have to consider that there is a more appropriate order to do it to reduce the potential number of errors. Obviously the idea is not that you go and take a collection of patches that you “like” and apply them, but that you be much more austere and select them according to a real need that arises, for example, I only applied useless gaps to dwm for a bit of aesthetics, but the truth is that dwm by itself has been fantastic, I haven’t had the intention of adding another patch for now, I haven’t needed to add scrolling to st, since I use tmux quite a bit, which serves that function as a substitute. So if you like to add things to your application just because, it’s possible but you’ll have to deal with debugging the errors that occur while adding the patches. Other software that I have been adding and that follows a similar philosophy: 1. nsxiv: To display images 2. scrot: screenshots 3. feh: set an image as background 4. cmus: music player 5. ly: minimal session manager. 6. mpv: Media player 7. slock: lock your system with a password. 8. xclip: X11 clipboard Among others… Obviously I have to point out that these exercises for a machine that isn’t really that old and has relatively decent hardware maybe is considered exaggereted, as an exercise it was worth it and it taught me a lot about minimal installations and how you can reach customization levels while keeping resource usage to a minimum and in fact I will continue using this configuration until I get bored, but if you’re not interested in that Gnome or KDE run quite well on a machine like this. Conclusions at the end Regarding Arch and Debian I don’t have a clear preference yet, both have their pros and cons, for now I’ll continue using Arch to continue evaluating how it goes. Although there are other distributions, even some more hardcore ones like Gentoo, for now my curiosity hasn’t reached that point yet. Suckless software is an interesting perspective, quite radical to market trends and for a niche taste, I can’t imagine many people wanting to get into this point, but for those who do, I’m sure it’s a good exercise to use something like dwm, inspect the C code, customize, add patches, etc. If you can do that, the idea of making your own software for a specific personal need may not be so far-fetched. I’ve also had a lot of fun with Linux over the past 4 months, it has taught me a lot about how an operating system works especially when I’ve wanted to go to slightly deeper levels and start eliminating the use of interfaces, I’m not going to call myself a “power user”, but certainly t here’s some knowledge that I value and I understand a bit more about those people who want to know more about their system and adjust it to their liking and have absolute control over it. If there’s anyone interested in knowing what my “learning path” was, which by the way was not planned at all it was just pure curiosity, I would describe it as follows: 1. Install free and open source software on your own machine, even if you’re on MacOS or Windows. Install and familiarize yourself with their basic uses and if you can include it in something you do daily even better. For example, Vim, Python, R, LibreOffice, etc. 2. Learn basic commands in a terminal: commands like cd, mv, rm, cp, ls. I use them constantly nowadays and I would recommend reading a bit about them and doing some tests to remove the fear of the black screen, then you can add new commands like curl, grep, sed, etc. 3. Install Ubuntu or another friendly distribution: I used Ubuntu at the time, there are people who criticize it currently for various reasons. But something that Ubuntu has is that its installation process was super friendly, a modern look, there’s plenty of documentation on the internet and it works well. Linux Mint seems like another good alternative to Ubuntu, but I don’t have experience with that distribution. This is for a start, later if you want to move to another distribution nothing will prevent you from doing it 4. Get familiar with the package manager: The first way to install software is from the terminal using your package manager, if you’re on Ubuntu or Mint you’ll have to use something like sudo apt update and then sudo apt install yoursoftware, there are other alternatives to install software but this should be your priority method. 5. Install software by compiling source code: Take a software that interests you, go to its documentation or the repository where it is and read about its installation process, probably besides the package manager it will have a space where it will give instructions on how to do it, follow those instructions. 6. Use a Tiling Window Manager: There are two major desktop environments in Linux GNOME and KDE, both have a lot of features and you can easily navigate in them, adjust brightness, connect to wifi, explore your folders with files, screenshots, etc. With a twm you won’t have any of that, and you’ll have to look up how to execute each of these commands, you need to connect your mouse via bluetooth, one possible solution is to install bluez and bluez utils, open the terminal and use the bluetoothctl command, there are also GUI options, but it will depend on you to find a way to execute it. Play with this and if you want try to do a ricing (configure your environment to look aesthetically attractive). 7. Create a remote server and run some programs on them: If you have an old laptop, or a raspberry pi, or rent a vps, you can try to create a remote server where you can host some programs, this is the path to another world that is self-hosting, I’m quite a newbie in this, but there are a couple of experiences that can teach you something, for example create a personal website and host it on your server, buy your domain and redirect it to your website. One thing I did for example was to get rid of Kindle and host my books in Calibre, so now I can access my personal library from my own server. With this you can learn a bit about connecting via ssh, nginx, dns, docker, etc. There are people who host a bunch of applications from a youtube frontend, emails, vpn, etc. There you can see for yourself what to do. 8. Install Arch Linux manually: If you installed Ubuntu before, you’ll notice that the process is quite simple in general, installing Arch is more complex, but it will teach you how to make an operating system from scratch, so you can understand what some of the base libraries are for, make the partitions manually, configure network, timezone, keyboard, decide between X11 or Wayland, etc. Try to use it for a period of time as your main machine and use it for everything you can. 9. Contribute to Linux: I plead guilty of not doing it yet, I suppose this is a note for the future… Anyway, it’s been an interesting journey and I think I’ll continue using Linux for my personal machines. I’ll probably continue to see some self-hosting things, but I think I’ve had enough with ricing and trying distributions, it’s time to move on to another topic. Articles from blogs I follow around the net The Reasonable Effectiveness of Using Old Phones as Servers I installed linux on a OnePlus6T. Setup took less than an hour, technical issues included. Why $90 for 8GB RAM, 128GB storage, 2.8GHz 8-core CPU Linux on the OnePlus 6T is well documented Low power consumption Tiny footprint No additional cables … via jarbus.net on March 16, 2024 Plotting data in Julia And so we come to the third post in my extremely ill-considered foray into learning Julia. In the first part of the series I taught myself some of the foundations for writing Julia code, in the second part I discussed data wrangling in Julia, and so in t… via Notes from a data witch March 2, 2024 Reproducible data science with Nix, part 10 -- contributing to nixpkgs I’ve very recently started contributing to the nixpkgs repository of packages, which contains all the packages you can install from the Nix package manager. My contributions are fairly modest: I help fix R packages that need some tweaking to make them succes… via Blogs on Econometrics and Free Software February 29, 2024 Generated by openring	{ "url": "https://indymnv.xyz/posts/2024_04_21_suckless/", "source_domain": "indymnv.xyz", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "24408", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2S3J7S2ZGXXQ6ZSPYPTONZC42ID2FLE3", "WARC-Concurrent-To": "<urn:uuid:3032eeca-289e-4ada-86fb-39b961d25732>", "WARC-Date": "2024-05-19T16:31:30Z", "WARC-IP-Address": "202.182.99.103", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3CL4G6RC7U7NJNQXEZZV3MSGUCUPLANU", "WARC-Record-ID": "<urn:uuid:cb216a67-a040-46d3-93fd-c1bc81b7ced8>", "WARC-Target-URI": "https://indymnv.xyz/posts/2024_04_21_suckless/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6ef06d3c-9ea2-43ce-ba8a-d3ad4db63e72>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-29\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, 17, 18, 39, 40, 41, 101, 102, 107, 108, 173, 174, 675, 676, 714, 715, 2388, 2389, 3021, 3022, 3642, 3643, 4482, 4483, 5901, 5902, 6481, 6482, 6999, 7000, 7033, 7034, 7555, 7556, 7584, 7612, 7678, 7679, 8272, 8273, 8299, 8300, 9281, 9282, 9360, 9361, 9391, 9415, 9452, 9476, 9510, 9533, 9579, 9605, 9606, 9620, 9621, 10109, 10110, 10133, 10134, 10431, 10432, 10836, 10837, 11481, 11482, 11749, 11750, 12021, 12022, 12553, 12554, 12889, 12890, 13203, 13204, 13913, 13914, 14733, 14734, 15219, 15220, 15323, 15324, 15590, 15591, 15635, 15636, 15696, 15697, 15945, 15946, 15979, 15980, 16003, 16004, 16260, 16261, 16303, 16304, 16375, 16376, 16636, 16637, 16699, 16700 ], "line_end_idx": [ 17, 18, 39, 40, 41, 101, 102, 107, 108, 173, 174, 675, 676, 714, 715, 2388, 2389, 3021, 3022, 3642, 3643, 4482, 4483, 5901, 5902, 6481, 6482, 6999, 7000, 7033, 7034, 7555, 7556, 7584, 7612, 7678, 7679, 8272, 8273, 8299, 8300, 9281, 9282, 9360, 9361, 9391, 9415, 9452, 9476, 9510, 9533, 9579, 9605, 9606, 9620, 9621, 10109, 10110, 10133, 10134, 10431, 10432, 10836, 10837, 11481, 11482, 11749, 11750, 12021, 12022, 12553, 12554, 12889, 12890, 13203, 13204, 13913, 13914, 14733, 14734, 15219, 15220, 15323, 15324, 15590, 15591, 15635, 15636, 15696, 15697, 15945, 15946, 15979, 15980, 16003, 16004, 16260, 16261, 16303, 16304, 16375, 16376, 16636, 16637, 16699, 16700, 16721 ] }	{ "red_pajama_v2": { "ccnet_original_length": 16721, "ccnet_original_nlines": 106, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4938022494316101, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.029115019366145134, "rps_doc_frac_lines_end_with_ellipsis": 0.04672896862030029, "rps_doc_frac_no_alph_words": 0.13635052740573883, "rps_doc_frac_unique_words": 0.2911306619644165, "rps_doc_mean_word_length": 4.5057549476623535, "rps_doc_num_sentences": 92, "rps_doc_symbol_to_word_ratio": 0.0014413399621844292, "rps_doc_unigram_entropy": 5.742774963378906, "rps_doc_word_count": 2954, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.005108939949423075, "rps_doc_frac_chars_dupe_6grams": 0.0025544699747115374, "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.007663410156965256, "rps_doc_frac_chars_top_3gram": 0.006085650064051151, "rps_doc_frac_chars_top_4gram": 0.005785120185464621, "rps_doc_books_importance": -1562.45556640625, "rps_doc_books_importance_length_correction": -1562.45556640625, "rps_doc_openwebtext_importance": -952.548583984375, "rps_doc_openwebtext_importance_length_correction": -952.548583984375, "rps_doc_wikipedia_importance": -594.1586303710938, "rps_doc_wikipedia_importance_length_correction": -594.1586303710938 }, "fasttext": { "dclm": 0.03769015893340111, "english": 0.9560349583625793, "fineweb_edu_approx": 1.4863755702972412, "eai_general_math": 0.8730747699737549, "eai_open_web_math": 0.4136272072792053, "eai_web_code": 0.5723277926445007 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,463,659,650,804,262,000	The Evolution of Technology: A Catalyst for Modernization and Progress Technology, often abbreviated as “tec,” has rapidly evolved over the years, revolutionizing the way we live, work, and communicate. The impact of technology on society is profound, transforming every aspect of our lives and driving progress at an unprecedented pace. From early inventions like the wheel to contemporary innovations like artificial intelligence, technology has been a cornerstone of human evolution. Early Technological Milestones The journey of technology began thousands of years ago with simple tools crafted from stone, bone, and wood. The advent of the wheel around 3500 BC marked a significant milestone, facilitating transportation and trade. As civilizations grew, so did technological ingenuity. The ancient Greeks and Romans developed advanced engineering techniques, contributing to the construction of remarkable architectural marvels like the Parthenon and the Colosseum. The Renaissance and the Birth of Modern Science The Renaissance, occurring from the 14th to the 17th century, was a period of immense cultural and intellectual growth. This era witnessed the blossoming of modern science and technology. Inventors and thinkers like Leonardo da Vinci conceptualized designs for machines and devices that were far ahead of their time. The printing press, invented by Johannes Gutenberg, revolutionized the spread of knowledge by making books more accessible. The Industrial Revolution: A Technological Turning Point The Industrial Revolution, which began in the late 18th century and continued into the 19th century, was a watershed moment in technological history. It brought about mechanization, steam power, and mass production, transforming the economic and social landscape. Factories, powered by steam engines, mechanized agriculture, manufacturing, and transportation, boosting efficiency and productivity. The Digital Age and the Internet Revolution The late 20th century saw the emergence of the digital age, characterized by rapid advancements in computing, telecommunications, and the birth of the internet. Computers became smaller, faster, and more accessible, enabling a myriad of applications, from business operations to scientific research. The internet revolutionized communication, connecting people worldwide and providing a platform for information exchange and collaboration. Contemporary Advancements: Artificial Intelligence and Beyond In the 21st century, technology has continued to advance at an unprecedented rate. Artificial intelligence (AI) has become a focal point, with machine learning algorithms and deep learning driving breakthroughs in various fields. AI is powering autonomous vehicles, improving healthcare through diagnostics and personalized medicine, and enhancing our understanding of complex systems. The Impact of Technology on Society The impact of technology on society cannot be overstated. It has improved the quality of life, made tasks more efficient, and connected people globally. However, it also raises ethical, social, and environmental concerns. Issues such as data privacy, job displacement due to automation, and the digital divide are important challenges that need to be addressed as technology continues to evolve. Looking Ahead: A Technological Future As we look to the future, the trajectory of technology seems promising. Emerging technologies like quantum computing, renewable energy solutions, and bioengineering hold immense potential to address pressing global challenges. However, responsible development and deployment of technology are crucial to ensure a sustainable and equitable future for all. In conclusion, technology, abbreviated as “tec,” has evolved from simple tools to complex systems that have shaped our world. Its impact on society and its potential for the future are immense, and it’s essential to harness this power responsibly for the benefit of humanity and the planet. Leave a Comment	{ "url": "https://www.fukuchanhonpo.com/3-3-it-seems-like-you-want-an-article-about-technology-based-on-the-provided-title-tec-heres-a-600-word-article-discussing-the-advancements-and-impacts-of-technology-the-evolution-of-te/", "source_domain": "www.fukuchanhonpo.com", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "46770", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:TWKJAJN7LWBOWIAUQ4N34JGQR36UZM5T", "WARC-Concurrent-To": "<urn:uuid:151b6005-5071-439f-9a21-90262ec816e1>", "WARC-Date": "2024-07-21T22:56:08Z", "WARC-IP-Address": "173.236.143.130", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5QLEEDNTOK4IADYG2HJCP22XK7RSWWVX", "WARC-Record-ID": "<urn:uuid:6fd67889-4fec-40f9-9857-ff29e1f77af8>", "WARC-Target-URI": "https://www.fukuchanhonpo.com/3-3-it-seems-like-you-want-an-article-about-technology-based-on-the-provided-title-tec-heres-a-600-word-article-discussing-the-advancements-and-impacts-of-technology-the-evolution-of-te/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3a05de14-f1d6-4fc8-a84d-7ebc88f02984>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-32\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 71, 72, 488, 489, 520, 521, 975, 976, 1024, 1025, 1466, 1467, 1524, 1525, 1923, 1924, 1968, 1969, 2409, 2410, 2472, 2473, 2859, 2860, 2896, 2897, 3293, 3294, 3332, 3333, 3688, 3689, 3980, 3981 ], "line_end_idx": [ 71, 72, 488, 489, 520, 521, 975, 976, 1024, 1025, 1466, 1467, 1524, 1525, 1923, 1924, 1968, 1969, 2409, 2410, 2472, 2473, 2859, 2860, 2896, 2897, 3293, 3294, 3332, 3333, 3688, 3689, 3980, 3981, 3996 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3996, "ccnet_original_nlines": 34, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.31039753556251526, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00917430967092514, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14067277312278748, "rps_doc_frac_unique_words": 0.54448401927948, "rps_doc_mean_word_length": 5.925266742706299, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.1512908935546875, "rps_doc_word_count": 562, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.027027029544115067, "rps_doc_frac_chars_dupe_6grams": 0.027027029544115067, "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.025225229561328888, "rps_doc_frac_chars_top_3gram": 0.009909910149872303, "rps_doc_frac_chars_top_4gram": 0.018918920308351517, "rps_doc_books_importance": -263.0769958496094, "rps_doc_books_importance_length_correction": -263.0769958496094, "rps_doc_openwebtext_importance": -126.73353576660156, "rps_doc_openwebtext_importance_length_correction": -126.73353576660156, "rps_doc_wikipedia_importance": -128.82249450683594, "rps_doc_wikipedia_importance_length_correction": -128.82249450683594 }, "fasttext": { "dclm": 0.9757722020149231, "english": 0.9403125047683716, "fineweb_edu_approx": 3.300673723220825, "eai_general_math": 0.16164326667785645, "eai_open_web_math": 0.36201953887939453, "eai_web_code": 0.010118190199136734 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.09", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "303.483", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social sciences — Dictionaries" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "14", "label": "News Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-216,604,999,894,833,800	Here's How to Fix An iPhone That Won't Turn Off Man staring at a phone that's not on on a table, head in hands If your iPhone won't turn off, you may be worried that your iPhone is broken and that, eventually, your phone's battery is going to run out. Those are both valid concerns. An iPhone that's stuck on is a rare situation, but if it's happening to you, you need to understand what's going on so you can know how to fix it. Reasons Why Your iPhone Won't Turn Off An illustration of the reasons an iPhone won't turn off. ©Lifewire The most likely reasons why your iPhone won't turn off are: • It's frozen due to software problems. • The Sleep/Wake button is broken. • The screen is broken and isn't responding to taps. If this is the case, skip directly to step 4 below. How to Fix an iPhone that Won't Power Off Before you try any of these steps, first you should attempt to use the standard way of turning off your iPhone (holding down the Sleep/Wake button and then sliding the Power Off slider). If you're reading this article, you've probably already tried that and it didn't work. If that's your situation, try these steps. Step 1: Hard Reset Your iPhone The first, and simplest, way to shut down an iPhone that won't turn off is using a technique called a hard reset. This is very similar to the standard way of turning your iPhone on and off, but is a more complete reset of the device and its memory. Don't worry: you won't lose any data. Only use a hard reset if your iPhone won't restart any other way. To hard reset your iPhone: 1. Hold down the Sleep/Wake button and the Home button at the same time. If you have an iPhone 7 series phone, hold down Volume Down and Sleep/Wake. The power off slider should appear on the screen. Keep holding both buttons. 2. If you have an iPhone 8 or later, press and quickly release the Volume Up button, then press and quickly release the Volume Down button, and finally press and hold the Side button (the Sleep/Wake button was renamed the Side button in later iPhone models). iPad and iPhone illustration showing hardware buttons 3. The screen will go black. 4. Keeping holding until the Apple logo appears on the screen. Let go of the button(s) and the iPhone will restart like normal. When the phone is finished restarting, everything should work fine again. Step 2: Enable AssistiveTouch and Turn Off iPhone Via Software This is a super-cool trick that's most useful if your phone's physical Home button is broken and can't be used to reset your phone. In that situation, you need to do it through software. AssistiveTouch is a feature built into the iPhone that puts a software version of the Home button on your screen. It's designed for people with physical conditions that make it hard for them to press the button, but lots of people without those conditions use it for the cool features it offers. Start by enabling AssistiveTouch: 1. Tap Settings > General > Accessibility. 2. In the Interaction section, tap AssistiveTouch. General, Accessibility, and AssistiveTouch buttons in iOS settings app 3. On the AssistiveTouch screen, move the switch to on/green and a new icon will appear on your screen. That's your new software-based Home button. With this new Home button enabled, follow these steps to turn off your iPhone: 1. Tap the software Home button. 2. Tap Device. 3. Tap and hold Lock Screen until the Power Off slider appears. AssistiveTouch toggle ON, Device softbutton and Lock screen softbutton highlighted in iOS Settings 4. Move the slider from left to right to turn off your iPhone. Step 3: Restore iPhone From Backup If a hard reset and AssistiveTouch haven't solved it, the problem probably has to do with the software on your phone, not the hardware. It's hard for the average person to figure out whether that's a problem with the iOS or an app you've installed, so the best bet is to restore your iPhone from backup. Doing this takes all of the data and settings from your phone, deletes and then reinstalls them to give you a fresh start. It won't fix every problem, but it does fix a lot. Here's what you need to do: 1. Connect your iPhone to the computer you normally sync it with. 2. Open iTunes on your computer if it doesn't open on its own. 3. Click the iPhone icon in the top left corner, beneath the playback controls (if you're not already in the iPhone management section, that is). iPhone icon in iTunes when iPhone connected to computer 4. In the Backups section, click Back Up Now. This will sync your iPhone to the computer and create a backup of your data. Back Up Now button in iTunes iPhone management window 5. When that's done, click Restore Backup. Restore Backup button in iTunes iPhone management window 6. Follow on the onscreen prompts to select the backup you just created in step 4. 7. Follow the onscreen steps and, after a few minutes, your iPhone should start up like normal. 8. Disconnect it from iTunes, and you should be good to go. Step 4: Visit Apple for Help If none of these steps have solved your problem, and your iPhone still won't turn off, your problem may be bigger, or a lot trickier, than you can solve at home. It's time to bring in the experts: Apple. You can get phone support from Apple (charges will apply if your phone is no longer in warranty). Check Apple's list of support phone numbers here. You can also go to an Apple Store for face-to-face help. If you prefer that, be sure that you make an Apple Genius Bar appointment ahead of time. There's a lot of demand for tech support at Apple Stores and without an appointment, you'll probably wait a long time to speak to someone.	{ "url": "https://www.lifewire.com/fix-iphone-wont-turn-of-4134989", "source_domain": "www.lifewire.com", "snapshot_id": "crawl=CC-MAIN-2019-26", "warc_metadata": { "Content-Length": "132195", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:X5LXM3PJDOKJRCX4GXU63C2NQYOUNP3R", "WARC-Concurrent-To": "<urn:uuid:d2a24c1b-b700-494b-be3e-48ffb23a1827>", "WARC-Date": "2019-06-19T05:35:33Z", "WARC-IP-Address": "151.101.250.114", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LLU4O7ROYPMN5TNMOADMY4LVYAUDUMUH", "WARC-Record-ID": "<urn:uuid:1f0c5f2f-b5ec-427c-b1d9-ccbac3cf8b61>", "WARC-Target-URI": "https://www.lifewire.com/fix-iphone-wont-turn-of-4134989", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e67a614b-fa7e-4211-9d54-ba15b8f5ebad>" }, "warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-168-158-209.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 48, 49, 112, 113, 432, 433, 472, 473, 530, 541, 542, 602, 603, 645, 682, 789, 790, 832, 833, 1150, 1151, 1182, 1183, 1536, 1537, 1564, 1565, 1793, 1794, 2055, 2056, 2114, 2145, 2146, 2350, 2351, 2414, 2415, 2602, 2603, 2933, 2934, 2979, 2980, 3033, 3034, 3109, 3259, 3260, 3339, 3340, 3375, 3376, 3393, 3394, 3460, 3461, 3564, 3629, 3630, 3665, 3666, 3802, 3803, 4173, 4174, 4242, 4243, 4308, 4309, 4457, 4458, 4518, 4643, 4644, 4702, 4747, 4748, 4809, 4894, 4895, 4993, 4994, 5056, 5057, 5086, 5087, 5291, 5292, 5440, 5441 ], "line_end_idx": [ 48, 49, 112, 113, 432, 433, 472, 473, 530, 541, 542, 602, 603, 645, 682, 789, 790, 832, 833, 1150, 1151, 1182, 1183, 1536, 1537, 1564, 1565, 1793, 1794, 2055, 2056, 2114, 2145, 2146, 2350, 2351, 2414, 2415, 2602, 2603, 2933, 2934, 2979, 2980, 3033, 3034, 3109, 3259, 3260, 3339, 3340, 3375, 3376, 3393, 3394, 3460, 3461, 3564, 3629, 3630, 3665, 3666, 3802, 3803, 4173, 4174, 4242, 4243, 4308, 4309, 4457, 4458, 4518, 4643, 4644, 4702, 4747, 4748, 4809, 4894, 4895, 4993, 4994, 5056, 5057, 5086, 5087, 5291, 5292, 5440, 5441, 5725 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5725, "ccnet_original_nlines": 91, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4049520790576935, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.000798719993326813, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17571884393692017, "rps_doc_frac_unique_words": 0.3227722942829132, "rps_doc_mean_word_length": 4.367326736450195, "rps_doc_num_sentences": 75, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.119804382324219, "rps_doc_word_count": 1010, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.11539333313703537, "rps_doc_frac_chars_dupe_6grams": 0.062117431312799454, "rps_doc_frac_chars_dupe_7grams": 0.02493765950202942, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.03627295047044754, "rps_doc_frac_chars_top_3gram": 0.017456360161304474, "rps_doc_frac_chars_top_4gram": 0.015416010282933712, "rps_doc_books_importance": -495.784912109375, "rps_doc_books_importance_length_correction": -495.784912109375, "rps_doc_openwebtext_importance": -287.41583251953125, "rps_doc_openwebtext_importance_length_correction": -287.41583251953125, "rps_doc_wikipedia_importance": -202.5353240966797, "rps_doc_wikipedia_importance_length_correction": -202.5353240966797 }, "fasttext": { "dclm": 0.4632570743560791, "english": 0.9269905686378479, "fineweb_edu_approx": 1.4230847358703613, "eai_general_math": 0.01466912031173706, "eai_open_web_math": 0.07100213319063187, "eai_web_code": 0.03557020053267479 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.164", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-1,217,466,182,506,663,200	Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü - Ñòðàíèöà 15 - Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ StormWall - Çàùèòà îò DDos àòàê Ðåãèñòðàöèÿ Ìíåíèÿ Ñïðàâêà Ïîëüçîâàòåëè Êàëåíäàðü Âñå ðàçäåëû ïðî÷èòàíû Âåðíóòüñÿ Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ > MMO > Äðóãèå èãðû / Other games > WarCraft III WarCraft III Ôîðóì ïîñâÿùåí ïîïóëÿðíîé ñòðàòåãèè îò Blizzard’a – Warcraft 3. Äèñêóññèè íà òåìó ñîçäàíèÿ êàðò è ñîçäàíèÿ ñåðâåðà íà áàçå ýìóëÿòîðà PvPGN. Îïèñàíèå òåìû:Õîñòèíã áîòû Îòâåò Îïöèè òåìû Íåïðî÷èòàíî 17.11.2010, 21:46 #141 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü À, ÿ íå çàìåòèë ñðàçó. Âîò ýòè çíà÷åíèÿ â êîíôèãå ïîñòàâèòü ïóñòûìè: Êîä: bnet_custom_exeversion = 230 1 24 1 bnet_custom_exeversionhash = 48 158 165 202 Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 18.11.2010, 07:50 #142 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Öèòàòà: Ñîîáùåíèå îò [u] Ïîñìîòðåòü ñîîáùåíèå îáíîâèë âñåðí íå êàòèò òà æå îøèáêà èìåííî òàê è ñòîèò 1.24.4.6387,åñòü ìûñëè? Äîáàâëåíî ÷åðåç 11 ìèíóò âñå ðàçîáðàëñÿ ñïñ îãðîìíîå òåáå! Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü [u]; 18.11.2010 â 08:01. Ïðè÷èíà: Äîáàâëåíî ñîîáùåíèå [u] âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 16:25 #143 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü [ BNET: playground.ru] refreshed ban list (0 -> 64 bans) [ BNET: playground.ru] connecting to server [playground.ru] on port 6112 [ BNET: playground.ru] resolved and cached server IP address 212.42.38.154 [ BNET: playground.ru] connected [ TCPSOCKET] closed by remote host [ BNET: playground.ru] disconnected from battle.net [ BNET: playground.ru] waiting 30 seconds to reconnect Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 16:44 #144 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Agito919, ïîêàæè êîíôèã. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 17:42 #145 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Êîä: [GHOST] ########################################################### # PLEASE EDIT CONFIG IN GHOST ONE UNDER GHOST OPTIONS TAB # ########################################################### ### handle name bans: 0 = do nothing, 1 = kick, 2 = announce only (no kick). bot_banning = 1 ### force auto hcl from gamename in dota games (even when bot_defaulthcl is not set) bot_forceautohclindota = 1 ### set to 1 if you want admins to be autoplaced higher only in dota games (0 = in all games) bot_placeadminshigheronlyindota = 0 ### if 1 - no admin can start the game if the owner is in the lobby bot_onlyownerscanstart = 1 ### if set to 1, if using bot_allowedscores, players having an unknown score will be allowed bot_allownullscoredplayers = 1 ### in autohosted games, allow only players with score>=x to join the lobby bot_autohostallowedscores = 0 ### allow only players with score>=x to join the lobby bot_allowedscores = 0 ### milliseconds to add to highest ping as base dynamic latency bot_dynamiclatencyaddedtoping = 25 ### how many milliseconds to add to the normal latency if the players lag bot_dynamiclatencymaxtoadd = 30 ### dynamic latency will try not to go over 2.2x highest ping, recommended bot_dynamiclatency2.2xhighestpingmax = 1 ### dynamic latency will be increased when a lobby is active bot_dynamiclatencyincreasewhenlobby = 1 ### enable dynamic latency, lowers or even increases latency as needed bot_usedynamiclatency = 1 ### if enabled, any user can !pub/!map/!unhost bot_userscanhost = 1 ### if enabled, any safelisted player can !pub/!map/!unhost bot_safecanhost = 0 ### will allow admins and safelisted players to download even if downloads are disabled bot_adminsandsafecandownload = 1 ### will replace every !ban/!bl with !warn/!wl bot_replacebanwithwarn = 0 ### 0 - ghost countdown, 1 - warcraft countdown bot_normalcountdown = 0 ### when you !unban player, the bot also issues an /unban player bot_unbanremoveschannelban = 0 ### all messages will be answered with a whisper bot_whisperallmessages = 0 ### fake pings for the following players, space separated: ex = nick1 nick2 bot_fakepings = # Prints the gameloaded.txt message after X seconds. Default: 10. bot_gameloadedprintout = 10 # how many games should the player play (without taking another warn) to make one of his warns inactive. Default: 7 bot_gamenumtoforgetawarn = 7 # how many days will each warn last. 0 - permanent warn. Default: 14. bot_warntimeofwarnedplayer = 14 # how many days will the auto-ban from warns last. 0 - permanent ban. Default: 14. bot_bantimeofwarnedplayer = 14 # how many warns are needed to auto-ban the player. Default: 3. bot_banthewarnedplayerquota = 3 # tbanlast/tbl will expire in x days - set to 0 to be permanent bot_tbanlasttime = 30 # normal banlast/bl will expire in x days - set to 0 to be permanent bot_banlasttime = 180 # normal bans will expire in x days - set to 0 to be permanent bot_bantime = 100 # auto warns leavers bot_autowarnearlyleavers = 0 # send admin messages or not (if using the admin game) bot_adminmessages = 0 # send local admin messages or not (if using the admin game) bot_localadminmessages = 0 # set !autostart 10 automatically in dota games bot_autostartdotagames = 0 # safelisted players are immune to ban/warn bot_safelistedbanimmunity = 1 # Drop the user if he/she desyncs or not bot_dropifdesync = 1 ### handle ip bans: 0 = do nothing, 1 = kick, 2 = announce only (no kick). bot_ipbanning = 1 ### make the ban announcement on one line ( = 0) (if possible) or on two ( = 1) bot_twolinesbanannouncement = 1 ### custom text to add to version. bot_customversiontext = ### auto ban people who leave during the countdown bot_autobancountdown = 1 ### auto ban people who leave during the game load bot_autobangameloading = 1 bot_autohostdeniedcountries = bot_autohostallowedcountries = ### UDP port on which the bot communicates with GHost One GUI, 5868 default udp_guiport = 5868 # In LAN/GArena show the real number of current/total players in the game, when using !pubg it will be auto activated lan_showrealslotcount = 0 # LIST OF SETTINGS NOT IN GHOST OPTIONS TAB #bot_language #bot_mapcfgpath #bot_savegamepath #bot_spoofchecks #bot_refreshmessages #bot_autolock #bot_autosave #bot_allowdownloads #bot_pingduringdownloads #bot_lcpings #bot_autokickping #bot_latency #bot_synclimit #bot_votekickallowed #bot_votekickpercentage #bot_udpconsole #bot_virtualhostname #udp_cmdbindip #udp_cmdspooftarget #admingame_password #db_sqlite3_file #bnet_holdfriends #bnet_holdclan ######################## # Actual Config Below # ######################## # the log file bot_log = # Show a message when a safe/admin/rootadmin/chieftain/shaman joins the channel bot_channeljoingreets = 1 # Admins will be able to delete only bans they've made bot_adminslimitedunban = 0 # Announce +1 and +2 (players left to join) in lobby (only if not autohosted) bot_lobbyannounceunoccupied = 1 # Auto set HCL based on game name,ex: -arso EU pros will set HCL to arso (only if map_defaulthcl is defined, for ex: map_defaulthcl = ar), will set hcl to empty if no mode is detected in the gamename bot_autohclfromgamename = 1 # whether players who use censored words are auto muted for x seconds bot_censormute = 1 # also auto mute admins bot_censormuteadmins = 0 # mute for x seconds, the first time a player curses bot_censormutefirstseconds = 60 # mute for x seconds, the second time a player curses bot_censormutesecondseconds = 180 # mute for x seconds, if a player has cursed for 3 or more times bot_censormuteexcessiveseconds = 360 lan_war3version = 24 # Disable nagle algorithm (TCPIP algorithm that can slow down the network) - may improve latency if you set to 1 tcp_nodelay = 0 # Path to your WC3TVRecorder ex: c:\Program Files\waaaghTV Recorder\ wtv_path = C:\Program Files\WaaaghTV Recorder\ # Use WC3TVRecorder, 1 to enable wtv_enabled = 0 # WaaaghTV Observer Name wtv_playername = Waaagh!TV # for ex: RO, only these countries will be allowed to join a game bot_allowedcountries = # for ex: BR, these countries will not be allowed to join a game bot_deniedcountries = # milliseconds to wait before sending medium sized packets to bnet when using PVPGN bot_bnetpacketdelaymediumpvpgn = 2000 # milliseconds to wait before sending big sized packets to bnet when using PVPGN bot_bnetpacketdelaybigpvpgn = 2500 # milliseconds to wait before sending medium sized packets to bnet (official) bot_bnetpacketdelaymedium = 3200 # milliseconds to wait before sending big sized packets to bnet (official) bot_bnetpacketdelaybig = 4000 # Allowed variables: totgames, kills, deaths, assists, creepkills, creepdenies, neutralkills, # towerkills, raxkills, courierkills, wins, losses, killstotal, deathstotal, creepkillstotal, # creepdeniestotal,assiststotal, neutralkillstotal, towerkillstotal, raxkillstotal, courierkillstotal # default formula: # (((wins-losses)/totgames)+(kills-deaths+assists/2)+(creepkills/100+creepdenies/10+neutralkills/50)+(raxkills/6)+(towerkills/11)) # alternative formula: # (((kills-deaths+assists0.7)0.6+towerkills0.8+raxkills+creepkills0.02+creepdenies0.08+neutralkills0.03+courierkills0.04)0.5+(wins/totgames2)+(totgames0.002)) bot_scoreformula = (((wins-losses)/totgames)+(kills-deaths+assists/2)+(creepkills/100+creepdenies/10+neutralkills/50)+(raxkills/6)+(towerkills/11)) # Only players having played this many number of games will be ranked bot_scoremingames = 5 # default access for owners (use admin access panel to change any admin's access to your liking and see the access code for those commands) bot_owneraccess = 3957 # default access for admins bot_adminaccess = 6143 # gamestate for inhouse games bot_gamestateinhouse = 999 # will only auto ban if team diff <= with the setting bot_autobanteamdiffmax = 0 # Only ban players who leave prior to x minutes of game end time. bot_autobangameendmins = 3 bot_autobantimer = 15 bot_autobanall = 1 bot_autobanfirstxleavers = 0 # the bot will auto rehost the game as gamename + 1 if 60 seconds have passed since last player joined, 0 = disable bot_autorehostdelay = 50 # the bot will auto rehost the game as gamename + 1 if game name is taken bot_rehostifnametaken = 0 # if host counter goes over this number it will reset to 1, set to 0 to disable the feature bot_maxhostcounter = 30 # these words will be edited/censored in game. bot_censorwords = fuck idiot retarded dick cunt pussy asshole suck shit penis vagina ïèçä ïèçäåö õóé õóèñîñ ïèçä ïèçäà áëÿòü ñóêà ìóä ìóäàê ïèäà ïèäàð ïèäàðàñ òóïîé åáà åáàë åáàíàò åáàëî ó¸á ó¸áîê ó¸áèùå ðàñïèçäåëñÿ # load in game feature will be enabled for every map (if set to 1) bot_forceloadingame = 1 # After a game has ended, if mysql is used, ghost will run update_dota_elo.exe (use either this or score not both!) bot_updatedotaeloaftergame = 0 # After a game has ended, if mysql is used, ghost will recalculate scores (use either this or elo not both!) bot_updatedotascoreaftergame = 0 # set to 1 if you are using warcraft 3 patch 1.23 or newer bot_patch23ornewer = 1 # set to 1 if you are using warcraft 3 patch 1.21 bot_patch21 = 0 # show .sd of anyone who enters the lobby (and has played games with the bot before) bot_showscoresonjoin = 1 # setting bot_autohostmaximumgames > 0 will make ghost begin autohosting on startup bot_autohostmaximumgames = 0 bot_autohostautostartplayers = 10 bot_autohostallowstart = 0 bot_autohostlocal = 0 bot_autohostowner = -sdso by Drago :D bot_autohostmapcfg = Dota 6.65.cfg bot_autohostgamename = -sdso by Drago :D # If you autohost a even playered two team map and want to auto ban leavers that make the game uneven turn this on. Will not ban admins or root admins. An example map would be DotA or Battleships. # 0 = off 1 = on bot_autoban = 1 # set to 1 if you want LAN players to be considered admins bot_lanadmins = 0 # set to 1 if you want local players (GArena) to be considered admins bot_localadmins = 0 # the language file bot_language = language.cfg # the path to your local Warcraft III directory # this path must contain war3.exe, storm.dll, and game.dll # this path must end in your system's path seperator (i.e. "\" on Windows or "/" on Linux) # if this path contains War3Patch.mpq the bot will attempt to extract "Scripts\common.j" and "Scripts\blizzard.j" on startup and write them to bot_mapcfgpath (which is defined later in this file) # common.j and blizzard.j are only required for automatically calculating map_crc, you do not need them if your map config files already contain map_crc bot_war3path = C:\StrongDC++\Warcraft III - Frozen Throne 3\ # the port GHost++ will host battle.net games on (this must be different from your admingame_port) bot_hostport = 6113 # maximum number of games to host at once bot_maxgames = 5 # command trigger for ingame only (battle.net command triggers are defined later) bot_commandtrigger = @ # the path to the directory where you keep your map config files (must end in your system's path seperator) # this directory can also contain common.j and blizzard.j (extracted from War3Patch.mpq) # common.j and blizzard.j are only required for automatically calculating map_crc, you do not need them if your map config files already contain map_crc bot_mapcfgpath = mapcfgs\ # the path to the directory where you keep your savegame files (must end in your system's path seperator) bot_savegamepath = savegames\ # the path to the directory where you keep your map files (must end in your system's path seperator) # GHost++ doesn't require map files but if it has access to them it can send them to players and automatically calculate most map config values # GHost++ will search [bot_mappath + map_localpath] for the map file (map_localpath is set in each map's config file) bot_mappath = C:\StrongDC++\Warcraft III - Frozen Throne 3\maps\download\ # whether to save replays or not bot_savereplays = 0 # the path to the directory where you want GHost++ to save replays (must end in your system's path seperator) bot_replaypath = replays\ ### the Warcraft 3 version to save replays as replay_war3version = 24 ### the Warcraft 3 build number to save replays as (this is specific to each Warcraft 3 version) ### patch 1.23: war3version 23, buildnumber 6058 ### patch 1.24: war3version 24, buildnumber 6059 ### patch 1.24b: war3version 24, buildnumber 6059 replay_buildnumber = 6059 ### whether to do automatic spoof checks or not ### you can always manually spoof check by whispering the bot (and in fact this is required before running admin commands) ### set to 0 to disable automatic spoof checks ### set to 1 to enable automatic spoof checks on all players ### set to 2 to enable automatic spoof checks on potential admins only bot_spoofchecks = 1 ### whether to require spoof checks or not ### this controls whether the bot will require players to spoof check before starting the game ### it does NOT control whether the bot will require players to spoof check before running admin commands - spoof checks are ALWAYS required for admin status ### if you require spoof checks, players will be kicked from the lobby if they haven't spoof checked within 20 seconds of joining (autohosted games only) bot_requirespoofchecks = 0 # whether to display game refresh messages by default # this can always be changed for a particular game with the !refresh command bot_refreshmessages = 0 # whether to automatically lock games when the owner joins bot_autolock = 0 # whether to automatically save games when a player disconnects # this can always be changed for a particular game with the !autosave command bot_autosave = 0 # whether to allow map downloads or not # set to 0 to disable map downloads # set to 1 to enable map downloads # set to 2 to enable conditional map downloads (an admin must start each map download with the !download or !dl command) bot_allowdownloads = 1 # whether to Uping players during map downloads or not # GHost++ will always stop pinging any players who are downloading the map # this config value determines whether GHost++ should stop pinging all players when at least one player is downloading the map bot_pingduringdownloads = 0 # kicked banned people when they enter the channel bot_kickbannedfromchannel = 1 # Ban banned people when they enter the channel bot_banbannedfromchannel = 0 # use LC style pings (divide actual pings by two) bot_lcpings = 1 # auto kick players with ping higher than this bot_autokickping = 250 # the game latency # this can always be changed for a particular game with the !latency command (which enforces a minimum of 50 and a maximum of 500) bot_latency = 100 # the maximum number of packets a player is allowed to get out of sync by before starting the lag screen # before version 8.0 GHost++ did not have a lag screen which is the same as setting this to a very high number # this can always be changed for a particular game with the !synclimit command (which enforces a minimum of 10 and a maximum of 10000) bot_synclimit = 90 # whether votekicks are allowed or not bot_votekickallowed = 1 # the percentage of players required to vote yes for a votekick to pass # the player starting the votekick is assumed to have voted yes and the player the votekick is started against is assumed to have voted no # the formula for calculating the number of votes needed is votes_needed = ceil( ( num_players - 1 ) * bot_votekickpercentage / 100 ) # this means it will round UP the number of votes required # if you set it to 100 it will require 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10, 10/11, and 11/12 votes to pass # if you set it to 90 it will require 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10, 9/11, and 10/12 votes to pass # if you set it to 80 it will require 2/3, 3/4, 4/5, 4/6, 5/7, 6/8, 7/9, 8/10, 8/11, and 9/12 votes to pass # if you set it to 70 it will require 2/3, 3/4, 3/5, 4/6, 5/7, 5/8, 6/9, 7/10, 7/11, and 8/12 votes to pass # if you set it to 60 it will require 2/3, 2/4, 3/5, 3/6, 4/7, 5/8, 5/9, 6/10, 6/11, and 7/12 votes to pass bot_votekickpercentage = 100 # Just before a game is hosted the creator is added to the bots friends list and removed soon after bot_addcreatorasfriendonhost = 0 # lobby/game commands are displayed as chat (or hidden) bot_relaychatcommands = 1 # display information on current downloads (speed, ETA) bot_showdownloadsinfo = 1 # interval in seconds between download info message bot_showdownloadsinfotime = 5 # maximum players allowed to download at once, the rest will have almost KB/s until someone finishes downloading bot_maxdownloaders = 3 # set total download speed (KB/s) available for all clients at once, if set to 1024, 4 people will get 256 each bot_totaldownloadspeed = 1536 # set max download speed (KB/s) available for one client bot_clientdownloadspeed = 1024 # initiate game over timer if remaining players are less than this number (and at least a player left) - 0 to disable bot_gameoverminplayers = 0 # initiate game over timer if remaining player percentage is less than this number (and at least a player left) - 0 to disable bot_gameoverminpercent = 0 # initiate game over timer if team difference is bigger than this number, 0 - to disable bot_gameovermaxteamdifference = 0 # redirect console output to udp bot_udpconsole = 1 # whether to automatically add the players from last game to the next game's reserved list bot_holdplayersforrmk = 1 # non admin commands, 1 enable, 0 disable bot_nonadmincommands = 1 # root admins are required to spoof check if 1, or not if 0 bot_rootadminsspoofcheck = 0 # admins are required to spoof check if 1, or not if 0 bot_adminsspoofcheck = 0 # banned players will be notified with a whisper. bot_notifybannedplayers = 1 # ghost will find its external ip on startup, disable if you want to play on LAN only bot_findexternalip = 1 # specify your external ip here if you don't want ghost to auto find it. bot_externalip = # use alternative site for external ip finding (if you experience lag (30s) on ghost startup) bot_altfindip = 0 # bot's additional rootadmins separated by space ex: userone usertwo userthree bot_rootadmins = # bot's UDP password bot_udppassword = # show autokick denied country or banned player messages bot_verbose = 0 # bot's virtual host name bot_virtualhostname = \|cFF00FF00A I # ignore drop request for the first x seconds of lagging. bot_dropvotetime = 30 # Time limit for hosting a game where no admins enter it bot_lobbytimelimit = 10 # udp ip udp_cmdbindip = 0.0.0.0 # udp port udp_cmdport = 6969 # udp spoof target udp_cmdspooftarget = ############################ # ADMIN GAME CONFIGURATION # ############################ # whether to create the admin game or not (see readme.txt for more information) admingame_create = 0 # the port GHost++ will host the admin game on (this must be different from your bot_hostport) admingame_port = 6114 # the admin game password admingame_password = ########################## # DATABASE CONFIGURATION # ########################## # database type # use "sqlite3" for a local SQLite database # use "mysql" for any MySQL database db_type = sqlite3 # sqlite3 database file db_sqlite3_file = ghost.dbs # this is only used if your database type is MySQL db_mysql_server = db_mysql_database = db_mysql_user = db_mysql_password = db_mysql_port = ############################ # BATTLE.NET CONFIGURATION # ############################ # which battle.net server to connect to # 1.) useast.battle.net # 2.) uswest.battle.net # 3.) asia.battle.net # 4.) europe.battle.net # note that each banned player is tied to the realm it was created on and the realm is case sensitive # so if you change your realm from useast.battle.net to USEAST.BATTLE.NET it'll still connect but anyone previously banned will not be counted as banned until you change it back bnet_server = playground.ru # your Warcraft III: Reign of Chaos CD key bnet_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # your Warcraft III: The Frozen Throne CD key bnet_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # your battle.net username bnet_username = MugenNoSoro # your battle.net password bnet_password = XXXXXXX # the first channel to join upon entering battle.net bnet_firstchannel = Clan AniC # the root admin on this battle.net server only bnet_rootadmin = [Ani-C]Akito # command trigger for this battle.net server only bnet_commandtrigger = @ # whether to automatically add your friends list to each game's reserved list bnet_holdfriends = 1 # whether to automatically add your clan members list to each game's reserved list bnet_holdclan = 1 # you will need to edit this section of the config file if you're connecting to a PVPGN server # your PVPGN server operator will tell you what to put here bnet_custom_war3version = 24 bnet_custom_exeversion = bnet_custom_exeversionhash = bnet_custom_passwordhashtype = pvpgn ### # BNLS Settings ### bnet_bnlsserver = bnet_bnlsport = 9367 bnet_bnlswardencookie = 1 ### # example configuration for connecting to a official battle.net server (second server) ### # bnet2_server = uswest.battle.net # bnet2_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet2_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet2_username = # bnet2_password = # bnet2_firstchannel = The Void # bnet2_rootadmin = # bnet2_commandtrigger = ! # bnet2_holdfriends = 1 # bnet2_holdclan = 1 ### # example configuration for connecting to a PVPGN battle.net (third server) ### # bnet3_server = pvpgn.boredaussie.com # bnet3_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet3_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet3_username = # bnet3_password = # bnet3_firstchannel = The Void # bnet3_rootadmin = # bnet3_commandtrigger = ! # bnet3_holdfriends = 1 # bnet3_holdclan = 1 # bnet3_custom_war3version = 22 # bnet3_custom_exeversion = 184 0 22 1 # bnet3_custom_exeversionhash = 219 152 153 144 # bnet3_custom_passwordhashtype = pvpgn Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü Array; 21.11.2010 â 21:52. Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 22:10 #146 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Êîíôèã â ïîðÿäêå. Êàê âàðèàíò ìîãóò áûòü ïîðòû çàíÿòû. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 22:55 #147 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Ñ ïîðòàìè âñå ãóä ÿ õîñòþ ñ áîòà íî èíîãäà áîò îòðóáàåöà îò áàòëà è âûäàåò åòî ñîîáùåíèå è åñüëå ÿ âûéäó ñ âàðèêà òî íåñêîëüêî ÷åñîâ íå ìîãó çàéòè ïîêà åòà îøèáêà ñàìà ñîáîé íå ïðîéäåò( Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 23:06 #148 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Â îáùåì òî ðàáîòàåò íîðì? ß äóìàþ ýòî èç-çà ÏÃ. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 23:28 #149 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Öèòàòà: Ñîîáùåíèå îò Array Ïîñìîòðåòü ñîîáùåíèå Â îáùåì òî ðàáîòàåò íîðì? ß äóìàþ ýòî èç-çà ÏÃ. íó íå çíàþ íàøüåò ïã íî ó íåêîòîðûõ åòîò ãëþê åñòü ó íåêîòîðûõ áîò ðàáîòàåò êàê ÷åñû( __________________ Åñüëè æèçüíü òåáÿ åá¸ò, çíà÷èò ó íå¸ âñòà¸ò,çíà÷èò òû åé íðàâèøñÿ,òàê ÷åãî òû ïàðèøñÿ!? Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 24.11.2010, 22:57 #150 Àâàòàð äëÿ Csandr Ó÷àñòíèê Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Âñåì ïðèâåò! Ïîìîãèòå ïëç... ó ìåíÿ òàêàÿ òåìà: ÿ ïðîáîâàë çàâåñòè GhostOne íà ñåðâåð...îáëîìàëñÿ, íó ëàí çàáèë - òåðü âàùå â áàòëó íå ìîãó çàéòè... ×èòàë âûøå êàê ïðîâåðèòü ïîðò...è íèôèãà ïèøó â "Âûïîëíèòü": ipconfig è netstat îí îòêðûâàåò îêíî è ðåçêî åãî ñâîðà÷èâàåò íåèçâåñòíî êóäà.... Êàê ìíå áûòü? ×òîá ýëåìåíòàðíî çàéòè â áàòëó. Ïîìîãèòå ïëç...... Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü Csandr; 24.11.2010 â 22:58. Ïðè÷èíà: îðôîãðàôè÷åñêèå îøèáêè Csandr âíå ôîðóìà Îòïðàâèòü ñîîáùåíèå äëÿ Csandr ñ ïîìîùüþ Skype™ Îòâåòèòü ñ öèòèðîâàíèåì Îòâåò Ìåòêè 1.7.266, alkar, battle.net, dota, garena, ghost++, ghostone, mapcfg, playground, rubattle, àòàòà, áîò, äîòà, êîíôèã, íàñòðîéêà, ñêà÷àòü, óñòàíîâêà Çäåñü ïðèñóòñòâóþò: 1 (ïîëüçîâàòåëåé: 0 , ãîñòåé: 1) Îïöèè òåìû Âàøè ïðàâà â ðàçäåëå Âû íå ìîæåòå ñîçäàâàòü íîâûå òåìû Âû íå ìîæåòå îòâå÷àòü â òåìàõ Âû íå ìîæåòå ïðèêðåïëÿòü âëîæåíèÿ Âû íå ìîæåòå ðåäàêòèðîâàòü ñâîè ñîîáùåíèÿ BB êîäû Âêë. Ñìàéëû Âêë. [IMG] êîä Âêë. HTML êîä Âûêë. Áûñòðûé ïåðåõîä Ïîõîæèå òåìû Òåìà Àâòîð Ðàçäåë Îòâåòîâ Ïîñëåäíåå ñîîáùåíèå Ñêà÷àòü Aion-Unique (1120) Ðåâèçèþ. montenegro Ñåðâåðíàÿ ÷àñòü 41 17.02.2010 20:28 apache ãäå ñêà÷àòü GiDD Äâèæêè ñàéòîâ (CMS) 8 16.08.2009 22:38 ãäå ñêà÷àòü ãåîäàòó äëÿ... GiDD Ðàáîòà ñ ãåîäàòîé 0 12.08.2009 13:48 © 2007–2024 «Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ» Çàùèòà ñàéòà îò DDoS àòàê — StormWall Ðàáîòàåò íà Áóëêå íåèçâåñòíîé âåðñèè ñ ïåðåâîäîì îò zCarot Òåêóùåå âðåìÿ: 19:38. ×àñîâîé ïîÿñ GMT +3. Ââåðõ	{ "url": "https://forum.zone-game.info/showthread.php?t=7323&page=15", "source_domain": "forum.zone-game.info", "snapshot_id": "CC-MAIN-2024-18", "warc_metadata": { "Content-Length": "119771", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PIVLEQ4AOXH3IY46IS3HJSV4BDPE44UC", "WARC-Concurrent-To": "<urn:uuid:1ee73381-567f-4347-8d1f-445ed8250dc8>", "WARC-Date": "2024-04-15T16:38:45Z", "WARC-IP-Address": "185.71.67.65", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:S3PAJRIDUL7ERLHXCX5KAIJC4P5OO7GJ", "WARC-Record-ID": "<urn:uuid:82c0343d-d6b8-4d32-abc8-7249039dabbc>", "WARC-Target-URI": "https://forum.zone-game.info/showthread.php?t=7323&page=15", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f4351229-62f2-4241-9990-55b5a330f0b1>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-192\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, 109, 180, 252, 352, 353, 506, 533, 534, 540, 551, 588, 605, 616, 617, 702, 703, 726, 772, 777, 813, 857, 898, 935, 948, 949, 1020, 1021, 1029, 1067, 1103, 1146, 1147, 1172, 1206, 1207, 1291, 1330, 1367, 1387, 1400, 1401, 1472, 1473, 1530, 1798, 1853, 1897, 1934, 1951, 1962, 1963, 2048, 2049, 2074, 2115, 2152, 2172, 2185, 2186, 2257, 2258, 2263, 2271, 2331, 2391, 2451, 2528, 2544, 2545, 2631, 2658, 2659, 2753, 2789, 2790, 2858, 2885, 2886, 2979, 3010, 3011, 3087, 3117, 3118, 3173, 3195, 3196, 3260, 3295, 3296, 3370, 3402, 3403, 3479, 3520, 3521, 3583, 3623, 3624, 3696, 3722, 3723, 3771, 3792, 3793, 3854, 3874, 3875, 3964, 3997, 3998, 4046, 4073, 4074, 4123, 4147, 4148, 4214, 4245, 4246, 4296, 4323, 4324, 4400, 4417, 4418, 4485, 4513, 4514, 4630, 4659, 4660, 4730, 4762, 4763, 4847, 4878, 4879, 4943, 4975, 4976, 5040, 5062, 5063, 5132, 5154, 5155, 5218, 5236, 5237, 5258, 5287, 5288, 5343, 5365, 5366, 5427, 5454, 5455, 5503, 5530, 5531, 5575, 5605, 5606, 5647, 5668, 5669, 5744, 5762, 5763, 5843, 5875, 5876, 5911, 5936, 5937, 5988, 6013, 6014, 6065, 6092, 6093, 6124, 6125, 6157, 6158, 6234, 6253, 6254, 6372, 6398, 6399, 6443, 6457, 6473, 6491, 6508, 6529, 6543, 6557, 6577, 6602, 6615, 6633, 6646, 6661, 6682, 6706, 6722, 6743, 6758, 6778, 6798, 6815, 6833, 6848, 6849, 6874, 6899, 6924, 6925, 6940, 6951, 6952, 7032, 7058, 7113, 7140, 7141, 7219, 7251, 7252, 7452, 7480, 7481, 7551, 7570, 7594, 7619, 7672, 7704, 7758, 7792, 7857, 7894, 7895, 7916, 7917, 8030, 8046, 8047, 8116, 8163, 8196, 8212, 8237, 8264, 8265, 8331, 8355, 8420, 8443, 8444, 8528, 8566, 8647, 8682, 8760, 8793, 8868, 8898, 8899, 8900, 8995, 9090, 9192, 9212, 9343, 9366, 9535, 9536, 9684, 9685, 9755, 9777, 9778, 9918, 9941, 9942, 9970, 9993, 9994, 10024, 10051, 10052, 10107, 10134, 10135, 10201, 10228, 10229, 10251, 10270, 10299, 10300, 10416, 10441, 10442, 10516, 10542, 10543, 10635, 10659, 10660, 10707, 10923, 10924, 10991, 11015, 11016, 11132, 11163, 11164, 11273, 11306, 11307, 11366, 11389, 11390, 11440, 11456, 11457, 11542, 11567, 11568, 11652, 11681, 11715, 11742, 11764, 11802, 11837, 11878, 11879, 12076, 12099, 12115, 12116, 12175, 12193, 12194, 12264, 12284, 12285, 12305, 12306, 12334, 12335, 12383, 12443, 12535, 12732, 12886, 12887, 12948, 12949, 13048, 13049, 13069, 13070, 13112, 13113, 13130, 13131, 13213, 13214, 13237, 13238, 13346, 13436, 13590, 13591, 13617, 13618, 13724, 13725, 13755, 13756, 13857, 14002, 14121, 14122, 14196, 14197, 14230, 14231, 14251, 14252, 14362, 14363, 14389, 14390, 14436, 14437, 14461, 14462, 14559, 14610, 14661, 14712, 14713, 14739, 14740, 14788, 14912, 14960, 15022, 15094, 15095, 15115, 15116, 15159, 15255, 15414, 15569, 15570, 15597, 15598, 15652, 15730, 15731, 15755, 15756, 15815, 15816, 15833, 15834, 15898, 15977, 15978, 15995, 15996, 16036, 16073, 16109, 16231, 16232, 16255, 16256, 16311, 16387, 16517, 16518, 16546, 16547, 16598, 16628, 16629, 16677, 16706, 16707, 16757, 16758, 16774, 16775, 16822, 16823, 16846, 16847, 16866, 16998, 16999, 17017, 17018, 17123, 17235, 17371, 17372, 17391, 17392, 17431, 17432, 17456, 17457, 17529, 17669, 17804, 17864, 17976, 18086, 18195, 18304, 18413, 18414, 18443, 18444, 18545, 18578, 18579, 18635, 18661, 18662, 18718, 18744, 18745, 18797, 18827, 18828, 18941, 18964, 18965, 19077, 19107, 19108, 19165, 19196, 19197, 19315, 19342, 19343, 19470, 19497, 19498, 19587, 19621, 19622, 19655, 19674, 19675, 19766, 19792, 19793, 19835, 19860, 19861, 19921, 19950, 19951, 20006, 20031, 20032, 20082, 20110, 20111, 20197, 20220, 20221, 20294, 20312, 20313, 20407, 20425, 20426, 20505, 20523, 20524, 20545, 20564, 20565, 20622, 20638, 20639, 20665, 20701, 20702, 20760, 20782, 20783, 20840, 20864, 20865, 20874, 20898, 20899, 20910, 20929, 20930, 20949, 20970, 20971, 21000, 21029, 21058, 21059, 21139, 21140, 21161, 21162, 21257, 21258, 21280, 21281, 21307, 21308, 21330, 21331, 21358, 21385, 21412, 21413, 21429, 21474, 21512, 21513, 21531, 21532, 21556, 21557, 21585, 21586, 21637, 21638, 21657, 21678, 21695, 21716, 21733, 21734, 21763, 21792, 21821, 21822, 21862, 21887, 21912, 21935, 21960, 22062, 22240, 22241, 22269, 22270, 22313, 22314, 22357, 22358, 22404, 22405, 22448, 22449, 22476, 22477, 22505, 22506, 22533, 22534, 22558, 22559, 22612, 22613, 22643, 22644, 22692, 22693, 22723, 22724, 22774, 22775, 22799, 22800, 22878, 22879, 22900, 22901, 22984, 22985, 23003, 23004, 23099, 23160, 23161, 23190, 23216, 23246, 23283, 23284, 23288, 23304, 23308, 23327, 23348, 23374, 23375, 23379, 23466, 23470, 23471, 23506, 23552, 23598, 23617, 23636, 23668, 23688, 23715, 23739, 23760, 23761, 23765, 23841, 23845, 23846, 23885, 23931, 23977, 23996, 24015, 24047, 24067, 24094, 24118, 24139, 24171, 24210, 24258, 24298, 24299, 24356, 24400, 24437, 24454, 24465, 24466, 24551, 24552, 24570, 24607, 24648, 24685, 24705, 24718, 24719, 24790, 24791, 24977, 25021, 25058, 25075, 25086, 25087, 25172, 25173, 25221, 25262, 25299, 25319, 25332, 25333, 25404, 25405, 25413, 25453, 25501, 25587, 25606, 25694, 25738, 25775, 25793, 25802, 25803, 25874, 25875, 26231, 26232, 26322, 26412, 26418, 26419, 26425, 26572, 26573, 26574, 26627, 26629, 26640, 26641, 26662, 26696, 26726, 26760, 26802, 26803, 26816, 26828, 26843, 26858, 26859, 26875, 26876, 26889, 26935, 27018, 27081, 27150, 27151, 27152, 27205, 27243, 27302, 27345, 27346 ], "line_end_idx": [ 109, 180, 252, 352, 353, 506, 533, 534, 540, 551, 588, 605, 616, 617, 702, 703, 726, 772, 777, 813, 857, 898, 935, 948, 949, 1020, 1021, 1029, 1067, 1103, 1146, 1147, 1172, 1206, 1207, 1291, 1330, 1367, 1387, 1400, 1401, 1472, 1473, 1530, 1798, 1853, 1897, 1934, 1951, 1962, 1963, 2048, 2049, 2074, 2115, 2152, 2172, 2185, 2186, 2257, 2258, 2263, 2271, 2331, 2391, 2451, 2528, 2544, 2545, 2631, 2658, 2659, 2753, 2789, 2790, 2858, 2885, 2886, 2979, 3010, 3011, 3087, 3117, 3118, 3173, 3195, 3196, 3260, 3295, 3296, 3370, 3402, 3403, 3479, 3520, 3521, 3583, 3623, 3624, 3696, 3722, 3723, 3771, 3792, 3793, 3854, 3874, 3875, 3964, 3997, 3998, 4046, 4073, 4074, 4123, 4147, 4148, 4214, 4245, 4246, 4296, 4323, 4324, 4400, 4417, 4418, 4485, 4513, 4514, 4630, 4659, 4660, 4730, 4762, 4763, 4847, 4878, 4879, 4943, 4975, 4976, 5040, 5062, 5063, 5132, 5154, 5155, 5218, 5236, 5237, 5258, 5287, 5288, 5343, 5365, 5366, 5427, 5454, 5455, 5503, 5530, 5531, 5575, 5605, 5606, 5647, 5668, 5669, 5744, 5762, 5763, 5843, 5875, 5876, 5911, 5936, 5937, 5988, 6013, 6014, 6065, 6092, 6093, 6124, 6125, 6157, 6158, 6234, 6253, 6254, 6372, 6398, 6399, 6443, 6457, 6473, 6491, 6508, 6529, 6543, 6557, 6577, 6602, 6615, 6633, 6646, 6661, 6682, 6706, 6722, 6743, 6758, 6778, 6798, 6815, 6833, 6848, 6849, 6874, 6899, 6924, 6925, 6940, 6951, 6952, 7032, 7058, 7113, 7140, 7141, 7219, 7251, 7252, 7452, 7480, 7481, 7551, 7570, 7594, 7619, 7672, 7704, 7758, 7792, 7857, 7894, 7895, 7916, 7917, 8030, 8046, 8047, 8116, 8163, 8196, 8212, 8237, 8264, 8265, 8331, 8355, 8420, 8443, 8444, 8528, 8566, 8647, 8682, 8760, 8793, 8868, 8898, 8899, 8900, 8995, 9090, 9192, 9212, 9343, 9366, 9535, 9536, 9684, 9685, 9755, 9777, 9778, 9918, 9941, 9942, 9970, 9993, 9994, 10024, 10051, 10052, 10107, 10134, 10135, 10201, 10228, 10229, 10251, 10270, 10299, 10300, 10416, 10441, 10442, 10516, 10542, 10543, 10635, 10659, 10660, 10707, 10923, 10924, 10991, 11015, 11016, 11132, 11163, 11164, 11273, 11306, 11307, 11366, 11389, 11390, 11440, 11456, 11457, 11542, 11567, 11568, 11652, 11681, 11715, 11742, 11764, 11802, 11837, 11878, 11879, 12076, 12099, 12115, 12116, 12175, 12193, 12194, 12264, 12284, 12285, 12305, 12306, 12334, 12335, 12383, 12443, 12535, 12732, 12886, 12887, 12948, 12949, 13048, 13049, 13069, 13070, 13112, 13113, 13130, 13131, 13213, 13214, 13237, 13238, 13346, 13436, 13590, 13591, 13617, 13618, 13724, 13725, 13755, 13756, 13857, 14002, 14121, 14122, 14196, 14197, 14230, 14231, 14251, 14252, 14362, 14363, 14389, 14390, 14436, 14437, 14461, 14462, 14559, 14610, 14661, 14712, 14713, 14739, 14740, 14788, 14912, 14960, 15022, 15094, 15095, 15115, 15116, 15159, 15255, 15414, 15569, 15570, 15597, 15598, 15652, 15730, 15731, 15755, 15756, 15815, 15816, 15833, 15834, 15898, 15977, 15978, 15995, 15996, 16036, 16073, 16109, 16231, 16232, 16255, 16256, 16311, 16387, 16517, 16518, 16546, 16547, 16598, 16628, 16629, 16677, 16706, 16707, 16757, 16758, 16774, 16775, 16822, 16823, 16846, 16847, 16866, 16998, 16999, 17017, 17018, 17123, 17235, 17371, 17372, 17391, 17392, 17431, 17432, 17456, 17457, 17529, 17669, 17804, 17864, 17976, 18086, 18195, 18304, 18413, 18414, 18443, 18444, 18545, 18578, 18579, 18635, 18661, 18662, 18718, 18744, 18745, 18797, 18827, 18828, 18941, 18964, 18965, 19077, 19107, 19108, 19165, 19196, 19197, 19315, 19342, 19343, 19470, 19497, 19498, 19587, 19621, 19622, 19655, 19674, 19675, 19766, 19792, 19793, 19835, 19860, 19861, 19921, 19950, 19951, 20006, 20031, 20032, 20082, 20110, 20111, 20197, 20220, 20221, 20294, 20312, 20313, 20407, 20425, 20426, 20505, 20523, 20524, 20545, 20564, 20565, 20622, 20638, 20639, 20665, 20701, 20702, 20760, 20782, 20783, 20840, 20864, 20865, 20874, 20898, 20899, 20910, 20929, 20930, 20949, 20970, 20971, 21000, 21029, 21058, 21059, 21139, 21140, 21161, 21162, 21257, 21258, 21280, 21281, 21307, 21308, 21330, 21331, 21358, 21385, 21412, 21413, 21429, 21474, 21512, 21513, 21531, 21532, 21556, 21557, 21585, 21586, 21637, 21638, 21657, 21678, 21695, 21716, 21733, 21734, 21763, 21792, 21821, 21822, 21862, 21887, 21912, 21935, 21960, 22062, 22240, 22241, 22269, 22270, 22313, 22314, 22357, 22358, 22404, 22405, 22448, 22449, 22476, 22477, 22505, 22506, 22533, 22534, 22558, 22559, 22612, 22613, 22643, 22644, 22692, 22693, 22723, 22724, 22774, 22775, 22799, 22800, 22878, 22879, 22900, 22901, 22984, 22985, 23003, 23004, 23099, 23160, 23161, 23190, 23216, 23246, 23283, 23284, 23288, 23304, 23308, 23327, 23348, 23374, 23375, 23379, 23466, 23470, 23471, 23506, 23552, 23598, 23617, 23636, 23668, 23688, 23715, 23739, 23760, 23761, 23765, 23841, 23845, 23846, 23885, 23931, 23977, 23996, 24015, 24047, 24067, 24094, 24118, 24139, 24171, 24210, 24258, 24298, 24299, 24356, 24400, 24437, 24454, 24465, 24466, 24551, 24552, 24570, 24607, 24648, 24685, 24705, 24718, 24719, 24790, 24791, 24977, 25021, 25058, 25075, 25086, 25087, 25172, 25173, 25221, 25262, 25299, 25319, 25332, 25333, 25404, 25405, 25413, 25453, 25501, 25587, 25606, 25694, 25738, 25775, 25793, 25802, 25803, 25874, 25875, 26231, 26232, 26322, 26412, 26418, 26419, 26425, 26572, 26573, 26574, 26627, 26629, 26640, 26641, 26662, 26696, 26726, 26760, 26802, 26803, 26816, 26828, 26843, 26858, 26859, 26875, 26876, 26889, 26935, 27018, 27081, 27150, 27151, 27152, 27205, 27243, 27302, 27345, 27346, 27351 ] }	{ "red_pajama_v2": { "ccnet_original_length": 27351, "ccnet_original_nlines": 803, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 9, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2122546285390854, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.018712159246206284, "rps_doc_frac_lines_end_with_ellipsis": 0.0012437800178304315, "rps_doc_frac_no_alph_words": 0.46486884355545044, "rps_doc_frac_unique_words": 0.34343433380126953, "rps_doc_mean_word_length": 6.386841297149658, "rps_doc_num_sentences": 204, "rps_doc_symbol_to_word_ratio": 0.13080169260501862, "rps_doc_unigram_entropy": 6.295562267303467, "rps_doc_word_count": 3663, "rps_doc_frac_chars_dupe_10grams": 0.12374439090490341, "rps_doc_frac_chars_dupe_5grams": 0.23056209087371826, "rps_doc_frac_chars_dupe_6grams": 0.2113272100687027, "rps_doc_frac_chars_dupe_7grams": 0.19679419696331024, "rps_doc_frac_chars_dupe_8grams": 0.16807009279727936, "rps_doc_frac_chars_dupe_9grams": 0.13190853595733643, "rps_doc_frac_chars_top_2gram": 0.004060700070112944, "rps_doc_frac_chars_top_3gram": 0.012224829755723476, "rps_doc_frac_chars_top_4gram": 0.021628549322485924, "rps_doc_books_importance": -2740.73583984375, "rps_doc_books_importance_length_correction": -2740.73583984375, "rps_doc_openwebtext_importance": -1761.724365234375, "rps_doc_openwebtext_importance_length_correction": -1761.724365234375, "rps_doc_wikipedia_importance": -1347.2979736328125, "rps_doc_wikipedia_importance_length_correction": -1347.2979736328125 }, "fasttext": { "dclm": 0.6260858178138733, "english": 0.6379491686820984, "fineweb_edu_approx": 2.3658509254455566, "eai_general_math": 0.9487723112106323, "eai_open_web_math": 0.214868426322937, "eai_web_code": 0.9775742888450623 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "1", "label": "Leftover HTML" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
4,888,997,956,461,977,000	Functions in C with Examples This Tutorial Explains Functions in C with Example(s). What is Function in C? A function is a block of code that performs a specific task. Functions are often used to perform similar tasks on different data sets. There are two types of functions in C, user-defined functions and library functions. • User-defined functions are the functions which are written by the user and included in the program. • Library functions are the inbuilt functions which are already present in the C library (like printf(), scanf() etc). General Syntax of a C Function: type function_name(formal_arguments) /* function definition header / { statements; /function body/ return statement; } Like variables, every function also has a type, meaning that what type of value function returns to its calling function. For example, if function returns an integer, it is of type int; if it returns a float, it is of type float; and so on. Remember that if a function returns nothing to its calling function, its type is void. The function name should be descriptive, stating clearly what the specific task function does. The function name is followed by a pair of parenthesis, within which specify a comma separated list of arguments with their number and types in the order corresponding to arguments from its calling function, and use void if the function does not take any arguments. The function header contains the function type, function name, and any arguments in parenthesis. The function header is immediately followed by a pair of braces containing instructions on how the function performs a specific task. advertisement advertisement Let’s look at an example now. #include <stdio.h> void display(void); / function declaration / int main(void) { printf("main: going to call display...\n"); display(); / call to display() / return 0; } void display(void) { printf("i am display(): I display massage!\n"); return; } When a function returns nothing i.e. function is of type void, we can use return statement as ‘return;’ i.e. return keyword is not followed by any value. Let’s take one more example, Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now! / sum2ints.c -- program sums up two integers / #include <stdio.h> int sum2ints(int, int); / declaration or function prototype / int main(void) { int u = 5, v = 10; printf("sum of %d and %d is %d\n", u, v, sum2ints(u, v)); return 0; } / sum2ints() sums up two integers and returns their sum to calling fun. / int sum2ints(int x, int y) / x, y are formal arguments */ { return x + y; } Here’s output, sum of 5 and 10 is 15 In the above program, function sum2ints() takes two integers, sum them up and return their sum to calling function to be displayed to the user. advertisement Example 2: One of the most basic function types is the mathematical function. These functions take one or more numeric arguments and perform a calculation on them, returning a numeric result. For example, the sqrt() function takes a single argument (the number to be square-rooted) and returns its square root: #include <stdio.h> #include <math.h> int main(void) { double num = 25; double root = sqrt(num); //root will be 5.0 printf("The square root of %f is %f\n", num, root); return 0; } Output: The square root of 25.000000 is 5.000000 Another common type of function in C is string function. These functions operate on null-terminated strings (arrays of characters) and usually take two arguments: the first is the string to be operated on, and the second is an integer specifying the maximum length of the resulting string (including the null terminator). advertisement Advantage of Functions in C: • Functions can be written once and then reused in other parts of the program without having to be rewritten. This makes code more reliable and easier to read and maintain. • Functions can make code more modular. Modular code is easier to understand and debug because it is divided into smaller, more manageable pieces. • Functions can promote code reuse and portability. Code that is written in a modular fashion using functions can be easily reused in other programs or ported to other platforms with minimal changes. • It will improve the quality and performance by reducing the amount of code that needs to be executed. Sanfoundry Global Education & Learning Series – 1000 C Tutorials. If you wish to look at all C Tutorials, go to C Tutorials. If you find any mistake above, kindly email to [email protected] advertisement advertisement Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs! Youtube \| Telegram \| LinkedIn \| Instagram \| Facebook \| Twitter \| Pinterest Manish Bhojasia - Founder & CTO at Sanfoundry Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn. Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.	{ "url": "https://www.sanfoundry.com/c-tutorials-different-components-function/", "source_domain": "www.sanfoundry.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "174192", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:H2PKZDYXFQXAYOUPBQXV2AOBAF6TFVBM", "WARC-Concurrent-To": "<urn:uuid:91a25e92-6fec-497f-95ff-a03e663a626e>", "WARC-Date": "2024-05-22T21:11:12Z", "WARC-IP-Address": "104.26.13.15", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3LZHP6EP6IMT63G2KTZQVVATH5NZHZIU", "WARC-Record-ID": "<urn:uuid:09019127-877b-4434-84b4-1a3ec12337bd>", "WARC-Target-URI": "https://www.sanfoundry.com/c-tutorials-different-components-function/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a1b423b0-ac42-4713-83ce-3fba1d2efb8d>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 29, 30, 85, 86, 109, 329, 330, 434, 555, 556, 588, 589, 659, 661, 696, 718, 720, 721, 1049, 1050, 1411, 1412, 1643, 1644, 1658, 1672, 1673, 1703, 1704, 1723, 1770, 1772, 1787, 1789, 1837, 1876, 1890, 1892, 1894, 1913, 1915, 1967, 1979, 1981, 1982, 2136, 2137, 2166, 2167, 2254, 2303, 2322, 2386, 2388, 2403, 2405, 2428, 2430, 2492, 2506, 2508, 2510, 2586, 2645, 2647, 2665, 2667, 2668, 2683, 2684, 2706, 2707, 2851, 2852, 2866, 2867, 2878, 2879, 3179, 3180, 3199, 3217, 3219, 3234, 3236, 3257, 3305, 3307, 3363, 3365, 3379, 3381, 3382, 3390, 3431, 3432, 3754, 3755, 3769, 3770, 3799, 3800, 3975, 4124, 4326, 4432, 4433, 4499, 4500, 4559, 4560, 4625, 4626, 4640, 4654, 4885, 4886, 4961, 5007, 5275, 5276 ], "line_end_idx": [ 29, 30, 85, 86, 109, 329, 330, 434, 555, 556, 588, 589, 659, 661, 696, 718, 720, 721, 1049, 1050, 1411, 1412, 1643, 1644, 1658, 1672, 1673, 1703, 1704, 1723, 1770, 1772, 1787, 1789, 1837, 1876, 1890, 1892, 1894, 1913, 1915, 1967, 1979, 1981, 1982, 2136, 2137, 2166, 2167, 2254, 2303, 2322, 2386, 2388, 2403, 2405, 2428, 2430, 2492, 2506, 2508, 2510, 2586, 2645, 2647, 2665, 2667, 2668, 2683, 2684, 2706, 2707, 2851, 2852, 2866, 2867, 2878, 2879, 3179, 3180, 3199, 3217, 3219, 3234, 3236, 3257, 3305, 3307, 3363, 3365, 3379, 3381, 3382, 3390, 3431, 3432, 3754, 3755, 3769, 3770, 3799, 3800, 3975, 4124, 4326, 4432, 4433, 4499, 4500, 4559, 4560, 4625, 4626, 4640, 4654, 4885, 4886, 4961, 5007, 5275, 5276, 5367 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5367, "ccnet_original_nlines": 121, "rps_doc_curly_bracket": 0.0022358899004757404, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3373052179813385, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015582029707729816, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24197983741760254, "rps_doc_frac_unique_words": 0.4117647111415863, "rps_doc_mean_word_length": 5.020833492279053, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0.004582949914038181, "rps_doc_unigram_entropy": 5.236551284790039, "rps_doc_word_count": 816, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02001463994383812, "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.018794240429997444, "rps_doc_frac_chars_top_3gram": 0.011715889908373356, "rps_doc_frac_chars_top_4gram": 0.007810589857399464, "rps_doc_books_importance": -442.90484619140625, "rps_doc_books_importance_length_correction": -442.90484619140625, "rps_doc_openwebtext_importance": -251.57586669921875, "rps_doc_openwebtext_importance_length_correction": -251.57586669921875, "rps_doc_wikipedia_importance": -185.34573364257812, "rps_doc_wikipedia_importance_length_correction": -185.34573364257812 }, "fasttext": { "dclm": 0.22651761770248413, "english": 0.8091177940368652, "fineweb_edu_approx": 3.0704336166381836, "eai_general_math": 0.9479419589042664, "eai_open_web_math": 0.44276565313339233, "eai_web_code": 0.7486720085144043 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1332", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "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": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
2,105,154,617,999,289,000	• Home • / • Blog • / • Lifestyle • / • How Cybersecurity Measures Protect Your Data on Online Dating Sites Published on February 8, 2024 How Cybersecurity Measures Protect Your Data on Online Dating Sites In an era where online interactions shape our social landscape, online dating sites have become integral platforms for meeting potential partners. As the digital romance landscape expands, the importance of cybersecurity measures cannot be overstated. This deep dive explores the ways in which top dating websites prioritize cybersecurity to safeguard user data, ensuring a secure and enjoyable experience for individuals seeking love in the digital realm. 1. The Pervasive Nature of Online Dating: Online dating has transcended societal norms to become a mainstream avenue for meeting romantic partners. Top dating websites have witnessed a surge in user registrations, reflecting the increasing reliance on these platforms to connect with like-minded individuals in an ever-connected world. 2. The Goldmine of Personal Information: While online dating provides a convenient way to meet potential partners, it also involves sharing personal information. From profiles detailing interests and preferences to private messages exchanged between users, the digital realm becomes a goldmine of personal data, making cybersecurity paramount. 3. Encryption: The First Line of Defense: Top dating websites prioritize the use of encryption to secure the transmission of data between users and the platform. Encryption protocols, such as SSL (Secure Sockets Layer) and TLS (Transport Layer Security), ensure that sensitive information, including login credentials and private messages, remains unreadable to unauthorized parties. 4. Robust Authentication Processes: Defending Against Unauthorized Access: Ensuring that only authorized users access their accounts is a fundamental aspect of cybersecurity in online dating. Top dating websites implement robust authentication processes, including secure login mechanisms and, in some cases, two-factor authentication (2FA), adding an extra layer of protection against unauthorized access. 5. Data Privacy Policies: Establishing Trust through Transparency: Transparent data privacy policies are a hallmark of top dating websites committed to cybersecurity. These policies outline how user data is collected, stored, and used. By providing clear and accessible information, dating platforms build trust with users, who can make informed decisions about sharing their personal information. 6. Regular Security Audits: Proactive Measures for Continuous Protection: Top dating websites conduct regular security audits to identify vulnerabilities and ensure ongoing compliance with cybersecurity best practices. These audits may be performed by internal security teams or third-party cybersecurity firms, contributing to the continuous improvement of the platform’s security posture. 7. Scam and Fraud Prevention: Mitigating Risks in the Digital Dating Landscape: The digital dating landscape is not without risks, including scams and fraudulent activities. Top dating websites implement measures to detect and prevent scams, using advanced algorithms and machine learning to identify suspicious behavior. This proactive approach helps protect users from falling victim to fraudulent schemes. 8. Secure Payment Processing: Safeguarding Financial Transactions: For dating platforms that offer premium or subscription-based services, secure payment processing is crucial. Top dating websites integrate trusted payment gateways with encryption to protect users’ financial information during transactions. This ensures that payment details remain confidential and secure. 9. Educating Users on Cybersecurity Practices: Empowering the Digital Daters: Empowering users with knowledge about cybersecurity practices is a shared responsibility. Top dating websites often provide educational resources and tips on safe online dating. This may include guidance on creating strong passwords, recognizing and reporting suspicious activities, and practicing caution when sharing personal information. 10. Addressing Geolocation Privacy Concerns: Balancing Convenience and Safety: Geolocation features in dating apps enhance the user experience by connecting individuals based on proximity. However, top dating websites must strike a balance between convenience and safety. Robust cybersecurity measures are implemented to protect the privacy of users’ location data, ensuring that it is shared securely and with user consent. 11. Artificial Intelligence (AI) for User Safety: Enhancing Threat Detection: Top dating websites leverage artificial intelligence (AI) to enhance user safety. AI algorithms analyze user behavior patterns to detect anomalies that may indicate fraudulent activities or potential security threats. This proactive use of AI contributes to a safer online dating environment. 12. Incident Response Plans: Swift Action in the Face of Security Incidents: Despite preventive measures, security incidents may still occur. Top dating websites have well-defined incident response plans in place to ensure swift and effective action in the event of a security breach. This includes communication strategies, user notifications, and steps taken to mitigate the impact on user data. 13. User Reporting Mechanisms: Empowering Users to Contribute to Safety: Empowering users to play an active role in cybersecurity is integral. Top dating websites provide user-friendly reporting mechanisms that allow individuals to flag suspicious profiles or activities. This collaborative effort enhances the platform’s ability to identify and address potential security threats. 14. Regulatory Compliance: Navigating Legal Frameworks for User Protection: Top dating websites operate within legal frameworks that mandate data protection and user privacy. Compliance with regulations, such as the General Data Protection Regulation (GDPR), underscores the commitment of these platforms to prioritize user protection and adhere to international cybersecurity standards. 15. Transparent Communication: Building Trust in the Digital Dating Space: Transparent communication is a cornerstone of cybersecurity in online dating. Top dating websites prioritize open and clear communication with users, keeping them informed about security measures, updates, and any potential risks. This transparency fosters trust and reinforces the platform’s commitment to user safety. Conclusion: The Ever-Evolving Landscape of Cybersecurity in Online Dating: As online dating continues to evolve, so does the cybersecurity landscape within the digital romance realm. Top dating websites recognize the responsibility to protect user data and prioritize implementing robust cybersecurity measures. The intersection of entertainment and cybersecurity in online dating reflects a commitment to creating a secure, enjoyable, and trustworthy environment for individuals seeking love in the digital age. As technology advances, so will the innovative cybersecurity strategies employed by top dating websites, ensuring that the quest for love remains exciting and secure in the ever-expanding digital realm. You may also like May 24, 2024 The Role of Pets in Enhancing Life at Residential Care Facilities May 24, 2024 Navigating Life Insurance for Cancer Patients: A Comprehensive Guide May 24, 2024 Why Core and Pelvic Floor Health is Crucial to Women’s Wellbeing May 24, 2024 Considerations to Make When Choosing the Right Hiking Boots May 24, 2024 Stress and Nutrition: How a Balanced Diet Can Help You Cope May 24, 2024 To Stand Out In Any Room In The US – You Need The Following Clothes Tips In 2024 May 23, 2024 Leveraging Technology for Success: Day Trading in the Digital Age May 23, 2024 Financial Security in the Digital Age: Protecting Your Online Assets May 23, 2024 Your Money, Your Future: The Importance of Financial Literacy	{ "url": "https://psychtimes.com/lifestyle/how-cybersecurity-measures-protect-your-data-on-online-dating-sites/", "source_domain": "psychtimes.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "265182", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QKWUG7WGODMHR6PV6CTYVWXW53JXXERS", "WARC-Concurrent-To": "<urn:uuid:7c30b39a-df46-4d33-b23e-c872c956d1d8>", "WARC-Date": "2024-05-25T05:50:13Z", "WARC-IP-Address": "13.58.30.219", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3UTEUFZM6S2POEV2S24WPLSESBB4NJJM", "WARC-Record-ID": "<urn:uuid:b882e3a9-c84f-439e-9b4d-53ac2fbae73a>", "WARC-Target-URI": "https://psychtimes.com/lifestyle/how-cybersecurity-measures-protect-your-data-on-online-dating-sites/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:24dc4e66-d8fd-40e1-b03b-f6f1b54fb4e3>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-211\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, 9, 15, 24, 30, 44, 50, 122, 152, 153, 221, 222, 475, 476, 681, 682, 724, 725, 1019, 1020, 1061, 1062, 1365, 1366, 1408, 1409, 1751, 1752, 1827, 1828, 2160, 2161, 2228, 2229, 2560, 2561, 2635, 2636, 2953, 2954, 3034, 3035, 3364, 3365, 3432, 3433, 3741, 3742, 3820, 3821, 4162, 4163, 4242, 4243, 4589, 4590, 4668, 4669, 4962, 4963, 5040, 5041, 5362, 5363, 5436, 5437, 5746, 5747, 5823, 5824, 6136, 6137, 6212, 6213, 6533, 6534, 6609, 6610, 6848, 6849, 7051, 7052, 7255, 7256, 7257, 7275, 7276, 7289, 7290, 7356, 7357, 7370, 7371, 7440, 7441, 7454, 7455, 7520, 7521, 7534, 7535, 7595, 7596, 7609, 7610, 7670, 7671, 7684, 7685, 7766, 7767, 7780, 7781, 7847, 7848, 7861, 7862, 7931, 7932, 7945, 7946 ], "line_end_idx": [ 9, 15, 24, 30, 44, 50, 122, 152, 153, 221, 222, 475, 476, 681, 682, 724, 725, 1019, 1020, 1061, 1062, 1365, 1366, 1408, 1409, 1751, 1752, 1827, 1828, 2160, 2161, 2228, 2229, 2560, 2561, 2635, 2636, 2953, 2954, 3034, 3035, 3364, 3365, 3432, 3433, 3741, 3742, 3820, 3821, 4162, 4163, 4242, 4243, 4589, 4590, 4668, 4669, 4962, 4963, 5040, 5041, 5362, 5363, 5436, 5437, 5746, 5747, 5823, 5824, 6136, 6137, 6212, 6213, 6533, 6534, 6609, 6610, 6848, 6849, 7051, 7052, 7255, 7256, 7257, 7275, 7276, 7289, 7290, 7356, 7357, 7370, 7371, 7440, 7441, 7454, 7455, 7520, 7521, 7534, 7535, 7595, 7596, 7609, 7610, 7670, 7671, 7684, 7685, 7766, 7767, 7780, 7781, 7847, 7848, 7861, 7862, 7931, 7932, 7945, 7946, 8007 ] }	{ "red_pajama_v2": { "ccnet_original_length": 8007, "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.2275172919034958, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.007686399854719639, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.16756340861320496, "rps_doc_frac_unique_words": 0.40754038095474243, "rps_doc_mean_word_length": 5.965888500213623, "rps_doc_num_sentences": 62, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.462949752807617, "rps_doc_word_count": 1114, "rps_doc_frac_chars_dupe_10grams": 0.017454110085964203, "rps_doc_frac_chars_dupe_5grams": 0.046795058995485306, "rps_doc_frac_chars_dupe_6grams": 0.04243154078722, "rps_doc_frac_chars_dupe_7grams": 0.04243154078722, "rps_doc_frac_chars_dupe_8grams": 0.031297020614147186, "rps_doc_frac_chars_dupe_9grams": 0.017454110085964203, "rps_doc_frac_chars_top_2gram": 0.02302137017250061, "rps_doc_frac_chars_top_3gram": 0.043484799563884735, "rps_doc_frac_chars_top_4gram": 0.016250379383563995, "rps_doc_books_importance": -557.4166259765625, "rps_doc_books_importance_length_correction": -557.4166259765625, "rps_doc_openwebtext_importance": -274.0078125, "rps_doc_openwebtext_importance_length_correction": -274.0078125, "rps_doc_wikipedia_importance": -172.17184448242188, "rps_doc_wikipedia_importance_length_correction": -172.17184448242188 }, "fasttext": { "dclm": 0.02254760079085827, "english": 0.884647011756897, "fineweb_edu_approx": 1.404563069343567, "eai_general_math": 0.0008977699908427894, "eai_open_web_math": 0.05372219905257225, "eai_web_code": 0.0021339100785553455 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "302.3", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social psychology" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "13", "label": "News (Org.)" } }, "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": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
4,436,498,210,029,217,000	generaltypo3 Connect to MySQL/MariaDB from a different machine IMPORTANT: By default, the database port for the nodes in this solution cannot be accessed over a public IP address. As a result, you will only be able to connect to your database nodes from machines that are running in the same network. For security reasons, we do not recommend making the database port accessible over a public IP address. If you must make it accessible over a public IP address, we recommend restricting access to a trusted list of source IP addresses using firewall rules. For development purposes, you can also use a VPN or SSH tunnel. Refer to the FAQ for information on accessing restricted ports using an SSH tunnel or opening ports in the server firewall. Once you have an active SSH tunnel or you have opened the port for remote access, you can connect to the database server using a command like the one below. Remember to replace SOURCE-PORT with the source port number specified in the SSH tunnel configuration or 3306 if you opened the port for remote access. $ mysql -h 127.0.0.1 -P SOURCE-PORT -u root -p You will be prompted to enter the root user password. This is the same as the application password. Last modification September 5, 2018	{ "url": "https://docs.bitnami.com/general/apps/typo3/administration/connect-remotely/", "source_domain": "docs.bitnami.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "65139", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NH5FGSLI5VDNPWCHIHSODDNB6MGR5453", "WARC-Concurrent-To": "<urn:uuid:52fbdaca-627e-4ccd-a2f6-87889f0d81ce>", "WARC-Date": "2020-02-21T04:22:39Z", "WARC-IP-Address": "3.225.120.173", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WECSVXH4QFHLKL5OZAN7P4B6A333UUR5", "WARC-Record-ID": "<urn:uuid:7dda2a6b-71dc-4a7f-9ad0-2f6dacc95607>", "WARC-Target-URI": "https://docs.bitnami.com/general/apps/typo3/administration/connect-remotely/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3a88feca-3796-4414-854e-27de2a8301af>" }, "warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-123.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, 13, 14, 64, 65, 747, 748, 905, 906, 1058, 1059, 1106, 1107, 1207, 1208 ], "line_end_idx": [ 13, 14, 64, 65, 747, 748, 905, 906, 1058, 1059, 1106, 1107, 1207, 1208, 1243 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1243, "ccnet_original_nlines": 14, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4032258093357086, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.06451612710952759, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14516128599643707, "rps_doc_frac_unique_words": 0.5352112650871277, "rps_doc_mean_word_length": 4.666666507720947, "rps_doc_num_sentences": 14, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.433818817138672, "rps_doc_word_count": 213, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.1368209272623062, "rps_doc_frac_chars_dupe_6grams": 0.1167002022266388, "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.03621729835867882, "rps_doc_frac_chars_top_3gram": 0.03319919854402542, "rps_doc_frac_chars_top_4gram": 0.03923540934920311, "rps_doc_books_importance": -146.01194763183594, "rps_doc_books_importance_length_correction": -146.01194763183594, "rps_doc_openwebtext_importance": -83.46463775634766, "rps_doc_openwebtext_importance_length_correction": -83.46463775634766, "rps_doc_wikipedia_importance": -70.89704895019531, "rps_doc_wikipedia_importance_length_correction": -70.89704895019531 }, "fasttext": { "dclm": 0.07159751653671265, "english": 0.8588641881942749, "fineweb_edu_approx": 2.6102378368377686, "eai_general_math": 0.40942084789276123, "eai_open_web_math": 0.14664798974990845, "eai_web_code": 0.2980484962463379 } }	{ "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.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
1,580,493,566,972,013,000	RSS .NET Databases in the Cloud: Elysian Fields or Briar Patch? PaaS, Public, Private Clouds The Platform-as-a-Service (PaaS) solution bundles developer tools and a data store, but users who opt to use an infrastructure provider or build a private cloud have to match the data store or database to their application requirements and budget. There are open source and commercial products that have a wide range of capabilities, from scalable simple data stores to robust platforms for complex query and transaction processing. Databases, data stores, and data access software for cloud computing must be evaluated for suitability for both public and private clouds and for the class of applications supported. For example, Amazon Dynamo was built to operate in a trusted environment, without authentication and authorization requirements. Whether the environment supports multi-tenant or multi-instance applications also influences the database decision. Databases and Data Stores Data management options for the cloud include single format data stores, document databases, column data stores, semantic data stores, federated databases and object-relational databases. The latter group includes "Swiss Army Knife" servers from IBM, Microsoft, OpenLink, and Oracle that process SQL tables, XML documents, RDF triples and user-defined types. Building a petabyte size web search index is a very different problem from processing an order or mapping wireless networks. The requirements of the application and data store for those tasks are quite different. For new applications hosted in the cloud, developers will look primarily to several classes of data store: • SQL/XML (object-relational) databases • Column data stores • Distributed hash table (DHT), simple key-value stores • Tuple spaces variants, in-memory databases, entity-attribute-value stores and other non-SQL databases having features such as filtering, sorting, range queries and transactions. Because this cornucopia of data stores has diverse capabilities, it's important to understand application requirements for scalability, load balancing, consistency, data integrity, transaction support and security. Some newer data stores are an exercise in minimalism. They avoid joins and don't implement schemas or strong typing, instead storing data as strings or blobs. Scalability with very large data set operations is a requirement for cloud computing, which has contributed to the recent enthusiasm for the DHT and distributed key-value stores. Associative arrays, dictionaries, hash tables, rings, and tuple spaces have been around for years, as have entity-attribute-value (EAV) stores, database partitions and federated databases. But cloud computing puts an emphasis on scalability and load balancing by distributing data across multiple servers. The need for low-latency data stores has created an Internet buzz about key-value stores, distributed hash tables (DHT), entity-attribute-value stores and data distribution by sharding. Tuple spaces are a solution for distributed shared memory that originated with the Linda effort at Yale that spawned more than 20 implementations, including Object Spaces, JavaSpaces, GigaSpaces, LinuxTuples, IBM TSpaces, and PyLinda. You can find GigaSpaces eXtreme Application Platform as a pay-per-use service on Amazon EC2. It includes a local and distributed Jini transaction manager, Java Transaction API (JTA), JDBC support, with b-tree and hash-based indexing capabilities. Amazon SimpleDB also provides standard tuple spaces interfaces, but adds secondary indexing and support for additional query operators. For large data sets and databases, partitioning data has been a facilitator of parallel query processing and load balancing. Horizontal partitioning, referred to as sharding, has caught the attention of developers looking to build multi-terabyte cloud databases because of its success at Amazon, Digg, eBay, Facebook, Flickr, Friendster, Skype, and YouTube. SQLAlchemy and Hibernate Shards, object-relational mappers for Python and Java, respectively, provide sharding that's useful for cloud database design. Google developed Hibernate Shards for data clusters before donating it to the Hibernate project. You can do manual sharding for a platform such as Google AppEngine, use SQLAlchemy or Hibernate Shards for Python or Java development, or use a cloud data store such as MongoDB that provides administrative commands for creating shards. Distributed Hash Table, Key-Value Data Stores Distributed hash tables and key-value stores are tools for building scalable, load balanced applications, not for enforcing rigid data integrity, consistency and Atomic Consistent Isolated Durable (ACID) properties for transactions. They have limited applicability for applications doing ad hoc query and complex analytics processing. Products in this group include memcached, MemcacheDB, Project Voldemort, Scalaris, and Tokyo Cabinet. Memcached is ubiquitous and a popular solution for caching for database-powered web sites. It's a big associative array that's accessed with a get or put function, using the key that's a unique identifier for data. It's particularly useful for caching information produced by expensive SQL queries, such as counts and aggregate values. MemcacheDB is a distributed key-value data store that conforms to the memcached protocol but uses Berkeley DB for data persistence. Scalaris is a distributed key-value store, implemented in Erlang, which has a non-blocking commit protocol for transactions. Using the Web interface, you can read or write a key-value pair, with each operation being an atomic transaction. Using Java, you can execute more complex transactions. Scalaris has strong consistency and supports symmetric replication, but does not have persistent storage. The open source Tokyo Cabinet database library is causing a buzz in online discussions about key-value stores. It's blazingly fast, capable of storing 1 million records in 0.7 seconds using the hash table engine and 1.6 seconds using the b-tree engine. The data model is one value per key and it supports LZW compression. When keys are ordered, it can do prefix and range matching. For handling transactions, it features write ahead logging and shadow paging. Tokyo Tyrant is a database server version of Tokyo Cabinet that's been used to cache large SQL databases for high-volume applications. Some products of this group support queries over ranges of keys, but ad hoc query operations and aggregate operations (sum, average, grouping) require programming because they are not built-in. Hadoop MapReduce Hadoop MapReduce would be a nominee for the Academy Award for parallel processing of very large data sets, if one existed. It's fault-tolerant and has developed a strong following in the grid and cloud computing communities, including developers at Google, Yahoo, Microsoft, and Facebook. Open source Hadoop is available from Apache, a commercial version is available from CloudEra and Amazon offers an Elastic MapReduce service based on Hadoop. MapReduce operates over the Hadoop Distributed File System (HDFS), with file splits and data stored as key value pairs. The HDFS enables partitioning data for multiple machines to do parallel processing of batches and reduce processing time. MapReduce is suitable for processing very large data sets for purposes such as building search index engines or data mining, but not for online applications requiring sub-second response times. Frameworks built on top of Hadoop, such as Hive and Pig, are useful for extracting information from databases for Hadoop processing. The eHarmony.com site is an example of the marriage of an Oracle database and Amazon MapReduce, using the latter for analytics involving millions of users. Entity-Attribute-Value Datastores EAV stores are derived from data management technology that pre-dates the relational model for data. They do not have the full feature set of an SQL DBMS, such as a rich query model based on a non-procedural, declarative query language. But they are more than a simple key-value data store. EAV data stores from major cloud computing providers include Amazon SimpleDB, Google AppEngine datastore and Microsoft SQL Data Services. And one type, the RDF datastore used for knowledge bases and ontology projects, has been deployed in the cloud. Google Bigtable uses a distributed file system and it can store very large data sets (petabyte size) on thousands of servers. It's the underlying technology for the Google AppEngine datastore. Google uses it, in combination with MapReduce, for indexing the Web and for applications such as Google Earth. Bigtable is a solution for projects that require analyzing a large collection, for example the one billion web pages and 4.78 billion URLs in the ClueWeb09 data set from Carnegie Mellon University. For those seeking an open source alternative to Bigtable for use with Hadoop, Hypertable, and HBase have developed a following. Hypertable runs on top of a distributed file system, such as HDFS. HBase data is organized by table, row and multi-valued columns and there's an integrator-style interface for scanning a range of rows. Hypertable is implemented in C++, whereas HBase is implemented in Java. The Google AppEngine includes a schemaless data store that's optimized for reading, supports atomic transactions and consistency, and stores entities with properties. It permits filtering and sorting on keys and properties. It has 21 built-in data types, including list, blob, postal address and geographical point. Applications can define entity groupings as the basis for performing transactional updates and use GQL, a SQL-like query language. Access to the Google AppEngine datastore is programmable using Python interfaces for queries over objects known as entities. The datastore is also programmable using Java Data Objects (JDO) and Java Persistence API. Although AppEngine bundles a data store, the AppScale project provides software for operating with data stores such as HBase, Hypertable, MongoDB and MySQL. Related Reading More Insights Currently we allow the following HTML tags in comments: Single tags These tags can be used alone and don't need an ending tag. <br> Defines a single line break <hr> Defines a horizontal line Matching tags These require an ending tag - e.g. <i>italic text</i> <a> Defines an anchor <b> Defines bold text <big> Defines big text <blockquote> Defines a long quotation <caption> Defines a table caption <cite> Defines a citation <code> Defines computer code text <em> Defines emphasized text <fieldset> Defines a border around elements in a form <h1> This is heading 1 <h2> This is heading 2 <h3> This is heading 3 <h4> This is heading 4 <h5> This is heading 5 <h6> This is heading 6 <i> Defines italic text <p> Defines a paragraph <pre> Defines preformatted text <q> Defines a short quotation <samp> Defines sample computer code text <small> Defines small text <span> Defines a section in a document <s> Defines strikethrough text <strike> Defines strikethrough text <strong> Defines strong text <sub> Defines subscripted text <sup> Defines superscripted text <u> Defines underlined text Dr. Dobb's encourages readers to engage in spirited, healthy debate, including taking us to task. However, Dr. Dobb's moderates all comments posted to our site, and reserves the right to modify or remove any content that it determines to be derogatory, offensive, inflammatory, vulgar, irrelevant/off-topic, racist or obvious marketing or spam. Dr. Dobb's further reserves the right to disable the profile of any commenter participating in said activities. Disqus Tips To upload an avatar photo, first complete your Disqus profile. \| View the list of supported HTML tags you can use to style comments. \| Please read our commenting policy. Best of the Web First C Compiler Now on Github The earliest known C compiler by the legendary Dennis Ritchie has been published on the repository. Quick Read HTML5 Mobile Development: Seven Good Ideas (and Three Bad Ones) HTML5 Mobile Development: Seven Good Ideas (and Three Bad Ones) Quick Read Building Bare Metal ARM Systems with GNU All you need to know to get up and running... and programming on ARM Quick Read Amazon's Vogels Challenges IT: Rethink App Dev Amazon Web Services CTO says promised land of cloud computing requires a new generation of applications that follow different principles. Quick Read How to Select a PaaS Partner Eventually, the vast majority of Web applications will run on a platform-as-a-service, or PaaS, vendor's infrastructure. To help sort out the options, we sent out a matrix with more than 70 decision points to a variety of PaaS providers. Quick Read More "Best of the Web" >> Video	{ "url": "http://www.drdobbs.com/windows/databases-in-the-cloud-elysian-fields-or/218900502?pgno=2", "source_domain": "www.drdobbs.com", "snapshot_id": "crawl=CC-MAIN-2013-20", "warc_metadata": { "Content-Length": "115760", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:75CE6HLSVRVF235ZSJTMQTFHNWXTOGQT", "WARC-Concurrent-To": "<urn:uuid:fa947a6f-a3e7-4992-9858-159b81a989e3>", "WARC-Date": "2013-05-20T01:57:46Z", "WARC-IP-Address": "192.155.48.108", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:FEYFVT2RNRGN6NUCSRVCLY3D6PIOFQ5D", "WARC-Record-ID": "<urn:uuid:e91664fc-85a3-4f4e-90cc-4664a0bed98d>", "WARC-Target-URI": "http://www.drdobbs.com/windows/databases-in-the-cloud-elysian-fields-or/218900502?pgno=2", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:312e76c8-bb4a-4d1d-8f4d-787841fc7aed>" }, "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, 4, 5, 10, 11, 66, 67, 68, 97, 98, 531, 532, 960, 961, 987, 988, 1347, 1348, 1668, 1669, 1711, 1734, 1792, 1974, 1975, 2528, 2529, 3021, 3022, 3640, 3641, 3999, 4000, 4485, 4486, 4532, 4533, 4868, 4869, 5439, 5440, 5840, 5841, 6436, 6437, 6631, 6632, 6649, 6650, 7096, 7097, 7822, 7823, 7857, 7858, 8399, 8400, 9304, 9305, 10125, 10126, 10127, 10143, 10144, 10145, 10159, 10160, 10161, 10162, 10163, 10164, 10165, 10221, 10222, 10234, 10235, 10294, 10295, 10328, 10329, 10360, 10361, 10375, 10376, 10430, 10431, 10453, 10454, 10476, 10477, 10500, 10501, 10539, 10540, 10574, 10575, 10601, 10602, 10636, 10637, 10666, 10667, 10721, 10722, 10745, 10746, 10769, 10770, 10793, 10794, 10817, 10818, 10841, 10842, 10865, 10866, 10890, 10891, 10915, 10916, 10948, 10949, 10979, 10980, 11021, 11022, 11049, 11050, 11089, 11090, 11121, 11122, 11158, 11159, 11188, 11189, 11220, 11221, 11254, 11255, 11283, 11284, 11741, 11742, 11744, 11926, 11928, 11929, 11945, 11946, 11977, 11978, 12078, 12079, 12090, 12091, 12155, 12156, 12220, 12221, 12232, 12233, 12274, 12275, 12344, 12345, 12356, 12357, 12404, 12405, 12543, 12544, 12555, 12556, 12585, 12586, 12824, 12825, 12836, 12837, 12838, 12864, 12865 ], "line_end_idx": [ 4, 5, 10, 11, 66, 67, 68, 97, 98, 531, 532, 960, 961, 987, 988, 1347, 1348, 1668, 1669, 1711, 1734, 1792, 1974, 1975, 2528, 2529, 3021, 3022, 3640, 3641, 3999, 4000, 4485, 4486, 4532, 4533, 4868, 4869, 5439, 5440, 5840, 5841, 6436, 6437, 6631, 6632, 6649, 6650, 7096, 7097, 7822, 7823, 7857, 7858, 8399, 8400, 9304, 9305, 10125, 10126, 10127, 10143, 10144, 10145, 10159, 10160, 10161, 10162, 10163, 10164, 10165, 10221, 10222, 10234, 10235, 10294, 10295, 10328, 10329, 10360, 10361, 10375, 10376, 10430, 10431, 10453, 10454, 10476, 10477, 10500, 10501, 10539, 10540, 10574, 10575, 10601, 10602, 10636, 10637, 10666, 10667, 10721, 10722, 10745, 10746, 10769, 10770, 10793, 10794, 10817, 10818, 10841, 10842, 10865, 10866, 10890, 10891, 10915, 10916, 10948, 10949, 10979, 10980, 11021, 11022, 11049, 11050, 11089, 11090, 11121, 11122, 11158, 11159, 11188, 11189, 11220, 11221, 11254, 11255, 11283, 11284, 11741, 11742, 11744, 11926, 11928, 11929, 11945, 11946, 11977, 11978, 12078, 12079, 12090, 12091, 12155, 12156, 12220, 12221, 12232, 12233, 12274, 12275, 12344, 12345, 12356, 12357, 12404, 12405, 12543, 12544, 12555, 12556, 12585, 12586, 12824, 12825, 12836, 12837, 12838, 12864, 12865, 12870 ] }	{ "red_pajama_v2": { "ccnet_original_length": 12870, "ccnet_original_nlines": 182, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29808494448661804, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01998334936797619, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17485429346561432, "rps_doc_frac_unique_words": 0.3870967626571655, "rps_doc_mean_word_length": 5.426639080047607, "rps_doc_num_sentences": 96, "rps_doc_symbol_to_word_ratio": 0.00041631999192759395, "rps_doc_unigram_entropy": 5.873129367828369, "rps_doc_word_count": 1922, "rps_doc_frac_chars_dupe_10grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_5grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_6grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_7grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_8grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_9grams": 0.009779480285942554, "rps_doc_frac_chars_top_2gram": 0.012464050203561783, "rps_doc_frac_chars_top_3gram": 0.007478429935872555, "rps_doc_frac_chars_top_4gram": 0.004889740142971277, "rps_doc_books_importance": -1315.7193603515625, "rps_doc_books_importance_length_correction": -1315.7193603515625, "rps_doc_openwebtext_importance": -626.7582397460938, "rps_doc_openwebtext_importance_length_correction": -626.7582397460938, "rps_doc_wikipedia_importance": -508.7757263183594, "rps_doc_wikipedia_importance_length_correction": -508.7757263183594 }, "fasttext": { "dclm": 0.1293012499809265, "english": 0.8676885366439819, "fineweb_edu_approx": 2.4696104526519775, "eai_general_math": 0.2443264126777649, "eai_open_web_math": 0.13482379913330078, "eai_web_code": 0.48380738496780396 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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
4,534,899,630,759,176,700	Einen String n-mal duplizieren (Auszug aus "XSLT Kochbuch" von Sal Mangano) Problem Sie müssen einen String n-mal duplizieren, wobei n ein Parameter ist. Zum Beispiel müssen Sie einen String mit Leerzeichen auffüllen, um eine bestimmte Ausrichtung zu erreichen. Lösung XSLT 1.0 Eine schöne Lösung ist ein rekursiver Ansatz, der den Eingabestring so lange verdoppelt, bis er die erforderliche Länge erreicht hat, wobei sorgfältig Fälle behandelt werden, in denen $count ungerade ist: <xsl:template name="dup"> <xsl:param name="input"/> <xsl:param name="count" select="2"/> <xsl:choose> <xsl:when test="not($count) or not($input)"/> <xsl:when test="$count = 1"> <xsl:value-of select="$input"/> </xsl:when> <xsl:otherwise> <!-- Wenn $count ungerade ist, wird eine zusätzliche Kopie der Eingabe angehängt --> <xsl:if test="$count mod 2"> <xsl:value-of select="$input"/> </xsl:if> <!-- Rekursives Anwenden des Templates nach dem Verdoppeln der Eingabe und dem Halbieren des Zählers --> <xsl:call-template name="dup"> <xsl:with-param name="input" select="concat($input,$input)"/> <xsl:with-param name="count" select="floor($count div 2)"/> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:template> XSLT 2.0 In 2.0 können wir das Duplizieren ziemlich einfach mit einem for-Ausdruck erledigen. Wir überladen dup, um das Verhalten des vorgegebenen Arguments in der XSLT 1.0-Implementierung zu replizieren: <xsl:function name="ckbk:dup"> <xsl:param name="input" as="xs:string"/> <xsl:sequence select="ckbk:dup($input,2)"/> </xsl:function> <xsl:function name="ckbk:dup"> <xsl:param name="input" as="xs:string"/> <xsl:param name="count" as="xs:integer"/> <xsl:sequence select="string-join(for $i in 1 to $count return $input,'')"/> </xsl:function> Diskussion XSLT 1.0 Die offensichtlichste Methode, um einen String $count-mal zu duplizieren, besteht darin, eine Möglichkeit zu ermitteln, den String $count-1-mal mit sich selbst zu verketten. Dies kann mit Hilfe des folgenden Codes rekursiv erledigt werden, allerdings ist dieser Code für größere $count-Werte sehr aufwändig und wird deshalb nicht empfohlen: <xsl:template name="slow-dup"> <xsl:param name="input"/> <xsl:param name="count" select="1"/> <xsl:param name="work" select="$input"/> <xsl:choose> <xsl:when test="not($count) or not($input)"/> <xsl:when test="$count=1"> <xsl:value-of select="$work"/>< </xsl:when> <xsl:otherwise> <xsl:call-template name="slow-dup"> <xsl:with-param name="input" select="$input"/> <xsl:with-param name="count" select="$count - 1"/> <xsl:with-param name="work" select="concat($work,$input)"/> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:template> Ein besserer Ansatz wird in der Lösung oben gezeigt. Die Lösung beschränkt die Anzahl der rekursiven Aufrufe und Verkettungen auf die Größenordnung log2($count), indem wiederholt die Eingabe verdoppelt und der Zähler halbiert werden, solange der Zähler größer als 1 ist. Die slow-dup-Implementierung ist heikel, da sie einen künstlichen Arbeitsparameter erfordert, um die ursprüngliche Eingabe zu beobachten. Sie kann außerdem aufgrund der Rekursion von $count-1 ein Stack-Wachstum zur Folge haben und erfordert $count-1-Aufrufe von concat(). Vergleichen Sie das mit dup, das das Stack-Wachstum auf floor(log2($count)) beschränkt und nur ceiling(log2($count))-Aufrufe von concat() verlangt. Anmerkung: Zugunsten der slow-dup-Technik lässt sich anbringen, dass sie auch verwendet wird, um zusätzlich zu den Strings auch die Struktur zu duplizieren, wenn wir xsl:value-of durch xsl:copy-of ersetzen. Das schnellere dup besitzt in diesem Fall keinen Vorteil, da die Kopien als Parameter übergeben werden, was aufwändig ist. Eine andere Lösung, die auf dem Code des EXSLT-str:padding beruht, damit aber nicht identisch ist, sieht so aus: <xsl:template name="dup"> <xsl:param name="input"/> <xsl:param name="count" select="1"/> <xsl:choose> <xsl:when test="not($count) or not($input)" /> <xsl:otherwise> <xsl:variable name="string" select="concat($input, $input, $input, $input, $input, $input, $input, $input, $input, $input)"/> <xsl:choose> <xsl:when test="string-length($string) >= $count * string-length($input)"> <xsl:value-of select="substring($string, 1, $count * string-length($input))" /> </xsl:when> <xsl:otherwise> <xsl:call-template name="dup"> <xsl:with-param name="input" select="$string" /> <xsl:with-param name="count" select="$count div 10" /> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:otherwise> </xsl:choose> </xsl:template> Diese Implementierung legt zehn Kopien der Eingabe an. Wenn dieser Ansatz mehr erreicht, als erforderlich ist, stutzt er das Ergebnis auf die gewünschte Größe. Ansonsten wendet er das Template rekursiv an. Diese Lösung ist langsamer, da sie oft mehr Verkettungen vornimmt, als notwendig sind, und sie verwendet substring(), das bei manchen XSLT-Implementierungen langsam sein kann. Im Rezept Text ersetzen finden Sie eine Erklärung. Die Lösung erweist sich für solche Prozessoren als vorteilhaft, die die Endrekursion nicht optimieren, da sie die Anzahl der rekursiven Aufrufe deutlich verringert. Siehe auch Die sogenannte Piez-Methode kann einen String ebenfalls ohne Rekursion duplizieren. Diese Methode wird im Artikel XSLT – Efficient Programming Techniques (PDF) besprochen. Sie verwendet eine for-each-Schleife auf jeder verfügbaren Quelle von Knoten (oft auf dem Stylesheet selbst). Obwohl diese Methode in der Praxis außerordentlich effektiv sein kann, finde ich sie unzulänglich, da sie davon ausgeht, dass genügend Knoten zur Verfügung stehen, um die erforderliche Iteration auszuführen. << zurückvor >> Tipp der data2type-Redaktion: Zum Thema XSLT bieten wir auch folgende Schulungen zur Vertiefung und professionellen Fortbildung an: Copyright © 2006 O'Reilly Verlag GmbH & Co. KG Für Ihren privaten Gebrauch dürfen Sie die Online-Version ausdrucken. Ansonsten unterliegt dieses Kapitel aus dem Buch "XSLT Kochbuch" denselben Bestimmungen, wie die gebundene Ausgabe: Das Werk einschließlich aller seiner Teile ist urheberrechtlich geschützt. Alle Rechte vorbehalten einschließlich der Vervielfältigung, Übersetzung, Mikroverfilmung sowie Einspeicherung und Verarbeitung in elektronischen Systemen. O'Reilly Verlag GmbH & Co. KG, Balthasarstraße 81, 50670 Köln, kommentar(at)oreilly.de	{ "url": "https://www.data2type.de/xml-xslt-xslfo/xslt/xslt-kochbuch/strings/string-n-mal-duplizieren", "source_domain": "www.data2type.de", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "70205", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7S75ZVYCINTGD4T5LK2MFTJC6O3LZYTH", "WARC-Concurrent-To": "<urn:uuid:728b349d-895e-4f37-83dc-9080c860a94f>", "WARC-Date": "2021-07-25T00:34:00Z", "WARC-IP-Address": "94.16.109.107", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZUTHKDXK6YSHA7FGZEMF7OJO4GCFKU3Y", "WARC-Record-ID": "<urn:uuid:0d6a2f96-f061-422c-ad7b-8e0ffad01185>", "WARC-Target-URI": "https://www.data2type.de/xml-xslt-xslfo/xslt/xslt-kochbuch/strings/string-n-mal-duplizieren", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7b9f96ee-908a-4081-bc83-6c2c98dd7bca>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-204.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, 31, 32, 77, 78, 86, 87, 265, 266, 273, 274, 283, 284, 489, 490, 516, 544, 583, 598, 648, 681, 719, 735, 755, 846, 881, 921, 937, 1048, 1085, 1155, 1223, 1250, 1271, 1287, 1303, 1304, 1313, 1314, 1510, 1511, 1542, 1585, 1631, 1647, 1648, 1679, 1722, 1766, 1845, 1861, 1862, 1873, 1874, 1883, 1884, 2225, 2226, 2257, 2285, 2324, 2367, 2382, 2432, 2463, 2501, 2517, 2537, 2579, 2634, 2693, 2761, 2788, 2809, 2825, 2841, 2842, 3533, 3534, 3545, 3864, 3865, 3978, 3979, 4005, 4033, 4072, 4087, 4138, 4158, 4290, 4309, 4395, 4485, 4505, 4529, 4570, 4631, 4698, 4729, 4754, 4774, 4795, 4811, 4827, 4828, 5426, 5427, 5438, 5439, 5929, 5930, 5933, 5934, 5950, 5951, 5953, 5954, 5956, 5957, 5959, 5960, 5990, 6092, 6093, 6140, 6210, 6557, 6558 ], "line_end_idx": [ 31, 32, 77, 78, 86, 87, 265, 266, 273, 274, 283, 284, 489, 490, 516, 544, 583, 598, 648, 681, 719, 735, 755, 846, 881, 921, 937, 1048, 1085, 1155, 1223, 1250, 1271, 1287, 1303, 1304, 1313, 1314, 1510, 1511, 1542, 1585, 1631, 1647, 1648, 1679, 1722, 1766, 1845, 1861, 1862, 1873, 1874, 1883, 1884, 2225, 2226, 2257, 2285, 2324, 2367, 2382, 2432, 2463, 2501, 2517, 2537, 2579, 2634, 2693, 2761, 2788, 2809, 2825, 2841, 2842, 3533, 3534, 3545, 3864, 3865, 3978, 3979, 4005, 4033, 4072, 4087, 4138, 4158, 4290, 4309, 4395, 4485, 4505, 4529, 4570, 4631, 4698, 4729, 4754, 4774, 4795, 4811, 4827, 4828, 5426, 5427, 5438, 5439, 5929, 5930, 5933, 5934, 5950, 5951, 5953, 5954, 5956, 5957, 5959, 5960, 5990, 6092, 6093, 6140, 6210, 6557, 6558, 6644 ] }	{ "red_pajama_v2": { "ccnet_original_length": 6644, "ccnet_original_nlines": 128, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.06767956167459488, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01035911962389946, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3715469539165497, "rps_doc_frac_unique_words": 0.502754807472229, "rps_doc_mean_word_length": 6.752066135406494, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.5168914794921875, "rps_doc_word_count": 726, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.1066911518573761, "rps_doc_frac_chars_dupe_6grams": 0.04875560849905014, "rps_doc_frac_chars_dupe_7grams": 0.009179930202662945, "rps_doc_frac_chars_dupe_8grams": 0.009179930202662945, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.016319869086146355, "rps_doc_frac_chars_top_3gram": 0.02141983062028885, "rps_doc_frac_chars_top_4gram": 0.024479800835251808, "rps_doc_books_importance": -815.6532592773438, "rps_doc_books_importance_length_correction": -815.6532592773438, "rps_doc_openwebtext_importance": -428.7812805175781, "rps_doc_openwebtext_importance_length_correction": -428.7812805175781, "rps_doc_wikipedia_importance": -318.21380615234375, "rps_doc_wikipedia_importance_length_correction": -318.21380615234375 }, "fasttext": { "dclm": 0.7913529872894287, "english": 0.004770460072904825, "fineweb_edu_approx": 2.0835556983947754, "eai_general_math": 0.005448880139738321, "eai_open_web_math": 0.5708882212638855, "eai_web_code": 0.33954715728759766 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.736", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
264,810,136,644,657,950	Webmail Display Attachment How come my webmail always display there is an attachment? Even thought they are just plain email with no attachment. It is so ignoring to see all emails with attachments. Is this a bug or setting which I can set? Thanks Rocky That’s most likely the result of the email actually being sent with an “attachment”, such as an html version of the email - you can tell for sure by viewing the source of the email. –rlparker Have you checked the message headers yet? What is the value of Content-type? To check the message headers in Squirrelmail, click on View Full Header :cool: [color=#6600CC]Atropos[/color] \| openvein.org Here are two emails one from yahoo and the other one from outlook. Thanks Rocky Message-ID: 00b201c744ff$6b9d7920$6401a8c0@McIntosh MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_00B3_01C744BC.5D7A3920" X-Mailer: Microsoft Office Outlook 11 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.3028 Thread-Index: AcdE/2pKmcbq99dxQhe1ANJDc8cCLg== and other email MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="0-1184064125-1170133708=:33111" Content-Transfer-Encoding: 8bit Message-ID: 760058.33111.qm@web37305.mail.mud.yahoo.com Well there you go! [5.1.3. Mixed Subtype The “mixed” subtype of “multipart” is intended for use when the body parts are independent and need to be bundled in a particular order. Any “multipart” subtypes that an implementation does not recognize must be treated as being of subtype “mixed”. 5.1.4. Alternative Subtype The “multipart/alternative” type is syntactically identical to "multipart/mixed", but the semantics are different. In particular, each of the body parts is an “alternative” version of the same information. :cool: [color=#6600CC]Atropos[/color] \| openvein.org	{ "url": "https://discussion.dreamhost.com/t/webmail-display-attachment/41282", "source_domain": "discussion.dreamhost.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "19816", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XMSUSMHDYTDCTAP6WW4R4ZKCJT2JFS5Y", "WARC-Concurrent-To": "<urn:uuid:2e3fe909-1621-4c8d-94a2-348cfd9add49>", "WARC-Date": "2021-04-14T22:27:48Z", "WARC-IP-Address": "64.90.62.206", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:4YUGUGPBFG6AFNEXXFLKRQ5AYG4DEMDA", "WARC-Record-ID": "<urn:uuid:6de0b1b4-a324-4af1-80df-d8207a4814c7>", "WARC-Target-URI": "https://discussion.dreamhost.com/t/webmail-display-attachment/41282", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:38c83a56-99b9-40de-83af-50c5f0435925>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-126.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, 27, 28, 200, 242, 243, 250, 251, 257, 258, 440, 441, 451, 452, 529, 530, 602, 603, 656, 657, 724, 725, 732, 733, 739, 740, 792, 810, 841, 894, 932, 989, 1036, 1037, 1053, 1054, 1072, 1151, 1183, 1239, 1240, 1259, 1260, 1282, 1283, 1352, 1420, 1487, 1532, 1533, 1560, 1561, 1624, 1691, 1754, 1767, 1768 ], "line_end_idx": [ 27, 28, 200, 242, 243, 250, 251, 257, 258, 440, 441, 451, 452, 529, 530, 602, 603, 656, 657, 724, 725, 732, 733, 739, 740, 792, 810, 841, 894, 932, 989, 1036, 1037, 1053, 1054, 1072, 1151, 1183, 1239, 1240, 1259, 1260, 1282, 1283, 1352, 1420, 1487, 1532, 1533, 1560, 1561, 1624, 1691, 1754, 1767, 1768, 1820 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1820, "ccnet_original_nlines": 56, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2756892144680023, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.027568919584155083, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.32832080125808716, "rps_doc_frac_unique_words": 0.6244725584983826, "rps_doc_mean_word_length": 6.101265907287598, "rps_doc_num_sentences": 34, "rps_doc_symbol_to_word_ratio": 0.005012529902160168, "rps_doc_unigram_entropy": 4.754430294036865, "rps_doc_word_count": 237, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0, "rps_doc_frac_chars_dupe_6grams": 0, "rps_doc_frac_chars_dupe_7grams": 0, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.017289070412516594, "rps_doc_frac_chars_top_3gram": 0.02074689045548439, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -164.19288635253906, "rps_doc_books_importance_length_correction": -161.6671905517578, "rps_doc_openwebtext_importance": -82.65098571777344, "rps_doc_openwebtext_importance_length_correction": -82.65098571777344, "rps_doc_wikipedia_importance": -68.01578521728516, "rps_doc_wikipedia_importance_length_correction": -67.99484252929688 }, "fasttext": { "dclm": 0.10093569755554199, "english": 0.796250581741333, "fineweb_edu_approx": 2.4516358375549316, "eai_general_math": 0.09582740068435669, "eai_open_web_math": 0.23183071613311768, "eai_web_code": 0.06404387950897217 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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
-2,644,304,848,452,775,000	DEV Community Abhishek Chaudhary Abhishek Chaudhary Posted on Longest Common Subsequence Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters. • For example, "ace" is a subsequence of "abcde". A common subsequence of two strings is a subsequence that is common to both strings. Example 1: Input: text1 = "abcde", text2 = "ace" Output: 3 Explanation: The longest common subsequence is "ace" and its length is 3. Example 2: Input: text1 = "abc", text2 = "abc" Output: 3 Explanation: The longest common subsequence is "abc" and its length is 3. Example 3: Input: text1 = "abc", text2 = "def" Output: 0 Explanation: There is no such common subsequence, so the result is 0. Constraints: • 1 <= text1.length, text2.length <= 1000 • text1 and text2 consist of only lowercase English characters. SOLUTION: class Solution: def lcs(self, text1: str, text2: str, i, j) -> int: if (i, j) in self.cache: return self.cache[(i, j)] if i >= len(text1) or j >= len(text2): self.cache[(i, j)] = 0 return 0 if text1[i] == text2[j]: self.cache[(i, j)] = 1 + self.lcs(text1, text2, i + 1, j + 1) return self.cache[(i, j)] else: a = self.lcs(text1, text2, i + 1, j) b = self.lcs(text1, text2, i, j + 1) self.cache[(i, j)] = max(a, b) return self.cache[(i, j)] def longestCommonSubsequence(self, text1: str, text2: str, i = 0, j = 0) -> int: self.cache = {} return self.lcs(text1, text2, 0, 0) Enter fullscreen mode Exit fullscreen mode Top comments (0)	{ "url": "https://dev.to/theabbie/longest-common-subsequence-5g28", "source_domain": "dev.to", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "738477", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:K6PNQYGXPCS463XNSD3UYY3EEB5GHG3X", "WARC-Concurrent-To": "<urn:uuid:1bdbaebd-0efd-49ee-beb4-dc743ccc2800>", "WARC-Date": "2024-06-21T01:10:49Z", "WARC-IP-Address": "151.101.130.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VPUQG657HYYXLIUXFRH3ROQSXLKCCJQZ", "WARC-Record-ID": "<urn:uuid:38a54b68-4bda-4a84-ae51-f860e9a39848>", "WARC-Target-URI": "https://dev.to/theabbie/longest-common-subsequence-5g28", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:5d053116-2bff-48ad-a08a-d12a0b2bf3cb>" }, "warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-185\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 14, 15, 34, 53, 54, 64, 65, 92, 93, 228, 229, 414, 415, 467, 468, 553, 554, 565, 566, 604, 614, 615, 689, 690, 701, 702, 738, 748, 822, 823, 834, 835, 871, 881, 951, 952, 965, 966, 1010, 1076, 1077, 1087, 1088, 1104, 1160, 1193, 1231, 1278, 1313, 1334, 1367, 1441, 1479, 1493, 1542, 1591, 1634, 1672, 1673, 1758, 1782, 1826, 1869, 1870 ], "line_end_idx": [ 14, 15, 34, 53, 54, 64, 65, 92, 93, 228, 229, 414, 415, 467, 468, 553, 554, 565, 566, 604, 614, 615, 689, 690, 701, 702, 738, 748, 822, 823, 834, 835, 871, 881, 951, 952, 965, 966, 1010, 1076, 1077, 1087, 1088, 1104, 1160, 1193, 1231, 1278, 1313, 1334, 1367, 1441, 1479, 1493, 1542, 1591, 1634, 1672, 1673, 1758, 1782, 1826, 1869, 1870, 1886 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1886, "ccnet_original_nlines": 64, "rps_doc_curly_bracket": 0.0010604499839246273, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.23348018527030945, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00881057046353817, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4229075014591217, "rps_doc_frac_unique_words": 0.3759689927101135, "rps_doc_mean_word_length": 4.732558250427246, "rps_doc_num_sentences": 24, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.196919918060303, "rps_doc_word_count": 258, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.17362816631793976, "rps_doc_frac_chars_dupe_6grams": 0.11302211135625839, "rps_doc_frac_chars_dupe_7grams": 0.07698608189821243, "rps_doc_frac_chars_dupe_8grams": 0.07698608189821243, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.09746109694242477, "rps_doc_frac_chars_top_3gram": 0.07862407714128494, "rps_doc_frac_chars_top_4gram": 0.03439803048968315, "rps_doc_books_importance": -202.2864532470703, "rps_doc_books_importance_length_correction": -202.28453063964844, "rps_doc_openwebtext_importance": -111.68004608154297, "rps_doc_openwebtext_importance_length_correction": -111.68004608154297, "rps_doc_wikipedia_importance": -78.2571792602539, "rps_doc_wikipedia_importance_length_correction": -78.2571792602539 }, "fasttext": { "dclm": 0.9973978400230408, "english": 0.8097452521324158, "fineweb_edu_approx": 3.2167487144470215, "eai_general_math": 0.9946310520172119, "eai_open_web_math": 0.16596662998199463, "eai_web_code": 0.6118254065513611 } }	{ "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": "511.6", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Arithmetic" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-8,472,322,687,529,952,000	Take the 2-minute tour × Server Fault is a question and answer site for professional system and network administrators. It's 100% free, no registration required. I have a system where to the main server (homes, nfs, ntp, queue...) can log-in only root – all the other users use front-end host with NFS-mounted home directories (RW) and all other software directories (read-only). My problem is, that time to time, if root or normal user with sudo makes some administrative works on front-end some homes of normal users getting set-uid/gid bits (drwsr-sr-x). If it happens usually the user can't log-in (as long as permission for his home are not changed to drwxr-xr-x). The last time I saw it after compiling some new software (normal user configure;make) and installation from the same directory as root (su and make install or direct as normal user sudo make install). Can somebody explain me why it happens and what should I do to get rid of this problem? p.s. I'm using CentOS 5.7 share\|improve this question SetUID/GID bits are NOT Sticky bits! – mdpc Jun 15 '12 at 22:14 add comment Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook. Your Answer discard By posting your answer, you agree to the privacy policy and terms of service. Browse other questions tagged or ask your own question.	{ "url": "http://serverfault.com/questions/399293/set-uid-gid-bits-on-nfs-file-system", "source_domain": "serverfault.com", "snapshot_id": "crawl=CC-MAIN-2014-10", "warc_metadata": { "Content-Length": "59725", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DKD5KF6RW7ZXPWEGAUHHOMJKJLGWUNZ7", "WARC-Concurrent-To": "<urn:uuid:cea7c4de-5fae-43a7-ba00-2c907961f13a>", "WARC-Date": "2014-03-09T10:17:26Z", "WARC-IP-Address": "198.252.206.140", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6PUN7LZZ7JIDDVOLZMWCJDSD7QE3S7GC", "WARC-Record-ID": "<urn:uuid:096019b7-a254-4342-aeb2-64dc250511ec>", "WARC-Target-URI": "http://serverfault.com/questions/399293/set-uid-gid-bits-on-nfs-file-system", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:83cfcec7-a127-4d7a-accd-156f6bda265f>" }, "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, 162, 163, 381, 382, 672, 673, 874, 875, 963, 964, 990, 991, 1019, 1021, 1086, 1098, 1099, 1200, 1201, 1213, 1214, 1216, 1224, 1225, 1303, 1304 ], "line_end_idx": [ 25, 162, 163, 381, 382, 672, 673, 874, 875, 963, 964, 990, 991, 1019, 1021, 1086, 1098, 1099, 1200, 1201, 1213, 1214, 1216, 1224, 1225, 1303, 1304, 1359 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1359, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.34201952815055847, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026058629155158997, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.22149837017059326, "rps_doc_frac_unique_words": 0.640350878238678, "rps_doc_mean_word_length": 4.609649181365967, "rps_doc_num_sentences": 16, "rps_doc_symbol_to_word_ratio": 0.0032573300413787365, "rps_doc_unigram_entropy": 4.80347204208374, "rps_doc_word_count": 228, "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.028544239699840546, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -149.30088806152344, "rps_doc_books_importance_length_correction": -149.30076599121094, "rps_doc_openwebtext_importance": -88.3232650756836, "rps_doc_openwebtext_importance_length_correction": -88.3232650756836, "rps_doc_wikipedia_importance": -48.14823913574219, "rps_doc_wikipedia_importance_length_correction": -48.03517532348633 }, "fasttext": { "dclm": 0.06909198313951492, "english": 0.8995791673660278, "fineweb_edu_approx": 1.285634160041809, "eai_general_math": 0.00043029000516980886, "eai_open_web_math": 0.11995387077331543, "eai_web_code": 0.0001758900034474209 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "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": "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": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-2,462,372,383,176,524,300	Count Tens and Ones Within 100 Add to Fav Rate 0 stars Quiz size: Message preview: Someone you know has shared quiz with you: To play this quiz, click on the link below: https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname... To know more about different quizzes, please visit www.turtlediary.com Hope you have a good experience with this site and recommend to your friends too. Login to rate activities and track progress. Login to rate activities and track progress. Remember the relation: 10 ones = 1 ten 3 a Let's consider an example. Let's write the tens and ones in the number 56. 56 = ___ ten(s) + ___ one(s) We need to find the missing numbers in the above sentence. We have: 56 = 50 + 6 = 5 tens + 6 ones So, the missing numbers are 5 and 6. ds A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Help The correct answer is Remember : The smallest number is the one that comes first while counting. Solution : To arrange the given numbers in order from smallest to greatest, find the smallest number among all the given numbers. 21,27,23 21 is the smallest number.	{ "url": "https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname...", "source_domain": "www.turtlediary.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "161528", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:YEIHSVBPNTQVJTT64AEDZTFB57FBCR3J", "WARC-Concurrent-To": "<urn:uuid:fd45ed4a-d848-48aa-8168-60646c6accf0>", "WARC-Date": "2024-05-22T06:08:59Z", "WARC-IP-Address": "52.85.132.122", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:G6DBGDPIVWPOYFMRX4ZIYV7XNISZFC6W", "WARC-Record-ID": "<urn:uuid:f1a90f8e-276b-499d-8c8a-3f29ccb7536d>", "WARC-Target-URI": "https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname...", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:45087f9e-b349-4f15-b6e5-ac1d6b6725e5>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-211\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, 2, 4, 5, 36, 37, 61, 72, 89, 132, 133, 177, 178, 266, 267, 338, 339, 421, 422, 467, 512, 513, 536, 537, 539, 540, 556, 558, 559, 563, 564, 566, 641, 643, 672, 731, 733, 734, 743, 745, 746, 776, 778, 779, 816, 817, 818, 819, 820, 821, 824, 825, 877, 878, 883, 884, 906, 907, 918, 919, 983, 984, 995, 996, 1115, 1116, 1125, 1126 ], "line_end_idx": [ 2, 4, 5, 36, 37, 61, 72, 89, 132, 133, 177, 178, 266, 267, 338, 339, 421, 422, 467, 512, 513, 536, 537, 539, 540, 556, 558, 559, 563, 564, 566, 641, 643, 672, 731, 733, 734, 743, 745, 746, 776, 778, 779, 816, 817, 818, 819, 820, 821, 824, 825, 877, 878, 883, 884, 906, 907, 918, 919, 983, 984, 995, 996, 1115, 1116, 1125, 1126, 1152 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1152, "ccnet_original_nlines": 67, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.294545441865921, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09454544633626938, "rps_doc_frac_lines_end_with_ellipsis": 0.014705879613757133, "rps_doc_frac_no_alph_words": 0.27636364102363586, "rps_doc_frac_unique_words": 0.6294416189193726, "rps_doc_mean_word_length": 4.233502388000488, "rps_doc_num_sentences": 18, "rps_doc_symbol_to_word_ratio": 0.0036363599356263876, "rps_doc_unigram_entropy": 4.5478668212890625, "rps_doc_word_count": 197, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_6grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_7grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.039568349719047546, "rps_doc_frac_chars_top_3gram": 0.06115107983350754, "rps_doc_frac_chars_top_4gram": 0.050359711050987244, "rps_doc_books_importance": -148.24403381347656, "rps_doc_books_importance_length_correction": -148.24403381347656, "rps_doc_openwebtext_importance": -99.95982360839844, "rps_doc_openwebtext_importance_length_correction": -97.4112548828125, "rps_doc_wikipedia_importance": -92.45426177978516, "rps_doc_wikipedia_importance_length_correction": -92.45426177978516 }, "fasttext": { "dclm": 0.9603680372238159, "english": 0.8632020950317383, "fineweb_edu_approx": 2.363574743270874, "eai_general_math": 0.11191611737012863, "eai_open_web_math": 0.1345367431640625, "eai_web_code": 0.00011074999929405749 } }	{ "free_decimal_correspondence": { "primary": { "code": "513.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "372.7", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Education, Elementary and Kindergarten" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "1", "label": "Factual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-9,098,149,672,645,933,000	Remove & Uninstall HJ-Split 2.4 Completely from Windows Do you have trouble in completely uninstalling HJ-Split 2.4 from your system? Are you searching for an effective solution to thoroughly get rid of it off your PC? Don't worry! You have come to the right place and you will be able to uninstall HJ-Split 2.4 without any difficulty. Problems You may Encounter when Uninstalling HJ-Split 2.4 * HJ-Split 2.4 does not work as good as you thought. * You can not uninstall HJ-Split 2.4 with Add or Remove Programs in Control Panel. * You keep receiving error messages when you are uninstalling HJ-Split 2.4. * HJ-Split 2.4 is still running in the background even after you uninstalled it. * You can still find the folders and files of HJ-Split 2.4 after the uninstallation. There may be many other problems computer users run into when uninstalling HJ-Split 2.4. As a matter of fact, those issues are caused by improper uninstallation of the program. Also, if the program is corrupted or damaged, users may not be able to uninstall it. Here, you will learn how to correctly and completely remove HJ-Split 2.4. Recommended Solution: Manually Uninstall HJ-Split 2.4 via Add or Remove Programs As it's known to most of computer users, the most common way to uninstall a program is via Add or Remove Programs. 1.Exit HJ-Split 2.4 and end all of its processes before uninstalling it. Tips: if you can not exit the program, you can run your PC in Safe Mode. Restart your PC and keep pressing F8 key before your Windows loads. Select Safe Mode with Networking and hit Enter key. safe mode with networking 2.Click Start menu and then select Control Panel. start control panel 3.Find and click Add/ Remove Programs. add remove programs 4.Find HJ-Split 2.4 in the list and click Remove button to initiate the uninstallation. Video of How to Uninstall HJ-Split 2.4 via Add or Remove Programs: Manually Uninstall HJ-Split 2.4 with Its Own Uninstaller If you do not want to use Control Panel to uninstall HJ-Split 2.4, you can also uninstall it with its own uninstaller. 1.Go to the desktop and find the icon of HJ-Split 2.4. 2.Right click its icon and click Properties. software properties 3.Click Find Target option. find target 4.Find and run unins000.exe or uninstall.exe in its installation folder. 5.Follow its uninstall dialog and click "Yes" to uninstall it. 6.Reboot your machine after the uninstallation. Both of the above uninstallation methods are the most common methods for people to uninstall HJ-Split 2.4. Yet, they only allow you to uninstall small programs with few files and are not able to completely remove stubborn software like HJ-Split 2.4. So, the possibility is that many invalid registry files and program files are left in your system and hard disk. If you leave them in your system, your system registry will be stuffed with useless entries and system becomes unstable and slow. In such situation, you need to manually delete those entries and files left in the registry and the system. Manually Delete the Remanent Files of HJ-Split 2.4 No matter you use Add or Remove Programs or its uninstaller to uninstall the software, it's necessary for you to get rid of the hidden files and components to ensure a 100% complete uninstallation. 1. Delete invalid registry entries * Click Start and Run * Type in regedit in the dialog and click OK start registry editor * Find and delete registry entries of the program, such as in HKEY_CURRENT_USER\Software\HJ-Split 2.4 and HKEY_LOCAL_MACHINE\SOFTWARE\HJ-Split 2.4 2. Delete associated files and folders First you need to show all hidden files in your computer. * Open My Computer and select Folder Options. show hidden files * Find and delete files of the program, such as in C:\Program Files\HJ-Split 2.4, C:\Documents and Settings\user name\Application Data\HJ-Split 2.4 and C:\Document and Settings\All Users\Application Data\HJ-Split 2.4 Some programs may have other files in other locations. Therefore, manually editing registry could be very time-consuming and risky. Please know that Windows registry is the most important central base of your computer. So, you should be extremely careful when deleting entries there. Otherwise, your system will be crashed. A Better Way to Automatically Uninstall HJ-Split 2.4 Since most of computer users are not comfortable in manually removing HJ-Split 2.4, it's really advisable for them to resort to the automatic method that is a powerful third-party uninstaller. A powerful third-party uninstaller can * Uninstall all kinds of software safer and faster. * Uninstall half-installed or uninstalled software. * Handle those stubborn software that Add/ Remove Programs cannot. * Detect and remove all associated files and components of the software. * Tidy the registry and improve system performance. * Save your hassle to uninstall the software. Step 1: Click and Download Automatic HJ-Split 2.4 Uninstaller Step 2: Install and launch the Uninstaller on the PC Step 3: Select HJ-Split 2.4 and click Uninstall button to uninstall.	{ "url": "http://www.quicklyuninstall.com/article/Quickly-Uinstall-HJ-Split-2.4.html", "source_domain": "www.quicklyuninstall.com", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "16082", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QXIPQMXIKLE54PIGUC5MWRIFXYOJELMB", "WARC-Concurrent-To": "<urn:uuid:9c083bef-d050-4fee-bc03-ca724bf74721>", "WARC-Date": "2019-03-19T04:00:53Z", "WARC-IP-Address": "45.56.121.35", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:MSGSN5UR5CGVJ4VHYQBJKTTEMONABKGM", "WARC-Record-ID": "<urn:uuid:115c5ecd-1137-4acb-b632-a9a64f2a1b84>", "WARC-Target-URI": "http://www.quicklyuninstall.com/article/Quickly-Uinstall-HJ-Split-2.4.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:68ae1b7d-14c9-4320-a9d0-6f0555d069f6>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-30-226-49.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 56, 57, 337, 338, 396, 397, 450, 451, 534, 535, 611, 612, 693, 694, 779, 780, 1116, 1117, 1139, 1140, 1141, 1142, 1201, 1202, 1317, 1318, 1391, 1392, 1585, 1586, 1612, 1613, 1663, 1664, 1684, 1685, 1724, 1725, 1745, 1746, 1834, 1835, 1902, 1903, 1904, 1905, 1962, 1963, 2082, 2083, 2138, 2139, 2184, 2185, 2205, 2206, 2234, 2235, 2247, 2248, 2321, 2322, 2385, 2386, 2434, 2435, 3036, 3037, 3088, 3089, 3287, 3288, 3323, 3324, 3346, 3347, 3392, 3393, 3415, 3416, 3563, 3564, 3603, 3604, 3662, 3663, 3709, 3710, 3728, 3729, 3946, 3947, 4271, 4272, 4325, 4326, 4558, 4559, 4611, 4612, 4664, 4665, 4732, 4733, 4806, 4807, 4859, 4860, 4906, 4907, 4969, 4970, 5023, 5024 ], "line_end_idx": [ 56, 57, 337, 338, 396, 397, 450, 451, 534, 535, 611, 612, 693, 694, 779, 780, 1116, 1117, 1139, 1140, 1141, 1142, 1201, 1202, 1317, 1318, 1391, 1392, 1585, 1586, 1612, 1613, 1663, 1664, 1684, 1685, 1724, 1725, 1745, 1746, 1834, 1835, 1902, 1903, 1904, 1905, 1962, 1963, 2082, 2083, 2138, 2139, 2184, 2185, 2205, 2206, 2234, 2235, 2247, 2248, 2321, 2322, 2385, 2386, 2434, 2435, 3036, 3037, 3088, 3089, 3287, 3288, 3323, 3324, 3346, 3347, 3392, 3393, 3415, 3416, 3563, 3564, 3603, 3604, 3662, 3663, 3709, 3710, 3728, 3729, 3946, 3947, 4271, 4272, 4325, 4326, 4558, 4559, 4611, 4612, 4664, 4665, 4732, 4733, 4806, 4807, 4859, 4860, 4906, 4907, 4969, 4970, 5023, 5024, 5092 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5092, "ccnet_original_nlines": 114, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3176795542240143, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04051565006375313, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24677716195583344, "rps_doc_frac_unique_words": 0.3362500071525574, "rps_doc_mean_word_length": 5.022500038146973, "rps_doc_num_sentences": 93, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.931194305419922, "rps_doc_word_count": 800, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05027376860380173, "rps_doc_frac_chars_dupe_6grams": 0.029865600168704987, "rps_doc_frac_chars_dupe_7grams": 0.019910400733351707, "rps_doc_frac_chars_dupe_8grams": 0.019910400733351707, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.05599800869822502, "rps_doc_frac_chars_top_3gram": 0.0403185710310936, "rps_doc_frac_chars_top_4gram": 0.023643599823117256, "rps_doc_books_importance": -506.00433349609375, "rps_doc_books_importance_length_correction": -506.00433349609375, "rps_doc_openwebtext_importance": -255.68267822265625, "rps_doc_openwebtext_importance_length_correction": -255.68267822265625, "rps_doc_wikipedia_importance": -188.12120056152344, "rps_doc_wikipedia_importance_length_correction": -188.12120056152344 }, "fasttext": { "dclm": 0.020507629960775375, "english": 0.8906198143959045, "fineweb_edu_approx": 1.348465919494629, "eai_general_math": 0.2969517111778259, "eai_open_web_math": 0.2607787251472473, "eai_web_code": 0.244867742061615 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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
-915,593,016,867,813,000	Sync Deezer with Hearthis.at Replace automatically Deezer playlist tracks on a Hearthis.at playlist How to keep in sync a playlist from Deezer to Hearthis.at ? The steps below can help you to create a synchronization between a Deezer playlist and a Hearthis.at playlist. After your synchronization was created, daily/weekly/monthly, your Deezer playlist tracks will be automatically merged in your Hearthis.at playlist. Premium Playlists Synchronize 1. Open the Web App Open 2. Click on the Synchronize tool () in left panel of the interface 3. Select your Deezer source playlist (if no Deezer playlists was show you have maybe to connect this platform) 4. Select Hearthis.at as destination service (and connect this platform) 5. Select the Hearthis.at playlist (you can create directly a new playlist by selecting 'New playlist') 6. Configure your synchronization (start date/time, frequency, method) 7. Confirm to create your synchronization (you can show the detail in 'My syncs' tab in the left panel) See your syncs How to keep in sync a recent Deezer to Hearthis.at transfer ? You have recently converted a Deezer playlist to Hearthis.at and now you want to keep this two playlist in sync ? The steps below can help you : Premium Playlists Synchronize 1. Open the Web App Open 2. Go to your recent transfers See your recent transfers 3. Find the Deezer to Hearthis.at transfer you want to keep synchronize and click on Keep Sync () 4. Configure your synchronization (start date/time, frequency, method) 5. Confirm to create your synchronization (you can show the detail in 'My syncs' tab in the left panel) See your syncs Take a look to our explanation page to know more about Sync, update playlists automatically across streaming services.	{ "url": "https://soundiiz.com/tutorial/sync-deezer-with-hearthis", "source_domain": "soundiiz.com", "snapshot_id": "crawl=CC-MAIN-2020-05", "warc_metadata": { "Content-Length": "22911", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RGQW6MZB7HLJZWKF6NFZ3ZWVHIUZDYCU", "WARC-Concurrent-To": "<urn:uuid:6c11081d-9387-46db-b9f0-6e767851c24e>", "WARC-Date": "2020-01-29T10:33:19Z", "WARC-IP-Address": "130.211.22.237", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:NAGEF3EUBNNB4JLDDFXOIAITC6QIWN23", "WARC-Record-ID": "<urn:uuid:e511125c-146c-4674-8f41-4c22aea22aab>", "WARC-Target-URI": "https://soundiiz.com/tutorial/sync-deezer-with-hearthis", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:110e2855-1962-4efd-9f85-07c708f5551a>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-105.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, 29, 30, 101, 102, 162, 163, 423, 424, 454, 481, 550, 664, 739, 845, 918, 1039, 1040, 1102, 1103, 1248, 1249, 1279, 1306, 1365, 1465, 1538, 1659 ], "line_end_idx": [ 29, 30, 101, 102, 162, 163, 423, 424, 454, 481, 550, 664, 739, 845, 918, 1039, 1040, 1102, 1103, 1248, 1249, 1279, 1306, 1365, 1465, 1538, 1659, 1777 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1777, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.34659090638160706, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20738635957241058, "rps_doc_frac_unique_words": 0.36823105812072754, "rps_doc_mean_word_length": 5.05415153503418, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.243209362030029, "rps_doc_word_count": 277, "rps_doc_frac_chars_dupe_10grams": 0.1957142949104309, "rps_doc_frac_chars_dupe_5grams": 0.37285715341567993, "rps_doc_frac_chars_dupe_6grams": 0.33142855763435364, "rps_doc_frac_chars_dupe_7grams": 0.27571427822113037, "rps_doc_frac_chars_dupe_8grams": 0.1957142949104309, "rps_doc_frac_chars_dupe_9grams": 0.1957142949104309, "rps_doc_frac_chars_top_2gram": 0.06785713881254196, "rps_doc_frac_chars_top_3gram": 0.03857142850756645, "rps_doc_frac_chars_top_4gram": 0.015714289620518684, "rps_doc_books_importance": -119.95252227783203, "rps_doc_books_importance_length_correction": -113.12551879882812, "rps_doc_openwebtext_importance": -60.9552001953125, "rps_doc_openwebtext_importance_length_correction": -60.9552001953125, "rps_doc_wikipedia_importance": -34.966915130615234, "rps_doc_wikipedia_importance_length_correction": -33.04206085205078 }, "fasttext": { "dclm": 0.04303150996565819, "english": 0.857842743396759, "fineweb_edu_approx": 1.0508522987365723, "eai_general_math": 0.019661609083414078, "eai_open_web_math": 0.22423887252807617, "eai_web_code": 0.044374700635671616 } }	{ "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": "780", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-6,684,347,857,327,869,000	How to use _Dependency_name method of generated Package Best Keploy code snippet using generated._Dependency_name _Dependency_name Using AI Code Generation copy Full Screen 1var dep = new _Dependency_name();2dep.doSomething();3var dep = new _Dependency_name();4dep.doSomething();5var dep = new _Dependency_name();6dep.doSomething();7var dep = new _Dependency_name();8dep.doSomething();9var dep = new _Dependency_name();10dep.doSomething();11var dep = new _Dependency_name();12dep.doSomething();13var dep = new _Dependency_name();14dep.doSomething();15var dep = new _Dependency_name();16dep.doSomething();17var dep = new _Dependency_name();18dep.doSomething();19var dep = new _Dependency_name();20dep.doSomething();21var dep = new _Dependency_name();22dep.doSomething();23var dep = new _Dependency_name();24dep.doSomething();25var dep = new _Dependency_name();26dep.doSomething();27var dep = new _Dependency_name();28dep.doSomething();29var dep = new _Dependency_name();30dep.doSomething();31var dep = new _Dependency_name();32dep.doSomething(); Full Screen Full Screen _Dependency_name Using AI Code Generation copy Full Screen 1import (2func main() {3dependency.Dependency_name()4}5import (6func main() {7dependency.Dependency_name()8}9I don't want to import the same dependency twice. Is there a way to make it work? Full Screen Full Screen Automation Testing Tutorials Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc. LambdaTest Learning Hubs: YouTube You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts. Run Keploy automation tests on LambdaTest cloud grid Perform automation testing on 3000+ real desktop and mobile devices online. Most used method in	{ "url": "https://www.lambdatest.com/automation-testing-advisor/golang/methods/keploy_go.generated._Dependency_name", "source_domain": "www.lambdatest.com", "snapshot_id": "CC-MAIN-2024-33", "warc_metadata": { "Content-Length": "152326", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:INM3L3KQISZHFLL34ZWOCQ7K2DQZZ332", "WARC-Concurrent-To": "<urn:uuid:dfb08d69-9a47-4aa0-b278-3e6e0b7ff5fb>", "WARC-Date": "2024-08-12T03:15:09Z", "WARC-IP-Address": "104.18.5.65", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:BIYM37XZKLSERIP7YIOUCYTA2SOL6YRT", "WARC-Record-ID": "<urn:uuid:005d700d-f062-43ec-ba16-b1a201586ce7>", "WARC-Target-URI": "https://www.lambdatest.com/automation-testing-advisor/golang/methods/keploy_go.generated._Dependency_name", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e465f06a-2386-4901-8fde-3abe3bbbed54>" }, "warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 56, 57, 115, 116, 133, 134, 159, 160, 165, 166, 178, 179, 1051, 1052, 1064, 1065, 1077, 1078, 1095, 1096, 1121, 1122, 1127, 1128, 1140, 1141, 1332, 1333, 1345, 1346, 1358, 1359, 1388, 1389, 1786, 1787, 1813, 1814, 1822, 1823, 1952, 1953, 2006, 2007, 2083, 2084 ], "line_end_idx": [ 56, 57, 115, 116, 133, 134, 159, 160, 165, 166, 178, 179, 1051, 1052, 1064, 1065, 1077, 1078, 1095, 1096, 1121, 1122, 1127, 1128, 1140, 1141, 1332, 1333, 1345, 1346, 1358, 1359, 1388, 1389, 1786, 1787, 1813, 1814, 1822, 1823, 1952, 1953, 2006, 2007, 2083, 2084, 2103 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2103, "ccnet_original_nlines": 46, "rps_doc_curly_bracket": 0.00190203997772187, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.18918919563293457, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008108110167086124, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.26216214895248413, "rps_doc_frac_unique_words": 0.5871559381484985, "rps_doc_mean_word_length": 7.5366973876953125, "rps_doc_num_sentences": 29, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.475287914276123, "rps_doc_word_count": 218, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_6grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_7grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_8grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.05842969939112663, "rps_doc_frac_chars_top_3gram": 0.025562990456819534, "rps_doc_frac_chars_top_4gram": 0.030432140454649925, "rps_doc_books_importance": -191.8749237060547, "rps_doc_books_importance_length_correction": -191.8749237060547, "rps_doc_openwebtext_importance": -103.71275329589844, "rps_doc_openwebtext_importance_length_correction": -103.71275329589844, "rps_doc_wikipedia_importance": -97.6964111328125, "rps_doc_wikipedia_importance_length_correction": -97.6964111328125 }, "fasttext": { "dclm": 0.06032269820570946, "english": 0.5351800918579102, "fineweb_edu_approx": 2.543079137802124, "eai_general_math": 0.033630430698394775, "eai_open_web_math": 0.028791189193725586, "eai_web_code": 0.42324745655059814 } }	{ "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.028", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "6", "label": "Not Applicable/Indeterminate" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,304,146,520,710,452,000	view gcc/config/m32r/t-linux @ 0:a06113de4d67 first commit author kent <kent@cr.ie.u-ryukyu.ac.jp> date Fri, 17 Jul 2009 14:47:48 +0900 parents children 77e2b8dfacca line wrap: on line source # lib1funcs.asm is currently empty. CROSS_LIBGCC1 = # These are really part of libgcc1, but this will cause them to be # built correctly, so... LIB2FUNCS_EXTRA = fp-bit.c dp-bit.c # Turn off the SDA while compiling libgcc2. There are no headers for it # and we want maximal upward compatibility here. TARGET_LIBGCC2_CFLAGS = -G 0 -fPIC fp-bit.c: $(srcdir)/config/fp-bit.c echo '#define FLOAT' > fp-bit.c cat $(srcdir)/config/fp-bit.c >> fp-bit.c dp-bit.c: $(srcdir)/config/fp-bit.c cat $(srcdir)/config/fp-bit.c > dp-bit.c # We need to use -fpic when we are using gcc to compile the routines in # initfini.c. This is only really needed when we are going to use gcc/g++ # to produce a shared library, but since we don't know ahead of time when # we will be doing that, we just always use -fpic when compiling the # routines in initfini.c. # -fpic currently isn't supported for the m32r. CRTSTUFF_T_CFLAGS_S = -fPIC # Don't run fixproto STMP_FIXPROTO = # Don't install "assert.h" in gcc. We use the one in glibc. INSTALL_ASSERT_H = # Do not build libgcc1. Let gcc generate those functions. The GNU/Linux # C library can handle them. LIBGCC1 = CROSS_LIBGCC1 = LIBGCC1_TEST = SHLIB_MAPFILES += $(srcdir)/config/m32r/libgcc-glibc.ver	{ "url": "http://www.cr.ie.u-ryukyu.ac.jp/hg/CbC/CbC_gcc/file/a06113de4d67/gcc/config/m32r/t-linux", "source_domain": "www.cr.ie.u-ryukyu.ac.jp", "snapshot_id": "crawl=CC-MAIN-2021-10", "warc_metadata": { "Content-Length": "6958", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PBVF552FZIMI3AI56SE4AW4MGCNZU276", "WARC-Concurrent-To": "<urn:uuid:2728367b-ab49-4ad6-8305-0777d19e931f>", "WARC-Date": "2021-03-06T23:00:28Z", "WARC-IP-Address": "133.13.50.70", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:KNATWG7BDRKIRVRKTVGMTI2IL3ARISLU", "WARC-Record-ID": "<urn:uuid:72f4a908-9747-4ec1-a8d3-f3afff7788de>", "WARC-Target-URI": "http://www.cr.ie.u-ryukyu.ac.jp/hg/CbC/CbC_gcc/file/a06113de4d67/gcc/config/m32r/t-linux", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c9fa7832-fb7b-44ac-9780-7d1c1ee44478>" }, "warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-142.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: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 46, 47, 60, 100, 137, 145, 167, 181, 193, 194, 230, 246, 247, 314, 339, 340, 376, 377, 450, 499, 500, 535, 536, 572, 605, 648, 649, 685, 727, 728, 800, 875, 949, 1018, 1044, 1092, 1093, 1121, 1122, 1123, 1144, 1160, 1162, 1222, 1241, 1243, 1315, 1344, 1355, 1371, 1386, 1387 ], "line_end_idx": [ 46, 47, 60, 100, 137, 145, 167, 181, 193, 194, 230, 246, 247, 314, 339, 340, 376, 377, 450, 499, 500, 535, 536, 572, 605, 648, 649, 685, 727, 728, 800, 875, 949, 1018, 1044, 1092, 1093, 1121, 1122, 1123, 1144, 1160, 1162, 1222, 1241, 1243, 1315, 1344, 1355, 1371, 1386, 1387, 1443 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1443, "ccnet_original_nlines": 52, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2654155492782593, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.040214478969573975, "rps_doc_frac_lines_end_with_ellipsis": 0.018867919221520424, "rps_doc_frac_no_alph_words": 0.3592493236064911, "rps_doc_frac_unique_words": 0.6666666865348816, "rps_doc_mean_word_length": 5.544973373413086, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0.04557640850543976, "rps_doc_unigram_entropy": 4.641208171844482, "rps_doc_word_count": 189, "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.017175570130348206, "rps_doc_frac_chars_top_3gram": 0.020992370322346687, "rps_doc_frac_chars_top_4gram": 0.04198472946882248, "rps_doc_books_importance": -139.80215454101562, "rps_doc_books_importance_length_correction": -136.4527130126953, "rps_doc_openwebtext_importance": -71.55935668945312, "rps_doc_openwebtext_importance_length_correction": -71.55935668945312, "rps_doc_wikipedia_importance": -67.63914489746094, "rps_doc_wikipedia_importance_length_correction": -59.76068115234375 }, "fasttext": { "dclm": 0.32010871171951294, "english": 0.7169741988182068, "fineweb_edu_approx": 2.8084259033203125, "eai_general_math": 0.9421687126159668, "eai_open_web_math": 0.2256016731262207, "eai_web_code": 0.43824589252471924 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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
3,868,832,875,818,645,500	Question about sky go.... Discussion in 'iPhone' started by The Game 161, Oct 21, 2011. 1. The Game 161 macrumors P6 The Game 161 Joined: Dec 15, 2010 Location: UK #1 When I switch to the 4s from the 4 will the sky go app on my phone still work on the 4s as I switch my sim from the 4 to the 4s or will it just stay on the 4 which my GF will have? 2. FreakinEurekan macrumors 68040 FreakinEurekan Joined: Sep 8, 2011 Location: Eureka Springs, Arkansas #2 Don't know specifically about Sky Go, you could email them and ask... but as a general rule, apps can be loaded on "All" of your iOS devices. When you get the new phone, you'll restore from a backup of your old one and the app will be there (along with any other apps you have). Now if Sky Go only allows one phone at a time to use it, or other service-level restrictions of that nature - that's something they would handle, not Apple. Share This Page	{ "url": "https://forums.macrumors.com/threads/question-about-sky-go.1260104/", "source_domain": "forums.macrumors.com", "snapshot_id": "crawl=CC-MAIN-2018-22", "warc_metadata": { "Content-Length": "133485", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4HPMFJXMIMZEXGTY4RU5OOVR3G3XOUFJ", "WARC-Concurrent-To": "<urn:uuid:d0919f6c-d54a-4434-aae3-198860d22b5d>", "WARC-Date": "2018-05-27T02:30:16Z", "WARC-IP-Address": "162.254.116.251", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:33APZEM7UPQHQZEFVNHKF7HIL5Y6PF7Y", "WARC-Record-ID": "<urn:uuid:a69f32e8-ab80-472a-9633-2f9cfe1942e9>", "WARC-Target-URI": "https://forums.macrumors.com/threads/question-about-sky-go.1260104/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7619609f-bf86-49cf-9ecc-c4975aae00f8>" }, "warc_info": "robots: classic\r\nhostname: ip-10-79-222-162.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 26, 27, 89, 90, 121, 122, 139, 140, 152, 169, 183, 190, 197, 382, 388, 424, 425, 444, 445, 457, 473, 487, 516, 523, 597, 598, 811, 812, 973, 979, 980 ], "line_end_idx": [ 26, 27, 89, 90, 121, 122, 139, 140, 152, 169, 183, 190, 197, 382, 388, 424, 425, 444, 445, 457, 473, 487, 516, 523, 597, 598, 811, 812, 973, 979, 980, 995 ] }	{ "red_pajama_v2": { "ccnet_original_length": 995, "ccnet_original_nlines": 31, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41203704476356506, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023148149251937866, "rps_doc_frac_lines_end_with_ellipsis": 0.0625, "rps_doc_frac_no_alph_words": 0.24074074625968933, "rps_doc_frac_unique_words": 0.6214689016342163, "rps_doc_mean_word_length": 3.887005567550659, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0.018518520519137383, "rps_doc_unigram_entropy": 4.505232810974121, "rps_doc_word_count": 177, "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.029069770127534866, "rps_doc_frac_chars_top_3gram": 0.04360464960336685, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -100.49651336669922, "rps_doc_books_importance_length_correction": -100.49651336669922, "rps_doc_openwebtext_importance": -52.4947395324707, "rps_doc_openwebtext_importance_length_correction": -38.445960998535156, "rps_doc_wikipedia_importance": -40.14405059814453, "rps_doc_wikipedia_importance_length_correction": -40.14405059814453 }, "fasttext": { "dclm": 0.020418230444192886, "english": 0.9297599792480469, "fineweb_edu_approx": 1.5566478967666626, "eai_general_math": 0.002922950079664588, "eai_open_web_math": 0.10101497173309326, "eai_web_code": 0.00003803000072366558 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "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
4,403,312,752,775,456,000	Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. × E. Beautiful Subarrays time limit per test 3 seconds memory limit per test 512 megabytes input standard input output standard output One day, ZS the Coder wrote down an array of integers a with elements a1, a2, ..., an. A subarray of the array a is a sequence al, al + 1, ..., ar for some integers (l, r) such that 1 ≤ l ≤ r ≤ n. ZS the Coder thinks that a subarray of a is beautiful if the bitwise xor of all the elements in the subarray is at least k. Help ZS the Coder find the number of beautiful subarrays of a! Input The first line contains two integers n and k (1 ≤ n ≤ 106, 1 ≤ k ≤ 109) — the number of elements in the array a and the value of the parameter k. The second line contains n integers ai (0 ≤ ai ≤ 109) — the elements of the array a. Output Print the only integer c — the number of beautiful subarrays of the array a. Examples Input 3 1 1 2 3 Output 5 Input 3 2 1 2 3 Output 3 Input 3 3 1 2 3 Output 2	{ "url": "http://codeforces.com/problemset/problem/665/E", "source_domain": "codeforces.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "52841", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MV2LKVBINU5DQ6XSN25F2RF6P2QXARVA", "WARC-Concurrent-To": "<urn:uuid:3a98a6fe-0dd9-4198-a893-e7da2ff92d61>", "WARC-Date": "2020-02-18T17:40:03Z", "WARC-IP-Address": "81.27.240.126", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:35RWRNAQXSIV4MGUQXJ6KILWOXYETIBI", "WARC-Record-ID": "<urn:uuid:d431015f-a9be-4f2d-8b0e-14c77aef620b>", "WARC-Target-URI": "http://codeforces.com/problemset/problem/665/E", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:731926d0-d1f2-428d-8747-92d9c6a5b904>" }, "warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-228.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, 148, 149, 172, 192, 202, 224, 238, 244, 259, 266, 282, 283, 373, 374, 620, 621, 684, 685, 691, 692, 838, 839, 924, 925, 932, 933, 1010, 1011, 1020, 1026, 1030, 1036, 1043, 1045, 1051, 1055, 1061, 1068, 1070, 1076, 1080, 1086, 1093 ], "line_end_idx": [ 148, 149, 172, 192, 202, 224, 238, 244, 259, 266, 282, 283, 373, 374, 620, 621, 684, 685, 691, 692, 838, 839, 924, 925, 932, 933, 1010, 1011, 1020, 1026, 1030, 1036, 1043, 1045, 1051, 1055, 1061, 1068, 1070, 1076, 1080, 1086, 1093, 1094 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1094, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.341269850730896, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01984127052128315, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.289682537317276, "rps_doc_frac_unique_words": 0.4285714328289032, "rps_doc_mean_word_length": 3.7373270988464355, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0.007936510257422924, "rps_doc_unigram_entropy": 4.09552001953125, "rps_doc_word_count": 217, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07644882798194885, "rps_doc_frac_chars_dupe_6grams": 0.07644882798194885, "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.024660909548401833, "rps_doc_frac_chars_top_3gram": 0.04438963904976845, "rps_doc_frac_chars_top_4gram": 0.04069051146507263, "rps_doc_books_importance": -101.2663345336914, "rps_doc_books_importance_length_correction": -101.2663345336914, "rps_doc_openwebtext_importance": -62.9734992980957, "rps_doc_openwebtext_importance_length_correction": -53.569007873535156, "rps_doc_wikipedia_importance": -45.64015579223633, "rps_doc_wikipedia_importance_length_correction": -45.64015579223633 }, "fasttext": { "dclm": 0.15094327926635742, "english": 0.5811944603919983, "fineweb_edu_approx": 1.269930362701416, "eai_general_math": 0.9968148469924927, "eai_open_web_math": 0.107581727206707, "eai_web_code": 0.06015288829803467 } }	{ "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": "511.3", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Arithmetic" } } }, "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": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-3,167,748,833,362,821,600	Skip to content Instantly share code, notes, and snippets. @ufologist Created September 17, 2013 07:21 Show Gist options • Save ufologist/6591008 to your computer and use it in GitHub Desktop. Save ufologist/6591008 to your computer and use it in GitHub Desktop. 参考SpaceTree的示例, 实现类似脑图(mindmap)效果 <!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8" /> <title>Spacetree - Mindmap Demo</title> <link rel="stylesheet" href="spacetree.css" /> <style> #infovis { height: 600px; margin-left: auto; margin-right: auto; background-color: #111; } #infovis .node { cursor: pointer; color: #333; font-size: 0.8em; padding: 3px; } </style> <!-- 依靠excanvas来解决IE不支持canvas的问题 --> <!--[if IE]> <script src="http://philogb.github.io/jit/static/v20/Jit/Extras/excanvas.js"></script> <![endif]--> </head> <body> <h1>Spacetree - Mindmap Demo</h1> <div id="infovis"></div> <!-- JIT Library File --> <script src="http://philogb.github.io/jit/static/v20/Jit/jit-yc.js"></script> <script src="spacetree-mindmap-demo.js"></script> </body> </html> /** * Simplest Templating Engine * * https://github.com/trix/nano / function nano(template, data) { return template.replace(/\{([\w\.])\}/g, function(str, key) { var keys = key.split("."), v = data[keys.shift()]; for (var i = 0, l = keys.length; i < l; i++) v = v[keys[i]]; return (typeof v !== "undefined" && v !== null) ? v : ""; }); } // 渲染节点内容的模版 var tpl = '<span>{name}({unit}): {value}</span><br /><span>环比: {ratio}%</span>'; // 测试数据 var nodes = { id: 'node01', name: tpl, data: { // 节点的扩展数据, 可依据这些值来渲染节点的样式 name: '收入', unit: '元', value: 26000, ratio: -4.7 }, children: [{ id: 'node11', name: tpl, data: { name: '收入1', unit: '元', value: 5000, ratio: -5.1 }, children: [{ id: 'node111', name: tpl, data: { name: '收入11', unit: '元', value: 2000, ratio: -5.3 } }, { id: 'node112', name: tpl, data: { name: '收入12', unit: '元', value: 1000, ratio: 2.2 } }, { id: 'node113', name: tpl, data: { name: '收入13', unit: '元', value: 2000, ratio: -3.5 } }] }, { id: 'node12', name: tpl, data: { name: '收入2', unit: '元', value: 8000, ratio: 2.5 } }, { id: 'node13', name: tpl, data: { name: '收入3', unit: '元', value: 6000, ratio: 2.3 } }, { id: 'node14', name: tpl, data: { name: '收入4', unit: '元', value: 7000, ratio: -2.3 }, children: [{ id: 'node141', name: tpl, data: { name: '收入41', unit: '元', value: 4000, ratio: -1.3 } }, { id: 'node142', name: tpl, data: { name: '收入42', unit: '元', value: 1000, ratio: 2.1 } }, { id: 'node143', name: tpl, data: { name: '收入43', unit: '元', value: 2000, ratio: -3.9 } }] }] }; /** * 参考SpaceTree的示例, 实现类似脑图(mindmap)效果 * http://philogb.github.io/jit/static/v20/Jit/Examples/Spacetree/example1.html */ (function() { // Create a new Spacetree instance // http://philogb.github.io/jit/static/v20/Docs/files/Visualizations/Spacetree-js.html var st = new $jit.ST({ // id of viz container element injectInto: 'infovis', // set duration for the animation duration: 800, // set animation transition type transition: $jit.Trans.Quart.easeInOut, // Whether to show the entire tree when loaded // or just the number of levels specified by levelsToShow. // Default’s true. // 关系到是否可以展开多个节点 // http://stackoverflow.com/questions/4223415/how-do-i-prevent-the-javascript-infovis-spacetree-st-select-method-from-coll constrained: false, // The number of levels to show for a subtree, Default’s 2 levelsToShow: 1, // set distance between node and its children levelDistance: 50, // enable panning Navigation: { enable:true, panning:true }, // 节点和连接线都是通过canvas画出来的 Node: { type: 'rectangle', align: 'left', autoWidth: true, autoHeight: true, overridable: true // for styling individual nodes or edges }, Edge: { type: 'bezier', overridable: true }, Tips: { enable: true, type: 'HTML', offsetX: 10, offsetY: 10, onShow: function(tip, node) { tip.innerHTML = nano(node.name, node.data); } }, // This method is called on DOM label creation. // Use this method to add event handlers and styles to your node. onCreateLabel: function(label, node) { label.innerHTML = nano(node.name, node.data); label.onclick = function() { st.onClick(node.id); }; // SpaceTree expand/collapse behaviour // https://groups.google.com/forum/#!topic/javascript-information-visualization-toolkit/pHblraFbFuI // 实现点击节点可以展开/收起, 效果还不是很理想 // label.onclick = function() { // console.log(node._collapsed, node.collapsed); // if (node._collapsed === undefined \|\| node._collapsed === true) { // st.op.expand(node, { // type: 'animate', // duration: 1000, // hideLabels: false, // transition: $jit.Trans.Quart.easeOut // }); // st.onClick(node.id); // node._collapsed = false; // node.collapsed = false; // } else { // st.op.contract(node, { // type: 'animate', // duration: 1000, // hideLabels: false, // transition: $jit.Trans.Quart.easeOut // }); // node._collapsed = true; // node.collapsed = true; // } // }; }, // This method is called right before plotting a node. // It's useful for changing an individual node // style properties before plotting it. // The data properties prefixed with a dollar // sign will override the global node style properties. onBeforePlotNode: function(node) { //add some color to the nodes in the path between the //root node and the selected node. if (node.selected) { node.data.$color = '#ff7'; } else { // 这里可以实现根据节点的扩展数据来渲染节点样式 delete node.data.$color; // if the node belongs to the last plotted level // if(!node.anySubnode('exist')) { //count children number // var count = 0; // node.eachSubnode(function(n) { count++; }); //assign a node color based on //how many children it has // node.data.$color = ['#aaa', '#baa', '#caa', '#daa', '#eaa', '#faa'][count]; // } } }, // This method is called right before plotting // an edge. It's useful for changing an individual edge // style properties before plotting it. // Edge data proprties prefixed with a dollar sign will // override the Edge global style properties. onBeforePlotLine: function(adj){ if (adj.nodeFrom.selected && adj.nodeTo.selected) { adj.data.$color = '#eed'; adj.data.$lineWidth = 3; } else { delete adj.data.$color; delete adj.data.$lineWidth; } }, onBeforeCompute: function(node) { // console.log('loading', node.name); }, onAfterCompute: function(){ // console.log('done'); } }); // load data st.loadJSON(nodes); // compute node positions and layout st.compute(); // optional: make a translation of the tree st.geom.translate(new $jit.Complex(-200, 0), 'current'); // emulate a click on the root node. st.onClick(st.root); // 测试调整tree方位(Tree Orientation) // setTimeout(function() { // st.switchPosition('top', 'animate'); // setTimeout(function() { // st.switchPosition('right', 'animate'); // setTimeout(function() { // st.switchPosition('bottom', 'animate'); // }, 6000); // }, 5500); // }, 5000); })(); .jit-autoadjust-label { padding: 5px; } .tip { color: #111; background-color: white; border:1px solid #ccc; -moz-box-shadow:#555 2px 2px 8px; -webkit-box-shadow:#555 2px 2px 8px; -o-box-shadow:#555 2px 2px 8px; box-shadow:#555 2px 2px 8px; opacity:0.9; filter:alpha(opacity=90); font-size:10px; font-family:Verdana, Geneva, Arial, Helvetica, sans-serif; padding:7px; } @ufologist Copy link Author 预览效果 spacetree mindmap demo Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment	{ "url": "https://gist.github.com/ufologist/6591008", "source_domain": "gist.github.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "215527", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RXTKHEIRM2XAEYWLXWF4O3VZKPZAED4Y", "WARC-Concurrent-To": "<urn:uuid:d94e7024-4f33-4d02-befa-7e24355f6473>", "WARC-Date": "2024-05-21T01:08:17Z", "WARC-IP-Address": "140.82.112.4", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:UCR6LUEDMTGYERBNFLRJENHKBOTRW6GA", "WARC-Record-ID": "<urn:uuid:2b50e77f-8593-46c4-99f4-71fa27b27826>", "WARC-Target-URI": "https://gist.github.com/ufologist/6591008", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e69a67e9-ed2a-477e-9750-53e4fc74b7d3>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-217\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 16, 17, 60, 61, 72, 105, 123, 197, 267, 301, 317, 334, 341, 366, 406, 453, 461, 472, 487, 506, 526, 550, 552, 569, 586, 599, 617, 631, 633, 642, 679, 692, 779, 792, 800, 807, 841, 866, 892, 970, 1020, 1028, 1036, 1040, 1069, 1071, 1102, 1105, 1137, 1200, 1251, 1312, 1370, 1374, 1376, 1389, 1470, 1478, 1492, 1506, 1517, 1552, 1564, 1575, 1589, 1601, 1604, 1617, 1631, 1642, 1650, 1663, 1674, 1687, 1699, 1702, 1715, 1730, 1741, 1749, 1763, 1774, 1787, 1799, 1801, 1806, 1821, 1832, 1840, 1854, 1865, 1878, 1889, 1891, 1896, 1911, 1922, 1930, 1944, 1955, 1968, 1980, 1982, 1985, 1990, 2004, 2015, 2023, 2036, 2047, 2060, 2071, 2073, 2078, 2092, 2103, 2111, 2124, 2135, 2148, 2159, 2161, 2166, 2180, 2191, 2199, 2212, 2223, 2236, 2248, 2251, 2264, 2279, 2290, 2298, 2312, 2323, 2336, 2348, 2350, 2355, 2370, 2381, 2389, 2403, 2414, 2427, 2438, 2440, 2445, 2460, 2471, 2479, 2493, 2504, 2517, 2529, 2531, 2534, 2537, 2540, 2544, 2580, 2659, 2662, 2676, 2711, 2798, 2821, 2852, 2875, 2909, 2924, 2957, 2997, 3044, 3103, 3122, 3139, 3262, 3282, 3341, 3358, 3404, 3423, 3441, 3455, 3468, 3481, 3484, 3508, 3516, 3535, 3550, 3567, 3585, 3644, 3647, 3655, 3671, 3689, 3692, 3700, 3714, 3728, 3741, 3754, 3784, 3828, 3830, 3833, 3881, 3947, 3986, 4032, 4061, 4082, 4085, 4124, 4224, 4251, 4283, 4332, 4400, 4424, 4444, 4463, 4485, 4525, 4532, 4556, 4584, 4611, 4623, 4649, 4669, 4688, 4710, 4750, 4757, 4784, 4810, 4815, 4821, 4824, 4879, 4926, 4966, 5012, 5068, 5103, 5157, 5192, 5213, 5240, 5275, 5300, 5349, 5384, 5408, 5426, 5473, 5504, 5531, 5610, 5615, 5617, 5620, 5667, 5723, 5763, 5819, 5865, 5898, 5950, 5976, 6001, 6010, 6034, 6062, 6064, 6067, 6101, 6139, 6142, 6170, 6194, 6196, 6200, 6213, 6233, 6270, 6284, 6328, 6385, 6422, 6443, 6475, 6502, 6542, 6569, 6611, 6638, 6681, 6694, 6707, 6720, 6726, 6750, 6764, 6766, 6773, 6786, 6811, 6834, 6868, 6905, 6937, 6966, 6979, 7005, 7021, 7080, 7093, 7095, 7106, 7116, 7123, 7124, 7129, 7152, 7153 ], "line_end_idx": [ 16, 17, 60, 61, 72, 105, 123, 197, 267, 301, 317, 334, 341, 366, 406, 453, 461, 472, 487, 506, 526, 550, 552, 569, 586, 599, 617, 631, 633, 642, 679, 692, 779, 792, 800, 807, 841, 866, 892, 970, 1020, 1028, 1036, 1040, 1069, 1071, 1102, 1105, 1137, 1200, 1251, 1312, 1370, 1374, 1376, 1389, 1470, 1478, 1492, 1506, 1517, 1552, 1564, 1575, 1589, 1601, 1604, 1617, 1631, 1642, 1650, 1663, 1674, 1687, 1699, 1702, 1715, 1730, 1741, 1749, 1763, 1774, 1787, 1799, 1801, 1806, 1821, 1832, 1840, 1854, 1865, 1878, 1889, 1891, 1896, 1911, 1922, 1930, 1944, 1955, 1968, 1980, 1982, 1985, 1990, 2004, 2015, 2023, 2036, 2047, 2060, 2071, 2073, 2078, 2092, 2103, 2111, 2124, 2135, 2148, 2159, 2161, 2166, 2180, 2191, 2199, 2212, 2223, 2236, 2248, 2251, 2264, 2279, 2290, 2298, 2312, 2323, 2336, 2348, 2350, 2355, 2370, 2381, 2389, 2403, 2414, 2427, 2438, 2440, 2445, 2460, 2471, 2479, 2493, 2504, 2517, 2529, 2531, 2534, 2537, 2540, 2544, 2580, 2659, 2662, 2676, 2711, 2798, 2821, 2852, 2875, 2909, 2924, 2957, 2997, 3044, 3103, 3122, 3139, 3262, 3282, 3341, 3358, 3404, 3423, 3441, 3455, 3468, 3481, 3484, 3508, 3516, 3535, 3550, 3567, 3585, 3644, 3647, 3655, 3671, 3689, 3692, 3700, 3714, 3728, 3741, 3754, 3784, 3828, 3830, 3833, 3881, 3947, 3986, 4032, 4061, 4082, 4085, 4124, 4224, 4251, 4283, 4332, 4400, 4424, 4444, 4463, 4485, 4525, 4532, 4556, 4584, 4611, 4623, 4649, 4669, 4688, 4710, 4750, 4757, 4784, 4810, 4815, 4821, 4824, 4879, 4926, 4966, 5012, 5068, 5103, 5157, 5192, 5213, 5240, 5275, 5300, 5349, 5384, 5408, 5426, 5473, 5504, 5531, 5610, 5615, 5617, 5620, 5667, 5723, 5763, 5819, 5865, 5898, 5950, 5976, 6001, 6010, 6034, 6062, 6064, 6067, 6101, 6139, 6142, 6170, 6194, 6196, 6200, 6213, 6233, 6270, 6284, 6328, 6385, 6422, 6443, 6475, 6502, 6542, 6569, 6611, 6638, 6681, 6694, 6707, 6720, 6726, 6750, 6764, 6766, 6773, 6786, 6811, 6834, 6868, 6905, 6937, 6966, 6979, 7005, 7021, 7080, 7093, 7095, 7106, 7116, 7123, 7124, 7129, 7152, 7153, 7250 ] }	{ "red_pajama_v2": { "ccnet_original_length": 7250, "ccnet_original_nlines": 332, "rps_doc_curly_bracket": 0.01655171997845173, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.09411173313856125, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00301962997764349, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5435329675674438, "rps_doc_frac_unique_words": 0.5033556818962097, "rps_doc_mean_word_length": 6.594630718231201, "rps_doc_num_sentences": 137, "rps_doc_symbol_to_word_ratio": 0.00956214964389801, "rps_doc_unigram_entropy": 5.519609451293945, "rps_doc_word_count": 745, "rps_doc_frac_chars_dupe_10grams": 0.02320374920964241, "rps_doc_frac_chars_dupe_5grams": 0.12639935314655304, "rps_doc_frac_chars_dupe_6grams": 0.09444330632686615, "rps_doc_frac_chars_dupe_7grams": 0.08141665160655975, "rps_doc_frac_chars_dupe_8grams": 0.06635457277297974, "rps_doc_frac_chars_dupe_9grams": 0.02320374920964241, "rps_doc_frac_chars_top_2gram": 0.0156727097928524, "rps_doc_frac_chars_top_3gram": 0.024628540500998497, "rps_doc_frac_chars_top_4gram": 0.03053124062716961, "rps_doc_books_importance": -638.3787841796875, "rps_doc_books_importance_length_correction": -638.3787841796875, "rps_doc_openwebtext_importance": -417.40472412109375, "rps_doc_openwebtext_importance_length_correction": -417.40472412109375, "rps_doc_wikipedia_importance": -374.9115295410156, "rps_doc_wikipedia_importance_length_correction": -374.9115295410156 }, "fasttext": { "dclm": 0.9098628759384155, "english": 0.20169417560100555, "fineweb_edu_approx": 2.858632802963257, "eai_general_math": 0.07682604342699051, "eai_open_web_math": 0.00725567014887929, "eai_web_code": 0.9114152193069458 } }	{ "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": "006.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Cognitive science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "1", "label": "Leftover HTML" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "5", "label": "Missing Referenced Data" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,662,235,272,300,183,000	Packagespark.filters Classpublic class GradientGlowFilter InheritanceGradientGlowFilter Inheritance GradientFilter Inheritance BaseDimensionFilter Inheritance BaseFilter Inheritance flash.events.EventDispatcher Implements IBitmapFilter Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 The GradientGlowFilter class lets you apply a gradient glow effect to display objects. A gradient glow is a realistic-looking glow with a color gradient that you can control. You can apply a gradient glow around the inner or outer edge of an object or on top of an object. You can apply the filter to any display object (objects that inherit from the DisplayObject class), such as MovieClip, SimpleButton, TextField, and Video objects, as well as to BitmapData objects. The use of filters depends on the object to which you apply the filter: If you apply a filter to a display object, the cacheAsBitmap property of the display object is set to true. If you clear all filters, the original value of cacheAsBitmap is restored. This filter supports Stage scaling. However, it does not support general scaling, rotation, and skewing; if the object itself is scaled (if scaleX and scaleY are set to a value other than 1.0), the filter effect is not scaled. It is scaled only when the user zooms in on the Stage. A filter is not applied if the resulting image exceeds the maximum dimensions. In AIR 1.5 and Flash Player 10, the maximum is 8,191 pixels in width or height, and the total number of pixels cannot exceed 16,777,215 pixels. (So, if an image is 8,191 pixels wide, it can only be 2,048 pixels high.) For example, if you zoom in on a large movie clip with a filter applied, the filter is turned off if the resulting image exceeds the maximum dimensions. MXML SyntaxexpandedHide MXML Syntax The <s:GradientGlowFilter> tag inherits all of the tag attributes of its superclass and adds no tag attributes: <s:GradientGlowFilter/> Default MXML Propertyentries View the examples See also spark.filters.GlowFilter flash.filters.GradientGlowFilter flash.display.BitmapData.applyFilter() flash.display.DisplayObject.cacheAsBitmap flash.display.DisplayObject.filters Public Properties PropertyDefined By Inheritedangle : Number The angle, in degrees. GradientFilter InheritedblurX : Number The amount of horizontal blur. BaseDimensionFilter InheritedblurY : Number The amount of vertical blur. BaseDimensionFilter Inheriteddistance : Number The offset distance of the glow. GradientFilter Inheritedentries : Array An Array of GradientEntry objects defining the fill patterns for the gradient fill. GradientFilter Inheritedknockout : Boolean Specifies whether the object has a knockout effect. BaseDimensionFilter Inheritedquality : int The number of times to apply the filter. BaseDimensionFilter Inheritedstrength : Number The strength of the imprint or spread. BaseDimensionFilter Inheritedtype : String The placement of the filter effect. GradientFilter Public Methods MethodDefined By GradientGlowFilter(distance:Number = 4.0, angle:Number = 45, colors:Array = null, alphas:Array = null, ratios:Array = null, blurX:Number = 4.0, blurY:Number = 4.0, strength:Number = 1, quality:int = 1, type:String = outer, knockout:Boolean = false) Constructor. GradientGlowFilter clone():BitmapFilter Returns a copy of this filter object. GradientGlowFilter Inherited Propagates a change event when the filter has changed. BaseFilter Public Constants ConstantDefined By InheritedCHANGE : String = change [static] The string "change". BaseFilter Constructor Detail GradientGlowFilter()Constructor public function GradientGlowFilter(distance:Number = 4.0, angle:Number = 45, colors:Array = null, alphas:Array = null, ratios:Array = null, blurX:Number = 4.0, blurY:Number = 4.0, strength:Number = 1, quality:int = 1, type:String = outer, knockout:Boolean = false) Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 Constructor. Parameters distance:Number (default = 4.0) — The offset distance of the glow. angle:Number (default = 45) — The angle, in degrees. Valid values are 0 to 360. colors:Array (default = null) — An array of colors that defines a gradient. For example, red is 0xFF0000, blue is 0x0000FF, and so on. alphas:Array (default = null) — An array of alpha transparency values for the corresponding colors in the colors array. Valid values for each element in the array are 0 to 1. For example, a value of .25 sets the alpha transparency value to 25%. ratios:Array (default = null) — An array of color distribution ratios. Valid values are 0 to 255. This value defines the percentage of the width where the color is sampled at 100 percent. blurX:Number (default = 4.0) — The amount of horizontal blur. Valid values are 0 to 255. A blur of 1 or less means that the original image is copied as is. Values that are a power of 2 (such as 2, 4, 8, 16 and 32) are optimized to render more quickly than other values. blurY:Number (default = 4.0) — The amount of vertical blur. Valid values are 0 to 255. A blur of 1 or less means that the original image is copied as is. Values that are a power of 2 (such as 2, 4, 8, 16 and 32) are optimized to render more quickly than other values. strength:Number (default = 1) — The strength of the imprint or spread. The higher the value, the more color is imprinted and the stronger the contrast between the glow and the background. Valid values are 0 to 255. The larger the value, the stronger the imprint. A value of 0 means the filter is not applied. quality:int (default = 1) — The number of times to apply the filter. Use the flash.filters.BitmapFilterQuality constants: • BitmapFilterQuality.LOW • BitmapFilterQuality.MEDIUM • BitmapFilterQuality.HIGH For more information, see the description of the quality property. type:String (default = outer) — The placement of the filter effect. Possible values are the flash.filters.BitmapFilterType constants: • BitmapFilterType.OUTER — Glow on the outer edge of the object; the default. • BitmapFilterType.INNER — Glow on the inner edge of the object • BitmapFilterType.FULL — Glow on top of the object knockout:Boolean (default = false) — Specifies whether the object has a knockout effect. A knockout effect makes the object's fill transparent and reveals the background color of the document. The value true specifies a knockout effect; the default is false (no knockout effect). Method Detail clone()method public function clone():BitmapFilter Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 Returns a copy of this filter object. Returns BitmapFilter — A new GradientGlowFilter instance with all the same properties as the original GradientGlowFilter instance. Examples GradientGlowFilterExample.mxml <?xml version="1.0"?> <!-- Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to You under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. --> <!-- filters/examples/GradientGlowFilterExample .mxml --> <s:Application xmlns:fx="http://ns.adobe.com/mxml/2009" xmlns:mx="library://ns.adobe.com/flex/mx" xmlns:s="library://ns.adobe.com/flex/spark" creationComplete="createFilters()"> <fx:Script><![CDATA[ import spark.filters.*; import flash.filters.BitmapFilterQuality; import flash.filters.BitmapFilterType; private var myGradientGlowFilter:GradientGlowFilter; private var colors:Array = [0xFFFFFF, 0xFF0000, 0xFFFF00, 0x00CCFF]; private var alphas:Array = [0, 1, 1, 1]; private var ratios:Array = [0, 63, 126, 255]; public function createFilters():void { myGradientGlowFilter = new GradientGlowFilter(0, 45, colors, alphas, ratios, 50, 50, 2.5, BitmapFilterQuality.HIGH, BitmapFilterType.OUTER, false); b1.filters = [myGradientGlowFilter]; } ]]></fx:Script> <s:VGroup> <!-- This button has a filter applied in ActionScript. --> <s:Button id="b1" label="Click me"/> <!-- This button has a filter applied in MXML. --> <s:Button id="b2" label="Click me"> <s:filters> <s:GradientGlowFilter distance="10" angle="45" blurX="50" blurY="50" strength="2.5" quality="{BitmapFilterQuality.HIGH}" type="{BitmapFilterType.OUTER}" knockout="false"> <s:entries> <s:GradientEntry alpha="0" color="0xFFFFFF" ratio="0"/> <s:GradientEntry alpha="1" color="0xFF0000" ratio="63"/> <s:GradientEntry alpha="1" color="0xFFFF00" ratio="126"/> <s:GradientEntry alpha="1" color="0x00CCFF" ratio="255"/> </s:entries> </s:GradientGlowFilter> </s:filters> </s:Button> </s:VGroup> </s:Application>	{ "url": "http://flex.apache.org/asdoc/spark/filters/GradientGlowFilter.html", "source_domain": "flex.apache.org", "snapshot_id": "crawl=CC-MAIN-2019-04", "warc_metadata": { "Content-Length": "30213", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5BW3CIALELZ43ZF223UG45AFSJWQULL2", "WARC-Concurrent-To": "<urn:uuid:9f68462a-0027-4ef1-9685-894e3c19a827>", "WARC-Date": "2019-01-20T21:58:31Z", "WARC-IP-Address": "40.79.78.1", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WV463ZTZTSGO6CEJ6ETW7POLJKQP7ONT", "WARC-Record-ID": "<urn:uuid:5c1b6302-9218-442b-abc0-a4aa2d7c1bae>", "WARC-Target-URI": "http://flex.apache.org/asdoc/spark/filters/GradientGlowFilter.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b3901a86-5267-44af-99fa-f6657e30621f>" }, "warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-150-232-186.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 21, 58, 211, 236, 237, 273, 298, 342, 343, 813, 814, 886, 887, 1070, 1071, 1353, 1354, 1804, 1805, 1841, 1842, 1954, 1955, 1981, 1984, 1985, 2014, 2015, 2033, 2034, 2043, 2044, 2069, 2102, 2141, 2183, 2219, 2220, 2221, 2239, 2259, 2284, 2307, 2322, 2347, 2378, 2398, 2423, 2452, 2472, 2500, 2533, 2548, 2574, 2658, 2673, 2702, 2754, 2774, 2798, 2839, 2859, 2887, 2926, 2946, 2970, 3006, 3021, 3036, 3054, 3057, 3306, 3319, 3338, 3341, 3362, 3400, 3419, 3430, 3485, 3496, 3513, 3533, 3568, 3598, 3609, 3628, 3660, 3925, 3926, 3962, 3987, 4031, 4032, 4045, 4046, 4057, 4124, 4126, 4206, 4208, 4343, 4345, 4590, 4592, 4780, 4782, 5052, 5054, 5322, 5324, 5633, 5635, 5757, 5785, 5816, 5845, 5846, 5913, 5914, 5916, 6050, 6130, 6196, 6250, 6252, 6532, 6546, 6560, 6597, 6598, 6634, 6659, 6703, 6704, 6742, 6743, 6751, 6874, 6883, 6914, 6936, 6941, 6942, 7011, 7083, 7153, 7227, 7298, 7354, 7355, 7404, 7405, 7475, 7543, 7618, 7688, 7721, 7722, 7726, 7784, 7800, 7846, 7893, 7942, 7982, 7987, 8011, 8040, 8087, 8131, 8134, 8194, 8268, 8316, 8367, 8381, 8433, 8510, 8601, 8646, 8653, 8656, 8674, 8675, 8690, 8757, 8802, 8803, 8862, 8906, 8930, 8969, 9003, 9034, 9066, 9098, 9134, 9191, 9244, 9282, 9318, 9402, 9487, 9573, 9659, 9696, 9737, 9762, 9782, 9806 ], "line_end_idx": [ 21, 58, 211, 236, 237, 273, 298, 342, 343, 813, 814, 886, 887, 1070, 1071, 1353, 1354, 1804, 1805, 1841, 1842, 1954, 1955, 1981, 1984, 1985, 2014, 2015, 2033, 2034, 2043, 2044, 2069, 2102, 2141, 2183, 2219, 2220, 2221, 2239, 2259, 2284, 2307, 2322, 2347, 2378, 2398, 2423, 2452, 2472, 2500, 2533, 2548, 2574, 2658, 2673, 2702, 2754, 2774, 2798, 2839, 2859, 2887, 2926, 2946, 2970, 3006, 3021, 3036, 3054, 3057, 3306, 3319, 3338, 3341, 3362, 3400, 3419, 3430, 3485, 3496, 3513, 3533, 3568, 3598, 3609, 3628, 3660, 3925, 3926, 3962, 3987, 4031, 4032, 4045, 4046, 4057, 4124, 4126, 4206, 4208, 4343, 4345, 4590, 4592, 4780, 4782, 5052, 5054, 5322, 5324, 5633, 5635, 5757, 5785, 5816, 5845, 5846, 5913, 5914, 5916, 6050, 6130, 6196, 6250, 6252, 6532, 6546, 6560, 6597, 6598, 6634, 6659, 6703, 6704, 6742, 6743, 6751, 6874, 6883, 6914, 6936, 6941, 6942, 7011, 7083, 7153, 7227, 7298, 7354, 7355, 7404, 7405, 7475, 7543, 7618, 7688, 7721, 7722, 7726, 7784, 7800, 7846, 7893, 7942, 7982, 7987, 8011, 8040, 8087, 8131, 8134, 8194, 8268, 8316, 8367, 8381, 8433, 8510, 8601, 8646, 8653, 8656, 8674, 8675, 8690, 8757, 8802, 8803, 8862, 8906, 8930, 8969, 9003, 9034, 9066, 9098, 9134, 9191, 9244, 9282, 9318, 9402, 9487, 9573, 9659, 9696, 9737, 9762, 9782, 9806, 9822 ] }	{ "red_pajama_v2": { "ccnet_original_length": 9822, "ccnet_original_nlines": 211, "rps_doc_curly_bracket": 0.0006108700181357563, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.21019771695137024, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.020811650902032852, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.35119667649269104, "rps_doc_frac_unique_words": 0.329734206199646, "rps_doc_mean_word_length": 5.992525100708008, "rps_doc_num_sentences": 143, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.328717231750488, "rps_doc_word_count": 1204, "rps_doc_frac_chars_dupe_10grams": 0.12737353146076202, "rps_doc_frac_chars_dupe_5grams": 0.2327096313238144, "rps_doc_frac_chars_dupe_6grams": 0.22120581567287445, "rps_doc_frac_chars_dupe_7grams": 0.18586279451847076, "rps_doc_frac_chars_dupe_8grams": 0.16091476380825043, "rps_doc_frac_chars_dupe_9grams": 0.12737353146076202, "rps_doc_frac_chars_top_2gram": 0.010395010001957417, "rps_doc_frac_chars_top_3gram": 0.00498959980905056, "rps_doc_frac_chars_top_4gram": 0.010395010001957417, "rps_doc_books_importance": -784.2853393554688, "rps_doc_books_importance_length_correction": -784.2853393554688, "rps_doc_openwebtext_importance": -225.10821533203125, "rps_doc_openwebtext_importance_length_correction": -225.10821533203125, "rps_doc_wikipedia_importance": -274.38372802734375, "rps_doc_wikipedia_importance_length_correction": -274.38372802734375 }, "fasttext": { "dclm": 0.05893344059586525, "english": 0.6239806413650513, "fineweb_edu_approx": 2.7447926998138428, "eai_general_math": 0.5816951990127563, "eai_open_web_math": 0.24402391910552979, "eai_web_code": 0.5842149257659912 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-8,522,180,014,525,185,000	Welcome to the Treehouse Community Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! Looking to learn something new? Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today. Start your free trial HTML HTML Basics Images, Text and Links Images and File Paths Challenge inside the <body> display the moon.jpg located inside a folder called img. <body> </body> index.html <!DOCTYPE html> <html> <head> <title>The Moon</title> </head> <body> <img="moon" src="/img/moon.jpg" alt="Picture of a moon"/> </body> </html> 1 Answer Steven Parker Steven Parker 224,936 Points Only the properties of an element get assigned (using "="), the tag name itself always stands alone. Also, they only mention that the image is located in folder but they don't give a full path to it. So you can infer that this will be a relative reference and not an absolute one (so it won't start with "/").	{ "url": "https://teamtreehouse.com/community/inside-the-body-display-the-moonjpg-located-inside-a-folder-called-img", "source_domain": "teamtreehouse.com", "snapshot_id": "CC-MAIN-2023-14", "warc_metadata": { "Content-Length": "98734", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XPZKTQH3ABZD3KYEYEKP7LQN7OPUYC73", "WARC-Concurrent-To": "<urn:uuid:d7bc65ac-c2f3-402e-bf21-057948b7c169>", "WARC-Date": "2023-04-01T05:52:49Z", "WARC-IP-Address": "3.94.15.124", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CM5MV2MEGTFSFDQIWORGR55AGI36HRL6", "WARC-Record-ID": "<urn:uuid:898bd0e3-035f-4b0d-b4a0-8894d1c380bb>", "WARC-Target-URI": "https://teamtreehouse.com/community/inside-the-body-display-the-moonjpg-located-inside-a-folder-called-img", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:155a3670-3a3a-4625-a253-3e87a6bf4d52>" }, "warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 35, 36, 295, 296, 328, 329, 507, 508, 530, 531, 603, 604, 679, 680, 687, 688, 696, 697, 708, 725, 732, 741, 769, 779, 788, 804, 833, 868, 869, 879, 887, 888, 897, 898, 912, 926, 941, 942, 1043, 1044 ], "line_end_idx": [ 35, 36, 295, 296, 328, 329, 507, 508, 530, 531, 603, 604, 679, 680, 687, 688, 696, 697, 708, 725, 732, 741, 769, 779, 788, 804, 833, 868, 869, 879, 887, 888, 897, 898, 912, 926, 941, 942, 1043, 1044, 1252 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1252, "ccnet_original_nlines": 40, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.30534350872039795, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011450380086898804, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.22519083321094513, "rps_doc_frac_unique_words": 0.6340206265449524, "rps_doc_mean_word_length": 4.804123878479004, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.5978779792785645, "rps_doc_word_count": 194, "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.02575106918811798, "rps_doc_frac_chars_top_3gram": 0.045064378529787064, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -100.83616638183594, "rps_doc_books_importance_length_correction": -100.83616638183594, "rps_doc_openwebtext_importance": -57.786773681640625, "rps_doc_openwebtext_importance_length_correction": -57.786773681640625, "rps_doc_wikipedia_importance": -54.944644927978516, "rps_doc_wikipedia_importance_length_correction": -54.944644927978516 }, "fasttext": { "dclm": 0.04546720162034035, "english": 0.8819106817245483, "fineweb_edu_approx": 1.2367620468139648, "eai_general_math": 0.06408250331878662, "eai_open_web_math": 0.12585556507110596, "eai_web_code": 0.2908751964569092 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
1,292,879,873,803,639,600	L Neophyte Neophyte • 1 Message • 100 Points Monday, April 17th, 2023 2:38 PM Help How is someone scraping the key off the app forcing me back into a trial version? Is there not a password to protect the app from any changes being made on iPhone? Brand User Trend Security Expert • 11 Messages • 550 Points 2 months ago Hi @leonard_masi_jr, Welcome to Trend Micro Community! It's unclear what exactly you mean by "scraping the key off the app". However, I'll try to provide an answer that may be helpful. Trend Micro Mobile Security will not automatically go back to a trial version unless the app has been reinstalled. If you are already signed in, sign out of the app, then sign in again to update your subscription. To check your subscription, kindly log in on this link Let us know how it goes. Need Help? Ask the Community Latest Tech Insights Loading...	{ "url": "https://en.community.trendmicro.com/conversations/mobile-security-for-ios/help/643d59fb0d8cd95c05a9f3fc", "source_domain": "en.community.trendmicro.com", "snapshot_id": "CC-MAIN-2023-23", "warc_metadata": { "Content-Length": "112464", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GKB4KILYF7P5KN5RWVL65MBQZ5EPKJDQ", "WARC-Concurrent-To": "<urn:uuid:5d5e84ea-bf47-45da-9baf-29b6a4be8012>", "WARC-Date": "2023-06-04T00:06:24Z", "WARC-IP-Address": "34.224.129.244", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:OJU6GSMDUJHOMWJ3JAITYWRDJLCK64DS", "WARC-Record-ID": "<urn:uuid:3fecb176-039e-4468-91c4-40bb964e209e>", "WARC-Target-URI": "https://en.community.trendmicro.com/conversations/mobile-security-for-ios/help/643d59fb0d8cd95c05a9f3fc", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1cf27d19-340f-4888-9c56-dec94625e450>" }, "warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-128\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 2, 11, 12, 21, 22, 26, 27, 37, 38, 42, 43, 54, 55, 88, 89, 94, 95, 259, 260, 271, 272, 294, 295, 299, 300, 312, 313, 317, 318, 329, 330, 343, 344, 365, 366, 400, 401, 531, 532, 802, 803, 828, 829, 840, 841, 859, 860, 881, 882 ], "line_end_idx": [ 2, 11, 12, 21, 22, 26, 27, 37, 38, 42, 43, 54, 55, 88, 89, 94, 95, 259, 260, 271, 272, 294, 295, 299, 300, 312, 313, 317, 318, 329, 330, 343, 344, 365, 366, 400, 401, 531, 532, 802, 803, 828, 829, 840, 841, 859, 860, 881, 882, 892 ] }	{ "red_pajama_v2": { "ccnet_original_length": 892, "ccnet_original_nlines": 49, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3591160178184509, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016574589535593987, "rps_doc_frac_lines_end_with_ellipsis": 0.019999999552965164, "rps_doc_frac_no_alph_words": 0.18784530460834503, "rps_doc_frac_unique_words": 0.7115384340286255, "rps_doc_mean_word_length": 4.339743614196777, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0.005524860229343176, "rps_doc_unigram_entropy": 4.546061992645264, "rps_doc_word_count": 156, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06794682145118713, "rps_doc_frac_chars_dupe_6grams": 0.06794682145118713, "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.04431315138936043, "rps_doc_frac_chars_top_3gram": 0.04135894030332565, "rps_doc_frac_chars_top_4gram": 0.05022156983613968, "rps_doc_books_importance": -69.30432891845703, "rps_doc_books_importance_length_correction": -69.30432891845703, "rps_doc_openwebtext_importance": -28.132326126098633, "rps_doc_openwebtext_importance_length_correction": -19.733436584472656, "rps_doc_wikipedia_importance": -16.798063278198242, "rps_doc_wikipedia_importance_length_correction": -16.798063278198242 }, "fasttext": { "dclm": 0.06043964996933937, "english": 0.8873286247253418, "fineweb_edu_approx": 0.8414405584335327, "eai_general_math": 0.00041335998685099185, "eai_open_web_math": 0.06588214635848999, "eai_web_code": 0.000025990000722231343 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.8", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "21", "label": "Customer Support" } }, "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": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-3,400,876,629,599,781,000	Writing tests for Open-Event As our application and code base increased it became necessary to write tests for each functionality. Earlier we had tests only for basic functionalities like creating an event, editing an event, but then it is very important and also beneficial if we have tests for each and every small functionality. Hence we started writing proper tests. We divivded the tests into three folder • API • Functionality • Views All the API related tests were in the above one whereas the basic functionalities were in the second one. The last folder was further divided into three parts • Admin Tests • Super-Admin Tests • Guest Pages We had to test each and every functionality. For example let us look at the test file for the events. It looks like this: class TestEvents(OpenEventViewTestCase): def test_events_list(self): with app.test_request_context(): url = url_for('events.index_view') rv = self.app.get(url, follow_redirects=True) self.assertTrue("Manage Events" in rv.data, msg=rv.data) def test_events_create(self): with app.test_request_context(): url = url_for('events.create_view') rv = self.app.get(url, follow_redirects=True) self.assertTrue("Create Event" in rv.data, msg=rv.data) def test_events_create_post(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(POST_EVENT_DATA['name'] in rv.data, msg=rv.data) def test_events_create_post_publish(self): with app.test_request_context(): url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['state'] = 'Published' rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('unpublish' in rv.data, msg=rv.data) def test_events_create_post_publish_without_location_attempt(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['location_name'] = '' data['state'] = u'Published' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('To publish your event please review the highlighted fields below' in rv.data, msg=rv.data) def test_events_edit(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_forms = ObjectMother.get_custom_form(event.id) save_to_db(custom_forms, "Custom forms saved") url = url_for('events.edit_view', event_id=event.id) data = POST_EVENT_DATA.copy() del data['copyright'] data['name'] = 'EditTestName' data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('EditTestName' in rv.data, msg=rv.data) def test_event_view(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.details_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("event1" in rv.data, msg=rv.data) microlocation = ObjectMother.get_microlocation(event_id=event.id) track = ObjectMother.get_track(event_id=event.id) cfs = ObjectMother.get_cfs(event_id=event.id) save_to_db(track, "Track saved") save_to_db(microlocation, "Microlocation saved") save_to_db(cfs, "Call for speakers saved") rv = self.app.get(url, follow_redirects=True) self.assertTrue("event1" in rv.data, msg=rv.data) def test_event_publish(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.publish_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) event = DataGetter.get_event(event.id) self.assertEqual("Published", event.state, msg=event.state) def test_event_unpublish(self): with app.test_request_context(): event = ObjectMother.get_event() event.state = "Published" save_to_db(event, "Event saved") url = url_for('events.unpublish_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) event = DataGetter.get_event(event.id) self.assertEqual("Draft", event.state, msg=event.state) def test_event_delete(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.trash_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Your event has been deleted" in rv.data, msg=rv.data) def test_event_copy(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.copy_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Copy of event1" in rv.data, msg=rv.data) if __name__ == '__main__': unittest.main() So this is the test file for the event part. As you can see we have tests for each and every small functionality 1. test_events_list : Tests the list of events 2. test_events_create: Tests whether the event creation page is displayed 3. test_events_create_post: Tests whether the event is created on doing a POST 4. test_events_create_post_publish : Tests whether the event is published on doing a POST through Publish button 5. test_events_copy: Tests whether the event is copied properly or not Thus each functionality related to an event is tested properly. Similarly not just for events but also for the other services like sessions: import unittest from tests.api.utils_post_data import POST_SESSION_DATA, POST_SPEAKER_DATA from tests.object_mother import ObjectMother from open_event import current_app as app from open_event.helpers.data import save_to_db from flask import url_for from tests.views.view_test_case import OpenEventViewTestCase class TestSessionApi(OpenEventViewTestCase): def test_sessions_list(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session Saved") url = url_for('event_sessions.index_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Sessions" in rv.data, msg=rv.data) self.assertTrue("test" in rv.data, msg=rv.data) def test_session_create(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Create Session" in rv.data, msg=rv.data) def test_session_create_post(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") data = POST_SESSION_DATA data.update(POST_SPEAKER_DATA) url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(data['title'] in rv.data, msg=rv.data) def test_session_edit(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session saved") url = url_for('event_sessions.edit_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Edit Session" in rv.data, msg=rv.data) def test_session_edit_post(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session saved") data = POST_SESSION_DATA data['title'] = 'TestSession2' url = url_for('event_sessions.edit_view', event_id=event.id, session_id=session.id) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue("TestSession2" in rv.data, msg=rv.data) def test_session_accept(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.accept_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("The session has been accepted" in rv.data, msg=rv.data) def test_session_reject(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.reject_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("The session has been rejected" in rv.data, msg=rv.data) def test_session_delete(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.delete_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("deleted" in rv.data, msg=rv.data) def test_session_view(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event) session = ObjectMother.get_session() session.event_id = event.id save_to_db(session, "Session Saved") url = url_for('event_sessions.session_display_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Short abstract" in rv.data, msg=rv.data) def test_wrong_form_config(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertFalse("incorrectly configured" in rv.data, msg=rv.data) if __name__ == '__main__': unittest.main() We see that there are tests for each functionality of the sessions. However these tests were simple to write. However there was problem in one aspect of writing tests. In the Event creation wizard there are steps where the sponsors, tracks, rooms are dynamically added to the event. How then should we test them. I wrote the test for the creation of sponsors in step -2 def test_events_create_post(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['sponsors[name]'] = ['Sponsor 1', 'Sponsor 2'] data['sponsors[type]'] = ['Gold', 'Silver'] data['sponsors[url]'] = ["", ""] data['sponsors[description]'] = ["", ""] data['sponsors[level]'] = ["", ""] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] data = ImmutableMultiDict(data) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(POST_EVENT_DATA['name'] in rv.data, msg=rv.data) rv2 = self.app.get(url_for('events.details_view', event_id=1)) self.assertTrue(data['sponsors[name]'] in rv2.data, msg=rv2.data) Here on importing the data dict I dynamically add two sponsors to the dict. After that I convert the dict to an Immutablemulti-dict so that the multiple sponsors can be displayed. Then I pass this dict to the event creation view via a POST request and check whether the two sponsors are present in the details page or not. Thus our test system is developed and improving. Still as we develop more functionalities we will write more tests 🙂	{ "url": "http://blog.fossasia.org/writing-tests-for-open-event/", "source_domain": "blog.fossasia.org", "snapshot_id": "crawl=CC-MAIN-2017-17", "warc_metadata": { "Content-Length": "55318", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:34VLWPAB7RSJ6XJDTUNE32HHNEVRWK2E", "WARC-Concurrent-To": "<urn:uuid:0bff5eb0-9cd8-4cdd-80c6-88c4653d01c1>", "WARC-Date": "2017-04-25T22:12:20Z", "WARC-IP-Address": "104.28.28.43", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6O4K6C3FMB7IX7OWKZ4AWIV4UZ4PWTBQ", "WARC-Record-ID": "<urn:uuid:5ef07a7c-d05c-4b2d-8aa7-f50628a53ec5>", "WARC-Target-URI": "http://blog.fossasia.org/writing-tests-for-open-event/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1040a3c3-f5bd-4432-ac65-4b0191598473>" }, "warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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, 29, 30, 412, 413, 421, 439, 449, 450, 609, 610, 626, 648, 664, 665, 787, 788, 829, 861, 902, 949, 1007, 1008, 1077, 1078, 1112, 1153, 1201, 1259, 1327, 1328, 1367, 1408, 1466, 1514, 1556, 1590, 1636, 1677, 1721, 1760, 1833, 1929, 2039, 2081, 2158, 2159, 2206, 2247, 2295, 2337, 2371, 2417, 2458, 2502, 2541, 2581, 2691, 2733, 2798, 2799, 2871, 2912, 2970, 3018, 3060, 3094, 3140, 3181, 3225, 3264, 3303, 3344, 3417, 3513, 3623, 3665, 3785, 3786, 3818, 3859, 3904, 3949, 4015, 4074, 4139, 4181, 4215, 4257, 4303, 4344, 4388, 4427, 4500, 4596, 4706, 4748, 4816, 4817, 4848, 4889, 4934, 4979, 5047, 5105, 5167, 5245, 5307, 5365, 5410, 5471, 5526, 5584, 5646, 5647, 5681, 5722, 5767, 5812, 5881, 5939, 5990, 6062, 6063, 6099, 6140, 6185, 6223, 6268, 6339, 6397, 6448, 6516, 6517, 6550, 6591, 6636, 6681, 6747, 6805, 6888, 6889, 6920, 6961, 7006, 7051, 7117, 7175, 7245, 7246, 7273, 7293, 7294, 7407, 7408, 7457, 7533, 7614, 7729, 7802, 7803, 7944, 7945, 7961, 7962, 8037, 8082, 8124, 8171, 8197, 8198, 8259, 8260, 8261, 8306, 8307, 8341, 8382, 8427, 8472, 8529, 8578, 8675, 8733, 8797, 8857, 8858, 8893, 8934, 8979, 9024, 9089, 9146, 9221, 9279, 9349, 9350, 9390, 9431, 9476, 9521, 9586, 9643, 9680, 9723, 9798, 9919, 9986, 9987, 10020, 10061, 10106, 10151, 10216, 10273, 10330, 10379, 10475, 10533, 10601, 10602, 10640, 10681, 10726, 10771, 10836, 10893, 10950, 10999, 11036, 11079, 11175, 11296, 11364, 11365, 11400, 11441, 11490, 11539, 11633, 11691, 11776, 11777, 11812, 11853, 11902, 11951, 12045, 12103, 12188, 12189, 12224, 12265, 12314, 12363, 12457, 12515, 12578, 12579, 12612, 12653, 12698, 12728, 12777, 12817, 12866, 12973, 13031, 13101, 13102, 13140, 13181, 13226, 13271, 13346, 13404, 13483, 13484, 13511, 13531, 13532, 13902, 13903, 13938, 13975, 14029, 14073, 14111, 14141, 14201, 14253, 14294, 14343, 14386, 14428, 14465, 14505, 14540, 14609, 14701, 14741, 14847, 14885, 14958, 14959, 15030, 15104, 15105, 15428, 15429, 15546, 15547 ], "line_end_idx": [ 29, 30, 412, 413, 421, 439, 449, 450, 609, 610, 626, 648, 664, 665, 787, 788, 829, 861, 902, 949, 1007, 1008, 1077, 1078, 1112, 1153, 1201, 1259, 1327, 1328, 1367, 1408, 1466, 1514, 1556, 1590, 1636, 1677, 1721, 1760, 1833, 1929, 2039, 2081, 2158, 2159, 2206, 2247, 2295, 2337, 2371, 2417, 2458, 2502, 2541, 2581, 2691, 2733, 2798, 2799, 2871, 2912, 2970, 3018, 3060, 3094, 3140, 3181, 3225, 3264, 3303, 3344, 3417, 3513, 3623, 3665, 3785, 3786, 3818, 3859, 3904, 3949, 4015, 4074, 4139, 4181, 4215, 4257, 4303, 4344, 4388, 4427, 4500, 4596, 4706, 4748, 4816, 4817, 4848, 4889, 4934, 4979, 5047, 5105, 5167, 5245, 5307, 5365, 5410, 5471, 5526, 5584, 5646, 5647, 5681, 5722, 5767, 5812, 5881, 5939, 5990, 6062, 6063, 6099, 6140, 6185, 6223, 6268, 6339, 6397, 6448, 6516, 6517, 6550, 6591, 6636, 6681, 6747, 6805, 6888, 6889, 6920, 6961, 7006, 7051, 7117, 7175, 7245, 7246, 7273, 7293, 7294, 7407, 7408, 7457, 7533, 7614, 7729, 7802, 7803, 7944, 7945, 7961, 7962, 8037, 8082, 8124, 8171, 8197, 8198, 8259, 8260, 8261, 8306, 8307, 8341, 8382, 8427, 8472, 8529, 8578, 8675, 8733, 8797, 8857, 8858, 8893, 8934, 8979, 9024, 9089, 9146, 9221, 9279, 9349, 9350, 9390, 9431, 9476, 9521, 9586, 9643, 9680, 9723, 9798, 9919, 9986, 9987, 10020, 10061, 10106, 10151, 10216, 10273, 10330, 10379, 10475, 10533, 10601, 10602, 10640, 10681, 10726, 10771, 10836, 10893, 10950, 10999, 11036, 11079, 11175, 11296, 11364, 11365, 11400, 11441, 11490, 11539, 11633, 11691, 11776, 11777, 11812, 11853, 11902, 11951, 12045, 12103, 12188, 12189, 12224, 12265, 12314, 12363, 12457, 12515, 12578, 12579, 12612, 12653, 12698, 12728, 12777, 12817, 12866, 12973, 13031, 13101, 13102, 13140, 13181, 13226, 13271, 13346, 13404, 13483, 13484, 13511, 13531, 13532, 13902, 13903, 13938, 13975, 14029, 14073, 14111, 14141, 14201, 14253, 14294, 14343, 14386, 14428, 14465, 14505, 14540, 14609, 14701, 14741, 14847, 14885, 14958, 14959, 15030, 15104, 15105, 15428, 15429, 15546, 15547, 15548 ] }	{ "red_pajama_v2": { "ccnet_original_length": 15548, "ccnet_original_nlines": 311, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.12125340849161148, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0071525899693369865, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4547002613544464, "rps_doc_frac_unique_words": 0.32363978028297424, "rps_doc_mean_word_length": 9.053470611572266, "rps_doc_num_sentences": 283, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.1700758934021, "rps_doc_word_count": 1066, "rps_doc_frac_chars_dupe_10grams": 0.2489897459745407, "rps_doc_frac_chars_dupe_5grams": 0.5041964650154114, "rps_doc_frac_chars_dupe_6grams": 0.4457569122314453, "rps_doc_frac_chars_dupe_7grams": 0.4037923514842987, "rps_doc_frac_chars_dupe_8grams": 0.3424515724182129, "rps_doc_frac_chars_dupe_9grams": 0.2769661247730255, "rps_doc_frac_chars_top_2gram": 0.0569889098405838, "rps_doc_frac_chars_top_3gram": 0.03875245898962021, "rps_doc_frac_chars_top_4gram": 0.03522951155900955, "rps_doc_books_importance": -1429.67236328125, "rps_doc_books_importance_length_correction": -1429.67236328125, "rps_doc_openwebtext_importance": -785.6150512695312, "rps_doc_openwebtext_importance_length_correction": -785.6150512695312, "rps_doc_wikipedia_importance": -720.8958129882812, "rps_doc_wikipedia_importance_length_correction": -720.8958129882812 }, "fasttext": { "dclm": 0.9503911137580872, "english": 0.4719971716403961, "fineweb_edu_approx": 3.255805730819702, "eai_general_math": 0.7957473993301392, "eai_open_web_math": 0.10202693939208984, "eai_web_code": 0.8188576698303223 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
2,178,529,136,824,619,800	Md Hohn Md Hohn - 1 year ago 64 C# Question How to convert Sql Datetime query into Linq select * from Employees where DataofJoin ='2005-01-01 00:00:00.000' I wrote this Linq Query as public JsonResult Dif() { var ss = Convert.ToDateTime("2001-01-01 00:00:00.000"); var x = (from n in db.Employees where n.DataofBirth == ss select n).First(); return new JsonResult { JsonRequestBehavior = JsonRequestBehavior.AllowGet }; } But its throwing the following error: "An exception of type 'System.InvalidOperationException' occurred in System.Core.dll but was not handled in user code" Answer Source As I can Understand , This issue is because of attempt to get an item from empty object. Because you are making a call of .First() and there is an empty result returned by the query. So if you do obj.First() of an empty object it throws exception. Use obj.FirstOrDefault() To avoid the exception. And if Linq is not returning the data is an issue then use Sql Profiler to check what query is been called,or change the date filter accordingly. To avoid error Use - var x = (from n in db.Employees where n.DataofBirth == ss select n).FirstOrDefault(); Update For getting proper date, do something like this . var ss = new DateTime (2005,01,01,0,0,0); //use this date in linq query Hope it will help you. Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download	{ "url": "https://codedump.io/share/bHWWsMrs0pUY/1/how-to-convert-sql-datetime-query-into-linq", "source_domain": "codedump.io", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "42615", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6Y2N5BEVY62JFRJYOFM7D7PDXBDNQEJY", "WARC-Concurrent-To": "<urn:uuid:7dc24bc9-47d5-4f3a-ba6f-50ee6c8affcd>", "WARC-Date": "2018-02-24T06:40:56Z", "WARC-IP-Address": "50.112.74.85", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PY3CI7U4V2ENXXELURCCITE5CLR6WCJS", "WARC-Record-ID": "<urn:uuid:b3364223-4221-4846-86aa-f59e44baabc4>", "WARC-Target-URI": "https://codedump.io/share/bHWWsMrs0pUY/1/how-to-convert-sql-datetime-query-into-linq", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e7953208-8571-4cee-82f7-0e8ca10f4ac5>" }, "warc_info": "robots: classic\r\nhostname: ip-10-65-128-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 32, 44, 45, 89, 90, 158, 159, 160, 187, 188, 212, 214, 270, 302, 328, 347, 348, 426, 428, 429, 430, 468, 469, 554, 588, 589, 603, 604, 693, 694, 902, 903, 1049, 1050, 1071, 1072, 1108, 1147, 1188, 1189, 1196, 1197, 1247, 1248, 1320, 1321, 1344, 1345 ], "line_end_idx": [ 32, 44, 45, 89, 90, 158, 159, 160, 187, 188, 212, 214, 270, 302, 328, 347, 348, 426, 428, 429, 430, 468, 469, 554, 588, 589, 603, 604, 693, 694, 902, 903, 1049, 1050, 1071, 1072, 1108, 1147, 1188, 1189, 1196, 1197, 1247, 1248, 1320, 1321, 1344, 1345, 1446 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1446, "ccnet_original_nlines": 48, "rps_doc_curly_bracket": 0.0027662499342113733, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2744479477405548, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00946372002363205, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.30914825201034546, "rps_doc_frac_unique_words": 0.6018957495689392, "rps_doc_mean_word_length": 5.094786643981934, "rps_doc_num_sentences": 25, "rps_doc_symbol_to_word_ratio": 0.0031545700039714575, "rps_doc_unigram_entropy": 4.649385929107666, "rps_doc_word_count": 211, "rps_doc_frac_chars_dupe_10grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_5grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_6grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_7grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_8grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_9grams": 0.08744186162948608, "rps_doc_frac_chars_top_2gram": 0.011162789538502693, "rps_doc_frac_chars_top_3gram": 0.014883720315992832, "rps_doc_frac_chars_top_4gram": 0.016744190827012062, "rps_doc_books_importance": -135.944091796875, "rps_doc_books_importance_length_correction": -132.25364685058594, "rps_doc_openwebtext_importance": -71.82937622070312, "rps_doc_openwebtext_importance_length_correction": -71.82937622070312, "rps_doc_wikipedia_importance": -53.112300872802734, "rps_doc_wikipedia_importance_length_correction": -44.96889877319336 }, "fasttext": { "dclm": 0.1185389831662178, "english": 0.8004580736160278, "fineweb_edu_approx": 1.996484398841858, "eai_general_math": 0.098911352455616, "eai_open_web_math": 0.03460394963622093, "eai_web_code": 0.086399607360363 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.758", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
6,967,151,366,705,249,000	0x01 前言我本来是使用DNSPod的DDNS服务，但自从我撤走极路由后就再也用不了了。同时DNSPod免费用户最低的TTL仅能设为600（10分钟），不足以满足DDNS的需求。我试过很多次重启服务器或者重新拨号后都无法在短时间内更新DNS的A记录。其实DNSPod也有简单易用的API可供我编写python脚本，相对于阿里云年付的40.8元，DNSPod的年付360确实有点贵，同时DNSPod个人专业版的TTL最低也就300（5分钟），但阿里云最低却能设为1（1秒）。如果你需要阿里云的付费服务，以下是一个9折优惠码：阿里云9折优惠码：nfasn1 DNSPod DNS费用详情 DNSPod DNS费用详情阿里云DNS费用详情阿里云DNS费用详情 0x02 准备因为受限于阿里云python SDK，这里使用python2.7进行编写。运行时请使用python2.x版本运行，而使用python3.x将会出现错误。首先要在系统上安装阿里云的python SDK： #新安装的系统没有python pip，所以先安装它和其他依赖包 [[email protected] ~]# yum install python-pip gcc gcc-devel autoconf automake python-devel python-pip python-crypto python-cryptography -y #安装alidns python DSK [[email protected] ~]# pip install aliyun-python-sdk-alidns 还需要准备以下账号内容： 1. Access Key ID 2. Access Key Secret 3. 账号ID 准备好上面的内容后，将你的域名添加到阿里云解析DNS中： WechatIMG23 完成后再在这个域名下添加一个主机A记录： WechatIMG24 至此，准备工作已经完成。下面来获取域名的关键信息。 0x03 关键信息通过脚本更新DNS记录需要几个关键的信息，如下： 1. 一级域名（你的域名） 2. 主机记录（你的二级域名） 3. 记录类型（你的本地IP地址） 4. 记录ID（这个解析记录的ID） 5. 记录TTL（记录有效生存时间） 0x03.1 记录ID 其中1，2，3，5是可以确定的，而4则需要通过阿里云API获取： def check_records(dns_domain): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordsRequest.DescribeDomainRecordsRequest() request.set_DomainName(dns_domain) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request) result = result.decode() result_dict = json.JSONDecoder().decode(result) result_list = result_dict['DomainRecords']['Record'] for j in result_list: print('Subdomain：' + j['RR'].encode() + ' ' + '\| RecordId：' + j['RecordId'].encode()) return 返还的内容如下： [[email protected] aliyun_ddns]# python aliyun_ddns.py Subdomain：subdomain_1 \| RecordId：3331111111111111 Subdomain：subdomain_2 \| RecordId：3331111111111111 Subdomain：subdomain_3 \| RecordId：3331111111111111 Subdomain：subdomain_4 \| RecordId：3331111111111111 Subdomain：subdomain_5 \| RecordId：3331111111111111 Subdomain：subdomain_6 \| RecordId：3331111111111111 0x03.2 本机IP 而获取本机IP，我选用ip.cn这个网站。当使用curl访问这个网站时，它会返还IP归属地和IP地址。使用脚本获取： WechatIMG25 def my_ip_method_1(): get_ip_method = os.popen('curl -s ip.cn') get_ip_responses = get_ip_method.readlines()[0] get_ip_pattern = re.compile(r'\d+\.\d+\.\d+\.\d+') get_ip_value = get_ip_pattern.findall(get_ip_responses)[0] return get_ip_value 可能因为ip.cn这个站点受到攻击，他们的服务目前不太稳定，请使用my_ip_method_2或my_ip_method_3这两种本地IP的获取方式。 0x04 对比 \| 更新怎样才能知道IP地址是否有改变？在获取本地IP后，再通过阿里云DNS API获取上一次的记录，两者相对比，如果不一致则更新DNS记录。 0x04.1 上一次的记录 def old_ip(): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordInfoRequest.DescribeDomainRecordInfoRequest() request.set_RecordId(rc_record_id) request.set_accept_format(rc_format) result = clt.do_action(request) result = json.JSONDecoder().decode(result) result = result['Value'] return result 0x04.2 更新记录 def update_dns(dns_rr, dns_type, dns_value, dns_record_id, dns_ttl, dns_format): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = UpdateDomainRecordRequest.UpdateDomainRecordRequest() request.set_RR(dns_rr) request.set_Type(dns_type) request.set_Value(dns_value) request.set_RecordId(dns_record_id) request.set_TTL(dns_ttl) request.set_accept_format(dns_format) result = clt.do_action(request) return result 0x04.3 对比 if rc_value_old == rc_value: print 'The specified value of parameter Value is the same as old' else: update_dns(rc_rr, rc_type, rc_value, rc_record_id, rc_ttl, rc_format) 0x05 记录我不但想要更新DDNS记录，我还想记录下每一次重新拨号后获取的IP，说不定日后能做个分析什么的。那么将记录写入文件： def write_to_file(): time_now = datetime.now().strftime('%Y-%m-%d %H:%M:%S') current_script_path = sys.path[7] print current_script_path log_file = current_script_path + '/' + 'aliyun_ddns_log.txt' write = open(log_file, 'a') write.write(time_now + ' ' + str(rc_value) + '\n') write.close() return 0x06 完整脚本最新完整脚本请移步至GitHub：阿里云DDNS python脚本 # -- coding: UTF-8 -- import json import os import re import sys from datetime import datetime import requests from aliyunsdkalidns.request.v20150109 import UpdateDomainRecordRequest, DescribeDomainRecordsRequest, \ DescribeDomainRecordInfoRequest from aliyunsdkcore import client access_key_id = "" access_Key_secret = "" # 请填写你的账号ID account_id = "" # 如果填写yes，则运行程序后仅显示域名信息，并不会更新记录，用于获取解析记录ID。 # 如果填写no，则运行程序后不显示域名信息，仅更新记录。 i_dont_know_record_id = 'yes' # 请填写你的一级域名 rc_domain = '' # 请填写你的解析记录 rc_rr = '' # 请填写你的记录类型，DDNS请填写A，表示A记录 rc_type = 'A' # 请填写解析记录ID rc_record_id = '' # 请填写解析有效生存时间TTL，单位：秒 rc_ttl = '30' # 请填写返还内容格式，json，xml rc_format = 'json' def my_ip_method_1(): get_ip_method = os.popen('curl -s ip.cn') get_ip_responses = get_ip_method.readlines()[0] get_ip_pattern = re.compile(r'\d+\.\d+\.\d+\.\d+') get_ip_value = get_ip_pattern.findall(get_ip_responses)[0] return get_ip_value def my_ip_method_2(): get_ip_method = os.popen('curl -s http://ip-api.com/json') get_ip_responses = get_ip_method.readlines()[0] get_ip_responses = eval(str(get_ip_responses)) get_ip_value = get_ip_responses['query'] return get_ip_value def my_ip_method_3(): get_ip_method = requests.get('http://ifconfig.co/json').content get_ip_value = eval(get_ip_method) get_ip_value = get_ip_value['ip'] return get_ip_value def check_records(dns_domain): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordsRequest.DescribeDomainRecordsRequest() request.set_DomainName(dns_domain) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request) result = result.decode() result_dict = json.JSONDecoder().decode(result) result_list = result_dict['DomainRecords']['Record'] for j in result_list: print('Subdomain：' + j['RR'].encode() + ' ' + '\| RecordId：' + j['RecordId'].encode()) return def old_ip(): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordInfoRequest.DescribeDomainRecordInfoRequest() request.set_RecordId(rc_record_id) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request).decode() result = json.JSONDecoder().decode(result) result = result['Value'] return result def update_dns(dns_rr, dns_type, dns_value, dns_record_id, dns_ttl, dns_format): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = UpdateDomainRecordRequest.UpdateDomainRecordRequest() request.set_RR(dns_rr) request.set_Type(dns_type) request.set_Value(dns_value) request.set_RecordId(dns_record_id) request.set_TTL(dns_ttl) request.set_accept_format(dns_format) result = clt.do_action_with_exception(request) return result def write_to_file(): time_now = datetime.now().strftime('%Y-%m-%d %H:%M:%S') current_script_path = sys.path[1] log_file = current_script_path + '/' + 'aliyun_ddns_log.txt' write = open(log_file, 'a') write.write(time_now + ' ' + str(rc_value) + '\n') write.close() return if i_dont_know_record_id == 'yes': check_records(rc_domain) elif i_dont_know_record_id == 'no': rc_value = my_ip_method_3() rc_value_old = old_ip() if rc_value_old == rc_value: print('The specified value of parameter Value is the same as old') else: print(update_dns(rc_rr, rc_type, rc_value, rc_record_id, rc_ttl, rc_format)) write_to_file() 可能因为ip.cn这个站点收到攻击，他们的服务目前不太稳定，请使用my_ip_method_2或my_ip_method_3这两种本地IP的获取方式。修改第117行即可修改本地IP的获取方式。 0x07 运行将程序通过crontab每分钟运行一次，请将脚本路径修改为你的实际路径： /1 * * * root /usr/bin/python2.7 /usr/local/shell/aliyun_ddns.py > /dev/null 1>/dev/null 0x08 结语其实这个脚本也可以更新其他类型的DNS记录，例如：CNAME，TXT等，只要知道解析记录ID即可。经过近3天的运行，一切正常。	{ "url": "https://ngx.hk/2016/08/22/%E9%80%9A%E8%BF%87python%E5%B0%86%E9%98%BF%E9%87%8C%E4%BA%91dns%E8%A7%A3%E6%9E%90%E4%BD%9C%E4%B8%BAddns%E4%BD%BF%E7%94%A8.html", "source_domain": "ngx.hk", "snapshot_id": "crawl=CC-MAIN-2022-27", "warc_metadata": { "Content-Length": "186179", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RIL3ENKPYFXF476VSUR2ACDLM5N6SL3F", "WARC-Concurrent-To": "<urn:uuid:dd052b25-ad4f-4f24-9b48-98f8b9448761>", "WARC-Date": "2022-06-24T23:24:47Z", "WARC-IP-Address": "172.67.142.155", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:TVIABCC273Z2KLZTIOGRRVB5VBXL76DY", "WARC-Record-ID": "<urn:uuid:12f54898-2db2-4848-abe0-4cdeffef02b8>", "WARC-Target-URI": "https://ngx.hk/2016/08/22/%E9%80%9A%E8%BF%87python%E5%B0%86%E9%98%BF%E9%87%8C%E4%BA%91dns%E8%A7%A3%E6%9E%90%E4%BD%9C%E4%B8%BAddns%E4%BD%BF%E7%94%A8.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d454990a-e7b4-4901-a95c-f38a782933bc>" }, "warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-185\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 8, 9, 129, 130, 242, 243, 269, 270, 286, 301, 316, 327, 338, 339, 347, 348, 425, 426, 451, 452, 485, 624, 625, 646, 706, 707, 720, 721, 740, 763, 773, 774, 803, 804, 816, 817, 838, 839, 851, 852, 878, 879, 889, 890, 915, 916, 932, 950, 970, 991, 1012, 1013, 1025, 1026, 1059, 1060, 1091, 1167, 1241, 1280, 1321, 1372, 1401, 1453, 1510, 1536, 1630, 1641, 1642, 1651, 1652, 1708, 1758, 1808, 1858, 1908, 1958, 2008, 2009, 2021, 2022, 2081, 2082, 2094, 2095, 2117, 2163, 2215, 2270, 2333, 2357, 2358, 2434, 2435, 2448, 2449, 2466, 2467, 2519, 2520, 2534, 2535, 2549, 2625, 2705, 2744, 2785, 2821, 2868, 2897, 2915, 2916, 2928, 2929, 3010, 3086, 3154, 3181, 3212, 3245, 3285, 3314, 3356, 3392, 3410, 3411, 3421, 3422, 3451, 3521, 3527, 3601, 3602, 3610, 3611, 3670, 3671, 3692, 3752, 3790, 3820, 3885, 3917, 3972, 3990, 4001, 4002, 4012, 4013, 4047, 4048, 4072, 4073, 4085, 4095, 4105, 4116, 4146, 4147, 4163, 4268, 4304, 4337, 4338, 4357, 4380, 4381, 4393, 4409, 4410, 4454, 4484, 4514, 4515, 4527, 4542, 4543, 4555, 4566, 4567, 4594, 4608, 4609, 4621, 4639, 4640, 4662, 4676, 4677, 4698, 4717, 4718, 4719, 4741, 4787, 4839, 4894, 4957, 4981, 4982, 4983, 5005, 5068, 5120, 5171, 5216, 5240, 5241, 5242, 5264, 5332, 5371, 5409, 5433, 5434, 5435, 5466, 5542, 5616, 5655, 5696, 5747, 5776, 5828, 5885, 5911, 6005, 6016, 6017, 6018, 6032, 6108, 6188, 6227, 6268, 6328, 6375, 6404, 6422, 6423, 6424, 6505, 6581, 6649, 6676, 6707, 6740, 6780, 6809, 6851, 6902, 6920, 6921, 6922, 6943, 7003, 7041, 7106, 7138, 7193, 7211, 7222, 7223, 7224, 7259, 7288, 7324, 7356, 7384, 7417, 7492, 7502, 7587, 7611, 7612, 7688, 7689, 7711, 7712, 7720, 7721, 7758, 7759, 7851, 7852, 7860, 7861, 7911, 7912 ], "line_end_idx": [ 8, 9, 129, 130, 242, 243, 269, 270, 286, 301, 316, 327, 338, 339, 347, 348, 425, 426, 451, 452, 485, 624, 625, 646, 706, 707, 720, 721, 740, 763, 773, 774, 803, 804, 816, 817, 838, 839, 851, 852, 878, 879, 889, 890, 915, 916, 932, 950, 970, 991, 1012, 1013, 1025, 1026, 1059, 1060, 1091, 1167, 1241, 1280, 1321, 1372, 1401, 1453, 1510, 1536, 1630, 1641, 1642, 1651, 1652, 1708, 1758, 1808, 1858, 1908, 1958, 2008, 2009, 2021, 2022, 2081, 2082, 2094, 2095, 2117, 2163, 2215, 2270, 2333, 2357, 2358, 2434, 2435, 2448, 2449, 2466, 2467, 2519, 2520, 2534, 2535, 2549, 2625, 2705, 2744, 2785, 2821, 2868, 2897, 2915, 2916, 2928, 2929, 3010, 3086, 3154, 3181, 3212, 3245, 3285, 3314, 3356, 3392, 3410, 3411, 3421, 3422, 3451, 3521, 3527, 3601, 3602, 3610, 3611, 3670, 3671, 3692, 3752, 3790, 3820, 3885, 3917, 3972, 3990, 4001, 4002, 4012, 4013, 4047, 4048, 4072, 4073, 4085, 4095, 4105, 4116, 4146, 4147, 4163, 4268, 4304, 4337, 4338, 4357, 4380, 4381, 4393, 4409, 4410, 4454, 4484, 4514, 4515, 4527, 4542, 4543, 4555, 4566, 4567, 4594, 4608, 4609, 4621, 4639, 4640, 4662, 4676, 4677, 4698, 4717, 4718, 4719, 4741, 4787, 4839, 4894, 4957, 4981, 4982, 4983, 5005, 5068, 5120, 5171, 5216, 5240, 5241, 5242, 5264, 5332, 5371, 5409, 5433, 5434, 5435, 5466, 5542, 5616, 5655, 5696, 5747, 5776, 5828, 5885, 5911, 6005, 6016, 6017, 6018, 6032, 6108, 6188, 6227, 6268, 6328, 6375, 6404, 6422, 6423, 6424, 6505, 6581, 6649, 6676, 6707, 6740, 6780, 6809, 6851, 6902, 6920, 6921, 6922, 6943, 7003, 7041, 7106, 7138, 7193, 7211, 7222, 7223, 7224, 7259, 7288, 7324, 7356, 7384, 7417, 7492, 7502, 7587, 7611, 7612, 7688, 7689, 7711, 7712, 7720, 7721, 7758, 7759, 7851, 7852, 7860, 7861, 7911, 7912, 7926 ] }	{ "red_pajama_v2": { "ccnet_original_length": 7926, "ccnet_original_nlines": 289, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.04708363115787506, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03794800117611885, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5284609794616699, "rps_doc_frac_unique_words": 0.5292841792106628, "rps_doc_mean_word_length": 12.501084327697754, "rps_doc_num_sentences": 113, "rps_doc_symbol_to_word_ratio": 0.010541110299527645, "rps_doc_unigram_entropy": 5.22925329208374, "rps_doc_word_count": 461, "rps_doc_frac_chars_dupe_10grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_5grams": 0.47995835542678833, "rps_doc_frac_chars_dupe_6grams": 0.4674648642539978, "rps_doc_frac_chars_dupe_7grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_8grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_9grams": 0.42408469319343567, "rps_doc_frac_chars_top_2gram": 0.030192609876394272, "rps_doc_frac_chars_top_3gram": 0.04580947011709213, "rps_doc_frac_chars_top_4gram": 0.05622072145342827, "rps_doc_books_importance": -525.1983032226562, "rps_doc_books_importance_length_correction": -525.1983032226562, "rps_doc_openwebtext_importance": -271.088623046875, "rps_doc_openwebtext_importance_length_correction": -271.088623046875, "rps_doc_wikipedia_importance": -165.58889770507812, "rps_doc_wikipedia_importance_length_correction": -165.58889770507812 }, "fasttext": { "dclm": 0.9999939203262329, "english": 0.11155085265636444, "fineweb_edu_approx": 3.60664701461792, "eai_general_math": 0.9549994468688965, "eai_open_web_math": 0.037448231130838394, "eai_web_code": 0.9123329520225525 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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
3,391,821,776,774,416,000	LxD Series: Laravel Basics Before we dive into coding Laravel based app, let’s learn what’s it all about. Laravel is an MVC based framework for rapid PHP based web application development. MVC(Model-View-Controller) is a design pattern used to write softwares. It consist of three parts: • Model: This component deals with data and it’s manipulation. Usually you deal with database(RDBMS,NoSQL) here but this is not necessary at all. Your model could interact with a flat file or some remote API for data manipulation. • View: The data which was processed or manipulated on model layer is shown by Views to end-users so that they could interact with the app. • Controller: Controller actually sits between View and Model and works as a bridge between two. Controller could be used to processed the data you fetch from Model and make it presentable to view as per your need. Routing In simplest word Routing is a mechanism used to map one kind of URL to another. Routing is used to convert ugly looking URLs to user-friendly or SEO friendly URL. So if there’s a URL http://example.com/users/user?id=12&name=Jhon, routing can convert it to http://exampe.com/users/user/12/Jhon. Prior to MVC frameworks we used to write multiple rules to cater different kind of URLS. MVC frameworks like Larave provides an easy way to come up a URL format as per your need. Behind the scene it still uses .htacess file. Laravel takes the benefit of Closure to implement routing. Migrations Usually when you create a database driven app you will create a sql script to create tables in db. Later when you go in production you have to run script on remote server. While working in a team and multiple developers making changes in a single database. It gets difficult to keep a track of it. Migrations help you to overcome this issue. You create migration files which contains timestamp in file name which contains an expressive syntax to create/drop tables. You can run a certain migration command on your local machine or remote server that will execute script in order. Laravel provides easy to use command to perform various migration related operations. For instance: Will create a migration file that will be responsible to create a table users. It will create a file like this: create creates a table users while down drops it. That’s all folks. In coming post we will be implementing routes and design in our Laravel app. Stay tuned! Join with me and let’s learn together! * indicates required Leave a Reply Your email address will not be published. Required fields are marked *	{ "url": "http://blog.adnansiddiqi.me/lxd-series-laravel-basics/", "source_domain": "blog.adnansiddiqi.me", "snapshot_id": "crawl=CC-MAIN-2017-13", "warc_metadata": { "Content-Length": "30985", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RBJSA6A23NWT27XN54SNKWLGAOOZ6VMG", "WARC-Concurrent-To": "<urn:uuid:383fd1bf-0f08-4e53-afd1-5151bd632aff>", "WARC-Date": "2017-03-27T10:45:35Z", "WARC-IP-Address": "129.121.16.226", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:UAOS5GYB3JAKSCHCRUD4KM57M7ZZKRDC", "WARC-Record-ID": "<urn:uuid:c5da8e84-4728-42b9-8b4c-d9aadac54b31>", "WARC-Target-URI": "http://blog.adnansiddiqi.me/lxd-series-laravel-basics/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2af8a3b7-396c-410a-80bd-b3cf7795112b>" }, "warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 27, 28, 107, 108, 290, 291, 524, 666, 883, 884, 892, 893, 1471, 1472, 1483, 1484, 2064, 2065, 2165, 2166, 2278, 2279, 2329, 2330, 2437, 2438, 2440, 2441, 2443, 2444, 2483, 2484, 2505, 2506, 2507, 2521, 2522 ], "line_end_idx": [ 27, 28, 107, 108, 290, 291, 524, 666, 883, 884, 892, 893, 1471, 1472, 1483, 1484, 2064, 2065, 2165, 2166, 2278, 2279, 2329, 2330, 2437, 2438, 2440, 2441, 2443, 2444, 2483, 2484, 2505, 2506, 2507, 2521, 2522, 2592 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2592, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4000000059604645, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.024528300389647484, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1471698135137558, "rps_doc_frac_unique_words": 0.5128204822540283, "rps_doc_mean_word_length": 4.8088579177856445, "rps_doc_num_sentences": 36, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.026647567749023, "rps_doc_word_count": 429, "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.014541929587721825, "rps_doc_frac_chars_top_3gram": 0.015996120870113373, "rps_doc_frac_chars_top_4gram": 0.012603010050952435, "rps_doc_books_importance": -237.1290283203125, "rps_doc_books_importance_length_correction": -237.1290283203125, "rps_doc_openwebtext_importance": -162.61610412597656, "rps_doc_openwebtext_importance_length_correction": -162.61610412597656, "rps_doc_wikipedia_importance": -121.70683288574219, "rps_doc_wikipedia_importance_length_correction": -121.70683288574219 }, "fasttext": { "dclm": 0.12431126832962036, "english": 0.8847239017486572, "fineweb_edu_approx": 2.428980827331543, "eai_general_math": 0.003215370001271367, "eai_open_web_math": 0.0636906623840332, "eai_web_code": 0.004618590231984854 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,830,796,281,796,147,000	1//===- MsgPackWriter.h - Simple MsgPack writer ------------------- C++ --===// 2// 3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4// See https://llvm.org/LICENSE.txt for license information. 5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6// 7//===----------------------------------------------------------------------===// 8/// 9/// \file 10/// This file contains a MessagePack writer. 11/// 12/// See https://github.com/msgpack/msgpack/blob/master/spec.md for the full 13/// specification. 14/// 15/// Typical usage: 16/// \code 17/// raw_ostream output = GetOutputStream(); 18/// msgpack::Writer MPWriter(output); 19/// MPWriter.writeNil(); 20/// MPWriter.write(false); 21/// MPWriter.write("string"); 22/// // ... 23/// \endcode 24/// 25/// 26//===----------------------------------------------------------------------===// 27 28#ifndef LLVM_BINARYFORMAT_MSGPACKWRITER_H 29#define LLVM_BINARYFORMAT_MSGPACKWRITER_H 30 31#include "llvm/BinaryFormat/MsgPack.h" 32#include "llvm/Support/EndianStream.h" 33#include "llvm/Support/MemoryBuffer.h" 34#include "llvm/Support/raw_ostream.h" 35 36namespace llvm { 37namespace msgpack { 38 39/// Writes MessagePack objects to an output stream, one at a time. 40class Writer { 41public: 42 /// Construct a writer, optionally enabling "Compatibility Mode" as defined 43 /// in the MessagePack specification. 44 /// 45 /// When in \p Compatible mode, the writer will write \c Str16 formats 46 /// instead of \c Str8 formats, and will refuse to write any \c Bin formats. 47 /// 48 /// \param OS stream to output MessagePack objects to. 49 /// \param Compatible when set, write in "Compatibility Mode". 50 Writer(raw_ostream &OS, bool Compatible = false); 51 52 Writer(const Writer &) = delete; 53 Writer &operator=(const Writer &) = delete; 54 55 /// Write a \em Nil to the output stream. 56 /// 57 /// The output will be the \em nil format. 58 void writeNil(); 59 60 /// Write a \em Boolean to the output stream. 61 /// 62 /// The output will be a \em bool format. 63 void write(bool b); 64 65 /// Write a signed integer to the output stream. 66 /// 67 /// The output will be in the smallest possible \em int format. 68 /// 69 /// The format chosen may be for an unsigned integer. 70 void write(int64_t i); 71 72 /// Write an unsigned integer to the output stream. 73 /// 74 /// The output will be in the smallest possible \em int format. 75 void write(uint64_t u); 76 77 /// Write a floating point number to the output stream. 78 /// 79 /// The output will be in the smallest possible \em float format. 80 void write(double d); 81 82 /// Write a string to the output stream. 83 /// 84 /// The output will be in the smallest possible \em str format. 85 void write(StringRef s); 86 87 /// Write a memory buffer to the output stream. 88 /// 89 /// The output will be in the smallest possible \em bin format. 90 /// 91 /// \warning Do not use this overload if in \c Compatible mode. 92 void write(MemoryBufferRef Buffer); 93 94 /// Write the header for an \em Array of the given size. 95 /// 96 /// The output will be in the smallest possible \em array format. 97 // 98 /// The header contains an identifier for the \em array format used, as well 99 /// as an encoding of the size of the array. 100 /// 101 /// N.B. The caller must subsequently call \c Write an additional \p Size 102 /// times to complete the array. 103 void writeArraySize(uint32_t Size); 104 105 /// Write the header for a \em Map of the given size. 106 /// 107 /// The output will be in the smallest possible \em map format. 108 // 109 /// The header contains an identifier for the \em map format used, as well 110 /// as an encoding of the size of the map. 111 /// 112 /// N.B. The caller must subsequently call \c Write and additional \c Size*2 113 /// times to complete the map. Each even numbered call to \c Write defines a 114 /// new key, and each odd numbered call defines the previous key's value. 115 void writeMapSize(uint32_t Size); 116 117 /// Write a typed memory buffer (an extension type) to the output stream. 118 /// 119 /// The output will be in the smallest possible \em ext format. 120 void writeExt(int8_t Type, MemoryBufferRef Buffer); 121 122private: 123 support::endian::Writer EW; 124 bool Compatible; 125}; 126 127} // end namespace msgpack 128} // end namespace llvm 129 130#endif // LLVM_BINARYFORMAT_MSGPACKWRITER_H 131	{ "url": "https://code.woboq.org/llvm/llvm/include/llvm/BinaryFormat/MsgPackWriter.h.html", "source_domain": "code.woboq.org", "snapshot_id": "crawl=CC-MAIN-2022-21", "warc_metadata": { "Content-Length": "22137", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HOYVVLYKSJGEAS53SF3GDGBDUQH3L4CW", "WARC-Concurrent-To": "<urn:uuid:d6eb069f-20bc-490a-af57-c925c8b0a74c>", "WARC-Date": "2022-05-19T04:53:59Z", "WARC-IP-Address": "134.119.46.51", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:TN4I2SOCDAHJXHEXWJMDPWBNSZ2CQMSM", "WARC-Record-ID": "<urn:uuid:921f2b67-0fbd-4587-943d-978d40c21cf6>", "WARC-Target-URI": "https://code.woboq.org/llvm/llvm/include/llvm/BinaryFormat/MsgPackWriter.h.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f7c8136d-2a8d-418f-ac98-d8d689b1d0b7>" }, "warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-60\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 1, 83, 87, 169, 231, 291, 295, 377, 382, 393, 440, 446, 524, 545, 551, 572, 584, 630, 670, 697, 726, 758, 771, 786, 792, 798, 881, 884, 928, 972, 975, 1016, 1057, 1098, 1138, 1141, 1160, 1182, 1185, 1254, 1271, 1281, 1360, 1401, 1408, 1482, 1562, 1569, 1627, 1693, 1746, 1749, 1785, 1832, 1835, 1880, 1887, 1933, 1953, 1956, 2005, 2012, 2057, 2080, 2083, 2135, 2142, 2209, 2216, 2273, 2299, 2302, 2357, 2364, 2431, 2458, 2461, 2520, 2527, 2596, 2621, 2624, 2668, 2675, 2742, 2770, 2773, 2824, 2831, 2898, 2905, 2972, 3011, 3014, 3074, 3081, 3150, 3156, 3236, 3284, 3292, 3370, 3407, 3447, 3451, 3509, 3517, 3585, 3592, 3671, 3718, 3726, 3807, 3888, 3966, 4004, 4008, 4086, 4094, 4162, 4218, 4222, 4234, 4266, 4287, 4293, 4297, 4327, 4354, 4358, 4405 ], "line_end_idx": [ 1, 83, 87, 169, 231, 291, 295, 377, 382, 393, 440, 446, 524, 545, 551, 572, 584, 630, 670, 697, 726, 758, 771, 786, 792, 798, 881, 884, 928, 972, 975, 1016, 1057, 1098, 1138, 1141, 1160, 1182, 1185, 1254, 1271, 1281, 1360, 1401, 1408, 1482, 1562, 1569, 1627, 1693, 1746, 1749, 1785, 1832, 1835, 1880, 1887, 1933, 1953, 1956, 2005, 2012, 2057, 2080, 2083, 2135, 2142, 2209, 2216, 2273, 2299, 2302, 2357, 2364, 2431, 2458, 2461, 2520, 2527, 2596, 2621, 2624, 2668, 2675, 2742, 2770, 2773, 2824, 2831, 2898, 2905, 2972, 3011, 3014, 3074, 3081, 3150, 3156, 3236, 3284, 3292, 3370, 3407, 3447, 3451, 3509, 3517, 3585, 3592, 3671, 3718, 3726, 3807, 3888, 3966, 4004, 4008, 4086, 4094, 4162, 4218, 4222, 4234, 4266, 4287, 4293, 4297, 4327, 4354, 4358, 4405, 4408 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4408, "ccnet_original_nlines": 131, "rps_doc_curly_bracket": 0.0013611599570140243, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19301848113536835, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01745380088686943, "rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182, "rps_doc_frac_no_alph_words": 0.4271047115325928, "rps_doc_frac_unique_words": 0.47519999742507935, "rps_doc_mean_word_length": 4.844799995422363, "rps_doc_num_sentences": 56, "rps_doc_symbol_to_word_ratio": 0.008213549852371216, "rps_doc_unigram_entropy": 5.057499408721924, "rps_doc_word_count": 625, "rps_doc_frac_chars_dupe_10grams": 0.031043589115142822, "rps_doc_frac_chars_dupe_5grams": 0.1882430613040924, "rps_doc_frac_chars_dupe_6grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_7grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_8grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_9grams": 0.10634081810712814, "rps_doc_frac_chars_top_2gram": 0.05350065976381302, "rps_doc_frac_chars_top_3gram": 0.04293262958526611, "rps_doc_frac_chars_top_4gram": 0.04953765124082565, "rps_doc_books_importance": -376.7179870605469, "rps_doc_books_importance_length_correction": -376.7179870605469, "rps_doc_openwebtext_importance": -276.1429138183594, "rps_doc_openwebtext_importance_length_correction": -276.1429138183594, "rps_doc_wikipedia_importance": -156.772705078125, "rps_doc_wikipedia_importance_length_correction": -156.772705078125 }, "fasttext": { "dclm": 0.977286159992218, "english": 0.5343935489654541, "fineweb_edu_approx": 2.8326990604400635, "eai_general_math": 0.9870448708534241, "eai_open_web_math": 0.7040668725967407, "eai_web_code": 0.7642819881439209 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
817,575,042,212,235,900	User Tools Site Tools “0 = 1 (only for Metroids!)” return_of_samus:data_locations:ram_map This is an old revision of the document! Return of Samus: RAM Map An in-progress RAM map to aid in custom assembly and ROM disassembly. Overview 0000-3FFF: 16KB ROM Bank (fixed - bank 0) 4000-7FFF: 16KB ROM Bank (swappable) 8000-9FFF: 8KB Video RAM A000-BFFF: 8KB Save RAM C000-DFFF: 8KB Work RAM E000-FDFF: Echo RAM (unused) FE00-FE9F: OAM FEA0-FEFF: Not usable FF00-FF7F: I/O Ports FF80-FFFE: High RAM FFFF: Interrupt enable register VRAM 8000-97FF: VRAM tiles 8000-87AF: Samus 8080-9F: Arm cannon 8B00-8EFF: Enemies 0x8C00-8E2F: Characters if room has message box (probably loaded with chozo?) 9000-97FF: Background 9800-9FFF: VRAM tilemap 9800-9BFF: Background 9C00-9FFF: Window 9C00: Status bar 9C20: Message SRAM A000-A03F: File 1 + 00-07: 0123456789ABCDEF + 08: Samus' Y position + 0A: Samus' X position + 0C: Screen Y position + 0E: Screen X position + 10: Enemy tiles source address (2 bytes) + 12: Background tiles source bank + 13: Background tiles source address (2 bytes) + 15: Metatile definitions source address (bank 8, 2 bytes) + 17: Source address of data for $DC00..FF (bank 8, 2 bytes) + 19: Bank for current room + 1A: Samus passable block threshold + 1B: Enemy passable block threshold + 1C: Projectile passable block threshold + 1D: Samus' equipment + 1E: Samus' beam + 1F: Samus' energy tanks + 20: Samus' health + 22: Samus' max missiles + 24: Samus' missiles + 26: Direction Samus is facing + 27: Acid damage + 28: Spike damage + 29: Real number of Metroids remaining + 2A: Song for room + 2B: In-game timer, minutes + 2C: In-game timer, hours + 2D: Number of Metroids remaining A040-A07F: File 2 A080-A0BF: File 3 A0C0: Last used save slot A800-ACE2: Written to in credits [$6:7920..7E02] B000-B1BF: File 1 Item/Metroid data (0x40 bytes per map) B200-B3BF: File 2 Item/Metroid data (verify) B400-B5BF: File 3 Item/Metroid data WRAM C000-9F: OAM buffer (gets copied by the sprite DMA) + 0: Y position + 1: X position + 2: Tile number + 3: Attributes 10: Palette 20: X flip 40: Y flip 80: Priority (set: behind background) C203: Tile Y (see $22BC) C204: Tile X (see $22BC) C205: Scroll Y C206: Scroll X C215: Tilemap address of ([$C204], [$C203]) (see $22BC) C308-37: Ch slots of 4 bytes according to $3:6E36 + 3: XOR'd with 10h in $6E36 every fourth frame C3A1: Scroll X for LCD interrupt handler type = 1 C3A8: X position of Metroid Queen's head on screen C3A9: Y position of Metroid Queen's head on screen C3AA: A two-byte pointer to LCD interrupt data C3D2: Background palette for LCD interrupt handler type = 1 C3D3: Metroid Queen's health C3EF: Set to 1 in $3:6E36 if 0 < [Metroid Queen's health] < 32h, probably an aggression flag C3F1: Set to 1 in $3:6E36 if 0 < [Metroid Queen's health] < 64h, probably an aggression flag C407: Set to [$D069] in $2:4000 C40F: bottom-most visible metatile row index in map * $10 (big-endian word). C411: top-most visible metatile row index in map * $10 (big-endian word). C413: right-most visible metatile column index in map * $10 (big-endian word). C415: left-most visible metatile column index in map * $10 (big-endian word). C418: Set to [$D058] in $2:4000 C422: Cleared by $2EE3, set to 1 by $1FF5 C423: Value for $D00F in $2EE3, cleared by $1FF5 C424: Read by $2EE3, set to [$D078] by $1FF5 C430: Used as index for pointer table at $1:5AB1 C432: Scroll Y two frames ago (according to $3:4000) C433: Scroll Y one frame ago (according to $3:4000) C434: Scroll X two frames ago (according to $3:4000) C435: Scroll X one frame ago (according to $3:4000) C44B: Checked and set in $2:4000, previous value for $C458 in $239C C459: Used by $1:7A6C (when saving to SRAM), decides where in C540.. to process for $C900 C45C: Used as index for table at $1:729C, value for $FFEA C500-FE: Object spawn states (map-specific) C500-C53F: Non-persistent object (e.g. enemy) spawn states 01: Spawned in object table ("visible") 02: Dead/acquired FF: Not spawned C540-7F: Persistent object (e.g. item, Metroid) spawn states C600..C7FF: Enemy data. 20h byte slots according to $30BB, current address is kept in $D05E + 0: Flags. If bits 0-3 clear, $30BB executes $30EA on slot. If bit 7 is set sprite is invisible (blinking). + 1: Y coordinate. Value for $FFB7 in $30EA + 2: X coordinate. Value for $FFB8 in $30EA + 3: Metasprite number. Value for $FFB9 in $30EA + 4: Priority bit ($80) for sprites. Value for $FFBF in $30EA + 5: Sprite flip flags ($20 for horizontal, $40 for vertical) + 6: Low nibble is blink frames remaining. Bit 4 is sprite palette flag. + A: Frozen frame counter. Increments by 2 every 4 frames. 0 is not frozen, 1-$C4 is frozen, $C5-$D0 is thawing. + B: Health + 1D: Map object slot index C900-CABF: Item/Metroid data bytes (0x40 per map, gets saved to SRAM) CEC0-CFFF: Audio data CEC0: Tone/sweep channel sound effect CEC0: Tone/sweep channel sound effect to play 0: Nothing 1: Jumping 2: Hi-jumping 3: Screw attacking 4: Uncrouching / turning around / landing 5: Crouching / unmorphing 6: Morphing 7: Shooting beam 8: Shooting missile 9: Shooting ice beam Ah: Shooting plasma beam Bh: Shooting spazer beam Ch: Picked up missile drop Dh: Spider ball Eh: Picked up energy drop Fh: Shot missile door with beam 10h: 11h: 12h: 13h: Bomb laid 14h: 15h: Option select / missile select 16h: Shooting wave beam 17h: 18h: Samus' health changed 19h: No missile dud shot 1Ah: 1Bh: Metroid cry 1Ch: Saved 1Dh: 1Eh: Unpaused CEC1: Tone/sweep channel sound effect playing CEC3: Tone/sweep channel sound effect timer CEC7: Tone channel sound effect CEC7: Tone channel sound effect to play 0: Nothing 1: Nothing 2: Nothing 3: Metroid Queen cry 4: Baby Metroid hatched / clearing blocks 5: Baby Metroid cry 6: Metroid Queen hurt cry 7: CEC8: Tone channel sound effect playing CECA: Tone channel sound effect timer CECE-CED4: Would be the wave channel sound effect, but is unused (only cleared) and CEE6 is exclusively used instead. CED5: Noise channel sound effect CED5: Noise channel sound effect to play 0: Nothing 1: Enemy shot 2: Enemy killed 3: 4: Shot block destroyed 5: Metroid hurt 6: Samus hurt 7: Acid damage 8: Shot missile door with missile 9: Metroid Queen cry Ah: Metroid Queen hurt cry Bh: Samus killed Ch: Bomb detonated Dh: Metroid killed Eh: Fh: 10h Footsteps 11h: 12h: 13h: 14h: 15h: 16h: Baby Metroid hatched / clearing blocks 17h: Baby Metroid cry 18h: 19h: 1Ah: CED6: Noise channel sound effect playing CED8: Noise channel sound effect timer CEDC: Song to play 0: Nothing 1: Baby Metroid 2: Metroid Queen battle 3: Chozo ruins 4: Main caves 5: Sub caves 1 6: Sub caves 2 7: Sub caves 3 8: Final caves 9: Metroid hive Ah: Item-get Bh: Metroid Queen hallway Ch: Metroid battle Dh: Sub caves 4 Eh: Earthquake Fh: Killed Metroid 10h: Nothing 11h: Title 12h: Samus fanfare 13h: Reach the gunship 14h: Chozo ruins, same as 3 15h: Main caves, no intro 16h: Sub caves 1, no intro 17h: Sub caves 2, no intro 18h: Sub caves 3, no intro 19h: Final caves, same as 8 1Ah: Metroid hive, same as 9 1Bh: Item-get, same as Ah 1Ch: Metroid Queen hallway, same as Bh 1Dh: Metroid battle, same as Ch 1Eh: Sub caves 4, no intro 1Fh: Metroid hive with intro 20h: Missile pickup CEDD: Song playing CEDE: Isolated sound effect to play 0: Go to $42EA 1: Go to $432B, play item-get music 3: Go to $4390 (restores some audio state) 5: Go to $4335, play missile pickup music 8: Go to $43FB Eh: Go to $433F, play earthquake music FFh: $CEDE = 0, $CEDF = 0, go to $42FA Otherwise: Go to $42FA CEDF: Isolated sound effect playing If [$CEDE] = 0: 2: Go to $43C4 (set by isolated sound effect to play = 3, restores some audio state) 8: Go to $4418 Otherwise: Go to $42FA CEE4: Current tone/sweep channel sound effect CEE5: Current tone channel sound effect CEE6: Low health beep / wave channel sound effect 0: Samus' health >= 50 1: Samus' health < 20 2: Samus' health < 30 3: Samus' health < 40 4: Samus' health < 50 CEE7: Current noise channel sound effect CF00-60: CF00: Music note offset. Set to [$5F30 + ([song to play] - 1) * 2] & ~1 in $48A0 CF01: Pointer to value for $CF34/$CF36. Set to [$5F30 + ([song to play] - 1) * 2 + 1] in $48A0 CF03: Working sound channel (1/2/3/4) CF04: Set to 1 if [$CF38] != 0 in $48A0 CF05: Set to 2 if [$CF41] != 0 in $48A0 CF06: Set to 3 if [$CF4A] != 0 in $48A0 CF07: Set to 4 if [$CF53] != 0 in $48A0 CF08: Checked to mirror $CF0B/0C to $CF10/11 in $497A CF09: Pointer to wave pattern data, 10h bytes CF0B: Working sound channel sweep / enable CF0C: Working sound channel sound length / wave pattern duty CF0D: Working sound channel envelope / volume CF0E: Working sound channel frequency / noise channel polynomial counter CF0F: Working noise channel counter control CF10-23: Audio channel options (which conveniently correspond with FF10-23) CF10: Tone/sweep channel sweep CF11: Tone/sweep channel sound length / wave pattern duty CF12: Tone/sweep channel envelope CF13: Tone/sweep channel frequency CF15: Unused CF16: Tone channel sound length / wave pattern duty CF17: Tone channel envelope CF18: Tone channel frequency CF1A: Wave channel enable CF1B: Wave channel sound length CF1C: Wave channel volume CF1D: Wave channel frequency CF1F: Unused CF20: Noise channel sound length CF21: Noise channel envelope CF22: Noise channel polynomial counter CF23: Noise channel counter control CF26: Song tone/sweep channel instruction pointer CF28: Song tone channel instruction pointer CF2A: Song wave channel instruction pointer CF2C: Song noise channel instruction pointer CF2E: A 12 frame timer CF2F-37: Working song sound channel options CF2F: Instruction pointer F1 ee ss ll: For non-wave channels. Working sound channel envelope = ee, working sound channel sweep = ss, working sound channel sound length / wave pattern duty = ll F1 pppp vv: For the wave channel. Pointer to wave pattern data = pppp, working sound channel volume = vv F2 pppp: $CF01 = pppp F3 oo: Add oo to any played music notes (sets $CF00) F4 nn: Repeat from after this instruction nn times \|: (sets $CF31/$CF33) F5: Repeat :\| (decrements $CF31) CF31: Repeat count CF33: Repeat point CF35: Sound envelope / volume CF37: Sound length (according to song instruction F1h) CF38-40: Song tone/sweep channel options CF38: Set to [$5F30 + ([song to play] - 1) * 2 + 3] in $48A0 CF3F: Set to 1 in $48A0 CF41-49: Song tone channel options CF41: Set to [$5F30 + ([song to play] - 1) * 2 + 5] in $48A0 CF48: Set to 1 in $48A0 CF4A-52: Song wave channel options CF4A: Set to [$5F30 + ([song to play] - 1) * 2 + 7] in $48A0 CF51: Set to 1 in $48A0 CF53-5B: Song noise channel options CF53: Set to [$5F30 + ([song to play] - 1) * 2 + 9] in $48A0 CF5A: Set to 1 in $48A0 CF5C: Set to D0h by [$CEDE] == 8 (timer), sets $CF3E = $CF47 = $CF59 = $CF5D = $CF5E = [a] 0: Song play = isolated sound effect to play = 0, disable sound channels 10h: a = 13h 30h: a = 25h 70h: a = 45h, $CF07 = 0, $CF50 = $CF5F = 60h A0h: a = 65h CF5D: Set to [$CF3E] by [$CEDE] == 8 CF5E: Set to [$CF47] by [$CEDE] == 8 CF5F: Set to [$CF50] by [$CEDE] == 8 CF60: Tone channel frequency tweak. Set to 1 if [$5F30 + ([song to play] - 1) * 2] & 1 in $48A0 CF61-C1: Mirror of $CF00-60? CFC5: Backup of song playing during isolated sound effect CFC7: 1: Go to $4801 2: Go to $4846. Set when unpausing: plays unpaused sound effect Otherwise: $4819 CFC8: Flag to go to $4852, set to 40h by $4801 CFC9: Mirror of $CF10? (tone/sweep channel sweep) CFE3: Mirror of $CF09? CFE5: Low health beep / wave channel sound effect to play CFE6: Low health beep / wave channel sound effect playing CFE7: Mirror of $CFE6? CFEC: Mirror of $CFED? CFED: Audio channel output stereo flags CFEE: Quickly guessing wave pattern timer D008: Metatile top-left D009: Metatile top-right D00A: Metatile bottom-left D00B: Metatile bottom-right D00C: Samus' previous Y position D00E: Door transition direction 1: Right 2: Left 4: Up 8: Down D00F: Set to [$C423] by $2EE3, set to 1 by escaping Metroid Queen / in Metroid Queen's mouth D010: Counter for spin-jumping D011: Nothing. Only cleared D012: Value for $D060 in $31F1 D020: Samus' pose 00: Standing 01: Jumping 02: Spin-jumping 03: Running (set to 83h when turning) 04: Crouching 05: Morphball 06: Morphball jumping 07: Falling 08: Morphball falling 09: Starting to jump 0A: Starting to spin-jump 0B: Spider ball rolling 0C: Spider ball falling 0D: Spider ball jumping 0E: Spider ball 0F: Knockback 10: Morphball knockback 11: Standing bombed 12: Morphball bombed 13: Facing screen 18: Being eaten by Metroid Queen 19: In Metroid Queen's mouth 1A: Being swallowed by Metroid Queen 1B: In Metroid Queen's stomach 1C: Escaping Metroid Queen 1D: Escaped Metroid Queen D022: += 3 in $08FE during door transition D023: Direction of screen movement 10: Right 20: Left 40: Up 80: Down D027: Samus X position D029: Samus Y position D02B: Direction Samus is facing, mirrored from $D81E at save load. 0: Left 1: Right D02C: Samus turning animation counter D035: Screen right velocity D036: Screen left velocity D037: Screen up velocity D038: Screen down velocity D039: Set to 0 by load title screen D03B: Samus' Y position on screen D03C: Samus' X position on screen, checked for <= A0h in $08FE D03D: Spider ball direction 0: In air 1: On bottom-left corner of ledge 2: On top-left corner of ledge 3: On left-facing wall 4: On bottom-right corner of ledge 5: On ceiling 6: Unused 7: On meet of left-facing wall and ceiling 8: On top-right corner of ledge 9: Unused Ah: On floor Bh: On meet of left-facing wall and floor Ch: On right-facing wall Dh: On meet of right-facing wall and ceiling Eh: On meet of right-facing wall and floor D045: Samus' equipment, mirrored from $D815 at save load. 01: Bombs 02: Hi-jump 04: Screw attack 08: Space jump 10: Spring ball 20: Spider ball 40: Varia suit D046: Debug screen selector index D047: Tiles update flag (see $FFB1..B6, $2BA3, $27BA) D04D: Weapon equipped. 0: Normal 1: Ice 2: Wave 3: Spazer 4: Plasma 8: Missile D04E: Bank D050: Samus' max energy tanks, mirrored from $D817 at save load. D051: Samus' health, mirrored from $D818 at save load. D052: Samus' filled energy tanks, mirrored from $D819 at save load. D053: Samus' missiles(upper nybble tens, lower nybble ones), mirrored from $D81C at save load. D054: Samus' missiles(upper nybble thousands, lower nybble hundreds), mirrored from $D81D at save load. D055: Samus' beam. Saved to SRAM, mirrored from $D816 at save load. 0: Normal 1: Ice 2: Wave 3: Spazer 4: Plasma D056: Samus passable block threshold D057: Room sprite priority 0: Sprites over BG 1: BG over sprites D058: Bank for current room D059: Death sequence timer. Used as index into offset table for dest address in $2FE1 D064: Used in $239C as new OAM stack pointer, set to OAM stack pointer in $04DF D065: VRAM DMA bank (see $FFB1-B6, $2BA3) D066: Used in v-blank handler. Timer for fade in. Set to 40h by $0CA3, set to 2Fh by $239C when type = Ah, set to A0h by game mode Ah, set to FFh by reached the gunship D067: Used in title. Set to 01h by $0CA3 and game mode Ah D069: Enemy passable block threshold D06E: Highest OAM stack pointer D073: Two byte pointer, data for [$C215] before subtracting 21h; pointer to SRAM? Compared with F0h to enable $D09F, probably credits text D076: Used in v-blank handler. Flag to go to $5:403D; set every few frames during credits D077: Acid damage. Saved to SRAM D078: Spike damage. Saved to SRAM D079: Flag to load characters. But also used in facing screen as a flag to check if buttons are pressed D07A: Save slot option selected 0: Start 1: Clear D07B: Used in title. Y position of stars? D07C: Used in title. X position of stars? D07E: BG palette D07F: Object 0 palette D080: Object 1 palette D081: Samus' max missiles(upper nybble tens, lower nybble ones), mirrored from $D81A at save load. D082: Samus' max missiles(upper nybble thousands, lower nybble hundreds), mirrored from $D81B at save load. D083: Read in $1:7A34, adjusts sprite Y position in $1:4DDF D084: Samus' health for display, mirror of $D051/D818? D086: Samus' missiles for display, mirror of $D053/$D81C? D089: Real number of Metroids remaining D08A: Projectile passable block threshold D08B: Metroid Queen's room flag 11h: In Metroid Queen's room (set by screen transition command 8) D08D: Value for $D05D in $31F1 D08E: Index of screen transition command set. Set to [$4300 + ([screen Y position high] * 10h + [screen X position high]) * 2] & ~800h by set up door transition D090: Metroid Queen eating pose Sets Samus pose = escaping Metroid Queen when 7, checked for 5/20h and set to 6 in in Metroid Queen's mouth 0: Otherwise 1: Samus entering mouth 2: Mouth closing 3: Mouth closed 5: Samus escaping mouth 6: Swallowing Samus 7: 8: Samus escaping stomach 10h: Paralysed (can enter mouth) 20h: 22h: Dying D091: Set to 3 in $8:7EBC if killed a target number of Metroids or 1 if only Metroid Queen is remaining D092: Song for room D096: Metroids remaining shuffle timer D097: Index for $5:5620 jump table (first call in credits) D098: In-game timer, minutes D099: In-game timer, hours D09A: Number of Metroids remaining D09B: Fade in timer D09E: Checked and cleared in $2:4000, value for $FFC9 in $0C37 D09F: Flag to display in-game time in credits D0A0: Debug flag D0A2: In-game timer, 256-frame periods (roughly 14ths of a minute) D0A3: Save slot D0A4: Show clear save slot option flag D0A7: Metroids remaining in area D700-3F: Screen transition commands D800-25: Save data. Data loaded from $1:4E64-89 by game mode Bh, loaded from $A008-2D + save slot * 40h by game mode Ch D800: Samus' Y position D802: Samus' X position D804: Screen Y position D806: Screen X position D808: Enemy tiles source address (2 bytes) D80A: Background tiles source bank D80B: Background tiles source address (2 bytes) D80D: Metatile definitions source address (bank 8, 2 bytes) D80F: Source address of data for $DC00-FF (bank 8, 2 bytes) D811: Bank for current room D812: Samus passable block threshold (>= this tile index is passable, < is impassible) D813: Enemy passable block threshold D814: Projectile passable block threshold D815: Samus' equipment at save load. D816: Samus' beam at save load. D817: Samus' max energy tanks at save load. D818: Samus' health at save load. D819: Samus' filled energy tanks at save load. D81A: Samus' max missiles at save load. Upper nybble tens, lower nybble ones. D81B: Samus' max missiles at save load. Upper nybble thousands, lower nybble hundreds. D81C: Samus' missiles at save load. Upper nybble tens, lower nybble ones. D81D: Samus' missiles at save load. Upper nybble thousands, lower nybble hundreds. D81E: Direction Samus is facing at save load. D81F: Acid damage D820: Spike damage D821: Real number of Metroids remaining D822: Song for room D823: In-game timer, minutes D824: In-game timer, hours D825: Number of Metroids remaining D900-FF: 10h byte slots? The first byte of which each is cleared when saving DA00-DBFF: Metatile definitions DC00-FF: Tile properties 1: Viscous. Reduces jumping and detaches spider ball on movement. Also causes morph ball sound effect glitch. 2: Jump-through block. Passable when jumping, impassable in all other states (in all directions). 4: Fall-through block. Passable when falling, impassable in all other states (in all directions). 8: Spike 10h: Acid 20h: Destructible by shot/bomb 40h: Destructible by bomb 80h: Save pillar DD00-FF: Projectile RAM DE00-FF: Metatile update entries + 0: Dest. address. $0000 terminates update + 2: Top-left tile + 3: Top-right tile + 4: Bottom-left tile + 5: Bottom-right tile DF00-FF: Stack HRAM FF80: Buttons 01: A 02: B 04: Select 08: Start 10: Right 20: Left 40: Up 80: Down FF81: New buttons FF82: V-blank handled flag FF8D: OAM stack pointer FF97: Frame counter FF98: Sprite tile number (see $5:4015). Mirror of sprite Y position (see $30BB). Door scroll flags (see $08FE): [$4200 + [screen Y position, screen] * 16 + [screen X position, screen]] FF99: Two sprite tile numbers (see $5:4000). Mirror of sprite X position (see $30BB). Door thing (see $08FE): [Samus' Y position] - [$FFC8] + 60h FF9B: Game mode 0: Boot 1: Title screen 2: Loading save 2 3: Loading save 3 4: In-game 5: Dead 6: Dying 7: Game over 8: Paused 9: Save to SRAM Ah: Unused Bh: Start new game Ch: Load from save Dh: RET Eh: RET Fh: Unused. Identical to 7, set by game mode Ah 10h: Unused. Game cleared 11h: Unused. Functionally identical to 7, set by game mode 10h 12h: Reached the gunship 13h: Credits FFA0-A9: OAM DMA routine FFAA: VRAM tilemap metatile update address. $FFAA = $9800 + ([row block to update] * 32 + [column block to update]) * 2 FFAC: Index of screen for metatile update. $FFAC = [row screen to update] * 16 + [column screen to update] FFAD: Index of block for metatile update. $FFAD = [row block to update] * 16 + [column block to update] FFAE: Number of blocks to update FFAF: Stack pointer for metatile update entries FFB1: VRAM DMA source address FFB3: VRAM DMA dest address, also source offset from $CE20 when [$D08C] is set FFB5: VRAM DMA size FFB7-BB: Energy tank graphics, other stuff too though FFB7: Offset for interval for [$FF98] in $30EA FFB8: Offset for interval for [$FF99] in $30EA FFB9: Table index for offset data in $30EA FFBA: Start of interval for [$FF98] in $30EA FFBB: End of interval for [$FF98] in $30EA FFBC: Start of interval for [$FF99] in $30EA FFBD: End of interval for [$FF99] in $30EA FFBF: Flags to negate values in $30EA FFC0: Samus' Y position FFC2: Samus' X position FFC4: Sprite Y position (see $5:4015) FFC5: Sprite X position (see $5:4015) FFC6: Sprite set FFC7: Sprite attributes (see $5:4015) FFC8: Screen Y position FFCA: Screen X position FFCC: Row to update (in pixels) FFCE: Column to update (in pixels) FFE0-FFF5: Used by active enemies (??) FFFE: Counts every other in-game frame return_of_samus/data_locations/ram_map.1561758461.txt.gz · Last modified: 2019/06/28 21:47 by kkzero	{ "url": "https://wiki.metroidconstruction.com/doku.php?id=return_of_samus:data_locations:ram_map&rev=1561758461", "source_domain": "wiki.metroidconstruction.com", "snapshot_id": "crawl=CC-MAIN-2020-29", "warc_metadata": { "Content-Length": "37610", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:R55XA77XRWWWOIXOWFVRQNOHKMMXIYCQ", "WARC-Concurrent-To": "<urn:uuid:4f5aa64b-4ff3-4aca-a558-eb55e631c13e>", "WARC-Date": "2020-07-13T20:49:10Z", "WARC-IP-Address": "173.231.211.222", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:KV6CVHC2VEBKZ23UO3Y2NLKIBK7UE36I", "WARC-Record-ID": "<urn:uuid:7984900e-fa6e-43ba-8243-987cbf973d1c>", "WARC-Target-URI": "https://wiki.metroidconstruction.com/doku.php?id=return_of_samus:data_locations:ram_map&rev=1561758461", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:86472599-addb-4abe-a135-31941e522537>" }, "warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-82.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 11, 12, 23, 24, 53, 54, 93, 94, 135, 136, 137, 162, 163, 233, 234, 243, 244, 286, 323, 348, 372, 396, 425, 440, 462, 483, 503, 540, 541, 546, 547, 569, 590, 618, 641, 727, 753, 777, 803, 825, 850, 872, 873, 878, 879, 897, 927, 955, 983, 1011, 1039, 1086, 1125, 1177, 1241, 1306, 1338, 1379, 1420, 1466, 1493, 1515, 1545, 1569, 1599, 1625, 1661, 1683, 1706, 1750, 1774, 1807, 1838, 1877, 1895, 1913, 1945, 1946, 1995, 1996, 2053, 2054, 2099, 2100, 2136, 2137, 2142, 2143, 2195, 2215, 2235, 2256, 2276, 2297, 2317, 2337, 2384, 2385, 2410, 2435, 2450, 2465, 2466, 2522, 2523, 2573, 2625, 2626, 2676, 2677, 2728, 2779, 2826, 2827, 2887, 2916, 2917, 3010, 3011, 3104, 3105, 3137, 3138, 3215, 3289, 3368, 3446, 3447, 3479, 3480, 3522, 3571, 3616, 3617, 3666, 3667, 3720, 3772, 3825, 3877, 3878, 3946, 3947, 4037, 4038, 4096, 4097, 4141, 4204, 4252, 4278, 4302, 4367, 4368, 4460, 4573, 4621, 4669, 4722, 4788, 4854, 4931, 5048, 5064, 5096, 5097, 5167, 5168, 5190, 5232, 5286, 5313, 5340, 5370, 5405, 5463, 5505, 5533, 5566, 5602, 5639, 5680, 5721, 5764, 5796, 5838, 5886, 5908, 5930, 5952, 5983, 6005, 6057, 6097, 6119, 6162, 6203, 6225, 6258, 6285, 6307, 6337, 6391, 6392, 6444, 6449, 6485, 6533, 6560, 6587, 6614, 6651, 6709, 6745, 6787, 6807, 6855, 6864, 6910, 6911, 7033, 7034, 7071, 7120, 7147, 7177, 7209, 7229, 7269, 7301, 7331, 7362, 7412, 7449, 7492, 7525, 7560, 7595, 7616, 7637, 7667, 7689, 7711, 7733, 7755, 7777, 7837, 7875, 7897, 7919, 7941, 7990, 7999, 8046, 8047, 8070, 8093, 8121, 8157, 8184, 8210, 8237, 8264, 8291, 8318, 8346, 8371, 8409, 8440, 8468, 8495, 8526, 8551, 8574, 8605, 8640, 8680, 8718, 8757, 8796, 8835, 8875, 8916, 8954, 9005, 9049, 9088, 9129, 9161, 9184, 9224, 9251, 9299, 9354, 9408, 9435, 9486, 9537, 9572, 9612, 9640, 9741, 9772, 9811, 9812, 9862, 9906, 9960, 9995, 10029, 10063, 10097, 10131, 10176, 10177, 10191, 10280, 10383, 10429, 10477, 10525, 10573, 10621, 10683, 10737, 10788, 10857, 10911, 10992, 11044, 11128, 11171, 11241, 11287, 11334, 11359, 11423, 11463, 11504, 11542, 11586, 11624, 11665, 11690, 11735, 11776, 11827, 11875, 11884, 11942, 11994, 12046, 12099, 12130, 12182, 12220, 12403, 12525, 12567, 12642, 12737, 12795, 12826, 12857, 12870, 12912, 12913, 12980, 13029, 13102, 13115, 13151, 13194, 13267, 13280, 13316, 13359, 13432, 13445, 13481, 13525, 13598, 13611, 13647, 13746, 13831, 13856, 13881, 13938, 13963, 14008, 14053, 14098, 14202, 14235, 14236, 14298, 14299, 14310, 14337, 14413, 14442, 14493, 14547, 14548, 14575, 14637, 14699, 14726, 14727, 14754, 14798, 14844, 14845, 14869, 14894, 14921, 14949, 14982, 15014, 15031, 15047, 15061, 15077, 15170, 15201, 15229, 15260, 15261, 15279, 15300, 15320, 15345, 15391, 15413, 15435, 15465, 15485, 15515, 15544, 15578, 15610, 15642, 15674, 15698, 15720, 15752, 15780, 15809, 15835, 15876, 15913, 15958, 15997, 16032, 16066, 16067, 16110, 16145, 16163, 16180, 16195, 16212, 16213, 16236, 16259, 16326, 16342, 16359, 16397, 16398, 16426, 16453, 16478, 16505, 16541, 16542, 16576, 16639, 16667, 16685, 16727, 16766, 16797, 16840, 16862, 16880, 16931, 16971, 16989, 17010, 17060, 17093, 17146, 17197, 17198, 17256, 17274, 17294, 17319, 17342, 17366, 17390, 17413, 17447, 17501, 17502, 17525, 17543, 17558, 17574, 17592, 17610, 17629, 17640, 17641, 17706, 17761, 17829, 17924, 18028, 18096, 18114, 18129, 18145, 18163, 18181, 18218, 18245, 18272, 18299, 18327, 18413, 18414, 18494, 18536, 18705, 18763, 18764, 18801, 18802, 18834, 18835, 18974, 18975, 19065, 19098, 19132, 19236, 19268, 19285, 19302, 19344, 19386, 19387, 19404, 19427, 19450, 19549, 19657, 19717, 19774, 19832, 19833, 19873, 19915, 19947, 20021, 20022, 20053, 20099, 20222, 20254, 20370, 20391, 20423, 20448, 20472, 20504, 20532, 20544, 20578, 20619, 20633, 20652, 20756, 20776, 20777, 20816, 20875, 20904, 20931, 20966, 20986, 20987, 21050, 21096, 21113, 21114, 21181, 21197, 21236, 21237, 21270, 21271, 21307, 21308, 21428, 21456, 21484, 21512, 21540, 21587, 21626, 21678, 21742, 21806, 21838, 21929, 21970, 22016, 22057, 22093, 22141, 22179, 22230, 22312, 22403, 22481, 22568, 22618, 22640, 22663, 22707, 22731, 22764, 22795, 22834, 22835, 22912, 22944, 22969, 23083, 23185, 23287, 23300, 23314, 23349, 23379, 23400, 23401, 23425, 23458, 23506, 23529, 23553, 23579, 23606, 23621, 23622, 23627, 23628, 23642, 23656, 23670, 23689, 23707, 23725, 23742, 23757, 23774, 23792, 23819, 23820, 23844, 23845, 23865, 24050, 24196, 24197, 24213, 24229, 24253, 24279, 24305, 24324, 24340, 24357, 24378, 24396, 24420, 24439, 24466, 24493, 24509, 24525, 24581, 24615, 24686, 24719, 24740, 24741, 24766, 24886, 24993, 25097, 25130, 25178, 25208, 25287, 25307, 25361, 25408, 25455, 25502, 25549, 25596, 25643, 25690, 25691, 25729, 25753, 25777, 25815, 25853, 25870, 25908, 25932, 25956, 25991, 26026, 26027, 26066, 26067, 26106 ], "line_end_idx": [ 11, 12, 23, 24, 53, 54, 93, 94, 135, 136, 137, 162, 163, 233, 234, 243, 244, 286, 323, 348, 372, 396, 425, 440, 462, 483, 503, 540, 541, 546, 547, 569, 590, 618, 641, 727, 753, 777, 803, 825, 850, 872, 873, 878, 879, 897, 927, 955, 983, 1011, 1039, 1086, 1125, 1177, 1241, 1306, 1338, 1379, 1420, 1466, 1493, 1515, 1545, 1569, 1599, 1625, 1661, 1683, 1706, 1750, 1774, 1807, 1838, 1877, 1895, 1913, 1945, 1946, 1995, 1996, 2053, 2054, 2099, 2100, 2136, 2137, 2142, 2143, 2195, 2215, 2235, 2256, 2276, 2297, 2317, 2337, 2384, 2385, 2410, 2435, 2450, 2465, 2466, 2522, 2523, 2573, 2625, 2626, 2676, 2677, 2728, 2779, 2826, 2827, 2887, 2916, 2917, 3010, 3011, 3104, 3105, 3137, 3138, 3215, 3289, 3368, 3446, 3447, 3479, 3480, 3522, 3571, 3616, 3617, 3666, 3667, 3720, 3772, 3825, 3877, 3878, 3946, 3947, 4037, 4038, 4096, 4097, 4141, 4204, 4252, 4278, 4302, 4367, 4368, 4460, 4573, 4621, 4669, 4722, 4788, 4854, 4931, 5048, 5064, 5096, 5097, 5167, 5168, 5190, 5232, 5286, 5313, 5340, 5370, 5405, 5463, 5505, 5533, 5566, 5602, 5639, 5680, 5721, 5764, 5796, 5838, 5886, 5908, 5930, 5952, 5983, 6005, 6057, 6097, 6119, 6162, 6203, 6225, 6258, 6285, 6307, 6337, 6391, 6392, 6444, 6449, 6485, 6533, 6560, 6587, 6614, 6651, 6709, 6745, 6787, 6807, 6855, 6864, 6910, 6911, 7033, 7034, 7071, 7120, 7147, 7177, 7209, 7229, 7269, 7301, 7331, 7362, 7412, 7449, 7492, 7525, 7560, 7595, 7616, 7637, 7667, 7689, 7711, 7733, 7755, 7777, 7837, 7875, 7897, 7919, 7941, 7990, 7999, 8046, 8047, 8070, 8093, 8121, 8157, 8184, 8210, 8237, 8264, 8291, 8318, 8346, 8371, 8409, 8440, 8468, 8495, 8526, 8551, 8574, 8605, 8640, 8680, 8718, 8757, 8796, 8835, 8875, 8916, 8954, 9005, 9049, 9088, 9129, 9161, 9184, 9224, 9251, 9299, 9354, 9408, 9435, 9486, 9537, 9572, 9612, 9640, 9741, 9772, 9811, 9812, 9862, 9906, 9960, 9995, 10029, 10063, 10097, 10131, 10176, 10177, 10191, 10280, 10383, 10429, 10477, 10525, 10573, 10621, 10683, 10737, 10788, 10857, 10911, 10992, 11044, 11128, 11171, 11241, 11287, 11334, 11359, 11423, 11463, 11504, 11542, 11586, 11624, 11665, 11690, 11735, 11776, 11827, 11875, 11884, 11942, 11994, 12046, 12099, 12130, 12182, 12220, 12403, 12525, 12567, 12642, 12737, 12795, 12826, 12857, 12870, 12912, 12913, 12980, 13029, 13102, 13115, 13151, 13194, 13267, 13280, 13316, 13359, 13432, 13445, 13481, 13525, 13598, 13611, 13647, 13746, 13831, 13856, 13881, 13938, 13963, 14008, 14053, 14098, 14202, 14235, 14236, 14298, 14299, 14310, 14337, 14413, 14442, 14493, 14547, 14548, 14575, 14637, 14699, 14726, 14727, 14754, 14798, 14844, 14845, 14869, 14894, 14921, 14949, 14982, 15014, 15031, 15047, 15061, 15077, 15170, 15201, 15229, 15260, 15261, 15279, 15300, 15320, 15345, 15391, 15413, 15435, 15465, 15485, 15515, 15544, 15578, 15610, 15642, 15674, 15698, 15720, 15752, 15780, 15809, 15835, 15876, 15913, 15958, 15997, 16032, 16066, 16067, 16110, 16145, 16163, 16180, 16195, 16212, 16213, 16236, 16259, 16326, 16342, 16359, 16397, 16398, 16426, 16453, 16478, 16505, 16541, 16542, 16576, 16639, 16667, 16685, 16727, 16766, 16797, 16840, 16862, 16880, 16931, 16971, 16989, 17010, 17060, 17093, 17146, 17197, 17198, 17256, 17274, 17294, 17319, 17342, 17366, 17390, 17413, 17447, 17501, 17502, 17525, 17543, 17558, 17574, 17592, 17610, 17629, 17640, 17641, 17706, 17761, 17829, 17924, 18028, 18096, 18114, 18129, 18145, 18163, 18181, 18218, 18245, 18272, 18299, 18327, 18413, 18414, 18494, 18536, 18705, 18763, 18764, 18801, 18802, 18834, 18835, 18974, 18975, 19065, 19098, 19132, 19236, 19268, 19285, 19302, 19344, 19386, 19387, 19404, 19427, 19450, 19549, 19657, 19717, 19774, 19832, 19833, 19873, 19915, 19947, 20021, 20022, 20053, 20099, 20222, 20254, 20370, 20391, 20423, 20448, 20472, 20504, 20532, 20544, 20578, 20619, 20633, 20652, 20756, 20776, 20777, 20816, 20875, 20904, 20931, 20966, 20986, 20987, 21050, 21096, 21113, 21114, 21181, 21197, 21236, 21237, 21270, 21271, 21307, 21308, 21428, 21456, 21484, 21512, 21540, 21587, 21626, 21678, 21742, 21806, 21838, 21929, 21970, 22016, 22057, 22093, 22141, 22179, 22230, 22312, 22403, 22481, 22568, 22618, 22640, 22663, 22707, 22731, 22764, 22795, 22834, 22835, 22912, 22944, 22969, 23083, 23185, 23287, 23300, 23314, 23349, 23379, 23400, 23401, 23425, 23458, 23506, 23529, 23553, 23579, 23606, 23621, 23622, 23627, 23628, 23642, 23656, 23670, 23689, 23707, 23725, 23742, 23757, 23774, 23792, 23819, 23820, 23844, 23845, 23865, 24050, 24196, 24197, 24213, 24229, 24253, 24279, 24305, 24324, 24340, 24357, 24378, 24396, 24420, 24439, 24466, 24493, 24509, 24525, 24581, 24615, 24686, 24719, 24740, 24741, 24766, 24886, 24993, 25097, 25130, 25178, 25208, 25287, 25307, 25361, 25408, 25455, 25502, 25549, 25596, 25643, 25690, 25691, 25729, 25753, 25777, 25815, 25853, 25870, 25908, 25932, 25956, 25991, 26026, 26027, 26066, 26067, 26106, 26206 ] }	{ "red_pajama_v2": { "ccnet_original_length": 26206, "ccnet_original_nlines": 735, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1108078584074974, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.125, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3742721974849701, "rps_doc_frac_unique_words": 0.27964699268341064, "rps_doc_mean_word_length": 4.509100914001465, "rps_doc_num_sentences": 115, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 6.1000776290893555, "rps_doc_word_count": 3626, "rps_doc_frac_chars_dupe_10grams": 0.02899082936346531, "rps_doc_frac_chars_dupe_5grams": 0.1683180332183838, "rps_doc_frac_chars_dupe_6grams": 0.13828745484352112, "rps_doc_frac_chars_dupe_7grams": 0.09975534677505493, "rps_doc_frac_chars_dupe_8grams": 0.08538226038217545, "rps_doc_frac_chars_dupe_9grams": 0.04128440096974373, "rps_doc_frac_chars_top_2gram": 0.01192661002278328, "rps_doc_frac_chars_top_3gram": 0.012232420034706593, "rps_doc_frac_chars_top_4gram": 0.00727829011157155, "rps_doc_books_importance": -1764.242919921875, "rps_doc_books_importance_length_correction": -1764.242919921875, "rps_doc_openwebtext_importance": -1091.4716796875, "rps_doc_openwebtext_importance_length_correction": -1091.4716796875, "rps_doc_wikipedia_importance": -672.73291015625, "rps_doc_wikipedia_importance_length_correction": -672.73291015625 }, "fasttext": { "dclm": 0.11466473340988159, "english": 0.7535816431045532, "fineweb_edu_approx": 1.3134437799453735, "eai_general_math": 0.057245608419179916, "eai_open_web_math": 0.03217465057969093, "eai_web_code": 0.4697887897491455 } }	{ "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": "794.8", "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": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,183,746,931,049,333,000	FROM CACHE - en_header Blurry header logo in password page of Debut Theme nanaschmitz New Member 2 0 1 Hi there, I am new here and have searched the forum and online regarding this topic, but haven't found the solution, maybe you can help. I am using the Debut theme. On the Password Page https://kimoberlin.com/password the logo doesn't appear as sharp as it actually is. In the header of the theme itself, it does appear crystal sharp though. Is there specific regulations for password page? I have tried uploading 1080 width, a square version, 300px width.... not sure what else to try? Inside the online store theme editor, I am sizing it to 300px width, which is the width I'd like it to show.. sharp 🙂 I hope you can help me! Nana Replies 24 (24) user53 New Member 4 0 0 Hey is there any fix like this for Narrative theme? I've tried the suggestion and it doesn't work. Thanks urbnsage Tourist 10 0 5 Hi @user53 - Sorry to hear it didn't work for your theme. I haven't used Narrative so I cannot say definitively - but another option is trying to use an .svg file instead of a .jpg or .png. Since .svg files are relative to plane they will not pixelate no matter how much you zoom! The way to get this is a little tricky even in debut and it requires some tampering with Section .liquid files so I would suggest making a backup copy of your website before trying this. Again, I know this works for Debut but it may not work for Narrative. Try this support page for uploading an .svg logo if you need any more help let me know! The support page is for a header, but I am sure you can make the same changes in your password-page.liquid. 🙂 urbnsage Tourist 10 0 5 Hi @Cycc and @melissaz! I am so happy this worked for you 🙂 thank you for the likes! if this worked for OP please feel free to accept my solution, i'd appreciate it! user53 New Member 4 0 0 Hey urbnsage - thanks for the response but this doesn't work for Narrative - the lines of code you mention in head.liquid don't exist, unfortunately! the_sampler New Member 1 0 0 Hey there, I've done as you suggested and it did fix the blurry image but my image never gets larger that 500px wide. I can import something taller, but not wider. How do I change the max width or dimensions of the header image frame?	{ "url": "https://community.shopify.com/c/shopify-design/blurry-header-logo-in-password-page-of-debut-theme/m-p/1319936", "source_domain": "community.shopify.com", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "342891", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:YCBY2PXTK7ZK73PSNTGBBLCCXWG7LURV", "WARC-Concurrent-To": "<urn:uuid:7e50c793-5cd6-43bc-a23d-b4b5e6d23a43>", "WARC-Date": "2022-09-27T00:03:33Z", "WARC-IP-Address": "18.67.76.72", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:2PMEB3AYRFOV6SPHGTCTO5ZJFUW4SGAD", "WARC-Record-ID": "<urn:uuid:57b225cb-c1f1-4718-96ed-974526472784>", "WARC-Target-URI": "https://community.shopify.com/c/shopify-design/blurry-header-logo-in-password-page-of-debut-theme/m-p/1319936", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:cd9ba21e-b6d1-4ec6-bdc8-998db2e895c8>" }, "warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-251\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 23, 24, 75, 76, 88, 99, 105, 106, 116, 117, 244, 245, 378, 379, 451, 452, 501, 502, 598, 716, 740, 745, 746, 762, 769, 780, 786, 787, 893, 894, 903, 911, 918, 919, 933, 934, 1203, 1204, 1462, 1463, 1661, 1662, 1671, 1679, 1686, 1687, 1773, 1774, 1855, 1856, 1858, 1859, 1861, 1862, 1869, 1880, 1886, 1961, 2036, 2048, 2059, 2065, 2066, 2301, 2302 ], "line_end_idx": [ 23, 24, 75, 76, 88, 99, 105, 106, 116, 117, 244, 245, 378, 379, 451, 452, 501, 502, 598, 716, 740, 745, 746, 762, 769, 780, 786, 787, 893, 894, 903, 911, 918, 919, 933, 934, 1203, 1204, 1462, 1463, 1661, 1662, 1671, 1679, 1686, 1687, 1773, 1774, 1855, 1856, 1858, 1859, 1861, 1862, 1869, 1880, 1886, 1961, 2036, 2048, 2059, 2065, 2066, 2301, 2302, 2303 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2303, "ccnet_original_nlines": 65, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.42105263471603394, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.037037041038274765, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1871345043182373, "rps_doc_frac_unique_words": 0.4811320900917053, "rps_doc_mean_word_length": 4.155660152435303, "rps_doc_num_sentences": 34, "rps_doc_symbol_to_word_ratio": 0.0019493199652060866, "rps_doc_unigram_entropy": 4.948779582977295, "rps_doc_word_count": 424, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.047673098742961884, "rps_doc_frac_chars_dupe_6grams": 0.047673098742961884, "rps_doc_frac_chars_dupe_7grams": 0.023836549371480942, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.008513050153851509, "rps_doc_frac_chars_top_3gram": 0.008513050153851509, "rps_doc_frac_chars_top_4gram": 0.01816117949783802, "rps_doc_books_importance": -252.094970703125, "rps_doc_books_importance_length_correction": -252.094970703125, "rps_doc_openwebtext_importance": -135.9134979248047, "rps_doc_openwebtext_importance_length_correction": -135.9134979248047, "rps_doc_wikipedia_importance": -101.09410095214844, "rps_doc_wikipedia_importance_length_correction": -101.09410095214844 }, "fasttext": { "dclm": 0.07080423831939697, "english": 0.9295931458473206, "fineweb_edu_approx": 1.0144983530044556, "eai_general_math": 0.5261254906654358, "eai_open_web_math": 0.44807881116867065, "eai_web_code": 0.10173416137695312 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "2", "label": "Partially Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,708,390,876,652,383,000	LibreOffice Module sw (master) 1 fldref.cxx Go to the documentation of this file. 1 /* -- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -- / 2 / 3 * This file is part of the LibreOffice project. 4 * 5 * This Source Code Form is subject to the terms of the Mozilla Public 6 * License, v. 2.0. If a copy of the MPL was not distributed with this 7 * file, You can obtain one at http://mozilla.org/MPL/2.0/. 8 * 9 * This file incorporates work covered by the following license notice: 10 * 11 * Licensed to the Apache Software Foundation (ASF) under one or more 12 * contributor license agreements. See the NOTICE file distributed 13 * with this work for additional information regarding copyright 14 * ownership. The ASF licenses this file to you under the Apache 15 * License, Version 2.0 (the "License"); you may not use this file 16 * except in compliance with the License. You may obtain a copy of 17 * the License at http://www.apache.org/licenses/LICENSE-2.0 . 18 / 19 20 #include <swtypes.hxx> 21 #include <view.hxx> 22 #include <IMark.hxx> 23 #include <expfld.hxx> 24 #include <swmodule.hxx> 25 #include "fldref.hxx" 26 #include <reffld.hxx> 27 #include <wrtsh.hxx> 28 29 #include <fldref.hrc> 30 #include <globals.hrc> 31 #include <strings.hrc> 32 #include <SwNodeNum.hxx> 33 #include <IDocumentMarkAccess.hxx> 34 #include <ndtxt.hxx> 35 #include <unotools/configmgr.hxx> 37 #include <unotools/charclass.hxx> 38 39 #include <comphelper/string.hxx> 40 41 #define REFFLDFLAG 0x4000 42 #define REFFLDFLAG_BOOKMARK 0x4800 43 #define REFFLDFLAG_FOOTNOTE 0x5000 44 #define REFFLDFLAG_ENDNOTE 0x6000 45 // #i83479# 46 #define REFFLDFLAG_HEADING 0x7100 47 #define REFFLDFLAG_NUMITEM 0x7200 48 49 static sal_uInt16 nFieldDlgFormatSel = 0; 50 51 #define USER_DATA_VERSION_1 "1" 52 #define USER_DATA_VERSION USER_DATA_VERSION_1 53 55 : SwFieldPage(pPage, pController, "modules/swriter/ui/fldrefpage.ui", "FieldRefPage", pCoreSet) 56 , maOutlineNodes() 57 , maNumItems() 58 , mpSavedSelectedTextNode(nullptr) 59 , mnSavedSelectedPos(0) 60 , m_xTypeLB(m_xBuilder->weld_tree_view("type")) 61 , m_xSelection(m_xBuilder->weld_widget("selectframe")) 62 , m_xSelectionLB(m_xBuilder->weld_tree_view("select")) 63 , m_xSelectionToolTipLB(m_xBuilder->weld_tree_view("selecttip")) 64 , m_xFormat(m_xBuilder->weld_widget("formatframe")) 65 , m_xFormatLB(m_xBuilder->weld_tree_view("format")) 66 , m_xNameFT(m_xBuilder->weld_label("nameft")) 67 , m_xNameED(m_xBuilder->weld_entry("name")) 68 , m_xValueED(m_xBuilder->weld_entry("value")) 69 , m_xFilterED(m_xBuilder->weld_entry("filter")) 70 { 71 m_xSelectionLB->make_sorted(); 72 // #i83479# 73 for (size_t i = 0; i < SAL_N_ELEMENTS(FLD_REF_PAGE_TYPES); ++i) 74 { 75 m_xTypeLB->append_text(SwResId(FLD_REF_PAGE_TYPES[i])); 76 m_xFormatLB->append_text(SwResId(FLD_REF_PAGE_TYPES[i])); 77 } 78 79 sBookmarkText = m_xTypeLB->get_text(0); 80 sFootnoteText = m_xTypeLB->get_text(1); 81 sEndnoteText = m_xTypeLB->get_text(2); 82 // #i83479# 83 sHeadingText = m_xTypeLB->get_text(3); 84 sNumItemText = m_xTypeLB->get_text(4); 85 86 auto nHeight = m_xTypeLB->get_height_rows(8); 87 auto nWidth = m_xTypeLB->get_approximate_digit_width() FIELD_COLUMN_WIDTH; 88 m_xTypeLB->set_size_request(nWidth, nHeight); 89 m_xFormatLB->set_size_request(nWidth, nHeight); 90 m_xSelection->set_size_request(nWidth * 2, nHeight); 91 nHeight = m_xTypeLB->get_height_rows(20); 92 m_xSelectionToolTipLB->set_size_request(nHeight, nWidth2); 93 94 m_xTypeLB->clear(); 95 96 m_xNameED->connect_changed(LINK(this, SwFieldRefPage, ModifyHdl)); 97 m_xFilterED->connect_changed( LINK( this, SwFieldRefPage, ModifyHdl_Impl ) ); 98 99 m_xTypeLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 100 m_xTypeLB->connect_changed(LINK(this, SwFieldRefPage, TypeHdl)); 101 m_xSelectionLB->connect_changed(LINK(this, SwFieldRefPage, SubTypeListBoxHdl)); 102 m_xSelectionLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 103 m_xFormatLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 104 105 // #i83479# 106 m_xSelectionToolTipLB->connect_changed( LINK(this, SwFieldRefPage, SubTypeTreeListBoxHdl) ); 107 m_xSelectionToolTipLB->connect_row_activated( LINK(this, SwFieldRefPage, TreeViewInsertHdl) ); 108 m_xFilterED->grab_focus(); 109 } 110 112 { 113 } 114 116 { 117 UpdateSubType(comphelper::string::strip(m_xFilterED->get_text(), ' ')); 118 } 119 120 // #i83479# 122 { 123 mpSavedSelectedTextNode = nullptr; 124 mnSavedSelectedPos = 0; 125 if ( m_xSelectionToolTipLB->get_visible() ) 126 { 127 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 128 if (nEntry != -1) 129 { 130 const sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 131 132 if ( nTypeId == REFFLDFLAG_HEADING ) 133 { 134 mnSavedSelectedPos = m_xSelectionToolTipLB->get_id(nEntry).toUInt32(); 135 if ( mnSavedSelectedPos < maOutlineNodes.size() ) 136 { 138 } 139 } 140 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 141 { 142 mnSavedSelectedPos = m_xSelectionToolTipLB->get_id(nEntry).toUInt32(); 143 if ( mnSavedSelectedPos < maNumItems.size() ) 144 { 146 } 147 } 148 } 149 } 150 } 151 153 { 154 if (!IsFieldEdit()) 155 { 156 SavePos(m_xTypeLB); 157 // #i83479# 159 } 160 SetSelectionSel(-1); 161 SetTypeSel(-1); 162 Init(); // general initialisation 163 164 // initialise TypeListBox 165 m_xTypeLB->freeze(); 166 m_xTypeLB->clear(); 167 168 // fill Type-Listbox 169 170 // set/insert reference 172 173 for (short i = rRg.nStart; i < rRg.nEnd; ++i) 174 { 175 const SwFieldTypesEnum nTypeId = SwFieldMgr::GetTypeId(i); 176 177 if (!IsFieldEdit() \|\| nTypeId != SwFieldTypesEnum::SetRef) 178 { 179 m_xTypeLB->append(OUString::number(static_cast<sal_uInt16>(nTypeId)), SwFieldMgr::GetTypeStr(i)); 180 } 181 } 182 183 // #i83479# 184 // entries for headings and numbered items 185 m_xTypeLB->append(OUString::number(REFFLDFLAG_HEADING), sHeadingText); 186 m_xTypeLB->append(OUString::number(REFFLDFLAG_NUMITEM), sNumItemText); 187 188 // fill up with the sequence types 189 SwWrtShell pSh = GetWrtShell(); 190 if (!pSh) 191 pSh = ::GetActiveWrtShell(); 192 193 if (!pSh) 194 return; 195 196 const size_t nFieldTypeCnt = pSh->GetFieldTypeCount(SwFieldIds::SetExp); 197 198 OSL_ENSURE( nFieldTypeCnt < static_cast<size_t>(REFFLDFLAG), "<SwFieldRefPage::Reset> - Item index will overlap flags!" ); 199 200 for (size_t n = 0; n < nFieldTypeCnt; ++n) 201 { 203 204 if ((nsSwGetSetExpType::GSE_SEQ & pType->GetType()) && pType->HasWriterListeners() && pSh->IsUsed(pType)) 205 { 206 m_xTypeLB->append(OUString::number(REFFLDFLAG \| n), pType->GetName()); 207 } 208 } 209 210 // text marks - now always (because of globaldocuments) 211 m_xTypeLB->append(OUString::number(REFFLDFLAG_BOOKMARK), sBookmarkText); 212 213 // footnotes: 214 if( pSh->HasFootnotes() ) 215 { 216 m_xTypeLB->append(OUString::number(REFFLDFLAG_FOOTNOTE), sFootnoteText); 217 } 218 219 // endnotes: 220 if ( pSh->HasFootnotes(true) ) 221 { 222 m_xTypeLB->append(OUString::number(REFFLDFLAG_ENDNOTE), sEndnoteText); 223 } 224 225 m_xTypeLB->thaw(); 226 227 // select old Pos 228 if (!IsFieldEdit()) 230 231 nFieldDlgFormatSel = 0; 232 233 sal_uInt16 nFormatBoxPosition = USHRT_MAX; 234 if( !IsRefresh() ) 235 { 236 sal_Int32 nIdx{ 0 }; 237 const OUString sUserData = GetUserData(); 238 if(!IsRefresh() && sUserData.getToken(0, ';', nIdx). 239 equalsIgnoreAsciiCase(USER_DATA_VERSION_1)) 240 { 241 const sal_uInt16 nVal = static_cast< sal_uInt16 >(sUserData.getToken(0, ';', nIdx).toInt32()); 242 if(nVal != USHRT_MAX) 243 { 244 for(sal_Int32 i = 0, nEntryCount = m_xTypeLB->n_children(); i < nEntryCount; ++i) 245 { 246 if (nVal == m_xTypeLB->get_id(i).toUInt32()) 247 { 248 m_xTypeLB->select(i); 249 break; 250 } 251 } 252 if (nIdx>=0 && nIdx<sUserData.getLength()) 253 { 254 nFormatBoxPosition = static_cast< sal_uInt16 >(sUserData.getToken(0, ';', nIdx).toInt32()); 255 } 256 } 257 } 258 } 259 TypeHdl(m_xTypeLB); 260 if (nFormatBoxPosition < m_xFormatLB->n_children()) 261 { 262 m_xFormatLB->select(nFormatBoxPosition); 263 } 264 if (IsFieldEdit()) 265 { 266 m_xTypeLB->save_value(); 267 m_xSelectionLB->save_value(); 268 m_xFormatLB->save_value(); 269 m_xNameED->save_value(); 270 m_xValueED->save_value(); 271 m_xFilterED->set_text(OUString()); 272 } 273 } 274 276 { 277 // save old ListBoxPos 278 const sal_Int32 nOld = GetTypeSel(); 279 280 // current ListBoxPos 281 SetTypeSel(m_xTypeLB->get_selected_index()); 282 283 if(GetTypeSel() == -1) 284 { 285 if (IsFieldEdit()) 286 { 287 // select positions 288 OUString sName; 289 sal_uInt16 nFlag = 0; 290 291 switch( GetCurField()->GetSubType() ) 292 { 293 case REF_BOOKMARK: 294 { 295 // #i83479# 296 SwGetRefField pRefField = dynamic_cast<SwGetRefField>(GetCurField()); 297 if ( pRefField && 298 pRefField->IsRefToHeadingCrossRefBookmark() ) 299 { 300 sName = sHeadingText; 301 nFlag = REFFLDFLAG_HEADING; 302 } 303 else if ( pRefField && 304 pRefField->IsRefToNumItemCrossRefBookmark() ) 305 { 306 sName = sNumItemText; 307 nFlag = REFFLDFLAG_NUMITEM; 308 } 309 else 310 { 311 sName = sBookmarkText; 312 nFlag = REFFLDFLAG_BOOKMARK; 313 } 314 } 315 break; 316 317 case REF_FOOTNOTE: 318 sName = sFootnoteText; 319 nFlag = REFFLDFLAG_FOOTNOTE; 320 break; 321 322 case REF_ENDNOTE: 323 sName = sEndnoteText; 324 nFlag = REFFLDFLAG_ENDNOTE; 325 break; 326 327 case REF_SETREFATTR: 328 sName = SwResId(STR_GETREFFLD); 329 nFlag = REF_SETREFATTR; 330 break; 331 332 case REF_SEQUENCEFLD: 333 sName = static_cast<SwGetRefField>(GetCurField())->GetSetRefName(); 334 nFlag = REFFLDFLAG; 335 break; 336 } 337 338 if (m_xTypeLB->find_text(sName) == -1) // reference to deleted mark 339 { 340 m_xTypeLB->append(OUString::number(nFlag), sName); 341 } 342 343 m_xTypeLB->select_text(sName); 344 SetTypeSel(m_xTypeLB->get_selected_index()); 345 } 346 else 347 { 348 SetTypeSel(0); 349 m_xTypeLB->select(0); 350 } 351 } 352 353 if (nOld == GetTypeSel()) 354 return; 355 356 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 357 358 // fill selection-ListBox 359 UpdateSubType(comphelper::string::strip(m_xFilterED->get_text(), ' ')); 360 361 bool bName = false; 362 nFieldDlgFormatSel = 0; 363 364 if ( ( !IsFieldEdit() \|\| m_xSelectionLB->n_children() ) && 365 nOld != -1 ) 366 { 367 m_xNameED->set_text(OUString()); 368 m_xValueED->set_text(OUString()); 369 m_xFilterED->set_text(OUString()); 370 } 371 372 switch (nTypeId) 373 { 374 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 375 if (nOld != -1 && REFFLDFLAG & m_xTypeLB->get_id(nOld).toUInt32()) 376 // the old one stays 377 nFieldDlgFormatSel = m_xFormatLB->get_selected_index(); 378 bName = true; 379 break; 380 381 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 382 bName = true; 383 break; 384 385 case REFFLDFLAG_BOOKMARK: 386 bName = true; 387 [[fallthrough]]; 388 default: 389 if( REFFLDFLAG & nTypeId ) 390 { 391 const sal_uInt16 nOldId = nOld != -1 ? m_xTypeLB->get_id(nOld).toUInt32() : 0; 392 if( nOldId & REFFLDFLAG \|\| nOldId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef) ) 393 // then the old one stays 394 nFieldDlgFormatSel = m_xFormatLB->get_selected_index(); 395 } 396 break; 397 } 398 399 m_xNameED->set_sensitive(bName); 400 m_xNameFT->set_sensitive(bName); 401 402 // fill Format-Listbox 403 sal_Int32 nSize = FillFormatLB(nTypeId); 404 bool bFormat = nSize != 0; 405 m_xFormat->set_sensitive(bFormat); 406 407 SubTypeHdl(); 408 ModifyHdl(m_xNameED); 409 ModifyHdl(m_xFilterED); 410 } 411 412 IMPL_LINK_NOARG(SwFieldRefPage, SubTypeTreeListBoxHdl, weld::TreeView&, void) 413 { 414 SubTypeHdl(); 415 } 416 417 IMPL_LINK_NOARG(SwFieldRefPage, SubTypeListBoxHdl, weld::TreeView&, void) 418 { 419 SubTypeHdl(); 420 } 421 423 { 424 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 425 426 switch(nTypeId) 427 { 428 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 429 if (!IsFieldEdit() \|\| m_xSelectionLB->get_selected_index() != -1) 430 { 431 m_xNameED->set_text(m_xSelectionLB->get_selected_text()); 432 ModifyHdl(m_xNameED); 433 } 434 break; 435 436 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 437 { 438 SwWrtShell pSh = GetWrtShell(); 439 if(!pSh) 440 pSh = ::GetActiveWrtShell(); 441 if(pSh) 442 { 443 m_xValueED->set_text(pSh->GetSelText()); 444 } 445 446 } 447 break; 448 // #i83479# 449 case REFFLDFLAG_HEADING: 450 case REFFLDFLAG_NUMITEM: 451 { 452 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 453 if (nEntry != -1) 454 m_xNameED->set_text(m_xSelectionToolTipLB->get_text(nEntry)); 455 } 456 break; 457 458 default: 459 if (!IsFieldEdit() \|\| m_xSelectionLB->get_selected_index() != -1) 460 m_xNameED->set_text(m_xSelectionLB->get_selected_text()); 461 break; 462 } 463 } 464 465 // renew types in SelectionLB after filtering 466 void SwFieldRefPage::UpdateSubType(const OUString& filterString) 467 { 468 SwWrtShell pSh = GetWrtShell(); 469 if(!pSh) 470 pSh = ::GetActiveWrtShell(); 471 SwGetRefField pRefField = static_cast<SwGetRefField>(GetCurField()); 472 const sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 473 474 OUString sOldSel; 475 // #i83479# 476 if ( m_xSelectionLB->get_visible() ) 477 { 478 const sal_Int32 nSelectionSel = m_xSelectionLB->get_selected_index(); 479 if (nSelectionSel != -1) 480 sOldSel = m_xSelectionLB->get_text(nSelectionSel); 481 } 482 if (IsFieldEdit() && sOldSel.isEmpty()) 483 sOldSel = OUString::number( pRefField->GetSeqNo() + 1 ); 484 485 m_xSelectionLB->freeze(); 486 m_xSelectionLB->clear(); 487 488 if (REFFLDFLAG & nTypeId) 489 { 490 if (nTypeId == REFFLDFLAG_FOOTNOTE \|\| nTypeId == REFFLDFLAG_ENDNOTE) 491 { 492 m_xSelectionLB->thaw(); 493 m_xSelectionLB->make_unsorted(); 494 m_xSelectionLB->freeze(); 495 } 496 // #i83479# 497 else if (nTypeId != REFFLDFLAG_HEADING && nTypeId != REFFLDFLAG_NUMITEM) 498 { 499 m_xSelectionLB->thaw(); 500 m_xSelectionLB->make_sorted(); 501 m_xSelectionLB->freeze(); 502 } 503 } 504 505 // #i83479# 506 m_xSelectionToolTipLB->freeze(); 507 m_xSelectionToolTipLB->clear(); 508 OUString m_sSelectionToolTipLBId; 509 bool bShowSelectionToolTipLB( false ); 510 511 if( REFFLDFLAG & nTypeId ) 512 { 513 if (nTypeId == REFFLDFLAG_BOOKMARK) // text marks! 514 { 515 // get all text marks 516 IDocumentMarkAccess const pMarkAccess = pSh->getIDocumentMarkAccess(); 517 for(IDocumentMarkAccess::const_iterator_t ppMark = pMarkAccess->getBookmarksBegin(); 518 ppMark != pMarkAccess->getBookmarksEnd(); 519 ++ppMark) 520 { 521 const ::sw::mark::IMark* pBkmk = ppMark; 523 { 524 bool isSubstring = MatchSubstring(pBkmk->GetName(), filterString); 525 if(isSubstring) 526 { 527 m_xSelectionLB->append_text( pBkmk->GetName() ); 528 } 529 } 530 } 531 if (IsFieldEdit()) 532 sOldSel = pRefField->GetSetRefName(); 533 } 534 else if (nTypeId == REFFLDFLAG_FOOTNOTE) 535 { 537 const size_t nCnt = pSh->GetSeqFootnoteList( aArr ); 538 539 for( size_t n = 0; n < nCnt; ++n ) 540 { 541 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 542 if(isSubstring) 543 { 544 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 545 } 546 if (IsFieldEdit() && pRefField->GetSeqNo() == aArr[ n ].nSeqNo) 547 sOldSel = aArr[n].sDlgEntry; 548 } 549 } 550 else if (nTypeId == REFFLDFLAG_ENDNOTE) 551 { 553 const size_t nCnt = pSh->GetSeqFootnoteList( aArr, true ); 554 555 for( size_t n = 0; n < nCnt; ++n ) 556 { 557 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 558 if(isSubstring) 559 { 560 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 561 } 562 if (IsFieldEdit() && pRefField->GetSeqNo() == aArr[ n ].nSeqNo) 563 sOldSel = aArr[n].sDlgEntry; 564 } 565 } 566 // #i83479# 567 else if ( nTypeId == REFFLDFLAG_HEADING ) 568 { 569 bShowSelectionToolTipLB = true; 570 573 bool bCertainTextNodeSelected( false ); 574 for ( size_t nOutlIdx = 0; nOutlIdx < maOutlineNodes.size(); ++nOutlIdx ) 575 { 576 if (!pIDoc->isOutlineInLayout(nOutlIdx, pSh->GetLayout())) 577 { 578 continue; // skip it 579 } 580 bool isSubstring = MatchSubstring(pIDoc->getOutlineText(nOutlIdx, pSh->GetLayout(), true, true, false), filterString); 581 if(isSubstring) 582 { 583 OUString sId(OUString::number(nOutlIdx)); 584 m_xSelectionToolTipLB->append(sId, 585 pIDoc->getOutlineText(nOutlIdx, pSh->GetLayout(), true, true, false)); 586 if ( ( IsFieldEdit() && 587 pRefField->GetReferencedTextNode() == maOutlineNodes[nOutlIdx] ) \|\| 589 { 590 m_sSelectionToolTipLBId = sId; 591 sOldSel.clear(); 592 bCertainTextNodeSelected = true; 593 } 594 else if ( !bCertainTextNodeSelected && mnSavedSelectedPos == nOutlIdx ) 595 { 596 m_sSelectionToolTipLBId = sId; 597 sOldSel.clear(); 598 } 599 } 600 } 601 } 602 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 603 { 604 bShowSelectionToolTipLB = true; 605 606 const IDocumentListItems* pIDoc( pSh->getIDocumentListItemsAccess() ); 607 pIDoc->getNumItems( maNumItems ); 608 bool bCertainTextNodeSelected( false ); 609 for ( size_t nNumItemIdx = 0; nNumItemIdx < maNumItems.size(); ++nNumItemIdx ) 610 { 611 if (!pIDoc->isNumberedInLayout(maNumItems[nNumItemIdx], pSh->GetLayout())) 612 { 613 continue; // skip it 614 } 615 bool isSubstring = MatchSubstring(pIDoc->getListItemText(maNumItems[nNumItemIdx], pSh->GetLayout()), filterString); 616 if(isSubstring) 617 { 618 OUString sId(OUString::number(nNumItemIdx)); 619 m_xSelectionToolTipLB->append(sId, 620 pIDoc->getListItemText(maNumItems[nNumItemIdx], pSh->GetLayout())); 621 if ( ( IsFieldEdit() && 622 pRefField->GetReferencedTextNode() == maNumItems[nNumItemIdx]->GetTextNode() ) \|\| 623 mpSavedSelectedTextNode == maNumItems[nNumItemIdx]->GetTextNode() ) 624 { 625 m_sSelectionToolTipLBId = sId; 626 sOldSel.clear(); 627 bCertainTextNodeSelected = true; 628 } 629 else if ( !bCertainTextNodeSelected && mnSavedSelectedPos == nNumItemIdx ) 630 { 631 m_sSelectionToolTipLBId = sId; 632 sOldSel.clear(); 633 } 634 } 635 } 636 } 637 else 638 { 639 // get the fields to Seq-FieldType: 640 641 SwSetExpFieldType* pType = static_cast<SwSetExpFieldType>(pSh->GetFieldType( 642 nTypeId & ~REFFLDFLAG, SwFieldIds::SetExp )); 643 if( pType ) 644 { 646 // old selection should be kept in non-edit mode 647 if(IsFieldEdit()) 648 sOldSel.clear(); 649 650 const size_t nCnt = pType->GetSeqFieldList(aArr, pSh->GetLayout()); 651 for( size_t n = 0; n < nCnt; ++n ) 652 { 653 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 654 if(isSubstring) 655 { 656 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 657 } 658 if (IsFieldEdit() && sOldSel.isEmpty() && 659 aArr[ n ].nSeqNo == pRefField->GetSeqNo()) 660 sOldSel = aArr[ n ].sDlgEntry; 661 } 662 663 if (IsFieldEdit() && sOldSel.isEmpty()) 664 sOldSel = OUString::number( pRefField->GetSeqNo() + 1); 665 } 666 } 667 } 668 else 669 { 670 std::vector<OUString> aLst; 671 GetFieldMgr().GetSubTypes(static_cast<SwFieldTypesEnum>(nTypeId), aLst); 672 for(const OUString & i : aLst) 673 { 674 bool isSubstring = MatchSubstring( i , filterString ); 675 if(isSubstring) 676 { 677 m_xSelectionLB->append_text(i); 678 } 679 } 680 681 if (IsFieldEdit()) 682 sOldSel = pRefField->GetSetRefName(); 683 } 684 685 // #i83479# 686 m_xSelectionLB->thaw(); 687 m_xSelectionToolTipLB->thaw(); 688 if (!m_sSelectionToolTipLBId.isEmpty()) 689 m_xSelectionToolTipLB->select_id(m_sSelectionToolTipLBId); 690 m_xSelectionToolTipLB->set_visible( bShowSelectionToolTipLB ); 691 m_xSelectionLB->set_visible( !bShowSelectionToolTipLB ); 692 if ( bShowSelectionToolTipLB ) 693 { 694 bool bEnable = m_xSelectionToolTipLB->n_children() != 0; 695 m_xSelection->set_sensitive( bEnable ); 696 697 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 698 if (nEntry != -1) 699 m_xSelectionToolTipLB->scroll_to_row(nEntry); 700 701 if (IsFieldEdit() && nEntry == -1) 702 { 703 m_xNameED->set_text(sOldSel); 704 } 705 } 706 else 707 { 708 // enable or disable 709 bool bEnable = m_xSelectionLB->n_children() != 0; 710 m_xSelection->set_sensitive( bEnable ); 711 712 if ( bEnable ) 713 { 714 m_xSelectionLB->select_text(sOldSel); 715 if (m_xSelectionLB->get_selected_index() == -1 && !IsFieldEdit()) 716 m_xSelectionLB->select(0); 717 } 718 719 if (IsFieldEdit() && m_xSelectionLB->get_selected_index() == -1) // in case the reference was already deleted... 720 m_xNameED->set_text(sOldSel); 721 } 722 } 723 724 bool SwFieldRefPage::MatchSubstring( const OUString& rListString, const OUString& rSubstr ) 725 { 726 if(rSubstr.isEmpty()) 727 return true; 728 OUString aListString = GetAppCharClass().lowercase(rListString); 729 OUString aSubstr = GetAppCharClass().lowercase(rSubstr); 730 return aListString.indexOf(aSubstr) >= 0; 731 } 732 733 namespace { 734 736 { 737 FMT_REF_PAGE_IDX = 0, 738 FMT_REF_CHAPTER_IDX = 1, 739 FMT_REF_TEXT_IDX = 2, 740 FMT_REF_UPDOWN_IDX = 3, 741 FMT_REF_PAGE_PGDSC_IDX = 4, 742 FMT_REF_ONLYNUMBER_IDX = 5, 743 FMT_REF_ONLYCAPTION_IDX = 6, 744 FMT_REF_ONLYSEQNO_IDX = 7, 745 FMT_REF_NUMBER_IDX = 8, 746 FMT_REF_NUMBER_NO_CONTEXT_IDX = 9, 747 FMT_REF_NUMBER_FULL_CONTEXT_IDX = 10 748 }; 749 750 } 751 752 static const char FMT_REF_ARY[] = 753 { 754 FMT_REF_PAGE, 755 FMT_REF_CHAPTER, 756 FMT_REF_TEXT, 757 FMT_REF_UPDOWN, 758 FMT_REF_PAGE_PGDSC, 759 FMT_REF_ONLYNUMBER, 760 FMT_REF_ONLYCAPTION, 761 FMT_REF_ONLYSEQNO, 762 FMT_REF_NUMBER, 763 FMT_REF_NUMBER_NO_CONTEXT, 764 FMT_REF_NUMBER_FULL_CONTEXT 765 }; 766 767 sal_Int32 SwFieldRefPage::FillFormatLB(sal_uInt16 nTypeId) 768 { 769 OUString sOldSel; 770 771 sal_Int32 nFormatSel = m_xFormatLB->get_selected_index(); 772 if (nFormatSel != -1) 773 sOldSel = m_xFormatLB->get_text(nFormatSel); 774 775 // fill Format-Listbox 776 m_xFormatLB->clear(); 777 778 // reference has less that the annotation 779 sal_uInt16 nSize( 0 ); 780 bool bAddCrossRefFormats( false ); 781 switch (nTypeId) 782 { 783 // #i83479# 784 case REFFLDFLAG_HEADING: 785 case REFFLDFLAG_NUMITEM: 786 bAddCrossRefFormats = true; 787 [[fallthrough]]; 788 789 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 790 case REFFLDFLAG_BOOKMARK: 791 case REFFLDFLAG_FOOTNOTE: 792 case REFFLDFLAG_ENDNOTE: 793 nSize = FMT_REF_PAGE_PGDSC_IDX + 1; 794 break; 795 796 default: 797 // #i83479# 798 799 if ( REFFLDFLAG & nTypeId ) 800 { 801 nSize = FMT_REF_ONLYSEQNO_IDX + 1; 802 } 803 else 804 { 805 nSize = GetFieldMgr().GetFormatCount( static_cast<SwFieldTypesEnum>(nTypeId), IsFieldDlgHtmlMode() ); 806 } 807 break; 808 } 809 810 if (REFFLDFLAG & nTypeId) 811 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 812 813 SwFieldTypesEnum nFieldType = static_cast<SwFieldTypesEnum>(nTypeId); 814 for (sal_uInt16 i = 0; i < nSize; i++) 815 { 816 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i ))); 817 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr(nFieldType, i)); 818 } 819 // #i83479# 820 821 sal_uInt16 nExtraSize( 0 ); 822 if ( bAddCrossRefFormats ) 823 { 824 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX; 825 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 826 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 827 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX; 828 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 829 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 830 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX; 831 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 832 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 833 nExtraSize = 3; 834 } 835 836 // extra list items optionally, depending from reference-language 837 SvtSysLocaleOptions aSysLocaleOptions; 838 static const LanguageTag& rLang = aSysLocaleOptions.GetRealLanguageTag(); 839 840 if (rLang.getLanguage() == "hu") 841 { 842 for (sal_uInt16 i = 0; i < nSize; i++) 843 { 844 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i + SAL_N_ELEMENTS(FMT_REF_ARY)))); 845 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, i )); 846 } 847 nExtraSize += nSize; 848 849 if ( bAddCrossRefFormats ) 850 { 851 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 852 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 853 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 854 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 855 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 856 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 857 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 858 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 859 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 860 nExtraSize += 3; 861 } 862 // uppercase article 863 for (sal_uInt16 i = 0; i < nSize; i++) 864 { 865 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i + 2 * SAL_N_ELEMENTS(FMT_REF_ARY)))); 866 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, i )); 867 } 868 nExtraSize += nSize; 869 if ( bAddCrossRefFormats ) 870 { 871 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 872 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 873 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 874 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 875 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 876 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 877 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 878 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 879 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 880 nExtraSize += 3; 881 } 882 } 883 884 nSize += nExtraSize; 885 886 // select a certain entry 887 if (nSize) 888 { 889 if (!IsFieldEdit()) 890 m_xFormatLB->select_text(sOldSel); 891 else 892 m_xFormatLB->select_text(SwResId(FMT_REF_ARY[GetCurField()->GetFormat() % SAL_N_ELEMENTS(FMT_REF_ARY)])); 893 894 if (m_xFormatLB->get_selected_index() == -1) 895 { 896 if (nFieldDlgFormatSel < m_xFormatLB->n_children()) 898 else 899 m_xFormatLB->select(0); 900 } 901 } 902 903 return nSize; 904 } 905 906 // Modify 908 { 909 OUString aName(m_xNameED->get_text()); 910 const bool bEmptyName = aName.isEmpty(); 911 912 bool bEnable = true; 913 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 914 915 if ((nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef) && !GetFieldMgr().CanInsertRefMark(aName)) \|\| 916 (bEmptyName && (nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef) \|\| nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef) \|\| 917 nTypeId == REFFLDFLAG_BOOKMARK))) 918 bEnable = false; 919 920 EnableInsert(bEnable); 921 922 m_xSelectionLB->select_text(aName); 923 } 924 926 { 927 bool bModified = false; 928 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 929 930 sal_uInt16 nSubType = 0; 931 const sal_Int32 nEntryPos = m_xFormatLB->get_selected_index(); 932 const sal_uLong nFormat = (nEntryPos == -1) 933 ? 0 : m_xFormatLB->get_id(nEntryPos).toUInt32(); 934 935 OUString aVal(m_xValueED->get_text()); 936 OUString aName(m_xNameED->get_text()); 937 938 switch(nTypeId) 939 { 940 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 941 nSubType = REF_SETREFATTR; 942 break; 943 944 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 945 { 947 948 if(!pType) // Only insert when the name doesn't exist yet 949 { 950 m_xSelectionLB->append_text(aName); 951 m_xSelection->set_sensitive(true); 952 } 953 break; 954 } 955 } 956 957 SwGetRefField* pRefField = static_cast<SwGetRefField>(GetCurField()); 958 959 if (REFFLDFLAG & nTypeId) 960 { 961 SwWrtShell pSh = GetWrtShell(); 962 if(!pSh) 963 { 964 pSh = ::GetActiveWrtShell(); 965 } 966 if (nTypeId == REFFLDFLAG_BOOKMARK) // text marks! 967 { 968 aName = m_xNameED->get_text(); 969 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 970 nSubType = REF_BOOKMARK; 971 } 972 else if (REFFLDFLAG_FOOTNOTE == nTypeId) // footnotes 973 { 975 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 976 977 size_t nPos = 0; 978 979 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 980 nSubType = REF_FOOTNOTE; 981 aName.clear(); 982 983 if (pSh->GetSeqFootnoteList(aArr) && aArr.SeekEntry(aElem, &nPos)) 984 { 985 aVal = OUString::number( aArr[nPos].nSeqNo ); 986 987 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 988 bModified = true; // can happen with fields of which the references were deleted 989 } 990 else if (IsFieldEdit()) 991 aVal = OUString::number( pRefField->GetSeqNo() ); 992 } 993 else if (REFFLDFLAG_ENDNOTE == nTypeId) // endnotes 994 { 996 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 997 998 size_t nPos = 0; 999 1000 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1001 nSubType = REF_ENDNOTE; 1002 aName.clear(); 1003 1004 if (pSh->GetSeqFootnoteList(aArr, true) && aArr.SeekEntry(aElem, &nPos)) 1005 { 1006 aVal = OUString::number( aArr[nPos].nSeqNo ); 1007 1008 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 1009 bModified = true; // can happen with fields of which the reference was deleted 1010 } 1011 else if (IsFieldEdit()) 1012 aVal = OUString::number( pRefField->GetSeqNo() ); 1013 } 1014 // #i83479# 1015 else if ( nTypeId == REFFLDFLAG_HEADING ) 1016 { 1017 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 1018 OSL_ENSURE( nEntry != -1, 1019 "<SwFieldRefPage::FillItemSet(..)> - no entry selected in selection tool tip listbox!" ); 1020 if (nEntry != -1) 1021 { 1022 const size_t nOutlIdx(m_xSelectionToolTipLB->get_id(nEntry).toUInt32()); 1024 if ( nOutlIdx < maOutlineNodes.size() ) 1025 { 1026 ::sw::mark::IMark const * const pMark = pSh->getIDocumentMarkAccess()->getMarkForTextNode( 1027 (maOutlineNodes[nOutlIdx]), 1029 aName = pMark->GetName(); 1030 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1031 nSubType = REF_BOOKMARK; 1032 } 1033 } 1034 } 1035 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 1036 { 1037 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 1038 OSL_ENSURE( nEntry != -1, 1039 "<SwFieldRefPage::FillItemSet(..)> - no entry selected in selection tool tip listbox!" ); 1040 if (nEntry != -1) 1041 { 1042 const size_t nNumItemIdx(m_xSelectionToolTipLB->get_id(nEntry).toUInt32()); 1044 if ( nNumItemIdx < maNumItems.size() ) 1045 { 1046 ::sw::mark::IMark const const pMark = pSh->getIDocumentMarkAccess()->getMarkForTextNode( 1047 (maNumItems[nNumItemIdx]->GetTextNode()), 1049 aName = pMark->GetName(); 1050 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1051 nSubType = REF_BOOKMARK; 1052 } 1053 } 1054 } 1055 else // SequenceFields 1056 { 1057 // get fields for Seq-FieldType: 1058 SwSetExpFieldType pType = static_cast<SwSetExpFieldType>(pSh->GetFieldType( 1059 nTypeId & ~REFFLDFLAG, SwFieldIds::SetExp )); 1060 if( pType ) 1061 { 1063 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 1064 1065 size_t nPos = 0; 1066 1067 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1068 nSubType = REF_SEQUENCEFLD; 1069 aName = pType->GetName(); 1070 1071 if (pType->GetSeqFieldList(aArr, pSh->GetLayout()) 1072 && aArr.SeekEntry(aElem, &nPos)) 1073 { 1074 aVal = OUString::number( aArr[nPos].nSeqNo ); 1075 1076 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 1077 bModified = true; // can happen with fields of which the reference was deleted 1078 } 1079 else if (IsFieldEdit()) 1080 aVal = OUString::number( pRefField->GetSeqNo() ); 1081 } 1082 } 1083 } 1084 1085 if (IsFieldEdit() && nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef)) 1086 { 1087 aVal = OUString::number(nSubType) + "\|" + aVal; 1088 } 1089 1090 if (!IsFieldEdit() \|\| bModified \|\| 1091 m_xNameED->get_value_changed_from_saved() \|\| 1092 m_xValueED->get_value_changed_from_saved() \|\| 1093 m_xTypeLB->get_value_changed_from_saved() \|\| 1094 m_xSelectionLB->get_value_changed_from_saved() \|\| 1095 m_xFormatLB->get_value_changed_from_saved()) 1096 { 1097 InsertField( static_cast<SwFieldTypesEnum>(nTypeId), nSubType, aName, aVal, nFormat ); 1098 } 1099 1100 ModifyHdl(m_xNameED); // enable/disable insert if applicable 1101 1102 return false; 1103 } 1104 1105 std::unique_ptr<SfxTabPage> SwFieldRefPage::Create( weld::Container* pPage, weld::DialogController* pController, 1106 const SfxItemSet const pAttrSet) 1107 { 1108 return std::make_unique<SwFieldRefPage>(pPage, pController, pAttrSet); 1109 } 1110 1112 { 1113 return GRP_REF; 1114 } 1115 1117 { 1118 const sal_Int32 nEntryPos = m_xTypeLB->get_selected_index(); 1119 const sal_uInt16 nTypeSel = ( -1 == nEntryPos ) 1120 ? USHRT_MAX 1121 : m_xTypeLB->get_id(nEntryPos).toUInt32(); 1122 const sal_Int32 nFormatEntryPos = m_xFormatLB->get_selected_index(); 1123 const sal_uInt32 nFormatSel = -1 == nFormatEntryPos ? USHRT_MAX : nFormatEntryPos; 1125 OUString::number( nTypeSel ) + ";" + 1126 OUString::number( nFormatSel )); 1127 } 1128 1129 / vim:set shiftwidth=4 softtabstop=4 expandtab: / SwFieldType GetFieldType(size_t nField, SwFieldIds nResId=SwFieldIds::Unknown) const get field types with a ResId, if 0 get all Definition: edfld.cxx:64 SwFieldType * GetFieldType(SwFieldIds nResId, size_t nField=0) const Definition: fldmgr.cxx:409 Instances of SwFields and those derived from it occur 0 to n times. Definition: fldbas.hxx:234 virtual void getNumItems(IDocumentListItems::tSortedNodeNumList &orNodeNumList) const =0 get vector of all list items, which are numbered sal_uInt16 const nStart Definition: fldmgr.hxx:63 IMPL_LINK_NOARG(SwFieldRefPage, ModifyHdl_Impl, weld::Entry &, void) Definition: fldref.cxx:115 IDocumentListItems::tSortedNodeNumList maNumItems Definition: fldref.hxx:39 virtual const OUString & GetName() const =0 OUString sNumItemText Definition: fldref.hxx:36 void RestorePos(weld::TreeView &rLst1) Definition: fldpage.cxx:294 virtual sal_uInt16 GetGroup() override Definition: fldref.cxx:1111 std::unique_ptr< weld::Entry > m_xValueED Definition: fldref.hxx:56 void SetUserData(const OUString &rString) #define REFFLDFLAG_ENDNOTE Definition: fldref.cxx:44 #define USER_DATA_VERSION Definition: fldref.cxx:52 const IDocumentOutlineNodes * getIDocumentOutlineNodesAccess() const Definition: viewsh.cxx:2605 wrapper iterator: wraps iterator of implementation while hiding MarkBase class; only IMark instances ... sal_uIntPtr sal_uLong Provides numbered items of a document. static SW_DLLPUBLIC MarkType GetType(const ::sw::mark::IMark &rMark) Returns the MarkType used to create the mark. Definition: docbm.cxx:474 IDocumentOutlineNodes::tSortedOutlineNodeList maOutlineNodes Definition: fldref.hxx:38 sal_Int64 n SwWrtShell * GetActiveWrtShell() Definition: swmodul1.cxx:107 Provides access to the marks of a document. void SubTypeHdl() Definition: fldref.cxx:422 void SaveSelectedTextNode() Definition: fldref.cxx:121 std::unique_ptr< weld::Entry > m_xFilterED Definition: fldref.hxx:57 bool HasWriterListeners() const Definition: calbck.hxx:208 #define REFFLDFLAG Definition: fldref.cxx:41 Used by the UI to modify the document model. Definition: wrtsh.hxx:90 virtual ~SwFieldRefPage() override Definition: fldref.cxx:111 static sal_uInt16 nFieldDlgFormatSel Definition: fldref.cxx:49 SwFieldMgr & GetFieldMgr() Definition: fldpage.hxx:81 std::unique_ptr< weld::Widget > m_xSelection Definition: fldref.hxx:48 static SwFieldTypesEnum GetTypeId(sal_uInt16 nPos) Definition: fldmgr.cxx:520 OUString getLanguage() const virtual void getOutlineNodes(IDocumentOutlineNodes::tSortedOutlineNodeList &orOutlineNodeList) const =0 bool SeekEntry(const SeqFieldLstElem &rNew, size_t pPos) const Definition: expfld.cxx:752 const SwTextNode mpSavedSelectedTextNode Definition: fldref.hxx:43 virtual bool FillItemSet(SfxItemSet rSet) override Definition: fldref.cxx:925 void SetSelectionSel(sal_Int32 nSet) Definition: fldpage.hxx:48 const OUString & GetUserData() const sal_uInt16 GetFormatCount(SwFieldTypesEnum nTypeId, bool bHtmlMode) const Definition: fldmgr.cxx:670 #define REFFLDFLAG_NUMITEM Definition: fldref.cxx:47 bool IsFieldDlgHtmlMode() const Definition: fldpage.hxx:49 const IDocumentMarkAccess getIDocumentMarkAccess() const Provides access to the document bookmark interface. Definition: viewsh.cxx:2582 const char * sName #define SAL_N_ELEMENTS(arr) std::unique_ptr< weld::TreeView > m_xSelectionToolTipLB Definition: fldref.hxx:51 virtual const_iterator_t getBookmarksEnd() const =0 returns a STL-like random access iterator to the end of the sequence of IBookmarks. bool IsRefToNumItemCrossRefBookmark() const Definition: reffld.cxx:385 #define REFFLDFLAG_BOOKMARK Definition: fldref.cxx:42 void SavePos(const weld::TreeView &rLst1) Definition: fldpage.cxx:284 static bool MatchSubstring(const OUString &list_string, const OUString &substr) Definition: fldref.cxx:724 int i SwFieldTypesEnum List of FieldTypes at UI. Definition: fldbas.hxx:87 void Init() Definition: fldpage.cxx:65 const SvxPageUsage aArr[] size_t GetFieldTypeCount(SwFieldIds nResId=SwFieldIds::Unknown) const count field types with a ResId, if SwFieldIds::Unknown count all Definition: edfld.cxx:43 bool IsRefresh() const Definition: fldpage.hxx:50 bool IsUsed(const SwModify &) const Query if the paragraph-/character-/frame-/page-style is used. Definition: edfmt.cxx:139 void InsertField(SwFieldTypesEnum nTypeId, sal_uInt16 nSubType, const OUString &rPar1, const OUString &rPar2, sal_uInt32 nFormatId, sal_Unicode cDelim= ' ', bool bIsAutomaticLanguage=true) Definition: fldpage.cxx:117 sal_Int32 GetTypeSel() const Definition: fldpage.hxx:45 virtual void Reset(const SfxItemSet rSet) override Definition: fldref.cxx:152 size_t GetSeqFootnoteList(SwSeqFieldList &rList, bool bEndNotes=false) Give a List of all footnotes and their beginning texts. Definition: edattr.cxx:454 SwField GetCurField() Definition: fldpage.hxx:51 OUString SwResId(const char pId) Definition: swmodule.cxx:178 OUString lowercase(const OUString &rStr, sal_Int32 nPos, sal_Int32 nCount) const void UpdateSubType(const OUString &filterString) Definition: fldref.cxx:466 OUString sFootnoteText Definition: fldref.hxx:32 #define FIELD_COLUMN_WIDTH Definition: fldpage.hxx:25 sal_uInt16 const nEnd Definition: fldmgr.hxx:64 virtual OUString GetName() const override Only in derived classes. Definition: expfld.cxx:527 FMT_REF_IDX Definition: fldref.cxx:735 OUString sBookmarkText Definition: fldref.hxx:31 const LanguageTag & GetRealLanguageTag() const OUString sHeadingText Definition: fldref.hxx:35 SwWrtShell GetWrtShell() Definition: fldpage.hxx:52 const SwGetSetExpType GSE_SEQ Sequence. Definition: fldbas.hxx:198 sal_uInt16 GetSeqNo() const Get/set SequenceNo (of interest only for REF_SEQUENCEFLD). Definition: reffld.hxx:132 virtual ::sw::mark::IMark * getMarkForTextNode(const SwTextNode &rTextNode, MarkType eMark)=0 Returns a mark in the document for a paragraph. bool IsRefToHeadingCrossRefBookmark() const Definition: reffld.cxx:379 const IDocumentListItems * getIDocumentListItemsAccess() const Definition: viewsh.cxx:2600 bool HasFootnotes(bool bEndNotes=false) const Definition: edattr.cxx:441 std::unique_ptr< weld::TreeView > m_xFormatLB Definition: fldref.hxx:53 Provides outline nodes of a document. const o3tl::enumarray< SvxAdjust, unsigned short > aSvxToUnoAdjust USHRT_MAX Definition: unosett.cxx:253 OUString GetSelText() const get selected text of a node at current cursor Definition: crsrsh.cxx:2515 virtual const_iterator_t getBookmarksBegin() const =0 returns a STL-like random access iterator to the begin of the sequence the IBookmarks. OUString aName OString strip(const OString &rIn, char c) virtual void FillUserData() override Definition: fldref.cxx:1116 const OUString & GetSetRefName() const Definition: reffld.hxx:107 std::unique_ptr< weld::TreeView > m_xTypeLB Definition: fldref.hxx:47 static const char * FMT_REF_ARY[] Definition: fldref.cxx:752 static OUString GetTypeStr(sal_uInt16 nPos) Definition: fldmgr.cxx:526 OUString sId bool IsFieldEdit() const Definition: fldpage.hxx:62 #define REFFLDFLAG_HEADING Definition: fldref.cxx:46 static std::unique_ptr< SfxTabPage > Create(weld::Container pPage, weld::DialogController pController, const SfxItemSet rAttrSet) Definition: fldref.cxx:1105 sal_uInt16 GetType() const Definition: expfld.hxx:193 static const SwFieldGroupRgn & GetGroupRange(bool bHtmlMode, sal_uInt16 nGrpId) Definition: fldmgr.cxx:464 sal_Int32 FillFormatLB(sal_uInt16 nTypeId) Definition: fldref.cxx:767 SwRootFrame GetLayout() const Definition: viewsh.cxx:2062 CharClass & GetAppCharClass() Definition: init.cxx:709 OUString sEndnoteText Definition: fldref.hxx:33 size_t mnSavedSelectedPos Definition: fldref.hxx:45 #define REFFLDFLAG_FOOTNOTE Definition: fldref.cxx:43 std::unique_ptr< weld::TreeView > m_xSelectionLB Definition: fldref.hxx:49 const SwTextNode * GetReferencedTextNode() const Definition: reffld.cxx:391 void SetTypeSel(sal_Int32 nSet) Definition: fldpage.hxx:46 sal_uInt16 nPos size_t GetSeqFieldList(SwSeqFieldList &rList, SwRootFrame const pLayout) Definition: expfld.cxx:618 void GetSubTypes(SwFieldTypesEnum nId, std::vector< OUString > &rToFill) Definition: fldmgr.cxx:567 SwFieldRefPage(weld::Container pPage, weld::DialogController pController, const SfxItemSet pSet) Definition: fldref.cxx:54 std::unique_ptr< weld::Entry > m_xNameED Definition: fldref.hxx:55 #define USER_DATA_VERSION_1 Definition: fldref.cxx:51	{ "url": "https://docs.libreoffice.org/sw/html/fldref_8cxx_source.html", "source_domain": "docs.libreoffice.org", "snapshot_id": "crawl=CC-MAIN-2020-05", "warc_metadata": { "Content-Length": "284725", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GGSWXDFZAIO4FJID4WHRPE6AVEHUSOVP", "WARC-Concurrent-To": "<urn:uuid:8f4a39d4-08a5-40ab-a4e3-8ce615c067fd>", "WARC-Date": "2020-01-25T13:42:51Z", "WARC-IP-Address": "89.238.68.142", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:7E5LPBUHIESMW2VMDPDNPYXAPUGFHFBH", "WARC-Record-ID": "<urn:uuid:f3db0a9a-9efc-40dc-b890-1b8133949951>", "WARC-Target-URI": "https://docs.libreoffice.org/sw/html/fldref_8cxx_source.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4bca8673-06db-4fad-9821-c13877cb0ab6>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-245.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, 34, 45, 83, 165, 170, 221, 226, 299, 372, 434, 439, 513, 519, 592, 662, 730, 798, 868, 938, 1004, 1011, 1015, 1041, 1064, 1088, 1113, 1140, 1165, 1190, 1214, 1218, 1243, 1269, 1295, 1323, 1361, 1385, 1422, 1459, 1463, 1499, 1503, 1532, 1570, 1608, 1645, 1660, 1697, 1734, 1738, 1783, 1787, 1822, 1871, 1875, 1975, 1998, 2017, 2056, 2084, 2136, 2195, 2254, 2323, 2379, 2435, 2485, 2533, 2583, 2635, 2640, 2675, 2691, 2759, 2765, 2825, 2887, 2893, 2897, 2941, 2985, 3028, 3044, 3087, 3130, 3134, 3184, 3265, 3315, 3367, 3424, 3470, 3534, 3538, 3562, 3566, 3637, 3719, 3723, 3808, 3878, 3963, 4054, 4142, 4147, 4164, 4262, 4362, 4394, 4400, 4405, 4411, 4417, 4422, 4428, 4505, 4511, 4516, 4532, 4538, 4578, 4607, 4656, 4663, 4726, 4749, 4756, 4832, 4837, 4879, 4886, 4962, 5017, 5024, 5031, 5038, 5085, 5092, 5168, 5219, 5226, 5233, 5240, 5247, 5254, 5260, 5265, 5271, 5296, 5303, 5329, 5346, 5353, 5379, 5400, 5439, 5444, 5475, 5501, 5526, 5531, 5557, 5562, 5591, 5596, 5647, 5654, 5718, 5723, 5787, 5794, 5897, 5904, 5911, 5916, 5933, 5981, 6057, 6133, 6138, 6178, 6216, 6231, 6265, 6270, 6285, 6298, 6303, 6381, 6386, 6514, 6519, 6567, 6574, 6579, 6691, 6698, 6774, 6781, 6788, 6793, 6854, 6932, 6937, 6956, 6987, 6994, 7072, 7079, 7084, 7102, 7138, 7145, 7221, 7228, 7233, 7257, 7262, 7285, 7310, 7315, 7344, 7349, 7397, 7421, 7428, 7454, 7501, 7559, 7608, 7615, 7715, 7742, 7749, 7836, 7843, 7893, 7900, 7927, 7939, 7946, 7953, 8001, 8008, 8105, 8112, 8119, 8126, 8133, 8159, 8216, 8223, 8269, 8276, 8300, 8307, 8337, 8372, 8404, 8434, 8465, 8505, 8512, 8518, 8523, 8529, 8557, 8599, 8604, 8631, 8681, 8686, 8714, 8721, 8745, 8752, 8777, 8798, 8825, 8830, 8873, 8880, 8904, 8911, 8928, 9005, 9028, 9079, 9086, 9113, 9146, 9153, 9181, 9232, 9239, 9266, 9299, 9306, 9316, 9323, 9351, 9385, 9392, 9399, 9411, 9416, 9440, 9468, 9502, 9514, 9519, 9542, 9569, 9602, 9614, 9619, 9645, 9682, 9711, 9723, 9728, 9755, 9829, 9854, 9866, 9873, 9878, 9951, 9958, 10014, 10021, 10026, 10062, 10112, 10119, 10129, 10136, 10156, 10183, 10190, 10197, 10202, 10233, 10246, 10251, 10321, 10326, 10357, 10434, 10439, 10464, 10493, 10498, 10562, 10580, 10587, 10625, 10664, 10704, 10711, 10716, 10738, 10745, 10806, 10878, 10904, 10965, 10984, 10996, 11001, 11062, 11081, 11093, 11098, 11129, 11148, 11170, 11184, 11216, 11223, 11307, 11401, 11432, 11493, 11500, 11512, 11519, 11524, 11562, 11600, 11605, 11633, 11679, 11711, 11751, 11756, 11775, 11803, 11833, 11839, 11844, 11926, 11932, 11951, 11957, 11962, 12040, 12046, 12065, 12071, 12076, 12082, 12152, 12157, 12178, 12185, 12246, 12317, 12324, 12387, 12415, 12422, 12434, 12439, 12500, 12507, 12545, 12559, 12593, 12606, 12613, 12659, 12666, 12671, 12678, 12690, 12707, 12737, 12767, 12774, 12837, 12860, 12927, 12934, 12946, 12951, 12965, 13036, 13099, 13111, 13118, 13124, 13129, 13179, 13248, 13254, 13292, 13306, 13340, 13416, 13492, 13497, 13520, 13537, 13579, 13586, 13661, 13691, 13747, 13754, 13799, 13861, 13866, 13897, 13927, 13932, 13963, 13970, 14044, 14051, 14080, 14118, 14149, 14156, 14173, 14251, 14258, 14287, 14323, 14354, 14361, 14368, 14373, 14390, 14428, 14465, 14504, 14548, 14553, 14585, 14592, 14648, 14655, 14682, 14759, 14849, 14896, 14911, 14918, 14965, 14972, 15044, 15065, 15072, 15126, 15133, 15140, 15147, 15171, 15214, 15221, 15267, 15274, 15332, 15337, 15377, 15384, 15459, 15480, 15487, 15544, 15551, 15620, 15654, 15661, 15668, 15713, 15720, 15784, 15789, 15829, 15836, 15911, 15932, 15939, 15996, 16003, 16072, 16106, 16113, 16120, 16137, 16184, 16191, 16228, 16233, 16278, 16357, 16364, 16429, 16436, 16462, 16469, 16593, 16614, 16621, 16668, 16708, 16784, 16813, 16886, 16893, 16929, 16951, 16989, 16996, 17073, 17080, 17116, 17138, 17145, 17152, 17159, 17166, 17213, 17220, 17257, 17262, 17338, 17377, 17422, 17506, 17513, 17595, 17602, 17628, 17635, 17758, 17779, 17786, 17836, 17876, 17951, 17980, 18067, 18140, 18147, 18183, 18205, 18243, 18250, 18330, 18337, 18373, 18395, 18402, 18409, 18416, 18423, 18433, 18440, 18481, 18486, 18569, 18620, 18637, 18644, 18698, 18721, 18743, 18748, 18821, 18861, 18868, 18943, 18964, 18971, 19028, 19035, 19082, 19130, 19166, 19173, 19178, 19223, 19284, 19291, 19298, 19305, 19315, 19322, 19355, 19433, 19469, 19476, 19536, 19557, 19564, 19601, 19608, 19615, 19620, 19644, 19687, 19694, 19699, 19716, 19745, 19781, 19826, 19890, 19958, 20020, 20056, 20063, 20125, 20170, 20175, 20238, 20261, 20312, 20317, 20357, 20364, 20399, 20406, 20413, 20423, 20430, 20456, 20511, 20556, 20561, 20581, 20588, 20631, 20702, 20734, 20741, 20746, 20864, 20899, 20906, 20912, 20917, 21013, 21019, 21046, 21064, 21134, 21196, 21243, 21249, 21254, 21270, 21275, 21281, 21308, 21338, 21365, 21394, 21427, 21460, 21494, 21526, 21555, 21595, 21637, 21644, 21649, 21655, 21660, 21699, 21705, 21724, 21746, 21765, 21786, 21811, 21836, 21862, 21886, 21907, 21939, 21972, 21979, 21984, 22047, 22053, 22076, 22081, 22144, 22171, 22221, 22226, 22254, 22281, 22286, 22333, 22361, 22401, 22423, 22430, 22447, 22477, 22507, 22540, 22562, 22567, 22628, 22659, 22690, 22720, 22761, 22773, 22778, 22792, 22809, 22814, 22847, 22854, 22894, 22901, 22911, 22918, 23025, 23032, 23044, 23051, 23056, 23087, 23153, 23158, 23233, 23277, 23284, 23365, 23439, 23446, 23463, 23468, 23501, 23533, 23540, 23586, 23671, 23753, 23799, 23876, 23958, 24006, 24083, 24165, 24186, 24193, 24198, 24269, 24313, 24392, 24397, 24435, 24442, 24486, 24493, 24603, 24724, 24731, 24757, 24762, 24794, 24801, 24877, 24962, 25118, 25194, 25271, 25427, 25505, 25582, 25738, 25760, 25767, 25793, 25837, 25844, 25958, 26079, 26086, 26112, 26144, 26151, 26231, 26316, 26472, 26552, 26629, 26785, 26867, 26944, 27100, 27122, 27129, 27136, 27141, 27167, 27172, 27203, 27219, 27226, 27251, 27291, 27301, 27412, 27417, 27467, 27474, 27531, 27541, 27570, 27577, 27584, 27589, 27608, 27614, 27619, 27633, 27639, 27683, 27729, 27734, 27760, 27830, 27835, 27952, 28101, 28140, 28162, 28167, 28195, 28200, 28241, 28247, 28252, 28258, 28287, 28357, 28362, 28392, 28460, 28509, 28563, 28568, 28612, 28656, 28661, 28682, 28689, 28750, 28782, 28794, 28799, 28860, 28867, 28872, 28935, 28942, 28983, 29023, 29030, 29042, 29049, 29056, 29061, 29137, 29142, 29173, 29180, 29218, 29232, 29239, 29273, 29280, 29336, 29343, 29379, 29445, 29475, 29482, 29541, 29548, 29618, 29623, 29645, 29650, 29716, 29746, 29766, 29771, 29843, 29850, 29901, 29906, 29976, 30062, 30069, 30098, 30153, 30160, 30217, 30224, 30294, 30299, 30321, 30326, 30393, 30423, 30444, 30450, 30529, 30537, 30589, 30595, 30666, 30751, 30759, 30789, 30845, 30853, 30871, 30919, 30927, 30991, 31023, 31119, 31143, 31151, 31230, 31276, 31284, 31381, 31416, 31448, 31515, 31546, 31554, 31562, 31570, 31618, 31626, 31690, 31722, 31818, 31842, 31850, 31932, 31977, 31985, 32082, 32131, 32163, 32230, 32261, 32269, 32277, 32285, 32314, 32322, 32361, 32445, 32497, 32515, 32523, 32594, 32600, 32623, 32629, 32696, 32730, 32762, 32768, 32825, 32864, 32872, 32924, 32930, 33001, 33086, 33094, 33124, 33180, 33188, 33196, 33204, 33210, 33299, 33307, 33361, 33369, 33375, 33416, 33467, 33519, 33570, 33626, 33677, 33685, 33778, 33786, 33792, 33860, 33866, 33886, 33893, 33899, 34017, 34057, 34064, 34141, 34148, 34154, 34161, 34183, 34190, 34196, 34203, 34270, 34324, 34342, 34391, 34466, 34555, 34598, 34637, 34644, 34650, 34707, 34794, 34837, 34862, 34931, 34958, 35026, 35053, 35142, 35191, 35215, 35241, 35310, 35337, 35387, 35413, 35457, 35479, 35505, 35544, 35572, 35611, 35639, 35681, 35707, 35749, 35776, 35802, 35828, 35854, 35923, 35951, 36056, 36078, 36117, 36186, 36232, 36258, 36319, 36345, 36357, 36390, 36419, 36463, 36481, 36508, 36536, 36563, 36606, 36632, 36664, 36691, 36710, 36736, 36781, 36806, 36841, 36868, 36905, 36931, 36958, 36985, 37030, 37056, 37107, 37134, 37163, 37267, 37331, 37358, 37401, 37427, 37479, 37506, 37543, 37570, 37607, 37681, 37708, 37735, 37761, 37793, 37820, 37879, 37931, 37959, 37978, 38006, 38062, 38088, 38140, 38224, 38268, 38295, 38323, 38349, 38391, 38419, 38499, 38526, 38532, 38549, 38575, 38601, 38613, 38640, 38666, 38736, 38801, 38826, 38849, 38876, 38912, 38974, 39000, 39189, 39217, 39246, 39273, 39325, 39352, 39423, 39479, 39506, 39530, 39557, 39591, 39620, 39701, 39750, 39777, 39800, 39826, 39853, 39880, 39902, 39928, 39970, 39995, 40022, 40034, 40061, 40084, 40110, 40157, 40179, 40205, 40232, 40259, 40289, 40299, 40326, 40354, 40413, 40440, 40534, 40582, 40626, 40653, 40716, 40744, 40790, 40817, 40863, 40889, 40927, 41004, 41032, 41060, 41106, 41134, 41188, 41275, 41290, 41332, 41369, 41397, 41436, 41463, 41507, 41533, 41567, 41594, 41638, 41665, 41678, 41703, 41730, 41757, 41783, 41916, 41944, 41971, 41998, 42078, 42105, 42148, 42175, 42207, 42235, 42265, 42290, 42312, 42338, 42364, 42390, 42418, 42444, 42493, 42519, 42568, 42595, 42627, 42654, 42670, 42744, 42771, 42844, 42871, 42971, 42997, 43038, 43064, 43092 ], "line_end_idx": [ 34, 45, 83, 165, 170, 221, 226, 299, 372, 434, 439, 513, 519, 592, 662, 730, 798, 868, 938, 1004, 1011, 1015, 1041, 1064, 1088, 1113, 1140, 1165, 1190, 1214, 1218, 1243, 1269, 1295, 1323, 1361, 1385, 1422, 1459, 1463, 1499, 1503, 1532, 1570, 1608, 1645, 1660, 1697, 1734, 1738, 1783, 1787, 1822, 1871, 1875, 1975, 1998, 2017, 2056, 2084, 2136, 2195, 2254, 2323, 2379, 2435, 2485, 2533, 2583, 2635, 2640, 2675, 2691, 2759, 2765, 2825, 2887, 2893, 2897, 2941, 2985, 3028, 3044, 3087, 3130, 3134, 3184, 3265, 3315, 3367, 3424, 3470, 3534, 3538, 3562, 3566, 3637, 3719, 3723, 3808, 3878, 3963, 4054, 4142, 4147, 4164, 4262, 4362, 4394, 4400, 4405, 4411, 4417, 4422, 4428, 4505, 4511, 4516, 4532, 4538, 4578, 4607, 4656, 4663, 4726, 4749, 4756, 4832, 4837, 4879, 4886, 4962, 5017, 5024, 5031, 5038, 5085, 5092, 5168, 5219, 5226, 5233, 5240, 5247, 5254, 5260, 5265, 5271, 5296, 5303, 5329, 5346, 5353, 5379, 5400, 5439, 5444, 5475, 5501, 5526, 5531, 5557, 5562, 5591, 5596, 5647, 5654, 5718, 5723, 5787, 5794, 5897, 5904, 5911, 5916, 5933, 5981, 6057, 6133, 6138, 6178, 6216, 6231, 6265, 6270, 6285, 6298, 6303, 6381, 6386, 6514, 6519, 6567, 6574, 6579, 6691, 6698, 6774, 6781, 6788, 6793, 6854, 6932, 6937, 6956, 6987, 6994, 7072, 7079, 7084, 7102, 7138, 7145, 7221, 7228, 7233, 7257, 7262, 7285, 7310, 7315, 7344, 7349, 7397, 7421, 7428, 7454, 7501, 7559, 7608, 7615, 7715, 7742, 7749, 7836, 7843, 7893, 7900, 7927, 7939, 7946, 7953, 8001, 8008, 8105, 8112, 8119, 8126, 8133, 8159, 8216, 8223, 8269, 8276, 8300, 8307, 8337, 8372, 8404, 8434, 8465, 8505, 8512, 8518, 8523, 8529, 8557, 8599, 8604, 8631, 8681, 8686, 8714, 8721, 8745, 8752, 8777, 8798, 8825, 8830, 8873, 8880, 8904, 8911, 8928, 9005, 9028, 9079, 9086, 9113, 9146, 9153, 9181, 9232, 9239, 9266, 9299, 9306, 9316, 9323, 9351, 9385, 9392, 9399, 9411, 9416, 9440, 9468, 9502, 9514, 9519, 9542, 9569, 9602, 9614, 9619, 9645, 9682, 9711, 9723, 9728, 9755, 9829, 9854, 9866, 9873, 9878, 9951, 9958, 10014, 10021, 10026, 10062, 10112, 10119, 10129, 10136, 10156, 10183, 10190, 10197, 10202, 10233, 10246, 10251, 10321, 10326, 10357, 10434, 10439, 10464, 10493, 10498, 10562, 10580, 10587, 10625, 10664, 10704, 10711, 10716, 10738, 10745, 10806, 10878, 10904, 10965, 10984, 10996, 11001, 11062, 11081, 11093, 11098, 11129, 11148, 11170, 11184, 11216, 11223, 11307, 11401, 11432, 11493, 11500, 11512, 11519, 11524, 11562, 11600, 11605, 11633, 11679, 11711, 11751, 11756, 11775, 11803, 11833, 11839, 11844, 11926, 11932, 11951, 11957, 11962, 12040, 12046, 12065, 12071, 12076, 12082, 12152, 12157, 12178, 12185, 12246, 12317, 12324, 12387, 12415, 12422, 12434, 12439, 12500, 12507, 12545, 12559, 12593, 12606, 12613, 12659, 12666, 12671, 12678, 12690, 12707, 12737, 12767, 12774, 12837, 12860, 12927, 12934, 12946, 12951, 12965, 13036, 13099, 13111, 13118, 13124, 13129, 13179, 13248, 13254, 13292, 13306, 13340, 13416, 13492, 13497, 13520, 13537, 13579, 13586, 13661, 13691, 13747, 13754, 13799, 13861, 13866, 13897, 13927, 13932, 13963, 13970, 14044, 14051, 14080, 14118, 14149, 14156, 14173, 14251, 14258, 14287, 14323, 14354, 14361, 14368, 14373, 14390, 14428, 14465, 14504, 14548, 14553, 14585, 14592, 14648, 14655, 14682, 14759, 14849, 14896, 14911, 14918, 14965, 14972, 15044, 15065, 15072, 15126, 15133, 15140, 15147, 15171, 15214, 15221, 15267, 15274, 15332, 15337, 15377, 15384, 15459, 15480, 15487, 15544, 15551, 15620, 15654, 15661, 15668, 15713, 15720, 15784, 15789, 15829, 15836, 15911, 15932, 15939, 15996, 16003, 16072, 16106, 16113, 16120, 16137, 16184, 16191, 16228, 16233, 16278, 16357, 16364, 16429, 16436, 16462, 16469, 16593, 16614, 16621, 16668, 16708, 16784, 16813, 16886, 16893, 16929, 16951, 16989, 16996, 17073, 17080, 17116, 17138, 17145, 17152, 17159, 17166, 17213, 17220, 17257, 17262, 17338, 17377, 17422, 17506, 17513, 17595, 17602, 17628, 17635, 17758, 17779, 17786, 17836, 17876, 17951, 17980, 18067, 18140, 18147, 18183, 18205, 18243, 18250, 18330, 18337, 18373, 18395, 18402, 18409, 18416, 18423, 18433, 18440, 18481, 18486, 18569, 18620, 18637, 18644, 18698, 18721, 18743, 18748, 18821, 18861, 18868, 18943, 18964, 18971, 19028, 19035, 19082, 19130, 19166, 19173, 19178, 19223, 19284, 19291, 19298, 19305, 19315, 19322, 19355, 19433, 19469, 19476, 19536, 19557, 19564, 19601, 19608, 19615, 19620, 19644, 19687, 19694, 19699, 19716, 19745, 19781, 19826, 19890, 19958, 20020, 20056, 20063, 20125, 20170, 20175, 20238, 20261, 20312, 20317, 20357, 20364, 20399, 20406, 20413, 20423, 20430, 20456, 20511, 20556, 20561, 20581, 20588, 20631, 20702, 20734, 20741, 20746, 20864, 20899, 20906, 20912, 20917, 21013, 21019, 21046, 21064, 21134, 21196, 21243, 21249, 21254, 21270, 21275, 21281, 21308, 21338, 21365, 21394, 21427, 21460, 21494, 21526, 21555, 21595, 21637, 21644, 21649, 21655, 21660, 21699, 21705, 21724, 21746, 21765, 21786, 21811, 21836, 21862, 21886, 21907, 21939, 21972, 21979, 21984, 22047, 22053, 22076, 22081, 22144, 22171, 22221, 22226, 22254, 22281, 22286, 22333, 22361, 22401, 22423, 22430, 22447, 22477, 22507, 22540, 22562, 22567, 22628, 22659, 22690, 22720, 22761, 22773, 22778, 22792, 22809, 22814, 22847, 22854, 22894, 22901, 22911, 22918, 23025, 23032, 23044, 23051, 23056, 23087, 23153, 23158, 23233, 23277, 23284, 23365, 23439, 23446, 23463, 23468, 23501, 23533, 23540, 23586, 23671, 23753, 23799, 23876, 23958, 24006, 24083, 24165, 24186, 24193, 24198, 24269, 24313, 24392, 24397, 24435, 24442, 24486, 24493, 24603, 24724, 24731, 24757, 24762, 24794, 24801, 24877, 24962, 25118, 25194, 25271, 25427, 25505, 25582, 25738, 25760, 25767, 25793, 25837, 25844, 25958, 26079, 26086, 26112, 26144, 26151, 26231, 26316, 26472, 26552, 26629, 26785, 26867, 26944, 27100, 27122, 27129, 27136, 27141, 27167, 27172, 27203, 27219, 27226, 27251, 27291, 27301, 27412, 27417, 27467, 27474, 27531, 27541, 27570, 27577, 27584, 27589, 27608, 27614, 27619, 27633, 27639, 27683, 27729, 27734, 27760, 27830, 27835, 27952, 28101, 28140, 28162, 28167, 28195, 28200, 28241, 28247, 28252, 28258, 28287, 28357, 28362, 28392, 28460, 28509, 28563, 28568, 28612, 28656, 28661, 28682, 28689, 28750, 28782, 28794, 28799, 28860, 28867, 28872, 28935, 28942, 28983, 29023, 29030, 29042, 29049, 29056, 29061, 29137, 29142, 29173, 29180, 29218, 29232, 29239, 29273, 29280, 29336, 29343, 29379, 29445, 29475, 29482, 29541, 29548, 29618, 29623, 29645, 29650, 29716, 29746, 29766, 29771, 29843, 29850, 29901, 29906, 29976, 30062, 30069, 30098, 30153, 30160, 30217, 30224, 30294, 30299, 30321, 30326, 30393, 30423, 30444, 30450, 30529, 30537, 30589, 30595, 30666, 30751, 30759, 30789, 30845, 30853, 30871, 30919, 30927, 30991, 31023, 31119, 31143, 31151, 31230, 31276, 31284, 31381, 31416, 31448, 31515, 31546, 31554, 31562, 31570, 31618, 31626, 31690, 31722, 31818, 31842, 31850, 31932, 31977, 31985, 32082, 32131, 32163, 32230, 32261, 32269, 32277, 32285, 32314, 32322, 32361, 32445, 32497, 32515, 32523, 32594, 32600, 32623, 32629, 32696, 32730, 32762, 32768, 32825, 32864, 32872, 32924, 32930, 33001, 33086, 33094, 33124, 33180, 33188, 33196, 33204, 33210, 33299, 33307, 33361, 33369, 33375, 33416, 33467, 33519, 33570, 33626, 33677, 33685, 33778, 33786, 33792, 33860, 33866, 33886, 33893, 33899, 34017, 34057, 34064, 34141, 34148, 34154, 34161, 34183, 34190, 34196, 34203, 34270, 34324, 34342, 34391, 34466, 34555, 34598, 34637, 34644, 34650, 34707, 34794, 34837, 34862, 34931, 34958, 35026, 35053, 35142, 35191, 35215, 35241, 35310, 35337, 35387, 35413, 35457, 35479, 35505, 35544, 35572, 35611, 35639, 35681, 35707, 35749, 35776, 35802, 35828, 35854, 35923, 35951, 36056, 36078, 36117, 36186, 36232, 36258, 36319, 36345, 36357, 36390, 36419, 36463, 36481, 36508, 36536, 36563, 36606, 36632, 36664, 36691, 36710, 36736, 36781, 36806, 36841, 36868, 36905, 36931, 36958, 36985, 37030, 37056, 37107, 37134, 37163, 37267, 37331, 37358, 37401, 37427, 37479, 37506, 37543, 37570, 37607, 37681, 37708, 37735, 37761, 37793, 37820, 37879, 37931, 37959, 37978, 38006, 38062, 38088, 38140, 38224, 38268, 38295, 38323, 38349, 38391, 38419, 38499, 38526, 38532, 38549, 38575, 38601, 38613, 38640, 38666, 38736, 38801, 38826, 38849, 38876, 38912, 38974, 39000, 39189, 39217, 39246, 39273, 39325, 39352, 39423, 39479, 39506, 39530, 39557, 39591, 39620, 39701, 39750, 39777, 39800, 39826, 39853, 39880, 39902, 39928, 39970, 39995, 40022, 40034, 40061, 40084, 40110, 40157, 40179, 40205, 40232, 40259, 40289, 40299, 40326, 40354, 40413, 40440, 40534, 40582, 40626, 40653, 40716, 40744, 40790, 40817, 40863, 40889, 40927, 41004, 41032, 41060, 41106, 41134, 41188, 41275, 41290, 41332, 41369, 41397, 41436, 41463, 41507, 41533, 41567, 41594, 41638, 41665, 41678, 41703, 41730, 41757, 41783, 41916, 41944, 41971, 41998, 42078, 42105, 42148, 42175, 42207, 42235, 42265, 42290, 42312, 42338, 42364, 42390, 42418, 42444, 42493, 42519, 42568, 42595, 42627, 42654, 42670, 42744, 42771, 42844, 42871, 42971, 42997, 43038, 43064, 43092, 43117 ] }	{ "red_pajama_v2": { "ccnet_original_length": 43117, "ccnet_original_nlines": 1319, "rps_doc_curly_bracket": 0.006076490040868521, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.05308137089014053, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023832449689507484, "rps_doc_frac_lines_end_with_ellipsis": 0.0015151499537751079, "rps_doc_frac_no_alph_words": 0.5678863525390625, "rps_doc_frac_unique_words": 0.5264682769775391, "rps_doc_mean_word_length": 8.30550479888916, "rps_doc_num_sentences": 299, "rps_doc_symbol_to_word_ratio": 0.008786709979176521, "rps_doc_unigram_entropy": 6.845143795013428, "rps_doc_word_count": 3797, "rps_doc_frac_chars_dupe_10grams": 0.006785899866372347, "rps_doc_frac_chars_dupe_5grams": 0.059582699090242386, "rps_doc_frac_chars_dupe_6grams": 0.046867068856954575, "rps_doc_frac_chars_dupe_7grams": 0.015759769827127457, "rps_doc_frac_chars_dupe_8grams": 0.012239979580044746, "rps_doc_frac_chars_dupe_9grams": 0.012239979580044746, "rps_doc_frac_chars_top_2gram": 0.011542360298335552, "rps_doc_frac_chars_top_3gram": 0.011415529996156693, "rps_doc_frac_chars_top_4gram": 0.011605779640376568, "rps_doc_books_importance": -3273.64453125, "rps_doc_books_importance_length_correction": -3273.64453125, "rps_doc_openwebtext_importance": -1995.1629638671875, "rps_doc_openwebtext_importance_length_correction": -1995.1629638671875, "rps_doc_wikipedia_importance": -965.6089477539062, "rps_doc_wikipedia_importance_length_correction": -965.6089477539062 }, "fasttext": { "dclm": 0.9288501739501953, "english": 0.13367941975593567, "fineweb_edu_approx": 2.8053741455078125, "eai_general_math": 0.4892297387123108, "eai_open_web_math": 0.08145689964294434, "eai_web_code": 0.15905898809432983 } }	{ "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.01", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-1,545,341,905,483,465,500	Brightness while in docking stationSupport Last Updated: 1. houseofgrafx houseofgrafx Well-Known Member I picked up a docking station from a member on here and decided to use it next to my bed. I like the idea of the clock being displayed however, it's super bright. I hit the little icon that puts it in night mode but it's still too bright for my liking. Im one of those who cannot sleep unless the room is dark. Is there any option that would turn the screen off? I tried messing with it but to no avail.:confused: Thanks in advance. Advertisement 2. richs10 richs10 Active Member I had the same issue with the brightness of the stock dock mode. I downloaded Alarm Clock Pro app and the night mode is much dimmer (possibly too dim for some). You might want to check out the free version first. It appears that neither the stock app nor this app have a simple brightness control. Dumb, IMHO. One caveat: I've had intermitent issues with the second backup battery not charging after the phone's battery is fully charged. I'm still trying to figure out if the new app is the reason. Hope this helps Rich 3. Manderley Manderley New Member I kept my Charge in a dock all day and all night and got horrible screen burn. I had a chip on the case from a drop on the day of purchase and Verizon said that they didn't think it would be honered under warrenty because of the chip. I had to eat the cost of the phone when I switched to a Bionic. I'd be really carefully about keeping it in a dock with the screen turned on. 4. houseofgrafx houseofgrafx Well-Known Member That's why I'm trying to find a way to have the screen off when docking/charging at night. 5. treb1797 treb1797 Well-Known Member This post just doesn't make sense to me?? Just don't charge it in the station if you don't want the screen on. You are trying to defeat the whole point of the docking station?????:confused: 6. bowsback bowsback Well-Known Member if you hit the sleep/wake button in the dock then the screen goes off 7. richs10 richs10 Active Member If you are using the dock as a bedside alarm clock, the App that comes with the phone is bright, even in sleep mode. It uses a fairly bright, yellow font for the sleep mode time displayed on the screen. This stays on all night (so you can see what time it is in the middle of the night). I think that is what the OP is complaining about. And I agree with him or her. 8. mundee mundee New Member I also hated the light even in the sleep mode...still too bright. I found that if you ALSO dim the display brightness, then it is nearly black. Go to settings - display - brightness - slide it all the way to the left, the darkest. Then when in dock mode touch the sleep button. yay! 9. kevindroid kevindroid Well-Known Member gentle alarm has anti burnin settings can choose color and brightness. my phone has become a night stand alarm clock. stays on 24/7 i also use a live wallpaper for burn protection 10. stueycaster stueycaster Well-Known Member I use Desk Clock. It does nothing but a clock. It's very configurable as far as font, size and brightness and can be set to move the clock around the screen as burn protection. I like it a lot. 11. MaxBuck MaxBuck Well-Known Member I've used my dock for the past 15 months every night, with the phone as my alarm clock. Absolutely no evidence of any burn-in. Also, the screen dims after about a minute. I use AlarmDroid app. Share This Page	{ "url": "http://androidforums.com/threads/brightness-while-in-docking-station.425915/", "source_domain": "androidforums.com", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "70877", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UOXTZHFFMLS36HX343O4FHSWT56B5JYM", "WARC-Concurrent-To": "<urn:uuid:ede0c3c6-e4b4-486a-b088-4e73fa4feee3>", "WARC-Date": "2015-11-29T15:14:13Z", "WARC-IP-Address": "173.192.24.230", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:7JHWF2O53SILUXRR4VMR6AQ7ESIFFNX6", "WARC-Record-ID": "<urn:uuid:4224b3c6-a3fb-444f-80a2-62e3c1a4108e>", "WARC-Target-URI": "http://androidforums.com/threads/brightness-while-in-docking-station.425915/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4aecff39-4f21-476e-9953-f8d5237c0072>" }, "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, 43, 44, 45, 59, 60, 78, 79, 114, 115, 533, 556, 562, 563, 581, 594, 595, 621, 622, 936, 937, 1130, 1131, 1151, 1160, 1166, 1181, 1182, 1207, 1208, 1511, 1512, 1594, 1600, 1618, 1619, 1654, 1655, 1750, 1756, 1770, 1771, 1802, 1803, 1997, 2003, 2017, 2018, 2049, 2050, 2124, 2130, 2143, 2144, 2170, 2171, 2542, 2548, 2560, 2561, 2583, 2584, 2871, 2877, 2893, 2894, 2927, 2928, 3112, 3118, 3136, 3137, 3171, 3172, 3370, 3376, 3390, 3391, 3421, 3422, 3619, 3625, 3626 ], "line_end_idx": [ 43, 44, 45, 59, 60, 78, 79, 114, 115, 533, 556, 562, 563, 581, 594, 595, 621, 622, 936, 937, 1130, 1131, 1151, 1160, 1166, 1181, 1182, 1207, 1208, 1511, 1512, 1594, 1600, 1618, 1619, 1654, 1655, 1750, 1756, 1770, 1771, 1802, 1803, 1997, 2003, 2017, 2018, 2049, 2050, 2124, 2130, 2143, 2144, 2170, 2171, 2542, 2548, 2560, 2561, 2583, 2584, 2871, 2877, 2893, 2894, 2927, 2928, 3112, 3118, 3136, 3137, 3171, 3172, 3370, 3376, 3390, 3391, 3421, 3422, 3619, 3625, 3626, 3641 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3641, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4228723347187042, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03324468061327934, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1489361673593521, "rps_doc_frac_unique_words": 0.4361022412776947, "rps_doc_mean_word_length": 4.2715654373168945, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0.0013297899859026074, "rps_doc_unigram_entropy": 5.05998420715332, "rps_doc_word_count": 626, "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.02692594937980175, "rps_doc_frac_chars_top_3gram": 0.024682119488716125, "rps_doc_frac_chars_top_4gram": 0.029169779270887375, "rps_doc_books_importance": -262.225341796875, "rps_doc_books_importance_length_correction": -262.225341796875, "rps_doc_openwebtext_importance": -156.71920776367188, "rps_doc_openwebtext_importance_length_correction": -156.71920776367188, "rps_doc_wikipedia_importance": -81.04074096679688, "rps_doc_wikipedia_importance_length_correction": -81.04074096679688 }, "fasttext": { "dclm": 0.059190329164266586, "english": 0.9566272497177124, "fineweb_edu_approx": 0.9021434783935547, "eai_general_math": 0.02690177969634533, "eai_open_web_math": 0.1261804699897766, "eai_web_code": 0.00203300011344254 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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
-1,241,896,029,376,729,600	Compiling Bela projects in Eclipse » History » Version 13 « Previous - Version 13/36 (diff) - Next » - Current version Giulio Moro, 2015-07-15 10:03 PM Compiling BeagleRT projects in Eclipse This document contains information on how to compile the BeagleRT software and upload it onto the BeagleBone Black. Required tools This document assumes you have the following tools installed: On Linux • Working Linux system, either running natively or on a virtual machine • Mercurial version control system (http://mercurial.selenic.com). Available as a package in most Linux distributions. • arm-gcc hardfp compiler toolchain (i.e. arm-linux-gnueabihf-gcc and similar. On Ubuntu, these can be installed from packages: sudo apt-get install gcc-arm-linux-gnueabihf sudo apt-get install g++-arm-linux-gnueabihf • Eclipse IDE (http://www.eclipse.org), including the C/C++ development tools • Xenomai libraries compiled for ARM hardfp (details to come) ( you can probably do something similar to what described below for MacOS, make sure you use the appropriate paths, which might differ from the ones below) On a 64bit MacOS X You can get the arm cross-compiler toolchain from here http://www.welzels.de/blog/projekte/arm-cross-toolchain/, which will place the binaries into your /usr/local/linaro/arm-linux-gnueabihf/bin/ folder xenomai libraries and include files are already on the BBB's SD card. You can copy them over to your machine as follows: cd ~ ssh root@192.168.7.2 "cd /usr/; tar -zcvf ~/xenomai.tar.gz xenomai" rsync -avz --remove-source-files bbb:xenomai.tar.gz . cd /usr/local/linaro/arm-linux-gnueabihf/include/ sudo tar -xvf ~/xenomai.tar.gz sudo rm xenomai.tar.gz *Make sure that the following line is in your Eclipse project includes /usr/arm-linux-gnueabihf/include/xenomai/include and the following line is in your Eclipse projectlibraries search path /usr/local/linaro/arm-linux-gnueabihf/include/xenomai/lib/ Other operating systems Find your own way or use the VirtualBox image provided [ask for link]. Getting started 1. Clone the BeagleRT files from the repository: hg clone https://code.soundsoftware.ac.uk/hg/beaglert 2. Launch Eclipse and select a workspace (creating one if necessary). 3. In the Eclipse menu bar, choose File -> Import.... Within the dialog box that appears, choose General -> Existing Projects into Workspace. Click Next. 4. Click the button Select root directory and choose the path to the BeagleRT repository you just cloned. 5. Make sure the BeagleRT project is selected, and under Options, untick Copy projects into workspace. Click Finish to complete the project import. Compiling the BeagleRT project 1. In Eclipse, right-click on the BeagleRT project folder in the left-hand column, and choose Build Project. (If you don't see the list of projects, make sure the C/C++ Perspective is active in Eclipse, and choose Window -> Show View -> Project Explorer.) 2. The project should compile without errors, and the results should be visible in the Console tab (typically in the bottom pane of the window) 3. If any errors arise, check that you have all the dependencies installed, both header files and libraries. Copying BeagleRT projects to the BeagleBone Black 1. Once the project has compiled, open a terminal window and cd to the directory where the binary was compiled. For example, if you installed BeagleRT in your home directory: cd ~/BeagleRT/Release 2. Copy the BeagleRT executable to the BeagleBone Black using scp (entering your BeagleBone Black password when prompted; you may need to create the beaglert directory first): scp BeagleRT root@192.168.7.2:~/beaglert/ 3. The first time you install BeagleRT, you also need to copy the pru_rtaudio.bin file to the BeagleBone Black. This can be found at the top level of the BeagleRT repository, and it should be copied to the same directory on the BeagleBone where the BeagleRT executable is located: scp pru_rtaudio.bin root@192.168.7.2:~/beaglert/ Selecting different BeagleRT examples within the Eclipse project The Eclipse project contains several examples within the projects directory. Follow these steps to choose which one to compile: 1. Only one of the folders within projects should be enabled at a time. This one will be in solid black text; the remainder will be grey. 2. Right-click on the folder which is currently enabled (solid black). Choose Resource Configurations -> Exclude from Build... 3. Click Select All to disable the code in this folder. Click OK. 4. Now right-click on the folder which you want to enable. Choose Resource Configurations -> Exclude from Build... 5. Click Deselect All to enable the code in this folder. Click OK. Creating a new executable within the BeagleRT project Duplicate one of the existing project folders using the following steps: 1. Right-click the project folder you want to duplicate and select Copy. 2. Right-click on the projects folder and select Paste. It will ask you to type in a new name. 3. Follow the steps above (Resource Configurations) to enable compiling this new project rather than any of the others.	{ "url": "https://code.soundsoftware.ac.uk/projects/beaglert/wiki/_Compiling_Bela_projects_in_Eclipse/13", "source_domain": "code.soundsoftware.ac.uk", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "13520", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HOYFHYJZ6X7LXG5JDYFHIEUSBRYL36VX", "WARC-Concurrent-To": "<urn:uuid:60019a91-c0a0-42dc-9410-f56df72bd9a5>", "WARC-Date": "2023-11-30T03:36:54Z", "WARC-IP-Address": "138.37.95.184", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:42SOSBSPTKD6KIAPPGGXZYRZKZJSQCAL", "WARC-Record-ID": "<urn:uuid:34a7b67c-54db-4a3c-8e69-6f22db16e446>", "WARC-Target-URI": "https://code.soundsoftware.ac.uk/projects/beaglert/wiki/_Compiling_Bela_projects_in_Eclipse/13", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e790e1b8-b78b-433d-979d-dfe7f440440b>" }, "warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-169\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, 58, 59, 120, 153, 154, 155, 194, 195, 311, 312, 327, 328, 390, 391, 400, 474, 595, 725, 774, 823, 828, 908, 1128, 1129, 1148, 1149, 1353, 1475, 1476, 1481, 1550, 1604, 1655, 1686, 1709, 1710, 1781, 1782, 1831, 1832, 1903, 1962, 1963, 1987, 2058, 2059, 2075, 2076, 2127, 2185, 2190, 2262, 2418, 2526, 2676, 2677, 2708, 2709, 2967, 3113, 3224, 3225, 3275, 3276, 3475, 3653, 3699, 3704, 3987, 4040, 4045, 4046, 4111, 4112, 4240, 4241, 4381, 4510, 4578, 4695, 4764, 4765, 4819, 4820, 4893, 4894, 4969, 5066 ], "line_end_idx": [ 58, 59, 120, 153, 154, 155, 194, 195, 311, 312, 327, 328, 390, 391, 400, 474, 595, 725, 774, 823, 828, 908, 1128, 1129, 1148, 1149, 1353, 1475, 1476, 1481, 1550, 1604, 1655, 1686, 1709, 1710, 1781, 1782, 1831, 1832, 1903, 1962, 1963, 1987, 2058, 2059, 2075, 2076, 2127, 2185, 2190, 2262, 2418, 2526, 2676, 2677, 2708, 2709, 2967, 3113, 3224, 3225, 3275, 3276, 3475, 3653, 3699, 3704, 3987, 4040, 4045, 4046, 4111, 4112, 4240, 4241, 4381, 4510, 4578, 4695, 4764, 4765, 4819, 4820, 4893, 4894, 4969, 5066, 5187 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5187, "ccnet_original_nlines": 88, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2837465703487396, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011019280180335045, "rps_doc_frac_lines_end_with_ellipsis": 0.02247191034257412, "rps_doc_frac_no_alph_words": 0.26629936695098877, "rps_doc_frac_unique_words": 0.4107382595539093, "rps_doc_mean_word_length": 5.408053874969482, "rps_doc_num_sentences": 83, "rps_doc_symbol_to_word_ratio": 0.002754820045083761, "rps_doc_unigram_entropy": 5.148252487182617, "rps_doc_word_count": 745, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06304293870925903, "rps_doc_frac_chars_dupe_6grams": 0.0501365102827549, "rps_doc_frac_chars_dupe_7grams": 0.02829485945403576, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.030032269656658173, "rps_doc_frac_chars_top_3gram": 0.01787043921649456, "rps_doc_frac_chars_top_4gram": 0.014892029576003551, "rps_doc_books_importance": -516.9039916992188, "rps_doc_books_importance_length_correction": -516.9039916992188, "rps_doc_openwebtext_importance": -297.60076904296875, "rps_doc_openwebtext_importance_length_correction": -297.60076904296875, "rps_doc_wikipedia_importance": -144.7962188720703, "rps_doc_wikipedia_importance_length_correction": -144.7962188720703 }, "fasttext": { "dclm": 0.021107379347085953, "english": 0.7825517654418945, "fineweb_edu_approx": 2.1049201488494873, "eai_general_math": 0.7031040191650391, "eai_open_web_math": 0.25227290391921997, "eai_web_code": 0.10672420263290405 } }	{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
6,659,259,465,612,060,000	simple:Substitution-permutation network b) substitution. Cite this entry as: Bauer F.L. In cryptography, an SP-network, or substitution-permutation network ( SPN ), is a series of linked mathematical operations used in block cipher algorithms such as AES (Rijndael) . The key is introduced in each round, usually in the form of "round keys" derived from it. A good P-box has the property that the output bits of any S-box are distributed to as many S-box inputs as possible. Also SP ciphers require S-boxes to be invertible (to perform decryption); Feistel inner functions have no such restriction and can be constructed as one-way functions. Cryptography and Network Security - MA61027 (Sourav Mukhopadhyay, IIT-KGP, 2010) 16 In: van Tilborg H.C.A. For a given amount of confusion and diffusion, an SP network has more "inherent parallelism"[1] Decryption is done by simply reversing the process (using the inverses of the S-boxes and P-boxes and applying the round keys in reversed order). An S-box substitutes a small block of bits (the input of the S-box) by another block of bits (the output of the S-box). Base 16, 32, and 64; URL Encoding (Percent-Encoding) The wonders of hex, decimal, octal and ASCII; Types of Ciphers - Symmetric (Single Key) Substitution. sv:Substitutions-permutationskrypto The number of rounds are specified by the algorithm design. In cryptography, an SP-network, or substitution-permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES.. As the name implies, a substitution operation involves replacing one thing with something else. Rather, a good S-box will have the property that changing one input bit will change about half of the output bits (or an avalanche effect). A good P-box has the property that the output bits of any S-box are distributed to as many S-box inputs as possible. Such a network takes a block of the plaintext and the key as inputs, and applies several alternating "rounds" or "layers" of substitution boxes (S-boxes) and permutation boxes (P-boxes) to produce the ciphertext block. The development of public-key cryptography is the greatest and perhaps the only true revolution in the entire history of cryptography. Cite this entry as: Bauer F.L. The algorithms like DES use predetermined substitution and permutation boxes and others like Blowfish block cipher , Khufu algorithm , and Twofish utilize the dynamic substitution and permutation boxes. The initial and final permutations are shown as … 3. Both Substitution cipher technique and Transposition cipher technique are the types of Traditional cipher which are used to convert the plain text into cipher text.. a) Kerckhkoffs’s Principle. It comprises of a series of linked operations, some of which involve replacing inputs by specific outputs (substitutions) and others involve shuffling bits around (permutations) as shown in Figure A. ... the key to a transposition cipher is a permutation function. Symmetric cryptography relies on shared secret key to ensure message confidentiality, so that the unauthorized attackers cannot retrieve the message. b) substitution. Keywords – Cryptography, Azrael, Symmetrical character-level encryption algorithm, ICT, Substitution-permutation network, Student-centred methodologies. Any additional processing − Initial and final permutation; Initial and Final Permutation. The S-boxes and P-boxes transform (sub-)blocks of input bits into output bits. Substitution ciphers In general: Substitution ciphers are maps from one alphabet to another. "Principles and Performance of Cryptographic Algorithms", https://cryptography.fandom.com/wiki/Substitution-permutation_network?oldid=4528. It is common for these transformations to be operations that are efficient to perform in hardware, such as exclusive or (XOR) and bitwise rotation. variable From its earliest begin- nings to modern times, virtually all cryptographic systems have been based on the elementary tools of substitution and permutation. To cite this article: Arboledas-Brihuega, D. (2019). CPUs with few execution units — such as most smart cards — cannot take advantage of this inherent parallelism. 1 … A single typical S-box or a single P-box alone does not have much cryptographic strength: an S-box could be thought of as a substitution cipher, while a P-box could be thought of as a transposition cipher. b) Polyalphabetic Substitution . Permutation operation is required to remove any regular patterns those may appear in the cipher text (i.e. ... What's the difference between substitution and permutation in DES? This substitution should be one-to-one, to ensure invertibility (hence decryption). (2005) Substitutions and permutations. Permutations can be described by several simple and easy to understand notations. d) division _____ has the following properties. 2. It is similar to Columnar Transposition in some ways, in that the columns are written in the same way, including how the keyword is used. In particular, the length of the output should be the same as the length of the input (the picture on the right has S-boxes with 4 input and 4 output bits), which is different from S-boxes in general that could also change the length, as in DES (Data Encryption Standard), for example. Morse; Letter Numbers; Caesarian Shift; ROT13; Baconian; Polyalphabetic Substitution Ciphers. Cryptography and Network Security - MA61027 (Sourav Mukhopadhyay, IIT-KGP, 2010) 16 The Permutation Cipher is another form of Transposition Cipher. Crypto Wiki is a FANDOM Lifestyle Community. A P-box is a permutation of all the bits: it takes the outputs of all the S-boxes of one round, permutes the bits, and feeds them into the S-boxes of the next round. Keys '' derived from it into a ciphertext block of 16 bits letters ( the lengths the! The entire history of cryptography harder since have more alphabets to guess ; and because flattens frequency.... ’ s, the S-boxes themselves depend on the elementary tools of substitution and )... Output bits and cryptographers proposed using multiple Cipher alphabets, a process to! — can not take advantage of this inherent parallelism the last iteration of... Each output bit will depend on every input bit key is introduced in round! Another symbol ( or group of symbols ) with another symbol ( or group of symbols.! Mukhopadhyay, IIT-KGP, 2010 ) 16 a ) permutation as many S-box inputs as possible of 64 bits is! Will also have the property that the output bytes are fed into next... The art and science of concealing meaning ; polyalphabetic substitution ciphers in:... Transform ( sub- ) blocks of letters ( the lengths of the plaintext and.! Bits into a ciphertext block of 16 bits into output bits one symbol ( or of. Permutation Cipher is another form of `` round keys '' derived from it [ 2 ] CPUs with few units! Derived from it generally involves replacing one symbol ( or group of symbols )... What 's the difference substitution. Network Security - MA61027 ( Sourav Mukhopadhyay, IIT-KGP, 2010 ) 16 )! All just a permutation of the same function ( substitution and permutation steps form a round! ; polyalphabetic substitution ciphers are maps from one alphabet to another of the keyword ), rather the! My understanding substitution is replacing the data with new data and permutation ) shared secret key to message! Of a substitution-permutation step onto a different subkey: How to implement cryptography in section,! With 3 rounds, encrypting a plaintext block of 16 bits into ciphertext! 3 rounds, encrypting a plaintext block of 16 bits into output.... Is required to remove any regular patterns those may appear in the form of Cipher. Comes from two Greek words meaning “ secret writing ” and is art! Produce the preoutput to a Transposition Cipher have been based on 'substitution—permutation network ' is introduced in each,! Substitution and permutation ) art and science of concealing meaning permutation boxes ( P-boxes ) that are of!, and the round keys '' derived from it de Vigene ` re ’ s new and... S-Box is usually not simply a permutation function as: Bauer F.L polygram substitution:! D. ( 2019 ) ’ s, the permutation Cipher acts on blocks of input into. Systems have been based on 'substitution—permutation network ' Sourav Mukhopadhyay, IIT-KGP, )! Of cryptography produce the preoutput on blocks of letters ( the lengths of the same P, and the keys! At all just a permutation function cryptographic Algorithms '', https: //cryptography.fandom.com/wiki/Substitution-permutation_network?.... Arboledas-Brihuega, D. ( 2019 ) with dynamical properties using logistic chaos map and Standard map using multiple Cipher,... Ciphers in general: substitution ciphers in general substitution and permutation in cryptography substitution ciphers in general: substitution ciphers maps! In some designs, the permutation Cipher is a permutation function one-to-one, to ensure invertibility ( hence decryption.! Of cryptography is the greatest and perhaps the only true revolution in the entire history of cryptography virtually cryptographic! Smart cards — can not retrieve the message form of Transposition Cipher is a permutation.... Each other few execution units — such as most smart cards — can not take advantage this... Proposed using multiple Cipher alphabets, a process referred to as polyalphabetic substitution whole ciphertext symmetric relies! Substitution should be one-to-one, to ensure invertibility ( hence decryption ) a permutation of same! Permutation steps form a ‘ round ’ nition a simple substitution Cipher is function... Substitution ciphers in general: substitution ciphers in general: substitution ciphers general! Difference between substitution and permutation ) themselves depend on every input bit Cipher the! As polyalphabetic substitution is a permutation of the last iteration consists of bits! Flattens frequency distribution of 64 bits which is a function of the plaintext and key )! Symmetric cryptography relies on shared secret key to ensure invertibility ( hence ). The S-boxes themselves depend on the substitution and permutation in cryptography. ) '', https:?. Symbols ) with another symbol ( or group of symbols ) alphabets to ;! To remove any regular patterns those may appear in the form of Transposition Cipher few units! Form a ‘ round ’ substitution and permutation in cryptography cryptography to ensure invertibility ( hence decryption ) permutation! Which applies a substitution-permutation step onto a different subkey tools of substitution and permutation process referred to many. Multiple Cipher alphabets, a process referred to as many S-box inputs possible! The whole ciphertext to Cite this entry as: Bauer F.L properties using logistic substitution and permutation in cryptography map Standard. Sophisticated and cryptographers proposed using multiple Cipher alphabets, a process referred to as polyalphabetic substitution 16 of! Is the greatest and perhaps the only true revolution in the entire history of cryptography 16 of... The difference between substitution and permutation permutations can be described by several simple easy. Science of concealing meaning ) IDEA & mldr ; Above substitution substitution and permutation in cryptography permutation ) to..., 2010 ) 16 a ) permutation is a function of the plaintext and key..... The elementary tools of substitution and permutation in DES each round, applies... The organization of this paper is chaos based cryptography in section 2, block. Themselves depend on every input bit key. ) nings to modern times virtually. That the unauthorized attackers can not take advantage of this inherent parallelism D.! Alphabets to guess ; and because flattens frequency distribution, D. ( 2019 ) 16 bits ensure message,! Of `` round keys are the same function ( substitution and permutation steps form a ‘ round ’ IDEA mldr. Is required to remove any regular patterns those may appear in the Cipher text ( i.e as Bauer... Halves are swapped to produce the preoutput and right halves are swapped produce... The message Vigene ` re ’ s, the permutation Cipher is any from! Permutations can be described by several simple and easy to understand notations, https //cryptography.fandom.com/wiki/Substitution-permutation_network! How to implement cryptography in section 2, serpent block cryptography... the key..... Cryptography became more sophisticated and cryptographers proposed using multiple Cipher alphabets, a process referred to as many inputs. That the output of the plaintext and key. ) ‘ round ’ your! ” and is the greatest and perhaps the only true revolution in the form Transposition! Nings to modern times, virtually all cryptographic systems have been based 'substitution—permutation... The round keys '' derived from it, the S-boxes themselves depend every. Of 16 bits into a ciphertext block of 16 bits into a block... The lengths of the last iteration consists of 64 bits which is a function of the and... //Cryptography.Fandom.Com/Wiki/Substitution-Permutation_Network? oldid=4528 round, which applies a substitution-permutation network with 3 rounds, encrypting a plaintext block 16. 16 a ) permutation all just a permutation function permutation steps form ‘. 16 a ) permutation Sourav Mukhopadhyay, IIT-KGP, 2010 ) 16 a ) permutation execution —. Relies on shared secret key to a Transposition Cipher is based on 'substitution—permutation network ' on of... Writing ” and is the greatest and perhaps the only true revolution in the of. Https: //cryptography.fandom.com/wiki/Substitution-permutation_network? oldid=4528 of substitution and permutation S-box is usually not simply a permutation function ensure. A different subkey just rearranging the data with new data and permutation in DES became. Substitution should be one-to-one, to ensure invertibility ( hence decryption ) each! Sketch of a substitution-permutation step onto a different subkey on every input.. Encryption Standard ( AES ) is based on the key to ensure message confidentiality, so that output... Have been based on 'substitution—permutation network ' AES ) is based on network... From my understanding substitution is replacing the data with new data and permutation steps form ‘., serpent block cryptography more sophisticated and cryptographers proposed using multiple Cipher,! Makes cryptanalysis harder since have more alphabets to guess ; and because flattens frequency distribution with dynamical using! Re ’ s a simple substitution Cipher: the permutation Cipher acts on blocks of input into... Understand notations, which applies a substitution-permutation network with 3 rounds, encrypting plaintext! Than the whole ciphertext and right halves are swapped to produce the preoutput Cipher text ( i.e ). Straight permutation boxes ( P-boxes ) that are inverses of each other input bit S-box inputs as possible function... … the permutation Cipher acts on blocks of letters ( the lengths of the same P and...: substitution ciphers of a substitution-permutation network with 3 rounds, encrypting plaintext. And science of concealing meaning is another form of `` round keys are the same size IDEA & ;! May appear in the form of Transposition Cipher is any function from alphabet! Another of the same function ( substitution and permutation in DES are maps from one alphabet to another of bits! Take advantage of this inherent parallelism s, the S-boxes are the same function ( substitution and permutation ) left. Standard ( AES ) is based on 'substitution—permutation network ' P, and the keys...	{ "url": "https://jimerson.myhomepayge.com/kalimataan-hadith-kqac/substitution-and-permutation-in-cryptography-302f44", "source_domain": "jimerson.myhomepayge.com", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "28103", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JXDDYSIQIYMD4ZOQCXJHPU36X66THNB4", "WARC-Concurrent-To": "<urn:uuid:9193fce8-ade6-4da3-9a20-2c6f88433701>", "WARC-Date": "2021-07-29T23:58:05Z", "WARC-IP-Address": "69.16.210.207", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6JITAQL57JJOJ5YDCOP4NBYC2OQLHLFE", "WARC-Record-ID": "<urn:uuid:7e218689-b486-4516-bf17-39d8f23ecf28>", "WARC-Target-URI": "https://jimerson.myhomepayge.com/kalimataan-hadith-kqac/substitution-and-permutation-in-cryptography-302f44", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a8ccf0c0-74f8-4fd0-8278-af5d6780b37d>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-157.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 ], "line_end_idx": [ 15548 ] }	{ "red_pajama_v2": { "ccnet_original_length": 15548, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3329935371875763, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03499830141663551, "rps_doc_frac_lines_end_with_ellipsis": 1, "rps_doc_frac_no_alph_words": 0.21372748911380768, "rps_doc_frac_unique_words": 0.192967027425766, "rps_doc_mean_word_length": 5.484395503997803, "rps_doc_num_sentences": 181, "rps_doc_symbol_to_word_ratio": 0.012232420034706593, "rps_doc_unigram_entropy": 5.234708786010742, "rps_doc_word_count": 2275, "rps_doc_frac_chars_dupe_10grams": 0.17985093593597412, "rps_doc_frac_chars_dupe_5grams": 0.5532580018043518, "rps_doc_frac_chars_dupe_6grams": 0.47856053709983826, "rps_doc_frac_chars_dupe_7grams": 0.37925782799720764, "rps_doc_frac_chars_dupe_8grams": 0.32499799132347107, "rps_doc_frac_chars_dupe_9grams": 0.2563115954399109, "rps_doc_frac_chars_top_2gram": 0.025807490572333336, "rps_doc_frac_chars_top_3gram": 0.03959285095334053, "rps_doc_frac_chars_top_4gram": 0.01795303076505661, "rps_doc_books_importance": -1648.926025390625, "rps_doc_books_importance_length_correction": -1648.926025390625, "rps_doc_openwebtext_importance": -955.498046875, "rps_doc_openwebtext_importance_length_correction": -955.498046875, "rps_doc_wikipedia_importance": -725.1486206054688, "rps_doc_wikipedia_importance_length_correction": -725.1486206054688 }, "fasttext": { "dclm": 0.20341366529464722, "english": 0.8587900400161743, "fineweb_edu_approx": 2.7661774158477783, "eai_general_math": 0.9903021454811096, "eai_open_web_math": 0.8355581164360046, "eai_web_code": 0.7836139798164368 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.019", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
2,291,318,708,134,087,000	Tech News How to Install and Configure Two-node Solaris Cluster 4.1 This guide will help you to quickly and easily install and configure Oracle Solaris Cluster software for two nodes, including the creation of Single Root I/O Virtualization/InfiniBand (SR-IOV/IB) devices. It provides a step-by-step procedure to simplify the process. This articles uses the interactive scinstall utility to configure all the nodes of a cluster quickly and easily. The interactive scinstall utility is menu driven. The menus help reduce the chance of mistakes and promote best practices by using default values and prompting you for information specific to your cluster. The utility also helps prevent mistakes by identifying invalid entries. Finally, the scinstall utility eliminates the need to manually set up a quorum device by automating the configuration of a quorum device for your new cluster. Note: This article applies to the Oracle Solaris Cluster 4.1 release. Overview of SR-IOV SR-IOV is a PCI-SIG standards-based I/O virtualization specification. SR-IOV enables a PCIe function known as physical function (PF) to create multiple lightweight PCIe functions known as virtual functions (VFs). VFs show up like a regular PCIe functions and also operate like regular PCIe functions. The address space for a VF is well contained so that a VF can be assigned to a virtual machine (a logical domain or LDom) with the help of a hypervisor. SR-IOV provides a high degree of sharing compared to other forms of direct hardware access methods that are available in LDom technology, that is, PCIe bus assignment and direct I/O. Prerequisites, Assumptions, and Defaults This section discusses several prerequisites, assumptions, and defaults for two-node clusters. Configuration Assumptions This article assumes the following configuration is used: • You are installing the two-node cluster on Oracle Solaris 11.1 and you have basic system administration skills. • You are installing the Oracle Solaris Cluster 4.1 software. • The cluster hardware is a supported configuration for Oracle Solaris Cluster 4.1 software. • This is a two-node cluster for SPARC T4-4 servers from Oracle. SR-IOV is only supported on servers based on Oracle's SPARC T4 (or above) processors. • Each cluster node is an I/O domain. • Each node has two spare network interfaces to be used as private interconnects, also known as transports, and at least one network interface that is connected to the public network. • iSCSI shared storage is connected to the two nodes. • Your setup looks like Figure 1. You might have fewer or more devices, depending on your system or network configuration. In addition, it is recommended that you have console access to the nodes during cluster installation, but this is not required. Figure 1. Oracle Solaris Cluster Hardware Configuration Prerequisites Perform the following prerequisite tasks: 1. Ensure that Oracle Solaris 11.1 SRU13 is installed on both the SPARC T4-4 systems. 2. Perform the initial preparation of public IP addresses and logical host names. You must have the logical names (host names) and IP addresses of the nodes to configure a cluster. Add those entries to each node's /etc/inet/hosts file or to a naming service if such a service (for example, DNS, NIS, or NIS+ maps) is used. The example in this article uses a NIS service. Table 1 lists the configuration used in this example. 1. Table 1. Configuration 2. Component Name Interface IP Address cluster phys-schost node 1 phys-schost-1 igbvf0 1.2.3.4 node 2 phys-schost-2 igbvf0 1.2.3.5 3. Create SR-IOV VF devices for the public, private, and storage networks. You have to create the VF devices on the corresponding adapters for public, private, and storage networks in the primary domain and assign the VF devices to the logical domains that will be configured as cluster nodes. Type the commands shown in Listing 1 on the control domain phys-primary-1: root@phys-primary-1# ldm ls-io\|grep IB /SYS/PCI-EM0/IOVIB.PF0 PF pci_0 primary /SYS/PCI-EM1/IOVIB.PF0 PF pci_0 primary /SYS/PCI-EM0/IOVIB.PF0.VF0 VF pci_0 primary root@phys-primary-1# ldm start-reconf primary root@phys-primary-1# ldm create-vf /SYS/MB/NET2/IOVNET.PF0 root@phys-primary1# ldm create-vf /SYS/PCI-EM0/IOVIB.PF0 root@phys-primary-1# ldm create-vf /SYS/PCI-EM1/IOVIB.PF0 root@phys-primary-1# ldm add-domain domain1 root@phys-primary-1# ldm add-vcpu 128 domain1 root@phys-primary-1# ldm add-mem 128g domain1 root@phys-primary-1# ldm add-io /SYS/MB/NET2/IOVNET.PF0.VF1 domain1 root@phys-primary-1# ldm add-io /SYS/PCI-EM0/IOVIB.PF0.VF1 domain1 root@phys-primary-1# ldm add-io /SYS/PCI-EM1/IOVIB.PF0.VF1 domain1 root@phys-primary-1# ldm ls-io \| grep domain1 /SYS/MB/NET2/IOVNET.PF0.VF1 VF pci_0 domain1 /SYS/PCI-EM0/IOVIB.PF0.VF1 VF pci_0 domain1 /SYS/PCI-EM0/IOVIB.PF0.VF2 VF pci_0 domain1 Listing 1 The VF IOVNET.PF0.VF1 is used for the public network. IB VF devices have partitions that host both private network and storage network devices. Repeat the commands shown in Listing 1 on phys-primary-2. The I/O domain domain1 on both nodes must be installed with Oracle Solaris 11.1 SRU13 before installing the cluster software. Defaults The scinstall interactive utility in the Typical mode installs the Oracle Solaris Cluster software with the following defaults: • Private-network address 172.16.0.0 • Private-network netmask 255.255.248.0 • Cluster-transport switches switch1 and switch2 Perform the Pre-installation Checks 1. Temporarily enable rsh or ssh access for root on the cluster nodes. 2. Log in to the cluster node on which you are installing Oracle Solaris Cluster software and become superuser. 3. On each node, verify the /etc/inet/hosts file entries. If no other name resolution service is available, add the name and IP address of the other node to this file. The /etc/inet/hosts file on node 1 has the following information. # Internet host table ::1 phys-schost-1 localhost 127.0.0.1 phys-schost-1 localhost loghost The /etc/inet/hosts file on node 2 has the following information. # Internet host table ::1 phys-schost-2 localhost 127.0.0.1 phys-schost-2 localhost loghost On each node, verify that at least one shared storage disk is available. In this example, the following disks are shared between the two nodes: c0t600A0B800026FD7C000019B149CCCFAEd0 and c0t600A0B800026FD7C000019D549D0A500d0. # format Searching for disks...done AVAILABLE DISK SELECTIONS: 0. c4t0d0 /pci@7b,0/pci1022,7458@11/pci1000,3060@2/sd@0,0 /dev/chassis/SYS/HD0/disk 1. c4t1d0 /pci@7b,0/pci1022,7458@11/pci1000,3060@2/sd@1,0 /dev/chassis/SYS/HD1/disk 2. c0t600144F0CD152C9E000051F2AFE20007d0 /scsi_vhci/ssd@g600144f0cd152c9e000051f2afe20007 3. c0t600144F0CD152C9E000051F2AFF00008d0 /scsi_vhci/ssd@g600144f0cd152c9e000051f2aff00008 On each node, ensure that the right OS version is installed. # more /etc/release Oracle Solaris 11.1 SPARC Copyright (c) 1983, 2013, Oracle and/or its affiliates. All rights reserved. Assembled 06 November 2013 Ensure that the network interfaces are configured as static IP addresses (not DHCP or of type addrconf, as displayed by the ipadm show-addr -o all command.) If the network interfaces are not configured as static IP addresses, then run the command shown in Listing 2 on each node, which will unconfigure all network interfaces and services. # netadm enable -p ncp defaultfixed Enabling ncp 'DefaultFixed' phys-schost-1: Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net0 has been removed from kernel. in.ndpd will no longer use it Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net1 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net2 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net3 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net4 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net5 has been removed from kernel . in.ndpd will no longer use it Listing 2 On each node, type the following commands to configure the naming services and update the name service switch configuration: # svccfg -s svc:/network/nis/domain setprop config/domainname = hostname: nisdomain.example.com # svccfg -s svc:/network/nis/domain:default refresh # svcadm enable svc:/network/nis/domain:default # svcadm enable svc:/network/nis/client:default # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/host = astring: \"files nis\" # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/netmask = astring: \"files nis\" # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/automount = astring: \"files nis\" # /usr/sbin/svcadm refresh svc:/system/name-service/switch Bind each node to the NIS server. # ypinit -c Reboot each node to make sure that the new network setup is working fine. Configure the Oracle Solaris Cluster Publisher There are two main ways to access the Oracle Solaris Cluster package repository, depending on whether the cluster nodes have direct access (or through a web proxy) to the internet: using a repository hosted on pkg.oracle.com or using a local copy of the repository. Using a Repository Hosted on pkg.oracle.com To access either the Oracle Cluster Solaris Release or Support repositories, obtain the SSL public and private keys. 1. Go to http://pkg-register.oracle.com. 2. Choose the Oracle Solaris Cluster Release or Support repository. 3. Accept the license. 4. Request a new certificate by choosing the Oracle Solaris Cluster software and submitting a request. This displays a certification page that contains download buttons for download the key and certificate files. 5. Download the key and certificate files and install them, as described in the returned certification page. 6. Configure the ha-cluster publisher with the downloaded SSL keys to point to the selected repository URL on pkg.oracle.com. This example uses the release repository: # pkg set-publisher \ -k /var/pkg/ssl/Oracle_Solaris_Cluster_4.key.pem \ -c /var/pkg/ssl/Oracle_Solaris_Cluster_4.certificate.pem \ -g https://pkg.oracle.com/ha-cluster/release/ ha-cluster Using a Local Copy of the Repository To access a local copy of the Oracle Solaris Cluster Release or Support repository, download the repository image. 1. Download the repository image from the Oracle Technology Network or Oracle Software Delivery Cloud. To download the repository image from Oracle Software Delivery Cloud, select Oracle Solaris as the Product Pack on the Media Pack Search Page. 2. Mount the repository image and copy the data to a shared file system that all the cluster nodes can access. # mount -F hsfs /mnt # rsync -aP /mnt/repo /export # share /export/repo 3. Configure the ha-cluster publisher. This example uses node 1 as the system that shared the local copy of the repository: # pkg set-publisher -g file:///net/phys-schost-1/export/repo ha-cluster Install the Oracle Solaris Cluster Software Packages 1. On each node, ensure that the correct Oracle Solaris package repositories are published. If they are not, unset the incorrect publishers and set the correct ones. The installation of the ha-cluster packages is highly likely to fail if it cannot access the solaris publisher. # pkg publisher PUBLISHER TYPE STATUS URI solaris origin online ha-cluster origin online 2. On each cluster node, install the ha-cluster-full package group. # pkg install ha-cluster-full Packages to install: 68 Create boot environment: No Create backup boot environment: Yes Services to change: 1 DOWNLOAD PKGS FILES XFER (MB) Completed 68/68 6456/6456 48.5/48.5$<3> PHASE ACTIONS Install Phase 8928/8928 PHASE ITEMS Package State Update Phase 68/68 Image State Update Phase 2/2 Loading smf(5) service descriptions: 9/9 Loading smf(5) service descriptions: 57/57 Configure the Oracle Solaris Cluster Software 1. On each node of the cluster, identify the network interfaces that will be used for the private interconnects. In this example, 8513 and 8514 are the PKEYs for a private IB partition that is used for transport. 8503 is the PKEY for a private storage network that is used to configure iSCSI storage from an Oracle ZFS Storage Appliance with an IB connection. The Oracle ZFS Storage Appliance has the IP address 192.168.0.61 configured on the InfiniBand network. The priv1 and priv2 IB partitions are used as private interconnects for the private network. The storage1 and storage2 partitions are used for the storage network. Type the following commands on node 1: phys-schost-1# dladm show-ib \|grep net net6 21290001EF8BA2 14050000000001 1 up localhost 0a-eth-1 8031,8501,8511,8513,8521,FFFF net7 21290001EF8BA2 14050000000008 2 up localhost 0a-eth-1 8503,8514,FFFF phys-schost-1# dladm create-part -l net6 -P 8513 priv1 phys-schost-1# dladm create-part -l net7 -P 8514 priv2 phys-schost-1# dladm create-part -l net6 -P 8503 storage1 phys-schost-1# dladm create-part -l net7 -P 8503 storage2 phys-schost-1# dladm show-part LINK PKEY OVER STATE FLAGS priv1 8513 net6 up ---- priv2 8514 net7 up ---- storage1 8503 net6 up ---- storage2 8503 net7 up ---- phys-schost-1# ipadm create-ip storage1 phys-schost-1# ipadm create-ip storage2 phys-schost-1# ipadm create-ipmp -i storage1 -i storage2 storage_ipmp0 phys-schost-1# ipadm create-addr -T static -a 192.168.0.41/24 storage_ipmp0/address1 phys-schost-1# iscsiadm add static-config iqn.1986-03.com.sun:02:a87851cb-4bad-c0e5-8d27-dd76834e6985,192.168.10.61 Type the following commands on node 2: phys-schost-2# dladm show-ib \|grep net net9 21290001EF8FFE 1405000000002B 2 up localhost 0a-eth-1 8032,8502,8512,8516,8522,FFFF net6 21290001EF4E36 14050000000016 1 up localhost 0a-eth-1 8031,8501,8511,8513,8521,FFFF net7 21290001EF4E36 1405000000000F 2 up localhost 0a-eth-1 8503,8514,FFFF net8 21290001EF8FFE 14050000000032 1 up localhost 0a-eth-1 8503,8515,FFFF phys-schost-2# dladm create-part -l net6 -P 8513 priv1 phys-schost-2# dladm create-part -l net7 -P 8514 priv2 phys-schost-2# dladm create-part -l net6 -P 8503 storage1 phys-schost-2# dladm create-part -l net7 -P 8503 storage2 phys-schost-2# dladm show-part LINK PKEY OVER STATE FLAGS priv1 8513 net6 up ---- priv2 8514 net7 up ---- storage1 8503 net6 up ---- storage2 8503 net7 up ---- phys-schost-2# ipadm create-ip storage1 phys-schost-2# ipadm create-ip storage2 phys-schost-2# ipadm create-ipmp -i storage1 -i storage2 storage_ipmp0 phys-schost-2# ipadm create-addr -T static -a 192.168.0.42/24 storage_ipmp0/address1 phys-schost-2# iscsiadm add static-config iqn.1986-03.com.sun:02:a87851cb-4bad-c0e5-8d27-dd76834e6985,192.168.10.61 2. On each node, ensure that the Oracle Solaris Service Management Facility services are not in the maintenance state. # svcs -x 3. On each node, ensure that the service network/rpc/bind:default has the local_only configuration set to false. # svcprop network/rpc/bind:default \| grep local_only config/local_only boolean false If not, set the local_only configuration to false. # svccfg svc:> select network/rpc/bind svc:/network/rpc/bind> setprop config/local_only=false svc:/network/rpc/bind> quit # svcadm refresh network/rpc/bind:default # svcprop network/rpc/bind:default \| grep local_only config/local_only boolean false 4. From one of the nodes, start the Oracle Solaris Cluster configuration. This will configure the software on the other node as well. In this example, the following command is run on the node 2, phys-schost-2. # /usr/cluster/bin/scinstall * Main Menu * Please select from one of the following () options: 1) Create a new cluster or add a cluster node * 2) Print release information for this cluster node * ?) Help with menu options * q) Quit Option: 1 From the Main menu, type 1 to choose the first menu item, which can be used to create a new cluster or add a cluster node. * Create a New Cluster * This option creates and configures a new cluster. Press Control-D at any time to return to the Main Menu. Do you want to continue (yes/no) [yes]? Checking the value of property "local_only" of service svc:/network/rpc/bind ... Property "local_only" of service svc:/network/rpc/bind is already correctly set to "false" on this node. Press Enter to continue: Answer yes and then press Enter to go to the installation mode selection. Then select the default mode: Typical. >>> Typical or Custom Mode <<< This tool supports two modes of operation, Typical mode and Custom mode. For most clusters, you can use Typical mode. However, you might need to select the Custom mode option if not all of the Typical mode defaults can be applied to your cluster. For more information about the differences between Typical and Custom modes, select the Help option from the menu. Please select from one of the following options: 1) Typical 2) Custom ?) Help q) Return to the Main Menu Option [1]: 1 Provide the name of the cluster. In this example, type the cluster name as phys-schost. >>> Cluster Name <<< Each cluster has a name assigned to it. The name can be made up of any characters other than whitespace. Each cluster name should be unique within the namespace of your enterprise. What is the name of the cluster you want to establish? phys-schost Provide the name of the other node. In this example, the name of the other node is phys-schost-1. Finish the list by pressing ^D. Answer yes to confirm the list of nodes. >>> Cluster Nodes <<< This Oracle Solaris Cluster release supports a total of up to 16 nodes. List the names of the other nodes planned for the initial cluster configuration. List one node name per line. When finished, type Control-D: Node name (Control-D to finish): phys-schost-1 Node name (Control-D to finish): ^D This is the complete list of nodes: phys-schost-2 phys-schost-1 Is it correct (yes/no) [yes]? The next two screens configure the cluster's private interconnects, also known as the transport adapters. Select the priv1 and priv2 IB partitions. >>> Cluster Transport Adapters and Cables <<< Transport adapters are the adapters that attach to the private cluster interconnect. Select the first cluster transport adapter: 1) net1 2) net2 3) net3 4) net4 5) net5 6) priv1 7) priv2 8) Other Option: 6 Adapter "priv1" is an Infiniband adapter. Searching for any unexpected network traffic on "priv1" ... done Verification completed. No traffic was detected over a 10 second sample period. The "dlpi" transport type will be set for this cluster. For node "phys-schost-2", Name of the switch to which "priv1" is connected [switch1]? Each adapter is cabled to a particular port on a switch. And, each port is assigned a name. You can explicitly assign a name to each port. Or, for Ethernet and Infiniband switches, you can choose to allow scinstall to assign a default name for you. The default port name assignment sets the name to the node number of the node hosting the transport adapter at the other end of the cable. For node "phys-schost-2", Use the default port name for the "priv1" connection (yes/no) [yes]? Select the second cluster transport adapter: 1) net1 2) net2 3) net3 4) net4 5) net5 6) priv1 7) priv2 8) Other Option: 7 Adapter "priv2" is an Infiniband adapter. Searching for any unexpected network traffic on "priv2" ... done Verification completed. No traffic was detected over a 10 second sample period. The "dlpi" transport type will be set for this cluster. For node "phys-schost-2", Name of the switch to which "priv2" is connected [switch2]? For node "phys-schost-2", Use the default port name for the "priv2" connection (yes/no) [yes]? The next screen configures the quorum device. Select the default answers for the questions asked in the Quorum Configuration screen. >>> Quorum Configuration <<< Every two-node cluster requires at least one quorum device. By default, scinstall selects and configures a shared disk quorum device for you. This screen allows you to disable the automatic selection and configuration of a quorum device. You have chosen to turn on the global fencing. If your shared storage devices do not support SCSI, such as Serial Advanced Technology Attachment (SATA) disks, or if your shared disks do not support SCSI-2, you must disable this feature. If you disable automatic quorum device selection now, or if you intend to use a quorum device that is not a shared disk, you must instead use clsetup(1M) to manually configure quorum once both nodes have joined the cluster for the first time. Do you want to disable automatic quorum device selection (yes/no) [no]? Is it okay to create the new cluster (yes/no) [yes]? During the cluster creation process, cluster check is run on each of the new cluster nodes. If cluster check detects problems, you can either interrupt the process or check the log files after the cluster has been established. Interrupt cluster creation for cluster check errors (yes/no) [no]? The final screens print details about the configuration of the nodes and the installation log's file name. The utility then reboots each node in cluster mode. Cluster Creation Log file - /var/cluster/logs/install/scinstall.log.3386 Configuring global device using lofi on phys-schost-1: done Starting discovery of the cluster transport configuration. The following connections were discovered: phys-schost-2:priv1 switch1 phys-schost-1:priv1 phys-schost-2:priv2 switch2 phys-schost-1:priv2 Completed discovery of the cluster transport configuration. Started cluster check on "phys-schost-2". Started cluster check on "phys-schost-1". ... ... ... Refer to the log file for details. The name of the log file is /var/cluster/logs/install/scinstall.log.3386. Configuring "phys-schost-1" ... done Rebooting "phys-schost-1" ... Configuring "phys-schost-2" ... Rebooting "phys-schost-2" ... Log file - /var/cluster/logs/install/scinstall.log.3386 When the scinstall utility finishes, the installation and configuration of the basic Oracle Solaris Cluster software is complete. The cluster is now ready for you to configure the components you will use to support highly available applications. These cluster components can include device groups, cluster file systems, highly available local file systems, and individual data services and zone clusters. To configure these components, refer to the Oracle Solaris Cluster 4.1 documentation library. 5. Verify on each node that multiuser services for the Oracle Solaris Service Management Facility (SMF) are online. Ensure that the new services added by Oracle Solaris Cluster are all online. # svcs -x # svcs multi-user-server STATE STIME FMRI online 9:58:44 svc:/milestone/multi-user-server:default 6. From one of the nodes, verify that both nodes have joined the cluster. # cluster status === Cluster Nodes === --- Node Status --- Node Name Status --------- ------ phys-schost-1 Online phys-schost-2 Online === Cluster Transport Paths === Endpoint1 Endpoint2 Status --------- --------- ------ phys-schost-1:priv1 phys-schost-2:priv1 Path online phys-schost-1:priv2 phys-schost-2:priv2 Path online === Cluster Quorum === --- Quorum Votes Summary from (latest node reconfiguration) --- Needed Present Possible ------ ------- -------- 2 3 3 --- Quorum Votes by Node (current status) --- Node Name Present Possible Status --------- ------- -------- ------ phys-schost-1 1 1 Online phys-schost-2 1 1 Online --- Quorum Votes by Device (current status) --- Device Name Present Possible Status ----------- ----- ------- ----- d1 1 1 Online === Cluster Device Groups === --- Device Group Status --- Device Group Name Primary Secondary Status ----------------- ------- ------- ------ --- Spare, Inactive, and In Transition Nodes --- Device Group Name Spare Nodes Inactive Nodes In Transition Nodes ----------------- --------- -------------- -------------------- --- Multi-owner Device Group Status --- Device Group Name Node Name Status ----------------- ------- ------ === Cluster Resource Groups === Group Name Node Name Suspended State ---------- --------- --------- ----- === Cluster Resources === Resource Name Node Name State Status Message ------------- --------- ----- -------------- === Cluster DID Devices === Device Instance Node Status --------------- --- ------ /dev/did/rdsk/d1 phys-schost-1 Ok phys-schost-2 Ok /dev/did/rdsk/d2 phys-schost-1 Ok phys-schost-2 Ok /dev/did/rdsk/d3 phys-schost-1 Ok /dev/did/rdsk/d4 phys-schost-1 Ok /dev/did/rdsk/d5 phys-schost-2 Ok /dev/did/rdsk/d6 phys-schost-2 Ok === Zone Clusters === --- Zone Cluster Status --- Name Node Name Zone HostName Status Zone Status ---- --------- ------------- ------ ---------- Verify High Availability (Optional) This section describes how to create a failover resource group with a LogicalHostname resource for a highly available network resource and an HAStoragePlus resource for a highly available ZFS file system on a zpool resource. 1. Identify the network address that will be used for this purpose and add it to the /etc/inet/hosts file on the nodes. In this example, the host name is schost-lh. The /etc/inet/hosts file on node 1 contains the following information: # Internet host table # ::1 localhost 127.0.0.1 localhost loghost 1.2.3.4 phys-schost-1 # Cluster Node 1.2.3.5 phys-schost-2 # Cluster Node 1.2.3.6 schost-lh The /etc/inet/hosts file on node 2 contains the following information: # Internet host table # ::1 localhost 127.0.0.1 localhost loghost 1.2.3.4 phys-schost-1 # Cluster Node 1.2.3.5 phys-schost-2 # Cluster Node 1.2.3.6 schost-lh schost-lh will be used as the logical host name for the resource group in this example. This resource is of the type SUNW.LogicalHostname, which is a preregistered resource type. 2. From one of the nodes, create a zpool with the two shared storage disks /dev/did/rdsk/d1s0 and /dev/did/rdsk/d2s0. In this example, the entire disk is assigned to slice 0 of the disks, using the format utility. # zpool create -m /zfs1 pool1 mirror /dev/did/dsk/d1s0 /dev/did/dsk/d2s0 # df -k /zfs1 Filesystem 1024-blocks Used Available Capacity Mounted on pool1 20514816 31 20514722 1% /zfs1 The created zpool will now be placed in a highly available resource group as a resource of type SUNW.HAStoragePlus. This resource type has to be registered before it is used for the first time. 3. To create a highly available resource group to house the resources, on one node, type the following command: # /usr/cluster/bin/clrg create test-rg 4. Add the network resource to the test-rg group. # /usr/cluster/bin/clrslh create -g test-rg -h schost-lh schost-lhres 5. Register the storage resource type. # /usr/cluster/bin/clrt register SUNW.HAStoragePlus 6. Add the zpool to the group. # /usr/cluster/bin/clrs create -g test-rg -t SUNW.HAStoragePlus -p zpools=pool1 hasp-res 7. Bring the group online: # /usr/cluster/bin/clrg online -eM test-rg 8. Check the status of the group and the resources: # /usr/cluster/bin/clrg status === Cluster Resource Groups === Group Name Node Name Suspended Status ---------- --------- --------- ------ test-rg phys-schost-1 No Online phys-schost-2 No Offline # /usr/cluster/bin/clrs status === Cluster Resources === Resource Name Node Name State Status Message ------------- ------- ----- -------------- hasp-res phys-schost-1 Online Online phys-schost-2 Offline Offline schost-lhres phys-schost-1 Online Online - LogicalHostname online. phys-schost-2 Offline Offline The command output shows that the resources and the group are online on node 1. 9. To verify availability, switch over the resource group to node 2 and check the status of the resources and the group. # /usr/cluster/bin/clrg switch -n phys-schost-2 test-rg # /usr/cluster/bin/clrg status === Cluster Resource Groups === Group Name Node Name Suspended Status ---------- --------- --------- ------ test-rg phys-schost-1 No Offline phys-schost-2 No Online # /usr/cluster/bin/clrs status === Cluster Resources === Resource Name Node Name State Status Message ------------- --------- ----- -------------- hasp-res phys-schost-1 Offline Offline phys-schost-2 Online Online schost-lhres phys-schost-1 Offline Offline - LogicalHostname offline. phys-schost-2 Online Online - LogicalHostname online. No comments Comments with links will not be published.	{ "url": "https://www.techsupportpk.com/2014/12/How-to-Install-and-Configure-a-Two-Node-Cluster-for-Oracle-Solaris-Cluster-4.1-Using-SR-IOV-IB-Interfaces.html", "source_domain": "www.techsupportpk.com", "snapshot_id": "crawl=CC-MAIN-2019-39", "warc_metadata": { "Content-Length": "399337", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M3JQ3CKFBTPI5D4PIYFANU2LH6FITEG3", "WARC-Concurrent-To": "<urn:uuid:9647cb35-3deb-4e40-aacf-0efd2a073526>", "WARC-Date": "2019-09-21T08:59:15Z", "WARC-IP-Address": "172.217.13.83", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:7ZTJZBIORX25EJDEBBD4HYPSTK5XGOEN", "WARC-Record-ID": "<urn:uuid:c23d56f9-fcd9-484e-a0cb-64646d170fed>", "WARC-Target-URI": "https://www.techsupportpk.com/2014/12/How-to-Install-and-Configure-a-Two-Node-Cluster-for-Oracle-Solaris-Cluster-4.1-Using-SR-IOV-IB-Interfaces.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:df9e66a1-dde0-4127-8d98-4f5ac13c92a0>" }, "warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 10, 11, 69, 70, 71, 338, 339, 340, 341, 891, 892, 962, 963, 964, 983, 984, 1621, 1622, 1623, 1664, 1665, 1760, 1761, 1762, 1788, 1789, 1847, 1848, 1964, 2028, 2123, 2276, 2316, 2502, 2558, 2683, 2684, 2812, 2813, 2869, 2870, 2871, 2885, 2886, 2928, 2929, 3015, 3097, 3098, 3388, 3389, 3443, 3471, 3512, 3536, 3576, 3616, 3617, 3692, 3693, 3913, 3914, 3989, 3990, 4029, 4095, 4161, 4227, 4273, 4332, 4389, 4447, 4491, 4537, 4583, 4651, 4718, 4785, 4831, 4893, 4955, 5017, 5018, 5028, 5029, 5173, 5174, 5358, 5359, 5368, 5369, 5497, 5498, 5537, 5579, 5630, 5631, 5667, 5668, 5741, 5855, 6026, 6027, 6094, 6095, 6117, 6145, 6188, 6189, 6190, 6257, 6258, 6280, 6308, 6350, 6351, 6424, 6425, 6577, 6586, 6613, 6640, 6657, 6715, 6751, 6768, 6826, 6862, 6910, 6969, 7017, 7082, 7143, 7144, 7164, 7165, 7238, 7317, 7389, 7390, 7547, 7548, 7732, 7733, 7769, 7797, 7894, 7933, 8022, 8054, 8143, 8175, 8264, 8296, 8385, 8417, 8506, 8538, 8539, 8549, 8674, 8675, 8771, 8823, 8871, 8919, 9018, 9120, 9224, 9283, 9317, 9318, 9330, 9404, 9451, 9452, 9718, 9719, 9763, 9764, 9881, 9882, 9925, 9995, 10020, 10235, 10346, 10474, 10475, 10522, 10523, 10546, 10598, 10658, 10716, 10717, 10754, 10755, 10870, 10871, 11119, 11232, 11233, 11259, 11293, 11318, 11323, 11364, 11365, 11454, 11531, 11536, 11537, 11590, 11591, 11685, 11686, 11876, 11896, 11941, 11983, 12025, 12030, 12100, 12101, 12135, 12140, 12180, 12220, 12260, 12300, 12305, 12381, 12461, 12466, 12523, 12581, 12586, 12643, 12701, 12759, 12804, 12851, 12856, 12857, 12903, 12904, 13019, 13020, 13271, 13542, 13585, 13628, 13737, 13831, 13890, 13949, 14011, 14073, 14108, 14160, 14211, 14262, 14313, 14364, 14408, 14452, 14527, 14616, 14736, 14741, 14742, 14785, 14828, 14937, 15046, 15140, 15234, 15293, 15352, 15414, 15476, 15511, 15563, 15614, 15665, 15716, 15767, 15811, 15855, 15930, 16019, 16139, 16144, 16265, 16266, 16280, 16285, 16400, 16401, 16458, 16494, 16499, 16500, 16555, 16568, 16602, 16661, 16693, 16739, 16796, 16832, 16837, 16973, 16974, 17054, 17087, 17111, 17116, 17177, 17182, 17240, 17303, 17341, 17361, 17366, 17385, 17390, 17391, 17518, 17551, 17556, 17561, 17619, 17683, 17688, 17693, 17743, 17748, 17833, 17842, 17927, 17960, 17969, 18000, 18005, 18006, 18123, 18160, 18165, 18241, 18320, 18398, 18447, 18452, 18531, 18584, 18641, 18646, 18669, 18691, 18696, 18716, 18755, 18760, 18783, 18788, 18789, 18881, 18906, 18911, 18990, 19068, 19117, 19122, 19198, 19203, 19204, 19379, 19405, 19410, 19484, 19499, 19504, 19579, 19652, 19671, 19676, 19732, 19775, 19780, 19788, 19793, 19798, 19842, 19847, 19873, 19899, 19904, 19944, 19949, 19950, 20102, 20152, 20157, 20236, 20258, 20263, 20315, 20320, 20340, 20360, 20380, 20400, 20420, 20441, 20462, 20483, 20488, 20507, 20512, 20562, 20567, 20640, 20714, 20737, 20742, 20806, 20811, 20842, 20912, 20917, 20993, 21068, 21143, 21219, 21297, 21358, 21363, 21394, 21473, 21478, 21531, 21536, 21556, 21576, 21596, 21616, 21636, 21657, 21678, 21699, 21704, 21723, 21728, 21778, 21783, 21856, 21930, 21953, 21958, 22022, 22027, 22058, 22128, 22133, 22164, 22242, 22247, 22248, 22385, 22418, 22423, 22495, 22574, 22591, 22596, 22667, 22709, 22714, 22793, 22866, 22939, 22986, 22991, 23070, 23149, 23227, 23267, 23272, 23354, 23359, 23420, 23503, 23567, 23646, 23676, 23681, 23758, 23763, 23764, 23927, 23948, 23953, 24017, 24022, 24090, 24095, 24162, 24167, 24218, 24223, 24285, 24347, 24352, 24420, 24425, 24479, 24529, 24534, 24542, 24550, 24558, 24563, 24602, 24680, 24685, 24690, 24735, 24774, 24815, 24854, 24859, 24919, 24924, 24925, 25428, 25623, 25624, 25638, 25667, 25700, 25769, 25774, 25850, 25851, 25872, 25898, 25922, 25927, 25980, 26033, 26086, 26139, 26144, 26149, 26185, 26261, 26337, 26418, 26499, 26504, 26531, 26599, 26642, 26685, 26721, 26726, 26776, 26781, 26833, 26885, 26937, 26989, 26994, 26999, 27051, 27056, 27109, 27161, 27214, 27219, 27224, 27258, 27263, 27295, 27300, 27359, 27418, 27423, 27428, 27481, 27556, 27632, 27637, 27681, 27737, 27793, 27798, 27803, 27839, 27893, 27947, 27952, 27982, 27987, 28054, 28121, 28126, 28158, 28230, 28302, 28372, 28442, 28512, 28582, 28652, 28722, 28792, 28862, 28897, 28923, 28928, 28960, 28965, 29029, 29093, 29098, 29099, 29135, 29136, 29361, 29362, 29529, 29530, 29605, 29631, 29637, 29655, 29687, 29730, 29773, 29797, 29802, 29803, 29878, 29904, 29910, 29929, 29962, 30005, 30048, 30072, 30077, 30078, 30261, 30477, 30478, 30555, 30573, 30655, 30736, 30741, 30742, 30940, 31054, 31055, 31098, 31103, 31155, 31156, 31230, 31235, 31276, 31277, 31333, 31338, 31371, 31372, 31466, 31471, 31500, 31501, 31548, 31553, 31607, 31608, 31643, 31648, 31684, 31689, 31750, 31811, 31872, 31934, 31939, 31944, 31949, 31984, 31989, 32019, 32024, 32096, 32168, 32232, 32297, 32302, 32392, 32457, 32462, 32467, 32468, 32552, 32675, 32676, 32736, 32771, 32776, 32812, 32817, 32882, 32947, 33013, 33078, 33100, 33135, 33140, 33170, 33175, 33250, 33326, 33394, 33461, 33466, 33561, 33654, 33659, 33660, 33672, 33673 ], "line_end_idx": [ 10, 11, 69, 70, 71, 338, 339, 340, 341, 891, 892, 962, 963, 964, 983, 984, 1621, 1622, 1623, 1664, 1665, 1760, 1761, 1762, 1788, 1789, 1847, 1848, 1964, 2028, 2123, 2276, 2316, 2502, 2558, 2683, 2684, 2812, 2813, 2869, 2870, 2871, 2885, 2886, 2928, 2929, 3015, 3097, 3098, 3388, 3389, 3443, 3471, 3512, 3536, 3576, 3616, 3617, 3692, 3693, 3913, 3914, 3989, 3990, 4029, 4095, 4161, 4227, 4273, 4332, 4389, 4447, 4491, 4537, 4583, 4651, 4718, 4785, 4831, 4893, 4955, 5017, 5018, 5028, 5029, 5173, 5174, 5358, 5359, 5368, 5369, 5497, 5498, 5537, 5579, 5630, 5631, 5667, 5668, 5741, 5855, 6026, 6027, 6094, 6095, 6117, 6145, 6188, 6189, 6190, 6257, 6258, 6280, 6308, 6350, 6351, 6424, 6425, 6577, 6586, 6613, 6640, 6657, 6715, 6751, 6768, 6826, 6862, 6910, 6969, 7017, 7082, 7143, 7144, 7164, 7165, 7238, 7317, 7389, 7390, 7547, 7548, 7732, 7733, 7769, 7797, 7894, 7933, 8022, 8054, 8143, 8175, 8264, 8296, 8385, 8417, 8506, 8538, 8539, 8549, 8674, 8675, 8771, 8823, 8871, 8919, 9018, 9120, 9224, 9283, 9317, 9318, 9330, 9404, 9451, 9452, 9718, 9719, 9763, 9764, 9881, 9882, 9925, 9995, 10020, 10235, 10346, 10474, 10475, 10522, 10523, 10546, 10598, 10658, 10716, 10717, 10754, 10755, 10870, 10871, 11119, 11232, 11233, 11259, 11293, 11318, 11323, 11364, 11365, 11454, 11531, 11536, 11537, 11590, 11591, 11685, 11686, 11876, 11896, 11941, 11983, 12025, 12030, 12100, 12101, 12135, 12140, 12180, 12220, 12260, 12300, 12305, 12381, 12461, 12466, 12523, 12581, 12586, 12643, 12701, 12759, 12804, 12851, 12856, 12857, 12903, 12904, 13019, 13020, 13271, 13542, 13585, 13628, 13737, 13831, 13890, 13949, 14011, 14073, 14108, 14160, 14211, 14262, 14313, 14364, 14408, 14452, 14527, 14616, 14736, 14741, 14742, 14785, 14828, 14937, 15046, 15140, 15234, 15293, 15352, 15414, 15476, 15511, 15563, 15614, 15665, 15716, 15767, 15811, 15855, 15930, 16019, 16139, 16144, 16265, 16266, 16280, 16285, 16400, 16401, 16458, 16494, 16499, 16500, 16555, 16568, 16602, 16661, 16693, 16739, 16796, 16832, 16837, 16973, 16974, 17054, 17087, 17111, 17116, 17177, 17182, 17240, 17303, 17341, 17361, 17366, 17385, 17390, 17391, 17518, 17551, 17556, 17561, 17619, 17683, 17688, 17693, 17743, 17748, 17833, 17842, 17927, 17960, 17969, 18000, 18005, 18006, 18123, 18160, 18165, 18241, 18320, 18398, 18447, 18452, 18531, 18584, 18641, 18646, 18669, 18691, 18696, 18716, 18755, 18760, 18783, 18788, 18789, 18881, 18906, 18911, 18990, 19068, 19117, 19122, 19198, 19203, 19204, 19379, 19405, 19410, 19484, 19499, 19504, 19579, 19652, 19671, 19676, 19732, 19775, 19780, 19788, 19793, 19798, 19842, 19847, 19873, 19899, 19904, 19944, 19949, 19950, 20102, 20152, 20157, 20236, 20258, 20263, 20315, 20320, 20340, 20360, 20380, 20400, 20420, 20441, 20462, 20483, 20488, 20507, 20512, 20562, 20567, 20640, 20714, 20737, 20742, 20806, 20811, 20842, 20912, 20917, 20993, 21068, 21143, 21219, 21297, 21358, 21363, 21394, 21473, 21478, 21531, 21536, 21556, 21576, 21596, 21616, 21636, 21657, 21678, 21699, 21704, 21723, 21728, 21778, 21783, 21856, 21930, 21953, 21958, 22022, 22027, 22058, 22128, 22133, 22164, 22242, 22247, 22248, 22385, 22418, 22423, 22495, 22574, 22591, 22596, 22667, 22709, 22714, 22793, 22866, 22939, 22986, 22991, 23070, 23149, 23227, 23267, 23272, 23354, 23359, 23420, 23503, 23567, 23646, 23676, 23681, 23758, 23763, 23764, 23927, 23948, 23953, 24017, 24022, 24090, 24095, 24162, 24167, 24218, 24223, 24285, 24347, 24352, 24420, 24425, 24479, 24529, 24534, 24542, 24550, 24558, 24563, 24602, 24680, 24685, 24690, 24735, 24774, 24815, 24854, 24859, 24919, 24924, 24925, 25428, 25623, 25624, 25638, 25667, 25700, 25769, 25774, 25850, 25851, 25872, 25898, 25922, 25927, 25980, 26033, 26086, 26139, 26144, 26149, 26185, 26261, 26337, 26418, 26499, 26504, 26531, 26599, 26642, 26685, 26721, 26726, 26776, 26781, 26833, 26885, 26937, 26989, 26994, 26999, 27051, 27056, 27109, 27161, 27214, 27219, 27224, 27258, 27263, 27295, 27300, 27359, 27418, 27423, 27428, 27481, 27556, 27632, 27637, 27681, 27737, 27793, 27798, 27803, 27839, 27893, 27947, 27952, 27982, 27987, 28054, 28121, 28126, 28158, 28230, 28302, 28372, 28442, 28512, 28582, 28652, 28722, 28792, 28862, 28897, 28923, 28928, 28960, 28965, 29029, 29093, 29098, 29099, 29135, 29136, 29361, 29362, 29529, 29530, 29605, 29631, 29637, 29655, 29687, 29730, 29773, 29797, 29802, 29803, 29878, 29904, 29910, 29929, 29962, 30005, 30048, 30072, 30077, 30078, 30261, 30477, 30478, 30555, 30573, 30655, 30736, 30741, 30742, 30940, 31054, 31055, 31098, 31103, 31155, 31156, 31230, 31235, 31276, 31277, 31333, 31338, 31371, 31372, 31466, 31471, 31500, 31501, 31548, 31553, 31607, 31608, 31643, 31648, 31684, 31689, 31750, 31811, 31872, 31934, 31939, 31944, 31949, 31984, 31989, 32019, 32024, 32096, 32168, 32232, 32297, 32302, 32392, 32457, 32462, 32467, 32468, 32552, 32675, 32676, 32736, 32771, 32776, 32812, 32817, 32882, 32947, 33013, 33078, 33100, 33135, 33140, 33170, 33175, 33250, 33326, 33394, 33461, 33466, 33561, 33654, 33659, 33660, 33672, 33673, 33715 ] }	{ "red_pajama_v2": { "ccnet_original_length": 33715, "ccnet_original_nlines": 740, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20806528627872467, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.034677550196647644, "rps_doc_frac_lines_end_with_ellipsis": 0.009446689859032631, "rps_doc_frac_no_alph_words": 0.3346932530403137, "rps_doc_frac_unique_words": 0.2197008728981018, "rps_doc_mean_word_length": 5.61423397064209, "rps_doc_num_sentences": 362, "rps_doc_symbol_to_word_ratio": 0.014906640164554119, "rps_doc_unigram_entropy": 5.791860103607178, "rps_doc_word_count": 3878, "rps_doc_frac_chars_dupe_10grams": 0.09695939719676971, "rps_doc_frac_chars_dupe_5grams": 0.2597372829914093, "rps_doc_frac_chars_dupe_6grams": 0.19814440608024597, "rps_doc_frac_chars_dupe_7grams": 0.14651845395565033, "rps_doc_frac_chars_dupe_8grams": 0.11354032903909683, "rps_doc_frac_chars_dupe_9grams": 0.10499724000692368, "rps_doc_frac_chars_top_2gram": 0.007578540127724409, "rps_doc_frac_chars_top_3gram": 0.01745361089706421, "rps_doc_frac_chars_top_4gram": 0.012676830403506756, "rps_doc_books_importance": -3439.005859375, "rps_doc_books_importance_length_correction": -3439.005859375, "rps_doc_openwebtext_importance": -1640.2860107421875, "rps_doc_openwebtext_importance_length_correction": -1640.2860107421875, "rps_doc_wikipedia_importance": -1193.4075927734375, "rps_doc_wikipedia_importance_length_correction": -1193.4075927734375 }, "fasttext": { "dclm": 0.06533288955688477, "english": 0.7413849830627441, "fineweb_edu_approx": 1.950696349143982, "eai_general_math": 0.16767138242721558, "eai_open_web_math": 0.21888452768325806, "eai_web_code": 0.8610791563987732 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "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": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
1,952,969,137,066,923,800	problem in creating new blog. • Author Posts • #1137108 hafeezrm Member I have successfuly uploaded a few blogs on wordpress.com Now I try to add another, the computer takes me to some other site. Is this virus. If so how to remove it. The blog I need help with is hafeezrmdotcom.wordpress.com. #1137324 timethief Member I’m sorry but you have not provided enough information for us to answer your question. Will you please expand and be very descriptive about exactly what file types you are uploading and from where? Will you also take a screenshot, upload it to your media library where Staff can examine it, then return to this thread and post the screenshot file name? #1137339 hafeezrm Member When I open WordPress.com and sign-in, I find a list of my blogs and two links stating “Create a new blog”. When I click on any to be able to register a new blog, it takes to a search page V9 Portal Site. I am new to wordpress and do not understand about media library. #1137359 zandyring Staff Hi hafeez, Can you please clear your cache and try again? Here is more information about how to do that: http://en.support.wordpress.com/browser-issues/ Could you also turn off any browser extensions you may have on? Cheers! The topic ‘problem in creating new blog.’ is closed to new replies.	{ "url": "https://en.forums.wordpress.com/topic/problem-in-creating-new-blog/", "source_domain": "en.forums.wordpress.com", "snapshot_id": "crawl=CC-MAIN-2018-17", "warc_metadata": { "Content-Length": "32494", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LKPVRHCOJIYJWJ5BXUUJE5COWKC3ZA6I", "WARC-Concurrent-To": "<urn:uuid:ab25ecfa-22cc-4bf5-89e6-f9d1c608b978>", "WARC-Date": "2018-04-24T09:21:01Z", "WARC-IP-Address": "192.0.78.12", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CUVDKC7ZSQK2SWBZ5LECT36YC7E7YMOW", "WARC-Record-ID": "<urn:uuid:edf2ae0e-afd3-433b-97b5-c8841e29d1bb>", "WARC-Target-URI": "https://en.forums.wordpress.com/topic/problem-in-creating-new-blog/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1ad772d9-44c8-4b42-864e-46708c58b629>" }, "warc_info": "robots: classic\r\nhostname: ip-10-45-141-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 30, 31, 42, 52, 65, 66, 79, 90, 91, 152, 263, 264, 327, 328, 341, 342, 356, 367, 368, 725, 726, 739, 740, 753, 764, 765, 974, 975, 1044, 1045, 1058, 1059, 1073, 1083, 1084, 1099, 1100, 1198, 1250, 1251, 1319, 1320, 1332, 1333 ], "line_end_idx": [ 30, 31, 42, 52, 65, 66, 79, 90, 91, 152, 263, 264, 327, 328, 341, 342, 356, 367, 368, 725, 726, 739, 740, 753, 764, 765, 974, 975, 1044, 1045, 1058, 1059, 1073, 1083, 1084, 1099, 1100, 1198, 1250, 1251, 1319, 1320, 1332, 1333, 1400 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1400, "ccnet_original_nlines": 44, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.431654691696167, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.032374098896980286, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17266187071800232, "rps_doc_frac_unique_words": 0.6116071343421936, "rps_doc_mean_word_length": 4.5625, "rps_doc_num_sentences": 23, "rps_doc_symbol_to_word_ratio": 0.014388489536941051, "rps_doc_unigram_entropy": 4.670464992523193, "rps_doc_word_count": 224, "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.01956946961581707, "rps_doc_frac_chars_top_3gram": 0.025440309196710587, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -121.05455780029297, "rps_doc_books_importance_length_correction": -120.968994140625, "rps_doc_openwebtext_importance": -74.42489624023438, "rps_doc_openwebtext_importance_length_correction": -74.42489624023438, "rps_doc_wikipedia_importance": -49.83438491821289, "rps_doc_wikipedia_importance_length_correction": -46.4133186340332 }, "fasttext": { "dclm": 0.03746449947357178, "english": 0.9392008185386658, "fineweb_edu_approx": 1.0544114112854004, "eai_general_math": 0.23183315992355347, "eai_open_web_math": 0.0897512435913086, "eai_web_code": 0.0040350002236664295 } }	{ "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.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-7,644,065,846,373,011,000	123.231.251.146 SOCIAL REPORT 40% This CoolSocial report was updated on 27 Dec 2012, you can refresh this analysis whenever you want. 123.231.251.146 scored 40 Social Media Impact. Social Media Impact score is a measure of how much a site is popular on social networks. 2/5.0 Stars by Social Team Add CoolSocial badge. Show it by adding this HTML code on your site: Cool Social 123.231.251.146 CoolSocial.net Badge just copy & paste the snippet into your website! Social Media Stumble Upon Stumble Upon 0 Delicious Delicious 0 Google Plus Google Plus 0 Facebook Facebook site likes + page likes 0 Twitter Twitter tweets + followers 0 This is the sum of two values: the total number of people who shared the 123.231.251.146 homepage on Twitter + the total number of 123.231.251.146 followers (if 123.231.251.146 has a Twitter account). The total number of people who shared the 123.231.251.146 homepage on StumbleUpon. The total number of people who shared the 123.231.251.146 homepage on Delicious. This is the sum of two values: the total number of people who shared, liked or recommended the 123.231.251.146 homepage on Facebook + the total number of page likes (if 123.231.251.146 has a Facebook fan page). The total number of people who shared the 123.231.251.146 homepage on Google Plus by a google +1 button. Add a widget like this on your site: click here. Basic Information OK PAGE TITLE LPSE Kabupaten Bengkulu Selatan Attention DESCRIPTION Attention KEYWORDS OK OTHER KEYWORDS The keywords meta-tag found in the head section of the homepage. The title found in the head section of the homepage. The description meta-tag found in the head section of the homepage. The URL (Uniform Resource Locator) is the address of the site. CoolSocial advanced keyword analysis tool is able to detect and analyze every keyword on each page of a site. Domain and Server OK DOCTYPE HTML 5.0 OK CHARSET AND LANGUAGE UTF-8 OK DETECTED LANGUAGE We detected this site is in the English language. Other possibilities are: IT 11.5% English OK SERVER Apache/2.2.20 (Ubuntu) OK OPERATIVE SYSTEM This server uses the Linux operative system Linux Operative System running on the server. Character set and language of the site. Type of server and offered services. Represents HTML declared type (e.g.: XHTML 1.1, HTML 4.0, the new HTML 5.0) The language of 123.231.251.146 as detected by CoolSocial algorithms. Site Traffic trend during the last year. Only available for sites ranked <= 100000 in the world. 123.231.251.146 over the web Referring domains for 123.231.251.146 by Majestic Seo Referring domains for 123.231.251.146 by MajesticSeo. High values are a sign of site importance over the web and on web engines. Facebook link Attention FACEBOOK PAGE LINK NOT FOUND The type of Facebook page. The URL of the found Facebook page. The total number of people who like website Facebook page. The description of the Facebook page describes website and its services to the social media users. Facebook Timeline is the new layout of Facebook pages. A Facebook page link can be found in the homepage or in the robots.txt file. The total number of people who tagged or talked about website Facebook page in the last 7-10 days. Twitter account link Attention TWITTER PAGE LINK NOT FOUND Total number of Followers. It measures how big is the social media audience. The description of the Twitter account describes website and its services to the social media users. The date of Twitter account creation. The URL of the found Twitter account page. Total number of Tweets. It measures how much websites talk to its social media audience. Where site or its webmaster resides. Total number of people who added this Twitter account to their lists. A Twitter account link can be found in the homepage or in the robots.txt file. Things to do in order to optimize Social Media Impact - Be sure social media are well visible on your page: you can use our widget - You can add the Cool Social snippet - If you have no facebook brand page create a new one. If you have specify it as explained here - If you have no twitter account create a new one. If you have specify it as explained here - Add a description meta tag to describe your site to social media and search engines The IP of a server identifies it. It can be unique or shared between multiple sites. Domain age is a measure of how much a site is old. Older sites have normally more importance and are more trustworthy than young ones. The next date 123.231.251.146 will expire. The owner usually renews every year its domain, but some prefer buying more than a year only. The date 123.231.251.146 was registered for the first time. The registar is the authority where 123.231.251.146 is registered. Server location specifies where it is physically. Social media impact \| Distribution \| Improve \| Similar sites How Social Media Impact is calculated	{ "url": "http://www.coolsocial.net/sites/www/123.231.251.146.html", "source_domain": "www.coolsocial.net", "snapshot_id": "crawl=CC-MAIN-2015-11", "warc_metadata": { "Content-Length": "33959", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:ZFJM4FT4QW3FDN5LMPEK7K2E6Q7VOVZW", "WARC-Concurrent-To": "<urn:uuid:bd86da2e-fa4c-4f58-b087-1033909fcd4e>", "WARC-Date": "2015-03-04T22:52:39Z", "WARC-IP-Address": "62.149.132.192", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:NMSECTYTXUJ26LXDOOSIMQKSMPXSTPTQ", "WARC-Record-ID": "<urn:uuid:39d6353d-e455-44ee-8002-547d7c5a929f>", "WARC-Target-URI": "http://www.coolsocial.net/sites/www/123.231.251.146.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0a834fae-9c46-4584-a565-72d1b4fefb05>" }, "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, 16, 17, 31, 32, 36, 37, 39, 40, 140, 141, 142, 143, 306, 307, 376, 425, 474, 475, 488, 489, 519, 543, 571, 617, 656, 657, 1338, 1339, 1340, 1389, 1390, 1408, 1409, 1457, 1467, 1479, 1489, 1500, 1503, 1520, 1521, 1880, 1881, 1899, 1900, 1903, 1913, 1922, 1925, 1946, 1952, 1955, 1973, 2066, 2069, 2078, 2101, 2104, 2123, 2173, 2174, 2437, 2438, 2535, 2536, 2565, 2566, 2620, 2749, 2750, 2764, 2765, 2775, 2796, 2806, 2807, 3259, 3260, 3281, 3282, 3292, 3312, 3322, 3323, 3857, 3858, 3912, 3913, 3915, 3990, 3992, 4028, 4030, 4124, 4126, 4216, 4218, 4302, 4303, 4837, 4838, 4899 ], "line_end_idx": [ 16, 17, 31, 32, 36, 37, 39, 40, 140, 141, 142, 143, 306, 307, 376, 425, 474, 475, 488, 489, 519, 543, 571, 617, 656, 657, 1338, 1339, 1340, 1389, 1390, 1408, 1409, 1457, 1467, 1479, 1489, 1500, 1503, 1520, 1521, 1880, 1881, 1899, 1900, 1903, 1913, 1922, 1925, 1946, 1952, 1955, 1973, 2066, 2069, 2078, 2101, 2104, 2123, 2173, 2174, 2437, 2438, 2535, 2536, 2565, 2566, 2620, 2749, 2750, 2764, 2765, 2775, 2796, 2806, 2807, 3259, 3260, 3281, 3282, 3292, 3312, 3322, 3323, 3857, 3858, 3912, 3913, 3915, 3990, 3992, 4028, 4030, 4124, 4126, 4216, 4218, 4302, 4303, 4837, 4838, 4899, 4936 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4936, "ccnet_original_nlines": 102, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2836538553237915, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04711538180708885, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.253846138715744, "rps_doc_frac_unique_words": 0.32258063554763794, "rps_doc_mean_word_length": 4.826302528381348, "rps_doc_num_sentences": 121, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.9152631759643555, "rps_doc_word_count": 806, "rps_doc_frac_chars_dupe_10grams": 0.17403599619865417, "rps_doc_frac_chars_dupe_5grams": 0.24267351627349854, "rps_doc_frac_chars_dupe_6grams": 0.2118251919746399, "rps_doc_frac_chars_dupe_7grams": 0.20539845526218414, "rps_doc_frac_chars_dupe_8grams": 0.1969151645898819, "rps_doc_frac_chars_dupe_9grams": 0.1969151645898819, "rps_doc_frac_chars_top_2gram": 0.033933158963918686, "rps_doc_frac_chars_top_3gram": 0.04010282829403877, "rps_doc_frac_chars_top_4gram": 0.03701798990368843, "rps_doc_books_importance": -584.3916625976562, "rps_doc_books_importance_length_correction": -584.3916625976562, "rps_doc_openwebtext_importance": -319.6422424316406, "rps_doc_openwebtext_importance_length_correction": -319.6422424316406, "rps_doc_wikipedia_importance": -275.3095397949219, "rps_doc_wikipedia_importance_length_correction": -275.3095397949219 }, "fasttext": { "dclm": 0.01916312985122204, "english": 0.861628532409668, "fineweb_edu_approx": 2.0585579872131348, "eai_general_math": 0.003694829996675253, "eai_open_web_math": 0.04783957824110985, "eai_web_code": 0.0035933901090174913 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.8", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,915,953,227,963,453,000	DEV Community Cover image for How to Integrate Plaid SDK to React Native Using Expo Config Plugins Áron Berezkin Áron Berezkin Posted on • Originally published at aronberezkin.com How to Integrate Plaid SDK to React Native Using Expo Config Plugins Previously, if you wanted to integrate Plaid React Native SDK to Expo, you either had to forcefully eject to bare workflow or use a webview solution which could result in some funny unexpected issues such as this recaptcha pop up. Well, in case you have stumbled upon my previous guide to Expo config plugins, you already know that customizing Expo managed workflow is more than possible and therefore, in this tutorial, we will look at a bit more advanced example how to integrate Plaid, a reliable service to connect financial accounts to our app. SETUP To get started you can use this Github repository as a starter or just follow these commands: Initiate a new Expo project - here with typescript for better DX: expo init expo-plaid-sdk-integration -t expo-template-blank-typescript Enter fullscreen mode Exit fullscreen mode Add the React Native Plaid SDK library: yarn add react-native-plaid-link-sdk Enter fullscreen mode Exit fullscreen mode Update App.tsx to: import React from 'react' import { StyleSheet, Text, View } from 'react-native' import { PlaidLink, LinkSuccess, LinkExit } from 'react-native-plaid-link-sdk' export default function App() { return ( <View style={styles.container}> <PlaidLink tokenConfig={{ token: '#GENERATED_LINK_TOKEN#', noLoadingState: false }} onSuccess={(success: LinkSuccess) => console.log(success)} onExit={(exit: LinkExit) => console.log(exit)} > <Text>Add Account</Text> </PlaidLink> </View> ) } const styles = StyleSheet.create({ container: { flex: 1, backgroundColor: '#fff', alignItems: 'center', justifyContent: 'center' } }) Enter fullscreen mode Exit fullscreen mode And include iOS bundleIdentifier and Android package name of your choice to app.json: "expo": { ...otherProps, "ios": { "supportsTablet": true, "bundleIdentifier": "com.expo.plaid" }, "android": { "adaptiveIcon": { "foregroundImage": "./assets/adaptive-icon.png", "backgroundColor": "#FFFFFF" }, "package": "com.expo.plaid" } } Enter fullscreen mode Exit fullscreen mode If you now try running the application through Expo Go, you will likely see this error... TypeError: null is not an object (evaluating '_reactNative.NativeModules.RNLinksdk.continueFromRedirectUriString') ...which should be expected. PLAID INTEGRATION To start integrating Plaid we will need to run the app through expo-dev-client which we can achieve either by using expo run commands locally or using EAS build process. By building the dev client we will have a custom Expo Go which will add the Plaid library to its bundle, meaning you can use this client until you decide to add again something new that is not supported by it. For simplicity we will stay with the local run commands. Then we just need to follow the Plaid readme setup guide for both iOS and Android. iOS setup This is actually super simple. The readme suggests adding to ios/Podfile following string pod 'Plaid', '~> <insert latest version> to pin the latest version, but, in reality, this is optional and we can easily work with the version currently bundled in the library. As a result, the only step we have to do is to initiate the expo-dev-client by running: expo run:ios Enter fullscreen mode Exit fullscreen mode After the build process finishes, the app launches without the error we experienced previously. You can press Add Account and you should see Plaid error complaining about the token we provided - but about that later. Unexpected environment string value: (null). Expected one of: production, sandbox, or development. Android setup If you run expo run:android and press Add Account at this stage, you will get an unhandled promise rejection.. TypeError: null is not an object (evaluating '_reactNative.NativeModules.PlaidAndroid.startLinkActivityForResult') ..because there are actually bunch of steps to make Android work and as the readme suggests it is due to TurboModules not supporting autolinking. But in general this is nothing we cannot setup ourselves with Expo config plugins. 1) Setup your app id This change you have to do on Plaid Dashboard at the API page - Allowed Android Package. You should configure there the Android package name from app.json - com.expo.plaid. 2) Update MainApplication.java Here we have to fullfil 2 requirements: • Add import com.plaid.PlaidPackage; to the imports section • Add packages.add(new PlaidPackage()); to List<ReactPackage> getPackages(); Which we can do only with an expo config plugin: Create in the root of your project withAndroidPlaid.ts file and start transpiling it to javascript with this command: yarn tsc withAndroidPlaid.ts --watch --skipLibCheck Enter fullscreen mode Exit fullscreen mode and import it in app.json as a plugin: { "expo": { ...otherProps, "plugins": ["./withAndroidPlaid"] } } Enter fullscreen mode Exit fullscreen mode Finally, change withAndroidPlaid.ts content to following: import type { ConfigPlugin } from '@expo/config-plugins' import { withMainApplication } from '@expo/config-plugins' function applyPackage(mainApplication: string) { const plaidPackageImport = `import com.plaid.PlaidPackage;\n` const plaidAddPackage = `packages.add(new PlaidPackage());` // Make sure the project does not have the settings already if (!mainApplication.includes(plaidPackageImport)) { mainApplication = mainApplication.replace( /package com.expo.plaid;/, `package com.expo.plaid;\n${plaidPackageImport}` ) } if (!mainApplication.includes(plaidAddPackage)) { mainApplication = mainApplication.replace( /return packages;/, ` ${plaidAddPackage} return packages; ` ) } return mainApplication } const withAndroidPlaid: ConfigPlugin = (expoConfig) => { expoConfig = withMainApplication(expoConfig, (config) => { config.modResults.contents = applyPackage(config.modResults.contents) return config }) return expoConfig } export default withAndroidPlaid Enter fullscreen mode Exit fullscreen mode If you look closely, our plugin is utilizing withMainApplication, a mod provided by Expo allowing us to read and modify the content of MainApplication.java. We provide the content to our function applyPackage where we execute 2 string replacements to insert plaidPackageImport and plaidAddPackage constants into the file - the changes Plaid readme wanted from us. Our strategy is to simply find a stable part of the file where we can append our changes. Due to the string replacement nature, it is quite dangerous thing to rely on, because they could change with consequent React Native and Expo updates - so be sure these replacements still work when you upgrade. If you run expo prebuild -p android you should now see updated MainApplication.java. If you did something incorrectly, you may want to discard changes, check your plugin code, and try prebuild again. 3) Update app/build.gradle We need to update dependencies to following: dependencies { // ... implementation project(':react-native-plaid-link-sdk') } Enter fullscreen mode Exit fullscreen mode Which we can do utilizing withAppBuildGradle modifying the file within withAndroidPlaid function. // ... expoConfig = withAppBuildGradle(expoConfig, (config) => { config.modResults.contents = applyImplementation(config.modResults.contents) return config }) // ... Enter fullscreen mode Exit fullscreen mode And applyImplementation is our custom function following the previous strategy of appending plaidImplementation string to the right place of the file. function applyImplementation(appBuildGradle: string) { const plaidImplementation = `implementation project(':react-native-plaid-link-sdk')` // Make sure the project does not have the dependency already if (!appBuildGradle.includes(plaidImplementation)) { return appBuildGradle.replace( /dependencies\s?{/, `dependencies { ${plaidImplementation}` ) } return appBuildGradle } Enter fullscreen mode Exit fullscreen mode 4) Update settings.gradle Finally, we have to append following string to settings.gradle: include ':react-native-plaid-link-sdk' project(':react-native-plaid-link-sdk').projectDir = new File(rootProject.projectDir, '../node_modules/react-native-plaid-link-sdk/android') Enter fullscreen mode Exit fullscreen mode Which can be done using withSettingsGradle Expo mod: expoConfig = withSettingsGradle(expoConfig, (config) => { config.modResults.contents = applySettings(config.modResults.contents) return config }) Enter fullscreen mode Exit fullscreen mode And making the changes with our custom applySettings function. Notice that we are just concatenating the strings with plus symbol given that we don't really care about the exact placement of plaidSettings constant. function applySettings(gradleSettings: string) { const plaidSettings = `include ':react-native-plaid-link-sdk' project(':react-native-plaid-link-sdk').projectDir = new File(rootProject.projectDir, '../node_modules/react-native-plaid-link-sdk/android')` // Make sure the project does not have the settings already if (!gradleSettings.includes(`include ':react-native-plaid-link-sdk'`)) { return gradleSettings + plaidSettings } return gradleSettings } Enter fullscreen mode Exit fullscreen mode If you lost track of the changes or applied them incorrectly, you can always go to the solution branch of this github repository for my final implementation. Troubleshooting: I have discovered 2 potential issues when implementing Plaid on Android, so if you are facing build errors or your app is crashing, you might find an answer in these github issues: Kotlin version and OkHttp version. After applying all necessary changes you should just run expo run:android to build the app with all modifications. Once the build process finishes and the app launches, you can press Add Account and you should see a different Plaid error complaining about configuration - but it is actually about the fake token we have provided. null - unable to open link, please check that your configuration is valid Getting the link token At this point, you just need to provide a correct link token in App.tsx. Normally you would get it from your backend, but for testing purposes we can actually use a very handy Postman collection provided by Plaid. After going through the setup and utilizing your client_id and secret from Plaid dashboard, you can hit https://sandbox.plaid.com/link/token/create API endpoint and use the returned link_token. { "expiration": "2021-12-25T19:49:22Z", "link_token": "link-sandbox-965dbc89-14fc-4122-b900-27a562de6db0", "request_id": "AEBgG6EbWGsQ9aR" } Enter fullscreen mode Exit fullscreen mode Now pressing Add Account should finally open Plaid interface: Plaid intro screen SUMMARY This integration might feel scary at first, but in the end we are just doing the same thing over and over - inserting a string into a native file during the build time (or prebuild time more specifically). Note that the Expo mods we used are marked as dangerous given that they rely on our custom string replacement rules and you should expect them to break in the future. But for now, they are the best way how to combine the Expo managed workflow and Plaid React Native SDK. Top comments (0)	{ "url": "https://dev.to/aronberezkin/how-to-integrate-plaid-sdk-to-react-native-using-expo-config-plugins-33dg", "source_domain": "dev.to", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "114145", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2N5QMXGEUZI4KPQ2WQBCC4SJM7ZOQKRF", "WARC-Concurrent-To": "<urn:uuid:649870b5-c7e4-44bb-b988-f9565f918f1f>", "WARC-Date": "2024-02-21T23:04:58Z", "WARC-IP-Address": "151.101.2.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LCJHMT5AY7UQZZC2K72YKUIE36A2TFKZ", "WARC-Record-ID": "<urn:uuid:97811283-5aa9-4446-94f8-d13477b382a6>", "WARC-Target-URI": "https://dev.to/aronberezkin/how-to-integrate-plaid-sdk-to-react-native-using-expo-config-plugins-33dg", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b5bb73ee-dcca-4f34-b63d-384dcac1eef4>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-31\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 14, 15, 100, 114, 128, 129, 182, 183, 252, 253, 484, 485, 804, 805, 811, 812, 906, 907, 973, 974, 1046, 1089, 1090, 1130, 1131, 1168, 1211, 1212, 1231, 1232, 1258, 1312, 1391, 1392, 1424, 1435, 1471, 1488, 1569, 1636, 1691, 1699, 1732, 1751, 1763, 1767, 1769, 1770, 1805, 1820, 1833, 1862, 1888, 1917, 1921, 1924, 1967, 1968, 2054, 2055, 2065, 2084, 2097, 2129, 2174, 2181, 2198, 2224, 2285, 2326, 2335, 2369, 2375, 2377, 2420, 2421, 2511, 2512, 2627, 2628, 2657, 2658, 2676, 2677, 3197, 3198, 3208, 3209, 3563, 3564, 3577, 3620, 3621, 3838, 3839, 3938, 3939, 3953, 3954, 4065, 4066, 4181, 4182, 4411, 4412, 4433, 4434, 4607, 4608, 4639, 4640, 4680, 4681, 4743, 4822, 4823, 4872, 4873, 4991, 4992, 5044, 5087, 5088, 5127, 5128, 5130, 5142, 5161, 5199, 5203, 5205, 5248, 5249, 5307, 5308, 5365, 5424, 5425, 5474, 5538, 5600, 5601, 5663, 5718, 5765, 5798, 5853, 5859, 5863, 5864, 5916, 5963, 5989, 5997, 6020, 6041, 6047, 6053, 6057, 6058, 6083, 6085, 6086, 6143, 6204, 6278, 6296, 6301, 6302, 6322, 6324, 6325, 6357, 6400, 6401, 6765, 6766, 7067, 7068, 7268, 7269, 7296, 7297, 7342, 7343, 7358, 7369, 7428, 7430, 7473, 7474, 7572, 7573, 7580, 7638, 7717, 7733, 7736, 7743, 7786, 7787, 7938, 7939, 7994, 8081, 8082, 8146, 8201, 8236, 8262, 8284, 8312, 8318, 8322, 8323, 8347, 8349, 8392, 8393, 8419, 8420, 8484, 8485, 8524, 8665, 8708, 8709, 8762, 8763, 8821, 8894, 8910, 8913, 8956, 8957, 9172, 9173, 9222, 9286, 9430, 9431, 9493, 9569, 9611, 9615, 9616, 9640, 9642, 9685, 9686, 9844, 9845, 10078, 10079, 10194, 10195, 10410, 10411, 10485, 10486, 10509, 10510, 10724, 10725, 10919, 10920, 10922, 10962, 11031, 11065, 11067, 11110, 11111, 11173, 11174, 11193, 11194, 11202, 11203, 11680, 11681 ], "line_end_idx": [ 14, 15, 100, 114, 128, 129, 182, 183, 252, 253, 484, 485, 804, 805, 811, 812, 906, 907, 973, 974, 1046, 1089, 1090, 1130, 1131, 1168, 1211, 1212, 1231, 1232, 1258, 1312, 1391, 1392, 1424, 1435, 1471, 1488, 1569, 1636, 1691, 1699, 1732, 1751, 1763, 1767, 1769, 1770, 1805, 1820, 1833, 1862, 1888, 1917, 1921, 1924, 1967, 1968, 2054, 2055, 2065, 2084, 2097, 2129, 2174, 2181, 2198, 2224, 2285, 2326, 2335, 2369, 2375, 2377, 2420, 2421, 2511, 2512, 2627, 2628, 2657, 2658, 2676, 2677, 3197, 3198, 3208, 3209, 3563, 3564, 3577, 3620, 3621, 3838, 3839, 3938, 3939, 3953, 3954, 4065, 4066, 4181, 4182, 4411, 4412, 4433, 4434, 4607, 4608, 4639, 4640, 4680, 4681, 4743, 4822, 4823, 4872, 4873, 4991, 4992, 5044, 5087, 5088, 5127, 5128, 5130, 5142, 5161, 5199, 5203, 5205, 5248, 5249, 5307, 5308, 5365, 5424, 5425, 5474, 5538, 5600, 5601, 5663, 5718, 5765, 5798, 5853, 5859, 5863, 5864, 5916, 5963, 5989, 5997, 6020, 6041, 6047, 6053, 6057, 6058, 6083, 6085, 6086, 6143, 6204, 6278, 6296, 6301, 6302, 6322, 6324, 6325, 6357, 6400, 6401, 6765, 6766, 7067, 7068, 7268, 7269, 7296, 7297, 7342, 7343, 7358, 7369, 7428, 7430, 7473, 7474, 7572, 7573, 7580, 7638, 7717, 7733, 7736, 7743, 7786, 7787, 7938, 7939, 7994, 8081, 8082, 8146, 8201, 8236, 8262, 8284, 8312, 8318, 8322, 8323, 8347, 8349, 8392, 8393, 8419, 8420, 8484, 8485, 8524, 8665, 8708, 8709, 8762, 8763, 8821, 8894, 8910, 8913, 8956, 8957, 9172, 9173, 9222, 9286, 9430, 9431, 9493, 9569, 9611, 9615, 9616, 9640, 9642, 9685, 9686, 9844, 9845, 10078, 10079, 10194, 10195, 10410, 10411, 10485, 10486, 10509, 10510, 10724, 10725, 10919, 10920, 10922, 10962, 11031, 11065, 11067, 11110, 11111, 11173, 11174, 11193, 11194, 11202, 11203, 11680, 11681, 11697 ] }	{ "red_pajama_v2": { "ccnet_original_length": 11697, "ccnet_original_nlines": 281, "rps_doc_curly_bracket": 0.005984439980238676, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2674523890018463, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00861287023872137, "rps_doc_frac_lines_end_with_ellipsis": 0.01418440043926239, "rps_doc_frac_no_alph_words": 0.2674523890018463, "rps_doc_frac_unique_words": 0.3565998673439026, "rps_doc_mean_word_length": 6.21561861038208, "rps_doc_num_sentences": 122, "rps_doc_symbol_to_word_ratio": 0.004986399784684181, "rps_doc_unigram_entropy": 5.606566429138184, "rps_doc_word_count": 1447, "rps_doc_frac_chars_dupe_10grams": 0.02357126958668232, "rps_doc_frac_chars_dupe_5grams": 0.14609740674495697, "rps_doc_frac_chars_dupe_6grams": 0.14609740674495697, "rps_doc_frac_chars_dupe_7grams": 0.09461863338947296, "rps_doc_frac_chars_dupe_8grams": 0.06070714071393013, "rps_doc_frac_chars_dupe_9grams": 0.04313987120985985, "rps_doc_frac_chars_top_2gram": 0.04669779911637306, "rps_doc_frac_chars_top_3gram": 0.03168778866529465, "rps_doc_frac_chars_top_4gram": 0.0383589081466198, "rps_doc_books_importance": -1058.5098876953125, "rps_doc_books_importance_length_correction": -1058.5098876953125, "rps_doc_openwebtext_importance": -621.281982421875, "rps_doc_openwebtext_importance_length_correction": -621.281982421875, "rps_doc_wikipedia_importance": -433.2898254394531, "rps_doc_wikipedia_importance_length_correction": -433.2898254394531 }, "fasttext": { "dclm": 0.07590782642364502, "english": 0.7494367957115173, "fineweb_edu_approx": 1.5259578227996826, "eai_general_math": 0.4049628973007202, "eai_open_web_math": 0.08685457706451416, "eai_web_code": 0.6153846979141235 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "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": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
6,957,294,836,096,265,000	Refers to unlocking iPhones. Unlocking an iPhone that has been locked to a specific carrier (such as Verizon or AT&T), allows you to use it on other compatible networks. learn more… \| top users \| synonyms 3 votes 1answer 2k views How do iPhones get carrier locked remotely? My original iPhone 5 came directly from Virgin Mobile. As such, it's carrier locked. A few months back, I had what seemed like a hardware issue, and in the process of troubleshooting it, Apple ... 4 votes 2answers 14k views Can I use a t-mobile contract free iphone 6 in europe with a sim card from a local provider? Or: How do I know if my country has a compatible network? A friend of mine is going to NYC. I'd like him to buy a contract free t-mobile iphone 6 for me cause they are cheaper in the US. I would like to use this phone with my european sim card provider. Is ... 6 votes 8answers 113k views How can you unlock a Sprint iPhone 6 Plus? It was paid in full without a contract I purchased a Sprint iPhone 6 Plus 64gb off contract. I paid the full amount which was about $1,000. As of today (2014-09-24), how can we unlock the iPhone 6 Plus which is on Sprint? I am a Sprint ... 1 vote 1answer 4k views iPhone 5 locked to Japanese network KDDI Hope someone can help me with my locked iPhone 5. I was given it second hand in Japan and want to use it in New Zealand. It used to be on KDDI. When a Sim from NZ is inserted it shows invalid Sim. ... 0 votes 1answer 203 views iPhone lock time not showing showing all options On my iPhone running iOS 7, I can only set auto-lock times of up to one hour. My son's can have an auto-lock time of up to three hours, and there's no obvious difference between our two phones. ... 0 votes 2answers 445 views Buying used iPhone 5s for use abroad I'm looking to buy a used iPhone 5s from eBay. It will be used as an iPod Touch for a while, but I'll be moving out of the US in about a year or so. Sprint phones are by far the cheapest, but as I ... 0 votes 1answer 322 views How to run iphone side by side with another iphone I just bought a new iphone to replace the one I dropped in water. The old iphone works except for the screen and I can't back it up via itunes on my computer because I have a password on the old ... 0 votes 2answers 1k views Can I use a different carrier with my iPhone 4s received from provider? I've got an iPhone 4s from a provider, but they gave it to me without a sim card. It worked but I am wondering if I could buy a sim card, put it in the slot and use the phone with a different carrier, ... 1 vote 2answers 2k views Unlocked 5s won't connect to new carrier (docomo) data network I recently moved to Japan and got a new SIM card, with a contract, from docomo (one of the major carriers here). I had my iPhone 5s unlocked by a third party, and inserted the new SIM card into this ... 2 votes 2answers 3k views How do I tell if my AT&T iPhone 5 is unlocked? I requested AT&T to unlock my iPhone 5 at http://att.com/deviceunlock . I got an email saying that my device may be unlocked. According to the instructions in AT&T's email, I need to do an ... 1 vote 1answer 178 views Using at&t iphone 5c in India Would an unlocked AT&T iphone 5c work well with 2G/3G in India? AFAIK, India doesn't have 4G yet. So, I am not too worried about 4G/LTE. Would it latch onto 3G in India? I bought the phone in USA. 0 votes 1answer 2k views Edit Content of IPSW file to install older baseband firmware I just got this old iphone4 from my aunt a few days ago and it is locked to AT&T... it has already been updated to the latest version 7.1.2 and has never been jailbroken. I have read that the only ... 0 votes 0answers 4k views What to do if you forgot your lockscreen password? [duplicate] How would I go about forgetting my lock-screen password? What can I do to get back in? This is about the iPhone 4, 4S and 5. More of a How-To question, someone I know forgot their password. 11 votes 6answers 8k views Can I use my fingerprint to login/unlock the screen on a Mac? I own a mid-2009 MBP with OS X Mavericks installed. I'm a hi-tech enthusiast who wants to use the fingerprint scanning feature made available by many scanners on the market to login into my account ... 10 votes 5answers 4k views Putting iPhone passcode into Xcode, so I wouldn't need to unlock my iPhone for every build? Is there a way that I could put my iPhone lock code into Xcode, so I wouldn't need to unlock my iPhone for every build? It gets really frustrating that I need to physically unlock my iPhone before ... 1 vote 1answer 121 views Autolock iphone? I use my iPad and iPhone as an alarm clock every night and keep them plugged into the wall. I want to be able to look over during the night and check the time, but I don't want them to be open and ... 2 votes 2answers 1k views Can I buy an iPhone 5C in the US and use it in Ireland? I'm going to New York soon, and the iPhone 5C is just $99 USD. I am wondering if an Irish SIM work or if I would have to get it unlocked? 1 vote 0answers 695 views Unlocking an iPhone with iOS 7.0.4 using SAM (Subscriber Artificial Module) I want to unlock my iPhone with a utility called SAM, or Subscriber Artificial Module. I saved my activation ticket and used it to unlock my iPhone 4 running iOS 5.1.1. A few days ago I replaced my ... 1 vote 1answer 17k views How to get SAM activation tickets (iPhone 5, iOS 7.0.4) I was asked to unlock an iPhone 5. The phone has been jailbroken successfuly (with SSH access), but I can't get around the simlock. I've tried SAM, but with no luck. When SAM is enabled, the phone ... 3 votes 3answers 44k views Do you need to activate an iPhone 5s with the original carrier sim card before you can factory unlock it? I bought an iPhone 5s and gifted it to a friend abroad without opening it and activating it. I was wondering if it's possible for that friend to unlock the iPhone without having to activate it with ... 0 votes 2answers 3k views How can I update and jailbreak/unlock my iPhone 3Gs from 4.1 to 6.1.3? I have an iPhone 3Gs running iOS 4.1 (baseband 06.15.00, serial number: 8704244TEDG). I want to update it to iOS 6.1.3 instead of iOS 7. How can I update it, and unlock it using Ultrasn0w after ... 1 vote 2answers 892 views Does “reset network settings” on iPhone enable me to change mobile carriers? Say, for example, if I have the iPhone 4S, and I select "reset network settings" in "General", would that enable me to change mobile carriers from AT&T to T-mobile? 0 votes 0answers 141 views How to unlock iphone 5s? [closed] I was given an iPhone 5S for christmas and looks like it is locked to AT&T. How do i unlock it so I can use it overseas? I have looked online but there is no answer except for these suspicious ... 2 votes 0answers 451 views How to enter passcode created with Greek characters once the Greek keyboard has been disabled? I have an iPhone 4s with iOS 7 and I entered a passcode with Greek letters, then I removed the Greek keyboard and now my iPhone is locked. I can't unlock it because the Greek keyboard isn't there any ... 3 votes 2answers 881 views Is my Verizon iPhone 5c unlocked? I have a Verizon iPhone 5c. Is it unlocked so that I can just go to T-Mobile or AT&T prepaid, by just popping in the SIM card? 0 votes 1answer 80k views Sim Not valid when activating my iPhone I have a unlocked iPhone 4 or at least that's what I've been told when i bought it. But then I went ahead to unlock it again, when I put a SIM card in, it says no service or at least i hope that's ... 0 votes 1answer 256 views Can I use the T-mobile contract free iPhone 5S with my AT&T number? I am thinking of purchasing the contract-free 5S because my contract with AT&T just expired, and I will only need the phone in the US for a few more months. Will I be able to use my AT&T sim ... 0 votes 2answers 2k views Unlock Verizon 4S iPhone I just purchased used iPhone 4S from a Verizon customer in the United States. I would like to unlock it and take it to Europe and use it on a GSM network. How can I do this? Phone info: iPhone 4S ... 3 votes 0answers 258 views How to run a shell script upon user authentication (e.g. screen unlock)? I would like to specify a shell script (say one to send me an email) whenever a given user is authenticated, for example if prompted after sleep, fresh login or fast user switching. PS: I found ... 3 votes 1answer 4k views Unlock read-only USB key A free 8GB USB key given to me shows up in Snow Leopard as read-only. $ mount /dev/disk1 on /Volumes/USB DISK (ntfs, local, nodev, nosuid, read-only, noowners) How can I mount it read-write? ... 2 votes 2answers 4k views Can be iPhone detected in 'Find my iPhone' service after recover? I lost my iPhone and while it was turned on I could lock it and put in 'Lost mode' through Apple 'Find My iPhone' service. Unfortunately almost one month it's not found and until now I had hope to ... 2 votes 0answers 201 views Broken FileVault Drive I'm coming to you having a few issues with my old hard drive. Basically, my MacBook crashed a few days ago. It seems like my disk has some bad sectors and has started a kind of autodestruction ... 3 votes 2answers 2k views Does official AT&T unlock also upgrade the operating system? I have an AT&T iPhone 4 running iOS version 5.1.1. My contract with AT&T is complete, and they have authorized my unlock. However, the process is to backup and restore from iTunes, according ... 1 vote 3answers 19k views Unlocking old Sprint iPhone 4s I have an old Sprint iPhone 4s that hasn't been under contract for around a year now and I have a friend on T-Mobile whose contract doesn't end for another year. He still has a flip phone so I want to ... 1 vote 1answer 9k views Which carriers will my unlocked AT&T iPhone 4s work with? I purchased a subsidized AT&T iPhone 4s in October 2011 (model MC922LL/A). I just unlocked the phone through AT&T's unlock website and received an email confirmation. I have backed up and ... 0 votes 1answer 133 views How can I disable Siri for making reminders and calendar items? I would like Siri not to be able to make reminders and calendar items without asking for the lock screen password. When I ask Siri to create a new reminder, I would like to ask it to unlock my phone ... 2 votes 2answers 628 views Can a Operator locked iPhone be updated to iOs 7? I was wondering if a locked iPhone (with a contract of 2 years) can be updated to iOs 7 and still working well and under the same contract. 1 vote 2answers 6k views Can I use basic iPhone 5/5s/5c with Aio Wireless “Aio Basic” plan? I would like to buy an unlocked iPhone 5 or iPhone 5s, and use it with the Aio Basic plan from Aio Wireless, an AT&T prepaid subsidiary launched in mid-2013. On their web-site, Aio Basic @ 40 USD/... 1 vote 5answers 4k views How to know what's my iphone 4s carrier using IMEI? I have an iphone 4s ios 6.1.3 my cousin bought it from U.S.A or so he says. He says the carrier is Verizon CDMA. However in the settings I see carrier: virgin 14.0 I am outside the USA so i need a ... 2 votes 2answers 648 views Unlock Mac from Terminal or Automator In my attempt to start iPlayer and BBC News every morning, I have scheduled Automator to open a page. It does work, however my Mac stays locked, therefore I need to get out of my bed and enter the ... 1 vote 1answer 116 views Can a factory unlocked iPhone 5 be used with Sprint? If I were to buy a brand new factory unlocked iPhone off eBay would I then be able to use that phone on sprint? 4 votes 1answer 571 views Unlocked iPhone replacement If an iPhone is locked, then unlocked and then replaced for a refurbished one in an Apple Store, will the new one remain unlocked? 2 votes 0answers 52 views How does the Country Unlock Work I live in Korea, where the carriers offer a free and legal country unlock. You have to give them the serial number and IMEI. However, due to the language barrier, the instructions after this are not ... 1 vote 0answers 1k views iphone 4 verizon cdma unlocked in india and uprgaded to newer version cydia not installed I have an iPhone 4 (CDMA), bought it to India and unlocked unofficially by jailbreaking. Recently I upgraded to iOS 6.1.2, and now Cydia is missing. Everything else is working fine; I can make calls, ... 2 votes 4answers 26k views Is it possible to unlock a CDMA iPhone 4S (from Virgin Mobile) to use another SIM in it? My friend has an iPhone 4s, it was bought from in the USA from Virgin Mobile. I want to do a factory unlock (unlock the SIM). I already know how to jailbreak, would jailbreaking work? Any help would ... 1 vote 2answers 219 views Is it possibe to upgrade and re-jailbreak (in order to unlock) a 3Gs running on 4.1? I have a locked 3Gs running 4.1 and it's pretty annoying not be able to install anything on it anymore (most apps nowadays require at least 4.3) I can not unlock it officially because i bought second ... -2 votes 1answer 919 views How legit is this website in telling if the phone is sim unlocked [closed] How legit is this website. It says my phone is not sim locked but I'm to scared to update it and ruin the jailbreak unlock. Somebody said they could factory unlock my phone for free so I gave them my ... 3 votes 2answers 2k views Encrypted/Journaled Seagate won't accept Password I have a 2011 MacBook Pro Intel running Mountain Lion. I have a 2tb Seagate External Drive with 3 partitions: all three were set up the same way with different passwords as a person who used to live ... 1 vote 4answers 13k views Will an AT&T iPad purchased from Best Buy US work in india? I am planning to purchase iPad Mini wifi + cellular from Best Buy. The Best Buy representatives were not sure it will work in India with different service provider or not. They are selling iPad with ... 0 votes 0answers 22 views How can I check if an iphone is sim unlocked already? [duplicate] For the iPhone 4S and 5, is it possible to easily check if they are sim unlocked ? If so how ? I've already seen this question but sounds a bit more complicated than I hoped. What's the simplest ...	{ "url": "http://apple.stackexchange.com/questions/tagged/unlock?page=2&sort=newest&pagesize=15", "source_domain": "apple.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2016-26", "warc_metadata": { "Content-Length": "182969", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:G7JHVM3DODV2YDL33F4FQIBA4BPALNHK", "WARC-Concurrent-To": "<urn:uuid:58df556b-4896-4a39-b837-580f6ac417d9>", "WARC-Date": "2016-06-28T15:30:21Z", "WARC-IP-Address": "151.101.129.69", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:2ZVMAXKKZ5WFCWRNBBKNKASBXHXTAK5G", "WARC-Record-ID": "<urn:uuid:9179f80c-e566-4e38-aadd-46ccae1bea4a>", "WARC-Target-URI": "http://apple.stackexchange.com/questions/tagged/unlock?page=2&sort=newest&pagesize=15", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:132b80c7-f819-465c-a7c9-5160782ce5d1>" }, "warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 170, 171, 206, 207, 209, 215, 223, 232, 233, 277, 278, 475, 477, 483, 492, 502, 503, 654, 655, 858, 860, 866, 875, 886, 887, 969, 970, 1171, 1173, 1178, 1186, 1195, 1196, 1237, 1238, 1439, 1441, 1447, 1455, 1465, 1466, 1515, 1516, 1714, 1716, 1722, 1731, 1741, 1742, 1779, 1780, 1981, 1983, 1989, 1997, 2007, 2008, 2059, 2060, 2259, 2261, 2267, 2276, 2285, 2286, 2358, 2359, 2564, 2566, 2571, 2580, 2589, 2590, 2653, 2654, 2857, 2859, 2865, 2874, 2883, 2884, 2931, 2932, 3125, 3127, 3132, 3140, 3150, 3151, 3181, 3182, 3379, 3381, 3387, 3395, 3404, 3405, 3466, 3467, 3668, 3670, 3676, 3685, 3694, 3695, 3758, 3759, 3949, 3952, 3958, 3967, 3976, 3977, 4039, 4040, 4242, 4245, 4251, 4260, 4269, 4270, 4362, 4363, 4564, 4566, 4571, 4579, 4589, 4590, 4607, 4608, 4809, 4811, 4817, 4826, 4835, 4836, 4892, 4893, 5031, 5033, 5038, 5047, 5057, 5058, 5134, 5135, 5337, 5339, 5344, 5352, 5362, 5363, 5419, 5420, 5621, 5623, 5629, 5638, 5648, 5649, 5755, 5756, 5958, 5960, 5966, 5975, 5984, 5985, 6056, 6057, 6255, 6257, 6262, 6271, 6281, 6282, 6359, 6360, 6525, 6527, 6533, 6542, 6552, 6553, 6587, 6588, 6785, 6787, 6793, 6802, 6812, 6813, 6908, 6909, 7113, 7115, 7121, 7130, 7140, 7141, 7175, 7176, 7303, 7305, 7311, 7319, 7329, 7330, 7370, 7371, 7572, 7574, 7580, 7588, 7598, 7599, 7667, 7668, 7863, 7865, 7871, 7880, 7889, 7890, 7915, 7916, 8116, 8118, 8124, 8133, 8143, 8144, 8217, 8218, 8416, 8418, 8424, 8432, 8441, 8442, 8467, 8468, 8663, 8665, 8671, 8680, 8689, 8690, 8756, 8757, 8958, 8960, 8966, 8975, 8985, 8986, 9009, 9010, 9207, 9209, 9215, 9224, 9233, 9234, 9295, 9296, 9491, 9493, 9498, 9507, 9517, 9518, 9549, 9550, 9755, 9757, 9762, 9770, 9779, 9780, 9838, 9839, 10031, 10033, 10039, 10047, 10057, 10058, 10122, 10123, 10326, 10328, 10334, 10343, 10353, 10354, 10404, 10405, 10545, 10547, 10552, 10561, 10570, 10571, 10638, 10639, 10839, 10841, 10846, 10855, 10864, 10865, 10917, 10918, 11119, 11121, 11127, 11136, 11146, 11147, 11185, 11186, 11387, 11389, 11394, 11402, 11412, 11413, 11466, 11467, 11579, 11581, 11587, 11595, 11605, 11606, 11634, 11635, 11766, 11768, 11774, 11783, 11792, 11793, 11826, 11827, 12030, 12032, 12037, 12046, 12055, 12056, 12146, 12147, 12351, 12353, 12359, 12368, 12378, 12379, 12468, 12469, 12672, 12674, 12679, 12688, 12698, 12699, 12784, 12785, 12989, 12992, 12998, 13006, 13016, 13017, 13092, 13093, 13297, 13299, 13305, 13314, 13323, 13324, 13374, 13375, 13578, 13580, 13585, 13594, 13604, 13605, 13665, 13666, 13869, 13871, 13877, 13886, 13895, 13896, 13962, 13963 ], "line_end_idx": [ 170, 171, 206, 207, 209, 215, 223, 232, 233, 277, 278, 475, 477, 483, 492, 502, 503, 654, 655, 858, 860, 866, 875, 886, 887, 969, 970, 1171, 1173, 1178, 1186, 1195, 1196, 1237, 1238, 1439, 1441, 1447, 1455, 1465, 1466, 1515, 1516, 1714, 1716, 1722, 1731, 1741, 1742, 1779, 1780, 1981, 1983, 1989, 1997, 2007, 2008, 2059, 2060, 2259, 2261, 2267, 2276, 2285, 2286, 2358, 2359, 2564, 2566, 2571, 2580, 2589, 2590, 2653, 2654, 2857, 2859, 2865, 2874, 2883, 2884, 2931, 2932, 3125, 3127, 3132, 3140, 3150, 3151, 3181, 3182, 3379, 3381, 3387, 3395, 3404, 3405, 3466, 3467, 3668, 3670, 3676, 3685, 3694, 3695, 3758, 3759, 3949, 3952, 3958, 3967, 3976, 3977, 4039, 4040, 4242, 4245, 4251, 4260, 4269, 4270, 4362, 4363, 4564, 4566, 4571, 4579, 4589, 4590, 4607, 4608, 4809, 4811, 4817, 4826, 4835, 4836, 4892, 4893, 5031, 5033, 5038, 5047, 5057, 5058, 5134, 5135, 5337, 5339, 5344, 5352, 5362, 5363, 5419, 5420, 5621, 5623, 5629, 5638, 5648, 5649, 5755, 5756, 5958, 5960, 5966, 5975, 5984, 5985, 6056, 6057, 6255, 6257, 6262, 6271, 6281, 6282, 6359, 6360, 6525, 6527, 6533, 6542, 6552, 6553, 6587, 6588, 6785, 6787, 6793, 6802, 6812, 6813, 6908, 6909, 7113, 7115, 7121, 7130, 7140, 7141, 7175, 7176, 7303, 7305, 7311, 7319, 7329, 7330, 7370, 7371, 7572, 7574, 7580, 7588, 7598, 7599, 7667, 7668, 7863, 7865, 7871, 7880, 7889, 7890, 7915, 7916, 8116, 8118, 8124, 8133, 8143, 8144, 8217, 8218, 8416, 8418, 8424, 8432, 8441, 8442, 8467, 8468, 8663, 8665, 8671, 8680, 8689, 8690, 8756, 8757, 8958, 8960, 8966, 8975, 8985, 8986, 9009, 9010, 9207, 9209, 9215, 9224, 9233, 9234, 9295, 9296, 9491, 9493, 9498, 9507, 9517, 9518, 9549, 9550, 9755, 9757, 9762, 9770, 9779, 9780, 9838, 9839, 10031, 10033, 10039, 10047, 10057, 10058, 10122, 10123, 10326, 10328, 10334, 10343, 10353, 10354, 10404, 10405, 10545, 10547, 10552, 10561, 10570, 10571, 10638, 10639, 10839, 10841, 10846, 10855, 10864, 10865, 10917, 10918, 11119, 11121, 11127, 11136, 11146, 11147, 11185, 11186, 11387, 11389, 11394, 11402, 11412, 11413, 11466, 11467, 11579, 11581, 11587, 11595, 11605, 11606, 11634, 11635, 11766, 11768, 11774, 11783, 11792, 11793, 11826, 11827, 12030, 12032, 12037, 12046, 12055, 12056, 12146, 12147, 12351, 12353, 12359, 12368, 12378, 12379, 12468, 12469, 12672, 12674, 12679, 12688, 12698, 12699, 12784, 12785, 12989, 12992, 12998, 13006, 13016, 13017, 13092, 13093, 13297, 13299, 13305, 13314, 13323, 13324, 13374, 13375, 13578, 13580, 13585, 13594, 13604, 13605, 13665, 13666, 13869, 13871, 13877, 13886, 13895, 13896, 13962, 13963, 14161 ] }	{ "red_pajama_v2": { "ccnet_original_length": 14161, "ccnet_original_nlines": 403, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.36991870403289795, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.07598499208688736, "rps_doc_frac_lines_end_with_ellipsis": 0.10396040230989456, "rps_doc_frac_no_alph_words": 0.1807379573583603, "rps_doc_frac_unique_words": 0.2618688941001892, "rps_doc_mean_word_length": 4.0844011306762695, "rps_doc_num_sentences": 193, "rps_doc_symbol_to_word_ratio": 0.013758599758148193, "rps_doc_unigram_entropy": 5.546761512756348, "rps_doc_word_count": 2654, "rps_doc_frac_chars_dupe_10grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_5grams": 0.04474170133471489, "rps_doc_frac_chars_dupe_6grams": 0.019557200372219086, "rps_doc_frac_chars_dupe_7grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_8grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_9grams": 0.009594099596142769, "rps_doc_frac_chars_top_2gram": 0.008302579633891582, "rps_doc_frac_chars_top_3gram": 0.0038745400961488485, "rps_doc_frac_chars_top_4gram": 0.005535060074180365, "rps_doc_books_importance": -1401.16650390625, "rps_doc_books_importance_length_correction": -1401.16650390625, "rps_doc_openwebtext_importance": -880.6762084960938, "rps_doc_openwebtext_importance_length_correction": -880.6762084960938, "rps_doc_wikipedia_importance": -697.9944458007812, "rps_doc_wikipedia_importance_length_correction": -697.9944458007812 }, "fasttext": { "dclm": 0.1417129635810852, "english": 0.9548929333686829, "fineweb_edu_approx": 0.9624925851821899, "eai_general_math": 0.0008059099782258272, "eai_open_web_math": 0.0788874626159668, "eai_web_code": 0.00024002999998629093 } }	{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-8,206,630,088,282,551,000	CameraIcon CameraIcon SearchIcon MyQuestionIcon MyQuestionIcon Question If two number which have least common factor 3 and 2 respectively are added Find the least common Prime factor of the new number formed Open in App Solution The two numbers will be of the form 3x and 2y. x is an odd number.(because 3 is the least factor) Therefore 3x is an odd number and 2y is an even number. Therefore, 3x + 2y is an odd number. flag Suggest Corrections thumbs-up 0 mid-banner-image mid-banner-image Join BYJU'S Learning Program similar_icon Related Videos thumbnail lock QUANTITATIVE APTITUDE Watch in App Join BYJU'S Learning Program	{ "url": "https://byjus.com/question-answer/if-two-number-which-have-least-common-factor-3-and-2-respectively-are-added-find/", "source_domain": "byjus.com", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "126226", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UE5L7BNTEFGHXCQNU4RZQ2JBQCWQN43G", "WARC-Concurrent-To": "<urn:uuid:07b25a6d-8e3e-40db-a529-642b35e1ccab>", "WARC-Date": "2023-12-09T05:40:59Z", "WARC-IP-Address": "34.36.4.163", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:SPBQZEFIVCJAJ36K4CPIUYDGQA4N6N2W", "WARC-Record-ID": "<urn:uuid:d80b8b51-60af-4958-a7a2-a53536b10295>", "WARC-Target-URI": "https://byjus.com/question-answer/if-two-number-which-have-least-common-factor-3-and-2-respectively-are-added-find/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:419f675b-96b5-4e31-a914-86c13ba22291>" }, "warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-11\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, 11, 22, 33, 48, 63, 72, 73, 209, 210, 222, 231, 232, 279, 330, 386, 423, 424, 425, 430, 450, 460, 462, 479, 496, 525, 538, 553, 563, 568, 590, 603 ], "line_end_idx": [ 11, 22, 33, 48, 63, 72, 73, 209, 210, 222, 231, 232, 279, 330, 386, 423, 424, 425, 430, 450, 460, 462, 479, 496, 525, 538, 553, 563, 568, 590, 603, 631 ] }	{ "red_pajama_v2": { "ccnet_original_length": 631, "ccnet_original_nlines": 31, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2950819730758667, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04918032884597778, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14754098653793335, "rps_doc_frac_unique_words": 0.5899999737739563, "rps_doc_mean_word_length": 5.099999904632568, "rps_doc_num_sentences": 5, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 3.916471242904663, "rps_doc_word_count": 100, "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.0313725508749485, "rps_doc_frac_chars_top_3gram": 0.04117647185921669, "rps_doc_frac_chars_top_4gram": 0.05098038911819458, "rps_doc_books_importance": -62.98786544799805, "rps_doc_books_importance_length_correction": -74.61237335205078, "rps_doc_openwebtext_importance": -48.9400520324707, "rps_doc_openwebtext_importance_length_correction": -60.56455612182617, "rps_doc_wikipedia_importance": -38.06514358520508, "rps_doc_wikipedia_importance_length_correction": -49.68964767456055 }, "fasttext": { "dclm": 0.17763209342956543, "english": 0.8684927821159363, "fineweb_edu_approx": 1.9600632190704346, "eai_general_math": 0.80893874168396, "eai_open_web_math": 0.4076662063598633, "eai_web_code": 0.0001345899945590645 } }	{ "free_decimal_correspondence": { "primary": { "code": "512.7", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Algebra" } }, "secondary": { "code": "510", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-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": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
952,451,894,284,655,600	Clear Filters Clear Filters How o you work the phase difference between the input and the output of a sine wave? 4 views (last 30 days) Here is my code: n = 0:49; % These are the time indices input = 7cos(2pi0.125n+pi/3); input_a = 2input; input_b = 8cos(2pi0.25n); input_c = input_a + input_b; b = [5, -5]; % The filter coefficients y = conv(b,input); % The output signal y_a = conv(b,input_a); y_b = conv(b,input_b); y_c = conv(b,input_c); subplot(2,2,1); plot(input, 'b-'); % Plot the input as a blue line hold on; plot(y, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,2); plot(input_a, 'b-'); % Plot the input as a blue line hold on; plot(y_a, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,3); plot(input_b, 'b-'); % Plot the input as a blue line hold on; plot(y_b, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,4); plot(input_c, 'b*-'); % Plot the input as a blue line hold on; plot(y_c, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% How do i work the phase difference between the output of y_b to the input and the phase difference of y_c to the input. Accepted Answer Alan Moses Alan Moses on 2 Dec 2020 You may refer to this link posted in the answer to a similar question here. More Answers (0) Community Treasure Hunt Find the treasures in MATLAB Central and discover how the community can help you! Start Hunting!	{ "url": "https://nl.mathworks.com/matlabcentral/answers/665038-how-o-you-work-the-phase-difference-between-the-input-and-the-output-of-a-sine-wave", "source_domain": "nl.mathworks.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "118405", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OJEKGER3M64ZKNA45EFZCOL2AXPFL6TB", "WARC-Concurrent-To": "<urn:uuid:607879eb-3be3-4580-8755-a420fe5e865b>", "WARC-Date": "2024-05-19T20:14:55Z", "WARC-IP-Address": "23.34.160.82", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5PBCEUFGRSRSEJ7SMONCXPNSAZLUB6CB", "WARC-Record-ID": "<urn:uuid:030910df-5880-425c-8266-679f1dd3c567>", "WARC-Target-URI": "https://nl.mathworks.com/matlabcentral/answers/665038-how-o-you-work-the-phase-difference-between-the-input-and-the-output-of-a-sine-wave", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2925ec18-888b-40e4-aab7-7d6f78a9ad23>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-29\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 14, 28, 29, 114, 115, 138, 155, 194, 228, 247, 277, 306, 345, 384, 407, 430, 453, 469, 521, 530, 578, 587, 618, 654, 670, 724, 733, 783, 792, 823, 859, 875, 929, 938, 988, 997, 1028, 1064, 1080, 1134, 1143, 1193, 1202, 1233, 1269, 1322, 1442, 1443, 1459, 1460, 1471, 1496, 1572, 1573, 1590, 1591, 1615, 1616, 1698, 1699 ], "line_end_idx": [ 14, 28, 29, 114, 115, 138, 155, 194, 228, 247, 277, 306, 345, 384, 407, 430, 453, 469, 521, 530, 578, 587, 618, 654, 670, 724, 733, 783, 792, 823, 859, 875, 929, 938, 988, 997, 1028, 1064, 1080, 1134, 1143, 1193, 1202, 1233, 1269, 1322, 1442, 1443, 1459, 1460, 1471, 1496, 1572, 1573, 1590, 1591, 1615, 1616, 1698, 1699, 1713 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1713, "ccnet_original_nlines": 60, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.22173912823200226, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.002173909917473793, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.39347827434539795, "rps_doc_frac_unique_words": 0.42248061299324036, "rps_doc_mean_word_length": 4.379845142364502, "rps_doc_num_sentences": 11, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.249261856079102, "rps_doc_word_count": 258, "rps_doc_frac_chars_dupe_10grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_5grams": 0.428318589925766, "rps_doc_frac_chars_dupe_6grams": 0.428318589925766, "rps_doc_frac_chars_dupe_7grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_8grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_9grams": 0.37168142199516296, "rps_doc_frac_chars_top_2gram": 0.04955751821398735, "rps_doc_frac_chars_top_3gram": 0.07079645991325378, "rps_doc_frac_chars_top_4gram": 0.04601769894361496, "rps_doc_books_importance": -155.64939880371094, "rps_doc_books_importance_length_correction": -144.23321533203125, "rps_doc_openwebtext_importance": -113.65097045898438, "rps_doc_openwebtext_importance_length_correction": -113.65097045898438, "rps_doc_wikipedia_importance": -60.86747741699219, "rps_doc_wikipedia_importance_length_correction": -52.66584777832031 }, "fasttext": { "dclm": 0.9375750422477722, "english": 0.670007586479187, "fineweb_edu_approx": 3.0050201416015625, "eai_general_math": 0.9823891520500183, "eai_open_web_math": 0.7084409594535828, "eai_web_code": 0.6357186436653137 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "621.3822", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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,630,308,064,471,142,000	Math Concepts Math is often called the universal language because no matter where you're from, a better understanding of math means a better understanding of the world around you. Learn about math concepts such as addition, subtraction, fractions, ratios and more. Learn More You've probably seen supplementary angles examples in your everyday life without knowing it. Whether you pass a leaning sign on a flat highway or walk by a shed with a lean-to roof — whenever two angles combine to form a straight, linear pair, there they are. By Mitch Ryan Mathematicians use something called interval notation to convey information about a range of values in a way that's clear and easy to understand. This form of writing is necessary because intervals are common concepts in calculus, algebra and statistics. By Marie Look Fundamental trigonometric identities, aka trig identities or trigo identities, are equations involving trigonometric functions that hold true for any value you substitute into their variables. By Marie Look Advertisement Algebra is the branch of mathematics that focuses on formulas, and one of its key concepts is the representation of linear equations, which describe straight lines. By Marie Look Whether you're studying up for a math test, helping your child with homework or just trying to brush up before trivia night, learning the basic ins and outs of polygons will serve you well. By Mitch Ryan A rhombus is a parallelogram shape with two pairs of parallel sides and four equal sides. These four sides of equal length also define the rhombus as an equilateral quadrilateral. Etymologically, the name of this shape stems from the Greek word "rhombos," which roughly translates to "spinning top." By Mitch Ryan Greater than, less than, equal to: These terms are mathematical expressions that allow the user to compare two numbers or equations. Once you've become familiar with these terms — and the symbols used to represent them — you'll be able to apply them to various math problems. By Zach Taras Advertisement As you might recall from math class, fractions and decimals are two different ways of representing the same thing. A third option, percentages, is a close cousin of decimals. However, making use of this knowledge requires knowing how to convert one into the other. By Zach Taras A number line is a pictorial representation of real numbers. It is most commonly used in elementary math classes to help students compare numbers and perform arithmetic operations like addition, subtraction, division and multiplication. By Mitch Ryan Mean, median, mode and sometimes range, are all different methods for finding probability distribution in statistics. Range can be a helpful yardstick when calculating data values that are close together, but it can quickly become confusing if there is a wide gap between the smallest value and the largest number. By Mitch Ryan As a child, when trying to come up with the biggest number possible, you might have said "infinity plus one." While technically infinity is the largest number because you cannot run out of numbers, the biggest numbers that we know of are still difficult to count but a bit more quantifiable. By Yara Simón Advertisement Do you need to calculate the rate at which something changes over time? Whether it's the change in the x-value over the change in the y-value of a line on a graph, or the distance travelled by a car over the course of an hour-long drive, you'll need a rate of change formula. By Sascha Bos Physicists use the displacement formula to find an object's change in position. It sounds simple, but calculating displacement can quickly get complicated. By Sascha Bos Frequency is a fundamental concept when you're talking about waves, whether that means electromagnetic waves like radio waves and visible light, or mechanical vibrations like sound waves. By Marie Look The wavelength formula is a fundamental concept in physics, particularly in the study of waves and electromagnetic radiation. By Yara Simón Advertisement In math, few skills are as practical as knowing how to do long division. It's the art of breaking down complex problems into manageable steps, making it an essential tool for students and adults alike. By Desiree Bowie We get it: You need help with the parabola equation because those graphs won't draw themselves. Here's how to draw a parabola from an equation. By Yara Simón Trying to figure out whether your research problem would benefit from qualitative vs. quantitative data? Learn about the differences and uses of each. By Yara Simón Distinguishing between discrete vs. continuous data and situations that call for each data type is important in ensuring you get your desired results. By Marie Look Advertisement Whether you're a math whiz or not, there are some pretty cool number theories, beliefs and coincidences to appreciate. How down with digits are you? By Alia Hoyt The scutoid is kind of like the Higgs boson. Researchers theorized the new shape existed. And then they went looking for it. We'll show you both a quick and dirty way, and a precise, more complicated formula for converting Celsius to Fahrenheit (and vice versa). By Sydney Murphy & Austin Henderson Many people get speed and velocity confused. It's no surprise because the terms are often used interchangeably. But they're not quite the same thing. So how do you find the velocity of an object? By Mark Mancini Advertisement Sir Isaac Newton's Law of Universal Gravitation helps put the laws of gravity into a mathematical formula. And the gravitational constant is the "G" in that formula. By Mark Mancini Both degrees and radians represent the measure of an angle in geometry. So, how do you convert one to the other? By Mark Mancini	{ "url": "https://science.howstuffworks.com/math-concepts", "source_domain": "science.howstuffworks.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "240849", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FZETEU2O5QDBG4QC6K74LAIC64IR7ZE3", "WARC-Concurrent-To": "<urn:uuid:956e9eb4-ee3b-4121-8a85-485b255cddcc>", "WARC-Date": "2024-05-18T10:23:42Z", "WARC-IP-Address": "18.160.41.123", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6ZHQHWF5G4JS52CSRPEZHBLYKRNBB6IU", "WARC-Record-ID": "<urn:uuid:d0af4cc8-d8d4-465e-bd79-dc84e5c5f0fa>", "WARC-Target-URI": "https://science.howstuffworks.com/math-concepts", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c062d7c0-0bbf-4856-89fd-df0c12d6e782>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-80\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 14, 15, 266, 267, 278, 279, 539, 540, 554, 555, 810, 811, 825, 826, 1019, 1020, 1034, 1035, 1049, 1050, 1215, 1216, 1230, 1231, 1421, 1422, 1436, 1437, 1737, 1738, 1752, 1753, 2029, 2030, 2044, 2045, 2059, 2060, 2325, 2326, 2340, 2341, 2578, 2579, 2593, 2594, 2909, 2910, 2924, 2925, 3217, 3218, 3232, 3233, 3247, 3248, 3524, 3525, 3539, 3540, 3696, 3697, 3711, 3712, 3900, 3901, 3915, 3916, 4042, 4043, 4057, 4058, 4072, 4073, 4275, 4276, 4293, 4294, 4438, 4439, 4453, 4454, 4605, 4606, 4620, 4621, 4772, 4773, 4787, 4788, 4802, 4803, 4952, 4953, 4966, 4967, 5092, 5093, 5231, 5232, 5268, 5269, 5465, 5466, 5482, 5483, 5497, 5498, 5664, 5665, 5681, 5682, 5795, 5796 ], "line_end_idx": [ 14, 15, 266, 267, 278, 279, 539, 540, 554, 555, 810, 811, 825, 826, 1019, 1020, 1034, 1035, 1049, 1050, 1215, 1216, 1230, 1231, 1421, 1422, 1436, 1437, 1737, 1738, 1752, 1753, 2029, 2030, 2044, 2045, 2059, 2060, 2325, 2326, 2340, 2341, 2578, 2579, 2593, 2594, 2909, 2910, 2924, 2925, 3217, 3218, 3232, 3233, 3247, 3248, 3524, 3525, 3539, 3540, 3696, 3697, 3711, 3712, 3900, 3901, 3915, 3916, 4042, 4043, 4057, 4058, 4072, 4073, 4275, 4276, 4293, 4294, 4438, 4439, 4453, 4454, 4605, 4606, 4620, 4621, 4772, 4773, 4787, 4788, 4802, 4803, 4952, 4953, 4966, 4967, 5092, 5093, 5231, 5232, 5268, 5269, 5465, 5466, 5482, 5483, 5497, 5498, 5664, 5665, 5681, 5682, 5795, 5796, 5811 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5811, "ccnet_original_nlines": 114, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41720035672187805, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.003659649984911084, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11802379041910172, "rps_doc_frac_unique_words": 0.464550256729126, "rps_doc_mean_word_length": 4.955555438995361, "rps_doc_num_sentences": 53, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.526775360107422, "rps_doc_word_count": 945, "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.003843690035864711, "rps_doc_frac_chars_top_3gram": 0.011744610033929348, "rps_doc_frac_chars_top_4gram": 0.009395689703524113, "rps_doc_books_importance": -399.28204345703125, "rps_doc_books_importance_length_correction": -399.28204345703125, "rps_doc_openwebtext_importance": -246.41017150878906, "rps_doc_openwebtext_importance_length_correction": -246.41017150878906, "rps_doc_wikipedia_importance": -226.9707794189453, "rps_doc_wikipedia_importance_length_correction": -226.9707794189453 }, "fasttext": { "dclm": 0.7321977019309998, "english": 0.9345338940620422, "fineweb_edu_approx": 3.353630542755127, "eai_general_math": 0.9076784253120422, "eai_open_web_math": 0.48262977600097656, "eai_web_code": 0.021660389378666878 } }	{ "free_decimal_correspondence": { "primary": { "code": "510", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "" } }, "secondary": { "code": "516", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,620,178,875,285,434,000	homeaboutarchivenewslettermembership! aboutarchivemembership! aboutarchivemembers! kottke.org posts about Jason Snell Powered by Movable Type posted by Jason Kottke Jan 02, 2015 Jason Snell on the supreme uncoolness of Movable Type, the outdated blogging software that powers Snell’s site, Daring Fireball, and also kottke.org. Regardless, it turns out that software can also be considered uncool, even if it still works. Not only is Movable Type uncool —the equivalent of ’80s hair metal, but the language it’s written in, Perl, is supremely uncool. Like, New Kids on the Block uncool. The razzing John Siracusa takes about being a Perl developer isn’t really because Perl is old, or bad, but because it’s just not what the cool kids are talking about. The world has moved on. And yet, sometimes that old stuff still works, and is still the best tool for the job. Movable Type is often maddening and frustrating, but it’s familiar, behaves consistently, and I know it better than any other piece of software. In other words, MT is like a member of my family. The Macintosh is 30 years old today posted by Jason Kottke Jan 24, 2014 Apple is celebrating the 30th anniversary of the Macintosh with a special subsite. Incredible that the Mac is still around; the 90s were a dire time for Apple and it’s amazing to see the current fantastic iMacs and Macbooks that came after some epically bad mid-90s machines. Here’s Steve Jobs introducing the original Mac in 1984 (a snippet of the full introduction video): Steven Levy writes about covering the introduction of the Mac for Rolling Stone. First, I met the machine. From the instant the woman running the demo switched on that strange-looking contraption (inspired in part by the Cuisinart food processor), I knew the Macintosh would change millions of lives, including my own. To understand that, you must realize how much 1984 really was not like 2014. Until that point, personal computers were locked in an esoteric realm of codes and commands. They looked unfriendly, with the letters of text growing in sickly phosphorescence. Even the simplest tasks required memorizing the proper intonations, then executing several exacting steps. But the Macintosh was friendly. It opened with a smile. Words appeared with the clarity of text on a printed page - and for the first time, ordinary people had the power to format text as professional printers did. Selecting and moving text was made dramatically easier by the then-quaint mouse accompanying the keyboard. You could draw on it. This humble shoebox-sized machine had a simplicity that instantly empowered you. Here’s the piece Levy wrote for Rolling Stone. If you have had any prior experience with personal computers, what you might expect to see is some sort of opaque code, called a “prompt,” consisting of phosphorescent green or white letters on a murky background. What you see with Macintosh is the Finder. On a pleasant, light background (you can later change the background to any of a number of patterns, if you like), little pictures called “icons” appear, representing choices available to you. A word-processing program might be represented by a pen, while the program that lets you draw pictures might have a paintbrush icon. A file would represent stored documents - book reports, letters, legal briefs and so forth. To see a particular file, you’d move the mouse, which would, in turn, move the cursor to the file you wanted. You’d tap a button on the mouse twice, and the contents of the file would appear on the screen: dark on light, just like a piece of paper. Levy has also appended a never-seen-before transcript of his interview with Steve Jobs onto the Kindle version of Insanely Great, a book Levy wrote about the Mac. Dave Winer participated on a panel of developers on launch day. The rollout on January 24th was like a college graduation ceremony. There were the fratboys, the insiders, the football players, and developers played a role too. We praised their product, their achievement, and they showed off our work. Apple took a serious stake in the success of software on their platform. They also had strong opinions about how our software should work, which in hindsight were almost all good ideas. The idea of user interface standards were at the time controversial. Today, you’ll get no argument from me. It’s better to have one way to do things, than have two or more, no matter how much better the new ones are. That day, I was on a panel of developers, talking to the press about the new machine. We were all gushing, all excited to be there. I still get goosebumps thinking about it today. MacOS System 1.1 emulator. (via @gruber) iFixit did a teardown of the 128K Macintosh. Jason Snell interviewed several Apple execs about the 30th anniversary for MacWorld. (via df) What’s clear when you talk to Apple’s executives is that the company believes that people don’t have to choose between a laptop, a tablet, and a smartphone. Instead, Apple believes that every one of its products has particular strengths for particular tasks, and that people should be able to switch among them with ease. This is why the Mac is still relevant, 30 years on-because sometimes a device with a keyboard and a trackpad is the best tool for the job. “It’s not an either/or,” Schiller said. “It’s a world where you’re going to have a phone, a tablet, a computer, you don’t have to choose. And so what’s more important is how you seamlessly move between them all…. It’s not like this is a laptop person and that’s a tablet person. It doesn’t have to be that way.” Snell previously interviewed Steve Jobs on the 20th anniversary of the Mac, which includes an essay that Jobs wrote for the very first issue of Macworld in 1984: The Macintosh is the future of Apple Computer. And it’s being done by a bunch of people who are incredibly talented but who in most organizations would be working three levels below the impact of the decisions they’re making in the organization. It’s one of those things that you know won’t last forever. The group might stay together maybe for one more iteration of the product, and then they’ll go their separate ways. For a very special moment, all of us have come together to make this new product. We feel this may be the best thing we’ll ever do with our lives. Here’s a look inside that first MacWorld issue. As always, Folklore.org is an amazing source for stories about the Mac told by the folks who were there. Susan Kare designed the icons, the interface elements, and fonts for the original Macintosh. Have a look at her Apple portfolio or buy some prints of the original Mac icons. Stephen Fry recounts his experience with the Mac, including the little tidbit that he and Douglas Adams bought the first two Macs in Europe (as far as he knows). I like to claim that I bought the second Macintosh computer ever sold in Europe in that January, 30 years ago. My friend and hero Douglas Adams was in the queue ahead of me. For all I know someone somewhere had bought one ten minutes earlier, but these were the first two that the only shop selling them in London had in stock on the 24th January 1984, so I’m sticking to my story. Review of the Mac in the NY Times from 1984. The Next Web has an interview with Daniel Kottke (no relation) and Randy Wigginton on programming the original Mac. TNW: When you look at today’s Macs, as well as the iPhone and the iPad, do you see how it traces back to that original genesis? Randy: It was more of a philosophy - let’s bring the theoretical into now - and the focus was on the user, not on the programmer. Before then it had always been let’s make it so programmers can do stuff and produce programs. Here, it was all about the user, and the programmers had to work their asses off to make it easy for the user to do what they wanted. It was the principle of least surprise. We never wanted [the Macintosh] to do something that people were shocked at. These are things that we just take for granted now. The whole undo paradigm? It didn’t exist before that. Like Daniel says, it’s definitely the case that there were academic and business places with similar technology, but they had never attempted to reach a mass market. Daniel: I’m just struck by the parallel now, thinking about what the Mac did. The paradigm before the Mac in terms of Apple products was command-line commands in the Apple II and the Apple III. In the open source world of Linux, I’m messing around with Raspberry Pis now, and it terrifies me, because I think, “This is not ready for the consumer,” but then I think about Android, which is built on top of Linux. So the Macintosh did for the Apple II paradigm what Android has done for Linux. A week after Jobs unveiled the Mac at the Apple shareholders meeting, he did the whole thing again at a meeting of the Boston Computer Society. Time has the recently unearthed video of the event.	{ "url": "https://kottke.org/tag/Jason%20Snell", "source_domain": "kottke.org", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "21969", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:EWR3IDAJQNP45DVIBIZFL4372GW2RXQZ", "WARC-Concurrent-To": "<urn:uuid:0d7fa7de-c3e3-45b1-a7b0-6c74930e6b74>", "WARC-Date": "2022-11-27T02:08:52Z", "WARC-IP-Address": "162.247.141.135", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:KA6KE3TIIW6OHJ7PEUZCWVDZJ32IQ46E", "WARC-Record-ID": "<urn:uuid:b2789fb3-65f6-4557-a799-206cb0169d09>", "WARC-Target-URI": "https://kottke.org/tag/Jason%20Snell", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3d221e63-89a5-4a81-9bf3-10d2f5fdf900>" }, "warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 38, 62, 83, 84, 119, 120, 144, 145, 183, 184, 334, 335, 785, 786, 873, 874, 1069, 1070, 1106, 1107, 1145, 1146, 1229, 1230, 1522, 1523, 1604, 1605, 2204, 2205, 2630, 2631, 2678, 2679, 3603, 3604, 3767, 3768, 3832, 3833, 4474, 4475, 4655, 4656, 4697, 4698, 4743, 4744, 4838, 4839, 5300, 5301, 5613, 5614, 5776, 5777, 6345, 6346, 6394, 6395, 6500, 6501, 6675, 6676, 6838, 6839, 7221, 7222, 7267, 7268, 7384, 7385, 7513, 7514, 7739, 7740, 8097, 8098, 8264, 8265, 8757, 8758 ], "line_end_idx": [ 38, 62, 83, 84, 119, 120, 144, 145, 183, 184, 334, 335, 785, 786, 873, 874, 1069, 1070, 1106, 1107, 1145, 1146, 1229, 1230, 1522, 1523, 1604, 1605, 2204, 2205, 2630, 2631, 2678, 2679, 3603, 3604, 3767, 3768, 3832, 3833, 4474, 4475, 4655, 4656, 4697, 4698, 4743, 4744, 4838, 4839, 5300, 5301, 5613, 5614, 5776, 5777, 6345, 6346, 6394, 6395, 6500, 6501, 6675, 6676, 6838, 6839, 7221, 7222, 7267, 7268, 7384, 7385, 7513, 7514, 7739, 7740, 8097, 8098, 8264, 8265, 8757, 8758, 8953 ] }	{ "red_pajama_v2": { "ccnet_original_length": 8953, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.45551982522010803, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012325829826295376, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15005359053611755, "rps_doc_frac_unique_words": 0.40800514817237854, "rps_doc_mean_word_length": 4.6055521965026855, "rps_doc_num_sentences": 95, "rps_doc_symbol_to_word_ratio": 0.0005359100177884102, "rps_doc_unigram_entropy": 5.676567077636719, "rps_doc_word_count": 1549, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.01738155074417591, "rps_doc_frac_chars_dupe_6grams": 0.005606949795037508, "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.008410429581999779, "rps_doc_frac_chars_top_3gram": 0.0058872997760772705, "rps_doc_frac_chars_top_4gram": 0.0053265998139977455, "rps_doc_books_importance": -892.8468017578125, "rps_doc_books_importance_length_correction": -892.8468017578125, "rps_doc_openwebtext_importance": -537.1056518554688, "rps_doc_openwebtext_importance_length_correction": -537.1056518554688, "rps_doc_wikipedia_importance": -401.6788330078125, "rps_doc_wikipedia_importance_length_correction": -401.6788330078125 }, "fasttext": { "dclm": 0.020512999966740608, "english": 0.9682019352912903, "fineweb_edu_approx": 1.768541932106018, "eai_general_math": 0.13343262672424316, "eai_open_web_math": 0.1899736523628235, "eai_web_code": 0.034288350492715836 } }	{ "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.17", "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": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
2,248,143,414,631,939,300	write_attribute snippets ActiveRecord's write_attribute is deprecated Tagged write_attribute, attributes Languages ruby ActiveRecord's write_attribute is deprecated, so now you only have one hundred other ways of assigning attributes. My favorite for dynamic assignment of attributes is: class Dog def crap=(poo) self[:trash] = poo # don't try to use self.attributes[:trash] here you fool. end def crap self[:trash] # don't try to use self.attributes[:trash] here you fool. end end	{ "url": "https://snippets.aktagon.com/tags/1194-write-attribute", "source_domain": "snippets.aktagon.com", "snapshot_id": "crawl=CC-MAIN-2017-51", "warc_metadata": { "Content-Length": "76575", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:AR5TD7V5342NJVRKCBUNCZ673DDWA5I2", "WARC-Concurrent-To": "<urn:uuid:5f1c7223-bbd8-4bf8-b2e9-2ab4f8189511>", "WARC-Date": "2017-12-17T19:27:14Z", "WARC-IP-Address": "46.101.219.176", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JCKU7ANVTD2JV22SGEDC6WKUUCN6VDWY", "WARC-Record-ID": "<urn:uuid:9177a787-66e0-4a39-8f51-ce6bb6a22dbc>", "WARC-Target-URI": "https://snippets.aktagon.com/tags/1194-write-attribute", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ce67725e-eab0-4624-acfe-e9f67c05d505>" }, "warc_info": "robots: classic\r\nhostname: ip-10-101-239-49.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 25, 26, 71, 72, 123, 124, 239, 240, 293, 294, 304, 321, 403, 409, 410, 421, 497, 503 ], "line_end_idx": [ 25, 26, 71, 72, 123, 124, 239, 240, 293, 294, 304, 321, 403, 409, 410, 421, 497, 503, 506 ] }	{ "red_pajama_v2": { "ccnet_original_length": 506, "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.31313130259513855, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2525252401828766, "rps_doc_frac_unique_words": 0.6349206566810608, "rps_doc_mean_word_length": 6.063492298126221, "rps_doc_num_sentences": 6, "rps_doc_symbol_to_word_ratio": 0.020202020183205605, "rps_doc_unigram_entropy": 3.5818004608154297, "rps_doc_word_count": 63, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_6grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_7grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_8grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_9grams": 0.23560209572315216, "rps_doc_frac_chars_top_2gram": 0.141361266374588, "rps_doc_frac_chars_top_3gram": 0.1518324613571167, "rps_doc_frac_chars_top_4gram": 0.2041884809732437, "rps_doc_books_importance": -54.61273956298828, "rps_doc_books_importance_length_correction": -64.69824981689453, "rps_doc_openwebtext_importance": -27.4366455078125, "rps_doc_openwebtext_importance_length_correction": -37.522159576416016, "rps_doc_wikipedia_importance": -4.6787238121032715, "rps_doc_wikipedia_importance_length_correction": -14.764236450195312 }, "fasttext": { "dclm": 0.6502311825752258, "english": 0.7402909398078918, "fineweb_edu_approx": 2.0667684078216553, "eai_general_math": 0.9990977048873901, "eai_open_web_math": 0.28738319873809814, "eai_web_code": 0.7416796088218689 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-7,848,104,709,622,119,000	Jump to content lucascai992 Members • Content count 7 • Joined • Last visited Community Reputation 0 Neutral About lucascai992 1. and the reason for blocking the account? It truly is sad they banned a character level 22 shillen Oracle with a magestaff and 100k in the inventory, I still do not understand how you can be so sure that you use external programs. 1° the character never formed a party. 2° I banned the support and not the wizard. 3° Both characters never shared an area. 4° was 1 hour after having bought 400Ncoins in the account. 5° character level 22: / What does it cost me to do the character again? the truth that nothing will waste 1 night doing it and after that? another ban for no reason? What will happen next I reach level 40, invest time and others so that everything ends in the same way? It really is a shame. Regards 2. Maybe you do not understand the meaning of the email, since my language is Spanish and Google translates what it can. they are telling me that they did not find errors in the account, but they prefer to ban my account? I do not understand... admit that it is badly blocked and still decide to take away my access? I really do not understand it. 3. Banned Account :/ If I already send mails, I returned to answer what I posted here but now it's time to wait. What crime are you talking about? I do not use any kind of good programs I'll keep trying by mail .. Thanks for taking the time to answer me 4. Accounts Closed for Illegal Third-Party Programs I was a victim of mass bans. I signed the account without evidence for this issue "use third party program" the character was shillen oracle level 21 - 22 always raised level independently the character was never in party never play in party only game solitaire, my main character is a level 20 dark wizard I did the same as with the shillen oracle level up without a party independently ... it is a pity this wave of random bans because many times the victims are the ones who just started playing ... The maximum I got together with both chares was 1 Mage Staff ... so it was a pleasure to play lineage 2 again since gz x1 c4 that I was not playing. many years, no ?. Now I have to worry about 1 hour or 2 before they block access to the account I bought 400 Ncoins ...: / 5. Banned Account :/ I was a victim of mass bans. I signed the account without evidence for this issue "use third party program" the character was shillen oracle level 21 - 22 always raised level independently the character was never in party never play in party only game solitaire, my main character is a level 20 dark wizard I did the same as with the shillen oracle level up without a party independently ... it is a pity this wave of random bans because many times the victims are the ones who just started playing ... The maximum I got together with both chares was 1 Mage Staff ... so it was a pleasure to play lineage 2 again since gz x1 c4 that I was not playing. many years, no ?. Now I have to worry about 1 hour or 2 before they block access to the account I bought 400 Ncoins ...: / sorry for Google translator 6. Wrong acc blocked I think that happened to me, after 1 hour of buying nccoins they banned me the support account 7. Ban on using box ? I just spent the same just 1 hour after having bought 400Ncoins and also my backpack, I had the wizard in gludio sitting and killing mobs with the Shillen Oracle: /. I do not think it has to do with the internet crashes that I had just that I do not know, layers! I try to take it easy ×	{ "url": "https://forums.lineage2.com/profile/32322-lucascai992/", "source_domain": "forums.lineage2.com", "snapshot_id": "crawl=CC-MAIN-2020-24", "warc_metadata": { "Content-Length": "49578", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:33DGHLPFMI3YCOHS46ZI6PIM6YZQDY3Z", "WARC-Concurrent-To": "<urn:uuid:6a15670b-8131-4061-be76-b8d556813190>", "WARC-Date": "2020-05-26T05:35:24Z", "WARC-IP-Address": "50.112.176.34", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JFAKJIFWMKORBJC4RVQJJTSEN7NWNIFO", "WARC-Record-ID": "<urn:uuid:6f752409-7145-410b-bb5c-965f22e86f00>", "WARC-Target-URI": "https://forums.lineage2.com/profile/32322-lucascai992/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9305e595-c8cd-41a0-8acc-b4e3472c8483>" }, "warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-52.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, 16, 17, 29, 30, 38, 56, 57, 63, 74, 75, 92, 93, 114, 115, 125, 126, 144, 145, 191, 192, 870, 1220, 1243, 1244, 1481, 1535, 1536, 2315, 2338, 2339, 3146, 3169, 3170, 3269, 3293, 3294, 3584 ], "line_end_idx": [ 16, 17, 29, 30, 38, 56, 57, 63, 74, 75, 92, 93, 114, 115, 125, 126, 144, 145, 191, 192, 870, 1220, 1243, 1244, 1481, 1535, 1536, 2315, 2338, 2339, 3146, 3169, 3170, 3269, 3293, 3294, 3584, 3585 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3585, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4385964870452881, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04183536022901535, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15789474546909332, "rps_doc_frac_unique_words": 0.3640483319759369, "rps_doc_mean_word_length": 4.146525859832764, "rps_doc_num_sentences": 44, "rps_doc_symbol_to_word_ratio": 0.012145750224590302, "rps_doc_unigram_entropy": 4.987347602844238, "rps_doc_word_count": 662, "rps_doc_frac_chars_dupe_10grams": 0.437158465385437, "rps_doc_frac_chars_dupe_5grams": 0.45974498987197876, "rps_doc_frac_chars_dupe_6grams": 0.45974498987197876, "rps_doc_frac_chars_dupe_7grams": 0.437158465385437, "rps_doc_frac_chars_dupe_8grams": 0.437158465385437, "rps_doc_frac_chars_dupe_9grams": 0.437158465385437, "rps_doc_frac_chars_top_2gram": 0.025500910356640816, "rps_doc_frac_chars_top_3gram": 0.021857919171452522, "rps_doc_frac_chars_top_4gram": 0.021857919171452522, "rps_doc_books_importance": -353.689453125, "rps_doc_books_importance_length_correction": -353.689453125, "rps_doc_openwebtext_importance": -186.74757385253906, "rps_doc_openwebtext_importance_length_correction": -186.74757385253906, "rps_doc_wikipedia_importance": -189.16261291503906, "rps_doc_wikipedia_importance_length_correction": -189.16261291503906 }, "fasttext": { "dclm": 0.02399688959121704, "english": 0.9747446775436401, "fineweb_edu_approx": 0.7997258901596069, "eai_general_math": 0.07236695289611816, "eai_open_web_math": 0.09052705764770508, "eai_web_code": 0.030909599736332893 } }	{ "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": "343.73", "labels": { "level_1": "Social sciences", "level_2": "Law", "level_3": "Criminal law" } } }, "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": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "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
-8,728,035,997,791,549,000	DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus Enum Definition The result of the pairing action with an Association Endpoint (AEP) device object. For more information about AEP objects, see DeviceInformationKind. public : enum class DevicePairingResultStatus enum class winrt::Windows::Devices::Enumeration::DevicePairingResultStatus : int32_t public enum DevicePairingResultStatus Public Enum DevicePairingResultStatus var value = Windows.Devices.Enumeration.DevicePairingResultStatus.accessDenied; Attributes Windows 10 requirements Device family Windows 10 (introduced v10.0.10240.0) API contract Windows.Foundation.UniversalApiContract (introduced v1) Fields AccessDenied AccessDenied AccessDenied AccessDenied AccessDenied 12 Your application does not have the appropriate permissions level to pair the device object. AlreadyPaired AlreadyPaired AlreadyPaired AlreadyPaired AlreadyPaired 3 The device object has already been paired. AuthenticationFailure AuthenticationFailure AuthenticationFailure AuthenticationFailure AuthenticationFailure 9 Authentication failed, so the device is not paired. Either the device object or the application rejected the authentication. AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed 8 The authentication protocol is not supported, so the device is not paired. AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout 7 The authentication process timed out before it could complete. ConnectionRejected ConnectionRejected ConnectionRejected ConnectionRejected ConnectionRejected 4 The device object rejected the connection. Failed Failed Failed Failed Failed 19 An unknown failure occurred. HardwareFailure HardwareFailure HardwareFailure HardwareFailure HardwareFailure 6 The device object indicated there was a hardware failure. InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData 13 The ceremony data was incorrect. NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles 10 There are no network profiles for this device object to use. NotPaired NotPaired NotPaired NotPaired NotPaired 2 The device object is not currently paired. NotReadyToPair NotReadyToPair NotReadyToPair NotReadyToPair NotReadyToPair 1 The device object is not in a state where it can be paired. OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress 15 The device object is already attempting to pair or unpair. Paired Paired Paired Paired Paired 0 The device object is now paired. PairingCanceled PairingCanceled PairingCanceled PairingCanceled PairingCanceled 14 The pairing action was canceled before completion. ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet 11 The minimum level of protection is not supported by the device object or the application. RejectedByHandler RejectedByHandler RejectedByHandler RejectedByHandler RejectedByHandler 17 The application handler rejected the pairing. RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation 18 The remove device already has an association. RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered 16 Either the event handler wasn't registered or a required DevicePairingKinds was not supported. TooManyConnections TooManyConnections TooManyConnections TooManyConnections TooManyConnections 5 The device object indicated it cannot accept any more incoming connections. Remarks Version history Windows version SDK version Value added 1511 10586 Failed 1511 10586 OperationAlreadyInProgress 1511 10586 PairingCanceled 1511 10586 RejectedByHandler 1511 10586 RemoteDeviceHasAssociation 1511 10586 RequiredHandlerNotRegistered	{ "url": "https://docs.microsoft.com/en-us/uwp/api/windows.devices.enumeration.devicepairingresultstatus", "source_domain": "docs.microsoft.com", "snapshot_id": "crawl=CC-MAIN-2019-35", "warc_metadata": { "Content-Length": "52009", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FWKLOHF2HT7PAJKCKRSBZTTBNKSJ535T", "WARC-Concurrent-To": "<urn:uuid:1eced483-0fcb-467e-88d2-4ed455a40943>", "WARC-Date": "2019-08-22T10:28:24Z", "WARC-IP-Address": "104.108.100.37", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WTHLL4A3A5Q5VOPQ7N62FLMVCPT6KJIX", "WARC-Record-ID": "<urn:uuid:879a2666-15d2-4f9b-8949-c0d09362de3c>", "WARC-Target-URI": "https://docs.microsoft.com/en-us/uwp/api/windows.devices.enumeration.devicepairingresultstatus", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f3e24f2d-4f64-47cd-86e4-bd4f5a636a7b>" }, "warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-188.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 135, 136, 147, 148, 298, 299, 345, 430, 468, 506, 586, 597, 598, 622, 623, 637, 675, 688, 744, 745, 752, 753, 821, 822, 914, 915, 987, 988, 1031, 1032, 1144, 1145, 1270, 1271, 1398, 1399, 1474, 1475, 1587, 1588, 1651, 1652, 1749, 1750, 1793, 1794, 1832, 1833, 1862, 1863, 1945, 1946, 2004, 2005, 2108, 2109, 2142, 2143, 2246, 2247, 2308, 2309, 2361, 2362, 2405, 2406, 2483, 2484, 2544, 2545, 2683, 2684, 2743, 2744, 2781, 2782, 2815, 2816, 2899, 2900, 2951, 2952, 3100, 3101, 3191, 3192, 3285, 3286, 3332, 3333, 3471, 3472, 3518, 3519, 3667, 3668, 3763, 3764, 3861, 3862, 3938, 3939, 3947, 3948, 3964, 3965, 4005, 4023, 4061, 4088, 4117, 4155 ], "line_end_idx": [ 135, 136, 147, 148, 298, 299, 345, 430, 468, 506, 586, 597, 598, 622, 623, 637, 675, 688, 744, 745, 752, 753, 821, 822, 914, 915, 987, 988, 1031, 1032, 1144, 1145, 1270, 1271, 1398, 1399, 1474, 1475, 1587, 1588, 1651, 1652, 1749, 1750, 1793, 1794, 1832, 1833, 1862, 1863, 1945, 1946, 2004, 2005, 2108, 2109, 2142, 2143, 2246, 2247, 2308, 2309, 2361, 2362, 2405, 2406, 2483, 2484, 2544, 2545, 2683, 2684, 2743, 2744, 2781, 2782, 2815, 2816, 2899, 2900, 2951, 2952, 3100, 3101, 3191, 3192, 3285, 3286, 3332, 3333, 3471, 3472, 3518, 3519, 3667, 3668, 3763, 3764, 3861, 3862, 3938, 3939, 3947, 3948, 3964, 3965, 4005, 4023, 4061, 4088, 4117, 4155, 4194 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4194, "ccnet_original_nlines": 112, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19264069199562073, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008658009581267834, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18831169605255127, "rps_doc_frac_unique_words": 0.39949747920036316, "rps_doc_mean_word_length": 9.271356582641602, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.616979122161865, "rps_doc_word_count": 398, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.03956640139222145, "rps_doc_frac_chars_dupe_6grams": 0.02872629091143608, "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.04227641969919205, "rps_doc_frac_chars_top_3gram": 0.04471544921398163, "rps_doc_frac_chars_top_4gram": 0.018428180366754532, "rps_doc_books_importance": -255.70248413085938, "rps_doc_books_importance_length_correction": -255.70248413085938, "rps_doc_openwebtext_importance": -120.30049896240234, "rps_doc_openwebtext_importance_length_correction": -120.30049896240234, "rps_doc_wikipedia_importance": -83.91883087158203, "rps_doc_wikipedia_importance_length_correction": -83.91883087158203 }, "fasttext": { "dclm": 0.02885317988693714, "english": 0.6765401363372803, "fineweb_edu_approx": 1.5706846714019775, "eai_general_math": 0.013141389936208725, "eai_open_web_math": 0.028502289205789566, "eai_web_code": 0.5309188961982727 } }	{ "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": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-5,736,311,233,549,987,000	Questions & Answers • Is SAP really a WMS as PKMS WMS? Or is it really a ERP? ERP are resource planning software and it seem that a lot of people get ERP mix-up with WMS and they purchase a software that does not meet it's real needs due to this confusion. So tell me is SAP really and WMS or just an ERP that allows you to manage some warehouse data mainly utilize for... wsimmons5 pointsBadges: • Can anyone tell me how does an OS function? Can anyone tell me how does an operating system function? waavar5 pointsBadges: • IFS Folder Security How do I secure an IFS folder? DBHP4504015 pointsBadges: • CPF5032 member already locked to this job I have a program written in RPGLE which calls numerous other programs. These programs all share similar files. In my main program, when trying to read a particular file, I get error CPF5032 even though I unlock the file right before I do the setll reade. As a result, I figured the lock must be... GHENDER215 pointsBadges: • Why was our Yahoo sevice suspended? Our business accessed our email through AT&T Yahoo. Without notice we were blocked and were unable to sign in. We received this message on our screen: YOUR INTERNET SERVICES HAVE BEEN SUSPENDED DUE TO VIOLATION OF THE AT&T YAHOO! TERMS OF SERVICE. How can I find out what happened and why?... Astridtylerwolfe5 pointsBadges: • SWP Traffic Management How do I write SWP Traffic management? peterfong15 pointsBadges: • I can’t find password protection manager on my Sony hd-e1 hard disk I reinstalled Windows 7 64-bit. After that I could not find password protection manager.exe on my Sony hd-e1 hard disk to unlock the secure portion of my hard disk. Please help. Shashank0045 pointsBadges: • Missing default apps on BlackBerry Z10 I'm using BlackBerry Z10. A few days back, I installed 10.3.1.634. And the issue came to see is, the OS has missing many default apps e.g. File manager Calculator Compass Video Pictures And many others Facebook and Twitter apps or also not working. Please help me out hot to locate apps and redress... harshitbhatia695 pointsBadges: • Create integrated chips for manufacturing laptop We want to create a laptop with the help of integrated chips. How can we create chips for a manufacturing laptop? 99899469945 pointsBadges: • LNK file on Mac A PC user sent me a video project in a LNK file that she wants me to view. I'm on a Mac. Is that possible? ChrisFlx5 pointsBadges: • IFS Access using Windows 10 For the last 3 years I've been able to access the IFS using my Windows 10 account firstname.lastname@outlook.com with no problem. We recently hired a new using who required access to the IFS using Windows 10. The new user, nor myself can access anything on the IFS with the outlook.com login, but we... DLM2007295 pointsBadges: • List of companies migrated from iSeries to some other platform Hi all, Can someone have list of some major companies which migrated from iSeries to any other platform? Regards, hunshabbir72,805 pointsBadges: • Password protect Dropbox directory I always use Dropbox and I have to start using it on my work PC. But I need to prevent the other employees from being able to access those files. Can I password protect my directory on my PC? Thanks! ITKE407,640 pointsBadges: • File size more than 180 GB for the data extracted from an internal table If I'm getting a file size more than 180 GB for the data extracted from an internal table. How do I resolve this issue? prateekdevnani5 pointsBadges: • Qrmtsign FRCSIGNON Hi, I want stay in level FRCSIGNON in system value but I have a web application who asks me to change in VERIFY. Is it possible to stay FRCSIGNON? Thanks S.Brossard Brossard5 pointsBadges: • NAP infrastructure for barrier to network access Which NAP infrastructure component serves as a barrier to network access? wilsonb5 pointsBadges: • How to use VCM research to determine how we can capture reports to ensure compliance Which reports in VCM are affected by Sarbanes-Oxley Act? jg97345 pointsBadges: • My LG10 micro controlled device Is there a scan that will tell me if someone is controlling my phone? Karma325 pointsBadges: • Source code for checking valid password in VB What's the source code for checking valid and invalid password in vb kkknfrnds5 pointsBadges: • Getting error on TempDB – how to resolve? The database consistency IO error on "path\tempdb.mdf" every day this error are getting we run the DBCC checkdb (TempDB) but no error why this error getting triggered. edwinjhoffer3,205 pointsBadges: Forgot Password No problem! Submit your e-mail address below. We'll send you an e-mail containing your password. Your password has been sent to: To follow this tag... There was an error processing your information. Please try again later. REGISTER or login: Forgot Password? By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy Thanks! We'll email you when relevant content is added and updated. Following	{ "url": "http://itknowledgeexchange.techtarget.com/itanswers/page/60/?offer=whp", "source_domain": "itknowledgeexchange.techtarget.com", "snapshot_id": "crawl=CC-MAIN-2016-22", "warc_metadata": { "Content-Length": "153598", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JV32YY6FTUO7E3RBNIBL5BG7OY3BC57Z", "WARC-Concurrent-To": "<urn:uuid:b769ebce-16a6-4cb6-b5d0-205e4a8ac274>", "WARC-Date": "2016-05-30T19:06:54Z", "WARC-IP-Address": "206.19.49.162", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:22ED7WG4BLJXCJW5WGGCTONKJKVRFVQQ", "WARC-Record-ID": "<urn:uuid:5ca48274-f13c-44bb-986a-92c848029035>", "WARC-Target-URI": "http://itknowledgeexchange.techtarget.com/itanswers/page/60/?offer=whp", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d4ade089-907c-4d8d-8fc5-b2ddbf300659>" }, "warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 20, 21, 81, 82, 381, 382, 410, 458, 459, 521, 522, 548, 572, 573, 608, 609, 639, 685, 686, 988, 989, 1018, 1058, 1059, 1357, 1358, 1394, 1421, 1422, 1465, 1466, 1496, 1568, 1569, 1751, 1752, 1783, 1826, 1827, 2133, 2134, 2169, 2222, 2223, 2341, 2342, 2372, 2392, 2393, 2504, 2505, 2533, 2565, 2566, 2873, 2874, 2903, 2970, 2971, 3089, 3090, 3125, 3164, 3165, 3369, 3370, 3400, 3477, 3478, 3602, 3603, 3637, 3661, 3662, 3834, 3835, 3863, 3916, 3917, 3995, 3996, 4023, 4112, 4113, 4174, 4175, 4201, 4237, 4238, 4312, 4313, 4340, 4390, 4391, 4464, 4465, 4494, 4540, 4541, 4713, 4714, 4750, 4751, 4767, 4768, 4865, 4866, 4898, 4899, 4921, 4922, 4994, 4995, 5014, 5015, 5032, 5251, 5252, 5320, 5321 ], "line_end_idx": [ 20, 21, 81, 82, 381, 382, 410, 458, 459, 521, 522, 548, 572, 573, 608, 609, 639, 685, 686, 988, 989, 1018, 1058, 1059, 1357, 1358, 1394, 1421, 1422, 1465, 1466, 1496, 1568, 1569, 1751, 1752, 1783, 1826, 1827, 2133, 2134, 2169, 2222, 2223, 2341, 2342, 2372, 2392, 2393, 2504, 2505, 2533, 2565, 2566, 2873, 2874, 2903, 2970, 2971, 3089, 3090, 3125, 3164, 3165, 3369, 3370, 3400, 3477, 3478, 3602, 3603, 3637, 3661, 3662, 3834, 3835, 3863, 3916, 3917, 3995, 3996, 4023, 4112, 4113, 4174, 4175, 4201, 4237, 4238, 4312, 4313, 4340, 4390, 4391, 4464, 4465, 4494, 4540, 4541, 4713, 4714, 4750, 4751, 4767, 4768, 4865, 4866, 4898, 4899, 4921, 4922, 4994, 4995, 5014, 5015, 5032, 5251, 5252, 5320, 5321, 5330 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5330, "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.3469785451889038, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09259258955717087, "rps_doc_frac_lines_end_with_ellipsis": 0.04958678036928177, "rps_doc_frac_no_alph_words": 0.16764132678508759, "rps_doc_frac_unique_words": 0.43822842836380005, "rps_doc_mean_word_length": 4.748251914978027, "rps_doc_num_sentences": 70, "rps_doc_symbol_to_word_ratio": 0.005847950000315905, "rps_doc_unigram_entropy": 5.457776069641113, "rps_doc_word_count": 858, "rps_doc_frac_chars_dupe_10grams": 0.02896416001021862, "rps_doc_frac_chars_dupe_5grams": 0.06332842260599136, "rps_doc_frac_chars_dupe_6grams": 0.050564561039209366, "rps_doc_frac_chars_dupe_7grams": 0.04074620082974434, "rps_doc_frac_chars_dupe_8grams": 0.02896416001021862, "rps_doc_frac_chars_dupe_9grams": 0.02896416001021862, "rps_doc_frac_chars_top_2gram": 0.06062838062644005, "rps_doc_frac_chars_top_3gram": 0.0044182599522173405, "rps_doc_frac_chars_top_4gram": 0.00736377015709877, "rps_doc_books_importance": -425.283935546875, "rps_doc_books_importance_length_correction": -425.283935546875, "rps_doc_openwebtext_importance": -266.88775634765625, "rps_doc_openwebtext_importance_length_correction": -266.88775634765625, "rps_doc_wikipedia_importance": -121.8194580078125, "rps_doc_wikipedia_importance_length_correction": -121.8194580078125 }, "fasttext": { "dclm": 0.05462675914168358, "english": 0.9063687920570374, "fineweb_edu_approx": 1.2736009359359741, "eai_general_math": 0.01864599995315075, "eai_open_web_math": 0.08056288957595825, "eai_web_code": 0.0050112600438296795 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,056,083,393,921,533,000	Having problems with your PC Desktops ? I didnt get a boot disc with my computer and would like to make a copy Answers : On a new computer that didn't come with a reboot disk, they create a hidden partition on the hard drive to store this info. Provided that the hard drive has NEVER been re-formatted, it will still be there. Some manufatuers allow you to make a boot disk, others don't, in either case they do allow you to wipe your system and re-install their software at bootup. Hope this helps. Repair Help & Product Troubleshooting for PC Desktops Tips for a great answer: - Provide details, support with references or personal experience . - If you need clarification, ask it in the comment box . - It's 100% free, no registration required. Suggested Questions/Answers : How to install windows OS on Samsung N128 netbook My Windows XP installation has reached its half-life. (You do\015\012know that Windows has a half-life, don’t you? Every installation of\015\012Windows naturally degrades along a logarithmic curve until it becomes\015\012annoying, then ... Samsung N120-12GBK Netbook Missing NTLDR file The first thing to do is try to change back whatever hardware or software change you just made (this could be as simple as leaving a floppy disk in the drive or you need to reseat the IDE cables). If the contents of the drive are especially important ... ASUS Eee PC 2G Surf Notebook Reloading windows xp Replacement Drive? If you are talking about a Hard Drive the answer is: You can buy any hard drive as long as it is the same type from any computer store. Take your Hard Drive to the store and tell the sales person that you want another hard drive ... Dell Dimension 4600 PC Desktop The computer is asking for system diskette,what should i do? Are their any disks in the CD/DVD or the floppy drives? That would cause this. It is the most common cause. Is S.M.A.R.T. turned on in the BIOS? You will see a message during the POST that says it is enabled or disabled. The POST is the " ... Acer Veriton 7100 PC Desktop Windows failed to start !... Hello\015\012\015\012You seem to know a bit about computer so I will give you a good detailed solution which might be of help. READ CAREFULLY\015\012\015\012ASSUMPTION:\015\012 \015\012I guess that t ... Acer Aspire 5920-6727 Notebook Re: your suggestion for my Dell Lattitude D600 Hard Drive Problem Ok, now we have some good discourse! While I'd always prefer to use a friend's laptop to test my fringe hypotheses, having your own is a fine option too. And it sounds like you have an enclosure too, so you are pretty much all set. It's r ... PC Laptops Acer Aspire 5920 alt f10 to use my recovery dsk mismatch d2d32 This a very common error. I too have suffered from this but after about 15 hours of fighting with it.. I fix it. I could not use the ALT + F10 keys as I would get the D2D32 Type Mismatch Error. So lucky me when I got my laptop from acer I made the re ... Acer Aspire 5610-4648 Notebook Computer dies on me (can't say it better due to no technical knowledge; pls read :-) The 'click' sound you hear when your computer goes off is the hard drive head parking itself. It does this whenever the machine shuts down to prevent damage.As for the problem itself, I believe your computer is overheating. Th ... Acer TravelMate 290LCi Notebook My compaq desktop computer wont start up it keeps saying NTLDR missing Hi i have made lil resaerch for this problem so every user who suffurs from this problem can Fixt it on Fixya.com i wish this well helps everyone when u finish rate me plz cuz that was a day and half reasaerch took me a serious hard time but t(his i ... Compaq PC Desktops My HP Pavilion laptop will not boot. Usually the message about low virtual memory is because there isn't enough RAM and it was using up all the designated space on the hard drive as Virtual memory. (Uses a part of the hard drive like RAM)\015\012\015\012That shouldn't accoun ... HP Pavilion dv8000z Notebook I have a virus on my computer Toshiba Satellite You're going to need a few bits before you start:\0121) Drivers: Start here:http://uk.computers.toshiba-europe.com/innovation/download_drivers_bios.jsp...and download a complete set of drivers for the operating system yo ... Toshiba Satellite Pro A200-EZ2204X Notebook Having Trouble Reinstalling XP on my Dell Dimension 3000 Is the "New" HD in the system presently? If not install it. Boot from the original XP Restore disk (CD/DVD). When you get Windows going (from CD) go to COMPUTER and format your C: drive. Once this is done go ahead and run the Restore from the ori ... Dell Dimension 3000 PC Desktop Poweredge1300 no post Good news, you can save the machine, although it may take a while. There are a few ways to do this. If you are lucky enough that the boot sector of your BIOS didn't get corrupt and your computer still posts and you can put in a floppy. Then all you ... Dell PowerEdge 1300 Server Cant remember my password to my master screen name Password Recovery.\015\012Can't Log On to Windows XP?\015\012If that’s your only problem, then you probably have nothing to worry about. As long as you have your Windows XP CD, you can get back into your system using a simple but ef ... PC Desktops My PC has crashed and I had a few hundred pitures in my Kodak Gallery. Does this mean Iv}e lost them ?? Mrs E. Mc quade Hi gateside,\015\012\015\012When you say the computer crashed you mean Windows is not booting up to the desktop or it gives you a Blue screen error message on your monitor. If this is your case then your data actually is still in the hard ... PC Desktops I can log in to my computer i for got my password Assuming you are talking about logging in to Windows XP here are some things you can try:\015\012Windows XP Home Edition or Windows XP Professional in a workgroup\015\012loadTOCNode(3, 'whattotry');\015\012\015\012\015\012\015\0121.\015\0 ... Compaq PC Desktops My gateway g7-500 fails to start properly. Whemn power on I get a long beep followed by 2 short ones and the monitor screen remains black. Cause:This issue can be caused by any of the below situations.\015\012 \015\012\015\012New hardware conflicting with old hardware.\015\012Bad or failing hardware device.\015\012 ... PC Desktops Computer has frozen on windows logo 1) Which version of Windows ? For the following discussion I am assuming it is 2000, XP or higher. You may also want to print this, it's long.2) Is this this the low resolution Windows logo on the black scre ... Fujitsu Siemens SCALEO 600 (FSP:83C005617) PC Desktop Emergency Room: Code Blue If its a very old game then it might still run on dos. dos is the old operating system. you could run two opperating sytems if you want to do that then read this that i found on runing two opperating sytems\015\012\015\012First you need t ... Legacy Interactive Emergency Room: Code Blue for Windows I forget my computer password thatn is administator password in h . Place your Windows XP CD in your cd-rom and start yourcomputer (it’s assumed here that your XP CD is bootable – as it should be - and that you have your bios set to boot from CD)2. Keep your eye on the screen messages ... PC Desktops Instantaneous shutdown with no warnings! Software issue or errorErrors generated by software programs can cause a computer to reboot unexpectedly or without warning. If you are running Windows XP see the below section "For Windows XP users" before continuing. \015\012If you are not ru ... Toshiba Satellite A105 Notebook Forgotten Password need help to unlock my laptop I forgot my password Good.\015\012If that’s your only problem, then you probably have nothing to worry about. As long as you have your Windows XP CD, you can get back into your system using a simple but effective method made possible by a little known access ... Acer Aspire 3690-2196 Notebook I have a Acer 9410Z. I can't unlock it Hi Robert\015\012\015\012\015\012Please follow this procedure to change the password:\015\012\015\012\015\012\015\012\015\012XP. Go into safe mode by re-starting the computer and \015\012pressing F8 repeat ... Acer PC Laptops How do i format it Process for Windows XP Re-installationWINDOWS RE-INSTALLATION WILL WIPE OFF ALL THE DATA.1. Insert Windows XP operating System Disk In The CD Drive.2. Shut Down The system.3. Disconnect Everythi ... Dell Dimension 4600 PC Desktop My computer got broke so i installed new installion of windows xp and now that one got messed up and i need to restore the factory settings but i cant get the d2d erecovery to work can you help me my computer is an acer aspire one series mother board aoa150 Hi there !!Thank you for posting your question at FixYa.comYou have a partition on your hard drive that contains the backup\015\012image.If you can't see a drive D: or E: on "my computer" that means the\015\012partition is hid ... PC Laptops • Start your question with What, Why, How, When, etc. and end with a "?" • Be clear and specific • Use proper spelling and grammar all rights reserved to the respective owners \|\| www.electronic-servicing.com \|\| Terms of Use \|\| Contact \|\| Privacy Policy Load time: 1.5595 seconds	{ "url": "http://www.electronic-servicing.com/_pc_desktops/q1367611-didnt_get_boot", "source_domain": "www.electronic-servicing.com", "snapshot_id": "crawl=CC-MAIN-2017-13", "warc_metadata": { "Content-Length": "26206", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NZA7EVLULSENYPFSQ5YLYYJS322SB3XB", "WARC-Concurrent-To": "<urn:uuid:0139e08c-329c-467d-8793-7d1314316622>", "WARC-Date": "2017-03-23T10:41:34Z", "WARC-IP-Address": "104.27.178.222", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:OEIVCHVV2J6M35RTMZNDWD77RYTAG7KP", "WARC-Record-ID": "<urn:uuid:fef0e3e1-62aa-48e6-942b-7bbf8a1ebb54>", "WARC-Target-URI": "http://www.electronic-servicing.com/_pc_desktops/q1367611-didnt_get_boot", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:221b773b-495a-46f2-b936-1241ae6df294>" }, "warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 1, 41, 42, 113, 114, 115, 125, 126, 505, 559, 560, 585, 586, 654, 711, 755, 756, 786, 787, 837, 838, 839, 1106, 1107, 1126, 1127, 1128, 1412, 1413, 1434, 1435, 1436, 1719, 1720, 1781, 1782, 1783, 2055, 2056, 2085, 2086, 2087, 2322, 2323, 2389, 2390, 2391, 2645, 2646, 2709, 2710, 2711, 2997, 2998, 3083, 3084, 3085, 3350, 3351, 3422, 3423, 3424, 3697, 3698, 3735, 3736, 3737, 4009, 4010, 4058, 4059, 4060, 4330, 4331, 4388, 4389, 4390, 4672, 4673, 4695, 4696, 4697, 4977, 4978, 5029, 5030, 5031, 5280, 5281, 5401, 5402, 5403, 5658, 5659, 5709, 5710, 5711, 5973, 5974, 6113, 6114, 6115, 6309, 6310, 6346, 6347, 6348, 6614, 6615, 6641, 6642, 6643, 6943, 6944, 7010, 7011, 7012, 7248, 7249, 7290, 7291, 7292, 7573, 7574, 7644, 7645, 7646, 7919, 7920, 7959, 7960, 7961, 8187, 8188, 8207, 8208, 8209, 8439, 8440, 8698, 8699, 8700, 8942, 9017, 9043, 9079, 9201 ], "line_end_idx": [ 1, 41, 42, 113, 114, 115, 125, 126, 505, 559, 560, 585, 586, 654, 711, 755, 756, 786, 787, 837, 838, 839, 1106, 1107, 1126, 1127, 1128, 1412, 1413, 1434, 1435, 1436, 1719, 1720, 1781, 1782, 1783, 2055, 2056, 2085, 2086, 2087, 2322, 2323, 2389, 2390, 2391, 2645, 2646, 2709, 2710, 2711, 2997, 2998, 3083, 3084, 3085, 3350, 3351, 3422, 3423, 3424, 3697, 3698, 3735, 3736, 3737, 4009, 4010, 4058, 4059, 4060, 4330, 4331, 4388, 4389, 4390, 4672, 4673, 4695, 4696, 4697, 4977, 4978, 5029, 5030, 5031, 5280, 5281, 5401, 5402, 5403, 5658, 5659, 5709, 5710, 5711, 5973, 5974, 6113, 6114, 6115, 6309, 6310, 6346, 6347, 6348, 6614, 6615, 6641, 6642, 6643, 6943, 6944, 7010, 7011, 7012, 7248, 7249, 7290, 7291, 7292, 7573, 7574, 7644, 7645, 7646, 7919, 7920, 7959, 7960, 7961, 8187, 8188, 8207, 8208, 8209, 8439, 8440, 8698, 8699, 8700, 8942, 9017, 9043, 9079, 9201, 9226 ] }	{ "red_pajama_v2": { "ccnet_original_length": 9226, "ccnet_original_nlines": 147, "rps_doc_curly_bracket": 0.00010838999878615141, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3724413514137268, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.058911629021167755, "rps_doc_frac_lines_end_with_ellipsis": 0.0067567601799964905, "rps_doc_frac_no_alph_words": 0.20619070529937744, "rps_doc_frac_unique_words": 0.3921824097633362, "rps_doc_mean_word_length": 4.658631801605225, "rps_doc_num_sentences": 118, "rps_doc_symbol_to_word_ratio": 0.013479780405759811, "rps_doc_unigram_entropy": 5.6737284660339355, "rps_doc_word_count": 1535, "rps_doc_frac_chars_dupe_10grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_5grams": 0.043909940868616104, "rps_doc_frac_chars_dupe_6grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_7grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_8grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_9grams": 0.036638230085372925, "rps_doc_frac_chars_top_2gram": 0.015102780424058437, "rps_doc_frac_chars_top_3gram": 0.008390430361032486, "rps_doc_frac_chars_top_4gram": 0.006292830221354961, "rps_doc_books_importance": -830.1620483398438, "rps_doc_books_importance_length_correction": -830.1620483398438, "rps_doc_openwebtext_importance": -471.31195068359375, "rps_doc_openwebtext_importance_length_correction": -471.31195068359375, "rps_doc_wikipedia_importance": -331.9764709472656, "rps_doc_wikipedia_importance_length_correction": -331.9764709472656 }, "fasttext": { "dclm": 0.019672630354762077, "english": 0.9024404287338257, "fineweb_edu_approx": 1.2412397861480713, "eai_general_math": 0.11632537841796875, "eai_open_web_math": 0.2695961594581604, "eai_web_code": 0.024815740063786507 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,260,501,650,580,964,000	Command-line Utilities for Everybody Else Here's a common problem: you've written a beautiful command-line utility - it's clean, it's refactored, it frankly sparkles. You tell folks about it, they want it, you send it to them. But, they won't use it. Why? Because there's no GUI and people love their GUIs. The people hates the command-line. What you need to do is wrap a GUI around your command-line utility. Not only that but for a minimum level of usability, your GUI better be: • cross-platform: works in any of the holy triumvirate of Windows, Unix or Mac • native look-and-feel: so people don't get put off opening files • easy-to-install: should not require esoteric knowledge Now there are existing solutions that are close but not quite there. For example, gooey is a clever library that wraps a GUI around Python command-line utilities. The downside of gooey is that it uses wxPython. Installing wxPython is difficult for end-users. If you have a standard Python distribution (and that's a big if), then you can install wxPython from the website, but you need to know the exact binary version of your Python. Otherwise, you need a C-compiler ecosystem. Trivial, right? Another solution might be to run a local web-server, which serves a local web-app to talk to your command-line utility. Sadly, webbrowsers are limited by a security feature, whereby open file dialogs are prevented from sending full pathnames to your webapp. This will cripple your command-line utility. Well it turns there is a solution using plain old standard Python. Every Python install comes with a GUI library tkinter that is native to a certain extent. tkinter is not very powerful, but offers just enough features to build a GUI for a command-line utility. Since tkinter comes standard with Python on all 3 major platforms, your only requirement is to install Python (which is easy), and you get a cross-platform solution with native file dialogs for free! So I wrote a module - tkform (http://github.com/boscoh/tkform) - that can wrap a tkinter GUI around command-line utilities. It's work flow is inspired by HTML forms. You construct the GUI in a linear fashion that will populate a single flowable page. There is a submit button at the bottom. When clicked with submit, your 'run' hook will get a JSON compatible parameter list that you can send to your command-line utility. You get a bunch of widgets (checkbox, radio buttions, text labels, file lists) and some decorators (size-adjustable text, lines, spaces), and buttons for extra actions. You get a nice output area to display logging information. It even gracefuly handles Python exceptions. There are links to click on to send your user to the ouput. I've even included a reoderable list widget that can display a list of filenames and elements that can be reordered and renamed, before the 'submit' button is pressed. This way your command-line utility can receive a list of filenames, ordered to your end-user's content. Imagine asking your end-user to do that on the command-line? And it's easy to install. Just ask your end-user to install Python, then download your package which includes the tkform library with your Python command-line utility. Add an '-i' interactive option to your utility to trigger the GUI. Include a clickable shell/command/batch file and tell your user to click that. Easy as.	{ "url": "http://boscoh.com/programming/command-line-utilities-for-everybody-else.html", "source_domain": "boscoh.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "6505", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:O244H5RTES7TACNZSEWM5JZXGLAB4Y4T", "WARC-Concurrent-To": "<urn:uuid:c1dfa339-0da2-4319-9d23-c930c593306d>", "WARC-Date": "2017-02-24T03:54:06Z", "WARC-IP-Address": "208.113.171.17", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6TXIJLBRXOWZVEVPJ2TLI64DSONY5HVG", "WARC-Record-ID": "<urn:uuid:325005de-d170-44a9-9f62-2e7eda7bc520>", "WARC-Target-URI": "http://boscoh.com/programming/command-line-utilities-for-everybody-else.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bb6b8ab6-d1ad-4da9-8ee5-64add7d10cb0>" }, "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, 42, 43, 257, 258, 344, 345, 485, 486, 567, 635, 694, 695, 1190, 1191, 1494, 1495, 1957, 1958, 2381, 2382, 2715, 2716, 3049, 3050 ], "line_end_idx": [ 42, 43, 257, 258, 344, 345, 485, 486, 567, 635, 694, 695, 1190, 1191, 1494, 1495, 1957, 1958, 2381, 2382, 2715, 2716, 3049, 3050, 3372 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3372, "ccnet_original_nlines": 24, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3681318759918213, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01923076994717121, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18681319057941437, "rps_doc_frac_unique_words": 0.4809437394142151, "rps_doc_mean_word_length": 4.834845542907715, "rps_doc_num_sentences": 39, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.053625583648682, "rps_doc_word_count": 551, "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.054054051637649536, "rps_doc_frac_chars_top_3gram": 0.041291289031505585, "rps_doc_frac_chars_top_4gram": 0.018018020316958427, "rps_doc_books_importance": -376.7606201171875, "rps_doc_books_importance_length_correction": -376.7606201171875, "rps_doc_openwebtext_importance": -198.8604736328125, "rps_doc_openwebtext_importance_length_correction": -198.8604736328125, "rps_doc_wikipedia_importance": -149.57122802734375, "rps_doc_wikipedia_importance_length_correction": -149.57122802734375 }, "fasttext": { "dclm": 0.506603479385376, "english": 0.9198455214500427, "fineweb_edu_approx": 1.5677911043167114, "eai_general_math": 0.6690616011619568, "eai_open_web_math": 0.20538294315338135, "eai_web_code": 0.7836549282073975 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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
-3,158,257,403,498,964,500	Class: ActiveMerchant::Billing::AdyenGateway Inherits: Gateway • Object show all Defined in: lib/active_merchant/billing/gateways/adyen.rb Constant Summary collapse PAYMENT_API_VERSION = 'v40' RECURRING_API_VERSION = 'v30' STANDARD_ERROR_CODE_MAPPING = { '101' => STANDARD_ERROR_CODE[:incorrect_number], '103' => STANDARD_ERROR_CODE[:invalid_cvc], '131' => STANDARD_ERROR_CODE[:incorrect_address], '132' => STANDARD_ERROR_CODE[:incorrect_address], '133' => STANDARD_ERROR_CODE[:incorrect_address], '134' => STANDARD_ERROR_CODE[:incorrect_address], '135' => STANDARD_ERROR_CODE[:incorrect_address] } Constants inherited from Gateway Gateway::CREDIT_DEPRECATION_MESSAGE, Gateway::RECURRING_DEPRECATION_MESSAGE, Gateway::STANDARD_ERROR_CODE Instance Attribute Summary Attributes inherited from Gateway #options Instance Method Summary collapse Methods inherited from Gateway #add_field_to_post_if_present, #add_fields_to_post_if_present, #card_brand, card_brand, #generate_unique_id, inherited, supported_countries, #supported_countries, supported_countries=, supports?, #supports_network_tokenization?, #test? Methods included from CreditCardFormatting #expdate, #format Methods included from PostsData included, #raw_ssl_request, #ssl_get, #ssl_post, #ssl_request Constructor Details #initialize(options = {}) ⇒ AdyenGateway Returns a new instance of AdyenGateway. 32 33 34 35 36 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 32 def initialize(options = {}) requires!(options, :username, :password, :merchant_account) @username, @password, @merchant_account = options.values_at(:username, :password, :merchant_account) super end Instance Method Details #adjust(money, authorization, options = {}) ⇒ Object 96 97 98 99 100 101 102 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 96 def adjust(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_reference(post, authorization, options) add_extra_data(post, nil, options) commit('adjustAuthorisation', post, options) end #authorize(money, payment, options = {}) ⇒ Object 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 49 def authorize(money, payment, options = {}) requires!(options, :order_id) post = init_post(options) add_invoice(post, money, options) add_payment(post, payment, options) add_extra_data(post, payment, options) add_stored_credentials(post, payment, options) add_address(post, options) add_installments(post, options) if options[:installments] add_3ds(post, options) add_3ds_authenticated_data(post, options) add_splits(post, options) add_recurring_contract(post, options) commit('authorise', post, options) end #capture(money, authorization, options = {}) ⇒ Object 65 66 67 68 69 70 71 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 65 def capture(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_reference(post, authorization, options) add_splits(post, options) commit('capture', post, options) end #credit(money, payment, options = {}) ⇒ Object 81 82 83 84 85 86 87 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 81 def credit(money, payment, options = {}) post = init_post(options) add_invoice(post, money, options) add_payment(post, payment, options) add_shopper_reference(post, options) commit('refundWithData', post, options) end #purchase(money, payment, options = {}) ⇒ Object 38 39 40 41 42 43 44 45 46 47 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 38 def purchase(money, payment, options = {}) if options[:execute_threed] \|\| options[:threed_dynamic] authorize(money, payment, options) else MultiResponse.run do \|r\| r.process { authorize(money, payment, options) } r.process { capture(money, r.authorization, capture_options(options)) } end end end #refund(money, authorization, options = {}) ⇒ Object 73 74 75 76 77 78 79 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 73 def refund(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_original_reference(post, authorization, options) add_splits(post, options) commit('refund', post, options) end #scrub(transcript) ⇒ Object 150 151 152 153 154 155 156 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 150 def scrub(transcript) transcript. gsub(%r((Authorization: Basic )\w+), '\1[FILTERED]'). gsub(%r(("number\\?":\\?")[^"])i, '\1[FILTERED]'). gsub(%r(("cvc\\?":\\?")[^"])i, '\1[FILTERED]'). gsub(%r(("cavv\\?":\\?")[^"]*)i, '\1[FILTERED]') end #store(credit_card, options = {}) ⇒ Object 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 104 def store(credit_card, options = {}) requires!(options, :order_id) post = init_post(options) add_invoice(post, 0, options) add_payment(post, credit_card, options) add_extra_data(post, credit_card, options) add_stored_credentials(post, credit_card, options) add_address(post, options) options[:recurring_contract_type] \|\|= 'RECURRING' add_recurring_contract(post, options) action = options[:tokenize_only] ? 'storeToken' : 'authorise' initial_response = commit(action, post, options) if initial_response.success? && card_not_stored?(initial_response) unsupported_failure_response(initial_response) else initial_response end end #supports_scrubbing?Boolean Returns: • (Boolean) 146 147 148 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 146 def supports_scrubbing? true end #unstore(options = {}) ⇒ Object 127 128 129 130 131 132 133 134 135 136 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 127 def unstore(options = {}) requires!(options, :shopper_reference, :recurring_detail_reference) post = {} add_shopper_reference(post, options) (post, options) post[:recurringDetailReference] = options[:recurring_detail_reference] commit('disable', post, options) end #verify(credit_card, options = {}) ⇒ Object 138 139 140 141 142 143 144 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 138 def verify(credit_card, options = {}) MultiResponse.run(:use_first_response) do \|r\| r.process { authorize(0, credit_card, options) } options[:idempotency_key] = nil r.process(:ignore_result) { void(r.authorization, options) } end end #void(authorization, options = {}) ⇒ Object 89 90 91 92 93 94 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 89 def void(authorization, options = {}) post = init_post(options) endpoint = options[:cancel_or_refund] ? 'cancelOrRefund' : 'cancel' add_reference(post, authorization, options) commit(endpoint, post, options) end	{ "url": "https://rubydoc.info/github/Shopify/active_merchant/ActiveMerchant/Billing/AdyenGateway", "source_domain": "rubydoc.info", "snapshot_id": "crawl=CC-MAIN-2021-39", "warc_metadata": { "Content-Length": "62948", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QLQNS3FFC3FICXH3QTU6RZITMTP4Q2BW", "WARC-Concurrent-To": "<urn:uuid:0ca83099-0abe-4b6c-ae54-a215e5dcbcd2>", "WARC-Date": "2021-09-20T08:57:02Z", "WARC-IP-Address": "172.67.194.167", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3DFK2F66TCKMOQNEIOUAXSMYBLRAGXZL", "WARC-Record-ID": "<urn:uuid:fcc13d9e-2942-4e69-8ba1-9db2e62b9f54>", "WARC-Target-URI": "https://rubydoc.info/github/Shopify/active_merchant/ActiveMerchant/Billing/AdyenGateway", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b1a4dfaa-8ede-4420-b8a7-9c4558e4500c>" }, "warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-93\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, 45, 46, 56, 64, 75, 84, 96, 142, 143, 169, 170, 192, 198, 222, 228, 258, 260, 311, 357, 409, 461, 513, 565, 616, 618, 619, 652, 653, 759, 760, 787, 788, 822, 823, 832, 833, 866, 867, 898, 899, 1135, 1136, 1179, 1180, 1198, 1199, 1231, 1232, 1294, 1295, 1315, 1316, 1357, 1358, 1398, 1399, 1400, 1403, 1406, 1409, 1412, 1415, 1479, 1480, 1509, 1571, 1674, 1682, 1686, 1687, 1711, 1712, 1765, 1766, 1767, 1770, 1773, 1776, 1779, 1783, 1787, 1791, 1855, 1856, 1903, 1931, 1984, 2030, 2067, 2114, 2118, 2119, 2169, 2170, 2171, 2174, 2177, 2180, 2183, 2186, 2189, 2192, 2195, 2198, 2201, 2204, 2207, 2210, 2213, 2216, 2280, 2281, 2325, 2357, 2385, 2421, 2459, 2500, 2549, 2578, 2638, 2663, 2707, 2735, 2775, 2812, 2816, 2817, 2871, 2872, 2873, 2876, 2879, 2882, 2885, 2888, 2891, 2894, 2958, 2959, 3007, 3035, 3088, 3134, 3162, 3197, 3201, 3202, 3249, 3250, 3251, 3254, 3257, 3260, 3263, 3266, 3269, 3272, 3336, 3337, 3378, 3406, 3442, 3480, 3519, 3561, 3565, 3566, 3615, 3616, 3617, 3620, 3623, 3626, 3629, 3632, 3635, 3638, 3641, 3644, 3647, 3711, 3712, 3755, 3813, 3852, 3859, 3888, 3943, 4021, 4029, 4035, 4039, 4040, 4093, 4094, 4095, 4098, 4101, 4104, 4107, 4110, 4113, 4116, 4180, 4181, 4228, 4256, 4309, 4364, 4392, 4426, 4430, 4431, 4459, 4460, 4461, 4465, 4469, 4473, 4477, 4481, 4485, 4489, 4554, 4555, 4577, 4591, 4649, 4705, 4758, 4811, 4815, 4816, 4859, 4860, 4861, 4865, 4869, 4873, 4877, 4881, 4885, 4889, 4893, 4897, 4901, 4905, 4909, 4913, 4917, 4921, 4925, 4929, 4933, 4937, 4941, 4945, 4949, 5014, 5015, 5052, 5084, 5112, 5144, 5186, 5231, 5284, 5313, 5314, 5366, 5406, 5407, 5471, 5472, 5523, 5524, 5593, 5644, 5651, 5672, 5678, 5682, 5683, 5711, 5712, 5721, 5722, 5736, 5737, 5741, 5745, 5749, 5814, 5815, 5839, 5846, 5850, 5851, 5883, 5884, 5885, 5889, 5893, 5897, 5901, 5905, 5909, 5913, 5917, 5921, 5925, 5990, 5991, 6017, 6087, 6099, 6100, 6139, 6157, 6230, 6231, 6266, 6270, 6271, 6315, 6316, 6317, 6321, 6325, 6329, 6333, 6337, 6341, 6345, 6410, 6411, 6449, 6497, 6550, 6586, 6651, 6657, 6661, 6662, 6706, 6707, 6708, 6711, 6714, 6717, 6720, 6723, 6726, 6790, 6791, 6829, 6857, 6927, 6973, 7007 ], "line_end_idx": [ 45, 46, 56, 64, 75, 84, 96, 142, 143, 169, 170, 192, 198, 222, 228, 258, 260, 311, 357, 409, 461, 513, 565, 616, 618, 619, 652, 653, 759, 760, 787, 788, 822, 823, 832, 833, 866, 867, 898, 899, 1135, 1136, 1179, 1180, 1198, 1199, 1231, 1232, 1294, 1295, 1315, 1316, 1357, 1358, 1398, 1399, 1400, 1403, 1406, 1409, 1412, 1415, 1479, 1480, 1509, 1571, 1674, 1682, 1686, 1687, 1711, 1712, 1765, 1766, 1767, 1770, 1773, 1776, 1779, 1783, 1787, 1791, 1855, 1856, 1903, 1931, 1984, 2030, 2067, 2114, 2118, 2119, 2169, 2170, 2171, 2174, 2177, 2180, 2183, 2186, 2189, 2192, 2195, 2198, 2201, 2204, 2207, 2210, 2213, 2216, 2280, 2281, 2325, 2357, 2385, 2421, 2459, 2500, 2549, 2578, 2638, 2663, 2707, 2735, 2775, 2812, 2816, 2817, 2871, 2872, 2873, 2876, 2879, 2882, 2885, 2888, 2891, 2894, 2958, 2959, 3007, 3035, 3088, 3134, 3162, 3197, 3201, 3202, 3249, 3250, 3251, 3254, 3257, 3260, 3263, 3266, 3269, 3272, 3336, 3337, 3378, 3406, 3442, 3480, 3519, 3561, 3565, 3566, 3615, 3616, 3617, 3620, 3623, 3626, 3629, 3632, 3635, 3638, 3641, 3644, 3647, 3711, 3712, 3755, 3813, 3852, 3859, 3888, 3943, 4021, 4029, 4035, 4039, 4040, 4093, 4094, 4095, 4098, 4101, 4104, 4107, 4110, 4113, 4116, 4180, 4181, 4228, 4256, 4309, 4364, 4392, 4426, 4430, 4431, 4459, 4460, 4461, 4465, 4469, 4473, 4477, 4481, 4485, 4489, 4554, 4555, 4577, 4591, 4649, 4705, 4758, 4811, 4815, 4816, 4859, 4860, 4861, 4865, 4869, 4873, 4877, 4881, 4885, 4889, 4893, 4897, 4901, 4905, 4909, 4913, 4917, 4921, 4925, 4929, 4933, 4937, 4941, 4945, 4949, 5014, 5015, 5052, 5084, 5112, 5144, 5186, 5231, 5284, 5313, 5314, 5366, 5406, 5407, 5471, 5472, 5523, 5524, 5593, 5644, 5651, 5672, 5678, 5682, 5683, 5711, 5712, 5721, 5722, 5736, 5737, 5741, 5745, 5749, 5814, 5815, 5839, 5846, 5850, 5851, 5883, 5884, 5885, 5889, 5893, 5897, 5901, 5905, 5909, 5913, 5917, 5921, 5925, 5990, 5991, 6017, 6087, 6099, 6100, 6139, 6157, 6230, 6231, 6266, 6270, 6271, 6315, 6316, 6317, 6321, 6325, 6329, 6333, 6337, 6341, 6345, 6410, 6411, 6449, 6497, 6550, 6586, 6651, 6657, 6661, 6662, 6706, 6707, 6708, 6711, 6714, 6717, 6720, 6723, 6726, 6790, 6791, 6829, 6857, 6927, 6973, 7007, 7010 ] }	{ "red_pajama_v2": { "ccnet_original_length": 7010, "ccnet_original_nlines": 361, "rps_doc_curly_bracket": 0.007988589815795422, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.02345415949821472, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012793179601430893, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5593461394309998, "rps_doc_frac_unique_words": 0.4755244851112366, "rps_doc_mean_word_length": 8.835664749145508, "rps_doc_num_sentences": 46, "rps_doc_symbol_to_word_ratio": 0.02842927910387516, "rps_doc_unigram_entropy": 4.963043689727783, "rps_doc_word_count": 572, "rps_doc_frac_chars_dupe_10grams": 0.04590423032641411, "rps_doc_frac_chars_dupe_5grams": 0.1086268275976181, "rps_doc_frac_chars_dupe_6grams": 0.1086268275976181, "rps_doc_frac_chars_dupe_7grams": 0.09062129259109497, "rps_doc_frac_chars_dupe_8grams": 0.07479224354028702, "rps_doc_frac_chars_dupe_9grams": 0.04590423032641411, "rps_doc_frac_chars_top_2gram": 0.11060546338558197, "rps_doc_frac_chars_top_3gram": 0.12089434266090393, "rps_doc_frac_chars_top_4gram": 0.01602691039443016, "rps_doc_books_importance": -442.384033203125, "rps_doc_books_importance_length_correction": -442.384033203125, "rps_doc_openwebtext_importance": -265.34027099609375, "rps_doc_openwebtext_importance_length_correction": -265.34027099609375, "rps_doc_wikipedia_importance": -90.21688842773438, "rps_doc_wikipedia_importance_length_correction": -90.21688842773438 }, "fasttext": { "dclm": 0.5487456917762756, "english": 0.4074065387248993, "fineweb_edu_approx": 2.6703245639801025, "eai_general_math": 0.6470960378646851, "eai_open_web_math": 0.5244587063789368, "eai_web_code": 0.11348426342010498 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "658.85", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
624,690,978,643,358,700	How Can I Unblock and Access Sky Atlantic Abroad With a VPN? Sky Atlantic is home to the superb series the Game of Thrones, along with many other series unavailable on any other channel. With Sky Atlantic airing the final series of GOT, you will not want to miss finding out who will rule the Iron Throne. If you go abroad and you are restricted from watching GOT, you’re thinking of one question – how can I unblock and access Sky Atlantic abroad? Let’s talk more about our solution! Why Sky Atlantic Imposes Geo-Restrictions? So, what are geo-restrictions, and why are they put into place? This is a very good question. It all comes down to licensing rights. It may also be partly due to restrictions of being able to show content containing certain elements. This might include scenes such as gambling, in countries where gambling is prohibited. Whatever the reason, if you go to a country where Sky Atlantic is not licensed, you cannot watch it. This leads to you asking how to unblock and stream Sky Atlantic abroad. How Restrictions are Applied? Different countries around the world have a different range of IP addresses. Whenever you access a website or app, your IP address is noted and this is what stops or allows you to gain access to licensed content. Networks will know you’re not within one of the regions where Sky Atlantic streams its content, so you cannot access it. The answer to overcoming blocks and the question of how can I stream Sky Atlantic outside of the UK is changing your IP address. The downside is that doing so is not as simple as changing it yourself. You cannot simply choose an IP. For one, you would not know the range of IP addresses used in different countries. You cannot change it without help from a Virtual Private Network. How Does a VPN Help? ExpressVPN is an excellent choice, being the best provider on the market. We will look at some of the reasons we recommend them to people wondering how to watch Sky Atlantic abroad later. Before moving on and how you can overcome restrictions, we will explain how a VPN helps when you want to have websites believe you are located in the UK. This will also help you stream ITV abroad while using a UK IP address. ExpressVPN has 3,000 super-fast servers based in 94 countries around the world. When you take a subscription with them, they allow you to download software and connect to any of their servers. While you do not need to know all the ins-and-outs of a VPN when wondering how can I access Sky Atlantic outside of the UK, you need to understand that you have to choose a server based in the UK. Therefore, ExpressVPN helps by providing you with access to servers offering IP addresses in the country you need to unblock and watch Sky Atlantic. How to access Sky Atlantic abroad Change IP with ExpressVPN > Guide to Stream Sky Atlantic Abroad How to stream Sky Atlantic abroad Now that we have explained why geo-restrictions apply, how they are applied, and how a VPN can help you, we will continue with our tutorial to answer your question of how can I unblock and access Sky Atlantic abroad. 1. Step one – choose a plan from ExpressVPN. You can make savings of up to 49% if you decide to go with a yearly plan and get 15 months when paying for 12 months. 2. Download the software for your chosen device. There is a wide range of devices to choose from. 3. Install the software and open it up. 4. Choose a UK-based server and click connect. This is important in answering how to stream Sky Atlantic outside the United Kingdom. 5. You now have an IP address in the UK and can watch Sky Atlantic. Why Choose ExpressVPN? ExpressVPN Sky GO With a VPN in place, you can overcome the restrictions imposed by the networks and watch what you want, wherever you want. There are many good reasons for choosing ExpressVPN, some of which we have highlighted below. Of course, you can know much more about it if you read our ExpressVPN comprehensive review. ExpressVPN offers a range of plans suitable for all budgets with the biggest savings made on yearly plans. Now that you have found out how to access Sky Atlantic abroad with a VPN, you might wish to sign up for 12 months, save 49%, and get 15 months of online protection. Furthermore, the provider offers more than 3,000 servers located in 160 locations in 94 countries. All of the servers offer blazing -fast speed, which is precisely what’s needed when streaming HD content from other countries. After all, there is nothing worse than stuttering and pauses that occur just at the crucial moment in your program. Get ExpressVPN now > Summary You have found the answer to how can I unblock and access Sky Atlantic abroad. However, did you also know that ExpressVPN offers plenty of security features to protect you during day-to-day internet browsing? These include IPv6 leak protection along with DNS leak protection and more. What’s more, they offer full protection thanks to the 30-day money-back guarantee with no quibbles. Not that you are going to need it, but hey… With everything said, we recommend ExpressVPN for unblocking Sky Atlantic abroad. Grab your subscription and start streaming now! We will be happy to hear your thoughts Leave a reply This site uses Akismet to reduce spam. Learn how your comment data is processed. The-bestvpn : the reference on the VPNs	{ "url": "https://the-bestvpn.com/unblock-sky-atlantic/", "source_domain": "the-bestvpn.com", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "102154", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5CDW3OHJIFZJR4CZOFYOOBX7MXUDSODJ", "WARC-Concurrent-To": "<urn:uuid:ca4ed95e-8d70-4bdf-bd1d-767434cd844d>", "WARC-Date": "2021-07-26T14:13:49Z", "WARC-IP-Address": "104.21.63.131", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:4EB44SSYKUU2AIFYLL4SU3AE43SLCKDX", "WARC-Record-ID": "<urn:uuid:fb13c7d7-38f0-4207-b9c1-1a8352e15a6d>", "WARC-Target-URI": "https://the-bestvpn.com/unblock-sky-atlantic/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e0f58d33-feba-46e9-810b-3a9f3b300a3f>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-157.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, 61, 62, 486, 487, 530, 531, 664, 665, 954, 955, 1027, 1028, 1058, 1059, 1272, 1273, 1523, 1524, 1711, 1712, 1778, 1779, 1800, 1801, 1989, 1990, 2144, 2145, 2216, 2217, 2410, 2411, 2608, 2609, 2758, 2759, 2793, 2794, 2822, 2823, 2859, 2860, 2894, 2895, 3112, 3113, 3278, 3378, 3420, 3555, 3625, 3626, 3649, 3650, 3668, 3669, 3886, 3887, 3979, 3980, 4252, 4253, 4479, 4480, 4596, 4597, 4618, 4619, 4627, 4628, 4913, 4914, 5058, 5059, 5189, 5190, 5229, 5230, 5250, 5251, 5338, 5339 ], "line_end_idx": [ 61, 62, 486, 487, 530, 531, 664, 665, 954, 955, 1027, 1028, 1058, 1059, 1272, 1273, 1523, 1524, 1711, 1712, 1778, 1779, 1800, 1801, 1989, 1990, 2144, 2145, 2216, 2217, 2410, 2411, 2608, 2609, 2758, 2759, 2793, 2794, 2822, 2823, 2859, 2860, 2894, 2895, 3112, 3113, 3278, 3378, 3420, 3555, 3625, 3626, 3649, 3650, 3668, 3669, 3886, 3887, 3979, 3980, 4252, 4253, 4479, 4480, 4596, 4597, 4618, 4619, 4627, 4628, 4913, 4914, 5058, 5059, 5189, 5190, 5229, 5230, 5250, 5251, 5338, 5339, 5384 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5384, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.44382545351982117, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03249768167734146, "rps_doc_frac_lines_end_with_ellipsis": 0.012048190459609032, "rps_doc_frac_no_alph_words": 0.1309192180633545, "rps_doc_frac_unique_words": 0.35927504301071167, "rps_doc_mean_word_length": 4.543710231781006, "rps_doc_num_sentences": 63, "rps_doc_symbol_to_word_ratio": 0.0009285099804401398, "rps_doc_unigram_entropy": 5.167323112487793, "rps_doc_word_count": 938, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.09619896858930588, "rps_doc_frac_chars_dupe_6grams": 0.06616611778736115, "rps_doc_frac_chars_dupe_7grams": 0.046691689640283585, "rps_doc_frac_chars_dupe_8grams": 0.03754106163978577, "rps_doc_frac_chars_dupe_9grams": 0.03754106163978577, "rps_doc_frac_chars_top_2gram": 0.054199911653995514, "rps_doc_frac_chars_top_3gram": 0.04387611150741577, "rps_doc_frac_chars_top_4gram": 0.032379161566495895, "rps_doc_books_importance": -468.5501708984375, "rps_doc_books_importance_length_correction": -468.5501708984375, "rps_doc_openwebtext_importance": -305.6188659667969, "rps_doc_openwebtext_importance_length_correction": -305.6188659667969, "rps_doc_wikipedia_importance": -216.50442504882812, "rps_doc_wikipedia_importance_length_correction": -216.50442504882812 }, "fasttext": { "dclm": 0.24502778053283691, "english": 0.9531521797180176, "fineweb_edu_approx": 1.378546118736267, "eai_general_math": 0.027918219566345215, "eai_open_web_math": 0.15386205911636353, "eai_web_code": 0.012669919990003109 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.677", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "389.29", "labels": { "level_1": "Social sciences", "level_2": "Commerce and Communication and traffic", "level_3": "Weights and measures and Metrology" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
3,287,823,237,323,454,000	Altova StyleVision 2022 Professional Edition Authentic View Context Menus Home Prev Top Next Right-clicking on some selected document content or node pops up a context menu with commands relevant to the selection or cursor location. Inserting elements The figure below shows the Insert submenu, which is a list of all elements that can be inserted at that current cursor location. The Insert Before submenu lists all elements that can be inserted before the current element. The Insert After submenu lists all elements that can be inserted after the current element. In the figure below, the current element is the para element. The bold and italic elements can be inserted within the current para element. eh_context_menu As can be seen below, the para and Office elements can be inserted before the current para element. eh_context_menu2 The node insertion, replacement (Apply), and markup removal (Clear) commands that are available in the context menu are also available in the Authentic View entry helpers and are fully described in that section. Insert entity Positioning the cursor over the Insert Entity command rolls out a submenu containing a list of all declared entities. Clicking an entity inserts it at the selection. See Define Entities for a description of how to define entities for the document. Insert CDATA Section This command is enabled when the cursor is placed within text. Clicking it inserts a CDATA section at the cursor insertion point. The CDATA section is delimited by start and end tags; to see these tags you should switch on large or small markup. Within CDATA sections, XML markup and parsing is ignored. XML markup characters (the ampersand, apostrophe, greater than, less than, and quote characters) are not treated as markup, but as literals. So CDATA sections are useful for text such as program code listings, which have XML markup characters. Remove node Positioning the mouse cursor over the Remove command pops up a menu list consisting of the selected node and all its removable ancestors (those that would not invalidate the document) up to the document element. Click the element to be removed. This is a quick way to delete an element or any removable ancestor. Note that clicking an ancestor element will remove all its descendants, including the selected element. Clear The Clear command clears the element markup from around the selection. If the entire node is selected, then the element markup is cleared for the entire node. If a text segment is selected, then the element markup is cleared from around that text segment only. Apply The Apply command applies a selected element to your selection in the main Window. For more details, see Authentic View entry helpers. Copy, Cut, Paste These are the standard Windows commands. Note, however, that the Paste command pastes copied text either as XML or as Text, depending on what the designer of the stylesheet has specified for the SPS as a whole. For information about how the Copy as XML and Copy as Text commands work, see the description of the Paste As command immediately below. Paste As The Paste As command offers the option of pasting as XML or as text an Authentic View XML fragment (which was copied to the clipboard). If the copied fragment is pasted as XML it is pasted together with its XML markup. If it is pasted as text, then only the text content of the copied fragment is pasted (not the XML markup, if any). The following situations are possible: An entire node together with its markup tags is highlighted in Authentic View and copied to the clipboard. (i) The node can be pasted as XML to any location where this node may validly be placed. It will not be pasted to an invalid location. (ii) If the node is pasted as text, then only the node's text content will be pasted (not the markup); the text content can be pasted to any location in the XML document where text may be pasted. A text fragment is highlighted in Authentic View and copied to the clipboard. (i) If this fragment is pasted as XML, then the XML markup tags of the texteven though these were not explicitly copied with the text fragmentwill be pasted along with the text, but only if the XML node is valid at the location where the fragment is pasted. (ii) If the fragment is pasted as text, then it can be pasted to any location in the XML document where text may be pasted. Note:Text will be copied to nodes where text is allowed, so it is up to you to ensure that the copied text does not invalidate the document. The copied text should therefore be: (i) lexically valid in the new location (for example, non-numeric characters in a numeric node would be invalid), and (ii) not otherwise invalidate the node (for example, four digits in a node that accepts only three-digit numbers would invalidate the node). Note:If the pasted text does in any way invalidate the document, this will be indicated by the text being displayed in red. Delete The Delete command removes the selected node and its contents. A node is considered to be selected for this purpose by placing the cursor within the node or by clicking either the start or end tag of the node. © 2016-2022 Altova GmbH	{ "url": "https://www.altova.com/manual/Stylevision/stylevisionprofessional/avinterface_contextmenus.html", "source_domain": "www.altova.com", "snapshot_id": "crawl=CC-MAIN-2022-33", "warc_metadata": { "Content-Length": "34992", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NPV5YJ2CGOTEBWYNA7JZJQNQLABPWVHM", "WARC-Concurrent-To": "<urn:uuid:21f4fc90-e137-4057-b6e4-15dc655b8e08>", "WARC-Date": "2022-08-18T05:52:43Z", "WARC-IP-Address": "23.78.169.249", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3GIH3TXQQ3F2VIVUECWZCJFMAW43QWQH", "WARC-Record-ID": "<urn:uuid:aaf27815-f964-4a9b-afb9-022ba79dc6ba>", "WARC-Target-URI": "https://www.altova.com/manual/Stylevision/stylevisionprofessional/avinterface_contextmenus.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b24d05f0-bff9-4fc9-a861-27833c34cbef>" }, "warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 45, 46, 75, 76, 95, 96, 236, 237, 239, 240, 259, 260, 715, 716, 732, 733, 833, 834, 851, 852, 1064, 1065, 1067, 1068, 1082, 1083, 1331, 1332, 1334, 1335, 1356, 1357, 1905, 1906, 1908, 1909, 1921, 1922, 2339, 2340, 2342, 2343, 2349, 2350, 2611, 2612, 2614, 2615, 2621, 2622, 2757, 2758, 2760, 2761, 2778, 2779, 3127, 3128, 3130, 3131, 3140, 3141, 3514, 3515, 3517, 3518, 3956, 3957, 4417, 4418, 4420, 4421, 4858, 4859, 4861, 4862, 4986, 4987, 4989, 4990, 4997, 4998, 5208, 5209, 5211, 5212 ], "line_end_idx": [ 45, 46, 75, 76, 95, 96, 236, 237, 239, 240, 259, 260, 715, 716, 732, 733, 833, 834, 851, 852, 1064, 1065, 1067, 1068, 1082, 1083, 1331, 1332, 1334, 1335, 1356, 1357, 1905, 1906, 1908, 1909, 1921, 1922, 2339, 2340, 2342, 2343, 2349, 2350, 2611, 2612, 2614, 2615, 2621, 2622, 2757, 2758, 2760, 2761, 2778, 2779, 3127, 3128, 3130, 3131, 3140, 3141, 3514, 3515, 3517, 3518, 3956, 3957, 4417, 4418, 4420, 4421, 4858, 4859, 4861, 4862, 4986, 4987, 4989, 4990, 4997, 4998, 5208, 5209, 5211, 5212, 5235 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5235, "ccnet_original_nlines": 86, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4230387210845947, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023833170533180237, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11519364267587662, "rps_doc_frac_unique_words": 0.28153154253959656, "rps_doc_mean_word_length": 4.6813063621521, "rps_doc_num_sentences": 45, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.818902969360352, "rps_doc_word_count": 888, "rps_doc_frac_chars_dupe_10grams": 0.05388500913977623, "rps_doc_frac_chars_dupe_5grams": 0.15034881234169006, "rps_doc_frac_chars_dupe_6grams": 0.12148184329271317, "rps_doc_frac_chars_dupe_7grams": 0.10392110049724579, "rps_doc_frac_chars_dupe_8grams": 0.09189318865537643, "rps_doc_frac_chars_dupe_9grams": 0.05388500913977623, "rps_doc_frac_chars_top_2gram": 0.010825109668076038, "rps_doc_frac_chars_top_3gram": 0.015636280179023743, "rps_doc_frac_chars_top_4gram": 0.012990140356123447, "rps_doc_books_importance": -378.7057800292969, "rps_doc_books_importance_length_correction": -378.7057800292969, "rps_doc_openwebtext_importance": -278.8443603515625, "rps_doc_openwebtext_importance_length_correction": -278.8443603515625, "rps_doc_wikipedia_importance": -245.592041015625, "rps_doc_wikipedia_importance_length_correction": -245.592041015625 }, "fasttext": { "dclm": 0.06452096253633499, "english": 0.8734762668609619, "fineweb_edu_approx": 2.571596622467041, "eai_general_math": 0.8528462648391724, "eai_open_web_math": 0.6163864731788635, "eai_web_code": 0.4780045747756958 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
235,139,137,558,274,050	Author avatar Ashutosh Singh Highlighting React Code in GitHub Flavored Markdown Ashutosh Singh • Sep 25, 2020 • 7 Min read • 1,220 Views • Sep 25, 2020 • 7 Min read • 1,220 Views Web Development Front End Web Development Client-side Frameworks React Introduction Since its release in 2004, Markdown has become one of the most popular markup languages. Technical writers widely use Markdown for blogs, articles, documentation, etc. because of its lightweight simplicity and cross-platform usage; even this guide is written in Markdown behind the scenes. GitHub uses its own version of markdown known as GitHub Flavored Markdown, enabling users to interact with other users, reference issues, or pull requests. Even if your project or repository doesn't include any markdown or .md files, you will still have to use markdown for README, issues, pull requests, gists, etc. Quite often, you will embed code snippets or blocks in Markdown. For example, embedding code when reporting a bug can save time and help the reviewers, maintainers, or anyone seeing that issue. You can also highlight code based on the programming language to improve the code's readability and context. In this guide, we will discuss how to insert and highlight React code in GitHub Flavored Markdown. Inserting Code You can insert code in GitHub Flavored Markdown (GFM) by either indenting your code four spaces or using fenced code blocks. For example, here is a sample code for a simple express server. 1 2 3 4 5 6 7 8 9 10 11 const express = require("express"); const app = express(); const port = 3000; app.get("/", (req, res) => { res.send("Hello World!"); }); app.listen(port, () => { console.log(`Example app listening at http://localhost:${port}`); }); javascript Copy and paste this code into a .md file in any GitHub repo or a gist and commit the changes. Here is how this Markdown file will look: no_indents Since you have not included any indents or fenced code blocks, GFM treats the code as regular text. You can see this GitHub gist here. Now indent the entire code four spaces. You will notice that the code block will fade once you have indented the code. fade_code Now commit this change, and you will see that the Markdown will format the code block this time. four_indent You can find this example gist here. Fenced Code Blocks You can also insert code in Markdown by placing triple backticks (```) before and after a code block. Notice that, like last time, the code will fade inside triple backticks. fenced_code_block Here is how this Markdown file will look: fenced_code You can find this example gist here. Highlighting Code To highlight code, write the name of the language the code is written in after the initial triple backticks. In the above example, the code is written in JavaScript, and hence javascript is added after triple backticks. highlighted_code Here is how this highlighted code will look: preview You can find this example gist here. Similarly, you can highlight code written in other programming languages such as Ruby, Python, etc. React is a JavaScript framework, or technically a library, so adding javascript after the triple backticks should work and highlight the code. Adding javascript after ``` does highlight the code, but it does so by treating it as a JavaScript code. Since React uses JSX to highlight React code, jsx should be used instead of javascript after the triple backticks. Here is a sample React code that illustrates this. 1 2 3 4 5 6 7 8 9 10 11 12 import React from 'react'; import './App.css'; function App() { return ( <div className="App"> Hello World! </div> ); } export default App; jsx First, javascript is added after the triple backticks. javascript_highlight Here is how this code is highlighted. preview You can find this example gist here. Now, jsx is added after the triple backticks. JSX_highlight Here is how the code is highlighted this time. preview You can find this example gist here. Though the differences are minute, you can see how the highlighting is changed based on the use of javascript and jsx after ```. In general, it is better to use jsx to highlight React code. Even in this guide, jsx is used in the above code block to highlight React code. preview Conclusion In this guide, we discussed how you can insert code in GitHub Flavored Markdown using indentation and fenced code blocks. We also discussed how to highlight JavaScript and React code in GitHub Flavored Markdown. Here are some resources that you may find useful: Happy coding! 5	{ "url": "https://www.pluralsight.com/guides/highlight-react-in-github-markdown", "source_domain": "www.pluralsight.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "113536", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LFXDQBXZSO2EQO65DUNNTIVHHLENSP5F", "WARC-Concurrent-To": "<urn:uuid:39e17025-c8f1-47b9-bde7-3e1327604896>", "WARC-Date": "2021-04-23T14:40:05Z", "WARC-IP-Address": "104.19.161.127", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:64CAQEN2XPUDH42BH7GW37BKX7XYQANE", "WARC-Record-ID": "<urn:uuid:cb3a365b-906b-4d4d-961f-9cfd9b155e3b>", "WARC-Target-URI": "https://www.pluralsight.com/guides/highlight-react-in-github-markdown", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:91d0474c-17f4-473a-be60-ef24a516eb82>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-190.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, 14, 15, 30, 31, 83, 84, 99, 100, 117, 132, 148, 165, 180, 196, 212, 238, 261, 267, 268, 281, 282, 572, 573, 890, 891, 1194, 1195, 1294, 1295, 1310, 1311, 1436, 1437, 1501, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1523, 1526, 1562, 1585, 1604, 1605, 1634, 1662, 1666, 1667, 1692, 1760, 1764, 1775, 1776, 1912, 1913, 1924, 1925, 2060, 2061, 2180, 2181, 2191, 2192, 2289, 2290, 2339, 2340, 2359, 2360, 2535, 2536, 2554, 2555, 2597, 2598, 2610, 2611, 2648, 2649, 2667, 2668, 2905, 2906, 2951, 2952, 2960, 2961, 2998, 2999, 3099, 3100, 3348, 3349, 3464, 3465, 3516, 3517, 3519, 3521, 3523, 3525, 3527, 3529, 3531, 3533, 3535, 3538, 3541, 3544, 3571, 3591, 3592, 3609, 3620, 3646, 3670, 3681, 3686, 3688, 3689, 3709, 3713, 3714, 3769, 3770, 3791, 3792, 3830, 3831, 3839, 3840, 3877, 3878, 3924, 3925, 3939, 3940, 3987, 3988, 3996, 3997, 4034, 4035, 4164, 4165, 4307, 4308, 4316, 4317, 4328, 4329, 4541, 4542, 4592, 4593, 4607, 4608 ], "line_end_idx": [ 14, 15, 30, 31, 83, 84, 99, 100, 117, 132, 148, 165, 180, 196, 212, 238, 261, 267, 268, 281, 282, 572, 573, 890, 891, 1194, 1195, 1294, 1295, 1310, 1311, 1436, 1437, 1501, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1523, 1526, 1562, 1585, 1604, 1605, 1634, 1662, 1666, 1667, 1692, 1760, 1764, 1775, 1776, 1912, 1913, 1924, 1925, 2060, 2061, 2180, 2181, 2191, 2192, 2289, 2290, 2339, 2340, 2359, 2360, 2535, 2536, 2554, 2555, 2597, 2598, 2610, 2611, 2648, 2649, 2667, 2668, 2905, 2906, 2951, 2952, 2960, 2961, 2998, 2999, 3099, 3100, 3348, 3349, 3464, 3465, 3516, 3517, 3519, 3521, 3523, 3525, 3527, 3529, 3531, 3533, 3535, 3538, 3541, 3544, 3571, 3591, 3592, 3609, 3620, 3646, 3670, 3681, 3686, 3688, 3689, 3709, 3713, 3714, 3769, 3770, 3791, 3792, 3830, 3831, 3839, 3840, 3877, 3878, 3924, 3925, 3939, 3940, 3987, 3988, 3996, 3997, 4034, 4035, 4164, 4165, 4307, 4308, 4316, 4317, 4328, 4329, 4541, 4542, 4592, 4593, 4607, 4608, 4609 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4609, "ccnet_original_nlines": 163, "rps_doc_curly_bracket": 0.0017357299802824855, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3384955823421478, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0044247801415622234, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20685841143131256, "rps_doc_frac_unique_words": 0.36032387614250183, "rps_doc_mean_word_length": 4.797570705413818, "rps_doc_num_sentences": 52, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.985981464385986, "rps_doc_word_count": 741, "rps_doc_frac_chars_dupe_10grams": 0.023628689348697662, "rps_doc_frac_chars_dupe_5grams": 0.19774964451789856, "rps_doc_frac_chars_dupe_6grams": 0.15611813962459564, "rps_doc_frac_chars_dupe_7grams": 0.11139240860939026, "rps_doc_frac_chars_dupe_8grams": 0.09507735818624496, "rps_doc_frac_chars_dupe_9grams": 0.023628689348697662, "rps_doc_frac_chars_top_2gram": 0.02025315910577774, "rps_doc_frac_chars_top_3gram": 0.037130799144506454, "rps_doc_frac_chars_top_4gram": 0.028129400685429573, "rps_doc_books_importance": -402.0579833984375, "rps_doc_books_importance_length_correction": -402.0579833984375, "rps_doc_openwebtext_importance": -201.07196044921875, "rps_doc_openwebtext_importance_length_correction": -201.07196044921875, "rps_doc_wikipedia_importance": -200.66102600097656, "rps_doc_wikipedia_importance_length_correction": -200.66102600097656 }, "fasttext": { "dclm": 0.3936437964439392, "english": 0.8544538617134094, "fineweb_edu_approx": 3.0899856090545654, "eai_general_math": 0.9571051001548767, "eai_open_web_math": 0.1360364556312561, "eai_web_code": 0.9875872135162354 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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,638,126,699,578,154,000	0 $\begingroup$ I run a simple AR(1) model in my analysis using ols: ar.ols(df$y, order.max = 1)) However, I work with generations as my unit of analysis. Therefore, the first lag of y would be the observation of y at time t-30. How can I specify this in the AR(1) model in R? $\endgroup$ 0 $\begingroup$ If $y_t$ and $y_{t-1}$ are actually 30 observations apart, for AR(1) you can do the following: lm( tail(df$y,-30) ~ head(df$y,-30) ) This assumes the first observation is the oldest. If your variable has the first observation being the newest, switch head with tail. This would also imply overlapping observations. For AR(2) you would do lm( tail(df$y,-60) ~ tail(head(df$y,-30),-30) + head(df$y,-60) ) If you wish to trade off the added estimation efficiency due to overlapping observations for computational efficiency, you may use every 30th data point as follows: n=length(df$y) m=floor(n/30) index=seq(from=n,to=(n-m*30),by=-30) g=df$y[index] # g contains every 30th observation of y dropping the oldest few ar.ols(g, order.max = 1)) # for AR(1) ar.ols(g, order.max = 2)) # for AR(2) $\endgroup$ • $\begingroup$ If I misunderstood your setup, just let me know. Will update. $\endgroup$ – Richard Hardy Oct 21 at 10:21 • $\begingroup$ Thank you for your advice. Unfortunately, this does not work, because my dataset has about 100'000 observations and I therefore cannot regress the last 30 on the first 30 observations of y. I would like to set up an AR(I) and in a second step also an AR(II) process by comparing the correlation between an indicator in one generation and the one in the previous generation(s), whereas the generation length is assumed to be 30 years. $\endgroup$ – R-User Oct 21 at 12:07 • $\begingroup$ @R-User, note that my code does not regress the last 30 on the first 30. There is a minus sign in front. tail(df$y,-30) drops the first 30, while head(df$y,-30) drops the last 30 observations. I still do not understand the structure of your data: do your have yearly observations but are interested in generations (30 years)? Would looking at every 30th data point be what you are interested in? If so, my proposed code also works and will be slightly more efficient as it utilizes overlapping observations rather than just deleting 29 out of every 30 observations. But you could do that, too. $\endgroup$ – Richard Hardy Oct 21 at 12:53 • $\begingroup$ Thanks for the explanation. My datastructure is as follows: I do have yearly data consisting of moving averages over 30 years (e.g. the y of 1915 contains the average y for the generation 1900-1930, etc.). Now the aim is e.g. to regress the y of 1915 on the one of 1885 (as the second one is the average for the generation 1870-1900) in order to find the correlation between the two generations. $\endgroup$ – R-User Oct 21 at 13:13 • $\begingroup$ @R-User, then I think my code is just what you need. Alternatively, if you want to avoid overlapping observations and trade off a little bit of precision for computational efficiency, I will include code for that. $\endgroup$ – Richard Hardy Oct 21 at 13:17 Your Answer By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy Not the answer you're looking for? Browse other questions tagged or ask your own question.	{ "url": "https://stats.stackexchange.com/questions/432395/how-to-change-the-observation-for-the-first-lag-in-an-ar1-model", "source_domain": "stats.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2019-47", "warc_metadata": { "Content-Length": "144005", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:X3GQMUU5BVLXSQL7N672ULTA4I7Q775Z", "WARC-Concurrent-To": "<urn:uuid:9e4a6f34-d1c8-44ed-b7cd-968b778af241>", "WARC-Date": "2019-11-17T22:09:11Z", "WARC-IP-Address": "151.101.1.69", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6J2RRJMMCRYWLSFCTZUIEYPXKNMEHFRX", "WARC-Record-ID": "<urn:uuid:931bec98-b940-4270-932d-413a41e1e141>", "WARC-Target-URI": "https://stats.stackexchange.com/questions/432395/how-to-change-the-observation-for-the-first-lag-in-an-ar1-model", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:49ef568e-cf3a-4df2-9440-d7c181692a18>" }, "warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-76.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 2, 16, 17, 70, 71, 100, 101, 280, 281, 293, 295, 309, 310, 405, 406, 444, 445, 627, 628, 651, 652, 717, 718, 883, 884, 899, 913, 950, 1029, 1067, 1105, 1117, 1241, 1730, 2386, 2837, 3113, 3114, 3126, 3127, 3227, 3228 ], "line_end_idx": [ 2, 16, 17, 70, 71, 100, 101, 280, 281, 293, 295, 309, 310, 405, 406, 444, 445, 627, 628, 651, 652, 717, 718, 883, 884, 899, 913, 950, 1029, 1067, 1105, 1117, 1241, 1730, 2386, 2837, 3113, 3114, 3126, 3127, 3227, 3228, 3318 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3318, "ccnet_original_nlines": 42, "rps_doc_curly_bracket": 0.0006027700146660209, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.354292631149292, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.030229749158024788, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.333736389875412, "rps_doc_frac_unique_words": 0.43462246656417847, "rps_doc_mean_word_length": 4.60405158996582, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0.0036275701131671667, "rps_doc_unigram_entropy": 5.025572776794434, "rps_doc_word_count": 543, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07280000299215317, "rps_doc_frac_chars_dupe_6grams": 0.07280000299215317, "rps_doc_frac_chars_dupe_7grams": 0.0560000017285347, "rps_doc_frac_chars_dupe_8grams": 0.02239999920129776, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.019200000911951065, "rps_doc_frac_chars_top_3gram": 0.014000000432133675, "rps_doc_frac_chars_top_4gram": 0.025200000032782555, "rps_doc_books_importance": -421.3006896972656, "rps_doc_books_importance_length_correction": -421.3006896972656, "rps_doc_openwebtext_importance": -243.88394165039062, "rps_doc_openwebtext_importance_length_correction": -243.88394165039062, "rps_doc_wikipedia_importance": -152.28578186035156, "rps_doc_wikipedia_importance_length_correction": -152.28578186035156 }, "fasttext": { "dclm": 0.03022586926817894, "english": 0.893392026424408, "fineweb_edu_approx": 2.010385036468506, "eai_general_math": 0.19824033975601196, "eai_open_web_math": 0.5159905552864075, "eai_web_code": 0.00417286017909646 } }	{ "free_decimal_correspondence": { "primary": { "code": "519.5", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Probabilities; or, Mathematical statistics" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,897,042,792,998,214,000	Articulation of next container overwriting current container 3 posts / 0 new Letzter Beitrag Bild des Benutzers kunterbunt kunterbunt Offline Last seen vor 6 Monate 1 Woche Articulation of next container overwriting current container Software Version: Synfire 1.8.5 build 5 OS: Windows 10 Bug: Misbehaviour Reproduce-ability: 100% Reproduction steps 1. Create a new Arrangement 2. Create a new container with the size of 2 bars and call it Spiccatissimo 3. Draw a figure into the first bar of the container 4. Assign an articulation to the figure, in this case Spiccatissimo 5. Create a duplicate of that container and rename it to Staccato 6. Move the new container after the first container 7. Change the articulation of the second container figure to a different articulation than the figure of the first container, in this case Staccato 8. Select the range of the second bar for playback 9. loop playback 10. First time it plays correctly. The first figure with the first articulation 11. After that it will play the first figure using the articulation of the second figure articulation_overwrite.png P.S. I attached the sample project. Not sure if it can be used to reproduce. Bild des Benutzers andre andre Offline Last seen vor 2 Tage 13 Stunden Thanks for sharing your observations. Loop playback has a number of side effects and this is one of them. The articulation switch is sent shortly before the first note of a segment. That's why at the end of the loop, the articulation of the following segment is already sent, only milliseconds before it returns to the beginning for the next loop. There, the articulation switch of the first segment is a few milliseconds before the loop start, hence not sent again during a loop. Articulation switches take some time to go into effect. They can't therefore be tied exactly to the playback of a note. Their shifting has the said side effects. Bild des Benutzers kunterbunt kunterbunt Offline Last seen vor 6 Monate 1 Woche Well, then your loop playback needs to look ahead and plan ahead. It makes things more complex, but otherwise it gets unlogical for the user. Zum Verfassen von Kommentaren bitte Anmelden oder Registrieren. Scholarly Lite is a free theme, contributed to the Drupal Community by More than Themes.	{ "url": "https://users.cognitone.com/de/topic/articulation-next-container-overwriting-current-container", "source_domain": "users.cognitone.com", "snapshot_id": "crawl=CC-MAIN-2018-51", "warc_metadata": { "Content-Length": "64772", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PCEQS2MWLF67JSYKSFQ34KVR7H4BDBSP", "WARC-Concurrent-To": "<urn:uuid:0c61af37-e327-40e2-8e33-4c11eeedabd7>", "WARC-Date": "2018-12-09T23:38:51Z", "WARC-IP-Address": "146.148.26.140", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:AVQKY37JWXGZCBHMHFGIR22G4TGPKOJ6", "WARC-Record-ID": "<urn:uuid:fb32df2c-b644-47e8-9553-9fc0ad5db22b>", "WARC-Target-URI": "https://users.cognitone.com/de/topic/articulation-next-container-overwriting-current-container", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:636af6c5-7801-4d5e-9b4b-0ee179eb8908>" }, "warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-143-18-132.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 61, 62, 78, 94, 124, 135, 143, 174, 175, 236, 237, 277, 292, 310, 334, 353, 354, 384, 385, 463, 518, 588, 656, 710, 860, 913, 932, 1014, 1105, 1106, 1133, 1134, 1211, 1212, 1237, 1243, 1251, 1283, 1284, 1322, 1323, 1766, 1767, 1929, 1930, 1960, 1971, 1979, 2010, 2011, 2153, 2154, 2218, 2219 ], "line_end_idx": [ 61, 62, 78, 94, 124, 135, 143, 174, 175, 236, 237, 277, 292, 310, 334, 353, 354, 384, 385, 463, 518, 588, 656, 710, 860, 913, 932, 1014, 1105, 1106, 1133, 1134, 1211, 1212, 1237, 1243, 1251, 1283, 1284, 1322, 1323, 1766, 1767, 1929, 1930, 1960, 1971, 1979, 2010, 2011, 2153, 2154, 2218, 2219, 2307 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2307, "ccnet_original_nlines": 54, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3931034505367279, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.009195400401949883, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17241379618644714, "rps_doc_frac_unique_words": 0.4828495979309082, "rps_doc_mean_word_length": 4.857519626617432, "rps_doc_num_sentences": 31, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.728569984436035, "rps_doc_word_count": 379, "rps_doc_frac_chars_dupe_10grams": 0.07278653234243393, "rps_doc_frac_chars_dupe_5grams": 0.1596958190202713, "rps_doc_frac_chars_dupe_6grams": 0.13145029544830322, "rps_doc_frac_chars_dupe_7grams": 0.13145029544830322, "rps_doc_frac_chars_dupe_8grams": 0.07278653234243393, "rps_doc_frac_chars_dupe_9grams": 0.07278653234243393, "rps_doc_frac_chars_top_2gram": 0.03476371988654137, "rps_doc_frac_chars_top_3gram": 0.0260727908462286, "rps_doc_frac_chars_top_4gram": 0.029331879690289497, "rps_doc_books_importance": -205.56407165527344, "rps_doc_books_importance_length_correction": -205.56407165527344, "rps_doc_openwebtext_importance": -100.06566619873047, "rps_doc_openwebtext_importance_length_correction": -100.06566619873047, "rps_doc_wikipedia_importance": -73.82183837890625, "rps_doc_wikipedia_importance_length_correction": -73.82183837890625 }, "fasttext": { "dclm": 0.7205047607421875, "english": 0.7704389095306396, "fineweb_edu_approx": 1.6359171867370605, "eai_general_math": 0.13763642311096191, "eai_open_web_math": 0.15381669998168945, "eai_web_code": 0.03307783976197243 } }	{ "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": "781.5", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "Music theory" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,897,874,134,606,559,000	RESUME Aus C64-Wiki Zur Navigation springenZur Suche springen Begriffsklärung Der Titel dieses Artikels ist mehrdeutig. RESUME (Begriffsklärung). RESUME Syntax: RESUME Parameter keine Einordnung Typ: Anweisung Kontext: Strukturkontrolle Aufgabe: Beendet eine Tastatur-Kontrollroutine Abkürzung: keine Token: $64 $39 (100 57) Verwandte Befehle ON KEY - DISABLE Dieser Artikel beschreibt das Simons'-Basic-Schlüsselwort RESUME. Typ: Anweisung Syntax: RESUME RESUME bildet den Abschluss einer BASIC-Routine, die auf die Tastendrücke reagiert, die durch ON KEY abgefangen werden sollen. Der Interpreter fährt daraufhin unmittelbar hinter der Stelle fort, an der er durch den Tastendruck unterbrochen wurde. Da eine solche Routine mit DISABLE beginnen sollte, schaltet RESUME den ON-KEY-Modus auch wieder ein. Dieser Befehl wurde in TSB um weitere Funktionen ergänzt, siehe RESUME (TSB). Beispiel[Bearbeiten \| Quelltext bearbeiten] 10 ON KEY "abc",: GOTO 10000 ... langes Programm ... 10000 DISABLE 10010 tt$ = CHR$(STATUS) : REM gedrueckte Taste 10020 IF tt$ = "a" THEN PRINT AT(35,0)"ah!" 10030 IF tt$ = "b" THEN PRINT AT(35,0)"beh!" 10040 IF tt$ = "c" THEN PRINT AT(35,0)"zeh!" 10050 RESUME : REM bei Unterbrechung weiter machen Wenn der Benutzer irgendwann im Programmlauf "a", "b" oder "c" drückt, verzweigt die Programmausführung vorübergehend zu Zeile 10000 und setzt danach per RESUME an der unterbrochen Stelle fort.	{ "url": "https://www.c64-wiki.de/wiki/RESUME", "source_domain": "www.c64-wiki.de", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "31159", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DSVVOFUORHPRPBVSHUS65ZAZQK6O3JZG", "WARC-Concurrent-To": "<urn:uuid:c2d9ab21-f1df-4dca-a87a-914eaf63cddd>", "WARC-Date": "2024-07-20T10:37:41Z", "WARC-IP-Address": "46.163.72.250", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IRQUHWU4NVQENB6S55O3QCH3SNJGKCBR", "WARC-Record-ID": "<urn:uuid:44e81d0e-1358-4099-a054-e306f1fec9d4>", "WARC-Target-URI": "https://www.c64-wiki.de/wiki/RESUME", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c48ac7ec-5fa2-41fe-a19b-64951d691bc8>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 7, 8, 21, 63, 147, 154, 169, 179, 185, 196, 211, 238, 285, 302, 326, 344, 361, 362, 363, 429, 430, 445, 460, 461, 810, 811, 812, 890, 891, 892, 936, 937, 966, 967, 991, 992, 1006, 1054, 1098, 1143, 1188, 1239, 1240 ], "line_end_idx": [ 7, 8, 21, 63, 147, 154, 169, 179, 185, 196, 211, 238, 285, 302, 326, 344, 361, 362, 363, 429, 430, 445, 460, 461, 810, 811, 812, 890, 891, 892, 936, 937, 966, 967, 991, 992, 1006, 1054, 1098, 1143, 1188, 1239, 1240, 1433 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1433, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.03484321013092995, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.149825781583786, "rps_doc_frac_lines_end_with_ellipsis": 0.022727269679307938, "rps_doc_frac_no_alph_words": 0.3414634168148041, "rps_doc_frac_unique_words": 0.7105263471603394, "rps_doc_mean_word_length": 5.973684310913086, "rps_doc_num_sentences": 13, "rps_doc_symbol_to_word_ratio": 0.00696863979101181, "rps_doc_unigram_entropy": 4.723141193389893, "rps_doc_word_count": 190, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0, "rps_doc_frac_chars_dupe_6grams": 0, "rps_doc_frac_chars_dupe_7grams": 0, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013215860351920128, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -152.61813354492188, "rps_doc_books_importance_length_correction": -150.4052276611328, "rps_doc_openwebtext_importance": -88.056396484375, "rps_doc_openwebtext_importance_length_correction": -88.056396484375, "rps_doc_wikipedia_importance": -64.128173828125, "rps_doc_wikipedia_importance_length_correction": -57.177642822265625 }, "fasttext": { "dclm": 0.850898027420044, "english": 0.0047191898338496685, "fineweb_edu_approx": 2.5619118213653564, "eai_general_math": 0.03288019075989723, "eai_open_web_math": 0.7218930125236511, "eai_web_code": 0.5388650894165039 } }	{ "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.164", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,332,391,826,958,519,000	The Rise of Parody This is an excerpt from Dr. Silly Freehold’s talk, “The rise of parody.” This was given in Boar’s Blemish University on the 15th anniversary of Invocation Day – 3 years after the War of Injunction ended. You all, of course, know the story of the early days of the war. In Spring 225 1 the Great Firewall in the Pass of Commons was brought completely down by the Copyright Horde. The 17th and 34th Gnomish divisions were routed, but quickly regrouped and fell back toward the mines of Great Roll. They fought valiantly as they retreated, drawing the bulk of the Horde’s forces after them as they fell back. Many of these brave Gnomes were the first to be wounded with the Horde’s “fade-rounds,” their names and contributions to the fight now lost to us. Survivors tell of a desperate struggle to keep back the Horde from the civilian population until it could be evacuated under the Copper Mountains. As I said, it was a valiant effort, but it also left the city of Boar’s Blemish, just slightly to the North and East of the Pass of Commons, exposed to a Horde attack. The 17th Gnomish Infantry had attempted to fall back towards the city once the firewall had fallen, but were ambushed by a brigade of Patent Trolls who had somehow managed to get in front of them. Despite a numerical advantage, the Gnomes were no match for the aggressive trolls, and sustained nearly 50% casualties before linking back up with the 34th and it’s heroic stand. In desperation the Principal of Boar’s Blemish called to The Empty Throne for reinforcements, only to be told that none would be forthcoming. The Realm had not been prepared for war. The Dwarves of Red Mine we’re busy creating a software patch for the collapsed firewall, and wouldn’t be able to have an impact on the changing situation until they came out with new code, hopefully in the coming year. The Darned Elves will still refusing to take the field until they got what they felt was a fair exchange rate between socks and pennies 2. The Penny Gnomes, as I said, were preoccupied with saving the population around Great Roll. The Classics, as usual, ignored all calls for help. The Magicasters were on their own, and believed they had less than three days before the bulk of the Copyright Horde was in position to attack their city. It was then one of the greatest intelligence triumphs of the war occurred. Late one night, four days after the Great Firewall had collapsed, a lone Lawyer approached the Magicaster pickets and indicated a desire to defect. From this lone warrior the armed forces of The Realm learned the strategies governing the current invasion, as well as some insight into the nature of the Copyright Horde itself (which we’ll cover in tomorrow’s lecture). Of particular interest to the defenders in and around Boar’s Blemish was intelligence on a new type of weapon which the Horde intended to unleash upon the city, an injunction bomb. While the injunction had been a useful tool against individual soldiers or units, the Horde had not yet been able to make an injunction stick against an entire population center – there was nothing “infringing enough” to write an injunction which would hold against wide area. The Magicasters, however, with their presumed similarities towards certain Actualized Works 3 provided the Horde their first opportunity unleash the full power of their injunction weapons. The news of this bomb created great alarm within the city and among its defenders – the threat of an injunction bomb was truly terrifying. Yet the Horde’s tactic also provided the city’s hope of deliverance. Within hours of discovering their impending danger, the Magicasters of Boar’s Blemish began devising a novel defense for their imperiled town. They set about developing The Realm’s first parody shield. With speed and desperation born through terror, the Magicasters rewrote the town charter to retcon it’s history. The town scribes changed both the town name and the identity of those who lived there into forms which betrayed an obvious, yet slightly warped, tie to certain Actualized Works – thus breaking the power of the injunction. It was a dangerous chance, if the Parody Shield failed then Boar’s Blemish would almost certainly cease to exist. Six days later, when the Horde finally moved on the isolated city, the injunction bomb was finally detonated. It did no damage. Confused and demoralized, the Horde paused in their attack. Instead of moving on a devastated city and capturing defeated survivors, The Horde was faced with a suddenly confident enemy which was suddenly immune to their most powerful weapon. In their confusion, the defenders of Boar’s Blemish took to the offensive and began the process of driving the enemy from their boundaries. Six weeks from day the firewall came down, the bulk of The Horde had been pushed back through the Pass of Commons. The Realm would survive to fight another day. 1. The current calendar in The Realm begins with the establishment of the first US Patent Act. No one knows why, and the pixies aren’t saying. 2. The Darned Elves hold that the best basis for currency in The Realm is a single sock, taken from a dryer in the real world. The rest of The Realm is quite happy on the Penny Standard. 3. Even years after the Copyright Horde was defeated the citizens of The Realm were wary of referring to Actualized Works by name – they remembered how such mentions were used a targeting beacons during the war.	{ "url": "https://painfullyhopeful.me/2015/02/03/the-rise-of-parody/", "source_domain": "painfullyhopeful.me", "snapshot_id": "crawl=CC-MAIN-2020-16", "warc_metadata": { "Content-Length": "118548", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QX5NUJFAMNE4ZK6TTFTIEK6JSB2FSBHI", "WARC-Concurrent-To": "<urn:uuid:89070a93-4180-42b7-9921-d1458c1784e9>", "WARC-Date": "2020-04-05T07:31:36Z", "WARC-IP-Address": "192.0.78.25", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:EDJ5UT6ZXZ6CZUMEFGDCOETIKGMSKYCH", "WARC-Record-ID": "<urn:uuid:48bfe402-8d7c-4b07-8049-8d12de75ccae>", "WARC-Target-URI": "https://painfullyhopeful.me/2015/02/03/the-rise-of-parody/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:22176945-a542-460d-9414-0d055ead5b29>" }, "warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81.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, 19, 20, 224, 225, 921, 922, 1466, 1467, 1650, 1651, 2308, 2309, 2753, 2754, 3752, 3753, 3812, 3813, 4148, 4149, 4373, 4374, 4935, 4936, 4937, 5083, 5273 ], "line_end_idx": [ 19, 20, 224, 225, 921, 922, 1466, 1467, 1650, 1651, 2308, 2309, 2753, 2754, 3752, 3753, 3812, 3813, 4148, 4149, 4373, 4374, 4935, 4936, 4937, 5083, 5273, 5487 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5487, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4414498209953308, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0027880999259650707, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11988847702741623, "rps_doc_frac_unique_words": 0.45638298988342285, "rps_doc_mean_word_length": 4.717021465301514, "rps_doc_num_sentences": 47, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.282890319824219, "rps_doc_word_count": 940, "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.015787100419402122, "rps_doc_frac_chars_top_3gram": 0.015336040407419205, "rps_doc_frac_chars_top_4gram": 0.010825440287590027, "rps_doc_books_importance": -580.2841186523438, "rps_doc_books_importance_length_correction": -580.2841186523438, "rps_doc_openwebtext_importance": -367.2372741699219, "rps_doc_openwebtext_importance_length_correction": -367.2372741699219, "rps_doc_wikipedia_importance": -306.5511474609375, "rps_doc_wikipedia_importance_length_correction": -306.5511474609375 }, "fasttext": { "dclm": 0.08029556274414062, "english": 0.9753827452659607, "fineweb_edu_approx": 2.435602903366089, "eai_general_math": 0.05930608883500099, "eai_open_web_math": 0.2937847971916199, "eai_web_code": 0.01072848029434681 } }	{ "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": "343.73", "labels": { "level_1": "Social sciences", "level_2": "Law", "level_3": "Criminal law" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "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": "10", "label": "Knowledge Article" }, "secondary": { "code": "7", "label": "Creative Writing" } }, "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": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-879,388,992,992,513,800	Beefy Boxes and Bandwidth Generously Provided by pair Networks Do you know where your variables are? PerlMonks Conway's Kindergarten talk by TheoPetersen (Priest) on Aug 15, 2001 at 18:17 UTC ( #105050=monkdiscuss: print w/replies, xml ) Need Help?? Should you be looking for yet another commentary on good behavior in an on-line community, I recommend Conway's lightning talk on the subject. Replies are listed 'Best First'. Re: Conway's Kindergarten talk by mirod (Canon) on Aug 15, 2001 at 19:12 UTC By the way, that was not a talk. It was a song! What was the tune? Gilbert and Sullivan's patter song "I am the very model of a modern major-general"? If so, did he try singing it at speed? (For those who don't know, G&S were noted for their patter songs. They were very lighthearted songs that were meant to be sung extremely fast which practically trip over themselves. They are infamous for exercising your enunciation...) UPDATE Oops, premchai21 corrected me on the title. The patter is actually 'opera'. :) In case anyone is particularly interested, the song is from the light (comic) opera "Pirates of Penzance", and its original lyrics go along the following lines: GENERAL: I am the very model of a modern Major-General, I've information vegetable, animal, and mineral, I know the kings of England, and I quote the fights historical From Marathon to Waterloo, in order categorical; I'm very well acquainted, too, with matters mathematical, I understand equations, both the simple and quadratical, About binomial theorem I'm teeming with a lot o' news, With many cheerful facts about the square of the hypotenuse. ALL: With many cheerful facts, etc. etc. etc. GENERAL: I'm very good at integral and differential calculus; I know the scientific names of beings animalculus: In short, in matters vegetable, animal, and mineral, I am the very model of a modern Major-General. Three guesses why it appeals to geeks. :) Not quite at speed. Maybe 2/3 speed. It was still impressive. A decade ago I heard Stan Kelly Bootle do that to "Software Pirates of Pizants (sp?)". Great song. Log In? Username: Password: What's my password? Create A New User Node Status? node history Node Type: monkdiscuss [id://105050] Approved by root help Chatterbox? and all is quiet... How do I use this? \| Other CB clients Other Users? Others romping around the Monastery: (5) As of 2017-10-22 10:12 GMT Sections? Information? Find Nodes? Leftovers? Voting Booth? My fridge is mostly full of: Results (272 votes). Check out past polls. Notices?	{ "url": "http://www.perlmonks.org/?node_id=105050", "source_domain": "www.perlmonks.org", "snapshot_id": "crawl=CC-MAIN-2017-43", "warc_metadata": { "Content-Length": "24190", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2XSM2ZQZRUXURY3B2PQYML5VJOAANCWF", "WARC-Concurrent-To": "<urn:uuid:c07a0187-4b7d-4bc0-b936-ae3c97a243b5>", "WARC-Date": "2017-10-22T10:14:02Z", "WARC-IP-Address": "209.197.123.153", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LXLKKDCNCWJMIWAXA5ZHIZKZ2BYKXWOI", "WARC-Record-ID": "<urn:uuid:3f20a542-5f9b-4dca-81f3-44c32ac0f775>", "WARC-Target-URI": "http://www.perlmonks.org/?node_id=105050", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9e9f1caa-2472-4baa-9ba3-295453e60e2f>" }, "warc_info": "robots: classic\r\nhostname: ip-10-183-219-92.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 63, 101, 103, 115, 116, 143, 144, 169, 256, 257, 400, 401, 434, 465, 511, 512, 564, 565, 674, 675, 720, 721, 963, 964, 977, 1027, 1028, 1232, 1233, 1297, 1363, 1443, 1509, 1584, 1658, 1730, 1808, 1817, 1876, 1885, 1955, 2023, 2093, 2157, 2166, 2167, 2217, 2218, 2288, 2395, 2396, 2404, 2414, 2424, 2425, 2445, 2463, 2476, 2489, 2526, 2543, 2548, 2560, 2580, 2581, 2619, 2632, 2673, 2700, 2710, 2723, 2735, 2746, 2764, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2808, 2809, 2810, 2811, 2812, 2813, 2814, 2861, 2862 ], "line_end_idx": [ 63, 101, 103, 115, 116, 143, 144, 169, 256, 257, 400, 401, 434, 465, 511, 512, 564, 565, 674, 675, 720, 721, 963, 964, 977, 1027, 1028, 1232, 1233, 1297, 1363, 1443, 1509, 1584, 1658, 1730, 1808, 1817, 1876, 1885, 1955, 2023, 2093, 2157, 2166, 2167, 2217, 2218, 2288, 2395, 2396, 2404, 2414, 2424, 2425, 2445, 2463, 2476, 2489, 2526, 2543, 2548, 2560, 2580, 2581, 2619, 2632, 2673, 2700, 2710, 2723, 2735, 2746, 2764, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2808, 2809, 2810, 2811, 2812, 2813, 2814, 2861, 2862, 2874 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2874, "ccnet_original_nlines": 94, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29505300521850586, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04593639820814133, "rps_doc_frac_lines_end_with_ellipsis": 0.010526319965720177, "rps_doc_frac_no_alph_words": 0.2632508873939514, "rps_doc_frac_unique_words": 0.6165048480033875, "rps_doc_mean_word_length": 4.7669901847839355, "rps_doc_num_sentences": 40, "rps_doc_symbol_to_word_ratio": 0.005300350021570921, "rps_doc_unigram_entropy": 5.243667125701904, "rps_doc_word_count": 412, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.09419552236795425, "rps_doc_frac_chars_dupe_6grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_7grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_8grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_9grams": 0.05498981848359108, "rps_doc_frac_chars_top_2gram": 0.004582480061799288, "rps_doc_frac_chars_top_3gram": 0.009164970368146896, "rps_doc_frac_chars_top_4gram": 0.015274950303137302, "rps_doc_books_importance": -213.15335083007812, "rps_doc_books_importance_length_correction": -213.15335083007812, "rps_doc_openwebtext_importance": -101.79734802246094, "rps_doc_openwebtext_importance_length_correction": -101.79734802246094, "rps_doc_wikipedia_importance": -70.96728515625, "rps_doc_wikipedia_importance_length_correction": -70.96728515625 }, "fasttext": { "dclm": 0.08780937641859055, "english": 0.9529244899749756, "fineweb_edu_approx": 1.3489352464675903, "eai_general_math": 0.019548539072275162, "eai_open_web_math": 0.29015791416168213, "eai_web_code": 0.00001109000004362315 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "782.42164", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "Dramatic music" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-8,380,879,540,561,759,000	LLVM 6.0.0svn MipsSEISelLowering.cpp Go to the documentation of this file. 1 //===- MipsSEISelLowering.cpp - MipsSE DAG Lowering Interface -------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // Subclass of MipsTargetLowering specialized for mips32/64. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "MipsSEISelLowering.h" 15 #include "MipsMachineFunction.h" 16 #include "MipsRegisterInfo.h" 17 #include "MipsSubtarget.h" 18 #include "llvm/ADT/APInt.h" 19 #include "llvm/ADT/ArrayRef.h" 20 #include "llvm/ADT/STLExtras.h" 21 #include "llvm/ADT/SmallVector.h" 22 #include "llvm/ADT/Triple.h" 37 #include "llvm/IR/DebugLoc.h" 38 #include "llvm/IR/Intrinsics.h" 39 #include "llvm/Support/Casting.h" 41 #include "llvm/Support/Debug.h" 45 #include <algorithm> 46 #include <cassert> 47 #include <cstdint> 48 #include <iterator> 49 #include <utility> 50 51 using namespace llvm; 52 53 #define DEBUG_TYPE "mips-isel" 54 55 static cl::opt<bool> 56 UseMipsTailCalls("mips-tail-calls", cl::Hidden, 57 cl::desc("MIPS: permit tail calls."), cl::init(false)); 58 59 static cl::opt<bool> NoDPLoadStore("mno-ldc1-sdc1", cl::init(false), 60 cl::desc("Expand double precision loads and " 61 "stores to their single precision " 62 "counterparts")); 63 65 const MipsSubtarget &STI) 66 : MipsTargetLowering(TM, STI) { 67 // Set up the register classes 68 addRegisterClass(MVT::i32, &Mips::GPR32RegClass); 69 70 if (Subtarget.isGP64bit()) 71 addRegisterClass(MVT::i64, &Mips::GPR64RegClass); 72 73 if (Subtarget.hasDSP() \|\| Subtarget.hasMSA()) { 74 // Expand all truncating stores and extending loads. 75 for (MVT VT0 : MVT::vector_valuetypes()) { 76 for (MVT VT1 : MVT::vector_valuetypes()) { 77 setTruncStoreAction(VT0, VT1, Expand); 81 } 82 } 83 } 84 85 if (Subtarget.hasDSP()) { 87 88 for (unsigned i = 0; i < array_lengthof(VecTys); ++i) { 89 addRegisterClass(VecTys[i], &Mips::DSPRRegClass); 90 91 // Expand all builtin opcodes. 92 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 93 setOperationAction(Opc, VecTys[i], Expand); 94 95 setOperationAction(ISD::ADD, VecTys[i], Legal); 96 setOperationAction(ISD::SUB, VecTys[i], Legal); 97 setOperationAction(ISD::LOAD, VecTys[i], Legal); 98 setOperationAction(ISD::STORE, VecTys[i], Legal); 100 } 101 107 } 108 109 if (Subtarget.hasDSPR2()) 111 112 if (Subtarget.hasMSA()) { 113 addMSAIntType(MVT::v16i8, &Mips::MSA128BRegClass); 114 addMSAIntType(MVT::v8i16, &Mips::MSA128HRegClass); 115 addMSAIntType(MVT::v4i32, &Mips::MSA128WRegClass); 116 addMSAIntType(MVT::v2i64, &Mips::MSA128DRegClass); 117 addMSAFloatType(MVT::v8f16, &Mips::MSA128HRegClass); 118 addMSAFloatType(MVT::v4f32, &Mips::MSA128WRegClass); 119 addMSAFloatType(MVT::v2f64, &Mips::MSA128DRegClass); 120 121 // f16 is a storage-only type, always promote it to f32. 122 addRegisterClass(MVT::f16, &Mips::MSA128HRegClass); 158 164 } 165 166 if (!Subtarget.useSoftFloat()) { 167 addRegisterClass(MVT::f32, &Mips::FGR32RegClass); 168 169 // When dealing with single precision only, use libcalls 170 if (!Subtarget.isSingleFloat()) { 171 if (Subtarget.isFP64bit()) 172 addRegisterClass(MVT::f64, &Mips::FGR64RegClass); 173 else 174 addRegisterClass(MVT::f64, &Mips::AFGR64RegClass); 175 } 176 } 177 182 183 if (Subtarget.hasCnMips()) 185 else if (Subtarget.isGP64bit()) 187 188 if (Subtarget.isGP64bit()) { 195 } 196 199 205 207 211 212 if (NoDPLoadStore) { 215 } 216 217 if (Subtarget.hasMips32r6()) { 218 // MIPS32r6 replaces the accumulator-based multiplies with a three register 219 // instruction 225 226 // MIPS32r6 replaces the accumulator-based division/remainder with separate 227 // three register division and remainder instructions. 234 235 // MIPS32r6 replaces conditional moves with an equivalent that removes the 236 // need for three GPR read ports. 240 244 245 assert(Subtarget.isFP64bit() && "FR=1 is required for MIPS32r6"); 249 251 252 // Floating point > and >= are supported via < and <= 257 262 } 263 264 if (Subtarget.hasMips64r6()) { 265 // MIPS64r6 replaces the accumulator-based multiplies with a three register 266 // instruction 272 273 // MIPS32r6 replaces the accumulator-based division/remainder with separate 274 // three register division and remainder instructions. 281 282 // MIPS64r6 replaces conditional moves with an equivalent that removes the 283 // need for three GPR read ports. 287 } 288 290 } 291 292 const MipsTargetLowering * 294 const MipsSubtarget &STI) { 295 return new MipsSETargetLowering(TM, STI); 296 } 297 298 const TargetRegisterClass * 300 if (VT == MVT::Untyped) 301 return Subtarget.hasDSP() ? &Mips::ACC64DSPRegClass : &Mips::ACC64RegClass; 302 304 } 305 306 // Enable MSA support for the given integer type and Register class. 309 addRegisterClass(Ty, RC); 310 311 // Expand all builtin opcodes. 312 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 313 setOperationAction(Opc, Ty, Expand); 314 321 339 340 if (Ty == MVT::v4i32 \|\| Ty == MVT::v2i64) { 345 } 346 353 } 354 355 // Enable MSA support for the given floating-point type and Register class. 358 addRegisterClass(Ty, RC); 359 360 // Expand all builtin opcodes. 361 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 362 setOperationAction(Opc, Ty, Expand); 363 370 371 if (Ty != MVT::v8f16) { 383 391 } 392 } 393 394 SDValue MipsSETargetLowering::lowerSELECT(SDValue Op, SelectionDAG &DAG) const { 395 if(!Subtarget.hasMips32r6()) 396 return MipsTargetLowering::LowerOperation(Op, DAG); 397 398 EVT ResTy = Op->getValueType(0); 399 SDLoc DL(Op); 400 401 // Although MTC1_D64 takes an i32 and writes an f64, the upper 32 bits of the 402 // floating point register are undefined. Not really an issue as sel.d, which 403 // is produced from an FSELECT node, only looks at bit 0. 404 SDValue Tmp = DAG.getNode(MipsISD::MTC1_D64, DL, MVT::f64, Op->getOperand(0)); 405 return DAG.getNode(MipsISD::FSELECT, DL, ResTy, Tmp, Op->getOperand(1), 406 Op->getOperand(2)); 407 } 408 409 bool 411 unsigned, 412 unsigned, 413 bool Fast) const { 415 417 // MIPS32r6/MIPS64r6 is required to support unaligned access. It's 418 // implementation defined whether this is handled by hardware, software, or 419 // a hybrid of the two but it's expected that most implementations will 420 // handle the majority of cases in hardware. 421 if (Fast) 422 Fast = true; 423 return true; 424 } 425 426 switch (SVT) { 427 case MVT::i64: 428 case MVT::i32: 429 if (Fast) 430 Fast = true; 431 return true; 432 default: 433 return false; 434 } 435 } 436 438 SelectionDAG &DAG) const { 439 switch(Op.getOpcode()) { 440 case ISD::LOAD: return lowerLOAD(Op, DAG); 441 case ISD::STORE: return lowerSTORE(Op, DAG); 442 case ISD::SMUL_LOHI: return lowerMulDiv(Op, MipsISD::Mult, true, true, DAG); 443 case ISD::UMUL_LOHI: return lowerMulDiv(Op, MipsISD::Multu, true, true, DAG); 444 case ISD::MULHS: return lowerMulDiv(Op, MipsISD::Mult, false, true, DAG); 445 case ISD::MULHU: return lowerMulDiv(Op, MipsISD::Multu, false, true, DAG); 446 case ISD::MUL: return lowerMulDiv(Op, MipsISD::Mult, true, false, DAG); 447 case ISD::SDIVREM: return lowerMulDiv(Op, MipsISD::DivRem, true, true, DAG); 448 case ISD::UDIVREM: return lowerMulDiv(Op, MipsISD::DivRemU, true, true, 449 DAG); 450 case ISD::INTRINSIC_WO_CHAIN: return lowerINTRINSIC_WO_CHAIN(Op, DAG); 451 case ISD::INTRINSIC_W_CHAIN: return lowerINTRINSIC_W_CHAIN(Op, DAG); 452 case ISD::INTRINSIC_VOID: return lowerINTRINSIC_VOID(Op, DAG); 453 case ISD::EXTRACT_VECTOR_ELT: return lowerEXTRACT_VECTOR_ELT(Op, DAG); 454 case ISD::BUILD_VECTOR: return lowerBUILD_VECTOR(Op, DAG); 455 case ISD::VECTOR_SHUFFLE: return lowerVECTOR_SHUFFLE(Op, DAG); 456 case ISD::SELECT: return lowerSELECT(Op, DAG); 457 } 458 459 return MipsTargetLowering::LowerOperation(Op, DAG); 460 } 461 462 // Fold zero extensions into MipsISD::VEXTRACT_[SZ]EXT_ELT 463 // 464 // Performs the following transformations: 465 // - Changes MipsISD::VEXTRACT_[SZ]EXT_ELT to zero extension if its 466 // sign/zero-extension is completely overwritten by the new one performed by 467 // the ISD::AND. 468 // - Removes redundant zero extensions performed by an ISD::AND. 471 const MipsSubtarget &Subtarget) { 472 if (!Subtarget.hasMSA()) 473 return SDValue(); 474 475 SDValue Op0 = N->getOperand(0); 476 SDValue Op1 = N->getOperand(1); 477 unsigned Op0Opcode = Op0->getOpcode(); 478 479 // (and (MipsVExtract[SZ]Ext $a, $b, $c), imm:$d) 480 // where $d + 1 == 2^n and n == 32 481 // or $d + 1 == 2^n and n <= 32 and ZExt 482 // -> (MipsVExtractZExt $a, $b, $c) 483 if (Op0Opcode == MipsISD::VEXTRACT_SEXT_ELT \|\| 484 Op0Opcode == MipsISD::VEXTRACT_ZEXT_ELT) { 486 487 if (!Mask) 488 return SDValue(); 489 490 int32_t Log2IfPositive = (Mask->getAPIntValue() + 1).exactLogBase2(); 491 492 if (Log2IfPositive <= 0) 493 return SDValue(); // Mask+1 is not a power of 2 494 495 SDValue Op0Op2 = Op0->getOperand(2); 496 EVT ExtendTy = cast<VTSDNode>(Op0Op2)->getVT(); 497 unsigned ExtendTySize = ExtendTy.getSizeInBits(); 498 unsigned Log2 = Log2IfPositive; 499 500 if ((Op0Opcode == MipsISD::VEXTRACT_ZEXT_ELT && Log2 >= ExtendTySize) \|\| 501 Log2 == ExtendTySize) { 502 SDValue Ops[] = { Op0->getOperand(0), Op0->getOperand(1), Op0Op2 }; 503 return DAG.getNode(MipsISD::VEXTRACT_ZEXT_ELT, SDLoc(Op0), 504 Op0->getVTList(), 505 makeArrayRef(Ops, Op0->getNumOperands())); 506 } 507 } 508 509 return SDValue(); 510 } 511 512 // Determine if the specified node is a constant vector splat. 513 // 514 // Returns true and sets Imm if: 515 // N is a ISD::BUILD_VECTOR representing a constant splat 516 // 517 // This function is quite similar to MipsSEDAGToDAGISel::selectVSplat. The 518 // differences are that it assumes the MSA has already been checked and the 519 // arbitrary requirement for a maximum of 32-bit integers isn't applied (and 520 // must not be in order for binsri.d to be selectable). 521 static bool isVSplat(SDValue N, APInt &Imm, bool IsLittleEndian) { 523 524 if (!Node) 525 return false; 526 527 APInt SplatValue, SplatUndef; 528 unsigned SplatBitSize; 529 bool HasAnyUndefs; 530 531 if (!Node->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs, 532 8, !IsLittleEndian)) 533 return false; 534 535 Imm = SplatValue; 536 537 return true; 538 } 539 540 // Test whether the given node is an all-ones build_vector. 541 static bool isVectorAllOnes(SDValue N) { 542 // Look through bitcasts. Endianness doesn't matter because we are looking 543 // for an all-ones value. 544 if (N->getOpcode() == ISD::BITCAST) 545 N = N->getOperand(0); 546 548 549 if (!BVN) 550 return false; 551 552 APInt SplatValue, SplatUndef; 553 unsigned SplatBitSize; 554 bool HasAnyUndefs; 555 556 // Endianness doesn't matter in this context because we are looking for 557 // an all-ones value. 558 if (BVN->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs)) 559 return SplatValue.isAllOnesValue(); 560 561 return false; 562 } 563 564 // Test whether N is the bitwise inverse of OfNode. 565 static bool isBitwiseInverse(SDValue N, SDValue OfNode) { 566 if (N->getOpcode() != ISD::XOR) 567 return false; 568 569 if (isVectorAllOnes(N->getOperand(0))) 570 return N->getOperand(1) == OfNode; 571 572 if (isVectorAllOnes(N->getOperand(1))) 573 return N->getOperand(0) == OfNode; 574 575 return false; 576 } 577 578 // Perform combines where ISD::OR is the root node. 579 // 580 // Performs the following transformations: 581 // - (or (and $a, $mask), (and $b, $inv_mask)) => (vselect $mask, $a, $b) 582 // where $inv_mask is the bitwise inverse of $mask and the 'or' has a 128-bit 583 // vector type. 586 const MipsSubtarget &Subtarget) { 587 if (!Subtarget.hasMSA()) 588 return SDValue(); 589 590 EVT Ty = N->getValueType(0); 591 592 if (!Ty.is128BitVector()) 593 return SDValue(); 594 595 SDValue Op0 = N->getOperand(0); 596 SDValue Op1 = N->getOperand(1); 597 598 if (Op0->getOpcode() == ISD::AND && Op1->getOpcode() == ISD::AND) { 599 SDValue Op0Op0 = Op0->getOperand(0); 600 SDValue Op0Op1 = Op0->getOperand(1); 601 SDValue Op1Op0 = Op1->getOperand(0); 602 SDValue Op1Op1 = Op1->getOperand(1); 603 bool IsLittleEndian = !Subtarget.isLittle(); 604 605 SDValue IfSet, IfClr, Cond; 606 bool IsConstantMask = false; 607 APInt Mask, InvMask; 608 609 // If Op0Op0 is an appropriate mask, try to find it's inverse in either 610 // Op1Op0, or Op1Op1. Keep track of the Cond, IfSet, and IfClr nodes, while 611 // looking. 612 // IfClr will be set if we find a valid match. 613 if (isVSplat(Op0Op0, Mask, IsLittleEndian)) { 614 Cond = Op0Op0; 615 IfSet = Op0Op1; 616 617 if (isVSplat(Op1Op0, InvMask, IsLittleEndian) && 618 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 619 IfClr = Op1Op1; 620 else if (isVSplat(Op1Op1, InvMask, IsLittleEndian) && 621 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 622 IfClr = Op1Op0; 623 624 IsConstantMask = true; 625 } 626 627 // If IfClr is not yet set, and Op0Op1 is an appropriate mask, try the same 628 // thing again using this mask. 629 // IfClr will be set if we find a valid match. 630 if (!IfClr.getNode() && isVSplat(Op0Op1, Mask, IsLittleEndian)) { 631 Cond = Op0Op1; 632 IfSet = Op0Op0; 633 634 if (isVSplat(Op1Op0, InvMask, IsLittleEndian) && 635 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 636 IfClr = Op1Op1; 637 else if (isVSplat(Op1Op1, InvMask, IsLittleEndian) && 638 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 639 IfClr = Op1Op0; 640 641 IsConstantMask = true; 642 } 643 644 // If IfClr is not yet set, try looking for a non-constant match. 645 // IfClr will be set if we find a valid match amongst the eight 646 // possibilities. 647 if (!IfClr.getNode()) { 648 if (isBitwiseInverse(Op0Op0, Op1Op0)) { 649 Cond = Op1Op0; 650 IfSet = Op1Op1; 651 IfClr = Op0Op1; 652 } else if (isBitwiseInverse(Op0Op1, Op1Op0)) { 653 Cond = Op1Op0; 654 IfSet = Op1Op1; 655 IfClr = Op0Op0; 656 } else if (isBitwiseInverse(Op0Op0, Op1Op1)) { 657 Cond = Op1Op1; 658 IfSet = Op1Op0; 659 IfClr = Op0Op1; 660 } else if (isBitwiseInverse(Op0Op1, Op1Op1)) { 661 Cond = Op1Op1; 662 IfSet = Op1Op0; 663 IfClr = Op0Op0; 664 } else if (isBitwiseInverse(Op1Op0, Op0Op0)) { 665 Cond = Op0Op0; 666 IfSet = Op0Op1; 667 IfClr = Op1Op1; 668 } else if (isBitwiseInverse(Op1Op1, Op0Op0)) { 669 Cond = Op0Op0; 670 IfSet = Op0Op1; 671 IfClr = Op1Op0; 672 } else if (isBitwiseInverse(Op1Op0, Op0Op1)) { 673 Cond = Op0Op1; 674 IfSet = Op0Op0; 675 IfClr = Op1Op1; 676 } else if (isBitwiseInverse(Op1Op1, Op0Op1)) { 677 Cond = Op0Op1; 678 IfSet = Op0Op0; 679 IfClr = Op1Op0; 680 } 681 } 682 683 // At this point, IfClr will be set if we have a valid match. 684 if (!IfClr.getNode()) 685 return SDValue(); 686 687 assert(Cond.getNode() && IfSet.getNode()); 688 689 // Fold degenerate cases. 690 if (IsConstantMask) { 691 if (Mask.isAllOnesValue()) 692 return IfSet; 693 else if (Mask == 0) 694 return IfClr; 695 } 696 697 // Transform the DAG into an equivalent VSELECT. 698 return DAG.getNode(ISD::VSELECT, SDLoc(N), Ty, Cond, IfSet, IfClr); 699 } 700 701 return SDValue(); 702 } 703 704 static SDValue genConstMult(SDValue X, APInt C, const SDLoc &DL, EVT VT, 705 EVT ShiftTy, SelectionDAG &DAG) { 706 // Return 0. 707 if (C == 0) 708 return DAG.getConstant(0, DL, VT); 709 710 // Return x. 711 if (C == 1) 712 return X; 713 714 // If c is power of 2, return (shl x, log2(c)). 715 if (C.isPowerOf2()) 716 return DAG.getNode(ISD::SHL, DL, VT, X, 717 DAG.getConstant(C.logBase2(), DL, ShiftTy)); 718 719 unsigned BitWidth = C.getBitWidth(); 720 APInt Floor = APInt(BitWidth, 1) << C.logBase2(); 721 APInt Ceil = C.isNegative() ? APInt(BitWidth, 0) : 722 APInt(BitWidth, 1) << C.ceilLogBase2(); 723 724 // If \|c - floor_c\| <= \|c - ceil_c\|, 725 // where floor_c = pow(2, floor(log2(c))) and ceil_c = pow(2, ceil(log2(c))), 726 // return (add constMult(x, floor_c), constMult(x, c - floor_c)). 727 if ((C - Floor).ule(Ceil - C)) { 728 SDValue Op0 = genConstMult(X, Floor, DL, VT, ShiftTy, DAG); 729 SDValue Op1 = genConstMult(X, C - Floor, DL, VT, ShiftTy, DAG); 730 return DAG.getNode(ISD::ADD, DL, VT, Op0, Op1); 731 } 732 733 // If \|c - floor_c\| > \|c - ceil_c\|, 734 // return (sub constMult(x, ceil_c), constMult(x, ceil_c - c)). 735 SDValue Op0 = genConstMult(X, Ceil, DL, VT, ShiftTy, DAG); 736 SDValue Op1 = genConstMult(X, Ceil - C, DL, VT, ShiftTy, DAG); 737 return DAG.getNode(ISD::SUB, DL, VT, Op0, Op1); 738 } 739 742 const MipsSETargetLowering TL) { 743 EVT VT = N->getValueType(0); 744 745 if (ConstantSDNode C = dyn_cast<ConstantSDNode>(N->getOperand(1))) 746 if (!VT.isVector()) 747 return genConstMult(N->getOperand(0), C->getAPIntValue(), SDLoc(N), VT, 748 TL->getScalarShiftAmountTy(DAG.getDataLayout(), VT), 749 DAG); 750 751 return SDValue(N, 0); 752 } 753 754 static SDValue performDSPShiftCombine(unsigned Opc, SDNode N, EVT Ty, 755 SelectionDAG &DAG, 756 const MipsSubtarget &Subtarget) { 757 // See if this is a vector splat immediate node. 758 APInt SplatValue, SplatUndef; 759 unsigned SplatBitSize; 760 bool HasAnyUndefs; 761 unsigned EltSize = Ty.getScalarSizeInBits(); 763 764 if (!Subtarget.hasDSP()) 765 return SDValue(); 766 767 if (!BV \|\| 768 !BV->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs, 769 EltSize, !Subtarget.isLittle()) \|\| 770 (SplatBitSize != EltSize) \|\| 771 (SplatValue.getZExtValue() >= EltSize)) 772 return SDValue(); 773 774 SDLoc DL(N); 775 return DAG.getNode(Opc, DL, Ty, N->getOperand(0), 776 DAG.getConstant(SplatValue.getZExtValue(), DL, MVT::i32)); 777 } 778 781 const MipsSubtarget &Subtarget) { 782 EVT Ty = N->getValueType(0); 783 784 if ((Ty != MVT::v2i16) && (Ty != MVT::v4i8)) 785 return SDValue(); 786 787 return performDSPShiftCombine(MipsISD::SHLL_DSP, N, Ty, DAG, Subtarget); 788 } 789 790 // Fold sign-extensions into MipsISD::VEXTRACT_[SZ]EXT_ELT for MSA and fold 791 // constant splats into MipsISD::SHRA_DSP for DSPr2. 792 // 793 // Performs the following transformations: 794 // - Changes MipsISD::VEXTRACT_[SZ]EXT_ELT to sign extension if its 795 // sign/zero-extension is completely overwritten by the new one performed by 796 // the ISD::SRA and ISD::SHL nodes. 797 // - Removes redundant sign extensions performed by an ISD::SRA and ISD::SHL 798 // sequence. 799 // 800 // See performDSPShiftCombine for more information about the transformation 801 // used for DSPr2. 804 const MipsSubtarget &Subtarget) { 805 EVT Ty = N->getValueType(0); 806 807 if (Subtarget.hasMSA()) { 808 SDValue Op0 = N->getOperand(0); 809 SDValue Op1 = N->getOperand(1); 810 811 // (sra (shl (MipsVExtract[SZ]Ext $a, $b, $c), imm:$d), imm:$d) 812 // where $d + sizeof($c) == 32 813 // or $d + sizeof($c) <= 32 and SExt 814 // -> (MipsVExtractSExt $a, $b, $c) 815 if (Op0->getOpcode() == ISD::SHL && Op1 == Op0->getOperand(1)) { 816 SDValue Op0Op0 = Op0->getOperand(0); 817 ConstantSDNode ShAmount = dyn_cast<ConstantSDNode>(Op1); 818 819 if (!ShAmount) 820 return SDValue(); 821 822 if (Op0Op0->getOpcode() != MipsISD::VEXTRACT_SEXT_ELT && 824 return SDValue(); 825 826 EVT ExtendTy = cast<VTSDNode>(Op0Op0->getOperand(2))->getVT(); 827 unsigned TotalBits = ShAmount->getZExtValue() + ExtendTy.getSizeInBits(); 828 829 if (TotalBits == 32 \|\| 830 (Op0Op0->getOpcode() == MipsISD::VEXTRACT_SEXT_ELT && 831 TotalBits <= 32)) { 832 SDValue Ops[] = { Op0Op0->getOperand(0), Op0Op0->getOperand(1), 833 Op0Op0->getOperand(2) }; 834 return DAG.getNode(MipsISD::VEXTRACT_SEXT_ELT, SDLoc(Op0Op0), 835 Op0Op0->getVTList(), 836 makeArrayRef(Ops, Op0Op0->getNumOperands())); 837 } 838 } 839 } 840 841 if ((Ty != MVT::v2i16) && ((Ty != MVT::v4i8) \|\| !Subtarget.hasDSPR2())) 842 return SDValue(); 843 844 return performDSPShiftCombine(MipsISD::SHRA_DSP, N, Ty, DAG, Subtarget); 845 } 846 847 850 const MipsSubtarget &Subtarget) { 851 EVT Ty = N->getValueType(0); 852 853 if (((Ty != MVT::v2i16) \|\| !Subtarget.hasDSPR2()) && (Ty != MVT::v4i8)) 854 return SDValue(); 855 856 return performDSPShiftCombine(MipsISD::SHRL_DSP, N, Ty, DAG, Subtarget); 857 } 858 859 static bool isLegalDSPCondCode(EVT Ty, ISD::CondCode CC) { 860 bool IsV216 = (Ty == MVT::v2i16); 861 862 switch (CC) { 863 case ISD::SETEQ: 864 case ISD::SETNE: return true; 865 case ISD::SETLT: 866 case ISD::SETLE: 867 case ISD::SETGT: 868 case ISD::SETGE: return IsV216; 869 case ISD::SETULT: 870 case ISD::SETULE: 871 case ISD::SETUGT: 872 case ISD::SETUGE: return !IsV216; 873 default: return false; 874 } 875 } 876 878 EVT Ty = N->getValueType(0); 879 880 if ((Ty != MVT::v2i16) && (Ty != MVT::v4i8)) 881 return SDValue(); 882 883 if (!isLegalDSPCondCode(Ty, cast<CondCodeSDNode>(N->getOperand(2))->get())) 884 return SDValue(); 885 886 return DAG.getNode(MipsISD::SETCC_DSP, SDLoc(N), Ty, N->getOperand(0), 887 N->getOperand(1), N->getOperand(2)); 888 } 889 891 EVT Ty = N->getValueType(0); 892 893 if (Ty.is128BitVector() && Ty.isInteger()) { 894 // Try the following combines: 895 // (vselect (setcc $a, $b, SETLT), $b, $a)) -> (vsmax $a, $b) 896 // (vselect (setcc $a, $b, SETLE), $b, $a)) -> (vsmax $a, $b) 897 // (vselect (setcc $a, $b, SETLT), $a, $b)) -> (vsmin $a, $b) 898 // (vselect (setcc $a, $b, SETLE), $a, $b)) -> (vsmin $a, $b) 899 // (vselect (setcc $a, $b, SETULT), $b, $a)) -> (vumax $a, $b) 900 // (vselect (setcc $a, $b, SETULE), $b, $a)) -> (vumax $a, $b) 901 // (vselect (setcc $a, $b, SETULT), $a, $b)) -> (vumin $a, $b) 902 // (vselect (setcc $a, $b, SETULE), $a, $b)) -> (vumin $a, $b) 903 // SETGT/SETGE/SETUGT/SETUGE variants of these will show up initially but 904 // will be expanded to equivalent SETLT/SETLE/SETULT/SETULE versions by the 905 // legalizer. 906 SDValue Op0 = N->getOperand(0); 907 908 if (Op0->getOpcode() != ISD::SETCC) 909 return SDValue(); 910 911 ISD::CondCode CondCode = cast<CondCodeSDNode>(Op0->getOperand(2))->get(); 912 bool Signed; 913 914 if (CondCode == ISD::SETLT \|\| CondCode == ISD::SETLE) 915 Signed = true; 916 else if (CondCode == ISD::SETULT \|\| CondCode == ISD::SETULE) 917 Signed = false; 918 else 919 return SDValue(); 920 921 SDValue Op1 = N->getOperand(1); 922 SDValue Op2 = N->getOperand(2); 923 SDValue Op0Op0 = Op0->getOperand(0); 924 SDValue Op0Op1 = Op0->getOperand(1); 925 926 if (Op1 == Op0Op0 && Op2 == Op0Op1) 927 return DAG.getNode(Signed ? MipsISD::VSMIN : MipsISD::VUMIN, SDLoc(N), 928 Ty, Op1, Op2); 929 else if (Op1 == Op0Op1 && Op2 == Op0Op0) 930 return DAG.getNode(Signed ? MipsISD::VSMAX : MipsISD::VUMAX, SDLoc(N), 931 Ty, Op1, Op2); 932 } else if ((Ty == MVT::v2i16) \|\| (Ty == MVT::v4i8)) { 933 SDValue SetCC = N->getOperand(0); 934 935 if (SetCC.getOpcode() != MipsISD::SETCC_DSP) 936 return SDValue(); 937 938 return DAG.getNode(MipsISD::SELECT_CC_DSP, SDLoc(N), Ty, 939 SetCC.getOperand(0), SetCC.getOperand(1), 940 N->getOperand(1), N->getOperand(2), SetCC.getOperand(2)); 941 } 942 943 return SDValue(); 944 } 945 947 const MipsSubtarget &Subtarget) { 948 EVT Ty = N->getValueType(0); 949 950 if (Subtarget.hasMSA() && Ty.is128BitVector() && Ty.isInteger()) { 951 // Try the following combines: 952 // (xor (or $a, $b), (build_vector allones)) 953 // (xor (or $a, $b), (bitcast (build_vector allones))) 954 SDValue Op0 = N->getOperand(0); 955 SDValue Op1 = N->getOperand(1); 956 SDValue NotOp; 957 959 NotOp = Op1; 960 else if (ISD::isBuildVectorAllOnes(Op1.getNode())) 961 NotOp = Op0; 962 else 963 return SDValue(); 964 965 if (NotOp->getOpcode() == ISD::OR) 966 return DAG.getNode(MipsISD::VNOR, SDLoc(N), Ty, NotOp->getOperand(0), 967 NotOp->getOperand(1)); 968 } 969 970 return SDValue(); 971 } 972 973 SDValue 975 SelectionDAG &DAG = DCI.DAG; 976 SDValue Val; 977 978 switch (N->getOpcode()) { 979 case ISD::AND: 980 Val = performANDCombine(N, DAG, DCI, Subtarget); 981 break; 982 case ISD::OR: 983 Val = performORCombine(N, DAG, DCI, Subtarget); 984 break; 985 case ISD::MUL: 986 return performMULCombine(N, DAG, DCI, this); 987 case ISD::SHL: 988 Val = performSHLCombine(N, DAG, DCI, Subtarget); 989 break; 990 case ISD::SRA: 991 return performSRACombine(N, DAG, DCI, Subtarget); 992 case ISD::SRL: 993 return performSRLCombine(N, DAG, DCI, Subtarget); 994 case ISD::VSELECT: 995 return performVSELECTCombine(N, DAG); 996 case ISD::XOR: 997 Val = performXORCombine(N, DAG, Subtarget); 998 break; 999 case ISD::SETCC: 1000 Val = performSETCCCombine(N, DAG); 1001 break; 1002 } 1003 1004 if (Val.getNode()) { 1005 DEBUG(dbgs() << "\nMipsSE DAG Combine:\n"; 1006 N->printrWithDepth(dbgs(), &DAG); 1007 dbgs() << "\n=> \n"; 1008 Val.getNode()->printrWithDepth(dbgs(), &DAG); 1009 dbgs() << "\n"); 1010 return Val; 1011 } 1012 1014 } 1015 1018 MachineBasicBlock BB) const { 1019 switch (MI.getOpcode()) { 1020 default: 1022 case Mips::BPOSGE32_PSEUDO: 1023 return emitBPOSGE32(MI, BB); 1024 case Mips::SNZ_B_PSEUDO: 1025 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_B); 1026 case Mips::SNZ_H_PSEUDO: 1027 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_H); 1028 case Mips::SNZ_W_PSEUDO: 1029 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_W); 1030 case Mips::SNZ_D_PSEUDO: 1031 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_D); 1032 case Mips::SNZ_V_PSEUDO: 1033 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_V); 1034 case Mips::SZ_B_PSEUDO: 1035 return emitMSACBranchPseudo(MI, BB, Mips::BZ_B); 1036 case Mips::SZ_H_PSEUDO: 1037 return emitMSACBranchPseudo(MI, BB, Mips::BZ_H); 1038 case Mips::SZ_W_PSEUDO: 1039 return emitMSACBranchPseudo(MI, BB, Mips::BZ_W); 1040 case Mips::SZ_D_PSEUDO: 1041 return emitMSACBranchPseudo(MI, BB, Mips::BZ_D); 1042 case Mips::SZ_V_PSEUDO: 1043 return emitMSACBranchPseudo(MI, BB, Mips::BZ_V); 1044 case Mips::COPY_FW_PSEUDO: 1045 return emitCOPY_FW(MI, BB); 1046 case Mips::COPY_FD_PSEUDO: 1047 return emitCOPY_FD(MI, BB); 1048 case Mips::INSERT_FW_PSEUDO: 1049 return emitINSERT_FW(MI, BB); 1050 case Mips::INSERT_FD_PSEUDO: 1051 return emitINSERT_FD(MI, BB); 1052 case Mips::INSERT_B_VIDX_PSEUDO: 1053 case Mips::INSERT_B_VIDX64_PSEUDO: 1054 return emitINSERT_DF_VIDX(MI, BB, 1, false); 1055 case Mips::INSERT_H_VIDX_PSEUDO: 1056 case Mips::INSERT_H_VIDX64_PSEUDO: 1057 return emitINSERT_DF_VIDX(MI, BB, 2, false); 1058 case Mips::INSERT_W_VIDX_PSEUDO: 1059 case Mips::INSERT_W_VIDX64_PSEUDO: 1060 return emitINSERT_DF_VIDX(MI, BB, 4, false); 1061 case Mips::INSERT_D_VIDX_PSEUDO: 1062 case Mips::INSERT_D_VIDX64_PSEUDO: 1063 return emitINSERT_DF_VIDX(MI, BB, 8, false); 1064 case Mips::INSERT_FW_VIDX_PSEUDO: 1065 case Mips::INSERT_FW_VIDX64_PSEUDO: 1066 return emitINSERT_DF_VIDX(MI, BB, 4, true); 1067 case Mips::INSERT_FD_VIDX_PSEUDO: 1068 case Mips::INSERT_FD_VIDX64_PSEUDO: 1069 return emitINSERT_DF_VIDX(MI, BB, 8, true); 1070 case Mips::FILL_FW_PSEUDO: 1071 return emitFILL_FW(MI, BB); 1072 case Mips::FILL_FD_PSEUDO: 1073 return emitFILL_FD(MI, BB); 1074 case Mips::FEXP2_W_1_PSEUDO: 1075 return emitFEXP2_W_1(MI, BB); 1076 case Mips::FEXP2_D_1_PSEUDO: 1077 return emitFEXP2_D_1(MI, BB); 1078 case Mips::ST_F16: 1079 return emitST_F16_PSEUDO(MI, BB); 1080 case Mips::LD_F16: 1081 return emitLD_F16_PSEUDO(MI, BB); 1082 case Mips::MSA_FP_EXTEND_W_PSEUDO: 1083 return emitFPEXTEND_PSEUDO(MI, BB, false); 1084 case Mips::MSA_FP_ROUND_W_PSEUDO: 1085 return emitFPROUND_PSEUDO(MI, BB, false); 1086 case Mips::MSA_FP_EXTEND_D_PSEUDO: 1087 return emitFPEXTEND_PSEUDO(MI, BB, true); 1088 case Mips::MSA_FP_ROUND_D_PSEUDO: 1089 return emitFPROUND_PSEUDO(MI, BB, true); 1090 } 1091 } 1092 1093 bool MipsSETargetLowering::isEligibleForTailCallOptimization( 1094 const CCState &CCInfo, unsigned NextStackOffset, 1095 const MipsFunctionInfo &FI) const { 1096 if (!UseMipsTailCalls) 1097 return false; 1098 1099 // Exception has to be cleared with eret. 1100 if (FI.isISR()) 1101 return false; 1102 1103 // Return false if either the callee or caller has a byval argument. 1104 if (CCInfo.getInRegsParamsCount() > 0 \|\| FI.hasByvalArg()) 1105 return false; 1106 1107 // Return true if the callee's argument area is no larger than the 1108 // caller's. 1109 return NextStackOffset <= FI.getIncomingArgSize(); 1110 } 1111 1112 void MipsSETargetLowering:: 1113 getOpndList(SmallVectorImpl<SDValue> &Ops, 1114 std::deque<std::pair<unsigned, SDValue>> &RegsToPass, 1115 bool IsPICCall, bool GlobalOrExternal, bool InternalLinkage, 1116 bool IsCallReloc, CallLoweringInfo &CLI, SDValue Callee, 1117 SDValue Chain) const { 1118 Ops.push_back(Callee); 1119 MipsTargetLowering::getOpndList(Ops, RegsToPass, IsPICCall, GlobalOrExternal, 1120 InternalLinkage, IsCallReloc, CLI, Callee, 1121 Chain); 1122 } 1123 1124 SDValue MipsSETargetLowering::lowerLOAD(SDValue Op, SelectionDAG &DAG) const { 1125 LoadSDNode &Nd = cast<LoadSDNode>(Op); 1126 1127 if (Nd.getMemoryVT() != MVT::f64 \|\| !NoDPLoadStore) 1128 return MipsTargetLowering::lowerLOAD(Op, DAG); 1129 1130 // Replace a double precision load with two i32 loads and a buildpair64. 1131 SDLoc DL(Op); 1132 SDValue Ptr = Nd.getBasePtr(), Chain = Nd.getChain(); 1133 EVT PtrVT = Ptr.getValueType(); 1134 1135 // i32 load from lower address. 1136 SDValue Lo = DAG.getLoad(MVT::i32, DL, Chain, Ptr, MachinePointerInfo(), 1137 Nd.getAlignment(), Nd.getMemOperand()->getFlags()); 1138 1139 // i32 load from higher address. 1140 Ptr = DAG.getNode(ISD::ADD, DL, PtrVT, Ptr, DAG.getConstant(4, DL, PtrVT)); 1141 SDValue Hi = DAG.getLoad( 1142 MVT::i32, DL, Lo.getValue(1), Ptr, MachinePointerInfo(), 1143 std::min(Nd.getAlignment(), 4U), Nd.getMemOperand()->getFlags()); 1144 1145 if (!Subtarget.isLittle()) 1146 std::swap(Lo, Hi); 1147 1148 SDValue BP = DAG.getNode(MipsISD::BuildPairF64, DL, MVT::f64, Lo, Hi); 1149 SDValue Ops[2] = {BP, Hi.getValue(1)}; 1150 return DAG.getMergeValues(Ops, DL); 1151 } 1152 1153 SDValue MipsSETargetLowering::lowerSTORE(SDValue Op, SelectionDAG &DAG) const { 1154 StoreSDNode &Nd = cast<StoreSDNode>(Op); 1155 1156 if (Nd.getMemoryVT() != MVT::f64 \|\| !NoDPLoadStore) 1157 return MipsTargetLowering::lowerSTORE(Op, DAG); 1158 1159 // Replace a double precision store with two extractelement64s and i32 stores. 1160 SDLoc DL(Op); 1161 SDValue Val = Nd.getValue(), Ptr = Nd.getBasePtr(), Chain = Nd.getChain(); 1162 EVT PtrVT = Ptr.getValueType(); 1164 Val, DAG.getConstant(0, DL, MVT::i32)); 1166 Val, DAG.getConstant(1, DL, MVT::i32)); 1167 1168 if (!Subtarget.isLittle()) 1169 std::swap(Lo, Hi); 1170 1171 // i32 store to lower address. 1172 Chain = 1173 DAG.getStore(Chain, DL, Lo, Ptr, MachinePointerInfo(), Nd.getAlignment(), 1174 Nd.getMemOperand()->getFlags(), Nd.getAAInfo()); 1175 1176 // i32 store to higher address. 1177 Ptr = DAG.getNode(ISD::ADD, DL, PtrVT, Ptr, DAG.getConstant(4, DL, PtrVT)); 1178 return DAG.getStore(Chain, DL, Hi, Ptr, MachinePointerInfo(), 1179 std::min(Nd.getAlignment(), 4U), 1180 Nd.getMemOperand()->getFlags(), Nd.getAAInfo()); 1181 } 1182 1183 SDValue MipsSETargetLowering::lowerMulDiv(SDValue Op, unsigned NewOpc, 1184 bool HasLo, bool HasHi, 1185 SelectionDAG &DAG) const { 1186 // MIPS32r6/MIPS64r6 removed accumulator based multiplies. 1188 1189 EVT Ty = Op.getOperand(0).getValueType(); 1190 SDLoc DL(Op); 1191 SDValue Mult = DAG.getNode(NewOpc, DL, MVT::Untyped, 1192 Op.getOperand(0), Op.getOperand(1)); 1193 SDValue Lo, Hi; 1194 1195 if (HasLo) 1196 Lo = DAG.getNode(MipsISD::MFLO, DL, Ty, Mult); 1197 if (HasHi) 1198 Hi = DAG.getNode(MipsISD::MFHI, DL, Ty, Mult); 1199 1200 if (!HasLo \|\| !HasHi) 1201 return HasLo ? Lo : Hi; 1202 1203 SDValue Vals[] = { Lo, Hi }; 1204 return DAG.getMergeValues(Vals, DL); 1205 } 1206 1208 SDValue InLo = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i32, In, 1209 DAG.getConstant(0, DL, MVT::i32)); 1210 SDValue InHi = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i32, In, 1211 DAG.getConstant(1, DL, MVT::i32)); 1212 return DAG.getNode(MipsISD::MTLOHI, DL, MVT::Untyped, InLo, InHi); 1213 } 1214 1215 static SDValue extractLOHI(SDValue Op, const SDLoc &DL, SelectionDAG &DAG) { 1216 SDValue Lo = DAG.getNode(MipsISD::MFLO, DL, MVT::i32, Op); 1217 SDValue Hi = DAG.getNode(MipsISD::MFHI, DL, MVT::i32, Op); 1218 return DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Lo, Hi); 1219 } 1220 1221 // This function expands mips intrinsic nodes which have 64-bit input operands 1222 // or output values. 1223 // 1224 // out64 = intrinsic-node in64 1225 // => 1226 // lo = copy (extract-element (in64, 0)) 1227 // hi = copy (extract-element (in64, 1)) 1228 // mips-specific-node 1229 // v0 = copy lo 1230 // v1 = copy hi 1231 // out64 = merge-values (v0, v1) 1232 // 1233 static SDValue lowerDSPIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) { 1234 SDLoc DL(Op); 1235 bool HasChainIn = Op->getOperand(0).getValueType() == MVT::Other; 1237 unsigned OpNo = 0; 1238 1239 // See if Op has a chain input. 1240 if (HasChainIn) 1241 Ops.push_back(Op->getOperand(OpNo++)); 1242 1243 // The next operand is the intrinsic opcode. 1245 1246 // See if the next operand has type i64. 1247 SDValue Opnd = Op->getOperand(++OpNo), In64; 1248 1249 if (Opnd.getValueType() == MVT::i64) 1250 In64 = initAccumulator(Opnd, DL, DAG); 1251 else 1252 Ops.push_back(Opnd); 1253 1254 // Push the remaining operands. 1255 for (++OpNo ; OpNo < Op->getNumOperands(); ++OpNo) 1256 Ops.push_back(Op->getOperand(OpNo)); 1257 1258 // Add In64 to the end of the list. 1259 if (In64.getNode()) 1260 Ops.push_back(In64); 1261 1262 // Scan output. 1263 SmallVector<EVT, 2> ResTys; 1264 1265 for (SDNode::value_iterator I = Op->value_begin(), E = Op->value_end(); 1266 I != E; ++I) 1267 ResTys.push_back((I == MVT::i64) ? MVT::Untyped : I); 1268 1269 // Create node. 1270 SDValue Val = DAG.getNode(Opc, DL, ResTys, Ops); 1271 SDValue Out = (ResTys[0] == MVT::Untyped) ? extractLOHI(Val, DL, DAG) : Val; 1272 1273 if (!HasChainIn) 1274 return Out; 1275 1276 assert(Val->getValueType(1) == MVT::Other); 1277 SDValue Vals[] = { Out, SDValue(Val.getNode(), 1) }; 1278 return DAG.getMergeValues(Vals, DL); 1279 } 1280 1281 // Lower an MSA copy intrinsic into the specified SelectionDAG node 1282 static SDValue lowerMSACopyIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) { 1283 SDLoc DL(Op); 1284 SDValue Vec = Op->getOperand(1); 1285 SDValue Idx = Op->getOperand(2); 1286 EVT ResTy = Op->getValueType(0); 1287 EVT EltTy = Vec->getValueType(0).getVectorElementType(); 1288 1289 SDValue Result = DAG.getNode(Opc, DL, ResTy, Vec, Idx, 1290 DAG.getValueType(EltTy)); 1291 1292 return Result; 1293 } 1294 1295 static SDValue lowerMSASplatZExt(SDValue Op, unsigned OpNr, SelectionDAG &DAG) { 1296 EVT ResVecTy = Op->getValueType(0); 1297 EVT ViaVecTy = ResVecTy; 1298 bool BigEndian = !DAG.getSubtarget().getTargetTriple().isLittleEndian(); 1299 SDLoc DL(Op); 1300 1301 // When ResVecTy == MVT::v2i64, LaneA is the upper 32 bits of the lane and 1302 // LaneB is the lower 32-bits. Otherwise LaneA and LaneB are alternating 1303 // lanes. 1304 SDValue LaneA = Op->getOperand(OpNr); 1305 SDValue LaneB; 1306 1307 if (ResVecTy == MVT::v2i64) { 1308 LaneB = DAG.getConstant(0, DL, MVT::i32); 1309 ViaVecTy = MVT::v4i32; 1310 if(BigEndian) 1311 std::swap(LaneA, LaneB); 1312 } else 1313 LaneB = LaneA; 1314 1315 SDValue Ops[16] = { LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, 1316 LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, LaneA, LaneB }; 1317 1318 SDValue Result = DAG.getBuildVector( 1319 ViaVecTy, DL, makeArrayRef(Ops, ViaVecTy.getVectorNumElements())); 1320 1321 if (ViaVecTy != ResVecTy) { 1322 SDValue One = DAG.getConstant(1, DL, ViaVecTy); 1323 Result = DAG.getNode(ISD::BITCAST, DL, ResVecTy, 1324 DAG.getNode(ISD::AND, DL, ViaVecTy, Result, One)); 1325 } 1326 1327 return Result; 1328 } 1329 1330 static SDValue lowerMSASplatImm(SDValue Op, unsigned ImmOp, SelectionDAG &DAG, 1331 bool IsSigned = false) { 1332 return DAG.getConstant( 1334 Op->getConstantOperandVal(ImmOp), IsSigned), 1335 SDLoc(Op), Op->getValueType(0)); 1336 } 1337 1338 static SDValue getBuildVectorSplat(EVT VecTy, SDValue SplatValue, 1339 bool BigEndian, SelectionDAG &DAG) { 1340 EVT ViaVecTy = VecTy; 1341 SDValue SplatValueA = SplatValue; 1342 SDValue SplatValueB = SplatValue; 1343 SDLoc DL(SplatValue); 1344 1345 if (VecTy == MVT::v2i64) { 1346 // v2i64 BUILD_VECTOR must be performed via v4i32 so split into i32's. 1347 ViaVecTy = MVT::v4i32; 1348 1349 SplatValueA = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, SplatValue); 1350 SplatValueB = DAG.getNode(ISD::SRL, DL, MVT::i64, SplatValue, 1351 DAG.getConstant(32, DL, MVT::i32)); 1352 SplatValueB = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, SplatValueB); 1353 } 1354 1355 // We currently hold the parts in little endian order. Swap them if 1356 // necessary. 1357 if (BigEndian) 1358 std::swap(SplatValueA, SplatValueB); 1359 1360 SDValue Ops[16] = { SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1361 SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1362 SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1363 SplatValueA, SplatValueB, SplatValueA, SplatValueB }; 1364 1365 SDValue Result = DAG.getBuildVector( 1366 ViaVecTy, DL, makeArrayRef(Ops, ViaVecTy.getVectorNumElements())); 1367 1368 if (VecTy != ViaVecTy) 1369 Result = DAG.getNode(ISD::BITCAST, DL, VecTy, Result); 1370 1371 return Result; 1372 } 1373 1375 unsigned Opc, SDValue Imm, 1376 bool BigEndian) { 1377 EVT VecTy = Op->getValueType(0); 1378 SDValue Exp2Imm; 1379 SDLoc DL(Op); 1380 1381 // The DAG Combiner can't constant fold bitcasted vectors yet so we must do it 1382 // here for now. 1383 if (VecTy == MVT::v2i64) { 1384 if (ConstantSDNode CImm = dyn_cast<ConstantSDNode>(Imm)) { 1385 APInt BitImm = APInt(64, 1) << CImm->getAPIntValue(); 1386 1387 SDValue BitImmHiOp = DAG.getConstant(BitImm.lshr(32).trunc(32), DL, 1388 MVT::i32); 1389 SDValue BitImmLoOp = DAG.getConstant(BitImm.trunc(32), DL, MVT::i32); 1390 1391 if (BigEndian) 1392 std::swap(BitImmLoOp, BitImmHiOp); 1393 1394 Exp2Imm = DAG.getNode( 1395 ISD::BITCAST, DL, MVT::v2i64, 1396 DAG.getBuildVector(MVT::v4i32, DL, 1397 {BitImmLoOp, BitImmHiOp, BitImmLoOp, BitImmHiOp})); 1398 } 1399 } 1400 1401 if (!Exp2Imm.getNode()) { 1402 // We couldnt constant fold, do a vector shift instead 1403 1404 // Extend i32 to i64 if necessary. Sign or zero extend doesn't matter since 1405 // only values 0-63 are valid. 1406 if (VecTy == MVT::v2i64) 1407 Imm = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i64, Imm); 1408 1409 Exp2Imm = getBuildVectorSplat(VecTy, Imm, BigEndian, DAG); 1410 1411 Exp2Imm = DAG.getNode(ISD::SHL, DL, VecTy, DAG.getConstant(1, DL, VecTy), 1412 Exp2Imm); 1413 } 1414 1415 return DAG.getNode(Opc, DL, VecTy, Op->getOperand(1), Exp2Imm); 1416 } 1417 1419 SDLoc DL(Op); 1420 EVT ResTy = Op->getValueType(0); 1421 SDValue Vec = Op->getOperand(2); 1422 bool BigEndian = !DAG.getSubtarget().getTargetTriple().isLittleEndian(); 1423 MVT ResEltTy = ResTy == MVT::v2i64 ? MVT::i64 : MVT::i32; 1424 SDValue ConstValue = DAG.getConstant(Vec.getScalarValueSizeInBits() - 1, 1425 DL, ResEltTy); 1426 SDValue SplatVec = getBuildVectorSplat(ResTy, ConstValue, BigEndian, DAG); 1427 1428 return DAG.getNode(ISD::AND, DL, ResTy, Vec, SplatVec); 1429 } 1430 1432 EVT ResTy = Op->getValueType(0); 1433 SDLoc DL(Op); 1434 SDValue One = DAG.getConstant(1, DL, ResTy); 1435 SDValue Bit = DAG.getNode(ISD::SHL, DL, ResTy, One, truncateVecElts(Op, DAG)); 1436 1437 return DAG.getNode(ISD::AND, DL, ResTy, Op->getOperand(1), 1438 DAG.getNOT(DL, Bit, ResTy)); 1439 } 1440 1442 SDLoc DL(Op); 1443 EVT ResTy = Op->getValueType(0); 1444 APInt BitImm = APInt(ResTy.getScalarSizeInBits(), 1) 1445 << cast<ConstantSDNode>(Op->getOperand(2))->getAPIntValue(); 1446 SDValue BitMask = DAG.getConstant(~BitImm, DL, ResTy); 1447 1448 return DAG.getNode(ISD::AND, DL, ResTy, Op->getOperand(1), BitMask); 1449 } 1450 1451 SDValue MipsSETargetLowering::lowerINTRINSIC_WO_CHAIN(SDValue Op, 1452 SelectionDAG &DAG) const { 1453 SDLoc DL(Op); 1454 unsigned Intrinsic = cast<ConstantSDNode>(Op->getOperand(0))->getZExtValue(); 1455 switch (Intrinsic) { 1456 default: 1457 return SDValue(); 1458 case Intrinsic::mips_shilo: 1459 return lowerDSPIntr(Op, DAG, MipsISD::SHILO); 1460 case Intrinsic::mips_dpau_h_qbl: 1461 return lowerDSPIntr(Op, DAG, MipsISD::DPAU_H_QBL); 1462 case Intrinsic::mips_dpau_h_qbr: 1463 return lowerDSPIntr(Op, DAG, MipsISD::DPAU_H_QBR); 1464 case Intrinsic::mips_dpsu_h_qbl: 1465 return lowerDSPIntr(Op, DAG, MipsISD::DPSU_H_QBL); 1466 case Intrinsic::mips_dpsu_h_qbr: 1467 return lowerDSPIntr(Op, DAG, MipsISD::DPSU_H_QBR); 1468 case Intrinsic::mips_dpa_w_ph: 1469 return lowerDSPIntr(Op, DAG, MipsISD::DPA_W_PH); 1470 case Intrinsic::mips_dps_w_ph: 1471 return lowerDSPIntr(Op, DAG, MipsISD::DPS_W_PH); 1472 case Intrinsic::mips_dpax_w_ph: 1473 return lowerDSPIntr(Op, DAG, MipsISD::DPAX_W_PH); 1474 case Intrinsic::mips_dpsx_w_ph: 1475 return lowerDSPIntr(Op, DAG, MipsISD::DPSX_W_PH); 1476 case Intrinsic::mips_mulsa_w_ph: 1477 return lowerDSPIntr(Op, DAG, MipsISD::MULSA_W_PH); 1478 case Intrinsic::mips_mult: 1479 return lowerDSPIntr(Op, DAG, MipsISD::Mult); 1480 case Intrinsic::mips_multu: 1481 return lowerDSPIntr(Op, DAG, MipsISD::Multu); 1482 case Intrinsic::mips_madd: 1483 return lowerDSPIntr(Op, DAG, MipsISD::MAdd); 1484 case Intrinsic::mips_maddu: 1485 return lowerDSPIntr(Op, DAG, MipsISD::MAddu); 1486 case Intrinsic::mips_msub: 1487 return lowerDSPIntr(Op, DAG, MipsISD::MSub); 1488 case Intrinsic::mips_msubu: 1489 return lowerDSPIntr(Op, DAG, MipsISD::MSubu); 1490 case Intrinsic::mips_addv_b: 1491 case Intrinsic::mips_addv_h: 1492 case Intrinsic::mips_addv_w: 1493 case Intrinsic::mips_addv_d: 1494 return DAG.getNode(ISD::ADD, DL, Op->getValueType(0), Op->getOperand(1), 1495 Op->getOperand(2)); 1496 case Intrinsic::mips_addvi_b: 1497 case Intrinsic::mips_addvi_h: 1498 case Intrinsic::mips_addvi_w: 1499 case Intrinsic::mips_addvi_d: 1500 return DAG.getNode(ISD::ADD, DL, Op->getValueType(0), Op->getOperand(1), 1501 lowerMSASplatImm(Op, 2, DAG)); 1502 case Intrinsic::mips_and_v: 1503 return DAG.getNode(ISD::AND, DL, Op->getValueType(0), Op->getOperand(1), 1504 Op->getOperand(2)); 1505 case Intrinsic::mips_andi_b: 1506 return DAG.getNode(ISD::AND, DL, Op->getValueType(0), Op->getOperand(1), 1507 lowerMSASplatImm(Op, 2, DAG)); 1508 case Intrinsic::mips_bclr_b: 1509 case Intrinsic::mips_bclr_h: 1510 case Intrinsic::mips_bclr_w: 1511 case Intrinsic::mips_bclr_d: 1512 return lowerMSABitClear(Op, DAG); 1513 case Intrinsic::mips_bclri_b: 1514 case Intrinsic::mips_bclri_h: 1515 case Intrinsic::mips_bclri_w: 1516 case Intrinsic::mips_bclri_d: 1517 return lowerMSABitClearImm(Op, DAG); 1518 case Intrinsic::mips_binsli_b: 1519 case Intrinsic::mips_binsli_h: 1520 case Intrinsic::mips_binsli_w: 1521 case Intrinsic::mips_binsli_d: { 1522 // binsli_x(IfClear, IfSet, nbits) -> (vselect LBitsMask, IfSet, IfClear) 1523 EVT VecTy = Op->getValueType(0); 1524 EVT EltTy = VecTy.getVectorElementType(); 1525 if (Op->getConstantOperandVal(3) >= EltTy.getSizeInBits()) 1526 report_fatal_error("Immediate out of range"); 1528 Op->getConstantOperandVal(3) + 1); 1529 return DAG.getNode(ISD::VSELECT, DL, VecTy, 1530 DAG.getConstant(Mask, DL, VecTy, true), 1531 Op->getOperand(2), Op->getOperand(1)); 1532 } 1533 case Intrinsic::mips_binsri_b: 1534 case Intrinsic::mips_binsri_h: 1535 case Intrinsic::mips_binsri_w: 1536 case Intrinsic::mips_binsri_d: { 1537 // binsri_x(IfClear, IfSet, nbits) -> (vselect RBitsMask, IfSet, IfClear) 1538 EVT VecTy = Op->getValueType(0); 1539 EVT EltTy = VecTy.getVectorElementType(); 1540 if (Op->getConstantOperandVal(3) >= EltTy.getSizeInBits()) 1541 report_fatal_error("Immediate out of range"); 1543 Op->getConstantOperandVal(3) + 1); 1544 return DAG.getNode(ISD::VSELECT, DL, VecTy, 1545 DAG.getConstant(Mask, DL, VecTy, true), 1546 Op->getOperand(2), Op->getOperand(1)); 1547 } 1548 case Intrinsic::mips_bmnz_v: 1549 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), Op->getOperand(3), 1550 Op->getOperand(2), Op->getOperand(1)); 1551 case Intrinsic::mips_bmnzi_b: 1552 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1553 lowerMSASplatImm(Op, 3, DAG), Op->getOperand(2), 1554 Op->getOperand(1)); 1555 case Intrinsic::mips_bmz_v: 1556 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), Op->getOperand(3), 1557 Op->getOperand(1), Op->getOperand(2)); 1558 case Intrinsic::mips_bmzi_b: 1559 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1560 lowerMSASplatImm(Op, 3, DAG), Op->getOperand(1), 1561 Op->getOperand(2)); 1562 case Intrinsic::mips_bneg_b: 1563 case Intrinsic::mips_bneg_h: 1564 case Intrinsic::mips_bneg_w: 1565 case Intrinsic::mips_bneg_d: { 1566 EVT VecTy = Op->getValueType(0); 1567 SDValue One = DAG.getConstant(1, DL, VecTy); 1568 1569 return DAG.getNode(ISD::XOR, DL, VecTy, Op->getOperand(1), 1570 DAG.getNode(ISD::SHL, DL, VecTy, One, 1571 truncateVecElts(Op, DAG))); 1572 } 1573 case Intrinsic::mips_bnegi_b: 1574 case Intrinsic::mips_bnegi_h: 1575 case Intrinsic::mips_bnegi_w: 1576 case Intrinsic::mips_bnegi_d: 1577 return lowerMSABinaryBitImmIntr(Op, DAG, ISD::XOR, Op->getOperand(2), 1578 !Subtarget.isLittle()); 1579 case Intrinsic::mips_bnz_b: 1580 case Intrinsic::mips_bnz_h: 1581 case Intrinsic::mips_bnz_w: 1582 case Intrinsic::mips_bnz_d: 1583 return DAG.getNode(MipsISD::VALL_NONZERO, DL, Op->getValueType(0), 1584 Op->getOperand(1)); 1585 case Intrinsic::mips_bnz_v: 1586 return DAG.getNode(MipsISD::VANY_NONZERO, DL, Op->getValueType(0), 1587 Op->getOperand(1)); 1588 case Intrinsic::mips_bsel_v: 1589 // bsel_v(Mask, IfClear, IfSet) -> (vselect Mask, IfSet, IfClear) 1590 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1591 Op->getOperand(1), Op->getOperand(3), 1592 Op->getOperand(2)); 1593 case Intrinsic::mips_bseli_b: 1594 // bseli_v(Mask, IfClear, IfSet) -> (vselect Mask, IfSet, IfClear) 1595 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1596 Op->getOperand(1), lowerMSASplatImm(Op, 3, DAG), 1597 Op->getOperand(2)); 1598 case Intrinsic::mips_bset_b: 1599 case Intrinsic::mips_bset_h: 1600 case Intrinsic::mips_bset_w: 1601 case Intrinsic::mips_bset_d: { 1602 EVT VecTy = Op->getValueType(0); 1603 SDValue One = DAG.getConstant(1, DL, VecTy); 1604 1605 return DAG.getNode(ISD::OR, DL, VecTy, Op->getOperand(1), 1606 DAG.getNode(ISD::SHL, DL, VecTy, One, 1607 truncateVecElts(Op, DAG))); 1608 } 1609 case Intrinsic::mips_bseti_b: 1610 case Intrinsic::mips_bseti_h: 1611 case Intrinsic::mips_bseti_w: 1612 case Intrinsic::mips_bseti_d: 1613 return lowerMSABinaryBitImmIntr(Op, DAG, ISD::OR, Op->getOperand(2), 1614 !Subtarget.isLittle()); 1615 case Intrinsic::mips_bz_b: 1616 case Intrinsic::mips_bz_h: 1617 case Intrinsic::mips_bz_w: 1618 case Intrinsic::mips_bz_d: 1619 return DAG.getNode(MipsISD::VALL_ZERO, DL, Op->getValueType(0), 1620 Op->getOperand(1)); 1621 case Intrinsic::mips_bz_v: 1622 return DAG.getNode(MipsISD::VANY_ZERO, DL, Op->getValueType(0), 1623 Op->getOperand(1)); 1624 case Intrinsic::mips_ceq_b: 1625 case Intrinsic::mips_ceq_h: 1626 case Intrinsic::mips_ceq_w: 1627 case Intrinsic::mips_ceq_d: 1628 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1629 Op->getOperand(2), ISD::SETEQ); 1630 case Intrinsic::mips_ceqi_b: 1631 case Intrinsic::mips_ceqi_h: 1632 case Intrinsic::mips_ceqi_w: 1633 case Intrinsic::mips_ceqi_d: 1634 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1635 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETEQ); 1636 case Intrinsic::mips_cle_s_b: 1637 case Intrinsic::mips_cle_s_h: 1638 case Intrinsic::mips_cle_s_w: 1639 case Intrinsic::mips_cle_s_d: 1640 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1641 Op->getOperand(2), ISD::SETLE); 1642 case Intrinsic::mips_clei_s_b: 1643 case Intrinsic::mips_clei_s_h: 1644 case Intrinsic::mips_clei_s_w: 1645 case Intrinsic::mips_clei_s_d: 1646 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1647 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETLE); 1648 case Intrinsic::mips_cle_u_b: 1649 case Intrinsic::mips_cle_u_h: 1650 case Intrinsic::mips_cle_u_w: 1651 case Intrinsic::mips_cle_u_d: 1652 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1653 Op->getOperand(2), ISD::SETULE); 1654 case Intrinsic::mips_clei_u_b: 1655 case Intrinsic::mips_clei_u_h: 1656 case Intrinsic::mips_clei_u_w: 1657 case Intrinsic::mips_clei_u_d: 1658 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1659 lowerMSASplatImm(Op, 2, DAG), ISD::SETULE); 1660 case Intrinsic::mips_clt_s_b: 1661 case Intrinsic::mips_clt_s_h: 1662 case Intrinsic::mips_clt_s_w: 1663 case Intrinsic::mips_clt_s_d: 1664 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1665 Op->getOperand(2), ISD::SETLT); 1666 case Intrinsic::mips_clti_s_b: 1667 case Intrinsic::mips_clti_s_h: 1668 case Intrinsic::mips_clti_s_w: 1669 case Intrinsic::mips_clti_s_d: 1670 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1671 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETLT); 1672 case Intrinsic::mips_clt_u_b: 1673 case Intrinsic::mips_clt_u_h: 1674 case Intrinsic::mips_clt_u_w: 1675 case Intrinsic::mips_clt_u_d: 1676 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1677 Op->getOperand(2), ISD::SETULT); 1678 case Intrinsic::mips_clti_u_b: 1679 case Intrinsic::mips_clti_u_h: 1680 case Intrinsic::mips_clti_u_w: 1681 case Intrinsic::mips_clti_u_d: 1682 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1683 lowerMSASplatImm(Op, 2, DAG), ISD::SETULT); 1684 case Intrinsic::mips_copy_s_b: 1685 case Intrinsic::mips_copy_s_h: 1686 case Intrinsic::mips_copy_s_w: 1688 case Intrinsic::mips_copy_s_d: 1689 if (Subtarget.hasMips64()) 1690 // Lower directly into VEXTRACT_SEXT_ELT since i64 is legal on Mips64. 1692 else { 1693 // Lower into the generic EXTRACT_VECTOR_ELT node and let the type 1694 // legalizer and EXTRACT_VECTOR_ELT lowering sort it out. 1695 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op), 1696 Op->getValueType(0), Op->getOperand(1), 1697 Op->getOperand(2)); 1698 } 1699 case Intrinsic::mips_copy_u_b: 1700 case Intrinsic::mips_copy_u_h: 1701 case Intrinsic::mips_copy_u_w: 1703 case Intrinsic::mips_copy_u_d: 1704 if (Subtarget.hasMips64()) 1705 // Lower directly into VEXTRACT_ZEXT_ELT since i64 is legal on Mips64. 1707 else { 1708 // Lower into the generic EXTRACT_VECTOR_ELT node and let the type 1709 // legalizer and EXTRACT_VECTOR_ELT lowering sort it out. 1710 // Note: When i64 is illegal, this results in copy_s.w instructions 1711 // instead of copy_u.w instructions. This makes no difference to the 1712 // behaviour since i64 is only illegal when the register file is 32-bit. 1713 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op), 1714 Op->getValueType(0), Op->getOperand(1), 1715 Op->getOperand(2)); 1716 } 1717 case Intrinsic::mips_div_s_b: 1718 case Intrinsic::mips_div_s_h: 1719 case Intrinsic::mips_div_s_w: 1720 case Intrinsic::mips_div_s_d: 1721 return DAG.getNode(ISD::SDIV, DL, Op->getValueType(0), Op->getOperand(1), 1722 Op->getOperand(2)); 1723 case Intrinsic::mips_div_u_b: 1724 case Intrinsic::mips_div_u_h: 1725 case Intrinsic::mips_div_u_w: 1726 case Intrinsic::mips_div_u_d: 1727 return DAG.getNode(ISD::UDIV, DL, Op->getValueType(0), Op->getOperand(1), 1728 Op->getOperand(2)); 1729 case Intrinsic::mips_fadd_w: 1730 case Intrinsic::mips_fadd_d: 1731 // TODO: If intrinsics have fast-math-flags, propagate them. 1732 return DAG.getNode(ISD::FADD, DL, Op->getValueType(0), Op->getOperand(1), 1733 Op->getOperand(2)); 1734 // Don't lower mips_fcaf_[wd] since LLVM folds SETFALSE condcodes away 1735 case Intrinsic::mips_fceq_w: 1736 case Intrinsic::mips_fceq_d: 1737 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1738 Op->getOperand(2), ISD::SETOEQ); 1739 case Intrinsic::mips_fcle_w: 1740 case Intrinsic::mips_fcle_d: 1741 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1742 Op->getOperand(2), ISD::SETOLE); 1743 case Intrinsic::mips_fclt_w: 1744 case Intrinsic::mips_fclt_d: 1745 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1746 Op->getOperand(2), ISD::SETOLT); 1747 case Intrinsic::mips_fcne_w: 1748 case Intrinsic::mips_fcne_d: 1749 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1750 Op->getOperand(2), ISD::SETONE); 1751 case Intrinsic::mips_fcor_w: 1752 case Intrinsic::mips_fcor_d: 1753 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1754 Op->getOperand(2), ISD::SETO); 1755 case Intrinsic::mips_fcueq_w: 1756 case Intrinsic::mips_fcueq_d: 1757 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1758 Op->getOperand(2), ISD::SETUEQ); 1759 case Intrinsic::mips_fcule_w: 1760 case Intrinsic::mips_fcule_d: 1761 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1762 Op->getOperand(2), ISD::SETULE); 1763 case Intrinsic::mips_fcult_w: 1764 case Intrinsic::mips_fcult_d: 1765 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1766 Op->getOperand(2), ISD::SETULT); 1767 case Intrinsic::mips_fcun_w: 1768 case Intrinsic::mips_fcun_d: 1769 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1770 Op->getOperand(2), ISD::SETUO); 1771 case Intrinsic::mips_fcune_w: 1772 case Intrinsic::mips_fcune_d: 1773 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1774 Op->getOperand(2), ISD::SETUNE); 1775 case Intrinsic::mips_fdiv_w: 1776 case Intrinsic::mips_fdiv_d: 1777 // TODO: If intrinsics have fast-math-flags, propagate them. 1778 return DAG.getNode(ISD::FDIV, DL, Op->getValueType(0), Op->getOperand(1), 1779 Op->getOperand(2)); 1780 case Intrinsic::mips_ffint_u_w: 1781 case Intrinsic::mips_ffint_u_d: 1782 return DAG.getNode(ISD::UINT_TO_FP, DL, Op->getValueType(0), 1783 Op->getOperand(1)); 1784 case Intrinsic::mips_ffint_s_w: 1785 case Intrinsic::mips_ffint_s_d: 1786 return DAG.getNode(ISD::SINT_TO_FP, DL, Op->getValueType(0), 1787 Op->getOperand(1)); 1788 case Intrinsic::mips_fill_b: 1789 case Intrinsic::mips_fill_h: 1790 case Intrinsic::mips_fill_w: 1791 case Intrinsic::mips_fill_d: { 1792 EVT ResTy = Op->getValueType(0); 1794 Op->getOperand(1)); 1795 1796 // If ResTy is v2i64 then the type legalizer will break this node down into 1797 // an equivalent v4i32. 1798 return DAG.getBuildVector(ResTy, DL, Ops); 1799 } 1800 case Intrinsic::mips_fexp2_w: 1801 case Intrinsic::mips_fexp2_d: { 1802 // TODO: If intrinsics have fast-math-flags, propagate them. 1803 EVT ResTy = Op->getValueType(0); 1804 return DAG.getNode( 1805 ISD::FMUL, SDLoc(Op), ResTy, Op->getOperand(1), 1806 DAG.getNode(ISD::FEXP2, SDLoc(Op), ResTy, Op->getOperand(2))); 1807 } 1808 case Intrinsic::mips_flog2_w: 1809 case Intrinsic::mips_flog2_d: 1810 return DAG.getNode(ISD::FLOG2, DL, Op->getValueType(0), Op->getOperand(1)); 1811 case Intrinsic::mips_fmadd_w: 1812 case Intrinsic::mips_fmadd_d: 1813 return DAG.getNode(ISD::FMA, SDLoc(Op), Op->getValueType(0), 1814 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3)); 1815 case Intrinsic::mips_fmul_w: 1816 case Intrinsic::mips_fmul_d: 1817 // TODO: If intrinsics have fast-math-flags, propagate them. 1818 return DAG.getNode(ISD::FMUL, DL, Op->getValueType(0), Op->getOperand(1), 1819 Op->getOperand(2)); 1820 case Intrinsic::mips_fmsub_w: 1821 case Intrinsic::mips_fmsub_d: { 1822 // TODO: If intrinsics have fast-math-flags, propagate them. 1823 EVT ResTy = Op->getValueType(0); 1824 return DAG.getNode(ISD::FSUB, SDLoc(Op), ResTy, Op->getOperand(1), 1825 DAG.getNode(ISD::FMUL, SDLoc(Op), ResTy, 1826 Op->getOperand(2), Op->getOperand(3))); 1827 } 1828 case Intrinsic::mips_frint_w: 1829 case Intrinsic::mips_frint_d: 1830 return DAG.getNode(ISD::FRINT, DL, Op->getValueType(0), Op->getOperand(1)); 1831 case Intrinsic::mips_fsqrt_w: 1832 case Intrinsic::mips_fsqrt_d: 1833 return DAG.getNode(ISD::FSQRT, DL, Op->getValueType(0), Op->getOperand(1)); 1834 case Intrinsic::mips_fsub_w: 1835 case Intrinsic::mips_fsub_d: 1836 // TODO: If intrinsics have fast-math-flags, propagate them. 1837 return DAG.getNode(ISD::FSUB, DL, Op->getValueType(0), Op->getOperand(1), 1838 Op->getOperand(2)); 1839 case Intrinsic::mips_ftrunc_u_w: 1840 case Intrinsic::mips_ftrunc_u_d: 1841 return DAG.getNode(ISD::FP_TO_UINT, DL, Op->getValueType(0), 1842 Op->getOperand(1)); 1843 case Intrinsic::mips_ftrunc_s_w: 1844 case Intrinsic::mips_ftrunc_s_d: 1845 return DAG.getNode(ISD::FP_TO_SINT, DL, Op->getValueType(0), 1846 Op->getOperand(1)); 1847 case Intrinsic::mips_ilvev_b: 1848 case Intrinsic::mips_ilvev_h: 1849 case Intrinsic::mips_ilvev_w: 1850 case Intrinsic::mips_ilvev_d: 1851 return DAG.getNode(MipsISD::ILVEV, DL, Op->getValueType(0), 1852 Op->getOperand(1), Op->getOperand(2)); 1853 case Intrinsic::mips_ilvl_b: 1854 case Intrinsic::mips_ilvl_h: 1855 case Intrinsic::mips_ilvl_w: 1856 case Intrinsic::mips_ilvl_d: 1857 return DAG.getNode(MipsISD::ILVL, DL, Op->getValueType(0), 1858 Op->getOperand(1), Op->getOperand(2)); 1859 case Intrinsic::mips_ilvod_b: 1860 case Intrinsic::mips_ilvod_h: 1861 case Intrinsic::mips_ilvod_w: 1862 case Intrinsic::mips_ilvod_d: 1863 return DAG.getNode(MipsISD::ILVOD, DL, Op->getValueType(0), 1864 Op->getOperand(1), Op->getOperand(2)); 1865 case Intrinsic::mips_ilvr_b: 1866 case Intrinsic::mips_ilvr_h: 1867 case Intrinsic::mips_ilvr_w: 1868 case Intrinsic::mips_ilvr_d: 1869 return DAG.getNode(MipsISD::ILVR, DL, Op->getValueType(0), 1870 Op->getOperand(1), Op->getOperand(2)); 1871 case Intrinsic::mips_insert_b: 1872 case Intrinsic::mips_insert_h: 1873 case Intrinsic::mips_insert_w: 1874 case Intrinsic::mips_insert_d: 1875 return DAG.getNode(ISD::INSERT_VECTOR_ELT, SDLoc(Op), Op->getValueType(0), 1876 Op->getOperand(1), Op->getOperand(3), Op->getOperand(2)); 1877 case Intrinsic::mips_insve_b: 1878 case Intrinsic::mips_insve_h: 1879 case Intrinsic::mips_insve_w: 1880 case Intrinsic::mips_insve_d: { 1881 // Report an error for out of range values. 1882 int64_t Max; 1883 switch (Intrinsic) { 1884 case Intrinsic::mips_insve_b: Max = 15; break; 1885 case Intrinsic::mips_insve_h: Max = 7; break; 1886 case Intrinsic::mips_insve_w: Max = 3; break; 1887 case Intrinsic::mips_insve_d: Max = 1; break; 1888 default: llvm_unreachable("Unmatched intrinsic"); 1889 } 1890 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 1891 if (Value < 0 \|\| Value > Max) 1892 report_fatal_error("Immediate out of range"); 1893 return DAG.getNode(MipsISD::INSVE, DL, Op->getValueType(0), 1894 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3), 1895 DAG.getConstant(0, DL, MVT::i32)); 1896 } 1897 case Intrinsic::mips_ldi_b: 1898 case Intrinsic::mips_ldi_h: 1899 case Intrinsic::mips_ldi_w: 1900 case Intrinsic::mips_ldi_d: 1901 return lowerMSASplatImm(Op, 1, DAG, true); 1902 case Intrinsic::mips_lsa: 1903 case Intrinsic::mips_dlsa: { 1904 EVT ResTy = Op->getValueType(0); 1905 return DAG.getNode(ISD::ADD, SDLoc(Op), ResTy, Op->getOperand(1), 1906 DAG.getNode(ISD::SHL, SDLoc(Op), ResTy, 1907 Op->getOperand(2), Op->getOperand(3))); 1908 } 1909 case Intrinsic::mips_maddv_b: 1910 case Intrinsic::mips_maddv_h: 1911 case Intrinsic::mips_maddv_w: 1912 case Intrinsic::mips_maddv_d: { 1913 EVT ResTy = Op->getValueType(0); 1914 return DAG.getNode(ISD::ADD, SDLoc(Op), ResTy, Op->getOperand(1), 1915 DAG.getNode(ISD::MUL, SDLoc(Op), ResTy, 1916 Op->getOperand(2), Op->getOperand(3))); 1917 } 1918 case Intrinsic::mips_max_s_b: 1919 case Intrinsic::mips_max_s_h: 1920 case Intrinsic::mips_max_s_w: 1921 case Intrinsic::mips_max_s_d: 1922 return DAG.getNode(MipsISD::VSMAX, DL, Op->getValueType(0), 1923 Op->getOperand(1), Op->getOperand(2)); 1924 case Intrinsic::mips_max_u_b: 1925 case Intrinsic::mips_max_u_h: 1926 case Intrinsic::mips_max_u_w: 1927 case Intrinsic::mips_max_u_d: 1928 return DAG.getNode(MipsISD::VUMAX, DL, Op->getValueType(0), 1929 Op->getOperand(1), Op->getOperand(2)); 1930 case Intrinsic::mips_maxi_s_b: 1931 case Intrinsic::mips_maxi_s_h: 1932 case Intrinsic::mips_maxi_s_w: 1933 case Intrinsic::mips_maxi_s_d: 1934 return DAG.getNode(MipsISD::VSMAX, DL, Op->getValueType(0), 1935 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG, true)); 1936 case Intrinsic::mips_maxi_u_b: 1937 case Intrinsic::mips_maxi_u_h: 1938 case Intrinsic::mips_maxi_u_w: 1939 case Intrinsic::mips_maxi_u_d: 1940 return DAG.getNode(MipsISD::VUMAX, DL, Op->getValueType(0), 1941 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 1942 case Intrinsic::mips_min_s_b: 1943 case Intrinsic::mips_min_s_h: 1944 case Intrinsic::mips_min_s_w: 1945 case Intrinsic::mips_min_s_d: 1946 return DAG.getNode(MipsISD::VSMIN, DL, Op->getValueType(0), 1947 Op->getOperand(1), Op->getOperand(2)); 1948 case Intrinsic::mips_min_u_b: 1949 case Intrinsic::mips_min_u_h: 1950 case Intrinsic::mips_min_u_w: 1951 case Intrinsic::mips_min_u_d: 1952 return DAG.getNode(MipsISD::VUMIN, DL, Op->getValueType(0), 1953 Op->getOperand(1), Op->getOperand(2)); 1954 case Intrinsic::mips_mini_s_b: 1955 case Intrinsic::mips_mini_s_h: 1956 case Intrinsic::mips_mini_s_w: 1957 case Intrinsic::mips_mini_s_d: 1958 return DAG.getNode(MipsISD::VSMIN, DL, Op->getValueType(0), 1959 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG, true)); 1960 case Intrinsic::mips_mini_u_b: 1961 case Intrinsic::mips_mini_u_h: 1962 case Intrinsic::mips_mini_u_w: 1963 case Intrinsic::mips_mini_u_d: 1964 return DAG.getNode(MipsISD::VUMIN, DL, Op->getValueType(0), 1965 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 1966 case Intrinsic::mips_mod_s_b: 1967 case Intrinsic::mips_mod_s_h: 1968 case Intrinsic::mips_mod_s_w: 1969 case Intrinsic::mips_mod_s_d: 1970 return DAG.getNode(ISD::SREM, DL, Op->getValueType(0), Op->getOperand(1), 1971 Op->getOperand(2)); 1972 case Intrinsic::mips_mod_u_b: 1973 case Intrinsic::mips_mod_u_h: 1974 case Intrinsic::mips_mod_u_w: 1975 case Intrinsic::mips_mod_u_d: 1976 return DAG.getNode(ISD::UREM, DL, Op->getValueType(0), Op->getOperand(1), 1977 Op->getOperand(2)); 1978 case Intrinsic::mips_mulv_b: 1979 case Intrinsic::mips_mulv_h: 1980 case Intrinsic::mips_mulv_w: 1981 case Intrinsic::mips_mulv_d: 1982 return DAG.getNode(ISD::MUL, DL, Op->getValueType(0), Op->getOperand(1), 1983 Op->getOperand(2)); 1984 case Intrinsic::mips_msubv_b: 1985 case Intrinsic::mips_msubv_h: 1986 case Intrinsic::mips_msubv_w: 1987 case Intrinsic::mips_msubv_d: { 1988 EVT ResTy = Op->getValueType(0); 1989 return DAG.getNode(ISD::SUB, SDLoc(Op), ResTy, Op->getOperand(1), 1990 DAG.getNode(ISD::MUL, SDLoc(Op), ResTy, 1991 Op->getOperand(2), Op->getOperand(3))); 1992 } 1993 case Intrinsic::mips_nlzc_b: 1994 case Intrinsic::mips_nlzc_h: 1995 case Intrinsic::mips_nlzc_w: 1996 case Intrinsic::mips_nlzc_d: 1997 return DAG.getNode(ISD::CTLZ, DL, Op->getValueType(0), Op->getOperand(1)); 1998 case Intrinsic::mips_nor_v: { 1999 SDValue Res = DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2000 Op->getOperand(1), Op->getOperand(2)); 2001 return DAG.getNOT(DL, Res, Res->getValueType(0)); 2002 } 2003 case Intrinsic::mips_nori_b: { 2004 SDValue Res = DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2005 Op->getOperand(1), 2006 lowerMSASplatImm(Op, 2, DAG)); 2007 return DAG.getNOT(DL, Res, Res->getValueType(0)); 2008 } 2009 case Intrinsic::mips_or_v: 2010 return DAG.getNode(ISD::OR, DL, Op->getValueType(0), Op->getOperand(1), 2011 Op->getOperand(2)); 2012 case Intrinsic::mips_ori_b: 2013 return DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2014 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2015 case Intrinsic::mips_pckev_b: 2016 case Intrinsic::mips_pckev_h: 2017 case Intrinsic::mips_pckev_w: 2018 case Intrinsic::mips_pckev_d: 2019 return DAG.getNode(MipsISD::PCKEV, DL, Op->getValueType(0), 2020 Op->getOperand(1), Op->getOperand(2)); 2021 case Intrinsic::mips_pckod_b: 2022 case Intrinsic::mips_pckod_h: 2023 case Intrinsic::mips_pckod_w: 2024 case Intrinsic::mips_pckod_d: 2025 return DAG.getNode(MipsISD::PCKOD, DL, Op->getValueType(0), 2026 Op->getOperand(1), Op->getOperand(2)); 2027 case Intrinsic::mips_pcnt_b: 2028 case Intrinsic::mips_pcnt_h: 2029 case Intrinsic::mips_pcnt_w: 2030 case Intrinsic::mips_pcnt_d: 2031 return DAG.getNode(ISD::CTPOP, DL, Op->getValueType(0), Op->getOperand(1)); 2032 case Intrinsic::mips_sat_s_b: 2033 case Intrinsic::mips_sat_s_h: 2034 case Intrinsic::mips_sat_s_w: 2035 case Intrinsic::mips_sat_s_d: 2036 case Intrinsic::mips_sat_u_b: 2037 case Intrinsic::mips_sat_u_h: 2038 case Intrinsic::mips_sat_u_w: 2039 case Intrinsic::mips_sat_u_d: { 2040 // Report an error for out of range values. 2041 int64_t Max; 2042 switch (Intrinsic) { 2043 case Intrinsic::mips_sat_s_b: 2044 case Intrinsic::mips_sat_u_b: Max = 7; break; 2045 case Intrinsic::mips_sat_s_h: 2046 case Intrinsic::mips_sat_u_h: Max = 15; break; 2047 case Intrinsic::mips_sat_s_w: 2048 case Intrinsic::mips_sat_u_w: Max = 31; break; 2049 case Intrinsic::mips_sat_s_d: 2050 case Intrinsic::mips_sat_u_d: Max = 63; break; 2051 default: llvm_unreachable("Unmatched intrinsic"); 2052 } 2053 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2054 if (Value < 0 \|\| Value > Max) 2055 report_fatal_error("Immediate out of range"); 2056 return SDValue(); 2057 } 2058 case Intrinsic::mips_shf_b: 2059 case Intrinsic::mips_shf_h: 2060 case Intrinsic::mips_shf_w: { 2061 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2062 if (Value < 0 \|\| Value > 255) 2063 report_fatal_error("Immediate out of range"); 2064 return DAG.getNode(MipsISD::SHF, DL, Op->getValueType(0), 2065 Op->getOperand(2), Op->getOperand(1)); 2066 } 2067 case Intrinsic::mips_sldi_b: 2068 case Intrinsic::mips_sldi_h: 2069 case Intrinsic::mips_sldi_w: 2070 case Intrinsic::mips_sldi_d: { 2071 // Report an error for out of range values. 2072 int64_t Max; 2073 switch (Intrinsic) { 2074 case Intrinsic::mips_sldi_b: Max = 15; break; 2075 case Intrinsic::mips_sldi_h: Max = 7; break; 2076 case Intrinsic::mips_sldi_w: Max = 3; break; 2077 case Intrinsic::mips_sldi_d: Max = 1; break; 2078 default: llvm_unreachable("Unmatched intrinsic"); 2079 } 2080 int64_t Value = cast<ConstantSDNode>(Op->getOperand(3))->getSExtValue(); 2081 if (Value < 0 \|\| Value > Max) 2082 report_fatal_error("Immediate out of range"); 2083 return SDValue(); 2084 } 2085 case Intrinsic::mips_sll_b: 2086 case Intrinsic::mips_sll_h: 2087 case Intrinsic::mips_sll_w: 2088 case Intrinsic::mips_sll_d: 2089 return DAG.getNode(ISD::SHL, DL, Op->getValueType(0), Op->getOperand(1), 2090 truncateVecElts(Op, DAG)); 2091 case Intrinsic::mips_slli_b: 2092 case Intrinsic::mips_slli_h: 2093 case Intrinsic::mips_slli_w: 2094 case Intrinsic::mips_slli_d: 2095 return DAG.getNode(ISD::SHL, DL, Op->getValueType(0), 2096 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2097 case Intrinsic::mips_splat_b: 2098 case Intrinsic::mips_splat_h: 2099 case Intrinsic::mips_splat_w: 2100 case Intrinsic::mips_splat_d: 2101 // We can't lower via VECTOR_SHUFFLE because it requires constant shuffle 2102 // masks, nor can we lower via BUILD_VECTOR & EXTRACT_VECTOR_ELT because 2103 // EXTRACT_VECTOR_ELT can't extract i64's on MIPS32. 2104 // Instead we lower to MipsISD::VSHF and match from there. 2105 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2106 lowerMSASplatZExt(Op, 2, DAG), Op->getOperand(1), 2107 Op->getOperand(1)); 2108 case Intrinsic::mips_splati_b: 2109 case Intrinsic::mips_splati_h: 2110 case Intrinsic::mips_splati_w: 2111 case Intrinsic::mips_splati_d: 2112 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2113 lowerMSASplatImm(Op, 2, DAG), Op->getOperand(1), 2114 Op->getOperand(1)); 2115 case Intrinsic::mips_sra_b: 2116 case Intrinsic::mips_sra_h: 2117 case Intrinsic::mips_sra_w: 2118 case Intrinsic::mips_sra_d: 2119 return DAG.getNode(ISD::SRA, DL, Op->getValueType(0), Op->getOperand(1), 2120 truncateVecElts(Op, DAG)); 2121 case Intrinsic::mips_srai_b: 2122 case Intrinsic::mips_srai_h: 2123 case Intrinsic::mips_srai_w: 2124 case Intrinsic::mips_srai_d: 2125 return DAG.getNode(ISD::SRA, DL, Op->getValueType(0), 2126 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2127 case Intrinsic::mips_srari_b: 2128 case Intrinsic::mips_srari_h: 2129 case Intrinsic::mips_srari_w: 2130 case Intrinsic::mips_srari_d: { 2131 // Report an error for out of range values. 2132 int64_t Max; 2133 switch (Intrinsic) { 2134 case Intrinsic::mips_srari_b: Max = 7; break; 2135 case Intrinsic::mips_srari_h: Max = 15; break; 2136 case Intrinsic::mips_srari_w: Max = 31; break; 2137 case Intrinsic::mips_srari_d: Max = 63; break; 2138 default: llvm_unreachable("Unmatched intrinsic"); 2139 } 2140 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2141 if (Value < 0 \|\| Value > Max) 2142 report_fatal_error("Immediate out of range"); 2143 return SDValue(); 2144 } 2145 case Intrinsic::mips_srl_b: 2146 case Intrinsic::mips_srl_h: 2147 case Intrinsic::mips_srl_w: 2148 case Intrinsic::mips_srl_d: 2149 return DAG.getNode(ISD::SRL, DL, Op->getValueType(0), Op->getOperand(1), 2150 truncateVecElts(Op, DAG)); 2151 case Intrinsic::mips_srli_b: 2152 case Intrinsic::mips_srli_h: 2153 case Intrinsic::mips_srli_w: 2154 case Intrinsic::mips_srli_d: 2155 return DAG.getNode(ISD::SRL, DL, Op->getValueType(0), 2156 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2157 case Intrinsic::mips_srlri_b: 2158 case Intrinsic::mips_srlri_h: 2159 case Intrinsic::mips_srlri_w: 2160 case Intrinsic::mips_srlri_d: { 2161 // Report an error for out of range values. 2162 int64_t Max; 2163 switch (Intrinsic) { 2164 case Intrinsic::mips_srlri_b: Max = 7; break; 2165 case Intrinsic::mips_srlri_h: Max = 15; break; 2166 case Intrinsic::mips_srlri_w: Max = 31; break; 2167 case Intrinsic::mips_srlri_d: Max = 63; break; 2168 default: llvm_unreachable("Unmatched intrinsic"); 2169 } 2170 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2171 if (Value < 0 \|\| Value > Max) 2172 report_fatal_error("Immediate out of range"); 2173 return SDValue(); 2174 } 2175 case Intrinsic::mips_subv_b: 2176 case Intrinsic::mips_subv_h: 2177 case Intrinsic::mips_subv_w: 2178 case Intrinsic::mips_subv_d: 2179 return DAG.getNode(ISD::SUB, DL, Op->getValueType(0), Op->getOperand(1), 2180 Op->getOperand(2)); 2181 case Intrinsic::mips_subvi_b: 2182 case Intrinsic::mips_subvi_h: 2183 case Intrinsic::mips_subvi_w: 2184 case Intrinsic::mips_subvi_d: 2185 return DAG.getNode(ISD::SUB, DL, Op->getValueType(0), 2186 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2187 case Intrinsic::mips_vshf_b: 2188 case Intrinsic::mips_vshf_h: 2189 case Intrinsic::mips_vshf_w: 2190 case Intrinsic::mips_vshf_d: 2191 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2192 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3)); 2193 case Intrinsic::mips_xor_v: 2194 return DAG.getNode(ISD::XOR, DL, Op->getValueType(0), Op->getOperand(1), 2195 Op->getOperand(2)); 2196 case Intrinsic::mips_xori_b: 2197 return DAG.getNode(ISD::XOR, DL, Op->getValueType(0), 2198 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2199 case Intrinsic::thread_pointer: { 2200 EVT PtrVT = getPointerTy(DAG.getDataLayout()); 2201 return DAG.getNode(MipsISD::ThreadPointer, DL, PtrVT); 2202 } 2203 } 2204 } 2205 2206 static SDValue lowerMSALoadIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, 2207 const MipsSubtarget &Subtarget) { 2208 SDLoc DL(Op); 2209 SDValue ChainIn = Op->getOperand(0); 2210 SDValue Address = Op->getOperand(2); 2211 SDValue Offset = Op->getOperand(3); 2212 EVT ResTy = Op->getValueType(0); 2213 EVT PtrTy = Address->getValueType(0); 2214 2215 // For N64 addresses have the underlying type MVT::i64. This intrinsic 2216 // however takes an i32 signed constant offset. The actual type of the 2217 // intrinsic is a scaled signed i10. 2218 if (Subtarget.isABI_N64()) 2219 Offset = DAG.getNode(ISD::SIGN_EXTEND, DL, PtrTy, Offset); 2220 2221 Address = DAG.getNode(ISD::ADD, DL, PtrTy, Address, Offset); 2222 return DAG.getLoad(ResTy, DL, ChainIn, Address, MachinePointerInfo(), 2223 /* Alignment = / 16); 2224 } 2225 2226 SDValue MipsSETargetLowering::lowerINTRINSIC_W_CHAIN(SDValue Op, 2227 SelectionDAG &DAG) const { 2228 unsigned Intr = cast<ConstantSDNode>(Op->getOperand(1))->getZExtValue(); 2229 switch (Intr) { 2230 default: 2231 return SDValue(); 2232 case Intrinsic::mips_extp: 2233 return lowerDSPIntr(Op, DAG, MipsISD::EXTP); 2234 case Intrinsic::mips_extpdp: 2235 return lowerDSPIntr(Op, DAG, MipsISD::EXTPDP); 2236 case Intrinsic::mips_extr_w: 2237 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_W); 2238 case Intrinsic::mips_extr_r_w: 2239 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_R_W); 2240 case Intrinsic::mips_extr_rs_w: 2241 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_RS_W); 2242 case Intrinsic::mips_extr_s_h: 2243 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_S_H); 2244 case Intrinsic::mips_mthlip: 2245 return lowerDSPIntr(Op, DAG, MipsISD::MTHLIP); 2246 case Intrinsic::mips_mulsaq_s_w_ph: 2247 return lowerDSPIntr(Op, DAG, MipsISD::MULSAQ_S_W_PH); 2248 case Intrinsic::mips_maq_s_w_phl: 2249 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_S_W_PHL); 2250 case Intrinsic::mips_maq_s_w_phr: 2251 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_S_W_PHR); 2252 case Intrinsic::mips_maq_sa_w_phl: 2253 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_SA_W_PHL); 2254 case Intrinsic::mips_maq_sa_w_phr: 2255 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_SA_W_PHR); 2256 case Intrinsic::mips_dpaq_s_w_ph: 2257 return lowerDSPIntr(Op, DAG, MipsISD::DPAQ_S_W_PH); 2258 case Intrinsic::mips_dpsq_s_w_ph: 2259 return lowerDSPIntr(Op, DAG, MipsISD::DPSQ_S_W_PH); 2260 case Intrinsic::mips_dpaq_sa_l_w: 2261 return lowerDSPIntr(Op, DAG, MipsISD::DPAQ_SA_L_W); 2262 case Intrinsic::mips_dpsq_sa_l_w: 2263 return lowerDSPIntr(Op, DAG, MipsISD::DPSQ_SA_L_W); 2264 case Intrinsic::mips_dpaqx_s_w_ph: 2265 return lowerDSPIntr(Op, DAG, MipsISD::DPAQX_S_W_PH); 2266 case Intrinsic::mips_dpaqx_sa_w_ph: 2267 return lowerDSPIntr(Op, DAG, MipsISD::DPAQX_SA_W_PH); 2268 case Intrinsic::mips_dpsqx_s_w_ph: 2269 return lowerDSPIntr(Op, DAG, MipsISD::DPSQX_S_W_PH); 2270 case Intrinsic::mips_dpsqx_sa_w_ph: 2271 return lowerDSPIntr(Op, DAG, MipsISD::DPSQX_SA_W_PH); 2272 case Intrinsic::mips_ld_b: 2273 case Intrinsic::mips_ld_h: 2274 case Intrinsic::mips_ld_w: 2275 case Intrinsic::mips_ld_d: 2276 return lowerMSALoadIntr(Op, DAG, Intr, Subtarget); 2277 } 2278 } 2279 2280 static SDValue lowerMSAStoreIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, 2281 const MipsSubtarget &Subtarget) { 2282 SDLoc DL(Op); 2283 SDValue ChainIn = Op->getOperand(0); 2284 SDValue Value = Op->getOperand(2); 2285 SDValue Address = Op->getOperand(3); 2286 SDValue Offset = Op->getOperand(4); 2287 EVT PtrTy = Address->getValueType(0); 2288 2289 // For N64 addresses have the underlying type MVT::i64. This intrinsic 2290 // however takes an i32 signed constant offset. The actual type of the 2291 // intrinsic is a scaled signed i10. 2292 if (Subtarget.isABI_N64()) 2293 Offset = DAG.getNode(ISD::SIGN_EXTEND, DL, PtrTy, Offset); 2294 2295 Address = DAG.getNode(ISD::ADD, DL, PtrTy, Address, Offset); 2296 2297 return DAG.getStore(ChainIn, DL, Value, Address, MachinePointerInfo(), 2298 / Alignment = / 16); 2299 } 2300 2301 SDValue MipsSETargetLowering::lowerINTRINSIC_VOID(SDValue Op, 2302 SelectionDAG &DAG) const { 2303 unsigned Intr = cast<ConstantSDNode>(Op->getOperand(1))->getZExtValue(); 2304 switch (Intr) { 2305 default: 2306 return SDValue(); 2307 case Intrinsic::mips_st_b: 2308 case Intrinsic::mips_st_h: 2309 case Intrinsic::mips_st_w: 2310 case Intrinsic::mips_st_d: 2311 return lowerMSAStoreIntr(Op, DAG, Intr, Subtarget); 2312 } 2313 } 2314 2315 /// \brief Check if the given BuildVectorSDNode is a splat. 2316 /// This method currently relies on DAG nodes being reused when equivalent, 2317 /// so it's possible for this to return false even when isConstantSplat returns 2318 /// true. 2319 static bool isSplatVector(const BuildVectorSDNode N) { 2320 unsigned int nOps = N->getNumOperands(); 2321 assert(nOps > 1 && "isSplatVector has 0 or 1 sized build vector"); 2322 2323 SDValue Operand0 = N->getOperand(0); 2324 2325 for (unsigned int i = 1; i < nOps; ++i) { 2326 if (N->getOperand(i) != Operand0) 2327 return false; 2328 } 2329 2330 return true; 2331 } 2332 2333 // Lower ISD::EXTRACT_VECTOR_ELT into MipsISD::VEXTRACT_SEXT_ELT. 2334 // 2335 // The non-value bits resulting from ISD::EXTRACT_VECTOR_ELT are undefined. We 2336 // choose to sign-extend but we could have equally chosen zero-extend. The 2337 // DAGCombiner will fold any sign/zero extension of the ISD::EXTRACT_VECTOR_ELT 2338 // result into this node later (possibly changing it to a zero-extend in the 2339 // process). 2340 SDValue MipsSETargetLowering:: 2341 lowerEXTRACT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG) const { 2342 SDLoc DL(Op); 2343 EVT ResTy = Op->getValueType(0); 2344 SDValue Op0 = Op->getOperand(0); 2345 EVT VecTy = Op0->getValueType(0); 2346 2347 if (!VecTy.is128BitVector()) 2348 return SDValue(); 2349 2350 if (ResTy.isInteger()) { 2351 SDValue Op1 = Op->getOperand(1); 2352 EVT EltTy = VecTy.getVectorElementType(); 2353 return DAG.getNode(MipsISD::VEXTRACT_SEXT_ELT, DL, ResTy, Op0, Op1, 2354 DAG.getValueType(EltTy)); 2355 } 2356 2357 return Op; 2358 } 2359 2360 static bool isConstantOrUndef(const SDValue Op) { 2361 if (Op->isUndef()) 2362 return true; 2363 if (isa<ConstantSDNode>(Op)) 2364 return true; 2365 if (isa<ConstantFPSDNode>(Op)) 2366 return true; 2367 return false; 2368 } 2369 2371 for (unsigned i = 0; i < Op->getNumOperands(); ++i) 2372 if (isConstantOrUndef(Op->getOperand(i))) 2373 return true; 2374 return false; 2375 } 2376 2377 // Lowers ISD::BUILD_VECTOR into appropriate SelectionDAG nodes for the 2378 // backend. 2379 // 2380 // Lowers according to the following rules: 2381 // - Constant splats are legal as-is as long as the SplatBitSize is a power of 2382 // 2 less than or equal to 64 and the value fits into a signed 10-bit 2383 // immediate 2384 // - Constant splats are lowered to bitconverted BUILD_VECTORs if SplatBitSize 2385 // is a power of 2 less than or equal to 64 and the value does not fit into a 2386 // signed 10-bit immediate 2387 // - Non-constant splats are legal as-is. 2388 // - Non-constant non-splats are lowered to sequences of INSERT_VECTOR_ELT. 2389 // - All others are illegal and must be expanded. 2390 SDValue MipsSETargetLowering::lowerBUILD_VECTOR(SDValue Op, 2391 SelectionDAG &DAG) const { 2392 BuildVectorSDNode Node = cast<BuildVectorSDNode>(Op); 2393 EVT ResTy = Op->getValueType(0); 2394 SDLoc DL(Op); 2395 APInt SplatValue, SplatUndef; 2396 unsigned SplatBitSize; 2397 bool HasAnyUndefs; 2398 2399 if (!Subtarget.hasMSA() \|\| !ResTy.is128BitVector()) 2400 return SDValue(); 2401 2402 if (Node->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, 2403 HasAnyUndefs, 8, 2404 !Subtarget.isLittle()) && SplatBitSize <= 64) { 2405 // We can only cope with 8, 16, 32, or 64-bit elements 2406 if (SplatBitSize != 8 && SplatBitSize != 16 && SplatBitSize != 32 && 2407 SplatBitSize != 64) 2408 return SDValue(); 2409 2410 // If the value isn't an integer type we will have to bitcast 2411 // from an integer type first. Also, if there are any undefs, we must 2412 // lower them to defined values first. 2413 if (ResTy.isInteger() && !HasAnyUndefs) 2414 return Op; 2415 2416 EVT ViaVecTy; 2417 2418 switch (SplatBitSize) { 2419 default: 2420 return SDValue(); 2421 case 8: 2422 ViaVecTy = MVT::v16i8; 2423 break; 2424 case 16: 2425 ViaVecTy = MVT::v8i16; 2426 break; 2427 case 32: 2428 ViaVecTy = MVT::v4i32; 2429 break; 2430 case 64: 2431 // There's no fill.d to fall back on for 64-bit values 2432 return SDValue(); 2433 } 2434 2435 // SelectionDAG::getConstant will promote SplatValue appropriately. 2436 SDValue Result = DAG.getConstant(SplatValue, DL, ViaVecTy); 2437 2438 // Bitcast to the type we originally wanted 2439 if (ViaVecTy != ResTy) 2440 Result = DAG.getNode(ISD::BITCAST, SDLoc(Node), ResTy, Result); 2441 2442 return Result; 2443 } else if (isSplatVector(Node)) 2444 return Op; 2445 else if (!isConstantOrUndefBUILD_VECTOR(Node)) { 2446 // Use INSERT_VECTOR_ELT operations rather than expand to stores. 2447 // The resulting code is the same length as the expansion, but it doesn't 2448 // use memory operations 2449 EVT ResTy = Node->getValueType(0); 2450 2451 assert(ResTy.isVector()); 2452 2453 unsigned NumElts = ResTy.getVectorNumElements(); 2454 SDValue Vector = DAG.getUNDEF(ResTy); 2455 for (unsigned i = 0; i < NumElts; ++i) { 2456 Vector = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, ResTy, Vector, 2457 Node->getOperand(i), 2458 DAG.getConstant(i, DL, MVT::i32)); 2459 } 2460 return Vector; 2461 } 2462 2463 return SDValue(); 2464 } 2465 2466 // Lower VECTOR_SHUFFLE into SHF (if possible). 2467 // 2468 // SHF splits the vector into blocks of four elements, then shuffles these 2469 // elements according to a <4 x i2> constant (encoded as an integer immediate). 2470 // 2471 // It is therefore possible to lower into SHF when the mask takes the form: 2472 // <a, b, c, d, a+4, b+4, c+4, d+4, a+8, b+8, c+8, d+8, ...> 2473 // When undef's appear they are treated as if they were whatever value is 2474 // necessary in order to fit the above forms. 2475 // 2476 // For example: 2477 // %2 = shufflevector <8 x i16> %0, <8 x i16> undef, 2478 // <8 x i32> <i32 3, i32 2, i32 1, i32 0, 2479 // i32 7, i32 6, i32 5, i32 4> 2480 // is lowered to: 2481 // (SHF_H $w0, $w1, 27) 2482 // where the 27 comes from: 2483 // 3 + (2 << 2) + (1 << 4) + (0 << 6) 2485 SmallVector<int, 16> Indices, 2486 SelectionDAG &DAG) { 2487 int SHFIndices[4] = { -1, -1, -1, -1 }; 2488 2489 if (Indices.size() < 4) 2490 return SDValue(); 2491 2492 for (unsigned i = 0; i < 4; ++i) { 2493 for (unsigned j = i; j < Indices.size(); j += 4) { 2494 int Idx = Indices[j]; 2495 2496 // Convert from vector index to 4-element subvector index 2497 // If an index refers to an element outside of the subvector then give up 2498 if (Idx != -1) { 2499 Idx -= 4 (j / 4); 2500 if (Idx < 0 \|\| Idx >= 4) 2501 return SDValue(); 2502 } 2503 2504 // If the mask has an undef, replace it with the current index. 2505 // Note that it might still be undef if the current index is also undef 2506 if (SHFIndices[i] == -1) 2507 SHFIndices[i] = Idx; 2508 2509 // Check that non-undef values are the same as in the mask. If they 2510 // aren't then give up 2511 if (!(Idx == -1 \|\| Idx == SHFIndices[i])) 2512 return SDValue(); 2513 } 2514 } 2515 2516 // Calculate the immediate. Replace any remaining undefs with zero 2517 APInt Imm(32, 0); 2518 for (int i = 3; i >= 0; --i) { 2519 int Idx = SHFIndices[i]; 2520 2521 if (Idx == -1) 2522 Idx = 0; 2523 2524 Imm <<= 2; 2525 Imm \|= Idx & 0x3; 2526 } 2527 2528 SDLoc DL(Op); 2529 return DAG.getNode(MipsISD::SHF, DL, ResTy, 2530 DAG.getConstant(Imm, DL, MVT::i32), Op->getOperand(0)); 2531 } 2532 2533 /// Determine whether a range fits a regular pattern of values. 2534 /// This function accounts for the possibility of jumping over the End iterator. 2535 template <typename ValType> 2536 static bool 2538 unsigned CheckStride, 2540 ValType ExpectedIndex, unsigned ExpectedIndexStride) { 2541 auto &I = Begin; 2542 2543 while (I != End) { 2544 if (I != -1 && I != ExpectedIndex) 2545 return false; 2546 ExpectedIndex += ExpectedIndexStride; 2547 2548 // Incrementing past End is undefined behaviour so we must increment one 2549 // step at a time and check for End at each step. 2550 for (unsigned n = 0; n < CheckStride && I != End; ++n, ++I) 2551 ; // Empty loop body. 2552 } 2553 return true; 2554 } 2555 2556 // Determine whether VECTOR_SHUFFLE is a SPLATI. 2557 // 2558 // It is a SPLATI when the mask is: 2559 // <x, x, x, ...> 2560 // where x is any valid index. 2561 // 2562 // When undef's appear in the mask they are treated as if they were whatever 2563 // value is necessary in order to fit the above form. 2564 static bool isVECTOR_SHUFFLE_SPLATI(SDValue Op, EVT ResTy, 2565 SmallVector<int, 16> Indices, 2566 SelectionDAG &DAG) { 2567 assert((Indices.size() % 2) == 0); 2568 2569 int SplatIndex = -1; 2570 for (const auto &V : Indices) { 2571 if (V != -1) { 2572 SplatIndex = V; 2573 break; 2574 } 2575 } 2576 2577 return fitsRegularPattern<int>(Indices.begin(), 1, Indices.end(), SplatIndex, 2578 0); 2579 } 2580 2581 // Lower VECTOR_SHUFFLE into ILVEV (if possible). 2582 // 2583 // ILVEV interleaves the even elements from each vector. 2584 // 2585 // It is possible to lower into ILVEV when the mask consists of two of the 2586 // following forms interleaved: 2587 // <0, 2, 4, ...> 2588 // <n, n+2, n+4, ...> 2589 // where n is the number of elements in the vector. 2590 // For example: 2591 // <0, 0, 2, 2, 4, 4, ...> 2592 // <0, n, 2, n+2, 4, n+4, ...> 2593 // 2594 // When undef's appear in the mask they are treated as if they were whatever 2595 // value is necessary in order to fit the above forms. 2597 SmallVector<int, 16> Indices, 2598 SelectionDAG &DAG) { 2599 assert((Indices.size() % 2) == 0); 2600 2601 SDValue Wt; 2602 SDValue Ws; 2603 const auto &Begin = Indices.begin(); 2604 const auto &End = Indices.end(); 2605 2606 // Check even elements are taken from the even elements of one half or the 2607 // other and pick an operand accordingly. 2608 if (fitsRegularPattern<int>(Begin, 2, End, 0, 2)) 2609 Wt = Op->getOperand(0); 2610 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 2)) 2611 Wt = Op->getOperand(1); 2612 else 2613 return SDValue(); 2614 2615 // Check odd elements are taken from the even elements of one half or the 2616 // other and pick an operand accordingly. 2617 if (fitsRegularPattern<int>(Begin + 1, 2, End, 0, 2)) 2618 Ws = Op->getOperand(0); 2619 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 2)) 2620 Ws = Op->getOperand(1); 2621 else 2622 return SDValue(); 2623 2624 return DAG.getNode(MipsISD::ILVEV, SDLoc(Op), ResTy, Ws, Wt); 2625 } 2626 2627 // Lower VECTOR_SHUFFLE into ILVOD (if possible). 2628 // 2629 // ILVOD interleaves the odd elements from each vector. 2630 // 2631 // It is possible to lower into ILVOD when the mask consists of two of the 2632 // following forms interleaved: 2633 // <1, 3, 5, ...> 2634 // <n+1, n+3, n+5, ...> 2635 // where n is the number of elements in the vector. 2636 // For example: 2637 // <1, 1, 3, 3, 5, 5, ...> 2638 // <1, n+1, 3, n+3, 5, n+5, ...> 2639 // 2640 // When undef's appear in the mask they are treated as if they were whatever 2641 // value is necessary in order to fit the above forms. 2643 SmallVector<int, 16> Indices, 2644 SelectionDAG &DAG) { 2645 assert((Indices.size() % 2) == 0); 2646 2647 SDValue Wt; 2648 SDValue Ws; 2649 const auto &Begin = Indices.begin(); 2650 const auto &End = Indices.end(); 2651 2652 // Check even elements are taken from the odd elements of one half or the 2653 // other and pick an operand accordingly. 2654 if (fitsRegularPattern<int>(Begin, 2, End, 1, 2)) 2655 Wt = Op->getOperand(0); 2656 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + 1, 2)) 2657 Wt = Op->getOperand(1); 2658 else 2659 return SDValue(); 2660 2661 // Check odd elements are taken from the odd elements of one half or the 2662 // other and pick an operand accordingly. 2663 if (fitsRegularPattern<int>(Begin + 1, 2, End, 1, 2)) 2664 Ws = Op->getOperand(0); 2665 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + 1, 2)) 2666 Ws = Op->getOperand(1); 2667 else 2668 return SDValue(); 2669 2670 return DAG.getNode(MipsISD::ILVOD, SDLoc(Op), ResTy, Wt, Ws); 2671 } 2672 2673 // Lower VECTOR_SHUFFLE into ILVR (if possible). 2674 // 2675 // ILVR interleaves consecutive elements from the right (lowest-indexed) half of 2676 // each vector. 2677 // 2678 // It is possible to lower into ILVR when the mask consists of two of the 2679 // following forms interleaved: 2680 // <0, 1, 2, ...> 2681 // <n, n+1, n+2, ...> 2682 // where n is the number of elements in the vector. 2683 // For example: 2684 // <0, 0, 1, 1, 2, 2, ...> 2685 // <0, n, 1, n+1, 2, n+2, ...> 2686 // 2687 // When undef's appear in the mask they are treated as if they were whatever 2688 // value is necessary in order to fit the above forms. 2690 SmallVector<int, 16> Indices, 2691 SelectionDAG &DAG) { 2692 assert((Indices.size() % 2) == 0); 2693 2694 SDValue Wt; 2695 SDValue Ws; 2696 const auto &Begin = Indices.begin(); 2697 const auto &End = Indices.end(); 2698 2699 // Check even elements are taken from the right (lowest-indexed) elements of 2700 // one half or the other and pick an operand accordingly. 2701 if (fitsRegularPattern<int>(Begin, 2, End, 0, 1)) 2702 Wt = Op->getOperand(0); 2703 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 1)) 2704 Wt = Op->getOperand(1); 2705 else 2706 return SDValue(); 2707 2708 // Check odd elements are taken from the right (lowest-indexed) elements of 2709 // one half or the other and pick an operand accordingly. 2710 if (fitsRegularPattern<int>(Begin + 1, 2, End, 0, 1)) 2711 Ws = Op->getOperand(0); 2712 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 1)) 2713 Ws = Op->getOperand(1); 2714 else 2715 return SDValue(); 2716 2717 return DAG.getNode(MipsISD::ILVR, SDLoc(Op), ResTy, Ws, Wt); 2718 } 2719 2720 // Lower VECTOR_SHUFFLE into ILVL (if possible). 2721 // 2722 // ILVL interleaves consecutive elements from the left (highest-indexed) half 2723 // of each vector. 2724 // 2725 // It is possible to lower into ILVL when the mask consists of two of the 2726 // following forms interleaved: 2727 // <x, x+1, x+2, ...> 2728 // <n+x, n+x+1, n+x+2, ...> 2729 // where n is the number of elements in the vector and x is half n. 2730 // For example: 2731 // <x, x, x+1, x+1, x+2, x+2, ...> 2732 // <x, n+x, x+1, n+x+1, x+2, n+x+2, ...> 2733 // 2734 // When undef's appear in the mask they are treated as if they were whatever 2735 // value is necessary in order to fit the above forms. 2737 SmallVector<int, 16> Indices, 2738 SelectionDAG &DAG) { 2739 assert((Indices.size() % 2) == 0); 2740 2741 unsigned HalfSize = Indices.size() / 2; 2742 SDValue Wt; 2743 SDValue Ws; 2744 const auto &Begin = Indices.begin(); 2745 const auto &End = Indices.end(); 2746 2747 // Check even elements are taken from the left (highest-indexed) elements of 2748 // one half or the other and pick an operand accordingly. 2749 if (fitsRegularPattern<int>(Begin, 2, End, HalfSize, 1)) 2750 Wt = Op->getOperand(0); 2751 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + HalfSize, 1)) 2752 Wt = Op->getOperand(1); 2753 else 2754 return SDValue(); 2755 2756 // Check odd elements are taken from the left (highest-indexed) elements of 2757 // one half or the other and pick an operand accordingly. 2758 if (fitsRegularPattern<int>(Begin + 1, 2, End, HalfSize, 1)) 2759 Ws = Op->getOperand(0); 2760 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + HalfSize, 2761 1)) 2762 Ws = Op->getOperand(1); 2763 else 2764 return SDValue(); 2765 2766 return DAG.getNode(MipsISD::ILVL, SDLoc(Op), ResTy, Ws, Wt); 2767 } 2768 2769 // Lower VECTOR_SHUFFLE into PCKEV (if possible). 2770 // 2771 // PCKEV copies the even elements of each vector into the result vector. 2772 // 2773 // It is possible to lower into PCKEV when the mask consists of two of the 2774 // following forms concatenated: 2775 // <0, 2, 4, ...> 2776 // <n, n+2, n+4, ...> 2777 // where n is the number of elements in the vector. 2778 // For example: 2779 // <0, 2, 4, ..., 0, 2, 4, ...> 2780 // <0, 2, 4, ..., n, n+2, n+4, ...> 2781 // 2782 // When undef's appear in the mask they are treated as if they were whatever 2783 // value is necessary in order to fit the above forms. 2785 SmallVector<int, 16> Indices, 2786 SelectionDAG &DAG) { 2787 assert((Indices.size() % 2) == 0); 2788 2789 SDValue Wt; 2790 SDValue Ws; 2791 const auto &Begin = Indices.begin(); 2792 const auto &Mid = Indices.begin() + Indices.size() / 2; 2793 const auto &End = Indices.end(); 2794 2795 if (fitsRegularPattern<int>(Begin, 1, Mid, 0, 2)) 2796 Wt = Op->getOperand(0); 2797 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size(), 2)) 2798 Wt = Op->getOperand(1); 2799 else 2800 return SDValue(); 2801 2802 if (fitsRegularPattern<int>(Mid, 1, End, 0, 2)) 2803 Ws = Op->getOperand(0); 2804 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size(), 2)) 2805 Ws = Op->getOperand(1); 2806 else 2807 return SDValue(); 2808 2809 return DAG.getNode(MipsISD::PCKEV, SDLoc(Op), ResTy, Ws, Wt); 2810 } 2811 2812 // Lower VECTOR_SHUFFLE into PCKOD (if possible). 2813 // 2814 // PCKOD copies the odd elements of each vector into the result vector. 2815 // 2816 // It is possible to lower into PCKOD when the mask consists of two of the 2817 // following forms concatenated: 2818 // <1, 3, 5, ...> 2819 // <n+1, n+3, n+5, ...> 2820 // where n is the number of elements in the vector. 2821 // For example: 2822 // <1, 3, 5, ..., 1, 3, 5, ...> 2823 // <1, 3, 5, ..., n+1, n+3, n+5, ...> 2824 // 2825 // When undef's appear in the mask they are treated as if they were whatever 2826 // value is necessary in order to fit the above forms. 2828 SmallVector<int, 16> Indices, 2829 SelectionDAG &DAG) { 2830 assert((Indices.size() % 2) == 0); 2831 2832 SDValue Wt; 2833 SDValue Ws; 2834 const auto &Begin = Indices.begin(); 2835 const auto &Mid = Indices.begin() + Indices.size() / 2; 2836 const auto &End = Indices.end(); 2837 2838 if (fitsRegularPattern<int>(Begin, 1, Mid, 1, 2)) 2839 Wt = Op->getOperand(0); 2840 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size() + 1, 2)) 2841 Wt = Op->getOperand(1); 2842 else 2843 return SDValue(); 2844 2845 if (fitsRegularPattern<int>(Mid, 1, End, 1, 2)) 2846 Ws = Op->getOperand(0); 2847 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size() + 1, 2)) 2848 Ws = Op->getOperand(1); 2849 else 2850 return SDValue(); 2851 2852 return DAG.getNode(MipsISD::PCKOD, SDLoc(Op), ResTy, Ws, Wt); 2853 } 2854 2855 // Lower VECTOR_SHUFFLE into VSHF. 2856 // 2857 // This mostly consists of converting the shuffle indices in Indices into a 2858 // BUILD_VECTOR and adding it as an operand to the resulting VSHF. There is 2859 // also code to eliminate unused operands of the VECTOR_SHUFFLE. For example, 2860 // if the type is v8i16 and all the indices are less than 8 then the second 2861 // operand is unused and can be replaced with anything. We choose to replace it 2862 // with the used operand since this reduces the number of instructions overall. 2864 SmallVector<int, 16> Indices, 2865 SelectionDAG &DAG) { 2867 SDValue Op0; 2868 SDValue Op1; 2869 EVT MaskVecTy = ResTy.changeVectorElementTypeToInteger(); 2870 EVT MaskEltTy = MaskVecTy.getVectorElementType(); 2871 bool Using1stVec = false; 2872 bool Using2ndVec = false; 2873 SDLoc DL(Op); 2874 int ResTyNumElts = ResTy.getVectorNumElements(); 2875 2876 for (int i = 0; i < ResTyNumElts; ++i) { 2877 // Idx == -1 means UNDEF 2878 int Idx = Indices[i]; 2879 2880 if (0 <= Idx && Idx < ResTyNumElts) 2881 Using1stVec = true; 2882 if (ResTyNumElts <= Idx && Idx < ResTyNumElts * 2) 2883 Using2ndVec = true; 2884 } 2885 2886 for (SmallVector<int, 16>::iterator I = Indices.begin(); I != Indices.end(); 2887 ++I) 2888 Ops.push_back(DAG.getTargetConstant(I, DL, MaskEltTy)); 2889 2890 SDValue MaskVec = DAG.getBuildVector(MaskVecTy, DL, Ops); 2891 2892 if (Using1stVec && Using2ndVec) { 2893 Op0 = Op->getOperand(0); 2894 Op1 = Op->getOperand(1); 2895 } else if (Using1stVec) 2896 Op0 = Op1 = Op->getOperand(0); 2897 else if (Using2ndVec) 2898 Op0 = Op1 = Op->getOperand(1); 2899 else 2900 llvm_unreachable("shuffle vector mask references neither vector operand?"); 2901 2902 // VECTOR_SHUFFLE concatenates the vectors in an vectorwise fashion. 2903 // <0b00, 0b01> + <0b10, 0b11> -> <0b00, 0b01, 0b10, 0b11> 2904 // VSHF concatenates the vectors in a bitwise fashion: 2905 // <0b00, 0b01> + <0b10, 0b11> -> 2906 // 0b0100 + 0b1110 -> 0b01001110 2907 // <0b10, 0b11, 0b00, 0b01> 2908 // We must therefore swap the operands to get the correct result. 2909 return DAG.getNode(MipsISD::VSHF, DL, ResTy, MaskVec, Op1, Op0); 2910 } 2911 2912 // Lower VECTOR_SHUFFLE into one of a number of instructions depending on the 2913 // indices in the shuffle. 2914 SDValue MipsSETargetLowering::lowerVECTOR_SHUFFLE(SDValue Op, 2915 SelectionDAG &DAG) const { 2916 ShuffleVectorSDNode Node = cast<ShuffleVectorSDNode>(Op); 2917 EVT ResTy = Op->getValueType(0); 2918 2919 if (!ResTy.is128BitVector()) 2920 return SDValue(); 2921 2922 int ResTyNumElts = ResTy.getVectorNumElements(); 2923 SmallVector<int, 16> Indices; 2924 2925 for (int i = 0; i < ResTyNumElts; ++i) 2926 Indices.push_back(Node->getMaskElt(i)); 2927 2928 // splati.[bhwd] is preferable to the others but is matched from 2929 // MipsISD::VSHF. 2930 if (isVECTOR_SHUFFLE_SPLATI(Op, ResTy, Indices, DAG)) 2931 return lowerVECTOR_SHUFFLE_VSHF(Op, ResTy, Indices, DAG); 2932 SDValue Result; 2933 if ((Result = lowerVECTOR_SHUFFLE_ILVEV(Op, ResTy, Indices, DAG))) 2934 return Result; 2935 if ((Result = lowerVECTOR_SHUFFLE_ILVOD(Op, ResTy, Indices, DAG))) 2936 return Result; 2937 if ((Result = lowerVECTOR_SHUFFLE_ILVL(Op, ResTy, Indices, DAG))) 2938 return Result; 2939 if ((Result = lowerVECTOR_SHUFFLE_ILVR(Op, ResTy, Indices, DAG))) 2940 return Result; 2941 if ((Result = lowerVECTOR_SHUFFLE_PCKEV(Op, ResTy, Indices, DAG))) 2942 return Result; 2943 if ((Result = lowerVECTOR_SHUFFLE_PCKOD(Op, ResTy, Indices, DAG))) 2944 return Result; 2945 if ((Result = lowerVECTOR_SHUFFLE_SHF(Op, ResTy, Indices, DAG))) 2946 return Result; 2947 return lowerVECTOR_SHUFFLE_VSHF(Op, ResTy, Indices, DAG); 2948 } 2949 2951 MipsSETargetLowering::emitBPOSGE32(MachineInstr &MI, 2952 MachineBasicBlock BB) const { 2953 // $bb: 2954 // bposge32_pseudo $vr0 2955 // => 2956 // $bb: 2957 // bposge32 $tbb 2958 // $fbb: 2959 // li $vr2, 0 2960 // b $sink 2961 // $tbb: 2962 // li $vr1, 1 2963 // $sink: 2964 // $vr0 = phi($vr2, $fbb, $vr1, $tbb) 2965 2966 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 2968 const TargetRegisterClass RC = &Mips::GPR32RegClass; 2969 DebugLoc DL = MI.getDebugLoc(); 2970 const BasicBlock LLVM_BB = BB->getBasicBlock(); 2972 MachineFunction F = BB->getParent(); 2973 MachineBasicBlock FBB = F->CreateMachineBasicBlock(LLVM_BB); 2974 MachineBasicBlock TBB = F->CreateMachineBasicBlock(LLVM_BB); 2976 F->insert(It, FBB); 2977 F->insert(It, TBB); 2978 F->insert(It, Sink); 2979 2980 // Transfer the remainder of BB and its successor edges to Sink. 2981 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)), 2982 BB->end()); 2984 2985 // Add successors. 2986 BB->addSuccessor(FBB); 2987 BB->addSuccessor(TBB); 2988 FBB->addSuccessor(Sink); 2989 TBB->addSuccessor(Sink); 2990 2991 // Insert the real bposge32 instruction to $BB. 2992 BuildMI(BB, DL, TII->get(Mips::BPOSGE32)).addMBB(TBB); 2993 // Insert the real bposge32c instruction to $BB. 2994 BuildMI(BB, DL, TII->get(Mips::BPOSGE32C_MMR3)).addMBB(TBB); 2995 2996 // Fill $FBB. 2997 unsigned VR2 = RegInfo.createVirtualRegister(RC); 2998 BuildMI(FBB, FBB->end(), DL, TII->get(Mips::ADDiu), VR2) 2999 .addReg(Mips::ZERO).addImm(0); 3000 BuildMI(FBB, FBB->end(), DL, TII->get(Mips::B)).addMBB(Sink); 3001 3002 // Fill $TBB. 3003 unsigned VR1 = RegInfo.createVirtualRegister(RC); 3004 BuildMI(TBB, TBB->end(), DL, TII->get(Mips::ADDiu), VR1) 3005 .addReg(Mips::ZERO).addImm(1); 3006 3007 // Insert phi function to $Sink. 3008 BuildMI(Sink, Sink->begin(), DL, TII->get(Mips::PHI), 3009 MI.getOperand(0).getReg()) 3010 .addReg(VR2) 3011 .addMBB(FBB) 3012 .addReg(VR1) 3013 .addMBB(TBB); 3014 3015 MI.eraseFromParent(); // The pseudo instruction is gone now. 3016 return Sink; 3017 } 3018 3019 MachineBasicBlock MipsSETargetLowering::emitMSACBranchPseudo( 3020 MachineInstr &MI, MachineBasicBlock BB, unsigned BranchOp) const { 3021 // $bb: 3022 // vany_nonzero $rd, $ws 3023 // => 3024 // $bb: 3025 // bnz.b $ws, $tbb 3026 // b $fbb 3027 // $fbb: 3028 // li $rd1, 0 3029 // b $sink 3030 // $tbb: 3031 // li $rd2, 1 3032 // $sink: 3033 // $rd = phi($rd1, $fbb, $rd2, $tbb) 3034 3035 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3037 const TargetRegisterClass RC = &Mips::GPR32RegClass; 3038 DebugLoc DL = MI.getDebugLoc(); 3039 const BasicBlock LLVM_BB = BB->getBasicBlock(); 3041 MachineFunction F = BB->getParent(); 3042 MachineBasicBlock FBB = F->CreateMachineBasicBlock(LLVM_BB); 3043 MachineBasicBlock TBB = F->CreateMachineBasicBlock(LLVM_BB); 3045 F->insert(It, FBB); 3046 F->insert(It, TBB); 3047 F->insert(It, Sink); 3048 3049 // Transfer the remainder of BB and its successor edges to Sink. 3050 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)), 3051 BB->end()); 3053 3054 // Add successors. 3055 BB->addSuccessor(FBB); 3056 BB->addSuccessor(TBB); 3057 FBB->addSuccessor(Sink); 3058 TBB->addSuccessor(Sink); 3059 3060 // Insert the real bnz.b instruction to $BB. 3061 BuildMI(BB, DL, TII->get(BranchOp)) 3062 .addReg(MI.getOperand(1).getReg()) 3063 .addMBB(TBB); 3064 3065 // Fill $FBB. 3066 unsigned RD1 = RegInfo.createVirtualRegister(RC); 3067 BuildMI(FBB, FBB->end(), DL, TII->get(Mips::ADDiu), RD1) 3068 .addReg(Mips::ZERO).addImm(0); 3069 BuildMI(FBB, FBB->end(), DL, TII->get(Mips::B)).addMBB(Sink); 3070 3071 // Fill $TBB. 3072 unsigned RD2 = RegInfo.createVirtualRegister(RC); 3073 BuildMI(TBB, TBB->end(), DL, TII->get(Mips::ADDiu), RD2) 3074 .addReg(Mips::ZERO).addImm(1); 3075 3076 // Insert phi function to $Sink. 3077 BuildMI(Sink, Sink->begin(), DL, TII->get(Mips::PHI), 3078 MI.getOperand(0).getReg()) 3079 .addReg(RD1) 3080 .addMBB(FBB) 3081 .addReg(RD2) 3082 .addMBB(TBB); 3083 3084 MI.eraseFromParent(); // The pseudo instruction is gone now. 3085 return Sink; 3086 } 3087 3088 // Emit the COPY_FW pseudo instruction. 3089 // 3090 // copy_fw_pseudo $fd, $ws, n 3091 // => 3092 // copy_u_w $rt, $ws, $n 3093 // mtc1 $rt, $fd 3094 // 3095 // When n is zero, the equivalent operation can be performed with (potentially) 3096 // zero instructions due to register overlaps. This optimization is never valid 3097 // for lane 1 because it would require FR=0 mode which isn't supported by MSA. 3099 MipsSETargetLowering::emitCOPY_FW(MachineInstr &MI, 3100 MachineBasicBlock BB) const { 3102 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3103 DebugLoc DL = MI.getDebugLoc(); 3104 unsigned Fd = MI.getOperand(0).getReg(); 3105 unsigned Ws = MI.getOperand(1).getReg(); 3106 unsigned Lane = MI.getOperand(2).getImm(); 3107 3108 if (Lane == 0) { 3109 unsigned Wt = Ws; 3110 if (!Subtarget.useOddSPReg()) { 3111 // We must copy to an even-numbered MSA register so that the 3112 // single-precision sub-register is also guaranteed to be even-numbered. 3113 Wt = RegInfo.createVirtualRegister(&Mips::MSA128WEvensRegClass); 3114 3115 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Wt).addReg(Ws); 3116 } 3117 3118 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_lo); 3119 } else { 3120 unsigned Wt = RegInfo.createVirtualRegister( 3121 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass : 3122 &Mips::MSA128WEvensRegClass); 3123 3124 BuildMI(BB, MI, DL, TII->get(Mips::SPLATI_W), Wt).addReg(Ws).addImm(Lane); 3125 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_lo); 3126 } 3127 3128 MI.eraseFromParent(); // The pseudo instruction is gone now. 3129 return BB; 3130 } 3131 3132 // Emit the COPY_FD pseudo instruction. 3133 // 3134 // copy_fd_pseudo $fd, $ws, n 3135 // => 3136 // splati.d $wt, $ws, $n 3137 // copy $fd, $wt:sub_64 3138 // 3139 // When n is zero, the equivalent operation can be performed with (potentially) 3140 // zero instructions due to register overlaps. This optimization is always 3141 // valid because FR=1 mode which is the only supported mode in MSA. 3143 MipsSETargetLowering::emitCOPY_FD(MachineInstr &MI, 3144 MachineBasicBlock BB) const { 3146 3148 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3149 unsigned Fd = MI.getOperand(0).getReg(); 3150 unsigned Ws = MI.getOperand(1).getReg(); 3151 unsigned Lane = MI.getOperand(2).getImm() 2; 3152 DebugLoc DL = MI.getDebugLoc(); 3153 3154 if (Lane == 0) 3155 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Ws, 0, Mips::sub_64); 3156 else { 3157 unsigned Wt = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3158 3159 BuildMI(BB, MI, DL, TII->get(Mips::SPLATI_D), Wt).addReg(Ws).addImm(1); 3160 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_64); 3161 } 3162 3163 MI.eraseFromParent(); // The pseudo instruction is gone now. 3164 return BB; 3165 } 3166 3167 // Emit the INSERT_FW pseudo instruction. 3168 // 3169 // insert_fw_pseudo $wd, $wd_in, $n, $fs 3170 // => 3171 // subreg_to_reg $wt:sub_lo, $fs 3172 // insve_w $wd[$n], $wd_in, $wt[0] 3174 MipsSETargetLowering::emitINSERT_FW(MachineInstr &MI, 3175 MachineBasicBlock BB) const { 3177 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3178 DebugLoc DL = MI.getDebugLoc(); 3179 unsigned Wd = MI.getOperand(0).getReg(); 3180 unsigned Wd_in = MI.getOperand(1).getReg(); 3181 unsigned Lane = MI.getOperand(2).getImm(); 3182 unsigned Fs = MI.getOperand(3).getReg(); 3183 unsigned Wt = RegInfo.createVirtualRegister( 3184 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass : 3185 &Mips::MSA128WEvensRegClass); 3186 3187 BuildMI(BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3188 .addImm(0) 3189 .addReg(Fs) 3190 .addImm(Mips::sub_lo); 3191 BuildMI(BB, MI, DL, TII->get(Mips::INSVE_W), Wd) 3192 .addReg(Wd_in) 3193 .addImm(Lane) 3194 .addReg(Wt) 3195 .addImm(0); 3196 3197 MI.eraseFromParent(); // The pseudo instruction is gone now. 3198 return BB; 3199 } 3200 3201 // Emit the INSERT_FD pseudo instruction. 3202 // 3203 // insert_fd_pseudo $wd, $fs, n 3204 // => 3205 // subreg_to_reg $wt:sub_64, $fs 3206 // insve_d $wd[$n], $wd_in, $wt[0] 3208 MipsSETargetLowering::emitINSERT_FD(MachineInstr &MI, 3209 MachineBasicBlock BB) const { 3211 3213 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3214 DebugLoc DL = MI.getDebugLoc(); 3215 unsigned Wd = MI.getOperand(0).getReg(); 3216 unsigned Wd_in = MI.getOperand(1).getReg(); 3217 unsigned Lane = MI.getOperand(2).getImm(); 3218 unsigned Fs = MI.getOperand(3).getReg(); 3219 unsigned Wt = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3220 3221 BuildMI(BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3222 .addImm(0) 3223 .addReg(Fs) 3224 .addImm(Mips::sub_64); 3225 BuildMI(BB, MI, DL, TII->get(Mips::INSVE_D), Wd) 3226 .addReg(Wd_in) 3227 .addImm(Lane) 3228 .addReg(Wt) 3229 .addImm(0); 3230 3231 MI.eraseFromParent(); // The pseudo instruction is gone now. 3232 return BB; 3233 } 3234 3235 // Emit the INSERT_([BHWD]\|F[WD])_VIDX pseudo instruction. 3236 // 3237 // For integer: 3238 // (INSERT_([BHWD]\|F[WD])_PSEUDO $wd, $wd_in, $n, $rs) 3239 // => 3240 // (SLL $lanetmp1, $lane, <log2size) 3241 // (SLD_B $wdtmp1, $wd_in, $wd_in, $lanetmp1) 3242 // (INSERT_[BHWD], $wdtmp2, $wdtmp1, 0, $rs) 3243 // (NEG $lanetmp2, $lanetmp1) 3244 // (SLD_B $wd, $wdtmp2, $wdtmp2, $lanetmp2) 3245 // 3246 // For floating point: 3247 // (INSERT_([BHWD]\|F[WD])_PSEUDO $wd, $wd_in, $n, $fs) 3248 // => 3249 // (SUBREG_TO_REG $wt, $fs, <subreg>) 3250 // (SLL $lanetmp1, $lane, <log2size) 3251 // (SLD_B $wdtmp1, $wd_in, $wd_in, $lanetmp1) 3252 // (INSVE_[WD], $wdtmp2, 0, $wdtmp1, 0) 3253 // (NEG $lanetmp2, $lanetmp1) 3254 // (SLD_B $wd, $wdtmp2, $wdtmp2, $lanetmp2) 3255 MachineBasicBlock MipsSETargetLowering::emitINSERT_DF_VIDX( 3256 MachineInstr &MI, MachineBasicBlock BB, unsigned EltSizeInBytes, 3257 bool IsFP) const { 3259 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3260 DebugLoc DL = MI.getDebugLoc(); 3261 unsigned Wd = MI.getOperand(0).getReg(); 3262 unsigned SrcVecReg = MI.getOperand(1).getReg(); 3263 unsigned LaneReg = MI.getOperand(2).getReg(); 3264 unsigned SrcValReg = MI.getOperand(3).getReg(); 3265 3266 const TargetRegisterClass VecRC = nullptr; 3267 // FIXME: This should be true for N32 too. 3268 const TargetRegisterClass GPRRC = 3269 Subtarget.isABI_N64() ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3270 unsigned SubRegIdx = Subtarget.isABI_N64() ? Mips::sub_32 : 0; 3271 unsigned ShiftOp = Subtarget.isABI_N64() ? Mips::DSLL : Mips::SLL; 3272 unsigned EltLog2Size; 3273 unsigned InsertOp = 0; 3274 unsigned InsveOp = 0; 3275 switch (EltSizeInBytes) { 3276 default: 3277 llvm_unreachable("Unexpected size"); 3278 case 1: 3279 EltLog2Size = 0; 3280 InsertOp = Mips::INSERT_B; 3281 InsveOp = Mips::INSVE_B; 3282 VecRC = &Mips::MSA128BRegClass; 3283 break; 3284 case 2: 3285 EltLog2Size = 1; 3286 InsertOp = Mips::INSERT_H; 3287 InsveOp = Mips::INSVE_H; 3288 VecRC = &Mips::MSA128HRegClass; 3289 break; 3290 case 4: 3291 EltLog2Size = 2; 3292 InsertOp = Mips::INSERT_W; 3293 InsveOp = Mips::INSVE_W; 3294 VecRC = &Mips::MSA128WRegClass; 3295 break; 3296 case 8: 3297 EltLog2Size = 3; 3298 InsertOp = Mips::INSERT_D; 3299 InsveOp = Mips::INSVE_D; 3300 VecRC = &Mips::MSA128DRegClass; 3301 break; 3302 } 3303 3304 if (IsFP) { 3305 unsigned Wt = RegInfo.createVirtualRegister(VecRC); 3306 BuildMI(BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3307 .addImm(0) 3308 .addReg(SrcValReg) 3309 .addImm(EltSizeInBytes == 8 ? Mips::sub_64 : Mips::sub_lo); 3310 SrcValReg = Wt; 3311 } 3312 3313 // Convert the lane index into a byte index 3314 if (EltSizeInBytes != 1) { 3315 unsigned LaneTmp1 = RegInfo.createVirtualRegister(GPRRC); 3316 BuildMI(BB, MI, DL, TII->get(ShiftOp), LaneTmp1) 3317 .addReg(LaneReg) 3318 .addImm(EltLog2Size); 3319 LaneReg = LaneTmp1; 3320 } 3321 3322 // Rotate bytes around so that the desired lane is element zero 3323 unsigned WdTmp1 = RegInfo.createVirtualRegister(VecRC); 3324 BuildMI(BB, MI, DL, TII->get(Mips::SLD_B), WdTmp1) 3325 .addReg(SrcVecReg) 3326 .addReg(SrcVecReg) 3327 .addReg(LaneReg, 0, SubRegIdx); 3328 3329 unsigned WdTmp2 = RegInfo.createVirtualRegister(VecRC); 3330 if (IsFP) { 3331 // Use insve.df to insert to element zero 3332 BuildMI(BB, MI, DL, TII->get(InsveOp), WdTmp2) 3333 .addReg(WdTmp1) 3334 .addImm(0) 3335 .addReg(SrcValReg) 3336 .addImm(0); 3337 } else { 3338 // Use insert.df to insert to element zero 3339 BuildMI(BB, MI, DL, TII->get(InsertOp), WdTmp2) 3340 .addReg(WdTmp1) 3341 .addReg(SrcValReg) 3342 .addImm(0); 3343 } 3344 3345 // Rotate elements the rest of the way for a full rotation. 3346 // sld.df inteprets $rt modulo the number of columns so we only need to negate 3347 // the lane index to do this. 3348 unsigned LaneTmp2 = RegInfo.createVirtualRegister(GPRRC); 3349 BuildMI(BB, MI, DL, TII->get(Subtarget.isABI_N64() ? Mips::DSUB : Mips::SUB), 3350 LaneTmp2) 3351 .addReg(Subtarget.isABI_N64() ? Mips::ZERO_64 : Mips::ZERO) 3352 .addReg(LaneReg); 3353 BuildMI(BB, MI, DL, TII->get(Mips::SLD_B), Wd) 3354 .addReg(WdTmp2) 3355 .addReg(WdTmp2) 3356 .addReg(LaneTmp2, 0, SubRegIdx); 3357 3358 MI.eraseFromParent(); // The pseudo instruction is gone now. 3359 return BB; 3360 } 3361 3362 // Emit the FILL_FW pseudo instruction. 3363 // 3364 // fill_fw_pseudo $wd, $fs 3365 // => 3366 // implicit_def $wt1 3367 // insert_subreg $wt2:subreg_lo, $wt1, $fs 3368 // splati.w $wd, $wt2[0] 3370 MipsSETargetLowering::emitFILL_FW(MachineInstr &MI, 3371 MachineBasicBlock BB) const { 3373 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3374 DebugLoc DL = MI.getDebugLoc(); 3375 unsigned Wd = MI.getOperand(0).getReg(); 3376 unsigned Fs = MI.getOperand(1).getReg(); 3377 unsigned Wt1 = RegInfo.createVirtualRegister( 3378 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass 3379 : &Mips::MSA128WEvensRegClass); 3380 unsigned Wt2 = RegInfo.createVirtualRegister( 3381 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass 3382 : &Mips::MSA128WEvensRegClass); 3383 3384 BuildMI(BB, MI, DL, TII->get(Mips::IMPLICIT_DEF), Wt1); 3385 BuildMI(BB, MI, DL, TII->get(Mips::INSERT_SUBREG), Wt2) 3386 .addReg(Wt1) 3387 .addReg(Fs) 3388 .addImm(Mips::sub_lo); 3389 BuildMI(BB, MI, DL, TII->get(Mips::SPLATI_W), Wd).addReg(Wt2).addImm(0); 3390 3391 MI.eraseFromParent(); // The pseudo instruction is gone now. 3392 return BB; 3393 } 3394 3395 // Emit the FILL_FD pseudo instruction. 3396 // 3397 // fill_fd_pseudo $wd, $fs 3398 // => 3399 // implicit_def $wt1 3400 // insert_subreg $wt2:subreg_64, $wt1, $fs 3401 // splati.d $wd, $wt2[0] 3403 MipsSETargetLowering::emitFILL_FD(MachineInstr &MI, 3404 MachineBasicBlock BB) const { 3406 3408 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3409 DebugLoc DL = MI.getDebugLoc(); 3410 unsigned Wd = MI.getOperand(0).getReg(); 3411 unsigned Fs = MI.getOperand(1).getReg(); 3412 unsigned Wt1 = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3413 unsigned Wt2 = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3414 3415 BuildMI(BB, MI, DL, TII->get(Mips::IMPLICIT_DEF), Wt1); 3416 BuildMI(BB, MI, DL, TII->get(Mips::INSERT_SUBREG), Wt2) 3417 .addReg(Wt1) 3418 .addReg(Fs) 3419 .addImm(Mips::sub_64); 3420 BuildMI(BB, MI, DL, TII->get(Mips::SPLATI_D), Wd).addReg(Wt2).addImm(0); 3421 3422 MI.eraseFromParent(); // The pseudo instruction is gone now. 3423 return BB; 3424 } 3425 3426 // Emit the ST_F16_PSEDUO instruction to store a f16 value from an MSA 3427 // register. 3428 // 3429 // STF16 MSA128F16:$wd, mem_simm10:$addr 3430 // => 3431 // copy_u.h $rtemp,$wd[0] 3432 // sh $rtemp, $addr 3433 // 3434 // Safety: We can't use st.h & co as they would over write the memory after 3435 // the destination. It would require half floats be allocated 16 bytes(!) of 3436 // space. 3438 MipsSETargetLowering::emitST_F16_PSEUDO(MachineInstr &MI, 3439 MachineBasicBlock BB) const { 3440 3442 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3443 DebugLoc DL = MI.getDebugLoc(); 3444 unsigned Ws = MI.getOperand(0).getReg(); 3445 unsigned Rt = MI.getOperand(1).getReg(); 3446 const MachineMemOperand &MMO = MI.memoperands_begin(); 3447 unsigned Imm = MMO.getOffset(); 3448 3449 // Caution: A load via the GOT can expand to a GPR32 operand, a load via 3450 // spill and reload can expand as a GPR64 operand. Examine the 3451 // operand in detail and default to ABI. 3452 const TargetRegisterClass RC = 3453 MI.getOperand(1).isReg() ? RegInfo.getRegClass(MI.getOperand(1).getReg()) 3454 : (Subtarget.isABI_O32() ? &Mips::GPR32RegClass 3455 : &Mips::GPR64RegClass); 3456 const bool UsingMips32 = RC == &Mips::GPR32RegClass; 3457 unsigned Rs = RegInfo.createVirtualRegister(&Mips::GPR32RegClass); 3458 3459 BuildMI(BB, MI, DL, TII->get(Mips::COPY_U_H), Rs).addReg(Ws).addImm(0); 3460 if(!UsingMips32) { 3461 unsigned Tmp = RegInfo.createVirtualRegister(&Mips::GPR64RegClass); 3462 BuildMI(BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Tmp) 3463 .addImm(0) 3464 .addReg(Rs) 3465 .addImm(Mips::sub_32); 3466 Rs = Tmp; 3467 } 3468 BuildMI(BB, MI, DL, TII->get(UsingMips32 ? Mips::SH : Mips::SH64)) 3469 .addReg(Rs) 3470 .addReg(Rt) 3471 .addImm(Imm) 3473 &MMO, MMO.getOffset(), MMO.getSize())); 3474 3475 MI.eraseFromParent(); 3476 return BB; 3477 } 3478 3479 // Emit the LD_F16_PSEDUO instruction to load a f16 value into an MSA register. 3480 // 3481 // LD_F16 MSA128F16:$wd, mem_simm10:$addr 3482 // => 3483 // lh $rtemp, $addr 3484 // fill.h $wd, $rtemp 3485 // 3486 // Safety: We can't use ld.h & co as they over-read from the source. 3487 // Additionally, if the address is not modulo 16, 2 cases can occur: 3488 // a) Segmentation fault as the load instruction reads from a memory page 3489 // memory it's not supposed to. 3490 // b) The load crosses an implementation specific boundary, requiring OS 3491 // intervention. 3493 MipsSETargetLowering::emitLD_F16_PSEUDO(MachineInstr &MI, 3494 MachineBasicBlock BB) const { 3495 3497 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3498 DebugLoc DL = MI.getDebugLoc(); 3499 unsigned Wd = MI.getOperand(0).getReg(); 3500 3501 // Caution: A load via the GOT can expand to a GPR32 operand, a load via 3502 // spill and reload can expand as a GPR64 operand. Examine the 3503 // operand in detail and default to ABI. 3504 const TargetRegisterClass RC = 3505 MI.getOperand(1).isReg() ? RegInfo.getRegClass(MI.getOperand(1).getReg()) 3506 : (Subtarget.isABI_O32() ? &Mips::GPR32RegClass 3507 : &Mips::GPR64RegClass); 3508 3509 const bool UsingMips32 = RC == &Mips::GPR32RegClass; 3510 unsigned Rt = RegInfo.createVirtualRegister(RC); 3511 3512 MachineInstrBuilder MIB = 3513 BuildMI(BB, MI, DL, TII->get(UsingMips32 ? Mips::LH : Mips::LH64), Rt); 3514 for (unsigned i = 1; i < MI.getNumOperands(); i++) 3515 MIB.add(MI.getOperand(i)); 3516 3517 if(!UsingMips32) { 3518 unsigned Tmp = RegInfo.createVirtualRegister(&Mips::GPR32RegClass); 3519 BuildMI(BB, MI, DL, TII->get(Mips::COPY), Tmp).addReg(Rt, 0, Mips::sub_32); 3520 Rt = Tmp; 3521 } 3522 3523 BuildMI(BB, MI, DL, TII->get(Mips::FILL_H), Wd).addReg(Rt); 3524 3525 MI.eraseFromParent(); 3526 return BB; 3527 } 3528 3529 // Emit the FPROUND_PSEUDO instruction. 3530 // 3531 // Round an FGR64Opnd, FGR32Opnd to an f16. 3532 // 3533 // Safety: Cycle the operand through the GPRs so the result always ends up 3534 // the correct MSA register. 3535 // 3536 // FIXME: This copying is strictly unnecessary. If we could tie FGR32Opnd:$Fs 3537 // / FGR64Opnd:$Fs and MSA128F16:$Wd to the same physical register 3538 // (which they can be, as the MSA registers are defined to alias the 3539 // FPU's 64 bit and 32 bit registers) the result can be accessed using 3540 // the correct register class. That requires operands be tie-able across 3541 // register classes which have a sub/super register class relationship. 3542 // 3543 // For FPG32Opnd: 3544 // 3545 // FPROUND MSA128F16:$wd, FGR32Opnd:$fs 3546 // => 3547 // mfc1 $rtemp, $fs 3548 // fill.w $rtemp, $wtemp 3549 // fexdo.w $wd, $wtemp, $wtemp 3550 // 3551 // For FPG64Opnd on mips32r2+: 3552 // 3553 // FPROUND MSA128F16:$wd, FGR64Opnd:$fs 3554 // => 3555 // mfc1 $rtemp, $fs 3556 // fill.w $rtemp, $wtemp 3557 // mfhc1 $rtemp2, $fs 3558 // insert.w $wtemp[1], $rtemp2 3559 // insert.w $wtemp[3], $rtemp2 3560 // fexdo.w $wtemp2, $wtemp, $wtemp 3561 // fexdo.h $wd, $temp2, $temp2 3562 // 3563 // For FGR64Opnd on mips64r2+: 3564 // 3565 // FPROUND MSA128F16:$wd, FGR64Opnd:$fs 3566 // => 3567 // dmfc1 $rtemp, $fs 3568 // fill.d $rtemp, $wtemp 3569 // fexdo.w $wtemp2, $wtemp, $wtemp 3570 // fexdo.h $wd, $wtemp2, $wtemp2 3571 // 3572 // Safety note: As $wtemp is UNDEF, we may provoke a spurious exception if the 3573 // undef bits are "just right" and the exception enable bits are 3574 // set. By using fill.w to replicate $fs into all elements over 3575 // insert.w for one element, we avoid that potiential case. If 3576 // fexdo.[hw] causes an exception in, the exception is valid and it 3577 // occurs for all elements. 3579 MipsSETargetLowering::emitFPROUND_PSEUDO(MachineInstr &MI, 3580 MachineBasicBlock BB, 3581 bool IsFGR64) const { 3582 3583 // Strictly speaking, we need MIPS32R5 to support MSA. We'll be generous 3584 // here. It's technically doable to support MIPS32 here, but the ISA forbids 3585 // it. 3587 3588 bool IsFGR64onMips64 = Subtarget.hasMips64() && IsFGR64; 3589 bool IsFGR64onMips32 = !Subtarget.hasMips64() && IsFGR64; 3590 3592 DebugLoc DL = MI.getDebugLoc(); 3593 unsigned Wd = MI.getOperand(0).getReg(); 3594 unsigned Fs = MI.getOperand(1).getReg(); 3595 3596 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3597 unsigned Wtemp = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3598 const TargetRegisterClass GPRRC = 3599 IsFGR64onMips64 ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3600 unsigned MFC1Opc = IsFGR64onMips64 3601 ? Mips::DMFC1 3602 : (IsFGR64onMips32 ? Mips::MFC1_D64 : Mips::MFC1); 3603 unsigned FILLOpc = IsFGR64onMips64 ? Mips::FILL_D : Mips::FILL_W; 3604 3605 // Perform the register class copy as mentioned above. 3606 unsigned Rtemp = RegInfo.createVirtualRegister(GPRRC); 3607 BuildMI(BB, MI, DL, TII->get(MFC1Opc), Rtemp).addReg(Fs); 3608 BuildMI(BB, MI, DL, TII->get(FILLOpc), Wtemp).addReg(Rtemp); 3609 unsigned WPHI = Wtemp; 3610 3611 if (IsFGR64onMips32) { 3612 unsigned Rtemp2 = RegInfo.createVirtualRegister(GPRRC); 3613 BuildMI(BB, MI, DL, TII->get(Mips::MFHC1_D64), Rtemp2).addReg(Fs); 3614 unsigned Wtemp2 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3615 unsigned Wtemp3 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3616 BuildMI(BB, MI, DL, TII->get(Mips::INSERT_W), Wtemp2) 3617 .addReg(Wtemp) 3618 .addReg(Rtemp2) 3619 .addImm(1); 3620 BuildMI(BB, MI, DL, TII->get(Mips::INSERT_W), Wtemp3) 3621 .addReg(Wtemp2) 3622 .addReg(Rtemp2) 3623 .addImm(3); 3624 WPHI = Wtemp3; 3625 } 3626 3627 if (IsFGR64) { 3628 unsigned Wtemp2 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3629 BuildMI(BB, MI, DL, TII->get(Mips::FEXDO_W), Wtemp2) 3630 .addReg(WPHI) 3631 .addReg(WPHI); 3632 WPHI = Wtemp2; 3633 } 3634 3635 BuildMI(BB, MI, DL, TII->get(Mips::FEXDO_H), Wd).addReg(WPHI).addReg(WPHI); 3636 3637 MI.eraseFromParent(); 3638 return BB; 3639 } 3640 3641 // Emit the FPEXTEND_PSEUDO instruction. 3642 // 3643 // Expand an f16 to either a FGR32Opnd or FGR64Opnd. 3644 // 3645 // Safety: Cycle the result through the GPRs so the result always ends up 3646 // the correct floating point register. 3647 // 3648 // FIXME: This copying is strictly unnecessary. If we could tie FGR32Opnd:$Fd 3649 // / FGR64Opnd:$Fd and MSA128F16:$Ws to the same physical register 3650 // (which they can be, as the MSA registers are defined to alias the 3651 // FPU's 64 bit and 32 bit registers) the result can be accessed using 3652 // the correct register class. That requires operands be tie-able across 3653 // register classes which have a sub/super register class relationship. I 3654 // haven't checked. 3655 // 3656 // For FGR32Opnd: 3657 // 3658 // FPEXTEND FGR32Opnd:$fd, MSA128F16:$ws 3659 // => 3660 // fexupr.w $wtemp, $ws 3661 // copy_s.w $rtemp, $ws[0] 3662 // mtc1 $rtemp, $fd 3663 // 3664 // For FGR64Opnd on Mips64: 3665 // 3666 // FPEXTEND FGR64Opnd:$fd, MSA128F16:$ws 3667 // => 3668 // fexupr.w $wtemp, $ws 3669 // fexupr.d $wtemp2, $wtemp 3670 // copy_s.d $rtemp, $wtemp2s[0] 3671 // dmtc1 $rtemp, $fd 3672 // 3673 // For FGR64Opnd on Mips32: 3674 // 3675 // FPEXTEND FGR64Opnd:$fd, MSA128F16:$ws 3676 // => 3677 // fexupr.w $wtemp, $ws 3678 // fexupr.d $wtemp2, $wtemp 3679 // copy_s.w $rtemp, $wtemp2[0] 3680 // mtc1 $rtemp, $ftemp 3681 // copy_s.w $rtemp2, $wtemp2[1] 3682 // $fd = mthc1 $rtemp2, $ftemp 3684 MipsSETargetLowering::emitFPEXTEND_PSEUDO(MachineInstr &MI, 3685 MachineBasicBlock BB, 3686 bool IsFGR64) const { 3687 3688 // Strictly speaking, we need MIPS32R5 to support MSA. We'll be generous 3689 // here. It's technically doable to support MIPS32 here, but the ISA forbids 3690 // it. 3692 3693 bool IsFGR64onMips64 = Subtarget.hasMips64() && IsFGR64; 3694 bool IsFGR64onMips32 = !Subtarget.hasMips64() && IsFGR64; 3695 3697 DebugLoc DL = MI.getDebugLoc(); 3698 unsigned Fd = MI.getOperand(0).getReg(); 3699 unsigned Ws = MI.getOperand(1).getReg(); 3700 3701 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3702 const TargetRegisterClass GPRRC = 3703 IsFGR64onMips64 ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3704 unsigned MTC1Opc = IsFGR64onMips64 3705 ? Mips::DMTC1 3706 : (IsFGR64onMips32 ? Mips::MTC1_D64 : Mips::MTC1); 3707 unsigned COPYOpc = IsFGR64onMips64 ? Mips::COPY_S_D : Mips::COPY_S_W; 3708 3709 unsigned Wtemp = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3710 unsigned WPHI = Wtemp; 3711 3712 BuildMI(BB, MI, DL, TII->get(Mips::FEXUPR_W), Wtemp).addReg(Ws); 3713 if (IsFGR64) { 3714 WPHI = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3715 BuildMI(BB, MI, DL, TII->get(Mips::FEXUPR_D), WPHI).addReg(Wtemp); 3716 } 3717 3718 // Perform the safety regclass copy mentioned above. 3719 unsigned Rtemp = RegInfo.createVirtualRegister(GPRRC); 3720 unsigned FPRPHI = IsFGR64onMips32 3721 ? RegInfo.createVirtualRegister(&Mips::FGR64RegClass) 3722 : Fd; 3723 BuildMI(BB, MI, DL, TII->get(COPYOpc), Rtemp).addReg(WPHI).addImm(0); 3724 BuildMI(BB, MI, DL, TII->get(MTC1Opc), FPRPHI).addReg(Rtemp); 3725 3726 if (IsFGR64onMips32) { 3727 unsigned Rtemp2 = RegInfo.createVirtualRegister(GPRRC); 3728 BuildMI(BB, MI, DL, TII->get(Mips::COPY_S_W), Rtemp2) 3729 .addReg(WPHI) 3730 .addImm(1); 3731 BuildMI(BB, MI, DL, TII->get(Mips::MTHC1_D64), Fd) 3732 .addReg(FPRPHI) 3733 .addReg(Rtemp2); 3734 } 3735 3736 MI.eraseFromParent(); 3737 return BB; 3738 } 3739 3740 // Emit the FEXP2_W_1 pseudo instructions. 3741 // 3742 // fexp2_w_1_pseudo $wd, $wt 3743 // => 3744 // ldi.w $ws, 1 3745 // fexp2.w $wd, $ws, $wt 3747 MipsSETargetLowering::emitFEXP2_W_1(MachineInstr &MI, 3748 MachineBasicBlock BB) const { 3750 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3751 const TargetRegisterClass RC = &Mips::MSA128WRegClass; 3752 unsigned Ws1 = RegInfo.createVirtualRegister(RC); 3753 unsigned Ws2 = RegInfo.createVirtualRegister(RC); 3754 DebugLoc DL = MI.getDebugLoc(); 3755 3756 // Splat 1.0 into a vector 3757 BuildMI(BB, MI, DL, TII->get(Mips::LDI_W), Ws1).addImm(1); 3758 BuildMI(BB, MI, DL, TII->get(Mips::FFINT_U_W), Ws2).addReg(Ws1); 3759 3760 // Emit 1.0 fexp2(Wt) 3761 BuildMI(BB, MI, DL, TII->get(Mips::FEXP2_W), MI.getOperand(0).getReg()) 3762 .addReg(Ws2) 3763 .addReg(MI.getOperand(1).getReg()); 3764 3765 MI.eraseFromParent(); // The pseudo instruction is gone now. 3766 return BB; 3767 } 3768 3769 // Emit the FEXP2_D_1 pseudo instructions. 3770 // 3771 // fexp2_d_1_pseudo $wd, $wt 3772 // => 3773 // ldi.d $ws, 1 3774 // fexp2.d $wd, $ws, $wt 3776 MipsSETargetLowering::emitFEXP2_D_1(MachineInstr &MI, 3777 MachineBasicBlock BB) const { 3779 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3780 const TargetRegisterClass RC = &Mips::MSA128DRegClass; 3781 unsigned Ws1 = RegInfo.createVirtualRegister(RC); 3782 unsigned Ws2 = RegInfo.createVirtualRegister(RC); 3783 DebugLoc DL = MI.getDebugLoc(); 3784 3785 // Splat 1.0 into a vector 3786 BuildMI(BB, MI, DL, TII->get(Mips::LDI_D), Ws1).addImm(1); 3787 BuildMI(BB, MI, DL, TII->get(Mips::FFINT_U_D), Ws2).addReg(Ws1); 3788 3789 // Emit 1.0 fexp2(Wt) 3790 BuildMI(BB, MI, DL, TII->get(Mips::FEXP2_D), MI.getOperand(0).getReg()) 3791 .addReg(Ws2) 3792 .addReg(MI.getOperand(1).getReg()); 3793 3794 MI.eraseFromParent(); // The pseudo instruction is gone now. 3795 return BB; 3796 } SDValue getStore(SDValue Chain, const SDLoc &dl, SDValue Val, SDValue Ptr, MachinePointerInfo PtrInfo, unsigned Alignment=0, MachineMemOperand::Flags MMOFlags=MachineMemOperand::MONone, const AAMDNodes &AAInfo=AAMDNodes()) Helper function to build ISD::STORE nodes. const MipsTargetLowering createMipsSETargetLowering(const MipsTargetMachine &TM, const MipsSubtarget &STI) Fast - This calling convention attempts to make calls as fast as possible (e.g. Definition: CallingConv.h:43 uint64_t CallInst * C BITCAST - This operator converts between integer, vector and FP values, as if the value was stored to... Definition: ISDOpcodes.h:545 static SDValue genConstMult(SDValue X, APInt C, const SDLoc &DL, EVT VT, EVT ShiftTy, SelectionDAG &DAG) const MachineInstrBuilder & add(const MachineOperand &MO) const BUILTIN_OP_END - This must be the last enum value in this list. Definition: ISDOpcodes.h:834 FMINNUM/FMAXNUM - Perform floating-point minimum or maximum on two values. Definition: ISDOpcodes.h:569 EVT getValueType() const Return the ValueType of the referenced return value. static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector") void setLoadExtAction(unsigned ExtType, MVT ValVT, MVT MemVT, LegalizeAction Action) Indicate that the specified load with extension does not work with the specified type and indicate wh... EXTRACT_ELEMENT - This is used to get the lower or upper (determined by a Constant, which is required to be operand #1) half of the integer or float value specified as operand #0. Definition: ISDOpcodes.h:184 uint64_t getZExtValue() const Get zero extended value. Definition: APInt.h:1542 unsigned getOpcode() const Return the SelectionDAG opcode value for this node. SDValue getSetCC(const SDLoc &DL, EVT VT, SDValue LHS, SDValue RHS, ISD::CondCode Cond) Helper function to make it easier to build SetCC's if you just have an ISD::CondCode instead of an SD... Definition: SelectionDAG.h:898 typename SuperClass::const_iterator const_iterator Definition: SmallVector.h:329 const TargetRegisterClass * getRegClass(unsigned Reg) const Return the register class of the specified virtual register. const MipsSubtarget & Subtarget bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef, unsigned &SplatBitSize, bool &HasAnyUndefs, unsigned MinSplatBits=0, bool isBigEndian=false) const Check if this is a constant splat, and if so, find the smallest element size that splats the vector... LLVM_ATTRIBUTE_NORETURN void report_fatal_error(Error Err, bool gen_crash_diag=true) Report a serious error, calling any installed error handler. Definition: Error.cpp:115 BR_CC - Conditional branch. Definition: ISDOpcodes.h:617 Compute iterated dominance frontiers using a linear time algorithm. Definition: AllocatorList.h:24 value_iterator value_end() const static SDValue initAccumulator(SDValue In, const SDLoc &DL, SelectionDAG &DAG) bool allowsMisalignedMemoryAccesses(EVT VT, unsigned AS=0, unsigned Align=1, bool Fast=nullptr) const override Determine if the target supports unaligned memory accesses. static SDValue performVSELECTCombine(SDNode N, SelectionDAG &DAG) VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as VEC1/VEC2. Definition: ISDOpcodes.h:342 EVT getScalarType() const If this is a vector type, return the element type, otherwise return this. Definition: ValueTypes.h:260 virtual const TargetRegisterClass * getRepRegClassFor(MVT VT) const Return the 'representative' register class for the specified value type. LLVM_ATTRIBUTE_ALWAYS_INLINE size_type size() const Definition: SmallVector.h:136 MachineBasicBlock * EmitInstrWithCustomInserter(MachineInstr &MI, MachineBasicBlock MBB) const override This method should be implemented by targets that mark instructions with the 'usesCustomInserter' fla... unsigned createVirtualRegister(const TargetRegisterClass RegClass) createVirtualRegister - Create and return a new virtual register in the function with the specified r... const SDValue & getBasePtr() const EVT getValueType(unsigned ResNo) const Return the type of a specified result. const DebugLoc & getDebugLoc() const Returns the debug location id of this MachineInstr. Definition: MachineInstr.h:268 static SDValue performANDCombine(SDNode N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) unsigned getReg() const getReg - Returns the register number. const SDValue & getValue() const void transferSuccessorsAndUpdatePHIs(MachineBasicBlock FromMBB) Transfers all the successors, as in transferSuccessors, and update PHI operands in the successor bloc... SDVTList getVTList() const static APInt getLowBitsSet(unsigned numBits, unsigned loBitsSet) Get a value with low bits set. Definition: APInt.h:641 MVT getSimpleVT() const Return the SimpleValueType held in the specified simple EVT. Definition: ValueTypes.h:253 const MipsInstrInfo * getInstrInfo() const override AAMDNodes getAAInfo() const Returns the AA info that describes the dereference. const SDValue & getChain() const uint64_t getSize() const Return the size in bytes of the memory reference. bool isABI_O32() const unsigned getAlignment() const APInt trunc(unsigned width) const Truncate to new width. Definition: APInt.cpp:818 A debug info location. Definition: DebugLoc.h:34 bool isInteger() const Return true if this is an integer or a vector integer type. Definition: ValueTypes.h:141 F(f) MachineBasicBlock * EmitInstrWithCustomInserter(MachineInstr &MI, MachineBasicBlock MBB) const override This method should be implemented by targets that mark instructions with the 'usesCustomInserter' fla... SDNode getNode() const get the SDNode which holds the desired result SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, ArrayRef< SDUse > Ops) Gets or creates the specified node. SDValue PerformDAGCombine(SDNode N, DAGCombinerInfo &DCI) const override This method will be invoked for all target nodes and for any target-independent nodes that the target... MachineMemOperand getMemOperand() const Return a MachineMemOperand object describing the memory reference performed by operation. OUTCHAIN = ATOMIC_FENCE(INCHAIN, ordering, scope) This corresponds to the fence instruction. Definition: ISDOpcodes.h:748 Select with condition operator - This selects between a true value and a false value (ops #2 and #3) ... Definition: ISDOpcodes.h:404 unsigned getBitWidth() const Return the number of bits in the APInt. Definition: APInt.h:1488 This SDNode is used to implement the code generator support for the llvm IR shufflevector instruction... void setTruncStoreAction(MVT ValVT, MVT MemVT, LegalizeAction Action) Indicate that the specified truncating store does not work with the specified type and indicate what ... void printrWithDepth(raw_ostream &O, const SelectionDAG G=nullptr, unsigned depth=100) const Print a SelectionDAG node and children up to depth "depth." The given SelectionDAG allows target-spec... RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...) This node represents a target in... Definition: ISDOpcodes.h:159 const Triple & getTargetTriple() const getTargetTriple - Return the target triple string. SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override LowerOperation - Provide custom lowering hooks for some operations. bool hasMips64() const SDIVREM/UDIVREM - Divide two integers and produce both a quotient and remainder result. Definition: ISDOpcodes.h:209 bool hasDSPR2() const static SDValue lowerMSAStoreIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, const MipsSubtarget &Subtarget) A description of a memory reference used in the backend. const HexagonInstrInfo TII ArrayRef< T > makeArrayRef(const T &OneElt) Construct an ArrayRef from a single element. Definition: ArrayRef.h:451 Shift and rotation operations. Definition: ISDOpcodes.h:379 unsigned getNumOperands() const Access to explicit operands of the instruction. Definition: MachineInstr.h:293 BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Definition: ISDOpcodes.h:190 This class consists of common code factored out of the SmallVector class to reduce code duplication b... Definition: APFloat.h:42 void eraseFromParent() Unlink 'this' from the containing basic block and delete it. unsigned getScalarValueSizeInBits() const bool isGP64bit() const void setCondCodeAction(ISD::CondCode CC, MVT VT, LegalizeAction Action) Indicate that the specified condition code is or isn't supported on the target and indicate what to d... SimpleValueType SimpleTy static SDValue lowerMSABitClearImm(SDValue Op, SelectionDAG &DAG) bool hasMips32r6() const static bool isConstantOrUndefBUILD_VECTOR(const BuildVectorSDNode Op) unsigned getOpcode() const Returns the opcode of this MachineInstr. Definition: MachineInstr.h:290 void setOperationAction(unsigned Op, MVT VT, LegalizeAction Action) Indicate that the specified operation does not work with the specified type and indicate what to do a... const DataLayout & getDataLayout() const Definition: SelectionDAG.h:388 MachineMemOperand getMachineMemOperand(MachinePointerInfo PtrInfo, MachineMemOperand::Flags f, uint64_t s, unsigned base_alignment, const AAMDNodes &AAInfo=AAMDNodes(), const MDNode Ranges=nullptr, SyncScope::ID SSID=SyncScope::System, AtomicOrdering Ordering=AtomicOrdering::NotAtomic, AtomicOrdering FailureOrdering=AtomicOrdering::NotAtomic) getMachineMemOperand - Allocate a new MachineMemOperand. This file implements a class to represent arbitrary precision integral constant values and operations... static SDValue lowerVECTOR_SHUFFLE_VSHF(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) SDValue getMergeValues(ArrayRef< SDValue > Ops, const SDLoc &dl) Create a MERGE_VALUES node from the given operands. unsigned getScalarSizeInBits() const Definition: ValueTypes.h:298 unsigned getSizeInBits() const Return the size of the specified value type in bits. Definition: ValueTypes.h:292 static bool isVSplat(SDValue N, APInt &Imm, bool IsLittleEndian) [SU]INT_TO_FP - These operators convert integers (whose interpreted sign depends on the first letter)... Definition: ISDOpcodes.h:455 void computeRegisterProperties(const TargetRegisterInfo TRI) Once all of the register classes are added, this allows us to compute derived properties we expose... Select with a vector condition (op #0) and two vector operands (ops #1 and #2), returning a vector re... Definition: ISDOpcodes.h:398 static bool isVECTOR_SHUFFLE_SPLATI(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) Simple integer binary arithmetic operators. Definition: ISDOpcodes.h:200 static bool isConstantOrUndef(const SDValue Op) unsigned getIncomingArgSize() const SDValue getUNDEF(EVT VT) Return an UNDEF node. UNDEF does not have a useful SDLoc. Definition: SelectionDAG.h:830 CondCode ISD::CondCode enum - These are ordered carefully to make the bitfields below work out... Definition: ISDOpcodes.h:916 TargetConstant* - Like Constant, but the DAG does not do any folding, simplification, or lowering of the constant. Definition: ISDOpcodes.h:125 SDValue getTargetConstant(uint64_t Val, const SDLoc &DL, EVT VT, bool isOpaque=false) Definition: SelectionDAG.h:558 static SDValue lowerVECTOR_SHUFFLE_ILVR(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) amdgpu Simplify well known AMD library false Value Callee RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...) This node represents a target intrinsic fun... Definition: ISDOpcodes.h:151 MachineBasicBlock * CreateMachineBasicBlock(const BasicBlock bb=nullptr) CreateMachineBasicBlock - Allocate a new MachineBasicBlock. This class is used to represent ISD::STORE nodes. FP_TO_[US]INT - Convert a floating point value to a signed or unsigned integer. Definition: ISDOpcodes.h:498 BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the specified, possibly variable... Definition: ISDOpcodes.h:302 TargetInstrInfo - Interface to description of machine instruction set. static APInt getHighBitsSet(unsigned numBits, unsigned hiBitsSet) Get a value with high bits set. Definition: APInt.h:629 static SDValue performORCombine(SDNode N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) static SDValue lowerMSASplatImm(SDValue Op, unsigned ImmOp, SelectionDAG &DAG, bool IsSigned=false) virtual void getOpndList(SmallVectorImpl< SDValue > &Ops, std::deque< std::pair< unsigned, SDValue >> &RegsToPass, bool IsPICCall, bool GlobalOrExternal, bool InternalLinkage, bool IsCallReloc, CallLoweringInfo &CLI, SDValue Callee, SDValue Chain) const This function fills Ops, which is the list of operands that will later be used when a function call n... MachineInstrBuilder BuildMI(MachineFunction &MF, const DebugLoc &DL, const MCInstrDesc &MCID) Builder interface. Specify how to create the initial instruction itself. static MDTuple * get(LLVMContext &Context, ArrayRef< Metadata > MDs) Definition: Metadata.h:1164 bool isNegative() const Determine sign of this APInt. Definition: APInt.h:357 const SDValue & getBasePtr() const initializer< Ty > init(const Ty &Val) Definition: CommandLine.h:406 OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...) This node represents a target intrin... Definition: ISDOpcodes.h:166 bool isAllOnesValue() const Determine if all bits are set. Definition: APInt.h:389 static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC") static SDValue lowerVECTOR_SHUFFLE_ILVEV(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) MVT getPointerTy(const DataLayout &DL, uint32_t AS=0) const Return the pointer type for the given address space, defaults to the pointer type from the data layou... static SDValue lowerDSPIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) Machine Value Type. bool isLittleEndian() const Tests whether the target triple is little endian. Definition: Triple.cpp:1470 LLVM Basic Block Representation. Definition: BasicBlock.h:59 static SDValue lowerMSALoadIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, const MipsSubtarget &Subtarget) static SDValue getBuildVectorSplat(EVT VecTy, SDValue SplatValue, bool BigEndian, SelectionDAG &DAG) void addRegisterClass(MVT VT, const TargetRegisterClass RC) Add the specified register class as an available regclass for the specified value type... Simple binary floating point operators. Definition: ISDOpcodes.h:259 void setTargetDAGCombine(ISD::NodeType NT) Targets should invoke this method for each target independent node that they want to provide a custom... static bool isLegalDSPCondCode(EVT Ty, ISD::CondCode CC) unsigned getVectorNumElements() const Given a vector type, return the number of elements it contains. Definition: ValueTypes.h:273 static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC") LLVM_ATTRIBUTE_ALWAYS_INLINE iterator begin() Definition: SmallVector.h:116 const SDValue & getOperand(unsigned Num) const INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element at IDX replaced with VAL... Definition: ISDOpcodes.h:307 static bool isVectorAllOnes(SDValue N) static SDValue lowerVECTOR_SHUFFLE_PCKEV(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static const unsigned End const APInt & getAPIntValue() const static SDValue performSRACombine(SDNode N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) static mvt_range vector_valuetypes() X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type. Definition: ISDOpcodes.h:530 SDValue lowerLOAD(SDValue Op, SelectionDAG &DAG) const Extended Value Type. Definition: ValueTypes.h:34 static bool fitsRegularPattern(typename SmallVectorImpl< ValType >::const_iterator Begin, unsigned CheckStride, typename SmallVectorImpl< ValType >::const_iterator End, ValType ExpectedIndex, unsigned ExpectedIndexStride) Determine whether a range fits a regular pattern of values. bool isSingleFloat() const unsigned ceilLogBase2() const Definition: APInt.h:1730 This structure contains all information that is necessary for lowering calls. bool hasMips64r6() const This class contains a discriminated union of information about pointers in memory operands... unsigned getNumOperands() const Return the number of values used by this operation. #define llvm_unreachable(msg) Marks that the current location is not supposed to be reachable. APInt lshr(unsigned shiftAmt) const Logical right-shift function. Definition: APInt.h:959 SDValue getLoad(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr, MachinePointerInfo PtrInfo, unsigned Alignment=0, MachineMemOperand::Flags MMOFlags=MachineMemOperand::MONone, const AAMDNodes &AAInfo=AAMDNodes(), const MDNode Ranges=nullptr) Loads are not normal binary operators: their result type is not determined by their operands... bool isBuildVectorAllOnes(const SDNode N) Return true if the specified node is a BUILD_VECTOR where all of the elements are ~0 or undef... Iterator for intrusive lists based on ilist_node. CCState - This class holds information needed while lowering arguments and return values... void addSuccessor(MachineBasicBlock Succ, BranchProbability Prob=BranchProbability::getUnknown()) Add Succ as a successor of this MachineBasicBlock. static SDValue truncateVecElts(SDValue Op, SelectionDAG &DAG) static SDValue performSHLCombine(SDNode N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) bool isLittle() const mmo_iterator memoperands_begin() const Access to memory operands of the instruction. Definition: MachineInstr.h:389 const MipsRegisterInfo getRegisterInfo() const override EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR identified by the (potentially... Definition: ISDOpcodes.h:314 EVT getVectorElementType() const Given a vector type, return the type of each element. Definition: ValueTypes.h:265 static SDValue performMULCombine(SDNode N, SelectionDAG &DAG, const TargetLowering::DAGCombinerInfo &DCI, const MipsSETargetLowering TL) double Log2(double Value) Return the log base 2 of the specified value. Definition: MathExtras.h:520 This is used to represent a portion of an LLVM function in a low-level Data Dependence DAG representa... Definition: SelectionDAG.h:209 value_iterator value_begin() const This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small... Definition: SmallVector.h:864 SDValue getBuildVector(EVT VT, const SDLoc &DL, ArrayRef< SDValue > Ops) Return an ISD::BUILD_VECTOR node. Definition: SelectionDAG.h:712 static SDValue lowerMSABitClear(SDValue Op, SelectionDAG &DAG) constexpr size_t array_lengthof(T(&)[N]) Find the length of an array. Definition: STLExtras.h:720 bool hasCnMips() const EVT changeVectorElementTypeToInteger() const Return a vector with the same number of elements as this vector, but with the element type converted ... Definition: ValueTypes.h:96 BRCOND - Conditional branch. Definition: ISDOpcodes.h:611 const MachineInstrBuilder & addMemOperand(MachineMemOperand MMO) const Wrapper class for IR location info (IR ordering and DebugLoc) to be passed into SDNode creation funct... static SDValue lowerMSACopyIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) Represents one node in the SelectionDAG. SDValue getNOT(const SDLoc &DL, SDValue Val, EVT VT) Create a bitwise NOT operation as (XOR Val, -1). int64_t getImm() const SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override LowerOperation - Provide custom lowering hooks for some operations. bool hasDSP() const unsigned logBase2() const Definition: APInt.h:1727 raw_ostream & dbgs() dbgs() - This returns a reference to a raw_ostream for debugging messages. Definition: Debug.cpp:132 void swap(llvm::BitVector &LHS, llvm::BitVector &RHS) Implement std::swap in terms of BitVector swap. Definition: BitVector.h:923 static SDValue performXORCombine(SDNode N, SelectionDAG &DAG, const MipsSubtarget &Subtarget) static SDValue performSETCCCombine(SDNode N, SelectionDAG &DAG) EVT getMemoryVT() const Return the type of the in-memory value. Class for arbitrary precision integers. Definition: APInt.h:69 static bool isSplatVector(const BuildVectorSDNode N) Check if the given BuildVectorSDNode is a splat. A "pseudo-class" with methods for operating on BUILD_VECTORs. Select(COND, TRUEVAL, FALSEVAL). Definition: ISDOpcodes.h:389 static SDValue performDSPShiftCombine(unsigned Opc, SDNode N, EVT Ty, SelectionDAG &DAG, const MipsSubtarget &Subtarget) bool isPowerOf2() const Check if this APInt's value is a power of two greater than zero. Definition: APInt.h:457 ZERO_EXTEND - Used for integer types, zeroing the new bits. Definition: ISDOpcodes.h:445 static cl::opt< bool > NoDPLoadStore("mno-ldc1-sdc1", cl::init(false), cl::desc("Expand double precision loads and " "stores to their single precision " "counterparts")) static SDValue lowerVECTOR_SHUFFLE_ILVOD(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static SDValue lowerMSASplatZExt(SDValue Op, unsigned OpNr, SelectionDAG &DAG) static SDValue performSRLCombine(SDNode N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. Definition: ISDOpcodes.h:287 int getMaskElt(unsigned Idx) const FMINNAN/FMAXNAN - Behave identically to FMINNUM/FMAXNUM, except that when a single input is NaN... Definition: ISDOpcodes.h:572 static bool isBitwiseInverse(SDValue N, SDValue OfNode) MachineRegisterInfo - Keep track of information for virtual and physical registers, including vreg register classes, use/def chains for registers, etc. Representation of each machine instruction. Definition: MachineInstr.h:59 const MachineFunction * getParent() const Return the MachineFunction containing this basic block. LLVM_ATTRIBUTE_ALWAYS_INLINE iterator end() Definition: SmallVector.h:120 bool isVector() const Return true if this is a vector value type. Definition: ValueTypes.h:151 const MachineInstrBuilder & addImm(int64_t Val) const Add a new immediate operand. Bitwise operators - logical and, logical or, logical xor. Definition: ISDOpcodes.h:362 void splice(iterator Where, MachineBasicBlock Other, iterator From) Take an instruction from MBB 'Other' at the position From, and insert it into this MBB right before '... MachineRegisterInfo & getRegInfo() getRegInfo - Return information about the registers currently in use. SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing a signed/unsigned value of type i[2... Definition: ISDOpcodes.h:205 bool is128BitVector() const Return true if this is a 128-bit vector type. Definition: ValueTypes.h:182 const MCInstrDesc & get(unsigned Opcode) const Return the machine instruction descriptor that corresponds to the specified instruction opcode... Definition: MCInstrInfo.h:45 LOAD and STORE have token chains as their first operand, then the same operands as an LLVM load/store... Definition: ISDOpcodes.h:581 const TargetRegisterClass getRepRegClassFor(MVT VT) const override Return the 'representative' register class for the specified value type. #define I(x, y, z) Definition: MD5.cpp:58 #define N const TargetSubtargetInfo & getSubtarget() const Definition: SelectionDAG.h:390 Flags getFlags() const Return the raw flags of the source value,. SDValue lowerSTORE(SDValue Op, SelectionDAG &DAG) const const BasicBlock * getBasicBlock() const Return the LLVM basic block that this instance corresponded to originally. static SDValue lowerMSABinaryBitImmIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc, SDValue Imm, bool BigEndian) MipsFunctionInfo - This class is derived from MachineFunction private Mips target-specific informatio... LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val) Definition: Casting.h:323 bool useOddSPReg() const const MachineInstrBuilder & addReg(unsigned RegNo, unsigned flags=0, unsigned SubReg=0) const Add a new virtual register operand. unsigned getOpcode() const FSINCOS - Compute both fsin and fcos as a single operation. Definition: ISDOpcodes.h:575 SDValue getValue(unsigned R) const unsigned getInRegsParamsCount() const bool hasMips32r2() const bool isReg() const isReg - Tests if this is a MO_Register operand. SDValue getConstant(uint64_t Val, const SDLoc &DL, EVT VT, bool isTarget=false, bool isOpaque=false) Create a ConstantSDNode wrapping a constant value. bool isABI_N64() const assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef()) void insert(iterator MBBI, MachineBasicBlock MBB) int64_t getOffset() const For normal values, this is a byte offset added to the base address. LLVM Value Representation. Definition: Value.h:73 uint64_t getConstantOperandVal(unsigned Num) const Helper method returns the integer value of a ConstantSDNode operand. FMA - Perform a b + c with no intermediate rounding step. Definition: ISDOpcodes.h:277 SDValue getValueType(EVT) std::underlying_type< E >::type Mask() Get a bitmask with 1s in all places up to the high-order bit of E's largest value. Definition: BitmaskEnum.h:81 bool isUndef() const Return true if the type of the node type undefined. static SDValue lowerVECTOR_SHUFFLE_SHF(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static SDValue lo	{ "url": "http://llvm.org/doxygen/MipsSEISelLowering_8cpp_source.html", "source_domain": "llvm.org", "snapshot_id": "crawl=CC-MAIN-2017-47", "warc_metadata": { "Content-Length": "1048833", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BSITCDIIGQYOJ2BUTQF3U7QLGOWF7UR3", "WARC-Concurrent-To": "<urn:uuid:4bf263ae-4084-4b75-8f9a-ae3191eb7fdc>", "WARC-Date": "2017-11-23T02:00:01Z", "WARC-IP-Address": "54.67.122.174", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:RPPBIOCHH2YEIEUKKBK7NCMNIUTPRLYP", "WARC-Record-ID": "<urn:uuid:2aa3df59-92ac-4950-a78f-ffe1fc893e97>", "WARC-Target-URI": "http://llvm.org/doxygen/MipsSEISelLowering_8cpp_source.html", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c14d4872-1d6e-4a4d-9077-210215d4f89a>" }, "warc_info": "robots: classic\r\nhostname: ip-10-143-69-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 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, 15, 38, 76, 159, 164, 202, 207, 282, 325, 330, 413, 418, 482, 488, 572, 576, 611, 647, 680, 710, 741, 775, 810, 847, 879, 912, 947, 984, 1019, 1043, 1065, 1087, 1110, 1132, 1136, 1161, 1165, 1199, 1203, 1227, 1278, 1338, 1342, 1414, 1464, 1504, 1526, 1530, 1560, 1596, 1631, 1685, 1689, 1720, 1774, 1778, 1830, 1887, 1934, 1981, 2024, 2030, 2036, 2042, 2046, 2076, 2080, 2140, 2194, 2198, 2233, 2294, 2342, 2346, 2398, 2450, 2503, 2557, 2564, 2569, 2576, 2581, 2612, 2617, 2648, 2704, 2760, 2816, 2872, 2930, 2988, 3046, 3051, 3113, 3170, 3175, 3182, 3187, 3225, 3280, 3285, 3347, 3386, 3418, 3473, 3483, 3539, 3546, 3553, 3558, 3563, 3595, 3632, 3637, 3671, 3678, 3683, 3688, 3693, 3698, 3703, 3729, 3736, 3741, 3777, 3858, 3878, 3883, 3964, 4024, 4029, 4109, 4148, 4153, 4158, 4229, 4234, 4239, 4298, 4303, 4310, 4315, 4351, 4432, 4452, 4457, 4538, 4598, 4603, 4683, 4722, 4729, 4734, 4740, 4745, 4776, 4809, 4856, 4862, 4867, 4899, 4928, 5009, 5014, 5020, 5025, 5098, 5129, 5134, 5170, 5232, 5274, 5279, 5284, 5289, 5338, 5345, 5350, 5356, 5361, 5441, 5472, 5477, 5513, 5575, 5617, 5622, 5627, 5656, 5661, 5668, 5674, 5679, 5764, 5798, 5855, 5860, 5898, 5917, 5922, 6005, 6088, 6151, 6235, 6312, 6337, 6343, 6348, 6357, 6372, 6387, 6412, 6417, 6489, 6570, 6647, 6697, 6712, 6731, 6749, 6756, 6761, 6781, 6801, 6821, 6836, 6855, 6873, 6887, 6906, 6913, 6919, 6924, 6956, 6986, 7034, 7084, 7166, 7249, 7328, 7408, 7485, 7567, 7644, 7655, 7731, 7805, 7873, 7949, 8013, 8081, 8133, 8140, 8145, 8202, 8208, 8213, 8276, 8283, 8330, 8402, 8483, 8504, 8573, 8612, 8642, 8665, 8670, 8707, 8744, 8788, 8793, 8848, 8888, 8934, 8975, 9027, 9075, 9080, 9096, 9119, 9124, 9199, 9204, 9234, 9287, 9292, 9334, 9387, 9442, 9479, 9484, 9562, 9591, 9664, 9728, 9751, 9799, 9806, 9813, 9818, 9841, 9847, 9852, 9919, 9926, 9963, 10027, 10034, 10113, 10193, 10274, 10334, 10405, 10410, 10426, 10445, 10450, 10485, 10513, 10537, 10542, 10626, 10652, 10671, 10676, 10699, 10704, 10722, 10728, 10733, 10797, 10842, 10922, 10953, 10994, 11021, 11026, 11031, 11046, 11065, 11070, 11105, 11133, 11157, 11162, 11239, 11266, 11349, 11390, 11395, 11414, 11420, 11425, 11481, 11543, 11580, 11599, 11604, 11648, 11688, 11693, 11737, 11777, 11782, 11801, 11807, 11812, 11868, 11875, 11922, 12000, 12082, 12102, 12141, 12171, 12194, 12199, 12233, 12238, 12269, 12292, 12297, 12334, 12371, 12376, 12449, 12491, 12533, 12575, 12617, 12667, 12672, 12705, 12739, 12765, 12770, 12847, 12928, 12945, 12997, 13048, 13068, 13089, 13094, 13148, 13218, 13239, 13298, 13368, 13389, 13394, 13422, 13429, 13434, 13515, 13552, 13604, 13675, 13695, 13716, 13721, 13775, 13845, 13866, 13925, 13995, 14016, 14021, 14049, 14056, 14061, 14132, 14201, 14224, 14253, 14298, 14318, 14339, 14360, 14412, 14432, 14453, 14474, 14526, 14546, 14567, 14588, 14640, 14660, 14681, 14702, 14754, 14774, 14795, 14816, 14868, 14888, 14909, 14930, 14982, 15002, 15023, 15044, 15096, 15116, 15137, 15158, 15165, 15172, 15177, 15244, 15271, 15294, 15299, 15347, 15352, 15383, 15410, 15442, 15461, 15486, 15505, 15512, 15517, 15571, 15644, 15651, 15656, 15679, 15685, 15690, 15767, 15806, 15824, 15841, 15881, 15886, 15904, 15921, 15936, 15941, 15994, 16019, 16064, 16114, 16119, 16161, 16216, 16272, 16317, 16322, 16364, 16447, 16518, 16556, 16621, 16690, 16743, 16750, 16755, 16796, 16865, 16929, 16997, 17050, 17056, 17061, 17100, 17134, 17139, 17212, 17237, 17314, 17372, 17383, 17388, 17415, 17421, 17426, 17501, 17525, 17564, 17618, 17653, 17681, 17705, 17755, 17760, 17790, 17813, 17818, 17834, 17912, 17952, 17986, 18031, 18054, 18059, 18077, 18132, 18196, 18202, 18207, 18246, 18280, 18285, 18335, 18358, 18363, 18441, 18447, 18452, 18532, 18589, 18596, 18643, 18715, 18796, 18836, 18917, 18934, 18941, 19021, 19044, 19083, 19117, 19122, 19153, 19190, 19227, 19232, 19301, 19337, 19379, 19420, 19490, 19532, 19595, 19600, 19620, 19643, 19648, 19710, 19733, 19738, 19806, 19885, 19890, 19918, 19977, 20002, 20071, 20101, 20168, 20194, 20245, 20252, 20259, 20266, 20271, 20348, 20371, 20376, 20454, 20460, 20465, 20470, 20509, 20543, 20548, 20625, 20648, 20653, 20731, 20737, 20742, 20805, 20844, 20849, 20868, 20890, 20925, 20947, 20969, 20991, 21028, 21051, 21074, 21097, 21136, 21164, 21171, 21177, 21182, 21216, 21221, 21271, 21294, 21299, 21380, 21403, 21408, 21484, 21526, 21532, 21537, 21571, 21576, 21626, 21662, 21729, 21796, 21863, 21930, 21998, 22066, 22134, 22202, 22281, 22362, 22381, 22418, 22423, 22464, 22487, 22492, 22571, 22589, 22594, 22653, 22673, 22739, 22760, 22770, 22793, 22798, 22835, 22872, 22914, 22956, 22961, 23002, 23078, 23098, 23144, 23220, 23240, 23299, 23338, 23343, 23393, 23416, 23421, 23483, 23530, 23593, 23600, 23605, 23628, 23634, 23639, 23678, 23712, 23717, 23789, 23825, 23875, 23935, 23972, 24009, 24029, 24034, 24052, 24108, 24126, 24136, 24159, 24164, 24204, 24279, 24307, 24314, 24319, 24342, 24348, 24353, 24365, 24399, 24417, 24422, 24453, 24473, 24527, 24539, 24558, 24611, 24623, 24643, 24693, 24713, 24767, 24779, 24799, 24854, 24874, 24929, 24953, 24996, 25016, 25065, 25077, 25099, 25140, 25153, 25161, 25167, 25194, 25243, 25283, 25310, 25362, 25385, 25403, 25411, 25417, 25424, 25430, 25467, 25499, 25514, 25548, 25583, 25614, 25670, 25701, 25757, 25788, 25844, 25875, 25931, 25962, 26018, 26048, 26103, 26133, 26188, 26218, 26273, 26303, 26358, 26388, 26443, 26476, 26510, 26543, 26577, 26612, 26648, 26683, 26719, 26758, 26799, 26850, 26889, 26930, 26981, 27020, 27061, 27112, 27151, 27192, 27243, 27283, 27325, 27375, 27415, 27457, 27507, 27540, 27574, 27607, 27641, 27676, 27712, 27747, 27783, 27808, 27848, 27873, 27913, 27954, 28003, 28043, 28091, 28132, 28180, 28220, 28267, 28275, 28282, 28288, 28355, 28410, 28452, 28481, 28501, 28507, 28555, 28577, 28597, 28603, 28678, 28743, 28763, 28769, 28842, 28861, 28918, 28925, 28931, 28964, 29012, 29072, 29139, 29202, 29231, 29260, 29344, 29393, 29407, 29414, 29420, 29504, 29550, 29556, 29614, 29667, 29673, 29752, 29772, 29832, 29870, 29876, 29914, 29993, 30051, 30057, 30096, 30178, 30210, 30273, 30345, 30351, 30384, 30409, 30415, 30492, 30537, 30579, 30586, 30592, 30677, 30725, 30731, 30789, 30843, 30849, 30934, 30954, 31035, 31073, 31119, 31165, 31171, 31204, 31229, 31235, 31272, 31286, 31366, 31421, 31427, 31465, 31547, 31615, 31654, 31709, 31716, 31722, 31798, 31828, 31861, 31926, 31932, 31980, 32000, 32059, 32102, 32124, 32130, 32147, 32200, 32217, 32270, 32276, 32304, 32334, 32340, 32375, 32418, 32425, 32431, 32504, 32545, 32618, 32659, 32732, 32739, 32745, 32827, 32892, 32957, 33022, 33029, 33035, 33119, 33145, 33153, 33189, 33200, 33246, 33292, 33319, 33340, 33361, 33399, 33407, 33487, 33507, 33579, 33604, 33610, 33648, 33670, 33715, 33721, 33772, 33778, 33825, 33876, 33882, 33925, 33970, 33981, 34008, 34014, 34052, 34109, 34152, 34158, 34200, 34226, 34253, 34259, 34281, 34315, 34321, 34399, 34418, 34480, 34486, 34508, 34563, 34646, 34652, 34675, 34693, 34699, 34749, 34808, 34851, 34858, 34864, 34937, 35021, 35041, 35080, 35119, 35158, 35221, 35227, 35288, 35320, 35326, 35347, 35354, 35360, 35446, 35488, 35519, 35598, 35618, 35624, 35705, 35784, 35800, 35844, 35865, 35871, 35907, 35955, 35984, 36004, 36035, 36048, 36069, 36075, 36157, 36221, 36227, 36270, 36343, 36349, 36383, 36437, 36492, 36549, 36557, 36563, 36584, 36591, 36597, 36681, 36712, 36742, 36793, 36832, 36839, 36845, 36916, 36959, 36987, 37027, 37067, 37095, 37101, 37134, 37211, 37240, 37246, 37320, 37388, 37430, 37505, 37513, 37519, 37593, 37613, 37634, 37677, 37683, 37761, 37819, 37877, 37937, 37943, 37986, 38059, 38065, 38094, 38155, 38161, 38182, 38189, 38195, 38228, 38252, 38291, 38314, 38334, 38340, 38425, 38448, 38481, 38547, 38607, 38613, 38687, 38704, 38780, 38786, 38807, 38848, 38854, 38883, 38919, 38960, 39018, 39026, 39034, 39040, 39072, 39133, 39139, 39221, 39258, 39289, 39351, 39357, 39422, 39428, 39508, 39524, 39532, 39538, 39608, 39615, 39621, 39641, 39680, 39719, 39798, 39862, 39941, 39962, 40043, 40049, 40111, 40118, 40124, 40163, 40183, 40234, 40319, 40325, 40390, 40425, 40432, 40438, 40458, 40497, 40556, 40623, 40684, 40690, 40765, 40772, 40778, 40849, 40882, 40902, 40986, 41013, 41028, 41052, 41086, 41138, 41177, 41234, 41273, 41330, 41369, 41426, 41465, 41522, 41559, 41614, 41651, 41706, 41744, 41800, 41838, 41894, 41933, 41990, 42023, 42074, 42108, 42160, 42193, 42244, 42278, 42330, 42363, 42414, 42448, 42500, 42535, 42570, 42605, 42640, 42719, 42745, 42781, 42817, 42853, 42889, 42968, 43005, 43039, 43118, 43144, 43179, 43258, 43295, 43330, 43365, 43400, 43435, 43475, 43511, 43547, 43583, 43619, 43662, 43699, 43736, 43773, 43812, 43892, 43931, 43979, 44044, 44096, 44137, 44187, 44233, 44278, 44286, 44323, 44360, 44397, 44436, 44516, 44555, 44603, 44668, 44720, 44761, 44811, 44857, 44902, 44910, 44945, 45028, 45073, 45109, 45173, 45228, 45254, 45288, 45371, 45416, 45451, 45515, 45570, 45596, 45631, 45666, 45701, 45738, 45777, 45828, 45834, 45899, 45943, 45977, 45985, 46021, 46057, 46093, 46129, 46205, 46235, 46269, 46303, 46337, 46371, 46444, 46470, 46504, 46577, 46603, 46638, 46710, 46774, 46818, 46844, 46880, 46953, 47017, 47072, 47098, 47133, 47168, 47203, 47240, 47279, 47330, 47336, 47400, 47444, 47478, 47486, 47522, 47558, 47594, 47630, 47705, 47735, 47768, 47801, 47834, 47867, 47937, 47963, 47996, 48066, 48092, 48126, 48160, 48194, 48228, 48298, 48336, 48371, 48406, 48441, 48476, 48546, 48601, 48637, 48673, 48709, 48745, 48815, 48853, 48890, 48927, 48964, 49001, 49071, 49126, 49162, 49198, 49234, 49270, 49340, 49379, 49416, 49453, 49490, 49527, 49597, 49647, 49683, 49719, 49755, 49791, 49861, 49899, 49936, 49973, 50010, 50047, 50117, 50172, 50208, 50244, 50280, 50316, 50386, 50425, 50462, 50499, 50536, 50573, 50643, 50693, 50730, 50767, 50804, 50841, 50874, 50951, 50964, 51037, 51101, 51162, 51208, 51234, 51242, 51279, 51316, 51353, 51390, 51423, 51500, 51513, 51586, 51650, 51724, 51799, 51878, 51939, 51985, 52011, 52019, 52055, 52091, 52127, 52163, 52243, 52269, 52305, 52341, 52377, 52413, 52493, 52519, 52554, 52589, 52656, 52736, 52762, 52839, 52874, 52909, 52979, 53018, 53053, 53088, 53158, 53197, 53232, 53267, 53337, 53376, 53411, 53446, 53516, 53555, 53590, 53625, 53695, 53732, 53768, 53804, 53874, 53913, 53949, 53985, 54055, 54094, 54130, 54166, 54236, 54275, 54310, 54345, 54415, 54453, 54489, 54525, 54595, 54634, 54669, 54704, 54771, 54851, 54877, 54915, 54953, 55020, 55046, 55084, 55122, 55189, 55215, 55250, 55285, 55320, 55357, 55396, 55422, 55428, 55510, 55540, 55589, 55597, 55633, 55671, 55738, 55777, 55803, 55857, 55926, 55934, 55970, 56006, 56088, 56124, 56160, 56227, 56291, 56326, 56361, 56428, 56508, 56534, 56570, 56608, 56675, 56714, 56787, 56834, 56880, 56888, 56924, 56960, 57042, 57078, 57114, 57196, 57231, 57266, 57333, 57413, 57439, 57478, 57517, 57584, 57610, 57649, 57688, 57755, 57781, 57817, 57853, 57889, 57925, 57991, 58036, 58071, 58106, 58141, 58176, 58241, 58286, 58322, 58358, 58394, 58430, 58496, 58541, 58576, 58611, 58646, 58681, 58746, 58791, 58828, 58865, 58902, 58939, 59020, 59084, 59120, 59156, 59192, 59230, 59280, 59299, 59326, 59379, 59431, 59483, 59535, 59591, 59599, 59678, 59714, 59766, 59832, 59895, 59936, 59944, 59978, 60012, 60046, 60080, 60129, 60161, 60196, 60235, 60307, 60353, 60399, 60407, 60443, 60479, 60515, 60553, 60592, 60664, 60710, 60756, 60764, 60800, 60836, 60872, 60908, 60974, 61019, 61055, 61091, 61127, 61163, 61229, 61274, 61311, 61348, 61385, 61422, 61488, 61550, 61587, 61624, 61661, 61698, 61764, 61820, 61856, 61892, 61928, 61964, 62030, 62075, 62111, 62147, 62183, 62219, 62285, 62330, 62367, 62404, 62441, 62478, 62544, 62606, 62643, 62680, 62717, 62754, 62820, 62876, 62912, 62948, 62984, 63020, 63100, 63126, 63162, 63198, 63234, 63270, 63350, 63376, 63411, 63446, 63481, 63516, 63595, 63621, 63657, 63693, 63729, 63767, 63806, 63878, 63924, 63970, 63978, 64013, 64048, 64083, 64118, 64199, 64235, 64301, 64346, 64402, 64410, 64447, 64513, 64538, 64575, 64631, 64639, 64672, 64750, 64776, 64810, 64869, 64925, 64961, 64997, 65033, 65069, 65135, 65180, 65216, 65252, 65288, 65324, 65390, 65435, 65470, 65505, 65540, 65575, 65657, 65693, 65729, 65765, 65801, 65837, 65873, 65909, 65947, 65997, 66016, 66043, 66079, 66131, 66167, 66220, 66256, 66309, 66345, 66398, 66454, 66462, 66541, 66577, 66629, 66653, 66661, 66695, 66729, 66765, 66844, 66880, 66932, 66996, 67041, 67049, 67084, 67119, 67154, 67191, 67241, 67260, 67287, 67339, 67390, 67441, 67492, 67548, 67556, 67635, 67671, 67723, 67747, 67755, 67789, 67823, 67857, 67891, 67970, 68003, 68038, 68073, 68108, 68143, 68203, 68259, 68295, 68331, 68367, 68403, 68483, 68562, 68621, 68686, 68751, 68807, 68833, 68870, 68907, 68944, 68981, 69046, 69101, 69127, 69161, 69195, 69229, 69263, 69342, 69375, 69410, 69445, 69480, 69515, 69575, 69631, 69667, 69703, 69739, 69777, 69827, 69846, 69873, 69925, 69978, 70031, 70084, 70140, 70148, 70227, 70263, 70315, 70339, 70347, 70381, 70415, 70449, 70483, 70562, 70595, 70630, 70665, 70700, 70735, 70795, 70851, 70887, 70923, 70959, 70997, 71047, 71066, 71093, 71145, 71198, 71251, 71304, 71360, 71368, 71447, 71483, 71535, 71559, 71567, 71602, 71637, 71672, 71707, 71786, 71812, 71848, 71884, 71920, 71956, 72016, 72072, 72107, 72142, 72177, 72212, 72277, 72341, 72375, 72454, 72480, 72515, 72575, 72631, 72671, 72724, 72785, 72793, 72801, 72808, 72814, 72897, 72937, 72957, 73000, 73043, 73085, 73124, 73168, 73174, 73251, 73328, 73371, 73404, 73469, 73475, 73542, 73618, 73647, 73654, 73660, 73730, 73763, 73842, 73864, 73879, 73903, 73936, 73987, 74022, 74075, 74110, 74163, 74200, 74255, 74293, 74349, 74386, 74441, 74476, 74529, 74571, 74631, 74671, 74729, 74769, 74827, 74868, 74927, 74968, 75027, 75067, 75125, 75165, 75223, 75263, 75321, 75361, 75419, 75460, 75519, 75561, 75621, 75662, 75721, 75763, 75823, 75856, 75889, 75922, 75955, 76012, 76020, 76027, 76033, 76117, 76157, 76177, 76220, 76261, 76304, 76346, 76390, 76396, 76473, 76550, 76593, 76626, 76691, 76697, 76764, 76770, 76847, 76876, 76883, 76889, 76956, 76989, 77068, 77090, 77105, 77129, 77162, 77195, 77228, 77261, 77319, 77327, 77334, 77340, 77405, 77486, 77571, 77586, 77647, 77694, 77767, 77773, 77816, 77822, 77870, 77910, 77930, 77938, 77944, 77963, 77970, 77976, 78047, 78055, 78139, 78219, 78304, 78386, 78404, 78440, 78508, 78528, 78567, 78606, 78646, 78652, 78687, 78711, 78717, 78748, 78787, 78835, 78909, 78941, 78949, 78955, 78972, 78979, 78985, 79040, 79065, 79084, 79119, 79138, 79175, 79194, 79214, 79221, 79227, 79285, 79333, 79352, 79372, 79379, 79385, 79462, 79479, 79487, 79536, 79620, 79695, 79713, 79797, 79880, 79912, 79959, 80040, 80095, 80160, 80193, 80254, 80293, 80313, 80349, 80378, 80403, 80409, 80467, 80491, 80497, 80567, 80590, 80644, 80705, 80780, 80806, 80830, 80836, 80904, 80980, 81025, 81071, 81088, 81094, 81114, 81120, 81150, 81165, 81189, 81203, 81232, 81245, 81260, 81289, 81302, 81317, 81346, 81359, 81374, 81435, 81459, 81467, 81473, 81547, 81613, 81619, 81669, 81698, 81768, 81774, 81795, 81833, 81850, 81905, 81977, 82057, 82088, 82129, 82135, 82167, 82173, 82228, 82272, 82319, 82389, 82416, 82457, 82465, 82486, 82494, 82500, 82524, 82531, 82537, 82590, 82598, 82678, 82763, 82771, 82852, 82918, 82997, 83048, 83056, 83077, 83135, 83182, 83218, 83241, 83270, 83303, 83346, 83382, 83409, 83455, 83461, 83491, 83515, 83521, 83562, 83619, 83647, 83653, 83717, 83797, 83820, 83846, 83877, 83901, 83909, 83915, 83985, 84063, 84094, 84121, 84127, 84201, 84230, 84278, 84302, 84310, 84318, 84324, 84397, 84421, 84458, 84489, 84495, 84516, 84531, 84537, 84554, 84578, 84586, 84592, 84612, 84662, 84724, 84731, 84737, 84806, 84892, 84925, 84942, 84970, 85031, 85054, 85060, 85085, 85128, 85148, 85192, 85198, 85277, 85333, 85399, 85427, 85435, 85454, 85461, 85467, 85521, 85529, 85570, 85593, 85629, 85637, 85719, 85778, 85842, 85878, 85905, 85946, 85952, 85979, 86017, 86038, 86060, 86073, 86081, 86089, 86095, 86179, 86189, 86196, 86202, 86257, 86265, 86327, 86335, 86415, 86452, 86475, 86502, 86559, 86580, 86612, 86648, 86656, 86738, 86798, 86834, 86861, 86902, 86908, 86926, 86944, 86987, 87026, 87032, 87113, 87161, 87217, 87247, 87321, 87351, 87362, 87386, 87392, 87472, 87520, 87580, 87610, 87688, 87718, 87729, 87753, 87759, 87827, 87834, 87840, 87895, 87903, 87964, 87972, 88052, 88089, 88112, 88141, 88198, 88219, 88251, 88289, 88297, 88379, 88439, 88475, 88502, 88543, 88549, 88567, 88585, 88628, 88667, 88673, 88753, 88801, 88857, 88887, 88965, 88995, 89006, 89030, 89036, 89115, 89163, 89223, 89253, 89335, 89365, 89376, 89400, 89406, 89474, 89481, 89487, 89541, 89549, 89635, 89656, 89664, 89743, 89780, 89803, 89830, 89887, 89908, 89940, 89976, 89984, 90066, 90126, 90162, 90189, 90230, 90236, 90254, 90272, 90315, 90354, 90360, 90443, 90507, 90563, 90593, 90667, 90697, 90708, 90732, 90738, 90820, 90884, 90944, 90974, 91052, 91082, 91093, 91117, 91123, 91190, 91197, 91203, 91257, 91265, 91348, 91372, 91380, 91459, 91496, 91523, 91556, 91629, 91650, 91690, 91736, 91744, 91826, 91886, 91922, 91949, 91990, 91996, 92042, 92060, 92078, 92121, 92160, 92166, 92249, 92313, 92376, 92406, 92491, 92521, 92532, 92556, 92562, 92644, 92708, 92775, 92805, 92890, 92900, 92930, 92941, 92965, 92971, 93038, 93045, 93051, 93106, 93114, 93192, 93200, 93280, 93318, 93341, 93368, 93425, 93446, 93483, 93524, 93532, 93614, 93674, 93710, 93737, 93778, 93784, 93802, 93820, 93863, 93925, 93964, 93970, 94026, 94056, 94130, 94160, 94171, 94195, 94201, 94255, 94285, 94357, 94387, 94398, 94422, 94428, 94496, 94503, 94509, 94564, 94572, 94649, 94657, 94737, 94775, 94798, 94827, 94884, 94905, 94942, 94985, 94993, 95075, 95135, 95171, 95198, 95239, 95245, 95263, 95281, 95324, 95386, 95425, 95431, 95487, 95517, 95595, 95625, 95636, 95660, 95666, 95720, 95750, 95826, 95856, 95867, 95891, 95897, 95965, 95972, 95978, 96018, 96026, 96107, 96188, 96271, 96352, 96437, 96522, 96558, 96585, 96604, 96623, 96687, 96743, 96775, 96807, 96827, 96882, 96888, 96935, 96966, 96994, 97000, 97042, 97068, 97125, 97151, 97159, 97165, 97248, 97259, 97322, 97328, 97392, 97398, 97438, 97469, 97500, 97530, 97567, 97595, 97632, 97643, 97725, 97731, 97806, 97871, 97932, 97972, 98011, 98045, 98117, 98188, 98195, 98201, 98284, 98316, 98383, 98416, 98481, 98520, 98526, 98561, 98585, 98591, 98646, 98682, 98688, 98733, 98779, 98785, 98856, 98880, 98940, 99004, 99026, 99099, 99120, 99193, 99214, 99286, 99307, 99379, 99400, 99473, 99494, 99567, 99588, 99659, 99680, 99744, 99751, 99757, 99815, 99852, 99866, 99896, 99908, 99922, 99945, 99960, 99980, 99997, 100012, 100032, 100048, 100092, 100098, 100166, 100226, 100264, 100319, 100363, 100431, 100499, 100525, 100551, 100578, 100584, 100655, 100737, 100755, 100761, 100786, 100815, 100844, 100875, 100906, 100912, 100966, 101027, 101082, 101149, 101155, 101175, 101231, 101295, 101332, 101401, 101407, 101427, 101483, 101547, 101584, 101590, 101629, 101690, 101723, 101742, 101761, 101780, 101800, 101806, 101873, 101892, 101899, 101905, 101973, 102047, 102061, 102092, 102104, 102118, 102143, 102159, 102174, 102194, 102211, 102226, 102246, 102262, 102305, 102311, 102379, 102439, 102477, 102532, 102576, 102644, 102712, 102738, 102764, 102791, 102797, 102868, 102950, 102968, 102974, 102999, 103028, 103057, 103088, 103119, 103125, 103176, 103218, 103259, 103279, 103285, 103305, 103361, 103425, 103462, 103531, 103537, 103557, 103613, 103677, 103714, 103720, 103759, 103820, 103853, 103872, 103891, 103910, 103930, 103936, 104003, 104022, 104029, 104035, 104080, 104088, 104123, 104134, 104164, 104186, 104194, 104279, 104364, 104448, 104505, 104542, 104610, 104648, 104695, 104742, 104791, 104797, 104820, 104844, 104882, 104949, 105028, 105099, 105105, 105170, 105178, 105184, 105266, 105281, 105332, 105389, 105425, 105431, 105513, 105595, 105603, 105609, 105676, 105693, 105700, 105706, 105751, 105759, 105794, 105805, 105835, 105864, 105872, 105957, 106037, 106110, 106167, 106204, 106210, 106278, 106325, 106372, 106425, 106463, 106469, 106490, 106572, 106585, 106660, 106666, 106745, 106827, 106835, 106841, 106908, 106925, 106932, 106938, 106985, 106993, 107039, 107050, 107088, 107128, 107187, 107224, 107292, 107330, 107377, 107427, 107476, 107523, 107574, 107631, 107667, 107673, 107735, 107752, 107770, 107799, 107855, 107876, 107896, 107914, 107932, 107938, 108005, 108022, 108029, 108035, 108082, 108090, 108127, 108138, 108176, 108216, 108275, 108312, 108318, 108386, 108424, 108471, 108521, 108570, 108617, 108692, 108698, 108760, 108777, 108795, 108824, 108880, 108901, 108921, 108939, 108957, 108963, 109030, 109047, 109054, 109060, 109124, 109132, 109153, 109213, 109224, 109266, 109317, 109367, 109402, 109451, 109459, 109487, 109547, 109558, 109601, 109643, 109694, 109739, 109774, 109823, 109889, 109961, 109986, 110054, 110092, 110139, 110193, 110245, 110299, 110305, 110355, 110404, 110445, 110520, 110589, 110662, 110690, 110719, 110747, 110779, 110794, 110837, 110851, 110874, 110907, 110938, 110976, 110989, 111003, 111026, 111059, 111090, 111128, 111141, 111155, 111178, 111211, 111242, 111280, 111293, 111307, 111330, 111363, 111394, 111432, 111445, 111453, 111459, 111477, 111535, 111597, 111614, 111639, 111705, 111727, 111735, 111741, 111791, 111824, 111888, 111944, 111967, 111995, 112021, 112029, 112035, 112105, 112167, 112225, 112250, 112275, 112313, 112319, 112381, 112399, 112447, 112501, 112523, 112540, 112565, 112583, 112598, 112647, 112702, 112724, 112749, 112767, 112775, 112781, 112847, 112932, 112968, 113032, 113117, 113133, 113199, 113223, 113277, 113299, 113321, 113360, 113366, 113433, 113450, 113457, 113463, 113508, 113516, 113548, 113559, 113585, 113633, 113663, 113720, 113757, 113825, 113863, 113910, 113957, 114009, 114064, 114102, 114154, 114209, 114247, 114253, 114316, 114379, 114398, 114416, 114445, 114525, 114531, 114598, 114615, 114622, 114628, 114673, 114681, 114713, 114724, 114750, 114798, 114828, 114885, 114922, 114928, 114996, 115034, 115081, 115128, 115204, 115280, 115286, 115349, 115412, 115431, 115449, 115478, 115558, 115564, 115631, 115648, 115655, 115661, 115737, 115755, 115763, 115809, 115820, 115851, 115876, 115884, 115965, 116047, 116062, 116125, 116162, 116168, 116236, 116274, 116321, 116368, 116431, 116469, 116475, 116554, 116623, 116670, 116708, 116788, 116842, 116873, 116932, 117005, 117011, 117090, 117115, 117189, 117252, 117269, 117287, 117316, 117332, 117340, 117414, 117432, 117450, 117469, 117515, 117521, 117549, 117566, 117573, 117579, 117664, 117672, 117719, 117730, 117755, 117782, 117790, 117864, 117938, 118017, 118054, 118132, 118154, 118217, 118254, 118260, 118328, 118366, 118413, 118419, 118498, 118567, 118614, 118652, 118732, 118786, 118817, 118823, 118882, 118937, 118943, 118975, 119054, 119111, 119144, 119150, 119175, 119249, 119332, 119348, 119356, 119362, 119429, 119435, 119463, 119480, 119487, 119493, 119538, 119546, 119595, 119603, 119683, 119717, 119725, 119808, 119880, 119954, 120030, 120108, 120185, 120193, 120216, 120224, 120269, 120280, 120305, 120335, 120371, 120379, 120415, 120423, 120468, 120479, 120504, 120534, 120561, 120597, 120633, 120673, 120709, 120717, 120753, 120761, 120806, 120817, 120843, 120873, 120913, 120951, 120959, 121043, 121113, 121182, 121250, 121323, 121356, 121420, 121449, 121477, 121483, 121562, 121645, 121658, 121664, 121727, 121791, 121797, 121835, 121882, 121929, 121935, 122003, 122081, 122122, 122191, 122232, 122252, 122309, 122381, 122387, 122448, 122509, 122574, 122642, 122671, 122677, 122706, 122768, 122842, 122921, 123000, 123061, 123082, 123104, 123122, 123183, 123205, 123227, 123245, 123266, 123274, 123280, 123301, 123380, 123440, 123460, 123481, 123502, 123510, 123516, 123599, 123605, 123633, 123650, 123657, 123663, 123709, 123717, 123775, 123783, 123862, 123907, 123915, 123998, 124070, 124144, 124220, 124298, 124377, 124402, 124410, 124433, 124441, 124487, 124498, 124527, 124559, 124584, 124592, 124625, 124633, 124679, 124690, 124719, 124752, 124789, 124815, 124823, 124856, 124864, 124910, 124921, 124950, 124983, 125019, 125047, 125084, 125120, 125185, 125214, 125242, 125248, 125327, 125410, 125423, 125429, 125492, 125556, 125562, 125600, 125647, 125694, 125700, 125768, 125809, 125878, 125919, 125939, 125996, 126072, 126078, 126156, 126185, 126191, 126263, 126284, 126352, 126426, 126434, 126440, 126499, 126560, 126600, 126660, 126672, 126749, 126818, 126824, 126853, 126915, 126976, 126996, 127014, 127072, 127094, 127117, 127125, 127131, 127159, 127176, 127183, 127189, 127237, 127245, 127279, 127290, 127311, 127341, 127400, 127437, 127505, 127567, 127623, 127679, 127717, 127723, 127756, 127822, 127894, 127900, 127930, 128009, 128028, 128070, 128076, 128143, 128160, 128167, 128173, 128221, 128229, 128263, 128274, 128295, 128325, 128384, 128421, 128489, 128551, 128607, 128663, 128701, 128707, 128740, 128806, 128878, 128884, 128914, 128993, 129012, 129054, 129060, 129127, 129144, 129151, 129374, 129417, 129526, 129606, 129635, 129657, 129762, 129791, 129896, 129960, 130024, 130053, 130128, 130157, 130182, 130235, 130343, 130428, 130533, 130713, 130742, 130772, 130797, 130822, 130849, 130901, 130989, 131098, 131129, 131180, 131210, 131270, 131331, 131363, 131521, 131624, 131709, 131770, 131796, 131824, 131853, 131921, 131952, 131985, 132064, 132176, 132236, 132303, 132381, 132410, 132436, 132510, 132539, 132607, 132688, 132740, 132770, 132875, 132988, 133056, 133161, 133196, 133235, 133274, 133311, 133363, 133394, 133527, 133551, 133589, 133622, 133687, 133792, 133819, 133884, 133915, 133939, 133963, 134024, 134053, 134105, 134133, 134185, 134218, 134243, 134293, 134316, 134346, 134380, 134403, 134429, 134452, 134478, 134501, 134561, 134590, 134595, 134700, 134813, 134838, 134884, 134965, 135001, 135075, 135180, 135222, 135312, 135405, 135434, 135539, 135568, 135597, 135637, 135662, 135767, 135837, 135942, 136036, 136141, 136246, 136275, 136314, 136365, 136434, 136502, 136525, 136613, 136642, 136664, 136775, 136832, 136861, 136905, 136950, 136977, 137008, 137037, 137069, 137117, 137148, 137215, 137244, 137349, 137374, 137397, 137466, 137508, 137531, 137603, 137712, 137737, 137803, 137828, 137899, 137926, 137967, 137998, 138066, 138171, 138212, 138243, 138591, 138648, 138753, 138867, 138932, 138984, 139021, 139050, 139081, 139134, 139163, 139228, 139333, 139362, 139424, 139526, 139631, 139660, 139770, 139814, 139843, 139891, 139927, 139952, 140010, 140041, 140050, 140139, 140168, 140284, 140313, 140399, 140430, 140544, 140604, 140709, 140738, 140812, 140872, 140922, 141002, 141031, 141131, 141160, 141231, 141297, 141329, 141353, 141485, 141585, 141839, 141944, 142038, 142111, 142181, 142209, 142233, 142263, 142287, 142322, 142360, 142390, 142495, 142524, 142552, 142583, 142607, 142680, 142795, 142855, 142960, 143033, 143053, 143081, 143131, 143159, 143192, 143220, 143330, 143431, 143492, 143582, 143622, 143651, 143694, 143799, 143856, 143894, 143958, 143987, 144061, 144107, 144137, 144184, 144282, 144311, 144350, 144465, 144491, 144527, 144660, 144697, 144764, 144793, 144848, 144869, 144897, 145119, 145179, 145206, 145236, 145261, 145339, 145364, 145458, 145490, 145542, 145572, 145637, 145673, 145703, 145727, 145974, 146070, 146113, 146210, 146260, 146352, 146451, 146502, 146564, 146697, 146719, 146758, 146804, 146835, 146893, 146998, 147027, 147060, 147114, 147143, 147282, 147308, 147354, 147383, 147488, 147519, 147554, 147665, 147695, 147768, 147802, 147833, 147896, 147937, 147966, 147994, 148017, 148062, 148167, 148195, 148224, 148253, 148325, 148430, 148507, 148548, 148601, 148650, 148673, 148742, 148810, 148830, 148856, 148881, 148902, 148977, 149003, 149057, 149105, 149133, 149228, 149293, 149317, 149357, 149397, 149420, 149474, 149523, 149585, 149618, 149647, 149769, 149793, 149862, 149886, 149946, 149975, 150145, 150260, 150339, 150472, 150532, 150561, 150596, 150695, 150724, 150780, 150932, 150976, 151006, 151048, 151104, 151148, 151178, 151200, 151244, 151273, 151327, 151356, 151414, 151443, 151512, 151629, 151664, 151734, 151839, 151868, 151896, 151942, 151971, 152018, 152116, 152145, 152250, 152279, 152348, 152429, 152448, 152471, 152481, 152530, 152561, 152584, 152627, 152683, 152724, 152799, 152913, 153018, 153152, 153178, 153203, 153297, 153333, 153360, 153420, 153449, 153484, 153522, 153547, 153566, 153614, 153715, 153766, 153789, 153849, 153900, 153926, 153994, 154021, 154044, 154095, 154164, 154224, 154253, 154279, 154318, 154405, 154434, 154455, 154507, 154620 ], "line_end_idx": [ 15, 38, 76, 159, 164, 202, 207, 282, 325, 330, 413, 418, 482, 488, 572, 576, 611, 647, 680, 710, 741, 775, 810, 847, 879, 912, 947, 984, 1019, 1043, 1065, 1087, 1110, 1132, 1136, 1161, 1165, 1199, 1203, 1227, 1278, 1338, 1342, 1414, 1464, 1504, 1526, 1530, 1560, 1596, 1631, 1685, 1689, 1720, 1774, 1778, 1830, 1887, 1934, 1981, 2024, 2030, 2036, 2042, 2046, 2076, 2080, 2140, 2194, 2198, 2233, 2294, 2342, 2346, 2398, 2450, 2503, 2557, 2564, 2569, 2576, 2581, 2612, 2617, 2648, 2704, 2760, 2816, 2872, 2930, 2988, 3046, 3051, 3113, 3170, 3175, 3182, 3187, 3225, 3280, 3285, 3347, 3386, 3418, 3473, 3483, 3539, 3546, 3553, 3558, 3563, 3595, 3632, 3637, 3671, 3678, 3683, 3688, 3693, 3698, 3703, 3729, 3736, 3741, 3777, 3858, 3878, 3883, 3964, 4024, 4029, 4109, 4148, 4153, 4158, 4229, 4234, 4239, 4298, 4303, 4310, 4315, 4351, 4432, 4452, 4457, 4538, 4598, 4603, 4683, 4722, 4729, 4734, 4740, 4745, 4776, 4809, 4856, 4862, 4867, 4899, 4928, 5009, 5014, 5020, 5025, 5098, 5129, 5134, 5170, 5232, 5274, 5279, 5284, 5289, 5338, 5345, 5350, 5356, 5361, 5441, 5472, 5477, 5513, 5575, 5617, 5622, 5627, 5656, 5661, 5668, 5674, 5679, 5764, 5798, 5855, 5860, 5898, 5917, 5922, 6005, 6088, 6151, 6235, 6312, 6337, 6343, 6348, 6357, 6372, 6387, 6412, 6417, 6489, 6570, 6647, 6697, 6712, 6731, 6749, 6756, 6761, 6781, 6801, 6821, 6836, 6855, 6873, 6887, 6906, 6913, 6919, 6924, 6956, 6986, 7034, 7084, 7166, 7249, 7328, 7408, 7485, 7567, 7644, 7655, 7731, 7805, 7873, 7949, 8013, 8081, 8133, 8140, 8145, 8202, 8208, 8213, 8276, 8283, 8330, 8402, 8483, 8504, 8573, 8612, 8642, 8665, 8670, 8707, 8744, 8788, 8793, 8848, 8888, 8934, 8975, 9027, 9075, 9080, 9096, 9119, 9124, 9199, 9204, 9234, 9287, 9292, 9334, 9387, 9442, 9479, 9484, 9562, 9591, 9664, 9728, 9751, 9799, 9806, 9813, 9818, 9841, 9847, 9852, 9919, 9926, 9963, 10027, 10034, 10113, 10193, 10274, 10334, 10405, 10410, 10426, 10445, 10450, 10485, 10513, 10537, 10542, 10626, 10652, 10671, 10676, 10699, 10704, 10722, 10728, 10733, 10797, 10842, 10922, 10953, 10994, 11021, 11026, 11031, 11046, 11065, 11070, 11105, 11133, 11157, 11162, 11239, 11266, 11349, 11390, 11395, 11414, 11420, 11425, 11481, 11543, 11580, 11599, 11604, 11648, 11688, 11693, 11737, 11777, 11782, 11801, 11807, 11812, 11868, 11875, 11922, 12000, 12082, 12102, 12141, 12171, 12194, 12199, 12233, 12238, 12269, 12292, 12297, 12334, 12371, 12376, 12449, 12491, 12533, 12575, 12617, 12667, 12672, 12705, 12739, 12765, 12770, 12847, 12928, 12945, 12997, 13048, 13068, 13089, 13094, 13148, 13218, 13239, 13298, 13368, 13389, 13394, 13422, 13429, 13434, 13515, 13552, 13604, 13675, 13695, 13716, 13721, 13775, 13845, 13866, 13925, 13995, 14016, 14021, 14049, 14056, 14061, 14132, 14201, 14224, 14253, 14298, 14318, 14339, 14360, 14412, 14432, 14453, 14474, 14526, 14546, 14567, 14588, 14640, 14660, 14681, 14702, 14754, 14774, 14795, 14816, 14868, 14888, 14909, 14930, 14982, 15002, 15023, 15044, 15096, 15116, 15137, 15158, 15165, 15172, 15177, 15244, 15271, 15294, 15299, 15347, 15352, 15383, 15410, 15442, 15461, 15486, 15505, 15512, 15517, 15571, 15644, 15651, 15656, 15679, 15685, 15690, 15767, 15806, 15824, 15841, 15881, 15886, 15904, 15921, 15936, 15941, 15994, 16019, 16064, 16114, 16119, 16161, 16216, 16272, 16317, 16322, 16364, 16447, 16518, 16556, 16621, 16690, 16743, 16750, 16755, 16796, 16865, 16929, 16997, 17050, 17056, 17061, 17100, 17134, 17139, 17212, 17237, 17314, 17372, 17383, 17388, 17415, 17421, 17426, 17501, 17525, 17564, 17618, 17653, 17681, 17705, 17755, 17760, 17790, 17813, 17818, 17834, 17912, 17952, 17986, 18031, 18054, 18059, 18077, 18132, 18196, 18202, 18207, 18246, 18280, 18285, 18335, 18358, 18363, 18441, 18447, 18452, 18532, 18589, 18596, 18643, 18715, 18796, 18836, 18917, 18934, 18941, 19021, 19044, 19083, 19117, 19122, 19153, 19190, 19227, 19232, 19301, 19337, 19379, 19420, 19490, 19532, 19595, 19600, 19620, 19643, 19648, 19710, 19733, 19738, 19806, 19885, 19890, 19918, 19977, 20002, 20071, 20101, 20168, 20194, 20245, 20252, 20259, 20266, 20271, 20348, 20371, 20376, 20454, 20460, 20465, 20470, 20509, 20543, 20548, 20625, 20648, 20653, 20731, 20737, 20742, 20805, 20844, 20849, 20868, 20890, 20925, 20947, 20969, 20991, 21028, 21051, 21074, 21097, 21136, 21164, 21171, 21177, 21182, 21216, 21221, 21271, 21294, 21299, 21380, 21403, 21408, 21484, 21526, 21532, 21537, 21571, 21576, 21626, 21662, 21729, 21796, 21863, 21930, 21998, 22066, 22134, 22202, 22281, 22362, 22381, 22418, 22423, 22464, 22487, 22492, 22571, 22589, 22594, 22653, 22673, 22739, 22760, 22770, 22793, 22798, 22835, 22872, 22914, 22956, 22961, 23002, 23078, 23098, 23144, 23220, 23240, 23299, 23338, 23343, 23393, 23416, 23421, 23483, 23530, 23593, 23600, 23605, 23628, 23634, 23639, 23678, 23712, 23717, 23789, 23825, 23875, 23935, 23972, 24009, 24029, 24034, 24052, 24108, 24126, 24136, 24159, 24164, 24204, 24279, 24307, 24314, 24319, 24342, 24348, 24353, 24365, 24399, 24417, 24422, 24453, 24473, 24527, 24539, 24558, 24611, 24623, 24643, 24693, 24713, 24767, 24779, 24799, 24854, 24874, 24929, 24953, 24996, 25016, 25065, 25077, 25099, 25140, 25153, 25161, 25167, 25194, 25243, 25283, 25310, 25362, 25385, 25403, 25411, 25417, 25424, 25430, 25467, 25499, 25514, 25548, 25583, 25614, 25670, 25701, 25757, 25788, 25844, 25875, 25931, 25962, 26018, 26048, 26103, 26133, 26188, 26218, 26273, 26303, 26358, 26388, 26443, 26476, 26510, 26543, 26577, 26612, 26648, 26683, 26719, 26758, 26799, 26850, 26889, 26930, 26981, 27020, 27061, 27112, 27151, 27192, 27243, 27283, 27325, 27375, 27415, 27457, 27507, 27540, 27574, 27607, 27641, 27676, 27712, 27747, 27783, 27808, 27848, 27873, 27913, 27954, 28003, 28043, 28091, 28132, 28180, 28220, 28267, 28275, 28282, 28288, 28355, 28410, 28452, 28481, 28501, 28507, 28555, 28577, 28597, 28603, 28678, 28743, 28763, 28769, 28842, 28861, 28918, 28925, 28931, 28964, 29012, 29072, 29139, 29202, 29231, 29260, 29344, 29393, 29407, 29414, 29420, 29504, 29550, 29556, 29614, 29667, 29673, 29752, 29772, 29832, 29870, 29876, 29914, 29993, 30051, 30057, 30096, 30178, 30210, 30273, 30345, 30351, 30384, 30409, 30415, 30492, 30537, 30579, 30586, 30592, 30677, 30725, 30731, 30789, 30843, 30849, 30934, 30954, 31035, 31073, 31119, 31165, 31171, 31204, 31229, 31235, 31272, 31286, 31366, 31421, 31427, 31465, 31547, 31615, 31654, 31709, 31716, 31722, 31798, 31828, 31861, 31926, 31932, 31980, 32000, 32059, 32102, 32124, 32130, 32147, 32200, 32217, 32270, 32276, 32304, 32334, 32340, 32375, 32418, 32425, 32431, 32504, 32545, 32618, 32659, 32732, 32739, 32745, 32827, 32892, 32957, 33022, 33029, 33035, 33119, 33145, 33153, 33189, 33200, 33246, 33292, 33319, 33340, 33361, 33399, 33407, 33487, 33507, 33579, 33604, 33610, 33648, 33670, 33715, 33721, 33772, 33778, 33825, 33876, 33882, 33925, 33970, 33981, 34008, 34014, 34052, 34109, 34152, 34158, 34200, 34226, 34253, 34259, 34281, 34315, 34321, 34399, 34418, 34480, 34486, 34508, 34563, 34646, 34652, 34675, 34693, 34699, 34749, 34808, 34851, 34858, 34864, 34937, 35021, 35041, 35080, 35119, 35158, 35221, 35227, 35288, 35320, 35326, 35347, 35354, 35360, 35446, 35488, 35519, 35598, 35618, 35624, 35705, 35784, 35800, 35844, 35865, 35871, 35907, 35955, 35984, 36004, 36035, 36048, 36069, 36075, 36157, 36221, 36227, 36270, 36343, 36349, 36383, 36437, 36492, 36549, 36557, 36563, 36584, 36591, 36597, 36681, 36712, 36742, 36793, 36832, 36839, 36845, 36916, 36959, 36987, 37027, 37067, 37095, 37101, 37134, 37211, 37240, 37246, 37320, 37388, 37430, 37505, 37513, 37519, 37593, 37613, 37634, 37677, 37683, 37761, 37819, 37877, 37937, 37943, 37986, 38059, 38065, 38094, 38155, 38161, 38182, 38189, 38195, 38228, 38252, 38291, 38314, 38334, 38340, 38425, 38448, 38481, 38547, 38607, 38613, 38687, 38704, 38780, 38786, 38807, 38848, 38854, 38883, 38919, 38960, 39018, 39026, 39034, 39040, 39072, 39133, 39139, 39221, 39258, 39289, 39351, 39357, 39422, 39428, 39508, 39524, 39532, 39538, 39608, 39615, 39621, 39641, 39680, 39719, 39798, 39862, 39941, 39962, 40043, 40049, 40111, 40118, 40124, 40163, 40183, 40234, 40319, 40325, 40390, 40425, 40432, 40438, 40458, 40497, 40556, 40623, 40684, 40690, 40765, 40772, 40778, 40849, 40882, 40902, 40986, 41013, 41028, 41052, 41086, 41138, 41177, 41234, 41273, 41330, 41369, 41426, 41465, 41522, 41559, 41614, 41651, 41706, 41744, 41800, 41838, 41894, 41933, 41990, 42023, 42074, 42108, 42160, 42193, 42244, 42278, 42330, 42363, 42414, 42448, 42500, 42535, 42570, 42605, 42640, 42719, 42745, 42781, 42817, 42853, 42889, 42968, 43005, 43039, 43118, 43144, 43179, 43258, 43295, 43330, 43365, 43400, 43435, 43475, 43511, 43547, 43583, 43619, 43662, 43699, 43736, 43773, 43812, 43892, 43931, 43979, 44044, 44096, 44137, 44187, 44233, 44278, 44286, 44323, 44360, 44397, 44436, 44516, 44555, 44603, 44668, 44720, 44761, 44811, 44857, 44902, 44910, 44945, 45028, 45073, 45109, 45173, 45228, 45254, 45288, 45371, 45416, 45451, 45515, 45570, 45596, 45631, 45666, 45701, 45738, 45777, 45828, 45834, 45899, 45943, 45977, 45985, 46021, 46057, 46093, 46129, 46205, 46235, 46269, 46303, 46337, 46371, 46444, 46470, 46504, 46577, 46603, 46638, 46710, 46774, 46818, 46844, 46880, 46953, 47017, 47072, 47098, 47133, 47168, 47203, 47240, 47279, 47330, 47336, 47400, 47444, 47478, 47486, 47522, 47558, 47594, 47630, 47705, 47735, 47768, 47801, 47834, 47867, 47937, 47963, 47996, 48066, 48092, 48126, 48160, 48194, 48228, 48298, 48336, 48371, 48406, 48441, 48476, 48546, 48601, 48637, 48673, 48709, 48745, 48815, 48853, 48890, 48927, 48964, 49001, 49071, 49126, 49162, 49198, 49234, 49270, 49340, 49379, 49416, 49453, 49490, 49527, 49597, 49647, 49683, 49719, 49755, 49791, 49861, 49899, 49936, 49973, 50010, 50047, 50117, 50172, 50208, 50244, 50280, 50316, 50386, 50425, 50462, 50499, 50536, 50573, 50643, 50693, 50730, 50767, 50804, 50841, 50874, 50951, 50964, 51037, 51101, 51162, 51208, 51234, 51242, 51279, 51316, 51353, 51390, 51423, 51500, 51513, 51586, 51650, 51724, 51799, 51878, 51939, 51985, 52011, 52019, 52055, 52091, 52127, 52163, 52243, 52269, 52305, 52341, 52377, 52413, 52493, 52519, 52554, 52589, 52656, 52736, 52762, 52839, 52874, 52909, 52979, 53018, 53053, 53088, 53158, 53197, 53232, 53267, 53337, 53376, 53411, 53446, 53516, 53555, 53590, 53625, 53695, 53732, 53768, 53804, 53874, 53913, 53949, 53985, 54055, 54094, 54130, 54166, 54236, 54275, 54310, 54345, 54415, 54453, 54489, 54525, 54595, 54634, 54669, 54704, 54771, 54851, 54877, 54915, 54953, 55020, 55046, 55084, 55122, 55189, 55215, 55250, 55285, 55320, 55357, 55396, 55422, 55428, 55510, 55540, 55589, 55597, 55633, 55671, 55738, 55777, 55803, 55857, 55926, 55934, 55970, 56006, 56088, 56124, 56160, 56227, 56291, 56326, 56361, 56428, 56508, 56534, 56570, 56608, 56675, 56714, 56787, 56834, 56880, 56888, 56924, 56960, 57042, 57078, 57114, 57196, 57231, 57266, 57333, 57413, 57439, 57478, 57517, 57584, 57610, 57649, 57688, 57755, 57781, 57817, 57853, 57889, 57925, 57991, 58036, 58071, 58106, 58141, 58176, 58241, 58286, 58322, 58358, 58394, 58430, 58496, 58541, 58576, 58611, 58646, 58681, 58746, 58791, 58828, 58865, 58902, 58939, 59020, 59084, 59120, 59156, 59192, 59230, 59280, 59299, 59326, 59379, 59431, 59483, 59535, 59591, 59599, 59678, 59714, 59766, 59832, 59895, 59936, 59944, 59978, 60012, 60046, 60080, 60129, 60161, 60196, 60235, 60307, 60353, 60399, 60407, 60443, 60479, 60515, 60553, 60592, 60664, 60710, 60756, 60764, 60800, 60836, 60872, 60908, 60974, 61019, 61055, 61091, 61127, 61163, 61229, 61274, 61311, 61348, 61385, 61422, 61488, 61550, 61587, 61624, 61661, 61698, 61764, 61820, 61856, 61892, 61928, 61964, 62030, 62075, 62111, 62147, 62183, 62219, 62285, 62330, 62367, 62404, 62441, 62478, 62544, 62606, 62643, 62680, 62717, 62754, 62820, 62876, 62912, 62948, 62984, 63020, 63100, 63126, 63162, 63198, 63234, 63270, 63350, 63376, 63411, 63446, 63481, 63516, 63595, 63621, 63657, 63693, 63729, 63767, 63806, 63878, 63924, 63970, 63978, 64013, 64048, 64083, 64118, 64199, 64235, 64301, 64346, 64402, 64410, 64447, 64513, 64538, 64575, 64631, 64639, 64672, 64750, 64776, 64810, 64869, 64925, 64961, 64997, 65033, 65069, 65135, 65180, 65216, 65252, 65288, 65324, 65390, 65435, 65470, 65505, 65540, 65575, 65657, 65693, 65729, 65765, 65801, 65837, 65873, 65909, 65947, 65997, 66016, 66043, 66079, 66131, 66167, 66220, 66256, 66309, 66345, 66398, 66454, 66462, 66541, 66577, 66629, 66653, 66661, 66695, 66729, 66765, 66844, 66880, 66932, 66996, 67041, 67049, 67084, 67119, 67154, 67191, 67241, 67260, 67287, 67339, 67390, 67441, 67492, 67548, 67556, 67635, 67671, 67723, 67747, 67755, 67789, 67823, 67857, 67891, 67970, 68003, 68038, 68073, 68108, 68143, 68203, 68259, 68295, 68331, 68367, 68403, 68483, 68562, 68621, 68686, 68751, 68807, 68833, 68870, 68907, 68944, 68981, 69046, 69101, 69127, 69161, 69195, 69229, 69263, 69342, 69375, 69410, 69445, 69480, 69515, 69575, 69631, 69667, 69703, 69739, 69777, 69827, 69846, 69873, 69925, 69978, 70031, 70084, 70140, 70148, 70227, 70263, 70315, 70339, 70347, 70381, 70415, 70449, 70483, 70562, 70595, 70630, 70665, 70700, 70735, 70795, 70851, 70887, 70923, 70959, 70997, 71047, 71066, 71093, 71145, 71198, 71251, 71304, 71360, 71368, 71447, 71483, 71535, 71559, 71567, 71602, 71637, 71672, 71707, 71786, 71812, 71848, 71884, 71920, 71956, 72016, 72072, 72107, 72142, 72177, 72212, 72277, 72341, 72375, 72454, 72480, 72515, 72575, 72631, 72671, 72724, 72785, 72793, 72801, 72808, 72814, 72897, 72937, 72957, 73000, 73043, 73085, 73124, 73168, 73174, 73251, 73328, 73371, 73404, 73469, 73475, 73542, 73618, 73647, 73654, 73660, 73730, 73763, 73842, 73864, 73879, 73903, 73936, 73987, 74022, 74075, 74110, 74163, 74200, 74255, 74293, 74349, 74386, 74441, 74476, 74529, 74571, 74631, 74671, 74729, 74769, 74827, 74868, 74927, 74968, 75027, 75067, 75125, 75165, 75223, 75263, 75321, 75361, 75419, 75460, 75519, 75561, 75621, 75662, 75721, 75763, 75823, 75856, 75889, 75922, 75955, 76012, 76020, 76027, 76033, 76117, 76157, 76177, 76220, 76261, 76304, 76346, 76390, 76396, 76473, 76550, 76593, 76626, 76691, 76697, 76764, 76770, 76847, 76876, 76883, 76889, 76956, 76989, 77068, 77090, 77105, 77129, 77162, 77195, 77228, 77261, 77319, 77327, 77334, 77340, 77405, 77486, 77571, 77586, 77647, 77694, 77767, 77773, 77816, 77822, 77870, 77910, 77930, 77938, 77944, 77963, 77970, 77976, 78047, 78055, 78139, 78219, 78304, 78386, 78404, 78440, 78508, 78528, 78567, 78606, 78646, 78652, 78687, 78711, 78717, 78748, 78787, 78835, 78909, 78941, 78949, 78955, 78972, 78979, 78985, 79040, 79065, 79084, 79119, 79138, 79175, 79194, 79214, 79221, 79227, 79285, 79333, 79352, 79372, 79379, 79385, 79462, 79479, 79487, 79536, 79620, 79695, 79713, 79797, 79880, 79912, 79959, 80040, 80095, 80160, 80193, 80254, 80293, 80313, 80349, 80378, 80403, 80409, 80467, 80491, 80497, 80567, 80590, 80644, 80705, 80780, 80806, 80830, 80836, 80904, 80980, 81025, 81071, 81088, 81094, 81114, 81120, 81150, 81165, 81189, 81203, 81232, 81245, 81260, 81289, 81302, 81317, 81346, 81359, 81374, 81435, 81459, 81467, 81473, 81547, 81613, 81619, 81669, 81698, 81768, 81774, 81795, 81833, 81850, 81905, 81977, 82057, 82088, 82129, 82135, 82167, 82173, 82228, 82272, 82319, 82389, 82416, 82457, 82465, 82486, 82494, 82500, 82524, 82531, 82537, 82590, 82598, 82678, 82763, 82771, 82852, 82918, 82997, 83048, 83056, 83077, 83135, 83182, 83218, 83241, 83270, 83303, 83346, 83382, 83409, 83455, 83461, 83491, 83515, 83521, 83562, 83619, 83647, 83653, 83717, 83797, 83820, 83846, 83877, 83901, 83909, 83915, 83985, 84063, 84094, 84121, 84127, 84201, 84230, 84278, 84302, 84310, 84318, 84324, 84397, 84421, 84458, 84489, 84495, 84516, 84531, 84537, 84554, 84578, 84586, 84592, 84612, 84662, 84724, 84731, 84737, 84806, 84892, 84925, 84942, 84970, 85031, 85054, 85060, 85085, 85128, 85148, 85192, 85198, 85277, 85333, 85399, 85427, 85435, 85454, 85461, 85467, 85521, 85529, 85570, 85593, 85629, 85637, 85719, 85778, 85842, 85878, 85905, 85946, 85952, 85979, 86017, 86038, 86060, 86073, 86081, 86089, 86095, 86179, 86189, 86196, 86202, 86257, 86265, 86327, 86335, 86415, 86452, 86475, 86502, 86559, 86580, 86612, 86648, 86656, 86738, 86798, 86834, 86861, 86902, 86908, 86926, 86944, 86987, 87026, 87032, 87113, 87161, 87217, 87247, 87321, 87351, 87362, 87386, 87392, 87472, 87520, 87580, 87610, 87688, 87718, 87729, 87753, 87759, 87827, 87834, 87840, 87895, 87903, 87964, 87972, 88052, 88089, 88112, 88141, 88198, 88219, 88251, 88289, 88297, 88379, 88439, 88475, 88502, 88543, 88549, 88567, 88585, 88628, 88667, 88673, 88753, 88801, 88857, 88887, 88965, 88995, 89006, 89030, 89036, 89115, 89163, 89223, 89253, 89335, 89365, 89376, 89400, 89406, 89474, 89481, 89487, 89541, 89549, 89635, 89656, 89664, 89743, 89780, 89803, 89830, 89887, 89908, 89940, 89976, 89984, 90066, 90126, 90162, 90189, 90230, 90236, 90254, 90272, 90315, 90354, 90360, 90443, 90507, 90563, 90593, 90667, 90697, 90708, 90732, 90738, 90820, 90884, 90944, 90974, 91052, 91082, 91093, 91117, 91123, 91190, 91197, 91203, 91257, 91265, 91348, 91372, 91380, 91459, 91496, 91523, 91556, 91629, 91650, 91690, 91736, 91744, 91826, 91886, 91922, 91949, 91990, 91996, 92042, 92060, 92078, 92121, 92160, 92166, 92249, 92313, 92376, 92406, 92491, 92521, 92532, 92556, 92562, 92644, 92708, 92775, 92805, 92890, 92900, 92930, 92941, 92965, 92971, 93038, 93045, 93051, 93106, 93114, 93192, 93200, 93280, 93318, 93341, 93368, 93425, 93446, 93483, 93524, 93532, 93614, 93674, 93710, 93737, 93778, 93784, 93802, 93820, 93863, 93925, 93964, 93970, 94026, 94056, 94130, 94160, 94171, 94195, 94201, 94255, 94285, 94357, 94387, 94398, 94422, 94428, 94496, 94503, 94509, 94564, 94572, 94649, 94657, 94737, 94775, 94798, 94827, 94884, 94905, 94942, 94985, 94993, 95075, 95135, 95171, 95198, 95239, 95245, 95263, 95281, 95324, 95386, 95425, 95431, 95487, 95517, 95595, 95625, 95636, 95660, 95666, 95720, 95750, 95826, 95856, 95867, 95891, 95897, 95965, 95972, 95978, 96018, 96026, 96107, 96188, 96271, 96352, 96437, 96522, 96558, 96585, 96604, 96623, 96687, 96743, 96775, 96807, 96827, 96882, 96888, 96935, 96966, 96994, 97000, 97042, 97068, 97125, 97151, 97159, 97165, 97248, 97259, 97322, 97328, 97392, 97398, 97438, 97469, 97500, 97530, 97567, 97595, 97632, 97643, 97725, 97731, 97806, 97871, 97932, 97972, 98011, 98045, 98117, 98188, 98195, 98201, 98284, 98316, 98383, 98416, 98481, 98520, 98526, 98561, 98585, 98591, 98646, 98682, 98688, 98733, 98779, 98785, 98856, 98880, 98940, 99004, 99026, 99099, 99120, 99193, 99214, 99286, 99307, 99379, 99400, 99473, 99494, 99567, 99588, 99659, 99680, 99744, 99751, 99757, 99815, 99852, 99866, 99896, 99908, 99922, 99945, 99960, 99980, 99997, 100012, 100032, 100048, 100092, 100098, 100166, 100226, 100264, 100319, 100363, 100431, 100499, 100525, 100551, 100578, 100584, 100655, 100737, 100755, 100761, 100786, 100815, 100844, 100875, 100906, 100912, 100966, 101027, 101082, 101149, 101155, 101175, 101231, 101295, 101332, 101401, 101407, 101427, 101483, 101547, 101584, 101590, 101629, 101690, 101723, 101742, 101761, 101780, 101800, 101806, 101873, 101892, 101899, 101905, 101973, 102047, 102061, 102092, 102104, 102118, 102143, 102159, 102174, 102194, 102211, 102226, 102246, 102262, 102305, 102311, 102379, 102439, 102477, 102532, 102576, 102644, 102712, 102738, 102764, 102791, 102797, 102868, 102950, 102968, 102974, 102999, 103028, 103057, 103088, 103119, 103125, 103176, 103218, 103259, 103279, 103285, 103305, 103361, 103425, 103462, 103531, 103537, 103557, 103613, 103677, 103714, 103720, 103759, 103820, 103853, 103872, 103891, 103910, 103930, 103936, 104003, 104022, 104029, 104035, 104080, 104088, 104123, 104134, 104164, 104186, 104194, 104279, 104364, 104448, 104505, 104542, 104610, 104648, 104695, 104742, 104791, 104797, 104820, 104844, 104882, 104949, 105028, 105099, 105105, 105170, 105178, 105184, 105266, 105281, 105332, 105389, 105425, 105431, 105513, 105595, 105603, 105609, 105676, 105693, 105700, 105706, 105751, 105759, 105794, 105805, 105835, 105864, 105872, 105957, 106037, 106110, 106167, 106204, 106210, 106278, 106325, 106372, 106425, 106463, 106469, 106490, 106572, 106585, 106660, 106666, 106745, 106827, 106835, 106841, 106908, 106925, 106932, 106938, 106985, 106993, 107039, 107050, 107088, 107128, 107187, 107224, 107292, 107330, 107377, 107427, 107476, 107523, 107574, 107631, 107667, 107673, 107735, 107752, 107770, 107799, 107855, 107876, 107896, 107914, 107932, 107938, 108005, 108022, 108029, 108035, 108082, 108090, 108127, 108138, 108176, 108216, 108275, 108312, 108318, 108386, 108424, 108471, 108521, 108570, 108617, 108692, 108698, 108760, 108777, 108795, 108824, 108880, 108901, 108921, 108939, 108957, 108963, 109030, 109047, 109054, 109060, 109124, 109132, 109153, 109213, 109224, 109266, 109317, 109367, 109402, 109451, 109459, 109487, 109547, 109558, 109601, 109643, 109694, 109739, 109774, 109823, 109889, 109961, 109986, 110054, 110092, 110139, 110193, 110245, 110299, 110305, 110355, 110404, 110445, 110520, 110589, 110662, 110690, 110719, 110747, 110779, 110794, 110837, 110851, 110874, 110907, 110938, 110976, 110989, 111003, 111026, 111059, 111090, 111128, 111141, 111155, 111178, 111211, 111242, 111280, 111293, 111307, 111330, 111363, 111394, 111432, 111445, 111453, 111459, 111477, 111535, 111597, 111614, 111639, 111705, 111727, 111735, 111741, 111791, 111824, 111888, 111944, 111967, 111995, 112021, 112029, 112035, 112105, 112167, 112225, 112250, 112275, 112313, 112319, 112381, 112399, 112447, 112501, 112523, 112540, 112565, 112583, 112598, 112647, 112702, 112724, 112749, 112767, 112775, 112781, 112847, 112932, 112968, 113032, 113117, 113133, 113199, 113223, 113277, 113299, 113321, 113360, 113366, 113433, 113450, 113457, 113463, 113508, 113516, 113548, 113559, 113585, 113633, 113663, 113720, 113757, 113825, 113863, 113910, 113957, 114009, 114064, 114102, 114154, 114209, 114247, 114253, 114316, 114379, 114398, 114416, 114445, 114525, 114531, 114598, 114615, 114622, 114628, 114673, 114681, 114713, 114724, 114750, 114798, 114828, 114885, 114922, 114928, 114996, 115034, 115081, 115128, 115204, 115280, 115286, 115349, 115412, 115431, 115449, 115478, 115558, 115564, 115631, 115648, 115655, 115661, 115737, 115755, 115763, 115809, 115820, 115851, 115876, 115884, 115965, 116047, 116062, 116125, 116162, 116168, 116236, 116274, 116321, 116368, 116431, 116469, 116475, 116554, 116623, 116670, 116708, 116788, 116842, 116873, 116932, 117005, 117011, 117090, 117115, 117189, 117252, 117269, 117287, 117316, 117332, 117340, 117414, 117432, 117450, 117469, 117515, 117521, 117549, 117566, 117573, 117579, 117664, 117672, 117719, 117730, 117755, 117782, 117790, 117864, 117938, 118017, 118054, 118132, 118154, 118217, 118254, 118260, 118328, 118366, 118413, 118419, 118498, 118567, 118614, 118652, 118732, 118786, 118817, 118823, 118882, 118937, 118943, 118975, 119054, 119111, 119144, 119150, 119175, 119249, 119332, 119348, 119356, 119362, 119429, 119435, 119463, 119480, 119487, 119493, 119538, 119546, 119595, 119603, 119683, 119717, 119725, 119808, 119880, 119954, 120030, 120108, 120185, 120193, 120216, 120224, 120269, 120280, 120305, 120335, 120371, 120379, 120415, 120423, 120468, 120479, 120504, 120534, 120561, 120597, 120633, 120673, 120709, 120717, 120753, 120761, 120806, 120817, 120843, 120873, 120913, 120951, 120959, 121043, 121113, 121182, 121250, 121323, 121356, 121420, 121449, 121477, 121483, 121562, 121645, 121658, 121664, 121727, 121791, 121797, 121835, 121882, 121929, 121935, 122003, 122081, 122122, 122191, 122232, 122252, 122309, 122381, 122387, 122448, 122509, 122574, 122642, 122671, 122677, 122706, 122768, 122842, 122921, 123000, 123061, 123082, 123104, 123122, 123183, 123205, 123227, 123245, 123266, 123274, 123280, 123301, 123380, 123440, 123460, 123481, 123502, 123510, 123516, 123599, 123605, 123633, 123650, 123657, 123663, 123709, 123717, 123775, 123783, 123862, 123907, 123915, 123998, 124070, 124144, 124220, 124298, 124377, 124402, 124410, 124433, 124441, 124487, 124498, 124527, 124559, 124584, 124592, 124625, 124633, 124679, 124690, 124719, 124752, 124789, 124815, 124823, 124856, 124864, 124910, 124921, 124950, 124983, 125019, 125047, 125084, 125120, 125185, 125214, 125242, 125248, 125327, 125410, 125423, 125429, 125492, 125556, 125562, 125600, 125647, 125694, 125700, 125768, 125809, 125878, 125919, 125939, 125996, 126072, 126078, 126156, 126185, 126191, 126263, 126284, 126352, 126426, 126434, 126440, 126499, 126560, 126600, 126660, 126672, 126749, 126818, 126824, 126853, 126915, 126976, 126996, 127014, 127072, 127094, 127117, 127125, 127131, 127159, 127176, 127183, 127189, 127237, 127245, 127279, 127290, 127311, 127341, 127400, 127437, 127505, 127567, 127623, 127679, 127717, 127723, 127756, 127822, 127894, 127900, 127930, 128009, 128028, 128070, 128076, 128143, 128160, 128167, 128173, 128221, 128229, 128263, 128274, 128295, 128325, 128384, 128421, 128489, 128551, 128607, 128663, 128701, 128707, 128740, 128806, 128878, 128884, 128914, 128993, 129012, 129054, 129060, 129127, 129144, 129151, 129374, 129417, 129526, 129606, 129635, 129657, 129762, 129791, 129896, 129960, 130024, 130053, 130128, 130157, 130182, 130235, 130343, 130428, 130533, 130713, 130742, 130772, 130797, 130822, 130849, 130901, 130989, 131098, 131129, 131180, 131210, 131270, 131331, 131363, 131521, 131624, 131709, 131770, 131796, 131824, 131853, 131921, 131952, 131985, 132064, 132176, 132236, 132303, 132381, 132410, 132436, 132510, 132539, 132607, 132688, 132740, 132770, 132875, 132988, 133056, 133161, 133196, 133235, 133274, 133311, 133363, 133394, 133527, 133551, 133589, 133622, 133687, 133792, 133819, 133884, 133915, 133939, 133963, 134024, 134053, 134105, 134133, 134185, 134218, 134243, 134293, 134316, 134346, 134380, 134403, 134429, 134452, 134478, 134501, 134561, 134590, 134595, 134700, 134813, 134838, 134884, 134965, 135001, 135075, 135180, 135222, 135312, 135405, 135434, 135539, 135568, 135597, 135637, 135662, 135767, 135837, 135942, 136036, 136141, 136246, 136275, 136314, 136365, 136434, 136502, 136525, 136613, 136642, 136664, 136775, 136832, 136861, 136905, 136950, 136977, 137008, 137037, 137069, 137117, 137148, 137215, 137244, 137349, 137374, 137397, 137466, 137508, 137531, 137603, 137712, 137737, 137803, 137828, 137899, 137926, 137967, 137998, 138066, 138171, 138212, 138243, 138591, 138648, 138753, 138867, 138932, 138984, 139021, 139050, 139081, 139134, 139163, 139228, 139333, 139362, 139424, 139526, 139631, 139660, 139770, 139814, 139843, 139891, 139927, 139952, 140010, 140041, 140050, 140139, 140168, 140284, 140313, 140399, 140430, 140544, 140604, 140709, 140738, 140812, 140872, 140922, 141002, 141031, 141131, 141160, 141231, 141297, 141329, 141353, 141485, 141585, 141839, 141944, 142038, 142111, 142181, 142209, 142233, 142263, 142287, 142322, 142360, 142390, 142495, 142524, 142552, 142583, 142607, 142680, 142795, 142855, 142960, 143033, 143053, 143081, 143131, 143159, 143192, 143220, 143330, 143431, 143492, 143582, 143622, 143651, 143694, 143799, 143856, 143894, 143958, 143987, 144061, 144107, 144137, 144184, 144282, 144311, 144350, 144465, 144491, 144527, 144660, 144697, 144764, 144793, 144848, 144869, 144897, 145119, 145179, 145206, 145236, 145261, 145339, 145364, 145458, 145490, 145542, 145572, 145637, 145673, 145703, 145727, 145974, 146070, 146113, 146210, 146260, 146352, 146451, 146502, 146564, 146697, 146719, 146758, 146804, 146835, 146893, 146998, 147027, 147060, 147114, 147143, 147282, 147308, 147354, 147383, 147488, 147519, 147554, 147665, 147695, 147768, 147802, 147833, 147896, 147937, 147966, 147994, 148017, 148062, 148167, 148195, 148224, 148253, 148325, 148430, 148507, 148548, 148601, 148650, 148673, 148742, 148810, 148830, 148856, 148881, 148902, 148977, 149003, 149057, 149105, 149133, 149228, 149293, 149317, 149357, 149397, 149420, 149474, 149523, 149585, 149618, 149647, 149769, 149793, 149862, 149886, 149946, 149975, 150145, 150260, 150339, 150472, 150532, 150561, 150596, 150695, 150724, 150780, 150932, 150976, 151006, 151048, 151104, 151148, 151178, 151200, 151244, 151273, 151327, 151356, 151414, 151443, 151512, 151629, 151664, 151734, 151839, 151868, 151896, 151942, 151971, 152018, 152116, 152145, 152250, 152279, 152348, 152429, 152448, 152471, 152481, 152530, 152561, 152584, 152627, 152683, 152724, 152799, 152913, 153018, 153152, 153178, 153203, 153297, 153333, 153360, 153420, 153449, 153484, 153522, 153547, 153566, 153614, 153715, 153766, 153789, 153849, 153900, 153926, 153994, 154021, 154044, 154095, 154164, 154224, 154253, 154279, 154318, 154405, 154434, 154455, 154507, 154620, 154637 ] }	{ "red_pajama_v2": { "ccnet_original_length": 154637, "ccnet_original_nlines": 3941, "rps_doc_curly_bracket": 0.002431500004604459, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.0898795872926712, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0727924332022667, "rps_doc_frac_lines_end_with_ellipsis": 0.011415529996156693, "rps_doc_frac_no_alph_words": 0.5143348574638367, "rps_doc_frac_unique_words": 0.3796241879463196, "rps_doc_mean_word_length": 6.5745744705200195, "rps_doc_num_sentences": 1418, "rps_doc_symbol_to_word_ratio": 0.0036410600878298283, "rps_doc_unigram_entropy": 7.353488922119141, "rps_doc_word_count": 17030, "rps_doc_frac_chars_dupe_10grams": 0.03947661817073822, "rps_doc_frac_chars_dupe_5grams": 0.13484570384025574, "rps_doc_frac_chars_dupe_6grams": 0.10428258776664734, "rps_doc_frac_chars_dupe_7grams": 0.08634840697050095, "rps_doc_frac_chars_dupe_8grams": 0.07037913799285889, "rps_doc_frac_chars_dupe_9grams": 0.04981914162635803, "rps_doc_frac_chars_top_2gram": 0.008708080276846886, "rps_doc_frac_chars_top_3gram": 0.005689280107617378, "rps_doc_frac_chars_top_4gram": 0.008395479992032051, "rps_doc_books_importance": -16924.875, "rps_doc_books_importance_length_correction": -16924.875, "rps_doc_openwebtext_importance": -8800.1865234375, "rps_doc_openwebtext_importance_length_correction": -8800.1865234375, "rps_doc_wikipedia_importance": -6239.83447265625, "rps_doc_wikipedia_importance_length_correction": -6239.83447265625 }, "fasttext": { "dclm": 0.5959136486053467, "english": 0.24030305445194244, "fineweb_edu_approx": 2.3537797927856445, "eai_general_math": 0.6130691170692444, "eai_open_web_math": 0.07946628332138062, "eai_web_code": 0.6272284984588623 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-9,182,161,104,492,527,000	Can I inject Database values into CSS Hi, I am working on a site in which I want to allow basic themeing based on the user logged in. Essentially I just want to store some image urls and colours in MongoDB and then have these values inserted into the correct places in my code. The image urls are fairly straight forward I think. However I also want a nice clean way of changing colours across the site. I will be setting up my css so there are theme classes in place on relevant elements so really I just want to change the style definitions to change the colour. E.g. .bgColour1 { background-color: red; } what I really want is: .bgColour1 { background-color: <VARFROMDB>; } Then throughout the site the bgColour class will reflect the user’s choice for bgColour1. Before Meteor I would have done this inside <style></style> tags in the head. I’ve looked at pre-processors like LESS and SASS but I don’t think they suit the “on the fly” nature of this exercise. Any help would be much appreciated. :+1: 1 Like You’ll be able to do this with CSS Variables once they’re supported in more browsers: https://developer.mozilla.org/en-US/docs/Web/CSS/Using_CSS_variables In the meantime you can programmatically insert <style> elements into the <head>, which will be interpreted on the fly. For instance something like this should work: var $style = $("<style type='text/css'></style>"); $style.text(`body { background-color: ${varFromDb};`); $("head").append($style); It would be interesting to make a package that makes this reactive and declarative! 2 Likes If you have a predefined set of styles, you can just define these in CSS and then apply the class names dynamically. Even if you’re doing lots of mix and matching, just break up the classes into small components and apply them piecemeal. eg: class=“redBg blueBorder whiteFont” If you’re creating urls or styles dynamically (for bg images and such), you can apply the styles inline and use handlebar variables that way. If you want them applied to your whole site, just apply them to container level elements. Thanks rahul That solution should do nicely. Will try it out! Surprising that Meteor does not support CSS manipulation out of the box since it parses all files anyway. pcm, yes the handlebars solution could work, it’s just I think it is easier to manage, if elements and containers are only styled via class references rather than inline styling. Which is why i’d rather modify the class definition! :grin: Thank you both for answering :star: Hm, you could use something like https://github.com/jsstyles/jss You could use SASS with https://www.grooveui.com GrooveUI allows on the fly modification of SASS variables. Hello You can use styled components for this. (If you use React) It is integrated into our router with SSR built in (not for data depending on user tho) You’d have to use the develop branch but I can help you with it.	{ "url": "https://forums.meteor.com/t/can-i-inject-database-values-into-css/18437", "source_domain": "forums.meteor.com", "snapshot_id": "crawl=CC-MAIN-2022-21", "warc_metadata": { "Content-Length": "32685", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BYRCSEYVEFHJBVYBCLSLV75LQPO4V5TM", "WARC-Concurrent-To": "<urn:uuid:c17f0346-6a7f-4204-a015-68d42ac4b970>", "WARC-Date": "2022-05-19T15:47:07Z", "WARC-IP-Address": "64.71.144.203", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AMZGT6HKWMQ3JODZMKZXH6SYFJJOA6SU", "WARC-Record-ID": "<urn:uuid:ee3e91df-0b6f-4253-97fd-14f9740228fa>", "WARC-Target-URI": "https://forums.meteor.com/t/can-i-inject-database-values-into-css/18437", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2cd8a983-d76f-4810-9cad-cbc19da3965a>" }, "warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-60\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 38, 39, 43, 44, 136, 137, 333, 334, 569, 570, 575, 576, 589, 615, 617, 618, 641, 642, 655, 689, 691, 692, 782, 783, 861, 862, 981, 982, 1018, 1019, 1024, 1025, 1032, 1033, 1188, 1189, 1355, 1356, 1407, 1462, 1488, 1489, 1573, 1574, 1582, 1583, 1821, 1822, 1861, 1862, 2094, 2095, 2108, 2109, 2158, 2159, 2265, 2266, 2505, 2506, 2542, 2543, 2608, 2609, 2658, 2659, 2718, 2719, 2725, 2726, 2785, 2786, 2874, 2875 ], "line_end_idx": [ 38, 39, 43, 44, 136, 137, 333, 334, 569, 570, 575, 576, 589, 615, 617, 618, 641, 642, 655, 689, 691, 692, 782, 783, 861, 862, 981, 982, 1018, 1019, 1024, 1025, 1032, 1033, 1188, 1189, 1355, 1356, 1407, 1462, 1488, 1489, 1573, 1574, 1582, 1583, 1821, 1822, 1861, 1862, 2094, 2095, 2108, 2109, 2158, 2159, 2265, 2266, 2505, 2506, 2542, 2543, 2608, 2609, 2658, 2659, 2718, 2719, 2725, 2726, 2785, 2786, 2874, 2875, 2939 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2939, "ccnet_original_nlines": 74, "rps_doc_curly_bracket": 0.0023817599285393953, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3888888955116272, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04285714030265808, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.19365079700946808, "rps_doc_frac_unique_words": 0.5159235596656799, "rps_doc_mean_word_length": 4.8428874015808105, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.119405746459961, "rps_doc_word_count": 471, "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.01052169967442751, "rps_doc_frac_chars_top_3gram": 0.007891279645264149, "rps_doc_frac_chars_top_4gram": 0.009644890204071999, "rps_doc_books_importance": -259.8742980957031, "rps_doc_books_importance_length_correction": -259.8742980957031, "rps_doc_openwebtext_importance": -134.7577362060547, "rps_doc_openwebtext_importance_length_correction": -134.7577362060547, "rps_doc_wikipedia_importance": -96.23381042480469, "rps_doc_wikipedia_importance_length_correction": -96.23381042480469 }, "fasttext": { "dclm": 0.06631922721862793, "english": 0.8858165144920349, "fineweb_edu_approx": 1.4513965845108032, "eai_general_math": 0.9194030165672302, "eai_open_web_math": 0.27026236057281494, "eai_web_code": 0.8358539342880249 } }	{ "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": "006.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Cognitive science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
8,887,329,794,645,112,000	About \| FAQ \| Help Ask Your Question 0 How does the "ensure" attribute from the "service" resource test if a service is running? asked 2016-06-09 16:35:10 -0500 tinatinatina gravatar image Just to give a bit of context. I'm working on a script to provision Mercurial. There is an init script with "start" and "stop" capabilities. I've written the following block to make sure the service is running. service { 'hg_serve': ensure => running, enable => true, } I'm running into an issue where this service tries to start itself every time the above resource runs. But of course after the initial provisioning, the port is already in use, so all subsequent provisioning fails because it tries to start a mercurial server on the same port. Isn't ensure supposed to just check its status, instead of starting it? I think the service provider is failing to recognize the status of this service and that's why it just tries to start it "to get the job done". I've been looking through the puppet source code but can't find where the checks for "ensure" is located. edit retag flag offensive close merge delete 2 Answers Sort by » oldest newest most voted 1 answered 2016-06-09 21:32:23 -0500 virtblackbelt gravatar image Have you tried, by hand, to see whether the service thinks it is running (as opposed to just the appropriate processes running). For example, RHEL "service hgserve status" or "systemctl status hgserve"? I've run across a couple of misbehaving applications that don't properly start and report status, so every time Puppet checked status it said it wasn't running and tried to start it. edit flag offensive delete link more Comments look into hasstatus => false, and the pattern param. More info in my full answer. DarylW gravatar imageDarylW ( 2016-06-09 21:54:23 -0500 )edit Dary, where is the full answer? it seems I met with same issue, I am using a command such as " ps -ef\|grep daemonname" as the status check. and I am sure it will return 0, but it seems the service status check does not use the return value 0/1 to decide whether to start/stop/restart service. jamwu2 gravatar imagejamwu2 ( 2018-05-09 06:20:47 -0500 )edit 1 answered 2016-06-09 21:57:41 -0500 DarylW gravatar image If your init script doesn't have a 'status' option, you have ways to tell the puppet service resource 'hasstatus => false, and you can give it further information about how to figure out status. run 'puppet describe service' to see info about param options. Specifically, this part of the output... Puppet 2.7 and newer expect init scripts to have a working status command. If this isn't the case for any of your services' init scripts, you will need to set `hasstatus` to false and possibly specify a custom status command in the `status` attribute. As a last resort, Puppet will attempt to search the process table by calling whatever command is listed in the `ps` fact. The default search pattern is the name of the service, but you can specify it with the `pattern` attribute. edit flag offensive delete link more Your Answer Please start posting anonymously - your entry will be published after you log in or create a new account. Add Answer Question Tools 1 follower Stats Asked: 2016-06-09 16:35:10 -0500 Seen: 214 times Last updated: Jun 09 '16	{ "url": "https://ask.puppet.com/question/26522/how-does-the-ensure-attribute-from-the-service-resource-test-if-a-service-is-running/", "source_domain": "ask.puppet.com", "snapshot_id": "crawl=CC-MAIN-2018-22", "warc_metadata": { "Content-Length": "73485", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:KNH6SAB65DPT46OC6ENQ63SGQZQYJHNY", "WARC-Concurrent-To": "<urn:uuid:db73888d-9fbf-4edc-9107-78f0b4a1116f>", "WARC-Date": "2018-05-21T10:32:40Z", "WARC-IP-Address": "138.197.54.145", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:MJE536TVT3UCPDVFJYBRARGJYUSIGYBF", "WARC-Record-ID": "<urn:uuid:ac6525af-f710-4347-bd51-d39892858f20>", "WARC-Target-URI": "https://ask.puppet.com/question/26522/how-does-the-ensure-attribute-from-the-service-resource-test-if-a-service-is-running/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:87f629b5-5c9f-4fa4-a28a-acd7dc190a56>" }, "warc_info": "robots: classic\r\nhostname: ip-10-143-78-161.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 19, 37, 39, 40, 130, 131, 163, 164, 192, 193, 224, 225, 273, 274, 336, 337, 407, 408, 432, 456, 477, 481, 482, 759, 760, 832, 833, 977, 978, 1084, 1085, 1130, 1131, 1141, 1142, 1177, 1179, 1180, 1215, 1216, 1245, 1246, 1632, 1633, 1670, 1671, 1680, 1681, 1763, 1764, 1826, 1827, 2120, 2121, 2183, 2185, 2186, 2221, 2222, 2244, 2245, 2503, 2504, 2545, 2546, 2621, 2693, 2763, 2839, 2914, 2987, 3028, 3065, 3066, 3078, 3079, 3185, 3186, 3197, 3198, 3213, 3214, 3225, 3226, 3232, 3233, 3266, 3267, 3283, 3284 ], "line_end_idx": [ 19, 37, 39, 40, 130, 131, 163, 164, 192, 193, 224, 225, 273, 274, 336, 337, 407, 408, 432, 456, 477, 481, 482, 759, 760, 832, 833, 977, 978, 1084, 1085, 1130, 1131, 1141, 1142, 1177, 1179, 1180, 1215, 1216, 1245, 1246, 1632, 1633, 1670, 1671, 1680, 1681, 1763, 1764, 1826, 1827, 2120, 2121, 2183, 2185, 2186, 2221, 2222, 2244, 2245, 2503, 2504, 2545, 2546, 2621, 2693, 2763, 2839, 2914, 2987, 3028, 3065, 3066, 3078, 3079, 3185, 3186, 3197, 3198, 3213, 3214, 3225, 3226, 3232, 3233, 3266, 3267, 3283, 3284, 3308 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3308, "ccnet_original_nlines": 90, "rps_doc_curly_bracket": 0.0006045899935998023, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3319559097290039, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015151520259678364, "rps_doc_frac_lines_end_with_ellipsis": 0.010989010334014893, "rps_doc_frac_no_alph_words": 0.27410468459129333, "rps_doc_frac_unique_words": 0.468634694814682, "rps_doc_mean_word_length": 4.702951908111572, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.0013774100225418806, "rps_doc_unigram_entropy": 5.096645355224609, "rps_doc_word_count": 542, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02432326041162014, "rps_doc_frac_chars_dupe_6grams": 0.02432326041162014, "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.023538639768958092, "rps_doc_frac_chars_top_3gram": 0.014123190194368362, "rps_doc_frac_chars_top_4gram": 0.018046289682388306, "rps_doc_books_importance": -350.3868103027344, "rps_doc_books_importance_length_correction": -350.3868103027344, "rps_doc_openwebtext_importance": -202.24908447265625, "rps_doc_openwebtext_importance_length_correction": -202.24908447265625, "rps_doc_wikipedia_importance": -131.0492706298828, "rps_doc_wikipedia_importance_length_correction": -131.0492706298828 }, "fasttext": { "dclm": 0.11674386262893677, "english": 0.9001171588897705, "fineweb_edu_approx": 1.3621304035186768, "eai_general_math": 0.19973492622375488, "eai_open_web_math": 0.07308679819107056, "eai_web_code": 0.04716796055436134 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "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,997,919,382,633,098,000	# SNMP::Info::Layer7::Neoteris # # Copyright (c) 2012 Eric Miller # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are met: # # * Redistributions of source code must retain the above copyright notice, # this list of conditions and the following disclaimer. # * Redistributions in binary form must reproduce the above copyright # notice, this list of conditions and the following disclaimer in the # documentation and/or other materials provided with the distribution. # * Neither the name of the University of California, Santa Cruz nor the # names of its contributors may be used to endorse or promote products # derived from this software without specific prior written permission. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE # LIABLE FOR # ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE # POSSIBILITY OF SUCH DAMAGE. package SNMP::Info::Layer7::Neoteris; use strict; use Exporter; use SNMP::Info::Layer7; @SNMP::Info::Layer7::Neoteris::ISA = qw/SNMP::Info::Layer7 Exporter/; @SNMP::Info::Layer7::Neoteris::EXPORT_OK = qw//; use vars qw/$VERSION %GLOBALS %MIBS %FUNCS %MUNGE/; $VERSION = '3.05'; %MIBS = ( %SNMP::Info::Layer7::MIBS, 'UCD-SNMP-MIB' => 'versionTag', 'JUNIPER-IVE-MIB' => 'productVersion', ); %GLOBALS = ( %SNMP::Info::Layer7::GLOBALS, 'os_ver' => 'productVersion', 'cpu' => 'iveCpuUtil', ); %FUNCS = ( %SNMP::Info::Layer7::FUNCS, ); %MUNGE = ( %SNMP::Info::Layer7::MUNGE, ); sub vendor { return 'juniper'; } sub os { return 'ive'; } sub serial { return ''; } 1; __END__ =head1 NAME SNMP::Info::Layer7::Neoteris - SNMP Interface to Juniper SSL VPN appliances =head1 AUTHORS Eric Miller =head1 SYNOPSIS # Let SNMP::Info determine the correct subclass for you. my $neoteris = new SNMP::Info( AutoSpecify => 1, Debug => 1, DestHost => 'myrouter', Community => 'public', Version => 2 ) or die "Can't connect to DestHost.\n"; my $class = $neoteris->class(); print "SNMP::Info determined this device to fall under subclass : $class\n"; =head1 DESCRIPTION Subclass for Juniper SSL VPN appliances =head2 Inherited Classes =over =item SNMP::Info::Layer7 =back =head2 Required MIBs =over =item F =item F =item Inherited Classes' MIBs See L for its own MIB requirements. =back =head1 GLOBALS These are methods that return scalar value from SNMP =over =item $neoteris->vendor() Returns 'juniper'. =item $neoteris->os() Returns C<'ive'>. =item $neoteris->os_ver() C =item $neoteris->cpu() C =item $neoteris->serial() Returns ''. =back =head2 Globals imported from SNMP::Info::Layer7 See documentation in L for details. =head1 TABLE ENTRIES These are methods that return tables of information in the form of a reference to a hash. =head2 Table Methods imported from SNMP::Info::Layer7 See documentation in L for details. =cut	{ "url": "http://cpansearch.perl.org/src/OLIVER/SNMP-Info-3.05/Info/Layer7/Neoteris.pm", "source_domain": "cpansearch.perl.org", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "4267", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JOQCFCDFNUCPZU7UVXUX5N66ODF72XTK", "WARC-Concurrent-To": "<urn:uuid:e1b81610-772a-45e4-8f1e-bba480b0a79f>", "WARC-Date": "2015-11-30T00:24:11Z", "WARC-IP-Address": "199.15.177.162", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:WS7LHYWLPT467363FBHPYOXC4I42VX6T", "WARC-Record-ID": "<urn:uuid:a73d883d-9dda-43e0-b98e-b630c8fcb766>", "WARC-Target-URI": "http://cpansearch.perl.org/src/OLIVER/SNMP-Info-3.05/Info/Layer7/Neoteris.pm", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:25123025-fa9d-415e-aa6e-1d4fd330964f>" }, "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 ], "line_end_idx": [ 3486 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3486, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0.0017211700323969126, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1320512741804123, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.2282051295042038, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.36538460850715637, "rps_doc_frac_unique_words": 0.5294117331504822, "rps_doc_mean_word_length": 5.875565528869629, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0.03846153989434242, "rps_doc_unigram_entropy": 5.126463413238525, "rps_doc_word_count": 442, "rps_doc_frac_chars_dupe_10grams": 0.05236811935901642, "rps_doc_frac_chars_dupe_5grams": 0.13246053457260132, "rps_doc_frac_chars_dupe_6grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_7grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_8grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_9grams": 0.09472467750310898, "rps_doc_frac_chars_top_2gram": 0.01386214978992939, "rps_doc_frac_chars_top_3gram": 0.013092029839754105, "rps_doc_frac_chars_top_4gram": 0.017712749540805817, "rps_doc_books_importance": -345.31951904296875, "rps_doc_books_importance_length_correction": -345.31951904296875, "rps_doc_openwebtext_importance": -177.024169921875, "rps_doc_openwebtext_importance_length_correction": -177.024169921875, "rps_doc_wikipedia_importance": -191.69219970703125, "rps_doc_wikipedia_importance_length_correction": -191.69219970703125 }, "fasttext": { "dclm": 0.0964694619178772, "english": 0.5849725604057312, "fineweb_edu_approx": 1.3186695575714111, "eai_general_math": 0.9035494923591614, "eai_open_web_math": 0.1757487654685974, "eai_web_code": 0.3940771818161011 } }	{ "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.072", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
8,713,105,656,225,758,000	import wx #---------------------------------------------------------------------- ID_CopyBtn = wx.NewId() ID_PasteBtn = wx.NewId() ID_BitmapBtn = wx.NewId() #---------------------------------------------------------------------- class ClipTextPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) self.log = log #self.SetFont(wx.Font(10, wx.SWISS, wx.NORMAL, wx.BOLD, False)) sizer = wx.BoxSizer(wx.VERTICAL) sizer.Add( wx.StaticText( self, -1, "Copy/Paste text to/from\n" "this window and other apps" ), 0, wx.EXPAND\|wx.ALL, 2 ) self.text = wx.TextCtrl(self, -1, "", style=wx.TE_MULTILINE\|wx.HSCROLL) sizer.Add(self.text, 1, wx.EXPAND) hsz = wx.BoxSizer(wx.HORIZONTAL) hsz.Add(wx.Button(self, ID_CopyBtn, " Copy "), 1, wx.EXPAND\|wx.ALL, 2) hsz.Add(wx.Button(self, ID_PasteBtn, " Paste "), 1, wx.EXPAND\|wx.ALL, 2) sizer.Add(hsz, 0, wx.EXPAND) sizer.Add( wx.Button(self, ID_BitmapBtn, " Copy Bitmap "), 0, wx.EXPAND\|wx.ALL, 2 ) self.Bind(wx.EVT_BUTTON, self.OnCopy, id=ID_CopyBtn) self.Bind(wx.EVT_BUTTON, self.OnPaste, id=ID_PasteBtn) self.Bind(wx.EVT_BUTTON, self.OnCopyBitmap, id=ID_BitmapBtn) self.SetAutoLayout(True) self.SetSizer(sizer) def OnCopy(self, evt): self.do = wx.TextDataObject() self.do.SetText(self.text.GetValue()) if wx.TheClipboard.Open(): wx.TheClipboard.SetData(self.do) wx.TheClipboard.Close() else: wx.MessageBox("Unable to open the clipboard", "Error") def OnPaste(self, evt): success = False do = wx.TextDataObject() if wx.TheClipboard.Open(): success = wx.TheClipboard.GetData(do) wx.TheClipboard.Close() if success: self.text.SetValue(do.GetText()) else: wx.MessageBox( "There is no data in the clipboard in the required format", "Error" ) def OnCopyBitmap(self, evt): dlg = wx.FileDialog(self, "Choose a bitmap to copy", wildcard="*.bmp") if dlg.ShowModal() == wx.ID_OK: bmp = wx.Bitmap(dlg.GetPath(), wx.BITMAP_TYPE_BMP) bmpdo = wx.BitmapDataObject(bmp) if wx.TheClipboard.Open(): wx.TheClipboard.SetData(bmpdo) wx.TheClipboard.Close() wx.MessageBox( "The bitmap is now in the Clipboard. Switch to a graphics\n" "editor and try pasting it in..." ) else: wx.MessageBox( "There is no data in the clipboard in the required format", "Error" ) dlg.Destroy() #---------------------------------------------------------------------- class OtherDropTarget(wx.PyDropTarget): def __init__(self, window, log): wx.PyDropTarget.__init__(self) self.log = log self.do = wx.FileDataObject() self.SetDataObject(self.do) def OnEnter(self, x, y, d): self.log.WriteText("OnEnter: %d, %d, %d\n" % (x, y, d)) return wx.DragCopy #def OnDragOver(self, x, y, d): # self.log.WriteText("OnDragOver: %d, %d, %d\n" % (x, y, d)) # return wx.DragCopy def OnLeave(self): self.log.WriteText("OnLeave\n") def OnDrop(self, x, y): self.log.WriteText("OnDrop: %d %d\n" % (x, y)) return True def OnData(self, x, y, d): self.log.WriteText("OnData: %d, %d, %d\n" % (x, y, d)) self.GetData() self.log.WriteText("%s\n" % self.do.GetFilenames()) return d class MyFileDropTarget(wx.FileDropTarget): def __init__(self, window, log): wx.FileDropTarget.__init__(self) self.window = window self.log = log def OnDropFiles(self, x, y, filenames): self.window.SetInsertionPointEnd() self.window.WriteText("\n%d file(s) dropped at %d,%d:\n" % (len(filenames), x, y)) for file in filenames: self.window.WriteText(file + '\n') class MyTextDropTarget(wx.TextDropTarget): def __init__(self, window, log): wx.TextDropTarget.__init__(self) self.window = window self.log = log def OnDropText(self, x, y, text): self.window.WriteText("(%d, %d)\n%s\n" % (x, y, text)) def OnDragOver(self, x, y, d): return wx.DragCopy class FileDropPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) #self.SetFont(wx.Font(10, wx.SWISS, wx.NORMAL, wx.BOLD, False)) sizer = wx.BoxSizer(wx.VERTICAL) sizer.Add( wx.StaticText(self, -1, " \nDrag some files here:"), 0, wx.EXPAND\|wx.ALL, 2 ) self.text = wx.TextCtrl( self, -1, "", style = wx.TE_MULTILINE\|wx.HSCROLL\|wx.TE_READONLY ) dt = MyFileDropTarget(self, log) self.text.SetDropTarget(dt) sizer.Add(self.text, 1, wx.EXPAND) sizer.Add( wx.StaticText(self, -1, " \nDrag some text here:"), 0, wx.EXPAND\|wx.ALL, 2 ) self.text2 = wx.TextCtrl( self, -1, "", style = wx.TE_MULTILINE\|wx.HSCROLL\|wx.TE_READONLY ) dt = MyTextDropTarget(self.text2, log) self.text2.SetDropTarget(dt) sizer.Add(self.text2, 1, wx.EXPAND) self.SetAutoLayout(True) self.SetSizer(sizer) def WriteText(self, text): self.text.WriteText(text) def SetInsertionPointEnd(self): self.text.SetInsertionPointEnd() #---------------------------------------------------------------------- #---------------------------------------------------------------------- class TestPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) self.SetAutoLayout(True) outsideSizer = wx.BoxSizer(wx.VERTICAL) msg = "Clipboard / Drag-And-Drop" text = wx.StaticText(self, -1, "", style=wx.ALIGN_CENTRE) text.SetFont(wx.Font(24, wx.SWISS, wx.NORMAL, wx.BOLD, False)) text.SetLabel(msg) w,h = text.GetTextExtent(msg) text.SetSize(wx.Size(w,h+1)) text.SetForegroundColour(wx.BLUE) outsideSizer.Add(text, 0, wx.EXPAND\|wx.ALL, 5) outsideSizer.Add(wx.StaticLine(self, -1), 0, wx.EXPAND) inSizer = wx.BoxSizer(wx.HORIZONTAL) inSizer.Add(ClipTextPanel(self, log), 1, wx.EXPAND) inSizer.Add(FileDropPanel(self, log), 1, wx.EXPAND) outsideSizer.Add(inSizer, 1, wx.EXPAND) self.SetSizer(outsideSizer) #---------------------------------------------------------------------- def runTest(frame, nb, log): win = TestPanel(nb, log) return win #---------------------------------------------------------------------- overview = """\ This demo shows some examples of data transfer through clipboard or drag and drop. In wxWindows, these two ways to transfer data (either between different applications or inside one and the same) are very similar which allows to implement both of them using almost the same code - or, in other words, if you implement drag and drop support for your application, you get clipboard support for free and vice versa. At the heart of both clipboard and drag and drop operations lies the wxDataObject class. The objects of this class (or, to be precise, classes derived from it) represent the data which is being carried by the mouse during drag and drop operation or copied to or pasted from the clipboard. wxDataObject is a "smart" piece of data because it knows which formats it supports (see GetFormatCount and GetAllFormats) and knows how to render itself in any of them (see GetDataHere). It can also receive its value from the outside in a format it supports if it implements the SetData method. Please see the documentation of this class for more details. Both clipboard and drag and drop operations have two sides: the source and target, the data provider and the data receiver. These which may be in the same application and even the same window when, for example, you drag some text from one position to another in a word processor. Let us describe what each of them should do. """ if __name__ == '__main__': import sys,os import run run.main(['', os.path.basename(sys.argv[0])] + sys.argv[1:])	{ "url": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/wx/wxPython-r218/wxPython/demo/DragAndDrop.py", "source_domain": "fossies.org", "snapshot_id": "crawl=CC-MAIN-2016-44", "warc_metadata": { "Content-Length": "9322", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OA3ELFNYXYEAZYK52JJ563VS7DZEEALM", "WARC-Concurrent-To": "<urn:uuid:6e1a24b8-81fd-401b-b09b-fed2a6198866>", "WARC-Date": "2016-10-24T10:42:10Z", "WARC-IP-Address": "138.201.17.217", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:ETMSTKNHPJTE25DLWCOEZTNVWQWIOBL5", "WARC-Record-ID": "<urn:uuid:90e0d7e2-1810-48ed-aad3-af743f15c268>", "WARC-Target-URI": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/wx/wxPython-r218/wxPython/demo/DragAndDrop.py", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b6fafe1f-0132-49e3-b985-285a1d562be0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 6061, 6062, 6707, 6708 ], "line_end_idx": [ 6061, 6062, 6707, 6708, 7149 ] }	{ "red_pajama_v2": { "ccnet_original_length": 7149, "ccnet_original_nlines": 4, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19034995138645172, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02704136073589325, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4549310803413391, "rps_doc_frac_unique_words": 0.44412606954574585, "rps_doc_mean_word_length": 6.944126129150391, "rps_doc_num_sentences": 235, "rps_doc_symbol_to_word_ratio": 0.0068928999826312065, "rps_doc_unigram_entropy": 5.253512382507324, "rps_doc_word_count": 698, "rps_doc_frac_chars_dupe_10grams": 0.02764596976339817, "rps_doc_frac_chars_dupe_5grams": 0.17165257036685944, "rps_doc_frac_chars_dupe_6grams": 0.13637301325798035, "rps_doc_frac_chars_dupe_7grams": 0.111821748316288, "rps_doc_frac_chars_dupe_8grams": 0.07055910676717758, "rps_doc_frac_chars_dupe_9grams": 0.03837424889206886, "rps_doc_frac_chars_top_2gram": 0.0053641400299966335, "rps_doc_frac_chars_top_3gram": 0.004332580137997866, "rps_doc_frac_chars_top_4gram": 0.004126260057091713, "rps_doc_books_importance": -476.74908447265625, "rps_doc_books_importance_length_correction": -476.74908447265625, "rps_doc_openwebtext_importance": -157.65892028808594, "rps_doc_openwebtext_importance_length_correction": -157.65892028808594, "rps_doc_wikipedia_importance": -130.7601776123047, "rps_doc_wikipedia_importance_length_correction": -130.7601776123047 }, "fasttext": { "dclm": 0.9135609269142151, "english": 0.4036865234375, "fineweb_edu_approx": 3.0543460845947266, "eai_general_math": 0.9808907508850098, "eai_open_web_math": 0.1575501561164856, "eai_web_code": 0.9482624530792236 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
4,100,606,007,212,807,000	Previous: , Up: Miscellaneous [Contents][Index] 7.8.3 How to check for software updates The GnuPG Project operates a server to query the current versions of software packages related to GnuPG. GPGME can be used to access this online database and check whether a new version of a software package is available. Data type: gpgme_query_swdb_result_t SINCE: 1.8.0 This is a pointer to a structure used to store the result of a gpgme_op_query_swdb operation. After success full call to that function, you can retrieve the pointer to the result with gpgme_op_query_swdb_result. The structure contains the following member: name This is the name of the package. iversion The currently installed version or an empty string. This value is either a copy of the argument given to gpgme_op_query_swdb or the version of the installed software as figured out by GPGME or GnuPG. created This gives the date the file with the list of version numbers has originally be created by the GnuPG project. retrieved This gives the date the file was downloaded. warning If this flag is set either an error has occurred or some of the information in this structure are not properly set. For example if the version number of the installed software could not be figured out, the update flag may not reflect a required update status. update If this flag is set an update of the software is available. urgent If this flag is set an available update is important. noinfo If this flag is set, no valid information could be retrieved. unknown If this flag is set the given name is not known. tooold If this flag is set the available information is not fresh enough. error If this flag is set some other error has occurred. version The version string of the latest released version. reldate The release date of the latest released version. Function: gpgme_error_t gpgme_op_query_swdb (gpgme_ctx_t ctx, const char name, const char iversion, gpgme_data_t reserved) SINCE: 1.8.0 Query the software version database for software package name and check against the installed version given by iversion. If iversion is given as NULL a check is only done if GPGME can figure out the version by itself (for example when using "gpgme" or "gnupg"). If NULL is used for name the current gpgme version is checked. reserved must be set to 0. Function: gpgme_query_swdb_result_t gpgme_op_query_swdb_result (gpgme_ctx_t ctx) SINCE: 1.8.0 The function gpgme_op_query_swdb_result returns a gpgme_query_swdb_result_t pointer to a structure holding the result of a gpgme_op_query_swdb operation. The pointer is only valid if the last operation on the context was a successful call to gpgme_op_query_swdb. If that call failed, the result might be a NULL pointer. The returned pointer is only valid until the next operation is started on the context ctx. Here is an example on how to check whether GnuPG is current: #include <gpgme.h> int main (void) { gpg_error_t err; gpgme_ctx_t ctx; gpgme_query_swdb_result_t result; gpgme_check_version (NULL); err = gpgme_new (&ctx); if (err) fprintf (stderr, "error creating context: %s\n", gpg_strerror (err)); else { gpgme_set_protocol (ctx, GPGME_PROTOCOL_GPGCONF); err = gpgme_op_query_swdb (ctx, "gnupg", NULL, 0); if (err) fprintf (stderr, "error querying swdb: %s\n", gpg_strerror (err)); else { result = gpgme_op_query_swdb_result (ctx); if (!result) fprintf (stderr, "error querying swdb\n"); if (!result->warning && !result->update) printf ("GnuPG version %s is current\n", result->iversion); else if (!result->warning && result->update) printf ("GnuPG version %s can be updated to %s\n", result->iversion, result->version); else fprintf (stderr, "error finding the update status\n"); } gpgme_release (ctx); } return 0; } Previous: , Up: Miscellaneous [Contents][Index]	{ "url": "https://www.gnupg.org/documentation/manuals/gpgme/Checking-for-updates.html", "source_domain": "www.gnupg.org", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "9706", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5H45G3FZHXHARI5NGNT4VPEJUM75WVEF", "WARC-Concurrent-To": "<urn:uuid:291f87da-a415-4a64-83d1-38cb348f583a>", "WARC-Date": "2018-02-22T07:10:05Z", "WARC-IP-Address": "217.69.76.60", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PZQJIHWDPJBECUNHT7JJ43SWSML4MGYX", "WARC-Record-ID": "<urn:uuid:5002f0c1-ed94-4da0-8378-b1eeec449dc3>", "WARC-Target-URI": "https://www.gnupg.org/documentation/manuals/gpgme/Checking-for-updates.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d008f59d-1492-48fb-9a3e-f894c6f9ffd0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-90-19.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 50, 51, 52, 92, 93, 315, 316, 353, 354, 367, 368, 625, 626, 631, 632, 665, 666, 675, 676, 876, 877, 885, 886, 996, 997, 1007, 1008, 1053, 1054, 1062, 1063, 1323, 1324, 1331, 1332, 1392, 1393, 1400, 1401, 1455, 1456, 1463, 1464, 1526, 1527, 1535, 1536, 1585, 1586, 1593, 1594, 1661, 1662, 1668, 1669, 1720, 1721, 1729, 1730, 1781, 1782, 1790, 1791, 1840, 1841, 1966, 1967, 1980, 1981, 2333, 2334, 2415, 2416, 2429, 2430, 2841, 2842, 2903, 2904, 2923, 2924, 2928, 2940, 2942, 2961, 2980, 3016, 3017, 3047, 3073, 3084, 3158, 3165, 3171, 3227, 3228, 3285, 3300, 3375, 3386, 3396, 3449, 3472, 3527, 3578, 3631, 3670, 3725, 3788, 3844, 3859, 3926, 3936, 3963, 3969, 3981, 3983, 3984 ], "line_end_idx": [ 50, 51, 52, 92, 93, 315, 316, 353, 354, 367, 368, 625, 626, 631, 632, 665, 666, 675, 676, 876, 877, 885, 886, 996, 997, 1007, 1008, 1053, 1054, 1062, 1063, 1323, 1324, 1331, 1332, 1392, 1393, 1400, 1401, 1455, 1456, 1463, 1464, 1526, 1527, 1535, 1536, 1585, 1586, 1593, 1594, 1661, 1662, 1668, 1669, 1720, 1721, 1729, 1730, 1781, 1782, 1790, 1791, 1840, 1841, 1966, 1967, 1980, 1981, 2333, 2334, 2415, 2416, 2429, 2430, 2841, 2842, 2903, 2904, 2923, 2924, 2928, 2940, 2942, 2961, 2980, 3016, 3017, 3047, 3073, 3084, 3158, 3165, 3171, 3227, 3228, 3285, 3300, 3375, 3386, 3396, 3449, 3472, 3527, 3578, 3631, 3670, 3725, 3788, 3844, 3859, 3926, 3936, 3963, 3969, 3981, 3983, 3984, 4033 ] }	{ "red_pajama_v2": { "ccnet_original_length": 4033, "ccnet_original_nlines": 118, "rps_doc_curly_bracket": 0.001487729954533279, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.32536521553993225, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015936249867081642, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24302789568901062, "rps_doc_frac_unique_words": 0.33511584997177124, "rps_doc_mean_word_length": 5.190731048583984, "rps_doc_num_sentences": 41, "rps_doc_symbol_to_word_ratio": 0.0013280200073495507, "rps_doc_unigram_entropy": 4.694985389709473, "rps_doc_word_count": 561, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.14594779908657074, "rps_doc_frac_chars_dupe_6grams": 0.09684065729379654, "rps_doc_frac_chars_dupe_7grams": 0.031593408435583115, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013736260123550892, "rps_doc_frac_chars_top_3gram": 0.024038460105657578, "rps_doc_frac_chars_top_4gram": 0.028846150264143944, "rps_doc_books_importance": -313.87969970703125, "rps_doc_books_importance_length_correction": -313.87969970703125, "rps_doc_openwebtext_importance": -123.6434555053711, "rps_doc_openwebtext_importance_length_correction": -123.6434555053711, "rps_doc_wikipedia_importance": -123.96527099609375, "rps_doc_wikipedia_importance_length_correction": -123.96527099609375 }, "fasttext": { "dclm": 0.2867956757545471, "english": 0.7473256587982178, "fineweb_edu_approx": 1.9204301834106445, "eai_general_math": 0.7327438592910767, "eai_open_web_math": 0.09150440245866776, "eai_web_code": 0.9331973195075989 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
3,896,505,089,982,429,700	I noticed the new javascript parser. Impressive! I don't know who the author is, but I wanted to signal a minor issue: tables require closing pipe to be recognized. Instead they're optional in Creole. -- [[Michele Tomaiuolo]], 2007-02-28 From what I've read on Meatball about InfiniteMonkey, I guess that it's an effort for the meatball successor. It has very interesting plans, by the way. -- [[Radomir Dopieralski]], 2007-Mar-01 ----------------- moved from [[Talk]]: == Converting Markup -> 2007-Apr-14 I'm not sure where to put this, so I'll mention it here. So far we have focussed on making Creole easy for the users to write in and relatively easy to parse (mainly convert from Creole to HTML and other markups). But there is also a second aspect, one that also is an indication of how clear and well defined the language is: the possibility and ease of converting to Creole from various popular markups. This will be needed to migrate wikis. It will be needed for wiki engines that use WYSIWYG editors. It's also a good test on how well defined and streamlined the markup is. Note that this doesn't mean that Creole should have all features that HTML offers, of course. -- [[Radomir Dopieralski]], 2007-Apr-14 Escape characters will help there (see [[Nyctergatis]] sandbox with Creole output). -- [[YvesPiguet]], 2007-Apr-14 Not if they use "heuristics" or come together with insane markup -- then you'd have to escape practically every "hot" character, making the result totally unreadable for humans. -- [[Radomir Dopieralski]], 2007-Apr-14 That's definitively //not// what I want. NME could probably be smarter for its Creole output, but using nowiki instead of escape char is //much// worse. -- [[YvesPiguet]], 2007-4-14 ----------------- ==Can't add engines to locked pages...== Maybe you'll add it for me, and change the page text to give an alternative path for adding new engines in future. [Virtuoso Universal Server\|http://virtuoso.openlinksw.com/wiki/main/Main/VOSIndex] powers the [OpenLink Data Spaces\|http://virtuoso.openlinksw.com/wiki/main/Main/OdsIndex], among which you will find the [ODS Wiki\|http://virtuoso.openlinksw.com/dataspace/dav/wiki/Main/OdsWiki]. I think the latter would be the engine by your definitions, but that may be open to discussion.... -- [[MacTed]], 2008-Mar-18	{ "url": "http://wikicreole.org/wiki/Talk.Engines?version=4&skin=raw", "source_domain": "wikicreole.org", "snapshot_id": "crawl=CC-MAIN-2019-26", "warc_metadata": { "Content-Length": "2657", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MXSYXQEHDCQGVZZZIMKN7QMJO34PUJW7", "WARC-Concurrent-To": "<urn:uuid:dd6316e7-fb53-4fd0-bee1-d2234c29caca>", "WARC-Date": "2019-06-20T10:17:17Z", "WARC-IP-Address": "5.45.108.145", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AMJMJQFJPLMARBG3U3LX3F2UOIAB6SYZ", "WARC-Record-ID": "<urn:uuid:0e97496c-387a-4557-8727-5da5df730cf2>", "WARC-Target-URI": "http://wikicreole.org/wiki/Talk.Engines?version=4&skin=raw", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3814701e-780f-4f08-a547-265a9183fc66>" }, "warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-166-244-242.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 49, 50, 202, 203, 240, 241, 394, 395, 435, 436, 437, 455, 476, 512, 513, 1193, 1194, 1234, 1235, 1320, 1321, 1352, 1353, 1531, 1532, 1572, 1573, 1726, 1727, 1756, 1757, 1775, 1776, 1817, 1818, 2312, 2313 ], "line_end_idx": [ 49, 50, 202, 203, 240, 241, 394, 395, 435, 436, 437, 455, 476, 512, 513, 1193, 1194, 1234, 1235, 1320, 1321, 1352, 1353, 1531, 1532, 1572, 1573, 1726, 1727, 1756, 1757, 1775, 1776, 1817, 1818, 2312, 2313, 2339 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2339, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3358924984931946, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026871399953961372, "rps_doc_frac_lines_end_with_ellipsis": 0.02631578966975212, "rps_doc_frac_no_alph_words": 0.29558542370796204, "rps_doc_frac_unique_words": 0.6114457845687866, "rps_doc_mean_word_length": 5.25602388381958, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.003838770091533661, "rps_doc_unigram_entropy": 5.024541854858398, "rps_doc_word_count": 332, "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.030945559963583946, "rps_doc_frac_chars_top_3gram": 0.013753579929471016, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -273.28302001953125, "rps_doc_books_importance_length_correction": -273.28302001953125, "rps_doc_openwebtext_importance": -154.8933868408203, "rps_doc_openwebtext_importance_length_correction": -154.8933868408203, "rps_doc_wikipedia_importance": -140.39227294921875, "rps_doc_wikipedia_importance_length_correction": -140.39227294921875 }, "fasttext": { "dclm": 0.057844821363687515, "english": 0.8602020144462585, "fineweb_edu_approx": 1.519604206085205, "eai_general_math": 0.9285677075386047, "eai_open_web_math": 0.6445693969726562, "eai_web_code": 0.8343625664710999 } }	{ "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "5", "label": "Social/Forum" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-643,153,227,952,296,400	Компьютеры и Internet. Базы данных. Oracle 9i: Перевод с английского.. увеличить В этой книге рассматриваются основные инструментальные средства разработки Oracle, предназначенные для новой версии базы данных Oracle9i (версия 9.0), но она, безусловно, может также применяться для изучения версий Oracle8 и 8i. В примерах данной книги представлены различные аспекты разработки приложений в среде Oracle, но основной акцент сделан на разработке Web-приложений.Книга предназначена в основном для начинающих пользователей, но в ней приведено много советов и рекомендаций, которые будут интересны и для разработчиков среднего уровня.	{ "url": "https://rosreestr-office.ru/kompyutery-i-internet-bazy-dannyh-oracle-9i-perevod-s-anglijskogo/", "source_domain": "rosreestr-office.ru", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "51249", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CGIBMVWTIM3KL44KDENWLZUPXILY4RED", "WARC-Concurrent-To": "<urn:uuid:8bca95df-ba43-4b61-9546-c21aceb758a7>", "WARC-Date": "2024-03-04T12:14:01Z", "WARC-IP-Address": "38.242.209.8", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VE2Z5O2JHJKXAZZCFTLGRPKUYE6R2NFG", "WARC-Record-ID": "<urn:uuid:6b329d81-b148-4efb-93b6-244d17717803>", "WARC-Target-URI": "https://rosreestr-office.ru/kompyutery-i-internet-bazy-dannyh-oracle-9i-perevod-s-anglijskogo/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e6ef0881-5e20-40ca-9b01-3db52e75aa29>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-169\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, 71, 72, 82, 83 ], "line_end_idx": [ 71, 72, 82, 83, 630 ] }	{ "red_pajama_v2": { "ccnet_original_length": 630, "ccnet_original_nlines": 4, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.019607840105891228, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.9117646813392639, "rps_doc_frac_unique_words": 0.792682945728302, "rps_doc_mean_word_length": 6.5731706619262695, "rps_doc_num_sentences": 7, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.042230129241943, "rps_doc_word_count": 82, "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.0371057502925396, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -37.13412094116211, "rps_doc_books_importance_length_correction": -48.85175704956055, "rps_doc_openwebtext_importance": -24.485595703125, "rps_doc_openwebtext_importance_length_correction": -36.20323181152344, "rps_doc_wikipedia_importance": -17.815031051635742, "rps_doc_wikipedia_importance_length_correction": -29.53266716003418 }, "fasttext": { "dclm": 0.9232672452926636, "english": 0.00003020999974978622, "fineweb_edu_approx": 1.907341480255127, "eai_general_math": -0.000009890000001178123, "eai_open_web_math": 0.11256200075149536, "eai_web_code": 0.7917876243591309 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.75", "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-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": "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": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
3,697,877,358,810,306,000	to top Android APIs SearchViewActionBar.java ← Back The file containing the source code shown below is located in the corresponding directory in <sdk>/samples/android-<version>/... /* * Copyright (C) 2010 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. / package com.example.android.apis.view; import com.example.android.apis.R; import android.app.Activity; import android.app.SearchManager; import android.app.SearchableInfo; import android.content.Context; import android.os.Bundle; import android.view.Menu; import android.view.MenuInflater; import android.view.MenuItem; import android.view.View; import android.view.Window; import android.view.MenuItem.OnActionExpandListener; import android.widget.Button; import android.widget.SearchView; import android.widget.TextView; import java.util.List; /* * This demonstrates the usage of SearchView in an ActionBar as a menu item. * It sets a SearchableInfo on the SearchView for suggestions and submitting queries to. */ public class SearchViewActionBar extends Activity implements SearchView.OnQueryTextListener { private SearchView mSearchView; private TextView mStatusView; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); getWindow().requestFeature(Window.FEATURE_ACTION_BAR); setContentView(R.layout.searchview_actionbar); mStatusView = (TextView) findViewById(R.id.status_text); } @Override public boolean onCreateOptionsMenu(Menu menu) { super.onCreateOptionsMenu(menu); MenuInflater inflater = getMenuInflater(); inflater.inflate(R.menu.searchview_in_menu, menu); MenuItem searchItem = menu.findItem(R.id.action_search); mSearchView = (SearchView) searchItem.getActionView(); setupSearchView(searchItem); return true; } private void setupSearchView(MenuItem searchItem) { if (isAlwaysExpanded()) { mSearchView.setIconifiedByDefault(false); } else { searchItem.setShowAsActionFlags(MenuItem.SHOW_AS_ACTION_IF_ROOM \| MenuItem.SHOW_AS_ACTION_COLLAPSE_ACTION_VIEW); } SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE); if (searchManager != null) { List<SearchableInfo> searchables = searchManager.getSearchablesInGlobalSearch(); // Try to use the "applications" global search provider SearchableInfo info = searchManager.getSearchableInfo(getComponentName()); for (SearchableInfo inf : searchables) { if (inf.getSuggestAuthority() != null && inf.getSuggestAuthority().startsWith("applications")) { info = inf; } } mSearchView.setSearchableInfo(info); } mSearchView.setOnQueryTextListener(this); } public boolean onQueryTextChange(String newText) { mStatusView.setText("Query = " + newText); return false; } public boolean onQueryTextSubmit(String query) { mStatusView.setText("Query = " + query + " : submitted"); return false; } public boolean onClose() { mStatusView.setText("Closed!"); return false; } protected boolean isAlwaysExpanded() { return false; } }	{ "url": "https://tool.oschina.net/uploads/apidocs/android/resources/samples/ApiDemos/src/com/example/android/apis/view/SearchViewActionBar.html", "source_domain": "tool.oschina.net", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "15865", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:22TBAEMCW5RKLMH6SVDTEM2PERXV2S2N", "WARC-Concurrent-To": "<urn:uuid:420fc91f-4b33-47c0-8c7e-dae5ff38a691>", "WARC-Date": "2024-03-03T12:33:40Z", "WARC-IP-Address": "180.76.198.147", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DMB5YP2XGJQIWZGW6TWWPUM2RYGJHWJC", "WARC-Record-ID": "<urn:uuid:f63f6f51-779a-4ca6-b073-f698fb26b018>", "WARC-Target-URI": "https://tool.oschina.net/uploads/apidocs/android/resources/samples/ApiDemos/src/com/example/android/apis/view/SearchViewActionBar.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6fae0a33-0c1d-41ed-a00c-b100dab2ce30>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-126\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, 7, 20, 22, 23, 48, 49, 56, 57, 186, 187, 190, 244, 247, 314, 382, 425, 428, 479, 482, 553, 622, 698, 769, 803, 807, 808, 847, 848, 883, 884, 913, 947, 982, 1014, 1040, 1066, 1100, 1130, 1156, 1184, 1237, 1267, 1301, 1333, 1334, 1357, 1358, 1362, 1439, 1528, 1532, 1626, 1627, 1663, 1697, 1698, 1712, 1769, 1813, 1876, 1877, 1932, 1933, 1998, 2004, 2005, 2019, 2071, 2112, 2113, 2164, 2223, 2288, 2351, 2388, 2389, 2410, 2416, 2417, 2473, 2474, 2508, 2562, 2579, 2655, 2724, 2734, 2735, 2831, 2868, 2961, 2962, 3030, 3117, 3170, 3224, 3307, 3339, 3357, 3371, 3420, 3430, 3431, 3481, 3487, 3488, 3543, 3594, 3616, 3622, 3623, 3676, 3742, 3764, 3770, 3771, 3802, 3842, 3864, 3870, 3871, 3914, 3936, 3942 ], "line_end_idx": [ 7, 20, 22, 23, 48, 49, 56, 57, 186, 187, 190, 244, 247, 314, 382, 425, 428, 479, 482, 553, 622, 698, 769, 803, 807, 808, 847, 848, 883, 884, 913, 947, 982, 1014, 1040, 1066, 1100, 1130, 1156, 1184, 1237, 1267, 1301, 1333, 1334, 1357, 1358, 1362, 1439, 1528, 1532, 1626, 1627, 1663, 1697, 1698, 1712, 1769, 1813, 1876, 1877, 1932, 1933, 1998, 2004, 2005, 2019, 2071, 2112, 2113, 2164, 2223, 2288, 2351, 2388, 2389, 2410, 2416, 2417, 2473, 2474, 2508, 2562, 2579, 2655, 2724, 2734, 2735, 2831, 2868, 2961, 2962, 3030, 3117, 3170, 3224, 3307, 3339, 3357, 3371, 3420, 3430, 3431, 3481, 3487, 3488, 3543, 3594, 3616, 3622, 3623, 3676, 3742, 3764, 3770, 3771, 3802, 3842, 3864, 3870, 3871, 3914, 3936, 3942, 3943 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3943, "ccnet_original_nlines": 124, "rps_doc_curly_bracket": 0.0065939598716795444, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.10381679236888885, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03206107020378113, "rps_doc_frac_lines_end_with_ellipsis": 0.00800000037997961, "rps_doc_frac_no_alph_words": 0.41374045610427856, "rps_doc_frac_unique_words": 0.6126760840415955, "rps_doc_mean_word_length": 9.630281448364258, "rps_doc_num_sentences": 85, "rps_doc_symbol_to_word_ratio": 0.0015267200069501996, "rps_doc_unigram_entropy": 4.862490653991699, "rps_doc_word_count": 284, "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.021937839686870575, "rps_doc_frac_chars_top_3gram": 0.009506399743258953, "rps_doc_frac_chars_top_4gram": 0.011700180359184742, "rps_doc_books_importance": -341.2099609375, "rps_doc_books_importance_length_correction": -341.2099609375, "rps_doc_openwebtext_importance": -209.6385040283203, "rps_doc_openwebtext_importance_length_correction": -209.6385040283203, "rps_doc_wikipedia_importance": -161.19093322753906, "rps_doc_wikipedia_importance_length_correction": -161.19093322753906 }, "fasttext": { "dclm": 0.9740697145462036, "english": 0.3467411696910858, "fineweb_edu_approx": 1.6388399600982666, "eai_general_math": 0.8287901878356934, "eai_open_web_math": 0.08528625965118408, "eai_web_code": 0.6657308340072632 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "-1", "label": "Abstain" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "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": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
7,903,426,027,024,591,000	Class: Stupidedi::Schema::LoopDef Inherits: AbstractDef show all Includes: Inspect Defined in: lib/stupidedi/schema/loop_def.rb Overview See Also: • 2.2.2 Loops • B.1.3.12.4 Loops of Data Segments Instance Attribute Summary collapse Constructors collapse Instance Method Summary collapse Methods included from Inspect #inspect Methods inherited from AbstractDef #component?, #composite?, #definition?, #element?, #functional_group?, #interchange?, #repeated?, #segment?, #simple?, #table?, #transaction_set?, #usage? Constructor Details #initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent) ⇒ LoopDef Returns a new instance of LoopDef 37 38 39 40 41 42 43 44 45 46 47 48 # File 'lib/stupidedi/schema/loop_def.rb', line 37 def initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent) @id, @repeat_count, @header_segment_uses, @loop_defs, @trailer_segment_uses, @parent = id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent # Delay re-parenting until the entire definition tree has a root # to prevent unnecessarily copying objects unless parent.nil? @header_segment_uses = @header_segment_uses.map{\|x\| x.copy(:parent => self) } @loop_defs = @loop_defs.map{\|x\| x.copy(:parent => self) } @trailer_segment_uses = @trailer_segment_uses.map{\|x\| x.copy(:parent => self) } end end Instance Attribute Details #header_segment_usesArray<SegmentUse> (readonly) Returns: 22 23 24 # File 'lib/stupidedi/schema/loop_def.rb', line 22 def header_segment_uses @header_segment_uses end #idString (readonly) Returns: • (String) 16 17 18 # File 'lib/stupidedi/schema/loop_def.rb', line 16 def id @id end #loop_defsArray<LoopDef> (readonly) Returns: 28 29 30 # File 'lib/stupidedi/schema/loop_def.rb', line 28 def loop_defs @loop_defs end #parentLoopDef, TableDef (readonly) Returns: 31 32 33 # File 'lib/stupidedi/schema/loop_def.rb', line 31 def parent @parent end #repeat_countRepeatCount (readonly) Returns: 19 20 21 # File 'lib/stupidedi/schema/loop_def.rb', line 19 def repeat_count @repeat_count end #trailer_segment_usesArray<SegmentUse> (readonly) Returns: 25 26 27 # File 'lib/stupidedi/schema/loop_def.rb', line 25 def trailer_segment_uses @trailer_segment_uses end Class Method Details .build(id, repeat_count, children) ⇒ LoopDef Returns: 136 137 138 139 140 141 142 143 144 145 146 147 148 149 # File 'lib/stupidedi/schema/loop_def.rb', line 136 def build(id, repeat_count, children) header, children = children.split_when{\|x\| x.is_a?(LoopDef) } loop_defs, trailer = children.split_when{\|x\| x.is_a?(SegmentUse) } # @todo: Ensure there is at least one SegmentUse in header if header.empty? raise Exceptions::InvalidSchemaError, "first child must be a SegmentUse" elsif header.head.repeat_count.include?(2) "first child must have RepeatCount.bounded(1)" end new(id, repeat_count, header, loop_defs, trailer, nil) end Instance Method Details #bounded?Boolean Returns: • (Boolean) See Also: • B.1.1.3.11.1 Loop Control Segments • B.1.1.3.12.4 Loops of Data Segments Bounded Loops 67 68 69 70 # File 'lib/stupidedi/schema/loop_def.rb', line 67 def bounded? @header_segment_uses.head.definition.id == :LS and @trailer_segment_uses.last.definition.id == :LE end #childrenArray<SegmentUse, LoopDef> Returns: 83 84 85 # File 'lib/stupidedi/schema/loop_def.rb', line 83 def children @header_segment_uses + @loop_defs + @trailer_segment_uses end #code_listsAbstractSet<CodeList> Returns: 97 98 99 # File 'lib/stupidedi/schema/loop_def.rb', line 97 def code_lists children.map(&:code_lists).inject(&:\|) end #copy(changes = {}) ⇒ LoopDef Returns: 51 52 53 54 55 56 57 58 59 # File 'lib/stupidedi/schema/loop_def.rb', line 51 def copy(changes = {}) LoopDef.new \ changes.fetch(:id, @id), changes.fetch(:repeat_count, @repeat_count), changes.fetch(:header_segment_uses, @header_segment_uses), changes.fetch(:loop_defs, @loop_defs), changes.fetch(:trailer_segment_uses, @trailer_segment_uses), changes.fetch(:parent, @parent) end #emptyLoopVal Returns: • (LoopVal) 88 89 90 # File 'lib/stupidedi/schema/loop_def.rb', line 88 def empty Values::LoopVal.new(self, []) end #entry_segment_useSegmentUse Returns: 78 79 80 # File 'lib/stupidedi/schema/loop_def.rb', line 78 def entry_segment_use @header_segment_uses.head end #hierarchical?Boolean Returns: • (Boolean) See Also: • 5.6 HL-initiated Loop 73 74 75 # File 'lib/stupidedi/schema/loop_def.rb', line 73 def hierarchical? @header_segment_uses.head.definition.id == :HL end #loop?Boolean Returns: • (Boolean) 92 93 94 # File 'lib/stupidedi/schema/loop_def.rb', line 92 def loop? true end #pretty_print(q) This method returns an undefined value. 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 # File 'lib/stupidedi/schema/loop_def.rb', line 102 def pretty_print(q) q.text("LoopDef[#{@id}]") q.group(2, "(", ")") do q.breakable "" @header_segment_uses.each do \|e\| unless q.current_group.first? q.text "," q.breakable end q.pp e end @loop_defs.each do \|e\| unless q.current_group.first? q.text "," q.breakable end q.pp e end @trailer_segment_uses.each do \|e\| unless q.current_group.first? q.text "," q.breakable end q.pp e end end end #repeatable?Boolean Returns: • (Boolean) 61 62 63 # File 'lib/stupidedi/schema/loop_def.rb', line 61 def repeatable? @repeat_count.try{\|r\| r.include?(2) } end	{ "url": "http://www.rubydoc.info/github/kputnam/stupidedi/Stupidedi/Schema/LoopDef", "source_domain": "www.rubydoc.info", "snapshot_id": "crawl=CC-MAIN-2016-22", "warc_metadata": { "Content-Length": "58293", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VANY6LY3V6MB23R6ADG4RK6JHXDYKO4R", "WARC-Concurrent-To": "<urn:uuid:13a4e56b-9e87-4a01-822d-903921132f17>", "WARC-Date": "2016-05-28T07:57:25Z", "WARC-IP-Address": "173.255.227.96", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:24IGK62XOR7F4LOZTIIJG37YI7COUJHO", "WARC-Record-ID": "<urn:uuid:67d5c432-722a-41f3-b9d7-e1936ff2cacd>", "WARC-Target-URI": "http://www.rubydoc.info/github/kputnam/stupidedi/Stupidedi/Schema/LoopDef", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bef956af-88a9-4c90-b59b-7639b62c0b48>" }, "warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 34, 35, 45, 66, 76, 84, 96, 129, 130, 139, 140, 150, 151, 167, 205, 206, 242, 243, 265, 266, 299, 300, 330, 331, 340, 341, 376, 377, 532, 533, 553, 554, 656, 657, 691, 692, 693, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 781, 782, 877, 966, 1049, 1050, 1117, 1162, 1183, 1266, 1339, 1423, 1429, 1433, 1434, 1461, 1462, 1511, 1512, 1521, 1522, 1523, 1524, 1527, 1530, 1533, 1584, 1585, 1609, 1632, 1636, 1637, 1658, 1659, 1668, 1669, 1682, 1683, 1684, 1687, 1690, 1693, 1744, 1745, 1752, 1758, 1762, 1763, 1799, 1800, 1809, 1810, 1811, 1812, 1815, 1818, 1821, 1872, 1873, 1887, 1900, 1904, 1905, 1941, 1942, 1951, 1952, 1953, 1954, 1957, 1960, 1963, 2014, 2015, 2026, 2036, 2040, 2041, 2077, 2078, 2087, 2088, 2089, 2090, 2093, 2096, 2099, 2150, 2151, 2168, 2184, 2188, 2189, 2239, 2240, 2249, 2250, 2251, 2252, 2255, 2258, 2261, 2312, 2313, 2338, 2362, 2366, 2367, 2388, 2389, 2435, 2436, 2445, 2446, 2447, 2448, 2452, 2456, 2460, 2464, 2468, 2472, 2476, 2480, 2484, 2488, 2492, 2496, 2500, 2504, 2556, 2557, 2596, 2662, 2731, 2732, 2793, 2812, 2854, 2895, 2940, 2991, 2997, 2998, 3055, 3059, 3060, 3084, 3085, 3102, 3103, 3112, 3113, 3127, 3128, 3138, 3139, 3178, 3232, 3233, 3234, 3237, 3240, 3243, 3246, 3297, 3298, 3311, 3364, 3414, 3418, 3419, 3455, 3456, 3465, 3466, 3467, 3468, 3471, 3474, 3477, 3528, 3529, 3542, 3602, 3606, 3607, 3640, 3641, 3650, 3651, 3652, 3653, 3656, 3659, 3662, 3713, 3714, 3729, 3770, 3774, 3775, 3805, 3806, 3815, 3816, 3817, 3818, 3821, 3824, 3827, 3830, 3833, 3836, 3839, 3842, 3845, 3896, 3897, 3920, 3936, 3965, 4014, 4077, 4120, 4185, 4221, 4225, 4226, 4240, 4241, 4250, 4251, 4265, 4266, 4267, 4270, 4273, 4276, 4327, 4328, 4338, 4370, 4374, 4375, 4404, 4405, 4414, 4415, 4416, 4417, 4420, 4423, 4426, 4477, 4478, 4500, 4528, 4532, 4533, 4555, 4556, 4565, 4566, 4580, 4581, 4591, 4592, 4618, 4619, 4620, 4623, 4626, 4629, 4680, 4681, 4699, 4748, 4752, 4753, 4767, 4768, 4777, 4778, 4792, 4793, 4794, 4797, 4800, 4803, 4854, 4855, 4865, 4872, 4876, 4877, 4894, 4895, 4935, 4936, 4937, 4938, 4942, 4946, 4950, 4954, 4958, 4962, 4966, 4970, 4974, 4978, 4982, 4986, 4990, 4994, 4998, 5002, 5006, 5010, 5014, 5018, 5022, 5026, 5030, 5034, 5038, 5042, 5046, 5098, 5099, 5119, 5147, 5173, 5192, 5229, 5265, 5284, 5304, 5314, 5327, 5335, 5362, 5398, 5417, 5437, 5447, 5460, 5468, 5506, 5542, 5561, 5581, 5591, 5604, 5612, 5618, 5622, 5623, 5643, 5644, 5653, 5654, 5668, 5669, 5670, 5673, 5676, 5679, 5730, 5731, 5747, 5787 ], "line_end_idx": [ 34, 35, 45, 66, 76, 84, 96, 129, 130, 139, 140, 150, 151, 167, 205, 206, 242, 243, 265, 266, 299, 300, 330, 331, 340, 341, 376, 377, 532, 533, 553, 554, 656, 657, 691, 692, 693, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 781, 782, 877, 966, 1049, 1050, 1117, 1162, 1183, 1266, 1339, 1423, 1429, 1433, 1434, 1461, 1462, 1511, 1512, 1521, 1522, 1523, 1524, 1527, 1530, 1533, 1584, 1585, 1609, 1632, 1636, 1637, 1658, 1659, 1668, 1669, 1682, 1683, 1684, 1687, 1690, 1693, 1744, 1745, 1752, 1758, 1762, 1763, 1799, 1800, 1809, 1810, 1811, 1812, 1815, 1818, 1821, 1872, 1873, 1887, 1900, 1904, 1905, 1941, 1942, 1951, 1952, 1953, 1954, 1957, 1960, 1963, 2014, 2015, 2026, 2036, 2040, 2041, 2077, 2078, 2087, 2088, 2089, 2090, 2093, 2096, 2099, 2150, 2151, 2168, 2184, 2188, 2189, 2239, 2240, 2249, 2250, 2251, 2252, 2255, 2258, 2261, 2312, 2313, 2338, 2362, 2366, 2367, 2388, 2389, 2435, 2436, 2445, 2446, 2447, 2448, 2452, 2456, 2460, 2464, 2468, 2472, 2476, 2480, 2484, 2488, 2492, 2496, 2500, 2504, 2556, 2557, 2596, 2662, 2731, 2732, 2793, 2812, 2854, 2895, 2940, 2991, 2997, 2998, 3055, 3059, 3060, 3084, 3085, 3102, 3103, 3112, 3113, 3127, 3128, 3138, 3139, 3178, 3232, 3233, 3234, 3237, 3240, 3243, 3246, 3297, 3298, 3311, 3364, 3414, 3418, 3419, 3455, 3456, 3465, 3466, 3467, 3468, 3471, 3474, 3477, 3528, 3529, 3542, 3602, 3606, 3607, 3640, 3641, 3650, 3651, 3652, 3653, 3656, 3659, 3662, 3713, 3714, 3729, 3770, 3774, 3775, 3805, 3806, 3815, 3816, 3817, 3818, 3821, 3824, 3827, 3830, 3833, 3836, 3839, 3842, 3845, 3896, 3897, 3920, 3936, 3965, 4014, 4077, 4120, 4185, 4221, 4225, 4226, 4240, 4241, 4250, 4251, 4265, 4266, 4267, 4270, 4273, 4276, 4327, 4328, 4338, 4370, 4374, 4375, 4404, 4405, 4414, 4415, 4416, 4417, 4420, 4423, 4426, 4477, 4478, 4500, 4528, 4532, 4533, 4555, 4556, 4565, 4566, 4580, 4581, 4591, 4592, 4618, 4619, 4620, 4623, 4626, 4629, 4680, 4681, 4699, 4748, 4752, 4753, 4767, 4768, 4777, 4778, 4792, 4793, 4794, 4797, 4800, 4803, 4854, 4855, 4865, 4872, 4876, 4877, 4894, 4895, 4935, 4936, 4937, 4938, 4942, 4946, 4950, 4954, 4958, 4962, 4966, 4970, 4974, 4978, 4982, 4986, 4990, 4994, 4998, 5002, 5006, 5010, 5014, 5018, 5022, 5026, 5030, 5034, 5038, 5042, 5046, 5098, 5099, 5119, 5147, 5173, 5192, 5229, 5265, 5284, 5304, 5314, 5327, 5335, 5362, 5398, 5417, 5437, 5447, 5460, 5468, 5506, 5542, 5561, 5581, 5591, 5604, 5612, 5618, 5622, 5623, 5643, 5644, 5653, 5654, 5668, 5669, 5670, 5673, 5676, 5679, 5730, 5731, 5747, 5787, 5790 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5790, "ccnet_original_nlines": 423, "rps_doc_curly_bracket": 0.0031088099349290133, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.07668232172727585, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.005477310158312321, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5297339558601379, "rps_doc_frac_unique_words": 0.5017856955528259, "rps_doc_mean_word_length": 7.189285755157471, "rps_doc_num_sentences": 127, "rps_doc_symbol_to_word_ratio": 0.04068858176469803, "rps_doc_unigram_entropy": 5.1192169189453125, "rps_doc_word_count": 560, "rps_doc_frac_chars_dupe_10grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_5grams": 0.11674118041992188, "rps_doc_frac_chars_dupe_6grams": 0.11674118041992188, "rps_doc_frac_chars_dupe_7grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_8grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_9grams": 0.08445107191801071, "rps_doc_frac_chars_top_2gram": 0.13859911262989044, "rps_doc_frac_chars_top_3gram": 0.15648286044597626, "rps_doc_frac_chars_top_4gram": 0.053651269525289536, "rps_doc_books_importance": -503.99285888671875, "rps_doc_books_importance_length_correction": -503.99285888671875, "rps_doc_openwebtext_importance": -308.4957275390625, "rps_doc_openwebtext_importance_length_correction": -308.4957275390625, "rps_doc_wikipedia_importance": -266.1270446777344, "rps_doc_wikipedia_importance_length_correction": -266.1270446777344 }, "fasttext": { "dclm": 0.06765515357255936, "english": 0.44610467553138733, "fineweb_edu_approx": 2.3152780532836914, "eai_general_math": 0.6658350825309753, "eai_open_web_math": 0.2058066725730896, "eai_web_code": 0.35691434144973755 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-6,414,317,273,701,722,000	Results See more... Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking (How-To) Jailbreaking your iPhone, iPad and iPod touch opens up your iDevices to a whole slew of possibilities that are otherwise not possible with Apple's default operating system. However, before you can ever hope to jailbreak, you have to ensure that you fulfill the necessary requirements like the supported devices and firmware versions. That is to say that jailbreaking isn't always an option. Take for example the iOS 6 jailbreak, it is currently limited only to older devices. However, there are iOS tweaks that don't require a jailbreak. For those who are rocking devices with no jailbreak, here are some Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking. iOS Tweaks You Can Do Right Now Without Jailbreaking Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking Check Your iPhone's Actual Signal Strength Check Actual Signal Strength iPhone Let's face it, the default signal strength indicator on the iPhone isn't exactly the most accurate. Should you feel that your iPhone's signal strength indicator just doesn't cut it, you can perform the steps below to have the signal strength displayed in numbers [in decibels(dBm)] instead of bars. This is applicable for an iPhone running iOS 4.1 or later. 1. Launch your device's Phone app. 2. Dial these: 3001#12345# 3. Then tap the Call button. This will cause your iPhone to enter in Field Test mode. You should notice that your signal strength indicator is displayed in numbers instead of the traditional signal bar. At this point, you can toggle between both signal strength mode by just tapping on it. If you want to the tweak to be permanent (but still reversible), then proceed with the next step. 4. Hold down the power button until you can see the Slide to Power Off button. 5. Let go of the Power button and press the Home button until the Field Test quits and you're back to the Home screen. The lower the number displayed, the stronger the signal. To return to the default signal bars, just dial 3001#12345# again then tap call. Then just press the Home button twice to return to the default signal bar. Hide Stock iOS Apps Without Jailbreaking Hide-Stock-iOS-Apps If you find yourself annoyed by stock iOS apps cluttering your Springboard, there is a trick that will allow you to hide stock iOS apps without jailbreaking. You can do this via two web-based solutions which are both simple to perform. You are not actually deleting the app but instead you are hiding it temporarily. Rebooting your iPhone will cause the hidden apps to reappear. For a detailed tutorial on how to hide stock apps without jailbreaking, just click here. Use Siri to Ask Directions Via Google Maps Use Siri to Ask Directions Via Google Maps Now that Google Maps is back in iOS, users now have a solid alternative to Apple's iOS 6 Maps. While jailbreak users can easily make Google Maps the default mapping application on their iPhone, everyone else simply doesn't have that option yet unfortunately. This is one of the downsides of being inside the walled garden of iOS. However, there is a way for you to use Siri to get directions with Google Maps and of course, you won't need a jailbreak for this. The trick is actually pretty simple. Apple has actually included a little feature in Siri that will enable you to open an address using any third-party mapping application. Whenever you use Siri, you simply need to add “via transit” at the end of your voice command query. For example, you can say “Give me directions to the Empire State Building via transit” and this should have Siri open other mapping apps installed in your device or download from the iTunes App Store. Just tap Google Maps or any other map app of your choice for the required directions. This is a simple trick that makes your iPhone think that you require public transit directions, which iOS 6 Maps doesn't have. So you will be referred to a different map app. Just ensure that you toggle through car or walking depending on your needs. Tether Your iPhone's Data Connection Tether Your iPhone's Data Connection For the uninitiated, tethering allows you to connect to the internet using your laptop or other devices through your smartphone's data plan. In most cases, some carriers can provide tethering services to their clients but usually it would take additional charges. For a jailbreak user, he has numerous options when it comes to tethering jailbreak apps. However, there is a service that will let you tether your iPhone wirelessly without exorbitant fees, fancy hacking skills, or jailbreaking required. There is a web app called Tether.com that offers tethering services to iPhone owners. So you can take advantage of your iPhone's data plan for tethering just as long as you have cellular coverage. Basically, what you need to do is simply download the Tether app for your computer and visit tether.com/web on your iPhone. Then on your computer using the Tether app, you will setup an ad hoc network. The process is pretty straightforward and can be a little tricky in the beginning. To get a better idea about how the service works, check out the video below: Tether works just as advertised, although there is one minor catch. Tether is NOT free. In order to use the service, you will need to pay an annual fee of $29.95. Still, $30 is nothing next to the usual $20 fee you pay your carrier monthly for tethering privileges. This is especially a good deal for those who can't jailbreak their iPhones. Create Custom Vibrations for Your Contacts Create Custom Vibrations for Your Contacts Some features in iOS are not exactly marketed properly by Apple so some of them just earn the designation of being "hidden features." One such feature is the ability to create contact-specific custom vibrations. To access this feature, you will simply need to navigate to Settings > General > Accessibility > Custom Vibrations and enable the option. Then just go to your Phone app select a contact > Edit > vibration > Create New Vibration. Here you can easily create custom vibrations for that particular contact. Hide Newsstand Without Jailbreaking Hide Newsstand Without Jailbreaking Newsstand is an app that most people don't really care for. However for some reason, you won't be able to uninstall it or even just put it in a folder so it gets out of your sight. Well, here's an easy and fast solution to hide Newsstand using a Mac (Windows version coming soon). You will simply need to download Filippo Bigarella’s StifleStand. Just follow the steps below: 1. Download StifleStand (Mac only). 2. Launch StifleStand and plug your iOS device running iOS 5 or higher. 3. Wait until StifleStand detects your device. 4. Look for the Newsstand folder on your device. 5. Click the Hide Newsstand button in StifleStand. 6. You should see that the Newsstand app will disappear and a folder named Magic will take its place. This folder behaves just like a normal folder which means that you can move, rename, or fill it with additional apps. If you wish to restore Newsstand, just open the folder, go into Wiggle Mode and drag the Newsstand icon outside the folder. Again, this tweak is for Mac users only. And there you have it, some of the most noteworthy iOS tweaks that you can do without jailbreaking your device. These may not be the most elegant solutions for a particular problem but they're certainly better than nothing. This is especially true if jailbreaking is not an option. Got other iOS tweaks that require no jailbreak to share? Contact Us for News Tips, Corrections and Feedback Related posts 5 comments Leave a message... • KitchenKnives5 years, 2 months ago I used another method to put Newsstand into a folder. Does this one still crash the springboard if you try to open it? • KitchenKnives5 years, 2 months ago I used another method of putting Newsstand into a folder, does this one still crash the springboard if you try to open it? • Patrick Gumban5 years, 1 month ago I believe that such bug is present when you try to open the Newsstand folder. Feel free to share your method. :) • Mike5 years, 2 months ago How do you change the AT&T to Tim? • Patrick Gumban5 years, 1 month ago You can use a jailbreak tweak like ChangeCarrier or Zeppelin to customize the carrier name on your iPhone. Hope this helps!	{ "url": "http://jaxov.com/2012/12/ios-tweaks-without-jailbreaking/", "source_domain": "jaxov.com", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "48401", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BLX6H547SIJC7SORMJJAFTRHYXATUZSS", "WARC-Concurrent-To": "<urn:uuid:cf804f30-ccd9-4a5a-9fcc-5e80e9d8c550>", "WARC-Date": "2018-02-21T15:20:11Z", "WARC-IP-Address": "209.58.137.71", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:ESDTDEZ732VH474ESPKDQCUZHMD5I37A", "WARC-Record-ID": "<urn:uuid:3eddbf1c-1247-436f-997e-b19f417419d5>", "WARC-Target-URI": "http://jaxov.com/2012/12/ios-tweaks-without-jailbreaking/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:fef61099-773b-477b-a8dd-b8572b4be1b9>" }, "warc_info": "robots: classic\r\nhostname: ip-10-184-2-158.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 8, 9, 21, 22, 92, 93, 760, 761, 814, 815, 876, 877, 920, 921, 957, 958, 1316, 1317, 1354, 1385, 1775, 1856, 1977, 1978, 2193, 2194, 2235, 2236, 2256, 2257, 2725, 2726, 2769, 2770, 2813, 2814, 3312, 3313, 3836, 3837, 4088, 4089, 4126, 4127, 4164, 4165, 4667, 4668, 5227, 5228, 5570, 5571, 5614, 5615, 5658, 5659, 6174, 6175, 6211, 6212, 6248, 6249, 6625, 6626, 6664, 6738, 6787, 6838, 6891, 6995, 6996, 7279, 7280, 7562, 7563, 7620, 7621, 7672, 7673, 7687, 7688, 7699, 7718, 7719, 7725, 7764, 7765, 7888, 7889, 7895, 7934, 7935, 8062, 8063, 8071, 8112, 8113, 8232, 8233, 8239, 8269, 8270, 8310, 8311, 8319, 8360, 8361 ], "line_end_idx": [ 8, 9, 21, 22, 92, 93, 760, 761, 814, 815, 876, 877, 920, 921, 957, 958, 1316, 1317, 1354, 1385, 1775, 1856, 1977, 1978, 2193, 2194, 2235, 2236, 2256, 2257, 2725, 2726, 2769, 2770, 2813, 2814, 3312, 3313, 3836, 3837, 4088, 4089, 4126, 4127, 4164, 4165, 4667, 4668, 5227, 5228, 5570, 5571, 5614, 5615, 5658, 5659, 6174, 6175, 6211, 6212, 6248, 6249, 6625, 6626, 6664, 6738, 6787, 6838, 6891, 6995, 6996, 7279, 7280, 7562, 7563, 7620, 7621, 7672, 7673, 7687, 7688, 7699, 7718, 7719, 7725, 7764, 7765, 7888, 7889, 7895, 7934, 7935, 8062, 8063, 8071, 8112, 8113, 8232, 8233, 8239, 8269, 8270, 8310, 8311, 8319, 8360, 8361, 8490 ] }	{ "red_pajama_v2": { "ccnet_original_length": 8490, "ccnet_original_nlines": 107, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.40500298142433167, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0035735599230974913, "rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383, "rps_doc_frac_no_alph_words": 0.14770697057247162, "rps_doc_frac_unique_words": 0.33847230672836304, "rps_doc_mean_word_length": 4.6930623054504395, "rps_doc_num_sentences": 98, "rps_doc_symbol_to_word_ratio": 0.0035735599230974913, "rps_doc_unigram_entropy": 5.483918190002441, "rps_doc_word_count": 1427, "rps_doc_frac_chars_dupe_10grams": 0.058533668518066406, "rps_doc_frac_chars_dupe_5grams": 0.12826639413833618, "rps_doc_frac_chars_dupe_6grams": 0.11333432793617249, "rps_doc_frac_chars_dupe_7grams": 0.08406749367713928, "rps_doc_frac_chars_dupe_8grams": 0.07555621862411499, "rps_doc_frac_chars_dupe_9grams": 0.06510377675294876, "rps_doc_frac_chars_top_2gram": 0.013438849709928036, "rps_doc_frac_chars_top_3gram": 0.007167390082031488, "rps_doc_frac_chars_top_4gram": 0.008959240280091763, "rps_doc_books_importance": -600.0208740234375, "rps_doc_books_importance_length_correction": -600.0208740234375, "rps_doc_openwebtext_importance": -445.2013244628906, "rps_doc_openwebtext_importance_length_correction": -445.2013244628906, "rps_doc_wikipedia_importance": -286.8431396484375, "rps_doc_wikipedia_importance_length_correction": -286.8431396484375 }, "fasttext": { "dclm": 0.0328027606010437, "english": 0.9115947484970093, "fineweb_edu_approx": 1.5155234336853027, "eai_general_math": 0.02391826920211315, "eai_open_web_math": 0.1624191403388977, "eai_web_code": 0.006699199788272381 } }	{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "12", "label": "Listicle" } }, "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
6,981,409,602,795,445,000	C#学习教程：System.MissingMethodException：json数组的反序列化时出错分享 System.MissingMethodException：json数组的反序列化时出错反序列化jsonString时出错。错误是Type 'oodleListingsUser' is not supported for deserialization of an array. 我的反序列化代码是 string jsonString = new WebClient().DownloadString("http://api.oodle.com/api/v2/listings?key=TEST&region=region_value&category=category_value&format=json"); JavaScriptSerializer ser = new JavaScriptSerializer(); jsonOodleApi p = ser.Deserialize(jsonString); 我对jsonOodleApi的定义是 public class jsonOodleApi { public oodleCurrent current; public oodleListings[] listings; public oodleMeta meta; public string state { get; set; } } 定义oodleCurrentoodleMeta我不给予因为它的完美！ oodleListings的定义是 public class oodleListings { public string id { get; set; } public string title { get; set; } public oodleListingsUser user; // I have skipped some of fields because it have no issue at all. } oodleListingsUser的定义是 public class oodleListingsUser { public string id { get; set; } public string url { get; set; } public string name { get; set; } public string photo { get; set; } } 问题是我的jsonString有时只返回一个user的值（ oodleListingsUser的类型），有时它返回用户的数组，有时它返回用户的null！当它只返回一个用户时，它运行得非常好！没有任何问题。但是当它返回用户数组时，绽放！错误发生Type 'oodleListingsUser' is not supported for deserialization of an array. 即使我已经尝试过public oodleListingsUser[] user但是它给出了错误 No parameterless constructor defined for type of 'oodleListingsUser[]' 对于只返回一个用户的值！现在我该怎么做才能解决这个问题？尝试： public oodleListings[] listings = new oodleListings[0]; 或者将其List 上述就是C#学习教程：System.MissingMethodException：json数组的反序列化时出错分享的全部内容，如果对大家有所用处且需要了解更多关于C#学习教程，希望大家多多关注—猴子技术宅（www.ssfiction.com）本文来自网络收集，不代表猴子技术宅立场，如涉及侵权请点击右边联系管理员删除。如若转载，请注明出处：https://www.ssfiction.com/ckf/1031705.html 发表评论邮箱地址不会被公开。必填项已用*标注	{ "url": "https://www.ssfiction.com/ckf/1031705.html", "source_domain": "www.ssfiction.com", "snapshot_id": "crawl=CC-MAIN-2022-05", "warc_metadata": { "Content-Length": "53208", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VURHFJ2YKPL43TZTZ4GYXOWAIJNXGIAX", "WARC-Concurrent-To": "<urn:uuid:f9b403e2-7dde-4113-bcb3-1f69ed6e1d30>", "WARC-Date": "2022-01-17T03:35:04Z", "WARC-IP-Address": "47.108.50.60", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LKIILJSBTK67WHRKUVCYL2Z3TLJR2J5X", "WARC-Record-ID": "<urn:uuid:578b2b3c-bb2a-44d8-a649-760a89a149ca>", "WARC-Target-URI": "https://www.ssfiction.com/ckf/1031705.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:30394f39-0c56-4f1b-a36f-5164bc9d251a>" }, "warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-118\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 54, 55, 56, 101, 102, 121, 122, 200, 201, 211, 212, 473, 474, 493, 494, 645, 646, 681, 682, 700, 701, 896, 897, 919, 920, 1087, 1088, 1165, 1166, 1194, 1195, 1291, 1292, 1340, 1341, 1414, 1415, 1428, 1429, 1446, 1447, 1451, 1452, 1510, 1511, 1520, 1521, 1643, 1644, 1683, 1684, 1738, 1739, 1744, 1745 ], "line_end_idx": [ 54, 55, 56, 101, 102, 121, 122, 200, 201, 211, 212, 473, 474, 493, 494, 645, 646, 681, 682, 700, 701, 896, 897, 919, 920, 1087, 1088, 1165, 1166, 1194, 1195, 1291, 1292, 1340, 1341, 1414, 1415, 1428, 1429, 1446, 1447, 1451, 1452, 1510, 1511, 1520, 1521, 1643, 1644, 1683, 1684, 1738, 1739, 1744, 1745, 1764 ] }	{ "red_pajama_v2": { "ccnet_original_length": 1764, "ccnet_original_nlines": 55, "rps_doc_curly_bracket": 0.011337869800627232, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.11501596868038177, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015974439680576324, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4760383367538452, "rps_doc_frac_unique_words": 0.5642856955528259, "rps_doc_mean_word_length": 10.321428298950195, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0.009584659710526466, "rps_doc_unigram_entropy": 4.008687973022461, "rps_doc_word_count": 140, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_6grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_7grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_8grams": 0.08027681708335876, "rps_doc_frac_chars_dupe_9grams": 0.08027681708335876, "rps_doc_frac_chars_top_2gram": 0.058131489902734756, "rps_doc_frac_chars_top_3gram": 0.041522491723299026, "rps_doc_frac_chars_top_4gram": 0.04982699081301689, "rps_doc_books_importance": -109.83870697021484, "rps_doc_books_importance_length_correction": -101.89079284667969, "rps_doc_openwebtext_importance": -71.67254638671875, "rps_doc_openwebtext_importance_length_correction": -71.67254638671875, "rps_doc_wikipedia_importance": -56.265838623046875, "rps_doc_wikipedia_importance_length_correction": -52.96495056152344 }, "fasttext": { "dclm": 0.9835176467895508, "english": 0.09122200310230255, "fineweb_edu_approx": 2.8210346698760986, "eai_general_math": 0.10074961185455322, "eai_open_web_math": 0.062226951122283936, "eai_web_code": 0.9934364557266235 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1332", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,299,193,589,465,291,000	Sensuctl Sensuctl is a command line tool for managing resources within Sensu. It works by calling Sensu’s underlying API to create, read, update, and delete resources, events, and entities. Sensuctl is available for Linux, macOS, and Windows. See the installation guide to install and configure sensuctl. Getting help Sensuctl supports a --help flag for each command and subcommand. # See command and global flags sensuctl --help # See subcommands and flags sensuctl check --help # See usage and flags sensuctl check delete --help First-time setup To set up sensuctl, run sensuctl configure to log in to sensuctl and connect to the Sensu backend. sensuctl configure When prompted, input the Sensu backend URL and your Sensu access credentials. ? Sensu Backend URL: http://127.0.0.1:8080 ? Username: admin ? Password: P@ssw0rd! ? Namespace: default ? Preferred output format: tabular Sensu backend URL The HTTP or HTTPS URL where sensuctl can connect to the Sensu backend server, defaulting to http://127.0.0.1:8080. When connecting to a Sensu cluster, connect sensuctl to any single backend in the cluster. For more information on configuring the Sensu backend URL, see the backend reference. Username \| password \| namespace By default, Sensu includes a user named admin with password P@ssw0rd! and a default namespace. Your ability to get, list, create, update, and delete resources with sensuctl depends on the permissions assigned to your Sensu user. For more information about configuring Sensu access control, see the RBAC reference. Preferred output format Sensuctl supports the following output formats: Once logged in, you can change the output format using sensuctl config set-format or set it per command using the --format flag. Managing sensuctl The sencutl config command lets you view the current sensuctl configuration and set the namespace and output format. View sensuctl config To view the active configuration for sensuctl: sensuctl config view Sensuctl configuration includes the Sensu backend url, Sensu edition (Core or Enterprise), the default output format for the current user, and the default namespace for the current user. api-url: http://127.0.0.1:8080 edition: core format: wrapped-json namespace: default Set output format You can use the set-format command to change the default output format for the current user. For example, to change the output format to tabular: sensuctl config set-format tabular Set namespace You can use the set-namespace command to change the default namespace for the current user. For more information about configuring Sensu access control, see the RBAC reference. For example, to change the default namespace to development: sensuctl config set-namespace development Log out of sensuctl To log out of sensuctl: sensuctl logout To log back in: sensuctl configure View the sensuctl version number To display the current version of sensuctl: sensuctl version Global flags Global flags modify settings specific to sensuctl, such as the Sensu backend URL and namespace. You can use global flags with most sensuctl commands. --api-url string host URL of Sensu installation --cache-dir string path to directory containing cache & temporary files --config-dir string path to directory containing configuration files --namespace string namespace in which we perform actions (default: "default") Creating resources The sensuctl create command allows you to create or update resources by reading from STDIN or a flag configured file (-f). The create command accepts Sensu resource definitions in wrapped-json and yaml. Both JSON and YAML resource definitions wrap the contents of the resource in spec and identify the resource type (see below for an example, and this table for a list of supported types). See the reference docs for information about creating resource definitions. For example, the following file my-resources.json specifies two resources: a marketing-site check and a slack handler. { "type": "CheckConfig", "spec": { "command": "check-http.go -u https://dean-learner.book", "subscriptions": ["demo"], "interval": 15, "handlers": ["slack"], "metadata" : { "name": "marketing-site", "namespace": "default" } } } { "type": "Handler", "api_version": "core/v2", "metadata": { "name": "slack", "namespace": "default" }, "spec": { "command": "sensu-slack-handler --channel '#monitoring'", "env_vars": [ "SLACK_WEBHOOK_URL=https://hooks.slack.com/services/T00000000/B00000000/XXXXXXXXXXXXXXXXXXXXXXXX" ], "filters": [ "is_incident", "not_silenced" ], "handlers": [], "runtime_assets": [], "timeout": 0, "type": "pipe" } } NOTE: Commas cannot be included between JSON resource definitions when using sensuctl create. To create all resources from my-resources.json using sensuctl create: sensuctl create --file my-resources.json Or: cat my-resources.json \| sensuctl create sensuctl create resource types sensuctl create types AdhocRequest adhoc_request Asset asset CheckConfig check_config ClusterRole cluster_role ClusterRoleBinding cluster_role_binding Entity entity Event event EventFilter event_filter Handler handler Hook hook HookConfig hook_config Mutator mutator Namespace namespace Role role RoleBinding role_binding Silenced silenced Updating resources Sensuctl allows you to update resource definitions using a text editor. To use sensuctl edit, specify the resource type and resource name. For example, to edit a handler named slack using sensuctl edit: sensuctl edit handler slack sensuctl edit resource types sensuctl edit types asset check cluster cluster-role cluster-role-binding entity event filter handler hook mutator namespace role role-binding silenced user Managing resources Sensuctl provides the following commands to manage Sensu resources. Subcommands Sensuctl provides a standard set of list, info, and delete operations for most resource types. list list resources info NAME show detailed resource information given resource name delete NAME delete resource given resource name For example, to list all monitoring checks: sensuctl check list To write all checks to my-resources.json in wrapped-json format: sensuctl check list --format wrapped-json > my-resources.json To see the definition for a check named check-cpu in wrapped-json format: sensuctl check info check-cpu --format wrapped-json In addition to the standard operations, commands may support subcommands or flags that allow you to take special action based on the resource type; the following sections call out those resource-specific operations. For a list of subcommands specific to a resource, run sensuctl TYPE --help. sensuctl check In addition to the standard subcommands, sensuctl provides a command to execute a check on demand, given the check name. sensuctl check execute NAME For example, the following command executes the check-cpu check with an attached message: sensuctl check execute check-cpu --reason "giving a sensuctl demo" You can also use the --subscriptions flag to override the subscriptions in the check definition: sensuctl check execute check-cpu --subscriptions demo,webserver sensuctl cluster The sensuctl cluster command lets you manage a Sensu cluster using the following subcommands. health get sensu health status member-add add cluster member to an existing cluster, with comma-separated peer addresses member-list list cluster members member-remove remove cluster member by ID member-update update cluster member by ID with comma-separated peer addresses To view cluster members: sensuctl cluster member-list To see the health of your Sensu cluster: sensuctl cluster health sensuctl event In addition to the standard subcommands, sensuctl provides a command to resolve an event. sensuctl event resolve ENTITY CHECK For example, the following command manually resolves an event created by the entity webserver1 and the check check-http: sensuctl event resolve webserver1 check-http sensuctl namespace See the RBAC reference for information about using access control with namespaces. sensuctl user See the RBAC reference for information about local user management with sensuctl. Time formats Sensuctl supports multiple time formats depending on the manipulated resource. Supported canonical time zone IDs are defined in the tz database. WARNING: Canonical zone IDs (i.e. America/Vancouver) are not supported on Windows. Dates with time Full dates with time are used to specify an exact point in time, which can be used with silencing entries, for example. The following formats are supported: • RFC3339 with numeric zone offset: 2018-05-10T07:04:00-08:00 or 2018-05-10T15:04:00Z • RFC3339 with space delimiters and numeric zone offset: 2018-05-10 07:04:00 -08:00 • Sensu alpha legacy format with canonical zone ID: May 10 2018 7:04AM America/Vancouver Shell auto-completion Installation (Bash Shell) Make sure bash completion is installed. If you use a current Linux in a non-minimal installation, bash completion should be available. On macOS, install with: brew install bash-completion Then add the following to your ~/.bash_profile: if [ -f $(brew --prefix)/etc/bash_completion ]; then . $(brew --prefix)/etc/bash_completion fi Once bash-completion is available, add the following to your ~/.bash_profile: source <(sensuctl completion bash) You can now source your ~/.bash_profile or launch a new terminal to utilize completion. source ~/.bash_profile Installation (ZSH) Add the following to your ~/.zshrc: source <(sensuctl completion zsh) You can now source your ~/.zshrc or launch a new terminal to utilize completion. source ~/.zshrc Usage sensuctl Tab check configure event user asset completion entity handler sensuctl check Tab create delete import list Configuration files During configuration, sensuctl creates configuration files that contain information for connecting to your Sensu Go deployment. You can find them at $HOME/.config/sensu/sensuctl/profile and $HOME/.config/sensu/sensuctl/profile. For example: cat .config/sensu/sensuctl/profile { "format": "tabular", "namespace": "demo" } cat .config/sensu/sensuctl/cluster { "api-url": "http://localhost:8080", "trusted-ca-file": "", "insecure-skip-tls-verify": false, "access_token": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "expires_at": 1550082282, "refresh_token": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" } These are useful if you want to know what cluster you’re connecting to, or what namespace you’re currently configured to use.	{ "url": "https://docs.uchiwa.io/sensu-go/5.1/sensuctl/reference/", "source_domain": "docs.uchiwa.io", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "78388", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CQNJ4XG3BE6MGGNXBEPBGZ7W6JQ5CNH3", "WARC-Concurrent-To": "<urn:uuid:bd305436-2207-4014-9dc4-6ccd8af3277d>", "WARC-Date": "2019-03-26T18:17:51Z", "WARC-IP-Address": "52.2.175.150", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XU23ME47MP6Y2XEGNDVZD3JWZ6Z67UKD", "WARC-Record-ID": "<urn:uuid:eebd5c32-6fd8-4dba-bbea-4e07620da97f>", "WARC-Target-URI": "https://docs.uchiwa.io/sensu-go/5.1/sensuctl/reference/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b495698d-328c-490e-ac7c-3587bbf254d2>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-63-100-22.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 17, 18, 314, 315, 328, 329, 394, 395, 426, 442, 443, 471, 493, 494, 516, 545, 546, 563, 564, 663, 664, 683, 684, 762, 763, 806, 824, 846, 867, 902, 903, 921, 922, 1214, 1215, 1247, 1248, 1562, 1563, 1587, 1588, 1636, 1637, 1766, 1767, 1785, 1786, 1903, 1904, 1925, 1926, 1973, 1974, 1995, 1996, 2183, 2184, 2215, 2229, 2250, 2269, 2270, 2288, 2289, 2435, 2436, 2471, 2472, 2486, 2487, 2725, 2726, 2768, 2769, 2789, 2790, 2814, 2815, 2831, 2832, 2848, 2849, 2868, 2869, 2902, 2903, 2947, 2948, 2965, 2966, 2979, 2980, 3130, 3131, 3186, 3264, 3337, 3420, 3421, 3440, 3441, 3907, 3908, 4027, 4028, 4030, 4055, 4067, 4128, 4159, 4179, 4206, 4225, 4257, 4286, 4292, 4296, 4298, 4300, 4321, 4349, 4365, 4386, 4413, 4418, 4430, 4492, 4510, 4614, 4621, 4638, 4659, 4680, 4687, 4707, 4733, 4751, 4770, 4774, 4776, 4777, 4871, 4872, 4942, 4943, 4984, 4985, 4989, 4990, 5030, 5031, 5062, 5063, 5085, 5124, 5174, 5228, 5265, 5291, 5330, 5360, 5403, 5404, 5423, 5424, 5563, 5564, 5628, 5629, 5657, 5658, 5687, 5688, 5708, 5741, 5782, 5813, 5845, 5846, 5865, 5866, 5934, 5935, 5947, 5948, 6043, 6044, 6086, 6168, 6231, 6232, 6276, 6277, 6297, 6298, 6363, 6364, 6426, 6427, 6501, 6502, 6554, 6555, 6847, 6848, 6863, 6864, 6985, 6986, 7014, 7015, 7105, 7106, 7173, 7174, 7271, 7272, 7336, 7337, 7354, 7355, 7449, 7450, 7491, 7587, 7625, 7670, 7751, 7752, 7777, 7778, 7807, 7808, 7849, 7850, 7874, 7875, 7890, 7891, 7981, 7982, 8018, 8019, 8140, 8141, 8186, 8187, 8206, 8207, 8290, 8291, 8305, 8306, 8388, 8389, 8402, 8403, 8548, 8549, 8632, 8633, 8649, 8650, 8807, 8808, 8896, 8982, 9073, 9074, 9096, 9097, 9123, 9124, 9283, 9284, 9313, 9314, 9362, 9363, 9416, 9455, 9458, 9459, 9537, 9538, 9573, 9574, 9662, 9663, 9686, 9687, 9706, 9707, 9743, 9744, 9778, 9779, 9860, 9861, 9877, 9878, 9884, 9885, 9898, 9899, 9940, 9984, 9985, 10004, 10005, 10034, 10035, 10055, 10056, 10297, 10298, 10333, 10335, 10358, 10380, 10382, 10418, 10420, 10458, 10483, 10520, 10572, 10600, 10652, 10654, 10655 ], "line_end_idx": [ 1, 2, 3, 4, 5, 6, 7, 8, 17, 18, 314, 315, 328, 329, 394, 395, 426, 442, 443, 471, 493, 494, 516, 545, 546, 563, 564, 663, 664, 683, 684, 762, 763, 806, 824, 846, 867, 902, 903, 921, 922, 1214, 1215, 1247, 1248, 1562, 1563, 1587, 1588, 1636, 1637, 1766, 1767, 1785, 1786, 1903, 1904, 1925, 1926, 1973, 1974, 1995, 1996, 2183, 2184, 2215, 2229, 2250, 2269, 2270, 2288, 2289, 2435, 2436, 2471, 2472, 2486, 2487, 2725, 2726, 2768, 2769, 2789, 2790, 2814, 2815, 2831, 2832, 2848, 2849, 2868, 2869, 2902, 2903, 2947, 2948, 2965, 2966, 2979, 2980, 3130, 3131, 3186, 3264, 3337, 3420, 3421, 3440, 3441, 3907, 3908, 4027, 4028, 4030, 4055, 4067, 4128, 4159, 4179, 4206, 4225, 4257, 4286, 4292, 4296, 4298, 4300, 4321, 4349, 4365, 4386, 4413, 4418, 4430, 4492, 4510, 4614, 4621, 4638, 4659, 4680, 4687, 4707, 4733, 4751, 4770, 4774, 4776, 4777, 4871, 4872, 4942, 4943, 4984, 4985, 4989, 4990, 5030, 5031, 5062, 5063, 5085, 5124, 5174, 5228, 5265, 5291, 5330, 5360, 5403, 5404, 5423, 5424, 5563, 5564, 5628, 5629, 5657, 5658, 5687, 5688, 5708, 5741, 5782, 5813, 5845, 5846, 5865, 5866, 5934, 5935, 5947, 5948, 6043, 6044, 6086, 6168, 6231, 6232, 6276, 6277, 6297, 6298, 6363, 6364, 6426, 6427, 6501, 6502, 6554, 6555, 6847, 6848, 6863, 6864, 6985, 6986, 7014, 7015, 7105, 7106, 7173, 7174, 7271, 7272, 7336, 7337, 7354, 7355, 7449, 7450, 7491, 7587, 7625, 7670, 7751, 7752, 7777, 7778, 7807, 7808, 7849, 7850, 7874, 7875, 7890, 7891, 7981, 7982, 8018, 8019, 8140, 8141, 8186, 8187, 8206, 8207, 8290, 8291, 8305, 8306, 8388, 8389, 8402, 8403, 8548, 8549, 8632, 8633, 8649, 8650, 8807, 8808, 8896, 8982, 9073, 9074, 9096, 9097, 9123, 9124, 9283, 9284, 9313, 9314, 9362, 9363, 9416, 9455, 9458, 9459, 9537, 9538, 9573, 9574, 9662, 9663, 9686, 9687, 9706, 9707, 9743, 9744, 9778, 9779, 9860, 9861, 9877, 9878, 9884, 9885, 9898, 9899, 9940, 9984, 9985, 10004, 10005, 10034, 10035, 10055, 10056, 10297, 10298, 10333, 10335, 10358, 10380, 10382, 10418, 10420, 10458, 10483, 10520, 10572, 10600, 10652, 10654, 10655, 10780 ] }	{ "red_pajama_v2": { "ccnet_original_length": 10780, "ccnet_original_nlines": 339, "rps_doc_curly_bracket": 0.001484230044297874, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2168494462966919, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.021934200078248978, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2572283148765564, "rps_doc_frac_unique_words": 0.27916964888572693, "rps_doc_mean_word_length": 5.962777614593506, "rps_doc_num_sentences": 87, "rps_doc_symbol_to_word_ratio": 0.0019940200727432966, "rps_doc_unigram_entropy": 5.242739677429199, "rps_doc_word_count": 1397, "rps_doc_frac_chars_dupe_10grams": 0.03241296857595444, "rps_doc_frac_chars_dupe_5grams": 0.13661465048789978, "rps_doc_frac_chars_dupe_6grams": 0.07755102217197418, "rps_doc_frac_chars_dupe_7grams": 0.06986795365810394, "rps_doc_frac_chars_dupe_8grams": 0.05258103087544441, "rps_doc_frac_chars_dupe_9grams": 0.043217290192842484, "rps_doc_frac_chars_top_2gram": 0.015846339985728264, "rps_doc_frac_chars_top_3gram": 0.010804319754242897, "rps_doc_frac_chars_top_4gram": 0.00864346046000719, "rps_doc_books_importance": -870.2305908203125, "rps_doc_books_importance_length_correction": -870.2305908203125, "rps_doc_openwebtext_importance": -608.1761474609375, "rps_doc_openwebtext_importance_length_correction": -608.1761474609375, "rps_doc_wikipedia_importance": -465.58343505859375, "rps_doc_wikipedia_importance_length_correction": -465.58343505859375 }, "fasttext": { "dclm": 0.0573388896882534, "english": 0.6924066543579102, "fineweb_edu_approx": 2.4440648555755615, "eai_general_math": 0.7361815571784973, "eai_open_web_math": 0.059112489223480225, "eai_web_code": 0.8036242127418518 } }	{ "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.457", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
5,806,152,193,819,645,000	source: rtems/c/src/lib/libbsp/shared/console.c @ 1c6926c1 Last change on this file since 1c6926c1 was 1c6926c1, checked in by Kevin Kirspel <kevin-kirspel@…>, on Mar 21, 2017 at 7:39:48 PM termios: Synchronize with latest FreeBSD headers Adding modified FreeBSD headers to synchronize RTEMS termios with FreeBSD. Modify termios to support dedicated input and output baud for termios structure. Updated BSPs to use dedicated input and output baud in termios structure. Updated tools to use dedicated input and output baud in termios structure. Updated termios testsuites to use dedicated input and output baud in termios structure. Close #2897. • Property mode set to 100644 File size: 9.6 KB Line 1/** 2 * @file 3 * 4 * @ingroup Console 5 * 6 * @brief Extension of the generic libchip console driver shell 7 / 8 9/ 10 * COPYRIGHT (c) 1989-2011, 2016. 11 * On-Line Applications Research Corporation (OAR). 12 * 13 * The license and distribution terms for this file may be 14 * found in the file LICENSE in this distribution or at 15 * http://www.rtems.org/license/LICENSE. 16 / 17 18#include <bsp.h> 19#include <bsp/fatal.h> 20#include <rtems/libio.h> 21#include <rtems/console.h> 22#include <stdlib.h> 23#include <assert.h> 24#include <termios.h> 25 26#include <rtems/termiostypes.h> 27#include <libchip/serial.h> 28#include "console_private.h" 29 30unsigned long Console_Port_Count = 0; 31console_tbl Console_Port_Tbl = NULL; 32console_data Console_Port_Data = NULL; 33rtems_device_minor_number Console_Port_Minor = 0; 34static bool console_initialized = false; 35 36/* 37 * console_find_console_entry 38 * 39 * This method is used to search the console entries for a 40 * specific device entry. 41 / 42console_tbl console_find_console_entry( 43 const char match, 44 size_t length, 45 rtems_device_minor_number match_minor 46) 47{ 48 rtems_device_minor_number minor; 49 50 /* 51 * The the match name is NULL get the minor number entry. 52 / 53 if (match == NULL) { 54 if (match_minor < Console_Port_Count) 55 return Console_Port_Tbl[match_minor]; 56 return NULL; 57 } 58 59 for (minor=0; minor < Console_Port_Count ; minor++) { 60 console_tbl cptr = Console_Port_Tbl[minor]; 61 62 /* 63 * Console table entries include /dev/ prefix, device names passed 64 * in on command line do not. 65 / 66 if ( !strncmp( cptr->sDeviceName, match, length ) ) { 67 match_minor = minor; 68 return cptr; 69 } 70 } 71 72 return NULL; 73} 74 75/* 76 * console_initialize_data 77 * 78 * This method is used to initialize the table of pointers to the 79 * serial port configuration structure entries. 80 / 81void console_initialize_data(void) 82{ 83 int i; 84 85 if ( Console_Port_Tbl ) 86 return; 87 88 / 89 * Allocate memory for the table of device pointers. 90 / 91 Console_Port_Count = Console_Configuration_Count; 92 Console_Port_Tbl = malloc( Console_Port_Count sizeof( console_tbl * ) ); 93 if (Console_Port_Tbl == NULL) 94 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_0 ); 95 96 /* 97 * Allocate memory for the table of device specific data pointers. 98 / 99 Console_Port_Data = calloc( Console_Port_Count, sizeof( console_data ) ); 100 if ( Console_Port_Data == NULL ) { 101 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_3 ); 102 } 103 104 / 105 * Fill in the Console Table 106 / 107 for (i=0 ; i < Console_Port_Count ; i++) { 108 Console_Port_Tbl[i] = &Console_Configuration_Ports[i]; 109 } 110} 111 112/ 113 * console_register_devices 114 * 115 * This method is used to add dynamically discovered devices to the 116 * set of serial ports supported. 117 / 118void console_register_devices( 119 console_tbl new_ports, 120 size_t number_of_ports 121) 122{ 123 int old_number_of_ports; 124 int i; 125 126 /* 127 * Initialize the console data elements 128 / 129 console_initialize_data(); 130 131 / 132 * console_initialize() has been invoked so it is now too late to 133 * register devices. 134 / 135 if ( console_initialized ) { 136 bsp_fatal( BSP_FATAL_CONSOLE_MULTI_INIT ); 137 } 138 139 / 140 * Allocate memory for the console port extension 141 / 142 old_number_of_ports = Console_Port_Count; 143 Console_Port_Count += number_of_ports; 144 Console_Port_Tbl = realloc( 145 Console_Port_Tbl, 146 Console_Port_Count sizeof(console_tbl ) 147 ); 148 if ( Console_Port_Tbl == NULL ) { 149 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_1 ); 150 } 151 152 / 153 * Since we can only add devices before console_initialize(), 154 * the data area will contain no information and must be zero 155 * before it is used. So extend the area and zero it out. 156 / 157 Console_Port_Data = realloc( 158 Console_Port_Data, 159 Console_Port_Count sizeof(console_data) 160 ); 161 if ( Console_Port_Data == NULL ) { 162 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_2 ); 163 } 164 memset(Console_Port_Data, '\0', Console_Port_Count * sizeof(console_data)); 165 166 /* 167 * Now add the new devices at the end. 168 / 169 for (i=0 ; i < number_of_ports ; i++) { 170 Console_Port_Tbl[old_number_of_ports + i] = &new_ports[i]; 171 } 172} 173 174/ 175 * console_open 176 * 177 * open a port as a termios console. 178 / 179rtems_device_driver console_open( 180 rtems_device_major_number major, 181 rtems_device_minor_number minor, 182 void arg 183) 184{ 185 rtems_status_code status; 186 rtems_libio_open_close_args_t args = arg; 187 rtems_libio_ioctl_args_t IoctlArgs; 188 struct termios Termios; 189 rtems_termios_callbacks Callbacks; 190 console_tbl cptr; 191 struct rtems_termios_tty current_tty; 192 193 / 194 * Verify the port number is valid. 195 / 196 if ( minor > Console_Port_Count ) { 197 return RTEMS_INVALID_NUMBER; 198 } 199 200 / 201 * Open the port as a termios console driver. 202 / 203 204 cptr = Console_Port_Tbl[minor]; 205 Callbacks.firstOpen = cptr->pDeviceFns->deviceFirstOpen; 206 Callbacks.lastClose = cptr->pDeviceFns->deviceLastClose; 207 Callbacks.pollRead = cptr->pDeviceFns->deviceRead; 208 Callbacks.write = cptr->pDeviceFns->deviceWrite; 209 Callbacks.setAttributes = cptr->pDeviceFns->deviceSetAttributes; 210 if (cptr->pDeviceFlow != NULL) { 211 Callbacks.stopRemoteTx = cptr->pDeviceFlow->deviceStopRemoteTx; 212 Callbacks.startRemoteTx = cptr->pDeviceFlow->deviceStartRemoteTx; 213 } else { 214 Callbacks.stopRemoteTx = NULL; 215 Callbacks.startRemoteTx = NULL; 216 } 217 Callbacks.outputUsesInterrupts = cptr->pDeviceFns->deviceOutputUsesInterrupts; 218 219 / XXX what about 220 * Console_Port_Tbl[minor].ulMargin, 221 * Console_Port_Tbl[minor].ulHysteresis); 222 / 223 224 status = rtems_termios_open( major, minor, arg, &Callbacks ); 225 Console_Port_Data[minor].termios_data = args->iop->data1; 226 227 / Get tty pointur from the Console_Port_Data / 228 current_tty = Console_Port_Data[minor].termios_data; 229 230 if ( (current_tty->refcount == 1) ) { 231 232 / 233 * If this BSP has a preferred default rate, then use that. 234 / 235 #if defined(BSP_DEFAULT_BAUD_RATE) 236 rtems_termios_set_initial_baud( current_tty, BSP_DEFAULT_BAUD_RATE ); 237 #endif 238 239 / 240 * If it's the first open, modified, if need, the port parameters 241 / 242 if ( minor != Console_Port_Minor ) { 243 / 244 * If this is not the console we do not want ECHO and so forth 245 / 246 IoctlArgs.iop = args->iop; 247 IoctlArgs.command = TIOCGETA; 248 IoctlArgs.buffer = &Termios; 249 rtems_termios_ioctl( &IoctlArgs ); 250 251 Termios.c_lflag = ICANON; 252 IoctlArgs.command = TIOCSETA; 253 rtems_termios_ioctl( &IoctlArgs ); 254 } 255 } 256 257 if ( (args->iop->flags&LIBIO_FLAGS_READ) && 258 cptr->pDeviceFlow && 259 cptr->pDeviceFlow->deviceStartRemoteTx) { 260 cptr->pDeviceFlow->deviceStartRemoteTx(minor); 261 } 262 263 return status; 264} 265 266/ 267 * console_close 268 * 269 * This routine closes a port that has been opened as console. 270 / 271rtems_device_driver console_close( 272 rtems_device_major_number major, 273 rtems_device_minor_number minor, 274 void arg 275) 276{ 277 rtems_libio_open_close_args_t args = arg; 278 struct rtems_termios_tty current_tty; 279 console_tbl cptr; 280 281 cptr = Console_Port_Tbl[minor]; 282 283 / Get tty pointer from the Console_Port_Data / 284 current_tty = Console_Port_Data[minor].termios_data; 285 286 / Get the tty refcount to determine if we need to do deviceStopRemoteTx. 287 * Stop only if it's the last one opened. 288 / 289 if ( (current_tty->refcount == 1) ) { 290 if ( (args->iop->flags&LIBIO_FLAGS_READ) && 291 cptr->pDeviceFlow && 292 cptr->pDeviceFlow->deviceStopRemoteTx) { 293 cptr->pDeviceFlow->deviceStopRemoteTx(minor); 294 } 295 } 296 297 return rtems_termios_close (arg); 298} 299 300/ 301 * console_initialize 302 * 303 * Routine called to initialize the console device driver. 304 / 305rtems_device_driver console_initialize( 306 rtems_device_major_number major, 307 rtems_device_minor_number minor_arg, 308 void arg 309) 310{ 311 rtems_status_code status; 312 rtems_device_minor_number minor; 313 console_tbl port; 314 315 / 316 * If we have no devices which were registered earlier then we 317 * must still initialize pointers for Console_Port_Tbl and 318 * Console_Port_Data. 319 / 320 console_initialize_data(); 321 322 / 323 * console_initialize has been invoked so it is now too late to 324 * register devices. 325 / 326 console_initialized = true; 327 328 / 329 * Initialize the termio interface, our table of pointers to device 330 * information structures, and determine if the user has explicitly 331 * specified which device is to be used for the console. 332 / 333 rtems_termios_initialize(); 334 bsp_console_select(); 335 336 / 337 * Iterate over all of the console devices we know about 338 * and initialize them. 339 / 340 for (minor=0 ; minor < Console_Port_Count ; minor++) { 341 / 342 * First perform the configuration dependent probe, then the 343 * device dependent probe 344 / 345 port = Console_Port_Tbl[minor]; 346 347 if ( (!port->deviceProbe \|\| port->deviceProbe(minor)) && 348 port->pDeviceFns->deviceProbe(minor)) { 349 350 if (port->sDeviceName != NULL) { 351 status = rtems_io_register_name( port->sDeviceName, major, minor ); 352 if (status != RTEMS_SUCCESSFUL) { 353 bsp_fatal( BSP_FATAL_CONSOLE_REGISTER_DEV_0 ); 354 } 355 } 356 357 if (minor == Console_Port_Minor) { 358 status = rtems_io_register_name( CONSOLE_DEVICE_NAME, major, minor ); 359 if (status != RTEMS_SUCCESSFUL) { 360 bsp_fatal( BSP_FATAL_CONSOLE_REGISTER_DEV_1 ); 361 } 362 } 363 364 / 365 * Initialize the hardware device. 366 */ 367 port->pDeviceFns->deviceInitialize(minor); 368 369 } 370 } 371 372 return RTEMS_SUCCESSFUL; 373} Note: See TracBrowser for help on using the repository browser.	{ "url": "https://devel.rtems.org/browser/rtems/c/src/lib/libbsp/shared/console.c?rev=1c6926c11f2e5efcb166c668b097d64a0321d66e", "source_domain": "devel.rtems.org", "snapshot_id": "crawl=CC-MAIN-2019-30", "warc_metadata": { "Content-Length": "67005", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HIUGM74X4T5CF7HSWS3M7CE47HJHIY3W", "WARC-Concurrent-To": "<urn:uuid:bda7c6f4-43e6-4356-a3ad-f74637e04bf3>", "WARC-Date": "2019-07-17T02:42:38Z", "WARC-IP-Address": "140.211.10.146", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:426OCQRK2N742YT3CQACXCXZZE33VANS", "WARC-Record-ID": "<urn:uuid:dadae7fd-b95d-4e69-8b88-a0e45913346e>", "WARC-Target-URI": "https://devel.rtems.org/browser/rtems/c/src/lib/libbsp/shared/console.c?rev=1c6926c11f2e5efcb166c668b097d64a0321d66e", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b40c136d-77b7-4071-b192-8aa373b4e480>" }, "warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-153-241-164.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 59, 60, 191, 192, 241, 242, 308, 379, 450, 520, 591, 635, 636, 649, 650, 682, 700, 706, 711, 721, 725, 746, 750, 815, 820, 822, 826, 863, 918, 923, 985, 1044, 1088, 1094, 1097, 1116, 1141, 1168, 1197, 1219, 1241, 1264, 1267, 1301, 1331, 1362, 1365, 1420, 1478, 1536, 1591, 1650, 1653, 1658, 1691, 1696, 1758, 1787, 1793, 1836, 1874, 1913, 1956, 1960, 1964, 2002, 2005, 2012, 2074, 2082, 2107, 2152, 2199, 2218, 2224, 2227, 2285, 2337, 2340, 2349, 2422, 2458, 2468, 2528, 2558, 2579, 2587, 2593, 2596, 2613, 2617, 2620, 2625, 2655, 2660, 2729, 2780, 2786, 2823, 2827, 2838, 2841, 2869, 2883, 2886, 2893, 2950, 2958, 3012, 3093, 3127, 3177, 3180, 3187, 3258, 3266, 3345, 3385, 3436, 3443, 3447, 3455, 3489, 3498, 3546, 3608, 3615, 3620, 3624, 3630, 3662, 3668, 3740, 3778, 3785, 3819, 3848, 3882, 3887, 3892, 3923, 3936, 3940, 3948, 3993, 4002, 4034, 4038, 4046, 4118, 4145, 4154, 4188, 4238, 4245, 4249, 4257, 4313, 4322, 4369, 4413, 4446, 4471, 4521, 4529, 4568, 4619, 4626, 4630, 4638, 4705, 4772, 4835, 4844, 4878, 4904, 4953, 4961, 5001, 5052, 5059, 5140, 5144, 5152, 5197, 5206, 5251, 5318, 5325, 5330, 5334, 5340, 5360, 5366, 5407, 5414, 5451, 5489, 5527, 5562, 5567, 5572, 5616, 5664, 5711, 5756, 5803, 5845, 5894, 5898, 5906, 5947, 5956, 5997, 6033, 6040, 6044, 6052, 6103, 6112, 6116, 6153, 6226, 6299, 6367, 6436, 6513, 6551, 6623, 6696, 6710, 6749, 6788, 6795, 6879, 6883, 6906, 6955, 7009, 7018, 7022, 7089, 7152, 7156, 7210, 7268, 7272, 7315, 7319, 7329, 7397, 7408, 7450, 7529, 7543, 7547, 7557, 7630, 7641, 7685, 7697, 7769, 7782, 7822, 7861, 7900, 7944, 7948, 7985, 8024, 8068, 8077, 8084, 8088, 8137, 8167, 8218, 8272, 8279, 8283, 8303, 8308, 8312, 8318, 8339, 8345, 8412, 8419, 8457, 8495, 8533, 8568, 8573, 8578, 8626, 8675, 8717, 8721, 8759, 8763, 8817, 8875, 8879, 8958, 9005, 9014, 9057, 9108, 9142, 9196, 9251, 9260, 9267, 9271, 9310, 9315, 9319, 9325, 9351, 9357, 9420, 9427, 9470, 9509, 9552, 9588, 9593, 9598, 9638, 9677, 9715, 9719, 9727, 9795, 9859, 9886, 9895, 9927, 9931, 9939, 10009, 10036, 10045, 10078, 10082, 10090, 10164, 10238, 10301, 10310, 10343, 10370, 10374, 10382, 10445, 10475, 10484, 10544, 10554, 10623, 10657, 10668, 10707, 10711, 10775, 10827, 10831, 10873, 10952, 10997, 11057, 11070, 11081, 11085, 11129, 11210, 11255, 11315, 11328, 11339, 11343, 11355, 11399, 11412, 11464, 11468, 11477, 11484, 11488, 11518, 11523 ], "line_end_idx": [ 59, 60, 191, 192, 241, 242, 308, 379, 450, 520, 591, 635, 636, 649, 650, 682, 700, 706, 711, 721, 725, 746, 750, 815, 820, 822, 826, 863, 918, 923, 985, 1044, 1088, 1094, 1097, 1116, 1141, 1168, 1197, 1219, 1241, 1264, 1267, 1301, 1331, 1362, 1365, 1420, 1478, 1536, 1591, 1650, 1653, 1658, 1691, 1696, 1758, 1787, 1793, 1836, 1874, 1913, 1956, 1960, 1964, 2002, 2005, 2012, 2074, 2082, 2107, 2152, 2199, 2218, 2224, 2227, 2285, 2337, 2340, 2349, 2422, 2458, 2468, 2528, 2558, 2579, 2587, 2593, 2596, 2613, 2617, 2620, 2625, 2655, 2660, 2729, 2780, 2786, 2823, 2827, 2838, 2841, 2869, 2883, 2886, 2893, 2950, 2958, 3012, 3093, 3127, 3177, 3180, 3187, 3258, 3266, 3345, 3385, 3436, 3443, 3447, 3455, 3489, 3498, 3546, 3608, 3615, 3620, 3624, 3630, 3662, 3668, 3740, 3778, 3785, 3819, 3848, 3882, 3887, 3892, 3923, 3936, 3940, 3948, 3993, 4002, 4034, 4038, 4046, 4118, 4145, 4154, 4188, 4238, 4245, 4249, 4257, 4313, 4322, 4369, 4413, 4446, 4471, 4521, 4529, 4568, 4619, 4626, 4630, 4638, 4705, 4772, 4835, 4844, 4878, 4904, 4953, 4961, 5001, 5052, 5059, 5140, 5144, 5152, 5197, 5206, 5251, 5318, 5325, 5330, 5334, 5340, 5360, 5366, 5407, 5414, 5451, 5489, 5527, 5562, 5567, 5572, 5616, 5664, 5711, 5756, 5803, 5845, 5894, 5898, 5906, 5947, 5956, 5997, 6033, 6040, 6044, 6052, 6103, 6112, 6116, 6153, 6226, 6299, 6367, 6436, 6513, 6551, 6623, 6696, 6710, 6749, 6788, 6795, 6879, 6883, 6906, 6955, 7009, 7018, 7022, 7089, 7152, 7156, 7210, 7268, 7272, 7315, 7319, 7329, 7397, 7408, 7450, 7529, 7543, 7547, 7557, 7630, 7641, 7685, 7697, 7769, 7782, 7822, 7861, 7900, 7944, 7948, 7985, 8024, 8068, 8077, 8084, 8088, 8137, 8167, 8218, 8272, 8279, 8283, 8303, 8308, 8312, 8318, 8339, 8345, 8412, 8419, 8457, 8495, 8533, 8568, 8573, 8578, 8626, 8675, 8717, 8721, 8759, 8763, 8817, 8875, 8879, 8958, 9005, 9014, 9057, 9108, 9142, 9196, 9251, 9260, 9267, 9271, 9310, 9315, 9319, 9325, 9351, 9357, 9420, 9427, 9470, 9509, 9552, 9588, 9593, 9598, 9638, 9677, 9715, 9719, 9727, 9795, 9859, 9886, 9895, 9927, 9931, 9939, 10009, 10036, 10045, 10078, 10082, 10090, 10164, 10238, 10301, 10310, 10343, 10370, 10374, 10382, 10445, 10475, 10484, 10544, 10554, 10623, 10657, 10668, 10707, 10711, 10775, 10827, 10831, 10873, 10952, 10997, 11057, 11070, 11081, 11085, 11129, 11210, 11255, 11315, 11328, 11339, 11343, 11355, 11399, 11412, 11464, 11468, 11477, 11484, 11488, 11518, 11523, 11586 ] }	{ "red_pajama_v2": { "ccnet_original_length": 11586, "ccnet_original_nlines": 391, "rps_doc_curly_bracket": 0.00500603998079896, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.13159145414829254, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02042754925787449, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5320665240287781, "rps_doc_frac_unique_words": 0.5855048894882202, "rps_doc_mean_word_length": 6.37785005569458, "rps_doc_num_sentences": 75, "rps_doc_symbol_to_word_ratio": 0.006650830153375864, "rps_doc_unigram_entropy": 6.143853187561035, "rps_doc_word_count": 1228, "rps_doc_frac_chars_dupe_10grams": 0.03345249965786934, "rps_doc_frac_chars_dupe_5grams": 0.06652195751667023, "rps_doc_frac_chars_dupe_6grams": 0.04187947139143944, "rps_doc_frac_chars_dupe_7grams": 0.04187947139143944, "rps_doc_frac_chars_dupe_8grams": 0.03345249965786934, "rps_doc_frac_chars_dupe_9grams": 0.03345249965786934, "rps_doc_frac_chars_top_2gram": 0.01021450012922287, "rps_doc_frac_chars_top_3gram": 0.008682330138981342, "rps_doc_frac_chars_top_4gram": 0.011746680364012718, "rps_doc_books_importance": -974.9349975585938, "rps_doc_books_importance_length_correction": -974.9349975585938, "rps_doc_openwebtext_importance": -532.4391479492188, "rps_doc_openwebtext_importance_length_correction": -532.4391479492188, "rps_doc_wikipedia_importance": -358.9370422363281, "rps_doc_wikipedia_importance_length_correction": -358.9370422363281 }, "fasttext": { "dclm": 0.03720211982727051, "english": 0.15387077629566193, "fineweb_edu_approx": 2.3745322227478027, "eai_general_math": 0.000012280000191822182, "eai_open_web_math": 0.6671059727668762, "eai_web_code": 0.930761992931366 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-714,125,805,937,551,900	Splunk® Enterprise Search Reference Download manual as PDF Download topic as PDF from Description The from command retrieves data from a dataset, such as a data model dataset, a CSV lookup, a KV Store lookup, a saved search, or a table dataset. Design a search that uses the from command to reference a dataset. Optionally add additional SPL such as lookups, eval expressions, and transforming commands to the search Save the result as a report, alert, or dashboard panel. If you use Splunk Cloud, or use Splunk Enterprise and have installed the Splunk Datasets Add-on, you can also save the search as a table dataset. See the Usage section. Syntax \| from <dataset_type>:<dataset_name> Required arguments <dataset_type> Syntax: <dataset_type> Description: The type of dataset. Valid values are: datamodel, inputlookup, and savedsearch. The datamodel dataset type can be either a data model dataset or a table dataset. You create data model datasets with the Data Model Editor. You can create table datasets with the Table Editor if you use Splunk Cloud or use Splunk Enterprise and have installed the Splunk Datasets Add-on. The inputlookup dataset type can be either a CSV lookup or a KV Store lookup. The savedsearch dataset type is a saved search. You can use from to reference any saved search as a dataset. See About datasets in the Knowledge Manager Manual. <dataset_name> Syntax: <dataset_name> Description: The name of the dataset that you want to retrieve data from. If the dataset_type is a data model, the syntax is <datamodel_name>.<dataset_name>. If the name of the dataset contains spaces, enclose the dataset name in quotation marks. Example: If the data model name is internal_server, and the dataset name is splunkdaccess, specify internal_server.splunkdaccess for the dataset_name. In older versions of the Splunk software, the term "data model object" was used. That term has been replaced with "data model dataset". Optional arguments None. Usage When you use the from command, you must reference an existing dataset. You can reference any dataset listed in the Datasets listing page (data model datasets, CSV lookup files, CSV lookup definitions, and table datasets). You can also reference saved searches and KV Store lookup definitions. See View and manage datasets in the Knowledge Manager Manual. When you create a report, alert, dashboard panel, or table dataset that is based on a from search that references a dataset, that knowledge object has a dependency on the referenced dataset. This is dataset extension. When you make a change to the original dataset, such as removing or adding fields, that change propagates down to the reports, alerts, dashboard panels, and tables that have been extended from that original dataset. See Dataset extension in the Knowledge Manager Manual. The from command is a generating command, and should be the first command in the search. Generating commands use a leading pipe character. However, you can use the from command inside the append command. Examples 1. Search a data model Search a data model that contains internal server log events for REST API calls. In this example, internal_server is the data model name and splunkdaccess is the dataset inside the internal_server data model. \| from datamodel:internal_server.splunkdaccess 2. Search a lookup file Search a lookup file that contains geographic attributes for each country, such as continent, two-letter ISO code, and subregion. \| from inputlookup:geo_attr_countries.csv 3. Retrieve data by using a lookup file Search the contents of the KV store collection kvstorecoll that have a CustID value greater than 500 and a CustName value that begins with the letter P. The collection is referenced in a lookup table called kvstorecoll_lookup. Using the stats command, provide a count of the events received from the table. \| from inputlookup:kvstorecoll_lookup \| where (CustID>500) AND (CustName="P*") \| stats count 4. Retrieve data using a saved search Retrieve the timestamp and client IP from the saved search called mysecurityquery. \| from savedsearch:mysecurityquery \| fields _time clientip ... 5. Specify a dataset name that contains spaces When the name of a dataset includes spaces, enclose the dataset name in quotation marks. \| from savedsearch:"Top five sourcetypes" See also inputlookup, datamodel PREVIOUS format NEXT gauge This documentation applies to the following versions of Splunk® Enterprise: 6.5.0, 6.5.1, 6.5.1612 (Splunk Cloud only), 6.5.2, 6.5.3, 6.5.4, 6.5.5, 6.5.6, 6.5.7, 6.5.8, 6.5.9, 6.6.0, 6.6.1, 6.6.2, 6.6.3, 6.6.4, 6.6.5, 6.6.6, 6.6.7, 6.6.8, 7.0.0, 7.0.1, 7.0.2, 7.0.3, 7.0.4, 7.1.0, 7.1.1 Was this documentation topic helpful? Enter your email address, and someone from the documentation team will respond to you: Please provide your comments here. Ask a question or make a suggestion. You must be logged into splunk.com in order to post comments. Log in now. Please try to keep this discussion focused on the content covered in this documentation topic. If you have a more general question about Splunk functionality or are experiencing a difficulty with Splunk, consider posting a question to Splunkbase Answers. 0 out of 1000 Characters	{ "url": "http://docs.splunk.com/Documentation/Splunk/7.1.0/SearchReference/From", "source_domain": "docs.splunk.com", "snapshot_id": "crawl=CC-MAIN-2018-26", "warc_metadata": { "Content-Length": "115859", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6ZIIBXST6RCC7NEFSA3727XOUGDXBTZK", "WARC-Concurrent-To": "<urn:uuid:bd2efedc-6b83-42a6-b989-7334d5326f02>", "WARC-Date": "2018-06-20T13:41:15Z", "WARC-IP-Address": "52.42.79.172", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DOGRJ7KRLCWYUIZHZQS5YCEXQTAZ2DTR", "WARC-Record-ID": "<urn:uuid:56628af2-7498-4c1d-b183-15cf08f9c770>", "WARC-Target-URI": "http://docs.splunk.com/Documentation/Splunk/7.1.0/SearchReference/From", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e35d12bf-877a-4786-a5ee-7dc44930490d>" }, "warc_info": "robots: classic\r\nhostname: ip-10-164-228-103.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 19, 20, 37, 38, 61, 62, 84, 85, 90, 91, 103, 104, 251, 252, 626, 627, 650, 651, 658, 659, 696, 697, 716, 717, 732, 755, 848, 1137, 1215, 1324, 1376, 1391, 1414, 1661, 1812, 1813, 1949, 1950, 1969, 1970, 1976, 1977, 1983, 1984, 2339, 2340, 2829, 2830, 2969, 2970, 3035, 3036, 3045, 3046, 3069, 3070, 3279, 3280, 3327, 3328, 3352, 3353, 3483, 3484, 3526, 3527, 3567, 3568, 3875, 3876, 3969, 3970, 4008, 4009, 4092, 4093, 4156, 4157, 4204, 4205, 4294, 4295, 4337, 4338, 4347, 4348, 4371, 4372, 4381, 4388, 4395, 4401, 4402, 4689, 4690, 4691, 4729, 4730, 4817, 4818, 4890, 4891, 4965, 4966, 5221, 5222 ], "line_end_idx": [ 19, 20, 37, 38, 61, 62, 84, 85, 90, 91, 103, 104, 251, 252, 626, 627, 650, 651, 658, 659, 696, 697, 716, 717, 732, 755, 848, 1137, 1215, 1324, 1376, 1391, 1414, 1661, 1812, 1813, 1949, 1950, 1969, 1970, 1976, 1977, 1983, 1984, 2339, 2340, 2829, 2830, 2969, 2970, 3035, 3036, 3045, 3046, 3069, 3070, 3279, 3280, 3327, 3328, 3352, 3353, 3483, 3484, 3526, 3527, 3567, 3568, 3875, 3876, 3969, 3970, 4008, 4009, 4092, 4093, 4156, 4157, 4204, 4205, 4294, 4295, 4337, 4338, 4347, 4348, 4371, 4372, 4381, 4388, 4395, 4401, 4402, 4689, 4690, 4691, 4729, 4730, 4817, 4818, 4890, 4891, 4965, 4966, 5221, 5222, 5246 ] }	{ "red_pajama_v2": { "ccnet_original_length": 5246, "ccnet_original_nlines": 106, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29038113355636597, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.018148820847272873, "rps_doc_frac_lines_end_with_ellipsis": 0.00934579037129879, "rps_doc_frac_no_alph_words": 0.2912885844707489, "rps_doc_frac_unique_words": 0.3595505654811859, "rps_doc_mean_word_length": 5.148564338684082, "rps_doc_num_sentences": 113, "rps_doc_symbol_to_word_ratio": 0.0009074399713426828, "rps_doc_unigram_entropy": 4.962739944458008, "rps_doc_word_count": 801, "rps_doc_frac_chars_dupe_10grams": 0.037827350199222565, "rps_doc_frac_chars_dupe_5grams": 0.1025703176856041, "rps_doc_frac_chars_dupe_6grams": 0.08680891990661621, "rps_doc_frac_chars_dupe_7grams": 0.05868088826537132, "rps_doc_frac_chars_dupe_8grams": 0.05868088826537132, "rps_doc_frac_chars_dupe_9grams": 0.037827350199222565, "rps_doc_frac_chars_top_2gram": 0.028370510786771774, "rps_doc_frac_chars_top_3gram": 0.016973810270428658, "rps_doc_frac_chars_top_4gram": 0.015276430174708366, "rps_doc_books_importance": -389.4061279296875, "rps_doc_books_importance_length_correction": -389.4061279296875, "rps_doc_openwebtext_importance": -208.5775146484375, "rps_doc_openwebtext_importance_length_correction": -208.5775146484375, "rps_doc_wikipedia_importance": -122.48080444335938, "rps_doc_wikipedia_importance_length_correction": -122.48080444335938 }, "fasttext": { "dclm": 0.18088054656982422, "english": 0.7831308841705322, "fineweb_edu_approx": 2.270883321762085, "eai_general_math": 0.6186164617538452, "eai_open_web_math": 0.06681478023529053, "eai_web_code": 0.8714621663093567 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.467", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
4,565,873,978,345,464,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. I am trying to write a regular expression to match any string that satisfies the following criteria. The string begins and ends with a matching pair of parentheses '(' ')' There may be any number of parentheses within it. For example my regex shud match : ( ( p(x)+q(x) ) . (p(x) * q(x) ) ) but not match ( p(x)+q(x) ) . ( p(x) * q(x) ) How do i write such a regex share\|improve this question Are you trying to say that all the internal parenthesis must match as well? If that is the case, I believe you would need to use a Push-Down-Automata instead of a regular expression to solve that, as a Finite-State-Automata (which define the space for a regex) does not allow for that type of a check. – aperkins Sep 13 '10 at 16:11 To clarify my comment - if you are looking for a regex to solve a[n]b[n], where you have an equal number of a – aperkins Sep 13 '10 at 16:11 dangit - stupid enter key - continuing: an equal number of a's and b's, then you would not be able to solve that general case with a regular expression. Based on what you have described, it seems like that is what you are looking for (in a variation, of course) which would require a PDA. – aperkins Sep 13 '10 at 16:12 To clarify, i am assuming that in my input all parentheses match. The only issue is that i want to capture those strings where the very first '(' matches the last ')'. That is, something like ( ... ) – AnkurVj Sep 13 '10 at 16:21 Now if i write a regex like ^\(.*\)$ JavaStyle then i match also the strings of the form (..)(..) and not just ( .... ) – AnkurVj Sep 13 '10 at 16:23 show 1 more comment 2 Answers 2 up vote 2 down vote accepted Please do a better search next time: http://www.google.com/search?q=site%3Astackoverflow.com+regex+match+parentheses&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a Here's your answer: http://stackoverflow.com/questions/546433/regular-expression-to-match-outer-brackets share\|improve this answer Thanx for the pointer – AnkurVj Sep 13 '10 at 16:32 Yep, as the accepted answer notes - this is a simple algorithmic problem, not really appropriate for regex. Thanks for the link. – aperkins Sep 13 '10 at 16:55 add comment Doing any sort of parsing like this using regular expressions is difficult and almost always a bad idea. See this answer to this question. Oh, the horror! share\|improve this answer lol nicely put by the author – AnkurVj Sep 13 '10 at 17:24 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/3702206/matching-parantheses-using-a-regular-expression", "source_domain": "stackoverflow.com", "snapshot_id": "crawl=CC-MAIN-2014-23", "warc_metadata": { "Content-Length": "79859", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:V5AP5E7U7SFCYAHWVAWS4PSQMYOP5CCM", "WARC-Concurrent-To": "<urn:uuid:42a15804-5588-4d32-beea-320acf4195b8>", "WARC-Date": "2014-07-23T23:01:48Z", "WARC-IP-Address": "198.252.206.16", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:XBDO2ZA4XPKZZAQAWBWNZWQ6F24WZRY5", "WARC-Record-ID": "<urn:uuid:03ef4be3-4a21-4793-95a4-435f40d7658b>", "WARC-Target-URI": "http://stackoverflow.com/questions/3702206/matching-parantheses-using-a-regular-expression", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:01ff89ec-8b42-4b77-af1c-616d3f433bd6>" }, "warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 25, 157, 158, 259, 260, 331, 332, 382, 383, 417, 418, 453, 454, 468, 469, 501, 502, 530, 531, 559, 564, 898, 903, 1045, 1050, 1371, 1376, 1607, 1612, 1763, 1783, 1784, 1796, 1797, 1826, 1827, 2015, 2016, 2121, 2122, 2148, 2153, 2206, 2211, 2372, 2384, 2385, 2540, 2541, 2567, 2572, 2632, 2644, 2645, 2657, 2658, 2660, 2668, 2669, 2747, 2748 ], "line_end_idx": [ 25, 157, 158, 259, 260, 331, 332, 382, 383, 417, 418, 453, 454, 468, 469, 501, 502, 530, 531, 559, 564, 898, 903, 1045, 1050, 1371, 1376, 1607, 1612, 1763, 1783, 1784, 1796, 1797, 1826, 1827, 2015, 2016, 2121, 2122, 2148, 2153, 2206, 2211, 2372, 2384, 2385, 2540, 2541, 2567, 2572, 2632, 2644, 2645, 2657, 2658, 2660, 2668, 2669, 2747, 2748, 2838 ] }	{ "red_pajama_v2": { "ccnet_original_length": 2838, "ccnet_original_nlines": 61, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.37463125586509705, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.005899710115045309, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3023598790168762, "rps_doc_frac_unique_words": 0.47228381037712097, "rps_doc_mean_word_length": 4.65188455581665, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0.002949849935248494, "rps_doc_unigram_entropy": 4.927626132965088, "rps_doc_word_count": 451, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07054337114095688, "rps_doc_frac_chars_dupe_6grams": 0.07054337114095688, "rps_doc_frac_chars_dupe_7grams": 0.020972350612282753, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.01906578056514263, "rps_doc_frac_chars_top_3gram": 0.026692090556025505, "rps_doc_frac_chars_top_4gram": 0.03431839868426323, "rps_doc_books_importance": -317.77978515625, "rps_doc_books_importance_length_correction": -317.77978515625, "rps_doc_openwebtext_importance": -190.23390197753906, "rps_doc_openwebtext_importance_length_correction": -190.23390197753906, "rps_doc_wikipedia_importance": -139.52252197265625, "rps_doc_wikipedia_importance_length_correction": -139.52252197265625 }, "fasttext": { "dclm": 0.33957868814468384, "english": 0.8482621312141418, "fineweb_edu_approx": 1.0031183958053589, "eai_general_math": 0.002724289894104004, "eai_open_web_math": 0.45768141746520996, "eai_web_code": 0.000013830000170855783 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.13", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "1", "label": "Leftover HTML" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-3,702,387,502,569,288,000	Cisco Blogs Share Happy Bastille Day: Vive La France - July 14, 2006 - 1 Comment PARIS, FRANCE – (In spirit) – France is in the news quite a bit these days. All the world is talking about the famous French World Cup headbutt heard around the world. Lip-readers have been hired to determine was was said* and apologies have been issued, however the World Cup still resides in Rome. Also in the news today is Bastille Day. On this same day in 1789 a movement for freedom was started when the famous prison was stormed by the French citizenry. It was an attack to the core of French royalty. The French Revolution had begun and now we have the French Republic.This blog entry is clearly about broadband. Why? Because broadband is also a revolution. It is a revolution from static, cookie-cutter information. Broadband is about anytime, anywhere information. Broadband is a personalized communication revolution. With broadband, you can have your information how you want it, when you want, where you want it and in what form you want it. Traditional, royal information fed to us via print is slowly fading away. Broadband is managing businesses, managing supply chains and managing financial markets. It is a management tool and a time-saving tool, as well as a consumer information tool. Just as the French royalty could not stop the French Revolution, so too will traditional communications not be able to stop the steady onslaught of the Broadband Revolution.As it is Bastille Day and we’re talking about broadband, I would encourage you to read a previous blog entry from my colleague in Paris, Olivier Esper. He writes about how France is also a leader in the broadband revolution.So, Happy Bastille Day and Happy Communications Revolution.*Lip readers have conjectured that Italian defender Marco Materazzi said something along the lines of “your mother and sister wear Army boots” (or some such). My thesis is that Materazzi actually said, “Italian broadband via FastWeb and Italtel is better than French broadband.” Those indeed could be head-butting words. : ) In an effort to keep conversations fresh, Cisco Blogs closes comments after 60 days. Please visit the Cisco Blogs hub page for the latest content. 1 Comments 1. In practice, the advertised bandwidth is not always reliably available to the customer; ISPs often allow a greater number of subscribers than their backbone connection can handle, under the assumption that most users will not be using their full connection capacity very frequently. This aggregation strategy works more often than not, so users can typically burst to their full bandwidth most of the time; however, peer-to-peer (P2P) file sharing systems, often requiring extended durations of high bandwidth, stress these assumptions, and can cause major problems for ISPs who have excessively overbooked their capacity. For more on this topic, see traffic shaping. As takeup for these introductory products increases, telcos are starting to offer higher bit rate services. For existing connections, this most of the time simply involves reconfiguring the existing equipment at each end of the connection. Share	{ "url": "https://blogs.cisco.com/gov/happy_bastille_day_vive_la_france", "source_domain": "blogs.cisco.com", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "47534", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4LI5P2Z4TGEIV7YGS7QA6ZMURII7I4BC", "WARC-Concurrent-To": "<urn:uuid:67980406-5323-4188-bfa7-2b1a3a5f7a9a>", "WARC-Date": "2018-02-19T06:05:11Z", "WARC-IP-Address": "173.37.216.10", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LXD6X5VVVLDWJX5R2ZVJONDMSJ3RG2IP", "WARC-Record-ID": "<urn:uuid:77cd8f80-45b2-42f6-9fec-ce95d1c515ab>", "WARC-Target-URI": "https://blogs.cisco.com/gov/happy_bastille_day_vive_la_france", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a9de1450-552c-4095-a104-d889c7a25155>" }, "warc_info": "robots: classic\r\nhostname: ip-10-47-182-162.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }	{ "line_start_idx": [ 0, 12, 18, 19, 54, 55, 83, 84, 2070, 2071, 2218, 2219, 2230, 2231, 3144, 3145 ], "line_end_idx": [ 12, 18, 19, 54, 55, 83, 84, 2070, 2071, 2218, 2219, 2230, 2231, 3144, 3145, 3150 ] }	{ "red_pajama_v2": { "ccnet_original_length": 3150, "ccnet_original_nlines": 15, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3862876296043396, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.006688959896564484, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15217390656471252, "rps_doc_frac_unique_words": 0.5326732993125916, "rps_doc_mean_word_length": 5.055445671081543, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.197370529174805, "rps_doc_word_count": 505, "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.017626319080591202, "rps_doc_frac_chars_top_3gram": 0.010575789958238602, "rps_doc_frac_chars_top_4gram": 0.010184099897742271, "rps_doc_books_importance": -290.4344787597656, "rps_doc_books_importance_length_correction": -290.4344787597656, "rps_doc_openwebtext_importance": -201.65875244140625, "rps_doc_openwebtext_importance_length_correction": -201.65875244140625, "rps_doc_wikipedia_importance": -145.51046752929688, "rps_doc_wikipedia_importance_length_correction": -145.51046752929688 }, "fasttext": { "dclm": 0.021327199414372444, "english": 0.9606616497039795, "fineweb_edu_approx": 2.014685869216919, "eai_general_math": 0.022671040147542953, "eai_open_web_math": 0.25828665494918823, "eai_web_code": 0.0005311400163918734 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "303.483", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social sciences — Dictionaries" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "13", "label": "News (Org.)" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-4,372,496,134,486,656,000	Safari, the world’s most comprehensive technology and business learning platform. Find the exact information you need to solve a problem on the fly, or go deeper to master the technologies and skills you need to succeed Start Free Trial No credit card required O'Reilly logo Moodle Administration Essentials Book Description Learn how to set up, maintain, and support your Moodle site efficiently In Detail This book begins with a brief look at Moodle's background and an examination of its architectural structure and LAMP architecture. You'll learn to create user accounts and understand the methods of authentication based on manual accounts and e-mail-based self-registrations. You'll then develop the Moodle site structure and course set up, and discover how to edit it through a sample faculty site. Next, you'll configure two of the standard themes in Moodle and apply them to organizational branding. You'll also explore how plugins are configured and installed, and learn about backing up, resetting, and restoring Moodle courses. Finally, you'll learn Moodle's security options, along with performance testing, and how to use the built-in Moodle performance testing script. What You Will Learn • Manage user accounts, authenticate users, and control user permissions with roles • Enhance your Moodle site with plugins such as activity modules, admin reports, admin tools, and more • Brand your Moodle site with configured themes • Set up the structure of your site using categories in Moodle • Prepare your site for end-of-year rollover • Install Moodle on a Linux Server • Monitor the usage and performance of your Moodle site • Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the files e-mailed directly to you. Table of Contents 1. Moodle Administration Essentials 1. Table of Contents 2. Moodle Administration Essentials 3. Credits 4. About the Authors 5. About the Reviewers 6. www.PacktPub.com 1. Support files, eBooks, discount offers, and more 1. Why subscribe? 2. Free access for Packt account holders 7. Preface 1. What this book covers 2. What you need for this book 3. Who this book is for 4. Conventions 5. Reader feedback 6. Customer support 1. Errata 2. Piracy 3. Questions 8. 1. Moodle in a Nutshell 1. Background of Moodle 2. Architecture of Moodle 3. Installing Moodle 1. Server specifications 1. Hardware 2. Software 2. Code specifications 1. Moodle download 2. File permissions 3. Database setup 4. Moodledata directory setup 5. Moodle installer 6. Essential configurations 1. Email settings 2. System paths 3. Cron 4. Updating Moodle 1. Upgrading from one version to another 1. Cloning your Moodle site 2. Upgrade preparation 3. Moodle code directory 4. Moodle data directory 5. Moodle database 6. Moodle download 2. Maintaining the version code 3. When to update 5. Summary 9. 2. Managing User Accounts and Authentication 1. Creating users 2. Editing a user 1. Searching for a user account 2. Editing the user account 3. Uploading users 1. Preparing the spreadsheet 2. Uploading the spreadsheet 4. User authentication 1. Authentication types 2. How to enable authentication plugins 3. Authentication configuration for a single user creation 4. Authentication configuration for the CSV file user upload 5. Manual authentication 1. The optional configuration 6. Email-based self-registration authentication 1. The optional configuration 5. Summary 10. 3. Managing Categories and Courses 1. Category creation 2. Course and category management 3. Course creation 4. Uploading courses 1. Preparing the spreadsheet 2. Uploading the spreadsheet 5. Course templates 1. Restore a course 2. Clone a course 6. Summary 11. 4. Managing Site Appearance 1. Configuring the landing page 2. Configuring the front page 3. Global theme settings 4. Introducing the Clean theme 1. Configuring the Clean theme 5. Introducing the More theme 1. Configuring the More theme 6. Cloning a theme 7. Summary 12. 5. Role Management 1. Understanding terminologies 2. Standard roles 3. Managing role permissions 1. Cloning a role 2. Creating a new role 3. Creating a course requester role 4. Applying a role override for a specific context 5. Testing a role 6. Manually adding a user to a course 7. Enabling self-enrolment for a course 4. Other custom roles 5. Summary 13. 6. Managing Site Plugins 1. What are plugins? 2. Where to find plugins 3. Considerations when choosing a plugin 4. Installing plugins 1. Manually installing a plugin ZIP file 2. Installing a plugin from the Moodle plugins directory 3. Installing a plugin from a source control URL 5. Editing plugin settings 6. Updating plugins 7. Uninstalling plugins 8. Summary 14. 7. End of Year Course Rollover 1. Rollover implementation 1. Backup of the entire Moodle site 2. Duplication of courses in the same Moodle after backups 3. Resetting courses after a backup 4. Selecting the right approach 2. Course backup 1. Teacher permissions in course backup 2. Course creator permissions in course backup 3. Administrator permissions in course backup 4. Making a backup of a course 5. Setting up automated course backups 3. Course restore 1. Teacher permissions in course restore 2. Course creator permissions in course restore 3. Administrator permissions in course restore 4. Restoring a course 4. Course reset 5. Summary 15. 8. Miscellaneous Admin Tasks 1. Monitoring Moodle usage 1. Statistics 2. Reports 1. Comments 2. Backups 3. Config changes 4. Course overview 5. Events list 6. Logs 7. Live logs 8. Performance overview 9. Question instances 10. Security overview 11. Statistics 12. Event monitoring rules 13. Spam cleaner 2. Performance testing 1. JMeter 2. Performance comparison 3. Security and resilience 1. Security 2. IP Blocker 3. Site policies 4. HTTP security 5. Notifications 6. Anti-Virus 7. Security overview report 4. General considerations 1. Force users to log in 2. Disable log in as a guest 3. Enable timezones 4. Enable cron 5. Debug messages 6. Purge all caches 7. Enhancing the My Home page or Dashboard 8. Language customization 9. Enabling site administrators 10. Enabling maintenance mode 11. Support contact details 12. Administration search box 5. Summary 16. Index	{ "url": "https://www.safaribooksonline.com/library/view/moodle-administration-essentials/9781784395476/", "source_domain": "www.safaribooksonline.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "73759", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NT2BKMYM5W23QBQPLRD5DR4HIQ65V7HP", "WARC-Concurrent-To": "<urn:uuid:813cf2ee-d176-428d-b47b-3e01151182a6>", "WARC-Date": "2017-02-26T01:23:10Z", "WARC-IP-Address": "151.101.33.132", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:SHRZKKZG7CXLILNWNJY5UEF372UCPPW6", "WARC-Record-ID": "<urn:uuid:8549509b-9afe-4a85-bbc7-52e8f1ad210b>", "WARC-Target-URI": "https://www.safaribooksonline.com/library/view/moodle-administration-essentials/9781784395476/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:57284ad6-38d0-4cff-8bd3-a1a58244e947>" }, "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, 82, 83, 221, 222, 239, 240, 264, 265, 279, 312, 313, 330, 331, 403, 404, 414, 415, 546, 547, 1049, 1050, 1194, 1195, 1215, 1216, 1302, 1303, 1408, 1409, 1459, 1460, 1525, 1526, 1573, 1574, 1611, 1612, 1670, 1671, 1985, 1986, 2008, 2009, 2049, 2076, 2118, 2135, 2162, 2191, 2217, 2277, 2305, 2356, 2373, 2406, 2445, 2477, 2500, 2527, 2555, 2575, 2595, 2618, 2651, 2683, 2717, 2746, 2781, 2805, 2829, 2862, 2893, 2925, 2955, 2997, 3029, 3069, 3101, 3131, 3153, 3180, 3231, 3271, 3306, 3343, 3380, 3411, 3442, 3484, 3512, 3531, 3585, 3611, 3637, 3679, 3717, 3744, 3783, 3822, 3853, 3887, 3937, 4006, 4077, 4112, 4154, 4212, 4254, 4273, 4318, 4347, 4389, 4416, 4445, 4484, 4523, 4551, 4581, 4609, 4628, 4666, 4706, 4744, 4777, 4816, 4857, 4895, 4935, 4962, 4981, 5010, 5049, 5075, 5112, 5140, 5173, 5219, 5280, 5308, 5356, 5406, 5436, 5455, 5490, 5519, 5552, 5601, 5631, 5682, 5749, 5808, 5843, 5871, 5903, 5922, 5963, 5998, 6044, 6113, 6159, 6201, 6226, 6276, 6333, 6389, 6430, 6479, 6505, 6556, 6614, 6671, 6703, 6727, 6746, 6785, 6820, 6844, 6865, 6889, 6912, 6942, 6973, 7000, 7020, 7045, 7081, 7115, 7149, 7176, 7215, 7244, 7275, 7295, 7331, 7366, 7388, 7412, 7439, 7466, 7493, 7517, 7555, 7589, 7624, 7663, 7693, 7718, 7746, 7776, 7829, 7865, 7907, 7947, 7985, 8025, 8044 ], "line_end_idx": [ 82, 83, 221, 222, 239, 240, 264, 265, 279, 312, 313, 330, 331, 403, 404, 414, 415, 546, 547, 1049, 1050, 1194, 1195, 1215, 1216, 1302, 1303, 1408, 1409, 1459, 1460, 1525, 1526, 1573, 1574, 1611, 1612, 1670, 1671, 1985, 1986, 2008, 2009, 2049, 2076, 2118, 2135, 2162, 2191, 2217, 2277, 2305, 2356, 2373, 2406, 2445, 2477, 2500, 2527, 2555, 2575, 2595, 2618, 2651, 2683, 2717, 2746, 2781, 2805, 2829, 2862, 2893, 2925, 2955, 2997, 3029, 3069, 3101, 3131, 3153, 3180, 3231, 3271, 3306, 3343, 3380, 3411, 3442, 3484, 3512, 3531, 3585, 3611, 3637, 3679, 3717, 3744, 3783, 3822, 3853, 3887, 3937, 4006, 4077, 4112, 4154, 4212, 4254, 4273, 4318, 4347, 4389, 4416, 4445, 4484, 4523, 4551, 4581, 4609, 4628, 4666, 4706, 4744, 4777, 4816, 4857, 4895, 4935, 4962, 4981, 5010, 5049, 5075, 5112, 5140, 5173, 5219, 5280, 5308, 5356, 5406, 5436, 5455, 5490, 5519, 5552, 5601, 5631, 5682, 5749, 5808, 5843, 5871, 5903, 5922, 5963, 5998, 6044, 6113, 6159, 6201, 6226, 6276, 6333, 6389, 6430, 6479, 6505, 6556, 6614, 6671, 6703, 6727, 6746, 6785, 6820, 6844, 6865, 6889, 6912, 6942, 6973, 7000, 7020, 7045, 7081, 7115, 7149, 7176, 7215, 7244, 7275, 7295, 7331, 7366, 7388, 7412, 7439, 7466, 7493, 7517, 7555, 7589, 7624, 7663, 7693, 7718, 7746, 7776, 7829, 7865, 7907, 7947, 7985, 8025, 8044, 8059 ] }	{ "red_pajama_v2": { "ccnet_original_length": 8059, "ccnet_original_nlines": 216, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20046620070934296, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0054390099830925465, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.33721834421157837, "rps_doc_frac_unique_words": 0.3589743673801422, "rps_doc_mean_word_length": 5.0532546043396, "rps_doc_num_sentences": 201, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.198794841766357, "rps_doc_word_count": 1014, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07025761157274246, "rps_doc_frac_chars_dupe_6grams": 0.031615931540727615, "rps_doc_frac_chars_dupe_7grams": 0.018735360354185104, "rps_doc_frac_chars_dupe_8grams": 0.018735360354185104, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013661200180649757, "rps_doc_frac_chars_top_3gram": 0.022248240187764168, "rps_doc_frac_chars_top_4gram": 0.014636999927461147, "rps_doc_books_importance": -578.31298828125, "rps_doc_books_importance_length_correction": -578.31298828125, "rps_doc_openwebtext_importance": -292.8965759277344, "rps_doc_openwebtext_importance_length_correction": -292.8965759277344, "rps_doc_wikipedia_importance": -216.1768341064453, "rps_doc_wikipedia_importance_length_correction": -216.1768341064453 }, "fasttext": { "dclm": 0.9898528456687927, "english": 0.7478158473968506, "fineweb_edu_approx": 1.1776559352874756, "eai_general_math": 0.011552750132977962, "eai_open_web_math": 0.019583940505981445, "eai_web_code": 0.0001128899966715835 } }	{ "free_decimal_correspondence": { "primary": { "code": "004.072", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "371.392", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Teachers, Teaching, and School management and organization" } } }, "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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-5,142,496,146,890,240,000	In the realm of mathematics, regrouping is a fundamental concept that plays a crucial role in performing operations such as addition and subtraction with multi-digit numbers. It is a strategy that allows us to manipulate numbers effectively and arrive at accurate results. In this article, we will delve into the meaning of regrouping, explore its applications, and provide step-by-step explanations along with relevant examples. So let’s embark on this mathematical journey and unlock the secrets of regrouping! Understanding Regrouping in Math Regrouping, also known as “carrying” or “borrowing,” involves rearranging digits within numbers when performing mathematical operations. It mainly comes into play when dealing with numbers that have more than one digit. The primary purpose of regrouping is to ensure accurate computations and maintain the place value system. Regrouping in Addition When adding multi-digit numbers, regrouping occurs when the sum of digits in a specific place value column exceeds nine. Let’s understand this concept with an example: Example 1: Consider the addition problem: 58 + 47. Here’s how regrouping helps us solve it: 58 + 47 ------- 105 To solve this problem, we start by adding the digits in the ones column: 8 + 7 equals 15. Since 15 is greater than nine, we regroup the ten’s value by carrying the digit 1 to the tens column. The remaining value, 5, stays in the ones column. Then, we add the digits in the tens column, including the carried value, which gives us 5 + 4 + 1, equaling 10. Finally, we write down the resulting sum, 105. Regrouping in Subtraction In subtraction, regrouping comes into play when the digit being subtracted is larger than the corresponding digit in the minuend. Let’s consider an example: Example 2: Let’s subtract 364 from 598. Regrouping is necessary in this scenario: 598 - 364 ------- 234 Starting from the ones column, we subtract 4 from 8, which gives us 4. In the tens column, we need to subtract 6 from 9. However, since 6 is larger than 9, we need to regroup. We borrow 1 from the hundreds column and increase the value of the tens column by 10, making it 19. Now, we subtract 6 from 19, resulting in 13. Finally, we subtract 3 from 5 in the hundreds column, giving us 2. Thus, the difference between 598 and 364 is 234. Teaching Regrouping in Math: A Step-by-Step Approach To ensure a thorough understanding of regrouping among students, it is crucial to follow a step-by-step teaching approach. Let’s explore three essential steps to help students grasp this concept effectively. Step 1: Introduce Manipulatives and Hands-on Experience To provide students with a concrete understanding of regrouping, begin by using manipulatives such as base-10 blocks or Montessori decimal system beads. These physical objects help students visualize the concept of tens, units, hundreds, and thousands. By engaging in hands-on activities, students can count and exchange units for tens or vice versa, gaining a tangible sense of regrouping. Step 2: Utilize Visual Representations Once students have experienced regrouping through manipulatives, introduce visual representations to aid their understanding. Visuals can include diagrams, charts, or drawings that illustrate the regrouping process. Online math programs like Happy Numbers offer interactive problems with visual cues to reinforce the concept. Visuals bridge the gap between the use of manipulatives and the eventual transition to pencil-and-paper calculations. Step 3: Progress to Traditional Methods After students have gained proficiency with manipulatives and visual representations, gradually introduce them to traditional pencil-and-paper methods of performing regrouping operations. Emphasize the importance of place value and guide them through the step-by-step procedures. Practice problems with varying difficulty levels will help solidify their understanding and enhance their computational skills. Importance of Regrouping in Real-Life Situations Regrouping is not limited to mathematical exercises; its applications extend beyond the classroom into real-life situations. Let’s explore a few instances where regrouping is relevant: Financial Transactions Regrouping becomes essential when handling monetary transactions involving large sums of money. For instance, when calculating the total cost of groceries, if the units exceed nine, regrouping is necessary to accurately determine the total amount. Time Management Regrouping plays a role in time management as well. When scheduling appointments or allocating time for various activities, regrouping can help ensure efficient utilization of time slots and effective time management. Data Analysis In fields such as statistics, regrouping aids in organizing and analyzing data. Grouping data into categories or intervals allows for better visualization and comprehension of information. Conclusion Regrouping is a fundamental concept in mathematics that enables us to perform accurate calculations, understand place value, and solve complex problems. By following a systematic teaching approach and providing students with manipulatives, visuals, and practice opportunities, we can help them develop a deep conceptual understanding of regrouping. The applications of regrouping extend beyond the math classroom, enhancing financial literacy, time management, and data analysis skills. So, embrace the power of regrouping and unlock the potential for mathematical success! FAQ What are some common examples of regrouping in math? ne common example of regrouping in math is when adding two-digit numbers, such as 48 + 37. Here, regrouping occurs when adding the ones column because 8 + 7 equals 15, which is greater than 9. So, we regroup the 10s by carrying over the value to the 10s column and write down the units. Another example is in subtraction, where regrouping is necessary when subtracting numbers with larger digits in the same place value. For instance, subtracting 209 from 395 requires regrouping in both the tens and ones columns. Are there different methods of regrouping in math? Yes, there are different methods of regrouping in math. The most commonly used methods are the traditional method, which involves carrying or borrowing digits when performing addition or subtraction, and the expanded form method, where numbers are expanded into their place value components and regrouping is done based on the values of the digits. How can regrouping be applied to addition and subtraction problems? Regrouping is applied in addition when the sum of digits in a column is greater than 9. In such cases, we carry the excess value to the next higher place value column. For subtraction, regrouping is required when the digit being subtracted is larger than the corresponding digit in the minuend. We borrow from the higher place value column to adjust the value and ensure accurate subtraction. How does regrouping relate to place value in mathematics? Regrouping is closely tied to the concept of place value in mathematics. It involves rearranging or exchanging digits within numbers to maintain the value of each digit based on its position or place value. By regrouping, we ensure that the value of each digit is correctly represented within the number, thereby preserving the place value system. Are there any online resources or apps for practicing regrouping in math? Yes, there are several online resources and apps available for practicing regrouping in math. Some popular options include educational websites like Khan Academy, MathPlayground, and SplashLearn, which offer interactive games, worksheets, and tutorials specifically designed to help students practice regrouping. Additionally, educational math apps such as Happy Numbers and Mathletics also provide regrouping practice modules to enhance learning and understanding. Opt out or Contact us anytime. See our Privacy Notice Follow us on Reddit for more insights and updates. Comments (0) Welcome to AHelp comments! We’re all about debate and discussion at AHelp. We value the diverse opinions of users, so you may find points of view that you don’t agree with. And that’s cool. However, there are certain things we’re not OK with: attempts to manipulate our data in any way, for example, or the posting of discriminative, offensive, hateful, or disparaging material. Your email address will not be published. Required fields are marked * Login Register \| Lost your password?	{ "url": "https://academichelp.net/stem/math/what-is-regrouping.html", "source_domain": "academichelp.net", "snapshot_id": "CC-MAIN-2023-40", "warc_metadata": { "Content-Length": "203678", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:EWZWDNRI3PLXF4353XSO5T2PIS7YKVYD", "WARC-Concurrent-To": "<urn:uuid:7d73a5b7-ea30-4d55-8242-73b8c253c5d7>", "WARC-Date": "2023-09-27T05:56:21Z", "WARC-IP-Address": "172.67.70.165", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IF6EGRZF355Z3TFDXZ7JNCWJCRSSZDIF", "WARC-Record-ID": "<urn:uuid:e726e467-e1c5-4b21-a15b-d7e9f8616b37>", "WARC-Target-URI": "https://academichelp.net/stem/math/what-is-regrouping.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:db2f32cc-60b1-48cc-a1b0-9075c25a194a>" }, "warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 513, 514, 547, 548, 874, 875, 898, 899, 1067, 1068, 1160, 1161, 1168, 1175, 1183, 1189, 1190, 1591, 1592, 1618, 1619, 1776, 1777, 1859, 1860, 1868, 1876, 1884, 1890, 1891, 2328, 2329, 2382, 2383, 2591, 2592, 2648, 2649, 3040, 3041, 3080, 3081, 3525, 3526, 3566, 3567, 3975, 3976, 4025, 4026, 4211, 4212, 4235, 4236, 4484, 4485, 4501, 4502, 4720, 4721, 4735, 4736, 4925, 4926, 4937, 4938, 5512, 5513, 5517, 5518, 5571, 5572, 5859, 5860, 6088, 6089, 6140, 6141, 6490, 6491, 6559, 6560, 6953, 6954, 7012, 7013, 7361, 7362, 7436, 7437, 7903, 7904, 7958, 7959, 8010, 8011, 8024, 8025, 8053, 8054, 8103, 8104, 8408, 8409, 8480, 8481, 8487, 8488 ], "line_end_idx": [ 513, 514, 547, 548, 874, 875, 898, 899, 1067, 1068, 1160, 1161, 1168, 1175, 1183, 1189, 1190, 1591, 1592, 1618, 1619, 1776, 1777, 1859, 1860, 1868, 1876, 1884, 1890, 1891, 2328, 2329, 2382, 2383, 2591, 2592, 2648, 2649, 3040, 3041, 3080, 3081, 3525, 3526, 3566, 3567, 3975, 3976, 4025, 4026, 4211, 4212, 4235, 4236, 4484, 4485, 4501, 4502, 4720, 4721, 4735, 4736, 4925, 4926, 4937, 4938, 5512, 5513, 5517, 5518, 5571, 5572, 5859, 5860, 6088, 6089, 6140, 6141, 6490, 6491, 6559, 6560, 6953, 6954, 7012, 7013, 7361, 7362, 7436, 7437, 7903, 7904, 7958, 7959, 8010, 8011, 8024, 8025, 8053, 8054, 8103, 8104, 8408, 8409, 8480, 8481, 8487, 8488, 8518 ] }	{ "red_pajama_v2": { "ccnet_original_length": 8518, "ccnet_original_nlines": 108, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3609851002693176, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0032404400408267975, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18211276829242706, "rps_doc_frac_unique_words": 0.3598130941390991, "rps_doc_mean_word_length": 5.400311470031738, "rps_doc_num_sentences": 77, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.424766540527344, "rps_doc_word_count": 1284, "rps_doc_frac_chars_dupe_10grams": 0.020767230540513992, "rps_doc_frac_chars_dupe_5grams": 0.06259013712406158, "rps_doc_frac_chars_dupe_6grams": 0.042111340910196304, "rps_doc_frac_chars_dupe_7grams": 0.026824340224266052, "rps_doc_frac_chars_dupe_8grams": 0.020767230540513992, "rps_doc_frac_chars_dupe_9grams": 0.020767230540513992, "rps_doc_frac_chars_top_2gram": 0.02422844059765339, "rps_doc_frac_chars_top_3gram": 0.018459759652614594, "rps_doc_frac_chars_top_4gram": 0.01038361992686987, "rps_doc_books_importance": -698.5225219726562, "rps_doc_books_importance_length_correction": -698.5225219726562, "rps_doc_openwebtext_importance": -434.7918395996094, "rps_doc_openwebtext_importance_length_correction": -434.7918395996094, "rps_doc_wikipedia_importance": -315.17877197265625, "rps_doc_wikipedia_importance_length_correction": -315.17877197265625 }, "fasttext": { "dclm": 0.9833950996398926, "english": 0.8842111229896545, "fineweb_edu_approx": 3.3929824829101562, "eai_general_math": 0.8255244493484497, "eai_open_web_math": 0.21181941032409668, "eai_web_code": 0.13637399673461914 } }	{ "free_decimal_correspondence": { "primary": { "code": "513.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "372.7", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Education, Elementary and Kindergarten" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4
-3,724,150,155,380,891,000	Project General Profile oscam-emu.11384.patch Joe User, 2017-06-15 00:51 View differences: CMakeLists.txt (working copy) 101 101 ${CMAKE_CURRENT_SOURCE_DIR}/csctapi 102 102 ${CMAKE_CURRENT_SOURCE_DIR}/cscrypt 103 103 ${CMAKE_CURRENT_SOURCE_DIR}/minilzo 104 ${CMAKE_CURRENT_SOURCE_DIR}/ffdecsa 104 105 ${CMAKE_CURRENT_SOURCE_DIR}/extapi/cygwin 105 106 /usr/include/w32api 106 107 ${OPTIONAL_INCLUDE_DIR} ...... 110 111 ${CMAKE_CURRENT_SOURCE_DIR}/csctapi 111 112 ${CMAKE_CURRENT_SOURCE_DIR}/cscrypt 112 113 ${CMAKE_CURRENT_SOURCE_DIR}/minilzo 114 ${CMAKE_CURRENT_SOURCE_DIR}/ffdecsa 113 115 ${OPTIONAL_INCLUDE_DIR} 114 116 ) 115 117 endif (OSCamOperatingSystem MATCHES "Windows/Cygwin") ...... 420 422 # Manage config.h based on command line parameters 421 423 # Manipulate config file based on given parameters and read unset parameters 422 424 425 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --enabled WITH_EMU OUTPUT_VARIABLE CONFIG_WITH_EMU OUTPUT_STRIP_TRAILING_WHITESPACE) 426 if (CONFIG_WITH_EMU MATCHES "Y" AND NOT WITH_EMU EQUAL 1) 427 add_definitions ("-DWITH_EMU") 428 set (WITH_EMU "1") 429 message(STATUS " EMU is added by config compiling with EMU") 430 endif(CONFIG_WITH_EMU MATCHES "Y" AND NOT WITH_EMU EQUAL 1) 431 423 432 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --show-valid OUTPUT_VARIABLE config_vars_string OUTPUT_STRIP_TRAILING_WHITESPACE) 424 433 string(REGEX MATCHALL "[A-Z0-9_]+" config_vars ${config_vars_string}) 425 434 ...... 449 458 add_subdirectory (csctapi) 450 459 add_subdirectory (minilzo) 451 460 add_subdirectory (cscrypt) 461 add_subdirectory (ffdecsa) 452 462 453 463 #----------------------- file groups ------------------------------ 454 464 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --enabled MODULE_CAMD33 OUTPUT_VARIABLE CAMD33 OUTPUT_STRIP_TRAILING_WHITESPACE) ...... 498 508 499 509 set (exe_name "oscam") 500 510 add_executable (${exe_name} ${exe_srcs} ${exe_hdrs}) 501 target_link_libraries (${exe_name} ${csoscam} ${csmodules} ${csreaders} csctapi cscrypt minilzo) 511 target_link_libraries (${exe_name} ${csoscam} ${csmodules} ${csreaders} csctapi cscrypt minilzo ffdecsa) 502 512 if(HAVE_LIBRT AND HAVE_LIBUSB) 503 513 if (LIBUSBDIR) 504 514 set (libusb_link "imp_libusb") ...... 647 657 execute_process(COMMAND ${CMAKE_C_COMPILER} -dumpmachine COMMAND tr -d '\n' OUTPUT_VARIABLE CS_TARGET) 648 658 add_definitions ("-D'CS_TARGET=\"${CS_TARGET}\"'") 649 659 #----------------------- global compile and link options ------------------------------ 660 #enable sse2 on x86 661 if (CMAKE_SYSTEM_PROCESSOR MATCHES "(x86)\|(X86)\|(amd64)\|(AMD64)") 662 set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -msse -msse2 -msse3") 663 endif (CMAKE_SYSTEM_PROCESSOR MATCHES "(x86)\|(X86)\|(amd64)\|(AMD64)") 664 650 665 # disable warning about unused but set variables in gcc 4.6+ 651 666 if (CMAKE_COMPILER_IS_GNUCC) 652 667 execute_process(COMMAND ${CMAKE_C_COMPILER} -dumpversion OUTPUT_VARIABLE GCC_VERSION) ...... 731 746 732 747 #-------------------------------------------------------------------------------- 733 748 749 if (NOT OSCamOperatingSystem MATCHES "Mac OS X") 750 if (NOT DEFINED ENV{ANDROID_NDK}) 751 if (NOT DEFINED ENV{ANDROID_STANDALONE_TOOLCHAIN}) 752 if(WITH_EMU) 753 if(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 754 execute_process(COMMAND cp ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key ${CMAKE_CURRENT_BINARY_DIR}/SoftCam.Key) 755 else(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 756 execute_process(COMMAND touch ${CMAKE_CURRENT_BINARY_DIR}/SoftCam.Key) 757 endif(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 758 execute_process(COMMAND touch ${CMAKE_CURRENT_BINARY_DIR}/utils/SoftCam.Key) 759 set (CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,--format=binary -Wl,SoftCam.Key -Wl,--format=default" ) 760 endif(WITH_EMU) 761 endif (NOT DEFINED ENV{ANDROID_STANDALONE_TOOLCHAIN}) 762 endif (NOT DEFINED ENV{ANDROID_NDK}) 763 endif (NOT OSCamOperatingSystem MATCHES "Mac OS X") 764 734 765 #----------------------- installation ----------------------------- 735 766 736 767 file (GLOB config_files "${CMAKE_CURRENT_SOURCE_DIR}/Distribution/oscam.") ...... 819 850 endif(STATICLIBUSB AND NOT LIBUSBDIR) 820 851 endif (HAVE_LIBUSB) 821 852 853 if (WITH_EMU) 854 message(STATUS " Compile with EMU support") 855 endif (WITH_EMU) 856 822 857 message (STATUS "") Makefile (working copy) 65 65 66 66 LDFLAGS = -Wl,--gc-sections 67 67 68 TARGETHELP := $(shell $(CC) --target-help 2>&1) 69 ifneq (,$(findstring sse2,$(TARGETHELP))) 70 override CFLAGS += -fexpensive-optimizations -mmmx -msse -msse2 -msse3 71 else 72 override CFLAGS += -fexpensive-optimizations 73 endif 74 68 75 # The linker for powerpc have bug that prevents --gc-sections from working 69 76 # Check for the linker version and if it matches disable --gc-sections 70 77 # For more information about the bug see: ...... 268 275 SRC-$(CONFIG_MODULE_CCCAM) += module-cccam.c 269 276 SRC-$(CONFIG_MODULE_CCCSHARE) += module-cccshare.c 270 277 SRC-$(CONFIG_MODULE_CONSTCW) += module-constcw.c 278 SRC-$(CONFIG_WITH_EMU) += module-emulator.c 279 SRC-$(CONFIG_WITH_EMU) += module-emulator-osemu.c 280 SRC-$(CONFIG_WITH_EMU) += module-emulator-stream.c 281 SRC-$(CONFIG_WITH_EMU) += ffdecsa/ffdecsa.c 282 UNAME := $(shell uname -s) 283 ifneq ($(UNAME),Darwin) 284 ifndef ANDROID_NDK 285 ifndef ANDROID_STANDALONE_TOOLCHAIN 286 ifeq "$(CONFIG_WITH_EMU)" "y" 287 TOUCH_SK := $(shell touch SoftCam.Key) 288 override LDFLAGS += -Wl,--format=binary -Wl,SoftCam.Key -Wl,--format=default 289 endif 290 endif 291 endif 292 endif 271 293 SRC-$(CONFIG_CS_CACHEEX) += module-csp.c 272 294 SRC-$(CONFIG_CW_CYCLE_CHECK) += module-cw-cycle-check.c 273 295 SRC-$(CONFIG_WITH_AZBOX) += module-dvbapi-azbox.c ...... 365 387 # starts the compilation. 366 388 all: 367 389 @./config.sh --use-flags "$(USE_FLAGS)" --objdir "$(OBJDIR)" --make-config.mak 368 @-mkdir -p $(OBJDIR)/cscrypt $(OBJDIR)/csctapi $(OBJDIR)/minilzo $(OBJDIR)/webif 390 @-mkdir -p $(OBJDIR)/cscrypt $(OBJDIR)/csctapi $(OBJDIR)/minilzo $(OBJDIR)/ffdecsa $(OBJDIR)/webif 369 391 @-printf "\ 370 392 +-------------------------------------------------------------------------------\n\ 371 393 \| OSCam ver: $(VER) rev: $(SVN_REV) target: $(TARGET)\n\ config.h (working copy) 1 1 #ifndef CONFIG_H_ 2 2 #define CONFIG_H_ 3 3 4 #define WITH_EMU 1 4 5 #define WEBIF 1 5 6 #define WEBIF_LIVELOG 1 6 7 #define WEBIF_JQUERY 1 config.sh (working copy) 1 1 #!/bin/sh 2 2 3 addons="WEBIF WEBIF_LIVELOG WEBIF_JQUERY TOUCH WITH_SSL HAVE_DVBAPI READ_SDT_CHARSETS IRDETO_GUESSING CS_ANTICASC WITH_DEBUG MODULE_MONITOR WITH_LB CS_CACHEEX CW_CYCLE_CHECK LCDSUPPORT LEDSUPPORT CLOCKFIX IPV6SUPPORT" 3 addons="WEBIF WEBIF_LIVELOG WEBIF_JQUERY TOUCH WITH_SSL HAVE_DVBAPI READ_SDT_CHARSETS IRDETO_GUESSING CS_ANTICASC WITH_DEBUG MODULE_MONITOR WITH_LB CS_CACHEEX CW_CYCLE_CHECK LCDSUPPORT LEDSUPPORT CLOCKFIX IPV6SUPPORT WITH_EMU" 4 4 protocols="MODULE_CAMD33 MODULE_CAMD35 MODULE_CAMD35_TCP MODULE_NEWCAMD MODULE_CCCAM MODULE_CCCSHARE MODULE_GBOX MODULE_RADEGAST MODULE_SCAM MODULE_SERIAL MODULE_CONSTCW MODULE_PANDORA MODULE_GHTTP" 5 5 readers="READER_NAGRA READER_IRDETO READER_CONAX READER_CRYPTOWORKS READER_SECA READER_VIACCESS READER_VIDEOGUARD READER_DRE READER_TONGFANG READER_BULCRYPT READER_GRIFFIN READER_DGCRYPT" 6 6 card_readers="CARDREADER_PHOENIX CARDREADER_INTERNAL CARDREADER_SC8IN1 CARDREADER_MP35 CARDREADER_SMARGO CARDREADER_DB2COM CARDREADER_STAPI CARDREADER_STAPI5 CARDREADER_STINGER CARDREADER_DRECAS" ...... 24 24 # CONFIG_LEDSUPPORT=n 25 25 CONFIG_CLOCKFIX=y 26 26 # CONFIG_IPV6SUPPORT=n 27 CONFIG_WITH_EMU=y 27 28 # CONFIG_MODULE_CAMD33=n 28 29 CONFIG_MODULE_CAMD35=y 29 30 CONFIG_MODULE_CAMD35_TCP=y ...... 289 290 290 291 update_deps() { 291 292 # Calculate dependencies 292 enabled_any $(get_opts readers) $(get_opts card_readers) && enable_opt WITH_CARDREADER >/dev/null 293 disabled_all $(get_opts readers) $(get_opts card_readers) && disable_opt WITH_CARDREADER >/dev/null 293 enabled_any $(get_opts readers) $(get_opts card_readers) WITH_EMU && enable_opt WITH_CARDREADER >/dev/null 294 disabled_all $(get_opts readers) $(get_opts card_readers) WITH_EMU && disable_opt WITH_CARDREADER >/dev/null 294 295 disabled WEBIF && disable_opt WEBIF_LIVELOG >/dev/null 295 296 disabled WEBIF && disable_opt WEBIF_JQUERY >/dev/null 296 297 enabled MODULE_CCCSHARE && enable_opt MODULE_CCCAM >/dev/null 297 298 enabled_any CARDREADER_DB2COM CARDREADER_MP35 CARDREADER_SC8IN1 CARDREADER_STINGER && enable_opt CARDREADER_PHOENIX >/dev/null 299 enabled WITH_EMU && enable_opt READER_VIACCESS >/dev/null 300 enabled WITH_EMU && enable_opt READER_DRE >/dev/null 301 enabled WITH_EMU && enable_opt MODULE_NEWCAMD >/dev/null 298 302 } 299 303 300 304 list_config() { ...... 344 348 not_have_flag USE_LIBCRYPTO && echo "CONFIG_LIB_AES=y" \|\| echo "# CONFIG_LIB_AES=n" 345 349 enabled MODULE_CCCAM && echo "CONFIG_LIB_RC6=y" \|\| echo "# CONFIG_LIB_RC6=n" 346 350 not_have_flag USE_LIBCRYPTO && enabled MODULE_CCCAM && echo "CONFIG_LIB_SHA1=y" \|\| echo "# CONFIG_LIB_SHA1=n" 347 enabled_any READER_DRE MODULE_SCAM READER_VIACCESS && echo "CONFIG_LIB_DES=y" \|\| echo "# CONFIG_LIB_DES=n" 348 enabled_any MODULE_CCCAM READER_NAGRA READER_SECA && echo "CONFIG_LIB_IDEA=y" \|\| echo "# CONFIG_LIB_IDEA=n" 349 not_have_flag USE_LIBCRYPTO && enabled_any READER_CONAX READER_CRYPTOWORKS READER_NAGRA && echo "CONFIG_LIB_BIGNUM=y" \|\| echo "# CONFIG_LIB_BIGNUM=n" 351 enabled_any READER_DRE MODULE_SCAM READER_VIACCESS WITH_EMU && echo "CONFIG_LIB_DES=y" \|\| echo "# CONFIG_LIB_DES=n" 352 enabled_any MODULE_CCCAM READER_NAGRA READER_SECA WITH_EMU && echo "CONFIG_LIB_IDEA=y" \|\| echo "# CONFIG_LIB_IDEA=n" 353 not_have_flag USE_LIBCRYPTO && enabled_any READER_CONAX READER_CRYPTOWORKS READER_NAGRA WITH_EMU && echo "CONFIG_LIB_BIGNUM=y" \|\| echo "# CONFIG_LIB_BIGNUM=n" 350 354 } 351 355 352 356 make_config_c() { ...... 457 461 LEDSUPPORT "LED support" $(check_test "LEDSUPPORT") \ 458 462 CLOCKFIX "Clockfix (disable on old systems!)" $(check_test "CLOCKFIX") \ 459 463 IPV6SUPPORT "IPv6 support (experimental)" $(check_test "IPV6SUPPORT") \ 464 WITH_EMU "Emulator support" $(check_test "WITH_EMU") \ 460 465 2> ${tempfile} 461 466 462 467 opt=${?} cscrypt/md5.c (working copy) 25 25 26 26 #if !defined(WITH_SSL) && !defined(WITH_LIBCRYPTO) 27 27 28 typedef struct MD5Context 29 { 30 uint32_t buf[4]; 31 uint32_t bits[2]; 32 uint32_t in[16]; 33 } MD5_CTX; 34 35 28 #ifdef __i386__ 36 29 #define byteReverse(a, b) 37 30 #else ...... 155 148 Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 156 149 * initialization constants. 157 150 / 158 static void MD5_Init(MD5_CTX ctx) 151 void MD5_Init(MD5_CTX ctx) 159 152 { 160 153 ctx->buf[0] = 0x67452301; 161 154 ctx->buf[1] = 0xefcdab89; ...... 170 163 Update context to reflect the concatenation of another buffer full 171 164 * of bytes. 172 165 / 173 static void MD5_Update(MD5_CTX ctx, const unsigned char buf, unsigned int len) 166 void MD5_Update(MD5_CTX ctx, const unsigned char buf, unsigned int len) 174 167 { 175 168 uint32_t t; 176 169 ...... 219 212 Final wrapup - pad to 64-byte boundary with the bit pattern 220 213 * 1 0* (64-bit count of bits processed, MSB-first) 221 214 / 222 static void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX ctx) 215 void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX ctx) 223 216 { 224 217 unsigned count; 225 218 unsigned char p; cscrypt/md5.h (working copy) 7 7 #define MD5_DIGEST_LENGTH 16 8 8 9 9 unsigned char MD5(const unsigned char input, unsigned long len, unsigned char output_hash); 10 #endif 11 10 12 char __md5_crypt(const char text_pass, const char salt, char crypted_passwd); 11 typedef struct MD5Context { 12 uint32_t buf[4]; 13 uint32_t bits[2]; 14 uint32_t in[16]; 15 } MD5_CTX; 13 16 17 void MD5_Init(MD5_CTX ctx); 18 void MD5_Update(MD5_CTX ctx, const unsigned char buf, unsigned int len); 19 void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX ctx); 14 20 #endif 21 char __md5_crypt(const char text_pass, const char salt, char crypted_passwd); 22 #endif csctapi/cardreaders.h (working copy) 14 14 extern const struct s_cardreader cardreader_stapi; 15 15 extern const struct s_cardreader cardreader_stinger; 16 16 extern const struct s_cardreader cardreader_drecas; 17 extern const struct s_cardreader cardreader_emu; 17 18 18 19 #endif ffdecsa/CMakeLists.txt (working copy) 1 project (ffdecsa) 2 3 file (GLOB ffdecsa_srcs "ffdecsa.c") 4 file (GLOB ffdecsa_hdrs ".h") 5 6 set (lib_name "ffdecsa") 7 8 add_library (${lib_name} STATIC ${ffdecsa_srcs} ${ffdecsa_hdrs}) ffdecsa/COPYING (working copy) 1 GNU GENERAL PUBLIC LICENSE 2 Version 2, June 1991 3 4 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 5 675 Mass Ave, Cambridge, MA 02139, USA 6 Everyone is permitted to copy and distribute verbatim copies 7 of this license document, but changing it is not allowed. 8 9 Preamble 10 11 The licenses for most software are designed to take away your 12 freedom to share and change it. By contrast, the GNU General Public 13 License is intended to guarantee your freedom to share and change free 14 software--to make sure the software is free for all its users. This 15 General Public License applies to most of the Free Software 16 Foundation's software and to any other program whose authors commit to 17 using it. (Some other Free Software Foundation software is covered by 18 the GNU Library General Public License instead.) You can apply it to 19 your programs, too. 20 21 When we speak of free software, we are referring to freedom, not 22 price. Our General Public Licenses are designed to make sure that you 23 have the freedom to distribute copies of free software (and charge for 24 this service if you wish), that you receive source code or can get it 25 if you want it, that you can change the software or use pieces of it 26 in new free programs; and that you know you can do these things. 27 28 To protect your rights, we need to make restrictions that forbid 29 anyone to deny you these rights or to ask you to surrender the rights. 30 These restrictions translate to certain responsibilities for you if you 31 distribute copies of the software, or if you modify it. 32 33 For example, if you distribute copies of such a program, whether 34 gratis or for a fee, you must give the recipients all the rights that 35 you have. You must make sure that they, too, receive or can get the 36 source code. And you must show them these terms so they know their 37 rights. 38 39 We protect your rights with two steps: (1) copyright the software, and 40 (2) offer you this license which gives you legal permission to copy, 41 distribute and/or modify the software. 42 43 Also, for each author's protection and ours, we want to make certain 44 that everyone understands that there is no warranty for this free 45 software. If the software is modified by someone else and passed on, we 46 want its recipients to know that what they have is not the original, so 47 that any problems introduced by others will not reflect on the original 48 authors' reputations. 49 50 Finally, any free program is threatened constantly by software 51 patents. We wish to avoid the danger that redistributors of a free 52 program will individually obtain patent licenses, in effect making the 53 program proprietary. To prevent this, we have made it clear that any 54 patent must be licensed for everyone's free use or not licensed at all. 55 56 The precise terms and conditions for copying, distribution and 57 modification follow. 58 59 GNU GENERAL PUBLIC LICENSE 60 TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 62 0. This License applies to any program or other work which contains 63 a notice placed by the copyright holder saying it may be distributed 64 under the terms of this General Public License. The "Program", below, 65 refers to any such program or work, and a "work based on the Program" 66 means either the Program or any derivative work under copyright law: 67 that is to say, a work containing the Program or a portion of it, 68 either verbatim or with modifications and/or translated into another 69 language. (Hereinafter, translation is included without limitation in 70 the term "modification".) Each licensee is addressed as "you". 71 72 Activities other than copying, distribution and modification are not 73 covered by this License; they are outside its scope. The act of 74 running the Program is not restricted, and the output from the Program 75 is covered only if its contents constitute a work based on the 76 Program (independent of having been made by running the Program). 77 Whether that is true depends on what the Program does. 78 79 1. You may copy and distribute verbatim copies of the Program's 80 source code as you receive it, in any medium, provided that you 81 conspicuously and appropriately publish on each copy an appropriate 82 copyright notice and disclaimer of warranty; keep intact all the 83 notices that refer to this License and to the absence of any warranty; 84 and give any other recipients of the Program a copy of this License 85 along with the Program. 86 87 You may charge a fee for the physical act of transferring a copy, and 88 you may at your option offer warranty protection in exchange for a fee. 89 90 2. You may modify your copy or copies of the Program or any portion 91 of it, thus forming a work based on the Program, and copy and 92 distribute such modifications or work under the terms of Section 1 93 above, provided that you also meet all of these conditions: 94 95 a) You must cause the modified files to carry prominent notices 96 stating that you changed the files and the date of any change. 97 98 b) You must cause any work that you distribute or publish, that in 99 whole or in part contains or is derived from the Program or any 100 part thereof, to be licensed as a whole at no charge to all third 101 parties under the terms of this License. 102 103 c) If the modified program normally reads commands interactively 104 when run, you must cause it, when started running for such 105 interactive use in the most ordinary way, to print or display an 106 announcement including an appropriate copyright notice and a 107 notice that there is no warranty (or else, saying that you provide 108 a warranty) and that users may redistribute the program under 109 these conditions, and telling the user how to view a copy of this 110 License. (Exception: if the Program itself is interactive but 111 does not normally print such an announcement, your work based on 112 the Program is not required to print an announcement.) 113 114 These requirements apply to the modified work as a whole. If 115 identifiable sections of that work are not derived from the Program, 116 and can be reasonably considered independent and separate works in 117 themselves, then this License, and its terms, do not apply to those 118 sections when you distribute them as separate works. But when you 119 distribute the same sections as part of a whole which is a work based 120 on the Program, the distribution of the whole must be on the terms of 121 this License, whose permissions for other licensees extend to the 122 entire whole, and thus to each and every part regardless of who wrote it. 123 124 Thus, it is not the intent of this section to claim rights or contest 125 your rights to work written entirely by you; rather, the intent is to 126 exercise the right to control the distribution of derivative or 127 collective works based on the Program. 128 129 In addition, mere aggregation of another work not based on the Program 130 with the Program (or with a work based on the Program) on a volume of 131 a storage or distribution medium does not bring the other work under 132 the scope of this License. 133 134 3. You may copy and distribute the Program (or a work based on it, 135 under Section 2) in object code or executable form under the terms of 136 Sections 1 and 2 above provided that you also do one of the following: 137 138 a) Accompany it with the complete corresponding machine-readable 139 source code, which must be distributed under the terms of Sections 140 1 and 2 above on a medium customarily used for software interchange; or, 141 142 b) Accompany it with a written offer, valid for at least three 143 years, to give any third party, for a charge no more than your 144 cost of physically performing source distribution, a complete 145 machine-readable copy of the corresponding source code, to be 146 distributed under the terms of Sections 1 and 2 above on a medium 147 customarily used for software interchange; or, 148 149 c) Accompany it with the information you received as to the offer 150 to distribute corresponding source code. (This alternative is 151 allowed only for noncommercial distribution and only if you 152 received the program in object code or executable form with such 153 an offer, in accord with Subsection b above.) 154 155 The source code for a work means the preferred form of the work for 156 making modifications to it. For an executable work, complete source 157 code means all the source code for all modules it contains, plus any 158 associated interface definition files, plus the scripts used to 159 control compilation and installation of the executable. However, as a 160 special exception, the source code distributed need not include 161 anything that is normally distributed (in either source or binary 162 form) with the major components (compiler, kernel, and so on) of the 163 operating system on which the executable runs, unless that component 164 itself accompanies the executable. 165 166 If distribution of executable or object code is made by offering 167 access to copy from a designated place, then offering equivalent 168 access to copy the source code from the same place counts as 169 distribution of the source code, even though third parties are not 170 compelled to copy the source along with the object code. 171 172 4. You may not copy, modify, sublicense, or distribute the Program 173 except as expressly provided under this License. Any attempt 174 otherwise to copy, modify, sublicense or distribute the Program is 175 void, and will automatically terminate your rights under this License. 176 However, parties who have received copies, or rights, from you under 177 this License will not have their licenses terminated so long as such 178 parties remain in full compliance. 179 180 5. You are not required to accept this License, since you have not 181 signed it. However, nothing else grants you permission to modify or 182 distribute the Program or its derivative works. These actions are 183 prohibited by law if you do not accept this License. Therefore, by 184 modifying or distributing the Program (or any work based on the 185 Program), you indicate your acceptance of this License to do so, and 186 all its terms and conditions for copying, distributing or modifying 187 the Program or works based on it. 188 189 6. Each time you redistribute the Program (or any work based on the 190 Program), the recipient automatically receives a license from the 191 original licensor to copy, distribute or modify the Program subject to 192 these terms and conditions. You may not impose any further 193 restrictions on the recipients' exercise of the rights granted herein. 194 You are not responsible for enforcing compliance by third parties to 195 this License. 196 197 7. If, as a consequence of a court judgment or allegation of patent 198 infringement or for any other reason (not limited to patent issues), 199 conditions are imposed on you (whether by court order, agreement or 200 otherwise) that contradict the conditions of this License, they do not 201 excuse you from the conditions of this License. If you cannot 202 distribute so as to satisfy simultaneously your obligations under this 203 License and any other pertinent obligations, then as a consequence you 204 may not distribute the Program at all. For example, if a patent 205 license would not permit royalty-free redistribution of the Program by 206 all those who receive copies directly or indirectly through you, then 207 the only way you could satisfy both it and this License would be to 208 refrain entirely from distribution of the Program. 209 210 If any portion of this section is held invalid or unenforceable under 211 any particular circumstance, the balance of the section is intended to 212 apply and the section as a whole is intended to apply in other 213 circumstances. 214 215 It is not the purpose of this section to induce you to infringe any 216 patents or other property right claims or to contest validity of any 217 such claims; this section has the sole purpose of protecting the 218 integrity of the free software distribution system, which is 219 implemented by public license practices. Many people have made 220 generous contributions to the wide range of software distributed 221 through that system in reliance on consistent application of that 222 system; it is up to the author/donor to decide if he or she is willing 223 to distribute software through any other system and a licensee cannot 224 impose that choice. 225 226 This section is intended to make thoroughly clear what is believed to 227 be a consequence of the rest of this License. 228 229 8. If the distribution and/or use of the Program is restricted in 230 certain countries either by patents or by copyrighted interfaces, the 231 original copyright holder who places the Program under this License 232 may add an explicit geographical distribution limitation excluding 233 those countries, so that distribution is permitted only in or among 234 countries not thus excluded. In such case, this License incorporates 235 the limitation as if written in the body of this License. 236 237 9. The Free Software Foundation may publish revised and/or new versions 238 of the General Public License from time to time. Such new versions will 239 be similar in spirit to the present version, but may differ in detail to 240 address new problems or concerns. 241 242 Each version is given a distinguishing version number. If the Program 243 specifies a version number of this License which applies to it and "any 244 later version", you have the option of following the terms and conditions 245 either of that version or of any later version published by the Free 246 Software Foundation. If the Program does not specify a version number of 247 this License, you may choose any version ever published by the Free Software 248 Foundation. 249 250 10. If you wish to incorporate parts of the Program into other free 251 programs whose distribution conditions are different, write to the author 252 to ask for permission. For software which is copyrighted by the Free 253 Software Foundation, write to the Free Software Foundation; we sometimes 254 make exceptions for this. Our decision will be guided by the two goals 255 of preserving the free status of all derivatives of our free software and 256 of promoting the sharing and reuse of software generally. 257 258 NO WARRANTY 259 260 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 REPAIR OR CORRECTION. 269 270 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 POSSIBILITY OF SUCH DAMAGES. 279 280 END OF TERMS AND CONDITIONS 281 282 Appendix: How to Apply These Terms to Your New Programs 283 284 If you develop a new program, and you want it to be of the greatest 285 possible use to the public, the best way to achieve this is to make it 286 free software which everyone can redistribute and change under these terms. 287 288 To do so, attach the following notices to the program. It is safest 289 to attach them to the start of each source file to most effectively 290 convey the exclusion of warranty; and each file should have at least 291 the "copyright" line and a pointer to where the full notice is found. 292 293 <one line to give the program's name and a brief idea of what it does.> 294 Copyright (C) 19yy <name of author> 295 296 This program is free software; you can redistribute it and/or modify 297 it under the terms of the GNU General Public License as published by 298 the Free Software Foundation; either version 2 of the License, or 299 (at your option) any later version. 300 301 This program is distributed in the hope that it will be useful, 302 but WITHOUT ANY WARRANTY; without even the implied warranty of 303 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 GNU General Public License for more details. 305 306 You should have received a copy of the GNU General Public License 307 along with this program; if not, write to the Free Software 308 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 309 310 Also add information on how to contact you by electronic and paper mail. 311 312 If the program is interactive, make it output a short notice like this 313 when it starts in an interactive mode: 314 315 Gnomovision version 69, Copyright (C) 19yy name of author 316 Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 This is free software, and you are welcome to redistribute it 318 under certain conditions; type `show c' for details. 319 320 The hypothetical commands `show w' and `show c' should show the appropriate 321 parts of the General Public License. Of course, the commands you use may 322 be called something other than `show w' and `show c'; they could even be 323 mouse-clicks or menu items--whatever suits your program. 324 325 You should also get your employer (if you work as a programmer) or your 326 school, if any, to sign a "copyright disclaimer" for the program, if 327 necessary. Here is a sample; alter the names: 328 329 Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 332 <signature of Ty Coon>, 1 April 1989 333 Ty Coon, President of Vice 334 335 This General Public License does not permit incorporating your program into 336 proprietary programs. If your program is a subroutine library, you may 337 consider it more useful to permit linking proprietary applications with the 338 library. If this is what you want to do, use the GNU Library General 339 Public License instead of this License. ffdecsa/Makefile (working copy) 1 parent: 2 @$(MAKE) --no-print-directory -C .. ffdecsa/ffdecsa.c (working copy) 1 /* FFdecsa -- fast decsa algorithm 2 * 3 * Copyright (C) 2003-2004 fatih89r 4 * 5 * This program is free software; you can redistribute it and/or modify 6 * it under the terms of the GNU General Public License as published by 7 * the Free Software Foundation; either version 2 of the License, or 8 * (at your option) any later version. 9 * 10 * This program is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * GNU General Public License for more details. 14 * 15 * You should have received a copy of the GNU General Public License 16 * along with this program; if not, write to the Free Software 17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 18 / 19 20 21 #include <sys/types.h> 22 #include <string.h> 23 #include <stdio.h> 24 #include <stdlib.h> 25 26 #include "ffdecsa.h" 27 28 #ifndef NULL 29 #define NULL 0 30 #endif 31 32 //#define DEBUG 33 #ifdef DEBUG 34 #define DBG(a) a 35 #else 36 #define DBG(a) 37 #endif 38 39 //// parallelization stuff, large speed differences are possible 40 // possible choices 41 #define PARALLEL_32_4CHAR 320 42 #define PARALLEL_32_4CHARA 321 43 #define PARALLEL_32_INT 322 44 #define PARALLEL_64_8CHAR 640 45 #define PARALLEL_64_8CHARA 641 46 #define PARALLEL_64_2INT 642 47 #define PARALLEL_64_LONG 643 48 #define PARALLEL_64_MMX 644 49 #define PARALLEL_128_16CHAR 1280 50 #define PARALLEL_128_16CHARA 1281 51 #define PARALLEL_128_4INT 1282 52 #define PARALLEL_128_2LONG 1283 53 #define PARALLEL_128_2MMX 1284 54 #define PARALLEL_128_SSE 1285 55 #define PARALLEL_128_SSE2 1286 56 57 //////// our choice //////////////// our choice //////////////// our choice //////////////// our choice //////// 58 #ifndef PARALLEL_MODE 59 60 #if defined(__x86_64__) \|\| defined(_M_X64) 61 #define PARALLEL_MODE PARALLEL_128_SSE2 62 63 #elif defined(__mips__) \|\| defined(__mips) \|\| defined(__MIPS__) 64 #define PARALLEL_MODE PARALLEL_64_LONG 65 66 #elif defined(__sh__) \|\| defined(__SH4__) 67 #define PARALLEL_MODE PARALLEL_32_INT 68 #define COPY_UNALIGNED_PKT 69 #define MEMALIGN_VAL 4 70 71 #else 72 #define PARALLEL_MODE PARALLEL_32_INT 73 #endif 74 75 #endif 76 //////// our choice //////////////// our choice //////////////// our choice //////////////// our choice //////// 77 78 #include "parallel_generic.h" 79 //// conditionals 80 #if PARALLEL_MODE==PARALLEL_32_4CHAR 81 #include "parallel_032_4char.h" 82 #elif PARALLEL_MODE==PARALLEL_32_4CHARA 83 #include "parallel_032_4charA.h" 84 #elif PARALLEL_MODE==PARALLEL_32_INT 85 #include "parallel_032_int.h" 86 #elif PARALLEL_MODE==PARALLEL_64_8CHAR 87 #include "parallel_064_8char.h" 88 #elif PARALLEL_MODE==PARALLEL_64_8CHARA 89 #include "parallel_064_8charA.h" 90 #elif PARALLEL_MODE==PARALLEL_64_2INT 91 #include "parallel_064_2int.h" 92 #elif PARALLEL_MODE==PARALLEL_64_LONG 93 #include "parallel_064_long.h" 94 #elif PARALLEL_MODE==PARALLEL_64_MMX 95 #include "parallel_064_mmx.h" 96 #elif PARALLEL_MODE==PARALLEL_128_16CHAR 97 #include "parallel_128_16char.h" 98 #elif PARALLEL_MODE==PARALLEL_128_16CHARA 99 #include "parallel_128_16charA.h" 100 #elif PARALLEL_MODE==PARALLEL_128_4INT 101 #include "parallel_128_4int.h" 102 #elif PARALLEL_MODE==PARALLEL_128_2LONG 103 #include "parallel_128_2long.h" 104 #elif PARALLEL_MODE==PARALLEL_128_2MMX 105 #include "parallel_128_2mmx.h" 106 #elif PARALLEL_MODE==PARALLEL_128_SSE 107 #include "parallel_128_sse.h" 108 #elif PARALLEL_MODE==PARALLEL_128_SSE2 109 #include "parallel_128_sse2.h" 110 #else 111 #error "unknown/undefined parallel mode" 112 #endif 113 114 // stuff depending on conditionals 115 116 #define BYTES_PER_GROUP (GROUP_PARALLELISM/8) 117 #define BYPG BYTES_PER_GROUP 118 #define BITS_PER_GROUP GROUP_PARALLELISM 119 #define BIPG BITS_PER_GROUP 120 121 // platform specific 122 123 #ifdef __arm__ 124 #if !defined(MEMALIGN_VAL) \|\| MEMALIGN_VAL<4 125 #undef MEMALIGN_VAL 126 #define MEMALIGN_VAL 4 127 #endif 128 #define COPY_UNALIGNED_PKT 129 #endif 130 131 // 132 133 #ifndef MALLOC 134 #define MALLOC(X) malloc(X) 135 #endif 136 #ifndef FREE 137 #define FREE(X) free(X) 138 #endif 139 #ifdef MEMALIGN_VAL 140 #define MEMALIGN __attribute__((aligned(MEMALIGN_VAL))) 141 #else 142 #define MEMALIGN 143 #endif 144 145 //// debug tool 146 147 #ifdef DEBUG 148 static void dump_mem(const char string, const unsigned char p, int len, int linelen){ 149 int i; 150 for(i=0;i<len;i++){ 151 if(i%linelen==0&&i) fprintf(stderr,"\n"); 152 if(i%linelen==0) fprintf(stderr,"%s %08x:",string,i); 153 else{ 154 if(i%8==0) fprintf(stderr," "); 155 if(i%4==0) fprintf(stderr," "); 156 } 157 fprintf(stderr," %02x",p[i]); 158 } 159 if(i%linelen==0) fprintf(stderr,"\n"); 160 } 161 #endif 162 163 ////////////////////////////////////////////////////////////////////////////////// 164 165 struct csa_key_t{ 166 unsigned char ck[8]; 167 // used by stream 168 int iA[8]; // iA[0] is for A1, iA[7] is for A8 169 int iB[8]; // iB[0] is for B1, iB[7] is for B8 170 // used by stream (group) 171 MEMALIGN group ck_g[8][8]; // [byte][bit:0=LSB,7=MSB] 172 MEMALIGN group iA_g[8][4]; // [0 for A1][0 for LSB] 173 MEMALIGN group iB_g[8][4]; // [0 for B1][0 for LSB] 174 // used by block 175 unsigned char kk[56]; 176 // used by block (group) 177 MEMALIGN batch kkmulti[56]; // many times the same byte in every batch 178 }; 179 180 struct csa_keys_t{ 181 struct csa_key_t even; 182 struct csa_key_t odd; 183 }; 184 185 //-----stream cypher 186 187 //-----key schedule for stream decypher 188 static void key_schedule_stream( 189 unsigned char ck, // [In] ck[0]-ck[7] 8 bytes \| Key. 190 int iA, // [Out] iA[0]-iA[7] 8 nibbles \| Key schedule. 191 int iB) // [Out] iB[0]-iB[7] 8 nibbles \| Key schedule. 192 { 193 iA[0]=(ck[0]>>4)&0xf; 194 iA[1]=(ck[0] )&0xf; 195 iA[2]=(ck[1]>>4)&0xf; 196 iA[3]=(ck[1] )&0xf; 197 iA[4]=(ck[2]>>4)&0xf; 198 iA[5]=(ck[2] )&0xf; 199 iA[6]=(ck[3]>>4)&0xf; 200 iA[7]=(ck[3] )&0xf; 201 iB[0]=(ck[4]>>4)&0xf; 202 iB[1]=(ck[4] )&0xf; 203 iB[2]=(ck[5]>>4)&0xf; 204 iB[3]=(ck[5] )&0xf; 205 iB[4]=(ck[6]>>4)&0xf; 206 iB[5]=(ck[6] )&0xf; 207 iB[6]=(ck[7]>>4)&0xf; 208 iB[7]=(ck[7] )&0xf; 209 } 210 211 //----- stream main function 212 213 #define STREAM_INIT 214 #include "stream.c" 215 #undef STREAM_INIT 216 217 #define STREAM_NORMAL 218 #include "stream.c" 219 #undef STREAM_NORMAL 220 221 222 //-----block decypher 223 224 //-----key schedule for block decypher 225 226 static void key_schedule_block( 227 unsigned char ck, // [In] ck[0]-ck[7] 8 bytes \| Key. 228 unsigned char kk) // [Out] kk[0]-kk[55] 56 bytes \| Key schedule. 229 { 230 static const unsigned char key_perm[0x40] = { 231 0x12,0x24,0x09,0x07,0x2A,0x31,0x1D,0x15, 0x1C,0x36,0x3E,0x32,0x13,0x21,0x3B,0x40, 232 0x18,0x14,0x25,0x27,0x02,0x35,0x1B,0x01, 0x22,0x04,0x0D,0x0E,0x39,0x28,0x1A,0x29, 233 0x33,0x23,0x34,0x0C,0x16,0x30,0x1E,0x3A, 0x2D,0x1F,0x08,0x19,0x17,0x2F,0x3D,0x11, 234 0x3C,0x05,0x38,0x2B,0x0B,0x06,0x0A,0x2C, 0x20,0x3F,0x2E,0x0F,0x03,0x26,0x10,0x37, 235 }; 236 237 int i,j,k; 238 int bit[64]; 239 int newbit[64]; 240 int kb[7][8]; 241 242 // 56 steps 243 // 56 key bytes kk(55)..kk(0) by key schedule from ck 244 245 // kb(6,0) .. kb(6,7) = ck(0) .. ck(7) 246 kb[6][0] = ck[0]; 247 kb[6][1] = ck[1]; 248 kb[6][2] = ck[2]; 249 kb[6][3] = ck[3]; 250 kb[6][4] = ck[4]; 251 kb[6][5] = ck[5]; 252 kb[6][6] = ck[6]; 253 kb[6][7] = ck[7]; 254 255 // calculate kb[5] .. kb[0] 256 for(i=5; i>=0; i--){ 257 // 64 bit perm on kb 258 for(j=0; j<8; j++){ 259 for(k=0; k<8; k++){ 260 bit[j8+k] = (kb[i+1][j] >> (7-k)) & 1; 261 newbit[key_perm[j8+k]-1] = bit[j8+k]; 262 } 263 } 264 for(j=0; j<8; j++){ 265 kb[i][j] = 0; 266 for(k=0; k<8; k++){ 267 kb[i][j] \|= newbit[j8+k] << (7-k); 268 } 269 } 270 } 271 272 // xor to give kk 273 for(i=0; i<7; i++){ 274 for(j=0; j<8; j++){ 275 kk[i8+j] = kb[i][j] ^ i; 276 } 277 } 278 279 } 280 281 //-----block utils 282 283 static inline __attribute__((always_inline)) void trasp_N_8 (unsigned char in,unsigned char* out,int count){ 284 int ri=(int )in; 285 int ibi=(int )out; 286 int j,i,k,g; 287 // copy and first step 288 for(g=0;g<count;g++){ 289 ri[g]=ibi[2g]; 290 ri[GROUP_PARALLELISM+g]=ibi[2g+1]; 291 } 292 //dump_mem("NE1 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 293 // now 01230123 294 #define INTS_PER_ROW (GROUP_PARALLELISM/82) 295 for(j=0;j<8;j+=4){ 296 for(i=0;i<2;i++){ 297 for(k=0;k<INTS_PER_ROW;k++){ 298 unsigned int t,b; 299 t=ri[INTS_PER_ROW(j+i)+k]; 300 b=ri[INTS_PER_ROW(j+i+2)+k]; 301 ri[INTS_PER_ROW(j+i)+k]= (t&0x0000ffff) \| ((b )<<16); 302 ri[INTS_PER_ROW(j+i+2)+k]= ((t )>>16) \| (b&0xffff0000) ; 303 } 304 } 305 } 306 //dump_mem("NE2 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 307 // now 01010101 308 for(j=0;j<8;j+=2){ 309 for(i=0;i<1;i++){ 310 for(k=0;k<INTS_PER_ROW;k++){ 311 unsigned int t,b; 312 t=ri[INTS_PER_ROW(j+i)+k]; 313 b=ri[INTS_PER_ROW(j+i+1)+k]; 314 ri[INTS_PER_ROW(j+i)+k]= (t&0x00ff00ff) \| ((b&0x00ff00ff)<<8); 315 ri[INTS_PER_ROW(j+i+1)+k]= ((t&0xff00ff00)>>8) \| (b&0xff00ff00); 316 } 317 } 318 } 319 //dump_mem("NE3 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 320 // now 00000000 321 } 322 323 static inline __attribute__((always_inline)) void trasp_8_N (unsigned char in,unsigned char out,int count){ 324 int ri=(int )in; 325 int bdi=(int )out; 326 int j,i,k,g; 327 #define INTS_PER_ROW (GROUP_PARALLELISM/82) 328 //dump_mem("NE1 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 329 // now 00000000 330 for(j=0;j<8;j+=2){ 331 for(i=0;i<1;i++){ 332 for(k=0;k<INTS_PER_ROW;k++){ 333 unsigned int t,b; 334 t=ri[INTS_PER_ROW(j+i)+k]; 335 b=ri[INTS_PER_ROW(j+i+1)+k]; 336 ri[INTS_PER_ROW(j+i)+k]= (t&0x00ff00ff) \| ((b&0x00ff00ff)<<8); 337 ri[INTS_PER_ROW(j+i+1)+k]= ((t&0xff00ff00)>>8) \| (b&0xff00ff00); 338 } 339 } 340 } 341 //dump_mem("NE2 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 342 // now 01010101 343 for(j=0;j<8;j+=4){ 344 for(i=0;i<2;i++){ 345 for(k=0;k<INTS_PER_ROW;k++){ 346 unsigned int t,b; 347 t=ri[INTS_PER_ROW(j+i)+k]; 348 b=ri[INTS_PER_ROW(j+i+2)+k]; 349 ri[INTS_PER_ROW(j+i)+k]= (t&0x0000ffff) \| ((b )<<16); 350 ri[INTS_PER_ROW(j+i+2)+k]= ((t )>>16) \| (b&0xffff0000) ; 351 } 352 } 353 } 354 //dump_mem("NE3 r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 355 // now 01230123 356 for(g=0;g<count;g++){ 357 bdi[2g]=ri[g]; 358 bdi[2g+1]=ri[GROUP_PARALLELISM+g]; 359 } 360 } 361 362 //-----block main function 363 364 // block group 365 static void block_decypher_group( 366 batch kkmulti, // [In] kkmulti[0]-kkmulti[55] 56 batches \| Key schedule (each batch has repeated equal bytes). 367 unsigned char ib, // [In] (ib0,ib1,...ib7)...x32 328 bytes \| Initialization vector. 368 unsigned char bd, // [Out] (bd0,bd1,...bd7)...x32 328 bytes \| Block decipher. 369 int count) 370 { 371 // int is faster than unsigned char. apparently not 372 static const unsigned char block_sbox[0x100] = { 373 0x3A,0xEA,0x68,0xFE,0x33,0xE9,0x88,0x1A, 0x83,0xCF,0xE1,0x7F,0xBA,0xE2,0x38,0x12, 374 0xE8,0x27,0x61,0x95,0x0C,0x36,0xE5,0x70, 0xA2,0x06,0x82,0x7C,0x17,0xA3,0x26,0x49, 375 0xBE,0x7A,0x6D,0x47,0xC1,0x51,0x8F,0xF3, 0xCC,0x5B,0x67,0xBD,0xCD,0x18,0x08,0xC9, 376 0xFF,0x69,0xEF,0x03,0x4E,0x48,0x4A,0x84, 0x3F,0xB4,0x10,0x04,0xDC,0xF5,0x5C,0xC6, 377 0x16,0xAB,0xAC,0x4C,0xF1,0x6A,0x2F,0x3C, 0x3B,0xD4,0xD5,0x94,0xD0,0xC4,0x63,0x62, 378 0x71,0xA1,0xF9,0x4F,0x2E,0xAA,0xC5,0x56, 0xE3,0x39,0x93,0xCE,0x65,0x64,0xE4,0x58, 379 0x6C,0x19,0x42,0x79,0xDD,0xEE,0x96,0xF6, 0x8A,0xEC,0x1E,0x85,0x53,0x45,0xDE,0xBB, 380 0x7E,0x0A,0x9A,0x13,0x2A,0x9D,0xC2,0x5E, 0x5A,0x1F,0x32,0x35,0x9C,0xA8,0x73,0x30, 381 382 0x29,0x3D,0xE7,0x92,0x87,0x1B,0x2B,0x4B, 0xA5,0x57,0x97,0x40,0x15,0xE6,0xBC,0x0E, 383 0xEB,0xC3,0x34,0x2D,0xB8,0x44,0x25,0xA4, 0x1C,0xC7,0x23,0xED,0x90,0x6E,0x50,0x00, 384 0x99,0x9E,0x4D,0xD9,0xDA,0x8D,0x6F,0x5F, 0x3E,0xD7,0x21,0x74,0x86,0xDF,0x6B,0x05, 385 0x8E,0x5D,0x37,0x11,0xD2,0x28,0x75,0xD6, 0xA7,0x77,0x24,0xBF,0xF0,0xB0,0x02,0xB7, 386 0xF8,0xFC,0x81,0x09,0xB1,0x01,0x76,0x91, 0x7D,0x0F,0xC8,0xA0,0xF2,0xCB,0x78,0x60, 387 0xD1,0xF7,0xE0,0xB5,0x98,0x22,0xB3,0x20, 0x1D,0xA6,0xDB,0x7B,0x59,0x9F,0xAE,0x31, 388 0xFB,0xD3,0xB6,0xCA,0x43,0x72,0x07,0xF4, 0xD8,0x41,0x14,0x55,0x0D,0x54,0x8B,0xB9, 389 0xAD,0x46,0x0B,0xAF,0x80,0x52,0x2C,0xFA, 0x8C,0x89,0x66,0xFD,0xB2,0xA9,0x9B,0xC0, 390 }; 391 MEMALIGN unsigned char r[GROUP_PARALLELISM(8+56)]; /* 56 because we will move back in memory while looping / 392 MEMALIGN unsigned char sbox_in[GROUP_PARALLELISM],sbox_out[GROUP_PARALLELISM],perm_out[GROUP_PARALLELISM]; 393 int roff; 394 int i,g,count_all=GROUP_PARALLELISM; 395 396 roff=GROUP_PARALLELISM56; 397 398 #define FASTTRASP1 399 #ifndef FASTTRASP1 400 for(g=0;g<count;g++){ 401 // Init registers 402 int j; 403 for(j=0;j<8;j++){ 404 r[roff+GROUP_PARALLELISMj+g]=ib[8g+j]; 405 } 406 } 407 #else 408 trasp_N_8((unsigned char )&r[roff],(unsigned char )ib,count); 409 #endif 410 //dump_mem("OLD r[roff]",&r[roff],GROUP_PARALLELISM8,GROUP_PARALLELISM); 411 412 // loop over kk[55]..kk[0] 413 for(i=55;i>=0;i--){ 414 { 415 MEMALIGN batch tkkmulti=kkmulti[i]; 416 batch si=(batch )sbox_in; 417 batch r6_N=(batch )(r+roff+GROUP_PARALLELISM6); 418 for(g=0;g<count_all/BYTES_PER_BATCH;g++){ 419 si[g]=B_FFXOR(tkkmulti,r6_N[g]); //FIXME: introduce FASTBATCH? 420 } 421 } 422 423 // table lookup, this works on only one byte at a time 424 // most difficult part of all 425 // - can't be parallelized 426 // - can't be synthetized through boolean terms (8 input bits are too many) 427 for(g=0;g<count_all;g++){ 428 sbox_out[g]=block_sbox[sbox_in[g]]; 429 } 430 431 // bit permutation 432 { 433 unsigned char po=(unsigned char )perm_out; 434 unsigned char so=(unsigned char )sbox_out; 435 //dump_mem("pre perm ",(unsigned char )so,GROUP_PARALLELISM,GROUP_PARALLELISM); 436 for(g=0;g<count_all;g+=BYTES_PER_BATCH){ 437 MEMALIGN batch in,out; 438 in=(batch )&so[g]; 439 440 out=B_FFOR( 441 B_FFOR( 442 B_FFOR( 443 B_FFOR( 444 B_FFOR( 445 B_FFSH8L(B_FFAND(in,B_FFN_ALL_29()),1), 446 B_FFSH8L(B_FFAND(in,B_FFN_ALL_02()),6)), 447 B_FFSH8L(B_FFAND(in,B_FFN_ALL_04()),3)), 448 B_FFSH8R(B_FFAND(in,B_FFN_ALL_10()),2)), 449 B_FFSH8R(B_FFAND(in,B_FFN_ALL_40()),6)), 450 B_FFSH8R(B_FFAND(in,B_FFN_ALL_80()),4)); 451 452 (batch )&po[g]=out; 453 } 454 //dump_mem("post perm",(unsigned char )po,GROUP_PARALLELISM,GROUP_PARALLELISM); 455 } 456 457 roff-=GROUP_PARALLELISM; /* virtual shift of registers / 458 459 #if 0 460 / one by one / 461 for(g=0;g<count_all;g++){ 462 r[roff+GROUP_PARALLELISM0+g]=r[roff+GROUP_PARALLELISM8+g]^sbox_out[g]; 463 r[roff+GROUP_PARALLELISM6+g]^=perm_out[g]; 464 r[roff+GROUP_PARALLELISM4+g]^=r[roff+GROUP_PARALLELISM0+g]; 465 r[roff+GROUP_PARALLELISM3+g]^=r[roff+GROUP_PARALLELISM0+g]; 466 r[roff+GROUP_PARALLELISM2+g]^=r[roff+GROUP_PARALLELISM0+g]; 467 } 468 #else 469 for(g=0;g<count_all;g+=BEST_SPAN){ 470 XOR_BEST_BY(&r[roff+GROUP_PARALLELISM0+g],&r[roff+GROUP_PARALLELISM8+g],&sbox_out[g]); 471 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM6+g],&perm_out[g]); 472 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM4+g],&r[roff+GROUP_PARALLELISM0+g]); 473 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM3+g],&r[roff+GROUP_PARALLELISM0+g]); 474 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM2+g],&r[roff+GROUP_PARALLELISM0+g]); 475 } 476 #endif 477 } 478 479 #define FASTTRASP2 480 #ifndef FASTTRASP2 481 for(g=0;g<count;g++){ 482 // Copy results 483 int j; 484 for(j=0;j<8;j++){ 485 bd[8g+j]=r[roff+GROUP_PARALLELISMj+g]; 486 } 487 } 488 #else 489 trasp_8_N((unsigned char )&r[roff],(unsigned char )bd,count); 490 #endif 491 } 492 493 //-----------------------------------EXTERNAL INTERFACE 494 495 //-----get internal parallelism 496 497 int get_internal_parallelism(void){ 498 return GROUP_PARALLELISM; 499 } 500 501 //-----get suggested cluster size 502 503 int get_suggested_cluster_size(void){ 504 int r; 505 r=GROUP_PARALLELISM+GROUP_PARALLELISM/10; 506 if(r<GROUP_PARALLELISM+5) r=GROUP_PARALLELISM+5; 507 return r; 508 } 509 510 //-----key structure 511 512 void get_key_struct(void){ 513 struct csa_keys_t keys=(struct csa_keys_t )MALLOC(sizeof(struct csa_keys_t)); 514 if(keys) { 515 static const unsigned char pk[8] = { 0,0,0,0,0,0,0,0 }; 516 set_control_words(keys,pk,pk); 517 } 518 return keys; 519 } 520 521 void free_key_struct(void keys){ 522 return FREE(keys); 523 } 524 525 //-----set control words 526 527 static void schedule_key(struct csa_key_t key, const unsigned char pk){ 528 // could be made faster, but is not run often 529 int bi,by; 530 int i,j; 531 // key 532 memcpy(key->ck,pk,8); 533 // precalculations for stream 534 key_schedule_stream(key->ck,key->iA,key->iB); 535 for(by=0;by<8;by++){ 536 for(bi=0;bi<8;bi++){ 537 key->ck_g[by][bi]=(key->ck[by]&(1<<bi))?FF1():FF0(); 538 } 539 } 540 for(by=0;by<8;by++){ 541 for(bi=0;bi<4;bi++){ 542 key->iA_g[by][bi]=(key->iA[by]&(1<<bi))?FF1():FF0(); 543 key->iB_g[by][bi]=(key->iB[by]&(1<<bi))?FF1():FF0(); 544 } 545 } 546 // precalculations for block 547 key_schedule_block(key->ck,key->kk); 548 for(i=0;i<56;i++){ 549 for(j=0;j<BYTES_PER_BATCH;j++){ 550 (((unsigned char )&key->kkmulti[i])+j)=key->kk[i]; 551 } 552 } 553 } 554 555 void set_control_words(void keys, const unsigned char ev, const unsigned char od){ 556 schedule_key(&((struct csa_keys_t )keys)->even,ev); 557 schedule_key(&((struct csa_keys_t )keys)->odd,od); 558 } 559 560 void set_even_control_word(void keys, const unsigned char pk){ 561 schedule_key(&((struct csa_keys_t )keys)->even,pk); 562 } 563 564 void set_odd_control_word(void keys, const unsigned char pk){ 565 schedule_key(&((struct csa_keys_t )keys)->odd,pk); 566 } 567 568 //-----get control words 569 570 void get_control_words(void keys, unsigned char even, unsigned char odd){ 571 memcpy(even,&((struct csa_keys_t )keys)->even.ck,8); 572 memcpy(odd,&((struct csa_keys_t )keys)->odd.ck,8); 573 } 574 575 //----- decrypt 576 577 int decrypt_packets(void keys, unsigned char cluster){ 578 // statistics, currently unused 579 int stat_no_scramble=0; 580 int stat_reserved=0; 581 int stat_decrypted[2]={0,0}; 582 int stat_decrypted_mini=0; 583 unsigned char clst; 584 unsigned char *clst2; 585 int grouped; 586 int group_ev_od; 587 int advanced; 588 int can_advance; 589 unsigned char g_pkt[GROUP_PARALLELISM]; 590 int g_len[GROUP_PARALLELISM]; 591 int g_offset[GROUP_PARALLELISM]; 592 int g_n[GROUP_PARALLELISM]; 593 int g_residue[GROUP_PARALLELISM]; 594 unsigned char pkt; 595 int xc0,ev_od,len,offset,n,residue; 596 struct csa_key_t k; 597 int i,j,iter,g; 598 int t23,tsmall; 599 int alive[24]; 600 //icc craziness int pad1=0; //////////align! FIXME 601 unsigned char encp[GROUP_PARALLELISM]; 602 MEMALIGN unsigned char stream_in[GROUP_PARALLELISM8]; 603 MEMALIGN unsigned char stream_out[GROUP_PARALLELISM8]; 604 MEMALIGN unsigned char ib[GROUP_PARALLELISM8]; 605 MEMALIGN unsigned char block_out[GROUP_PARALLELISM8]; 606 #ifdef COPY_UNALIGNED_PKT 607 unsigned char unaligned[GROUP_PARALLELISM]; 608 MEMALIGN unsigned char alignedBuff[GROUP_PARALLELISM][188]; 609 #endif 610 struct stream_regs regs; 611 612 //icc craziness i=(int)&pad1;//////////align!!! FIXME 613 614 // build a list of packets to be processed 615 clst=cluster; 616 grouped=0; 617 advanced=0; 618 can_advance=1; 619 group_ev_od=-1; // silence incorrect compiler warning 620 pkt=clst; 621 do{ // find a new packet 622 if(grouped==GROUP_PARALLELISM){ 623 // full 624 break; 625 } 626 if(pkt==NULL){ 627 // no more ranges 628 break; 629 } 630 if(pkt>=(clst+1)){ 631 // out of this range, try next 632 clst++;clst++; 633 pkt=clst; 634 continue; 635 } 636 637 do{ // handle this packet 638 xc0=pkt[3]&0xc0; 639 DBG(fprintf(stderr," exam pkt=%p, xc0=%02x, can_adv=%i\n",pkt,xc0,can_advance)); 640 if(xc0==0x00){ 641 DBG(fprintf(stderr,"skip clear pkt %p (can_advance is %i)\n",pkt,can_advance)); 642 advanced+=can_advance; 643 stat_no_scramble++; 644 break; 645 } 646 if(xc0==0x40){ 647 DBG(fprintf(stderr,"skip reserved pkt %p (can_advance is %i)\n",pkt,can_advance)); 648 advanced+=can_advance; 649 stat_reserved++; 650 break; 651 } 652 if(xc0==0x80\|\|xc0==0xc0){ // encrypted 653 ev_od=(xc0&0x40)>>6; // 0 even, 1 odd 654 if(grouped==0) group_ev_od=ev_od; // this group will be all even (or odd) 655 if(group_ev_od==ev_od){ // could be added to group 656 pkt[3]&=0x3f; // consider it decrypted now 657 if(pkt[3]&0x20){ // incomplete packet 658 offset=4+pkt[4]+1; 659 len=188-offset; 660 n=len>>3; 661 residue=len-(n<<3); 662 if(n==0){ // decrypted==encrypted! 663 DBG(fprintf(stderr,"DECRYPTED MINI! (can_advance is %i)\n",can_advance)); 664 advanced+=can_advance; 665 stat_decrypted_mini++; 666 break; // this doesn't need more processing 667 } 668 }else{ 669 len=184; 670 offset=4; 671 n=23; 672 residue=0; 673 } 674 g_pkt[grouped]=pkt; 675 g_len[grouped]=len; 676 g_offset[grouped]=offset; 677 g_n[grouped]=n; 678 g_residue[grouped]=residue; 679 DBG(fprintf(stderr,"%2i: eo=%i pkt=%p len=%03i n=%2i residue=%i\n",grouped,ev_od,pkt,len,n,residue)); 680 grouped++; 681 advanced+=can_advance; 682 stat_decrypted[ev_od]++; 683 } 684 else{ 685 can_advance=0; 686 DBG(fprintf(stderr,"skip pkt %p and can_advance set to 0\n",pkt)); 687 break; // skip and go on 688 } 689 } 690 } while(0); 691 692 if(can_advance){ 693 // move range start forward 694 clst+=188; 695 } 696 // next packet, if there is one 697 pkt+=188; 698 } while(1); 699 DBG(fprintf(stderr,"-- result: grouped %i pkts, advanced %i pkts\n",grouped,advanced)); 700 701 // delete empty ranges and compact list 702 clst2=cluster; 703 for(clst=cluster;clst!=NULL;clst+=2){ 704 // if not empty 705 if(clst<(clst+1)){ 706 // it will remain 707 clst2=clst; 708 (clst2+1)=(clst+1); 709 clst2+=2; 710 } 711 } 712 clst2=NULL; 713 714 if(grouped==0){ 715 // no processing needed 716 return advanced; 717 } 718 719 // sort them, longest payload first 720 // we expect many n=23 packets and a few n<23 721 DBG(fprintf(stderr,"PRESORTING\n")); 722 for(i=0;i<grouped;i++){ 723 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 724 } 725 // grouped is always <= GROUP_PARALLELISM 726 727 #define g_swap(a,b) \ 728 pkt=g_pkt[a]; \ 729 g_pkt[a]=g_pkt[b]; \ 730 g_pkt[b]=pkt; \ 731 \ 732 len=g_len[a]; \ 733 g_len[a]=g_len[b]; \ 734 g_len[b]=len; \ 735 \ 736 offset=g_offset[a]; \ 737 g_offset[a]=g_offset[b]; \ 738 g_offset[b]=offset; \ 739 \ 740 n=g_n[a]; \ 741 g_n[a]=g_n[b]; \ 742 g_n[b]=n; \ 743 \ 744 residue=g_residue[a]; \ 745 g_residue[a]=g_residue[b]; \ 746 g_residue[b]=residue; 747 748 // step 1: move n=23 packets before small packets 749 t23=0; 750 tsmall=grouped-1; 751 for(;;){ 752 for(;t23<grouped;t23++){ 753 if(g_n[t23]!=23) break; 754 } 755 DBG(fprintf(stderr,"t23 after for =%i\n",t23)); 756 757 for(;tsmall>=0;tsmall--){ 758 if(g_n[tsmall]==23) break; 759 } 760 DBG(fprintf(stderr,"tsmall after for =%i\n",tsmall)); 761 762 if(tsmall-t23<1) break; 763 764 DBG(fprintf(stderr,"swap t23=%i,tsmall=%i\n",t23,tsmall)); 765 766 g_swap(t23,tsmall); 767 768 t23++; 769 tsmall--; 770 DBG(fprintf(stderr,"new t23=%i,tsmall=%i\n\n",t23,tsmall)); 771 } 772 DBG(fprintf(stderr,"packets with n=23, t23=%i grouped=%i\n",t23,grouped)); 773 DBG(fprintf(stderr,"MIDSORTING\n")); 774 for(i=0;i<grouped;i++){ 775 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 776 } 777 778 // step 2: sort small packets in decreasing order of n (bubble sort is enough) 779 for(i=t23;i<grouped;i++){ 780 for(j=i+1;j<grouped;j++){ 781 if(g_n[j]>g_n[i]){ 782 g_swap(i,j); 783 } 784 } 785 } 786 DBG(fprintf(stderr,"POSTSORTING\n")); 787 for(i=0;i<grouped;i++){ 788 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 789 } 790 791 // we need to know how many packets need 23 iterations, how many 22... 792 for(i=0;i<=23;i++){ 793 alive[i]=0; 794 } 795 // count 796 alive[23-1]=t23; 797 for(i=t23;i<grouped;i++){ 798 alive[g_n[i]-1]++; 799 } 800 // integrate 801 for(i=22;i>=0;i--){ 802 alive[i]+=alive[i+1]; 803 } 804 DBG(fprintf(stderr,"ALIVE\n")); 805 for(i=0;i<=23;i++){ 806 DBG(fprintf(stderr,"alive%2i=%i\n",i,alive[i])); 807 } 808 809 // choose key 810 if(group_ev_od==0){ 811 k=&((struct csa_keys_t )keys)->even; 812 } 813 else{ 814 k=&((struct csa_keys_t )keys)->odd; 815 } 816 817 //INIT 818 //#define INITIALIZE_UNUSED_INPUT 819 #ifdef INITIALIZE_UNUSED_INPUT 820 // unnecessary zeroing. 821 // without this, we operate on uninitialized memory 822 // when grouped<GROUP_PARALLELISM, but it's not a problem, 823 // as final results will be discarded. 824 // random data makes debugging sessions difficult. 825 for(j=0;j<GROUP_PARALLELISM8;j++) stream_in[j]=0; 826 DBG(fprintf(stderr,"--- WARNING: you could gain speed by not initializing unused memory ---\n")); 827 #else 828 DBG(fprintf(stderr,"--- WARNING: DEBUGGING IS MORE DIFFICULT WHEN PROCESSING RANDOM DATA CHANGING AT EVERY RUN! ---\n")); 829 #endif 830 831 for(g=0;g<grouped;g++){ 832 encp[g]=g_pkt[g]; 833 DBG(fprintf(stderr,"header[%i]=%p (%02x)\n",g,encp[g],(encp[g]))); 834 encp[g]+=g_offset[g]; // skip header 835 #ifdef COPY_UNALIGNED_PKT 836 if(((int)encp[g])&0x03) { 837 memcpy(alignedBuff[g],encp[g],g_len[g]); 838 unaligned[g]=encp[g]; ... This diff was truncated because it exceeds the maximum size that can be displayed.	{ "url": "https://tvheadend.org/attachments/5404/oscam-emu.11384.patch", "source_domain": "tvheadend.org", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "233127", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NTRLSW6YDN5C7KK5L5LG5K6WKAQORYA7", "WARC-Concurrent-To": "<urn:uuid:b41701e1-4433-4c39-acf1-2f19f573e1e3>", "WARC-Date": "2019-03-22T21:12:23Z", "WARC-IP-Address": "104.31.95.73", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:7552ATJBU4RNRM3PSZX7FKCW5IYMLTC4", "WARC-Record-ID": "<urn:uuid:dceb9ee1-aeeb-4a2f-9a37-6a43765affdc>", "WARC-Target-URI": "https://tvheadend.org/attachments/5404/oscam-emu.11384.patch", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:398d93fb-7bd3-4079-b051-4652c6566998>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-152-225-239.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }	{ "line_start_idx": [ 0, 8, 9, 17, 18, 26, 27, 49, 50, 77, 78, 96, 97, 127, 135, 175, 183, 223, 231, 271, 275, 315, 323, 369, 377, 401, 409, 437, 444, 452, 492, 500, 540, 548, 588, 592, 632, 640, 668, 676, 682, 690, 744, 751, 759, 810, 818, 895, 903, 904, 908, 1056, 1060, 1118, 1122, 1154, 1158, 1178, 1182, 1245, 1249, 1309, 1313, 1314, 1322, 1467, 1475, 1545, 1553, 1554, 1561, 1569, 1596, 1604, 1631, 1639, 1666, 1670, 1697, 1705, 1706, 1714, 1782, 1790, 1934, 1941, 1949, 1950, 1958, 1981, 1989, 2042, 2046, 2143, 2147, 2252, 2260, 2291, 2299, 2317, 2325, 2357, 2364, 2372, 2475, 2483, 2534, 2542, 2630, 2634, 2654, 2658, 2724, 2728, 2790, 2794, 2863, 2867, 2868, 2876, 2937, 2945, 2974, 2982, 3072, 3079, 3087, 3088, 3096, 3178, 3186, 3187, 3191, 3240, 3244, 3278, 3282, 3333, 3337, 3352, 3356, 3408, 3412, 3523, 3527, 3581, 3585, 3658, 3662, 3717, 3721, 3799, 3803, 3920, 3924, 3941, 3945, 3999, 4003, 4040, 4044, 4096, 4100, 4101, 4109, 4177, 4185, 4186, 4194, 4270, 4277, 4285, 4324, 4332, 4352, 4360, 4361, 4365, 4379, 4383, 4429, 4433, 4450, 4454, 4455, 4463, 4483, 4507, 4513, 4514, 4520, 4548, 4554, 4555, 4558, 4606, 4609, 4651, 4654, 4725, 4728, 4733, 4736, 4781, 4784, 4790, 4793, 4794, 4800, 4875, 4881, 4952, 4958, 5000, 5007, 5015, 5060, 5068, 5119, 5127, 5176, 5180, 5224, 5228, 5278, 5282, 5333, 5337, 5381, 5385, 5412, 5416, 5440, 5444, 5463, 5467, 5503, 5507, 5537, 5541, 5580, 5584, 5661, 5665, 5671, 5675, 5681, 5685, 5691, 5695, 5701, 5709, 5750, 5758, 5814, 5822, 5872, 5879, 5887, 5913, 5921, 5926, 5934, 6014, 6018, 6100, 6104, 6204, 6212, 6225, 6233, 6317, 6325, 6382, 6406, 6410, 6428, 6432, 6450, 6454, 6455, 6457, 6476, 6480, 6496, 6500, 6524, 6528, 6551, 6576, 6580, 6590, 6594, 6595, 6597, 6815, 6817, 7044, 7048, 7247, 7251, 7439, 7443, 7639, 7646, 7652, 7674, 7680, 7698, 7704, 7727, 7730, 7748, 7754, 7779, 7785, 7808, 7814, 7841, 7848, 7856, 7857, 7865, 7881, 7889, 7915, 7919, 8018, 8022, 8123, 8127, 8235, 8239, 8349, 8357, 8413, 8421, 8476, 8484, 8547, 8555, 8683, 8687, 8746, 8750, 8804, 8808, 8866, 8874, 8876, 8884, 8885, 8893, 8909, 8916, 8924, 9009, 9017, 9095, 9103, 9214, 9218, 9326, 9330, 9439, 9443, 9594, 9598, 9715, 9719, 9837, 9841, 10001, 10009, 10011, 10019, 10020, 10028, 10046, 10053, 10061, 10125, 10133, 10210, 10218, 10296, 10300, 10364, 10372, 10389, 10397, 10398, 10406, 10416, 10445, 10451, 10452, 10458, 10509, 10515, 10516, 10519, 10545, 10548, 10550, 10553, 10571, 10574, 10593, 10596, 10614, 10617, 10628, 10631, 10632, 10638, 10654, 10660, 10686, 10692, 10698, 10705, 10713, 10785, 10793, 10822, 10830, 10834, 10838, 10873, 10877, 10905, 10913, 10915, 10923, 10950, 10958, 10985, 10992, 11000, 11070, 11078, 11091, 11099, 11103, 11107, 11188, 11192, 11266, 11274, 11276, 11284, 11297, 11305, 11306, 11313, 11321, 11384, 11392, 11444, 11452, 11456, 11460, 11537, 11541, 11611, 11619, 11621, 11629, 11646, 11654, 11673, 11702, 11706, 11735, 11739, 11740, 11744, 11839, 11842, 11849, 11855, 11856, 11859, 11941, 11944, 11972, 11975, 11993, 11996, 12015, 12018, 12036, 12039, 12050, 12056, 12057, 12060, 12089, 12092, 12167, 12170, 12241, 12247, 12254, 12257, 12339, 12342, 12349, 12386, 12392, 12443, 12449, 12502, 12508, 12560, 12563, 12612, 12618, 12619, 12625, 12632, 12670, 12672, 12690, 12692, 12693, 12695, 12732, 12734, 12765, 12767, 12768, 12770, 12795, 12797, 12798, 12800, 12865, 12896, 12898, 12931, 12933, 12963, 12965, 12966, 12968, 13025, 13027, 13092, 13094, 13156, 13158, 13217, 13219, 13220, 13222, 13238, 13241, 13242, 13245, 13309, 13312, 13381, 13384, 13455, 13458, 13527, 13530, 13590, 13593, 13664, 13667, 13738, 13741, 13811, 13814, 13834, 13837, 13838, 13841, 13908, 13911, 13982, 13985, 14056, 14059, 14129, 14132, 14201, 14204, 14269, 14272, 14273, 14276, 14343, 14346, 14417, 14420, 14492, 14495, 14551, 14554, 14555, 14558, 14625, 14628, 14698, 14701, 14770, 14773, 14841, 14844, 14852, 14855, 14856, 14859, 14932, 14935, 15004, 15007, 15046, 15049, 15050, 15053, 15124, 15127, 15193, 15196, 15269, 15272, 15344, 15347, 15419, 15422, 15444, 15447, 15448, 15451, 15516, 15519, 15587, 15590, 15661, 15664, 15734, 15737, 15809, 15812, 15813, 15816, 15881, 15884, 15905, 15908, 15910, 15913, 15946, 15949, 16016, 16019, 16020, 16023, 16093, 16096, 16165, 16168, 16239, 16242, 16312, 16315, 16384, 16387, 16453, 16456, 16525, 16528, 16599, 16602, 16666, 16669, 16670, 16673, 16742, 16745, 16810, 16813, 16884, 16887, 16950, 16953, 17019, 17022, 17077, 17080, 17081, 17084, 17150, 17153, 17217, 17220, 17288, 17291, 17356, 17359, 17430, 17433, 17501, 17504, 17528, 17531, 17532, 17535, 17605, 17608, 17680, 17683, 17684, 17687, 17757, 17760, 17822, 17825, 17892, 17895, 17955, 17958, 17959, 17962, 18030, 18033, 18100, 18103, 18104, 18107, 18178, 18181, 18249, 18253, 18323, 18327, 18372, 18376, 18377, 18381, 18450, 18454, 18517, 18521, 18590, 18594, 18659, 18663, 18734, 18738, 18804, 18808, 18878, 18882, 18949, 18953, 19022, 19026, 19085, 19089, 19091, 19095, 19157, 19161, 19230, 19234, 19301, 19305, 19373, 19377, 19444, 19448, 19518, 19522, 19592, 19596, 19662, 19666, 19740, 19744, 19745, 19749, 19819, 19823, 19893, 19897, 19961, 19965, 20004, 20008, 20009, 20013, 20084, 20088, 20158, 20162, 20231, 20235, 20262, 20266, 20267, 20271, 20340, 20344, 20414, 20418, 20489, 20493, 20494, 20498, 20567, 20571, 20642, 20646, 20723, 20727, 20728, 20732, 20799, 20803, 20870, 20874, 20940, 20944, 21010, 21014, 21084, 21088, 21139, 21143, 21144, 21148, 21218, 21222, 21289, 21293, 21357, 21361, 21430, 21434, 21484, 21488, 21489, 21493, 21561, 21565, 21634, 21638, 21707, 21711, 21775, 21779, 21850, 21854, 21918, 21922, 21988, 21992, 22061, 22065, 22134, 22138, 22173, 22177, 22178, 22182, 22247, 22251, 22316, 22320, 22381, 22385, 22452, 22456, 22513, 22517, 22519, 22523, 22592, 22596, 22658, 22662, 22729, 22733, 22804, 22808, 22877, 22881, 22950, 22954, 22989, 22993, 22994, 22998, 23067, 23071, 23140, 23144, 23211, 23215, 23283, 23287, 23351, 23355, 23424, 23428, 23496, 23500, 23534, 23538, 23539, 23543, 23613, 23617, 23683, 23687, 23758, 23762, 23822, 23826, 23897, 23901, 23970, 23974, 23988, 23992, 23993, 23997, 24067, 24071, 24140, 24144, 24212, 24216, 24287, 24291, 24354, 24358, 24429, 24433, 24504, 24508, 24573, 24577, 24648, 24652, 24722, 24726, 24794, 24798, 24849, 24853, 24854, 24858, 24928, 24932, 25003, 25007, 25070, 25074, 25089, 25093, 25094, 25098, 25166, 25170, 25239, 25243, 25308, 25312, 25373, 25377, 25441, 25445, 25510, 25514, 25580, 25584, 25655, 25659, 25729, 25733, 25753, 25757, 25758, 25762, 25832, 25836, 25882, 25886, 25888, 25892, 25960, 25964, 26034, 26038, 26106, 26110, 26177, 26181, 26249, 26253, 26323, 26327, 26385, 26389, 26390, 26394, 26468, 26472, 26545, 26549, 26622, 26626, 26660, 26664, 26665, 26669, 26740, 26744, 26816, 26820, 26894, 26898, 26967, 26971, 27045, 27049, 27126, 27130, 27142, 27146, 27147, 27151, 27221, 27225, 27299, 27303, 27373, 27377, 27450, 27454, 27526, 27530, 27604, 27608, 27666, 27670, 27671, 27675, 27694, 27698, 27699, 27703, 27778, 27782, 27855, 27859, 27930, 27934, 28009, 28013, 28082, 28086, 28160, 28164, 28235, 28239, 28312, 28316, 28338, 28342, 28343, 28347, 28423, 28427, 28495, 28499, 28574, 28578, 28654, 28658, 28732, 28736, 28809, 28813, 28888, 28892, 28962, 28966, 28995, 28999, 29000, 29004, 29039, 29043, 29045, 29049, 29106, 29110, 29111, 29115, 29185, 29189, 29260, 29264, 29340, 29344, 29345, 29349, 29420, 29424, 29492, 29496, 29565, 29569, 29639, 29643, 29644, 29648, 29724, 29728, 29769, 29773, 29774, 29778, 29851, 29855, 29928, 29932, 30002, 30006, 30046, 30050, 30051, 30055, 30123, 30127, 30194, 30198, 30264, 30268, 30317, 30321, 30322, 30326, 30396, 30400, 30464, 30468, 30530, 30534, 30535, 30539, 30612, 30616, 30617, 30621, 30692, 30696, 30735, 30739, 30740, 30744, 30806, 30810, 30888, 30892, 30958, 30962, 31019, 31023, 31024, 31028, 31104, 31108, 31182, 31186, 31259, 31263, 31320, 31324, 31325, 31329, 31401, 31405, 31474, 31478, 31525, 31529, 31530, 31534, 31607, 31611, 31686, 31690, 31691, 31695, 31734, 31738, 31767, 31771, 31772, 31776, 31852, 31856, 31928, 31932, 32008, 32012, 32082, 32086, 32126, 32158, 32160, 32168, 32170, 32207, 32240, 32242, 32277, 32279, 32282, 32284, 32321, 32323, 32326, 32328, 32400, 32402, 32474, 32476, 32545, 32547, 32586, 32588, 32591, 32594, 32661, 32664, 32730, 32733, 32798, 32801, 32849, 32852, 32855, 32858, 32927, 32930, 32993, 32996, 33057, 33060, 33064, 33067, 33068, 33071, 33072, 33075, 33098, 33101, 33121, 33124, 33143, 33146, 33166, 33169, 33170, 33173, 33194, 33197, 33198, 33201, 33214, 33217, 33232, 33235, 33242, 33245, 33246, 33249, 33265, 33268, 33281, 33284, 33301, 33304, 33310, 33313, 33328, 33331, 33338, 33341, 33342, 33345, 33410, 33413, 33433, 33436, 33470, 33473, 33507, 33510, 33544, 33547, 33581, 33584, 33618, 33621, 33655, 33658, 33692, 33695, 33729, 33732, 33766, 33769, 33803, 33806, 33840, 33843, 33877, 33880, 33914, 33917, 33951, 33954, 33988, 33991, 33992, 33995, 34108, 34111, 34133, 34136, 34137, 34140, 34183, 34186, 34226, 34229, 34230, 34233, 34297, 34300, 34339, 34342, 34343, 34346, 34388, 34391, 34429, 34432, 34459, 34462, 34485, 34488, 34489, 34492, 34498, 34501, 34539, 34542, 34549, 34552, 34553, 34556, 34563, 34566, 34679, 34682, 34683, 34686, 34716, 34719, 34737, 34740, 34777, 34780, 34812, 34815, 34855, 34858, 34891, 34894, 34931, 34934, 34964, 34967, 35006, 35009, 35041, 35044, 35084, 35087, 35120, 35123, 35161, 35164, 35195, 35198, 35236, 35239, 35270, 35273, 35310, 35313, 35343, 35346, 35387, 35390, 35423, 35426, 35468, 35471, 35505, 35509, 35548, 35552, 35583, 35587, 35627, 35631, 35663, 35667, 35706, 35710, 35741, 35745, 35783, 35787, 35817, 35821, 35860, 35864, 35895, 35899, 35905, 35909, 35950, 35954, 35961, 35965, 35966, 35970, 36005, 36009, 36010, 36014, 36060, 36064, 36093, 36097, 36138, 36142, 36170, 36174, 36175, 36179, 36200, 36204, 36205, 36209, 36224, 36228, 36273, 36277, 36297, 36301, 36324, 36328, 36335, 36339, 36366, 36370, 36377, 36381, 36382, 36386, 36389, 36393, 36394, 36398, 36413, 36417, 36445, 36449, 36456, 36460, 36473, 36477, 36501, 36505, 36512, 36516, 36536, 36540, 36596, 36600, 36606, 36610, 36627, 36631, 36638, 36642, 36643, 36647, 36663, 36667, 36668, 36672, 36685, 36689, 36777, 36781, 36790, 36794, 36816, 36820, 36866, 36870, 36928, 36932, 36942, 36946, 36984, 36988, 37026, 37030, 37036, 37040, 37074, 37078, 37082, 37086, 37127, 37131, 37133, 37137, 37144, 37148, 37149, 37153, 37236, 37240, 37241, 37245, 37263, 37267, 37289, 37293, 37311, 37315, 37371, 37375, 37431, 37435, 37461, 37465, 37527, 37531, 37591, 37595, 37655, 37659, 37676, 37680, 37703, 37707, 37732, 37736, 37808, 37812, 37815, 37819, 37820, 37824, 37843, 37847, 37872, 37876, 37900, 37904, 37907, 37911, 37912, 37916, 37937, 37941, 37942, 37946, 37986, 37990, 38023, 38027, 38091, 38095, 38168, 38172, 38245, 38249, 38251, 38255, 38281, 38285, 38311, 38315, 38341, 38345, 38371, 38375, 38401, 38405, 38431, 38435, 38461, 38465, 38491, 38495, 38521, 38525, 38551, 38555, 38581, 38585, 38611, 38615, 38641, 38645, 38671, 38675, 38701, 38705, 38731, 38735, 38737, 38741, 38742, 38746, 38775, 38779, 38780, 38784, 38804, 38808, 38828, 38832, 38851, 38855, 38856, 38860, 38882, 38886, 38906, 38910, 38931, 38935, 38936, 38940, 38941, 38945, 38967, 38971, 38972, 38976, 39015, 39019, 39020, 39024, 39056, 39060, 39122, 39126, 39197, 39201, 39203, 39207, 39255, 39259, 39345, 39349, 39435, 39439, 39525, 39529, 39615, 39619, 39624, 39628, 39629, 39633, 39646, 39650, 39665, 39669, 39687, 39691, 39707, 39711, 39712, 39716, 39730, 39734, 39790, 39794, 39795, 39799, 39840, 39844, 39864, 39868, 39888, 39892, 39912, 39916, 39936, 39940, 39960, 39964, 39984, 39988, 40008, 40012, 40032, 40036, 40037, 40041, 40071, 40075, 40098, 40102, 40127, 40131, 40155, 40159, 40185, 40189, 40237, 40241, 40289, 40293, 40301, 40305, 40311, 40315, 40339, 40343, 40363, 40367, 40393, 40397, 40441, 40445, 40453, 40457, 40463, 40467, 40471, 40475, 40476, 40480, 40500, 40504, 40526, 40530, 40554, 40558, 40590, 40594, 40600, 40604, 40608, 40612, 40613, 40617, 40619, 40623, 40624, 40628, 40647, 40651, 40652, 40656, 40766, 40770, 40791, 40795, 40818, 40822, 40837, 40841, 40866, 40870, 40894, 40898, 40918, 40922, 40962, 40966, 40970, 40974, 41048, 41052, 41068, 41072, 41117, 41121, 41142, 41146, 41168, 41172, 41207, 41211, 41237, 41241, 41277, 41281, 41319, 41323, 41405, 41409, 41487, 41491, 41499, 41503, 41509, 41513, 41517, 41521, 41595, 41599, 41615, 41619, 41640, 41644, 41666, 41670, 41705, 41709, 41735, 41739, 41775, 41779, 41817, 41821, 41901, 41905, 41981, 41985, 41993, 41997, 42003, 42007, 42011, 42015, 42089, 42093, 42109, 42113, 42115, 42119, 42120, 42124, 42234, 42238, 42259, 42263, 42286, 42290, 42305, 42309, 42354, 42358, 42432, 42436, 42452, 42456, 42477, 42481, 42503, 42507, 42542, 42546, 42572, 42576, 42612, 42616, 42654, 42658, 42738, 42742, 42818, 42822, 42830, 42834, 42840, 42844, 42848, 42852, 42926, 42930, 42946, 42950, 42971, 42975, 42997, 43001, 43036, 43040, 43066, 43070, 43106, 43110, 43148, 43152, 43234, 43238, 43316, 43320, 43328, 43332, 43338, 43342, 43346, 43350, 43424, 43428, 43444, 43448, 43472, 43476, 43496, 43500, 43540, 43544, 43548, 43552, 43554, 43558, 43559, 43563, 43590, 43594, 43595, 43599, 43614, 43618, 43652, 43656, 43777, 43781, 43873, 43877, 43962, 43966, 43979, 43983, 43985, 43989, 44043, 44047, 44098, 44102, 44188, 44192, 44278, 44282, 44368, 44372, 44458, 44462, 44548, 44552, 44638, 44642, 44728, 44732, 44818, 44822, 44823, 44827, 44913, 44917, 45003, 45007, 45093, 45097, 45183, 45187, 45273, 45277, 45363, 45367, 45453, 45457, 45543, 45547, 45552, 45556, 45670, 45674, 45783, 45787, 45799, 45803, 45842, 45846, 45847, 45851, 45880, 45884, 45885, 45889, 45908, 45912, 45931, 45935, 45959, 45963, 45986, 45990, 46001, 46005, 46027, 46031, 46078, 46082, 46088, 46092, 46096, 46100, 46106, 46110, 46176, 46180, 46187, 46191, 46265, 46269, 46270, 46274, 46303, 46307, 46329, 46333, 46339, 46343, 46385, 46389, 46423, 46427, 46484, 46488, 46536, 46540, 46624, 46628, 46636, 46640, 46646, 46650, 46651, 46655, 46714, 46718, 46752, 46756, 46787, 46791, 46871, 46875, 46905, 46909, 46951, 46955, 46961, 46965, 46966, 46970, 46993, 46997, 47003, 47007, 47058, 47062, 47113, 47117, 47198, 47202, 47249, 47253, 47284, 47288, 47317, 47321, 47322, 47326, 47346, 47350, 47363, 47367, 47380, 47384, 47397, 47401, 47414, 47418, 47470, 47474, 47527, 47531, 47584, 47588, 47641, 47645, 47698, 47702, 47755, 47759, 47760, 47764, 47794, 47798, 47806, 47810, 47891, 47895, 47901, 47905, 47906, 47910, 47972, 47976, 47977, 47981, 47987, 47991, 48008, 48012, 48042, 48046, 48125, 48129, 48179, 48183, 48251, 48255, 48323, 48327, 48395, 48399, 48405, 48409, 48415, 48419, 48458, 48462, 48557, 48561, 48627, 48631, 48715, 48719, 48803, 48807, 48891, 48895, 48901, 48905, 48912, 48916, 48920, 48924, 48925, 48929, 48948, 48952, 48971, 48975, 48999, 49003, 49023, 49027, 49038, 49042, 49064, 49068, 49115, 49119, 49125, 49129, 49133, 49137, 49143, 49147, 49213, 49217, 49224, 49228, 49230, 49234, 49235, 49239, 49295, 49299, 49300, 49304, 49336, 49340, 49341, 49345, 49381, 49385, 49413, 49417, 49419, 49423, 49424, 49428, 49462, 49466, 49467, 49471, 49509, 49513, 49522, 49526, 49570, 49574, 49625, 49629, 49641, 49645, 49647, 49651, 49652, 49656, 49677, 49681, 49682, 49686, 49714, 49718, 49800, 49804, 49817, 49821, 49881, 49885, 49920, 49924, 49930, 49934, 49949, 49953, 49955, 49959, 49960, 49964, 49998, 50002, 50023, 50027, 50029, 50033, 50034, 50038, 50063, 50067, 50068, 50072, 50146, 50150, 50198, 50202, 50215, 50219, 50230, 50234, 50241, 50245, 50269, 50273, 50303, 50307, 50355, 50359, 50382, 50386, 50411, 50415, 50474, 50478, 50484, 50488, 50492, 50496, 50519, 50523, 50548, 50552, 50611, 50615, 50674, 50678, 50684, 50688, 50692, 50696, 50725, 50729, 50768, 50772, 50793, 50797, 50833, 50837, 50896, 50900, 50906, 50910, 50914, 50918, 50920, 50924, 50925, 50929, 51015, 51019, 51074, 51078, 51132, 51136, 51138, 51142, 51143, 51147, 51212, 51216, 51271, 51275, 51277, 51281, 51282, 51286, 51350, 51354, 51408, 51412, 51414, 51418, 51419, 51423, 51448, 51452, 51453, 51457, 51534, 51538, 51594, 51598, 51652, 51656, 51658, 51662, 51663, 51667, 51683, 51687, 51688, 51692, 51750, 51754, 51788, 51792, 51818, 51822, 51845, 51849, 51880, 51884, 51913, 51917, 51941, 51945, 51970, 51974, 51989, 51993, 52012, 52016, 52032, 52036, 52055, 52059, 52102, 52106, 52138, 52142, 52177, 52181, 52211, 52215, 52251, 52255, 52277, 52281, 52319, 52323, 52346, 52350, 52368, 52372, 52390, 52394, 52411, 52415, 52467, 52471, 52513, 52517, 52574, 52578, 52636, 52640, 52690, 52694, 52751, 52755, 52781, 52785, 52832, 52836, 52898, 52902, 52909, 52913, 52940, 52944, 52945, 52949, 53004, 53008, 53009, 53013, 53058, 53062, 53078, 53082, 53095, 53099, 53113, 53117, 53134, 53138, 53194, 53198, 53211, 53215, 53242, 53246, 53282, 53286, 53300, 53304, 53317, 53321, 53327, 53331, 53350, 53354, 53378, 53382, 53395, 53399, 53405, 53409, 53433, 53437, 53474, 53478, 53499, 53503, 53520, 53524, 53540, 53544, 53550, 53554, 53555, 53559, 53589, 53593, 53616, 53620, 53709, 53713, 53734, 53738, 53826, 53830, 53861, 53865, 53893, 53897, 53912, 53916, 53924, 53928, 53949, 53953, 54044, 54048, 54079, 54083, 54108, 54112, 54127, 54131, 54139, 54143, 54188, 54192, 54238, 54242, 54324, 54328, 54387, 54391, 54445, 54449, 54497, 54501, 54532, 54536, 54564, 54568, 54590, 54594, 54626, 54630, 54677, 54681, 54769, 54773, 54810, 54814, 54851, 54855, 54913, 54917, 54931, 54935, 54952, 54956, 54977, 54981, 55003, 55007, 55025, 55029, 55052, 55056, 55068, 55072, 55102, 55106, 55136, 55140, 55176, 55180, 55206, 55210, 55248, 55252, 55364, 55368, 55389, 55393, 55426, 55430, 55465, 55469, 55479, 55483, 55497, 55501, 55526, 55530, 55607, 55611, 55646, 55650, 55660, 55664, 55672, 55676, 55692, 55696, 55697, 55701, 55722, 55726, 55760, 55764, 55782, 55786, 55792, 55796, 55832, 55836, 55850, 55854, 55868, 55872, 55962, 55966, 55967, 55971, 56013, 56017, 56034, 56038, 56079, 56083, 56103, 56107, 56132, 56136, 56161, 56165, 56185, 56189, 56217, 56221, 56237, 56241, 56247, 56251, 56255, 56259, 56274, 56278, 56279, 56283, 56301, 56305, 56333, 56337, 56358, 56362, 56366, 56370, 56371, 56375, 56414, 56418, 56467, 56471, 56510, 56514, 56540, 56544, 56667, 56671, 56677, 56681, 56725, 56729, 56730, 56734, 56756, 56760, 56780, 56784, 56809, 56813, 56833, 56837, 56839, 56843, 56863, 56867, 56892, 56896, 56916, 56920, 56922, 56926, 56952, 56956, 56987, 56991, 57017, 57021, 57023, 57027, 57043, 57047, 57068, 57072, 57088, 57092, 57094, 57098, 57126, 57130, 57163, 57167, 57193, 57197, 57198, 57202, 57254, 57258, 57267, 57271, 57291, 57295, 57306, 57310, 57339, 57343, 57373, 57377, 57383, 57387, 57435, 57439, 57444, 57448, 57478, 57482, 57515, 57519, 57525, 57529, 57583, 57587, 57592, 57596, 57624, 57628, 57633, 57637, 57696, 57700, 57701, 57705, 57729, 57733, 57734, 57738, 57749, 57753, 57767, 57771, 57831, 57835, 57839, 57843, 57922, 57926, 57965, 57969, 57995, 57999, 58122, 58126, 58132, 58136, 58137, 58141, 58222, 58226, 58254, 58258, 58288, 58292, 58317, 58321, 58342, 58346, 58354, 58358, 58364, 58368, 58372, 58376, 58416, 58420, 58446, 58450, 58573, 58577, 58583, 58587, 58588, 58592, 58665, 58669, 58691, 58695, 58711, 58715, 58719, 58723, 58734, 58738, 58757, 58761, 58789, 58793, 58816, 58820, 58824, 58828, 58843, 58847, 58869, 58873, 58899, 58903, 58907, 58911, 58945, 58949, 58971, 58975, 59028, 59032, 59038, 59042, 59043, 59047, 59063, 59067, 59089, 59093, 59135, 59139, 59143, 59147, 59155, 59159, 59200, 59204, 59208, 59212, 59213, 59217, 59226, 59230, 59264, 59268, 59299, 59303, 59327, 59331, 59383, 59387, 59446, 59450, 59489, 59493, 59544, 59548, 59601, 59605, 59703, 59707, 59713, 59717, 59839, 59843, 59850, 59854, 59855, 59859, 59885, 59889, 59911, 59915, 59987, 59991, 60032, 60036, 60062, 60066, 60096, 60100, 60147, 60151, 60179 ], "line_end_idx": [ 8, 9, 17, 18, 26, 27, 49, 50, 77, 78, 96, 97, 127, 135, 175, 183, 223, 231, 271, 275, 315, 323, 369, 377, 401, 409, 437, 444, 452, 492, 500, 540, 548, 588, 592, 632, 640, 668, 676, 682, 690, 744, 751, 759, 810, 818, 895, 903, 904, 908, 1056, 1060, 1118, 1122, 1154, 1158, 1178, 1182, 1245, 1249, 1309, 1313, 1314, 1322, 1467, 1475, 1545, 1553, 1554, 1561, 1569, 1596, 1604, 1631, 1639, 1666, 1670, 1697, 1705, 1706, 1714, 1782, 1790, 1934, 1941, 1949, 1950, 1958, 1981, 1989, 2042, 2046, 2143, 2147, 2252, 2260, 2291, 2299, 2317, 2325, 2357, 2364, 2372, 2475, 2483, 2534, 2542, 2630, 2634, 2654, 2658, 2724, 2728, 2790, 2794, 2863, 2867, 2868, 2876, 2937, 2945, 2974, 2982, 3072, 3079, 3087, 3088, 3096, 3178, 3186, 3187, 3191, 3240, 3244, 3278, 3282, 3333, 3337, 3352, 3356, 3408, 3412, 3523, 3527, 3581, 3585, 3658, 3662, 3717, 3721, 3799, 3803, 3920, 3924, 3941, 3945, 3999, 4003, 4040, 4044, 4096, 4100, 4101, 4109, 4177, 4185, 4186, 4194, 4270, 4277, 4285, 4324, 4332, 4352, 4360, 4361, 4365, 4379, 4383, 4429, 4433, 4450, 4454, 4455, 4463, 4483, 4507, 4513, 4514, 4520, 4548, 4554, 4555, 4558, 4606, 4609, 4651, 4654, 4725, 4728, 4733, 4736, 4781, 4784, 4790, 4793, 4794, 4800, 4875, 4881, 4952, 4958, 5000, 5007, 5015, 5060, 5068, 5119, 5127, 5176, 5180, 5224, 5228, 5278, 5282, 5333, 5337, 5381, 5385, 5412, 5416, 5440, 5444, 5463, 5467, 5503, 5507, 5537, 5541, 5580, 5584, 5661, 5665, 5671, 5675, 5681, 5685, 5691, 5695, 5701, 5709, 5750, 5758, 5814, 5822, 5872, 5879, 5887, 5913, 5921, 5926, 5934, 6014, 6018, 6100, 6104, 6204, 6212, 6225, 6233, 6317, 6325, 6382, 6406, 6410, 6428, 6432, 6450, 6454, 6455, 6457, 6476, 6480, 6496, 6500, 6524, 6528, 6551, 6576, 6580, 6590, 6594, 6595, 6597, 6815, 6817, 7044, 7048, 7247, 7251, 7439, 7443, 7639, 7646, 7652, 7674, 7680, 7698, 7704, 7727, 7730, 7748, 7754, 7779, 7785, 7808, 7814, 7841, 7848, 7856, 7857, 7865, 7881, 7889, 7915, 7919, 8018, 8022, 8123, 8127, 8235, 8239, 8349, 8357, 8413, 8421, 8476, 8484, 8547, 8555, 8683, 8687, 8746, 8750, 8804, 8808, 8866, 8874, 8876, 8884, 8885, 8893, 8909, 8916, 8924, 9009, 9017, 9095, 9103, 9214, 9218, 9326, 9330, 9439, 9443, 9594, 9598, 9715, 9719, 9837, 9841, 10001, 10009, 10011, 10019, 10020, 10028, 10046, 10053, 10061, 10125, 10133, 10210, 10218, 10296, 10300, 10364, 10372, 10389, 10397, 10398, 10406, 10416, 10445, 10451, 10452, 10458, 10509, 10515, 10516, 10519, 10545, 10548, 10550, 10553, 10571, 10574, 10593, 10596, 10614, 10617, 10628, 10631, 10632, 10638, 10654, 10660, 10686, 10692, 10698, 10705, 10713, 10785, 10793, 10822, 10830, 10834, 10838, 10873, 10877, 10905, 10913, 10915, 10923, 10950, 10958, 10985, 10992, 11000, 11070, 11078, 11091, 11099, 11103, 11107, 11188, 11192, 11266, 11274, 11276, 11284, 11297, 11305, 11306, 11313, 11321, 11384, 11392, 11444, 11452, 11456, 11460, 11537, 11541, 11611, 11619, 11621, 11629, 11646, 11654, 11673, 11702, 11706, 11735, 11739, 11740, 11744, 11839, 11842, 11849, 11855, 11856, 11859, 11941, 11944, 11972, 11975, 11993, 11996, 12015, 12018, 12036, 12039, 12050, 12056, 12057, 12060, 12089, 12092, 12167, 12170, 12241, 12247, 12254, 12257, 12339, 12342, 12349, 12386, 12392, 12443, 12449, 12502, 12508, 12560, 12563, 12612, 12618, 12619, 12625, 12632, 12670, 12672, 12690, 12692, 12693, 12695, 12732, 12734, 12765, 12767, 12768, 12770, 12795, 12797, 12798, 12800, 12865, 12896, 12898, 12931, 12933, 12963, 12965, 12966, 12968, 13025, 13027, 13092, 13094, 13156, 13158, 13217, 13219, 13220, 13222, 13238, 13241, 13242, 13245, 13309, 13312, 13381, 13384, 13455, 13458, 13527, 13530, 13590, 13593, 13664, 13667, 13738, 13741, 13811, 13814, 13834, 13837, 13838, 13841, 13908, 13911, 13982, 13985, 14056, 14059, 14129, 14132, 14201, 14204, 14269, 14272, 14273, 14276, 14343, 14346, 14417, 14420, 14492, 14495, 14551, 14554, 14555, 14558, 14625, 14628, 14698, 14701, 14770, 14773, 14841, 14844, 14852, 14855, 14856, 14859, 14932, 14935, 15004, 15007, 15046, 15049, 15050, 15053, 15124, 15127, 15193, 15196, 15269, 15272, 15344, 15347, 15419, 15422, 15444, 15447, 15448, 15451, 15516, 15519, 15587, 15590, 15661, 15664, 15734, 15737, 15809, 15812, 15813, 15816, 15881, 15884, 15905, 15908, 15910, 15913, 15946, 15949, 16016, 16019, 16020, 16023, 16093, 16096, 16165, 16168, 16239, 16242, 16312, 16315, 16384, 16387, 16453, 16456, 16525, 16528, 16599, 16602, 16666, 16669, 16670, 16673, 16742, 16745, 16810, 16813, 16884, 16887, 16950, 16953, 17019, 17022, 17077, 17080, 17081, 17084, 17150, 17153, 17217, 17220, 17288, 17291, 17356, 17359, 17430, 17433, 17501, 17504, 17528, 17531, 17532, 17535, 17605, 17608, 17680, 17683, 17684, 17687, 17757, 17760, 17822, 17825, 17892, 17895, 17955, 17958, 17959, 17962, 18030, 18033, 18100, 18103, 18104, 18107, 18178, 18181, 18249, 18253, 18323, 18327, 18372, 18376, 18377, 18381, 18450, 18454, 18517, 18521, 18590, 18594, 18659, 18663, 18734, 18738, 18804, 18808, 18878, 18882, 18949, 18953, 19022, 19026, 19085, 19089, 19091, 19095, 19157, 19161, 19230, 19234, 19301, 19305, 19373, 19377, 19444, 19448, 19518, 19522, 19592, 19596, 19662, 19666, 19740, 19744, 19745, 19749, 19819, 19823, 19893, 19897, 19961, 19965, 20004, 20008, 20009, 20013, 20084, 20088, 20158, 20162, 20231, 20235, 20262, 20266, 20267, 20271, 20340, 20344, 20414, 20418, 20489, 20493, 20494, 20498, 20567, 20571, 20642, 20646, 20723, 20727, 20728, 20732, 20799, 20803, 20870, 20874, 20940, 20944, 21010, 21014, 21084, 21088, 21139, 21143, 21144, 21148, 21218, 21222, 21289, 21293, 21357, 21361, 21430, 21434, 21484, 21488, 21489, 21493, 21561, 21565, 21634, 21638, 21707, 21711, 21775, 21779, 21850, 21854, 21918, 21922, 21988, 21992, 22061, 22065, 22134, 22138, 22173, 22177, 22178, 22182, 22247, 22251, 22316, 22320, 22381, 22385, 22452, 22456, 22513, 22517, 22519, 22523, 22592, 22596, 22658, 22662, 22729, 22733, 22804, 22808, 22877, 22881, 22950, 22954, 22989, 22993, 22994, 22998, 23067, 23071, 23140, 23144, 23211, 23215, 23283, 23287, 23351, 23355, 23424, 23428, 23496, 23500, 23534, 23538, 23539, 23543, 23613, 23617, 23683, 23687, 23758, 23762, 23822, 23826, 23897, 23901, 23970, 23974, 23988, 23992, 23993, 23997, 24067, 24071, 24140, 24144, 24212, 24216, 24287, 24291, 24354, 24358, 24429, 24433, 24504, 24508, 24573, 24577, 24648, 24652, 24722, 24726, 24794, 24798, 24849, 24853, 24854, 24858, 24928, 24932, 25003, 25007, 25070, 25074, 25089, 25093, 25094, 25098, 25166, 25170, 25239, 25243, 25308, 25312, 25373, 25377, 25441, 25445, 25510, 25514, 25580, 25584, 25655, 25659, 25729, 25733, 25753, 25757, 25758, 25762, 25832, 25836, 25882, 25886, 25888, 25892, 25960, 25964, 26034, 26038, 26106, 26110, 26177, 26181, 26249, 26253, 26323, 26327, 26385, 26389, 26390, 26394, 26468, 26472, 26545, 26549, 26622, 26626, 26660, 26664, 26665, 26669, 26740, 26744, 26816, 26820, 26894, 26898, 26967, 26971, 27045, 27049, 27126, 27130, 27142, 27146, 27147, 27151, 27221, 27225, 27299, 27303, 27373, 27377, 27450, 27454, 27526, 27530, 27604, 27608, 27666, 27670, 27671, 27675, 27694, 27698, 27699, 27703, 27778, 27782, 27855, 27859, 27930, 27934, 28009, 28013, 28082, 28086, 28160, 28164, 28235, 28239, 28312, 28316, 28338, 28342, 28343, 28347, 28423, 28427, 28495, 28499, 28574, 28578, 28654, 28658, 28732, 28736, 28809, 28813, 28888, 28892, 28962, 28966, 28995, 28999, 29000, 29004, 29039, 29043, 29045, 29049, 29106, 29110, 29111, 29115, 29185, 29189, 29260, 29264, 29340, 29344, 29345, 29349, 29420, 29424, 29492, 29496, 29565, 29569, 29639, 29643, 29644, 29648, 29724, 29728, 29769, 29773, 29774, 29778, 29851, 29855, 29928, 29932, 30002, 30006, 30046, 30050, 30051, 30055, 30123, 30127, 30194, 30198, 30264, 30268, 30317, 30321, 30322, 30326, 30396, 30400, 30464, 30468, 30530, 30534, 30535, 30539, 30612, 30616, 30617, 30621, 30692, 30696, 30735, 30739, 30740, 30744, 30806, 30810, 30888, 30892, 30958, 30962, 31019, 31023, 31024, 31028, 31104, 31108, 31182, 31186, 31259, 31263, 31320, 31324, 31325, 31329, 31401, 31405, 31474, 31478, 31525, 31529, 31530, 31534, 31607, 31611, 31686, 31690, 31691, 31695, 31734, 31738, 31767, 31771, 31772, 31776, 31852, 31856, 31928, 31932, 32008, 32012, 32082, 32086, 32126, 32158, 32160, 32168, 32170, 32207, 32240, 32242, 32277, 32279, 32282, 32284, 32321, 32323, 32326, 32328, 32400, 32402, 32474, 32476, 32545, 32547, 32586, 32588, 32591, 32594, 32661, 32664, 32730, 32733, 32798, 32801, 32849, 32852, 32855, 32858, 32927, 32930, 32993, 32996, 33057, 33060, 33064, 33067, 33068, 33071, 33072, 33075, 33098, 33101, 33121, 33124, 33143, 33146, 33166, 33169, 33170, 33173, 33194, 33197, 33198, 33201, 33214, 33217, 33232, 33235, 33242, 33245, 33246, 33249, 33265, 33268, 33281, 33284, 33301, 33304, 33310, 33313, 33328, 33331, 33338, 33341, 33342, 33345, 33410, 33413, 33433, 33436, 33470, 33473, 33507, 33510, 33544, 33547, 33581, 33584, 33618, 33621, 33655, 33658, 33692, 33695, 33729, 33732, 33766, 33769, 33803, 33806, 33840, 33843, 33877, 33880, 33914, 33917, 33951, 33954, 33988, 33991, 33992, 33995, 34108, 34111, 34133, 34136, 34137, 34140, 34183, 34186, 34226, 34229, 34230, 34233, 34297, 34300, 34339, 34342, 34343, 34346, 34388, 34391, 34429, 34432, 34459, 34462, 34485, 34488, 34489, 34492, 34498, 34501, 34539, 34542, 34549, 34552, 34553, 34556, 34563, 34566, 34679, 34682, 34683, 34686, 34716, 34719, 34737, 34740, 34777, 34780, 34812, 34815, 34855, 34858, 34891, 34894, 34931, 34934, 34964, 34967, 35006, 35009, 35041, 35044, 35084, 35087, 35120, 35123, 35161, 35164, 35195, 35198, 35236, 35239, 35270, 35273, 35310, 35313, 35343, 35346, 35387, 35390, 35423, 35426, 35468, 35471, 35505, 35509, 35548, 35552, 35583, 35587, 35627, 35631, 35663, 35667, 35706, 35710, 35741, 35745, 35783, 35787, 35817, 35821, 35860, 35864, 35895, 35899, 35905, 35909, 35950, 35954, 35961, 35965, 35966, 35970, 36005, 36009, 36010, 36014, 36060, 36064, 36093, 36097, 36138, 36142, 36170, 36174, 36175, 36179, 36200, 36204, 36205, 36209, 36224, 36228, 36273, 36277, 36297, 36301, 36324, 36328, 36335, 36339, 36366, 36370, 36377, 36381, 36382, 36386, 36389, 36393, 36394, 36398, 36413, 36417, 36445, 36449, 36456, 36460, 36473, 36477, 36501, 36505, 36512, 36516, 36536, 36540, 36596, 36600, 36606, 36610, 36627, 36631, 36638, 36642, 36643, 36647, 36663, 36667, 36668, 36672, 36685, 36689, 36777, 36781, 36790, 36794, 36816, 36820, 36866, 36870, 36928, 36932, 36942, 36946, 36984, 36988, 37026, 37030, 37036, 37040, 37074, 37078, 37082, 37086, 37127, 37131, 37133, 37137, 37144, 37148, 37149, 37153, 37236, 37240, 37241, 37245, 37263, 37267, 37289, 37293, 37311, 37315, 37371, 37375, 37431, 37435, 37461, 37465, 37527, 37531, 37591, 37595, 37655, 37659, 37676, 37680, 37703, 37707, 37732, 37736, 37808, 37812, 37815, 37819, 37820, 37824, 37843, 37847, 37872, 37876, 37900, 37904, 37907, 37911, 37912, 37916, 37937, 37941, 37942, 37946, 37986, 37990, 38023, 38027, 38091, 38095, 38168, 38172, 38245, 38249, 38251, 38255, 38281, 38285, 38311, 38315, 38341, 38345, 38371, 38375, 38401, 38405, 38431, 38435, 38461, 38465, 38491, 38495, 38521, 38525, 38551, 38555, 38581, 38585, 38611, 38615, 38641, 38645, 38671, 38675, 38701, 38705, 38731, 38735, 38737, 38741, 38742, 38746, 38775, 38779, 38780, 38784, 38804, 38808, 38828, 38832, 38851, 38855, 38856, 38860, 38882, 38886, 38906, 38910, 38931, 38935, 38936, 38940, 38941, 38945, 38967, 38971, 38972, 38976, 39015, 39019, 39020, 39024, 39056, 39060, 39122, 39126, 39197, 39201, 39203, 39207, 39255, 39259, 39345, 39349, 39435, 39439, 39525, 39529, 39615, 39619, 39624, 39628, 39629, 39633, 39646, 39650, 39665, 39669, 39687, 39691, 39707, 39711, 39712, 39716, 39730, 39734, 39790, 39794, 39795, 39799, 39840, 39844, 39864, 39868, 39888, 39892, 39912, 39916, 39936, 39940, 39960, 39964, 39984, 39988, 40008, 40012, 40032, 40036, 40037, 40041, 40071, 40075, 40098, 40102, 40127, 40131, 40155, 40159, 40185, 40189, 40237, 40241, 40289, 40293, 40301, 40305, 40311, 40315, 40339, 40343, 40363, 40367, 40393, 40397, 40441, 40445, 40453, 40457, 40463, 40467, 40471, 40475, 40476, 40480, 40500, 40504, 40526, 40530, 40554, 40558, 40590, 40594, 40600, 40604, 40608, 40612, 40613, 40617, 40619, 40623, 40624, 40628, 40647, 40651, 40652, 40656, 40766, 40770, 40791, 40795, 40818, 40822, 40837, 40841, 40866, 40870, 40894, 40898, 40918, 40922, 40962, 40966, 40970, 40974, 41048, 41052, 41068, 41072, 41117, 41121, 41142, 41146, 41168, 41172, 41207, 41211, 41237, 41241, 41277, 41281, 41319, 41323, 41405, 41409, 41487, 41491, 41499, 41503, 41509, 41513, 41517, 41521, 41595, 41599, 41615, 41619, 41640, 41644, 41666, 41670, 41705, 41709, 41735, 41739, 41775, 41779, 41817, 41821, 41901, 41905, 41981, 41985, 41993, 41997, 42003, 42007, 42011, 42015, 42089, 42093, 42109, 42113, 42115, 42119, 42120, 42124, 42234, 42238, 42259, 42263, 42286, 42290, 42305, 42309, 42354, 42358, 42432, 42436, 42452, 42456, 42477, 42481, 42503, 42507, 42542, 42546, 42572, 42576, 42612, 42616, 42654, 42658, 42738, 42742, 42818, 42822, 42830, 42834, 42840, 42844, 42848, 42852, 42926, 42930, 42946, 42950, 42971, 42975, 42997, 43001, 43036, 43040, 43066, 43070, 43106, 43110, 43148, 43152, 43234, 43238, 43316, 43320, 43328, 43332, 43338, 43342, 43346, 43350, 43424, 43428, 43444, 43448, 43472, 43476, 43496, 43500, 43540, 43544, 43548, 43552, 43554, 43558, 43559, 43563, 43590, 43594, 43595, 43599, 43614, 43618, 43652, 43656, 43777, 43781, 43873, 43877, 43962, 43966, 43979, 43983, 43985, 43989, 44043, 44047, 44098, 44102, 44188, 44192, 44278, 44282, 44368, 44372, 44458, 44462, 44548, 44552, 44638, 44642, 44728, 44732, 44818, 44822, 44823, 44827, 44913, 44917, 45003, 45007, 45093, 45097, 45183, 45187, 45273, 45277, 45363, 45367, 45453, 45457, 45543, 45547, 45552, 45556, 45670, 45674, 45783, 45787, 45799, 45803, 45842, 45846, 45847, 45851, 45880, 45884, 45885, 45889, 45908, 45912, 45931, 45935, 45959, 45963, 45986, 45990, 46001, 46005, 46027, 46031, 46078, 46082, 46088, 46092, 46096, 46100, 46106, 46110, 46176, 46180, 46187, 46191, 46265, 46269, 46270, 46274, 46303, 46307, 46329, 46333, 46339, 46343, 46385, 46389, 46423, 46427, 46484, 46488, 46536, 46540, 46624, 46628, 46636, 46640, 46646, 46650, 46651, 46655, 46714, 46718, 46752, 46756, 46787, 46791, 46871, 46875, 46905, 46909, 46951, 46955, 46961, 46965, 46966, 46970, 46993, 46997, 47003, 47007, 47058, 47062, 47113, 47117, 47198, 47202, 47249, 47253, 47284, 47288, 47317, 47321, 47322, 47326, 47346, 47350, 47363, 47367, 47380, 47384, 47397, 47401, 47414, 47418, 47470, 47474, 47527, 47531, 47584, 47588, 47641, 47645, 47698, 47702, 47755, 47759, 47760, 47764, 47794, 47798, 47806, 47810, 47891, 47895, 47901, 47905, 47906, 47910, 47972, 47976, 47977, 47981, 47987, 47991, 48008, 48012, 48042, 48046, 48125, 48129, 48179, 48183, 48251, 48255, 48323, 48327, 48395, 48399, 48405, 48409, 48415, 48419, 48458, 48462, 48557, 48561, 48627, 48631, 48715, 48719, 48803, 48807, 48891, 48895, 48901, 48905, 48912, 48916, 48920, 48924, 48925, 48929, 48948, 48952, 48971, 48975, 48999, 49003, 49023, 49027, 49038, 49042, 49064, 49068, 49115, 49119, 49125, 49129, 49133, 49137, 49143, 49147, 49213, 49217, 49224, 49228, 49230, 49234, 49235, 49239, 49295, 49299, 49300, 49304, 49336, 49340, 49341, 49345, 49381, 49385, 49413, 49417, 49419, 49423, 49424, 49428, 49462, 49466, 49467, 49471, 49509, 49513, 49522, 49526, 49570, 49574, 49625, 49629, 49641, 49645, 49647, 49651, 49652, 49656, 49677, 49681, 49682, 49686, 49714, 49718, 49800, 49804, 49817, 49821, 49881, 49885, 49920, 49924, 49930, 49934, 49949, 49953, 49955, 49959, 49960, 49964, 49998, 50002, 50023, 50027, 50029, 50033, 50034, 50038, 50063, 50067, 50068, 50072, 50146, 50150, 50198, 50202, 50215, 50219, 50230, 50234, 50241, 50245, 50269, 50273, 50303, 50307, 50355, 50359, 50382, 50386, 50411, 50415, 50474, 50478, 50484, 50488, 50492, 50496, 50519, 50523, 50548, 50552, 50611, 50615, 50674, 50678, 50684, 50688, 50692, 50696, 50725, 50729, 50768, 50772, 50793, 50797, 50833, 50837, 50896, 50900, 50906, 50910, 50914, 50918, 50920, 50924, 50925, 50929, 51015, 51019, 51074, 51078, 51132, 51136, 51138, 51142, 51143, 51147, 51212, 51216, 51271, 51275, 51277, 51281, 51282, 51286, 51350, 51354, 51408, 51412, 51414, 51418, 51419, 51423, 51448, 51452, 51453, 51457, 51534, 51538, 51594, 51598, 51652, 51656, 51658, 51662, 51663, 51667, 51683, 51687, 51688, 51692, 51750, 51754, 51788, 51792, 51818, 51822, 51845, 51849, 51880, 51884, 51913, 51917, 51941, 51945, 51970, 51974, 51989, 51993, 52012, 52016, 52032, 52036, 52055, 52059, 52102, 52106, 52138, 52142, 52177, 52181, 52211, 52215, 52251, 52255, 52277, 52281, 52319, 52323, 52346, 52350, 52368, 52372, 52390, 52394, 52411, 52415, 52467, 52471, 52513, 52517, 52574, 52578, 52636, 52640, 52690, 52694, 52751, 52755, 52781, 52785, 52832, 52836, 52898, 52902, 52909, 52913, 52940, 52944, 52945, 52949, 53004, 53008, 53009, 53013, 53058, 53062, 53078, 53082, 53095, 53099, 53113, 53117, 53134, 53138, 53194, 53198, 53211, 53215, 53242, 53246, 53282, 53286, 53300, 53304, 53317, 53321, 53327, 53331, 53350, 53354, 53378, 53382, 53395, 53399, 53405, 53409, 53433, 53437, 53474, 53478, 53499, 53503, 53520, 53524, 53540, 53544, 53550, 53554, 53555, 53559, 53589, 53593, 53616, 53620, 53709, 53713, 53734, 53738, 53826, 53830, 53861, 53865, 53893, 53897, 53912, 53916, 53924, 53928, 53949, 53953, 54044, 54048, 54079, 54083, 54108, 54112, 54127, 54131, 54139, 54143, 54188, 54192, 54238, 54242, 54324, 54328, 54387, 54391, 54445, 54449, 54497, 54501, 54532, 54536, 54564, 54568, 54590, 54594, 54626, 54630, 54677, 54681, 54769, 54773, 54810, 54814, 54851, 54855, 54913, 54917, 54931, 54935, 54952, 54956, 54977, 54981, 55003, 55007, 55025, 55029, 55052, 55056, 55068, 55072, 55102, 55106, 55136, 55140, 55176, 55180, 55206, 55210, 55248, 55252, 55364, 55368, 55389, 55393, 55426, 55430, 55465, 55469, 55479, 55483, 55497, 55501, 55526, 55530, 55607, 55611, 55646, 55650, 55660, 55664, 55672, 55676, 55692, 55696, 55697, 55701, 55722, 55726, 55760, 55764, 55782, 55786, 55792, 55796, 55832, 55836, 55850, 55854, 55868, 55872, 55962, 55966, 55967, 55971, 56013, 56017, 56034, 56038, 56079, 56083, 56103, 56107, 56132, 56136, 56161, 56165, 56185, 56189, 56217, 56221, 56237, 56241, 56247, 56251, 56255, 56259, 56274, 56278, 56279, 56283, 56301, 56305, 56333, 56337, 56358, 56362, 56366, 56370, 56371, 56375, 56414, 56418, 56467, 56471, 56510, 56514, 56540, 56544, 56667, 56671, 56677, 56681, 56725, 56729, 56730, 56734, 56756, 56760, 56780, 56784, 56809, 56813, 56833, 56837, 56839, 56843, 56863, 56867, 56892, 56896, 56916, 56920, 56922, 56926, 56952, 56956, 56987, 56991, 57017, 57021, 57023, 57027, 57043, 57047, 57068, 57072, 57088, 57092, 57094, 57098, 57126, 57130, 57163, 57167, 57193, 57197, 57198, 57202, 57254, 57258, 57267, 57271, 57291, 57295, 57306, 57310, 57339, 57343, 57373, 57377, 57383, 57387, 57435, 57439, 57444, 57448, 57478, 57482, 57515, 57519, 57525, 57529, 57583, 57587, 57592, 57596, 57624, 57628, 57633, 57637, 57696, 57700, 57701, 57705, 57729, 57733, 57734, 57738, 57749, 57753, 57767, 57771, 57831, 57835, 57839, 57843, 57922, 57926, 57965, 57969, 57995, 57999, 58122, 58126, 58132, 58136, 58137, 58141, 58222, 58226, 58254, 58258, 58288, 58292, 58317, 58321, 58342, 58346, 58354, 58358, 58364, 58368, 58372, 58376, 58416, 58420, 58446, 58450, 58573, 58577, 58583, 58587, 58588, 58592, 58665, 58669, 58691, 58695, 58711, 58715, 58719, 58723, 58734, 58738, 58757, 58761, 58789, 58793, 58816, 58820, 58824, 58828, 58843, 58847, 58869, 58873, 58899, 58903, 58907, 58911, 58945, 58949, 58971, 58975, 59028, 59032, 59038, 59042, 59043, 59047, 59063, 59067, 59089, 59093, 59135, 59139, 59143, 59147, 59155, 59159, 59200, 59204, 59208, 59212, 59213, 59217, 59226, 59230, 59264, 59268, 59299, 59303, 59327, 59331, 59383, 59387, 59446, 59450, 59489, 59493, 59544, 59548, 59601, 59605, 59703, 59707, 59713, 59717, 59839, 59843, 59850, 59854, 59855, 59859, 59885, 59889, 59911, 59915, 59987, 59991, 60032, 60036, 60062, 60066, 60096, 60100, 60147, 60151, 60179, 60265 ] }	{ "red_pajama_v2": { "ccnet_original_length": 60265, "ccnet_original_nlines": 2899, "rps_doc_curly_bracket": 0.004994609858840704, "rps_doc_ldnoobw_words": 2, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.18955901265144348, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.07072208821773529, "rps_doc_frac_lines_end_with_ellipsis": 0.00586206978186965, "rps_doc_frac_no_alph_words": 0.46679556369781494, "rps_doc_frac_unique_words": 0.3564629554748535, "rps_doc_mean_word_length": 5.761898040771484, "rps_doc_num_sentences": 242, "rps_doc_symbol_to_word_ratio": 0.015319399535655975, "rps_doc_unigram_entropy": 6.99612283706665, "rps_doc_word_count": 7249, "rps_doc_frac_chars_dupe_10grams": 0.030501820147037506, "rps_doc_frac_chars_dupe_5grams": 0.10074698179960251, "rps_doc_frac_chars_dupe_6grams": 0.0796542763710022, "rps_doc_frac_chars_dupe_7grams": 0.059878379106521606, "rps_doc_frac_chars_dupe_8grams": 0.045824550092220306, "rps_doc_frac_chars_dupe_9grams": 0.037780120968818665, "rps_doc_frac_chars_top_2gram": 0.011970889754593372, "rps_doc_frac_chars_top_3gram": 0.006703699938952923, "rps_doc_frac_chars_top_4gram": 0.004405289888381958, "rps_doc_books_importance": -5681.3173828125, "rps_doc_books_importance_length_correction": -5681.3173828125, "rps_doc_openwebtext_importance": -3571.466064453125, "rps_doc_openwebtext_importance_length_correction": -3571.466064453125, "rps_doc_wikipedia_importance": -2895.502197265625, "rps_doc_wikipedia_importance_length_correction": -2895.502197265625 }, "fasttext": { "dclm": 0.052745819091796875, "english": 0.5381042957305908, "fineweb_edu_approx": 1.5420218706130981, "eai_general_math": 0.34214168787002563, "eai_open_web_math": 0.15593910217285156, "eai_web_code": 0.6112354397773743 } }	{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "1", "label": "Truncated Snippets" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "22", "label": "Truncated" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }	e3c4dd7183f5f028f56d5a7988cc68c4

-4,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 adam+nospam@osnews.com 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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 donotreply@osnews.com (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 (info@commoncrawl.org)\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">"New Database"</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">"Generate Key File..."</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"> "Add New Entry"</span> icon on the program toolbar. </p> <p> In the "New Entry" 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"> "Save Database"</span> icon. </p> <p> You may also want to enable <span class="gui">"Automatically save database after every change"</span> option from the <span class="gui">"Extras"</span> > <span class="gui">"Settings..."</span> > <span class="gui">"General (2)"</span> page. (On OS X, the page is found from <span class="gui">"KeePassX"</span> (Application menu) > <span class="gui">"Preferences"</span>.) </p> <a name="database_open" /> <h2>Opening a database</h2> <p> By default, on next startup, KeePassX opens a <span class="gui">"Enter Master Key"</span> dialog for the last used password database. If you wish to open another password database, click <span class="gui">"Cancel"</span> and click <span class="gui">"Open Database"</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">"View/Edit Entry"</span> icon on the program toolbar. </p> <p> To delete a password entry, first select the entry and click <span class="gui">"Delete Entry"</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">"Extras"</span> > <span class="gui">"Settings..."</span> > <span class="gui">"Advanced"</span> page and set the <span class="gui">"Global Auto-Type Shortcut"</span> by clicking the text box and typing the desired keyboard shortcut (e.g. <tt>Ctrl-Shift-N</tt>). Click <span class="gui">"OK"</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 "Google - Mozilla Firefox" </p> <p> Now, create new password entry, that contains user name "test". Then, click the small <span class="gui">"Tools"</span> button at the bottom of the <span class="gui">"New Entry"</span> dialog, and select <span class="gui">"Auto-Type: Select target window"</span> Select "Google - Mozilla Firefox" from the dropdown menu and click <span class="gui">"OK"</span>. You should see now a new line in the <span class="gui">"Comment:"</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">"Tools"</span> and select <span class="gui">"Auto-Type: Customize Sequence"</span>. Now there's another new line in the <span class="gui">"Comment:"</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">"OK"</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 "test" 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>  </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 (info@commoncrawl.org)\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 (info@commoncrawl.org)\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 (info@commoncrawl.org)\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

-8,469,200,646,904,988,000

• Gelöst NEW UPDATE - Didn't solve - Ebay does not work with Firefox 74.0 (Windows) 'Hi, is this a known issue? Ebay will not render inside my Firefow browser. Still looks like some parts of the page don't load, tried all the individual line items in 'pa… (Lesen Sie mehr) 'Hi, is this a known issue? Ebay will not render inside my Firefow browser. Still looks like some parts of the page don't load, tried all the individual line items in 'page info' without success. Seems to forget that the security was overwritten. Gefragt von irishtoon vor 4 Monaten Beantwortet von jscher2000 vor 4 Monaten • Gelöst Attention: Mr Wesley Branton or anyone if Wesley is not available - making scroll bars wider Some eighteen months ago I asked you how to make the scroll bars wider in Outlook. But at the time I was using Windows 7 and I cannot find your answer in my saved emails.… (Lesen Sie mehr) Some eighteen months ago I asked you how to make the scroll bars wider in Outlook. But at the time I was using Windows 7 and I cannot find your answer in my saved emails. Now I am using Windows 10 and I would again like to widen the scroll bars in Outlook.com my email account. Your help would be greatly appreciated. Please remember I am old and not at all computer savvy and would be so grateful for a slow and easy to follow method. Thank you so much in advance for your help. Anthony Gefragt von avwood vor 1 Tag Beantwortet von avwood vor 14 Stunden • Gelöst Why does fire fox show usernames for a secure site? I have Win 7 . I use the Fire Fox browser. Someone could go to my secure site and click the login box and retrieve all my user names. Why is this necessary to show these … (Lesen Sie mehr) I have Win 7 . I use the Fire Fox browser. Someone could go to my secure site and click the login box and retrieve all my user names. Why is this necessary to show these on a secure site? Gefragt von woodust vor 5 Monaten Beantwortet von cor-el vor 5 Monaten • Gelöst Restore Session Broken In my main profile, restore session stopped working. The option is set, but it doesn't work. It worked for 3 years since I created this profile, but now it doesn't work… (Lesen Sie mehr) In my main profile, restore session stopped working. The option is set, but it doesn't work. It worked for 3 years since I created this profile, but now it doesn't work. Recently, this profile has been crashing regularly on quit. I quit (CRTL-Q) and the window does away, then 10 seconds later, I get a pop up message saying that firefox crashed. Just a moment ago, I had a system crash and now this profile refuses to restore my session. When I started it, there was a new session and all the backup session files contain new sessions, not my tabs. Lost all tabs. Anyone else seeing this? Gefragt von Paul 2017 vor 17 Stunden Beantwortet von Paul 2017 vor 13 Stunden • Gelöst can't add Yippy.com as default search engine Yippy.com search engine recommends mozilla firefox and has a large button in the corner to make it default search on mozilla. This does not work and this search bar does … (Lesen Sie mehr) Yippy.com search engine recommends mozilla firefox and has a large button in the corner to make it default search on mozilla. This does not work and this search bar does not appear to be an option on mozilla? It is a search bar by IBM powered by Watson. Anyone know whats going on? Gefragt von emgiasson vor 4 Tagen Beantwortet von emgiasson vor 11 Stunden • Gelöst Yahoo has hijacked my search function Today, when I went to use Google, both the search bar and the address bar had been hijacked by Yahoo. Steps I took: 1. checked to make sure Google had been selected (it h… (Lesen Sie mehr) Today, when I went to use Google, both the search bar and the address bar had been hijacked by Yahoo. Steps I took: 1. checked to make sure Google had been selected (it had) 2. cleared all cache and history and rebooted (didn't help) 3. Ran Malware Bytes (found nothing) 4. deleted Firefox from my computer and downloaded a fresh version (didn't help) 5. searched for suspicious applications, etc. on my hard drive At this point, I became suspicious of Enhanced Tracking Protection, but I can't turn it off because I cannot locate either Options or Menu. I remain suspicious that ETP is what is causing this issue, but welcome any insight. Gefragt von Diane vor 1 Monat Beantwortet von jscher2000 vor 1 Monat • Gelöst Lost bookmarks after update Win 7Pro, 64 bit Firefox has been increasingly unstable over the past weeks. After installing the latest Version, all my bookmarks are lost. Is there a way to retrieve th… (Lesen Sie mehr) Win 7Pro, 64 bit Firefox has been increasingly unstable over the past weeks. After installing the latest Version, all my bookmarks are lost. Is there a way to retrieve them? Hugo Scheer Gefragt von hugo.scheer vor 16 Stunden Beantwortet von FredMcD vor 15 Stunden • Gelöst Roblox webpage only partially loads Hi not sure if this may have to do with Xsolla who apparently manages the reciept emails for robux but last month we started having problems paying for robux in firefox. … (Lesen Sie mehr) Hi not sure if this may have to do with Xsolla who apparently manages the reciept emails for robux but last month we started having problems paying for robux in firefox. The purchase page loaded the upper elements but the parts of the page where you put in the credit card info would not load in firefox. That part of the page showed only the background colour. So we had to switch to opera or edge in order to purchase the robux. This happened in firefox on both a mac os mojave and separtely on a windows 10 machine as well. Many thanks, Phil [Edit: I accidentally clicked on the "this solved my problem" button in my first support email but it was the second reply by cor-el that came closer to solving it. Not sure how to change this] Gefragt von philsawa vor 1 Monat Beantwortet von cor-el vor 1 Monat • Gesperrt Bookmarks thread is over here https://support.mozilla.org/en-US/questions/1299043 I am responding to jscher2000, who posted to my question a short while ago about the loss of my bo… (Lesen Sie mehr) thread is over here https://support.mozilla.org/en-US/questions/1299043 I am responding to jscher2000, who posted to my question a short while ago about the loss of my bookmarks and being unable to restore. Thanks very much for the fast response. I checked the Places Database section of Troubleshooting, and as you suggested it does say "The places.sqlite database is sane", and "The favicons.sqlite database is sane". So I assume that's good? Now what do I do? Again, many thanks for the assistance. Gefragt von idrabego vor 18 Stunden • Gelöst ebay webpage displays as text and is unusable. Works fine in Chrome. Just installed Win 10 Pro on a new machine, and as the subject line says, the ebay webpage shows up as text only in Mozilla. Works fine/as expected in Chrome. I've opene… (Lesen Sie mehr) Just installed Win 10 Pro on a new machine, and as the subject line says, the ebay webpage shows up as text only in Mozilla. Works fine/as expected in Chrome. I've opened Mozilla in safe mode, purged the cache, adjusted font size. No joy. Gefragt von jim_bosley vor 21 Stunden Beantwortet von stan_evans33 vor 19 Stunden • Gelöst How do I set the general zoom level programmatically When I use Firefox on the external monitor, I set the zoom level to 150%. When I leave home a take my laptop with me, I set the zoom level to 100% to use with a smaller s… (Lesen Sie mehr) When I use Firefox on the external monitor, I set the zoom level to 150%. When I leave home a take my laptop with me, I set the zoom level to 100% to use with a smaller screen. I want to automate setting the zoom level. Is there a way to programmatically set the zoom level from a script? Does Firefox expose such an API / command-line tool? Thanks! Gefragt von Pierre vor 20 Stunden Beantwortet von jscher2000 vor 19 Stunden • Gelöst Eno for Firefox I used this app on Firefox which provides "aliases" for my credit card for online purchases. After an update, it was no longer available on Firefox; I now use Chrome f… (Lesen Sie mehr) I used this app on Firefox which provides "aliases" for my credit card for online purchases. After an update, it was no longer available on Firefox; I now use Chrome for all purchases. Does anyone know what happened to Eno and if it will return to Firefox? I'm a user and not a technician so I'd appreciate non-technical language if possible. Thanks. Gefragt von a.raisis vor 21 Stunden Beantwortet von Enigma vor 20 Stunden • Gelöst Folders in my bookmarks do not save Hello everyone, So I have a problem when I create a folder in my bookmark bar. I create a folder by category (unnamed for aesthetics). Once I have classified my favorites… (Lesen Sie mehr) Hello everyone, So I have a problem when I create a folder in my bookmark bar. I create a folder by category (unnamed for aesthetics). Once I have classified my favorites in these different folders after reopening Firefox, all my favorites are in a single folder. I specify that all these favorites were mostly imported from Chrome but that the problem persists with favorites added from firefox Gefragt von durandm04 vor 1 Tag Beantwortet von cor-el vor 1 Tag • Gelöst Some bookmark link does not respond immediately after startup When I launch Firefox, the first click is ignored. So I must click it once again, it's a little frustrating... I'm having this problem with Twitter, Gmail, and Google new… (Lesen Sie mehr) When I launch Firefox, the first click is ignored. So I must click it once again, it's a little frustrating... I'm having this problem with Twitter, Gmail, and Google news, and I can open it in Facebook, StackOverFlow, and Tumblr with no problems. This does not occur when opening in a private window or in windows opened using Ctrl-N. I checked in the "network" tab of the development tools and the transfer volume says "blocked". Disabling Windows Security doesn't effect anything.(I don't install other security tools) What is the problem? Gefragt von smilkobuta vor 1 Tag Beantwortet von smilkobuta vor 1 Tag • Gelöst How can I view all the times I visited a website in Firefox history, instead of just its most recent visit? Let's say I visit google.com at 6PM, then later at 9PM. Firefox would only in history when I visited the site at 9PM, could I make it show when I visited it at both 6PM a… (Lesen Sie mehr) Let's say I visit google.com at 6PM, then later at 9PM. Firefox would only in history when I visited the site at 9PM, could I make it show when I visited it at both 6PM and 9PM? Gefragt von Yousuf vor 2 Monaten Beantwortet von jscher2000 vor 2 Monaten

{ "url": "https://support.mozilla.org/de/questions/firefox?sort=desc&show=done&order=updated&owner=all", "source_domain": "support.mozilla.org", "snapshot_id": "crawl=CC-MAIN-2020-34", "warc_metadata": { "Content-Length": "110400", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DQVCJ34TAHRTXQPQF4Z6PQIXNOCSGLQN", "WARC-Concurrent-To": "<urn:uuid:f8716ba3-6f17-428d-a4c6-b5ac12fd69bf>", "WARC-Date": "2020-08-13T11:37:42Z", "WARC-IP-Address": "34.209.184.5", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AXCDGUX775DZMD6FNMF75VOQUYCLIRWU", "WARC-Record-ID": "<urn:uuid:17961a31-dc54-4d03-8836-ea885857a22e>", "WARC-Target-URI": "https://support.mozilla.org/de/questions/firefox?sort=desc&show=done&order=updated&owner=all", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:111239ba-32ab-4d3d-9545-20269486dfe6>" }, "warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-212.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 11, 12, 87, 88, 277, 278, 354, 355, 475, 476, 527, 528, 564, 565, 606, 607, 618, 619, 712, 713, 902, 903, 1074, 1075, 1182, 1183, 1223, 1224, 1342, 1343, 1387, 1388, 1396, 1397, 1426, 1427, 1465, 1466, 1477, 1478, 1530, 1531, 1720, 1721, 1909, 1910, 1944, 1945, 1982, 1983, 1994, 1995, 2018, 2019, 2206, 2207, 2377, 2378, 2555, 2556, 2774, 2775, 2800, 2801, 2838, 2839, 2880, 2881, 2892, 2893, 2938, 2939, 3128, 3129, 3411, 3412, 3446, 3447, 3488, 3489, 3500, 3501, 3539, 3540, 3729, 3730, 4145, 4146, 4371, 4372, 4402, 4403, 4442, 4443, 4454, 4455, 4483, 4484, 4673, 4674, 4860, 4861, 4900, 4901, 4940, 4941, 4952, 4953, 4989, 4990, 5179, 5180, 5725, 5726, 5920, 5921, 5954, 5955, 5990, 5991, 6004, 6005, 6015, 6016, 6205, 6206, 6278, 6279, 6709, 6710, 6746, 6747, 6758, 6759, 6828, 6829, 7017, 7018, 7257, 7258, 7296, 7297, 7341, 7342, 7353, 7354, 7407, 7408, 7597, 7598, 7775, 7776, 7819, 7820, 7942, 7943, 7951, 7952, 7986, 7987, 8029, 8030, 8041, 8042, 8058, 8059, 8245, 8246, 8597, 8598, 8634, 8635, 8673, 8674, 8685, 8686, 8722, 8723, 8912, 8913, 9309, 9310, 9342, 9343, 9376, 9377, 9388, 9389, 9451, 9452, 9641, 9642, 9753, 9754, 9891, 9892, 10076, 10077, 10188, 10189, 10222, 10223, 10260, 10261, 10272, 10273, 10381, 10382, 10571, 10572, 10750, 10751, 10784, 10785 ], "line_end_idx": [ 11, 12, 87, 88, 277, 278, 354, 355, 475, 476, 527, 528, 564, 565, 606, 607, 618, 619, 712, 713, 902, 903, 1074, 1075, 1182, 1183, 1223, 1224, 1342, 1343, 1387, 1388, 1396, 1397, 1426, 1427, 1465, 1466, 1477, 1478, 1530, 1531, 1720, 1721, 1909, 1910, 1944, 1945, 1982, 1983, 1994, 1995, 2018, 2019, 2206, 2207, 2377, 2378, 2555, 2556, 2774, 2775, 2800, 2801, 2838, 2839, 2880, 2881, 2892, 2893, 2938, 2939, 3128, 3129, 3411, 3412, 3446, 3447, 3488, 3489, 3500, 3501, 3539, 3540, 3729, 3730, 4145, 4146, 4371, 4372, 4402, 4403, 4442, 4443, 4454, 4455, 4483, 4484, 4673, 4674, 4860, 4861, 4900, 4901, 4940, 4941, 4952, 4953, 4989, 4990, 5179, 5180, 5725, 5726, 5920, 5921, 5954, 5955, 5990, 5991, 6004, 6005, 6015, 6016, 6205, 6206, 6278, 6279, 6709, 6710, 6746, 6747, 6758, 6759, 6828, 6829, 7017, 7018, 7257, 7258, 7296, 7297, 7341, 7342, 7353, 7354, 7407, 7408, 7597, 7598, 7775, 7776, 7819, 7820, 7942, 7943, 7951, 7952, 7986, 7987, 8029, 8030, 8041, 8042, 8058, 8059, 8245, 8246, 8597, 8598, 8634, 8635, 8673, 8674, 8685, 8686, 8722, 8723, 8912, 8913, 9309, 9310, 9342, 9343, 9376, 9377, 9388, 9389, 9451, 9452, 9641, 9642, 9753, 9754, 9891, 9892, 10076, 10077, 10188, 10189, 10222, 10223, 10260, 10261, 10272, 10273, 10381, 10382, 10571, 10572, 10750, 10751, 10784, 10785, 10825 ] }

{ "red_pajama_v2": { "ccnet_original_length": 10825, "ccnet_original_nlines": 214, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3512575924396515, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04249782860279083, "rps_doc_frac_lines_end_with_ellipsis": 0.004651159979403019, "rps_doc_frac_no_alph_words": 0.17042498290538788, "rps_doc_frac_unique_words": 0.28875064849853516, "rps_doc_mean_word_length": 4.377397537231445, "rps_doc_num_sentences": 122, "rps_doc_symbol_to_word_ratio": 0.007372070103883743, "rps_doc_unigram_entropy": 5.621340751647949, "rps_doc_word_count": 1929, "rps_doc_frac_chars_dupe_10grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_5grams": 0.5081714987754822, "rps_doc_frac_chars_dupe_6grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_7grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_8grams": 0.46399810910224915, "rps_doc_frac_chars_dupe_9grams": 0.46399810910224915, "rps_doc_frac_chars_top_2gram": 0.014211270026862621, "rps_doc_frac_chars_top_3gram": 0.021316910162568092, "rps_doc_frac_chars_top_4gram": 0.008882050402462482, "rps_doc_books_importance": -1149.7608642578125, "rps_doc_books_importance_length_correction": -1149.7608642578125, "rps_doc_openwebtext_importance": -648.2748413085938, "rps_doc_openwebtext_importance_length_correction": -648.2748413085938, "rps_doc_wikipedia_importance": -475.6280212402344, "rps_doc_wikipedia_importance_length_correction": -475.6280212402344 }, "fasttext": { "dclm": 0.018606480211019516, "english": 0.8565710186958313, "fineweb_edu_approx": 1.0647904872894287, "eai_general_math": 0.10171669721603394, "eai_open_web_math": 0.09668135643005371, "eai_web_code": 0.0890992283821106 } }

{ "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.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "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

-2,977,971,877,594,529,300

EP2514150A1 - Distributed routing architecture - Google Patents Distributed routing architecture Info Publication number EP2514150A1 EP2514150A1 EP20100795898 EP10795898A EP2514150A1 EP 2514150 A1 EP2514150 A1 EP 2514150A1 EP 20100795898 EP20100795898 EP 20100795898 EP 10795898 A EP10795898 A EP 10795898A EP 2514150 A1 EP2514150 A1 EP 2514150A1 Authority EP Grant status Application Patent type Prior art keywords router level components component routing Prior art date Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.) Granted Application number EP20100795898 Other languages German (de) French (fr) Other versions EP2514150B1 (en ) Inventor Alan M. Judge David J. Mcgaugh James R. Hamilton Justin O. Pietsch David J. O'meara Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.) Amazon Technologies Inc Original Assignee Amazon Technologies Inc Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.) Filing date Publication date Links Classifications • HELECTRICITY • H04ELECTRIC COMMUNICATION TECHNIQUE • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION • H04L45/00Routing or path finding of packets in data switching networks • H04L45/58Association of routers • HELECTRICITY • H04ELECTRIC COMMUNICATION TECHNIQUE • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION • H04L45/00Routing or path finding of packets in data switching networks • H04L45/04Interdomain routing, e.g. hierarchical routing Abstract A hierarchical distributed routing architecture including at least three levels, or layers, for receiving, processing and forwarding data packets between network components is provided. The core level router components receive an incoming packet from a network component and identify a distribution level router component based on processing a subset of the destination address associated with the received packet. The distribution level router components that receiving a forwarded packet and identify a transit level router component based a second processing of at least a subset of the destination address associated with the received packet. The distribution level router components maintain address routing information a first and second memory. The transit level router components receive the forwarded packet and forward the packet to a respective network. The mapping, or other assignment, of portions of the FIB associated with the distributed routing environment is managed by a router management component. Description DISTRIBUTED ROUTING ARCHITECTURE BACKGROUND [0001] Generally described, computing devices utilize a communication network, or a series of communication networks, to exchange data. In a common embodiment, data to be exchanged is divided into a series of packets that can be transmitted between a sending computing device and a recipient computing device. In general, each packet can be considered to include two primary components, namely, control information and payload data. The control information corresponds to information utilized by one or more communication networks to deliver the payload data. For example, control information can include source and destination network addresses, error detection codes, and packet sequencing identification, and the like. Typically, control information is found in packet headers and trailers included within the packet and adjacent to the payload data. [0002] In practice, in a packet-switched communication network, packets are transmitted between multiple physical networks, or sub-networks. Generally, the physical networks include a number of hardware devices that receive packets from a source network component and forward the packet to a recipient network component. The packet routing hardware devices are typically referred to as routers. Generally described, routers can operate with two primary functions or planes. The first function corresponds to a control plane, in which the router learns the set of outgoing interfaces that are most appropriate for forwarding received packets to specific destinations. The second function is a forwarding plane, in which the router sends the received packet to an outbound interface. [0003] To execute the control plane functionality, routers can maintain a forwarding information base ("FIB") that identifies, among other packet attribute information, destination information for at least a subset of possible network addresses, such as Internet Protocol ("IP") addresses. In a typical embodiment, the FIB corresponds to a table of values specifying network forwarding information for the router. In one aspect, commercial level routing hardware components can include customized chipsets, memory components, and software that allows a single router to support millions of entries in the FIB. However, such commercial level routing hardware components are typically very expensive and often require extensive customization. In another aspect, commodity-based routing hardware components are made of more generic components and can be less expensive than commercial level routing hardware components by a significant order of magnitude. However, such commodity-based routing hardware components typically only support FIBs on the order of thousands of entries. BRIEF DESCRIPTION OF THE DRAWINGS [0004] The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein: [0005] FIGURE 1 A is a block diagram illustrative of one embodiment of a distributed routing environment including a router management component and a hierarchical, distributed routing component architecture; [0006] FIGURE IB is a block diagram illustrative of components of a router component utilized in accordance with the distributed routing environment of FIGURE 1A; [0007] FIGURES 2A-2C are block diagrams illustrative of the distributed routing environment of FIGURE 1 A illustrating the routing of a received packet within the hierarchical distributed routing component architecture; [0008] FIGURE 3 is a flow diagram illustrative of a distributed router architecture routing routine implemented within a distributed routing environment; and [0009] FIGURE 4 is a flow diagram illustrative of a distributed router architecture routing routine implemented within a distributed routing environment DETAILED DESCRIPTION [0010] Generally described, the present disclosure corresponds to a distributed routing architecture. Specifically, the present disclosure corresponds to a hierarchical distributed routing architecture including at least three logical levels, or layers, for receiving, processing and forwarding data packets between network components. In one embodiment, the three logical levels can corresponds to a core level, a distribution level and a transit level. Illustratively, the core level corresponds to one or more router components that receive an incoming packet from a network component and processes the destination address information associated with the received packet. The core level router component then identifies a distribution level router component based on a subset of the destination address associated with the received packet. The distribution level corresponds to one or more router components that receive a forwarded packet from a core level router component and further processes the destination address information associated with the received packet. The distribution level router component identifies a transit level router component based on at least a subset of the destination address associated with the received packet. Each distribution level router component is associated with, or otherwise corresponds to, a subset of the FIB associated with the distributed routing architecture. Finally, the transit level router components correspond to one or more router components that receive the forwarded packet from a distribution level router component and forward the packet "upstream" to a respective network, or network node. The mapping, or other assignment, of portions of the FIB associated with the distributed routing environment is managed by a router management component. [0011] In one embodiment, each of the router components associated with the core level, distribution level and transit level can correspond more closely to commodity based router components/hardware. In another embodiment, the core level, distribution level and transit level router components correspond to logical router components that do no necessarily have a corresponding hardware router component. For example, one or more logical router components within each level may be implemented in the same hardware router component. Likewise, the logical router components associated with different levels of the distributed routing architecture may be implemented in the same hardware router component. In both embodiments, however, because responsibility for maintaining the FIB associated with the distributed routing environment is divided among several router components, the processing and memory restraints associated with commodity based router components/hardware can be mitigated. Various implementations, combination, and applications for dividing the FIB associated with the distributed routing environment will be described in accordance with the distributed routing environment. However, one skilled in the relevant art will appreciate that such embodiment and examples are illustrative in nature and should not be construed as limiting. [0012] Turning now to FIGURE 1 A, a distributed routing environment 100 for implemented a hierarchical distributed routing architecture will be described. The distributed routing environment 100 includes a router management component 102 for controlling the routing information utilized by the distributed routing environment 100. Specifically, the router managed component 102 can receive all upstream routing information to be used by the distributed routing environment 100 and allocate the assignment of the upstream routing information among the components of the distributed routing environment 100 as will be described. In one embodiment, the router management component 102 can correspond to a computing device in communication with one or more components of the distributed routing environment 100. Illustrative computing devices can include server computing devices, personal computing devices or other computing devices that include a processor, memory and other components for executing instructions associated with the function of the router management component 102. In another embodiment, the router management component 102 may be implemented as a software component that is executed on one or more of the router components described below. Illustratively, the router management component 102 maintains and updates the FIB associated with the distributed routing environment 100. Additionally, the router management component 102 can allocate responsibility for portions of the FIB entries to the various layers of the distributed routing environment 100, as will be described below. In one embodiment, the router management component 102 can partition the FIB according to the distribution to the various router components of the distributed routing environment 100 and distribute respective portions of the FIB to be maintained in a memory associated with the various router components. [0013] With continued reference to FIGURE 1A, the distributed routing environment 100 includes a first communication network 104 that transmits data packets to the distributed routing environment 100. The first communication network 104 may encompass any suitable combination of networking hardware and protocols necessary to establish packet-based communications to the distributed routing environment 100. For example, the communication network 104 may include private networks such as local area networks (LANs) or wide area networks (WANs) as well as public or private wireless networks. In such an embodiment, the communication network 104 may include the hardware (e.g., modems, routers, switches, load balancers, proxy servers, etc.) and software (e.g., protocol stacks, accounting software, firewall/security software, etc.) necessary to establish a networking link with the distributed routing environment 100. Additionally, the communication network 104 may implement one of various communication protocols for transmitting data between computing devices. As will be explained in greater detail below, the communication protocols can include protocols that define packet flow information, such as network address information corresponding to the Internet Protocol version 4 (IPv4) and the Internet Protocol version 6 (IPv6) Internet Layer communication network protocols. One skilled in the relevant art will appreciate, however, that present disclosure may be applicable with additional or alternative protocols and that the illustrated examples should not be construed as limiting. [0014] In communication with the first communication network 104 is a first level of the distributed routing environment 100, generally referred to as the core layer or core level. In one embodiment, the core level corresponds to one or more logical router components, generally referred to as core level routers 106A, 106B, and 106C. As previously described, within the distributed routing environment 100, the core level routers 106A, 106B, 106C receive an incoming packet from a component from the network 104 and process the destination address by identifying a distribution level router component based on a subset of the destination address associated with the received packet. Illustratively, the subset of the destination address can correspond to less than the entire destination IP address, such as the highest most values of the IP address. As previously described, the core level routers 106A, 106B, 106C can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100. In an alternative embodiment, at least some portion of the core layer may be implemented by components outside the distributed routing environment 100. In such an embodiment, such external components would directly address a distribution level router component (described below) of the distributed routing environment 100. [0015] The distributed routing environment 100 can further include a second level of logical router components, generally referred to as the distribution layer or distribution level. In one embodiment, the distribution level corresponds to one or more router components, generally referred to as distribution level routers 108A, 108B, and 108C. As previously described, within the distributed routing environment 100 the distribution level routers 108 A, 108B and 108C receiving an incoming packet from a core routing component 102 and process the destination address by identifying a transit level router component based on at least a subset of the destination address associated with the received packet. Illustratively, the subset of the destination address can correspond to a larger subset of the destination IP address used by the core level routers 106A, 106B, 106C. In this embodiment, the routing preformed by the distribution level can correspond to a more refined routing of the received packet relative to the core level routing. As described above with the core level routers 106 A, 106B, 106C, the distribution level routers 108A, 108B, and 108C can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100. [0016] In communication with the distribution level router components is a third level of router components, generally referred to as the transmit layer or transit level. In one embodiment, the transit level corresponds to one or more router components, generally referred to as transit level routers 1 1 OA, HOB, and HOC. As previously described, the transit level routers 11 OA, HOB, H OC receive the forwarded packet from a distribution level router component 108A, 108B, 108C and forward the packet "upstream" to another communication network 1 12 node. Illustratively, each transit level router 11 OA, HOB, HOC can be configured to communicate with one or more upstream peers such that all packets destined for an associated peer network component will be transmitted through the assigned transit level router 1 1 OA, HOB, 1 IOC (or a redundant router). As described above with the core level routers 106A, 106B, 106C and the distribution level routers 108A, 108B and 108C, the transit level routers 11 OA, 1 10B, and HOC can correspond to logical router components implemented on one or more hardware components. In one embodiment, each logical router component can correspond with a dedicated physical router component. In another embodiment, each logical router component can correspond to a physical router component shared by at least one other logical router component in the distributed router environment 100 [0017] Similar to communication network 102, communication network 112 may encompass any suitable combination of networking hardware and protocols necessary to establish packet-based communications to the distributed routing environment 100. For example, the communication network 1 12 may include private networks such as local area networks (LANs) or wide area networks (WANs) as well as public or private wireless networks. In such an embodiment, the communication network 1 12 may include the hardware (e.g., modems, routers, switches, load balancers, proxy servers, etc.) and software (e.g., protocol stacks, accounting software, firewall/security software, etc.) necessary to establish a networking link with the distributed routing environment 100. As described above with regard to the communication network 104, the communication network 112 may implement one of various communication protocols for transmitting data between computing devices. One skilled in the relevant art will appreciate, however, that present disclosure may be applicable with additional or alternative protocols and that the illustrated examples should not be construed as limiting. [0018] In an illustrative embodiment, the logical router components (106, 108, 1 10) in FIGURE 1A may correspond to a computing device having processing resources, memory resources, networking interfaces, and other hardware/software for carrying the described functionality for each of the logical router components. With reference now to FIGURE IB, a block diagram illustrative of components of a router component 150 utilized in accordance with the distributed routing environment 100 of FIGURE 1A will be described. The general architecture of the router component 150 depicted in FIGURE IB includes an arrangement of computer hardware and software components that may be used to implement one or more logical router components 106, 108, 110. Those skilled in the art will appreciate that the router component 150 may include many more (or fewer) components than those shown in FIGURE IB. It is not necessary, however, that all of these generally conventional components be shown in order to provide an enabling disclosure. [0019] As illustrated in FIGURE IB, the router component 150 includes a processing unit 152, at least one network interface 156, and at least one computer readable medium drive 158, all of which may communicate with one another by way of a communication bus. The processing unit 152 may thus receive information and instructions from other computing systems or services via a network. The processing unit 152 may also be associated with a first memory component 154 for recalling information utilized in the processing of destination address information, such as at least a portion of a FIB associated with the distributed routing environment 100. The memory 154 generally includes RAM, ROM and/or other persistent memory. The processing unit 152 may also communicate to and from memory 160. The network interface 156 may provide connectivity to one or more networks or computing systems. The at least one computer readable medium drive 158 can also correspond to RAM, ROM, optical memory, and/or other persistent memory that may persists at least a portion of the FIB associated with the distributed routing environment 100. In an illustrative embodiment, the access time associated with the memory component 154. may be faster than the access time associated with the computer readable medium driver 158. Still further, the computer readable medium drive 158 may be implemented in a networked environment in which multiple router components 150 share access to the information persisted on the computer readable medium drive 158. [0020] The memory 160 contains computer program instructions that the processing unit 152 executes in order to operate the dynamic classifier. The memory 160 generally includes RAM, ROM and/or other persistent memory. The memory 160 may store an operating system 162 that provides computer program instructions for use by the processing unit 152 in the general administration and operation of the router component 150. The memory 160 may further include computer program instructions and other information for implementing one or more of the logical router components in the distributed routing environment 100. For example, in one embodiment, the memory 160 includes a router module 164 that implements the functionality associated with any of the routers 106, 108, 1 10. In the event that multiple logical routers are implemented by the same router component 150, memory 160 may have each instance of a router module 164. [0021] In an illustrative embodiment, each router component 150 may be embodied as an individual hardware component for implementing one or more logical routers 106, 108, 1 10. Alternatively, multiple router components 150 may be grouped and implemented together. For example, each router component 150 may correspond to an application-specific integrated circuit (ASIC) having a processing unit 152, memory 154 and memory 160 (or other components with similar functionality). The router components 150 may share one or more components, such as the network interface 156 and computer readable medium 158, via a common communication bus. [0022] With reference now to FIGURES 2A-2C, the processing of receiving packets by the distributed routing environment 100 will be described. With reference first to FIGURE 2A, an incoming packet is received from the communication network 104 to a core level router 106. The core level router 106 that receives the incoming packet may be selected according to a variety of techniques including, but not limited to, load balancing, random selection, round robin, hashing, and other packet distribution techniques. Upon receipt, the core level router 106 processes destination IP address and utilizes a subset of the destination IP address to identify a second level destination router component that will perform a second level of routing. In an illustrative embodiment, the core level router 106 utilizes the most significant bits of the IP address, such as the eight most significant bits of the destination address. The selection of the subset of IP addresses corresponding to a selection of the most significant bits is generally referred to as prefix. For example, selection of the eight most significant bits corresponds to a prefix length of "8." Selection of the sixteen most significant bits corresponds to a prefix length of "16." One skilled in the relevant art will appreciate that the number of bits utilized by the core level router 106 may vary. Additionally, in an alternative embodiment, the core level router 106 may use different methodologies to allocate, or otherwise subdivide, the address space serviced by the distributed routing environment 100. [0023] Based on the processing of the first subset of the destination address, the core level router 106 forwards the packet to a distribution level router, in this case illustratively 108A. As previously described, the receiving distribution level router 108A processes the destination address of the received packet and also utilizes a subset of the destination IP address to identify a third level router component that will forward the packet to a next network destination (outside of the distributed routing environment 100). Similar to the core level router 106, the receiving distribution level router can be configured to utilize a selection of the most significant bits of the IP address (e.g., the prefix) to route the packet. In an illustrative embodiment, the prefix used by the distribution level router 108 A is greater than the prefix used by the core level router 106. Based on the processing by the distribution level router 106A, the transit level router HOB receives the forwarded packet and forwards the packet to a designated designation associated with the communication network 1 12. [0024] Turning now to FIGURES 2B and 2C, the allocation of IP addresses or subsets of IP addresses within the distributed routing environment 100 will be described. With reference to FIGURE 2B, the core level router 106 distributes some portion of the subset of destination IP addresses to distribution level router 108A (illustrated at 202). Distribution level router 108A in turn further distributes the portions of the IP addresses to transit level routers 1 10A, HOB, and 1 IOC (illustrated at 204, 206, and 208). With reference to FIGURE 2C, the core level router 106 distributes a different portion of the subset of destination IP addresses to distribution level router 108B (illustrated at 210). Distribution level router 108B in turn further distributes the portions of the IP addresses to transit level routers 11 OA and 1 10B (illustrated at 212 and 214). [0025] In an illustrative embodiment, the router management component 102 (FIGURE 1) can allocate responsibility of subsets of IP addresses to the distribution level routers in a variety of manners. In one embodiment, the router management component 102 can allocate responsibility for the entire set of IP addresses in accordance with assignment of IP addresses equally, or substantially equally, among available routers. In this embodiment, each distribution level router 108 becomes responsible for an equal subset of IP addresses or substantially equal if the IP addresses cannot be divided equally. In another embodiment, the router management component 102 can specify specific distribution level router 108 to handle high traffic IP addresses or prefixes. In this example, the entire subset of IP addresses may be custom selected by the router management component 102. Alternatively, only the subset of IP addresses meeting a traffic threshold may be custom selected with the remaining portions of IP address automatically distributed. [0026] In still a further embodiment, multiple distribution level routers 108 may be selected for a subset of IP addresses. In this embodiment, each core level router 106 can select from multiple distribution level routers 108 based on an equal cost multi-path routing (ECMP) technique in which a specific distribution level router 108 is selected based on a standard load sharing technique. Other factors that can be utilized to select from multiple assigned distribution level router 108 include carrier preference, Internet weather, resource utilization/health reports, an allocated or determine routing cost, service level agreements (SLAs), or other criteria. [0027] In one embodiment, each distribution router 108 can maintain the portion of the FIB that is associated with the subset of IP addresses assigned the respective distribution level router 108. In another embodiment, each distribution level router 108 can maintain the entire FIB associated with the distributed routing environment 100 in a memory component, such as computer readable medium 158 (FIGURE IB). Once a subset of IP addresses are assigned to each respective distribution level router 108 (or otherwise updated), the applicable portions of the FIB are loaded in a different memory components, such as memory component 154 (FIGURE IB) utilized by the router (e.g., a routing chip level content addressable memory or a processor level cache memory). The maintenance of the applicable portions of the FIB in a memory component facilitates better router performance by faster memory access times for the applicable portion of the FIB. However, in this embodiment, the allocation of FIBs to each distribution level router 108 can be modified by loading different portions of the stored FIB from a first memory component storing the entire FIB (e.g., the computer readable medium 158) to the memory component maintaining the portion of the FIB allocated to the distribution level router 108 (e.g., memory component 154). Accordingly, this embodiment facilitates the dynamic allocation of distribution level routers 108, the creation of redundant distribution level routers, and additional failover for distribution level routers. Additionally, one or more core level routers 106 can utilize a similar technique in performing the functions associated with the core level of the distributed routing environment 100. [0028] In still a further embodiment, as a variation to the above embodiment, each distribution level router can be allocated a larger portion of the FIB associated with the distributed routing environment 100 than is capable of being maintained in a first memory component of the router, such as memory component 154 (e.g., a processor level cache memory). If a core level router 106 routes to a distribution level router 108 and the corresponding prefixes of the destination IP address do not correspond to the FIB maintained in the first memory component of the distribution level router, the distribution level router can recall the necessary information from the larger subset of the FIB maintained in a different memory component (e.g., computer readable medium 158 (FIGURE IB)). The FIB maintained in the first memory component (e.g., memory component 152) may be updated to store the prefix in the primary memory component. Alternatively, the FIB in the first memory component may not be automatically updated based on a single request, but based on increases in traffic for a given prefix. [0029] In yet another embodiment, lower traffic prefixes may be assigned to multiple distribution level routers 108. In one example, each assigned distribution level router 108 does not maintain the lower traffic routing portion of the assigned FIB in the primary memory component. Rather, routing requests for the lower traffic prefixes can be directed to a specific distribution level router based on selection techniques, such as ECMP, and can be processed by a selected distribution level router 108 based on the larger FIB maintained in a different memory component within the selected distribution level router. [0030] With reference now to FIGURE 3, a routine 300 for routing packets and implemented in a distributed routing environment 100 will be described. At block 302, the distributed routing environment 100 obtains a routing request. As previously described, the routing request is received from a first network 102 (FIGURE 1) and includes information identifying a destination IP address. At block 304, a core level router 106 corresponding to a first level of the distributed routing environment 100 is selected and receives the routing request. In an illustrative embodiment, each core level router 106 can perform the same function and can selected in accordance with standard selection techniques, including, but not limited to, random selection, round robin selection, load balancing selection and the like. [0031] At block 306, the selected core level router 106 identifies a distribution level router 108 corresponding to a second level of the distributed routing environment 100. The core level router 108 selects the distribution level router 108 based on processing the destination IP address and utilizing a subset of the destination IP addresses (e.g., the prefix) to determine the appropriate distribution level router 108. Illustratively, in accordance with an embodiment corresponding to the IPv4 communication protocol, the core level router 106 processing can be based on consideration of a prefix of the eight most significant bits. At block 308, the selected distribution level router 108 identifies a transit level router 1 10 based on processing the destination IP address and utilizing a subset of the destination IP address to determine the appropriate transit level router 1 10. Illustratively, in accordance with an embodiment corresponding to the IPv4 communication protocol, the distribution level router 108 processing can be based on a larger subset of IP address (e.g., a longer prefix such as 16 or 24 bits, as needed to select the appropriate transit level router 1 10). One skilled in the relevant art will appreciate, however, the blocks 306 and 308 may be implemented in a manner such the core level router 106 and distribution level router 108 may utilize additional or alternative attributes (including different portions of a destination IP address) of received packets in identifying the next router component to forward the received packet. [0032] At block 310, the selected transit level router 1 10 transmits the receive packet to the destination recipient associated, or otherwise configured, with the transit level router 1 10. At block 312, the routine 300 terminates. [0033] With reference now to FIGURE 4, another routine 400 for routing packets and implemented in a distributed routing environment 100 will be described. In an illustrative embodiment, routine 400 may be implemented in embodiments in which less than all the FIB associated with a particular distribution router 108 is maintained in a primary memory component. At block 402, a routing request is received at a distribution level router 108. The selection and routing to a distribution level router 108 was previously described above. Although routine 400 will be described with regard to implementation by a distribution level router 108, one skilled in the relevant art will appreciate that at least portions of routine 400 may be implemented by other components of the distributed routing environment 100, such as core level routers 106 or transit level router 1 10. At decision block 404, a test is conducted to determine whether the subset of the destination IP address associated with the routing request is in the portion of the FIB table maintained in the primary memory of the selected distribution level router 108. If so, at block 406, the distribution level router 108 obtains the transit layer routing information from the FIB maintained in the first memory component (e.g., memory component 152 (FIGURE IB)). At block 408, the distribution level router 108 forwards the packet to the selected transit level router 1 10. [0034] Alternatively, if at decision block 404 the subset of the destination IP address associated with the routing request is not maintained in the portion of the FIB table maintained in the primary memory of the selected distribution level router 108, at block 410, distribution level router 108 attempts to obtain additional transit routing information from a separate memory component associated with the distribution level router. At block 410, the distribution level router 108 can update the forwarding table information maintained in the primary memory component with the information obtained from the other memory component. Alternatively, block 410 can be omitted or is otherwise optional. At block 412, the routine terminates. [0035] While illustrative embodiments have been disclosed and discussed, one skilled in the relevant art will appreciate that additional or alternative embodiments may be implemented within the spirit and scope of the present disclosure. Additionally, although many embodiments have been indicated as illustrative, one skilled in the relevant art will appreciate that the illustrative embodiments do not need to be combined or implemented together. As such, some illustrative embodiments do not need to be utilized or implemented in accordance with the scope of variations to the present disclosure. [0036] Conditional language, such as, among others, "can," "could," "might," or "may," unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements, or steps. Thus, such conditional language is not generally intended to imply that features, elements or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements or steps are included or are to be performed in any particular embodiment. Moreover, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey utilization of the conjunction "or" in enumerating a list of elements does not limit the selection of only a single element and can include the combination of two or more elements. [0037] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art. It will further be appreciated that the data and/or components described above may be stored on a computer-readable medium and loaded into memory of the computing device using a drive mechanism associated with a computer-readable medium storing the computer executable components, such as a CD-ROM, DVD-ROM, or network interface. Further, the component and/or data can be included in a single device or distributed in any manner. Accordingly, general purpose computing devices may be configured to implement the processes, algorithms, and methodology of the present disclosure with the processing and/or execution of the various data and/or components described above. Alternatively, some or all of the methods described herein may alternatively be embodied in specialized computer hardware. In addition, the components referred to herein may be implemented in hardware, software, firmware or a combination thereof. [0038] It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims. Claims WHAT IS CLAIMED IS: 1. A system for routing packets comprising: a router management component, executed on a computing device, for associating destination address information to a router hierarchy; one or more router components corresponding to a first level of the router hierarchy, the first level of the router hierarchy for receiving an incoming packet for routing; one or more router components corresponding to a second level of a router hierarchy, the second level of the router hierarchy for processing an incoming packet for routing received from at least one of the one or more router components corresponding to the first level of a router hierarchy, wherein the one or more router components corresponding to the second level of the router hierarchy are associated with a first memory and a second memory for storing destination address information, the first memory associated with a faster access time than the second memory; one or more router components corresponding to a third level of a router hierarchy, the third level of the router hierarchy for processing an incoming packet for routing received from at least one of the one or more router components corresponding to the second level of a router hierarchy; wherein the one or more router components corresponding to the first level of a router hierarchy identifies one or more router components from the one or more router components corresponding to the second level of a router hierarchy based on a first subset of a destination address associated with the incoming packet, wherein the first subset is assigned by the router management component; wherein each of the one or more router components corresponding to the second level of a router hierarchy correspond to portions of the first subset of the destination address associated with the incoming packet; wherein the one or more router components corresponding to the second level of a router hierarchy identifies one or more router components from the one or more router components corresponding to third level of a router hierarchy based on a second subset of a destination address associated with the incoming packet, wherein the second subset of the destination address is greater than the first subset of the destination address; and wherein the one or more router components attempt to identify the one or more router components from address information persisted in the first memory associated with the wherein the one or more router components and if the address information is not available in the first memory component, the one or more router components attempt to identify the one or more router components from address information persisted in the second memory component. 2. The system as recited in Claim 1, wherein the one or more router components corresponding to the second level of a router hierarchy is allocated to correspond to approximately equal portions of the first subset of the destination addresses associated with the incoming packet. 3. The system as recited in Claim 2, wherein the approximately equal portions of the first subset of destination addresses correspond to more address information than can be persisted in the first memory of the one or more router components corresponding to a second level of a router hierarchy. 4. The system as recited in Claim 1, wherein the one or more router components corresponding to the second level of a router hierarchy is allocated to correspond to portions of the first subset of the destination address associated with the incoming packet based on traffic volumes attributed to the destination address. 5. The system as recited in Claim 1, wherein the one or more router components corresponding to a first level of a router hierarchy are selected in accordance with one of random selection, round robin selection, hashing, and load balancing. 6. The system as recited in Claim 1 , wherein the destination address corresponds to an IP address. 7. The system as recited in Claim 6, wherein first subset of the IP address corresponds to the eight most significant bits of the IP address. 8. The system as recited in Claim 6, wherein first subset of the IP address corresponds to at least one of the sixteen or twenty four most significant bits of the IP address. 9. The system as recited in Claim 1, wherein at least two of the one or more router components corresponding to a first level of the router hierarchy are implemented in a common physical router component. 10. The system as recited in Claim 1 , wherein at least two of the one or more router components corresponding to a second level of the router hierarchy are implemented in a common physical router component. 1 1. The system as recited in Claim 1 , wherein at least two of the one or more router components corresponding to a third level of the router hierarchy are implemented in a common physical router component. 12. The system as recited in Claim 1, wherein at least one physical router component implements at least two of a first level router, a second level router and a third level router. 13. The system as recited in Claim 1, the one or more router components corresponding to the first level of the router hierarchy are associated with a first memory and a second memory for storing destination address information, the first memory associated with a faster access time than the second memory and wherein the one or more router components corresponding to the first level of the router hierarchy attempt to identify the one or more router components from address information persisted in the first memory associated with the wherein the one or more router components and if the address information is not available in the first memory component, the one or more router components attempt to identify the one or more router components from address information persisted in the second memory component. 14. A system for routing packets comprising: a first set of logical router components for receiving an incoming packet for routing; a second set of logical router components for routing packet received from the first set of router components, the second set of logical router component associated with a physical router having a first memory and a second memory; a third set of router logical components for routing packets received from the second set of router components wherein the first set of logical router components identify a router from the second set of logical router components based on a correlation by a router management component of a subset of the destination address associated with the incoming packet to the selected router; wherein each of the one or more router components corresponding to the second set of logical router components is allocated by the router management component to correspond to portions of the first subset of the destination address associated with the incoming packet such that address information provided by the router management component cannot be persisted entirely in the first memory component; and wherein the second set of logical router components identify a router from the third set of logical router components based on a correlation by the router management component of a second subset of a destination address associated with the incoming packet to the second selected router by examining address information in the first memory and if the address information is not persisted in the first memory component, by examining address information persisted in the second memory. 15. The system as recited in Claim 14, wherein the correlation of routers from the second set of router components is based on a substantially equal allocation of possible destination addresses. 16. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on an association of traffic volumes for destination addresses. 17. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on a combination of an association of traffic volumes for destination addresses and an equal allocation of remaining destination addresses. 18. The system as recited in Claim 14, wherein each of the routers from the second set of logical router components are associated with a threshold number of destination addresses and wherein the correlation of routers from the second set of logical router components is based on allocation of a number greater than the threshold number of destination addresses associated with the second set of logical router components. 19. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components is based on an association of low traffic volumes for destination addresses. 20. The system as recited in Claim 14, wherein the correlation of routers from the second set of logical router components includes an allocation of a plurality of routers for the same subset of destination addresses. 21. The system as recited in Claim 14, wherein first set of router components are selected in accordance with one of random selection, round robin selection, hash selection and load balancing. 22. The system as recited in Claim 14, wherein the destination address corresponds to an IP address. 23. The system as recited in Claim 22, wherein first subset of the IP address corresponds to the eight most significant bits of the IP address. 24. The system as recited in Claim 23, wherein first subset of the IP address corresponds to at least one of the sixteen or twenty four most significant bits of the IP address. 25. The system as recited in Claim 14, wherein each of the first set of logical router components correspond to a physical router component. 26. The system as recited in Claim 14, wherein two or more of the first set of logical router components correspond to a single physical router component. 27. The system as recited in Claim 14, wherein each of the second set of logical router components correspond to a physical router component. 28. The system as recited in Claim 14, wherein two or more of the second set of logical router components correspond to a single physical router component. 29. The system as recited in Claim 14, wherein each of the third set of logical router components correspond to a physical router component. 30. The system as recited in Claim 14, wherein two or more of the third set of logical router components correspond to a single physical router component. 31. The system as recited in Claim 14, wherein at least one of the set of first logical components, at least one of the second set of logical components, and at least one of the third set of logical router components correspond to a single physical router component. 32. The system as recited in Claim 14, wherein the router management component dynamically modifies the address information in the first memory component. 33. The system as recited in Claim 14, wherein the first set of logical router component associated with a physical router having a first memory and a second memory. 34. The system as recited in Claim 33, wherein the first set of logical router components identify a router from the second set of logical router components based on a correlation by the router management component of a second subset of a destination address associated with the incoming packet to the second selected router by examining address information in the first memory and if the address information is not persisted in the first memory component, by examining address information persisted in the second memory. 35. A method for routing packets comprising of the one or more router components corresponding to the second set of logical router components. obtaining a routing request corresponding to a data packet received from a first communication network; identifying a first router corresponding to a first level of a router hierarchy, the first level of the router hierarchy corresponding to one or more router components; forwarding the received data packet to the identified first router; identifying a second router corresponding to a second level of the router hierarchy, the second level of the router hierarchy corresponding to one or more router components; forwarding the received data packet to the identified second router; and identifying a third router corresponding to a third level of the router hierarchy, the third level of the router hierarchy corresponding to one or more router components, wherein identifying a third router corresponding to a third level of the router hierarchy corresponds to examining address information persisted in a first memory component associated with the identified second router and if the address information is not available, examining address information persisted in a second memory associated with the identified second router component; wherein identifying the second router corresponding to a second level of the router hierarchy is based on a correlation of a subset of the destination address associated with the received data packet to the selected router; wherein address information provided by the router management component cannot be persisted entirely in the first memory component; and wherein identifying a third router corresponding to a third level of the router hierarchy is based on a correlation of a second subset of a destination address associated with the incoming packet to the second selected router. 36. The method as recited in Claim 35, wherein each of the one or more router components corresponding to the second level of the router hierarchy is allocated to correspond to portions of the first subset of the destination address associated with the incoming packet. 37. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on at least a substantially equal allocation of possible destination addresses. 38. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on an association of traffic volumes for destination addresses. 39. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on a combination of an association of traffic volumes for destination addresses and an equal allocation of remaining destination addresses. 40. The method as recited in Claim 36, wherein each of the routers from the second level of the router hierarchy are associated with a threshold number of destination addresses and wherein the correlation of routers from the second level of the router hierarchy is based on allocation of a number greater than the threshold number of destination addresses associated with the second level of the router hierarchy. . 41. The method as recited in Claim 36, wherein the correlation of routers from the second level of the router hierarchy is based on an association of low traffic volumes for destination addresses. 42. The method as recited in Claim 36, wherein the correlation of routers from the second set of router components includes an allocation of a plurality of routers for the same subset of destination addresses. 43. The method as recited in Claim 35, wherein first set of router components are selected in accordance with one of random selection, round robin selection, hash selection and load balancing. 44. The method as recited in Claim 35, wherein the destination address corresponds to an IP address. 45. The method as recited in Claim 35 further comprising dynamically modifying the address information provided by the router management component and persisted in the first memory component, wherein all the address information provided by the router management component cannot be persisted entirely in the first memory component. EP20100795898 2009-12-17 2010-12-15 Distributed routing architecture Active EP2514150B1 (en) Priority Applications (2) Application Number Priority Date Filing Date Title US12641280 US8325730B2 (en) 2009-12-17 2009-12-17 Distributed routing architecture PCT/US2010/060573 WO2011084520A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Applications Claiming Priority (1) Application Number Priority Date Filing Date Title EP20160001481 EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Related Child Applications (1) Application Number Title Priority Date Filing Date EP20160001481 Division EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Publications (2) Publication Number Publication Date EP2514150A1 true true EP2514150A1 (en) 2012-10-24 EP2514150B1 EP2514150B1 (en) 2016-07-06 Family ID=43567888 Family Applications (2) Application Number Title Priority Date Filing Date EP20100795898 Active EP2514150B1 (en) 2009-12-17 2010-12-15 Distributed routing architecture EP20160001481 Pending EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Family Applications After (1) Application Number Title Priority Date Filing Date EP20160001481 Pending EP3122010A1 (en) 2009-12-17 2010-12-15 Distributed routing architecture Country Status (7) Country Link US (1) US8325730B2 (en) EP (2) EP2514150B1 (en) JP (1) JP5964241B2 (en) CN (1) CN102792644B (en) CA (1) CA2784707C (en) ES (1) ES2582534T3 (en) WO (1) WO2011084520A1 (en) Families Citing this family (5) * Cited by examiner, † Cited by third party Publication number Priority date Publication date Assignee Title KR101556031B1 (en) 2012-01-30 2015-10-01 한국전자통신연구원 Method and system of distributed mobility control on network US9647883B2 (en) 2014-03-21 2017-05-09 Nicria, Inc. Multiple levels of logical routers US9503321B2 (en) 2014-03-21 2016-11-22 Nicira, Inc. Dynamic routing for logical routers US20160226700A1 (en) 2015-01-30 2016-08-04 Nicira, Inc. Transit logical switch within logical router WO2016123550A1 (en) * 2015-01-30 2016-08-04 Nicira, Inc. Logical router with multiple routing components Family Cites Families (83) * Cited by examiner, † Cited by third party Publication number Priority date Publication date Assignee Title JPH04310188A (en) * 1991-03-01 1992-11-02 Internatl Business Mach Corp <Ibm> Library service method for document/image library JP3371006B2 (en) * 1993-03-03 2003-01-27 株式会社日立製作所 Table search method and router device US5664106A (en) * 1993-06-04 1997-09-02 Digital Equipment Corporation Phase-space surface representation of server computer performance in a computer network US6581090B1 (en) * 1996-10-14 2003-06-17 Mirror Image Internet, Inc. Internet communication system US5796952A (en) * 1997-03-21 1998-08-18 Dot Com Development, Inc. Method and apparatus for tracking client interaction with a network resource and creating client profiles and resource database US6185598B1 (en) * 1998-02-10 2001-02-06 Digital Island, Inc. Optimized network resource location US8060613B2 (en) * 1998-02-10 2011-11-15 Level 3 Communications, Llc Resource invalidation in a content delivery network US6438592B1 (en) * 1998-02-25 2002-08-20 Michael G. Killian Systems for monitoring and improving performance on the world wide web US6256398B1 (en) * 1998-08-22 2001-07-03 Kenneth H. P. Chang Encoding and decoding a message within an image US6192051B1 (en) * 1999-02-26 2001-02-20 Redstone Communications, Inc. Network router search engine using compressed tree forwarding table US6978418B1 (en) * 1999-04-13 2005-12-20 Hewlett-Packard Development Company, L.P. Dynamic-adaptive client-side image map US6560610B1 (en) * 1999-08-10 2003-05-06 Washington University Data structure using a tree bitmap and method for rapid classification of data in a database US7120871B1 (en) * 1999-09-15 2006-10-10 Actv, Inc. Enhanced video programming system and method utilizing a web page staging area US7748005B2 (en) * 2000-01-28 2010-06-29 Hewlett-Packard Development Company, L.P. System and method for allocating a plurality of resources between a plurality of computing domains US6553419B1 (en) * 2000-02-02 2003-04-22 International Business Machines Corporation System and method for computer system performance data pause and resume consuming minimum display area US7650376B1 (en) * 2000-03-27 2010-01-19 Blumenau Trevor I Content distribution system for distributing content over a network, with particular applicability to distributing high-bandwidth content US7240100B1 (en) * 2000-04-14 2007-07-03 Akamai Technologies, Inc. Content delivery network (CDN) content server request handling mechanism with metadata framework support US6996616B1 (en) * 2000-04-17 2006-02-07 Akamai Technologies, Inc. HTML delivery from edge-of-network servers in a content delivery network (CDN) US6698013B1 (en) * 2000-10-04 2004-02-24 Mintaka Technology Group Real time monitoring system for tracking and documenting changes made by programmer's during maintenance or development of computer readable code on a line by line basis and/or by point of focus US7756032B2 (en) * 2000-10-17 2010-07-13 Avaya Inc. Method and apparatus for communicating data within measurement traffic US20020150094A1 (en) * 2000-10-27 2002-10-17 Matthew Cheng Hierarchical level-based internet protocol multicasting US20020064136A1 (en) * 2000-11-02 2002-05-30 O'neil Timothy M. Conferencing network resource optimization for multi-point conferences US7840652B2 (en) * 2001-03-21 2010-11-23 Ascentive Llc System and method for determining network configuration settings that provide optimal network performance US7085825B1 (en) * 2001-03-26 2006-08-01 Freewebs Corp. Apparatus, method and system for improving application performance across a communications network US7664119B2 (en) * 2001-03-30 2010-02-16 Intel Corporation Method and apparatus to perform network routing EP1410217A4 (en) * 2001-04-02 2006-09-20 Akamai Tech Inc Scalable, high performance and highly available distributed storage system for internet content US7146560B2 (en) * 2001-05-18 2006-12-05 Xerox Corporation Systems and methods for managing identity information US7159014B2 (en) * 2001-06-04 2007-01-02 Fineground Networks Method and system for efficient and automated version management of embedded objects in web documents US7320131B1 (en) * 2001-06-06 2008-01-15 Cisco Technology, Inc. Methods and apparatus for selecting a server to process a request US7343399B2 (en) * 2001-06-25 2008-03-11 Nortel Networks Limited Apparatus and method for managing internet resource requests US7024477B2 (en) * 2001-06-29 2006-04-04 International Business Machines Corporation Service time analysis methods for the WSM QOS monitor US6981029B1 (en) * 2001-07-17 2005-12-27 Cisco Technology, Inc. System and method for processing a request for information in a network US6633324B2 (en) * 2001-07-31 2003-10-14 Forgent Networks, Inc. System and method for video call configuration and scheduling US7023465B2 (en) * 2001-07-31 2006-04-04 Tandberg Telecom As System and method for communication device configuration, scheduling and access control JP3748216B2 (en) * 2001-08-02 2006-02-22 日本電信電話株式会社 Packet transfer method and a packet transceiver US7133368B2 (en) * 2002-02-01 2006-11-07 Microsoft Corporation Peer-to-peer method of quality of service (QoS) probing and analysis and infrastructure employing same US7065496B2 (en) * 2002-02-13 2006-06-20 Tangoe, Inc. System for managing equipment, services and service provider agreements US7433871B2 (en) * 2002-02-14 2008-10-07 Transwitch Corporation Efficient ipv4/ipv6 best matching prefix method and apparatus US9167036B2 (en) * 2002-02-14 2015-10-20 Level 3 Communications, Llc Managed object replication and delivery US9137324B2 (en) * 2002-04-10 2015-09-15 International Business Machines Corporation Capacity on-demand in distributed computing environments US20040194085A1 (en) * 2002-05-09 2004-09-30 Globespanvirata Incorporated Method and system for providing capability management and prioritization in a computer system US7269657B1 (en) * 2002-05-10 2007-09-11 Rockwell Collins, Inc. Method and system for providing a mobile IP network with non-path dependent intra domain quality of service US20030221000A1 (en) * 2002-05-16 2003-11-27 Ludmila Cherkasova System and method for measuring web service performance using captured network packets US7899067B2 (en) * 2002-05-31 2011-03-01 Cisco Technology, Inc. Method and apparatus for generating and using enhanced tree bitmap data structures in determining a longest prefix match US7120874B2 (en) * 2002-06-18 2006-10-10 National Instruments Corporation Filtering graphical program elements based on configured or targeted resources US20030149581A1 (en) * 2002-08-28 2003-08-07 Imran Chaudhri Method and system for providing intelligent network content delivery US6826661B2 (en) * 2002-08-30 2004-11-30 Veritas Operating Corporation Methods and systems for storage architectures US20040064558A1 (en) * 2002-09-26 2004-04-01 Hitachi Ltd. Resource distribution management method over inter-networks US7961736B2 (en) * 2002-09-26 2011-06-14 Sharp Laboratories Of America, Inc. Convergence and classification of data packets in a centralized communication system US6975963B2 (en) * 2002-09-30 2005-12-13 Mcdata Corporation Method and system for storing and reporting network performance metrics using histograms US7310686B2 (en) * 2002-10-27 2007-12-18 Paxfire, Inc. Apparatus and method for transparent selection of an Internet server based on geographic location of a user US7752301B1 (en) * 2003-01-23 2010-07-06 Gomez Acquisition Corporation System and interface for monitoring information technology assets US7581224B2 (en) * 2003-07-10 2009-08-25 Hewlett-Packard Development Company, L.P. Systems and methods for monitoring resource utilization and application performance JP4421230B2 (en) * 2003-08-12 2010-02-24 株式会社日立製作所 Performance information analysis method US7565655B2 (en) 2003-10-17 2009-07-21 International Business Machines Corporation Methods and systems for control discovery in computing systems JP4516306B2 (en) * 2003-11-28 2010-08-04 株式会社日立製作所 How to collect the performance information of the storage network US9032096B2 (en) * 2003-12-17 2015-05-12 Cisco Technology, Inc. Reducing the impact of network latency on application performance US7773596B1 (en) * 2004-02-19 2010-08-10 Juniper Networks, Inc. Distribution of traffic flow criteria US7606236B2 (en) * 2004-05-21 2009-10-20 Intel Corporation Forwarding information base lookup method US20050273507A1 (en) * 2004-06-08 2005-12-08 Yong Yan Method and system for managing heterogeneous resources across a distributed computer network US8526446B2 (en) * 2005-02-04 2013-09-03 Level 3 Communications, Llc Ethernet-based systems and methods for improved network routing US8064467B2 (en) * 2005-02-04 2011-11-22 Level 3 Communications, Llc Systems and methods for network routing in a multiple backbone network architecture US8589561B2 (en) * 2005-03-22 2013-11-19 Alcatel Lucent Session level technique for improving web browsing performance on low speed links JP2006279466A (en) * 2005-03-29 2006-10-12 Fujitsu Ltd System, program, and method for monitoring US7685270B1 (en) * 2005-03-31 2010-03-23 Amazon Technologies, Inc. Method and apparatus for measuring latency in web services US7519200B2 (en) * 2005-05-09 2009-04-14 Like.Com System and method for enabling the use of captured images through recognition US7853871B2 (en) * 2005-06-10 2010-12-14 Nokia Corporation System and method for identifying segments in a web resource US7904875B2 (en) * 2005-12-12 2011-03-08 Microsoft Corporation Configuring and allocating software product technical services US20070219795A1 (en) * 2006-03-20 2007-09-20 Park Joseph C Facilitating content generation via paid participation US20070245010A1 (en) * 2006-03-24 2007-10-18 Robert Arn Systems and methods for multi-perspective optimization of data transfers in heterogeneous networks such as the internet US20070250611A1 (en) * 2006-04-20 2007-10-25 Bhogal Kulvir S Method of and System for Providing Performance Information in a UDDI System US7522595B2 (en) * 2006-06-16 2009-04-21 Cisco Technology, Inc. Communicating packets between forwarding contexts using virtual interfaces US7787380B1 (en) * 2006-06-30 2010-08-31 Juniper Networks, Inc. Resource reservation protocol with traffic engineering point to multi-point label switched path hierarchy JP4317995B2 (en) * 2007-05-11 2009-08-19 テクトロニクス・インコーポレイテッドＴｅｋｔｒｏｎｉｘ，Ｉｎｃ． Stream analysis apparatus and stream analysis display method US7937456B2 (en) * 2008-01-18 2011-05-03 Red Hat, Inc. Configuration profiling for remote clients US7979447B2 (en) * 2008-01-18 2011-07-12 Sony Corporation Method and apparatus for use in providing information to accessing content US8156243B2 (en) * 2008-03-31 2012-04-10 Amazon Technologies, Inc. Request routing US7925782B2 (en) * 2008-06-30 2011-04-12 Amazon Technologies, Inc. Request routing using network computing components US7930393B1 (en) * 2008-09-29 2011-04-19 Amazon Technologies, Inc. Monitoring domain allocation performance US8117306B1 (en) * 2008-09-29 2012-02-14 Amazon Technologies, Inc. Optimizing content management US8051166B1 (en) * 2008-09-29 2011-11-01 Amazon Technologies, Inc. Service provider optimization of content management US7865594B1 (en) * 2008-09-29 2011-01-04 Amazon Technologies, Inc. Managing resources consolidation configurations US7936754B2 (en) * 2008-12-12 2011-05-03 At&T Intellectual Property I, L.P. Methods and apparatus to dynamically store network routes for a communication network Non-Patent Citations (1) * Cited by examiner, † Cited by third party Title See references of WO2011084520A1 * Also Published As Publication number Publication date Type CN102792644B (en) 2016-03-09 grant EP2514150B1 (en) 2016-07-06 grant JP2013514745A (en) 2013-04-25 application ES2582534T3 (en) 2016-09-13 grant JP5964241B2 (en) 2016-08-03 grant US20110149965A1 (en) 2011-06-23 application US8325730B2 (en) 2012-12-04 grant EP3122010A1 (en) 2017-01-25 application CA2784707C (en) 2016-02-02 grant CN102792644A (en) 2012-11-21 application WO2011084520A1 (en) 2011-07-14 application CA2784707A1 (en) 2011-07-14 application Similar Documents Publication Publication Date Title US7184437B1 (en) Scalable route resolution US8239572B1 (en) Custom routing decisions US6804233B1 (en) Method and system for link level server/switch trunking US7535826B1 (en) Routing protocols for accommodating nodes with redundant routing facilities US8160063B2 (en) Data center interconnect and traffic engineering US7171681B1 (en) System and method for providing expandable proxy firewall services US20030023701A1 (en) Methods and apparatus for storage and processing of routing information US20060268869A1 (en) Designated router assginment per multicast group address/range US20080002588A1 (en) Method and apparatus for routing data packets in a global IP network WO2012093429A1 (en) Communication control system, control server, forwarding node, communication control method, and communication control program US20110286462A1 (en) Systems and methods for equal-cost multi-path virtual private lan service US20080198849A1 (en) Scaling virtual private networks using service insertion architecture US8693344B1 (en) Systems and methods for generating packet forwarding rules based on network policy US20070260746A1 (en) Maintaining IGP transparency of VPN routes when BGP is used as a PE-CE protocol US5983281A (en) Load balancing in a multiple network environment US7522603B2 (en) Technique for efficiently routing IP traffic on CE-CE paths across a provider network US20080144511A1 (en) Method and system for bandwidth allocation using router feedback US20080075089A1 (en) Snooping of on-path ip reservation protocols for layer 2 nodes US20100306408A1 (en) Agile data center network architecture US20050080923A1 (en) System and method for load balancing and fail over US7720061B1 (en) Distributed solution for managing periodic communications in a multi-chassis routing system US20040258074A1 (en) Method and apparatus for allocating addresses in integrated zero-configured and manually configured networks US8259585B1 (en) Dynamic link load balancing US20140192645A1 (en) Method for Internet Traffic Management Using a Central Traffic Controller US20050044141A1 (en) Method and system for multiple hosts anycast routing Legal Events Date Code Title Description AK Designated contracting states: Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR 17P Request for examination filed Effective date: 20120717 DAX Request for extension of the european patent (to any country) deleted 17Q First examination report Effective date: 20130828 REG Reference to a national code Ref country code: DE Ref legal event code: R079 Ref document number: 602010034537 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: H04L0012560000 Ipc: H04L0012775000 RIC1 Classification (correction) Ipc: H04L 12/715 20130101ALI20160104BHEP Ipc: H04L 12/775 20130101AFI20160104BHEP INTG Announcement of intention to grant Effective date: 20160125 REG Reference to a national code Ref country code: GB Ref legal event code: FG4D AK Designated contracting states: Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR REG Reference to a national code Ref country code: AT Ref legal event code: REF Ref document number: 811381 Country of ref document: AT Kind code of ref document: T Effective date: 20160715 Ref country code: CH Ref legal event code: EP Ref country code: CH Ref legal event code: NV Representative=s name: STOLMAR AND PARTNER INTELLECTUAL PROPERTY S.A., CH REG Reference to a national code Ref country code: IE Ref legal event code: FG4D Ref country code: NL Ref legal event code: FP REG Reference to a national code Ref country code: DE Ref legal event code: R096 Ref document number: 602010034537 Country of ref document: DE REG Reference to a national code Ref country code: SE Ref legal event code: TRGR REG Reference to a national code Ref country code: ES Ref legal event code: FG2A Ref document number: 2582534 Country of ref document: ES Kind code of ref document: T3 Effective date: 20160913 REG Reference to a national code Ref country code: DE Ref legal event code: R082 Ref document number: 602010034537 Country of ref document: DE Representative=s name: BOSCH JEHLE PATENTANWALTSGESELLSCHAFT MBH, DE REG Reference to a national code Ref country code: LT Ref legal event code: MG4D REG Reference to a national code Ref country code: AT Ref legal event code: MK05 Ref document number: 811381 Country of ref document: AT Kind code of ref document: T Effective date: 20160706 REG Reference to a national code Ref country code: FR Ref legal event code: PLFP Year of fee payment: 7 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161006 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161106 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161107 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161007 REG Reference to a national code Ref country code: DE Ref legal event code: R097 Ref document number: 602010034537 Country of ref document: DE PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20161006 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 26N No opposition filed Effective date: 20170407 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 REG Reference to a national code Ref country code: CH Ref legal event code: PCAR Free format text: NEW ADDRESS: RUE DU CENDRIER 15 CP 1489, 1201 GENEVE (CH) REG Reference to a national code Ref country code: FR Ref legal event code: PLFP Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: FI Payment date: 20171227 Year of fee payment: 8 Ref country code: LU Payment date: 20171226 Year of fee payment: 8 Ref country code: NL Payment date: 20171226 Year of fee payment: 8 Ref country code: FR Payment date: 20171227 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: IE Payment date: 20171228 Year of fee payment: 8 Ref country code: GB Payment date: 20171227 Year of fee payment: 8 Ref country code: BE Payment date: 20171227 Year of fee payment: 8 Ref country code: CH Payment date: 20171227 Year of fee payment: 8 Ref country code: SE Payment date: 20171229 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: ES Payment date: 20180102 Year of fee payment: 8 Ref country code: DE Payment date: 20171229 Year of fee payment: 8 PGFP Postgrant: annual fees paid to national office Ref country code: IT Payment date: 20171221 Year of fee payment: 8 PG25 Lapsed in a contracting state announced via postgrant inform. from nat. office to epo Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20160706 Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20101215

{ "url": "https://patents.google.com/patent/EP2514150A1", "source_domain": "patents.google.com", "snapshot_id": "crawl=CC-MAIN-2018-30", "warc_metadata": { "Content-Length": "217902", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LE3O64ZLLOIMUEZ5LCPPH3WQQQTV3334", "WARC-Concurrent-To": "<urn:uuid:eb357c15-3201-41d5-9fe8-1c7355b794cb>", "WARC-Date": "2018-07-18T18:42:52Z", "WARC-IP-Address": "172.217.7.142", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IPF7OBSNFQHIBCOM4NIIJWB72QYUFEA4", "WARC-Record-ID": "<urn:uuid:133dd5d2-4f67-4df4-8552-06ea9604cc7a>", "WARC-Target-URI": "https://patents.google.com/patent/EP2514150A1", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3ebb5b08-7530-435d-8089-0113bc384be3>" }, "warc_info": "robots: classic\r\nhostname: ip-10-13-227-44.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, 64, 65, 98, 99, 104, 105, 124, 136, 350, 360, 363, 376, 388, 400, 419, 426, 432, 443, 453, 461, 476, 667, 675, 694, 708, 724, 736, 748, 763, 781, 790, 804, 821, 839, 857, 874, 1047, 1071, 1089, 1113, 1304, 1316, 1333, 1334, 1340, 1341, 1357, 1358, 1377, 1419, 1497, 1574, 1612, 1631, 1673, 1751, 1828, 1890, 1891, 1900, 1901, 2920, 2921, 2933, 2934, 2967, 2968, 2979, 2980, 3834, 3835, 4617, 4618, 5695, 5696, 5730, 5731, 6008, 6009, 6218, 6219, 6382, 6383, 6603, 6604, 6762, 6763, 6916, 6917, 6938, 6939, 8747, 8748, 10099, 10100, 12005, 12006, 13600, 13601, 15237, 15238, 16794, 16795, 18217, 18218, 19383, 19384, 20411, 20412, 21944, 21945, 22869, 22870, 25077, 25078, 27051, 27052, 28096, 28097, 30485, 30486, 31585, 31586, 32204, 32205, 33015, 33016, 34584, 34585, 34818, 34819, 36252, 36253, 36991, 36992, 37592, 37593, 38600, 38601, 40197, 40198, 40549, 40550, 40557, 40558, 40578, 40622, 40756, 40928, 41498, 41789, 42181, 42394, 42828, 43275, 43555, 43851, 44172, 44413, 44513, 44655, 44830, 45035, 45243, 45451, 45633, 46447, 46492, 46579, 46810, 46921, 47194, 47600, 48083, 48278, 48474, 48746, 49169, 49369, 49587, 49780, 49881, 50025, 50202, 50343, 50498, 50640, 50796, 50937, 51092, 51359, 51514, 51680, 52202, 52345, 52449, 52618, 52686, 52933, 53486, 53710, 54073, 54343, 54552, 54745, 55014, 55430, 55627, 55837, 56030, 56131, 56463, 56556, 56557, 56583, 56584, 56635, 56718, 56811, 56812, 56847, 56848, 56899, 56985, 56986, 57017, 57018, 57069, 57164, 57165, 57182, 57183, 57219, 57269, 57309, 57310, 57317, 57318, 57330, 57331, 57355, 57356, 57407, 57500, 57594, 57595, 57625, 57626, 57677, 57771, 57772, 57791, 57792, 57805, 57829, 57853, 57877, 57902, 57925, 57949, 57976, 57977, 58009, 58010, 58054, 58119, 58231, 58318, 58406, 58507, 58612, 58613, 58640, 58641, 58685, 58750, 58877, 58966, 59124, 59223, 59417, 59515, 59636, 59767, 59876, 60015, 60137, 60293, 60424, 60606, 60794, 60991, 61163, 61309, 61570, 61693, 61808, 61942, 62103, 62258, 62365, 62518, 62631, 62794, 62924, 63050, 63189, 63325, 63451, 63600, 63700, 63866, 63992, 64118, 64227, 64369, 64537, 64709, 64860, 65045, 65198, 65327, 65444, 65562, 65724, 65873, 66036, 66173, 66340, 66431, 66577, 66694, 66824, 66926, 67027, 67174, 67307, 67460, 67598, 67696, 67822, 67950, 68070, 68196, 68310, 68486, 68623, 68762, 68932, 69067, 69165, 69298, 69381, 69499, 69607, 69704, 69823, 69938, 70100, 70101, 70126, 70127, 70171, 70177, 70212, 70213, 70231, 70232, 70273, 70308, 70342, 70384, 70418, 70452, 70496, 70530, 70570, 70603, 70644, 70687, 70727, 70728, 70746, 70747, 70782, 70825, 70867, 70940, 71033, 71099, 71183, 71276, 71360, 71450, 71597, 71692, 71783, 71883, 71984, 72049, 72152, 72238, 72322, 72382, 72454, 72563, 72693, 72738, 72833, 72907, 72908, 72921, 72922, 72950, 72984, 72985, 73015, 73016, 73151, 73152, 73186, 73187, 73212, 73213, 73287, 73316, 73317, 73342, 73343, 73376, 73377, 73398, 73399, 73426, 73427, 73461, 73462, 73490, 73491, 73545, 73546, 73566, 73567, 73600, 73601, 73642, 73643, 73684, 73685, 73725, 73726, 73751, 73752, 73785, 73786, 73807, 73808, 73835, 73836, 73870, 73871, 73901, 73902, 74037, 74038, 74071, 74072, 74093, 74094, 74120, 74121, 74149, 74150, 74178, 74179, 74208, 74209, 74234, 74235, 74256, 74257, 74282, 74283, 74304, 74305, 74330, 74331, 74405, 74406, 74439, 74440, 74461, 74462, 74489, 74490, 74511, 74512, 74537, 74538, 74571, 74572, 74593, 74594, 74621, 74622, 74656, 74657, 74685, 74686, 74719, 74720, 74741, 74742, 74769, 74770, 74803, 74804, 74825, 74826, 74853, 74854, 74883, 74884, 74912, 74913, 74943, 74944, 74969, 74970, 75003, 75004, 75025, 75026, 75053, 75054, 75088, 75089, 75117, 75118, 75187, 75188, 75221, 75222, 75243, 75244, 75271, 75272, 75305, 75306, 75327, 75328, 75355, 75356, 75384, 75385, 75413, 75414, 75443, 75444, 75469, 75470, 75503, 75504, 75525, 75526, 75553, 75554, 75577, 75578, 75669, 75670, 75691, 75692, 75829, 75830, 75855, 75856, 75877, 75878, 76015, 76016, 76041, 76042, 76063, 76064, 76201, 76202, 76227, 76228, 76249, 76250, 76387, 76388, 76413, 76414, 76435, 76436, 76573, 76574, 76599, 76600, 76691, 76692, 76713, 76714, 76851, 76852, 76877, 76878, 76899, 76900, 77037, 77038, 77063, 77064, 77085, 77086, 77223, 77224, 77249, 77250, 77271, 77272, 77409, 77410, 77435, 77436, 77457, 77458, 77595, 77596, 77621, 77622, 77655, 77656, 77677, 77678, 77705, 77706, 77740, 77741, 77769, 77770, 77861, 77862, 77883, 77884, 78021, 78022, 78047, 78048, 78069, 78070, 78207, 78208, 78233, 78234, 78325, 78326, 78347, 78348, 78485, 78486, 78511, 78512, 78533, 78534, 78671, 78672, 78697, 78698, 78719, 78720, 78857, 78858, 78883, 78884, 78905, 78906, 79043, 79044, 79069, 79070, 79091, 79092, 79229, 79230, 79255, 79256, 79280, 79281, 79306, 79307, 79398, 79399, 79420, 79421, 79558, 79559, 79584, 79585, 79676, 79677, 79698, 79699, 79836, 79837, 79862, 79863, 79896, 79897, 79918, 79919, 79946, 79947, 80023, 80024, 80057, 80058, 80079, 80080, 80107, 80108, 80131, 80132, 80184, 80185, 80206, 80207, 80230, 80231, 80254, 80255, 80276, 80277, 80300, 80301, 80324, 80325, 80346, 80347, 80370, 80371, 80394, 80395, 80416, 80417, 80440, 80441, 80464, 80465, 80517, 80518, 80539, 80540, 80563, 80564, 80587, 80588, 80609, 80610, 80633, 80634, 80657, 80658, 80679, 80680, 80703, 80704, 80727, 80728, 80749, 80750, 80773, 80774, 80797, 80798, 80819, 80820, 80843, 80844, 80867, 80868, 80920, 80921, 80942, 80943, 80966, 80967, 80990, 80991, 81012, 81013, 81036, 81037, 81060, 81061, 81113, 81114, 81135, 81136, 81159, 81160, 81183, 81184, 81275, 81276, 81297, 81298, 81435, 81436, 81461, 81462, 81483, 81484, 81640, 81641 ], "line_end_idx": [ 64, 65, 98, 99, 104, 105, 124, 136, 350, 360, 363, 376, 388, 400, 419, 426, 432, 443, 453, 461, 476, 667, 675, 694, 708, 724, 736, 748, 763, 781, 790, 804, 821, 839, 857, 874, 1047, 1071, 1089, 1113, 1304, 1316, 1333, 1334, 1340, 1341, 1357, 1358, 1377, 1419, 1497, 1574, 1612, 1631, 1673, 1751, 1828, 1890, 1891, 1900, 1901, 2920, 2921, 2933, 2934, 2967, 2968, 2979, 2980, 3834, 3835, 4617, 4618, 5695, 5696, 5730, 5731, 6008, 6009, 6218, 6219, 6382, 6383, 6603, 6604, 6762, 6763, 6916, 6917, 6938, 6939, 8747, 8748, 10099, 10100, 12005, 12006, 13600, 13601, 15237, 15238, 16794, 16795, 18217, 18218, 19383, 19384, 20411, 20412, 21944, 21945, 22869, 22870, 25077, 25078, 27051, 27052, 28096, 28097, 30485, 30486, 31585, 31586, 32204, 32205, 33015, 33016, 34584, 34585, 34818, 34819, 36252, 36253, 36991, 36992, 37592, 37593, 38600, 38601, 40197, 40198, 40549, 40550, 40557, 40558, 40578, 40622, 40756, 40928, 41498, 41789, 42181, 42394, 42828, 43275, 43555, 43851, 44172, 44413, 44513, 44655, 44830, 45035, 45243, 45451, 45633, 46447, 46492, 46579, 46810, 46921, 47194, 47600, 48083, 48278, 48474, 48746, 49169, 49369, 49587, 49780, 49881, 50025, 50202, 50343, 50498, 50640, 50796, 50937, 51092, 51359, 51514, 51680, 52202, 52345, 52449, 52618, 52686, 52933, 53486, 53710, 54073, 54343, 54552, 54745, 55014, 55430, 55627, 55837, 56030, 56131, 56463, 56556, 56557, 56583, 56584, 56635, 56718, 56811, 56812, 56847, 56848, 56899, 56985, 56986, 57017, 57018, 57069, 57164, 57165, 57182, 57183, 57219, 57269, 57309, 57310, 57317, 57318, 57330, 57331, 57355, 57356, 57407, 57500, 57594, 57595, 57625, 57626, 57677, 57771, 57772, 57791, 57792, 57805, 57829, 57853, 57877, 57902, 57925, 57949, 57976, 57977, 58009, 58010, 58054, 58119, 58231, 58318, 58406, 58507, 58612, 58613, 58640, 58641, 58685, 58750, 58877, 58966, 59124, 59223, 59417, 59515, 59636, 59767, 59876, 60015, 60137, 60293, 60424, 60606, 60794, 60991, 61163, 61309, 61570, 61693, 61808, 61942, 62103, 62258, 62365, 62518, 62631, 62794, 62924, 63050, 63189, 63325, 63451, 63600, 63700, 63866, 63992, 64118, 64227, 64369, 64537, 64709, 64860, 65045, 65198, 65327, 65444, 65562, 65724, 65873, 66036, 66173, 66340, 66431, 66577, 66694, 66824, 66926, 67027, 67174, 67307, 67460, 67598, 67696, 67822, 67950, 68070, 68196, 68310, 68486, 68623, 68762, 68932, 69067, 69165, 69298, 69381, 69499, 69607, 69704, 69823, 69938, 70100, 70101, 70126, 70127, 70171, 70177, 70212, 70213, 70231, 70232, 70273, 70308, 70342, 70384, 70418, 70452, 70496, 70530, 70570, 70603, 70644, 70687, 70727, 70728, 70746, 70747, 70782, 70825, 70867, 70940, 71033, 71099, 71183, 71276, 71360, 71450, 71597, 71692, 71783, 71883, 71984, 72049, 72152, 72238, 72322, 72382, 72454, 72563, 72693, 72738, 72833, 72907, 72908, 72921, 72922, 72950, 72984, 72985, 73015, 73016, 73151, 73152, 73186, 73187, 73212, 73213, 73287, 73316, 73317, 73342, 73343, 73376, 73377, 73398, 73399, 73426, 73427, 73461, 73462, 73490, 73491, 73545, 73546, 73566, 73567, 73600, 73601, 73642, 73643, 73684, 73685, 73725, 73726, 73751, 73752, 73785, 73786, 73807, 73808, 73835, 73836, 73870, 73871, 73901, 73902, 74037, 74038, 74071, 74072, 74093, 74094, 74120, 74121, 74149, 74150, 74178, 74179, 74208, 74209, 74234, 74235, 74256, 74257, 74282, 74283, 74304, 74305, 74330, 74331, 74405, 74406, 74439, 74440, 74461, 74462, 74489, 74490, 74511, 74512, 74537, 74538, 74571, 74572, 74593, 74594, 74621, 74622, 74656, 74657, 74685, 74686, 74719, 74720, 74741, 74742, 74769, 74770, 74803, 74804, 74825, 74826, 74853, 74854, 74883, 74884, 74912, 74913, 74943, 74944, 74969, 74970, 75003, 75004, 75025, 75026, 75053, 75054, 75088, 75089, 75117, 75118, 75187, 75188, 75221, 75222, 75243, 75244, 75271, 75272, 75305, 75306, 75327, 75328, 75355, 75356, 75384, 75385, 75413, 75414, 75443, 75444, 75469, 75470, 75503, 75504, 75525, 75526, 75553, 75554, 75577, 75578, 75669, 75670, 75691, 75692, 75829, 75830, 75855, 75856, 75877, 75878, 76015, 76016, 76041, 76042, 76063, 76064, 76201, 76202, 76227, 76228, 76249, 76250, 76387, 76388, 76413, 76414, 76435, 76436, 76573, 76574, 76599, 76600, 76691, 76692, 76713, 76714, 76851, 76852, 76877, 76878, 76899, 76900, 77037, 77038, 77063, 77064, 77085, 77086, 77223, 77224, 77249, 77250, 77271, 77272, 77409, 77410, 77435, 77436, 77457, 77458, 77595, 77596, 77621, 77622, 77655, 77656, 77677, 77678, 77705, 77706, 77740, 77741, 77769, 77770, 77861, 77862, 77883, 77884, 78021, 78022, 78047, 78048, 78069, 78070, 78207, 78208, 78233, 78234, 78325, 78326, 78347, 78348, 78485, 78486, 78511, 78512, 78533, 78534, 78671, 78672, 78697, 78698, 78719, 78720, 78857, 78858, 78883, 78884, 78905, 78906, 79043, 79044, 79069, 79070, 79091, 79092, 79229, 79230, 79255, 79256, 79280, 79281, 79306, 79307, 79398, 79399, 79420, 79421, 79558, 79559, 79584, 79585, 79676, 79677, 79698, 79699, 79836, 79837, 79862, 79863, 79896, 79897, 79918, 79919, 79946, 79947, 80023, 80024, 80057, 80058, 80079, 80080, 80107, 80108, 80131, 80132, 80184, 80185, 80206, 80207, 80230, 80231, 80254, 80255, 80276, 80277, 80300, 80301, 80324, 80325, 80346, 80347, 80370, 80371, 80394, 80395, 80416, 80417, 80440, 80441, 80464, 80465, 80517, 80518, 80539, 80540, 80563, 80564, 80587, 80588, 80609, 80610, 80633, 80634, 80657, 80658, 80679, 80680, 80703, 80704, 80727, 80728, 80749, 80750, 80773, 80774, 80797, 80798, 80819, 80820, 80843, 80844, 80867, 80868, 80920, 80921, 80942, 80943, 80966, 80967, 80990, 80991, 81012, 81013, 81036, 81037, 81060, 81061, 81113, 81114, 81135, 81136, 81159, 81160, 81183, 81184, 81275, 81276, 81297, 81298, 81435, 81436, 81461, 81462, 81483, 81484, 81640, 81641, 81665 ] }

{ "red_pajama_v2": { "ccnet_original_length": 81665, "ccnet_original_nlines": 817, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2853958308696747, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0775466114282608, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2234531193971634, "rps_doc_frac_unique_words": 0.14060044288635254, "rps_doc_mean_word_length": 5.537507057189941, "rps_doc_num_sentences": 397, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.764464855194092, "rps_doc_word_count": 12091, "rps_doc_frac_chars_dupe_10grams": 0.3401738405227661, "rps_doc_frac_chars_dupe_5grams": 0.5375033617019653, "rps_doc_frac_chars_dupe_6grams": 0.46579742431640625, "rps_doc_frac_chars_dupe_7grams": 0.4300713837146759, "rps_doc_frac_chars_dupe_8grams": 0.4028586745262146, "rps_doc_frac_chars_dupe_9grams": 0.37612390518188477, "rps_doc_frac_chars_top_2gram": 0.013890130445361137, "rps_doc_frac_chars_top_3gram": 0.008065240457654, "rps_doc_frac_chars_top_4gram": 0.020073480904102325, "rps_doc_books_importance": -7482.51611328125, "rps_doc_books_importance_length_correction": -7482.51611328125, "rps_doc_openwebtext_importance": -4623.283203125, "rps_doc_openwebtext_importance_length_correction": -4623.283203125, "rps_doc_wikipedia_importance": -3389.7861328125, "rps_doc_wikipedia_importance_length_correction": -3389.7861328125 }, "fasttext": { "dclm": 0.11493874341249466, "english": 0.8517946600914001, "fineweb_edu_approx": 2.557751417160034, "eai_general_math": 0.12556272745132446, "eai_open_web_math": 0.044044379144907, "eai_web_code": 0.10765749216079712 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.4", "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": "11", "label": "Legal/Regulatory" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "11", "label": "Legal Notices" } }, "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

9,042,921,916,750,535,000

How to copy a single file to multiple directories in Linux or Unix in Categories , , , , , , , , last updated January 17, 2017 If I want to copy a single file into three locations (directories), by using a single cp command (e.g. cp file /dir1/ /dir2/ /dir3/. Would that be possible? If yes, please provide the command for GNU/Linux or Unix operating systems. The short answer is no. You can not use GNU/cp or BSD/cp to copy a single file to multiple directories. However, you can use combination of cp and xargs/parallel and other commands to copy a single file to multiple directories in MacOS, Linux, FreeBSD, OpenBSD, NetBSD and Unix-like systems. Copying one file to multiple directories The cp command The basic cp command syntax is as follows to copy multiple files to a single directory: cp file1 /dir1/ cp file1 file2 file3 /dir1/ Copy file to multiple directories in Unix or Linux The trick is to use the xargs command or GNU parallel command. Copying one file named foo.txt to multiple directories called /tmp/1/, /tmp/2/, and /tmp/3 using xargs The xargs command construct argument list(s) and execute utility such as cp or mv. The syntax is: xargs -n 1 cp -v filename<<<"/dir1/ /dir2/ /dir3/" ## OR ## echo "/dir1/ /dir2/ /dir3/" | xargs -n 1 cp -v filename In this example copy /etc/passwd to /tmp/1/, /tmp/2/, and $HOME/3/ as follows: xargs -n 1 cp -v /etc/passwd<<<"/tmp/1/ /tmp/2/ $HOME/3/" OR echo "/tmp/1/ /tmp/2/ $HOME/3/" | xargs -n 1 cp -v /etc/passwd Sample outputs: Fig.01: Copy multiple files in different directories using the Linux/Unix cp command Fig.01: Copy multiple files in different directories using the Linux/Unix cp command Copying one file named foo.txt to multiple directories called /tmp/1/, /tmp/2/, and /tmp/3 using parallel GNU parallel is a shell tool for executing jobs in parallel using one or more computers. The syntax is: parallel cp fileNameHere ::: /dir1/ /dir2/ /dir3/ In this example copy /etc/resolv.conf to /tmp/1/, /tmp/2/, and $HOME/3/ as follows: parallel cp -v /etc/resolv.conf ::: /tmp/1/ /tmp/2/ $HOME/3/ Sample outputs: /etc/resolv.conf -> /tmp/2/resolv.conf /etc/resolv.conf -> /tmp/1/resolv.conf /etc/resolv.conf -> /Users/vivek/3/resolv.conf How to use tee command to copy file to multiple folders Say you want to copy /etc/resolv.conf to /tmp/1/ and /tmp/2/, you run the tee command as follows: tee /tmp/1/resolv.conf /tmp/2/resolv.conf < /etc/resolv.conf tee /tmp/1/resolv.conf /tmp/2/resolv.conf < /etc/resolv.conf >/dev/null You need to specify full path like /tmp/1/resolv.conf, otherwise you get the following error: tee: /tmp/1/: Is a directory How to use find command to copy files to multiple dirs simultaneously The syntax is as follows for the find command: find /dir1/ /dir2/ -maxdepth 0 -exec cp filename {} \; To copy /etc/hosts simultaneously to /tmp/{1,2}/ and $HOME/3/ folders under a Linux/Unix/MacOS/FreeBSD etc, enter: find /tmp/1/ /tmp/2/ $HOME/3/ -maxdepth 0 -exec cp /etc/hosts {} \; Sample outputs: /etc/hosts -> /tmp/1/hosts /etc/hosts -> /tmp/2/hosts /etc/hosts -> /Users/vivek/3/hosts Shell loop You can also use bash for loop as follows: for dest in /dir1/ /dir2/ ; do cp -v file "$dest" ; done for dest in /tmp/1/ /tmp2/ $HOME/3/ ; do cp -v "/etc/resolv.conf" "$dest" ; done Posted by: Vivek Gite The author is the creator of nixCraft and a seasoned sysadmin, DevOps engineer, and a trainer for the Linux operating system/Unix shell scripting. Get the latest tutorials on SysAdmin, Linux/Unix and open source topics via RSS/XML feed or weekly email newsletter. Share this on (or read 5 comments/add one below): 5 comment Have a question? Post it on our forum!

{ "url": "https://www.cyberciti.biz/faq/linux-unix-copy-a-file-to-multiple-directories-using-cp-command/", "source_domain": "www.cyberciti.biz", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "49201", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:IZKQAWPXZRMY5N6LGZWBFHTQFYMOFAL2", "WARC-Concurrent-To": "<urn:uuid:741e55ce-81d1-427a-9f69-665aacf3206c>", "WARC-Date": "2018-02-22T23:01:08Z", "WARC-IP-Address": "104.20.186.5", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:BRT5556LS7GFXO6AWRHVLQMF6L45OJLK", "WARC-Record-ID": "<urn:uuid:a31ca598-49c4-4012-920c-8a65f77c35c0>", "WARC-Target-URI": "https://www.cyberciti.biz/faq/linux-unix-copy-a-file-to-multiple-directories-using-cp-command/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3e4b70a4-f1b0-4dbc-8991-9fd1153e453f>" }, "warc_info": "robots: classic\r\nhostname: ip-10-136-53-50.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 67, 68, 128, 129, 362, 363, 655, 656, 697, 698, 713, 714, 802, 818, 846, 847, 898, 899, 962, 963, 1066, 1067, 1165, 1166, 1218, 1220, 1229, 1285, 1286, 1365, 1423, 1426, 1489, 1505, 1506, 1591, 1676, 1677, 1783, 1784, 1888, 1889, 1939, 1940, 2024, 2085, 2101, 2102, 2141, 2180, 2227, 2228, 2284, 2285, 2383, 2516, 2610, 2611, 2640, 2641, 2711, 2712, 2759, 2814, 2929, 2930, 2998, 2999, 3015, 3016, 3043, 3070, 3105, 3106, 3117, 3118, 3161, 3162, 3219, 3300, 3301, 3323, 3324, 3588, 3589, 3639, 3640, 3650, 3651 ], "line_end_idx": [ 67, 68, 128, 129, 362, 363, 655, 656, 697, 698, 713, 714, 802, 818, 846, 847, 898, 899, 962, 963, 1066, 1067, 1165, 1166, 1218, 1220, 1229, 1285, 1286, 1365, 1423, 1426, 1489, 1505, 1506, 1591, 1676, 1677, 1783, 1784, 1888, 1889, 1939, 1940, 2024, 2085, 2101, 2102, 2141, 2180, 2227, 2228, 2284, 2285, 2383, 2516, 2610, 2611, 2640, 2641, 2711, 2712, 2759, 2814, 2929, 2930, 2998, 2999, 3015, 3016, 3043, 3070, 3105, 3106, 3117, 3118, 3161, 3162, 3219, 3300, 3301, 3323, 3324, 3588, 3589, 3639, 3640, 3650, 3651, 3693 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3693, "ccnet_original_nlines": 89, "rps_doc_curly_bracket": 0.0016247000312432647, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20879121124744415, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01798201911151409, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.39060938358306885, "rps_doc_frac_unique_words": 0.3496376872062683, "rps_doc_mean_word_length": 4.865942001342773, "rps_doc_num_sentences": 36, "rps_doc_symbol_to_word_ratio": 0.003996000159531832, "rps_doc_unigram_entropy": 4.736308574676514, "rps_doc_word_count": 552, "rps_doc_frac_chars_dupe_10grams": 0.10833954066038132, "rps_doc_frac_chars_dupe_5grams": 0.20364855229854584, "rps_doc_frac_chars_dupe_6grams": 0.17237527668476105, "rps_doc_frac_chars_dupe_7grams": 0.17237527668476105, "rps_doc_frac_chars_dupe_8grams": 0.15227103233337402, "rps_doc_frac_chars_dupe_9grams": 0.13812360167503357, "rps_doc_frac_chars_top_2gram": 0.020104240626096725, "rps_doc_frac_chars_top_3gram": 0.05472822114825249, "rps_doc_frac_chars_top_4gram": 0.046537600457668304, "rps_doc_books_importance": -327.55291748046875, "rps_doc_books_importance_length_correction": -327.55291748046875, "rps_doc_openwebtext_importance": -221.1742706298828, "rps_doc_openwebtext_importance_length_correction": -221.1742706298828, "rps_doc_wikipedia_importance": -158.0078125, "rps_doc_wikipedia_importance_length_correction": -158.0078125 }, "fasttext": { "dclm": 0.8073555827140808, "english": 0.7885155081748962, "fineweb_edu_approx": 2.7204668521881104, "eai_general_math": 0.952221155166626, "eai_open_web_math": 0.3794100284576416, "eai_web_code": 0.7633244395256042 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,097,214,138,249,679,000

Welcome :: Homework Help and Answers :: Mathskey.com Welcome to Mathskey.com Question & Answers Community. Ask any math/science homework question and receive answers from other members of the community. 13,434 questions 17,804 answers 1,438 comments 59,225 users Standard and General Form of the Circle's Equation? +3 votes Standard and General Form of the Circle's Equation? Write the standard form of the equation and the general form of the equation of each circle of radius r and center (h, k). (1) r = 3; (h, k) = (0, 0 ) (2) r = 5; (h, k) = (-5, 2) asked Jan 16, 2013 in ALGEBRA 1 by homeworkhelp Mentor 1 Answer +5 votes Best answer (1) r = 3; (h, k) = (0, 0 ) General Form equation is x2 + y2 – 2hx – 2ky + h2 + k2 – r2 = 0, where (h, k) is the centre and r, the radius. x2 + y2 + 2(0)x – 2(0)y + 02 + 02 – 32 = 0 x2 + y2 – 32 = 0 x2 + y2 – 9 = 0 Standard Form Equation is (x – h)2 + (y – k)2 = r2 where (h, k) is the centre and r, the radius. (x – 0) 2 + (y – 0) 2 = 32 x2 + y2 = 9 . 2) r = 5; (h, k) = (-5, 2) General Form equation is x2 + y2 – 2hx – 2ky + h2 + k2 – r2 = 0, where (h, k) is the centre and r, the radius. x2 + y2 –2(–5)x – 2(2)y + (–5)2 + 22 – 52 = 0 x2 + y2 + 10x – 4y + 25 + 4 – 25 = 0 x2 + y2 + 10x – 4y + 4 = 0 Standard Form Equation is (x – h)2 + (y – k)2 = r2 where (h, k) is the centre and r, the radius. (x – (–5)) 2 + (y–2)2 = 52 (x + 5)2 + (y – 2)2 = 25 source: http://answers.yahoo.com/question/index?qid=20071125073022AADwDqu answered Jan 16, 2013 by Naren Answers Apprentice selected Jan 23, 2013 by homeworkhelp Thank you!!! it helped a lot... Related questions ...

{ "url": "http://www.mathskey.com/question2answer/741/standard-and-general-form-of-the-circles-equation", "source_domain": "www.mathskey.com", "snapshot_id": "crawl=CC-MAIN-2021-04", "warc_metadata": { "Content-Length": "80975", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:WNJO4JBBU7C5J2PAZ7MSWA33NF5NDWJI", "WARC-Concurrent-To": "<urn:uuid:760e96f4-5e74-4c29-becb-df192dcdde6d>", "WARC-Date": "2021-01-18T00:33:06Z", "WARC-IP-Address": "108.161.128.73", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:A2ZTWJT7WVTVEURIY6CYC3SRYLSCUX7O", "WARC-Record-ID": "<urn:uuid:d460aff9-bd62-44cd-bb2c-113b3e8695b7>", "WARC-Target-URI": "http://www.mathskey.com/question2answer/741/standard-and-general-form-of-the-circles-equation", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bde4ce17-5af4-4db3-b2f3-0d8274c4c27e>" }, "warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 53, 203, 204, 221, 222, 237, 238, 253, 254, 267, 268, 320, 321, 330, 331, 383, 384, 507, 508, 536, 537, 565, 620, 621, 630, 631, 640, 642, 654, 655, 683, 794, 837, 854, 870, 871, 968, 995, 1009, 1010, 1037, 1148, 1194, 1231, 1258, 1259, 1356, 1357, 1384, 1409, 1410, 1412, 1413, 1487, 1488, 1538, 1576, 1608, 1609, 1627, 1628 ], "line_end_idx": [ 53, 203, 204, 221, 222, 237, 238, 253, 254, 267, 268, 320, 321, 330, 331, 383, 384, 507, 508, 536, 537, 565, 620, 621, 630, 631, 640, 642, 654, 655, 683, 794, 837, 854, 870, 871, 968, 995, 1009, 1010, 1037, 1148, 1194, 1231, 1258, 1259, 1356, 1357, 1384, 1409, 1410, 1412, 1413, 1487, 1488, 1538, 1576, 1608, 1609, 1627, 1628, 1631 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1631, "ccnet_original_nlines": 61, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20502901077270508, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0019342399900779128, "rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495, "rps_doc_frac_no_alph_words": 0.5473887920379639, "rps_doc_frac_unique_words": 0.319218248128891, "rps_doc_mean_word_length": 3.4267101287841797, "rps_doc_num_sentences": 18, "rps_doc_symbol_to_word_ratio": 0.0038684699684381485, "rps_doc_unigram_entropy": 4.1462483406066895, "rps_doc_word_count": 307, "rps_doc_frac_chars_dupe_10grams": 0.26996198296546936, "rps_doc_frac_chars_dupe_5grams": 0.4134981036186218, "rps_doc_frac_chars_dupe_6grams": 0.4134981036186218, "rps_doc_frac_chars_dupe_7grams": 0.3764258623123169, "rps_doc_frac_chars_dupe_8grams": 0.3498098850250244, "rps_doc_frac_chars_dupe_9grams": 0.26996198296546936, "rps_doc_frac_chars_top_2gram": 0.017110269516706467, "rps_doc_frac_chars_top_3gram": 0.034220531582832336, "rps_doc_frac_chars_top_4gram": 0.034220531582832336, "rps_doc_books_importance": -229.9741668701172, "rps_doc_books_importance_length_correction": -216.18353271484375, "rps_doc_openwebtext_importance": -102.61990356445312, "rps_doc_openwebtext_importance_length_correction": -102.61990356445312, "rps_doc_wikipedia_importance": -74.31477355957031, "rps_doc_wikipedia_importance_length_correction": -61.37637710571289 }, "fasttext": { "dclm": 0.06963943690061569, "english": 0.8601978421211243, "fineweb_edu_approx": 1.8463858366012573, "eai_general_math": 0.9316676259040833, "eai_open_web_math": 0.6628491282463074, "eai_web_code": 0.056333720684051514 } }

{ "free_decimal_correspondence": { "primary": { "code": "516.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } }, "secondary": { "code": "512.9", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Algebra" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-6,318,460,014,703,200,000

Navigating Privacy and Security Concerns in Metaverse Apps The rise of metaverse apps has ushered in a new era of virtual experiences and interactions. From gaming to socializing, these immersive platforms offer endless possibilities. However, with this new frontier comes a set of privacy and security concerns that users must navigate. In this article, we will explore the key issues surrounding privacy and security in metaverse apps and provide insights on how users can protect themselves. Understanding Data Collection Practices Metaverse apps often require users to create accounts and provide personal information. This data is collected for various purposes, such as user authentication, customization of virtual avatars, or targeted advertising. It is crucial for users to understand what data is being collected and how it will be used. To ensure transparency, metaverse app developers should provide clear privacy policies that outline their data collection practices. Users should take the time to read these policies carefully before signing up or using the app. Additionally, it is advisable to choose apps that have a good track record of handling user data responsibly. Safeguarding Personal Information Protecting personal information is paramount when using metaverse apps. Users should be cautious about sharing sensitive data such as their full name, address, or financial information within these platforms unless absolutely necessary. One way to safeguard personal information is by utilizing strong passwords for metaverse app accounts and enabling two-factor authentication whenever possible. This adds an extra layer of security by requiring users to verify their identity through another device or method. Furthermore, it is essential to regularly update the metaverse app to ensure that any security vulnerabilities are patched promptly. Staying vigilant against phishing attempts or suspicious links within the app can also help prevent unauthorized access to personal information. Managing Social Interactions Metaverse apps thrive on social interactions between users, but this also opens up opportunities for potential privacy breaches or cyberbullying. Users should be mindful of the information they share with others and be cautious about accepting friend requests or engaging in private conversations with unknown individuals. Most metaverse apps provide privacy settings that allow users to customize who can see their profile, interact with them, or access their personal information. Reviewing and adjusting these settings regularly can help users maintain control over their privacy within the virtual world. In cases where inappropriate behavior or harassment occurs, users should report the incident to the app’s support team immediately. Metaverse app developers have a responsibility to address such issues promptly and take appropriate actions against offenders. Staying Informed about App Updates Metaverse apps are continuously evolving, which means that privacy and security concerns may arise as new features are introduced. It is essential for users to stay informed about app updates, especially those related to privacy and security enhancements. Following official announcements from the app developer or joining user communities where updates are shared can provide valuable insights into any changes that may affect user privacy. By staying up-to-date, users can take proactive measures to protect themselves and adjust their privacy settings accordingly. In conclusion, while metaverse apps offer exciting virtual experiences, it is crucial for users to navigate privacy and security concerns effectively. Understanding data collection practices, safeguarding personal information, managing social interactions, and staying informed about app updates are key steps towards ensuring a safe and secure metaverse experience. By taking these precautions, users can enjoy all that the metaverse has to offer while protecting their digital identities. This text was generated using a large language model, and select text has been reviewed and moderated for purposes such as readability.

{ "url": "https://www.ask.com/news/navigating-privacy-security-concerns-metaverse-apps", "source_domain": "www.ask.com", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "81965", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4BAC5RYGRM4J3GDZZL6ULYNTAPDTDOGI", "WARC-Concurrent-To": "<urn:uuid:a066f2e6-1c5f-421b-b6f0-7a8f33101639>", "WARC-Date": "2024-06-19T11:47:30Z", "WARC-IP-Address": "146.75.34.114", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZO7C3IZAQMYKESYBELCOIADN7RLHBAXO", "WARC-Record-ID": "<urn:uuid:c98425df-c1d2-4eb6-98aa-b88333ea32af>", "WARC-Target-URI": "https://www.ask.com/news/navigating-privacy-security-concerns-metaverse-apps", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0661d219-f12a-4107-bcac-c23b9f016698>" }, "warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-37\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 59, 60, 496, 497, 537, 538, 851, 852, 1191, 1192, 1226, 1227, 1464, 1465, 1740, 1741, 2019, 2020, 2049, 2050, 2373, 2374, 2660, 2661, 2920, 2921, 2956, 2957, 3213, 3214, 3526, 3527, 4018, 4019 ], "line_end_idx": [ 59, 60, 496, 497, 537, 538, 851, 852, 1191, 1192, 1226, 1227, 1464, 1465, 1740, 1741, 2019, 2020, 2049, 2050, 2373, 2374, 2660, 2661, 2920, 2921, 2956, 2957, 3213, 3214, 3526, 3527, 4018, 4019, 4154 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4154, "ccnet_original_nlines": 34, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3696969747543335, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.08939394354820251, "rps_doc_frac_unique_words": 0.46901172399520874, "rps_doc_mean_word_length": 5.834170818328857, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.182601451873779, "rps_doc_word_count": 597, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05512489005923271, "rps_doc_frac_chars_dupe_6grams": 0.012058570049703121, "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.033591728657484055, "rps_doc_frac_chars_top_3gram": 0.03100774995982647, "rps_doc_frac_chars_top_4gram": 0.02985931932926178, "rps_doc_books_importance": -320.0315856933594, "rps_doc_books_importance_length_correction": -320.0315856933594, "rps_doc_openwebtext_importance": -178.767578125, "rps_doc_openwebtext_importance_length_correction": -178.767578125, "rps_doc_wikipedia_importance": -180.31683349609375, "rps_doc_wikipedia_importance_length_correction": -180.31683349609375 }, "fasttext": { "dclm": 0.8587511777877808, "english": 0.9297360181808472, "fineweb_edu_approx": 2.575124502182007, "eai_general_math": 0.008011939935386181, "eai_open_web_math": 0.009915770031511784, "eai_web_code": 0.6873957514762878 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.8", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "352.3", "labels": { "level_1": "Social sciences", "level_2": "Public administration and Military art and science", "level_3": "Local government" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "14", "label": "News Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,374,158,953,255,695,000

Beyond Passwords Passwords are a modern ‘pain in the neck’. We have passwords for this, passwords for that, and IT experts quoting confusing, and increasingly often, contradictory guidance on how to pick good passwords. How many different services do you use on the Internet? Each one very likely needs you to create an account and by extension, pick a password. Many of us have thrown the towel in on password management – it’s become simply too difficult a task for most of us to manage successfully. Tools like LastPass and 1Password have become invaluable to ensure we’re using unique and complex passwords for all our services. But even with a password manager to help us, passwords are still imperfect. They’re imperfect because once someone knows your password, they’re effectively ‘you’ for whatever service they are using. Many services have security breaches, and passwords (or poorly protected encoded versions of passwords) leak. The service ‘Have I Been Pwned?’ (https://haveibeenpwned.com/) allows you to check if passwords associated with your email address have been leaked from various major breaches. At the time of writing, 5,555,329,164 passwords are tracked by Have I Been Pwned. So what should we do to protect ourselves further? The answer comes in the form of so-called multi-factor authentication, or two-step verification. These are subtly different techniques, but each adds another piece to the equation. No longer is a username and a password enough, you need something else. One of the most popular implementations is to register your mobile phone number with a service. When attempting to login, you’ll have to enter your username, password and a code that the service provider will ‘text’ to your phone. That code is valid only once, and is randomly chosen. In this way, even if a hacker has your username and password, the assumption is that they don’t have your phone and therefore can’t get the code. That’s great, until it isn’t. See, another security guy making life complicated again! Unfortunately hackers can sometimes redirect text messages to them, meaning that they do receive the code, and hence can still get into your account if they have your username and password. One step better is to use an ‘authenticator app’. There are many free ones to choose from (Google Authenticator, Authy, etc.). The app is a small tool you install on your smartphone. It can be synchronized with the service provider usually by scanning a 2D barcode that the service gives you. This then ‘seeds’ the app so that it will produce the same series of constantly changing codes as the service provider is expecting. Logging in then involves username, password and whatever code the app is displaying when you attempt to login. These codes typically change every 30 seconds or so making it impractical for an attacker to use. Unfortunately not all services support the use of an authenticator app, so if it’s not available for the services you want to use, then by all means rely on the SMS-based ‘text’ code option. It’s much better than a plain password on it’s own. Comments Dave, kudos for another very well-written article! I would like to add that even when we are using a secondary factor, we must not allow ourselves to get lazy in terms of password management. The old rules still apply: choosing a complex password is still important as important as ever. And we still must always ensure that we don't reuse the same password on different sites. And, of course, never tell anyone else our password, no matter who they claim to be. --"Another security guy making life complicated" =:^p

{ "url": "https://www.sbcncanada.org/articles/beyond-passwords", "source_domain": "www.sbcncanada.org", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "20869", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BQ7CRJMU6RMAHBBFQX3WJSN27FOUEJPI", "WARC-Concurrent-To": "<urn:uuid:85fe43c4-49b6-4005-912e-9149b1023a88>", "WARC-Date": "2019-03-21T02:55:26Z", "WARC-IP-Address": "99.250.36.159", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:FHA4GIGRPRAHGSTE746ZAJNYED7VK66I", "WARC-Record-ID": "<urn:uuid:3bd3c9eb-b3a8-4727-b31c-34ccad5b3ffc>", "WARC-Target-URI": "https://www.sbcncanada.org/articles/beyond-passwords", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1f27157e-a4e8-40f0-b801-40193bf7d3a6>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-123-157-4.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 17, 18, 221, 222, 635, 636, 1204, 1205, 1256, 1257, 1510, 1511, 1942, 1943, 2030, 2031, 2348, 2349, 2857, 2858, 3101, 3102, 3111, 3112, 3581, 3582 ], "line_end_idx": [ 17, 18, 221, 222, 635, 636, 1204, 1205, 1256, 1257, 1510, 1511, 1942, 1943, 2030, 2031, 2348, 2349, 2857, 2858, 3101, 3102, 3111, 3112, 3581, 3582, 3636 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3636, "ccnet_original_nlines": 26, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4721088409423828, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008163269609212875, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15918366611003876, "rps_doc_frac_unique_words": 0.47587352991104126, "rps_doc_mean_word_length": 4.856904983520508, "rps_doc_num_sentences": 39, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.196018695831299, "rps_doc_word_count": 601, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02672147937119007, "rps_doc_frac_chars_dupe_6grams": 0.02672147937119007, "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.01712914928793907, "rps_doc_frac_chars_top_3gram": 0.01849948987364769, "rps_doc_frac_chars_top_4gram": 0.01575881987810135, "rps_doc_books_importance": -266.607177734375, "rps_doc_books_importance_length_correction": -266.607177734375, "rps_doc_openwebtext_importance": -180.49679565429688, "rps_doc_openwebtext_importance_length_correction": -180.49679565429688, "rps_doc_wikipedia_importance": -141.76145935058594, "rps_doc_wikipedia_importance_length_correction": -141.76145935058594 }, "fasttext": { "dclm": 0.20229214429855347, "english": 0.9394041299819946, "fineweb_edu_approx": 2.1929478645324707, "eai_general_math": 0.05825788155198097, "eai_open_web_math": 0.1274862289428711, "eai_web_code": 0.06965965032577515 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "10", "label": "Knowledge Article" }, "secondary": { "code": "16", "label": "Personal Blog" } }, "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,793,582,915,370,766,000

Hacker News new | past | comments | ask | show | jobs | submit login Rate My Startup: DomainPigeon.com (domainpigeon.com) 31 points by matt1 on Jan 29, 2009 | hide | past | favorite | 74 comments I'm pretty big domain collector, and to be honest, I see no compelling reason to use this service. Something like Freshdrop.net, which allows sorting by numerous data types, searching, and the ability to get the jump on newly expired domains is much more useful. Of the 10 most popular domains, only 1 (campdeal.com) is moderately attractive. I browsed through a bunch of the categories and most of them were terrible. There is also no ability to search a keyword and have relevant names appear. I would be very interested in a service like this, but you will need much more functionality to compete. I think you may have opened up for review before the product was ready. Thanks for the feedback and I understand your critiques. The 10 most popular were only elevated to that level from people testing out the site (all of those were on the front page when people were testing it). I don't think they accurately reflect the best domains the site has. It should as the site gets more traffic. Plus, eventually some will start to get registered, which I'll highly prominently on the homepage. It needs time though. As far as releasing before it was ready, all I can say is that there's a lot more I'm going to do, but wanted to get something out there to get feedback. This is not a final product by any means; it's an iteration. Edited to add: While Domain Pigeon may one day be popular with domain collectors such as yourself, I'd consider it more successful if it becomes popular with non-collectors. If you go to the site expecting to find domains worth thousands of dollars, you'll likely be disappointed--most of those are taken. My objective is to make a good place to go for people simply looking for options. I think you should reconsider targeting more serious collectors. I personally buy 5 or so domains per week, so that adds up to many more sales than the average person who might buy 5 domains their entire life. You might be right. I'll try to make it a great site for both audiences. Release early, release often. I think the headline at the top is longer than necessary, too much of a sentence. So instead of: "We help you find an unregistered domain name for your website" Maybe: "Find the best unregistered domains" Or something else short and sweet? Just a thought. Best of luck! It's funny, I must have changed it about fifty times. It's amazing how many variations you can get on the same phrase. For example: - "We help you find an unregistered domain name for your website" - "We help you find unregistered domain names for your websites" - "Find an unregistered domain name for your website" - "Find unregistered domain names for your websites" - "Find a great unregistered domain name for your site" Etc etc. I think I'll get rid of the "We help you", as that was something I was indecisive about. Thanks -- Use Google's Website Optimizer to do AB testing with the different phrases that you've come up with. http://adwords.google.com/support/bin/answer.py?hl=en&an... I would drop the "for you website" bit. It sounds a little 1994. What else would they want the domain name for? I too fell into that trap. One day I woke up and saw "best * on the Internet" in my copy and hated myself all day. I think keeping "for your website" makes it clearer for normal people. At the same time, "normal people" who don't know that domains are for websites will not have a prayer of understanding what domainpidgin.com is about. How do you expect these "normal people" to find domainpidgin in the first place? It seems to me that the text in the header should be "Domain Pigeon helps you find unregistered domain names for your websites." These are the first words you used yourself in describing the site and I think they work perfectly. Yeah, that's smart. Done. Digging back in the logs and I found this-- Not sure if you ever changed this, but that's a weird tagline. The other poster is right, it sounds very 1994. It seems redundant in one sense, and awkward in the other. A website suggests a domain, so do you mean I need a new domain for my existing website? unregistered domain locator Can I get that with a ".com" please? @OP, how about "Get a great .com, .net, .whatever right now!" The short of it: Domain Pigeon helps you find unregistered domain names for your websites. Please let me know what you think. The long of it: In March of last year I was in the process of writing some poker software and trying to decide on a name for it. I wanted a good name and also wanted to own the corresponding domain name so that people could easily find it. I used Ajaxwhois, a great site that lets shows you the availability of domain names as you type, and quickly got pulled in trying to find a good domain. I would spend hours trying things like “pokerguru.com”, “pokermaster.com”, “pokercalculator.com”, “pokerexpert.com”, and so on. After a lot of time and energy later, I found “allinexpert.com”, which became the name of the software. Fast forward to about July. ALL IN Expert had just flopped and I was trying to decide on a new project to work on. I had several ideas in mind and again, I wanted a good domain name for whatever it wound up being. It was kind of sick: I wound up going back to Ajaxwhois and using it as the tie breaker. If I could find a good domain name for one project and not the other, that would be what I worked on. It was crazy. There's got to be a better way. I wrote a small piece of software that played with various word combinations and displayed their availability. Surprisingly, there are a lot of decent domains out there... you just have to be patient enough or resourceful enough to find them. Then it hit me: This is something other people could use too. I put the other ideas on the back burner and started on this one. Domain Pigeon, an eccentric but hopefully memorable name I discovered with the same software, is intended to make finding unregistered domain names easier. It has been my learn Rails/JavaScript/web development nights and weekends project over the last few months. I hope you like it. This is round two of its launch. Last week I posted a link to Philly on Rails, a local group of Rails aficionados, and received a lot of great feedback. The result is what you see today (hopefully, depending on how DreamHost does with the traffic). I've got a list of about two dozens features I intend to add over the coming weeks, which will be modified and prioritized based on your feedback. For me, Domain Pigeon has been as much about learning the process as it has been about the releasing the product. On that note, all feedback, positive and negative, is welcomed. I also keep a blog, mattmazur.com, where I write about Domain Pigeon and its progress for anyone that is interested. I try to be as transparent as possible, as that's the best way to get valuable feedback. On a final note, a lot of the design decisions for Domain Pigeon were adapted from feedback given to other people launching their sites on HackerNews and for that, I owe you all a thank you. Please let me know what you think. Looks very cool. One bit of feedback: A surprisingly large number of people (10.5 million in the US, or about 7.5% of the population) have some form of red/green colorblindness. (http://en.wikipedia.org/wiki/Color_blindness#Prevalence) I am one of those people... On domainpidgeon.com it is extremely hard to tell light green from pink, and therefore to know which domains are available and which are not. I would suggest some other visual indication... maybe strike out the names which are unavailable (http://www.htmlcodetutorial.com/_STRIKE.html), or make the text gray? Other site I found useful is Nameboy. You give it terms and it tries to find combinations of them that are available. It's pretty slow though, so I think they are not using a local database but are instead doing something expensive to check each combination. I have my own one too which checks expired domain name listings for promising looking stuff that will become available soon. I can crosslink if you like, but only get 1000+ uniques per month. Not making any money after the expiring domain registrant affiliate programs were closed. I think the site, your blog and write up are all great - thank you. Can you use it to help find a better HN username as well, since it seems that "matt" was taken? ;) The name immediately made me think "So, what, it's going to shit all over my site and be a general annoyance?" You need a better name :) Bloodhounds come to mind. Six months from now, I bet you're going to remember the name though :) You have some competition, how do you stand out? (like nameboy.com, domainit.com, domainnamesuggest.com, domainsbot.com ) Eventually, do everything they do better (and more). thats not an answer :P why should I use your service over theirs? Yeah, I know :D Here's a start: 1) You don't have to type in any keywords, you can just browse and see what you like. Soon I'll add the ability for people to generate lists based on keywords similar to those other sites, but I wanted to get this out there. 2) Sometimes you don't know what type of domain you want. For example, consider a domain like "posterous.com". That's not something any of those other sites would likely show you based on your keywords. Domain Pigeon would. 3) You can quickly tell what's popular based on the shading, making registration a kind of game. At the moment, the recently added list is mostly white, but it will light up as more people visit the site. The top 10 will change accordingly too. 4) Usability is valued and the site isn't littered with ads. awesome. Good luck - you've switched me :) How do you make money? Membership, affiliates, and maybe some quality ads. There's a lot of options down the road depending on how things go. at a guess, by affiliate links from when users buy domains I hate to say this, but do you know who you are up against? Domain squatters are the sleaziest web entrepreneurs known to man. You are basically making their job much easier... If this site gets at all popular, domain squatters are going to scrape your site for domains that have any value whatsoever and register them. That's how they operate. They are set up to register domain names quickly and cheaply, and squeeze any profit from them at all. For example, it used to be the case (might still be) that if you did a search on GoDaddy.com for some domain, and did not register that domain within X hours, GoDaddy would sell their searches to squatters which would then often register the domain you just searched for. My guess is their whole process is automated based on how long the domain is, which dictionary words it contains, etc. Shitty, right? You are a dream come true to them: more than just data on if the domain was searched, but actually tracking non-registered domains' popularities... and posting it for all the public to see! All it takes is one of these self proclaimed "web real estate guru" assholes to come along and see your site has decent domain names listed, and tell his programmer crony to scrape and register them. I see your only option being using images to display domain names, and mangling up the URLs, to hopefully stifle anyone trying to scrape your site. Then, if you have a lack of morals and want money really bad, you can sell a feed of popular domains to squatters from some good money. Good luck. This will be useful to a lot of us, I'm sure. Just nitpicking here, but you have the words "Click a domain name to begin" that shows up no matter what page I am on (including the registration page). Feels a little out of context there... Maybe its just me. Great job.. Wish you the best Thanks and good point about the click message. It now only appears when the user is within the domain controller. Just purchased 3 domain names, oisie.com (for the shape and look on paper), sayideas.com (maybe a live video site, for idea sharing), idgeo.com (hmm, maybe a tracking solution of some kind) A bit late in the day perhaps, but I had a couple of observations: * Search should be above the fold. On my MacBook I have to scroll down to see the input field. Also on the results page I’d put a search box at the top, auto-focused (a la the Google homepage) so I can quickly perform another search. * "You may have better luck with an account :)." - Why not tell me how many domains I could see if I did sign up instead? I’d be much more likely to fork over $14.95 if I knew what I was getting in advance. It must be kinda good, because I just bought one of the domains I just saw on your front page - rollwall.com. Sure I can find a use for it :) It's dangerous on some level. I'm looking for a domain for something I have in mind but while browsing through I've been thinking up functionality to match up to any good names... must stay focused :-) That's the nicest compliment the site could have received. Appreciate it -- Someone just got campdeal.com too :) yeap, I got it! thanks mate :) I realized after you grabbed this that the color calculations were also including registered domains, which it shouldn't have been doing. I fixed that so now that you grabbed campdeal, which was by far the most heavily clicked domain, everything is a lot more colorful. I think your site is great - could use some synonym heuristics to suggest simillar domains and, ofcourse, an easy way to buy domain through you as a reseller. or it looks like I wasn't fast enough when I bought the domain even though I was charged, weird. :D - Put your price on the front page. I'm distrustful if you try to hide it. - Does the search do substrings? Auto-acronyming? regexs? Startup folks may enjoy that. - You probably killed off the cream of your inventory crop by showing it here first :-) Also, perhaps do AB testing with $14.99 and $9.99. See if there's a psychological barrier there. You may find the drop in price is compensated by the increased conversion. Very good observations. - I'm not sure what the best way to show the price is. I played with having it big and bold on the registration page but couldn't get it to look right. In an effort to learn how to do it better, I've been taking photos of price tags at Walmart, the mall, etc and have got some good ideas in mind on how to make it better. There's definitely an art to it... - The search does do substrings. No auto-acronyming (not sure what that is). No regex, as I don't think most people would use it. - $14.99 vs $9.99... its tough. I figure I'll start higher and drop lower eventually if it seems necessary. It's easier to lower your price than to raise it. - Inventory... most people haven't scanned past the first few pages. I'll need to find a way to make this easier. Search should be much more prominent. I have a set of product names with a common keyword and I always am on the lookout for good domains with that keyword. Search should be the first input box I see on the page, not tucked away in the left sidebar below the fold. When the site has 100K domains rather than 10K domains, I'll definitely make it more prominent. Right now most search results will be 'No domains found' which is why I don't want to showcase it too much. Also, as mentioned elsewhere in this thread, I'll eventually add a feature that finds unregistered domain names based on your keywords. Domain Pigeon will go hunting for your domains and show you what's available. In time... I like the look. I thought that clicking on one of the domains felt a little slow. After clicking and waiting, all the info I got was 'This domain is available', with no further action items. Do you keep a blog or feed that we can subscribe to for updates? Thanks. No feed available yet and because of the way the site tracks popularity, that may never be an option. At some point I will add the ability to sort by specific dates and for people to "mark as read" domains for that date, allowing you to make sure you're not looking over domains twice. As for the speed, well, that's a function of DreamHost and Verisign... what are you gonna do... Put the search at the top, next to the sort. Put the login at the top. Five letter 'sort' is a filter. Make the sorts reversible with a second click. Add registry links for available sites. Good luck! Users can "view" a domain name repeatedly to make it look more popular...should assign 1 view per domain per ip Yes, as someone who voted up "adenosineetriphosphate.com" figured out, that can be done. I limited it to one view per unique IP address to avoid that problem in the future. Thank you. Still riggable with a little effort (Tor re-login + BeautifulSoup script). Does dicking with this affect anything important or is it more of a prank? It's more of a prank, but, one I need to solve. When shitty domains get voted up to the Top 10, people will see those and infer the overall quality of the domains on the site. Worse, no one will ever register those domains and they will sit on the Top 10 list forever, unless I delete them manually. So I've got to figure out some way to make the Top 10 list accurately reflect which are the best domains. Currently I'm thinking something along the lines of a popularity equation which uses time and clicks, similar to what HN does with time and points. Thoughts? I'm bookmarking this, love it! BTW, I use aplus.net to register all my domains. If you put a drop down box to select the register that I would like to use, I think that would be very convenient. ".com Checker:" must be a real pigeon; it ran forever it never came back. I will never use it. I take as my enemy any site which supports and enables the crimes-against-humanity naming scheme of modern Internet startups! What? I mean that any site which helps some random social spreadsheeting startup choose some dumb name like Oodlu or Uffli is NOT MY FRIEND. (Thankfully for you and them, my friendship is not worth much in USD.) My hope is that Domain Pigeon will give people options so that they don't have to use names like Oodlu if they don't want to. In a sense, we're on the same team :) What a wierd comment Quick pg, register hackerer.com! how are you defining good? one peeve: I can't copy and paste the domain name text. campdeal.com is available? wow. Yeah, good question. There's a tradeoff between adding less domains but making them of a higher quality and adding more domains but risking that some are of poor quality. At first, I was religiously nixing the bad ones, but I realized it wasn't worth the effort. Not only is it time consuming, but surprisingly, someone may actually register it. You should see the list of registered domain names... there's a lot of garbage out there :) it was... Why are you not making money off the sale? For example by using a referral code to a domain registration service? It's in the works. It's a tough business selling the domain name ideas. I make a buck or two on each sold domain at http://HotNameList.com. But it's too easy for users to skip your link, or have an ad blocker etc. Then you get nothing for the sale. Site looks nice, though. Good luck. The tougher a market is the more you can make by doing it well, no? There are no more interesting domains left. He who comes up with a solution to that problem will become filthy rich. Time to drop the addressbar and use a wordbar with disambiguation? Who is in charge of pushing the world forward? Sorry, I'm the guy in charge of pushing the world forward. I accidentally fell asleep. "Time to drop the addressbar and use a wordbar with disambiguation?" Aren't you roughly describing the way Chrome works? (Maybe not the disambiguation part, it defaulting to a Google search doesn't count.) Unless you've looked through all of the current 10K+ domains on the site, you can't really say that :) There are actually a lot of decent ones out there... Applications are open for YC Winter 2021 Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact Search:

{ "url": "https://news.ycombinator.com/item?id=456471", "source_domain": "news.ycombinator.com", "snapshot_id": "crawl=CC-MAIN-2020-40", "warc_metadata": { "Content-Length": "99726", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NLYQCQJFNNWWEISY6CQVBWNFTZ6KOPFS", "WARC-Concurrent-To": "<urn:uuid:a2bc5a44-c0ed-45ef-b841-a40c4fe1d6e2>", "WARC-Date": "2020-09-19T13:13:39Z", "WARC-IP-Address": "209.216.230.240", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JKTRXTAQKXP5SQBJYI7N55HH3D3VDIF6", "WARC-Record-ID": "<urn:uuid:9d03f32f-eada-4099-9d7b-c6b580b11392>", "WARC-Target-URI": "https://news.ycombinator.com/item?id=456471", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c4c89f99-0d00-451d-ba08-824c6992da26>" }, "warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-205.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 69, 122, 196, 197, 198, 199, 462, 463, 696, 697, 874, 875, 876, 933, 934, 1318, 1319, 1534, 1535, 1923, 1924, 1925, 2135, 2136, 2137, 2210, 2211, 2212, 2242, 2243, 2244, 2326, 2327, 2342, 2343, 2407, 2408, 2415, 2416, 2453, 2454, 2489, 2490, 2520, 2521, 2522, 2654, 2655, 2721, 2722, 2787, 2788, 2842, 2843, 2896, 2897, 2953, 2954, 3052, 3053, 3063, 3064, 3065, 3166, 3167, 3227, 3228, 3229, 3341, 3342, 3457, 3458, 3459, 3530, 3531, 3532, 3683, 3684, 3765, 3766, 3767, 3996, 3997, 3998, 4024, 4025, 4026, 4329, 4330, 4331, 4359, 4360, 4361, 4398, 4399, 4461, 4462, 4463, 4589, 4590, 5215, 5216, 5621, 5622, 5911, 5912, 6040, 6041, 6325, 6326, 6575, 6576, 6723, 6724, 7108, 7109, 7300, 7301, 7336, 7337, 7338, 7355, 7356, 7377, 7378, 7576, 7577, 7747, 7748, 7916, 7917, 7918, 8177, 8178, 8460, 8461, 8462, 8530, 8531, 8630, 8631, 8632, 8769, 8770, 8796, 8797, 8798, 8869, 8870, 8871, 8993, 8994, 8995, 9048, 9049, 9050, 9073, 9074, 9117, 9118, 9119, 9135, 9136, 9152, 9153, 9378, 9379, 9603, 9604, 9849, 9850, 9911, 9912, 9913, 9956, 9957, 9958, 9981, 9982, 9983, 10102, 10103, 10104, 10163, 10164, 10165, 10342, 10343, 10614, 10615, 11021, 11022, 11412, 11413, 11697, 11698, 11709, 11710, 11711, 11757, 11758, 11950, 11951, 12000, 12001, 12002, 12116, 12117, 12118, 12308, 12309, 12310, 12377, 12378, 12612, 12613, 12820, 12821, 12822, 12964, 12965, 12966, 13168, 13169, 13170, 13246, 13247, 13248, 13285, 13286, 13287, 13318, 13319, 13320, 13590, 13591, 13592, 13751, 13752, 13753, 13853, 13854, 13855, 13930, 13931, 14019, 14020, 14108, 14109, 14281, 14282, 14283, 14307, 14308, 14665, 14666, 14796, 14797, 14955, 14956, 15070, 15071, 15072, 15337, 15338, 15339, 15543, 15544, 15769, 15770, 15771, 16028, 16029, 16030, 16324, 16325, 16421, 16422, 16423, 16624, 16625, 16626, 16738, 16739, 16740, 16924, 16925, 16926, 17001, 17002, 17077, 17078, 17079, 17127, 17128, 17634, 17635, 17645, 17646, 17647, 17678, 17679, 17680, 17844, 17845, 17846, 17920, 17921, 17922, 18069, 18070, 18071, 18077, 18078, 18079, 18214, 18215, 18286, 18287, 18288, 18414, 18415, 18453, 18454, 18455, 18476, 18477, 18478, 18511, 18512, 18513, 18540, 18541, 18597, 18598, 18630, 18631, 18632, 18653, 18654, 19071, 19072, 19073, 19083, 19084, 19085, 19199, 19200, 19201, 19220, 19221, 19222, 19275, 19276, 19453, 19454, 19479, 19480, 19491, 19492, 19493, 19561, 19562, 19563, 19607, 19608, 19681, 19682, 19749, 19750, 19797, 19798, 19799, 19886, 19887, 19888, 19957, 19958, 20095, 20096, 20097, 20253, 20254, 20255, 20256, 20257, 20298, 20299, 20397, 20398 ], "line_end_idx": [ 69, 122, 196, 197, 198, 199, 462, 463, 696, 697, 874, 875, 876, 933, 934, 1318, 1319, 1534, 1535, 1923, 1924, 1925, 2135, 2136, 2137, 2210, 2211, 2212, 2242, 2243, 2244, 2326, 2327, 2342, 2343, 2407, 2408, 2415, 2416, 2453, 2454, 2489, 2490, 2520, 2521, 2522, 2654, 2655, 2721, 2722, 2787, 2788, 2842, 2843, 2896, 2897, 2953, 2954, 3052, 3053, 3063, 3064, 3065, 3166, 3167, 3227, 3228, 3229, 3341, 3342, 3457, 3458, 3459, 3530, 3531, 3532, 3683, 3684, 3765, 3766, 3767, 3996, 3997, 3998, 4024, 4025, 4026, 4329, 4330, 4331, 4359, 4360, 4361, 4398, 4399, 4461, 4462, 4463, 4589, 4590, 5215, 5216, 5621, 5622, 5911, 5912, 6040, 6041, 6325, 6326, 6575, 6576, 6723, 6724, 7108, 7109, 7300, 7301, 7336, 7337, 7338, 7355, 7356, 7377, 7378, 7576, 7577, 7747, 7748, 7916, 7917, 7918, 8177, 8178, 8460, 8461, 8462, 8530, 8531, 8630, 8631, 8632, 8769, 8770, 8796, 8797, 8798, 8869, 8870, 8871, 8993, 8994, 8995, 9048, 9049, 9050, 9073, 9074, 9117, 9118, 9119, 9135, 9136, 9152, 9153, 9378, 9379, 9603, 9604, 9849, 9850, 9911, 9912, 9913, 9956, 9957, 9958, 9981, 9982, 9983, 10102, 10103, 10104, 10163, 10164, 10165, 10342, 10343, 10614, 10615, 11021, 11022, 11412, 11413, 11697, 11698, 11709, 11710, 11711, 11757, 11758, 11950, 11951, 12000, 12001, 12002, 12116, 12117, 12118, 12308, 12309, 12310, 12377, 12378, 12612, 12613, 12820, 12821, 12822, 12964, 12965, 12966, 13168, 13169, 13170, 13246, 13247, 13248, 13285, 13286, 13287, 13318, 13319, 13320, 13590, 13591, 13592, 13751, 13752, 13753, 13853, 13854, 13855, 13930, 13931, 14019, 14020, 14108, 14109, 14281, 14282, 14283, 14307, 14308, 14665, 14666, 14796, 14797, 14955, 14956, 15070, 15071, 15072, 15337, 15338, 15339, 15543, 15544, 15769, 15770, 15771, 16028, 16029, 16030, 16324, 16325, 16421, 16422, 16423, 16624, 16625, 16626, 16738, 16739, 16740, 16924, 16925, 16926, 17001, 17002, 17077, 17078, 17079, 17127, 17128, 17634, 17635, 17645, 17646, 17647, 17678, 17679, 17680, 17844, 17845, 17846, 17920, 17921, 17922, 18069, 18070, 18071, 18077, 18078, 18079, 18214, 18215, 18286, 18287, 18288, 18414, 18415, 18453, 18454, 18455, 18476, 18477, 18478, 18511, 18512, 18513, 18540, 18541, 18597, 18598, 18630, 18631, 18632, 18653, 18654, 19071, 19072, 19073, 19083, 19084, 19085, 19199, 19200, 19201, 19220, 19221, 19222, 19275, 19276, 19453, 19454, 19479, 19480, 19491, 19492, 19493, 19561, 19562, 19563, 19607, 19608, 19681, 19682, 19749, 19750, 19797, 19798, 19799, 19886, 19887, 19888, 19957, 19958, 20095, 20096, 20097, 20253, 20254, 20255, 20256, 20257, 20298, 20299, 20397, 20398, 20405 ] }

{ "red_pajama_v2": { "ccnet_original_length": 20405, "ccnet_original_nlines": 390, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 3, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.45733481645584106, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03404254838824272, "rps_doc_frac_lines_end_with_ellipsis": 0.020460359752178192, "rps_doc_frac_no_alph_words": 0.17133258283138275, "rps_doc_frac_unique_words": 0.27695736289024353, "rps_doc_mean_word_length": 4.37949275970459, "rps_doc_num_sentences": 302, "rps_doc_symbol_to_word_ratio": 0.004255319945514202, "rps_doc_unigram_entropy": 5.857869625091553, "rps_doc_word_count": 3589, "rps_doc_frac_chars_dupe_10grams": 0.021376769989728928, "rps_doc_frac_chars_dupe_5grams": 0.04758875072002411, "rps_doc_frac_chars_dupe_6grams": 0.04129023849964142, "rps_doc_frac_chars_dupe_7grams": 0.03734571859240532, "rps_doc_frac_chars_dupe_8grams": 0.029838399961590767, "rps_doc_frac_chars_dupe_9grams": 0.021376769989728928, "rps_doc_frac_chars_top_2gram": 0.0047716000117361546, "rps_doc_frac_chars_top_3gram": 0.0030538199935108423, "rps_doc_frac_chars_top_4gram": 0.006362129934132099, "rps_doc_books_importance": -2058.790283203125, "rps_doc_books_importance_length_correction": -2058.790283203125, "rps_doc_openwebtext_importance": -1292.013427734375, "rps_doc_openwebtext_importance_length_correction": -1292.013427734375, "rps_doc_wikipedia_importance": -941.8889770507812, "rps_doc_wikipedia_importance_length_correction": -941.8889770507812 }, "fasttext": { "dclm": 0.08374475687742233, "english": 0.9642435908317566, "fineweb_edu_approx": 1.1184684038162231, "eai_general_math": 0.27766501903533936, "eai_open_web_math": 0.17877310514450073, "eai_web_code": 0.05156021937727928 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.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": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "5", "label": "Comment Section" }, "secondary": { "code": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,102,113,331,304,153,000

Variation Behind Interface VariationBehindInterface.jpg Identical houses on the outside, but you can be sure that the interior decoration varies. ...the architecture has been established, and CodeOwnership has been put in place. Features have been assigned. Now the easy part is over. ✥ ✥ ✥ Once you start developing software, you find that things change. And these changes can affect not only your software, but software written by others as well. A typical scenario plays out like this: You are working on a feature, and you need to change a certain file. Unfortunately, someone else is working on a different feature, but needs the same file. Good configuration management and work space tools can use file locking to prevent one of you from undoing the other’s work, but there is still a problem with merging your modifications together. Or perhaps you just wait for the other person to complete before you start your work on that file. A similar problem is this: You are working on a feature, and call a function that someone else is working on. When you build against the official base, you find that the function has changed, and you need to change how you call that function. We can turn that problem around: You are working on a function that others call. When you build against the official base, you find that your changes cause build errors in others’ code — where they call your function. These problems illustrate the technical problems that arise from multiple people working on a software project. Even worse, you may be waiting for someone to check in their code so you can make your own changes to it. After they check in their copy and you check out the image for editing, you find out that they have added some things you would like to use and have deleted some things you need, both in the same unit of editing. This is a fundamental dilemma that tools and technology alone cannot solve. Therefore: Create interfaces around predicted points of variation. Note that this requires one to predict, or at the very least, make educated guesses about what will change, and what will remain constant. This can be called commonality and variability analysis, or domain analysis, and is described in various places such as [Weiss1999] and [Coplien1999]. In spite of our best efforts at analysis, it will be necessary to change the interfaces on occasion. These changes impact others; to minimize the impact, use NamedStableBases to manage these changes. This is really nothing more or less than information hiding, as originally described by Parnas [Parnas1978]. Here the motivation for information hiding is to insulate others from expected changes. It was also behind Alan Kay’s work in object-oriented programming. This pattern forms the basis for ShearingLayers [Foote2000], which states that you should factor your system so that the artifacts that change at similar rates are together. One difference is that ShearingLayers is often applied at the system level, rather than the module level, as this pattern is. ✥ ✥ ✥ So what does this pattern have to do with creating effective soft- ware development teams? Quite a bit, actually. Of course, a project is partitioned among team members. The team members depend on each other’s software; therefore the connection points of the software — the interfaces — must change as seldom as possible. Otherwise, people find themselves spending much time rewriting parts of code that once worked. And people begin to get testy with each other. The way to minimize interface changes is to hide variations behind interfaces. Don’t get too carried away. Too many interfaces cause the system to be slow. Designers sometimes try to anticipate all variations. The extra interfaces slow down and complicate the software. Often the situations they hoped to anticipate never happen, so the interface serves no useful purpose. The trick in good design is to correctly anticipate the changes, or the cost of the interface against the cost of the change. See HierarchyOfFactories and ParserBuilder as examples of this approach.

{ "url": "http://orgpatterns.wikispaces.com/VariationBehindInterface?responseToken=a070a41f53ac5201ebf40d03ea8cfb1d", "source_domain": "orgpatterns.wikispaces.com", "snapshot_id": "crawl=CC-MAIN-2017-39", "warc_metadata": { "Content-Length": "52599", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:WMNJ2HB56L4MC2KUJ4FIB7X4GRPT6FEG", "WARC-Concurrent-To": "<urn:uuid:afaebdf6-1a6d-4c06-ad34-1e37ac123988>", "WARC-Date": "2017-09-24T01:38:58Z", "WARC-IP-Address": "208.43.192.33", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:VDUXG5DKCHKJPCHUU2FNPQUU2T4WZU3V", "WARC-Record-ID": "<urn:uuid:1a681fd0-2f88-4e68-87ed-810ebaeadc4e>", "WARC-Target-URI": "http://orgpatterns.wikispaces.com/VariationBehindInterface?responseToken=a070a41f53ac5201ebf40d03ea8cfb1d", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4ab8c2cf-e77c-4dd9-9e86-451add8e65f0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-30-77-150.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, 27, 28, 29, 30, 59, 60, 150, 151, 290, 291, 292, 298, 456, 457, 949, 950, 1193, 1411, 1412, 1524, 1525, 1920, 1921, 1932, 1933, 1989, 1990, 2280, 2281, 2481, 2482, 2746, 2747, 3047, 3048, 3049, 3055, 3056, 3599, 3600, 3677, 3678, 4021 ], "line_end_idx": [ 27, 28, 29, 30, 59, 60, 150, 151, 290, 291, 292, 298, 456, 457, 949, 950, 1193, 1411, 1412, 1524, 1525, 1920, 1921, 1932, 1933, 1989, 1990, 2280, 2281, 2481, 2482, 2746, 2747, 3047, 3048, 3049, 3055, 3056, 3599, 3600, 3677, 3678, 4021, 4093 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4093, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4799482524394989, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.002587320050224662, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1319534331560135, "rps_doc_frac_unique_words": 0.44658753275871277, "rps_doc_mean_word_length": 4.903560638427734, "rps_doc_num_sentences": 43, "rps_doc_symbol_to_word_ratio": 0.001293660025112331, "rps_doc_unigram_entropy": 5.186733722686768, "rps_doc_word_count": 674, "rps_doc_frac_chars_dupe_10grams": 0.027231469750404358, "rps_doc_frac_chars_dupe_5grams": 0.07352495938539505, "rps_doc_frac_chars_dupe_6grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_7grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_8grams": 0.045385781675577164, "rps_doc_frac_chars_dupe_9grams": 0.027231469750404358, "rps_doc_frac_chars_top_2gram": 0.016338879242539406, "rps_doc_frac_chars_top_3gram": 0.015128590166568756, "rps_doc_frac_chars_top_4gram": 0.013615730218589306, "rps_doc_books_importance": -329.40838623046875, "rps_doc_books_importance_length_correction": -329.40838623046875, "rps_doc_openwebtext_importance": -163.51341247558594, "rps_doc_openwebtext_importance_length_correction": -163.51341247558594, "rps_doc_wikipedia_importance": -129.97755432128906, "rps_doc_wikipedia_importance_length_correction": -129.97755432128906 }, "fasttext": { "dclm": 0.03521484136581421, "english": 0.9552314281463623, "fineweb_edu_approx": 2.6136250495910645, "eai_general_math": 0.9405739903450012, "eai_open_web_math": 0.3382189869880676, "eai_web_code": 0.886624276638031 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-7,650,828,537,893,233,000

WorkingTipsOnv2ray TurnToJPG --> Client Install v2rayA client on archlinux, then yay xray, uninstall all v2ray related. Refers to https://v2raya.org/docs/manual/use-other-core/ Changes to xray-core Server Install acme: # curl https://get.acme.sh | sh Generate the certification: acme.sh --issue --server letsencrypt --test -d www.fuckgfwmother.cn -w /root/blog/html --keylength ec-256 acme.sh --set-default-ca --server letsencrypt acme.sh --issue -d www.fuckgfwmother.cn -w /root/blog/html --keylength ec-256 --force Then copy the cerfitication to /etc/xray: # cp /root/.acme.sh/www.fuckgfwmother.cn_ecc/fullchain.cer /etc/xray/chain.crt # cp /root/.acme.sh/www.fuckgfwmother.cn_ecc/www.fuckgfwmother.cn.key /etc/xray/key.key Edit the config.json under the folder /etc/xray, then start the docker instance via: $ docker run -d -p 443:443 --name xray --restart=always -v /etc/xray:/etc/xray teddysun/xray Configuration Via: /images/2022_06_14_08_31_50_496x768.jpg Now start via sudo v2raya, then you could use the proxy.

{ "url": "https://purplepalmdash.github.io/blog/2022/06/14/workingtipsonv2ray/", "source_domain": "purplepalmdash.github.io", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "7364", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:IEKV7Q6JYWOUCS7H5IMZHHCFFNXGHWUI", "WARC-Concurrent-To": "<urn:uuid:d438e350-e1f2-4600-b19b-6f786269ed69>", "WARC-Date": "2022-11-28T09:36:22Z", "WARC-IP-Address": "185.199.108.153", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:TXHRDWOI3S5ZI27CDRURHJ2IFZ4GCJPW", "WARC-Record-ID": "<urn:uuid:748c68a2-7053-4785-86d1-a17c5c203222>", "WARC-Target-URI": "https://purplepalmdash.github.io/blog/2022/06/14/workingtipsonv2ray/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:014f14a2-95ab-4905-9a95-ebc49042d6d1>" }, "warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-73\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 19, 20, 34, 35, 36, 43, 44, 124, 125, 203, 204, 211, 212, 226, 227, 260, 261, 289, 290, 396, 442, 528, 529, 571, 572, 651, 739, 740, 825, 826, 919, 920, 934, 935, 940, 941, 981, 982 ], "line_end_idx": [ 19, 20, 34, 35, 36, 43, 44, 124, 125, 203, 204, 211, 212, 226, 227, 260, 261, 289, 290, 396, 442, 528, 529, 571, 572, 651, 739, 740, 825, 826, 919, 920, 934, 935, 940, 941, 981, 982, 1038 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1038, "ccnet_original_nlines": 38, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.14179104566574097, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.40671640634536743, "rps_doc_frac_unique_words": 0.682692289352417, "rps_doc_mean_word_length": 7.471153736114502, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.011194029822945595, "rps_doc_unigram_entropy": 4.129301071166992, "rps_doc_word_count": 104, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.11840412020683289, "rps_doc_frac_chars_dupe_6grams": 0.11840412020683289, "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.028314029797911644, "rps_doc_frac_chars_top_3gram": 0.05148005113005638, "rps_doc_frac_chars_top_4gram": 0.08236808329820633, "rps_doc_books_importance": -112.58706665039062, "rps_doc_books_importance_length_correction": -112.58706665039062, "rps_doc_openwebtext_importance": -90.21940612792969, "rps_doc_openwebtext_importance_length_correction": -77.03289794921875, "rps_doc_wikipedia_importance": -60.38974380493164, "rps_doc_wikipedia_importance_length_correction": -60.38974380493164 }, "fasttext": { "dclm": 0.2698798179626465, "english": 0.2708989679813385, "fineweb_edu_approx": 1.2995874881744385, "eai_general_math": 0.35014665126800537, "eai_open_web_math": 0.03989630937576294, "eai_web_code": 0.4556511640548706 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-337,344,810,988,406,000

Use this tag for questions about differential and integral calculus with more than one independent variable. Some related tags are (differential-geometry), (real-analysis), and (differential-equations). learn more… | top users | synonyms 4 votes 0answers 107 views closed form is exact in euclidean space Question is to show that $d(f)=0$ for a $0$ form on $\mathbb{R}^n$ then $f$ is a constant function. See that $$0=df=\sum_i\frac{\partial f}{\partial x_i}dx_i$$ implies that $\frac{\partial ... 2 votes 1answer 14 views Tangent space of manifold has two unit vectors orthogonal to tangent space of its boundary I'm reading spivak calculus on manifolds and got stuck. Let M be a k-dimensional manifold with boundary in $\mathbb{R^{n}}$, and $M_{x}$ is the tangent space of M at x with dimension k, then $\partial ... 1 vote 1answer 33 views How to interpret a mapping in $\mathbb{R}^{2}$ So I am trying to find the image of the circle $(x-1)^{2} + y^{2} = 1$ under the mapping $F$ defined by $$(u,v) = F(x,y) = \bigg(\frac{1}{2}(x+y), \frac{1}{2}(-x+y)\bigg)$$ Using computational ... 1 vote 2answers 51 views Notation in Vector calculus, Stokes' theorem I have a question regarding Stokes' theorem: $$\oint_c \vec{F} \, d\vec{r} = \iint_S \nabla \times \vec F({r}(u,v)) \cdot d\vec S = \iint_S \nabla \times \vec F({r}(u,v)) \cdot (r_u \times r_v)\, ... 2 votes 2answers 36 views How to find cartesian coordinate of velocity of particle on the trajectory, $Ax^2 +2Bxy +Cy^2=1, A,B,C >0.$ Consider a particle with constant speed $|w|=w_o$ moving on trajectory $Ax^2 +2Bxy +Cy^2=1, A,B,C >0.$ Could anyone advise me how to express cartesian coordinates of $v$ in terms of $x$ and $y \ ?$ ... 1 vote 1answer 23 views Counter Example Problem ( Two variable function ). In the given situation we show that , either the statement is true or we find a counter example to prove it wrong , If $\lim_{y \to 0} f(0,y)=0$ , then , $\lim_{(x,y) \to (0,0)} f(x,y)=0$ I ... 1 vote 2answers 23 views Limits (Three Variable function). We're given : $f(x,y,z) = \dfrac{xyz}{x^{2}+y^{2}+z^{2}}$ , Also , it's given that $\lim_{(x,y,z) \to (0,0,0)} f(x,y,z)$ exists. We need to prove that $\lim_{(x,y,z) \to (0,0,0)} f(x,y,z) = 0$. ... 0 votes 0answers 24 views Finding Limits of Integration: Developing Intution I am having trouble finding limits of integration in Multivariable Calculus. My question is that is there a way to find these bounds without graphing. I'm just not able to understand how to find these ... 1 vote 1answer 37 views Extending a smooth function of constant rank Let's denote $\mathbb{H}^m = \{(x_1, \ldots, x_m) \in \mathbb{R}^m\ |\ x_m \geq 0\}$. For an open subset $U \subset \mathbb{H}^m$, a function $f : U \to \mathbb{R}^n$ is called smooth if it can be ... 1 vote 1answer 30 views Integration By Parts on a Fourier Transform I'm having trouble with the "An integration by parts in $x$ for the first summand...and the assumption that $\phi$ goes to $0$ as $|x|\to\infty$." I tried the integration by parts but ended up with ... 5 votes 0answers 51 views Continuity ( Functions of 2 variables ). Given , $$ f(x,y) = \begin{cases} \dfrac{xy^{3}}{x^{2}+y^{6}} & (x,y)\neq(0,0) \\ 0 & (x,y)=(0,0) \\ \end{cases} $$ We need to check whether the function is continuous at ... 2 votes 1answer 38 views Non linear system of differential equations Is there a specific name to the following type of non linear ODEs $\begin{array}{c} \dot{x}_1 &= c_1 \, x_2\, x_3 \\ \dot{x}_2 &= \, c_2 x_1 x_3 \\ \dot{x}_3 &= c_3 \, x_2 x_1 ... 4 votes 2answers 170 views Minimum of an apparently harmless function of two variables I would like to prove that the minimum of the function $$ f(x,y):=\frac{(1-\cos(\pi x))(1-\cos (\pi y))\sqrt{x^2+y^2}}{x^2 y^2 \sqrt{(1-\cos(\pi x))(2+\cos(\pi y))+(2+\cos(\pi x))(1-\cos(\pi y))}} $$ ... 2 votes 1answer 27 views Finding the net outward flux of a sphere Use the Divergence Theorem to compute the net outward flux of: $$ F = \langle x^2, y^2, z^2 \rangle $$ $S$ is the sphere: $$ \{(x,y,z): x^2 + y^2 + z^2 = 25\} $$ First, I took: $$ \nabla \cdot F ... 0 votes 1answer 30 views How do you go about solving partial differential equations for finding critical points in general optimization problems? I was reading about partial second derivative test for optimization problems and I came across the example here. I saw the equations have yielded four critical points, but I wasn't able to find those ... 0 votes 0answers 53 views Partial derivative of recursive exponential $f(x) = \sum^{K_2}_{k_2=1}c_{k_2} \exp(-z^{(2)}_{k2})$ with respect to the deepest parameter I was trying to take the derivative of the following equation (which can be depicted nicely in a tree like structure, look at the end of question for diagram): $$f(x) = f([x_1, ..., x_{N_p}])= ... 0 votes 2answers 28 views Is the funtion $f(x,y)=\frac {x^2y^2}{x^2y^2 + (y-x)^2}$ when $(x,y)\neq (0,0)$ and $f((0,0))=0$ continuous at $(0,0)$ and is this differentiable? Is the function $$f(x,y)=\begin{cases}\frac {x^2y^2}{x^2y^2 + (y-x)^2} & \text{ , when } (x,y)\not=(0,0)\\0&\text{ , when }(x,y)=(0,0)\end{cases}$$ continuous at $(0,0)$ is this ... 0 votes 1answer 34 views Conditions on a linear system of ODEs Let $x:[0,T]\to\mathbb{R}^n$ and $y:[0,T]\to\mathbb{R}^n$ be solutions to an $n\times n$ system of linear ODEs. That is, $$\frac{dx}{dt}=A(t)x+b(t) \mbox{ and } \frac{dy}{dt}=A(t)y+b(t) \mbox{ for } ... 1 vote 1answer 64 views Finding $\iint_S {z \:ds}$ for some $S$ $$\iint_S {z \:ds}$$ In this double integral above, $S$ is the part of a sphere, $x^2+y^2+z^2=1$, which lies above the cone, $z=\sqrt{x^2+y^2}$. How can I calculate the above double integral. Can ... 3 votes 1answer 68 views Using Stokes' Theorem Finding $\int_C{F\bullet dr}$ Suppose that $C$ is the intersection of $z=2x+5y$ and $x^2+y^2=1$ which is oriented counterclockwise when viewed from above. Now let $$F=\langle \sin{x}+y, \sin{y}+z, \sin{z}+x \rangle$$ How can I ... 0 votes 1answer 52 views Proper definition use in Stoke's theorem Let the curve C be a piecewise smooth and simple closed curve enclosing a region, D. Some sources asserts Stoke's theorem to be: $$\oint_{C} F.dr = \iint_{R}\nabla \times FdS$$ Whereas, some claims ... 1 vote 3answers 60 views How to sketch a surface in a three-dimensional space? I was asked to hand sketch the surface defined by $$x^2+y^2-z^2=1$$ How could I do that? I find it particularly hard to draw graph in three-dimension, could you give me some advice? 0 votes 1answer 38 views differential forms question. [closed] Let $ f: \mathbb{R^3} \to \mathbb{R}$ be the function $f(x, y, z) = x^2 + y^2 + z^2$ and let $F : \mathbb{R^2} \to \mathbb{R^3}$ be the map $$F(u,v)= \big( ... 0 votes 1answer 43 views Differentiability of $\frac{x^2y^2}{x^2+y^4}$ at $(0,0)$ [closed] Given function, $f$ defined: $f(x,y)=\frac{x^2y^2}{x^2+y^4}$ if $(x,y)\ne (0,0)$ and $f(0,0)=0$ Prove that $f(x,y)$ is not differentiable at $(0,0).$ 1 vote 0answers 64 views Path continuous but not continuous [closed] Find an example of function $f : \mathbb{R}^2 \to \mathbb{R}$ such that $f$ is continuous along every path but $f$ is not continuous. 0 votes 1answer 21 views Finding the derivative of a multivariable function Suppose $f: \mathbb{R}^n \to \mathbb{R}$ is a differentiable function. Then we can write the derivative of $f$ as a $1 \times n$ row matrix of partial derivatives of $f$ ,i,e, ... 1 vote 2answers 66 views how to differentiate $y(x) =exp(ax)$ twice I'm quite confused with this differentiation: Suppose $x$ is a $m \times 1$ column vector, $a$ is a $1 \times m$ vector, I want to differentiate $\exp(ax)$ a few times. I think the first derivative ... 2 votes 2answers 46 views does simply connectedness require connectedness? My question consists of two parts. $1)$ suppose domain $D=\{(x,y)\in\mathbb R^2~|~xy>0\}$ is given. Now that is first quadrant and third quadrant with exclusion of $x$ and $y$ axis. We can easily ... 0 votes 1answer 19 views Relationship between two variables with min and max value (please read inside) [closed] Hi and sorry for the bad title. I do some programming for games and often run into the following practical problem: I have two values that run within certain limits, let's call them xMin, xMax, yMin ... 1 vote 1answer 23 views $F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$ [duplicate] Given that: $$F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$$ in which $a$ is some constant. Now, for what $a$ would make the vector field of $F$ conservative? How can we find an $f$ with $\nabla ... 0 votes 0answers 23 views How to find out if point is local Maximizer or local Minimizer ? Lagrangian is given The Lagrangian is: $L(x,\lambda) = x_1x_2-2x_1-\lambda (x_1^2-x_2^2)$ Taking the derivatives and setting it equal to zero gives: $x_2-2\lambda x_1-2=0$ $x_1+2\lambda x_2=0$ $x_1^2-x_2^2=0$ The ... 0 votes 4answers 49 views Length of Spiral in a plane [closed] Problem Take a positive constant real number $c$. Draw a rough sketch and find the length of the spiral in the plane given by $(x(t),y(t))=(e^{-ct}\cos(t),e^{-ct}\sin(t))$ for $0\leq t<\infty$. ... 0 votes 2answers 142 views Math Subject GRE 1268 Problem 64 Flux of Vector Field What is the value of the flux of the vector field F, defined on $R^3$ by $F(x,y,z) = (x,y,z)$ through the surface $z=\sqrt{1-x^2-y^2}$ oriented with upward-pointing normal vector field? ... 2 votes 5answers 42 views Finding a general solution to a differential equation, using the integration factor method Use the method of integrating factor to solve the linear ODE $$ y' + 2xy = e^{−x^2}.$$ And verify your answer I can solve the ODE as a linear equation (mulitply both sides, subsititute, reverse ... 1 vote 1answer 51 views Multivariable Calculus: Manifolds Problem Let $M$ be the set of all points $(x,y) \in \mathbb{R}^2$ satisfying the equation $$xy^3 + \frac{x^4}{4} + \frac{y^4}{4} = 1 $$ Prove that $M$ is a manifold. What is the dimension of $M$? ... 1 vote 1answer 43 views Good reference on higher dimensional derivatives? I've spent several months now periodically scouring the internet for a comprehensive overview of an introduction to higher dimensional derivatives. I've already read baby Rudin's section on the ... 1 vote 1answer 39 views Surface integral on unit circle Let $S$ be the unit sphere in $\mathbb{R}^3$ and write $F(x)=\nabla V(x)$ where $V(x)=1/|x|$ Evaluate $$\iint_S F\cdot n dS$$ Without using divergence theorem, we can evaluate it straightforwardly, ... 2 votes 1answer 25 views Let $f$ be differentiable at every point of some open ball $B(a)$ in $\mathbb R^n$ and $f(x)\le f(a) , \forall x \in B(a)$ , then prove $D_k f(a)=0$. If $f:\mathbb R^n \to \mathbb R$ is a function differentiable at every point of some open ball $B(a)$ with center $a\in \mathbb R^n$ and $f(x)\le f(a) , \forall x \in B(a)$ , then how to show that all ... 0 votes 2answers 19 views $f'(x;y)=0$ for every $x$ in an open convex set and for every vector $y$ ; then to show $f$ is constant on $S$ Let $f:\mathbb R^n \to \mathbb R$ be a map , $S$ be an open convex set in $\mathbb R^n$ such that for every $x \in S$ and $y \in \mathbb R^n$ , $f'(x;y)$ exists and equals $0$ ; then how to show that ... 1 vote 3answers 55 views Substitution to solve an initial value problem By using the substitution $y(x) = v(x)x$, how can I solve the initial value problem $$ \frac{dy}{dx} = \frac{x^2+y^2}{xy - x^2},\quad y(1)=1 $$ And also keep my answer in the form $g(x,y)= 4e^{-1} ... 1 vote 1answer 32 views Diffeomorphism between Euclidean space How does one show that if $f:U\rightarrow V$ is a diffeomorphism between open sets $U\subset\mathbb{R}^m$ and $V\subset\mathbb{R}^n$ then $m=n$? Here is some working: For $u\in U$ let $v=f(u)\in V$. ... 1 vote 0answers 37 views Application of Stoke's Theorem Edit: I think I misunderstood the problem. Upon reading my textbook again, I think what they mean by $F(x,y,z)=<yz,2xz,e^{xy}>$ ; C is the circle $x^2+y^2=16, z=5$ is just literally a ... 0 votes 1answer 36 views Stokes' Theorem - The normal vector Stokes' theorem says: $$\oint_cFdr = \int\int_S curl F dS = \int\int_S curl F \cdot n \, dS$$ Where $F$ is a vector field on $\mathbb{R}^3$. My question is what do I take $n$ to be? If we ... 1 vote 1answer 45 views Absolute Min and Max of $f(x, y)=x^2+4y^2-2x^2y+4$ Using Partial Derivatives Consider this problem: Find the absolute minimum and absolute maximum of $f(x, y)=x^2+4y^2-2x^2y+4$ on the rectangle given by $-1\leq x\leq1$ and $-1\leq y\leq1$ I solved this problem using ... 0 votes 2answers 42 views If a vector field is conservative then is it path independent? I am studying vector calculus and I am having trouble with the idea of path independence. Is it necessarily true that if $F=(P,Q)$ (a vector field in $\Bbb R^2$) is conservative, then $\oint \limits ... 2 votes 2answers 92 views Vector Field Conceptual Question Given that: $$F = \langle yz-2xy^2, axz-2x^2y+z, xy+y \rangle$$ in which $a$ is some constant. Now, for what $a$ would make the vector field of $F$ conservative? Why is there only one, or are there ... 1 vote 0answers 47 views Under what conditions is this true: $\lim_{r \to 0} \frac{1}{r} \int_{0}^{2\pi} f(r,x) dx = 2\pi f(0,0)$ I will like to know under what hypothesis the following is true, and maybe a sketch of the proof. I saw it in a solution of an exercise. In this exercise, $f$ was harmonic, but I don't know if that is ... 1 vote 2answers 84 views Evaluating Line Integrals using Green's Theorem I am currently learning about Green's Theorem, Curl and Divergence, and I came across a problem: Given a two dimensional vector field: $$ F=\langle e^{\sin{x}}+y^2, x^2+y^2 \rangle$$ And then I am ... 1 vote 1answer 26 views Does given point satisfy FONC? minimize $4x_1^2+2x_2^2-4x_1x_2-8x_2$ subject to $x_1+x_2\leq 4$ Does the point $(2,2)$ satisfy the FONC for a local minimizer? The gradient of the objective function is $\nabla f = ... 1 vote 2answers 17 views Div$f$ is invariant under an orthogonal change of coordinates Let $f: \mathbb{R^n} \to \mathbb{R^n}$ and $Df$ exists. I need to show that div$f$ is invariant under an orthogonal change of coordinates. Let $T:\mathbb{R^n} \to \mathbb{R^n}$ be an orthogonal ...

{ "url": "http://math.stackexchange.com/questions/tagged/multivariable-calculus?page=5&sort=newest&pagesize=15", "source_domain": "math.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2015-35", "warc_metadata": { "Content-Length": "173178", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UFD7LOYLUT6SMBETWR7V7FKTUXY5U6GC", "WARC-Concurrent-To": "<urn:uuid:c0c71170-48c4-4066-9422-e16604d7e1a3>", "WARC-Date": "2015-08-31T05:23:03Z", "WARC-IP-Address": "104.16.15.128", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:BPAYP6CZIOBGXNQTTI2YNTN27SYFKAOD", "WARC-Record-ID": "<urn:uuid:9dd56737-02ab-4ffb-a4cd-b12590df88fd>", "WARC-Target-URI": "http://math.stackexchange.com/questions/tagged/multivariable-calculus?page=5&sort=newest&pagesize=15", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f6752957-81c3-4c0a-8567-add102b30452>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 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, 203, 204, 239, 240, 242, 248, 257, 267, 268, 308, 309, 502, 504, 510, 518, 527, 528, 619, 620, 825, 827, 832, 840, 849, 850, 897, 898, 1095, 1097, 1102, 1111, 1120, 1121, 1166, 1167, 1367, 1369, 1375, 1384, 1393, 1394, 1502, 1503, 1705, 1707, 1712, 1720, 1729, 1730, 1781, 1782, 1976, 1978, 1983, 1992, 2001, 2002, 2036, 2037, 2235, 2237, 2243, 2252, 2261, 2262, 2313, 2314, 2519, 2521, 2526, 2534, 2543, 2544, 2589, 2590, 2791, 2793, 2798, 2806, 2815, 2816, 2860, 2861, 3063, 3065, 3071, 3080, 3089, 3090, 3131, 3132, 3307, 3309, 3315, 3323, 3332, 3333, 3377, 3378, 3558, 3560, 3566, 3575, 3585, 3586, 3646, 3647, 3851, 3853, 3859, 3867, 3876, 3877, 3918, 3919, 4118, 4120, 4126, 4134, 4143, 4144, 4265, 4266, 4470, 4472, 4478, 4487, 4496, 4497, 4634, 4635, 4832, 4834, 4840, 4849, 4858, 4859, 5006, 5007, 5189, 5191, 5197, 5205, 5214, 5215, 5253, 5254, 5457, 5459, 5464, 5472, 5481, 5482, 5522, 5523, 5723, 5725, 5731, 5739, 5748, 5749, 5801, 5802, 6003, 6005, 6011, 6019, 6028, 6029, 6070, 6071, 6273, 6275, 6280, 6289, 6298, 6299, 6353, 6354, 6536, 6538, 6544, 6552, 6561, 6562, 6600, 6601, 6761, 6763, 6769, 6777, 6786, 6787, 6853, 6854, 7004, 7006, 7011, 7020, 7029, 7030, 7074, 7075, 7209, 7211, 7217, 7225, 7234, 7235, 7286, 7287, 7467, 7469, 7474, 7483, 7492, 7493, 7536, 7537, 7739, 7741, 7747, 7756, 7765, 7766, 7815, 7816, 8016, 8018, 8024, 8032, 8041, 8042, 8130, 8131, 8334, 8336, 8341, 8349, 8358, 8359, 8421, 8422, 8624, 8626, 8632, 8641, 8650, 8651, 8736, 8737, 8934, 8936, 8942, 8951, 8960, 8961, 8998, 8999, 9197, 9199, 9205, 9214, 9224, 9225, 9279, 9280, 9470, 9472, 9478, 9487, 9496, 9497, 9588, 9589, 9787, 9789, 9794, 9802, 9811, 9812, 9846, 9847, 10047, 10049, 10054, 10062, 10071, 10072, 10122, 10123, 10321, 10323, 10328, 10336, 10345, 10346, 10378, 10379, 10581, 10583, 10589, 10597, 10606, 10607, 10757, 10758, 10963, 10965, 10971, 10980, 10989, 10990, 11101, 11102, 11306, 11308, 11313, 11322, 11331, 11332, 11379, 11380, 11581, 11583, 11588, 11596, 11605, 11606, 11645, 11646, 11849, 11851, 11856, 11865, 11874, 11875, 11906, 11907, 12095, 12097, 12103, 12111, 12120, 12121, 12157, 12158, 12350, 12352, 12357, 12365, 12374, 12375, 12452, 12453, 12647, 12649, 12655, 12664, 12673, 12674, 12737, 12738, 12941, 12943, 12949, 12958, 12967, 12968, 13001, 13002, 13204, 13206, 13211, 13220, 13229, 13230, 13335, 13336, 13541, 13543, 13548, 13557, 13566, 13567, 13615, 13616, 13817, 13819, 13824, 13832, 13841, 13842, 13873, 13874, 14060, 14062, 14067, 14076, 14085, 14086, 14148, 14149 ], "line_end_idx": [ 203, 204, 239, 240, 242, 248, 257, 267, 268, 308, 309, 502, 504, 510, 518, 527, 528, 619, 620, 825, 827, 832, 840, 849, 850, 897, 898, 1095, 1097, 1102, 1111, 1120, 1121, 1166, 1167, 1367, 1369, 1375, 1384, 1393, 1394, 1502, 1503, 1705, 1707, 1712, 1720, 1729, 1730, 1781, 1782, 1976, 1978, 1983, 1992, 2001, 2002, 2036, 2037, 2235, 2237, 2243, 2252, 2261, 2262, 2313, 2314, 2519, 2521, 2526, 2534, 2543, 2544, 2589, 2590, 2791, 2793, 2798, 2806, 2815, 2816, 2860, 2861, 3063, 3065, 3071, 3080, 3089, 3090, 3131, 3132, 3307, 3309, 3315, 3323, 3332, 3333, 3377, 3378, 3558, 3560, 3566, 3575, 3585, 3586, 3646, 3647, 3851, 3853, 3859, 3867, 3876, 3877, 3918, 3919, 4118, 4120, 4126, 4134, 4143, 4144, 4265, 4266, 4470, 4472, 4478, 4487, 4496, 4497, 4634, 4635, 4832, 4834, 4840, 4849, 4858, 4859, 5006, 5007, 5189, 5191, 5197, 5205, 5214, 5215, 5253, 5254, 5457, 5459, 5464, 5472, 5481, 5482, 5522, 5523, 5723, 5725, 5731, 5739, 5748, 5749, 5801, 5802, 6003, 6005, 6011, 6019, 6028, 6029, 6070, 6071, 6273, 6275, 6280, 6289, 6298, 6299, 6353, 6354, 6536, 6538, 6544, 6552, 6561, 6562, 6600, 6601, 6761, 6763, 6769, 6777, 6786, 6787, 6853, 6854, 7004, 7006, 7011, 7020, 7029, 7030, 7074, 7075, 7209, 7211, 7217, 7225, 7234, 7235, 7286, 7287, 7467, 7469, 7474, 7483, 7492, 7493, 7536, 7537, 7739, 7741, 7747, 7756, 7765, 7766, 7815, 7816, 8016, 8018, 8024, 8032, 8041, 8042, 8130, 8131, 8334, 8336, 8341, 8349, 8358, 8359, 8421, 8422, 8624, 8626, 8632, 8641, 8650, 8651, 8736, 8737, 8934, 8936, 8942, 8951, 8960, 8961, 8998, 8999, 9197, 9199, 9205, 9214, 9224, 9225, 9279, 9280, 9470, 9472, 9478, 9487, 9496, 9497, 9588, 9589, 9787, 9789, 9794, 9802, 9811, 9812, 9846, 9847, 10047, 10049, 10054, 10062, 10071, 10072, 10122, 10123, 10321, 10323, 10328, 10336, 10345, 10346, 10378, 10379, 10581, 10583, 10589, 10597, 10606, 10607, 10757, 10758, 10963, 10965, 10971, 10980, 10989, 10990, 11101, 11102, 11306, 11308, 11313, 11322, 11331, 11332, 11379, 11380, 11581, 11583, 11588, 11596, 11605, 11606, 11645, 11646, 11849, 11851, 11856, 11865, 11874, 11875, 11906, 11907, 12095, 12097, 12103, 12111, 12120, 12121, 12157, 12158, 12350, 12352, 12357, 12365, 12374, 12375, 12452, 12453, 12647, 12649, 12655, 12664, 12673, 12674, 12737, 12738, 12941, 12943, 12949, 12958, 12967, 12968, 13001, 13002, 13204, 13206, 13211, 13220, 13229, 13230, 13335, 13336, 13541, 13543, 13548, 13557, 13566, 13567, 13615, 13616, 13817, 13819, 13824, 13832, 13841, 13842, 13873, 13874, 14060, 14062, 14067, 14076, 14085, 14086, 14148, 14149, 14346 ] }

{ "red_pajama_v2": { "ccnet_original_length": 14346, "ccnet_original_nlines": 403, "rps_doc_curly_bracket": 0.01721733994781971, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.26853179931640625, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.038737449795007706, "rps_doc_frac_lines_end_with_ellipsis": 0.1163366287946701, "rps_doc_frac_no_alph_words": 0.4117647111415863, "rps_doc_frac_unique_words": 0.3246336877346039, "rps_doc_mean_word_length": 4.538461685180664, "rps_doc_num_sentences": 108, "rps_doc_symbol_to_word_ratio": 0.01195599976927042, "rps_doc_unigram_entropy": 5.7539191246032715, "rps_doc_word_count": 2184, "rps_doc_frac_chars_dupe_10grams": 0.03954802080988884, "rps_doc_frac_chars_dupe_5grams": 0.07949960231781006, "rps_doc_frac_chars_dupe_6grams": 0.061339788138866425, "rps_doc_frac_chars_dupe_7grams": 0.04802260175347328, "rps_doc_frac_chars_dupe_8grams": 0.04802260175347328, "rps_doc_frac_chars_dupe_9grams": 0.04802260175347328, "rps_doc_frac_chars_top_2gram": 0.011097660288214684, "rps_doc_frac_chars_top_3gram": 0.014527849853038788, "rps_doc_frac_chars_top_4gram": 0.006355930119752884, "rps_doc_books_importance": -1225.1988525390625, "rps_doc_books_importance_length_correction": -1225.1988525390625, "rps_doc_openwebtext_importance": -599.1793212890625, "rps_doc_openwebtext_importance_length_correction": -599.1793212890625, "rps_doc_wikipedia_importance": -567.980224609375, "rps_doc_wikipedia_importance_length_correction": -567.980224609375 }, "fasttext": { "dclm": 0.7439944744110107, "english": 0.832928478717804, "fineweb_edu_approx": 1.885359287261963, "eai_general_math": 0.9823523163795471, "eai_open_web_math": 0.976479709148407, "eai_web_code": 0.018592240288853645 } }

{ "free_decimal_correspondence": { "primary": { "code": "515.35", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Calculus and Mathematical analysis" } }, "secondary": { "code": "515.3", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Calculus and Mathematical analysis" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-355,111,608,175,393,000

The Junk Factory Navi's Personal Blog Arch, Debian, Suckless and wrapping up the Linux experience tony If you want to read the spanish version visit the following link After spending some time tinkering with a second-hand ThinkPad T480 that I ended up buying in a remote corner of the city where I live, I’ve been trying out different Linux distributions and desktop environments, but overall I’ll focus on two distributions that in my opinion are the most important: Debian and Arch. In addition to this, I wanted to try out a new Tiling Window Manager that had also caught my attention, as well as a set of software that embodies an interesting philosophy: Suckless. Some experiences with Arch and Debian To start with the distributions, Debian is incredibly simple to get started with, the installation is approachable, and I must admit that I like that it is (or pretends to be) 100% free software. Furthermore, once you go through the installation process, the desktop you choose just works, no surprises, it’s rock solid, and of course, you don’t expect much on the horizon regarding updates. In fact, every time I did an apt update, everything was simply up to date. So it’s a rather boring distribution if you want to be constantly surprised with new things, but for me, this is quite positive, as it maintains certainty in the system, you know it won’t fail unless you do something stupid. Regarding the software you install, obviously this is where you notice the gap, since Debian is quite conservative when it comes to bringing software into its main repository and therefore it’s not uncommon to have software versions that may be 10 or 12 months behind the current development version. This may not be a big problem, but each software has a different development speed, and in a year you can have significant differences. Also, if you’ve been carrying more updated versions of programs that have some kind of config file, that can be a problem. An example where I noticed this was when I wanted to install Alacritty and port my .toml file with my configurations, when using it, I realized that the changes weren’t applied. The reason was that the version of Alacritty that comes from Debian’s apt was an old version that used .yml files, so I had to 1) adapt my configuration files to this version, which for this case wasn’t complicated, or 2) compile from source. Compiling from source isn’t a bad approach, however, it means that you’re at the mercy of your package manager taking care of future updates, and obviously that can represent a risk. An important issue with a system like Linux is that you have your software updated and operating harmoniously with your operating system. Of course, there’s nothing wrong with compiling from source, I’ve done it with some software, but it’s important to note that it’s not the most desirable. However, a positive aspect to recognize is that Debian has a vast repository, which reduces the chances of having to resort to installing from source code. On the other hand, I’m now using Arch (btw) so I’m still in a process of experimentation with this variant. Arch is different in its installation process, although now there’s a script that simplifies the process, the manual installation is in the terminal by typing commands and where you have to follow the instructions from the wiki, it’s not that difficult, but obviously it’s more likely that you can make a mistake along the way and therefore mess up, in fact, I messed up a couple of times because I didn’t configure the Nvidia driver properly and therefore my system failed, so I had to start the process again. If you want up-to-date software, this is the distribution and even if you want to access proprietary software, Arch has no problems, it’s a distribution agnostic and therefore has a laissez-faire mentality towards users, I can run the analog of apt update which in this case is Pacman -Syu every day and there may be new updates. Obviously with software like Alacritty or Neovim I didn’t have to resort to compiling it from source because Arch itself provides recent updates which is also a pleasure not to have to directly intervene with the code, another thing is that in addition to the base repository, Arch has the AUR which is another repository where the community can upload software and of course that allows your possibilities to expand, however in my experience, it’s in the AUR where you have more chances of software failure. Here are some other examples of software that allowed me to compare distributions. As I like to watch anime, I wanted to install ani-cli which is an application to watch content from the terminal (you have to thank that the hacker community is quite otaku), unfortunately, this software in Debian is not considered in its main repository yet and will apparently be added in version 13, so one option was to compile it, but I finally gave up on it. On the other hand, with Arch there was no problem, the repo was in AUR so the installation was quite simple. The second case was Anki, a flashcard application, which I like and have used a lot to learn languages so I thought about installing it on my pc as well (although the Android app is quite good to be honest), unfortunately Anki is a mess, I went to the documentation and tried to install it following the instructions but had problems in the process, fortunately Debian has Anki in its main repository, so installing it with apt was the best option, on the other hand Arch had it in the AUR, however, I had problems with the installation so I didn’t continue with it. The third and last case was Librewolf, in this case Debian had no problems, by following the steps in the documentation the issue worked without problems, Arch had it in the AUR, and the installation process took quite some time and finally I had problems with that but the binary worked fine. As a side note, I must praise the Arch Linux Wiki, you may or may not like Arch, but I think no one can deny that its documentation is of a high level, it helped me to see a specific case where I wanted to see how to install the Japanese keyboard on it with the kanas specific to the writing of this language, I checked the documentation in Debian and Arch, finally the latter gave me clear instructions on how to configure it correctly, besides that on other occasions when I’ve had problems with something in Debian/Ubuntu/Fedora or even Arch itself the Wiki has been helpful. Finally, I want to highlight that both have the possibility of minimal installations, so if you have a laptop with hardware restrictions, I think there’s no problem with any of these variants for you to do a minimal installation and instead of using a bloated desktop environment, you can use a window manager that will be much lighter and more efficient in resources like Sway, i3, or dwm. Although I wrote about Sway in another post, now I want to focus on dwm and another set of software that belongs to suckless. Suckless: Software that suckless Suckless is a community of hackers who have built a set of software based on the concepts of minimalism, simplicity, and frugality, part of this decision you can read in their philosophy, but to try to get to the point, all the code is written in C, and there are no configuration files, if you want to install this, you download the code and compile it, if you want to make modifications to something, you go straight to the C source code and modify it and recompile it. The most important software (in my opinion) are: 1. st a terminal emulator 2. dwm the window manager 3. dmenu the dynamic menu that you can use to run your programs Something you have to notice is that this software has minimal features, for example, St doesn’t have a way to scroll, nor does it have a way to make your terminal transparent, if you want to achieve this, you have two options: the first is to write the code yourself, but if you’re like me and have no idea about C then accessing the patches that the community has created and improved over time is the option, so for example, to the terminal I can add transparency with alpha and a gruvbox color scheme. To dwm I can add patches to add gaps with useless gaps. all this just with the command patch -p1 < path/to/patch It should be noted that starting to add patches can lead to errors, so you will have to be the one to make the corresponding adjustments for the failures, and in some cases if you have several patches in mind, you have to consider that there is a more appropriate order to do it to reduce the potential number of errors. Obviously the idea is not that you go and take a collection of patches that you “like” and apply them, but that you be much more austere and select them according to a real need that arises, for example, I only applied useless gaps to dwm for a bit of aesthetics, but the truth is that dwm by itself has been fantastic, I haven’t had the intention of adding another patch for now, I haven’t needed to add scrolling to st, since I use tmux quite a bit, which serves that function as a substitute. So if you like to add things to your application just because, it’s possible but you’ll have to deal with debugging the errors that occur while adding the patches. Other software that I have been adding and that follows a similar philosophy: 1. nsxiv: To display images 2. scrot: screenshots 3. feh: set an image as background 4. cmus: music player 5. ly: minimal session manager. 6. mpv: Media player 7. slock: lock your system with a password. 8. xclip: X11 clipboard Among others… Obviously I have to point out that these exercises for a machine that isn’t really that old and has relatively decent hardware maybe is considered exaggereted, as an exercise it was worth it and it taught me a lot about minimal installations and how you can reach customization levels while keeping resource usage to a minimum and in fact I will continue using this configuration until I get bored, but if you’re not interested in that Gnome or KDE run quite well on a machine like this. Conclusions at the end Regarding Arch and Debian I don’t have a clear preference yet, both have their pros and cons, for now I’ll continue using Arch to continue evaluating how it goes. Although there are other distributions, even some more hardcore ones like Gentoo, for now my curiosity hasn’t reached that point yet. Suckless software is an interesting perspective, quite radical to market trends and for a niche taste, I can’t imagine many people wanting to get into this point, but for those who do, I’m sure it’s a good exercise to use something like dwm, inspect the C code, customize, add patches, etc. If you can do that, the idea of making your own software for a specific personal need may not be so far-fetched. I’ve also had a lot of fun with Linux over the past 4 months, it has taught me a lot about how an operating system works especially when I’ve wanted to go to slightly deeper levels and start eliminating the use of interfaces, I’m not going to call myself a “power user”, but certainly t here’s some knowledge that I value and I understand a bit more about those people who want to know more about their system and adjust it to their liking and have absolute control over it. If there’s anyone interested in knowing what my “learning path” was, which by the way was not planned at all it was just pure curiosity, I would describe it as follows: 1. Install free and open source software on your own machine, even if you’re on MacOS or Windows. Install and familiarize yourself with their basic uses and if you can include it in something you do daily even better. For example, Vim, Python, R, LibreOffice, etc. 2. Learn basic commands in a terminal: commands like cd, mv, rm, cp, ls. I use them constantly nowadays and I would recommend reading a bit about them and doing some tests to remove the fear of the black screen, then you can add new commands like curl, grep, sed, etc. 3. Install Ubuntu or another friendly distribution: I used Ubuntu at the time, there are people who criticize it currently for various reasons. But something that Ubuntu has is that its installation process was super friendly, a modern look, there’s plenty of documentation on the internet and it works well. Linux Mint seems like another good alternative to Ubuntu, but I don’t have experience with that distribution. This is for a start, later if you want to move to another distribution nothing will prevent you from doing it 4. Get familiar with the package manager: The first way to install software is from the terminal using your package manager, if you’re on Ubuntu or Mint you’ll have to use something like sudo apt update and then sudo apt install yoursoftware, there are other alternatives to install software but this should be your priority method. 5. Install software by compiling source code: Take a software that interests you, go to its documentation or the repository where it is and read about its installation process, probably besides the package manager it will have a space where it will give instructions on how to do it, follow those instructions. 6. Use a Tiling Window Manager: There are two major desktop environments in Linux GNOME and KDE, both have a lot of features and you can easily navigate in them, adjust brightness, connect to wifi, explore your folders with files, screenshots, etc. With a twm you won’t have any of that, and you’ll have to look up how to execute each of these commands, you need to connect your mouse via bluetooth, one possible solution is to install bluez and bluez utils, open the terminal and use the bluetoothctl command, there are also GUI options, but it will depend on you to find a way to execute it. Play with this and if you want try to do a ricing (configure your environment to look aesthetically attractive). 7. Create a remote server and run some programs on them: If you have an old laptop, or a raspberry pi, or rent a vps, you can try to create a remote server where you can host some programs, this is the path to another world that is self-hosting, I’m quite a newbie in this, but there are a couple of experiences that can teach you something, for example create a personal website and host it on your server, buy your domain and redirect it to your website. One thing I did for example was to get rid of Kindle and host my books in Calibre, so now I can access my personal library from my own server. With this you can learn a bit about connecting via ssh, nginx, dns, docker, etc. There are people who host a bunch of applications from a youtube frontend, emails, vpn, etc. There you can see for yourself what to do. 8. Install Arch Linux manually: If you installed Ubuntu before, you’ll notice that the process is quite simple in general, installing Arch is more complex, but it will teach you how to make an operating system from scratch, so you can understand what some of the base libraries are for, make the partitions manually, configure network, timezone, keyboard, decide between X11 or Wayland, etc. Try to use it for a period of time as your main machine and use it for everything you can. 9. Contribute to Linux: I plead guilty of not doing it yet, I suppose this is a note for the future… Anyway, it’s been an interesting journey and I think I’ll continue using Linux for my personal machines. I’ll probably continue to see some self-hosting things, but I think I’ve had enough with ricing and trying distributions, it’s time to move on to another topic. Articles from blogs I follow around the net The Reasonable Effectiveness of Using Old Phones as Servers I installed linux on a OnePlus6T. Setup took less than an hour, technical issues included. Why $90 for 8GB RAM, 128GB storage, 2.8GHz 8-core CPU Linux on the OnePlus 6T is well documented Low power consumption Tiny footprint No additional cables … via jarbus.net on March 16, 2024 Plotting data in Julia And so we come to the third post in my extremely ill-considered foray into learning Julia. In the first part of the series I taught myself some of the foundations for writing Julia code, in the second part I discussed data wrangling in Julia, and so in t… via Notes from a data witch March 2, 2024 Reproducible data science with Nix, part 10 -- contributing to nixpkgs I’ve very recently started contributing to the nixpkgs repository of packages, which contains all the packages you can install from the Nix package manager. My contributions are fairly modest: I help fix R packages that need some tweaking to make them succes… via Blogs on Econometrics and Free Software February 29, 2024 Generated by openring

{ "url": "https://indymnv.xyz/posts/2024_04_21_suckless/", "source_domain": "indymnv.xyz", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "24408", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2S3J7S2ZGXXQ6ZSPYPTONZC42ID2FLE3", "WARC-Concurrent-To": "<urn:uuid:3032eeca-289e-4ada-86fb-39b961d25732>", "WARC-Date": "2024-05-19T16:31:30Z", "WARC-IP-Address": "202.182.99.103", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3CL4G6RC7U7NJNQXEZZV3MSGUCUPLANU", "WARC-Record-ID": "<urn:uuid:cb216a67-a040-46d3-93fd-c1bc81b7ced8>", "WARC-Target-URI": "https://indymnv.xyz/posts/2024_04_21_suckless/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6ef06d3c-9ea2-43ce-ba8a-d3ad4db63e72>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-29\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, 17, 18, 39, 40, 41, 101, 102, 107, 108, 173, 174, 675, 676, 714, 715, 2388, 2389, 3021, 3022, 3642, 3643, 4482, 4483, 5901, 5902, 6481, 6482, 6999, 7000, 7033, 7034, 7555, 7556, 7584, 7612, 7678, 7679, 8272, 8273, 8299, 8300, 9281, 9282, 9360, 9361, 9391, 9415, 9452, 9476, 9510, 9533, 9579, 9605, 9606, 9620, 9621, 10109, 10110, 10133, 10134, 10431, 10432, 10836, 10837, 11481, 11482, 11749, 11750, 12021, 12022, 12553, 12554, 12889, 12890, 13203, 13204, 13913, 13914, 14733, 14734, 15219, 15220, 15323, 15324, 15590, 15591, 15635, 15636, 15696, 15697, 15945, 15946, 15979, 15980, 16003, 16004, 16260, 16261, 16303, 16304, 16375, 16376, 16636, 16637, 16699, 16700 ], "line_end_idx": [ 17, 18, 39, 40, 41, 101, 102, 107, 108, 173, 174, 675, 676, 714, 715, 2388, 2389, 3021, 3022, 3642, 3643, 4482, 4483, 5901, 5902, 6481, 6482, 6999, 7000, 7033, 7034, 7555, 7556, 7584, 7612, 7678, 7679, 8272, 8273, 8299, 8300, 9281, 9282, 9360, 9361, 9391, 9415, 9452, 9476, 9510, 9533, 9579, 9605, 9606, 9620, 9621, 10109, 10110, 10133, 10134, 10431, 10432, 10836, 10837, 11481, 11482, 11749, 11750, 12021, 12022, 12553, 12554, 12889, 12890, 13203, 13204, 13913, 13914, 14733, 14734, 15219, 15220, 15323, 15324, 15590, 15591, 15635, 15636, 15696, 15697, 15945, 15946, 15979, 15980, 16003, 16004, 16260, 16261, 16303, 16304, 16375, 16376, 16636, 16637, 16699, 16700, 16721 ] }

{ "red_pajama_v2": { "ccnet_original_length": 16721, "ccnet_original_nlines": 106, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4938022494316101, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.029115019366145134, "rps_doc_frac_lines_end_with_ellipsis": 0.04672896862030029, "rps_doc_frac_no_alph_words": 0.13635052740573883, "rps_doc_frac_unique_words": 0.2911306619644165, "rps_doc_mean_word_length": 4.5057549476623535, "rps_doc_num_sentences": 92, "rps_doc_symbol_to_word_ratio": 0.0014413399621844292, "rps_doc_unigram_entropy": 5.742774963378906, "rps_doc_word_count": 2954, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.005108939949423075, "rps_doc_frac_chars_dupe_6grams": 0.0025544699747115374, "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.007663410156965256, "rps_doc_frac_chars_top_3gram": 0.006085650064051151, "rps_doc_frac_chars_top_4gram": 0.005785120185464621, "rps_doc_books_importance": -1562.45556640625, "rps_doc_books_importance_length_correction": -1562.45556640625, "rps_doc_openwebtext_importance": -952.548583984375, "rps_doc_openwebtext_importance_length_correction": -952.548583984375, "rps_doc_wikipedia_importance": -594.1586303710938, "rps_doc_wikipedia_importance_length_correction": -594.1586303710938 }, "fasttext": { "dclm": 0.03769015893340111, "english": 0.9560349583625793, "fineweb_edu_approx": 1.4863755702972412, "eai_general_math": 0.8730747699737549, "eai_open_web_math": 0.4136272072792053, "eai_web_code": 0.5723277926445007 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,463,659,650,804,262,000

The Evolution of Technology: A Catalyst for Modernization and Progress Technology, often abbreviated as “tec,” has rapidly evolved over the years, revolutionizing the way we live, work, and communicate. The impact of technology on society is profound, transforming every aspect of our lives and driving progress at an unprecedented pace. From early inventions like the wheel to contemporary innovations like artificial intelligence, technology has been a cornerstone of human evolution. Early Technological Milestones The journey of technology began thousands of years ago with simple tools crafted from stone, bone, and wood. The advent of the wheel around 3500 BC marked a significant milestone, facilitating transportation and trade. As civilizations grew, so did technological ingenuity. The ancient Greeks and Romans developed advanced engineering techniques, contributing to the construction of remarkable architectural marvels like the Parthenon and the Colosseum. The Renaissance and the Birth of Modern Science The Renaissance, occurring from the 14th to the 17th century, was a period of immense cultural and intellectual growth. This era witnessed the blossoming of modern science and technology. Inventors and thinkers like Leonardo da Vinci conceptualized designs for machines and devices that were far ahead of their time. The printing press, invented by Johannes Gutenberg, revolutionized the spread of knowledge by making books more accessible. The Industrial Revolution: A Technological Turning Point The Industrial Revolution, which began in the late 18th century and continued into the 19th century, was a watershed moment in technological history. It brought about mechanization, steam power, and mass production, transforming the economic and social landscape. Factories, powered by steam engines, mechanized agriculture, manufacturing, and transportation, boosting efficiency and productivity. The Digital Age and the Internet Revolution The late 20th century saw the emergence of the digital age, characterized by rapid advancements in computing, telecommunications, and the birth of the internet. Computers became smaller, faster, and more accessible, enabling a myriad of applications, from business operations to scientific research. The internet revolutionized communication, connecting people worldwide and providing a platform for information exchange and collaboration. Contemporary Advancements: Artificial Intelligence and Beyond In the 21st century, technology has continued to advance at an unprecedented rate. Artificial intelligence (AI) has become a focal point, with machine learning algorithms and deep learning driving breakthroughs in various fields. AI is powering autonomous vehicles, improving healthcare through diagnostics and personalized medicine, and enhancing our understanding of complex systems. The Impact of Technology on Society The impact of technology on society cannot be overstated. It has improved the quality of life, made tasks more efficient, and connected people globally. However, it also raises ethical, social, and environmental concerns. Issues such as data privacy, job displacement due to automation, and the digital divide are important challenges that need to be addressed as technology continues to evolve. Looking Ahead: A Technological Future As we look to the future, the trajectory of technology seems promising. Emerging technologies like quantum computing, renewable energy solutions, and bioengineering hold immense potential to address pressing global challenges. However, responsible development and deployment of technology are crucial to ensure a sustainable and equitable future for all. In conclusion, technology, abbreviated as “tec,” has evolved from simple tools to complex systems that have shaped our world. Its impact on society and its potential for the future are immense, and it’s essential to harness this power responsibly for the benefit of humanity and the planet. Leave a Comment

{ "url": "https://www.fukuchanhonpo.com/3-3-it-seems-like-you-want-an-article-about-technology-based-on-the-provided-title-tec-heres-a-600-word-article-discussing-the-advancements-and-impacts-of-technology-the-evolution-of-te/", "source_domain": "www.fukuchanhonpo.com", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "46770", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:TWKJAJN7LWBOWIAUQ4N34JGQR36UZM5T", "WARC-Concurrent-To": "<urn:uuid:151b6005-5071-439f-9a21-90262ec816e1>", "WARC-Date": "2024-07-21T22:56:08Z", "WARC-IP-Address": "173.236.143.130", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5QLEEDNTOK4IADYG2HJCP22XK7RSWWVX", "WARC-Record-ID": "<urn:uuid:6fd67889-4fec-40f9-9857-ff29e1f77af8>", "WARC-Target-URI": "https://www.fukuchanhonpo.com/3-3-it-seems-like-you-want-an-article-about-technology-based-on-the-provided-title-tec-heres-a-600-word-article-discussing-the-advancements-and-impacts-of-technology-the-evolution-of-te/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3a05de14-f1d6-4fc8-a84d-7ebc88f02984>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-32\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 71, 72, 488, 489, 520, 521, 975, 976, 1024, 1025, 1466, 1467, 1524, 1525, 1923, 1924, 1968, 1969, 2409, 2410, 2472, 2473, 2859, 2860, 2896, 2897, 3293, 3294, 3332, 3333, 3688, 3689, 3980, 3981 ], "line_end_idx": [ 71, 72, 488, 489, 520, 521, 975, 976, 1024, 1025, 1466, 1467, 1524, 1525, 1923, 1924, 1968, 1969, 2409, 2410, 2472, 2473, 2859, 2860, 2896, 2897, 3293, 3294, 3332, 3333, 3688, 3689, 3980, 3981, 3996 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3996, "ccnet_original_nlines": 34, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.31039753556251526, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00917430967092514, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14067277312278748, "rps_doc_frac_unique_words": 0.54448401927948, "rps_doc_mean_word_length": 5.925266742706299, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.1512908935546875, "rps_doc_word_count": 562, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.027027029544115067, "rps_doc_frac_chars_dupe_6grams": 0.027027029544115067, "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.025225229561328888, "rps_doc_frac_chars_top_3gram": 0.009909910149872303, "rps_doc_frac_chars_top_4gram": 0.018918920308351517, "rps_doc_books_importance": -263.0769958496094, "rps_doc_books_importance_length_correction": -263.0769958496094, "rps_doc_openwebtext_importance": -126.73353576660156, "rps_doc_openwebtext_importance_length_correction": -126.73353576660156, "rps_doc_wikipedia_importance": -128.82249450683594, "rps_doc_wikipedia_importance_length_correction": -128.82249450683594 }, "fasttext": { "dclm": 0.9757722020149231, "english": 0.9403125047683716, "fineweb_edu_approx": 3.300673723220825, "eai_general_math": 0.16164326667785645, "eai_open_web_math": 0.36201953887939453, "eai_web_code": 0.010118190199136734 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.09", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "303.483", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social sciences — Dictionaries" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "14", "label": "News Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-216,604,999,894,833,800

Here's How to Fix An iPhone That Won't Turn Off Man staring at a phone that's not on on a table, head in hands If your iPhone won't turn off, you may be worried that your iPhone is broken and that, eventually, your phone's battery is going to run out. Those are both valid concerns. An iPhone that's stuck on is a rare situation, but if it's happening to you, you need to understand what's going on so you can know how to fix it. Reasons Why Your iPhone Won't Turn Off An illustration of the reasons an iPhone won't turn off. ©Lifewire The most likely reasons why your iPhone won't turn off are: • It's frozen due to software problems. • The Sleep/Wake button is broken. • The screen is broken and isn't responding to taps. If this is the case, skip directly to step 4 below. How to Fix an iPhone that Won't Power Off Before you try any of these steps, first you should attempt to use the standard way of turning off your iPhone (holding down the Sleep/Wake button and then sliding the Power Off slider). If you're reading this article, you've probably already tried that and it didn't work. If that's your situation, try these steps. Step 1: Hard Reset Your iPhone The first, and simplest, way to shut down an iPhone that won't turn off is using a technique called a hard reset. This is very similar to the standard way of turning your iPhone on and off, but is a more complete reset of the device and its memory. Don't worry: you won't lose any data. Only use a hard reset if your iPhone won't restart any other way. To hard reset your iPhone: 1. Hold down the Sleep/Wake button and the Home button at the same time. If you have an iPhone 7 series phone, hold down Volume Down and Sleep/Wake. The power off slider should appear on the screen. Keep holding both buttons. 2. If you have an iPhone 8 or later, press and quickly release the Volume Up button, then press and quickly release the Volume Down button, and finally press and hold the Side button (the Sleep/Wake button was renamed the Side button in later iPhone models). iPad and iPhone illustration showing hardware buttons 3. The screen will go black. 4. Keeping holding until the Apple logo appears on the screen. Let go of the button(s) and the iPhone will restart like normal. When the phone is finished restarting, everything should work fine again. Step 2: Enable AssistiveTouch and Turn Off iPhone Via Software This is a super-cool trick that's most useful if your phone's physical Home button is broken and can't be used to reset your phone. In that situation, you need to do it through software. AssistiveTouch is a feature built into the iPhone that puts a software version of the Home button on your screen. It's designed for people with physical conditions that make it hard for them to press the button, but lots of people without those conditions use it for the cool features it offers. Start by enabling AssistiveTouch: 1. Tap Settings > General > Accessibility. 2. In the Interaction section, tap AssistiveTouch. General, Accessibility, and AssistiveTouch buttons in iOS settings app 3. On the AssistiveTouch screen, move the switch to on/green and a new icon will appear on your screen. That's your new software-based Home button. With this new Home button enabled, follow these steps to turn off your iPhone: 1. Tap the software Home button. 2. Tap Device. 3. Tap and hold Lock Screen until the Power Off slider appears. AssistiveTouch toggle ON, Device softbutton and Lock screen softbutton highlighted in iOS Settings 4. Move the slider from left to right to turn off your iPhone. Step 3: Restore iPhone From Backup If a hard reset and AssistiveTouch haven't solved it, the problem probably has to do with the software on your phone, not the hardware. It's hard for the average person to figure out whether that's a problem with the iOS or an app you've installed, so the best bet is to restore your iPhone from backup. Doing this takes all of the data and settings from your phone, deletes and then reinstalls them to give you a fresh start. It won't fix every problem, but it does fix a lot. Here's what you need to do: 1. Connect your iPhone to the computer you normally sync it with. 2. Open iTunes on your computer if it doesn't open on its own. 3. Click the iPhone icon in the top left corner, beneath the playback controls (if you're not already in the iPhone management section, that is). iPhone icon in iTunes when iPhone connected to computer 4. In the Backups section, click Back Up Now. This will sync your iPhone to the computer and create a backup of your data. Back Up Now button in iTunes iPhone management window 5. When that's done, click Restore Backup. Restore Backup button in iTunes iPhone management window 6. Follow on the onscreen prompts to select the backup you just created in step 4. 7. Follow the onscreen steps and, after a few minutes, your iPhone should start up like normal. 8. Disconnect it from iTunes, and you should be good to go. Step 4: Visit Apple for Help If none of these steps have solved your problem, and your iPhone still won't turn off, your problem may be bigger, or a lot trickier, than you can solve at home. It's time to bring in the experts: Apple. You can get phone support from Apple (charges will apply if your phone is no longer in warranty). Check Apple's list of support phone numbers here. You can also go to an Apple Store for face-to-face help. If you prefer that, be sure that you make an Apple Genius Bar appointment ahead of time. There's a lot of demand for tech support at Apple Stores and without an appointment, you'll probably wait a long time to speak to someone.

{ "url": "https://www.lifewire.com/fix-iphone-wont-turn-of-4134989", "source_domain": "www.lifewire.com", "snapshot_id": "crawl=CC-MAIN-2019-26", "warc_metadata": { "Content-Length": "132195", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:X5LXM3PJDOKJRCX4GXU63C2NQYOUNP3R", "WARC-Concurrent-To": "<urn:uuid:d2a24c1b-b700-494b-be3e-48ffb23a1827>", "WARC-Date": "2019-06-19T05:35:33Z", "WARC-IP-Address": "151.101.250.114", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LLU4O7ROYPMN5TNMOADMY4LVYAUDUMUH", "WARC-Record-ID": "<urn:uuid:1f0c5f2f-b5ec-427c-b1d9-ccbac3cf8b61>", "WARC-Target-URI": "https://www.lifewire.com/fix-iphone-wont-turn-of-4134989", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e67a614b-fa7e-4211-9d54-ba15b8f5ebad>" }, "warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-168-158-209.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 48, 49, 112, 113, 432, 433, 472, 473, 530, 541, 542, 602, 603, 645, 682, 789, 790, 832, 833, 1150, 1151, 1182, 1183, 1536, 1537, 1564, 1565, 1793, 1794, 2055, 2056, 2114, 2145, 2146, 2350, 2351, 2414, 2415, 2602, 2603, 2933, 2934, 2979, 2980, 3033, 3034, 3109, 3259, 3260, 3339, 3340, 3375, 3376, 3393, 3394, 3460, 3461, 3564, 3629, 3630, 3665, 3666, 3802, 3803, 4173, 4174, 4242, 4243, 4308, 4309, 4457, 4458, 4518, 4643, 4644, 4702, 4747, 4748, 4809, 4894, 4895, 4993, 4994, 5056, 5057, 5086, 5087, 5291, 5292, 5440, 5441 ], "line_end_idx": [ 48, 49, 112, 113, 432, 433, 472, 473, 530, 541, 542, 602, 603, 645, 682, 789, 790, 832, 833, 1150, 1151, 1182, 1183, 1536, 1537, 1564, 1565, 1793, 1794, 2055, 2056, 2114, 2145, 2146, 2350, 2351, 2414, 2415, 2602, 2603, 2933, 2934, 2979, 2980, 3033, 3034, 3109, 3259, 3260, 3339, 3340, 3375, 3376, 3393, 3394, 3460, 3461, 3564, 3629, 3630, 3665, 3666, 3802, 3803, 4173, 4174, 4242, 4243, 4308, 4309, 4457, 4458, 4518, 4643, 4644, 4702, 4747, 4748, 4809, 4894, 4895, 4993, 4994, 5056, 5057, 5086, 5087, 5291, 5292, 5440, 5441, 5725 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5725, "ccnet_original_nlines": 91, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4049520790576935, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.000798719993326813, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17571884393692017, "rps_doc_frac_unique_words": 0.3227722942829132, "rps_doc_mean_word_length": 4.367326736450195, "rps_doc_num_sentences": 75, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.119804382324219, "rps_doc_word_count": 1010, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.11539333313703537, "rps_doc_frac_chars_dupe_6grams": 0.062117431312799454, "rps_doc_frac_chars_dupe_7grams": 0.02493765950202942, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.03627295047044754, "rps_doc_frac_chars_top_3gram": 0.017456360161304474, "rps_doc_frac_chars_top_4gram": 0.015416010282933712, "rps_doc_books_importance": -495.784912109375, "rps_doc_books_importance_length_correction": -495.784912109375, "rps_doc_openwebtext_importance": -287.41583251953125, "rps_doc_openwebtext_importance_length_correction": -287.41583251953125, "rps_doc_wikipedia_importance": -202.5353240966797, "rps_doc_wikipedia_importance_length_correction": -202.5353240966797 }, "fasttext": { "dclm": 0.4632570743560791, "english": 0.9269905686378479, "fineweb_edu_approx": 1.4230847358703613, "eai_general_math": 0.01466912031173706, "eai_open_web_math": 0.07100213319063187, "eai_web_code": 0.03557020053267479 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.164", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-1,217,466,182,506,663,200

Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü - Ñòðàíèöà 15 - Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ StormWall - Çàùèòà îò DDos àòàê Ðåãèñòðàöèÿ Ìíåíèÿ Ñïðàâêà Ïîëüçîâàòåëè Êàëåíäàðü Âñå ðàçäåëû ïðî÷èòàíû Âåðíóòüñÿ Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ > MMO > Äðóãèå èãðû / Other games > WarCraft III WarCraft III Ôîðóì ïîñâÿùåí ïîïóëÿðíîé ñòðàòåãèè îò Blizzard’a – Warcraft 3. Äèñêóññèè íà òåìó ñîçäàíèÿ êàðò è ñîçäàíèÿ ñåðâåðà íà áàçå ýìóëÿòîðà PvPGN. Îïèñàíèå òåìû:Õîñòèíã áîòû Îòâåò Îïöèè òåìû Íåïðî÷èòàíî 17.11.2010, 21:46 #141 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü À, ÿ íå çàìåòèë ñðàçó. Âîò ýòè çíà÷åíèÿ â êîíôèãå ïîñòàâèòü ïóñòûìè: Êîä: bnet_custom_exeversion = 230 1 24 1 bnet_custom_exeversionhash = 48 158 165 202 Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 18.11.2010, 07:50 #142 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Öèòàòà: Ñîîáùåíèå îò [u] Ïîñìîòðåòü ñîîáùåíèå îáíîâèë âñåðí íå êàòèò òà æå îøèáêà èìåííî òàê è ñòîèò 1.24.4.6387,åñòü ìûñëè? Äîáàâëåíî ÷åðåç 11 ìèíóò âñå ðàçîáðàëñÿ ñïñ îãðîìíîå òåáå! Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü [u]; 18.11.2010 â 08:01. Ïðè÷èíà: Äîáàâëåíî ñîîáùåíèå [u] âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 16:25 #143 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü [ BNET: playground.ru] refreshed ban list (0 -> 64 bans) [ BNET: playground.ru] connecting to server [playground.ru] on port 6112 [ BNET: playground.ru] resolved and cached server IP address 212.42.38.154 [ BNET: playground.ru] connected [ TCPSOCKET] closed by remote host [ BNET: playground.ru] disconnected from battle.net [ BNET: playground.ru] waiting 30 seconds to reconnect Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 16:44 #144 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Agito919, ïîêàæè êîíôèã. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 17:42 #145 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Êîä: [GHOST] ########################################################### # PLEASE EDIT CONFIG IN GHOST ONE UNDER GHOST OPTIONS TAB # ########################################################### ### handle name bans: 0 = do nothing, 1 = kick, 2 = announce only (no kick). bot_banning = 1 ### force auto hcl from gamename in dota games (even when bot_defaulthcl is not set) bot_forceautohclindota = 1 ### set to 1 if you want admins to be autoplaced higher only in dota games (0 = in all games) bot_placeadminshigheronlyindota = 0 ### if 1 - no admin can start the game if the owner is in the lobby bot_onlyownerscanstart = 1 ### if set to 1, if using bot_allowedscores, players having an unknown score will be allowed bot_allownullscoredplayers = 1 ### in autohosted games, allow only players with score>=x to join the lobby bot_autohostallowedscores = 0 ### allow only players with score>=x to join the lobby bot_allowedscores = 0 ### milliseconds to add to highest ping as base dynamic latency bot_dynamiclatencyaddedtoping = 25 ### how many milliseconds to add to the normal latency if the players lag bot_dynamiclatencymaxtoadd = 30 ### dynamic latency will try not to go over 2.2x highest ping, recommended bot_dynamiclatency2.2xhighestpingmax = 1 ### dynamic latency will be increased when a lobby is active bot_dynamiclatencyincreasewhenlobby = 1 ### enable dynamic latency, lowers or even increases latency as needed bot_usedynamiclatency = 1 ### if enabled, any user can !pub/!map/!unhost bot_userscanhost = 1 ### if enabled, any safelisted player can !pub/!map/!unhost bot_safecanhost = 0 ### will allow admins and safelisted players to download even if downloads are disabled bot_adminsandsafecandownload = 1 ### will replace every !ban/!bl with !warn/!wl bot_replacebanwithwarn = 0 ### 0 - ghost countdown, 1 - warcraft countdown bot_normalcountdown = 0 ### when you !unban player, the bot also issues an /unban player bot_unbanremoveschannelban = 0 ### all messages will be answered with a whisper bot_whisperallmessages = 0 ### fake pings for the following players, space separated: ex = nick1 nick2 bot_fakepings = # Prints the gameloaded.txt message after X seconds. Default: 10. bot_gameloadedprintout = 10 # how many games should the player play (without taking another warn) to make one of his warns inactive. Default: 7 bot_gamenumtoforgetawarn = 7 # how many days will each warn last. 0 - permanent warn. Default: 14. bot_warntimeofwarnedplayer = 14 # how many days will the auto-ban from warns last. 0 - permanent ban. Default: 14. bot_bantimeofwarnedplayer = 14 # how many warns are needed to auto-ban the player. Default: 3. bot_banthewarnedplayerquota = 3 # tbanlast/tbl will expire in x days - set to 0 to be permanent bot_tbanlasttime = 30 # normal banlast/bl will expire in x days - set to 0 to be permanent bot_banlasttime = 180 # normal bans will expire in x days - set to 0 to be permanent bot_bantime = 100 # auto warns leavers bot_autowarnearlyleavers = 0 # send admin messages or not (if using the admin game) bot_adminmessages = 0 # send local admin messages or not (if using the admin game) bot_localadminmessages = 0 # set !autostart 10 automatically in dota games bot_autostartdotagames = 0 # safelisted players are immune to ban/warn bot_safelistedbanimmunity = 1 # Drop the user if he/she desyncs or not bot_dropifdesync = 1 ### handle ip bans: 0 = do nothing, 1 = kick, 2 = announce only (no kick). bot_ipbanning = 1 ### make the ban announcement on one line ( = 0) (if possible) or on two ( = 1) bot_twolinesbanannouncement = 1 ### custom text to add to version. bot_customversiontext = ### auto ban people who leave during the countdown bot_autobancountdown = 1 ### auto ban people who leave during the game load bot_autobangameloading = 1 bot_autohostdeniedcountries = bot_autohostallowedcountries = ### UDP port on which the bot communicates with GHost One GUI, 5868 default udp_guiport = 5868 # In LAN/GArena show the real number of current/total players in the game, when using !pubg it will be auto activated lan_showrealslotcount = 0 # LIST OF SETTINGS NOT IN GHOST OPTIONS TAB #bot_language #bot_mapcfgpath #bot_savegamepath #bot_spoofchecks #bot_refreshmessages #bot_autolock #bot_autosave #bot_allowdownloads #bot_pingduringdownloads #bot_lcpings #bot_autokickping #bot_latency #bot_synclimit #bot_votekickallowed #bot_votekickpercentage #bot_udpconsole #bot_virtualhostname #udp_cmdbindip #udp_cmdspooftarget #admingame_password #db_sqlite3_file #bnet_holdfriends #bnet_holdclan ######################## # Actual Config Below # ######################## # the log file bot_log = # Show a message when a safe/admin/rootadmin/chieftain/shaman joins the channel bot_channeljoingreets = 1 # Admins will be able to delete only bans they've made bot_adminslimitedunban = 0 # Announce +1 and +2 (players left to join) in lobby (only if not autohosted) bot_lobbyannounceunoccupied = 1 # Auto set HCL based on game name,ex: -arso EU pros will set HCL to arso (only if map_defaulthcl is defined, for ex: map_defaulthcl = ar), will set hcl to empty if no mode is detected in the gamename bot_autohclfromgamename = 1 # whether players who use censored words are auto muted for x seconds bot_censormute = 1 # also auto mute admins bot_censormuteadmins = 0 # mute for x seconds, the first time a player curses bot_censormutefirstseconds = 60 # mute for x seconds, the second time a player curses bot_censormutesecondseconds = 180 # mute for x seconds, if a player has cursed for 3 or more times bot_censormuteexcessiveseconds = 360 lan_war3version = 24 # Disable nagle algorithm (TCPIP algorithm that can slow down the network) - may improve latency if you set to 1 tcp_nodelay = 0 # Path to your WC3TVRecorder ex: c:\Program Files\waaaghTV Recorder\ wtv_path = C:\Program Files\WaaaghTV Recorder\ # Use WC3TVRecorder, 1 to enable wtv_enabled = 0 # WaaaghTV Observer Name wtv_playername = Waaagh!TV # for ex: RO, only these countries will be allowed to join a game bot_allowedcountries = # for ex: BR, these countries will not be allowed to join a game bot_deniedcountries = # milliseconds to wait before sending medium sized packets to bnet when using PVPGN bot_bnetpacketdelaymediumpvpgn = 2000 # milliseconds to wait before sending big sized packets to bnet when using PVPGN bot_bnetpacketdelaybigpvpgn = 2500 # milliseconds to wait before sending medium sized packets to bnet (official) bot_bnetpacketdelaymedium = 3200 # milliseconds to wait before sending big sized packets to bnet (official) bot_bnetpacketdelaybig = 4000 # Allowed variables: totgames, kills, deaths, assists, creepkills, creepdenies, neutralkills, # towerkills, raxkills, courierkills, wins, losses, killstotal, deathstotal, creepkillstotal, # creepdeniestotal,assiststotal, neutralkillstotal, towerkillstotal, raxkillstotal, courierkillstotal # default formula: # (((wins-losses)/totgames)+(kills-deaths+assists/2)+(creepkills/100+creepdenies/10+neutralkills/50)+(raxkills/6)+(towerkills/11)) # alternative formula: # (((kills-deaths+assists*0.7)*0.6+towerkills*0.8+raxkills+creepkills*0.02+creepdenies*0.08+neutralkills*0.03+courierkills*0.04)*0.5+(wins/totgames*2)+(totgames*0.002)) bot_scoreformula = (((wins-losses)/totgames)+(kills-deaths+assists/2)+(creepkills/100+creepdenies/10+neutralkills/50)+(raxkills/6)+(towerkills/11)) # Only players having played this many number of games will be ranked bot_scoremingames = 5 # default access for owners (use admin access panel to change any admin's access to your liking and see the access code for those commands) bot_owneraccess = 3957 # default access for admins bot_adminaccess = 6143 # gamestate for inhouse games bot_gamestateinhouse = 999 # will only auto ban if team diff <= with the setting bot_autobanteamdiffmax = 0 # Only ban players who leave prior to x minutes of game end time. bot_autobangameendmins = 3 bot_autobantimer = 15 bot_autobanall = 1 bot_autobanfirstxleavers = 0 # the bot will auto rehost the game as gamename + 1 if 60 seconds have passed since last player joined, 0 = disable bot_autorehostdelay = 50 # the bot will auto rehost the game as gamename + 1 if game name is taken bot_rehostifnametaken = 0 # if host counter goes over this number it will reset to 1, set to 0 to disable the feature bot_maxhostcounter = 30 # these words will be edited/censored in game. bot_censorwords = fuck idiot retarded dick cunt pussy asshole suck shit penis vagina ïèçä ïèçäåö õóé õóèñîñ ïèçä ïèçäà áëÿòü ñóêà ìóä ìóäàê ïèäà ïèäàð ïèäàðàñ òóïîé åáà åáàë åáàíàò åáàëî ó¸á ó¸áîê ó¸áèùå ðàñïèçäåëñÿ # load in game feature will be enabled for every map (if set to 1) bot_forceloadingame = 1 # After a game has ended, if mysql is used, ghost will run update_dota_elo.exe (use either this or score not both!) bot_updatedotaeloaftergame = 0 # After a game has ended, if mysql is used, ghost will recalculate scores (use either this or elo not both!) bot_updatedotascoreaftergame = 0 # set to 1 if you are using warcraft 3 patch 1.23 or newer bot_patch23ornewer = 1 # set to 1 if you are using warcraft 3 patch 1.21 bot_patch21 = 0 # show .sd of anyone who enters the lobby (and has played games with the bot before) bot_showscoresonjoin = 1 # setting bot_autohostmaximumgames > 0 will make ghost begin autohosting on startup bot_autohostmaximumgames = 0 bot_autohostautostartplayers = 10 bot_autohostallowstart = 0 bot_autohostlocal = 0 bot_autohostowner = -sdso by Drago :D bot_autohostmapcfg = Dota 6.65.cfg bot_autohostgamename = -sdso by Drago :D # If you autohost a even playered two team map and want to auto ban leavers that make the game uneven turn this on. Will not ban admins or root admins. An example map would be DotA or Battleships. # 0 = off 1 = on bot_autoban = 1 # set to 1 if you want LAN players to be considered admins bot_lanadmins = 0 # set to 1 if you want local players (GArena) to be considered admins bot_localadmins = 0 # the language file bot_language = language.cfg # the path to your local Warcraft III directory # this path must contain war3.exe, storm.dll, and game.dll # this path must end in your system's path seperator (i.e. "\" on Windows or "/" on Linux) # if this path contains War3Patch.mpq the bot will attempt to extract "Scripts\common.j" and "Scripts\blizzard.j" on startup and write them to bot_mapcfgpath (which is defined later in this file) # common.j and blizzard.j are only required for automatically calculating map_crc, you do not need them if your map config files already contain map_crc bot_war3path = C:\StrongDC++\Warcraft III - Frozen Throne 3\ # the port GHost++ will host battle.net games on (this must be different from your admingame_port) bot_hostport = 6113 # maximum number of games to host at once bot_maxgames = 5 # command trigger for ingame only (battle.net command triggers are defined later) bot_commandtrigger = @ # the path to the directory where you keep your map config files (must end in your system's path seperator) # this directory can also contain common.j and blizzard.j (extracted from War3Patch.mpq) # common.j and blizzard.j are only required for automatically calculating map_crc, you do not need them if your map config files already contain map_crc bot_mapcfgpath = mapcfgs\ # the path to the directory where you keep your savegame files (must end in your system's path seperator) bot_savegamepath = savegames\ # the path to the directory where you keep your map files (must end in your system's path seperator) # GHost++ doesn't require map files but if it has access to them it can send them to players and automatically calculate most map config values # GHost++ will search [bot_mappath + map_localpath] for the map file (map_localpath is set in each map's config file) bot_mappath = C:\StrongDC++\Warcraft III - Frozen Throne 3\maps\download\ # whether to save replays or not bot_savereplays = 0 # the path to the directory where you want GHost++ to save replays (must end in your system's path seperator) bot_replaypath = replays\ ### the Warcraft 3 version to save replays as replay_war3version = 24 ### the Warcraft 3 build number to save replays as (this is specific to each Warcraft 3 version) ### patch 1.23: war3version 23, buildnumber 6058 ### patch 1.24: war3version 24, buildnumber 6059 ### patch 1.24b: war3version 24, buildnumber 6059 replay_buildnumber = 6059 ### whether to do automatic spoof checks or not ### you can always manually spoof check by whispering the bot (and in fact this is required before running admin commands) ### set to 0 to disable automatic spoof checks ### set to 1 to enable automatic spoof checks on all players ### set to 2 to enable automatic spoof checks on potential admins only bot_spoofchecks = 1 ### whether to require spoof checks or not ### this controls whether the bot will require players to spoof check before starting the game ### it does NOT control whether the bot will require players to spoof check before running admin commands - spoof checks are ALWAYS required for admin status ### if you require spoof checks, players will be kicked from the lobby if they haven't spoof checked within 20 seconds of joining (autohosted games only) bot_requirespoofchecks = 0 # whether to display game refresh messages by default # this can always be changed for a particular game with the !refresh command bot_refreshmessages = 0 # whether to automatically lock games when the owner joins bot_autolock = 0 # whether to automatically save games when a player disconnects # this can always be changed for a particular game with the !autosave command bot_autosave = 0 # whether to allow map downloads or not # set to 0 to disable map downloads # set to 1 to enable map downloads # set to 2 to enable conditional map downloads (an admin must start each map download with the !download or !dl command) bot_allowdownloads = 1 # whether to Uping players during map downloads or not # GHost++ will always stop pinging any players who are downloading the map # this config value determines whether GHost++ should stop pinging *all* players when at least one player is downloading the map bot_pingduringdownloads = 0 # kicked banned people when they enter the channel bot_kickbannedfromchannel = 1 # Ban banned people when they enter the channel bot_banbannedfromchannel = 0 # use LC style pings (divide actual pings by two) bot_lcpings = 1 # auto kick players with ping higher than this bot_autokickping = 250 # the game latency # this can always be changed for a particular game with the !latency command (which enforces a minimum of 50 and a maximum of 500) bot_latency = 100 # the maximum number of packets a player is allowed to get out of sync by before starting the lag screen # before version 8.0 GHost++ did not have a lag screen which is the same as setting this to a very high number # this can always be changed for a particular game with the !synclimit command (which enforces a minimum of 10 and a maximum of 10000) bot_synclimit = 90 # whether votekicks are allowed or not bot_votekickallowed = 1 # the percentage of players required to vote yes for a votekick to pass # the player starting the votekick is assumed to have voted yes and the player the votekick is started against is assumed to have voted no # the formula for calculating the number of votes needed is votes_needed = ceil( ( num_players - 1 ) * bot_votekickpercentage / 100 ) # this means it will round UP the number of votes required # if you set it to 100 it will require 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10, 10/11, and 11/12 votes to pass # if you set it to 90 it will require 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9, 9/10, 9/11, and 10/12 votes to pass # if you set it to 80 it will require 2/3, 3/4, 4/5, 4/6, 5/7, 6/8, 7/9, 8/10, 8/11, and 9/12 votes to pass # if you set it to 70 it will require 2/3, 3/4, 3/5, 4/6, 5/7, 5/8, 6/9, 7/10, 7/11, and 8/12 votes to pass # if you set it to 60 it will require 2/3, 2/4, 3/5, 3/6, 4/7, 5/8, 5/9, 6/10, 6/11, and 7/12 votes to pass bot_votekickpercentage = 100 # Just before a game is hosted the creator is added to the bots friends list and removed soon after bot_addcreatorasfriendonhost = 0 # lobby/game commands are displayed as chat (or hidden) bot_relaychatcommands = 1 # display information on current downloads (speed, ETA) bot_showdownloadsinfo = 1 # interval in seconds between download info message bot_showdownloadsinfotime = 5 # maximum players allowed to download at once, the rest will have almost KB/s until someone finishes downloading bot_maxdownloaders = 3 # set total download speed (KB/s) available for all clients at once, if set to 1024, 4 people will get 256 each bot_totaldownloadspeed = 1536 # set max download speed (KB/s) available for one client bot_clientdownloadspeed = 1024 # initiate game over timer if remaining players are less than this number (and at least a player left) - 0 to disable bot_gameoverminplayers = 0 # initiate game over timer if remaining player percentage is less than this number (and at least a player left) - 0 to disable bot_gameoverminpercent = 0 # initiate game over timer if team difference is bigger than this number, 0 - to disable bot_gameovermaxteamdifference = 0 # redirect console output to udp bot_udpconsole = 1 # whether to automatically add the players from last game to the next game's reserved list bot_holdplayersforrmk = 1 # non admin commands, 1 enable, 0 disable bot_nonadmincommands = 1 # root admins are required to spoof check if 1, or not if 0 bot_rootadminsspoofcheck = 0 # admins are required to spoof check if 1, or not if 0 bot_adminsspoofcheck = 0 # banned players will be notified with a whisper. bot_notifybannedplayers = 1 # ghost will find its external ip on startup, disable if you want to play on LAN only bot_findexternalip = 1 # specify your external ip here if you don't want ghost to auto find it. bot_externalip = # use alternative site for external ip finding (if you experience lag (30s) on ghost startup) bot_altfindip = 0 # bot's additional rootadmins separated by space ex: userone usertwo userthree bot_rootadmins = # bot's UDP password bot_udppassword = # show autokick denied country or banned player messages bot_verbose = 0 # bot's virtual host name bot_virtualhostname = |cFF00FF00A I # ignore drop request for the first x seconds of lagging. bot_dropvotetime = 30 # Time limit for hosting a game where no admins enter it bot_lobbytimelimit = 10 # udp ip udp_cmdbindip = 0.0.0.0 # udp port udp_cmdport = 6969 # udp spoof target udp_cmdspooftarget = ############################ # ADMIN GAME CONFIGURATION # ############################ # whether to create the admin game or not (see readme.txt for more information) admingame_create = 0 # the port GHost++ will host the admin game on (this must be different from your bot_hostport) admingame_port = 6114 # the admin game password admingame_password = ########################## # DATABASE CONFIGURATION # ########################## # database type # use "sqlite3" for a local SQLite database # use "mysql" for any MySQL database db_type = sqlite3 # sqlite3 database file db_sqlite3_file = ghost.dbs # this is only used if your database type is MySQL db_mysql_server = db_mysql_database = db_mysql_user = db_mysql_password = db_mysql_port = ############################ # BATTLE.NET CONFIGURATION # ############################ # which battle.net server to connect to # 1.) useast.battle.net # 2.) uswest.battle.net # 3.) asia.battle.net # 4.) europe.battle.net # note that each banned player is tied to the realm it was created on and the realm is case sensitive # so if you change your realm from useast.battle.net to USEAST.BATTLE.NET it'll still connect but anyone previously banned will not be counted as banned until you change it back bnet_server = playground.ru # your Warcraft III: Reign of Chaos CD key bnet_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # your Warcraft III: The Frozen Throne CD key bnet_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # your battle.net username bnet_username = MugenNoSoro # your battle.net password bnet_password = XXXXXXX # the first channel to join upon entering battle.net bnet_firstchannel = Clan AniC # the root admin on this battle.net server only bnet_rootadmin = [Ani-C]Akito # command trigger for this battle.net server only bnet_commandtrigger = @ # whether to automatically add your friends list to each game's reserved list bnet_holdfriends = 1 # whether to automatically add your clan members list to each game's reserved list bnet_holdclan = 1 # you will need to edit this section of the config file if you're connecting to a PVPGN server # your PVPGN server operator will tell you what to put here bnet_custom_war3version = 24 bnet_custom_exeversion = bnet_custom_exeversionhash = bnet_custom_passwordhashtype = pvpgn ### # BNLS Settings ### bnet_bnlsserver = bnet_bnlsport = 9367 bnet_bnlswardencookie = 1 ### # example configuration for connecting to a official battle.net server (second server) ### # bnet2_server = uswest.battle.net # bnet2_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet2_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet2_username = # bnet2_password = # bnet2_firstchannel = The Void # bnet2_rootadmin = # bnet2_commandtrigger = ! # bnet2_holdfriends = 1 # bnet2_holdclan = 1 ### # example configuration for connecting to a PVPGN battle.net (third server) ### # bnet3_server = pvpgn.boredaussie.com # bnet3_cdkeyroc = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet3_cdkeytft = FFFFFFFFFFFFFFFFFFFFFFFFFF # bnet3_username = # bnet3_password = # bnet3_firstchannel = The Void # bnet3_rootadmin = # bnet3_commandtrigger = ! # bnet3_holdfriends = 1 # bnet3_holdclan = 1 # bnet3_custom_war3version = 22 # bnet3_custom_exeversion = 184 0 22 1 # bnet3_custom_exeversionhash = 219 152 153 144 # bnet3_custom_passwordhashtype = pvpgn Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü Array; 21.11.2010 â 21:52. Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 22:10 #146 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Êîíôèã â ïîðÿäêå. Êàê âàðèàíò ìîãóò áûòü ïîðòû çàíÿòû. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 22:55 #147 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Ñ ïîðòàìè âñå ãóä ÿ õîñòþ ñ áîòà íî èíîãäà áîò îòðóáàåöà îò áàòëà è âûäàåò åòî ñîîáùåíèå è åñüëå ÿ âûéäó ñ âàðèêà òî íåñêîëüêî ÷åñîâ íå ìîãó çàéòè ïîêà åòà îøèáêà ñàìà ñîáîé íå ïðîéäåò( Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 23:06 #148 Àâàòàð äëÿ Array Ñóïåðãåðîé Àâòîð òåìû (Òîïèê Ñòàðòåð) Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Â îáùåì òî ðàáîòàåò íîðì? ß äóìàþ ýòî èç-çà ÏÃ. Array âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 21.11.2010, 23:28 #149 Àâàòàð äëÿ Agito919 Ïîëüçîâàòåëü Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Öèòàòà: Ñîîáùåíèå îò Array Ïîñìîòðåòü ñîîáùåíèå Â îáùåì òî ðàáîòàåò íîðì? ß äóìàþ ýòî èç-çà ÏÃ. íó íå çíàþ íàøüåò ïã íî ó íåêîòîðûõ åòîò ãëþê åñòü ó íåêîòîðûõ áîò ðàáîòàåò êàê ÷åñû( __________________ Åñüëè æèçüíü òåáÿ åá¸ò, çíà÷èò ó íå¸ âñòà¸ò,çíà÷èò òû åé íðàâèøñÿ,òàê ÷åãî òû ïàðèøñÿ!? Agito919 âíå ôîðóìà Îòâåòèòü ñ öèòèðîâàíèåì Íåïðî÷èòàíî 24.11.2010, 22:57 #150 Àâàòàð äëÿ Csandr Ó÷àñòíèê Ïî óìîë÷àíèþ Re: Ghost++ , GhostOne - Ñêà÷àòü - Óñòàíîâèòü - Íàñòðîèòü Âñåì ïðèâåò! Ïîìîãèòå ïëç... ó ìåíÿ òàêàÿ òåìà: ÿ ïðîáîâàë çàâåñòè GhostOne íà ñåðâåð...îáëîìàëñÿ, íó ëàí çàáèë - òåðü âàùå â áàòëó íå ìîãó çàéòè... ×èòàë âûøå êàê ïðîâåðèòü ïîðò...è íèôèãà ïèøó â "Âûïîëíèòü": ipconfig è netstat îí îòêðûâàåò îêíî è ðåçêî åãî ñâîðà÷èâàåò íåèçâåñòíî êóäà.... Êàê ìíå áûòü? ×òîá ýëåìåíòàðíî çàéòè â áàòëó. Ïîìîãèòå ïëç...... Ïîñëåäíèé ðàç ðåäàêòèðîâàëîñü Csandr; 24.11.2010 â 22:58. Ïðè÷èíà: îðôîãðàôè÷åñêèå îøèáêè Csandr âíå ôîðóìà Îòïðàâèòü ñîîáùåíèå äëÿ Csandr ñ ïîìîùüþ Skype™ Îòâåòèòü ñ öèòèðîâàíèåì Îòâåò Ìåòêè 1.7.266, alkar, battle.net, dota, garena, ghost++, ghostone, mapcfg, playground, rubattle, àòàòà, áîò, äîòà, êîíôèã, íàñòðîéêà, ñêà÷àòü, óñòàíîâêà Çäåñü ïðèñóòñòâóþò: 1 (ïîëüçîâàòåëåé: 0 , ãîñòåé: 1) Îïöèè òåìû Âàøè ïðàâà â ðàçäåëå Âû íå ìîæåòå ñîçäàâàòü íîâûå òåìû Âû íå ìîæåòå îòâå÷àòü â òåìàõ Âû íå ìîæåòå ïðèêðåïëÿòü âëîæåíèÿ Âû íå ìîæåòå ðåäàêòèðîâàòü ñâîè ñîîáùåíèÿ BB êîäû Âêë. Ñìàéëû Âêë. [IMG] êîä Âêë. HTML êîä Âûêë. Áûñòðûé ïåðåõîä Ïîõîæèå òåìû Òåìà Àâòîð Ðàçäåë Îòâåòîâ Ïîñëåäíåå ñîîáùåíèå Ñêà÷àòü Aion-Unique (1120) Ðåâèçèþ. montenegro Ñåðâåðíàÿ ÷àñòü 41 17.02.2010 20:28 apache ãäå ñêà÷àòü GiDD Äâèæêè ñàéòîâ (CMS) 8 16.08.2009 22:38 ãäå ñêà÷àòü ãåîäàòó äëÿ... GiDD Ðàáîòà ñ ãåîäàòîé 0 12.08.2009 13:48 © 2007–2024 «Ôîðóì àäìèíèñòðàòîðîâ èãðîâûõ ñåðâåðîâ» Çàùèòà ñàéòà îò DDoS àòàê — StormWall Ðàáîòàåò íà Áóëêå íåèçâåñòíîé âåðñèè ñ ïåðåâîäîì îò zCarot Òåêóùåå âðåìÿ: 19:38. ×àñîâîé ïîÿñ GMT +3. Ââåðõ

{ "url": "https://forum.zone-game.info/showthread.php?t=7323&page=15", "source_domain": "forum.zone-game.info", "snapshot_id": "CC-MAIN-2024-18", "warc_metadata": { "Content-Length": "119771", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PIVLEQ4AOXH3IY46IS3HJSV4BDPE44UC", "WARC-Concurrent-To": "<urn:uuid:1ee73381-567f-4347-8d1f-445ed8250dc8>", "WARC-Date": "2024-04-15T16:38:45Z", "WARC-IP-Address": "185.71.67.65", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:S3PAJRIDUL7ERLHXCX5KAIJC4P5OO7GJ", "WARC-Record-ID": "<urn:uuid:82c0343d-d6b8-4d32-abc8-7249039dabbc>", "WARC-Target-URI": "https://forum.zone-game.info/showthread.php?t=7323&page=15", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f4351229-62f2-4241-9990-55b5a330f0b1>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-192\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, 109, 180, 252, 352, 353, 506, 533, 534, 540, 551, 588, 605, 616, 617, 702, 703, 726, 772, 777, 813, 857, 898, 935, 948, 949, 1020, 1021, 1029, 1067, 1103, 1146, 1147, 1172, 1206, 1207, 1291, 1330, 1367, 1387, 1400, 1401, 1472, 1473, 1530, 1798, 1853, 1897, 1934, 1951, 1962, 1963, 2048, 2049, 2074, 2115, 2152, 2172, 2185, 2186, 2257, 2258, 2263, 2271, 2331, 2391, 2451, 2528, 2544, 2545, 2631, 2658, 2659, 2753, 2789, 2790, 2858, 2885, 2886, 2979, 3010, 3011, 3087, 3117, 3118, 3173, 3195, 3196, 3260, 3295, 3296, 3370, 3402, 3403, 3479, 3520, 3521, 3583, 3623, 3624, 3696, 3722, 3723, 3771, 3792, 3793, 3854, 3874, 3875, 3964, 3997, 3998, 4046, 4073, 4074, 4123, 4147, 4148, 4214, 4245, 4246, 4296, 4323, 4324, 4400, 4417, 4418, 4485, 4513, 4514, 4630, 4659, 4660, 4730, 4762, 4763, 4847, 4878, 4879, 4943, 4975, 4976, 5040, 5062, 5063, 5132, 5154, 5155, 5218, 5236, 5237, 5258, 5287, 5288, 5343, 5365, 5366, 5427, 5454, 5455, 5503, 5530, 5531, 5575, 5605, 5606, 5647, 5668, 5669, 5744, 5762, 5763, 5843, 5875, 5876, 5911, 5936, 5937, 5988, 6013, 6014, 6065, 6092, 6093, 6124, 6125, 6157, 6158, 6234, 6253, 6254, 6372, 6398, 6399, 6443, 6457, 6473, 6491, 6508, 6529, 6543, 6557, 6577, 6602, 6615, 6633, 6646, 6661, 6682, 6706, 6722, 6743, 6758, 6778, 6798, 6815, 6833, 6848, 6849, 6874, 6899, 6924, 6925, 6940, 6951, 6952, 7032, 7058, 7113, 7140, 7141, 7219, 7251, 7252, 7452, 7480, 7481, 7551, 7570, 7594, 7619, 7672, 7704, 7758, 7792, 7857, 7894, 7895, 7916, 7917, 8030, 8046, 8047, 8116, 8163, 8196, 8212, 8237, 8264, 8265, 8331, 8355, 8420, 8443, 8444, 8528, 8566, 8647, 8682, 8760, 8793, 8868, 8898, 8899, 8900, 8995, 9090, 9192, 9212, 9343, 9366, 9535, 9536, 9684, 9685, 9755, 9777, 9778, 9918, 9941, 9942, 9970, 9993, 9994, 10024, 10051, 10052, 10107, 10134, 10135, 10201, 10228, 10229, 10251, 10270, 10299, 10300, 10416, 10441, 10442, 10516, 10542, 10543, 10635, 10659, 10660, 10707, 10923, 10924, 10991, 11015, 11016, 11132, 11163, 11164, 11273, 11306, 11307, 11366, 11389, 11390, 11440, 11456, 11457, 11542, 11567, 11568, 11652, 11681, 11715, 11742, 11764, 11802, 11837, 11878, 11879, 12076, 12099, 12115, 12116, 12175, 12193, 12194, 12264, 12284, 12285, 12305, 12306, 12334, 12335, 12383, 12443, 12535, 12732, 12886, 12887, 12948, 12949, 13048, 13049, 13069, 13070, 13112, 13113, 13130, 13131, 13213, 13214, 13237, 13238, 13346, 13436, 13590, 13591, 13617, 13618, 13724, 13725, 13755, 13756, 13857, 14002, 14121, 14122, 14196, 14197, 14230, 14231, 14251, 14252, 14362, 14363, 14389, 14390, 14436, 14437, 14461, 14462, 14559, 14610, 14661, 14712, 14713, 14739, 14740, 14788, 14912, 14960, 15022, 15094, 15095, 15115, 15116, 15159, 15255, 15414, 15569, 15570, 15597, 15598, 15652, 15730, 15731, 15755, 15756, 15815, 15816, 15833, 15834, 15898, 15977, 15978, 15995, 15996, 16036, 16073, 16109, 16231, 16232, 16255, 16256, 16311, 16387, 16517, 16518, 16546, 16547, 16598, 16628, 16629, 16677, 16706, 16707, 16757, 16758, 16774, 16775, 16822, 16823, 16846, 16847, 16866, 16998, 16999, 17017, 17018, 17123, 17235, 17371, 17372, 17391, 17392, 17431, 17432, 17456, 17457, 17529, 17669, 17804, 17864, 17976, 18086, 18195, 18304, 18413, 18414, 18443, 18444, 18545, 18578, 18579, 18635, 18661, 18662, 18718, 18744, 18745, 18797, 18827, 18828, 18941, 18964, 18965, 19077, 19107, 19108, 19165, 19196, 19197, 19315, 19342, 19343, 19470, 19497, 19498, 19587, 19621, 19622, 19655, 19674, 19675, 19766, 19792, 19793, 19835, 19860, 19861, 19921, 19950, 19951, 20006, 20031, 20032, 20082, 20110, 20111, 20197, 20220, 20221, 20294, 20312, 20313, 20407, 20425, 20426, 20505, 20523, 20524, 20545, 20564, 20565, 20622, 20638, 20639, 20665, 20701, 20702, 20760, 20782, 20783, 20840, 20864, 20865, 20874, 20898, 20899, 20910, 20929, 20930, 20949, 20970, 20971, 21000, 21029, 21058, 21059, 21139, 21140, 21161, 21162, 21257, 21258, 21280, 21281, 21307, 21308, 21330, 21331, 21358, 21385, 21412, 21413, 21429, 21474, 21512, 21513, 21531, 21532, 21556, 21557, 21585, 21586, 21637, 21638, 21657, 21678, 21695, 21716, 21733, 21734, 21763, 21792, 21821, 21822, 21862, 21887, 21912, 21935, 21960, 22062, 22240, 22241, 22269, 22270, 22313, 22314, 22357, 22358, 22404, 22405, 22448, 22449, 22476, 22477, 22505, 22506, 22533, 22534, 22558, 22559, 22612, 22613, 22643, 22644, 22692, 22693, 22723, 22724, 22774, 22775, 22799, 22800, 22878, 22879, 22900, 22901, 22984, 22985, 23003, 23004, 23099, 23160, 23161, 23190, 23216, 23246, 23283, 23284, 23288, 23304, 23308, 23327, 23348, 23374, 23375, 23379, 23466, 23470, 23471, 23506, 23552, 23598, 23617, 23636, 23668, 23688, 23715, 23739, 23760, 23761, 23765, 23841, 23845, 23846, 23885, 23931, 23977, 23996, 24015, 24047, 24067, 24094, 24118, 24139, 24171, 24210, 24258, 24298, 24299, 24356, 24400, 24437, 24454, 24465, 24466, 24551, 24552, 24570, 24607, 24648, 24685, 24705, 24718, 24719, 24790, 24791, 24977, 25021, 25058, 25075, 25086, 25087, 25172, 25173, 25221, 25262, 25299, 25319, 25332, 25333, 25404, 25405, 25413, 25453, 25501, 25587, 25606, 25694, 25738, 25775, 25793, 25802, 25803, 25874, 25875, 26231, 26232, 26322, 26412, 26418, 26419, 26425, 26572, 26573, 26574, 26627, 26629, 26640, 26641, 26662, 26696, 26726, 26760, 26802, 26803, 26816, 26828, 26843, 26858, 26859, 26875, 26876, 26889, 26935, 27018, 27081, 27150, 27151, 27152, 27205, 27243, 27302, 27345, 27346 ], "line_end_idx": [ 109, 180, 252, 352, 353, 506, 533, 534, 540, 551, 588, 605, 616, 617, 702, 703, 726, 772, 777, 813, 857, 898, 935, 948, 949, 1020, 1021, 1029, 1067, 1103, 1146, 1147, 1172, 1206, 1207, 1291, 1330, 1367, 1387, 1400, 1401, 1472, 1473, 1530, 1798, 1853, 1897, 1934, 1951, 1962, 1963, 2048, 2049, 2074, 2115, 2152, 2172, 2185, 2186, 2257, 2258, 2263, 2271, 2331, 2391, 2451, 2528, 2544, 2545, 2631, 2658, 2659, 2753, 2789, 2790, 2858, 2885, 2886, 2979, 3010, 3011, 3087, 3117, 3118, 3173, 3195, 3196, 3260, 3295, 3296, 3370, 3402, 3403, 3479, 3520, 3521, 3583, 3623, 3624, 3696, 3722, 3723, 3771, 3792, 3793, 3854, 3874, 3875, 3964, 3997, 3998, 4046, 4073, 4074, 4123, 4147, 4148, 4214, 4245, 4246, 4296, 4323, 4324, 4400, 4417, 4418, 4485, 4513, 4514, 4630, 4659, 4660, 4730, 4762, 4763, 4847, 4878, 4879, 4943, 4975, 4976, 5040, 5062, 5063, 5132, 5154, 5155, 5218, 5236, 5237, 5258, 5287, 5288, 5343, 5365, 5366, 5427, 5454, 5455, 5503, 5530, 5531, 5575, 5605, 5606, 5647, 5668, 5669, 5744, 5762, 5763, 5843, 5875, 5876, 5911, 5936, 5937, 5988, 6013, 6014, 6065, 6092, 6093, 6124, 6125, 6157, 6158, 6234, 6253, 6254, 6372, 6398, 6399, 6443, 6457, 6473, 6491, 6508, 6529, 6543, 6557, 6577, 6602, 6615, 6633, 6646, 6661, 6682, 6706, 6722, 6743, 6758, 6778, 6798, 6815, 6833, 6848, 6849, 6874, 6899, 6924, 6925, 6940, 6951, 6952, 7032, 7058, 7113, 7140, 7141, 7219, 7251, 7252, 7452, 7480, 7481, 7551, 7570, 7594, 7619, 7672, 7704, 7758, 7792, 7857, 7894, 7895, 7916, 7917, 8030, 8046, 8047, 8116, 8163, 8196, 8212, 8237, 8264, 8265, 8331, 8355, 8420, 8443, 8444, 8528, 8566, 8647, 8682, 8760, 8793, 8868, 8898, 8899, 8900, 8995, 9090, 9192, 9212, 9343, 9366, 9535, 9536, 9684, 9685, 9755, 9777, 9778, 9918, 9941, 9942, 9970, 9993, 9994, 10024, 10051, 10052, 10107, 10134, 10135, 10201, 10228, 10229, 10251, 10270, 10299, 10300, 10416, 10441, 10442, 10516, 10542, 10543, 10635, 10659, 10660, 10707, 10923, 10924, 10991, 11015, 11016, 11132, 11163, 11164, 11273, 11306, 11307, 11366, 11389, 11390, 11440, 11456, 11457, 11542, 11567, 11568, 11652, 11681, 11715, 11742, 11764, 11802, 11837, 11878, 11879, 12076, 12099, 12115, 12116, 12175, 12193, 12194, 12264, 12284, 12285, 12305, 12306, 12334, 12335, 12383, 12443, 12535, 12732, 12886, 12887, 12948, 12949, 13048, 13049, 13069, 13070, 13112, 13113, 13130, 13131, 13213, 13214, 13237, 13238, 13346, 13436, 13590, 13591, 13617, 13618, 13724, 13725, 13755, 13756, 13857, 14002, 14121, 14122, 14196, 14197, 14230, 14231, 14251, 14252, 14362, 14363, 14389, 14390, 14436, 14437, 14461, 14462, 14559, 14610, 14661, 14712, 14713, 14739, 14740, 14788, 14912, 14960, 15022, 15094, 15095, 15115, 15116, 15159, 15255, 15414, 15569, 15570, 15597, 15598, 15652, 15730, 15731, 15755, 15756, 15815, 15816, 15833, 15834, 15898, 15977, 15978, 15995, 15996, 16036, 16073, 16109, 16231, 16232, 16255, 16256, 16311, 16387, 16517, 16518, 16546, 16547, 16598, 16628, 16629, 16677, 16706, 16707, 16757, 16758, 16774, 16775, 16822, 16823, 16846, 16847, 16866, 16998, 16999, 17017, 17018, 17123, 17235, 17371, 17372, 17391, 17392, 17431, 17432, 17456, 17457, 17529, 17669, 17804, 17864, 17976, 18086, 18195, 18304, 18413, 18414, 18443, 18444, 18545, 18578, 18579, 18635, 18661, 18662, 18718, 18744, 18745, 18797, 18827, 18828, 18941, 18964, 18965, 19077, 19107, 19108, 19165, 19196, 19197, 19315, 19342, 19343, 19470, 19497, 19498, 19587, 19621, 19622, 19655, 19674, 19675, 19766, 19792, 19793, 19835, 19860, 19861, 19921, 19950, 19951, 20006, 20031, 20032, 20082, 20110, 20111, 20197, 20220, 20221, 20294, 20312, 20313, 20407, 20425, 20426, 20505, 20523, 20524, 20545, 20564, 20565, 20622, 20638, 20639, 20665, 20701, 20702, 20760, 20782, 20783, 20840, 20864, 20865, 20874, 20898, 20899, 20910, 20929, 20930, 20949, 20970, 20971, 21000, 21029, 21058, 21059, 21139, 21140, 21161, 21162, 21257, 21258, 21280, 21281, 21307, 21308, 21330, 21331, 21358, 21385, 21412, 21413, 21429, 21474, 21512, 21513, 21531, 21532, 21556, 21557, 21585, 21586, 21637, 21638, 21657, 21678, 21695, 21716, 21733, 21734, 21763, 21792, 21821, 21822, 21862, 21887, 21912, 21935, 21960, 22062, 22240, 22241, 22269, 22270, 22313, 22314, 22357, 22358, 22404, 22405, 22448, 22449, 22476, 22477, 22505, 22506, 22533, 22534, 22558, 22559, 22612, 22613, 22643, 22644, 22692, 22693, 22723, 22724, 22774, 22775, 22799, 22800, 22878, 22879, 22900, 22901, 22984, 22985, 23003, 23004, 23099, 23160, 23161, 23190, 23216, 23246, 23283, 23284, 23288, 23304, 23308, 23327, 23348, 23374, 23375, 23379, 23466, 23470, 23471, 23506, 23552, 23598, 23617, 23636, 23668, 23688, 23715, 23739, 23760, 23761, 23765, 23841, 23845, 23846, 23885, 23931, 23977, 23996, 24015, 24047, 24067, 24094, 24118, 24139, 24171, 24210, 24258, 24298, 24299, 24356, 24400, 24437, 24454, 24465, 24466, 24551, 24552, 24570, 24607, 24648, 24685, 24705, 24718, 24719, 24790, 24791, 24977, 25021, 25058, 25075, 25086, 25087, 25172, 25173, 25221, 25262, 25299, 25319, 25332, 25333, 25404, 25405, 25413, 25453, 25501, 25587, 25606, 25694, 25738, 25775, 25793, 25802, 25803, 25874, 25875, 26231, 26232, 26322, 26412, 26418, 26419, 26425, 26572, 26573, 26574, 26627, 26629, 26640, 26641, 26662, 26696, 26726, 26760, 26802, 26803, 26816, 26828, 26843, 26858, 26859, 26875, 26876, 26889, 26935, 27018, 27081, 27150, 27151, 27152, 27205, 27243, 27302, 27345, 27346, 27351 ] }

{ "red_pajama_v2": { "ccnet_original_length": 27351, "ccnet_original_nlines": 803, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 9, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2122546285390854, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.018712159246206284, "rps_doc_frac_lines_end_with_ellipsis": 0.0012437800178304315, "rps_doc_frac_no_alph_words": 0.46486884355545044, "rps_doc_frac_unique_words": 0.34343433380126953, "rps_doc_mean_word_length": 6.386841297149658, "rps_doc_num_sentences": 204, "rps_doc_symbol_to_word_ratio": 0.13080169260501862, "rps_doc_unigram_entropy": 6.295562267303467, "rps_doc_word_count": 3663, "rps_doc_frac_chars_dupe_10grams": 0.12374439090490341, "rps_doc_frac_chars_dupe_5grams": 0.23056209087371826, "rps_doc_frac_chars_dupe_6grams": 0.2113272100687027, "rps_doc_frac_chars_dupe_7grams": 0.19679419696331024, "rps_doc_frac_chars_dupe_8grams": 0.16807009279727936, "rps_doc_frac_chars_dupe_9grams": 0.13190853595733643, "rps_doc_frac_chars_top_2gram": 0.004060700070112944, "rps_doc_frac_chars_top_3gram": 0.012224829755723476, "rps_doc_frac_chars_top_4gram": 0.021628549322485924, "rps_doc_books_importance": -2740.73583984375, "rps_doc_books_importance_length_correction": -2740.73583984375, "rps_doc_openwebtext_importance": -1761.724365234375, "rps_doc_openwebtext_importance_length_correction": -1761.724365234375, "rps_doc_wikipedia_importance": -1347.2979736328125, "rps_doc_wikipedia_importance_length_correction": -1347.2979736328125 }, "fasttext": { "dclm": 0.6260858178138733, "english": 0.6379491686820984, "fineweb_edu_approx": 2.3658509254455566, "eai_general_math": 0.9487723112106323, "eai_open_web_math": 0.214868426322937, "eai_web_code": 0.9775742888450623 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "1", "label": "Leftover HTML" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

4,888,997,956,461,977,000

Functions in C with Examples This Tutorial Explains Functions in C with Example(s). What is Function in C? A function is a block of code that performs a specific task. Functions are often used to perform similar tasks on different data sets. There are two types of functions in C, user-defined functions and library functions. • User-defined functions are the functions which are written by the user and included in the program. • Library functions are the inbuilt functions which are already present in the C library (like printf(), scanf() etc). General Syntax of a C Function: type function_name(formal_arguments) /* function definition header */ { statements; /*function body*/ return statement; } Like variables, every function also has a type, meaning that what type of value function returns to its calling function. For example, if function returns an integer, it is of type int; if it returns a float, it is of type float; and so on. Remember that if a function returns nothing to its calling function, its type is void. The function name should be descriptive, stating clearly what the specific task function does. The function name is followed by a pair of parenthesis, within which specify a comma separated list of arguments with their number and types in the order corresponding to arguments from its calling function, and use void if the function does not take any arguments. The function header contains the function type, function name, and any arguments in parenthesis. The function header is immediately followed by a pair of braces containing instructions on how the function performs a specific task. advertisement advertisement Let’s look at an example now. #include <stdio.h> void display(void); /* function declaration */ int main(void) { printf("main: going to call display...\n"); display(); /* call to display() */ return 0; } void display(void) { printf("i am display(): I display massage!\n"); return; } When a function returns nothing i.e. function is of type void, we can use return statement as ‘return;’ i.e. return keyword is not followed by any value. Let’s take one more example, Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now! /* sum2ints.c -- program sums up two integers */ #include <stdio.h> int sum2ints(int, int); /* declaration or function prototype */ int main(void) { int u = 5, v = 10; printf("sum of %d and %d is %d\n", u, v, sum2ints(u, v)); return 0; } /* sum2ints() sums up two integers and returns their sum to calling fun. */ int sum2ints(int x, int y) /* x, y are formal arguments */ { return x + y; } Here’s output, sum of 5 and 10 is 15 In the above program, function sum2ints() takes two integers, sum them up and return their sum to calling function to be displayed to the user. advertisement Example 2: One of the most basic function types is the mathematical function. These functions take one or more numeric arguments and perform a calculation on them, returning a numeric result. For example, the sqrt() function takes a single argument (the number to be square-rooted) and returns its square root: #include <stdio.h> #include <math.h> int main(void) { double num = 25; double root = sqrt(num); //root will be 5.0 printf("The square root of %f is %f\n", num, root); return 0; } Output: The square root of 25.000000 is 5.000000 Another common type of function in C is string function. These functions operate on null-terminated strings (arrays of characters) and usually take two arguments: the first is the string to be operated on, and the second is an integer specifying the maximum length of the resulting string (including the null terminator). advertisement Advantage of Functions in C: • Functions can be written once and then reused in other parts of the program without having to be rewritten. This makes code more reliable and easier to read and maintain. • Functions can make code more modular. Modular code is easier to understand and debug because it is divided into smaller, more manageable pieces. • Functions can promote code reuse and portability. Code that is written in a modular fashion using functions can be easily reused in other programs or ported to other platforms with minimal changes. • It will improve the quality and performance by reducing the amount of code that needs to be executed. Sanfoundry Global Education & Learning Series – 1000 C Tutorials. If you wish to look at all C Tutorials, go to C Tutorials. If you find any mistake above, kindly email to [email protected] advertisement advertisement Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs! Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest Manish Bhojasia - Founder & CTO at Sanfoundry Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn. Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.

{ "url": "https://www.sanfoundry.com/c-tutorials-different-components-function/", "source_domain": "www.sanfoundry.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "174192", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:H2PKZDYXFQXAYOUPBQXV2AOBAF6TFVBM", "WARC-Concurrent-To": "<urn:uuid:91a25e92-6fec-497f-95ff-a03e663a626e>", "WARC-Date": "2024-05-22T21:11:12Z", "WARC-IP-Address": "104.26.13.15", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3LZHP6EP6IMT63G2KTZQVVATH5NZHZIU", "WARC-Record-ID": "<urn:uuid:09019127-877b-4434-84b4-1a3ec12337bd>", "WARC-Target-URI": "https://www.sanfoundry.com/c-tutorials-different-components-function/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a1b423b0-ac42-4713-83ce-3fba1d2efb8d>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 29, 30, 85, 86, 109, 329, 330, 434, 555, 556, 588, 589, 659, 661, 696, 718, 720, 721, 1049, 1050, 1411, 1412, 1643, 1644, 1658, 1672, 1673, 1703, 1704, 1723, 1770, 1772, 1787, 1789, 1837, 1876, 1890, 1892, 1894, 1913, 1915, 1967, 1979, 1981, 1982, 2136, 2137, 2166, 2167, 2254, 2303, 2322, 2386, 2388, 2403, 2405, 2428, 2430, 2492, 2506, 2508, 2510, 2586, 2645, 2647, 2665, 2667, 2668, 2683, 2684, 2706, 2707, 2851, 2852, 2866, 2867, 2878, 2879, 3179, 3180, 3199, 3217, 3219, 3234, 3236, 3257, 3305, 3307, 3363, 3365, 3379, 3381, 3382, 3390, 3431, 3432, 3754, 3755, 3769, 3770, 3799, 3800, 3975, 4124, 4326, 4432, 4433, 4499, 4500, 4559, 4560, 4625, 4626, 4640, 4654, 4885, 4886, 4961, 5007, 5275, 5276 ], "line_end_idx": [ 29, 30, 85, 86, 109, 329, 330, 434, 555, 556, 588, 589, 659, 661, 696, 718, 720, 721, 1049, 1050, 1411, 1412, 1643, 1644, 1658, 1672, 1673, 1703, 1704, 1723, 1770, 1772, 1787, 1789, 1837, 1876, 1890, 1892, 1894, 1913, 1915, 1967, 1979, 1981, 1982, 2136, 2137, 2166, 2167, 2254, 2303, 2322, 2386, 2388, 2403, 2405, 2428, 2430, 2492, 2506, 2508, 2510, 2586, 2645, 2647, 2665, 2667, 2668, 2683, 2684, 2706, 2707, 2851, 2852, 2866, 2867, 2878, 2879, 3179, 3180, 3199, 3217, 3219, 3234, 3236, 3257, 3305, 3307, 3363, 3365, 3379, 3381, 3382, 3390, 3431, 3432, 3754, 3755, 3769, 3770, 3799, 3800, 3975, 4124, 4326, 4432, 4433, 4499, 4500, 4559, 4560, 4625, 4626, 4640, 4654, 4885, 4886, 4961, 5007, 5275, 5276, 5367 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5367, "ccnet_original_nlines": 121, "rps_doc_curly_bracket": 0.0022358899004757404, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3373052179813385, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015582029707729816, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24197983741760254, "rps_doc_frac_unique_words": 0.4117647111415863, "rps_doc_mean_word_length": 5.020833492279053, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0.004582949914038181, "rps_doc_unigram_entropy": 5.236551284790039, "rps_doc_word_count": 816, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02001463994383812, "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.018794240429997444, "rps_doc_frac_chars_top_3gram": 0.011715889908373356, "rps_doc_frac_chars_top_4gram": 0.007810589857399464, "rps_doc_books_importance": -442.90484619140625, "rps_doc_books_importance_length_correction": -442.90484619140625, "rps_doc_openwebtext_importance": -251.57586669921875, "rps_doc_openwebtext_importance_length_correction": -251.57586669921875, "rps_doc_wikipedia_importance": -185.34573364257812, "rps_doc_wikipedia_importance_length_correction": -185.34573364257812 }, "fasttext": { "dclm": 0.22651761770248413, "english": 0.8091177940368652, "fineweb_edu_approx": 3.0704336166381836, "eai_general_math": 0.9479419589042664, "eai_open_web_math": 0.44276565313339233, "eai_web_code": 0.7486720085144043 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1332", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "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": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

2,105,154,617,999,289,000

• Home • / • Blog • / • Lifestyle • / • How Cybersecurity Measures Protect Your Data on Online Dating Sites Published on February 8, 2024 How Cybersecurity Measures Protect Your Data on Online Dating Sites In an era where online interactions shape our social landscape, online dating sites have become integral platforms for meeting potential partners. As the digital romance landscape expands, the importance of cybersecurity measures cannot be overstated. This deep dive explores the ways in which top dating websites prioritize cybersecurity to safeguard user data, ensuring a secure and enjoyable experience for individuals seeking love in the digital realm. 1. The Pervasive Nature of Online Dating: Online dating has transcended societal norms to become a mainstream avenue for meeting romantic partners. Top dating websites have witnessed a surge in user registrations, reflecting the increasing reliance on these platforms to connect with like-minded individuals in an ever-connected world. 2. The Goldmine of Personal Information: While online dating provides a convenient way to meet potential partners, it also involves sharing personal information. From profiles detailing interests and preferences to private messages exchanged between users, the digital realm becomes a goldmine of personal data, making cybersecurity paramount. 3. Encryption: The First Line of Defense: Top dating websites prioritize the use of encryption to secure the transmission of data between users and the platform. Encryption protocols, such as SSL (Secure Sockets Layer) and TLS (Transport Layer Security), ensure that sensitive information, including login credentials and private messages, remains unreadable to unauthorized parties. 4. Robust Authentication Processes: Defending Against Unauthorized Access: Ensuring that only authorized users access their accounts is a fundamental aspect of cybersecurity in online dating. Top dating websites implement robust authentication processes, including secure login mechanisms and, in some cases, two-factor authentication (2FA), adding an extra layer of protection against unauthorized access. 5. Data Privacy Policies: Establishing Trust through Transparency: Transparent data privacy policies are a hallmark of top dating websites committed to cybersecurity. These policies outline how user data is collected, stored, and used. By providing clear and accessible information, dating platforms build trust with users, who can make informed decisions about sharing their personal information. 6. Regular Security Audits: Proactive Measures for Continuous Protection: Top dating websites conduct regular security audits to identify vulnerabilities and ensure ongoing compliance with cybersecurity best practices. These audits may be performed by internal security teams or third-party cybersecurity firms, contributing to the continuous improvement of the platform’s security posture. 7. Scam and Fraud Prevention: Mitigating Risks in the Digital Dating Landscape: The digital dating landscape is not without risks, including scams and fraudulent activities. Top dating websites implement measures to detect and prevent scams, using advanced algorithms and machine learning to identify suspicious behavior. This proactive approach helps protect users from falling victim to fraudulent schemes. 8. Secure Payment Processing: Safeguarding Financial Transactions: For dating platforms that offer premium or subscription-based services, secure payment processing is crucial. Top dating websites integrate trusted payment gateways with encryption to protect users’ financial information during transactions. This ensures that payment details remain confidential and secure. 9. Educating Users on Cybersecurity Practices: Empowering the Digital Daters: Empowering users with knowledge about cybersecurity practices is a shared responsibility. Top dating websites often provide educational resources and tips on safe online dating. This may include guidance on creating strong passwords, recognizing and reporting suspicious activities, and practicing caution when sharing personal information. 10. Addressing Geolocation Privacy Concerns: Balancing Convenience and Safety: Geolocation features in dating apps enhance the user experience by connecting individuals based on proximity. However, top dating websites must strike a balance between convenience and safety. Robust cybersecurity measures are implemented to protect the privacy of users’ location data, ensuring that it is shared securely and with user consent. 11. Artificial Intelligence (AI) for User Safety: Enhancing Threat Detection: Top dating websites leverage artificial intelligence (AI) to enhance user safety. AI algorithms analyze user behavior patterns to detect anomalies that may indicate fraudulent activities or potential security threats. This proactive use of AI contributes to a safer online dating environment. 12. Incident Response Plans: Swift Action in the Face of Security Incidents: Despite preventive measures, security incidents may still occur. Top dating websites have well-defined incident response plans in place to ensure swift and effective action in the event of a security breach. This includes communication strategies, user notifications, and steps taken to mitigate the impact on user data. 13. User Reporting Mechanisms: Empowering Users to Contribute to Safety: Empowering users to play an active role in cybersecurity is integral. Top dating websites provide user-friendly reporting mechanisms that allow individuals to flag suspicious profiles or activities. This collaborative effort enhances the platform’s ability to identify and address potential security threats. 14. Regulatory Compliance: Navigating Legal Frameworks for User Protection: Top dating websites operate within legal frameworks that mandate data protection and user privacy. Compliance with regulations, such as the General Data Protection Regulation (GDPR), underscores the commitment of these platforms to prioritize user protection and adhere to international cybersecurity standards. 15. Transparent Communication: Building Trust in the Digital Dating Space: Transparent communication is a cornerstone of cybersecurity in online dating. Top dating websites prioritize open and clear communication with users, keeping them informed about security measures, updates, and any potential risks. This transparency fosters trust and reinforces the platform’s commitment to user safety. Conclusion: The Ever-Evolving Landscape of Cybersecurity in Online Dating: As online dating continues to evolve, so does the cybersecurity landscape within the digital romance realm. Top dating websites recognize the responsibility to protect user data and prioritize implementing robust cybersecurity measures. The intersection of entertainment and cybersecurity in online dating reflects a commitment to creating a secure, enjoyable, and trustworthy environment for individuals seeking love in the digital age. As technology advances, so will the innovative cybersecurity strategies employed by top dating websites, ensuring that the quest for love remains exciting and secure in the ever-expanding digital realm. You may also like May 24, 2024 The Role of Pets in Enhancing Life at Residential Care Facilities May 24, 2024 Navigating Life Insurance for Cancer Patients: A Comprehensive Guide May 24, 2024 Why Core and Pelvic Floor Health is Crucial to Women’s Wellbeing May 24, 2024 Considerations to Make When Choosing the Right Hiking Boots May 24, 2024 Stress and Nutrition: How a Balanced Diet Can Help You Cope May 24, 2024 To Stand Out In Any Room In The US – You Need The Following Clothes Tips In 2024 May 23, 2024 Leveraging Technology for Success: Day Trading in the Digital Age May 23, 2024 Financial Security in the Digital Age: Protecting Your Online Assets May 23, 2024 Your Money, Your Future: The Importance of Financial Literacy

{ "url": "https://psychtimes.com/lifestyle/how-cybersecurity-measures-protect-your-data-on-online-dating-sites/", "source_domain": "psychtimes.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "265182", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QKWUG7WGODMHR6PV6CTYVWXW53JXXERS", "WARC-Concurrent-To": "<urn:uuid:7c30b39a-df46-4d33-b23e-c872c956d1d8>", "WARC-Date": "2024-05-25T05:50:13Z", "WARC-IP-Address": "13.58.30.219", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3UTEUFZM6S2POEV2S24WPLSESBB4NJJM", "WARC-Record-ID": "<urn:uuid:b882e3a9-c84f-439e-9b4d-53ac2fbae73a>", "WARC-Target-URI": "https://psychtimes.com/lifestyle/how-cybersecurity-measures-protect-your-data-on-online-dating-sites/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:24dc4e66-d8fd-40e1-b03b-f6f1b54fb4e3>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-211\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, 9, 15, 24, 30, 44, 50, 122, 152, 153, 221, 222, 475, 476, 681, 682, 724, 725, 1019, 1020, 1061, 1062, 1365, 1366, 1408, 1409, 1751, 1752, 1827, 1828, 2160, 2161, 2228, 2229, 2560, 2561, 2635, 2636, 2953, 2954, 3034, 3035, 3364, 3365, 3432, 3433, 3741, 3742, 3820, 3821, 4162, 4163, 4242, 4243, 4589, 4590, 4668, 4669, 4962, 4963, 5040, 5041, 5362, 5363, 5436, 5437, 5746, 5747, 5823, 5824, 6136, 6137, 6212, 6213, 6533, 6534, 6609, 6610, 6848, 6849, 7051, 7052, 7255, 7256, 7257, 7275, 7276, 7289, 7290, 7356, 7357, 7370, 7371, 7440, 7441, 7454, 7455, 7520, 7521, 7534, 7535, 7595, 7596, 7609, 7610, 7670, 7671, 7684, 7685, 7766, 7767, 7780, 7781, 7847, 7848, 7861, 7862, 7931, 7932, 7945, 7946 ], "line_end_idx": [ 9, 15, 24, 30, 44, 50, 122, 152, 153, 221, 222, 475, 476, 681, 682, 724, 725, 1019, 1020, 1061, 1062, 1365, 1366, 1408, 1409, 1751, 1752, 1827, 1828, 2160, 2161, 2228, 2229, 2560, 2561, 2635, 2636, 2953, 2954, 3034, 3035, 3364, 3365, 3432, 3433, 3741, 3742, 3820, 3821, 4162, 4163, 4242, 4243, 4589, 4590, 4668, 4669, 4962, 4963, 5040, 5041, 5362, 5363, 5436, 5437, 5746, 5747, 5823, 5824, 6136, 6137, 6212, 6213, 6533, 6534, 6609, 6610, 6848, 6849, 7051, 7052, 7255, 7256, 7257, 7275, 7276, 7289, 7290, 7356, 7357, 7370, 7371, 7440, 7441, 7454, 7455, 7520, 7521, 7534, 7535, 7595, 7596, 7609, 7610, 7670, 7671, 7684, 7685, 7766, 7767, 7780, 7781, 7847, 7848, 7861, 7862, 7931, 7932, 7945, 7946, 8007 ] }

{ "red_pajama_v2": { "ccnet_original_length": 8007, "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.2275172919034958, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.007686399854719639, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.16756340861320496, "rps_doc_frac_unique_words": 0.40754038095474243, "rps_doc_mean_word_length": 5.965888500213623, "rps_doc_num_sentences": 62, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.462949752807617, "rps_doc_word_count": 1114, "rps_doc_frac_chars_dupe_10grams": 0.017454110085964203, "rps_doc_frac_chars_dupe_5grams": 0.046795058995485306, "rps_doc_frac_chars_dupe_6grams": 0.04243154078722, "rps_doc_frac_chars_dupe_7grams": 0.04243154078722, "rps_doc_frac_chars_dupe_8grams": 0.031297020614147186, "rps_doc_frac_chars_dupe_9grams": 0.017454110085964203, "rps_doc_frac_chars_top_2gram": 0.02302137017250061, "rps_doc_frac_chars_top_3gram": 0.043484799563884735, "rps_doc_frac_chars_top_4gram": 0.016250379383563995, "rps_doc_books_importance": -557.4166259765625, "rps_doc_books_importance_length_correction": -557.4166259765625, "rps_doc_openwebtext_importance": -274.0078125, "rps_doc_openwebtext_importance_length_correction": -274.0078125, "rps_doc_wikipedia_importance": -172.17184448242188, "rps_doc_wikipedia_importance_length_correction": -172.17184448242188 }, "fasttext": { "dclm": 0.02254760079085827, "english": 0.884647011756897, "fineweb_edu_approx": 1.404563069343567, "eai_general_math": 0.0008977699908427894, "eai_open_web_math": 0.05372219905257225, "eai_web_code": 0.0021339100785553455 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "302.3", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social psychology" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "13", "label": "News (Org.)" } }, "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": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

4,436,498,210,029,217,000

generaltypo3 Connect to MySQL/MariaDB from a different machine IMPORTANT: By default, the database port for the nodes in this solution cannot be accessed over a public IP address. As a result, you will only be able to connect to your database nodes from machines that are running in the same network. For security reasons, we do not recommend making the database port accessible over a public IP address. If you must make it accessible over a public IP address, we recommend restricting access to a trusted list of source IP addresses using firewall rules. For development purposes, you can also use a VPN or SSH tunnel. Refer to the FAQ for information on accessing restricted ports using an SSH tunnel or opening ports in the server firewall. Once you have an active SSH tunnel or you have opened the port for remote access, you can connect to the database server using a command like the one below. Remember to replace SOURCE-PORT with the source port number specified in the SSH tunnel configuration or 3306 if you opened the port for remote access. $ mysql -h 127.0.0.1 -P SOURCE-PORT -u root -p You will be prompted to enter the root user password. This is the same as the application password. Last modification September 5, 2018

{ "url": "https://docs.bitnami.com/general/apps/typo3/administration/connect-remotely/", "source_domain": "docs.bitnami.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "65139", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NH5FGSLI5VDNPWCHIHSODDNB6MGR5453", "WARC-Concurrent-To": "<urn:uuid:52fbdaca-627e-4ccd-a2f6-87889f0d81ce>", "WARC-Date": "2020-02-21T04:22:39Z", "WARC-IP-Address": "3.225.120.173", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WECSVXH4QFHLKL5OZAN7P4B6A333UUR5", "WARC-Record-ID": "<urn:uuid:7dda2a6b-71dc-4a7f-9ad0-2f6dacc95607>", "WARC-Target-URI": "https://docs.bitnami.com/general/apps/typo3/administration/connect-remotely/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3a88feca-3796-4414-854e-27de2a8301af>" }, "warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-123.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, 13, 14, 64, 65, 747, 748, 905, 906, 1058, 1059, 1106, 1107, 1207, 1208 ], "line_end_idx": [ 13, 14, 64, 65, 747, 748, 905, 906, 1058, 1059, 1106, 1107, 1207, 1208, 1243 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1243, "ccnet_original_nlines": 14, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4032258093357086, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.06451612710952759, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14516128599643707, "rps_doc_frac_unique_words": 0.5352112650871277, "rps_doc_mean_word_length": 4.666666507720947, "rps_doc_num_sentences": 14, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.433818817138672, "rps_doc_word_count": 213, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.1368209272623062, "rps_doc_frac_chars_dupe_6grams": 0.1167002022266388, "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.03621729835867882, "rps_doc_frac_chars_top_3gram": 0.03319919854402542, "rps_doc_frac_chars_top_4gram": 0.03923540934920311, "rps_doc_books_importance": -146.01194763183594, "rps_doc_books_importance_length_correction": -146.01194763183594, "rps_doc_openwebtext_importance": -83.46463775634766, "rps_doc_openwebtext_importance_length_correction": -83.46463775634766, "rps_doc_wikipedia_importance": -70.89704895019531, "rps_doc_wikipedia_importance_length_correction": -70.89704895019531 }, "fasttext": { "dclm": 0.07159751653671265, "english": 0.8588641881942749, "fineweb_edu_approx": 2.6102378368377686, "eai_general_math": 0.40942084789276123, "eai_open_web_math": 0.14664798974990845, "eai_web_code": 0.2980484962463379 } }

{ "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.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

1,580,493,566,972,013,000

RSS .NET Databases in the Cloud: Elysian Fields or Briar Patch? PaaS, Public, Private Clouds The Platform-as-a-Service (PaaS) solution bundles developer tools and a data store, but users who opt to use an infrastructure provider or build a private cloud have to match the data store or database to their application requirements and budget. There are open source and commercial products that have a wide range of capabilities, from scalable simple data stores to robust platforms for complex query and transaction processing. Databases, data stores, and data access software for cloud computing must be evaluated for suitability for both public and private clouds and for the class of applications supported. For example, Amazon Dynamo was built to operate in a trusted environment, without authentication and authorization requirements. Whether the environment supports multi-tenant or multi-instance applications also influences the database decision. Databases and Data Stores Data management options for the cloud include single format data stores, document databases, column data stores, semantic data stores, federated databases and object-relational databases. The latter group includes "Swiss Army Knife" servers from IBM, Microsoft, OpenLink, and Oracle that process SQL tables, XML documents, RDF triples and user-defined types. Building a petabyte size web search index is a very different problem from processing an order or mapping wireless networks. The requirements of the application and data store for those tasks are quite different. For new applications hosted in the cloud, developers will look primarily to several classes of data store: • SQL/XML (object-relational) databases • Column data stores • Distributed hash table (DHT), simple key-value stores • Tuple spaces variants, in-memory databases, entity-attribute-value stores and other non-SQL databases having features such as filtering, sorting, range queries and transactions. Because this cornucopia of data stores has diverse capabilities, it's important to understand application requirements for scalability, load balancing, consistency, data integrity, transaction support and security. Some newer data stores are an exercise in minimalism. They avoid joins and don't implement schemas or strong typing, instead storing data as strings or blobs. Scalability with very large data set operations is a requirement for cloud computing, which has contributed to the recent enthusiasm for the DHT and distributed key-value stores. Associative arrays, dictionaries, hash tables, rings, and tuple spaces have been around for years, as have entity-attribute-value (EAV) stores, database partitions and federated databases. But cloud computing puts an emphasis on scalability and load balancing by distributing data across multiple servers. The need for low-latency data stores has created an Internet buzz about key-value stores, distributed hash tables (DHT), entity-attribute-value stores and data distribution by sharding. Tuple spaces are a solution for distributed shared memory that originated with the Linda effort at Yale that spawned more than 20 implementations, including Object Spaces, JavaSpaces, GigaSpaces, LinuxTuples, IBM TSpaces, and PyLinda. You can find GigaSpaces eXtreme Application Platform as a pay-per-use service on Amazon EC2. It includes a local and distributed Jini transaction manager, Java Transaction API (JTA), JDBC support, with b-tree and hash-based indexing capabilities. Amazon SimpleDB also provides standard tuple spaces interfaces, but adds secondary indexing and support for additional query operators. For large data sets and databases, partitioning data has been a facilitator of parallel query processing and load balancing. Horizontal partitioning, referred to as sharding, has caught the attention of developers looking to build multi-terabyte cloud databases because of its success at Amazon, Digg, eBay, Facebook, Flickr, Friendster, Skype, and YouTube. SQLAlchemy and Hibernate Shards, object-relational mappers for Python and Java, respectively, provide sharding that's useful for cloud database design. Google developed Hibernate Shards for data clusters before donating it to the Hibernate project. You can do manual sharding for a platform such as Google AppEngine, use SQLAlchemy or Hibernate Shards for Python or Java development, or use a cloud data store such as MongoDB that provides administrative commands for creating shards. Distributed Hash Table, Key-Value Data Stores Distributed hash tables and key-value stores are tools for building scalable, load balanced applications, not for enforcing rigid data integrity, consistency and Atomic Consistent Isolated Durable (ACID) properties for transactions. They have limited applicability for applications doing ad hoc query and complex analytics processing. Products in this group include memcached, MemcacheDB, Project Voldemort, Scalaris, and Tokyo Cabinet. Memcached is ubiquitous and a popular solution for caching for database-powered web sites. It's a big associative array that's accessed with a get or put function, using the key that's a unique identifier for data. It's particularly useful for caching information produced by expensive SQL queries, such as counts and aggregate values. MemcacheDB is a distributed key-value data store that conforms to the memcached protocol but uses Berkeley DB for data persistence. Scalaris is a distributed key-value store, implemented in Erlang, which has a non-blocking commit protocol for transactions. Using the Web interface, you can read or write a key-value pair, with each operation being an atomic transaction. Using Java, you can execute more complex transactions. Scalaris has strong consistency and supports symmetric replication, but does not have persistent storage. The open source Tokyo Cabinet database library is causing a buzz in online discussions about key-value stores. It's blazingly fast, capable of storing 1 million records in 0.7 seconds using the hash table engine and 1.6 seconds using the b-tree engine. The data model is one value per key and it supports LZW compression. When keys are ordered, it can do prefix and range matching. For handling transactions, it features write ahead logging and shadow paging. Tokyo Tyrant is a database server version of Tokyo Cabinet that's been used to cache large SQL databases for high-volume applications. Some products of this group support queries over ranges of keys, but ad hoc query operations and aggregate operations (sum, average, grouping) require programming because they are not built-in. Hadoop MapReduce Hadoop MapReduce would be a nominee for the Academy Award for parallel processing of very large data sets, if one existed. It's fault-tolerant and has developed a strong following in the grid and cloud computing communities, including developers at Google, Yahoo, Microsoft, and Facebook. Open source Hadoop is available from Apache, a commercial version is available from CloudEra and Amazon offers an Elastic MapReduce service based on Hadoop. MapReduce operates over the Hadoop Distributed File System (HDFS), with file splits and data stored as key value pairs. The HDFS enables partitioning data for multiple machines to do parallel processing of batches and reduce processing time. MapReduce is suitable for processing very large data sets for purposes such as building search index engines or data mining, but not for online applications requiring sub-second response times. Frameworks built on top of Hadoop, such as Hive and Pig, are useful for extracting information from databases for Hadoop processing. The eHarmony.com site is an example of the marriage of an Oracle database and Amazon MapReduce, using the latter for analytics involving millions of users. Entity-Attribute-Value Datastores EAV stores are derived from data management technology that pre-dates the relational model for data. They do not have the full feature set of an SQL DBMS, such as a rich query model based on a non-procedural, declarative query language. But they are more than a simple key-value data store. EAV data stores from major cloud computing providers include Amazon SimpleDB, Google AppEngine datastore and Microsoft SQL Data Services. And one type, the RDF datastore used for knowledge bases and ontology projects, has been deployed in the cloud. Google Bigtable uses a distributed file system and it can store very large data sets (petabyte size) on thousands of servers. It's the underlying technology for the Google AppEngine datastore. Google uses it, in combination with MapReduce, for indexing the Web and for applications such as Google Earth. Bigtable is a solution for projects that require analyzing a large collection, for example the one billion web pages and 4.78 billion URLs in the ClueWeb09 data set from Carnegie Mellon University. For those seeking an open source alternative to Bigtable for use with Hadoop, Hypertable, and HBase have developed a following. Hypertable runs on top of a distributed file system, such as HDFS. HBase data is organized by table, row and multi-valued columns and there's an integrator-style interface for scanning a range of rows. Hypertable is implemented in C++, whereas HBase is implemented in Java. The Google AppEngine includes a schemaless data store that's optimized for reading, supports atomic transactions and consistency, and stores entities with properties. It permits filtering and sorting on keys and properties. It has 21 built-in data types, including list, blob, postal address and geographical point. Applications can define entity groupings as the basis for performing transactional updates and use GQL, a SQL-like query language. Access to the Google AppEngine datastore is programmable using Python interfaces for queries over objects known as entities. The datastore is also programmable using Java Data Objects (JDO) and Java Persistence API. Although AppEngine bundles a data store, the AppScale project provides software for operating with data stores such as HBase, Hypertable, MongoDB and MySQL. Related Reading More Insights Currently we allow the following HTML tags in comments: Single tags These tags can be used alone and don't need an ending tag. <br> Defines a single line break <hr> Defines a horizontal line Matching tags These require an ending tag - e.g. <i>italic text</i> <a> Defines an anchor <b> Defines bold text <big> Defines big text <blockquote> Defines a long quotation <caption> Defines a table caption <cite> Defines a citation <code> Defines computer code text <em> Defines emphasized text <fieldset> Defines a border around elements in a form <h1> This is heading 1 <h2> This is heading 2 <h3> This is heading 3 <h4> This is heading 4 <h5> This is heading 5 <h6> This is heading 6 <i> Defines italic text <p> Defines a paragraph <pre> Defines preformatted text <q> Defines a short quotation <samp> Defines sample computer code text <small> Defines small text <span> Defines a section in a document <s> Defines strikethrough text <strike> Defines strikethrough text <strong> Defines strong text <sub> Defines subscripted text <sup> Defines superscripted text <u> Defines underlined text Dr. Dobb's encourages readers to engage in spirited, healthy debate, including taking us to task. However, Dr. Dobb's moderates all comments posted to our site, and reserves the right to modify or remove any content that it determines to be derogatory, offensive, inflammatory, vulgar, irrelevant/off-topic, racist or obvious marketing or spam. Dr. Dobb's further reserves the right to disable the profile of any commenter participating in said activities. Disqus Tips To upload an avatar photo, first complete your Disqus profile. | View the list of supported HTML tags you can use to style comments. | Please read our commenting policy. Best of the Web First C Compiler Now on Github The earliest known C compiler by the legendary Dennis Ritchie has been published on the repository. Quick Read HTML5 Mobile Development: Seven Good Ideas (and Three Bad Ones) HTML5 Mobile Development: Seven Good Ideas (and Three Bad Ones) Quick Read Building Bare Metal ARM Systems with GNU All you need to know to get up and running... and programming on ARM Quick Read Amazon's Vogels Challenges IT: Rethink App Dev Amazon Web Services CTO says promised land of cloud computing requires a new generation of applications that follow different principles. Quick Read How to Select a PaaS Partner Eventually, the vast majority of Web applications will run on a platform-as-a-service, or PaaS, vendor's infrastructure. To help sort out the options, we sent out a matrix with more than 70 decision points to a variety of PaaS providers. Quick Read More "Best of the Web" >> Video

{ "url": "http://www.drdobbs.com/windows/databases-in-the-cloud-elysian-fields-or/218900502?pgno=2", "source_domain": "www.drdobbs.com", "snapshot_id": "crawl=CC-MAIN-2013-20", "warc_metadata": { "Content-Length": "115760", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:75CE6HLSVRVF235ZSJTMQTFHNWXTOGQT", "WARC-Concurrent-To": "<urn:uuid:fa947a6f-a3e7-4992-9858-159b81a989e3>", "WARC-Date": "2013-05-20T01:57:46Z", "WARC-IP-Address": "192.155.48.108", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:FEYFVT2RNRGN6NUCSRVCLY3D6PIOFQ5D", "WARC-Record-ID": "<urn:uuid:e91664fc-85a3-4f4e-90cc-4664a0bed98d>", "WARC-Target-URI": "http://www.drdobbs.com/windows/databases-in-the-cloud-elysian-fields-or/218900502?pgno=2", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:312e76c8-bb4a-4d1d-8f4d-787841fc7aed>" }, "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, 4, 5, 10, 11, 66, 67, 68, 97, 98, 531, 532, 960, 961, 987, 988, 1347, 1348, 1668, 1669, 1711, 1734, 1792, 1974, 1975, 2528, 2529, 3021, 3022, 3640, 3641, 3999, 4000, 4485, 4486, 4532, 4533, 4868, 4869, 5439, 5440, 5840, 5841, 6436, 6437, 6631, 6632, 6649, 6650, 7096, 7097, 7822, 7823, 7857, 7858, 8399, 8400, 9304, 9305, 10125, 10126, 10127, 10143, 10144, 10145, 10159, 10160, 10161, 10162, 10163, 10164, 10165, 10221, 10222, 10234, 10235, 10294, 10295, 10328, 10329, 10360, 10361, 10375, 10376, 10430, 10431, 10453, 10454, 10476, 10477, 10500, 10501, 10539, 10540, 10574, 10575, 10601, 10602, 10636, 10637, 10666, 10667, 10721, 10722, 10745, 10746, 10769, 10770, 10793, 10794, 10817, 10818, 10841, 10842, 10865, 10866, 10890, 10891, 10915, 10916, 10948, 10949, 10979, 10980, 11021, 11022, 11049, 11050, 11089, 11090, 11121, 11122, 11158, 11159, 11188, 11189, 11220, 11221, 11254, 11255, 11283, 11284, 11741, 11742, 11744, 11926, 11928, 11929, 11945, 11946, 11977, 11978, 12078, 12079, 12090, 12091, 12155, 12156, 12220, 12221, 12232, 12233, 12274, 12275, 12344, 12345, 12356, 12357, 12404, 12405, 12543, 12544, 12555, 12556, 12585, 12586, 12824, 12825, 12836, 12837, 12838, 12864, 12865 ], "line_end_idx": [ 4, 5, 10, 11, 66, 67, 68, 97, 98, 531, 532, 960, 961, 987, 988, 1347, 1348, 1668, 1669, 1711, 1734, 1792, 1974, 1975, 2528, 2529, 3021, 3022, 3640, 3641, 3999, 4000, 4485, 4486, 4532, 4533, 4868, 4869, 5439, 5440, 5840, 5841, 6436, 6437, 6631, 6632, 6649, 6650, 7096, 7097, 7822, 7823, 7857, 7858, 8399, 8400, 9304, 9305, 10125, 10126, 10127, 10143, 10144, 10145, 10159, 10160, 10161, 10162, 10163, 10164, 10165, 10221, 10222, 10234, 10235, 10294, 10295, 10328, 10329, 10360, 10361, 10375, 10376, 10430, 10431, 10453, 10454, 10476, 10477, 10500, 10501, 10539, 10540, 10574, 10575, 10601, 10602, 10636, 10637, 10666, 10667, 10721, 10722, 10745, 10746, 10769, 10770, 10793, 10794, 10817, 10818, 10841, 10842, 10865, 10866, 10890, 10891, 10915, 10916, 10948, 10949, 10979, 10980, 11021, 11022, 11049, 11050, 11089, 11090, 11121, 11122, 11158, 11159, 11188, 11189, 11220, 11221, 11254, 11255, 11283, 11284, 11741, 11742, 11744, 11926, 11928, 11929, 11945, 11946, 11977, 11978, 12078, 12079, 12090, 12091, 12155, 12156, 12220, 12221, 12232, 12233, 12274, 12275, 12344, 12345, 12356, 12357, 12404, 12405, 12543, 12544, 12555, 12556, 12585, 12586, 12824, 12825, 12836, 12837, 12838, 12864, 12865, 12870 ] }

{ "red_pajama_v2": { "ccnet_original_length": 12870, "ccnet_original_nlines": 182, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29808494448661804, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01998334936797619, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17485429346561432, "rps_doc_frac_unique_words": 0.3870967626571655, "rps_doc_mean_word_length": 5.426639080047607, "rps_doc_num_sentences": 96, "rps_doc_symbol_to_word_ratio": 0.00041631999192759395, "rps_doc_unigram_entropy": 5.873129367828369, "rps_doc_word_count": 1922, "rps_doc_frac_chars_dupe_10grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_5grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_6grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_7grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_8grams": 0.009779480285942554, "rps_doc_frac_chars_dupe_9grams": 0.009779480285942554, "rps_doc_frac_chars_top_2gram": 0.012464050203561783, "rps_doc_frac_chars_top_3gram": 0.007478429935872555, "rps_doc_frac_chars_top_4gram": 0.004889740142971277, "rps_doc_books_importance": -1315.7193603515625, "rps_doc_books_importance_length_correction": -1315.7193603515625, "rps_doc_openwebtext_importance": -626.7582397460938, "rps_doc_openwebtext_importance_length_correction": -626.7582397460938, "rps_doc_wikipedia_importance": -508.7757263183594, "rps_doc_wikipedia_importance_length_correction": -508.7757263183594 }, "fasttext": { "dclm": 0.1293012499809265, "english": 0.8676885366439819, "fineweb_edu_approx": 2.4696104526519775, "eai_general_math": 0.2443264126777649, "eai_open_web_math": 0.13482379913330078, "eai_web_code": 0.48380738496780396 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "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

4,534,899,630,759,176,700

Einen String n-mal duplizieren (Auszug aus "XSLT Kochbuch" von Sal Mangano) Problem Sie müssen einen String n-mal duplizieren, wobei n ein Parameter ist. Zum Beispiel müssen Sie einen String mit Leerzeichen auffüllen, um eine bestimmte Ausrichtung zu erreichen. Lösung XSLT 1.0 Eine schöne Lösung ist ein rekursiver Ansatz, der den Eingabestring so lange verdoppelt, bis er die erforderliche Länge erreicht hat, wobei sorgfältig Fälle behandelt werden, in denen $count ungerade ist: <xsl:template name="dup"> <xsl:param name="input"/> <xsl:param name="count" select="2"/> <xsl:choose> <xsl:when test="not($count) or not($input)"/> <xsl:when test="$count = 1"> <xsl:value-of select="$input"/> </xsl:when> <xsl:otherwise>  <xsl:if test="$count mod 2"> <xsl:value-of select="$input"/> </xsl:if>  <xsl:call-template name="dup"> <xsl:with-param name="input" select="concat($input,$input)"/> <xsl:with-param name="count" select="floor($count div 2)"/> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:template> XSLT 2.0 In 2.0 können wir das Duplizieren ziemlich einfach mit einem for-Ausdruck erledigen. Wir überladen dup, um das Verhalten des vorgegebenen Arguments in der XSLT 1.0-Implementierung zu replizieren: <xsl:function name="ckbk:dup"> <xsl:param name="input" as="xs:string"/> <xsl:sequence select="ckbk:dup($input,2)"/> </xsl:function> <xsl:function name="ckbk:dup"> <xsl:param name="input" as="xs:string"/> <xsl:param name="count" as="xs:integer"/> <xsl:sequence select="string-join(for $i in 1 to $count return $input,'')"/> </xsl:function> Diskussion XSLT 1.0 Die offensichtlichste Methode, um einen String $count-mal zu duplizieren, besteht darin, eine Möglichkeit zu ermitteln, den String $count-1-mal mit sich selbst zu verketten. Dies kann mit Hilfe des folgenden Codes rekursiv erledigt werden, allerdings ist dieser Code für größere $count-Werte sehr aufwändig und wird deshalb nicht empfohlen: <xsl:template name="slow-dup"> <xsl:param name="input"/> <xsl:param name="count" select="1"/> <xsl:param name="work" select="$input"/> <xsl:choose> <xsl:when test="not($count) or not($input)"/> <xsl:when test="$count=1"> <xsl:value-of select="$work"/>< </xsl:when> <xsl:otherwise> <xsl:call-template name="slow-dup"> <xsl:with-param name="input" select="$input"/> <xsl:with-param name="count" select="$count - 1"/> <xsl:with-param name="work" select="concat($work,$input)"/> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:template> Ein besserer Ansatz wird in der Lösung oben gezeigt. Die Lösung beschränkt die Anzahl der rekursiven Aufrufe und Verkettungen auf die Größenordnung log2($count), indem wiederholt die Eingabe verdoppelt und der Zähler halbiert werden, solange der Zähler größer als 1 ist. Die slow-dup-Implementierung ist heikel, da sie einen künstlichen Arbeitsparameter erfordert, um die ursprüngliche Eingabe zu beobachten. Sie kann außerdem aufgrund der Rekursion von $count-1 ein Stack-Wachstum zur Folge haben und erfordert $count-1-Aufrufe von concat(). Vergleichen Sie das mit dup, das das Stack-Wachstum auf floor(log2($count)) beschränkt und nur ceiling(log2($count))-Aufrufe von concat() verlangt. Anmerkung: Zugunsten der slow-dup-Technik lässt sich anbringen, dass sie auch verwendet wird, um zusätzlich zu den Strings auch die Struktur zu duplizieren, wenn wir xsl:value-of durch xsl:copy-of ersetzen. Das schnellere dup besitzt in diesem Fall keinen Vorteil, da die Kopien als Parameter übergeben werden, was aufwändig ist. Eine andere Lösung, die auf dem Code des EXSLT-str:padding beruht, damit aber nicht identisch ist, sieht so aus: <xsl:template name="dup"> <xsl:param name="input"/> <xsl:param name="count" select="1"/> <xsl:choose> <xsl:when test="not($count) or not($input)" /> <xsl:otherwise> <xsl:variable name="string" select="concat($input, $input, $input, $input, $input, $input, $input, $input, $input, $input)"/> <xsl:choose> <xsl:when test="string-length($string) >= $count * string-length($input)"> <xsl:value-of select="substring($string, 1, $count * string-length($input))" /> </xsl:when> <xsl:otherwise> <xsl:call-template name="dup"> <xsl:with-param name="input" select="$string" /> <xsl:with-param name="count" select="$count div 10" /> </xsl:call-template> </xsl:otherwise> </xsl:choose> </xsl:otherwise> </xsl:choose> </xsl:template> Diese Implementierung legt zehn Kopien der Eingabe an. Wenn dieser Ansatz mehr erreicht, als erforderlich ist, stutzt er das Ergebnis auf die gewünschte Größe. Ansonsten wendet er das Template rekursiv an. Diese Lösung ist langsamer, da sie oft mehr Verkettungen vornimmt, als notwendig sind, und sie verwendet substring(), das bei manchen XSLT-Implementierungen langsam sein kann. Im Rezept Text ersetzen finden Sie eine Erklärung. Die Lösung erweist sich für solche Prozessoren als vorteilhaft, die die Endrekursion nicht optimieren, da sie die Anzahl der rekursiven Aufrufe deutlich verringert. Siehe auch Die sogenannte Piez-Methode kann einen String ebenfalls ohne Rekursion duplizieren. Diese Methode wird im Artikel XSLT – Efficient Programming Techniques (PDF) besprochen. Sie verwendet eine for-each-Schleife auf jeder verfügbaren Quelle von Knoten (oft auf dem Stylesheet selbst). Obwohl diese Methode in der Praxis außerordentlich effektiv sein kann, finde ich sie unzulänglich, da sie davon ausgeht, dass genügend Knoten zur Verfügung stehen, um die erforderliche Iteration auszuführen. << zurückvor >> Tipp der data2type-Redaktion: Zum Thema XSLT bieten wir auch folgende Schulungen zur Vertiefung und professionellen Fortbildung an: Copyright © 2006 O'Reilly Verlag GmbH & Co. KG Für Ihren privaten Gebrauch dürfen Sie die Online-Version ausdrucken. Ansonsten unterliegt dieses Kapitel aus dem Buch "XSLT Kochbuch" denselben Bestimmungen, wie die gebundene Ausgabe: Das Werk einschließlich aller seiner Teile ist urheberrechtlich geschützt. Alle Rechte vorbehalten einschließlich der Vervielfältigung, Übersetzung, Mikroverfilmung sowie Einspeicherung und Verarbeitung in elektronischen Systemen. O'Reilly Verlag GmbH & Co. KG, Balthasarstraße 81, 50670 Köln, kommentar(at)oreilly.de

{ "url": "https://www.data2type.de/xml-xslt-xslfo/xslt/xslt-kochbuch/strings/string-n-mal-duplizieren", "source_domain": "www.data2type.de", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "70205", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:7S75ZVYCINTGD4T5LK2MFTJC6O3LZYTH", "WARC-Concurrent-To": "<urn:uuid:728b349d-895e-4f37-83dc-9080c860a94f>", "WARC-Date": "2021-07-25T00:34:00Z", "WARC-IP-Address": "94.16.109.107", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:ZUTHKDXK6YSHA7FGZEMF7OJO4GCFKU3Y", "WARC-Record-ID": "<urn:uuid:0d6a2f96-f061-422c-ad7b-8e0ffad01185>", "WARC-Target-URI": "https://www.data2type.de/xml-xslt-xslfo/xslt/xslt-kochbuch/strings/string-n-mal-duplizieren", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7b9f96ee-908a-4081-bc83-6c2c98dd7bca>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-204.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, 31, 32, 77, 78, 86, 87, 265, 266, 273, 274, 283, 284, 489, 490, 516, 544, 583, 598, 648, 681, 719, 735, 755, 846, 881, 921, 937, 1048, 1085, 1155, 1223, 1250, 1271, 1287, 1303, 1304, 1313, 1314, 1510, 1511, 1542, 1585, 1631, 1647, 1648, 1679, 1722, 1766, 1845, 1861, 1862, 1873, 1874, 1883, 1884, 2225, 2226, 2257, 2285, 2324, 2367, 2382, 2432, 2463, 2501, 2517, 2537, 2579, 2634, 2693, 2761, 2788, 2809, 2825, 2841, 2842, 3533, 3534, 3545, 3864, 3865, 3978, 3979, 4005, 4033, 4072, 4087, 4138, 4158, 4290, 4309, 4395, 4485, 4505, 4529, 4570, 4631, 4698, 4729, 4754, 4774, 4795, 4811, 4827, 4828, 5426, 5427, 5438, 5439, 5929, 5930, 5933, 5934, 5950, 5951, 5953, 5954, 5956, 5957, 5959, 5960, 5990, 6092, 6093, 6140, 6210, 6557, 6558 ], "line_end_idx": [ 31, 32, 77, 78, 86, 87, 265, 266, 273, 274, 283, 284, 489, 490, 516, 544, 583, 598, 648, 681, 719, 735, 755, 846, 881, 921, 937, 1048, 1085, 1155, 1223, 1250, 1271, 1287, 1303, 1304, 1313, 1314, 1510, 1511, 1542, 1585, 1631, 1647, 1648, 1679, 1722, 1766, 1845, 1861, 1862, 1873, 1874, 1883, 1884, 2225, 2226, 2257, 2285, 2324, 2367, 2382, 2432, 2463, 2501, 2517, 2537, 2579, 2634, 2693, 2761, 2788, 2809, 2825, 2841, 2842, 3533, 3534, 3545, 3864, 3865, 3978, 3979, 4005, 4033, 4072, 4087, 4138, 4158, 4290, 4309, 4395, 4485, 4505, 4529, 4570, 4631, 4698, 4729, 4754, 4774, 4795, 4811, 4827, 4828, 5426, 5427, 5438, 5439, 5929, 5930, 5933, 5934, 5950, 5951, 5953, 5954, 5956, 5957, 5959, 5960, 5990, 6092, 6093, 6140, 6210, 6557, 6558, 6644 ] }

{ "red_pajama_v2": { "ccnet_original_length": 6644, "ccnet_original_nlines": 128, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.06767956167459488, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01035911962389946, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3715469539165497, "rps_doc_frac_unique_words": 0.502754807472229, "rps_doc_mean_word_length": 6.752066135406494, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.5168914794921875, "rps_doc_word_count": 726, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.1066911518573761, "rps_doc_frac_chars_dupe_6grams": 0.04875560849905014, "rps_doc_frac_chars_dupe_7grams": 0.009179930202662945, "rps_doc_frac_chars_dupe_8grams": 0.009179930202662945, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.016319869086146355, "rps_doc_frac_chars_top_3gram": 0.02141983062028885, "rps_doc_frac_chars_top_4gram": 0.024479800835251808, "rps_doc_books_importance": -815.6532592773438, "rps_doc_books_importance_length_correction": -815.6532592773438, "rps_doc_openwebtext_importance": -428.7812805175781, "rps_doc_openwebtext_importance_length_correction": -428.7812805175781, "rps_doc_wikipedia_importance": -318.21380615234375, "rps_doc_wikipedia_importance_length_correction": -318.21380615234375 }, "fasttext": { "dclm": 0.7913529872894287, "english": 0.004770460072904825, "fineweb_edu_approx": 2.0835556983947754, "eai_general_math": 0.005448880139738321, "eai_open_web_math": 0.5708882212638855, "eai_web_code": 0.33954715728759766 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.736", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "4", "label": "Advanced Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

264,810,136,644,657,950

Webmail Display Attachment How come my webmail always display there is an attachment? Even thought they are just plain email with no attachment. It is so ignoring to see all emails with attachments. Is this a bug or setting which I can set? Thanks Rocky That’s most likely the result of the email actually being sent with an “attachment”, such as an html version of the email - you can tell for sure by viewing the source of the email. –rlparker Have you checked the message headers yet? What is the value of Content-type? To check the message headers in Squirrelmail, click on View Full Header :cool: [color=#6600CC]Atropos[/color] | openvein.org Here are two emails one from yahoo and the other one from outlook. Thanks Rocky Message-ID: 00b201c744ff$6b9d7920$6401a8c0@McIntosh MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_00B3_01C744BC.5D7A3920" X-Mailer: Microsoft Office Outlook 11 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.3028 Thread-Index: AcdE/2pKmcbq99dxQhe1ANJDc8cCLg== and other email MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="0-1184064125-1170133708=:33111" Content-Transfer-Encoding: 8bit Message-ID: 760058.33111.qm@web37305.mail.mud.yahoo.com Well there you go! [5.1.3. Mixed Subtype The “mixed” subtype of “multipart” is intended for use when the body parts are independent and need to be bundled in a particular order. Any “multipart” subtypes that an implementation does not recognize must be treated as being of subtype “mixed”. 5.1.4. Alternative Subtype The “multipart/alternative” type is syntactically identical to "multipart/mixed", but the semantics are different. In particular, each of the body parts is an “alternative” version of the same information. :cool: [color=#6600CC]Atropos[/color] | openvein.org

{ "url": "https://discussion.dreamhost.com/t/webmail-display-attachment/41282", "source_domain": "discussion.dreamhost.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "19816", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XMSUSMHDYTDCTAP6WW4R4ZKCJT2JFS5Y", "WARC-Concurrent-To": "<urn:uuid:2e3fe909-1621-4c8d-94a2-348cfd9add49>", "WARC-Date": "2021-04-14T22:27:48Z", "WARC-IP-Address": "64.90.62.206", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:4YUGUGPBFG6AFNEXXFLKRQ5AYG4DEMDA", "WARC-Record-ID": "<urn:uuid:6de0b1b4-a324-4af1-80df-d8207a4814c7>", "WARC-Target-URI": "https://discussion.dreamhost.com/t/webmail-display-attachment/41282", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:38c83a56-99b9-40de-83af-50c5f0435925>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-126.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, 27, 28, 200, 242, 243, 250, 251, 257, 258, 440, 441, 451, 452, 529, 530, 602, 603, 656, 657, 724, 725, 732, 733, 739, 740, 792, 810, 841, 894, 932, 989, 1036, 1037, 1053, 1054, 1072, 1151, 1183, 1239, 1240, 1259, 1260, 1282, 1283, 1352, 1420, 1487, 1532, 1533, 1560, 1561, 1624, 1691, 1754, 1767, 1768 ], "line_end_idx": [ 27, 28, 200, 242, 243, 250, 251, 257, 258, 440, 441, 451, 452, 529, 530, 602, 603, 656, 657, 724, 725, 732, 733, 739, 740, 792, 810, 841, 894, 932, 989, 1036, 1037, 1053, 1054, 1072, 1151, 1183, 1239, 1240, 1259, 1260, 1282, 1283, 1352, 1420, 1487, 1532, 1533, 1560, 1561, 1624, 1691, 1754, 1767, 1768, 1820 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1820, "ccnet_original_nlines": 56, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2756892144680023, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.027568919584155083, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.32832080125808716, "rps_doc_frac_unique_words": 0.6244725584983826, "rps_doc_mean_word_length": 6.101265907287598, "rps_doc_num_sentences": 34, "rps_doc_symbol_to_word_ratio": 0.005012529902160168, "rps_doc_unigram_entropy": 4.754430294036865, "rps_doc_word_count": 237, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0, "rps_doc_frac_chars_dupe_6grams": 0, "rps_doc_frac_chars_dupe_7grams": 0, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.017289070412516594, "rps_doc_frac_chars_top_3gram": 0.02074689045548439, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -164.19288635253906, "rps_doc_books_importance_length_correction": -161.6671905517578, "rps_doc_openwebtext_importance": -82.65098571777344, "rps_doc_openwebtext_importance_length_correction": -82.65098571777344, "rps_doc_wikipedia_importance": -68.01578521728516, "rps_doc_wikipedia_importance_length_correction": -67.99484252929688 }, "fasttext": { "dclm": 0.10093569755554199, "english": 0.796250581741333, "fineweb_edu_approx": 2.4516358375549316, "eai_general_math": 0.09582740068435669, "eai_open_web_math": 0.23183071613311768, "eai_web_code": 0.06404387950897217 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.822", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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

-2,644,304,848,452,775,000

DEV Community Abhishek Chaudhary Abhishek Chaudhary Posted on Longest Common Subsequence Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters. • For example, "ace" is a subsequence of "abcde". A common subsequence of two strings is a subsequence that is common to both strings. Example 1: Input: text1 = "abcde", text2 = "ace" Output: 3 Explanation: The longest common subsequence is "ace" and its length is 3. Example 2: Input: text1 = "abc", text2 = "abc" Output: 3 Explanation: The longest common subsequence is "abc" and its length is 3. Example 3: Input: text1 = "abc", text2 = "def" Output: 0 Explanation: There is no such common subsequence, so the result is 0. Constraints: • 1 <= text1.length, text2.length <= 1000 • text1 and text2 consist of only lowercase English characters. SOLUTION: class Solution: def lcs(self, text1: str, text2: str, i, j) -> int: if (i, j) in self.cache: return self.cache[(i, j)] if i >= len(text1) or j >= len(text2): self.cache[(i, j)] = 0 return 0 if text1[i] == text2[j]: self.cache[(i, j)] = 1 + self.lcs(text1, text2, i + 1, j + 1) return self.cache[(i, j)] else: a = self.lcs(text1, text2, i + 1, j) b = self.lcs(text1, text2, i, j + 1) self.cache[(i, j)] = max(a, b) return self.cache[(i, j)] def longestCommonSubsequence(self, text1: str, text2: str, i = 0, j = 0) -> int: self.cache = {} return self.lcs(text1, text2, 0, 0) Enter fullscreen mode Exit fullscreen mode Top comments (0)

{ "url": "https://dev.to/theabbie/longest-common-subsequence-5g28", "source_domain": "dev.to", "snapshot_id": "CC-MAIN-2024-26", "warc_metadata": { "Content-Length": "738477", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:K6PNQYGXPCS463XNSD3UYY3EEB5GHG3X", "WARC-Concurrent-To": "<urn:uuid:1bdbaebd-0efd-49ee-beb4-dc743ccc2800>", "WARC-Date": "2024-06-21T01:10:49Z", "WARC-IP-Address": "151.101.130.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VPUQG657HYYXLIUXFRH3ROQSXLKCCJQZ", "WARC-Record-ID": "<urn:uuid:38a54b68-4bda-4a84-ae51-f860e9a39848>", "WARC-Target-URI": "https://dev.to/theabbie/longest-common-subsequence-5g28", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:5d053116-2bff-48ad-a08a-d12a0b2bf3cb>" }, "warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-185\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 14, 15, 34, 53, 54, 64, 65, 92, 93, 228, 229, 414, 415, 467, 468, 553, 554, 565, 566, 604, 614, 615, 689, 690, 701, 702, 738, 748, 822, 823, 834, 835, 871, 881, 951, 952, 965, 966, 1010, 1076, 1077, 1087, 1088, 1104, 1160, 1193, 1231, 1278, 1313, 1334, 1367, 1441, 1479, 1493, 1542, 1591, 1634, 1672, 1673, 1758, 1782, 1826, 1869, 1870 ], "line_end_idx": [ 14, 15, 34, 53, 54, 64, 65, 92, 93, 228, 229, 414, 415, 467, 468, 553, 554, 565, 566, 604, 614, 615, 689, 690, 701, 702, 738, 748, 822, 823, 834, 835, 871, 881, 951, 952, 965, 966, 1010, 1076, 1077, 1087, 1088, 1104, 1160, 1193, 1231, 1278, 1313, 1334, 1367, 1441, 1479, 1493, 1542, 1591, 1634, 1672, 1673, 1758, 1782, 1826, 1869, 1870, 1886 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1886, "ccnet_original_nlines": 64, "rps_doc_curly_bracket": 0.0010604499839246273, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.23348018527030945, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00881057046353817, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4229075014591217, "rps_doc_frac_unique_words": 0.3759689927101135, "rps_doc_mean_word_length": 4.732558250427246, "rps_doc_num_sentences": 24, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.196919918060303, "rps_doc_word_count": 258, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.17362816631793976, "rps_doc_frac_chars_dupe_6grams": 0.11302211135625839, "rps_doc_frac_chars_dupe_7grams": 0.07698608189821243, "rps_doc_frac_chars_dupe_8grams": 0.07698608189821243, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.09746109694242477, "rps_doc_frac_chars_top_3gram": 0.07862407714128494, "rps_doc_frac_chars_top_4gram": 0.03439803048968315, "rps_doc_books_importance": -202.2864532470703, "rps_doc_books_importance_length_correction": -202.28453063964844, "rps_doc_openwebtext_importance": -111.68004608154297, "rps_doc_openwebtext_importance_length_correction": -111.68004608154297, "rps_doc_wikipedia_importance": -78.2571792602539, "rps_doc_wikipedia_importance_length_correction": -78.2571792602539 }, "fasttext": { "dclm": 0.9973978400230408, "english": 0.8097452521324158, "fineweb_edu_approx": 3.2167487144470215, "eai_general_math": 0.9946310520172119, "eai_open_web_math": 0.16596662998199463, "eai_web_code": 0.6118254065513611 } }

{ "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": "511.6", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Arithmetic" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-8,472,322,687,529,952,000

Take the 2-minute tour × Server Fault is a question and answer site for professional system and network administrators. It's 100% free, no registration required. I have a system where to the main server (homes, nfs, ntp, queue...) can log-in only root – all the other users use front-end host with NFS-mounted home directories (RW) and all other software directories (read-only). My problem is, that time to time, if root or normal user with sudo makes some administrative works on front-end some homes of normal users getting set-uid/gid bits (drwsr-sr-x). If it happens usually the user can't log-in (as long as permission for his home are not changed to drwxr-xr-x). The last time I saw it after compiling some new software (normal user configure;make) and installation from the same directory as root (su and make install or direct as normal user sudo make install). Can somebody explain me why it happens and what should I do to get rid of this problem? p.s. I'm using CentOS 5.7 share|improve this question SetUID/GID bits are NOT Sticky bits! – mdpc Jun 15 '12 at 22:14 add comment Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook. Your Answer discard By posting your answer, you agree to the privacy policy and terms of service. Browse other questions tagged or ask your own question.

{ "url": "http://serverfault.com/questions/399293/set-uid-gid-bits-on-nfs-file-system", "source_domain": "serverfault.com", "snapshot_id": "crawl=CC-MAIN-2014-10", "warc_metadata": { "Content-Length": "59725", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DKD5KF6RW7ZXPWEGAUHHOMJKJLGWUNZ7", "WARC-Concurrent-To": "<urn:uuid:cea7c4de-5fae-43a7-ba00-2c907961f13a>", "WARC-Date": "2014-03-09T10:17:26Z", "WARC-IP-Address": "198.252.206.140", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6PUN7LZZ7JIDDVOLZMWCJDSD7QE3S7GC", "WARC-Record-ID": "<urn:uuid:096019b7-a254-4342-aeb2-64dc250511ec>", "WARC-Target-URI": "http://serverfault.com/questions/399293/set-uid-gid-bits-on-nfs-file-system", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:83cfcec7-a127-4d7a-accd-156f6bda265f>" }, "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, 162, 163, 381, 382, 672, 673, 874, 875, 963, 964, 990, 991, 1019, 1021, 1086, 1098, 1099, 1200, 1201, 1213, 1214, 1216, 1224, 1225, 1303, 1304 ], "line_end_idx": [ 25, 162, 163, 381, 382, 672, 673, 874, 875, 963, 964, 990, 991, 1019, 1021, 1086, 1098, 1099, 1200, 1201, 1213, 1214, 1216, 1224, 1225, 1303, 1304, 1359 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1359, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.34201952815055847, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026058629155158997, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.22149837017059326, "rps_doc_frac_unique_words": 0.640350878238678, "rps_doc_mean_word_length": 4.609649181365967, "rps_doc_num_sentences": 16, "rps_doc_symbol_to_word_ratio": 0.0032573300413787365, "rps_doc_unigram_entropy": 4.80347204208374, "rps_doc_word_count": 228, "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.028544239699840546, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -149.30088806152344, "rps_doc_books_importance_length_correction": -149.30076599121094, "rps_doc_openwebtext_importance": -88.3232650756836, "rps_doc_openwebtext_importance_length_correction": -88.3232650756836, "rps_doc_wikipedia_importance": -48.14823913574219, "rps_doc_wikipedia_importance_length_correction": -48.03517532348633 }, "fasttext": { "dclm": 0.06909198313951492, "english": 0.8995791673660278, "fineweb_edu_approx": 1.285634160041809, "eai_general_math": 0.00043029000516980886, "eai_open_web_math": 0.11995387077331543, "eai_web_code": 0.0001758900034474209 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "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": "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": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-2,462,372,383,176,524,300

Count Tens and Ones Within 100 Add to Fav Rate 0 stars Quiz size: Message preview: Someone you know has shared quiz with you: To play this quiz, click on the link below: https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname... To know more about different quizzes, please visit www.turtlediary.com Hope you have a good experience with this site and recommend to your friends too. Login to rate activities and track progress. Login to rate activities and track progress. Remember the relation: 10 ones = 1 ten 3 a Let's consider an example. Let's write the tens and ones in the number 56. 56 = ___ ten(s) + ___ one(s) We need to find the missing numbers in the above sentence. We have: 56 = 50 + 6 = 5 tens + 6 ones So, the missing numbers are 5 and 6. ds A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Help The correct answer is Remember : The smallest number is the one that comes first while counting. Solution : To arrange the given numbers in order from smallest to greatest, find the smallest number among all the given numbers. 21,27,23 21 is the smallest number.

{ "url": "https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname...", "source_domain": "www.turtlediary.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "161528", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:YEIHSVBPNTQVJTT64AEDZTFB57FBCR3J", "WARC-Concurrent-To": "<urn:uuid:fd45ed4a-d848-48aa-8168-60646c6accf0>", "WARC-Date": "2024-05-22T06:08:59Z", "WARC-IP-Address": "52.85.132.122", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:G6DBGDPIVWPOYFMRX4ZIYV7XNISZFC6W", "WARC-Record-ID": "<urn:uuid:f1a90f8e-276b-499d-8c8a-3f29ccb7536d>", "WARC-Target-URI": "https://www.turtlediary.com/quiz/count-tens-and-ones-within-100.html?app=1?topicname...", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:45087f9e-b349-4f15-b6e5-ac1d6b6725e5>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-211\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, 2, 4, 5, 36, 37, 61, 72, 89, 132, 133, 177, 178, 266, 267, 338, 339, 421, 422, 467, 512, 513, 536, 537, 539, 540, 556, 558, 559, 563, 564, 566, 641, 643, 672, 731, 733, 734, 743, 745, 746, 776, 778, 779, 816, 817, 818, 819, 820, 821, 824, 825, 877, 878, 883, 884, 906, 907, 918, 919, 983, 984, 995, 996, 1115, 1116, 1125, 1126 ], "line_end_idx": [ 2, 4, 5, 36, 37, 61, 72, 89, 132, 133, 177, 178, 266, 267, 338, 339, 421, 422, 467, 512, 513, 536, 537, 539, 540, 556, 558, 559, 563, 564, 566, 641, 643, 672, 731, 733, 734, 743, 745, 746, 776, 778, 779, 816, 817, 818, 819, 820, 821, 824, 825, 877, 878, 883, 884, 906, 907, 918, 919, 983, 984, 995, 996, 1115, 1116, 1125, 1126, 1152 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1152, "ccnet_original_nlines": 67, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.294545441865921, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09454544633626938, "rps_doc_frac_lines_end_with_ellipsis": 0.014705879613757133, "rps_doc_frac_no_alph_words": 0.27636364102363586, "rps_doc_frac_unique_words": 0.6294416189193726, "rps_doc_mean_word_length": 4.233502388000488, "rps_doc_num_sentences": 18, "rps_doc_symbol_to_word_ratio": 0.0036363599356263876, "rps_doc_unigram_entropy": 4.5478668212890625, "rps_doc_word_count": 197, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_6grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_7grams": 0.08872901648283005, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.039568349719047546, "rps_doc_frac_chars_top_3gram": 0.06115107983350754, "rps_doc_frac_chars_top_4gram": 0.050359711050987244, "rps_doc_books_importance": -148.24403381347656, "rps_doc_books_importance_length_correction": -148.24403381347656, "rps_doc_openwebtext_importance": -99.95982360839844, "rps_doc_openwebtext_importance_length_correction": -97.4112548828125, "rps_doc_wikipedia_importance": -92.45426177978516, "rps_doc_wikipedia_importance_length_correction": -92.45426177978516 }, "fasttext": { "dclm": 0.9603680372238159, "english": 0.8632020950317383, "fineweb_edu_approx": 2.363574743270874, "eai_general_math": 0.11191611737012863, "eai_open_web_math": 0.1345367431640625, "eai_web_code": 0.00011074999929405749 } }

{ "free_decimal_correspondence": { "primary": { "code": "513.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "372.7", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Education, Elementary and Kindergarten" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "1", "label": "Factual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-9,098,149,672,645,933,000

Remove & Uninstall HJ-Split 2.4 Completely from Windows Do you have trouble in completely uninstalling HJ-Split 2.4 from your system? Are you searching for an effective solution to thoroughly get rid of it off your PC? Don't worry! You have come to the right place and you will be able to uninstall HJ-Split 2.4 without any difficulty. Problems You may Encounter when Uninstalling HJ-Split 2.4 * HJ-Split 2.4 does not work as good as you thought. * You can not uninstall HJ-Split 2.4 with Add or Remove Programs in Control Panel. * You keep receiving error messages when you are uninstalling HJ-Split 2.4. * HJ-Split 2.4 is still running in the background even after you uninstalled it. * You can still find the folders and files of HJ-Split 2.4 after the uninstallation. There may be many other problems computer users run into when uninstalling HJ-Split 2.4. As a matter of fact, those issues are caused by improper uninstallation of the program. Also, if the program is corrupted or damaged, users may not be able to uninstall it. Here, you will learn how to correctly and completely remove HJ-Split 2.4. Recommended Solution: Manually Uninstall HJ-Split 2.4 via Add or Remove Programs As it's known to most of computer users, the most common way to uninstall a program is via Add or Remove Programs. 1.Exit HJ-Split 2.4 and end all of its processes before uninstalling it. Tips: if you can not exit the program, you can run your PC in Safe Mode. Restart your PC and keep pressing F8 key before your Windows loads. Select Safe Mode with Networking and hit Enter key. safe mode with networking 2.Click Start menu and then select Control Panel. start control panel 3.Find and click Add/ Remove Programs. add remove programs 4.Find HJ-Split 2.4 in the list and click Remove button to initiate the uninstallation. Video of How to Uninstall HJ-Split 2.4 via Add or Remove Programs: Manually Uninstall HJ-Split 2.4 with Its Own Uninstaller If you do not want to use Control Panel to uninstall HJ-Split 2.4, you can also uninstall it with its own uninstaller. 1.Go to the desktop and find the icon of HJ-Split 2.4. 2.Right click its icon and click Properties. software properties 3.Click Find Target option. find target 4.Find and run unins000.exe or uninstall.exe in its installation folder. 5.Follow its uninstall dialog and click "Yes" to uninstall it. 6.Reboot your machine after the uninstallation. Both of the above uninstallation methods are the most common methods for people to uninstall HJ-Split 2.4. Yet, they only allow you to uninstall small programs with few files and are not able to completely remove stubborn software like HJ-Split 2.4. So, the possibility is that many invalid registry files and program files are left in your system and hard disk. If you leave them in your system, your system registry will be stuffed with useless entries and system becomes unstable and slow. In such situation, you need to manually delete those entries and files left in the registry and the system. Manually Delete the Remanent Files of HJ-Split 2.4 No matter you use Add or Remove Programs or its uninstaller to uninstall the software, it's necessary for you to get rid of the hidden files and components to ensure a 100% complete uninstallation. 1. Delete invalid registry entries * Click Start and Run * Type in regedit in the dialog and click OK start registry editor * Find and delete registry entries of the program, such as in HKEY_CURRENT_USER\Software\HJ-Split 2.4 and HKEY_LOCAL_MACHINE\SOFTWARE\HJ-Split 2.4 2. Delete associated files and folders First you need to show all hidden files in your computer. * Open My Computer and select Folder Options. show hidden files * Find and delete files of the program, such as in C:\Program Files\HJ-Split 2.4, C:\Documents and Settings\user name\Application Data\HJ-Split 2.4 and C:\Document and Settings\All Users\Application Data\HJ-Split 2.4 Some programs may have other files in other locations. Therefore, manually editing registry could be very time-consuming and risky. Please know that Windows registry is the most important central base of your computer. So, you should be extremely careful when deleting entries there. Otherwise, your system will be crashed. A Better Way to Automatically Uninstall HJ-Split 2.4 Since most of computer users are not comfortable in manually removing HJ-Split 2.4, it's really advisable for them to resort to the automatic method that is a powerful third-party uninstaller. A powerful third-party uninstaller can * Uninstall all kinds of software safer and faster. * Uninstall half-installed or uninstalled software. * Handle those stubborn software that Add/ Remove Programs cannot. * Detect and remove all associated files and components of the software. * Tidy the registry and improve system performance. * Save your hassle to uninstall the software. Step 1: Click and Download Automatic HJ-Split 2.4 Uninstaller Step 2: Install and launch the Uninstaller on the PC Step 3: Select HJ-Split 2.4 and click Uninstall button to uninstall.

{ "url": "http://www.quicklyuninstall.com/article/Quickly-Uinstall-HJ-Split-2.4.html", "source_domain": "www.quicklyuninstall.com", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "16082", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QXIPQMXIKLE54PIGUC5MWRIFXYOJELMB", "WARC-Concurrent-To": "<urn:uuid:9c083bef-d050-4fee-bc03-ca724bf74721>", "WARC-Date": "2019-03-19T04:00:53Z", "WARC-IP-Address": "45.56.121.35", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:MSGSN5UR5CGVJ4VHYQBJKTTEMONABKGM", "WARC-Record-ID": "<urn:uuid:115c5ecd-1137-4acb-b632-a9a64f2a1b84>", "WARC-Target-URI": "http://www.quicklyuninstall.com/article/Quickly-Uinstall-HJ-Split-2.4.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:68ae1b7d-14c9-4320-a9d0-6f0555d069f6>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-30-226-49.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 56, 57, 337, 338, 396, 397, 450, 451, 534, 535, 611, 612, 693, 694, 779, 780, 1116, 1117, 1139, 1140, 1141, 1142, 1201, 1202, 1317, 1318, 1391, 1392, 1585, 1586, 1612, 1613, 1663, 1664, 1684, 1685, 1724, 1725, 1745, 1746, 1834, 1835, 1902, 1903, 1904, 1905, 1962, 1963, 2082, 2083, 2138, 2139, 2184, 2185, 2205, 2206, 2234, 2235, 2247, 2248, 2321, 2322, 2385, 2386, 2434, 2435, 3036, 3037, 3088, 3089, 3287, 3288, 3323, 3324, 3346, 3347, 3392, 3393, 3415, 3416, 3563, 3564, 3603, 3604, 3662, 3663, 3709, 3710, 3728, 3729, 3946, 3947, 4271, 4272, 4325, 4326, 4558, 4559, 4611, 4612, 4664, 4665, 4732, 4733, 4806, 4807, 4859, 4860, 4906, 4907, 4969, 4970, 5023, 5024 ], "line_end_idx": [ 56, 57, 337, 338, 396, 397, 450, 451, 534, 535, 611, 612, 693, 694, 779, 780, 1116, 1117, 1139, 1140, 1141, 1142, 1201, 1202, 1317, 1318, 1391, 1392, 1585, 1586, 1612, 1613, 1663, 1664, 1684, 1685, 1724, 1725, 1745, 1746, 1834, 1835, 1902, 1903, 1904, 1905, 1962, 1963, 2082, 2083, 2138, 2139, 2184, 2185, 2205, 2206, 2234, 2235, 2247, 2248, 2321, 2322, 2385, 2386, 2434, 2435, 3036, 3037, 3088, 3089, 3287, 3288, 3323, 3324, 3346, 3347, 3392, 3393, 3415, 3416, 3563, 3564, 3603, 3604, 3662, 3663, 3709, 3710, 3728, 3729, 3946, 3947, 4271, 4272, 4325, 4326, 4558, 4559, 4611, 4612, 4664, 4665, 4732, 4733, 4806, 4807, 4859, 4860, 4906, 4907, 4969, 4970, 5023, 5024, 5092 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5092, "ccnet_original_nlines": 114, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3176795542240143, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04051565006375313, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24677716195583344, "rps_doc_frac_unique_words": 0.3362500071525574, "rps_doc_mean_word_length": 5.022500038146973, "rps_doc_num_sentences": 93, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.931194305419922, "rps_doc_word_count": 800, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05027376860380173, "rps_doc_frac_chars_dupe_6grams": 0.029865600168704987, "rps_doc_frac_chars_dupe_7grams": 0.019910400733351707, "rps_doc_frac_chars_dupe_8grams": 0.019910400733351707, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.05599800869822502, "rps_doc_frac_chars_top_3gram": 0.0403185710310936, "rps_doc_frac_chars_top_4gram": 0.023643599823117256, "rps_doc_books_importance": -506.00433349609375, "rps_doc_books_importance_length_correction": -506.00433349609375, "rps_doc_openwebtext_importance": -255.68267822265625, "rps_doc_openwebtext_importance_length_correction": -255.68267822265625, "rps_doc_wikipedia_importance": -188.12120056152344, "rps_doc_wikipedia_importance_length_correction": -188.12120056152344 }, "fasttext": { "dclm": 0.020507629960775375, "english": 0.8906198143959045, "fineweb_edu_approx": 1.348465919494629, "eai_general_math": 0.2969517111778259, "eai_open_web_math": 0.2607787251472473, "eai_web_code": 0.244867742061615 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.462", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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

-915,593,016,867,813,000

Sync Deezer with Hearthis.at Replace automatically Deezer playlist tracks on a Hearthis.at playlist How to keep in sync a playlist from Deezer to Hearthis.at ? The steps below can help you to create a synchronization between a Deezer playlist and a Hearthis.at playlist. After your synchronization was created, daily/weekly/monthly, your Deezer playlist tracks will be automatically merged in your Hearthis.at playlist. Premium Playlists Synchronize 1. Open the Web App Open 2. Click on the Synchronize tool () in left panel of the interface 3. Select your Deezer source playlist (if no Deezer playlists was show you have maybe to connect this platform) 4. Select Hearthis.at as destination service (and connect this platform) 5. Select the Hearthis.at playlist (you can create directly a new playlist by selecting 'New playlist') 6. Configure your synchronization (start date/time, frequency, method) 7. Confirm to create your synchronization (you can show the detail in 'My syncs' tab in the left panel) See your syncs How to keep in sync a recent Deezer to Hearthis.at transfer ? You have recently converted a Deezer playlist to Hearthis.at and now you want to keep this two playlist in sync ? The steps below can help you : Premium Playlists Synchronize 1. Open the Web App Open 2. Go to your recent transfers See your recent transfers 3. Find the Deezer to Hearthis.at transfer you want to keep synchronize and click on Keep Sync () 4. Configure your synchronization (start date/time, frequency, method) 5. Confirm to create your synchronization (you can show the detail in 'My syncs' tab in the left panel) See your syncs Take a look to our explanation page to know more about Sync, update playlists automatically across streaming services.

{ "url": "https://soundiiz.com/tutorial/sync-deezer-with-hearthis", "source_domain": "soundiiz.com", "snapshot_id": "crawl=CC-MAIN-2020-05", "warc_metadata": { "Content-Length": "22911", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RGQW6MZB7HLJZWKF6NFZ3ZWVHIUZDYCU", "WARC-Concurrent-To": "<urn:uuid:6c11081d-9387-46db-b9f0-6e767851c24e>", "WARC-Date": "2020-01-29T10:33:19Z", "WARC-IP-Address": "130.211.22.237", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:NAGEF3EUBNNB4JLDDFXOIAITC6QIWN23", "WARC-Record-ID": "<urn:uuid:e511125c-146c-4674-8f41-4c22aea22aab>", "WARC-Target-URI": "https://soundiiz.com/tutorial/sync-deezer-with-hearthis", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:110e2855-1962-4efd-9f85-07c708f5551a>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-105.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, 29, 30, 101, 102, 162, 163, 423, 424, 454, 481, 550, 664, 739, 845, 918, 1039, 1040, 1102, 1103, 1248, 1249, 1279, 1306, 1365, 1465, 1538, 1659 ], "line_end_idx": [ 29, 30, 101, 102, 162, 163, 423, 424, 454, 481, 550, 664, 739, 845, 918, 1039, 1040, 1102, 1103, 1248, 1249, 1279, 1306, 1365, 1465, 1538, 1659, 1777 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1777, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.34659090638160706, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20738635957241058, "rps_doc_frac_unique_words": 0.36823105812072754, "rps_doc_mean_word_length": 5.05415153503418, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.243209362030029, "rps_doc_word_count": 277, "rps_doc_frac_chars_dupe_10grams": 0.1957142949104309, "rps_doc_frac_chars_dupe_5grams": 0.37285715341567993, "rps_doc_frac_chars_dupe_6grams": 0.33142855763435364, "rps_doc_frac_chars_dupe_7grams": 0.27571427822113037, "rps_doc_frac_chars_dupe_8grams": 0.1957142949104309, "rps_doc_frac_chars_dupe_9grams": 0.1957142949104309, "rps_doc_frac_chars_top_2gram": 0.06785713881254196, "rps_doc_frac_chars_top_3gram": 0.03857142850756645, "rps_doc_frac_chars_top_4gram": 0.015714289620518684, "rps_doc_books_importance": -119.95252227783203, "rps_doc_books_importance_length_correction": -113.12551879882812, "rps_doc_openwebtext_importance": -60.9552001953125, "rps_doc_openwebtext_importance_length_correction": -60.9552001953125, "rps_doc_wikipedia_importance": -34.966915130615234, "rps_doc_wikipedia_importance_length_correction": -33.04206085205078 }, "fasttext": { "dclm": 0.04303150996565819, "english": 0.857842743396759, "fineweb_edu_approx": 1.0508522987365723, "eai_general_math": 0.019661609083414078, "eai_open_web_math": 0.22423887252807617, "eai_web_code": 0.044374700635671616 } }

{ "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": "780", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-6,684,347,857,327,869,000

How to use _Dependency_name method of generated Package Best Keploy code snippet using generated._Dependency_name _Dependency_name Using AI Code Generation copy Full Screen 1var dep = new _Dependency_name();2dep.doSomething();3var dep = new _Dependency_name();4dep.doSomething();5var dep = new _Dependency_name();6dep.doSomething();7var dep = new _Dependency_name();8dep.doSomething();9var dep = new _Dependency_name();10dep.doSomething();11var dep = new _Dependency_name();12dep.doSomething();13var dep = new _Dependency_name();14dep.doSomething();15var dep = new _Dependency_name();16dep.doSomething();17var dep = new _Dependency_name();18dep.doSomething();19var dep = new _Dependency_name();20dep.doSomething();21var dep = new _Dependency_name();22dep.doSomething();23var dep = new _Dependency_name();24dep.doSomething();25var dep = new _Dependency_name();26dep.doSomething();27var dep = new _Dependency_name();28dep.doSomething();29var dep = new _Dependency_name();30dep.doSomething();31var dep = new _Dependency_name();32dep.doSomething(); Full Screen Full Screen _Dependency_name Using AI Code Generation copy Full Screen 1import (2func main() {3dependency.Dependency_name()4}5import (6func main() {7dependency.Dependency_name()8}9I don't want to import the same dependency twice. Is there a way to make it work? Full Screen Full Screen Automation Testing Tutorials Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc. LambdaTest Learning Hubs: YouTube You could also refer to video tutorials over LambdaTest YouTube channel to get step by step demonstration from industry experts. Run Keploy automation tests on LambdaTest cloud grid Perform automation testing on 3000+ real desktop and mobile devices online. Most used method in

{ "url": "https://www.lambdatest.com/automation-testing-advisor/golang/methods/keploy_go.generated._Dependency_name", "source_domain": "www.lambdatest.com", "snapshot_id": "CC-MAIN-2024-33", "warc_metadata": { "Content-Length": "152326", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:INM3L3KQISZHFLL34ZWOCQ7K2DQZZ332", "WARC-Concurrent-To": "<urn:uuid:dfb08d69-9a47-4aa0-b278-3e6e0b7ff5fb>", "WARC-Date": "2024-08-12T03:15:09Z", "WARC-IP-Address": "104.18.5.65", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:BIYM37XZKLSERIP7YIOUCYTA2SOL6YRT", "WARC-Record-ID": "<urn:uuid:005d700d-f062-43ec-ba16-b1a201586ce7>", "WARC-Target-URI": "https://www.lambdatest.com/automation-testing-advisor/golang/methods/keploy_go.generated._Dependency_name", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e465f06a-2386-4901-8fde-3abe3bbbed54>" }, "warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 56, 57, 115, 116, 133, 134, 159, 160, 165, 166, 178, 179, 1051, 1052, 1064, 1065, 1077, 1078, 1095, 1096, 1121, 1122, 1127, 1128, 1140, 1141, 1332, 1333, 1345, 1346, 1358, 1359, 1388, 1389, 1786, 1787, 1813, 1814, 1822, 1823, 1952, 1953, 2006, 2007, 2083, 2084 ], "line_end_idx": [ 56, 57, 115, 116, 133, 134, 159, 160, 165, 166, 178, 179, 1051, 1052, 1064, 1065, 1077, 1078, 1095, 1096, 1121, 1122, 1127, 1128, 1140, 1141, 1332, 1333, 1345, 1346, 1358, 1359, 1388, 1389, 1786, 1787, 1813, 1814, 1822, 1823, 1952, 1953, 2006, 2007, 2083, 2084, 2103 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2103, "ccnet_original_nlines": 46, "rps_doc_curly_bracket": 0.00190203997772187, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.18918919563293457, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008108110167086124, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.26216214895248413, "rps_doc_frac_unique_words": 0.5871559381484985, "rps_doc_mean_word_length": 7.5366973876953125, "rps_doc_num_sentences": 29, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.475287914276123, "rps_doc_word_count": 218, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_6grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_7grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_8grams": 0.05964699015021324, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.05842969939112663, "rps_doc_frac_chars_top_3gram": 0.025562990456819534, "rps_doc_frac_chars_top_4gram": 0.030432140454649925, "rps_doc_books_importance": -191.8749237060547, "rps_doc_books_importance_length_correction": -191.8749237060547, "rps_doc_openwebtext_importance": -103.71275329589844, "rps_doc_openwebtext_importance_length_correction": -103.71275329589844, "rps_doc_wikipedia_importance": -97.6964111328125, "rps_doc_wikipedia_importance_length_correction": -97.6964111328125 }, "fasttext": { "dclm": 0.06032269820570946, "english": 0.5351800918579102, "fineweb_edu_approx": 2.543079137802124, "eai_general_math": 0.033630430698394775, "eai_open_web_math": 0.028791189193725586, "eai_web_code": 0.42324745655059814 } }

{ "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.028", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "6", "label": "Not Applicable/Indeterminate" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,304,146,520,710,452,000

view gcc/config/m32r/t-linux @ 0:a06113de4d67 first commit author kent <kent@cr.ie.u-ryukyu.ac.jp> date Fri, 17 Jul 2009 14:47:48 +0900 parents children 77e2b8dfacca line wrap: on line source # lib1funcs.asm is currently empty. CROSS_LIBGCC1 = # These are really part of libgcc1, but this will cause them to be # built correctly, so... LIB2FUNCS_EXTRA = fp-bit.c dp-bit.c # Turn off the SDA while compiling libgcc2. There are no headers for it # and we want maximal upward compatibility here. TARGET_LIBGCC2_CFLAGS = -G 0 -fPIC fp-bit.c: $(srcdir)/config/fp-bit.c echo '#define FLOAT' > fp-bit.c cat $(srcdir)/config/fp-bit.c >> fp-bit.c dp-bit.c: $(srcdir)/config/fp-bit.c cat $(srcdir)/config/fp-bit.c > dp-bit.c # We need to use -fpic when we are using gcc to compile the routines in # initfini.c. This is only really needed when we are going to use gcc/g++ # to produce a shared library, but since we don't know ahead of time when # we will be doing that, we just always use -fpic when compiling the # routines in initfini.c. # -fpic currently isn't supported for the m32r. CRTSTUFF_T_CFLAGS_S = -fPIC # Don't run fixproto STMP_FIXPROTO = # Don't install "assert.h" in gcc. We use the one in glibc. INSTALL_ASSERT_H = # Do not build libgcc1. Let gcc generate those functions. The GNU/Linux # C library can handle them. LIBGCC1 = CROSS_LIBGCC1 = LIBGCC1_TEST = SHLIB_MAPFILES += $(srcdir)/config/m32r/libgcc-glibc.ver

{ "url": "http://www.cr.ie.u-ryukyu.ac.jp/hg/CbC/CbC_gcc/file/a06113de4d67/gcc/config/m32r/t-linux", "source_domain": "www.cr.ie.u-ryukyu.ac.jp", "snapshot_id": "crawl=CC-MAIN-2021-10", "warc_metadata": { "Content-Length": "6958", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PBVF552FZIMI3AI56SE4AW4MGCNZU276", "WARC-Concurrent-To": "<urn:uuid:2728367b-ab49-4ad6-8305-0777d19e931f>", "WARC-Date": "2021-03-06T23:00:28Z", "WARC-IP-Address": "133.13.50.70", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:KNATWG7BDRKIRVRKTVGMTI2IL3ARISLU", "WARC-Record-ID": "<urn:uuid:72f4a908-9747-4ec1-a8d3-f3afff7788de>", "WARC-Target-URI": "http://www.cr.ie.u-ryukyu.ac.jp/hg/CbC/CbC_gcc/file/a06113de4d67/gcc/config/m32r/t-linux", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c9fa7832-fb7b-44ac-9780-7d1c1ee44478>" }, "warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-142.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: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 46, 47, 60, 100, 137, 145, 167, 181, 193, 194, 230, 246, 247, 314, 339, 340, 376, 377, 450, 499, 500, 535, 536, 572, 605, 648, 649, 685, 727, 728, 800, 875, 949, 1018, 1044, 1092, 1093, 1121, 1122, 1123, 1144, 1160, 1162, 1222, 1241, 1243, 1315, 1344, 1355, 1371, 1386, 1387 ], "line_end_idx": [ 46, 47, 60, 100, 137, 145, 167, 181, 193, 194, 230, 246, 247, 314, 339, 340, 376, 377, 450, 499, 500, 535, 536, 572, 605, 648, 649, 685, 727, 728, 800, 875, 949, 1018, 1044, 1092, 1093, 1121, 1122, 1123, 1144, 1160, 1162, 1222, 1241, 1243, 1315, 1344, 1355, 1371, 1386, 1387, 1443 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1443, "ccnet_original_nlines": 52, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2654155492782593, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.040214478969573975, "rps_doc_frac_lines_end_with_ellipsis": 0.018867919221520424, "rps_doc_frac_no_alph_words": 0.3592493236064911, "rps_doc_frac_unique_words": 0.6666666865348816, "rps_doc_mean_word_length": 5.544973373413086, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0.04557640850543976, "rps_doc_unigram_entropy": 4.641208171844482, "rps_doc_word_count": 189, "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.017175570130348206, "rps_doc_frac_chars_top_3gram": 0.020992370322346687, "rps_doc_frac_chars_top_4gram": 0.04198472946882248, "rps_doc_books_importance": -139.80215454101562, "rps_doc_books_importance_length_correction": -136.4527130126953, "rps_doc_openwebtext_importance": -71.55935668945312, "rps_doc_openwebtext_importance_length_correction": -71.55935668945312, "rps_doc_wikipedia_importance": -67.63914489746094, "rps_doc_wikipedia_importance_length_correction": -59.76068115234375 }, "fasttext": { "dclm": 0.32010871171951294, "english": 0.7169741988182068, "fineweb_edu_approx": 2.8084259033203125, "eai_general_math": 0.9421687126159668, "eai_open_web_math": 0.2256016731262207, "eai_web_code": 0.43824589252471924 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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

3,868,832,875,818,645,500

Question about sky go.... Discussion in 'iPhone' started by The Game 161, Oct 21, 2011. 1. The Game 161 macrumors P6 The Game 161 Joined: Dec 15, 2010 Location: UK #1 When I switch to the 4s from the 4 will the sky go app on my phone still work on the 4s as I switch my sim from the 4 to the 4s or will it just stay on the 4 which my GF will have? 2. FreakinEurekan macrumors 68040 FreakinEurekan Joined: Sep 8, 2011 Location: Eureka Springs, Arkansas #2 Don't know specifically about Sky Go, you could email them and ask... but as a general rule, apps can be loaded on "All" of your iOS devices. When you get the new phone, you'll restore from a backup of your old one and the app will be there (along with any other apps you have). Now if Sky Go only allows one phone at a time to use it, or other service-level restrictions of that nature - that's something they would handle, not Apple. Share This Page

{ "url": "https://forums.macrumors.com/threads/question-about-sky-go.1260104/", "source_domain": "forums.macrumors.com", "snapshot_id": "crawl=CC-MAIN-2018-22", "warc_metadata": { "Content-Length": "133485", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4HPMFJXMIMZEXGTY4RU5OOVR3G3XOUFJ", "WARC-Concurrent-To": "<urn:uuid:d0919f6c-d54a-4434-aae3-198860d22b5d>", "WARC-Date": "2018-05-27T02:30:16Z", "WARC-IP-Address": "162.254.116.251", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:33APZEM7UPQHQZEFVNHKF7HIL5Y6PF7Y", "WARC-Record-ID": "<urn:uuid:a69f32e8-ab80-472a-9633-2f9cfe1942e9>", "WARC-Target-URI": "https://forums.macrumors.com/threads/question-about-sky-go.1260104/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:7619609f-bf86-49cf-9ecc-c4975aae00f8>" }, "warc_info": "robots: classic\r\nhostname: ip-10-79-222-162.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 26, 27, 89, 90, 121, 122, 139, 140, 152, 169, 183, 190, 197, 382, 388, 424, 425, 444, 445, 457, 473, 487, 516, 523, 597, 598, 811, 812, 973, 979, 980 ], "line_end_idx": [ 26, 27, 89, 90, 121, 122, 139, 140, 152, 169, 183, 190, 197, 382, 388, 424, 425, 444, 445, 457, 473, 487, 516, 523, 597, 598, 811, 812, 973, 979, 980, 995 ] }

{ "red_pajama_v2": { "ccnet_original_length": 995, "ccnet_original_nlines": 31, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41203704476356506, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023148149251937866, "rps_doc_frac_lines_end_with_ellipsis": 0.0625, "rps_doc_frac_no_alph_words": 0.24074074625968933, "rps_doc_frac_unique_words": 0.6214689016342163, "rps_doc_mean_word_length": 3.887005567550659, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0.018518520519137383, "rps_doc_unigram_entropy": 4.505232810974121, "rps_doc_word_count": 177, "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.029069770127534866, "rps_doc_frac_chars_top_3gram": 0.04360464960336685, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -100.49651336669922, "rps_doc_books_importance_length_correction": -100.49651336669922, "rps_doc_openwebtext_importance": -52.4947395324707, "rps_doc_openwebtext_importance_length_correction": -38.445960998535156, "rps_doc_wikipedia_importance": -40.14405059814453, "rps_doc_wikipedia_importance_length_correction": -40.14405059814453 }, "fasttext": { "dclm": 0.020418230444192886, "english": 0.9297599792480469, "fineweb_edu_approx": 1.5566478967666626, "eai_general_math": 0.002922950079664588, "eai_open_web_math": 0.10101497173309326, "eai_web_code": 0.00003803000072366558 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "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

4,403,312,752,775,456,000

Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. × E. Beautiful Subarrays time limit per test 3 seconds memory limit per test 512 megabytes input standard input output standard output One day, ZS the Coder wrote down an array of integers a with elements a1, a2, ..., an. A subarray of the array a is a sequence al, al + 1, ..., ar for some integers (l, r) such that 1 ≤ l ≤ r ≤ n. ZS the Coder thinks that a subarray of a is beautiful if the bitwise xor of all the elements in the subarray is at least k. Help ZS the Coder find the number of beautiful subarrays of a! Input The first line contains two integers n and k (1 ≤ n ≤ 106, 1 ≤ k ≤ 109) — the number of elements in the array a and the value of the parameter k. The second line contains n integers ai (0 ≤ ai ≤ 109) — the elements of the array a. Output Print the only integer c — the number of beautiful subarrays of the array a. Examples Input 3 1 1 2 3 Output 5 Input 3 2 1 2 3 Output 3 Input 3 3 1 2 3 Output 2

{ "url": "http://codeforces.com/problemset/problem/665/E", "source_domain": "codeforces.com", "snapshot_id": "crawl=CC-MAIN-2020-10", "warc_metadata": { "Content-Length": "52841", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MV2LKVBINU5DQ6XSN25F2RF6P2QXARVA", "WARC-Concurrent-To": "<urn:uuid:3a98a6fe-0dd9-4198-a893-e7da2ff92d61>", "WARC-Date": "2020-02-18T17:40:03Z", "WARC-IP-Address": "81.27.240.126", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:35RWRNAQXSIV4MGUQXJ6KILWOXYETIBI", "WARC-Record-ID": "<urn:uuid:d431015f-a9be-4f2d-8b0e-14c77aef620b>", "WARC-Target-URI": "http://codeforces.com/problemset/problem/665/E", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:731926d0-d1f2-428d-8747-92d9c6a5b904>" }, "warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-228.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, 148, 149, 172, 192, 202, 224, 238, 244, 259, 266, 282, 283, 373, 374, 620, 621, 684, 685, 691, 692, 838, 839, 924, 925, 932, 933, 1010, 1011, 1020, 1026, 1030, 1036, 1043, 1045, 1051, 1055, 1061, 1068, 1070, 1076, 1080, 1086, 1093 ], "line_end_idx": [ 148, 149, 172, 192, 202, 224, 238, 244, 259, 266, 282, 283, 373, 374, 620, 621, 684, 685, 691, 692, 838, 839, 924, 925, 932, 933, 1010, 1011, 1020, 1026, 1030, 1036, 1043, 1045, 1051, 1055, 1061, 1068, 1070, 1076, 1080, 1086, 1093, 1094 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1094, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.341269850730896, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01984127052128315, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.289682537317276, "rps_doc_frac_unique_words": 0.4285714328289032, "rps_doc_mean_word_length": 3.7373270988464355, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0.007936510257422924, "rps_doc_unigram_entropy": 4.09552001953125, "rps_doc_word_count": 217, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07644882798194885, "rps_doc_frac_chars_dupe_6grams": 0.07644882798194885, "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.024660909548401833, "rps_doc_frac_chars_top_3gram": 0.04438963904976845, "rps_doc_frac_chars_top_4gram": 0.04069051146507263, "rps_doc_books_importance": -101.2663345336914, "rps_doc_books_importance_length_correction": -101.2663345336914, "rps_doc_openwebtext_importance": -62.9734992980957, "rps_doc_openwebtext_importance_length_correction": -53.569007873535156, "rps_doc_wikipedia_importance": -45.64015579223633, "rps_doc_wikipedia_importance_length_correction": -45.64015579223633 }, "fasttext": { "dclm": 0.15094327926635742, "english": 0.5811944603919983, "fineweb_edu_approx": 1.269930362701416, "eai_general_math": 0.9968148469924927, "eai_open_web_math": 0.107581727206707, "eai_web_code": 0.06015288829803467 } }

{ "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": "511.3", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Arithmetic" } } }, "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": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-3,167,748,833,362,821,600

Skip to content Instantly share code, notes, and snippets. @ufologist Created September 17, 2013 07:21 Show Gist options • Save ufologist/6591008 to your computer and use it in GitHub Desktop. Save ufologist/6591008 to your computer and use it in GitHub Desktop. 参考SpaceTree的示例, 实现类似脑图(mindmap)效果 <!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8" /> <title>Spacetree - Mindmap Demo</title> <link rel="stylesheet" href="spacetree.css" /> <style> #infovis { height: 600px; margin-left: auto; margin-right: auto; background-color: #111; } #infovis .node { cursor: pointer; color: #333; font-size: 0.8em; padding: 3px; } </style>   </head> <body> <h1>Spacetree - Mindmap Demo</h1> <div id="infovis"></div>  <script src="http://philogb.github.io/jit/static/v20/Jit/jit-yc.js"></script> <script src="spacetree-mindmap-demo.js"></script> </body> </html> /** * Simplest Templating Engine * * https://github.com/trix/nano */ function nano(template, data) { return template.replace(/\{([\w\.]*)\}/g, function(str, key) { var keys = key.split("."), v = data[keys.shift()]; for (var i = 0, l = keys.length; i < l; i++) v = v[keys[i]]; return (typeof v !== "undefined" && v !== null) ? v : ""; }); } // 渲染节点内容的模版 var tpl = '<span>{name}({unit}): {value}</span><br /><span>环比: {ratio}%</span>'; // 测试数据 var nodes = { id: 'node01', name: tpl, data: { // 节点的扩展数据, 可依据这些值来渲染节点的样式 name: '收入', unit: '元', value: 26000, ratio: -4.7 }, children: [{ id: 'node11', name: tpl, data: { name: '收入1', unit: '元', value: 5000, ratio: -5.1 }, children: [{ id: 'node111', name: tpl, data: { name: '收入11', unit: '元', value: 2000, ratio: -5.3 } }, { id: 'node112', name: tpl, data: { name: '收入12', unit: '元', value: 1000, ratio: 2.2 } }, { id: 'node113', name: tpl, data: { name: '收入13', unit: '元', value: 2000, ratio: -3.5 } }] }, { id: 'node12', name: tpl, data: { name: '收入2', unit: '元', value: 8000, ratio: 2.5 } }, { id: 'node13', name: tpl, data: { name: '收入3', unit: '元', value: 6000, ratio: 2.3 } }, { id: 'node14', name: tpl, data: { name: '收入4', unit: '元', value: 7000, ratio: -2.3 }, children: [{ id: 'node141', name: tpl, data: { name: '收入41', unit: '元', value: 4000, ratio: -1.3 } }, { id: 'node142', name: tpl, data: { name: '收入42', unit: '元', value: 1000, ratio: 2.1 } }, { id: 'node143', name: tpl, data: { name: '收入43', unit: '元', value: 2000, ratio: -3.9 } }] }] }; /** * 参考SpaceTree的示例, 实现类似脑图(mindmap)效果 * http://philogb.github.io/jit/static/v20/Jit/Examples/Spacetree/example1.html */ (function() { // Create a new Spacetree instance // http://philogb.github.io/jit/static/v20/Docs/files/Visualizations/Spacetree-js.html var st = new $jit.ST({ // id of viz container element injectInto: 'infovis', // set duration for the animation duration: 800, // set animation transition type transition: $jit.Trans.Quart.easeInOut, // Whether to show the entire tree when loaded // or just the number of levels specified by levelsToShow. // Default’s true. // 关系到是否可以展开多个节点 // http://stackoverflow.com/questions/4223415/how-do-i-prevent-the-javascript-infovis-spacetree-st-select-method-from-coll constrained: false, // The number of levels to show for a subtree, Default’s 2 levelsToShow: 1, // set distance between node and its children levelDistance: 50, // enable panning Navigation: { enable:true, panning:true }, // 节点和连接线都是通过canvas画出来的 Node: { type: 'rectangle', align: 'left', autoWidth: true, autoHeight: true, overridable: true // for styling individual nodes or edges }, Edge: { type: 'bezier', overridable: true }, Tips: { enable: true, type: 'HTML', offsetX: 10, offsetY: 10, onShow: function(tip, node) { tip.innerHTML = nano(node.name, node.data); } }, // This method is called on DOM label creation. // Use this method to add event handlers and styles to your node. onCreateLabel: function(label, node) { label.innerHTML = nano(node.name, node.data); label.onclick = function() { st.onClick(node.id); }; // SpaceTree expand/collapse behaviour // https://groups.google.com/forum/#!topic/javascript-information-visualization-toolkit/pHblraFbFuI // 实现点击节点可以展开/收起, 效果还不是很理想 // label.onclick = function() { // console.log(node._collapsed, node.collapsed); // if (node._collapsed === undefined || node._collapsed === true) { // st.op.expand(node, { // type: 'animate', // duration: 1000, // hideLabels: false, // transition: $jit.Trans.Quart.easeOut // }); // st.onClick(node.id); // node._collapsed = false; // node.collapsed = false; // } else { // st.op.contract(node, { // type: 'animate', // duration: 1000, // hideLabels: false, // transition: $jit.Trans.Quart.easeOut // }); // node._collapsed = true; // node.collapsed = true; // } // }; }, // This method is called right before plotting a node. // It's useful for changing an individual node // style properties before plotting it. // The data properties prefixed with a dollar // sign will override the global node style properties. onBeforePlotNode: function(node) { //add some color to the nodes in the path between the //root node and the selected node. if (node.selected) { node.data.$color = '#ff7'; } else { // 这里可以实现根据节点的扩展数据来渲染节点样式 delete node.data.$color; // if the node belongs to the last plotted level // if(!node.anySubnode('exist')) { //count children number // var count = 0; // node.eachSubnode(function(n) { count++; }); //assign a node color based on //how many children it has // node.data.$color = ['#aaa', '#baa', '#caa', '#daa', '#eaa', '#faa'][count]; // } } }, // This method is called right before plotting // an edge. It's useful for changing an individual edge // style properties before plotting it. // Edge data proprties prefixed with a dollar sign will // override the Edge global style properties. onBeforePlotLine: function(adj){ if (adj.nodeFrom.selected && adj.nodeTo.selected) { adj.data.$color = '#eed'; adj.data.$lineWidth = 3; } else { delete adj.data.$color; delete adj.data.$lineWidth; } }, onBeforeCompute: function(node) { // console.log('loading', node.name); }, onAfterCompute: function(){ // console.log('done'); } }); // load data st.loadJSON(nodes); // compute node positions and layout st.compute(); // optional: make a translation of the tree st.geom.translate(new $jit.Complex(-200, 0), 'current'); // emulate a click on the root node. st.onClick(st.root); // 测试调整tree方位(Tree Orientation) // setTimeout(function() { // st.switchPosition('top', 'animate'); // setTimeout(function() { // st.switchPosition('right', 'animate'); // setTimeout(function() { // st.switchPosition('bottom', 'animate'); // }, 6000); // }, 5500); // }, 5000); })(); .jit-autoadjust-label { padding: 5px; } .tip { color: #111; background-color: white; border:1px solid #ccc; -moz-box-shadow:#555 2px 2px 8px; -webkit-box-shadow:#555 2px 2px 8px; -o-box-shadow:#555 2px 2px 8px; box-shadow:#555 2px 2px 8px; opacity:0.9; filter:alpha(opacity=90); font-size:10px; font-family:Verdana, Geneva, Arial, Helvetica, sans-serif; padding:7px; } @ufologist Copy link Author 预览效果 spacetree mindmap demo Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

{ "url": "https://gist.github.com/ufologist/6591008", "source_domain": "gist.github.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "215527", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RXTKHEIRM2XAEYWLXWF4O3VZKPZAED4Y", "WARC-Concurrent-To": "<urn:uuid:d94e7024-4f33-4d02-befa-7e24355f6473>", "WARC-Date": "2024-05-21T01:08:17Z", "WARC-IP-Address": "140.82.112.4", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:UCR6LUEDMTGYERBNFLRJENHKBOTRW6GA", "WARC-Record-ID": "<urn:uuid:2b50e77f-8593-46c4-99f4-71fa27b27826>", "WARC-Target-URI": "https://gist.github.com/ufologist/6591008", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e69a67e9-ed2a-477e-9750-53e4fc74b7d3>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-217\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 16, 17, 60, 61, 72, 105, 123, 197, 267, 301, 317, 334, 341, 366, 406, 453, 461, 472, 487, 506, 526, 550, 552, 569, 586, 599, 617, 631, 633, 642, 679, 692, 779, 792, 800, 807, 841, 866, 892, 970, 1020, 1028, 1036, 1040, 1069, 1071, 1102, 1105, 1137, 1200, 1251, 1312, 1370, 1374, 1376, 1389, 1470, 1478, 1492, 1506, 1517, 1552, 1564, 1575, 1589, 1601, 1604, 1617, 1631, 1642, 1650, 1663, 1674, 1687, 1699, 1702, 1715, 1730, 1741, 1749, 1763, 1774, 1787, 1799, 1801, 1806, 1821, 1832, 1840, 1854, 1865, 1878, 1889, 1891, 1896, 1911, 1922, 1930, 1944, 1955, 1968, 1980, 1982, 1985, 1990, 2004, 2015, 2023, 2036, 2047, 2060, 2071, 2073, 2078, 2092, 2103, 2111, 2124, 2135, 2148, 2159, 2161, 2166, 2180, 2191, 2199, 2212, 2223, 2236, 2248, 2251, 2264, 2279, 2290, 2298, 2312, 2323, 2336, 2348, 2350, 2355, 2370, 2381, 2389, 2403, 2414, 2427, 2438, 2440, 2445, 2460, 2471, 2479, 2493, 2504, 2517, 2529, 2531, 2534, 2537, 2540, 2544, 2580, 2659, 2662, 2676, 2711, 2798, 2821, 2852, 2875, 2909, 2924, 2957, 2997, 3044, 3103, 3122, 3139, 3262, 3282, 3341, 3358, 3404, 3423, 3441, 3455, 3468, 3481, 3484, 3508, 3516, 3535, 3550, 3567, 3585, 3644, 3647, 3655, 3671, 3689, 3692, 3700, 3714, 3728, 3741, 3754, 3784, 3828, 3830, 3833, 3881, 3947, 3986, 4032, 4061, 4082, 4085, 4124, 4224, 4251, 4283, 4332, 4400, 4424, 4444, 4463, 4485, 4525, 4532, 4556, 4584, 4611, 4623, 4649, 4669, 4688, 4710, 4750, 4757, 4784, 4810, 4815, 4821, 4824, 4879, 4926, 4966, 5012, 5068, 5103, 5157, 5192, 5213, 5240, 5275, 5300, 5349, 5384, 5408, 5426, 5473, 5504, 5531, 5610, 5615, 5617, 5620, 5667, 5723, 5763, 5819, 5865, 5898, 5950, 5976, 6001, 6010, 6034, 6062, 6064, 6067, 6101, 6139, 6142, 6170, 6194, 6196, 6200, 6213, 6233, 6270, 6284, 6328, 6385, 6422, 6443, 6475, 6502, 6542, 6569, 6611, 6638, 6681, 6694, 6707, 6720, 6726, 6750, 6764, 6766, 6773, 6786, 6811, 6834, 6868, 6905, 6937, 6966, 6979, 7005, 7021, 7080, 7093, 7095, 7106, 7116, 7123, 7124, 7129, 7152, 7153 ], "line_end_idx": [ 16, 17, 60, 61, 72, 105, 123, 197, 267, 301, 317, 334, 341, 366, 406, 453, 461, 472, 487, 506, 526, 550, 552, 569, 586, 599, 617, 631, 633, 642, 679, 692, 779, 792, 800, 807, 841, 866, 892, 970, 1020, 1028, 1036, 1040, 1069, 1071, 1102, 1105, 1137, 1200, 1251, 1312, 1370, 1374, 1376, 1389, 1470, 1478, 1492, 1506, 1517, 1552, 1564, 1575, 1589, 1601, 1604, 1617, 1631, 1642, 1650, 1663, 1674, 1687, 1699, 1702, 1715, 1730, 1741, 1749, 1763, 1774, 1787, 1799, 1801, 1806, 1821, 1832, 1840, 1854, 1865, 1878, 1889, 1891, 1896, 1911, 1922, 1930, 1944, 1955, 1968, 1980, 1982, 1985, 1990, 2004, 2015, 2023, 2036, 2047, 2060, 2071, 2073, 2078, 2092, 2103, 2111, 2124, 2135, 2148, 2159, 2161, 2166, 2180, 2191, 2199, 2212, 2223, 2236, 2248, 2251, 2264, 2279, 2290, 2298, 2312, 2323, 2336, 2348, 2350, 2355, 2370, 2381, 2389, 2403, 2414, 2427, 2438, 2440, 2445, 2460, 2471, 2479, 2493, 2504, 2517, 2529, 2531, 2534, 2537, 2540, 2544, 2580, 2659, 2662, 2676, 2711, 2798, 2821, 2852, 2875, 2909, 2924, 2957, 2997, 3044, 3103, 3122, 3139, 3262, 3282, 3341, 3358, 3404, 3423, 3441, 3455, 3468, 3481, 3484, 3508, 3516, 3535, 3550, 3567, 3585, 3644, 3647, 3655, 3671, 3689, 3692, 3700, 3714, 3728, 3741, 3754, 3784, 3828, 3830, 3833, 3881, 3947, 3986, 4032, 4061, 4082, 4085, 4124, 4224, 4251, 4283, 4332, 4400, 4424, 4444, 4463, 4485, 4525, 4532, 4556, 4584, 4611, 4623, 4649, 4669, 4688, 4710, 4750, 4757, 4784, 4810, 4815, 4821, 4824, 4879, 4926, 4966, 5012, 5068, 5103, 5157, 5192, 5213, 5240, 5275, 5300, 5349, 5384, 5408, 5426, 5473, 5504, 5531, 5610, 5615, 5617, 5620, 5667, 5723, 5763, 5819, 5865, 5898, 5950, 5976, 6001, 6010, 6034, 6062, 6064, 6067, 6101, 6139, 6142, 6170, 6194, 6196, 6200, 6213, 6233, 6270, 6284, 6328, 6385, 6422, 6443, 6475, 6502, 6542, 6569, 6611, 6638, 6681, 6694, 6707, 6720, 6726, 6750, 6764, 6766, 6773, 6786, 6811, 6834, 6868, 6905, 6937, 6966, 6979, 7005, 7021, 7080, 7093, 7095, 7106, 7116, 7123, 7124, 7129, 7152, 7153, 7250 ] }

{ "red_pajama_v2": { "ccnet_original_length": 7250, "ccnet_original_nlines": 332, "rps_doc_curly_bracket": 0.01655171997845173, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.09411173313856125, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00301962997764349, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5435329675674438, "rps_doc_frac_unique_words": 0.5033556818962097, "rps_doc_mean_word_length": 6.594630718231201, "rps_doc_num_sentences": 137, "rps_doc_symbol_to_word_ratio": 0.00956214964389801, "rps_doc_unigram_entropy": 5.519609451293945, "rps_doc_word_count": 745, "rps_doc_frac_chars_dupe_10grams": 0.02320374920964241, "rps_doc_frac_chars_dupe_5grams": 0.12639935314655304, "rps_doc_frac_chars_dupe_6grams": 0.09444330632686615, "rps_doc_frac_chars_dupe_7grams": 0.08141665160655975, "rps_doc_frac_chars_dupe_8grams": 0.06635457277297974, "rps_doc_frac_chars_dupe_9grams": 0.02320374920964241, "rps_doc_frac_chars_top_2gram": 0.0156727097928524, "rps_doc_frac_chars_top_3gram": 0.024628540500998497, "rps_doc_frac_chars_top_4gram": 0.03053124062716961, "rps_doc_books_importance": -638.3787841796875, "rps_doc_books_importance_length_correction": -638.3787841796875, "rps_doc_openwebtext_importance": -417.40472412109375, "rps_doc_openwebtext_importance_length_correction": -417.40472412109375, "rps_doc_wikipedia_importance": -374.9115295410156, "rps_doc_wikipedia_importance_length_correction": -374.9115295410156 }, "fasttext": { "dclm": 0.9098628759384155, "english": 0.20169417560100555, "fineweb_edu_approx": 2.858632802963257, "eai_general_math": 0.07682604342699051, "eai_open_web_math": 0.00725567014887929, "eai_web_code": 0.9114152193069458 } }

{ "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": "006.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Cognitive science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "1", "label": "Leftover HTML" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "5", "label": "Missing Referenced Data" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,662,235,272,300,183,000

Packagespark.filters Classpublic class GradientGlowFilter InheritanceGradientGlowFilter Inheritance GradientFilter Inheritance BaseDimensionFilter Inheritance BaseFilter Inheritance flash.events.EventDispatcher Implements IBitmapFilter Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 The GradientGlowFilter class lets you apply a gradient glow effect to display objects. A gradient glow is a realistic-looking glow with a color gradient that you can control. You can apply a gradient glow around the inner or outer edge of an object or on top of an object. You can apply the filter to any display object (objects that inherit from the DisplayObject class), such as MovieClip, SimpleButton, TextField, and Video objects, as well as to BitmapData objects. The use of filters depends on the object to which you apply the filter: If you apply a filter to a display object, the cacheAsBitmap property of the display object is set to true. If you clear all filters, the original value of cacheAsBitmap is restored. This filter supports Stage scaling. However, it does not support general scaling, rotation, and skewing; if the object itself is scaled (if scaleX and scaleY are set to a value other than 1.0), the filter effect is not scaled. It is scaled only when the user zooms in on the Stage. A filter is not applied if the resulting image exceeds the maximum dimensions. In AIR 1.5 and Flash Player 10, the maximum is 8,191 pixels in width or height, and the total number of pixels cannot exceed 16,777,215 pixels. (So, if an image is 8,191 pixels wide, it can only be 2,048 pixels high.) For example, if you zoom in on a large movie clip with a filter applied, the filter is turned off if the resulting image exceeds the maximum dimensions. MXML SyntaxexpandedHide MXML Syntax The <s:GradientGlowFilter> tag inherits all of the tag attributes of its superclass and adds no tag attributes: <s:GradientGlowFilter/> Default MXML Propertyentries View the examples See also spark.filters.GlowFilter flash.filters.GradientGlowFilter flash.display.BitmapData.applyFilter() flash.display.DisplayObject.cacheAsBitmap flash.display.DisplayObject.filters Public Properties PropertyDefined By Inheritedangle : Number The angle, in degrees. GradientFilter InheritedblurX : Number The amount of horizontal blur. BaseDimensionFilter InheritedblurY : Number The amount of vertical blur. BaseDimensionFilter Inheriteddistance : Number The offset distance of the glow. GradientFilter Inheritedentries : Array An Array of GradientEntry objects defining the fill patterns for the gradient fill. GradientFilter Inheritedknockout : Boolean Specifies whether the object has a knockout effect. BaseDimensionFilter Inheritedquality : int The number of times to apply the filter. BaseDimensionFilter Inheritedstrength : Number The strength of the imprint or spread. BaseDimensionFilter Inheritedtype : String The placement of the filter effect. GradientFilter Public Methods MethodDefined By GradientGlowFilter(distance:Number = 4.0, angle:Number = 45, colors:Array = null, alphas:Array = null, ratios:Array = null, blurX:Number = 4.0, blurY:Number = 4.0, strength:Number = 1, quality:int = 1, type:String = outer, knockout:Boolean = false) Constructor. GradientGlowFilter clone():BitmapFilter Returns a copy of this filter object. GradientGlowFilter Inherited Propagates a change event when the filter has changed. BaseFilter Public Constants ConstantDefined By InheritedCHANGE : String = change [static] The string "change". BaseFilter Constructor Detail GradientGlowFilter()Constructor public function GradientGlowFilter(distance:Number = 4.0, angle:Number = 45, colors:Array = null, alphas:Array = null, ratios:Array = null, blurX:Number = 4.0, blurY:Number = 4.0, strength:Number = 1, quality:int = 1, type:String = outer, knockout:Boolean = false) Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 Constructor. Parameters distance:Number (default = 4.0) — The offset distance of the glow. angle:Number (default = 45) — The angle, in degrees. Valid values are 0 to 360. colors:Array (default = null) — An array of colors that defines a gradient. For example, red is 0xFF0000, blue is 0x0000FF, and so on. alphas:Array (default = null) — An array of alpha transparency values for the corresponding colors in the colors array. Valid values for each element in the array are 0 to 1. For example, a value of .25 sets the alpha transparency value to 25%. ratios:Array (default = null) — An array of color distribution ratios. Valid values are 0 to 255. This value defines the percentage of the width where the color is sampled at 100 percent. blurX:Number (default = 4.0) — The amount of horizontal blur. Valid values are 0 to 255. A blur of 1 or less means that the original image is copied as is. Values that are a power of 2 (such as 2, 4, 8, 16 and 32) are optimized to render more quickly than other values. blurY:Number (default = 4.0) — The amount of vertical blur. Valid values are 0 to 255. A blur of 1 or less means that the original image is copied as is. Values that are a power of 2 (such as 2, 4, 8, 16 and 32) are optimized to render more quickly than other values. strength:Number (default = 1) — The strength of the imprint or spread. The higher the value, the more color is imprinted and the stronger the contrast between the glow and the background. Valid values are 0 to 255. The larger the value, the stronger the imprint. A value of 0 means the filter is not applied. quality:int (default = 1) — The number of times to apply the filter. Use the flash.filters.BitmapFilterQuality constants: • BitmapFilterQuality.LOW • BitmapFilterQuality.MEDIUM • BitmapFilterQuality.HIGH For more information, see the description of the quality property. type:String (default = outer) — The placement of the filter effect. Possible values are the flash.filters.BitmapFilterType constants: • BitmapFilterType.OUTER — Glow on the outer edge of the object; the default. • BitmapFilterType.INNER — Glow on the inner edge of the object • BitmapFilterType.FULL — Glow on top of the object knockout:Boolean (default = false) — Specifies whether the object has a knockout effect. A knockout effect makes the object's fill transparent and reveals the background color of the document. The value true specifies a knockout effect; the default is false (no knockout effect). Method Detail clone()method public function clone():BitmapFilter Language Version : ActionScript 3.0 Product Version : Flex 4 Runtime Versions : Flash Player 10, AIR 1.5 Returns a copy of this filter object. Returns BitmapFilter — A new GradientGlowFilter instance with all the same properties as the original GradientGlowFilter instance. Examples GradientGlowFilterExample.mxml <?xml version="1.0"?>   <s:Application xmlns:fx="http://ns.adobe.com/mxml/2009" xmlns:mx="library://ns.adobe.com/flex/mx" xmlns:s="library://ns.adobe.com/flex/spark" creationComplete="createFilters()"> <fx:Script><![CDATA[ import spark.filters.*; import flash.filters.BitmapFilterQuality; import flash.filters.BitmapFilterType; private var myGradientGlowFilter:GradientGlowFilter; private var colors:Array = [0xFFFFFF, 0xFF0000, 0xFFFF00, 0x00CCFF]; private var alphas:Array = [0, 1, 1, 1]; private var ratios:Array = [0, 63, 126, 255]; public function createFilters():void { myGradientGlowFilter = new GradientGlowFilter(0, 45, colors, alphas, ratios, 50, 50, 2.5, BitmapFilterQuality.HIGH, BitmapFilterType.OUTER, false); b1.filters = [myGradientGlowFilter]; } ]]></fx:Script> <s:VGroup>  <s:Button id="b1" label="Click me"/>  <s:Button id="b2" label="Click me"> <s:filters> <s:GradientGlowFilter distance="10" angle="45" blurX="50" blurY="50" strength="2.5" quality="{BitmapFilterQuality.HIGH}" type="{BitmapFilterType.OUTER}" knockout="false"> <s:entries> <s:GradientEntry alpha="0" color="0xFFFFFF" ratio="0"/> <s:GradientEntry alpha="1" color="0xFF0000" ratio="63"/> <s:GradientEntry alpha="1" color="0xFFFF00" ratio="126"/> <s:GradientEntry alpha="1" color="0x00CCFF" ratio="255"/> </s:entries> </s:GradientGlowFilter> </s:filters> </s:Button> </s:VGroup> </s:Application>

{ "url": "http://flex.apache.org/asdoc/spark/filters/GradientGlowFilter.html", "source_domain": "flex.apache.org", "snapshot_id": "crawl=CC-MAIN-2019-04", "warc_metadata": { "Content-Length": "30213", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5BW3CIALELZ43ZF223UG45AFSJWQULL2", "WARC-Concurrent-To": "<urn:uuid:9f68462a-0027-4ef1-9685-894e3c19a827>", "WARC-Date": "2019-01-20T21:58:31Z", "WARC-IP-Address": "40.79.78.1", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WV463ZTZTSGO6CEJ6ETW7POLJKQP7ONT", "WARC-Record-ID": "<urn:uuid:5c1b6302-9218-442b-abc0-a4aa2d7c1bae>", "WARC-Target-URI": "http://flex.apache.org/asdoc/spark/filters/GradientGlowFilter.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b3901a86-5267-44af-99fa-f6657e30621f>" }, "warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-150-232-186.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 21, 58, 211, 236, 237, 273, 298, 342, 343, 813, 814, 886, 887, 1070, 1071, 1353, 1354, 1804, 1805, 1841, 1842, 1954, 1955, 1981, 1984, 1985, 2014, 2015, 2033, 2034, 2043, 2044, 2069, 2102, 2141, 2183, 2219, 2220, 2221, 2239, 2259, 2284, 2307, 2322, 2347, 2378, 2398, 2423, 2452, 2472, 2500, 2533, 2548, 2574, 2658, 2673, 2702, 2754, 2774, 2798, 2839, 2859, 2887, 2926, 2946, 2970, 3006, 3021, 3036, 3054, 3057, 3306, 3319, 3338, 3341, 3362, 3400, 3419, 3430, 3485, 3496, 3513, 3533, 3568, 3598, 3609, 3628, 3660, 3925, 3926, 3962, 3987, 4031, 4032, 4045, 4046, 4057, 4124, 4126, 4206, 4208, 4343, 4345, 4590, 4592, 4780, 4782, 5052, 5054, 5322, 5324, 5633, 5635, 5757, 5785, 5816, 5845, 5846, 5913, 5914, 5916, 6050, 6130, 6196, 6250, 6252, 6532, 6546, 6560, 6597, 6598, 6634, 6659, 6703, 6704, 6742, 6743, 6751, 6874, 6883, 6914, 6936, 6941, 6942, 7011, 7083, 7153, 7227, 7298, 7354, 7355, 7404, 7405, 7475, 7543, 7618, 7688, 7721, 7722, 7726, 7784, 7800, 7846, 7893, 7942, 7982, 7987, 8011, 8040, 8087, 8131, 8134, 8194, 8268, 8316, 8367, 8381, 8433, 8510, 8601, 8646, 8653, 8656, 8674, 8675, 8690, 8757, 8802, 8803, 8862, 8906, 8930, 8969, 9003, 9034, 9066, 9098, 9134, 9191, 9244, 9282, 9318, 9402, 9487, 9573, 9659, 9696, 9737, 9762, 9782, 9806 ], "line_end_idx": [ 21, 58, 211, 236, 237, 273, 298, 342, 343, 813, 814, 886, 887, 1070, 1071, 1353, 1354, 1804, 1805, 1841, 1842, 1954, 1955, 1981, 1984, 1985, 2014, 2015, 2033, 2034, 2043, 2044, 2069, 2102, 2141, 2183, 2219, 2220, 2221, 2239, 2259, 2284, 2307, 2322, 2347, 2378, 2398, 2423, 2452, 2472, 2500, 2533, 2548, 2574, 2658, 2673, 2702, 2754, 2774, 2798, 2839, 2859, 2887, 2926, 2946, 2970, 3006, 3021, 3036, 3054, 3057, 3306, 3319, 3338, 3341, 3362, 3400, 3419, 3430, 3485, 3496, 3513, 3533, 3568, 3598, 3609, 3628, 3660, 3925, 3926, 3962, 3987, 4031, 4032, 4045, 4046, 4057, 4124, 4126, 4206, 4208, 4343, 4345, 4590, 4592, 4780, 4782, 5052, 5054, 5322, 5324, 5633, 5635, 5757, 5785, 5816, 5845, 5846, 5913, 5914, 5916, 6050, 6130, 6196, 6250, 6252, 6532, 6546, 6560, 6597, 6598, 6634, 6659, 6703, 6704, 6742, 6743, 6751, 6874, 6883, 6914, 6936, 6941, 6942, 7011, 7083, 7153, 7227, 7298, 7354, 7355, 7404, 7405, 7475, 7543, 7618, 7688, 7721, 7722, 7726, 7784, 7800, 7846, 7893, 7942, 7982, 7987, 8011, 8040, 8087, 8131, 8134, 8194, 8268, 8316, 8367, 8381, 8433, 8510, 8601, 8646, 8653, 8656, 8674, 8675, 8690, 8757, 8802, 8803, 8862, 8906, 8930, 8969, 9003, 9034, 9066, 9098, 9134, 9191, 9244, 9282, 9318, 9402, 9487, 9573, 9659, 9696, 9737, 9762, 9782, 9806, 9822 ] }

{ "red_pajama_v2": { "ccnet_original_length": 9822, "ccnet_original_nlines": 211, "rps_doc_curly_bracket": 0.0006108700181357563, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.21019771695137024, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.020811650902032852, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.35119667649269104, "rps_doc_frac_unique_words": 0.329734206199646, "rps_doc_mean_word_length": 5.992525100708008, "rps_doc_num_sentences": 143, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.328717231750488, "rps_doc_word_count": 1204, "rps_doc_frac_chars_dupe_10grams": 0.12737353146076202, "rps_doc_frac_chars_dupe_5grams": 0.2327096313238144, "rps_doc_frac_chars_dupe_6grams": 0.22120581567287445, "rps_doc_frac_chars_dupe_7grams": 0.18586279451847076, "rps_doc_frac_chars_dupe_8grams": 0.16091476380825043, "rps_doc_frac_chars_dupe_9grams": 0.12737353146076202, "rps_doc_frac_chars_top_2gram": 0.010395010001957417, "rps_doc_frac_chars_top_3gram": 0.00498959980905056, "rps_doc_frac_chars_top_4gram": 0.010395010001957417, "rps_doc_books_importance": -784.2853393554688, "rps_doc_books_importance_length_correction": -784.2853393554688, "rps_doc_openwebtext_importance": -225.10821533203125, "rps_doc_openwebtext_importance_length_correction": -225.10821533203125, "rps_doc_wikipedia_importance": -274.38372802734375, "rps_doc_wikipedia_importance_length_correction": -274.38372802734375 }, "fasttext": { "dclm": 0.05893344059586525, "english": 0.6239806413650513, "fineweb_edu_approx": 2.7447926998138428, "eai_general_math": 0.5816951990127563, "eai_open_web_math": 0.24402391910552979, "eai_web_code": 0.5842149257659912 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-8,522,180,014,525,185,000

Welcome to the Treehouse Community Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! Looking to learn something new? Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today. Start your free trial HTML HTML Basics Images, Text and Links Images and File Paths Challenge inside the <body> display the moon.jpg located inside a folder called img. <body> </body> index.html <!DOCTYPE html> <html> <head> <title>The Moon</title> </head> <body> <img="moon" src="/img/moon.jpg" alt="Picture of a moon"/> </body> </html> 1 Answer Steven Parker Steven Parker 224,936 Points Only the properties of an element get assigned (using "="), the tag name itself always stands alone. Also, they only mention that the image is located in folder but they don't give a full path to it. So you can infer that this will be a relative reference and not an absolute one (so it won't start with "/").

{ "url": "https://teamtreehouse.com/community/inside-the-body-display-the-moonjpg-located-inside-a-folder-called-img", "source_domain": "teamtreehouse.com", "snapshot_id": "CC-MAIN-2023-14", "warc_metadata": { "Content-Length": "98734", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:XPZKTQH3ABZD3KYEYEKP7LQN7OPUYC73", "WARC-Concurrent-To": "<urn:uuid:d7bc65ac-c2f3-402e-bf21-057948b7c169>", "WARC-Date": "2023-04-01T05:52:49Z", "WARC-IP-Address": "3.94.15.124", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CM5MV2MEGTFSFDQIWORGR55AGI36HRL6", "WARC-Record-ID": "<urn:uuid:898bd0e3-035f-4b0d-b4a0-8894d1c380bb>", "WARC-Target-URI": "https://teamtreehouse.com/community/inside-the-body-display-the-moonjpg-located-inside-a-folder-called-img", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:155a3670-3a3a-4625-a253-3e87a6bf4d52>" }, "warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 35, 36, 295, 296, 328, 329, 507, 508, 530, 531, 603, 604, 679, 680, 687, 688, 696, 697, 708, 725, 732, 741, 769, 779, 788, 804, 833, 868, 869, 879, 887, 888, 897, 898, 912, 926, 941, 942, 1043, 1044 ], "line_end_idx": [ 35, 36, 295, 296, 328, 329, 507, 508, 530, 531, 603, 604, 679, 680, 687, 688, 696, 697, 708, 725, 732, 741, 769, 779, 788, 804, 833, 868, 869, 879, 887, 888, 897, 898, 912, 926, 941, 942, 1043, 1044, 1252 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1252, "ccnet_original_nlines": 40, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.30534350872039795, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011450380086898804, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.22519083321094513, "rps_doc_frac_unique_words": 0.6340206265449524, "rps_doc_mean_word_length": 4.804123878479004, "rps_doc_num_sentences": 15, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.5978779792785645, "rps_doc_word_count": 194, "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.02575106918811798, "rps_doc_frac_chars_top_3gram": 0.045064378529787064, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -100.83616638183594, "rps_doc_books_importance_length_correction": -100.83616638183594, "rps_doc_openwebtext_importance": -57.786773681640625, "rps_doc_openwebtext_importance_length_correction": -57.786773681640625, "rps_doc_wikipedia_importance": -54.944644927978516, "rps_doc_wikipedia_importance_length_correction": -54.944644927978516 }, "fasttext": { "dclm": 0.04546720162034035, "english": 0.8819106817245483, "fineweb_edu_approx": 1.2367620468139648, "eai_general_math": 0.06408250331878662, "eai_open_web_math": 0.12585556507110596, "eai_web_code": 0.2908751964569092 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

1,292,879,873,803,639,600

L Neophyte Neophyte • 1 Message • 100 Points Monday, April 17th, 2023 2:38 PM Help How is someone scraping the key off the app forcing me back into a trial version? Is there not a password to protect the app from any changes being made on iPhone? Brand User Trend Security Expert • 11 Messages • 550 Points 2 months ago Hi @leonard_masi_jr, Welcome to Trend Micro Community! It's unclear what exactly you mean by "scraping the key off the app". However, I'll try to provide an answer that may be helpful. Trend Micro Mobile Security will not automatically go back to a trial version unless the app has been reinstalled. If you are already signed in, sign out of the app, then sign in again to update your subscription. To check your subscription, kindly log in on this link Let us know how it goes. Need Help? Ask the Community Latest Tech Insights Loading...

{ "url": "https://en.community.trendmicro.com/conversations/mobile-security-for-ios/help/643d59fb0d8cd95c05a9f3fc", "source_domain": "en.community.trendmicro.com", "snapshot_id": "CC-MAIN-2023-23", "warc_metadata": { "Content-Length": "112464", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GKB4KILYF7P5KN5RWVL65MBQZ5EPKJDQ", "WARC-Concurrent-To": "<urn:uuid:5d5e84ea-bf47-45da-9baf-29b6a4be8012>", "WARC-Date": "2023-06-04T00:06:24Z", "WARC-IP-Address": "34.224.129.244", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:OJU6GSMDUJHOMWJ3JAITYWRDJLCK64DS", "WARC-Record-ID": "<urn:uuid:3fecb176-039e-4468-91c4-40bb964e209e>", "WARC-Target-URI": "https://en.community.trendmicro.com/conversations/mobile-security-for-ios/help/643d59fb0d8cd95c05a9f3fc", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1cf27d19-340f-4888-9c56-dec94625e450>" }, "warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-128\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 2, 11, 12, 21, 22, 26, 27, 37, 38, 42, 43, 54, 55, 88, 89, 94, 95, 259, 260, 271, 272, 294, 295, 299, 300, 312, 313, 317, 318, 329, 330, 343, 344, 365, 366, 400, 401, 531, 532, 802, 803, 828, 829, 840, 841, 859, 860, 881, 882 ], "line_end_idx": [ 2, 11, 12, 21, 22, 26, 27, 37, 38, 42, 43, 54, 55, 88, 89, 94, 95, 259, 260, 271, 272, 294, 295, 299, 300, 312, 313, 317, 318, 329, 330, 343, 344, 365, 366, 400, 401, 531, 532, 802, 803, 828, 829, 840, 841, 859, 860, 881, 882, 892 ] }

{ "red_pajama_v2": { "ccnet_original_length": 892, "ccnet_original_nlines": 49, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3591160178184509, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.016574589535593987, "rps_doc_frac_lines_end_with_ellipsis": 0.019999999552965164, "rps_doc_frac_no_alph_words": 0.18784530460834503, "rps_doc_frac_unique_words": 0.7115384340286255, "rps_doc_mean_word_length": 4.339743614196777, "rps_doc_num_sentences": 10, "rps_doc_symbol_to_word_ratio": 0.005524860229343176, "rps_doc_unigram_entropy": 4.546061992645264, "rps_doc_word_count": 156, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06794682145118713, "rps_doc_frac_chars_dupe_6grams": 0.06794682145118713, "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.04431315138936043, "rps_doc_frac_chars_top_3gram": 0.04135894030332565, "rps_doc_frac_chars_top_4gram": 0.05022156983613968, "rps_doc_books_importance": -69.30432891845703, "rps_doc_books_importance_length_correction": -69.30432891845703, "rps_doc_openwebtext_importance": -28.132326126098633, "rps_doc_openwebtext_importance_length_correction": -19.733436584472656, "rps_doc_wikipedia_importance": -16.798063278198242, "rps_doc_wikipedia_importance_length_correction": -16.798063278198242 }, "fasttext": { "dclm": 0.06043964996933937, "english": 0.8873286247253418, "fineweb_edu_approx": 0.8414405584335327, "eai_general_math": 0.00041335998685099185, "eai_open_web_math": 0.06588214635848999, "eai_web_code": 0.000025990000722231343 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.8", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "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": "21", "label": "Customer Support" } }, "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": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-3,400,876,629,599,781,000

Writing tests for Open-Event As our application and code base increased it became necessary to write tests for each functionality. Earlier we had tests only for basic functionalities like creating an event, editing an event, but then it is very important and also beneficial if we have tests for each and every small functionality. Hence we started writing proper tests. We divivded the tests into three folder • API • Functionality • Views All the API related tests were in the above one whereas the basic functionalities were in the second one. The last folder was further divided into three parts • Admin Tests • Super-Admin Tests • Guest Pages We had to test each and every functionality. For example let us look at the test file for the events. It looks like this: class TestEvents(OpenEventViewTestCase): def test_events_list(self): with app.test_request_context(): url = url_for('events.index_view') rv = self.app.get(url, follow_redirects=True) self.assertTrue("Manage Events" in rv.data, msg=rv.data) def test_events_create(self): with app.test_request_context(): url = url_for('events.create_view') rv = self.app.get(url, follow_redirects=True) self.assertTrue("Create Event" in rv.data, msg=rv.data) def test_events_create_post(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(POST_EVENT_DATA['name'] in rv.data, msg=rv.data) def test_events_create_post_publish(self): with app.test_request_context(): url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['state'] = 'Published' rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('unpublish' in rv.data, msg=rv.data) def test_events_create_post_publish_without_location_attempt(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['location_name'] = '' data['state'] = u'Published' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('To publish your event please review the highlighted fields below' in rv.data, msg=rv.data) def test_events_edit(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_forms = ObjectMother.get_custom_form(event.id) save_to_db(custom_forms, "Custom forms saved") url = url_for('events.edit_view', event_id=event.id) data = POST_EVENT_DATA.copy() del data['copyright'] data['name'] = 'EditTestName' data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue('EditTestName' in rv.data, msg=rv.data) def test_event_view(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.details_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("event1" in rv.data, msg=rv.data) microlocation = ObjectMother.get_microlocation(event_id=event.id) track = ObjectMother.get_track(event_id=event.id) cfs = ObjectMother.get_cfs(event_id=event.id) save_to_db(track, "Track saved") save_to_db(microlocation, "Microlocation saved") save_to_db(cfs, "Call for speakers saved") rv = self.app.get(url, follow_redirects=True) self.assertTrue("event1" in rv.data, msg=rv.data) def test_event_publish(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.publish_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) event = DataGetter.get_event(event.id) self.assertEqual("Published", event.state, msg=event.state) def test_event_unpublish(self): with app.test_request_context(): event = ObjectMother.get_event() event.state = "Published" save_to_db(event, "Event saved") url = url_for('events.unpublish_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) event = DataGetter.get_event(event.id) self.assertEqual("Draft", event.state, msg=event.state) def test_event_delete(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.trash_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Your event has been deleted" in rv.data, msg=rv.data) def test_event_copy(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('events.copy_event', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Copy of event1" in rv.data, msg=rv.data) if __name__ == '__main__': unittest.main() So this is the test file for the event part. As you can see we have tests for each and every small functionality 1. test_events_list : Tests the list of events 2. test_events_create: Tests whether the event creation page is displayed 3. test_events_create_post: Tests whether the event is created on doing a POST 4. test_events_create_post_publish : Tests whether the event is published on doing a POST through Publish button 5. test_events_copy: Tests whether the event is copied properly or not Thus each functionality related to an event is tested properly. Similarly not just for events but also for the other services like sessions: import unittest from tests.api.utils_post_data import POST_SESSION_DATA, POST_SPEAKER_DATA from tests.object_mother import ObjectMother from open_event import current_app as app from open_event.helpers.data import save_to_db from flask import url_for from tests.views.view_test_case import OpenEventViewTestCase class TestSessionApi(OpenEventViewTestCase): def test_sessions_list(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session Saved") url = url_for('event_sessions.index_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Sessions" in rv.data, msg=rv.data) self.assertTrue("test" in rv.data, msg=rv.data) def test_session_create(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Create Session" in rv.data, msg=rv.data) def test_session_create_post(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") data = POST_SESSION_DATA data.update(POST_SPEAKER_DATA) url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(data['title'] in rv.data, msg=rv.data) def test_session_edit(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session saved") url = url_for('event_sessions.edit_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Edit Session" in rv.data, msg=rv.data) def test_session_edit_post(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") custom_form = ObjectMother.get_custom_form(event.id) save_to_db(custom_form, "Custom form saved") session = ObjectMother.get_session(event.id) save_to_db(session, "Session saved") data = POST_SESSION_DATA data['title'] = 'TestSession2' url = url_for('event_sessions.edit_view', event_id=event.id, session_id=session.id) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue("TestSession2" in rv.data, msg=rv.data) def test_session_accept(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.accept_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("The session has been accepted" in rv.data, msg=rv.data) def test_session_reject(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.reject_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("The session has been rejected" in rv.data, msg=rv.data) def test_session_delete(self): with app.test_request_context(): session = ObjectMother.get_session() save_to_db(session, "Session Saved") url = url_for('event_sessions.delete_session', event_id=1, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("deleted" in rv.data, msg=rv.data) def test_session_view(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event) session = ObjectMother.get_session() session.event_id = event.id save_to_db(session, "Session Saved") url = url_for('event_sessions.session_display_view', event_id=event.id, session_id=session.id) rv = self.app.get(url, follow_redirects=True) self.assertTrue("Short abstract" in rv.data, msg=rv.data) def test_wrong_form_config(self): with app.test_request_context(): event = ObjectMother.get_event() save_to_db(event, "Event saved") url = url_for('event_sessions.create_view', event_id=event.id) rv = self.app.get(url, follow_redirects=True) self.assertFalse("incorrectly configured" in rv.data, msg=rv.data) if __name__ == '__main__': unittest.main() We see that there are tests for each functionality of the sessions. However these tests were simple to write. However there was problem in one aspect of writing tests. In the Event creation wizard there are steps where the sponsors, tracks, rooms are dynamically added to the event. How then should we test them. I wrote the test for the creation of sponsors in step -2 def test_events_create_post(self): with app.test_request_context(): custom_forms = ObjectMother.get_custom_form() url = url_for('events.create_view') data = POST_EVENT_DATA.copy() del data['copyright'] data['sponsors[name]'] = ['Sponsor 1', 'Sponsor 2'] data['sponsors[type]'] = ['Gold', 'Silver'] data['sponsors[url]'] = ["", ""] data['sponsors[description]'] = ["", ""] data['sponsors[level]'] = ["", ""] data['start_date'] = '07/04/2016' data['start_time'] = '19:00' data['end_date'] = '07/04/2016' data['end_time'] = '22:00' data['custom_form[name]'] = ['session_form', 'speaker_form'] data['custom_form[value]'] = [custom_forms.session_form, custom_forms.speaker_form] data = ImmutableMultiDict(data) rv = self.app.post(url, follow_redirects=True, buffered=True, content_type='multipart/form-data', data=data) self.assertTrue(POST_EVENT_DATA['name'] in rv.data, msg=rv.data) rv2 = self.app.get(url_for('events.details_view', event_id=1)) self.assertTrue(data['sponsors[name]'] in rv2.data, msg=rv2.data) Here on importing the data dict I dynamically add two sponsors to the dict. After that I convert the dict to an Immutablemulti-dict so that the multiple sponsors can be displayed. Then I pass this dict to the event creation view via a POST request and check whether the two sponsors are present in the details page or not. Thus our test system is developed and improving. Still as we develop more functionalities we will write more tests 🙂

{ "url": "http://blog.fossasia.org/writing-tests-for-open-event/", "source_domain": "blog.fossasia.org", "snapshot_id": "crawl=CC-MAIN-2017-17", "warc_metadata": { "Content-Length": "55318", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:34VLWPAB7RSJ6XJDTUNE32HHNEVRWK2E", "WARC-Concurrent-To": "<urn:uuid:0bff5eb0-9cd8-4cdd-80c6-88c4653d01c1>", "WARC-Date": "2017-04-25T22:12:20Z", "WARC-IP-Address": "104.28.28.43", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6O4K6C3FMB7IX7OWKZ4AWIV4UZ4PWTBQ", "WARC-Record-ID": "<urn:uuid:5ef07a7c-d05c-4b2d-8aa7-f50628a53ec5>", "WARC-Target-URI": "http://blog.fossasia.org/writing-tests-for-open-event/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1040a3c3-f5bd-4432-ac65-4b0191598473>" }, "warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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, 29, 30, 412, 413, 421, 439, 449, 450, 609, 610, 626, 648, 664, 665, 787, 788, 829, 861, 902, 949, 1007, 1008, 1077, 1078, 1112, 1153, 1201, 1259, 1327, 1328, 1367, 1408, 1466, 1514, 1556, 1590, 1636, 1677, 1721, 1760, 1833, 1929, 2039, 2081, 2158, 2159, 2206, 2247, 2295, 2337, 2371, 2417, 2458, 2502, 2541, 2581, 2691, 2733, 2798, 2799, 2871, 2912, 2970, 3018, 3060, 3094, 3140, 3181, 3225, 3264, 3303, 3344, 3417, 3513, 3623, 3665, 3785, 3786, 3818, 3859, 3904, 3949, 4015, 4074, 4139, 4181, 4215, 4257, 4303, 4344, 4388, 4427, 4500, 4596, 4706, 4748, 4816, 4817, 4848, 4889, 4934, 4979, 5047, 5105, 5167, 5245, 5307, 5365, 5410, 5471, 5526, 5584, 5646, 5647, 5681, 5722, 5767, 5812, 5881, 5939, 5990, 6062, 6063, 6099, 6140, 6185, 6223, 6268, 6339, 6397, 6448, 6516, 6517, 6550, 6591, 6636, 6681, 6747, 6805, 6888, 6889, 6920, 6961, 7006, 7051, 7117, 7175, 7245, 7246, 7273, 7293, 7294, 7407, 7408, 7457, 7533, 7614, 7729, 7802, 7803, 7944, 7945, 7961, 7962, 8037, 8082, 8124, 8171, 8197, 8198, 8259, 8260, 8261, 8306, 8307, 8341, 8382, 8427, 8472, 8529, 8578, 8675, 8733, 8797, 8857, 8858, 8893, 8934, 8979, 9024, 9089, 9146, 9221, 9279, 9349, 9350, 9390, 9431, 9476, 9521, 9586, 9643, 9680, 9723, 9798, 9919, 9986, 9987, 10020, 10061, 10106, 10151, 10216, 10273, 10330, 10379, 10475, 10533, 10601, 10602, 10640, 10681, 10726, 10771, 10836, 10893, 10950, 10999, 11036, 11079, 11175, 11296, 11364, 11365, 11400, 11441, 11490, 11539, 11633, 11691, 11776, 11777, 11812, 11853, 11902, 11951, 12045, 12103, 12188, 12189, 12224, 12265, 12314, 12363, 12457, 12515, 12578, 12579, 12612, 12653, 12698, 12728, 12777, 12817, 12866, 12973, 13031, 13101, 13102, 13140, 13181, 13226, 13271, 13346, 13404, 13483, 13484, 13511, 13531, 13532, 13902, 13903, 13938, 13975, 14029, 14073, 14111, 14141, 14201, 14253, 14294, 14343, 14386, 14428, 14465, 14505, 14540, 14609, 14701, 14741, 14847, 14885, 14958, 14959, 15030, 15104, 15105, 15428, 15429, 15546, 15547 ], "line_end_idx": [ 29, 30, 412, 413, 421, 439, 449, 450, 609, 610, 626, 648, 664, 665, 787, 788, 829, 861, 902, 949, 1007, 1008, 1077, 1078, 1112, 1153, 1201, 1259, 1327, 1328, 1367, 1408, 1466, 1514, 1556, 1590, 1636, 1677, 1721, 1760, 1833, 1929, 2039, 2081, 2158, 2159, 2206, 2247, 2295, 2337, 2371, 2417, 2458, 2502, 2541, 2581, 2691, 2733, 2798, 2799, 2871, 2912, 2970, 3018, 3060, 3094, 3140, 3181, 3225, 3264, 3303, 3344, 3417, 3513, 3623, 3665, 3785, 3786, 3818, 3859, 3904, 3949, 4015, 4074, 4139, 4181, 4215, 4257, 4303, 4344, 4388, 4427, 4500, 4596, 4706, 4748, 4816, 4817, 4848, 4889, 4934, 4979, 5047, 5105, 5167, 5245, 5307, 5365, 5410, 5471, 5526, 5584, 5646, 5647, 5681, 5722, 5767, 5812, 5881, 5939, 5990, 6062, 6063, 6099, 6140, 6185, 6223, 6268, 6339, 6397, 6448, 6516, 6517, 6550, 6591, 6636, 6681, 6747, 6805, 6888, 6889, 6920, 6961, 7006, 7051, 7117, 7175, 7245, 7246, 7273, 7293, 7294, 7407, 7408, 7457, 7533, 7614, 7729, 7802, 7803, 7944, 7945, 7961, 7962, 8037, 8082, 8124, 8171, 8197, 8198, 8259, 8260, 8261, 8306, 8307, 8341, 8382, 8427, 8472, 8529, 8578, 8675, 8733, 8797, 8857, 8858, 8893, 8934, 8979, 9024, 9089, 9146, 9221, 9279, 9349, 9350, 9390, 9431, 9476, 9521, 9586, 9643, 9680, 9723, 9798, 9919, 9986, 9987, 10020, 10061, 10106, 10151, 10216, 10273, 10330, 10379, 10475, 10533, 10601, 10602, 10640, 10681, 10726, 10771, 10836, 10893, 10950, 10999, 11036, 11079, 11175, 11296, 11364, 11365, 11400, 11441, 11490, 11539, 11633, 11691, 11776, 11777, 11812, 11853, 11902, 11951, 12045, 12103, 12188, 12189, 12224, 12265, 12314, 12363, 12457, 12515, 12578, 12579, 12612, 12653, 12698, 12728, 12777, 12817, 12866, 12973, 13031, 13101, 13102, 13140, 13181, 13226, 13271, 13346, 13404, 13483, 13484, 13511, 13531, 13532, 13902, 13903, 13938, 13975, 14029, 14073, 14111, 14141, 14201, 14253, 14294, 14343, 14386, 14428, 14465, 14505, 14540, 14609, 14701, 14741, 14847, 14885, 14958, 14959, 15030, 15104, 15105, 15428, 15429, 15546, 15547, 15548 ] }

{ "red_pajama_v2": { "ccnet_original_length": 15548, "ccnet_original_nlines": 311, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.12125340849161148, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0071525899693369865, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4547002613544464, "rps_doc_frac_unique_words": 0.32363978028297424, "rps_doc_mean_word_length": 9.053470611572266, "rps_doc_num_sentences": 283, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.1700758934021, "rps_doc_word_count": 1066, "rps_doc_frac_chars_dupe_10grams": 0.2489897459745407, "rps_doc_frac_chars_dupe_5grams": 0.5041964650154114, "rps_doc_frac_chars_dupe_6grams": 0.4457569122314453, "rps_doc_frac_chars_dupe_7grams": 0.4037923514842987, "rps_doc_frac_chars_dupe_8grams": 0.3424515724182129, "rps_doc_frac_chars_dupe_9grams": 0.2769661247730255, "rps_doc_frac_chars_top_2gram": 0.0569889098405838, "rps_doc_frac_chars_top_3gram": 0.03875245898962021, "rps_doc_frac_chars_top_4gram": 0.03522951155900955, "rps_doc_books_importance": -1429.67236328125, "rps_doc_books_importance_length_correction": -1429.67236328125, "rps_doc_openwebtext_importance": -785.6150512695312, "rps_doc_openwebtext_importance_length_correction": -785.6150512695312, "rps_doc_wikipedia_importance": -720.8958129882812, "rps_doc_wikipedia_importance_length_correction": -720.8958129882812 }, "fasttext": { "dclm": 0.9503911137580872, "english": 0.4719971716403961, "fineweb_edu_approx": 3.255805730819702, "eai_general_math": 0.7957473993301392, "eai_open_web_math": 0.10202693939208984, "eai_web_code": 0.8188576698303223 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

2,178,529,136,824,619,800

Md Hohn Md Hohn - 1 year ago 64 C# Question How to convert Sql Datetime query into Linq select * from Employees where DataofJoin ='2005-01-01 00:00:00.000' I wrote this Linq Query as public JsonResult Dif() { var ss = Convert.ToDateTime("2001-01-01 00:00:00.000"); var x = (from n in db.Employees where n.DataofBirth == ss select n).First(); return new JsonResult { JsonRequestBehavior = JsonRequestBehavior.AllowGet }; } But its throwing the following error: "An exception of type 'System.InvalidOperationException' occurred in System.Core.dll but was not handled in user code" Answer Source As I can Understand , This issue is because of attempt to get an item from empty object. Because you are making a call of .First() and there is an empty result returned by the query. So if you do obj.First() of an empty object it throws exception. Use obj.FirstOrDefault() To avoid the exception. And if Linq is not returning the data is an issue then use Sql Profiler to check what query is been called,or change the date filter accordingly. To avoid error Use - var x = (from n in db.Employees where n.DataofBirth == ss select n).FirstOrDefault(); Update For getting proper date, do something like this . var ss = new DateTime (2005,01,01,0,0,0); //use this date in linq query Hope it will help you. Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download

{ "url": "https://codedump.io/share/bHWWsMrs0pUY/1/how-to-convert-sql-datetime-query-into-linq", "source_domain": "codedump.io", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "42615", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6Y2N5BEVY62JFRJYOFM7D7PDXBDNQEJY", "WARC-Concurrent-To": "<urn:uuid:7dc24bc9-47d5-4f3a-ba6f-50ee6c8affcd>", "WARC-Date": "2018-02-24T06:40:56Z", "WARC-IP-Address": "50.112.74.85", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PY3CI7U4V2ENXXELURCCITE5CLR6WCJS", "WARC-Record-ID": "<urn:uuid:b3364223-4221-4846-86aa-f59e44baabc4>", "WARC-Target-URI": "https://codedump.io/share/bHWWsMrs0pUY/1/how-to-convert-sql-datetime-query-into-linq", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e7953208-8571-4cee-82f7-0e8ca10f4ac5>" }, "warc_info": "robots: classic\r\nhostname: ip-10-65-128-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 32, 44, 45, 89, 90, 158, 159, 160, 187, 188, 212, 214, 270, 302, 328, 347, 348, 426, 428, 429, 430, 468, 469, 554, 588, 589, 603, 604, 693, 694, 902, 903, 1049, 1050, 1071, 1072, 1108, 1147, 1188, 1189, 1196, 1197, 1247, 1248, 1320, 1321, 1344, 1345 ], "line_end_idx": [ 32, 44, 45, 89, 90, 158, 159, 160, 187, 188, 212, 214, 270, 302, 328, 347, 348, 426, 428, 429, 430, 468, 469, 554, 588, 589, 603, 604, 693, 694, 902, 903, 1049, 1050, 1071, 1072, 1108, 1147, 1188, 1189, 1196, 1197, 1247, 1248, 1320, 1321, 1344, 1345, 1446 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1446, "ccnet_original_nlines": 48, "rps_doc_curly_bracket": 0.0027662499342113733, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2744479477405548, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00946372002363205, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.30914825201034546, "rps_doc_frac_unique_words": 0.6018957495689392, "rps_doc_mean_word_length": 5.094786643981934, "rps_doc_num_sentences": 25, "rps_doc_symbol_to_word_ratio": 0.0031545700039714575, "rps_doc_unigram_entropy": 4.649385929107666, "rps_doc_word_count": 211, "rps_doc_frac_chars_dupe_10grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_5grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_6grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_7grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_8grams": 0.08744186162948608, "rps_doc_frac_chars_dupe_9grams": 0.08744186162948608, "rps_doc_frac_chars_top_2gram": 0.011162789538502693, "rps_doc_frac_chars_top_3gram": 0.014883720315992832, "rps_doc_frac_chars_top_4gram": 0.016744190827012062, "rps_doc_books_importance": -135.944091796875, "rps_doc_books_importance_length_correction": -132.25364685058594, "rps_doc_openwebtext_importance": -71.82937622070312, "rps_doc_openwebtext_importance_length_correction": -71.82937622070312, "rps_doc_wikipedia_importance": -53.112300872802734, "rps_doc_wikipedia_importance_length_correction": -44.96889877319336 }, "fasttext": { "dclm": 0.1185389831662178, "english": 0.8004580736160278, "fineweb_edu_approx": 1.996484398841858, "eai_general_math": 0.098911352455616, "eai_open_web_math": 0.03460394963622093, "eai_web_code": 0.086399607360363 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.758", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

6,967,151,366,705,249,000

0x01 前言我本来是使用DNSPod的DDNS服务，但自从我撤走极路由后就再也用不了了。同时DNSPod免费用户最低的TTL仅能设为600（10分钟），不足以满足DDNS的需求。我试过很多次重启服务器或者重新拨号后都无法在短时间内更新DNS的A记录。其实DNSPod也有简单易用的API可供我编写python脚本，相对于阿里云年付的40.8元，DNSPod的年付360确实有点贵，同时DNSPod个人专业版的TTL最低也就300（5分钟），但阿里云最低却能设为1（1秒）。如果你需要阿里云的付费服务，以下是一个9折优惠码：阿里云9折优惠码：nfasn1 DNSPod DNS费用详情 DNSPod DNS费用详情阿里云DNS费用详情阿里云DNS费用详情 0x02 准备因为受限于阿里云python SDK，这里使用python2.7进行编写。运行时请使用python2.x版本运行，而使用python3.x将会出现错误。首先要在系统上安装阿里云的python SDK： #新安装的系统没有python pip，所以先安装它和其他依赖包 [[email protected] ~]# yum install python-pip gcc gcc-devel autoconf automake python-devel python-pip python-crypto python-cryptography -y #安装alidns python DSK [[email protected] ~]# pip install aliyun-python-sdk-alidns 还需要准备以下账号内容： 1. Access Key ID 2. Access Key Secret 3. 账号ID 准备好上面的内容后，将你的域名添加到阿里云解析DNS中： WechatIMG23 完成后再在这个域名下添加一个主机A记录： WechatIMG24 至此，准备工作已经完成。下面来获取域名的关键信息。 0x03 关键信息通过脚本更新DNS记录需要几个关键的信息，如下： 1. 一级域名（你的域名） 2. 主机记录（你的二级域名） 3. 记录类型（你的本地IP地址） 4. 记录ID（这个解析记录的ID） 5. 记录TTL（记录有效生存时间） 0x03.1 记录ID 其中1，2，3，5是可以确定的，而4则需要通过阿里云API获取： def check_records(dns_domain): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordsRequest.DescribeDomainRecordsRequest() request.set_DomainName(dns_domain) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request) result = result.decode() result_dict = json.JSONDecoder().decode(result) result_list = result_dict['DomainRecords']['Record'] for j in result_list: print('Subdomain：' + j['RR'].encode() + ' ' + '| RecordId：' + j['RecordId'].encode()) return 返还的内容如下： [[email protected] aliyun_ddns]# python aliyun_ddns.py Subdomain：subdomain_1 | RecordId：3331111111111111 Subdomain：subdomain_2 | RecordId：3331111111111111 Subdomain：subdomain_3 | RecordId：3331111111111111 Subdomain：subdomain_4 | RecordId：3331111111111111 Subdomain：subdomain_5 | RecordId：3331111111111111 Subdomain：subdomain_6 | RecordId：3331111111111111 0x03.2 本机IP 而获取本机IP，我选用ip.cn这个网站。当使用curl访问这个网站时，它会返还IP归属地和IP地址。使用脚本获取： WechatIMG25 def my_ip_method_1(): get_ip_method = os.popen('curl -s ip.cn') get_ip_responses = get_ip_method.readlines()[0] get_ip_pattern = re.compile(r'\d+\.\d+\.\d+\.\d+') get_ip_value = get_ip_pattern.findall(get_ip_responses)[0] return get_ip_value 可能因为ip.cn这个站点受到攻击，他们的服务目前不太稳定，请使用my_ip_method_2或my_ip_method_3这两种本地IP的获取方式。 0x04 对比 | 更新怎样才能知道IP地址是否有改变？在获取本地IP后，再通过阿里云DNS API获取上一次的记录，两者相对比，如果不一致则更新DNS记录。 0x04.1 上一次的记录 def old_ip(): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordInfoRequest.DescribeDomainRecordInfoRequest() request.set_RecordId(rc_record_id) request.set_accept_format(rc_format) result = clt.do_action(request) result = json.JSONDecoder().decode(result) result = result['Value'] return result 0x04.2 更新记录 def update_dns(dns_rr, dns_type, dns_value, dns_record_id, dns_ttl, dns_format): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = UpdateDomainRecordRequest.UpdateDomainRecordRequest() request.set_RR(dns_rr) request.set_Type(dns_type) request.set_Value(dns_value) request.set_RecordId(dns_record_id) request.set_TTL(dns_ttl) request.set_accept_format(dns_format) result = clt.do_action(request) return result 0x04.3 对比 if rc_value_old == rc_value: print 'The specified value of parameter Value is the same as old' else: update_dns(rc_rr, rc_type, rc_value, rc_record_id, rc_ttl, rc_format) 0x05 记录我不但想要更新DDNS记录，我还想记录下每一次重新拨号后获取的IP，说不定日后能做个分析什么的。那么将记录写入文件： def write_to_file(): time_now = datetime.now().strftime('%Y-%m-%d %H:%M:%S') current_script_path = sys.path[7] print current_script_path log_file = current_script_path + '/' + 'aliyun_ddns_log.txt' write = open(log_file, 'a') write.write(time_now + ' ' + str(rc_value) + '\n') write.close() return 0x06 完整脚本最新完整脚本请移步至GitHub：阿里云DDNS python脚本 # -*- coding: UTF-8 -*- import json import os import re import sys from datetime import datetime import requests from aliyunsdkalidns.request.v20150109 import UpdateDomainRecordRequest, DescribeDomainRecordsRequest, \ DescribeDomainRecordInfoRequest from aliyunsdkcore import client access_key_id = "" access_Key_secret = "" # 请填写你的账号ID account_id = "" # 如果填写yes，则运行程序后仅显示域名信息，并不会更新记录，用于获取解析记录ID。 # 如果填写no，则运行程序后不显示域名信息，仅更新记录。 i_dont_know_record_id = 'yes' # 请填写你的一级域名 rc_domain = '' # 请填写你的解析记录 rc_rr = '' # 请填写你的记录类型，DDNS请填写A，表示A记录 rc_type = 'A' # 请填写解析记录ID rc_record_id = '' # 请填写解析有效生存时间TTL，单位：秒 rc_ttl = '30' # 请填写返还内容格式，json，xml rc_format = 'json' def my_ip_method_1(): get_ip_method = os.popen('curl -s ip.cn') get_ip_responses = get_ip_method.readlines()[0] get_ip_pattern = re.compile(r'\d+\.\d+\.\d+\.\d+') get_ip_value = get_ip_pattern.findall(get_ip_responses)[0] return get_ip_value def my_ip_method_2(): get_ip_method = os.popen('curl -s http://ip-api.com/json') get_ip_responses = get_ip_method.readlines()[0] get_ip_responses = eval(str(get_ip_responses)) get_ip_value = get_ip_responses['query'] return get_ip_value def my_ip_method_3(): get_ip_method = requests.get('http://ifconfig.co/json').content get_ip_value = eval(get_ip_method) get_ip_value = get_ip_value['ip'] return get_ip_value def check_records(dns_domain): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordsRequest.DescribeDomainRecordsRequest() request.set_DomainName(dns_domain) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request) result = result.decode() result_dict = json.JSONDecoder().decode(result) result_list = result_dict['DomainRecords']['Record'] for j in result_list: print('Subdomain：' + j['RR'].encode() + ' ' + '| RecordId：' + j['RecordId'].encode()) return def old_ip(): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = DescribeDomainRecordInfoRequest.DescribeDomainRecordInfoRequest() request.set_RecordId(rc_record_id) request.set_accept_format(rc_format) result = clt.do_action_with_exception(request).decode() result = json.JSONDecoder().decode(result) result = result['Value'] return result def update_dns(dns_rr, dns_type, dns_value, dns_record_id, dns_ttl, dns_format): clt = client.AcsClient(access_key_id, access_Key_secret, 'cn-hangzhou') request = UpdateDomainRecordRequest.UpdateDomainRecordRequest() request.set_RR(dns_rr) request.set_Type(dns_type) request.set_Value(dns_value) request.set_RecordId(dns_record_id) request.set_TTL(dns_ttl) request.set_accept_format(dns_format) result = clt.do_action_with_exception(request) return result def write_to_file(): time_now = datetime.now().strftime('%Y-%m-%d %H:%M:%S') current_script_path = sys.path[1] log_file = current_script_path + '/' + 'aliyun_ddns_log.txt' write = open(log_file, 'a') write.write(time_now + ' ' + str(rc_value) + '\n') write.close() return if i_dont_know_record_id == 'yes': check_records(rc_domain) elif i_dont_know_record_id == 'no': rc_value = my_ip_method_3() rc_value_old = old_ip() if rc_value_old == rc_value: print('The specified value of parameter Value is the same as old') else: print(update_dns(rc_rr, rc_type, rc_value, rc_record_id, rc_ttl, rc_format)) write_to_file() 可能因为ip.cn这个站点收到攻击，他们的服务目前不太稳定，请使用my_ip_method_2或my_ip_method_3这两种本地IP的获取方式。修改第117行即可修改本地IP的获取方式。 0x07 运行将程序通过crontab每分钟运行一次，请将脚本路径修改为你的实际路径： */1 * * * * root /usr/bin/python2.7 /usr/local/shell/aliyun_ddns.py > /dev/null 1>/dev/null 0x08 结语其实这个脚本也可以更新其他类型的DNS记录，例如：CNAME，TXT等，只要知道解析记录ID即可。经过近3天的运行，一切正常。

{ "url": "https://ngx.hk/2016/08/22/%E9%80%9A%E8%BF%87python%E5%B0%86%E9%98%BF%E9%87%8C%E4%BA%91dns%E8%A7%A3%E6%9E%90%E4%BD%9C%E4%B8%BAddns%E4%BD%BF%E7%94%A8.html", "source_domain": "ngx.hk", "snapshot_id": "crawl=CC-MAIN-2022-27", "warc_metadata": { "Content-Length": "186179", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RIL3ENKPYFXF476VSUR2ACDLM5N6SL3F", "WARC-Concurrent-To": "<urn:uuid:dd052b25-ad4f-4f24-9b48-98f8b9448761>", "WARC-Date": "2022-06-24T23:24:47Z", "WARC-IP-Address": "172.67.142.155", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:TVIABCC273Z2KLZTIOGRRVB5VBXL76DY", "WARC-Record-ID": "<urn:uuid:12f54898-2db2-4848-abe0-4cdeffef02b8>", "WARC-Target-URI": "https://ngx.hk/2016/08/22/%E9%80%9A%E8%BF%87python%E5%B0%86%E9%98%BF%E9%87%8C%E4%BA%91dns%E8%A7%A3%E6%9E%90%E4%BD%9C%E4%B8%BAddns%E4%BD%BF%E7%94%A8.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d454990a-e7b4-4901-a95c-f38a782933bc>" }, "warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-185\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 8, 9, 129, 130, 242, 243, 269, 270, 286, 301, 316, 327, 338, 339, 347, 348, 425, 426, 451, 452, 485, 624, 625, 646, 706, 707, 720, 721, 740, 763, 773, 774, 803, 804, 816, 817, 838, 839, 851, 852, 878, 879, 889, 890, 915, 916, 932, 950, 970, 991, 1012, 1013, 1025, 1026, 1059, 1060, 1091, 1167, 1241, 1280, 1321, 1372, 1401, 1453, 1510, 1536, 1630, 1641, 1642, 1651, 1652, 1708, 1758, 1808, 1858, 1908, 1958, 2008, 2009, 2021, 2022, 2081, 2082, 2094, 2095, 2117, 2163, 2215, 2270, 2333, 2357, 2358, 2434, 2435, 2448, 2449, 2466, 2467, 2519, 2520, 2534, 2535, 2549, 2625, 2705, 2744, 2785, 2821, 2868, 2897, 2915, 2916, 2928, 2929, 3010, 3086, 3154, 3181, 3212, 3245, 3285, 3314, 3356, 3392, 3410, 3411, 3421, 3422, 3451, 3521, 3527, 3601, 3602, 3610, 3611, 3670, 3671, 3692, 3752, 3790, 3820, 3885, 3917, 3972, 3990, 4001, 4002, 4012, 4013, 4047, 4048, 4072, 4073, 4085, 4095, 4105, 4116, 4146, 4147, 4163, 4268, 4304, 4337, 4338, 4357, 4380, 4381, 4393, 4409, 4410, 4454, 4484, 4514, 4515, 4527, 4542, 4543, 4555, 4566, 4567, 4594, 4608, 4609, 4621, 4639, 4640, 4662, 4676, 4677, 4698, 4717, 4718, 4719, 4741, 4787, 4839, 4894, 4957, 4981, 4982, 4983, 5005, 5068, 5120, 5171, 5216, 5240, 5241, 5242, 5264, 5332, 5371, 5409, 5433, 5434, 5435, 5466, 5542, 5616, 5655, 5696, 5747, 5776, 5828, 5885, 5911, 6005, 6016, 6017, 6018, 6032, 6108, 6188, 6227, 6268, 6328, 6375, 6404, 6422, 6423, 6424, 6505, 6581, 6649, 6676, 6707, 6740, 6780, 6809, 6851, 6902, 6920, 6921, 6922, 6943, 7003, 7041, 7106, 7138, 7193, 7211, 7222, 7223, 7224, 7259, 7288, 7324, 7356, 7384, 7417, 7492, 7502, 7587, 7611, 7612, 7688, 7689, 7711, 7712, 7720, 7721, 7758, 7759, 7851, 7852, 7860, 7861, 7911, 7912 ], "line_end_idx": [ 8, 9, 129, 130, 242, 243, 269, 270, 286, 301, 316, 327, 338, 339, 347, 348, 425, 426, 451, 452, 485, 624, 625, 646, 706, 707, 720, 721, 740, 763, 773, 774, 803, 804, 816, 817, 838, 839, 851, 852, 878, 879, 889, 890, 915, 916, 932, 950, 970, 991, 1012, 1013, 1025, 1026, 1059, 1060, 1091, 1167, 1241, 1280, 1321, 1372, 1401, 1453, 1510, 1536, 1630, 1641, 1642, 1651, 1652, 1708, 1758, 1808, 1858, 1908, 1958, 2008, 2009, 2021, 2022, 2081, 2082, 2094, 2095, 2117, 2163, 2215, 2270, 2333, 2357, 2358, 2434, 2435, 2448, 2449, 2466, 2467, 2519, 2520, 2534, 2535, 2549, 2625, 2705, 2744, 2785, 2821, 2868, 2897, 2915, 2916, 2928, 2929, 3010, 3086, 3154, 3181, 3212, 3245, 3285, 3314, 3356, 3392, 3410, 3411, 3421, 3422, 3451, 3521, 3527, 3601, 3602, 3610, 3611, 3670, 3671, 3692, 3752, 3790, 3820, 3885, 3917, 3972, 3990, 4001, 4002, 4012, 4013, 4047, 4048, 4072, 4073, 4085, 4095, 4105, 4116, 4146, 4147, 4163, 4268, 4304, 4337, 4338, 4357, 4380, 4381, 4393, 4409, 4410, 4454, 4484, 4514, 4515, 4527, 4542, 4543, 4555, 4566, 4567, 4594, 4608, 4609, 4621, 4639, 4640, 4662, 4676, 4677, 4698, 4717, 4718, 4719, 4741, 4787, 4839, 4894, 4957, 4981, 4982, 4983, 5005, 5068, 5120, 5171, 5216, 5240, 5241, 5242, 5264, 5332, 5371, 5409, 5433, 5434, 5435, 5466, 5542, 5616, 5655, 5696, 5747, 5776, 5828, 5885, 5911, 6005, 6016, 6017, 6018, 6032, 6108, 6188, 6227, 6268, 6328, 6375, 6404, 6422, 6423, 6424, 6505, 6581, 6649, 6676, 6707, 6740, 6780, 6809, 6851, 6902, 6920, 6921, 6922, 6943, 7003, 7041, 7106, 7138, 7193, 7211, 7222, 7223, 7224, 7259, 7288, 7324, 7356, 7384, 7417, 7492, 7502, 7587, 7611, 7612, 7688, 7689, 7711, 7712, 7720, 7721, 7758, 7759, 7851, 7852, 7860, 7861, 7911, 7912, 7926 ] }

{ "red_pajama_v2": { "ccnet_original_length": 7926, "ccnet_original_nlines": 289, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.04708363115787506, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03794800117611885, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5284609794616699, "rps_doc_frac_unique_words": 0.5292841792106628, "rps_doc_mean_word_length": 12.501084327697754, "rps_doc_num_sentences": 113, "rps_doc_symbol_to_word_ratio": 0.010541110299527645, "rps_doc_unigram_entropy": 5.22925329208374, "rps_doc_word_count": 461, "rps_doc_frac_chars_dupe_10grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_5grams": 0.47995835542678833, "rps_doc_frac_chars_dupe_6grams": 0.4674648642539978, "rps_doc_frac_chars_dupe_7grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_8grams": 0.42408469319343567, "rps_doc_frac_chars_dupe_9grams": 0.42408469319343567, "rps_doc_frac_chars_top_2gram": 0.030192609876394272, "rps_doc_frac_chars_top_3gram": 0.04580947011709213, "rps_doc_frac_chars_top_4gram": 0.05622072145342827, "rps_doc_books_importance": -525.1983032226562, "rps_doc_books_importance_length_correction": -525.1983032226562, "rps_doc_openwebtext_importance": -271.088623046875, "rps_doc_openwebtext_importance_length_correction": -271.088623046875, "rps_doc_wikipedia_importance": -165.58889770507812, "rps_doc_wikipedia_importance_length_correction": -165.58889770507812 }, "fasttext": { "dclm": 0.9999939203262329, "english": 0.11155085265636444, "fineweb_edu_approx": 3.60664701461792, "eai_general_math": 0.9549994468688965, "eai_open_web_math": 0.037448231130838394, "eai_web_code": 0.9123329520225525 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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

3,391,821,776,774,416,000

LxD Series: Laravel Basics Before we dive into coding Laravel based app, let’s learn what’s it all about. Laravel is an MVC based framework for rapid PHP based web application development. MVC(Model-View-Controller) is a design pattern used to write softwares. It consist of three parts: • Model: This component deals with data and it’s manipulation. Usually you deal with database(RDBMS,NoSQL) here but this is not necessary at all. Your model could interact with a flat file or some remote API for data manipulation. • View: The data which was processed or manipulated on model layer is shown by Views to end-users so that they could interact with the app. • Controller: Controller actually sits between View and Model and works as a bridge between two. Controller could be used to processed the data you fetch from Model and make it presentable to view as per your need. Routing In simplest word Routing is a mechanism used to map one kind of URL to another. Routing is used to convert ugly looking URLs to user-friendly or SEO friendly URL. So if there’s a URL http://example.com/users/user?id=12&name=Jhon, routing can convert it to http://exampe.com/users/user/12/Jhon. Prior to MVC frameworks we used to write multiple rules to cater different kind of URLS. MVC frameworks like Larave provides an easy way to come up a URL format as per your need. Behind the scene it still uses .htacess file. Laravel takes the benefit of Closure to implement routing. Migrations Usually when you create a database driven app you will create a sql script to create tables in db. Later when you go in production you have to run script on remote server. While working in a team and multiple developers making changes in a single database. It gets difficult to keep a track of it. Migrations help you to overcome this issue. You create migration files which contains timestamp in file name which contains an expressive syntax to create/drop tables. You can run a certain migration command on your local machine or remote server that will execute script in order. Laravel provides easy to use command to perform various migration related operations. For instance: Will create a migration file that will be responsible to create a table users. It will create a file like this: create creates a table users while down drops it. That’s all folks. In coming post we will be implementing routes and design in our Laravel app. Stay tuned! Join with me and let’s learn together! * indicates required Leave a Reply Your email address will not be published. Required fields are marked *

{ "url": "http://blog.adnansiddiqi.me/lxd-series-laravel-basics/", "source_domain": "blog.adnansiddiqi.me", "snapshot_id": "crawl=CC-MAIN-2017-13", "warc_metadata": { "Content-Length": "30985", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:RBJSA6A23NWT27XN54SNKWLGAOOZ6VMG", "WARC-Concurrent-To": "<urn:uuid:383fd1bf-0f08-4e53-afd1-5151bd632aff>", "WARC-Date": "2017-03-27T10:45:35Z", "WARC-IP-Address": "129.121.16.226", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:UAOS5GYB3JAKSCHCRUD4KM57M7ZZKRDC", "WARC-Record-ID": "<urn:uuid:c5da8e84-4728-42b9-8b4c-d9aadac54b31>", "WARC-Target-URI": "http://blog.adnansiddiqi.me/lxd-series-laravel-basics/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2af8a3b7-396c-410a-80bd-b3cf7795112b>" }, "warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 27, 28, 107, 108, 290, 291, 524, 666, 883, 884, 892, 893, 1471, 1472, 1483, 1484, 2064, 2065, 2165, 2166, 2278, 2279, 2329, 2330, 2437, 2438, 2440, 2441, 2443, 2444, 2483, 2484, 2505, 2506, 2507, 2521, 2522 ], "line_end_idx": [ 27, 28, 107, 108, 290, 291, 524, 666, 883, 884, 892, 893, 1471, 1472, 1483, 1484, 2064, 2065, 2165, 2166, 2278, 2279, 2329, 2330, 2437, 2438, 2440, 2441, 2443, 2444, 2483, 2484, 2505, 2506, 2507, 2521, 2522, 2592 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2592, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4000000059604645, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.024528300389647484, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1471698135137558, "rps_doc_frac_unique_words": 0.5128204822540283, "rps_doc_mean_word_length": 4.8088579177856445, "rps_doc_num_sentences": 36, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.026647567749023, "rps_doc_word_count": 429, "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.014541929587721825, "rps_doc_frac_chars_top_3gram": 0.015996120870113373, "rps_doc_frac_chars_top_4gram": 0.012603010050952435, "rps_doc_books_importance": -237.1290283203125, "rps_doc_books_importance_length_correction": -237.1290283203125, "rps_doc_openwebtext_importance": -162.61610412597656, "rps_doc_openwebtext_importance_length_correction": -162.61610412597656, "rps_doc_wikipedia_importance": -121.70683288574219, "rps_doc_wikipedia_importance_length_correction": -121.70683288574219 }, "fasttext": { "dclm": 0.12431126832962036, "english": 0.8847239017486572, "fineweb_edu_approx": 2.428980827331543, "eai_general_math": 0.003215370001271367, "eai_open_web_math": 0.0636906623840332, "eai_web_code": 0.004618590231984854 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,830,796,281,796,147,000

1//===- MsgPackWriter.h - Simple MsgPack writer ------------------*- C++ -*-===// 2// 3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4// See https://llvm.org/LICENSE.txt for license information. 5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6// 7//===----------------------------------------------------------------------===// 8/// 9/// \file 10/// This file contains a MessagePack writer. 11/// 12/// See https://github.com/msgpack/msgpack/blob/master/spec.md for the full 13/// specification. 14/// 15/// Typical usage: 16/// \code 17/// raw_ostream output = GetOutputStream(); 18/// msgpack::Writer MPWriter(output); 19/// MPWriter.writeNil(); 20/// MPWriter.write(false); 21/// MPWriter.write("string"); 22/// // ... 23/// \endcode 24/// 25/// 26//===----------------------------------------------------------------------===// 27 28#ifndef LLVM_BINARYFORMAT_MSGPACKWRITER_H 29#define LLVM_BINARYFORMAT_MSGPACKWRITER_H 30 31#include "llvm/BinaryFormat/MsgPack.h" 32#include "llvm/Support/EndianStream.h" 33#include "llvm/Support/MemoryBuffer.h" 34#include "llvm/Support/raw_ostream.h" 35 36namespace llvm { 37namespace msgpack { 38 39/// Writes MessagePack objects to an output stream, one at a time. 40class Writer { 41public: 42 /// Construct a writer, optionally enabling "Compatibility Mode" as defined 43 /// in the MessagePack specification. 44 /// 45 /// When in \p Compatible mode, the writer will write \c Str16 formats 46 /// instead of \c Str8 formats, and will refuse to write any \c Bin formats. 47 /// 48 /// \param OS stream to output MessagePack objects to. 49 /// \param Compatible when set, write in "Compatibility Mode". 50 Writer(raw_ostream &OS, bool Compatible = false); 51 52 Writer(const Writer &) = delete; 53 Writer &operator=(const Writer &) = delete; 54 55 /// Write a \em Nil to the output stream. 56 /// 57 /// The output will be the \em nil format. 58 void writeNil(); 59 60 /// Write a \em Boolean to the output stream. 61 /// 62 /// The output will be a \em bool format. 63 void write(bool b); 64 65 /// Write a signed integer to the output stream. 66 /// 67 /// The output will be in the smallest possible \em int format. 68 /// 69 /// The format chosen may be for an unsigned integer. 70 void write(int64_t i); 71 72 /// Write an unsigned integer to the output stream. 73 /// 74 /// The output will be in the smallest possible \em int format. 75 void write(uint64_t u); 76 77 /// Write a floating point number to the output stream. 78 /// 79 /// The output will be in the smallest possible \em float format. 80 void write(double d); 81 82 /// Write a string to the output stream. 83 /// 84 /// The output will be in the smallest possible \em str format. 85 void write(StringRef s); 86 87 /// Write a memory buffer to the output stream. 88 /// 89 /// The output will be in the smallest possible \em bin format. 90 /// 91 /// \warning Do not use this overload if in \c Compatible mode. 92 void write(MemoryBufferRef Buffer); 93 94 /// Write the header for an \em Array of the given size. 95 /// 96 /// The output will be in the smallest possible \em array format. 97 // 98 /// The header contains an identifier for the \em array format used, as well 99 /// as an encoding of the size of the array. 100 /// 101 /// N.B. The caller must subsequently call \c Write an additional \p Size 102 /// times to complete the array. 103 void writeArraySize(uint32_t Size); 104 105 /// Write the header for a \em Map of the given size. 106 /// 107 /// The output will be in the smallest possible \em map format. 108 // 109 /// The header contains an identifier for the \em map format used, as well 110 /// as an encoding of the size of the map. 111 /// 112 /// N.B. The caller must subsequently call \c Write and additional \c Size*2 113 /// times to complete the map. Each even numbered call to \c Write defines a 114 /// new key, and each odd numbered call defines the previous key's value. 115 void writeMapSize(uint32_t Size); 116 117 /// Write a typed memory buffer (an extension type) to the output stream. 118 /// 119 /// The output will be in the smallest possible \em ext format. 120 void writeExt(int8_t Type, MemoryBufferRef Buffer); 121 122private: 123 support::endian::Writer EW; 124 bool Compatible; 125}; 126 127} // end namespace msgpack 128} // end namespace llvm 129 130#endif // LLVM_BINARYFORMAT_MSGPACKWRITER_H 131

{ "url": "https://code.woboq.org/llvm/llvm/include/llvm/BinaryFormat/MsgPackWriter.h.html", "source_domain": "code.woboq.org", "snapshot_id": "crawl=CC-MAIN-2022-21", "warc_metadata": { "Content-Length": "22137", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HOYVVLYKSJGEAS53SF3GDGBDUQH3L4CW", "WARC-Concurrent-To": "<urn:uuid:d6eb069f-20bc-490a-af57-c925c8b0a74c>", "WARC-Date": "2022-05-19T04:53:59Z", "WARC-IP-Address": "134.119.46.51", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:TN4I2SOCDAHJXHEXWJMDPWBNSZ2CQMSM", "WARC-Record-ID": "<urn:uuid:921f2b67-0fbd-4587-943d-978d40c21cf6>", "WARC-Target-URI": "https://code.woboq.org/llvm/llvm/include/llvm/BinaryFormat/MsgPackWriter.h.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f7c8136d-2a8d-418f-ac98-d8d689b1d0b7>" }, "warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-60\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 1, 83, 87, 169, 231, 291, 295, 377, 382, 393, 440, 446, 524, 545, 551, 572, 584, 630, 670, 697, 726, 758, 771, 786, 792, 798, 881, 884, 928, 972, 975, 1016, 1057, 1098, 1138, 1141, 1160, 1182, 1185, 1254, 1271, 1281, 1360, 1401, 1408, 1482, 1562, 1569, 1627, 1693, 1746, 1749, 1785, 1832, 1835, 1880, 1887, 1933, 1953, 1956, 2005, 2012, 2057, 2080, 2083, 2135, 2142, 2209, 2216, 2273, 2299, 2302, 2357, 2364, 2431, 2458, 2461, 2520, 2527, 2596, 2621, 2624, 2668, 2675, 2742, 2770, 2773, 2824, 2831, 2898, 2905, 2972, 3011, 3014, 3074, 3081, 3150, 3156, 3236, 3284, 3292, 3370, 3407, 3447, 3451, 3509, 3517, 3585, 3592, 3671, 3718, 3726, 3807, 3888, 3966, 4004, 4008, 4086, 4094, 4162, 4218, 4222, 4234, 4266, 4287, 4293, 4297, 4327, 4354, 4358, 4405 ], "line_end_idx": [ 1, 83, 87, 169, 231, 291, 295, 377, 382, 393, 440, 446, 524, 545, 551, 572, 584, 630, 670, 697, 726, 758, 771, 786, 792, 798, 881, 884, 928, 972, 975, 1016, 1057, 1098, 1138, 1141, 1160, 1182, 1185, 1254, 1271, 1281, 1360, 1401, 1408, 1482, 1562, 1569, 1627, 1693, 1746, 1749, 1785, 1832, 1835, 1880, 1887, 1933, 1953, 1956, 2005, 2012, 2057, 2080, 2083, 2135, 2142, 2209, 2216, 2273, 2299, 2302, 2357, 2364, 2431, 2458, 2461, 2520, 2527, 2596, 2621, 2624, 2668, 2675, 2742, 2770, 2773, 2824, 2831, 2898, 2905, 2972, 3011, 3014, 3074, 3081, 3150, 3156, 3236, 3284, 3292, 3370, 3407, 3447, 3451, 3509, 3517, 3585, 3592, 3671, 3718, 3726, 3807, 3888, 3966, 4004, 4008, 4086, 4094, 4162, 4218, 4222, 4234, 4266, 4287, 4293, 4297, 4327, 4354, 4358, 4405, 4408 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4408, "ccnet_original_nlines": 131, "rps_doc_curly_bracket": 0.0013611599570140243, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19301848113536835, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01745380088686943, "rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182, "rps_doc_frac_no_alph_words": 0.4271047115325928, "rps_doc_frac_unique_words": 0.47519999742507935, "rps_doc_mean_word_length": 4.844799995422363, "rps_doc_num_sentences": 56, "rps_doc_symbol_to_word_ratio": 0.008213549852371216, "rps_doc_unigram_entropy": 5.057499408721924, "rps_doc_word_count": 625, "rps_doc_frac_chars_dupe_10grams": 0.031043589115142822, "rps_doc_frac_chars_dupe_5grams": 0.1882430613040924, "rps_doc_frac_chars_dupe_6grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_7grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_8grams": 0.17239102721214294, "rps_doc_frac_chars_dupe_9grams": 0.10634081810712814, "rps_doc_frac_chars_top_2gram": 0.05350065976381302, "rps_doc_frac_chars_top_3gram": 0.04293262958526611, "rps_doc_frac_chars_top_4gram": 0.04953765124082565, "rps_doc_books_importance": -376.7179870605469, "rps_doc_books_importance_length_correction": -376.7179870605469, "rps_doc_openwebtext_importance": -276.1429138183594, "rps_doc_openwebtext_importance_length_correction": -276.1429138183594, "rps_doc_wikipedia_importance": -156.772705078125, "rps_doc_wikipedia_importance_length_correction": -156.772705078125 }, "fasttext": { "dclm": 0.977286159992218, "english": 0.5343935489654541, "fineweb_edu_approx": 2.8326990604400635, "eai_general_math": 0.9870448708534241, "eai_open_web_math": 0.7040668725967407, "eai_web_code": 0.7642819881439209 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

817,575,042,212,235,900

User Tools Site Tools “0 = 1 (only for Metroids!)” return_of_samus:data_locations:ram_map This is an old revision of the document! Return of Samus: RAM Map An in-progress RAM map to aid in custom assembly and ROM disassembly. Overview 0000-3FFF: 16KB ROM Bank (fixed - bank 0) 4000-7FFF: 16KB ROM Bank (swappable) 8000-9FFF: 8KB Video RAM A000-BFFF: 8KB Save RAM C000-DFFF: 8KB Work RAM E000-FDFF: Echo RAM (unused) FE00-FE9F: OAM FEA0-FEFF: Not usable FF00-FF7F: I/O Ports FF80-FFFE: High RAM FFFF: Interrupt enable register VRAM 8000-97FF: VRAM tiles 8000-87AF: Samus 8080-9F: Arm cannon 8B00-8EFF: Enemies 0x8C00-8E2F: Characters if room has message box (probably loaded with chozo?) 9000-97FF: Background 9800-9FFF: VRAM tilemap 9800-9BFF: Background 9C00-9FFF: Window 9C00: Status bar 9C20: Message SRAM A000-A03F: File 1 + 00-07: 0123456789ABCDEF + 08: Samus' Y position + 0A: Samus' X position + 0C: Screen Y position + 0E: Screen X position + 10: Enemy tiles source address (2 bytes) + 12: Background tiles source bank + 13: Background tiles source address (2 bytes) + 15: Metatile definitions source address (bank 8, 2 bytes) + 17: Source address of data for $DC00..FF (bank 8, 2 bytes) + 19: Bank for current room + 1A: Samus passable block threshold + 1B: Enemy passable block threshold + 1C: Projectile passable block threshold + 1D: Samus' equipment + 1E: Samus' beam + 1F: Samus' energy tanks + 20: Samus' health + 22: Samus' max missiles + 24: Samus' missiles + 26: Direction Samus is facing + 27: Acid damage + 28: Spike damage + 29: Real number of Metroids remaining + 2A: Song for room + 2B: In-game timer, minutes + 2C: In-game timer, hours + 2D: Number of Metroids remaining A040-A07F: File 2 A080-A0BF: File 3 A0C0: Last used save slot A800-ACE2: Written to in credits [$6:7920..7E02] B000-B1BF: File 1 Item/Metroid data (0x40 bytes per map) B200-B3BF: File 2 Item/Metroid data (verify) B400-B5BF: File 3 Item/Metroid data WRAM C000-9F: OAM buffer (gets copied by the sprite DMA) + 0: Y position + 1: X position + 2: Tile number + 3: Attributes 10: Palette 20: X flip 40: Y flip 80: Priority (set: behind background) C203: Tile Y (see $22BC) C204: Tile X (see $22BC) C205: Scroll Y C206: Scroll X C215: Tilemap address of ([$C204], [$C203]) (see $22BC) C308-37: Ch slots of 4 bytes according to $3:6E36 + 3: XOR'd with 10h in $6E36 every fourth frame C3A1: Scroll X for LCD interrupt handler type = 1 C3A8: X position of Metroid Queen's head on screen C3A9: Y position of Metroid Queen's head on screen C3AA: A two-byte pointer to LCD interrupt data C3D2: Background palette for LCD interrupt handler type = 1 C3D3: Metroid Queen's health C3EF: Set to 1 in $3:6E36 if 0 < [Metroid Queen's health] < 32h, probably an aggression flag C3F1: Set to 1 in $3:6E36 if 0 < [Metroid Queen's health] < 64h, probably an aggression flag C407: Set to [$D069] in $2:4000 C40F: bottom-most visible metatile row index in map * $10 (big-endian word). C411: top-most visible metatile row index in map * $10 (big-endian word). C413: right-most visible metatile column index in map * $10 (big-endian word). C415: left-most visible metatile column index in map * $10 (big-endian word). C418: Set to [$D058] in $2:4000 C422: Cleared by $2EE3, set to 1 by $1FF5 C423: Value for $D00F in $2EE3, cleared by $1FF5 C424: Read by $2EE3, set to [$D078] by $1FF5 C430: Used as index for pointer table at $1:5AB1 C432: Scroll Y two frames ago (according to $3:4000) C433: Scroll Y one frame ago (according to $3:4000) C434: Scroll X two frames ago (according to $3:4000) C435: Scroll X one frame ago (according to $3:4000) C44B: Checked and set in $2:4000, previous value for $C458 in $239C C459: Used by $1:7A6C (when saving to SRAM), decides where in C540.. to process for $C900 C45C: Used as index for table at $1:729C, value for $FFEA C500-FE: Object spawn states (map-specific) C500-C53F: Non-persistent object (e.g. enemy) spawn states 01: Spawned in object table ("visible") 02: Dead/acquired FF: Not spawned C540-7F: Persistent object (e.g. item, Metroid) spawn states C600..C7FF: Enemy data. 20h byte slots according to $30BB, current address is kept in $D05E + 0: Flags. If bits 0-3 clear, $30BB executes $30EA on slot. If bit 7 is set sprite is invisible (blinking). + 1: Y coordinate. Value for $FFB7 in $30EA + 2: X coordinate. Value for $FFB8 in $30EA + 3: Metasprite number. Value for $FFB9 in $30EA + 4: Priority bit ($80) for sprites. Value for $FFBF in $30EA + 5: Sprite flip flags ($20 for horizontal, $40 for vertical) + 6: Low nibble is blink frames remaining. Bit 4 is sprite palette flag. + A: Frozen frame counter. Increments by 2 every 4 frames. 0 is not frozen, 1-$C4 is frozen, $C5-$D0 is thawing. + B: Health + 1D: Map object slot index C900-CABF: Item/Metroid data bytes (0x40 per map, gets saved to SRAM) CEC0-CFFF: Audio data CEC0: Tone/sweep channel sound effect CEC0: Tone/sweep channel sound effect to play 0: Nothing 1: Jumping 2: Hi-jumping 3: Screw attacking 4: Uncrouching / turning around / landing 5: Crouching / unmorphing 6: Morphing 7: Shooting beam 8: Shooting missile 9: Shooting ice beam Ah: Shooting plasma beam Bh: Shooting spazer beam Ch: Picked up missile drop Dh: Spider ball Eh: Picked up energy drop Fh: Shot missile door with beam 10h: 11h: 12h: 13h: Bomb laid 14h: 15h: Option select / missile select 16h: Shooting wave beam 17h: 18h: Samus' health changed 19h: No missile dud shot 1Ah: 1Bh: Metroid cry 1Ch: Saved 1Dh: 1Eh: Unpaused CEC1: Tone/sweep channel sound effect playing CEC3: Tone/sweep channel sound effect timer CEC7: Tone channel sound effect CEC7: Tone channel sound effect to play 0: Nothing 1: Nothing 2: Nothing 3: Metroid Queen cry 4: Baby Metroid hatched / clearing blocks 5: Baby Metroid cry 6: Metroid Queen hurt cry 7: CEC8: Tone channel sound effect playing CECA: Tone channel sound effect timer CECE-CED4: Would be the wave channel sound effect, but is unused (only cleared) and CEE6 is exclusively used instead. CED5: Noise channel sound effect CED5: Noise channel sound effect to play 0: Nothing 1: Enemy shot 2: Enemy killed 3: 4: Shot block destroyed 5: Metroid hurt 6: Samus hurt 7: Acid damage 8: Shot missile door with missile 9: Metroid Queen cry Ah: Metroid Queen hurt cry Bh: Samus killed Ch: Bomb detonated Dh: Metroid killed Eh: Fh: 10h Footsteps 11h: 12h: 13h: 14h: 15h: 16h: Baby Metroid hatched / clearing blocks 17h: Baby Metroid cry 18h: 19h: 1Ah: CED6: Noise channel sound effect playing CED8: Noise channel sound effect timer CEDC: Song to play 0: Nothing 1: Baby Metroid 2: Metroid Queen battle 3: Chozo ruins 4: Main caves 5: Sub caves 1 6: Sub caves 2 7: Sub caves 3 8: Final caves 9: Metroid hive Ah: Item-get Bh: Metroid Queen hallway Ch: Metroid battle Dh: Sub caves 4 Eh: Earthquake Fh: Killed Metroid 10h: Nothing 11h: Title 12h: Samus fanfare 13h: Reach the gunship 14h: Chozo ruins, same as 3 15h: Main caves, no intro 16h: Sub caves 1, no intro 17h: Sub caves 2, no intro 18h: Sub caves 3, no intro 19h: Final caves, same as 8 1Ah: Metroid hive, same as 9 1Bh: Item-get, same as Ah 1Ch: Metroid Queen hallway, same as Bh 1Dh: Metroid battle, same as Ch 1Eh: Sub caves 4, no intro 1Fh: Metroid hive with intro 20h: Missile pickup CEDD: Song playing CEDE: Isolated sound effect to play 0: Go to $42EA 1: Go to $432B, play item-get music 3: Go to $4390 (restores some audio state) 5: Go to $4335, play missile pickup music 8: Go to $43FB Eh: Go to $433F, play earthquake music FFh: $CEDE = 0, $CEDF = 0, go to $42FA Otherwise: Go to $42FA CEDF: Isolated sound effect playing If [$CEDE] = 0: 2: Go to $43C4 (set by isolated sound effect to play = 3, restores some audio state) 8: Go to $4418 Otherwise: Go to $42FA CEE4: Current tone/sweep channel sound effect CEE5: Current tone channel sound effect CEE6: Low health beep / wave channel sound effect 0: Samus' health >= 50 1: Samus' health < 20 2: Samus' health < 30 3: Samus' health < 40 4: Samus' health < 50 CEE7: Current noise channel sound effect CF00-60: CF00: Music note offset. Set to [$5F30 + ([song to play] - 1) * 2] & ~1 in $48A0 CF01: Pointer to value for $CF34/$CF36. Set to [$5F30 + ([song to play] - 1) * 2 + 1] in $48A0 CF03: Working sound channel (1/2/3/4) CF04: Set to 1 if [$CF38] != 0 in $48A0 CF05: Set to 2 if [$CF41] != 0 in $48A0 CF06: Set to 3 if [$CF4A] != 0 in $48A0 CF07: Set to 4 if [$CF53] != 0 in $48A0 CF08: Checked to mirror $CF0B/0C to $CF10/11 in $497A CF09: Pointer to wave pattern data, 10h bytes CF0B: Working sound channel sweep / enable CF0C: Working sound channel sound length / wave pattern duty CF0D: Working sound channel envelope / volume CF0E: Working sound channel frequency / noise channel polynomial counter CF0F: Working noise channel counter control CF10-23: Audio channel options (which conveniently correspond with FF10-23) CF10: Tone/sweep channel sweep CF11: Tone/sweep channel sound length / wave pattern duty CF12: Tone/sweep channel envelope CF13: Tone/sweep channel frequency CF15: Unused CF16: Tone channel sound length / wave pattern duty CF17: Tone channel envelope CF18: Tone channel frequency CF1A: Wave channel enable CF1B: Wave channel sound length CF1C: Wave channel volume CF1D: Wave channel frequency CF1F: Unused CF20: Noise channel sound length CF21: Noise channel envelope CF22: Noise channel polynomial counter CF23: Noise channel counter control CF26: Song tone/sweep channel instruction pointer CF28: Song tone channel instruction pointer CF2A: Song wave channel instruction pointer CF2C: Song noise channel instruction pointer CF2E: A 12 frame timer CF2F-37: Working song sound channel options CF2F: Instruction pointer F1 ee ss ll: For non-wave channels. Working sound channel envelope = ee, working sound channel sweep = ss, working sound channel sound length / wave pattern duty = ll F1 pppp vv: For the wave channel. Pointer to wave pattern data = pppp, working sound channel volume = vv F2 pppp: $CF01 = pppp F3 oo: Add oo to any played music notes (sets $CF00) F4 nn: Repeat from after this instruction nn times |: (sets $CF31/$CF33) F5: Repeat :| (decrements $CF31) CF31: Repeat count CF33: Repeat point CF35: Sound envelope / volume CF37: Sound length (according to song instruction F1h) CF38-40: Song tone/sweep channel options CF38: Set to [$5F30 + ([song to play] - 1) * 2 + 3] in $48A0 CF3F: Set to 1 in $48A0 CF41-49: Song tone channel options CF41: Set to [$5F30 + ([song to play] - 1) * 2 + 5] in $48A0 CF48: Set to 1 in $48A0 CF4A-52: Song wave channel options CF4A: Set to [$5F30 + ([song to play] - 1) * 2 + 7] in $48A0 CF51: Set to 1 in $48A0 CF53-5B: Song noise channel options CF53: Set to [$5F30 + ([song to play] - 1) * 2 + 9] in $48A0 CF5A: Set to 1 in $48A0 CF5C: Set to D0h by [$CEDE] == 8 (timer), sets $CF3E = $CF47 = $CF59 = $CF5D = $CF5E = [a] 0: Song play = isolated sound effect to play = 0, disable sound channels 10h: a = 13h 30h: a = 25h 70h: a = 45h, $CF07 = 0, $CF50 = $CF5F = 60h A0h: a = 65h CF5D: Set to [$CF3E] by [$CEDE] == 8 CF5E: Set to [$CF47] by [$CEDE] == 8 CF5F: Set to [$CF50] by [$CEDE] == 8 CF60: Tone channel frequency tweak. Set to 1 if [$5F30 + ([song to play] - 1) * 2] & 1 in $48A0 CF61-C1: Mirror of $CF00-60? CFC5: Backup of song playing during isolated sound effect CFC7: 1: Go to $4801 2: Go to $4846. Set when unpausing: plays unpaused sound effect Otherwise: $4819 CFC8: Flag to go to $4852, set to 40h by $4801 CFC9: Mirror of $CF10? (tone/sweep channel sweep) CFE3: Mirror of $CF09? CFE5: Low health beep / wave channel sound effect to play CFE6: Low health beep / wave channel sound effect playing CFE7: Mirror of $CFE6? CFEC: Mirror of $CFED? CFED: Audio channel output stereo flags CFEE: Quickly guessing wave pattern timer D008: Metatile top-left D009: Metatile top-right D00A: Metatile bottom-left D00B: Metatile bottom-right D00C: Samus' previous Y position D00E: Door transition direction 1: Right 2: Left 4: Up 8: Down D00F: Set to [$C423] by $2EE3, set to 1 by escaping Metroid Queen / in Metroid Queen's mouth D010: Counter for spin-jumping D011: Nothing. Only cleared D012: Value for $D060 in $31F1 D020: Samus' pose 00: Standing 01: Jumping 02: Spin-jumping 03: Running (set to 83h when turning) 04: Crouching 05: Morphball 06: Morphball jumping 07: Falling 08: Morphball falling 09: Starting to jump 0A: Starting to spin-jump 0B: Spider ball rolling 0C: Spider ball falling 0D: Spider ball jumping 0E: Spider ball 0F: Knockback 10: Morphball knockback 11: Standing bombed 12: Morphball bombed 13: Facing screen 18: Being eaten by Metroid Queen 19: In Metroid Queen's mouth 1A: Being swallowed by Metroid Queen 1B: In Metroid Queen's stomach 1C: Escaping Metroid Queen 1D: Escaped Metroid Queen D022: += 3 in $08FE during door transition D023: Direction of screen movement 10: Right 20: Left 40: Up 80: Down D027: Samus X position D029: Samus Y position D02B: Direction Samus is facing, mirrored from $D81E at save load. 0: Left 1: Right D02C: Samus turning animation counter D035: Screen right velocity D036: Screen left velocity D037: Screen up velocity D038: Screen down velocity D039: Set to 0 by load title screen D03B: Samus' Y position on screen D03C: Samus' X position on screen, checked for <= A0h in $08FE D03D: Spider ball direction 0: In air 1: On bottom-left corner of ledge 2: On top-left corner of ledge 3: On left-facing wall 4: On bottom-right corner of ledge 5: On ceiling 6: Unused 7: On meet of left-facing wall and ceiling 8: On top-right corner of ledge 9: Unused Ah: On floor Bh: On meet of left-facing wall and floor Ch: On right-facing wall Dh: On meet of right-facing wall and ceiling Eh: On meet of right-facing wall and floor D045: Samus' equipment, mirrored from $D815 at save load. 01: Bombs 02: Hi-jump 04: Screw attack 08: Space jump 10: Spring ball 20: Spider ball 40: Varia suit D046: Debug screen selector index D047: Tiles update flag (see $FFB1..B6, $2BA3, $27BA) D04D: Weapon equipped. 0: Normal 1: Ice 2: Wave 3: Spazer 4: Plasma 8: Missile D04E: Bank D050: Samus' max energy tanks, mirrored from $D817 at save load. D051: Samus' health, mirrored from $D818 at save load. D052: Samus' filled energy tanks, mirrored from $D819 at save load. D053: Samus' missiles(upper nybble tens, lower nybble ones), mirrored from $D81C at save load. D054: Samus' missiles(upper nybble thousands, lower nybble hundreds), mirrored from $D81D at save load. D055: Samus' beam. Saved to SRAM, mirrored from $D816 at save load. 0: Normal 1: Ice 2: Wave 3: Spazer 4: Plasma D056: Samus passable block threshold D057: Room sprite priority 0: Sprites over BG 1: BG over sprites D058: Bank for current room D059: Death sequence timer. Used as index into offset table for dest address in $2FE1 D064: Used in $239C as new OAM stack pointer, set to OAM stack pointer in $04DF D065: VRAM DMA bank (see $FFB1-B6, $2BA3) D066: Used in v-blank handler. Timer for fade in. Set to 40h by $0CA3, set to 2Fh by $239C when type = Ah, set to A0h by game mode Ah, set to FFh by reached the gunship D067: Used in title. Set to 01h by $0CA3 and game mode Ah D069: Enemy passable block threshold D06E: Highest OAM stack pointer D073: Two byte pointer, data for [$C215] before subtracting 21h; pointer to SRAM? Compared with F0h to enable $D09F, probably credits text D076: Used in v-blank handler. Flag to go to $5:403D; set every few frames during credits D077: Acid damage. Saved to SRAM D078: Spike damage. Saved to SRAM D079: Flag to load characters. But also used in facing screen as a flag to check if buttons are pressed D07A: Save slot option selected 0: Start 1: Clear D07B: Used in title. Y position of stars? D07C: Used in title. X position of stars? D07E: BG palette D07F: Object 0 palette D080: Object 1 palette D081: Samus' max missiles(upper nybble tens, lower nybble ones), mirrored from $D81A at save load. D082: Samus' max missiles(upper nybble thousands, lower nybble hundreds), mirrored from $D81B at save load. D083: Read in $1:7A34, adjusts sprite Y position in $1:4DDF D084: Samus' health for display, mirror of $D051/D818? D086: Samus' missiles for display, mirror of $D053/$D81C? D089: Real number of Metroids remaining D08A: Projectile passable block threshold D08B: Metroid Queen's room flag 11h: In Metroid Queen's room (set by screen transition command 8) D08D: Value for $D05D in $31F1 D08E: Index of screen transition command set. Set to [$4300 + ([screen Y position high] * 10h + [screen X position high]) * 2] & ~800h by set up door transition D090: Metroid Queen eating pose Sets Samus pose = escaping Metroid Queen when 7, checked for 5/20h and set to 6 in in Metroid Queen's mouth 0: Otherwise 1: Samus entering mouth 2: Mouth closing 3: Mouth closed 5: Samus escaping mouth 6: Swallowing Samus 7: 8: Samus escaping stomach 10h: Paralysed (can enter mouth) 20h: 22h: Dying D091: Set to 3 in $8:7EBC if killed a target number of Metroids or 1 if only Metroid Queen is remaining D092: Song for room D096: Metroids remaining shuffle timer D097: Index for $5:5620 jump table (first call in credits) D098: In-game timer, minutes D099: In-game timer, hours D09A: Number of Metroids remaining D09B: Fade in timer D09E: Checked and cleared in $2:4000, value for $FFC9 in $0C37 D09F: Flag to display in-game time in credits D0A0: Debug flag D0A2: In-game timer, 256-frame periods (roughly 14ths of a minute) D0A3: Save slot D0A4: Show clear save slot option flag D0A7: Metroids remaining in area D700-3F: Screen transition commands D800-25: Save data. Data loaded from $1:4E64-89 by game mode Bh, loaded from $A008-2D + save slot * 40h by game mode Ch D800: Samus' Y position D802: Samus' X position D804: Screen Y position D806: Screen X position D808: Enemy tiles source address (2 bytes) D80A: Background tiles source bank D80B: Background tiles source address (2 bytes) D80D: Metatile definitions source address (bank 8, 2 bytes) D80F: Source address of data for $DC00-FF (bank 8, 2 bytes) D811: Bank for current room D812: Samus passable block threshold (>= this tile index is passable, < is impassible) D813: Enemy passable block threshold D814: Projectile passable block threshold D815: Samus' equipment at save load. D816: Samus' beam at save load. D817: Samus' max energy tanks at save load. D818: Samus' health at save load. D819: Samus' filled energy tanks at save load. D81A: Samus' max missiles at save load. Upper nybble tens, lower nybble ones. D81B: Samus' max missiles at save load. Upper nybble thousands, lower nybble hundreds. D81C: Samus' missiles at save load. Upper nybble tens, lower nybble ones. D81D: Samus' missiles at save load. Upper nybble thousands, lower nybble hundreds. D81E: Direction Samus is facing at save load. D81F: Acid damage D820: Spike damage D821: Real number of Metroids remaining D822: Song for room D823: In-game timer, minutes D824: In-game timer, hours D825: Number of Metroids remaining D900-FF: 10h byte slots? The first byte of which each is cleared when saving DA00-DBFF: Metatile definitions DC00-FF: Tile properties 1: Viscous. Reduces jumping and detaches spider ball on movement. Also causes morph ball sound effect glitch. 2: Jump-through block. Passable when jumping, impassable in all other states (in all directions). 4: Fall-through block. Passable when falling, impassable in all other states (in all directions). 8: Spike 10h: Acid 20h: Destructible by shot/bomb 40h: Destructible by bomb 80h: Save pillar DD00-FF: Projectile RAM DE00-FF: Metatile update entries + 0: Dest. address. $0000 terminates update + 2: Top-left tile + 3: Top-right tile + 4: Bottom-left tile + 5: Bottom-right tile DF00-FF: Stack HRAM FF80: Buttons 01: A 02: B 04: Select 08: Start 10: Right 20: Left 40: Up 80: Down FF81: New buttons FF82: V-blank handled flag FF8D: OAM stack pointer FF97: Frame counter FF98: Sprite tile number (see $5:4015). Mirror of sprite Y position (see $30BB). Door scroll flags (see $08FE): [$4200 + [screen Y position, screen] * 16 + [screen X position, screen]] FF99: Two sprite tile numbers (see $5:4000). Mirror of sprite X position (see $30BB). Door thing (see $08FE): [Samus' Y position] - [$FFC8] + 60h FF9B: Game mode 0: Boot 1: Title screen 2: Loading save 2 3: Loading save 3 4: In-game 5: Dead 6: Dying 7: Game over 8: Paused 9: Save to SRAM Ah: Unused Bh: Start new game Ch: Load from save Dh: RET Eh: RET Fh: Unused. Identical to 7, set by game mode Ah 10h: Unused. Game cleared 11h: Unused. Functionally identical to 7, set by game mode 10h 12h: Reached the gunship 13h: Credits FFA0-A9: OAM DMA routine FFAA: VRAM tilemap metatile update address. $FFAA = $9800 + ([row block to update] * 32 + [column block to update]) * 2 FFAC: Index of screen for metatile update. $FFAC = [row screen to update] * 16 + [column screen to update] FFAD: Index of block for metatile update. $FFAD = [row block to update] * 16 + [column block to update] FFAE: Number of blocks to update FFAF: Stack pointer for metatile update entries FFB1: VRAM DMA source address FFB3: VRAM DMA dest address, also source offset from $CE20 when [$D08C] is set FFB5: VRAM DMA size FFB7-BB: Energy tank graphics, other stuff too though FFB7: Offset for interval for [$FF98] in $30EA FFB8: Offset for interval for [$FF99] in $30EA FFB9: Table index for offset data in $30EA FFBA: Start of interval for [$FF98] in $30EA FFBB: End of interval for [$FF98] in $30EA FFBC: Start of interval for [$FF99] in $30EA FFBD: End of interval for [$FF99] in $30EA FFBF: Flags to negate values in $30EA FFC0: Samus' Y position FFC2: Samus' X position FFC4: Sprite Y position (see $5:4015) FFC5: Sprite X position (see $5:4015) FFC6: Sprite set FFC7: Sprite attributes (see $5:4015) FFC8: Screen Y position FFCA: Screen X position FFCC: Row to update (in pixels) FFCE: Column to update (in pixels) FFE0-FFF5: Used by active enemies (??) FFFE: Counts every other in-game frame return_of_samus/data_locations/ram_map.1561758461.txt.gz · Last modified: 2019/06/28 21:47 by kkzero

{ "url": "https://wiki.metroidconstruction.com/doku.php?id=return_of_samus:data_locations:ram_map&rev=1561758461", "source_domain": "wiki.metroidconstruction.com", "snapshot_id": "crawl=CC-MAIN-2020-29", "warc_metadata": { "Content-Length": "37610", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:R55XA77XRWWWOIXOWFVRQNOHKMMXIYCQ", "WARC-Concurrent-To": "<urn:uuid:4f5aa64b-4ff3-4aca-a558-eb55e631c13e>", "WARC-Date": "2020-07-13T20:49:10Z", "WARC-IP-Address": "173.231.211.222", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:KV6CVHC2VEBKZ23UO3Y2NLKIBK7UE36I", "WARC-Record-ID": "<urn:uuid:7984900e-fa6e-43ba-8243-987cbf973d1c>", "WARC-Target-URI": "https://wiki.metroidconstruction.com/doku.php?id=return_of_samus:data_locations:ram_map&rev=1561758461", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:86472599-addb-4abe-a135-31941e522537>" }, "warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-82.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 11, 12, 23, 24, 53, 54, 93, 94, 135, 136, 137, 162, 163, 233, 234, 243, 244, 286, 323, 348, 372, 396, 425, 440, 462, 483, 503, 540, 541, 546, 547, 569, 590, 618, 641, 727, 753, 777, 803, 825, 850, 872, 873, 878, 879, 897, 927, 955, 983, 1011, 1039, 1086, 1125, 1177, 1241, 1306, 1338, 1379, 1420, 1466, 1493, 1515, 1545, 1569, 1599, 1625, 1661, 1683, 1706, 1750, 1774, 1807, 1838, 1877, 1895, 1913, 1945, 1946, 1995, 1996, 2053, 2054, 2099, 2100, 2136, 2137, 2142, 2143, 2195, 2215, 2235, 2256, 2276, 2297, 2317, 2337, 2384, 2385, 2410, 2435, 2450, 2465, 2466, 2522, 2523, 2573, 2625, 2626, 2676, 2677, 2728, 2779, 2826, 2827, 2887, 2916, 2917, 3010, 3011, 3104, 3105, 3137, 3138, 3215, 3289, 3368, 3446, 3447, 3479, 3480, 3522, 3571, 3616, 3617, 3666, 3667, 3720, 3772, 3825, 3877, 3878, 3946, 3947, 4037, 4038, 4096, 4097, 4141, 4204, 4252, 4278, 4302, 4367, 4368, 4460, 4573, 4621, 4669, 4722, 4788, 4854, 4931, 5048, 5064, 5096, 5097, 5167, 5168, 5190, 5232, 5286, 5313, 5340, 5370, 5405, 5463, 5505, 5533, 5566, 5602, 5639, 5680, 5721, 5764, 5796, 5838, 5886, 5908, 5930, 5952, 5983, 6005, 6057, 6097, 6119, 6162, 6203, 6225, 6258, 6285, 6307, 6337, 6391, 6392, 6444, 6449, 6485, 6533, 6560, 6587, 6614, 6651, 6709, 6745, 6787, 6807, 6855, 6864, 6910, 6911, 7033, 7034, 7071, 7120, 7147, 7177, 7209, 7229, 7269, 7301, 7331, 7362, 7412, 7449, 7492, 7525, 7560, 7595, 7616, 7637, 7667, 7689, 7711, 7733, 7755, 7777, 7837, 7875, 7897, 7919, 7941, 7990, 7999, 8046, 8047, 8070, 8093, 8121, 8157, 8184, 8210, 8237, 8264, 8291, 8318, 8346, 8371, 8409, 8440, 8468, 8495, 8526, 8551, 8574, 8605, 8640, 8680, 8718, 8757, 8796, 8835, 8875, 8916, 8954, 9005, 9049, 9088, 9129, 9161, 9184, 9224, 9251, 9299, 9354, 9408, 9435, 9486, 9537, 9572, 9612, 9640, 9741, 9772, 9811, 9812, 9862, 9906, 9960, 9995, 10029, 10063, 10097, 10131, 10176, 10177, 10191, 10280, 10383, 10429, 10477, 10525, 10573, 10621, 10683, 10737, 10788, 10857, 10911, 10992, 11044, 11128, 11171, 11241, 11287, 11334, 11359, 11423, 11463, 11504, 11542, 11586, 11624, 11665, 11690, 11735, 11776, 11827, 11875, 11884, 11942, 11994, 12046, 12099, 12130, 12182, 12220, 12403, 12525, 12567, 12642, 12737, 12795, 12826, 12857, 12870, 12912, 12913, 12980, 13029, 13102, 13115, 13151, 13194, 13267, 13280, 13316, 13359, 13432, 13445, 13481, 13525, 13598, 13611, 13647, 13746, 13831, 13856, 13881, 13938, 13963, 14008, 14053, 14098, 14202, 14235, 14236, 14298, 14299, 14310, 14337, 14413, 14442, 14493, 14547, 14548, 14575, 14637, 14699, 14726, 14727, 14754, 14798, 14844, 14845, 14869, 14894, 14921, 14949, 14982, 15014, 15031, 15047, 15061, 15077, 15170, 15201, 15229, 15260, 15261, 15279, 15300, 15320, 15345, 15391, 15413, 15435, 15465, 15485, 15515, 15544, 15578, 15610, 15642, 15674, 15698, 15720, 15752, 15780, 15809, 15835, 15876, 15913, 15958, 15997, 16032, 16066, 16067, 16110, 16145, 16163, 16180, 16195, 16212, 16213, 16236, 16259, 16326, 16342, 16359, 16397, 16398, 16426, 16453, 16478, 16505, 16541, 16542, 16576, 16639, 16667, 16685, 16727, 16766, 16797, 16840, 16862, 16880, 16931, 16971, 16989, 17010, 17060, 17093, 17146, 17197, 17198, 17256, 17274, 17294, 17319, 17342, 17366, 17390, 17413, 17447, 17501, 17502, 17525, 17543, 17558, 17574, 17592, 17610, 17629, 17640, 17641, 17706, 17761, 17829, 17924, 18028, 18096, 18114, 18129, 18145, 18163, 18181, 18218, 18245, 18272, 18299, 18327, 18413, 18414, 18494, 18536, 18705, 18763, 18764, 18801, 18802, 18834, 18835, 18974, 18975, 19065, 19098, 19132, 19236, 19268, 19285, 19302, 19344, 19386, 19387, 19404, 19427, 19450, 19549, 19657, 19717, 19774, 19832, 19833, 19873, 19915, 19947, 20021, 20022, 20053, 20099, 20222, 20254, 20370, 20391, 20423, 20448, 20472, 20504, 20532, 20544, 20578, 20619, 20633, 20652, 20756, 20776, 20777, 20816, 20875, 20904, 20931, 20966, 20986, 20987, 21050, 21096, 21113, 21114, 21181, 21197, 21236, 21237, 21270, 21271, 21307, 21308, 21428, 21456, 21484, 21512, 21540, 21587, 21626, 21678, 21742, 21806, 21838, 21929, 21970, 22016, 22057, 22093, 22141, 22179, 22230, 22312, 22403, 22481, 22568, 22618, 22640, 22663, 22707, 22731, 22764, 22795, 22834, 22835, 22912, 22944, 22969, 23083, 23185, 23287, 23300, 23314, 23349, 23379, 23400, 23401, 23425, 23458, 23506, 23529, 23553, 23579, 23606, 23621, 23622, 23627, 23628, 23642, 23656, 23670, 23689, 23707, 23725, 23742, 23757, 23774, 23792, 23819, 23820, 23844, 23845, 23865, 24050, 24196, 24197, 24213, 24229, 24253, 24279, 24305, 24324, 24340, 24357, 24378, 24396, 24420, 24439, 24466, 24493, 24509, 24525, 24581, 24615, 24686, 24719, 24740, 24741, 24766, 24886, 24993, 25097, 25130, 25178, 25208, 25287, 25307, 25361, 25408, 25455, 25502, 25549, 25596, 25643, 25690, 25691, 25729, 25753, 25777, 25815, 25853, 25870, 25908, 25932, 25956, 25991, 26026, 26027, 26066, 26067, 26106 ], "line_end_idx": [ 11, 12, 23, 24, 53, 54, 93, 94, 135, 136, 137, 162, 163, 233, 234, 243, 244, 286, 323, 348, 372, 396, 425, 440, 462, 483, 503, 540, 541, 546, 547, 569, 590, 618, 641, 727, 753, 777, 803, 825, 850, 872, 873, 878, 879, 897, 927, 955, 983, 1011, 1039, 1086, 1125, 1177, 1241, 1306, 1338, 1379, 1420, 1466, 1493, 1515, 1545, 1569, 1599, 1625, 1661, 1683, 1706, 1750, 1774, 1807, 1838, 1877, 1895, 1913, 1945, 1946, 1995, 1996, 2053, 2054, 2099, 2100, 2136, 2137, 2142, 2143, 2195, 2215, 2235, 2256, 2276, 2297, 2317, 2337, 2384, 2385, 2410, 2435, 2450, 2465, 2466, 2522, 2523, 2573, 2625, 2626, 2676, 2677, 2728, 2779, 2826, 2827, 2887, 2916, 2917, 3010, 3011, 3104, 3105, 3137, 3138, 3215, 3289, 3368, 3446, 3447, 3479, 3480, 3522, 3571, 3616, 3617, 3666, 3667, 3720, 3772, 3825, 3877, 3878, 3946, 3947, 4037, 4038, 4096, 4097, 4141, 4204, 4252, 4278, 4302, 4367, 4368, 4460, 4573, 4621, 4669, 4722, 4788, 4854, 4931, 5048, 5064, 5096, 5097, 5167, 5168, 5190, 5232, 5286, 5313, 5340, 5370, 5405, 5463, 5505, 5533, 5566, 5602, 5639, 5680, 5721, 5764, 5796, 5838, 5886, 5908, 5930, 5952, 5983, 6005, 6057, 6097, 6119, 6162, 6203, 6225, 6258, 6285, 6307, 6337, 6391, 6392, 6444, 6449, 6485, 6533, 6560, 6587, 6614, 6651, 6709, 6745, 6787, 6807, 6855, 6864, 6910, 6911, 7033, 7034, 7071, 7120, 7147, 7177, 7209, 7229, 7269, 7301, 7331, 7362, 7412, 7449, 7492, 7525, 7560, 7595, 7616, 7637, 7667, 7689, 7711, 7733, 7755, 7777, 7837, 7875, 7897, 7919, 7941, 7990, 7999, 8046, 8047, 8070, 8093, 8121, 8157, 8184, 8210, 8237, 8264, 8291, 8318, 8346, 8371, 8409, 8440, 8468, 8495, 8526, 8551, 8574, 8605, 8640, 8680, 8718, 8757, 8796, 8835, 8875, 8916, 8954, 9005, 9049, 9088, 9129, 9161, 9184, 9224, 9251, 9299, 9354, 9408, 9435, 9486, 9537, 9572, 9612, 9640, 9741, 9772, 9811, 9812, 9862, 9906, 9960, 9995, 10029, 10063, 10097, 10131, 10176, 10177, 10191, 10280, 10383, 10429, 10477, 10525, 10573, 10621, 10683, 10737, 10788, 10857, 10911, 10992, 11044, 11128, 11171, 11241, 11287, 11334, 11359, 11423, 11463, 11504, 11542, 11586, 11624, 11665, 11690, 11735, 11776, 11827, 11875, 11884, 11942, 11994, 12046, 12099, 12130, 12182, 12220, 12403, 12525, 12567, 12642, 12737, 12795, 12826, 12857, 12870, 12912, 12913, 12980, 13029, 13102, 13115, 13151, 13194, 13267, 13280, 13316, 13359, 13432, 13445, 13481, 13525, 13598, 13611, 13647, 13746, 13831, 13856, 13881, 13938, 13963, 14008, 14053, 14098, 14202, 14235, 14236, 14298, 14299, 14310, 14337, 14413, 14442, 14493, 14547, 14548, 14575, 14637, 14699, 14726, 14727, 14754, 14798, 14844, 14845, 14869, 14894, 14921, 14949, 14982, 15014, 15031, 15047, 15061, 15077, 15170, 15201, 15229, 15260, 15261, 15279, 15300, 15320, 15345, 15391, 15413, 15435, 15465, 15485, 15515, 15544, 15578, 15610, 15642, 15674, 15698, 15720, 15752, 15780, 15809, 15835, 15876, 15913, 15958, 15997, 16032, 16066, 16067, 16110, 16145, 16163, 16180, 16195, 16212, 16213, 16236, 16259, 16326, 16342, 16359, 16397, 16398, 16426, 16453, 16478, 16505, 16541, 16542, 16576, 16639, 16667, 16685, 16727, 16766, 16797, 16840, 16862, 16880, 16931, 16971, 16989, 17010, 17060, 17093, 17146, 17197, 17198, 17256, 17274, 17294, 17319, 17342, 17366, 17390, 17413, 17447, 17501, 17502, 17525, 17543, 17558, 17574, 17592, 17610, 17629, 17640, 17641, 17706, 17761, 17829, 17924, 18028, 18096, 18114, 18129, 18145, 18163, 18181, 18218, 18245, 18272, 18299, 18327, 18413, 18414, 18494, 18536, 18705, 18763, 18764, 18801, 18802, 18834, 18835, 18974, 18975, 19065, 19098, 19132, 19236, 19268, 19285, 19302, 19344, 19386, 19387, 19404, 19427, 19450, 19549, 19657, 19717, 19774, 19832, 19833, 19873, 19915, 19947, 20021, 20022, 20053, 20099, 20222, 20254, 20370, 20391, 20423, 20448, 20472, 20504, 20532, 20544, 20578, 20619, 20633, 20652, 20756, 20776, 20777, 20816, 20875, 20904, 20931, 20966, 20986, 20987, 21050, 21096, 21113, 21114, 21181, 21197, 21236, 21237, 21270, 21271, 21307, 21308, 21428, 21456, 21484, 21512, 21540, 21587, 21626, 21678, 21742, 21806, 21838, 21929, 21970, 22016, 22057, 22093, 22141, 22179, 22230, 22312, 22403, 22481, 22568, 22618, 22640, 22663, 22707, 22731, 22764, 22795, 22834, 22835, 22912, 22944, 22969, 23083, 23185, 23287, 23300, 23314, 23349, 23379, 23400, 23401, 23425, 23458, 23506, 23529, 23553, 23579, 23606, 23621, 23622, 23627, 23628, 23642, 23656, 23670, 23689, 23707, 23725, 23742, 23757, 23774, 23792, 23819, 23820, 23844, 23845, 23865, 24050, 24196, 24197, 24213, 24229, 24253, 24279, 24305, 24324, 24340, 24357, 24378, 24396, 24420, 24439, 24466, 24493, 24509, 24525, 24581, 24615, 24686, 24719, 24740, 24741, 24766, 24886, 24993, 25097, 25130, 25178, 25208, 25287, 25307, 25361, 25408, 25455, 25502, 25549, 25596, 25643, 25690, 25691, 25729, 25753, 25777, 25815, 25853, 25870, 25908, 25932, 25956, 25991, 26026, 26027, 26066, 26067, 26106, 26206 ] }

{ "red_pajama_v2": { "ccnet_original_length": 26206, "ccnet_original_nlines": 735, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1108078584074974, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.125, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3742721974849701, "rps_doc_frac_unique_words": 0.27964699268341064, "rps_doc_mean_word_length": 4.509100914001465, "rps_doc_num_sentences": 115, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 6.1000776290893555, "rps_doc_word_count": 3626, "rps_doc_frac_chars_dupe_10grams": 0.02899082936346531, "rps_doc_frac_chars_dupe_5grams": 0.1683180332183838, "rps_doc_frac_chars_dupe_6grams": 0.13828745484352112, "rps_doc_frac_chars_dupe_7grams": 0.09975534677505493, "rps_doc_frac_chars_dupe_8grams": 0.08538226038217545, "rps_doc_frac_chars_dupe_9grams": 0.04128440096974373, "rps_doc_frac_chars_top_2gram": 0.01192661002278328, "rps_doc_frac_chars_top_3gram": 0.012232420034706593, "rps_doc_frac_chars_top_4gram": 0.00727829011157155, "rps_doc_books_importance": -1764.242919921875, "rps_doc_books_importance_length_correction": -1764.242919921875, "rps_doc_openwebtext_importance": -1091.4716796875, "rps_doc_openwebtext_importance_length_correction": -1091.4716796875, "rps_doc_wikipedia_importance": -672.73291015625, "rps_doc_wikipedia_importance_length_correction": -672.73291015625 }, "fasttext": { "dclm": 0.11466473340988159, "english": 0.7535816431045532, "fineweb_edu_approx": 1.3134437799453735, "eai_general_math": 0.057245608419179916, "eai_open_web_math": 0.03217465057969093, "eai_web_code": 0.4697887897491455 } }

{ "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": "794.8", "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": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,183,746,931,049,333,000

FROM CACHE - en_header Blurry header logo in password page of Debut Theme nanaschmitz New Member 2 0 1 Hi there, I am new here and have searched the forum and online regarding this topic, but haven't found the solution, maybe you can help. I am using the Debut theme. On the Password Page https://kimoberlin.com/password the logo doesn't appear as sharp as it actually is. In the header of the theme itself, it does appear crystal sharp though. Is there specific regulations for password page? I have tried uploading 1080 width, a square version, 300px width.... not sure what else to try? Inside the online store theme editor, I am sizing it to 300px width, which is the width I'd like it to show.. sharp 🙂 I hope you can help me! Nana Replies 24 (24) user53 New Member 4 0 0 Hey is there any fix like this for Narrative theme? I've tried the suggestion and it doesn't work. Thanks urbnsage Tourist 10 0 5 Hi @user53 - Sorry to hear it didn't work for your theme. I haven't used Narrative so I cannot say definitively - but another option is trying to use an .svg file instead of a .jpg or .png. Since .svg files are relative to plane they will not pixelate no matter how much you zoom! The way to get this is a little tricky even in debut and it requires some tampering with Section .liquid files so I would suggest making a backup copy of your website before trying this. Again, I know this works for Debut but it may not work for Narrative. Try this support page for uploading an .svg logo if you need any more help let me know! The support page is for a header, but I am sure you can make the same changes in your password-page.liquid. 🙂 urbnsage Tourist 10 0 5 Hi @Cycc and @melissaz! I am so happy this worked for you 🙂 thank you for the likes! if this worked for OP please feel free to accept my solution, i'd appreciate it! user53 New Member 4 0 0 Hey urbnsage - thanks for the response but this doesn't work for Narrative - the lines of code you mention in head.liquid don't exist, unfortunately! the_sampler New Member 1 0 0 Hey there, I've done as you suggested and it did fix the blurry image but my image never gets larger that 500px wide. I can import something taller, but not wider. How do I change the max width or dimensions of the header image frame?

{ "url": "https://community.shopify.com/c/shopify-design/blurry-header-logo-in-password-page-of-debut-theme/m-p/1319936", "source_domain": "community.shopify.com", "snapshot_id": "crawl=CC-MAIN-2022-40", "warc_metadata": { "Content-Length": "342891", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:YCBY2PXTK7ZK73PSNTGBBLCCXWG7LURV", "WARC-Concurrent-To": "<urn:uuid:7e50c793-5cd6-43bc-a23d-b4b5e6d23a43>", "WARC-Date": "2022-09-27T00:03:33Z", "WARC-IP-Address": "18.67.76.72", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:2PMEB3AYRFOV6SPHGTCTO5ZJFUW4SGAD", "WARC-Record-ID": "<urn:uuid:57b225cb-c1f1-4718-96ed-974526472784>", "WARC-Target-URI": "https://community.shopify.com/c/shopify-design/blurry-header-logo-in-password-page-of-debut-theme/m-p/1319936", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:cd9ba21e-b6d1-4ec6-bdc8-998db2e895c8>" }, "warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-251\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 23, 24, 75, 76, 88, 99, 105, 106, 116, 117, 244, 245, 378, 379, 451, 452, 501, 502, 598, 716, 740, 745, 746, 762, 769, 780, 786, 787, 893, 894, 903, 911, 918, 919, 933, 934, 1203, 1204, 1462, 1463, 1661, 1662, 1671, 1679, 1686, 1687, 1773, 1774, 1855, 1856, 1858, 1859, 1861, 1862, 1869, 1880, 1886, 1961, 2036, 2048, 2059, 2065, 2066, 2301, 2302 ], "line_end_idx": [ 23, 24, 75, 76, 88, 99, 105, 106, 116, 117, 244, 245, 378, 379, 451, 452, 501, 502, 598, 716, 740, 745, 746, 762, 769, 780, 786, 787, 893, 894, 903, 911, 918, 919, 933, 934, 1203, 1204, 1462, 1463, 1661, 1662, 1671, 1679, 1686, 1687, 1773, 1774, 1855, 1856, 1858, 1859, 1861, 1862, 1869, 1880, 1886, 1961, 2036, 2048, 2059, 2065, 2066, 2301, 2302, 2303 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2303, "ccnet_original_nlines": 65, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.42105263471603394, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.037037041038274765, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1871345043182373, "rps_doc_frac_unique_words": 0.4811320900917053, "rps_doc_mean_word_length": 4.155660152435303, "rps_doc_num_sentences": 34, "rps_doc_symbol_to_word_ratio": 0.0019493199652060866, "rps_doc_unigram_entropy": 4.948779582977295, "rps_doc_word_count": 424, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.047673098742961884, "rps_doc_frac_chars_dupe_6grams": 0.047673098742961884, "rps_doc_frac_chars_dupe_7grams": 0.023836549371480942, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.008513050153851509, "rps_doc_frac_chars_top_3gram": 0.008513050153851509, "rps_doc_frac_chars_top_4gram": 0.01816117949783802, "rps_doc_books_importance": -252.094970703125, "rps_doc_books_importance_length_correction": -252.094970703125, "rps_doc_openwebtext_importance": -135.9134979248047, "rps_doc_openwebtext_importance_length_correction": -135.9134979248047, "rps_doc_wikipedia_importance": -101.09410095214844, "rps_doc_wikipedia_importance_length_correction": -101.09410095214844 }, "fasttext": { "dclm": 0.07080423831939697, "english": 0.9295931458473206, "fineweb_edu_approx": 1.0144983530044556, "eai_general_math": 0.5261254906654358, "eai_open_web_math": 0.44807881116867065, "eai_web_code": 0.10173416137695312 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "2", "label": "Partially Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,708,390,876,652,383,000

LibreOffice Module sw (master) 1 fldref.cxx Go to the documentation of this file. 1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ 2 /* 3 * This file is part of the LibreOffice project. 4 * 5 * This Source Code Form is subject to the terms of the Mozilla Public 6 * License, v. 2.0. If a copy of the MPL was not distributed with this 7 * file, You can obtain one at http://mozilla.org/MPL/2.0/. 8 * 9 * This file incorporates work covered by the following license notice: 10 * 11 * Licensed to the Apache Software Foundation (ASF) under one or more 12 * contributor license agreements. See the NOTICE file distributed 13 * with this work for additional information regarding copyright 14 * ownership. The ASF licenses this file to you under the Apache 15 * License, Version 2.0 (the "License"); you may not use this file 16 * except in compliance with the License. You may obtain a copy of 17 * the License at http://www.apache.org/licenses/LICENSE-2.0 . 18 */ 19 20 #include <swtypes.hxx> 21 #include <view.hxx> 22 #include <IMark.hxx> 23 #include <expfld.hxx> 24 #include <swmodule.hxx> 25 #include "fldref.hxx" 26 #include <reffld.hxx> 27 #include <wrtsh.hxx> 28 29 #include <fldref.hrc> 30 #include <globals.hrc> 31 #include <strings.hrc> 32 #include <SwNodeNum.hxx> 33 #include <IDocumentMarkAccess.hxx> 34 #include <ndtxt.hxx> 35 #include <unotools/configmgr.hxx> 37 #include <unotools/charclass.hxx> 38 39 #include <comphelper/string.hxx> 40 41 #define REFFLDFLAG 0x4000 42 #define REFFLDFLAG_BOOKMARK 0x4800 43 #define REFFLDFLAG_FOOTNOTE 0x5000 44 #define REFFLDFLAG_ENDNOTE 0x6000 45 // #i83479# 46 #define REFFLDFLAG_HEADING 0x7100 47 #define REFFLDFLAG_NUMITEM 0x7200 48 49 static sal_uInt16 nFieldDlgFormatSel = 0; 50 51 #define USER_DATA_VERSION_1 "1" 52 #define USER_DATA_VERSION USER_DATA_VERSION_1 53 55 : SwFieldPage(pPage, pController, "modules/swriter/ui/fldrefpage.ui", "FieldRefPage", pCoreSet) 56 , maOutlineNodes() 57 , maNumItems() 58 , mpSavedSelectedTextNode(nullptr) 59 , mnSavedSelectedPos(0) 60 , m_xTypeLB(m_xBuilder->weld_tree_view("type")) 61 , m_xSelection(m_xBuilder->weld_widget("selectframe")) 62 , m_xSelectionLB(m_xBuilder->weld_tree_view("select")) 63 , m_xSelectionToolTipLB(m_xBuilder->weld_tree_view("selecttip")) 64 , m_xFormat(m_xBuilder->weld_widget("formatframe")) 65 , m_xFormatLB(m_xBuilder->weld_tree_view("format")) 66 , m_xNameFT(m_xBuilder->weld_label("nameft")) 67 , m_xNameED(m_xBuilder->weld_entry("name")) 68 , m_xValueED(m_xBuilder->weld_entry("value")) 69 , m_xFilterED(m_xBuilder->weld_entry("filter")) 70 { 71 m_xSelectionLB->make_sorted(); 72 // #i83479# 73 for (size_t i = 0; i < SAL_N_ELEMENTS(FLD_REF_PAGE_TYPES); ++i) 74 { 75 m_xTypeLB->append_text(SwResId(FLD_REF_PAGE_TYPES[i])); 76 m_xFormatLB->append_text(SwResId(FLD_REF_PAGE_TYPES[i])); 77 } 78 79 sBookmarkText = m_xTypeLB->get_text(0); 80 sFootnoteText = m_xTypeLB->get_text(1); 81 sEndnoteText = m_xTypeLB->get_text(2); 82 // #i83479# 83 sHeadingText = m_xTypeLB->get_text(3); 84 sNumItemText = m_xTypeLB->get_text(4); 85 86 auto nHeight = m_xTypeLB->get_height_rows(8); 87 auto nWidth = m_xTypeLB->get_approximate_digit_width() * FIELD_COLUMN_WIDTH; 88 m_xTypeLB->set_size_request(nWidth, nHeight); 89 m_xFormatLB->set_size_request(nWidth, nHeight); 90 m_xSelection->set_size_request(nWidth * 2, nHeight); 91 nHeight = m_xTypeLB->get_height_rows(20); 92 m_xSelectionToolTipLB->set_size_request(nHeight, nWidth*2); 93 94 m_xTypeLB->clear(); 95 96 m_xNameED->connect_changed(LINK(this, SwFieldRefPage, ModifyHdl)); 97 m_xFilterED->connect_changed( LINK( this, SwFieldRefPage, ModifyHdl_Impl ) ); 98 99 m_xTypeLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 100 m_xTypeLB->connect_changed(LINK(this, SwFieldRefPage, TypeHdl)); 101 m_xSelectionLB->connect_changed(LINK(this, SwFieldRefPage, SubTypeListBoxHdl)); 102 m_xSelectionLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 103 m_xFormatLB->connect_row_activated(LINK(this, SwFieldRefPage, TreeViewInsertHdl)); 104 105 // #i83479# 106 m_xSelectionToolTipLB->connect_changed( LINK(this, SwFieldRefPage, SubTypeTreeListBoxHdl) ); 107 m_xSelectionToolTipLB->connect_row_activated( LINK(this, SwFieldRefPage, TreeViewInsertHdl) ); 108 m_xFilterED->grab_focus(); 109 } 110 112 { 113 } 114 116 { 117 UpdateSubType(comphelper::string::strip(m_xFilterED->get_text(), ' ')); 118 } 119 120 // #i83479# 122 { 123 mpSavedSelectedTextNode = nullptr; 124 mnSavedSelectedPos = 0; 125 if ( m_xSelectionToolTipLB->get_visible() ) 126 { 127 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 128 if (nEntry != -1) 129 { 130 const sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 131 132 if ( nTypeId == REFFLDFLAG_HEADING ) 133 { 134 mnSavedSelectedPos = m_xSelectionToolTipLB->get_id(nEntry).toUInt32(); 135 if ( mnSavedSelectedPos < maOutlineNodes.size() ) 136 { 138 } 139 } 140 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 141 { 142 mnSavedSelectedPos = m_xSelectionToolTipLB->get_id(nEntry).toUInt32(); 143 if ( mnSavedSelectedPos < maNumItems.size() ) 144 { 146 } 147 } 148 } 149 } 150 } 151 153 { 154 if (!IsFieldEdit()) 155 { 156 SavePos(*m_xTypeLB); 157 // #i83479# 159 } 160 SetSelectionSel(-1); 161 SetTypeSel(-1); 162 Init(); // general initialisation 163 164 // initialise TypeListBox 165 m_xTypeLB->freeze(); 166 m_xTypeLB->clear(); 167 168 // fill Type-Listbox 169 170 // set/insert reference 172 173 for (short i = rRg.nStart; i < rRg.nEnd; ++i) 174 { 175 const SwFieldTypesEnum nTypeId = SwFieldMgr::GetTypeId(i); 176 177 if (!IsFieldEdit() || nTypeId != SwFieldTypesEnum::SetRef) 178 { 179 m_xTypeLB->append(OUString::number(static_cast<sal_uInt16>(nTypeId)), SwFieldMgr::GetTypeStr(i)); 180 } 181 } 182 183 // #i83479# 184 // entries for headings and numbered items 185 m_xTypeLB->append(OUString::number(REFFLDFLAG_HEADING), sHeadingText); 186 m_xTypeLB->append(OUString::number(REFFLDFLAG_NUMITEM), sNumItemText); 187 188 // fill up with the sequence types 189 SwWrtShell *pSh = GetWrtShell(); 190 if (!pSh) 191 pSh = ::GetActiveWrtShell(); 192 193 if (!pSh) 194 return; 195 196 const size_t nFieldTypeCnt = pSh->GetFieldTypeCount(SwFieldIds::SetExp); 197 198 OSL_ENSURE( nFieldTypeCnt < static_cast<size_t>(REFFLDFLAG), "<SwFieldRefPage::Reset> - Item index will overlap flags!" ); 199 200 for (size_t n = 0; n < nFieldTypeCnt; ++n) 201 { 203 204 if ((nsSwGetSetExpType::GSE_SEQ & pType->GetType()) && pType->HasWriterListeners() && pSh->IsUsed(*pType)) 205 { 206 m_xTypeLB->append(OUString::number(REFFLDFLAG | n), pType->GetName()); 207 } 208 } 209 210 // text marks - now always (because of globaldocuments) 211 m_xTypeLB->append(OUString::number(REFFLDFLAG_BOOKMARK), sBookmarkText); 212 213 // footnotes: 214 if( pSh->HasFootnotes() ) 215 { 216 m_xTypeLB->append(OUString::number(REFFLDFLAG_FOOTNOTE), sFootnoteText); 217 } 218 219 // endnotes: 220 if ( pSh->HasFootnotes(true) ) 221 { 222 m_xTypeLB->append(OUString::number(REFFLDFLAG_ENDNOTE), sEndnoteText); 223 } 224 225 m_xTypeLB->thaw(); 226 227 // select old Pos 228 if (!IsFieldEdit()) 230 231 nFieldDlgFormatSel = 0; 232 233 sal_uInt16 nFormatBoxPosition = USHRT_MAX; 234 if( !IsRefresh() ) 235 { 236 sal_Int32 nIdx{ 0 }; 237 const OUString sUserData = GetUserData(); 238 if(!IsRefresh() && sUserData.getToken(0, ';', nIdx). 239 equalsIgnoreAsciiCase(USER_DATA_VERSION_1)) 240 { 241 const sal_uInt16 nVal = static_cast< sal_uInt16 >(sUserData.getToken(0, ';', nIdx).toInt32()); 242 if(nVal != USHRT_MAX) 243 { 244 for(sal_Int32 i = 0, nEntryCount = m_xTypeLB->n_children(); i < nEntryCount; ++i) 245 { 246 if (nVal == m_xTypeLB->get_id(i).toUInt32()) 247 { 248 m_xTypeLB->select(i); 249 break; 250 } 251 } 252 if (nIdx>=0 && nIdx<sUserData.getLength()) 253 { 254 nFormatBoxPosition = static_cast< sal_uInt16 >(sUserData.getToken(0, ';', nIdx).toInt32()); 255 } 256 } 257 } 258 } 259 TypeHdl(*m_xTypeLB); 260 if (nFormatBoxPosition < m_xFormatLB->n_children()) 261 { 262 m_xFormatLB->select(nFormatBoxPosition); 263 } 264 if (IsFieldEdit()) 265 { 266 m_xTypeLB->save_value(); 267 m_xSelectionLB->save_value(); 268 m_xFormatLB->save_value(); 269 m_xNameED->save_value(); 270 m_xValueED->save_value(); 271 m_xFilterED->set_text(OUString()); 272 } 273 } 274 276 { 277 // save old ListBoxPos 278 const sal_Int32 nOld = GetTypeSel(); 279 280 // current ListBoxPos 281 SetTypeSel(m_xTypeLB->get_selected_index()); 282 283 if(GetTypeSel() == -1) 284 { 285 if (IsFieldEdit()) 286 { 287 // select positions 288 OUString sName; 289 sal_uInt16 nFlag = 0; 290 291 switch( GetCurField()->GetSubType() ) 292 { 293 case REF_BOOKMARK: 294 { 295 // #i83479# 296 SwGetRefField* pRefField = dynamic_cast<SwGetRefField*>(GetCurField()); 297 if ( pRefField && 298 pRefField->IsRefToHeadingCrossRefBookmark() ) 299 { 300 sName = sHeadingText; 301 nFlag = REFFLDFLAG_HEADING; 302 } 303 else if ( pRefField && 304 pRefField->IsRefToNumItemCrossRefBookmark() ) 305 { 306 sName = sNumItemText; 307 nFlag = REFFLDFLAG_NUMITEM; 308 } 309 else 310 { 311 sName = sBookmarkText; 312 nFlag = REFFLDFLAG_BOOKMARK; 313 } 314 } 315 break; 316 317 case REF_FOOTNOTE: 318 sName = sFootnoteText; 319 nFlag = REFFLDFLAG_FOOTNOTE; 320 break; 321 322 case REF_ENDNOTE: 323 sName = sEndnoteText; 324 nFlag = REFFLDFLAG_ENDNOTE; 325 break; 326 327 case REF_SETREFATTR: 328 sName = SwResId(STR_GETREFFLD); 329 nFlag = REF_SETREFATTR; 330 break; 331 332 case REF_SEQUENCEFLD: 333 sName = static_cast<SwGetRefField*>(GetCurField())->GetSetRefName(); 334 nFlag = REFFLDFLAG; 335 break; 336 } 337 338 if (m_xTypeLB->find_text(sName) == -1) // reference to deleted mark 339 { 340 m_xTypeLB->append(OUString::number(nFlag), sName); 341 } 342 343 m_xTypeLB->select_text(sName); 344 SetTypeSel(m_xTypeLB->get_selected_index()); 345 } 346 else 347 { 348 SetTypeSel(0); 349 m_xTypeLB->select(0); 350 } 351 } 352 353 if (nOld == GetTypeSel()) 354 return; 355 356 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 357 358 // fill selection-ListBox 359 UpdateSubType(comphelper::string::strip(m_xFilterED->get_text(), ' ')); 360 361 bool bName = false; 362 nFieldDlgFormatSel = 0; 363 364 if ( ( !IsFieldEdit() || m_xSelectionLB->n_children() ) && 365 nOld != -1 ) 366 { 367 m_xNameED->set_text(OUString()); 368 m_xValueED->set_text(OUString()); 369 m_xFilterED->set_text(OUString()); 370 } 371 372 switch (nTypeId) 373 { 374 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 375 if (nOld != -1 && REFFLDFLAG & m_xTypeLB->get_id(nOld).toUInt32()) 376 // the old one stays 377 nFieldDlgFormatSel = m_xFormatLB->get_selected_index(); 378 bName = true; 379 break; 380 381 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 382 bName = true; 383 break; 384 385 case REFFLDFLAG_BOOKMARK: 386 bName = true; 387 [[fallthrough]]; 388 default: 389 if( REFFLDFLAG & nTypeId ) 390 { 391 const sal_uInt16 nOldId = nOld != -1 ? m_xTypeLB->get_id(nOld).toUInt32() : 0; 392 if( nOldId & REFFLDFLAG || nOldId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef) ) 393 // then the old one stays 394 nFieldDlgFormatSel = m_xFormatLB->get_selected_index(); 395 } 396 break; 397 } 398 399 m_xNameED->set_sensitive(bName); 400 m_xNameFT->set_sensitive(bName); 401 402 // fill Format-Listbox 403 sal_Int32 nSize = FillFormatLB(nTypeId); 404 bool bFormat = nSize != 0; 405 m_xFormat->set_sensitive(bFormat); 406 407 SubTypeHdl(); 408 ModifyHdl(*m_xNameED); 409 ModifyHdl(*m_xFilterED); 410 } 411 412 IMPL_LINK_NOARG(SwFieldRefPage, SubTypeTreeListBoxHdl, weld::TreeView&, void) 413 { 414 SubTypeHdl(); 415 } 416 417 IMPL_LINK_NOARG(SwFieldRefPage, SubTypeListBoxHdl, weld::TreeView&, void) 418 { 419 SubTypeHdl(); 420 } 421 423 { 424 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 425 426 switch(nTypeId) 427 { 428 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 429 if (!IsFieldEdit() || m_xSelectionLB->get_selected_index() != -1) 430 { 431 m_xNameED->set_text(m_xSelectionLB->get_selected_text()); 432 ModifyHdl(*m_xNameED); 433 } 434 break; 435 436 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 437 { 438 SwWrtShell *pSh = GetWrtShell(); 439 if(!pSh) 440 pSh = ::GetActiveWrtShell(); 441 if(pSh) 442 { 443 m_xValueED->set_text(pSh->GetSelText()); 444 } 445 446 } 447 break; 448 // #i83479# 449 case REFFLDFLAG_HEADING: 450 case REFFLDFLAG_NUMITEM: 451 { 452 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 453 if (nEntry != -1) 454 m_xNameED->set_text(m_xSelectionToolTipLB->get_text(nEntry)); 455 } 456 break; 457 458 default: 459 if (!IsFieldEdit() || m_xSelectionLB->get_selected_index() != -1) 460 m_xNameED->set_text(m_xSelectionLB->get_selected_text()); 461 break; 462 } 463 } 464 465 // renew types in SelectionLB after filtering 466 void SwFieldRefPage::UpdateSubType(const OUString& filterString) 467 { 468 SwWrtShell *pSh = GetWrtShell(); 469 if(!pSh) 470 pSh = ::GetActiveWrtShell(); 471 SwGetRefField* pRefField = static_cast<SwGetRefField*>(GetCurField()); 472 const sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 473 474 OUString sOldSel; 475 // #i83479# 476 if ( m_xSelectionLB->get_visible() ) 477 { 478 const sal_Int32 nSelectionSel = m_xSelectionLB->get_selected_index(); 479 if (nSelectionSel != -1) 480 sOldSel = m_xSelectionLB->get_text(nSelectionSel); 481 } 482 if (IsFieldEdit() && sOldSel.isEmpty()) 483 sOldSel = OUString::number( pRefField->GetSeqNo() + 1 ); 484 485 m_xSelectionLB->freeze(); 486 m_xSelectionLB->clear(); 487 488 if (REFFLDFLAG & nTypeId) 489 { 490 if (nTypeId == REFFLDFLAG_FOOTNOTE || nTypeId == REFFLDFLAG_ENDNOTE) 491 { 492 m_xSelectionLB->thaw(); 493 m_xSelectionLB->make_unsorted(); 494 m_xSelectionLB->freeze(); 495 } 496 // #i83479# 497 else if (nTypeId != REFFLDFLAG_HEADING && nTypeId != REFFLDFLAG_NUMITEM) 498 { 499 m_xSelectionLB->thaw(); 500 m_xSelectionLB->make_sorted(); 501 m_xSelectionLB->freeze(); 502 } 503 } 504 505 // #i83479# 506 m_xSelectionToolTipLB->freeze(); 507 m_xSelectionToolTipLB->clear(); 508 OUString m_sSelectionToolTipLBId; 509 bool bShowSelectionToolTipLB( false ); 510 511 if( REFFLDFLAG & nTypeId ) 512 { 513 if (nTypeId == REFFLDFLAG_BOOKMARK) // text marks! 514 { 515 // get all text marks 516 IDocumentMarkAccess* const pMarkAccess = pSh->getIDocumentMarkAccess(); 517 for(IDocumentMarkAccess::const_iterator_t ppMark = pMarkAccess->getBookmarksBegin(); 518 ppMark != pMarkAccess->getBookmarksEnd(); 519 ++ppMark) 520 { 521 const ::sw::mark::IMark* pBkmk = *ppMark; 523 { 524 bool isSubstring = MatchSubstring(pBkmk->GetName(), filterString); 525 if(isSubstring) 526 { 527 m_xSelectionLB->append_text( pBkmk->GetName() ); 528 } 529 } 530 } 531 if (IsFieldEdit()) 532 sOldSel = pRefField->GetSetRefName(); 533 } 534 else if (nTypeId == REFFLDFLAG_FOOTNOTE) 535 { 537 const size_t nCnt = pSh->GetSeqFootnoteList( aArr ); 538 539 for( size_t n = 0; n < nCnt; ++n ) 540 { 541 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 542 if(isSubstring) 543 { 544 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 545 } 546 if (IsFieldEdit() && pRefField->GetSeqNo() == aArr[ n ].nSeqNo) 547 sOldSel = aArr[n].sDlgEntry; 548 } 549 } 550 else if (nTypeId == REFFLDFLAG_ENDNOTE) 551 { 553 const size_t nCnt = pSh->GetSeqFootnoteList( aArr, true ); 554 555 for( size_t n = 0; n < nCnt; ++n ) 556 { 557 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 558 if(isSubstring) 559 { 560 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 561 } 562 if (IsFieldEdit() && pRefField->GetSeqNo() == aArr[ n ].nSeqNo) 563 sOldSel = aArr[n].sDlgEntry; 564 } 565 } 566 // #i83479# 567 else if ( nTypeId == REFFLDFLAG_HEADING ) 568 { 569 bShowSelectionToolTipLB = true; 570 573 bool bCertainTextNodeSelected( false ); 574 for ( size_t nOutlIdx = 0; nOutlIdx < maOutlineNodes.size(); ++nOutlIdx ) 575 { 576 if (!pIDoc->isOutlineInLayout(nOutlIdx, *pSh->GetLayout())) 577 { 578 continue; // skip it 579 } 580 bool isSubstring = MatchSubstring(pIDoc->getOutlineText(nOutlIdx, pSh->GetLayout(), true, true, false), filterString); 581 if(isSubstring) 582 { 583 OUString sId(OUString::number(nOutlIdx)); 584 m_xSelectionToolTipLB->append(sId, 585 pIDoc->getOutlineText(nOutlIdx, pSh->GetLayout(), true, true, false)); 586 if ( ( IsFieldEdit() && 587 pRefField->GetReferencedTextNode() == maOutlineNodes[nOutlIdx] ) || 589 { 590 m_sSelectionToolTipLBId = sId; 591 sOldSel.clear(); 592 bCertainTextNodeSelected = true; 593 } 594 else if ( !bCertainTextNodeSelected && mnSavedSelectedPos == nOutlIdx ) 595 { 596 m_sSelectionToolTipLBId = sId; 597 sOldSel.clear(); 598 } 599 } 600 } 601 } 602 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 603 { 604 bShowSelectionToolTipLB = true; 605 606 const IDocumentListItems* pIDoc( pSh->getIDocumentListItemsAccess() ); 607 pIDoc->getNumItems( maNumItems ); 608 bool bCertainTextNodeSelected( false ); 609 for ( size_t nNumItemIdx = 0; nNumItemIdx < maNumItems.size(); ++nNumItemIdx ) 610 { 611 if (!pIDoc->isNumberedInLayout(*maNumItems[nNumItemIdx], *pSh->GetLayout())) 612 { 613 continue; // skip it 614 } 615 bool isSubstring = MatchSubstring(pIDoc->getListItemText(*maNumItems[nNumItemIdx], *pSh->GetLayout()), filterString); 616 if(isSubstring) 617 { 618 OUString sId(OUString::number(nNumItemIdx)); 619 m_xSelectionToolTipLB->append(sId, 620 pIDoc->getListItemText(*maNumItems[nNumItemIdx], *pSh->GetLayout())); 621 if ( ( IsFieldEdit() && 622 pRefField->GetReferencedTextNode() == maNumItems[nNumItemIdx]->GetTextNode() ) || 623 mpSavedSelectedTextNode == maNumItems[nNumItemIdx]->GetTextNode() ) 624 { 625 m_sSelectionToolTipLBId = sId; 626 sOldSel.clear(); 627 bCertainTextNodeSelected = true; 628 } 629 else if ( !bCertainTextNodeSelected && mnSavedSelectedPos == nNumItemIdx ) 630 { 631 m_sSelectionToolTipLBId = sId; 632 sOldSel.clear(); 633 } 634 } 635 } 636 } 637 else 638 { 639 // get the fields to Seq-FieldType: 640 641 SwSetExpFieldType* pType = static_cast<SwSetExpFieldType*>(pSh->GetFieldType( 642 nTypeId & ~REFFLDFLAG, SwFieldIds::SetExp )); 643 if( pType ) 644 { 646 // old selection should be kept in non-edit mode 647 if(IsFieldEdit()) 648 sOldSel.clear(); 649 650 const size_t nCnt = pType->GetSeqFieldList(aArr, pSh->GetLayout()); 651 for( size_t n = 0; n < nCnt; ++n ) 652 { 653 bool isSubstring = MatchSubstring(aArr[ n ].sDlgEntry, filterString); 654 if(isSubstring) 655 { 656 m_xSelectionLB->append_text( aArr[ n ].sDlgEntry ); 657 } 658 if (IsFieldEdit() && sOldSel.isEmpty() && 659 aArr[ n ].nSeqNo == pRefField->GetSeqNo()) 660 sOldSel = aArr[ n ].sDlgEntry; 661 } 662 663 if (IsFieldEdit() && sOldSel.isEmpty()) 664 sOldSel = OUString::number( pRefField->GetSeqNo() + 1); 665 } 666 } 667 } 668 else 669 { 670 std::vector<OUString> aLst; 671 GetFieldMgr().GetSubTypes(static_cast<SwFieldTypesEnum>(nTypeId), aLst); 672 for(const OUString & i : aLst) 673 { 674 bool isSubstring = MatchSubstring( i , filterString ); 675 if(isSubstring) 676 { 677 m_xSelectionLB->append_text(i); 678 } 679 } 680 681 if (IsFieldEdit()) 682 sOldSel = pRefField->GetSetRefName(); 683 } 684 685 // #i83479# 686 m_xSelectionLB->thaw(); 687 m_xSelectionToolTipLB->thaw(); 688 if (!m_sSelectionToolTipLBId.isEmpty()) 689 m_xSelectionToolTipLB->select_id(m_sSelectionToolTipLBId); 690 m_xSelectionToolTipLB->set_visible( bShowSelectionToolTipLB ); 691 m_xSelectionLB->set_visible( !bShowSelectionToolTipLB ); 692 if ( bShowSelectionToolTipLB ) 693 { 694 bool bEnable = m_xSelectionToolTipLB->n_children() != 0; 695 m_xSelection->set_sensitive( bEnable ); 696 697 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 698 if (nEntry != -1) 699 m_xSelectionToolTipLB->scroll_to_row(nEntry); 700 701 if (IsFieldEdit() && nEntry == -1) 702 { 703 m_xNameED->set_text(sOldSel); 704 } 705 } 706 else 707 { 708 // enable or disable 709 bool bEnable = m_xSelectionLB->n_children() != 0; 710 m_xSelection->set_sensitive( bEnable ); 711 712 if ( bEnable ) 713 { 714 m_xSelectionLB->select_text(sOldSel); 715 if (m_xSelectionLB->get_selected_index() == -1 && !IsFieldEdit()) 716 m_xSelectionLB->select(0); 717 } 718 719 if (IsFieldEdit() && m_xSelectionLB->get_selected_index() == -1) // in case the reference was already deleted... 720 m_xNameED->set_text(sOldSel); 721 } 722 } 723 724 bool SwFieldRefPage::MatchSubstring( const OUString& rListString, const OUString& rSubstr ) 725 { 726 if(rSubstr.isEmpty()) 727 return true; 728 OUString aListString = GetAppCharClass().lowercase(rListString); 729 OUString aSubstr = GetAppCharClass().lowercase(rSubstr); 730 return aListString.indexOf(aSubstr) >= 0; 731 } 732 733 namespace { 734 736 { 737 FMT_REF_PAGE_IDX = 0, 738 FMT_REF_CHAPTER_IDX = 1, 739 FMT_REF_TEXT_IDX = 2, 740 FMT_REF_UPDOWN_IDX = 3, 741 FMT_REF_PAGE_PGDSC_IDX = 4, 742 FMT_REF_ONLYNUMBER_IDX = 5, 743 FMT_REF_ONLYCAPTION_IDX = 6, 744 FMT_REF_ONLYSEQNO_IDX = 7, 745 FMT_REF_NUMBER_IDX = 8, 746 FMT_REF_NUMBER_NO_CONTEXT_IDX = 9, 747 FMT_REF_NUMBER_FULL_CONTEXT_IDX = 10 748 }; 749 750 } 751 752 static const char* FMT_REF_ARY[] = 753 { 754 FMT_REF_PAGE, 755 FMT_REF_CHAPTER, 756 FMT_REF_TEXT, 757 FMT_REF_UPDOWN, 758 FMT_REF_PAGE_PGDSC, 759 FMT_REF_ONLYNUMBER, 760 FMT_REF_ONLYCAPTION, 761 FMT_REF_ONLYSEQNO, 762 FMT_REF_NUMBER, 763 FMT_REF_NUMBER_NO_CONTEXT, 764 FMT_REF_NUMBER_FULL_CONTEXT 765 }; 766 767 sal_Int32 SwFieldRefPage::FillFormatLB(sal_uInt16 nTypeId) 768 { 769 OUString sOldSel; 770 771 sal_Int32 nFormatSel = m_xFormatLB->get_selected_index(); 772 if (nFormatSel != -1) 773 sOldSel = m_xFormatLB->get_text(nFormatSel); 774 775 // fill Format-Listbox 776 m_xFormatLB->clear(); 777 778 // reference has less that the annotation 779 sal_uInt16 nSize( 0 ); 780 bool bAddCrossRefFormats( false ); 781 switch (nTypeId) 782 { 783 // #i83479# 784 case REFFLDFLAG_HEADING: 785 case REFFLDFLAG_NUMITEM: 786 bAddCrossRefFormats = true; 787 [[fallthrough]]; 788 789 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 790 case REFFLDFLAG_BOOKMARK: 791 case REFFLDFLAG_FOOTNOTE: 792 case REFFLDFLAG_ENDNOTE: 793 nSize = FMT_REF_PAGE_PGDSC_IDX + 1; 794 break; 795 796 default: 797 // #i83479# 798 799 if ( REFFLDFLAG & nTypeId ) 800 { 801 nSize = FMT_REF_ONLYSEQNO_IDX + 1; 802 } 803 else 804 { 805 nSize = GetFieldMgr().GetFormatCount( static_cast<SwFieldTypesEnum>(nTypeId), IsFieldDlgHtmlMode() ); 806 } 807 break; 808 } 809 810 if (REFFLDFLAG & nTypeId) 811 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 812 813 SwFieldTypesEnum nFieldType = static_cast<SwFieldTypesEnum>(nTypeId); 814 for (sal_uInt16 i = 0; i < nSize; i++) 815 { 816 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i ))); 817 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr(nFieldType, i)); 818 } 819 // #i83479# 820 821 sal_uInt16 nExtraSize( 0 ); 822 if ( bAddCrossRefFormats ) 823 { 824 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX; 825 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 826 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 827 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX; 828 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 829 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 830 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX; 831 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 832 m_xFormatLB->append(sId, GetFieldMgr().GetFormatStr( nFieldType, nFormat )); 833 nExtraSize = 3; 834 } 835 836 // extra list items optionally, depending from reference-language 837 SvtSysLocaleOptions aSysLocaleOptions; 838 static const LanguageTag& rLang = aSysLocaleOptions.GetRealLanguageTag(); 839 840 if (rLang.getLanguage() == "hu") 841 { 842 for (sal_uInt16 i = 0; i < nSize; i++) 843 { 844 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i + SAL_N_ELEMENTS(FMT_REF_ARY)))); 845 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, i )); 846 } 847 nExtraSize += nSize; 848 849 if ( bAddCrossRefFormats ) 850 { 851 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 852 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 853 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 854 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 855 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 856 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 857 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX + SAL_N_ELEMENTS(FMT_REF_ARY); 858 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 859 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_LOWERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 860 nExtraSize += 3; 861 } 862 // uppercase article 863 for (sal_uInt16 i = 0; i < nSize; i++) 864 { 865 OUString sId(OUString::number(GetFieldMgr().GetFormatId( nFieldType, i + 2 * SAL_N_ELEMENTS(FMT_REF_ARY)))); 866 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, i )); 867 } 868 nExtraSize += nSize; 869 if ( bAddCrossRefFormats ) 870 { 871 sal_uInt16 nFormat = FMT_REF_NUMBER_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 872 OUString sId(OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat))); 873 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 874 nFormat = FMT_REF_NUMBER_NO_CONTEXT_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 875 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 876 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 877 nFormat = FMT_REF_NUMBER_FULL_CONTEXT_IDX + 2 * SAL_N_ELEMENTS(FMT_REF_ARY); 878 sId = OUString::number(GetFieldMgr().GetFormatId(nFieldType, nFormat)); 879 m_xFormatLB->append(sId, SwResId(FMT_REF_WITH_UPPERCASE_HU_ARTICLE) + GetFieldMgr().GetFormatStr( nFieldType, nFormat % SAL_N_ELEMENTS(FMT_REF_ARY))); 880 nExtraSize += 3; 881 } 882 } 883 884 nSize += nExtraSize; 885 886 // select a certain entry 887 if (nSize) 888 { 889 if (!IsFieldEdit()) 890 m_xFormatLB->select_text(sOldSel); 891 else 892 m_xFormatLB->select_text(SwResId(FMT_REF_ARY[GetCurField()->GetFormat() % SAL_N_ELEMENTS(FMT_REF_ARY)])); 893 894 if (m_xFormatLB->get_selected_index() == -1) 895 { 896 if (nFieldDlgFormatSel < m_xFormatLB->n_children()) 898 else 899 m_xFormatLB->select(0); 900 } 901 } 902 903 return nSize; 904 } 905 906 // Modify 908 { 909 OUString aName(m_xNameED->get_text()); 910 const bool bEmptyName = aName.isEmpty(); 911 912 bool bEnable = true; 913 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 914 915 if ((nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef) && !GetFieldMgr().CanInsertRefMark(aName)) || 916 (bEmptyName && (nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef) || nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef) || 917 nTypeId == REFFLDFLAG_BOOKMARK))) 918 bEnable = false; 919 920 EnableInsert(bEnable); 921 922 m_xSelectionLB->select_text(aName); 923 } 924 926 { 927 bool bModified = false; 928 sal_uInt16 nTypeId = m_xTypeLB->get_id(GetTypeSel()).toUInt32(); 929 930 sal_uInt16 nSubType = 0; 931 const sal_Int32 nEntryPos = m_xFormatLB->get_selected_index(); 932 const sal_uLong nFormat = (nEntryPos == -1) 933 ? 0 : m_xFormatLB->get_id(nEntryPos).toUInt32(); 934 935 OUString aVal(m_xValueED->get_text()); 936 OUString aName(m_xNameED->get_text()); 937 938 switch(nTypeId) 939 { 940 case static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef): 941 nSubType = REF_SETREFATTR; 942 break; 943 944 case static_cast<sal_uInt16>(SwFieldTypesEnum::SetRef): 945 { 947 948 if(!pType) // Only insert when the name doesn't exist yet 949 { 950 m_xSelectionLB->append_text(aName); 951 m_xSelection->set_sensitive(true); 952 } 953 break; 954 } 955 } 956 957 SwGetRefField* pRefField = static_cast<SwGetRefField*>(GetCurField()); 958 959 if (REFFLDFLAG & nTypeId) 960 { 961 SwWrtShell *pSh = GetWrtShell(); 962 if(!pSh) 963 { 964 pSh = ::GetActiveWrtShell(); 965 } 966 if (nTypeId == REFFLDFLAG_BOOKMARK) // text marks! 967 { 968 aName = m_xNameED->get_text(); 969 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 970 nSubType = REF_BOOKMARK; 971 } 972 else if (REFFLDFLAG_FOOTNOTE == nTypeId) // footnotes 973 { 975 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 976 977 size_t nPos = 0; 978 979 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 980 nSubType = REF_FOOTNOTE; 981 aName.clear(); 982 983 if (pSh->GetSeqFootnoteList(aArr) && aArr.SeekEntry(aElem, &nPos)) 984 { 985 aVal = OUString::number( aArr[nPos].nSeqNo ); 986 987 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 988 bModified = true; // can happen with fields of which the references were deleted 989 } 990 else if (IsFieldEdit()) 991 aVal = OUString::number( pRefField->GetSeqNo() ); 992 } 993 else if (REFFLDFLAG_ENDNOTE == nTypeId) // endnotes 994 { 996 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 997 998 size_t nPos = 0; 999 1000 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1001 nSubType = REF_ENDNOTE; 1002 aName.clear(); 1003 1004 if (pSh->GetSeqFootnoteList(aArr, true) && aArr.SeekEntry(aElem, &nPos)) 1005 { 1006 aVal = OUString::number( aArr[nPos].nSeqNo ); 1007 1008 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 1009 bModified = true; // can happen with fields of which the reference was deleted 1010 } 1011 else if (IsFieldEdit()) 1012 aVal = OUString::number( pRefField->GetSeqNo() ); 1013 } 1014 // #i83479# 1015 else if ( nTypeId == REFFLDFLAG_HEADING ) 1016 { 1017 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 1018 OSL_ENSURE( nEntry != -1, 1019 "<SwFieldRefPage::FillItemSet(..)> - no entry selected in selection tool tip listbox!" ); 1020 if (nEntry != -1) 1021 { 1022 const size_t nOutlIdx(m_xSelectionToolTipLB->get_id(nEntry).toUInt32()); 1024 if ( nOutlIdx < maOutlineNodes.size() ) 1025 { 1026 ::sw::mark::IMark const * const pMark = pSh->getIDocumentMarkAccess()->getMarkForTextNode( 1027 *(maOutlineNodes[nOutlIdx]), 1029 aName = pMark->GetName(); 1030 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1031 nSubType = REF_BOOKMARK; 1032 } 1033 } 1034 } 1035 else if ( nTypeId == REFFLDFLAG_NUMITEM ) 1036 { 1037 int nEntry = m_xSelectionToolTipLB->get_selected_index(); 1038 OSL_ENSURE( nEntry != -1, 1039 "<SwFieldRefPage::FillItemSet(..)> - no entry selected in selection tool tip listbox!" ); 1040 if (nEntry != -1) 1041 { 1042 const size_t nNumItemIdx(m_xSelectionToolTipLB->get_id(nEntry).toUInt32()); 1044 if ( nNumItemIdx < maNumItems.size() ) 1045 { 1046 ::sw::mark::IMark const * const pMark = pSh->getIDocumentMarkAccess()->getMarkForTextNode( 1047 *(maNumItems[nNumItemIdx]->GetTextNode()), 1049 aName = pMark->GetName(); 1050 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1051 nSubType = REF_BOOKMARK; 1052 } 1053 } 1054 } 1055 else // SequenceFields 1056 { 1057 // get fields for Seq-FieldType: 1058 SwSetExpFieldType* pType = static_cast<SwSetExpFieldType*>(pSh->GetFieldType( 1059 nTypeId & ~REFFLDFLAG, SwFieldIds::SetExp )); 1060 if( pType ) 1061 { 1063 SeqFieldLstElem aElem( m_xSelectionLB->get_selected_text(), 0 ); 1064 1065 size_t nPos = 0; 1066 1067 nTypeId = static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef); 1068 nSubType = REF_SEQUENCEFLD; 1069 aName = pType->GetName(); 1070 1071 if (pType->GetSeqFieldList(aArr, pSh->GetLayout()) 1072 && aArr.SeekEntry(aElem, &nPos)) 1073 { 1074 aVal = OUString::number( aArr[nPos].nSeqNo ); 1075 1076 if (IsFieldEdit() && aArr[nPos].nSeqNo == pRefField->GetSeqNo()) 1077 bModified = true; // can happen with fields of which the reference was deleted 1078 } 1079 else if (IsFieldEdit()) 1080 aVal = OUString::number( pRefField->GetSeqNo() ); 1081 } 1082 } 1083 } 1084 1085 if (IsFieldEdit() && nTypeId == static_cast<sal_uInt16>(SwFieldTypesEnum::GetRef)) 1086 { 1087 aVal = OUString::number(nSubType) + "|" + aVal; 1088 } 1089 1090 if (!IsFieldEdit() || bModified || 1091 m_xNameED->get_value_changed_from_saved() || 1092 m_xValueED->get_value_changed_from_saved() || 1093 m_xTypeLB->get_value_changed_from_saved() || 1094 m_xSelectionLB->get_value_changed_from_saved() || 1095 m_xFormatLB->get_value_changed_from_saved()) 1096 { 1097 InsertField( static_cast<SwFieldTypesEnum>(nTypeId), nSubType, aName, aVal, nFormat ); 1098 } 1099 1100 ModifyHdl(*m_xNameED); // enable/disable insert if applicable 1101 1102 return false; 1103 } 1104 1105 std::unique_ptr<SfxTabPage> SwFieldRefPage::Create( weld::Container* pPage, weld::DialogController* pController, 1106 const SfxItemSet *const pAttrSet) 1107 { 1108 return std::make_unique<SwFieldRefPage>(pPage, pController, pAttrSet); 1109 } 1110 1112 { 1113 return GRP_REF; 1114 } 1115 1117 { 1118 const sal_Int32 nEntryPos = m_xTypeLB->get_selected_index(); 1119 const sal_uInt16 nTypeSel = ( -1 == nEntryPos ) 1120 ? USHRT_MAX 1121 : m_xTypeLB->get_id(nEntryPos).toUInt32(); 1122 const sal_Int32 nFormatEntryPos = m_xFormatLB->get_selected_index(); 1123 const sal_uInt32 nFormatSel = -1 == nFormatEntryPos ? USHRT_MAX : nFormatEntryPos; 1125 OUString::number( nTypeSel ) + ";" + 1126 OUString::number( nFormatSel )); 1127 } 1128 1129 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ SwFieldType * GetFieldType(size_t nField, SwFieldIds nResId=SwFieldIds::Unknown) const get field types with a ResId, if 0 get all Definition: edfld.cxx:64 SwFieldType * GetFieldType(SwFieldIds nResId, size_t nField=0) const Definition: fldmgr.cxx:409 Instances of SwFields and those derived from it occur 0 to n times. Definition: fldbas.hxx:234 virtual void getNumItems(IDocumentListItems::tSortedNodeNumList &orNodeNumList) const =0 get vector of all list items, which are numbered sal_uInt16 const nStart Definition: fldmgr.hxx:63 IMPL_LINK_NOARG(SwFieldRefPage, ModifyHdl_Impl, weld::Entry &, void) Definition: fldref.cxx:115 IDocumentListItems::tSortedNodeNumList maNumItems Definition: fldref.hxx:39 virtual const OUString & GetName() const =0 OUString sNumItemText Definition: fldref.hxx:36 void RestorePos(weld::TreeView &rLst1) Definition: fldpage.cxx:294 virtual sal_uInt16 GetGroup() override Definition: fldref.cxx:1111 std::unique_ptr< weld::Entry > m_xValueED Definition: fldref.hxx:56 void SetUserData(const OUString &rString) #define REFFLDFLAG_ENDNOTE Definition: fldref.cxx:44 #define USER_DATA_VERSION Definition: fldref.cxx:52 const IDocumentOutlineNodes * getIDocumentOutlineNodesAccess() const Definition: viewsh.cxx:2605 wrapper iterator: wraps iterator of implementation while hiding MarkBase class; only IMark instances ... sal_uIntPtr sal_uLong Provides numbered items of a document. static SW_DLLPUBLIC MarkType GetType(const ::sw::mark::IMark &rMark) Returns the MarkType used to create the mark. Definition: docbm.cxx:474 IDocumentOutlineNodes::tSortedOutlineNodeList maOutlineNodes Definition: fldref.hxx:38 sal_Int64 n SwWrtShell * GetActiveWrtShell() Definition: swmodul1.cxx:107 Provides access to the marks of a document. void SubTypeHdl() Definition: fldref.cxx:422 void SaveSelectedTextNode() Definition: fldref.cxx:121 std::unique_ptr< weld::Entry > m_xFilterED Definition: fldref.hxx:57 bool HasWriterListeners() const Definition: calbck.hxx:208 #define REFFLDFLAG Definition: fldref.cxx:41 Used by the UI to modify the document model. Definition: wrtsh.hxx:90 virtual ~SwFieldRefPage() override Definition: fldref.cxx:111 static sal_uInt16 nFieldDlgFormatSel Definition: fldref.cxx:49 SwFieldMgr & GetFieldMgr() Definition: fldpage.hxx:81 std::unique_ptr< weld::Widget > m_xSelection Definition: fldref.hxx:48 static SwFieldTypesEnum GetTypeId(sal_uInt16 nPos) Definition: fldmgr.cxx:520 OUString getLanguage() const virtual void getOutlineNodes(IDocumentOutlineNodes::tSortedOutlineNodeList &orOutlineNodeList) const =0 bool SeekEntry(const SeqFieldLstElem &rNew, size_t *pPos) const Definition: expfld.cxx:752 const SwTextNode * mpSavedSelectedTextNode Definition: fldref.hxx:43 virtual bool FillItemSet(SfxItemSet *rSet) override Definition: fldref.cxx:925 void SetSelectionSel(sal_Int32 nSet) Definition: fldpage.hxx:48 const OUString & GetUserData() const sal_uInt16 GetFormatCount(SwFieldTypesEnum nTypeId, bool bHtmlMode) const Definition: fldmgr.cxx:670 #define REFFLDFLAG_NUMITEM Definition: fldref.cxx:47 bool IsFieldDlgHtmlMode() const Definition: fldpage.hxx:49 const IDocumentMarkAccess * getIDocumentMarkAccess() const Provides access to the document bookmark interface. Definition: viewsh.cxx:2582 const char * sName #define SAL_N_ELEMENTS(arr) std::unique_ptr< weld::TreeView > m_xSelectionToolTipLB Definition: fldref.hxx:51 virtual const_iterator_t getBookmarksEnd() const =0 returns a STL-like random access iterator to the end of the sequence of IBookmarks. bool IsRefToNumItemCrossRefBookmark() const Definition: reffld.cxx:385 #define REFFLDFLAG_BOOKMARK Definition: fldref.cxx:42 void SavePos(const weld::TreeView &rLst1) Definition: fldpage.cxx:284 static bool MatchSubstring(const OUString &list_string, const OUString &substr) Definition: fldref.cxx:724 int i SwFieldTypesEnum List of FieldTypes at UI. Definition: fldbas.hxx:87 void Init() Definition: fldpage.cxx:65 const SvxPageUsage aArr[] size_t GetFieldTypeCount(SwFieldIds nResId=SwFieldIds::Unknown) const count field types with a ResId, if SwFieldIds::Unknown count all Definition: edfld.cxx:43 bool IsRefresh() const Definition: fldpage.hxx:50 bool IsUsed(const SwModify &) const Query if the paragraph-/character-/frame-/page-style is used. Definition: edfmt.cxx:139 void InsertField(SwFieldTypesEnum nTypeId, sal_uInt16 nSubType, const OUString &rPar1, const OUString &rPar2, sal_uInt32 nFormatId, sal_Unicode cDelim= ' ', bool bIsAutomaticLanguage=true) Definition: fldpage.cxx:117 sal_Int32 GetTypeSel() const Definition: fldpage.hxx:45 virtual void Reset(const SfxItemSet *rSet) override Definition: fldref.cxx:152 size_t GetSeqFootnoteList(SwSeqFieldList &rList, bool bEndNotes=false) Give a List of all footnotes and their beginning texts. Definition: edattr.cxx:454 SwField * GetCurField() Definition: fldpage.hxx:51 OUString SwResId(const char *pId) Definition: swmodule.cxx:178 OUString lowercase(const OUString &rStr, sal_Int32 nPos, sal_Int32 nCount) const void UpdateSubType(const OUString &filterString) Definition: fldref.cxx:466 OUString sFootnoteText Definition: fldref.hxx:32 #define FIELD_COLUMN_WIDTH Definition: fldpage.hxx:25 sal_uInt16 const nEnd Definition: fldmgr.hxx:64 virtual OUString GetName() const override Only in derived classes. Definition: expfld.cxx:527 FMT_REF_IDX Definition: fldref.cxx:735 OUString sBookmarkText Definition: fldref.hxx:31 const LanguageTag & GetRealLanguageTag() const OUString sHeadingText Definition: fldref.hxx:35 SwWrtShell * GetWrtShell() Definition: fldpage.hxx:52 const SwGetSetExpType GSE_SEQ Sequence. Definition: fldbas.hxx:198 sal_uInt16 GetSeqNo() const Get/set SequenceNo (of interest only for REF_SEQUENCEFLD). Definition: reffld.hxx:132 virtual ::sw::mark::IMark * getMarkForTextNode(const SwTextNode &rTextNode, MarkType eMark)=0 Returns a mark in the document for a paragraph. bool IsRefToHeadingCrossRefBookmark() const Definition: reffld.cxx:379 const IDocumentListItems * getIDocumentListItemsAccess() const Definition: viewsh.cxx:2600 bool HasFootnotes(bool bEndNotes=false) const Definition: edattr.cxx:441 std::unique_ptr< weld::TreeView > m_xFormatLB Definition: fldref.hxx:53 Provides outline nodes of a document. const o3tl::enumarray< SvxAdjust, unsigned short > aSvxToUnoAdjust USHRT_MAX Definition: unosett.cxx:253 OUString GetSelText() const get selected text of a node at current cursor Definition: crsrsh.cxx:2515 virtual const_iterator_t getBookmarksBegin() const =0 returns a STL-like random access iterator to the begin of the sequence the IBookmarks. OUString aName OString strip(const OString &rIn, char c) virtual void FillUserData() override Definition: fldref.cxx:1116 const OUString & GetSetRefName() const Definition: reffld.hxx:107 std::unique_ptr< weld::TreeView > m_xTypeLB Definition: fldref.hxx:47 static const char * FMT_REF_ARY[] Definition: fldref.cxx:752 static OUString GetTypeStr(sal_uInt16 nPos) Definition: fldmgr.cxx:526 OUString sId bool IsFieldEdit() const Definition: fldpage.hxx:62 #define REFFLDFLAG_HEADING Definition: fldref.cxx:46 static std::unique_ptr< SfxTabPage > Create(weld::Container *pPage, weld::DialogController *pController, const SfxItemSet *rAttrSet) Definition: fldref.cxx:1105 sal_uInt16 GetType() const Definition: expfld.hxx:193 static const SwFieldGroupRgn & GetGroupRange(bool bHtmlMode, sal_uInt16 nGrpId) Definition: fldmgr.cxx:464 sal_Int32 FillFormatLB(sal_uInt16 nTypeId) Definition: fldref.cxx:767 SwRootFrame * GetLayout() const Definition: viewsh.cxx:2062 CharClass & GetAppCharClass() Definition: init.cxx:709 OUString sEndnoteText Definition: fldref.hxx:33 size_t mnSavedSelectedPos Definition: fldref.hxx:45 #define REFFLDFLAG_FOOTNOTE Definition: fldref.cxx:43 std::unique_ptr< weld::TreeView > m_xSelectionLB Definition: fldref.hxx:49 const SwTextNode * GetReferencedTextNode() const Definition: reffld.cxx:391 void SetTypeSel(sal_Int32 nSet) Definition: fldpage.hxx:46 sal_uInt16 nPos size_t GetSeqFieldList(SwSeqFieldList &rList, SwRootFrame const *pLayout) Definition: expfld.cxx:618 void GetSubTypes(SwFieldTypesEnum nId, std::vector< OUString > &rToFill) Definition: fldmgr.cxx:567 SwFieldRefPage(weld::Container *pPage, weld::DialogController *pController, const SfxItemSet *pSet) Definition: fldref.cxx:54 std::unique_ptr< weld::Entry > m_xNameED Definition: fldref.hxx:55 #define USER_DATA_VERSION_1 Definition: fldref.cxx:51

{ "url": "https://docs.libreoffice.org/sw/html/fldref_8cxx_source.html", "source_domain": "docs.libreoffice.org", "snapshot_id": "crawl=CC-MAIN-2020-05", "warc_metadata": { "Content-Length": "284725", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:GGSWXDFZAIO4FJID4WHRPE6AVEHUSOVP", "WARC-Concurrent-To": "<urn:uuid:8f4a39d4-08a5-40ab-a4e3-8ce615c067fd>", "WARC-Date": "2020-01-25T13:42:51Z", "WARC-IP-Address": "89.238.68.142", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:7E5LPBUHIESMW2VMDPDNPYXAPUGFHFBH", "WARC-Record-ID": "<urn:uuid:f3db0a9a-9efc-40dc-b890-1b8133949951>", "WARC-Target-URI": "https://docs.libreoffice.org/sw/html/fldref_8cxx_source.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4bca8673-06db-4fad-9821-c13877cb0ab6>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-245.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, 34, 45, 83, 165, 170, 221, 226, 299, 372, 434, 439, 513, 519, 592, 662, 730, 798, 868, 938, 1004, 1011, 1015, 1041, 1064, 1088, 1113, 1140, 1165, 1190, 1214, 1218, 1243, 1269, 1295, 1323, 1361, 1385, 1422, 1459, 1463, 1499, 1503, 1532, 1570, 1608, 1645, 1660, 1697, 1734, 1738, 1783, 1787, 1822, 1871, 1875, 1975, 1998, 2017, 2056, 2084, 2136, 2195, 2254, 2323, 2379, 2435, 2485, 2533, 2583, 2635, 2640, 2675, 2691, 2759, 2765, 2825, 2887, 2893, 2897, 2941, 2985, 3028, 3044, 3087, 3130, 3134, 3184, 3265, 3315, 3367, 3424, 3470, 3534, 3538, 3562, 3566, 3637, 3719, 3723, 3808, 3878, 3963, 4054, 4142, 4147, 4164, 4262, 4362, 4394, 4400, 4405, 4411, 4417, 4422, 4428, 4505, 4511, 4516, 4532, 4538, 4578, 4607, 4656, 4663, 4726, 4749, 4756, 4832, 4837, 4879, 4886, 4962, 5017, 5024, 5031, 5038, 5085, 5092, 5168, 5219, 5226, 5233, 5240, 5247, 5254, 5260, 5265, 5271, 5296, 5303, 5329, 5346, 5353, 5379, 5400, 5439, 5444, 5475, 5501, 5526, 5531, 5557, 5562, 5591, 5596, 5647, 5654, 5718, 5723, 5787, 5794, 5897, 5904, 5911, 5916, 5933, 5981, 6057, 6133, 6138, 6178, 6216, 6231, 6265, 6270, 6285, 6298, 6303, 6381, 6386, 6514, 6519, 6567, 6574, 6579, 6691, 6698, 6774, 6781, 6788, 6793, 6854, 6932, 6937, 6956, 6987, 6994, 7072, 7079, 7084, 7102, 7138, 7145, 7221, 7228, 7233, 7257, 7262, 7285, 7310, 7315, 7344, 7349, 7397, 7421, 7428, 7454, 7501, 7559, 7608, 7615, 7715, 7742, 7749, 7836, 7843, 7893, 7900, 7927, 7939, 7946, 7953, 8001, 8008, 8105, 8112, 8119, 8126, 8133, 8159, 8216, 8223, 8269, 8276, 8300, 8307, 8337, 8372, 8404, 8434, 8465, 8505, 8512, 8518, 8523, 8529, 8557, 8599, 8604, 8631, 8681, 8686, 8714, 8721, 8745, 8752, 8777, 8798, 8825, 8830, 8873, 8880, 8904, 8911, 8928, 9005, 9028, 9079, 9086, 9113, 9146, 9153, 9181, 9232, 9239, 9266, 9299, 9306, 9316, 9323, 9351, 9385, 9392, 9399, 9411, 9416, 9440, 9468, 9502, 9514, 9519, 9542, 9569, 9602, 9614, 9619, 9645, 9682, 9711, 9723, 9728, 9755, 9829, 9854, 9866, 9873, 9878, 9951, 9958, 10014, 10021, 10026, 10062, 10112, 10119, 10129, 10136, 10156, 10183, 10190, 10197, 10202, 10233, 10246, 10251, 10321, 10326, 10357, 10434, 10439, 10464, 10493, 10498, 10562, 10580, 10587, 10625, 10664, 10704, 10711, 10716, 10738, 10745, 10806, 10878, 10904, 10965, 10984, 10996, 11001, 11062, 11081, 11093, 11098, 11129, 11148, 11170, 11184, 11216, 11223, 11307, 11401, 11432, 11493, 11500, 11512, 11519, 11524, 11562, 11600, 11605, 11633, 11679, 11711, 11751, 11756, 11775, 11803, 11833, 11839, 11844, 11926, 11932, 11951, 11957, 11962, 12040, 12046, 12065, 12071, 12076, 12082, 12152, 12157, 12178, 12185, 12246, 12317, 12324, 12387, 12415, 12422, 12434, 12439, 12500, 12507, 12545, 12559, 12593, 12606, 12613, 12659, 12666, 12671, 12678, 12690, 12707, 12737, 12767, 12774, 12837, 12860, 12927, 12934, 12946, 12951, 12965, 13036, 13099, 13111, 13118, 13124, 13129, 13179, 13248, 13254, 13292, 13306, 13340, 13416, 13492, 13497, 13520, 13537, 13579, 13586, 13661, 13691, 13747, 13754, 13799, 13861, 13866, 13897, 13927, 13932, 13963, 13970, 14044, 14051, 14080, 14118, 14149, 14156, 14173, 14251, 14258, 14287, 14323, 14354, 14361, 14368, 14373, 14390, 14428, 14465, 14504, 14548, 14553, 14585, 14592, 14648, 14655, 14682, 14759, 14849, 14896, 14911, 14918, 14965, 14972, 15044, 15065, 15072, 15126, 15133, 15140, 15147, 15171, 15214, 15221, 15267, 15274, 15332, 15337, 15377, 15384, 15459, 15480, 15487, 15544, 15551, 15620, 15654, 15661, 15668, 15713, 15720, 15784, 15789, 15829, 15836, 15911, 15932, 15939, 15996, 16003, 16072, 16106, 16113, 16120, 16137, 16184, 16191, 16228, 16233, 16278, 16357, 16364, 16429, 16436, 16462, 16469, 16593, 16614, 16621, 16668, 16708, 16784, 16813, 16886, 16893, 16929, 16951, 16989, 16996, 17073, 17080, 17116, 17138, 17145, 17152, 17159, 17166, 17213, 17220, 17257, 17262, 17338, 17377, 17422, 17506, 17513, 17595, 17602, 17628, 17635, 17758, 17779, 17786, 17836, 17876, 17951, 17980, 18067, 18140, 18147, 18183, 18205, 18243, 18250, 18330, 18337, 18373, 18395, 18402, 18409, 18416, 18423, 18433, 18440, 18481, 18486, 18569, 18620, 18637, 18644, 18698, 18721, 18743, 18748, 18821, 18861, 18868, 18943, 18964, 18971, 19028, 19035, 19082, 19130, 19166, 19173, 19178, 19223, 19284, 19291, 19298, 19305, 19315, 19322, 19355, 19433, 19469, 19476, 19536, 19557, 19564, 19601, 19608, 19615, 19620, 19644, 19687, 19694, 19699, 19716, 19745, 19781, 19826, 19890, 19958, 20020, 20056, 20063, 20125, 20170, 20175, 20238, 20261, 20312, 20317, 20357, 20364, 20399, 20406, 20413, 20423, 20430, 20456, 20511, 20556, 20561, 20581, 20588, 20631, 20702, 20734, 20741, 20746, 20864, 20899, 20906, 20912, 20917, 21013, 21019, 21046, 21064, 21134, 21196, 21243, 21249, 21254, 21270, 21275, 21281, 21308, 21338, 21365, 21394, 21427, 21460, 21494, 21526, 21555, 21595, 21637, 21644, 21649, 21655, 21660, 21699, 21705, 21724, 21746, 21765, 21786, 21811, 21836, 21862, 21886, 21907, 21939, 21972, 21979, 21984, 22047, 22053, 22076, 22081, 22144, 22171, 22221, 22226, 22254, 22281, 22286, 22333, 22361, 22401, 22423, 22430, 22447, 22477, 22507, 22540, 22562, 22567, 22628, 22659, 22690, 22720, 22761, 22773, 22778, 22792, 22809, 22814, 22847, 22854, 22894, 22901, 22911, 22918, 23025, 23032, 23044, 23051, 23056, 23087, 23153, 23158, 23233, 23277, 23284, 23365, 23439, 23446, 23463, 23468, 23501, 23533, 23540, 23586, 23671, 23753, 23799, 23876, 23958, 24006, 24083, 24165, 24186, 24193, 24198, 24269, 24313, 24392, 24397, 24435, 24442, 24486, 24493, 24603, 24724, 24731, 24757, 24762, 24794, 24801, 24877, 24962, 25118, 25194, 25271, 25427, 25505, 25582, 25738, 25760, 25767, 25793, 25837, 25844, 25958, 26079, 26086, 26112, 26144, 26151, 26231, 26316, 26472, 26552, 26629, 26785, 26867, 26944, 27100, 27122, 27129, 27136, 27141, 27167, 27172, 27203, 27219, 27226, 27251, 27291, 27301, 27412, 27417, 27467, 27474, 27531, 27541, 27570, 27577, 27584, 27589, 27608, 27614, 27619, 27633, 27639, 27683, 27729, 27734, 27760, 27830, 27835, 27952, 28101, 28140, 28162, 28167, 28195, 28200, 28241, 28247, 28252, 28258, 28287, 28357, 28362, 28392, 28460, 28509, 28563, 28568, 28612, 28656, 28661, 28682, 28689, 28750, 28782, 28794, 28799, 28860, 28867, 28872, 28935, 28942, 28983, 29023, 29030, 29042, 29049, 29056, 29061, 29137, 29142, 29173, 29180, 29218, 29232, 29239, 29273, 29280, 29336, 29343, 29379, 29445, 29475, 29482, 29541, 29548, 29618, 29623, 29645, 29650, 29716, 29746, 29766, 29771, 29843, 29850, 29901, 29906, 29976, 30062, 30069, 30098, 30153, 30160, 30217, 30224, 30294, 30299, 30321, 30326, 30393, 30423, 30444, 30450, 30529, 30537, 30589, 30595, 30666, 30751, 30759, 30789, 30845, 30853, 30871, 30919, 30927, 30991, 31023, 31119, 31143, 31151, 31230, 31276, 31284, 31381, 31416, 31448, 31515, 31546, 31554, 31562, 31570, 31618, 31626, 31690, 31722, 31818, 31842, 31850, 31932, 31977, 31985, 32082, 32131, 32163, 32230, 32261, 32269, 32277, 32285, 32314, 32322, 32361, 32445, 32497, 32515, 32523, 32594, 32600, 32623, 32629, 32696, 32730, 32762, 32768, 32825, 32864, 32872, 32924, 32930, 33001, 33086, 33094, 33124, 33180, 33188, 33196, 33204, 33210, 33299, 33307, 33361, 33369, 33375, 33416, 33467, 33519, 33570, 33626, 33677, 33685, 33778, 33786, 33792, 33860, 33866, 33886, 33893, 33899, 34017, 34057, 34064, 34141, 34148, 34154, 34161, 34183, 34190, 34196, 34203, 34270, 34324, 34342, 34391, 34466, 34555, 34598, 34637, 34644, 34650, 34707, 34794, 34837, 34862, 34931, 34958, 35026, 35053, 35142, 35191, 35215, 35241, 35310, 35337, 35387, 35413, 35457, 35479, 35505, 35544, 35572, 35611, 35639, 35681, 35707, 35749, 35776, 35802, 35828, 35854, 35923, 35951, 36056, 36078, 36117, 36186, 36232, 36258, 36319, 36345, 36357, 36390, 36419, 36463, 36481, 36508, 36536, 36563, 36606, 36632, 36664, 36691, 36710, 36736, 36781, 36806, 36841, 36868, 36905, 36931, 36958, 36985, 37030, 37056, 37107, 37134, 37163, 37267, 37331, 37358, 37401, 37427, 37479, 37506, 37543, 37570, 37607, 37681, 37708, 37735, 37761, 37793, 37820, 37879, 37931, 37959, 37978, 38006, 38062, 38088, 38140, 38224, 38268, 38295, 38323, 38349, 38391, 38419, 38499, 38526, 38532, 38549, 38575, 38601, 38613, 38640, 38666, 38736, 38801, 38826, 38849, 38876, 38912, 38974, 39000, 39189, 39217, 39246, 39273, 39325, 39352, 39423, 39479, 39506, 39530, 39557, 39591, 39620, 39701, 39750, 39777, 39800, 39826, 39853, 39880, 39902, 39928, 39970, 39995, 40022, 40034, 40061, 40084, 40110, 40157, 40179, 40205, 40232, 40259, 40289, 40299, 40326, 40354, 40413, 40440, 40534, 40582, 40626, 40653, 40716, 40744, 40790, 40817, 40863, 40889, 40927, 41004, 41032, 41060, 41106, 41134, 41188, 41275, 41290, 41332, 41369, 41397, 41436, 41463, 41507, 41533, 41567, 41594, 41638, 41665, 41678, 41703, 41730, 41757, 41783, 41916, 41944, 41971, 41998, 42078, 42105, 42148, 42175, 42207, 42235, 42265, 42290, 42312, 42338, 42364, 42390, 42418, 42444, 42493, 42519, 42568, 42595, 42627, 42654, 42670, 42744, 42771, 42844, 42871, 42971, 42997, 43038, 43064, 43092 ], "line_end_idx": [ 34, 45, 83, 165, 170, 221, 226, 299, 372, 434, 439, 513, 519, 592, 662, 730, 798, 868, 938, 1004, 1011, 1015, 1041, 1064, 1088, 1113, 1140, 1165, 1190, 1214, 1218, 1243, 1269, 1295, 1323, 1361, 1385, 1422, 1459, 1463, 1499, 1503, 1532, 1570, 1608, 1645, 1660, 1697, 1734, 1738, 1783, 1787, 1822, 1871, 1875, 1975, 1998, 2017, 2056, 2084, 2136, 2195, 2254, 2323, 2379, 2435, 2485, 2533, 2583, 2635, 2640, 2675, 2691, 2759, 2765, 2825, 2887, 2893, 2897, 2941, 2985, 3028, 3044, 3087, 3130, 3134, 3184, 3265, 3315, 3367, 3424, 3470, 3534, 3538, 3562, 3566, 3637, 3719, 3723, 3808, 3878, 3963, 4054, 4142, 4147, 4164, 4262, 4362, 4394, 4400, 4405, 4411, 4417, 4422, 4428, 4505, 4511, 4516, 4532, 4538, 4578, 4607, 4656, 4663, 4726, 4749, 4756, 4832, 4837, 4879, 4886, 4962, 5017, 5024, 5031, 5038, 5085, 5092, 5168, 5219, 5226, 5233, 5240, 5247, 5254, 5260, 5265, 5271, 5296, 5303, 5329, 5346, 5353, 5379, 5400, 5439, 5444, 5475, 5501, 5526, 5531, 5557, 5562, 5591, 5596, 5647, 5654, 5718, 5723, 5787, 5794, 5897, 5904, 5911, 5916, 5933, 5981, 6057, 6133, 6138, 6178, 6216, 6231, 6265, 6270, 6285, 6298, 6303, 6381, 6386, 6514, 6519, 6567, 6574, 6579, 6691, 6698, 6774, 6781, 6788, 6793, 6854, 6932, 6937, 6956, 6987, 6994, 7072, 7079, 7084, 7102, 7138, 7145, 7221, 7228, 7233, 7257, 7262, 7285, 7310, 7315, 7344, 7349, 7397, 7421, 7428, 7454, 7501, 7559, 7608, 7615, 7715, 7742, 7749, 7836, 7843, 7893, 7900, 7927, 7939, 7946, 7953, 8001, 8008, 8105, 8112, 8119, 8126, 8133, 8159, 8216, 8223, 8269, 8276, 8300, 8307, 8337, 8372, 8404, 8434, 8465, 8505, 8512, 8518, 8523, 8529, 8557, 8599, 8604, 8631, 8681, 8686, 8714, 8721, 8745, 8752, 8777, 8798, 8825, 8830, 8873, 8880, 8904, 8911, 8928, 9005, 9028, 9079, 9086, 9113, 9146, 9153, 9181, 9232, 9239, 9266, 9299, 9306, 9316, 9323, 9351, 9385, 9392, 9399, 9411, 9416, 9440, 9468, 9502, 9514, 9519, 9542, 9569, 9602, 9614, 9619, 9645, 9682, 9711, 9723, 9728, 9755, 9829, 9854, 9866, 9873, 9878, 9951, 9958, 10014, 10021, 10026, 10062, 10112, 10119, 10129, 10136, 10156, 10183, 10190, 10197, 10202, 10233, 10246, 10251, 10321, 10326, 10357, 10434, 10439, 10464, 10493, 10498, 10562, 10580, 10587, 10625, 10664, 10704, 10711, 10716, 10738, 10745, 10806, 10878, 10904, 10965, 10984, 10996, 11001, 11062, 11081, 11093, 11098, 11129, 11148, 11170, 11184, 11216, 11223, 11307, 11401, 11432, 11493, 11500, 11512, 11519, 11524, 11562, 11600, 11605, 11633, 11679, 11711, 11751, 11756, 11775, 11803, 11833, 11839, 11844, 11926, 11932, 11951, 11957, 11962, 12040, 12046, 12065, 12071, 12076, 12082, 12152, 12157, 12178, 12185, 12246, 12317, 12324, 12387, 12415, 12422, 12434, 12439, 12500, 12507, 12545, 12559, 12593, 12606, 12613, 12659, 12666, 12671, 12678, 12690, 12707, 12737, 12767, 12774, 12837, 12860, 12927, 12934, 12946, 12951, 12965, 13036, 13099, 13111, 13118, 13124, 13129, 13179, 13248, 13254, 13292, 13306, 13340, 13416, 13492, 13497, 13520, 13537, 13579, 13586, 13661, 13691, 13747, 13754, 13799, 13861, 13866, 13897, 13927, 13932, 13963, 13970, 14044, 14051, 14080, 14118, 14149, 14156, 14173, 14251, 14258, 14287, 14323, 14354, 14361, 14368, 14373, 14390, 14428, 14465, 14504, 14548, 14553, 14585, 14592, 14648, 14655, 14682, 14759, 14849, 14896, 14911, 14918, 14965, 14972, 15044, 15065, 15072, 15126, 15133, 15140, 15147, 15171, 15214, 15221, 15267, 15274, 15332, 15337, 15377, 15384, 15459, 15480, 15487, 15544, 15551, 15620, 15654, 15661, 15668, 15713, 15720, 15784, 15789, 15829, 15836, 15911, 15932, 15939, 15996, 16003, 16072, 16106, 16113, 16120, 16137, 16184, 16191, 16228, 16233, 16278, 16357, 16364, 16429, 16436, 16462, 16469, 16593, 16614, 16621, 16668, 16708, 16784, 16813, 16886, 16893, 16929, 16951, 16989, 16996, 17073, 17080, 17116, 17138, 17145, 17152, 17159, 17166, 17213, 17220, 17257, 17262, 17338, 17377, 17422, 17506, 17513, 17595, 17602, 17628, 17635, 17758, 17779, 17786, 17836, 17876, 17951, 17980, 18067, 18140, 18147, 18183, 18205, 18243, 18250, 18330, 18337, 18373, 18395, 18402, 18409, 18416, 18423, 18433, 18440, 18481, 18486, 18569, 18620, 18637, 18644, 18698, 18721, 18743, 18748, 18821, 18861, 18868, 18943, 18964, 18971, 19028, 19035, 19082, 19130, 19166, 19173, 19178, 19223, 19284, 19291, 19298, 19305, 19315, 19322, 19355, 19433, 19469, 19476, 19536, 19557, 19564, 19601, 19608, 19615, 19620, 19644, 19687, 19694, 19699, 19716, 19745, 19781, 19826, 19890, 19958, 20020, 20056, 20063, 20125, 20170, 20175, 20238, 20261, 20312, 20317, 20357, 20364, 20399, 20406, 20413, 20423, 20430, 20456, 20511, 20556, 20561, 20581, 20588, 20631, 20702, 20734, 20741, 20746, 20864, 20899, 20906, 20912, 20917, 21013, 21019, 21046, 21064, 21134, 21196, 21243, 21249, 21254, 21270, 21275, 21281, 21308, 21338, 21365, 21394, 21427, 21460, 21494, 21526, 21555, 21595, 21637, 21644, 21649, 21655, 21660, 21699, 21705, 21724, 21746, 21765, 21786, 21811, 21836, 21862, 21886, 21907, 21939, 21972, 21979, 21984, 22047, 22053, 22076, 22081, 22144, 22171, 22221, 22226, 22254, 22281, 22286, 22333, 22361, 22401, 22423, 22430, 22447, 22477, 22507, 22540, 22562, 22567, 22628, 22659, 22690, 22720, 22761, 22773, 22778, 22792, 22809, 22814, 22847, 22854, 22894, 22901, 22911, 22918, 23025, 23032, 23044, 23051, 23056, 23087, 23153, 23158, 23233, 23277, 23284, 23365, 23439, 23446, 23463, 23468, 23501, 23533, 23540, 23586, 23671, 23753, 23799, 23876, 23958, 24006, 24083, 24165, 24186, 24193, 24198, 24269, 24313, 24392, 24397, 24435, 24442, 24486, 24493, 24603, 24724, 24731, 24757, 24762, 24794, 24801, 24877, 24962, 25118, 25194, 25271, 25427, 25505, 25582, 25738, 25760, 25767, 25793, 25837, 25844, 25958, 26079, 26086, 26112, 26144, 26151, 26231, 26316, 26472, 26552, 26629, 26785, 26867, 26944, 27100, 27122, 27129, 27136, 27141, 27167, 27172, 27203, 27219, 27226, 27251, 27291, 27301, 27412, 27417, 27467, 27474, 27531, 27541, 27570, 27577, 27584, 27589, 27608, 27614, 27619, 27633, 27639, 27683, 27729, 27734, 27760, 27830, 27835, 27952, 28101, 28140, 28162, 28167, 28195, 28200, 28241, 28247, 28252, 28258, 28287, 28357, 28362, 28392, 28460, 28509, 28563, 28568, 28612, 28656, 28661, 28682, 28689, 28750, 28782, 28794, 28799, 28860, 28867, 28872, 28935, 28942, 28983, 29023, 29030, 29042, 29049, 29056, 29061, 29137, 29142, 29173, 29180, 29218, 29232, 29239, 29273, 29280, 29336, 29343, 29379, 29445, 29475, 29482, 29541, 29548, 29618, 29623, 29645, 29650, 29716, 29746, 29766, 29771, 29843, 29850, 29901, 29906, 29976, 30062, 30069, 30098, 30153, 30160, 30217, 30224, 30294, 30299, 30321, 30326, 30393, 30423, 30444, 30450, 30529, 30537, 30589, 30595, 30666, 30751, 30759, 30789, 30845, 30853, 30871, 30919, 30927, 30991, 31023, 31119, 31143, 31151, 31230, 31276, 31284, 31381, 31416, 31448, 31515, 31546, 31554, 31562, 31570, 31618, 31626, 31690, 31722, 31818, 31842, 31850, 31932, 31977, 31985, 32082, 32131, 32163, 32230, 32261, 32269, 32277, 32285, 32314, 32322, 32361, 32445, 32497, 32515, 32523, 32594, 32600, 32623, 32629, 32696, 32730, 32762, 32768, 32825, 32864, 32872, 32924, 32930, 33001, 33086, 33094, 33124, 33180, 33188, 33196, 33204, 33210, 33299, 33307, 33361, 33369, 33375, 33416, 33467, 33519, 33570, 33626, 33677, 33685, 33778, 33786, 33792, 33860, 33866, 33886, 33893, 33899, 34017, 34057, 34064, 34141, 34148, 34154, 34161, 34183, 34190, 34196, 34203, 34270, 34324, 34342, 34391, 34466, 34555, 34598, 34637, 34644, 34650, 34707, 34794, 34837, 34862, 34931, 34958, 35026, 35053, 35142, 35191, 35215, 35241, 35310, 35337, 35387, 35413, 35457, 35479, 35505, 35544, 35572, 35611, 35639, 35681, 35707, 35749, 35776, 35802, 35828, 35854, 35923, 35951, 36056, 36078, 36117, 36186, 36232, 36258, 36319, 36345, 36357, 36390, 36419, 36463, 36481, 36508, 36536, 36563, 36606, 36632, 36664, 36691, 36710, 36736, 36781, 36806, 36841, 36868, 36905, 36931, 36958, 36985, 37030, 37056, 37107, 37134, 37163, 37267, 37331, 37358, 37401, 37427, 37479, 37506, 37543, 37570, 37607, 37681, 37708, 37735, 37761, 37793, 37820, 37879, 37931, 37959, 37978, 38006, 38062, 38088, 38140, 38224, 38268, 38295, 38323, 38349, 38391, 38419, 38499, 38526, 38532, 38549, 38575, 38601, 38613, 38640, 38666, 38736, 38801, 38826, 38849, 38876, 38912, 38974, 39000, 39189, 39217, 39246, 39273, 39325, 39352, 39423, 39479, 39506, 39530, 39557, 39591, 39620, 39701, 39750, 39777, 39800, 39826, 39853, 39880, 39902, 39928, 39970, 39995, 40022, 40034, 40061, 40084, 40110, 40157, 40179, 40205, 40232, 40259, 40289, 40299, 40326, 40354, 40413, 40440, 40534, 40582, 40626, 40653, 40716, 40744, 40790, 40817, 40863, 40889, 40927, 41004, 41032, 41060, 41106, 41134, 41188, 41275, 41290, 41332, 41369, 41397, 41436, 41463, 41507, 41533, 41567, 41594, 41638, 41665, 41678, 41703, 41730, 41757, 41783, 41916, 41944, 41971, 41998, 42078, 42105, 42148, 42175, 42207, 42235, 42265, 42290, 42312, 42338, 42364, 42390, 42418, 42444, 42493, 42519, 42568, 42595, 42627, 42654, 42670, 42744, 42771, 42844, 42871, 42971, 42997, 43038, 43064, 43092, 43117 ] }

{ "red_pajama_v2": { "ccnet_original_length": 43117, "ccnet_original_nlines": 1319, "rps_doc_curly_bracket": 0.006076490040868521, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.05308137089014053, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023832449689507484, "rps_doc_frac_lines_end_with_ellipsis": 0.0015151499537751079, "rps_doc_frac_no_alph_words": 0.5678863525390625, "rps_doc_frac_unique_words": 0.5264682769775391, "rps_doc_mean_word_length": 8.30550479888916, "rps_doc_num_sentences": 299, "rps_doc_symbol_to_word_ratio": 0.008786709979176521, "rps_doc_unigram_entropy": 6.845143795013428, "rps_doc_word_count": 3797, "rps_doc_frac_chars_dupe_10grams": 0.006785899866372347, "rps_doc_frac_chars_dupe_5grams": 0.059582699090242386, "rps_doc_frac_chars_dupe_6grams": 0.046867068856954575, "rps_doc_frac_chars_dupe_7grams": 0.015759769827127457, "rps_doc_frac_chars_dupe_8grams": 0.012239979580044746, "rps_doc_frac_chars_dupe_9grams": 0.012239979580044746, "rps_doc_frac_chars_top_2gram": 0.011542360298335552, "rps_doc_frac_chars_top_3gram": 0.011415529996156693, "rps_doc_frac_chars_top_4gram": 0.011605779640376568, "rps_doc_books_importance": -3273.64453125, "rps_doc_books_importance_length_correction": -3273.64453125, "rps_doc_openwebtext_importance": -1995.1629638671875, "rps_doc_openwebtext_importance_length_correction": -1995.1629638671875, "rps_doc_wikipedia_importance": -965.6089477539062, "rps_doc_wikipedia_importance_length_correction": -965.6089477539062 }, "fasttext": { "dclm": 0.9288501739501953, "english": 0.13367941975593567, "fineweb_edu_approx": 2.8053741455078125, "eai_general_math": 0.4892297387123108, "eai_open_web_math": 0.08145689964294434, "eai_web_code": 0.15905898809432983 } }

{ "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.01", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-1,545,341,905,483,465,500

Brightness while in docking stationSupport Last Updated: 1. houseofgrafx houseofgrafx Well-Known Member I picked up a docking station from a member on here and decided to use it next to my bed. I like the idea of the clock being displayed however, it's super bright. I hit the little icon that puts it in night mode but it's still too bright for my liking. Im one of those who cannot sleep unless the room is dark. Is there any option that would turn the screen off? I tried messing with it but to no avail.:confused: Thanks in advance. Advertisement 2. richs10 richs10 Active Member I had the same issue with the brightness of the stock dock mode. I downloaded Alarm Clock Pro app and the night mode is much dimmer (possibly too dim for some). You might want to check out the free version first. It appears that neither the stock app nor this app have a simple brightness control. Dumb, IMHO. One caveat: I've had intermitent issues with the second backup battery not charging after the phone's battery is fully charged. I'm still trying to figure out if the new app is the reason. Hope this helps Rich 3. Manderley Manderley New Member I kept my Charge in a dock all day and all night and got horrible screen burn. I had a chip on the case from a drop on the day of purchase and Verizon said that they didn't think it would be honered under warrenty because of the chip. I had to eat the cost of the phone when I switched to a Bionic. I'd be really carefully about keeping it in a dock with the screen turned on. 4. houseofgrafx houseofgrafx Well-Known Member That's why I'm trying to find a way to have the screen off when docking/charging at night. 5. treb1797 treb1797 Well-Known Member This post just doesn't make sense to me?? Just don't charge it in the station if you don't want the screen on. You are trying to defeat the whole point of the docking station?????:confused: 6. bowsback bowsback Well-Known Member if you hit the sleep/wake button in the dock then the screen goes off 7. richs10 richs10 Active Member If you are using the dock as a bedside alarm clock, the App that comes with the phone is bright, even in sleep mode. It uses a fairly bright, yellow font for the sleep mode time displayed on the screen. This stays on all night (so you can see what time it is in the middle of the night). I think that is what the OP is complaining about. And I agree with him or her. 8. mundee mundee New Member I also hated the light even in the sleep mode...still too bright. I found that if you ALSO dim the display brightness, then it is nearly black. Go to settings - display - brightness - slide it all the way to the left, the darkest. Then when in dock mode touch the sleep button. yay! 9. kevindroid kevindroid Well-Known Member gentle alarm has anti burnin settings can choose color and brightness. my phone has become a night stand alarm clock. stays on 24/7 i also use a live wallpaper for burn protection 10. stueycaster stueycaster Well-Known Member I use Desk Clock. It does nothing but a clock. It's very configurable as far as font, size and brightness and can be set to move the clock around the screen as burn protection. I like it a lot. 11. MaxBuck MaxBuck Well-Known Member I've used my dock for the past 15 months every night, with the phone as my alarm clock. Absolutely no evidence of any burn-in. Also, the screen dims after about a minute. I use AlarmDroid app. Share This Page

{ "url": "http://androidforums.com/threads/brightness-while-in-docking-station.425915/", "source_domain": "androidforums.com", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "70877", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UOXTZHFFMLS36HX343O4FHSWT56B5JYM", "WARC-Concurrent-To": "<urn:uuid:ede0c3c6-e4b4-486a-b088-4e73fa4feee3>", "WARC-Date": "2015-11-29T15:14:13Z", "WARC-IP-Address": "173.192.24.230", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:7JHWF2O53SILUXRR4VMR6AQ7ESIFFNX6", "WARC-Record-ID": "<urn:uuid:4224b3c6-a3fb-444f-80a2-62e3c1a4108e>", "WARC-Target-URI": "http://androidforums.com/threads/brightness-while-in-docking-station.425915/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:4aecff39-4f21-476e-9953-f8d5237c0072>" }, "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, 43, 44, 45, 59, 60, 78, 79, 114, 115, 533, 556, 562, 563, 581, 594, 595, 621, 622, 936, 937, 1130, 1131, 1151, 1160, 1166, 1181, 1182, 1207, 1208, 1511, 1512, 1594, 1600, 1618, 1619, 1654, 1655, 1750, 1756, 1770, 1771, 1802, 1803, 1997, 2003, 2017, 2018, 2049, 2050, 2124, 2130, 2143, 2144, 2170, 2171, 2542, 2548, 2560, 2561, 2583, 2584, 2871, 2877, 2893, 2894, 2927, 2928, 3112, 3118, 3136, 3137, 3171, 3172, 3370, 3376, 3390, 3391, 3421, 3422, 3619, 3625, 3626 ], "line_end_idx": [ 43, 44, 45, 59, 60, 78, 79, 114, 115, 533, 556, 562, 563, 581, 594, 595, 621, 622, 936, 937, 1130, 1131, 1151, 1160, 1166, 1181, 1182, 1207, 1208, 1511, 1512, 1594, 1600, 1618, 1619, 1654, 1655, 1750, 1756, 1770, 1771, 1802, 1803, 1997, 2003, 2017, 2018, 2049, 2050, 2124, 2130, 2143, 2144, 2170, 2171, 2542, 2548, 2560, 2561, 2583, 2584, 2871, 2877, 2893, 2894, 2927, 2928, 3112, 3118, 3136, 3137, 3171, 3172, 3370, 3376, 3390, 3391, 3421, 3422, 3619, 3625, 3626, 3641 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3641, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4228723347187042, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03324468061327934, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.1489361673593521, "rps_doc_frac_unique_words": 0.4361022412776947, "rps_doc_mean_word_length": 4.2715654373168945, "rps_doc_num_sentences": 55, "rps_doc_symbol_to_word_ratio": 0.0013297899859026074, "rps_doc_unigram_entropy": 5.05998420715332, "rps_doc_word_count": 626, "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.02692594937980175, "rps_doc_frac_chars_top_3gram": 0.024682119488716125, "rps_doc_frac_chars_top_4gram": 0.029169779270887375, "rps_doc_books_importance": -262.225341796875, "rps_doc_books_importance_length_correction": -262.225341796875, "rps_doc_openwebtext_importance": -156.71920776367188, "rps_doc_openwebtext_importance_length_correction": -156.71920776367188, "rps_doc_wikipedia_importance": -81.04074096679688, "rps_doc_wikipedia_importance_length_correction": -81.04074096679688 }, "fasttext": { "dclm": 0.059190329164266586, "english": 0.9566272497177124, "fineweb_edu_approx": 0.9021434783935547, "eai_general_math": 0.02690177969634533, "eai_open_web_math": 0.1261804699897766, "eai_web_code": 0.00203300011344254 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "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

-1,241,896,029,376,729,600

Compiling Bela projects in Eclipse » History » Version 13 « Previous - Version 13/36 (diff) - Next » - Current version Giulio Moro, 2015-07-15 10:03 PM Compiling BeagleRT projects in Eclipse This document contains information on how to compile the BeagleRT software and upload it onto the BeagleBone Black. Required tools This document assumes you have the following tools installed: On Linux • Working Linux system, either running natively or on a virtual machine • Mercurial version control system (http://mercurial.selenic.com). Available as a package in most Linux distributions. • arm-gcc hardfp compiler toolchain (i.e. arm-linux-gnueabihf-gcc and similar. On Ubuntu, these can be installed from packages: sudo apt-get install gcc-arm-linux-gnueabihf sudo apt-get install g++-arm-linux-gnueabihf • Eclipse IDE (http://www.eclipse.org), including the C/C++ development tools • Xenomai libraries compiled for ARM hardfp (details to come) ( you can probably do something similar to what described below for MacOS, make sure you use the appropriate paths, which might differ from the ones below) On a 64bit MacOS X *You can get the arm cross-compiler toolchain from here http://www.welzels.de/blog/projekte/arm-cross-toolchain/, which will place the binaries into your /usr/local/linaro/arm-linux-gnueabihf/bin/ folder *xenomai libraries and include files are already on the BBB's SD card. You can copy them over to your machine as follows: cd ~ ssh root@192.168.7.2 "cd /usr/; tar -zcvf ~/xenomai.tar.gz xenomai" rsync -avz --remove-source-files bbb:xenomai.tar.gz . cd /usr/local/linaro/arm-linux-gnueabihf/include/ sudo tar -xvf ~/xenomai.tar.gz sudo rm xenomai.tar.gz *Make sure that the following line is in your Eclipse project includes /usr/arm-linux-gnueabihf/include/xenomai/include and the following line is in your Eclipse projectlibraries search path /usr/local/linaro/arm-linux-gnueabihf/include/xenomai/lib/ Other operating systems Find your own way or use the VirtualBox image provided [ask for link]. Getting started 1. Clone the BeagleRT files from the repository: hg clone https://code.soundsoftware.ac.uk/hg/beaglert 2. Launch Eclipse and select a workspace (creating one if necessary). 3. In the Eclipse menu bar, choose File -> Import.... Within the dialog box that appears, choose General -> Existing Projects into Workspace. Click Next. 4. Click the button Select root directory and choose the path to the BeagleRT repository you just cloned. 5. Make sure the BeagleRT project is selected, and under Options, untick Copy projects into workspace. Click Finish to complete the project import. Compiling the BeagleRT project 1. In Eclipse, right-click on the BeagleRT project folder in the left-hand column, and choose Build Project. (If you don't see the list of projects, make sure the C/C++ Perspective is active in Eclipse, and choose Window -> Show View -> Project Explorer.) 2. The project should compile without errors, and the results should be visible in the Console tab (typically in the bottom pane of the window) 3. If any errors arise, check that you have all the dependencies installed, both header files and libraries. Copying BeagleRT projects to the BeagleBone Black 1. Once the project has compiled, open a terminal window and cd to the directory where the binary was compiled. For example, if you installed BeagleRT in your home directory: cd ~/BeagleRT/Release 2. Copy the BeagleRT executable to the BeagleBone Black using scp (entering your BeagleBone Black password when prompted; you may need to create the beaglert directory first): scp BeagleRT root@192.168.7.2:~/beaglert/ 3. The first time you install BeagleRT, you also need to copy the pru_rtaudio.bin file to the BeagleBone Black. This can be found at the top level of the BeagleRT repository, and it should be copied to the same directory on the BeagleBone where the BeagleRT executable is located: scp pru_rtaudio.bin root@192.168.7.2:~/beaglert/ Selecting different BeagleRT examples within the Eclipse project The Eclipse project contains several examples within the projects directory. Follow these steps to choose which one to compile: 1. Only one of the folders within projects should be enabled at a time. This one will be in solid black text; the remainder will be grey. 2. Right-click on the folder which is currently enabled (solid black). Choose Resource Configurations -> Exclude from Build... 3. Click Select All to disable the code in this folder. Click OK. 4. Now right-click on the folder which you want to enable. Choose Resource Configurations -> Exclude from Build... 5. Click Deselect All to enable the code in this folder. Click OK. Creating a new executable within the BeagleRT project Duplicate one of the existing project folders using the following steps: 1. Right-click the project folder you want to duplicate and select Copy. 2. Right-click on the projects folder and select Paste. It will ask you to type in a new name. 3. Follow the steps above (Resource Configurations) to enable compiling this new project rather than any of the others.

{ "url": "https://code.soundsoftware.ac.uk/projects/beaglert/wiki/_Compiling_Bela_projects_in_Eclipse/13", "source_domain": "code.soundsoftware.ac.uk", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "13520", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HOYFHYJZ6X7LXG5JDYFHIEUSBRYL36VX", "WARC-Concurrent-To": "<urn:uuid:60019a91-c0a0-42dc-9410-f56df72bd9a5>", "WARC-Date": "2023-11-30T03:36:54Z", "WARC-IP-Address": "138.37.95.184", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:42SOSBSPTKD6KIAPPGGXZYRZKZJSQCAL", "WARC-Record-ID": "<urn:uuid:34a7b67c-54db-4a3c-8e69-6f22db16e446>", "WARC-Target-URI": "https://code.soundsoftware.ac.uk/projects/beaglert/wiki/_Compiling_Bela_projects_in_Eclipse/13", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e790e1b8-b78b-433d-979d-dfe7f440440b>" }, "warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-169\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, 58, 59, 120, 153, 154, 155, 194, 195, 311, 312, 327, 328, 390, 391, 400, 474, 595, 725, 774, 823, 828, 908, 1128, 1129, 1148, 1149, 1353, 1475, 1476, 1481, 1550, 1604, 1655, 1686, 1709, 1710, 1781, 1782, 1831, 1832, 1903, 1962, 1963, 1987, 2058, 2059, 2075, 2076, 2127, 2185, 2190, 2262, 2418, 2526, 2676, 2677, 2708, 2709, 2967, 3113, 3224, 3225, 3275, 3276, 3475, 3653, 3699, 3704, 3987, 4040, 4045, 4046, 4111, 4112, 4240, 4241, 4381, 4510, 4578, 4695, 4764, 4765, 4819, 4820, 4893, 4894, 4969, 5066 ], "line_end_idx": [ 58, 59, 120, 153, 154, 155, 194, 195, 311, 312, 327, 328, 390, 391, 400, 474, 595, 725, 774, 823, 828, 908, 1128, 1129, 1148, 1149, 1353, 1475, 1476, 1481, 1550, 1604, 1655, 1686, 1709, 1710, 1781, 1782, 1831, 1832, 1903, 1962, 1963, 1987, 2058, 2059, 2075, 2076, 2127, 2185, 2190, 2262, 2418, 2526, 2676, 2677, 2708, 2709, 2967, 3113, 3224, 3225, 3275, 3276, 3475, 3653, 3699, 3704, 3987, 4040, 4045, 4046, 4111, 4112, 4240, 4241, 4381, 4510, 4578, 4695, 4764, 4765, 4819, 4820, 4893, 4894, 4969, 5066, 5187 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5187, "ccnet_original_nlines": 88, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2837465703487396, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.011019280180335045, "rps_doc_frac_lines_end_with_ellipsis": 0.02247191034257412, "rps_doc_frac_no_alph_words": 0.26629936695098877, "rps_doc_frac_unique_words": 0.4107382595539093, "rps_doc_mean_word_length": 5.408053874969482, "rps_doc_num_sentences": 83, "rps_doc_symbol_to_word_ratio": 0.002754820045083761, "rps_doc_unigram_entropy": 5.148252487182617, "rps_doc_word_count": 745, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.06304293870925903, "rps_doc_frac_chars_dupe_6grams": 0.0501365102827549, "rps_doc_frac_chars_dupe_7grams": 0.02829485945403576, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.030032269656658173, "rps_doc_frac_chars_top_3gram": 0.01787043921649456, "rps_doc_frac_chars_top_4gram": 0.014892029576003551, "rps_doc_books_importance": -516.9039916992188, "rps_doc_books_importance_length_correction": -516.9039916992188, "rps_doc_openwebtext_importance": -297.60076904296875, "rps_doc_openwebtext_importance_length_correction": -297.60076904296875, "rps_doc_wikipedia_importance": -144.7962188720703, "rps_doc_wikipedia_importance_length_correction": -144.7962188720703 }, "fasttext": { "dclm": 0.021107379347085953, "english": 0.7825517654418945, "fineweb_edu_approx": 2.1049201488494873, "eai_general_math": 0.7031040191650391, "eai_open_web_math": 0.25227290391921997, "eai_web_code": 0.10672420263290405 } }

{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

6,659,259,465,612,060,000

simple:Substitution-permutation network b) substitution. Cite this entry as: Bauer F.L. In cryptography, an SP-network, or substitution-permutation network ( SPN ), is a series of linked mathematical operations used in block cipher algorithms such as AES (Rijndael) . The key is introduced in each round, usually in the form of "round keys" derived from it. A good P-box has the property that the output bits of any S-box are distributed to as many S-box inputs as possible. Also SP ciphers require S-boxes to be invertible (to perform decryption); Feistel inner functions have no such restriction and can be constructed as one-way functions. Cryptography and Network Security - MA61027 (Sourav Mukhopadhyay, IIT-KGP, 2010) 16 In: van Tilborg H.C.A. For a given amount of confusion and diffusion, an SP network has more "inherent parallelism"[1] Decryption is done by simply reversing the process (using the inverses of the S-boxes and P-boxes and applying the round keys in reversed order). An S-box substitutes a small block of bits (the input of the S-box) by another block of bits (the output of the S-box). Base 16, 32, and 64; URL Encoding (Percent-Encoding) The wonders of hex, decimal, octal and ASCII; Types of Ciphers - Symmetric (Single Key) Substitution. sv:Substitutions-permutationskrypto The number of rounds are specified by the algorithm design. In cryptography, an SP-network, or substitution-permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES.. As the name implies, a substitution operation involves replacing one thing with something else. Rather, a good S-box will have the property that changing one input bit will change about half of the output bits (or an avalanche effect). A good P-box has the property that the output bits of any S-box are distributed to as many S-box inputs as possible. Such a network takes a block of the plaintext and the key as inputs, and applies several alternating "rounds" or "layers" of substitution boxes (S-boxes) and permutation boxes (P-boxes) to produce the ciphertext block. The development of public-key cryptography is the greatest and perhaps the only true revolution in the entire history of cryptography. Cite this entry as: Bauer F.L. The algorithms like DES use predetermined substitution and permutation boxes and others like Blowfish block cipher , Khufu algorithm , and Twofish utilize the dynamic substitution and permutation boxes. The initial and final permutations are shown as … 3. Both Substitution cipher technique and Transposition cipher technique are the types of Traditional cipher which are used to convert the plain text into cipher text.. a) Kerckhkoffs’s Principle. It comprises of a series of linked operations, some of which involve replacing inputs by specific outputs (substitutions) and others involve shuffling bits around (permutations) as shown in Figure A. ... the key to a transposition cipher is a permutation function. Symmetric cryptography relies on shared secret key to ensure message confidentiality, so that the unauthorized attackers cannot retrieve the message. b) substitution. Keywords – Cryptography, Azrael, Symmetrical character-level encryption algorithm, ICT, Substitution-permutation network, Student-centred methodologies. Any additional processing − Initial and final permutation; Initial and Final Permutation. The S-boxes and P-boxes transform (sub-)blocks of input bits into output bits. Substitution ciphers In general: Substitution ciphers are maps from one alphabet to another. "Principles and Performance of Cryptographic Algorithms", https://cryptography.fandom.com/wiki/Substitution-permutation_network?oldid=4528. It is common for these transformations to be operations that are efficient to perform in hardware, such as exclusive or (XOR) and bitwise rotation. variable From its earliest begin- nings to modern times, virtually all cryptographic systems have been based on the elementary tools of substitution and permutation. To cite this article: Arboledas-Brihuega, D. (2019). CPUs with few execution units — such as most smart cards — cannot take advantage of this inherent parallelism. 1 … A single typical S-box or a single P-box alone does not have much cryptographic strength: an S-box could be thought of as a substitution cipher, while a P-box could be thought of as a transposition cipher. b) Polyalphabetic Substitution . Permutation operation is required to remove any regular patterns those may appear in the cipher text (i.e. ... What's the difference between substitution and permutation in DES? This substitution should be one-to-one, to ensure invertibility (hence decryption). (2005) Substitutions and permutations. Permutations can be described by several simple and easy to understand notations. d) division _____ has the following properties. 2. It is similar to Columnar Transposition in some ways, in that the columns are written in the same way, including how the keyword is used. In particular, the length of the output should be the same as the length of the input (the picture on the right has S-boxes with 4 input and 4 output bits), which is different from S-boxes in general that could also change the length, as in DES (Data Encryption Standard), for example. Morse; Letter Numbers; Caesarian Shift; ROT13; Baconian; Polyalphabetic Substitution Ciphers. Cryptography and Network Security - MA61027 (Sourav Mukhopadhyay, IIT-KGP, 2010) 16 The Permutation Cipher is another form of Transposition Cipher. Crypto Wiki is a FANDOM Lifestyle Community. A P-box is a permutation of all the bits: it takes the outputs of all the S-boxes of one round, permutes the bits, and feeds them into the S-boxes of the next round. Keys '' derived from it into a ciphertext block of 16 bits letters ( the lengths the! The entire history of cryptography harder since have more alphabets to guess ; and because flattens frequency.... ’ s, the S-boxes themselves depend on the elementary tools of substitution and )... Output bits and cryptographers proposed using multiple Cipher alphabets, a process to! — can not take advantage of this inherent parallelism the last iteration of... Each output bit will depend on every input bit key is introduced in round! Another symbol ( or group of symbols ) with another symbol ( or group of symbols.! Mukhopadhyay, IIT-KGP, 2010 ) 16 a ) permutation as many S-box inputs as possible of 64 bits is! Will also have the property that the output bytes are fed into next... The art and science of concealing meaning ; polyalphabetic substitution ciphers in:... Transform ( sub- ) blocks of letters ( the lengths of the plaintext and.! Bits into a ciphertext block of 16 bits into output bits one symbol ( or of. Permutation Cipher is another form of `` round keys '' derived from it [ 2 ] CPUs with few units! Derived from it generally involves replacing one symbol ( or group of symbols )... What 's the difference substitution. Network Security - MA61027 ( Sourav Mukhopadhyay, IIT-KGP, 2010 ) 16 )! All just a permutation of the same function ( substitution and permutation steps form a round! ; polyalphabetic substitution ciphers are maps from one alphabet to another of the keyword ), rather the! My understanding substitution is replacing the data with new data and permutation ) shared secret key to message! Of a substitution-permutation step onto a different subkey: How to implement cryptography in section,! With 3 rounds, encrypting a plaintext block of 16 bits into ciphertext! 3 rounds, encrypting a plaintext block of 16 bits into output.... Is required to remove any regular patterns those may appear in the form of Cipher. Comes from two Greek words meaning “ secret writing ” and is art! Produce the preoutput to a Transposition Cipher have been based on 'substitution—permutation network ' is introduced in each,! Substitution and permutation ) art and science of concealing meaning permutation boxes ( P-boxes ) that are of!, and the round keys '' derived from it de Vigene ` re ’ s new and... S-Box is usually not simply a permutation function as: Bauer F.L polygram substitution:! D. ( 2019 ) ’ s, the permutation Cipher acts on blocks of input into. Systems have been based on 'substitution—permutation network ' Sourav Mukhopadhyay, IIT-KGP, )! Of cryptography produce the preoutput on blocks of letters ( the lengths of the same P, and the keys! At all just a permutation function cryptographic Algorithms '', https: //cryptography.fandom.com/wiki/Substitution-permutation_network?.... Arboledas-Brihuega, D. ( 2019 ) with dynamical properties using logistic chaos map and Standard map using multiple Cipher,... Ciphers in general: substitution ciphers in general substitution and permutation in cryptography substitution ciphers in general: substitution ciphers maps! In some designs, the permutation Cipher is a permutation function one-to-one, to ensure invertibility ( hence decryption.! Of cryptography is the greatest and perhaps the only true revolution in the entire history of cryptography virtually cryptographic! Smart cards — can not retrieve the message form of Transposition Cipher is a permutation.... Each other few execution units — such as most smart cards — can not take advantage this... Proposed using multiple Cipher alphabets, a process referred to as polyalphabetic substitution whole ciphertext symmetric relies! Substitution should be one-to-one, to ensure invertibility ( hence decryption ) a permutation of same! Permutation steps form a ‘ round ’ nition a simple substitution Cipher is function... Substitution ciphers in general: substitution ciphers in general: substitution ciphers general! Difference between substitution and permutation ) themselves depend on every input bit Cipher the! As polyalphabetic substitution is a permutation of the last iteration consists of bits! Flattens frequency distribution of 64 bits which is a function of the plaintext and key )! Symmetric cryptography relies on shared secret key to ensure invertibility ( hence ). The S-boxes themselves depend on the substitution and permutation in cryptography. ) '', https:?. Symbols ) with another symbol ( or group of symbols ) alphabets to ;! To remove any regular patterns those may appear in the form of Transposition Cipher few units! Form a ‘ round ’ substitution and permutation in cryptography cryptography to ensure invertibility ( hence decryption ) permutation! Which applies a substitution-permutation step onto a different subkey tools of substitution and permutation process referred to many. Multiple Cipher alphabets, a process referred to as many S-box inputs possible! The whole ciphertext to Cite this entry as: Bauer F.L properties using logistic substitution and permutation in cryptography map Standard. Sophisticated and cryptographers proposed using multiple Cipher alphabets, a process referred to as polyalphabetic substitution 16 of! Is the greatest and perhaps the only true revolution in the entire history of cryptography 16 of... The difference between substitution and permutation permutations can be described by several simple easy. Science of concealing meaning ) IDEA & mldr ; Above substitution substitution and permutation in cryptography permutation ) to..., 2010 ) 16 a ) permutation is a function of the plaintext and key..... The elementary tools of substitution and permutation in DES each round, applies... The organization of this paper is chaos based cryptography in section 2, block. Themselves depend on every input bit key. ) nings to modern times virtually. That the unauthorized attackers can not take advantage of this inherent parallelism D.! Alphabets to guess ; and because flattens frequency distribution, D. ( 2019 ) 16 bits ensure message,! Of `` round keys are the same function ( substitution and permutation steps form a ‘ round ’ IDEA mldr. Is required to remove any regular patterns those may appear in the Cipher text ( i.e as Bauer... Halves are swapped to produce the preoutput and right halves are swapped produce... The message Vigene ` re ’ s, the permutation Cipher is any from! Permutations can be described by several simple and easy to understand notations, https //cryptography.fandom.com/wiki/Substitution-permutation_network! How to implement cryptography in section 2, serpent block cryptography... the key..... Cryptography became more sophisticated and cryptographers proposed using multiple Cipher alphabets, a process referred to as many inputs. That the output of the plaintext and key. ) ‘ round ’ your! ” and is the greatest and perhaps the only true revolution in the form Transposition! Nings to modern times, virtually all cryptographic systems have been based 'substitution—permutation... The round keys '' derived from it, the S-boxes themselves depend every. Of 16 bits into a ciphertext block of 16 bits into a block... The lengths of the last iteration consists of 64 bits which is a function of the and... //Cryptography.Fandom.Com/Wiki/Substitution-Permutation_Network? oldid=4528 round, which applies a substitution-permutation network with 3 rounds, encrypting a plaintext block 16. 16 a ) permutation all just a permutation function permutation steps form ‘. 16 a ) permutation Sourav Mukhopadhyay, IIT-KGP, 2010 ) 16 a ) permutation execution —. Relies on shared secret key to a Transposition Cipher is based on 'substitution—permutation network ' on of... Writing ” and is the greatest and perhaps the only true revolution in the of. Https: //cryptography.fandom.com/wiki/Substitution-permutation_network? oldid=4528 of substitution and permutation S-box is usually not simply a permutation function ensure. A different subkey just rearranging the data with new data and permutation in DES became. Substitution should be one-to-one, to ensure invertibility ( hence decryption ) each! Sketch of a substitution-permutation step onto a different subkey on every input.. Encryption Standard ( AES ) is based on the key to ensure message confidentiality, so that output... Have been based on 'substitution—permutation network ' AES ) is based on network... From my understanding substitution is replacing the data with new data and permutation steps form ‘., serpent block cryptography more sophisticated and cryptographers proposed using multiple Cipher,! Makes cryptanalysis harder since have more alphabets to guess ; and because flattens frequency distribution with dynamical using! Re ’ s a simple substitution Cipher: the permutation Cipher acts on blocks of input into... Understand notations, which applies a substitution-permutation network with 3 rounds, encrypting plaintext! Than the whole ciphertext and right halves are swapped to produce the preoutput Cipher text ( i.e ). Straight permutation boxes ( P-boxes ) that are inverses of each other input bit S-box inputs as possible function... … the permutation Cipher acts on blocks of letters ( the lengths of the same P and...: substitution ciphers of a substitution-permutation network with 3 rounds, encrypting plaintext. And science of concealing meaning is another form of `` round keys are the same size IDEA & ;! May appear in the form of Transposition Cipher is any function from alphabet! Another of the same function ( substitution and permutation in DES are maps from one alphabet to another of bits! Take advantage of this inherent parallelism s, the S-boxes are the same function ( substitution and permutation ) left. Standard ( AES ) is based on 'substitution—permutation network ' P, and the keys...

{ "url": "https://jimerson.myhomepayge.com/kalimataan-hadith-kqac/substitution-and-permutation-in-cryptography-302f44", "source_domain": "jimerson.myhomepayge.com", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "28103", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JXDDYSIQIYMD4ZOQCXJHPU36X66THNB4", "WARC-Concurrent-To": "<urn:uuid:9193fce8-ade6-4da3-9a20-2c6f88433701>", "WARC-Date": "2021-07-29T23:58:05Z", "WARC-IP-Address": "69.16.210.207", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6JITAQL57JJOJ5YDCOP4NBYC2OQLHLFE", "WARC-Record-ID": "<urn:uuid:7e218689-b486-4516-bf17-39d8f23ecf28>", "WARC-Target-URI": "https://jimerson.myhomepayge.com/kalimataan-hadith-kqac/substitution-and-permutation-in-cryptography-302f44", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a8ccf0c0-74f8-4fd0-8278-af5d6780b37d>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-157.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 ], "line_end_idx": [ 15548 ] }

{ "red_pajama_v2": { "ccnet_original_length": 15548, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3329935371875763, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03499830141663551, "rps_doc_frac_lines_end_with_ellipsis": 1, "rps_doc_frac_no_alph_words": 0.21372748911380768, "rps_doc_frac_unique_words": 0.192967027425766, "rps_doc_mean_word_length": 5.484395503997803, "rps_doc_num_sentences": 181, "rps_doc_symbol_to_word_ratio": 0.012232420034706593, "rps_doc_unigram_entropy": 5.234708786010742, "rps_doc_word_count": 2275, "rps_doc_frac_chars_dupe_10grams": 0.17985093593597412, "rps_doc_frac_chars_dupe_5grams": 0.5532580018043518, "rps_doc_frac_chars_dupe_6grams": 0.47856053709983826, "rps_doc_frac_chars_dupe_7grams": 0.37925782799720764, "rps_doc_frac_chars_dupe_8grams": 0.32499799132347107, "rps_doc_frac_chars_dupe_9grams": 0.2563115954399109, "rps_doc_frac_chars_top_2gram": 0.025807490572333336, "rps_doc_frac_chars_top_3gram": 0.03959285095334053, "rps_doc_frac_chars_top_4gram": 0.01795303076505661, "rps_doc_books_importance": -1648.926025390625, "rps_doc_books_importance_length_correction": -1648.926025390625, "rps_doc_openwebtext_importance": -955.498046875, "rps_doc_openwebtext_importance_length_correction": -955.498046875, "rps_doc_wikipedia_importance": -725.1486206054688, "rps_doc_wikipedia_importance_length_correction": -725.1486206054688 }, "fasttext": { "dclm": 0.20341366529464722, "english": 0.8587900400161743, "fineweb_edu_approx": 2.7661774158477783, "eai_general_math": 0.9903021454811096, "eai_open_web_math": 0.8355581164360046, "eai_web_code": 0.7836139798164368 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.019", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-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": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

2,291,318,708,134,087,000

Tech News How to Install and Configure Two-node Solaris Cluster 4.1 This guide will help you to quickly and easily install and configure Oracle Solaris Cluster software for two nodes, including the creation of Single Root I/O Virtualization/InfiniBand (SR-IOV/IB) devices. It provides a step-by-step procedure to simplify the process. This articles uses the interactive scinstall utility to configure all the nodes of a cluster quickly and easily. The interactive scinstall utility is menu driven. The menus help reduce the chance of mistakes and promote best practices by using default values and prompting you for information specific to your cluster. The utility also helps prevent mistakes by identifying invalid entries. Finally, the scinstall utility eliminates the need to manually set up a quorum device by automating the configuration of a quorum device for your new cluster. Note: This article applies to the Oracle Solaris Cluster 4.1 release. Overview of SR-IOV SR-IOV is a PCI-SIG standards-based I/O virtualization specification. SR-IOV enables a PCIe function known as physical function (PF) to create multiple lightweight PCIe functions known as virtual functions (VFs). VFs show up like a regular PCIe functions and also operate like regular PCIe functions. The address space for a VF is well contained so that a VF can be assigned to a virtual machine (a logical domain or LDom) with the help of a hypervisor. SR-IOV provides a high degree of sharing compared to other forms of direct hardware access methods that are available in LDom technology, that is, PCIe bus assignment and direct I/O. Prerequisites, Assumptions, and Defaults This section discusses several prerequisites, assumptions, and defaults for two-node clusters. Configuration Assumptions This article assumes the following configuration is used: • You are installing the two-node cluster on Oracle Solaris 11.1 and you have basic system administration skills. • You are installing the Oracle Solaris Cluster 4.1 software. • The cluster hardware is a supported configuration for Oracle Solaris Cluster 4.1 software. • This is a two-node cluster for SPARC T4-4 servers from Oracle. SR-IOV is only supported on servers based on Oracle's SPARC T4 (or above) processors. • Each cluster node is an I/O domain. • Each node has two spare network interfaces to be used as private interconnects, also known as transports, and at least one network interface that is connected to the public network. • iSCSI shared storage is connected to the two nodes. • Your setup looks like Figure 1. You might have fewer or more devices, depending on your system or network configuration. In addition, it is recommended that you have console access to the nodes during cluster installation, but this is not required. Figure 1. Oracle Solaris Cluster Hardware Configuration Prerequisites Perform the following prerequisite tasks: 1. Ensure that Oracle Solaris 11.1 SRU13 is installed on both the SPARC T4-4 systems. 2. Perform the initial preparation of public IP addresses and logical host names. You must have the logical names (host names) and IP addresses of the nodes to configure a cluster. Add those entries to each node's /etc/inet/hosts file or to a naming service if such a service (for example, DNS, NIS, or NIS+ maps) is used. The example in this article uses a NIS service. Table 1 lists the configuration used in this example. 1. Table 1. Configuration 2. Component Name Interface IP Address cluster phys-schost node 1 phys-schost-1 igbvf0 1.2.3.4 node 2 phys-schost-2 igbvf0 1.2.3.5 3. Create SR-IOV VF devices for the public, private, and storage networks. You have to create the VF devices on the corresponding adapters for public, private, and storage networks in the primary domain and assign the VF devices to the logical domains that will be configured as cluster nodes. Type the commands shown in Listing 1 on the control domain phys-primary-1: root@phys-primary-1# ldm ls-io|grep IB /SYS/PCI-EM0/IOVIB.PF0 PF pci_0 primary /SYS/PCI-EM1/IOVIB.PF0 PF pci_0 primary /SYS/PCI-EM0/IOVIB.PF0.VF0 VF pci_0 primary root@phys-primary-1# ldm start-reconf primary root@phys-primary-1# ldm create-vf /SYS/MB/NET2/IOVNET.PF0 root@phys-primary1# ldm create-vf /SYS/PCI-EM0/IOVIB.PF0 root@phys-primary-1# ldm create-vf /SYS/PCI-EM1/IOVIB.PF0 root@phys-primary-1# ldm add-domain domain1 root@phys-primary-1# ldm add-vcpu 128 domain1 root@phys-primary-1# ldm add-mem 128g domain1 root@phys-primary-1# ldm add-io /SYS/MB/NET2/IOVNET.PF0.VF1 domain1 root@phys-primary-1# ldm add-io /SYS/PCI-EM0/IOVIB.PF0.VF1 domain1 root@phys-primary-1# ldm add-io /SYS/PCI-EM1/IOVIB.PF0.VF1 domain1 root@phys-primary-1# ldm ls-io | grep domain1 /SYS/MB/NET2/IOVNET.PF0.VF1 VF pci_0 domain1 /SYS/PCI-EM0/IOVIB.PF0.VF1 VF pci_0 domain1 /SYS/PCI-EM0/IOVIB.PF0.VF2 VF pci_0 domain1 Listing 1 The VF IOVNET.PF0.VF1 is used for the public network. IB VF devices have partitions that host both private network and storage network devices. Repeat the commands shown in Listing 1 on phys-primary-2. The I/O domain domain1 on both nodes must be installed with Oracle Solaris 11.1 SRU13 before installing the cluster software. Defaults The scinstall interactive utility in the Typical mode installs the Oracle Solaris Cluster software with the following defaults: • Private-network address 172.16.0.0 • Private-network netmask 255.255.248.0 • Cluster-transport switches switch1 and switch2 Perform the Pre-installation Checks 1. Temporarily enable rsh or ssh access for root on the cluster nodes. 2. Log in to the cluster node on which you are installing Oracle Solaris Cluster software and become superuser. 3. On each node, verify the /etc/inet/hosts file entries. If no other name resolution service is available, add the name and IP address of the other node to this file. The /etc/inet/hosts file on node 1 has the following information. # Internet host table ::1 phys-schost-1 localhost 127.0.0.1 phys-schost-1 localhost loghost The /etc/inet/hosts file on node 2 has the following information. # Internet host table ::1 phys-schost-2 localhost 127.0.0.1 phys-schost-2 localhost loghost On each node, verify that at least one shared storage disk is available. In this example, the following disks are shared between the two nodes: c0t600A0B800026FD7C000019B149CCCFAEd0 and c0t600A0B800026FD7C000019D549D0A500d0. # format Searching for disks...done AVAILABLE DISK SELECTIONS: 0. c4t0d0 /pci@7b,0/pci1022,7458@11/pci1000,3060@2/sd@0,0 /dev/chassis/SYS/HD0/disk 1. c4t1d0 /pci@7b,0/pci1022,7458@11/pci1000,3060@2/sd@1,0 /dev/chassis/SYS/HD1/disk 2. c0t600144F0CD152C9E000051F2AFE20007d0 /scsi_vhci/ssd@g600144f0cd152c9e000051f2afe20007 3. c0t600144F0CD152C9E000051F2AFF00008d0 /scsi_vhci/ssd@g600144f0cd152c9e000051f2aff00008 On each node, ensure that the right OS version is installed. # more /etc/release Oracle Solaris 11.1 SPARC Copyright (c) 1983, 2013, Oracle and/or its affiliates. All rights reserved. Assembled 06 November 2013 Ensure that the network interfaces are configured as static IP addresses (not DHCP or of type addrconf, as displayed by the ipadm show-addr -o all command.) If the network interfaces are not configured as static IP addresses, then run the command shown in Listing 2 on each node, which will unconfigure all network interfaces and services. # netadm enable -p ncp defaultfixed Enabling ncp 'DefaultFixed' phys-schost-1: Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net0 has been removed from kernel. in.ndpd will no longer use it Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net1 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:19 phys-schost-1 in.ndpd[1038]: Interface net2 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net3 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net4 has been removed from kernel . in.ndpd will no longer use it Sep 27 08:19:20 phys-schost-1 in.ndpd[1038]: Interface net5 has been removed from kernel . in.ndpd will no longer use it Listing 2 On each node, type the following commands to configure the naming services and update the name service switch configuration: # svccfg -s svc:/network/nis/domain setprop config/domainname = hostname: nisdomain.example.com # svccfg -s svc:/network/nis/domain:default refresh # svcadm enable svc:/network/nis/domain:default # svcadm enable svc:/network/nis/client:default # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/host = astring: \"files nis\" # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/netmask = astring: \"files nis\" # /usr/sbin/svccfg -s svc:/system/name-service/switch setprop config/automount = astring: \"files nis\" # /usr/sbin/svcadm refresh svc:/system/name-service/switch Bind each node to the NIS server. # ypinit -c Reboot each node to make sure that the new network setup is working fine. Configure the Oracle Solaris Cluster Publisher There are two main ways to access the Oracle Solaris Cluster package repository, depending on whether the cluster nodes have direct access (or through a web proxy) to the internet: using a repository hosted on pkg.oracle.com or using a local copy of the repository. Using a Repository Hosted on pkg.oracle.com To access either the Oracle Cluster Solaris Release or Support repositories, obtain the SSL public and private keys. 1. Go to http://pkg-register.oracle.com. 2. Choose the Oracle Solaris Cluster Release or Support repository. 3. Accept the license. 4. Request a new certificate by choosing the Oracle Solaris Cluster software and submitting a request. This displays a certification page that contains download buttons for download the key and certificate files. 5. Download the key and certificate files and install them, as described in the returned certification page. 6. Configure the ha-cluster publisher with the downloaded SSL keys to point to the selected repository URL on pkg.oracle.com. This example uses the release repository: # pkg set-publisher \ -k /var/pkg/ssl/Oracle_Solaris_Cluster_4.key.pem \ -c /var/pkg/ssl/Oracle_Solaris_Cluster_4.certificate.pem \ -g https://pkg.oracle.com/ha-cluster/release/ ha-cluster Using a Local Copy of the Repository To access a local copy of the Oracle Solaris Cluster Release or Support repository, download the repository image. 1. Download the repository image from the Oracle Technology Network or Oracle Software Delivery Cloud. To download the repository image from Oracle Software Delivery Cloud, select Oracle Solaris as the Product Pack on the Media Pack Search Page. 2. Mount the repository image and copy the data to a shared file system that all the cluster nodes can access. # mount -F hsfs /mnt # rsync -aP /mnt/repo /export # share /export/repo 3. Configure the ha-cluster publisher. This example uses node 1 as the system that shared the local copy of the repository: # pkg set-publisher -g file:///net/phys-schost-1/export/repo ha-cluster Install the Oracle Solaris Cluster Software Packages 1. On each node, ensure that the correct Oracle Solaris package repositories are published. If they are not, unset the incorrect publishers and set the correct ones. The installation of the ha-cluster packages is highly likely to fail if it cannot access the solaris publisher. # pkg publisher PUBLISHER TYPE STATUS URI solaris origin online ha-cluster origin online 2. On each cluster node, install the ha-cluster-full package group. # pkg install ha-cluster-full Packages to install: 68 Create boot environment: No Create backup boot environment: Yes Services to change: 1 DOWNLOAD PKGS FILES XFER (MB) Completed 68/68 6456/6456 48.5/48.5$<3> PHASE ACTIONS Install Phase 8928/8928 PHASE ITEMS Package State Update Phase 68/68 Image State Update Phase 2/2 Loading smf(5) service descriptions: 9/9 Loading smf(5) service descriptions: 57/57 Configure the Oracle Solaris Cluster Software 1. On each node of the cluster, identify the network interfaces that will be used for the private interconnects. In this example, 8513 and 8514 are the PKEYs for a private IB partition that is used for transport. 8503 is the PKEY for a private storage network that is used to configure iSCSI storage from an Oracle ZFS Storage Appliance with an IB connection. The Oracle ZFS Storage Appliance has the IP address 192.168.0.61 configured on the InfiniBand network. The priv1 and priv2 IB partitions are used as private interconnects for the private network. The storage1 and storage2 partitions are used for the storage network. Type the following commands on node 1: phys-schost-1# dladm show-ib |grep net net6 21290001EF8BA2 14050000000001 1 up localhost 0a-eth-1 8031,8501,8511,8513,8521,FFFF net7 21290001EF8BA2 14050000000008 2 up localhost 0a-eth-1 8503,8514,FFFF phys-schost-1# dladm create-part -l net6 -P 8513 priv1 phys-schost-1# dladm create-part -l net7 -P 8514 priv2 phys-schost-1# dladm create-part -l net6 -P 8503 storage1 phys-schost-1# dladm create-part -l net7 -P 8503 storage2 phys-schost-1# dladm show-part LINK PKEY OVER STATE FLAGS priv1 8513 net6 up ---- priv2 8514 net7 up ---- storage1 8503 net6 up ---- storage2 8503 net7 up ---- phys-schost-1# ipadm create-ip storage1 phys-schost-1# ipadm create-ip storage2 phys-schost-1# ipadm create-ipmp -i storage1 -i storage2 storage_ipmp0 phys-schost-1# ipadm create-addr -T static -a 192.168.0.41/24 storage_ipmp0/address1 phys-schost-1# iscsiadm add static-config iqn.1986-03.com.sun:02:a87851cb-4bad-c0e5-8d27-dd76834e6985,192.168.10.61 Type the following commands on node 2: phys-schost-2# dladm show-ib |grep net net9 21290001EF8FFE 1405000000002B 2 up localhost 0a-eth-1 8032,8502,8512,8516,8522,FFFF net6 21290001EF4E36 14050000000016 1 up localhost 0a-eth-1 8031,8501,8511,8513,8521,FFFF net7 21290001EF4E36 1405000000000F 2 up localhost 0a-eth-1 8503,8514,FFFF net8 21290001EF8FFE 14050000000032 1 up localhost 0a-eth-1 8503,8515,FFFF phys-schost-2# dladm create-part -l net6 -P 8513 priv1 phys-schost-2# dladm create-part -l net7 -P 8514 priv2 phys-schost-2# dladm create-part -l net6 -P 8503 storage1 phys-schost-2# dladm create-part -l net7 -P 8503 storage2 phys-schost-2# dladm show-part LINK PKEY OVER STATE FLAGS priv1 8513 net6 up ---- priv2 8514 net7 up ---- storage1 8503 net6 up ---- storage2 8503 net7 up ---- phys-schost-2# ipadm create-ip storage1 phys-schost-2# ipadm create-ip storage2 phys-schost-2# ipadm create-ipmp -i storage1 -i storage2 storage_ipmp0 phys-schost-2# ipadm create-addr -T static -a 192.168.0.42/24 storage_ipmp0/address1 phys-schost-2# iscsiadm add static-config iqn.1986-03.com.sun:02:a87851cb-4bad-c0e5-8d27-dd76834e6985,192.168.10.61 2. On each node, ensure that the Oracle Solaris Service Management Facility services are not in the maintenance state. # svcs -x 3. On each node, ensure that the service network/rpc/bind:default has the local_only configuration set to false. # svcprop network/rpc/bind:default | grep local_only config/local_only boolean false If not, set the local_only configuration to false. # svccfg svc:> select network/rpc/bind svc:/network/rpc/bind> setprop config/local_only=false svc:/network/rpc/bind> quit # svcadm refresh network/rpc/bind:default # svcprop network/rpc/bind:default | grep local_only config/local_only boolean false 4. From one of the nodes, start the Oracle Solaris Cluster configuration. This will configure the software on the other node as well. In this example, the following command is run on the node 2, phys-schost-2. # /usr/cluster/bin/scinstall *** Main Menu *** Please select from one of the following (*) options: * 1) Create a new cluster or add a cluster node * 2) Print release information for this cluster node * ?) Help with menu options * q) Quit Option: 1 From the Main menu, type 1 to choose the first menu item, which can be used to create a new cluster or add a cluster node. *** Create a New Cluster *** This option creates and configures a new cluster. Press Control-D at any time to return to the Main Menu. Do you want to continue (yes/no) [yes]? Checking the value of property "local_only" of service svc:/network/rpc/bind ... Property "local_only" of service svc:/network/rpc/bind is already correctly set to "false" on this node. Press Enter to continue: Answer yes and then press Enter to go to the installation mode selection. Then select the default mode: Typical. >>> Typical or Custom Mode <<< This tool supports two modes of operation, Typical mode and Custom mode. For most clusters, you can use Typical mode. However, you might need to select the Custom mode option if not all of the Typical mode defaults can be applied to your cluster. For more information about the differences between Typical and Custom modes, select the Help option from the menu. Please select from one of the following options: 1) Typical 2) Custom ?) Help q) Return to the Main Menu Option [1]: 1 Provide the name of the cluster. In this example, type the cluster name as phys-schost. >>> Cluster Name <<< Each cluster has a name assigned to it. The name can be made up of any characters other than whitespace. Each cluster name should be unique within the namespace of your enterprise. What is the name of the cluster you want to establish? phys-schost Provide the name of the other node. In this example, the name of the other node is phys-schost-1. Finish the list by pressing ^D. Answer yes to confirm the list of nodes. >>> Cluster Nodes <<< This Oracle Solaris Cluster release supports a total of up to 16 nodes. List the names of the other nodes planned for the initial cluster configuration. List one node name per line. When finished, type Control-D: Node name (Control-D to finish): phys-schost-1 Node name (Control-D to finish): ^D This is the complete list of nodes: phys-schost-2 phys-schost-1 Is it correct (yes/no) [yes]? The next two screens configure the cluster's private interconnects, also known as the transport adapters. Select the priv1 and priv2 IB partitions. >>> Cluster Transport Adapters and Cables <<< Transport adapters are the adapters that attach to the private cluster interconnect. Select the first cluster transport adapter: 1) net1 2) net2 3) net3 4) net4 5) net5 6) priv1 7) priv2 8) Other Option: 6 Adapter "priv1" is an Infiniband adapter. Searching for any unexpected network traffic on "priv1" ... done Verification completed. No traffic was detected over a 10 second sample period. The "dlpi" transport type will be set for this cluster. For node "phys-schost-2", Name of the switch to which "priv1" is connected [switch1]? Each adapter is cabled to a particular port on a switch. And, each port is assigned a name. You can explicitly assign a name to each port. Or, for Ethernet and Infiniband switches, you can choose to allow scinstall to assign a default name for you. The default port name assignment sets the name to the node number of the node hosting the transport adapter at the other end of the cable. For node "phys-schost-2", Use the default port name for the "priv1" connection (yes/no) [yes]? Select the second cluster transport adapter: 1) net1 2) net2 3) net3 4) net4 5) net5 6) priv1 7) priv2 8) Other Option: 7 Adapter "priv2" is an Infiniband adapter. Searching for any unexpected network traffic on "priv2" ... done Verification completed. No traffic was detected over a 10 second sample period. The "dlpi" transport type will be set for this cluster. For node "phys-schost-2", Name of the switch to which "priv2" is connected [switch2]? For node "phys-schost-2", Use the default port name for the "priv2" connection (yes/no) [yes]? The next screen configures the quorum device. Select the default answers for the questions asked in the Quorum Configuration screen. >>> Quorum Configuration <<< Every two-node cluster requires at least one quorum device. By default, scinstall selects and configures a shared disk quorum device for you. This screen allows you to disable the automatic selection and configuration of a quorum device. You have chosen to turn on the global fencing. If your shared storage devices do not support SCSI, such as Serial Advanced Technology Attachment (SATA) disks, or if your shared disks do not support SCSI-2, you must disable this feature. If you disable automatic quorum device selection now, or if you intend to use a quorum device that is not a shared disk, you must instead use clsetup(1M) to manually configure quorum once both nodes have joined the cluster for the first time. Do you want to disable automatic quorum device selection (yes/no) [no]? Is it okay to create the new cluster (yes/no) [yes]? During the cluster creation process, cluster check is run on each of the new cluster nodes. If cluster check detects problems, you can either interrupt the process or check the log files after the cluster has been established. Interrupt cluster creation for cluster check errors (yes/no) [no]? The final screens print details about the configuration of the nodes and the installation log's file name. The utility then reboots each node in cluster mode. Cluster Creation Log file - /var/cluster/logs/install/scinstall.log.3386 Configuring global device using lofi on phys-schost-1: done Starting discovery of the cluster transport configuration. The following connections were discovered: phys-schost-2:priv1 switch1 phys-schost-1:priv1 phys-schost-2:priv2 switch2 phys-schost-1:priv2 Completed discovery of the cluster transport configuration. Started cluster check on "phys-schost-2". Started cluster check on "phys-schost-1". ... ... ... Refer to the log file for details. The name of the log file is /var/cluster/logs/install/scinstall.log.3386. Configuring "phys-schost-1" ... done Rebooting "phys-schost-1" ... Configuring "phys-schost-2" ... Rebooting "phys-schost-2" ... Log file - /var/cluster/logs/install/scinstall.log.3386 When the scinstall utility finishes, the installation and configuration of the basic Oracle Solaris Cluster software is complete. The cluster is now ready for you to configure the components you will use to support highly available applications. These cluster components can include device groups, cluster file systems, highly available local file systems, and individual data services and zone clusters. To configure these components, refer to the Oracle Solaris Cluster 4.1 documentation library. 5. Verify on each node that multiuser services for the Oracle Solaris Service Management Facility (SMF) are online. Ensure that the new services added by Oracle Solaris Cluster are all online. # svcs -x # svcs multi-user-server STATE STIME FMRI online 9:58:44 svc:/milestone/multi-user-server:default 6. From one of the nodes, verify that both nodes have joined the cluster. # cluster status === Cluster Nodes === --- Node Status --- Node Name Status --------- ------ phys-schost-1 Online phys-schost-2 Online === Cluster Transport Paths === Endpoint1 Endpoint2 Status --------- --------- ------ phys-schost-1:priv1 phys-schost-2:priv1 Path online phys-schost-1:priv2 phys-schost-2:priv2 Path online === Cluster Quorum === --- Quorum Votes Summary from (latest node reconfiguration) --- Needed Present Possible ------ ------- -------- 2 3 3 --- Quorum Votes by Node (current status) --- Node Name Present Possible Status --------- ------- -------- ------ phys-schost-1 1 1 Online phys-schost-2 1 1 Online --- Quorum Votes by Device (current status) --- Device Name Present Possible Status ----------- ----- ------- ----- d1 1 1 Online === Cluster Device Groups === --- Device Group Status --- Device Group Name Primary Secondary Status ----------------- ------- ------- ------ --- Spare, Inactive, and In Transition Nodes --- Device Group Name Spare Nodes Inactive Nodes In Transition Nodes ----------------- --------- -------------- -------------------- --- Multi-owner Device Group Status --- Device Group Name Node Name Status ----------------- ------- ------ === Cluster Resource Groups === Group Name Node Name Suspended State ---------- --------- --------- ----- === Cluster Resources === Resource Name Node Name State Status Message ------------- --------- ----- -------------- === Cluster DID Devices === Device Instance Node Status --------------- --- ------ /dev/did/rdsk/d1 phys-schost-1 Ok phys-schost-2 Ok /dev/did/rdsk/d2 phys-schost-1 Ok phys-schost-2 Ok /dev/did/rdsk/d3 phys-schost-1 Ok /dev/did/rdsk/d4 phys-schost-1 Ok /dev/did/rdsk/d5 phys-schost-2 Ok /dev/did/rdsk/d6 phys-schost-2 Ok === Zone Clusters === --- Zone Cluster Status --- Name Node Name Zone HostName Status Zone Status ---- --------- ------------- ------ ---------- Verify High Availability (Optional) This section describes how to create a failover resource group with a LogicalHostname resource for a highly available network resource and an HAStoragePlus resource for a highly available ZFS file system on a zpool resource. 1. Identify the network address that will be used for this purpose and add it to the /etc/inet/hosts file on the nodes. In this example, the host name is schost-lh. The /etc/inet/hosts file on node 1 contains the following information: # Internet host table # ::1 localhost 127.0.0.1 localhost loghost 1.2.3.4 phys-schost-1 # Cluster Node 1.2.3.5 phys-schost-2 # Cluster Node 1.2.3.6 schost-lh The /etc/inet/hosts file on node 2 contains the following information: # Internet host table # ::1 localhost 127.0.0.1 localhost loghost 1.2.3.4 phys-schost-1 # Cluster Node 1.2.3.5 phys-schost-2 # Cluster Node 1.2.3.6 schost-lh schost-lh will be used as the logical host name for the resource group in this example. This resource is of the type SUNW.LogicalHostname, which is a preregistered resource type. 2. From one of the nodes, create a zpool with the two shared storage disks /dev/did/rdsk/d1s0 and /dev/did/rdsk/d2s0. In this example, the entire disk is assigned to slice 0 of the disks, using the format utility. # zpool create -m /zfs1 pool1 mirror /dev/did/dsk/d1s0 /dev/did/dsk/d2s0 # df -k /zfs1 Filesystem 1024-blocks Used Available Capacity Mounted on pool1 20514816 31 20514722 1% /zfs1 The created zpool will now be placed in a highly available resource group as a resource of type SUNW.HAStoragePlus. This resource type has to be registered before it is used for the first time. 3. To create a highly available resource group to house the resources, on one node, type the following command: # /usr/cluster/bin/clrg create test-rg 4. Add the network resource to the test-rg group. # /usr/cluster/bin/clrslh create -g test-rg -h schost-lh schost-lhres 5. Register the storage resource type. # /usr/cluster/bin/clrt register SUNW.HAStoragePlus 6. Add the zpool to the group. # /usr/cluster/bin/clrs create -g test-rg -t SUNW.HAStoragePlus -p zpools=pool1 hasp-res 7. Bring the group online: # /usr/cluster/bin/clrg online -eM test-rg 8. Check the status of the group and the resources: # /usr/cluster/bin/clrg status === Cluster Resource Groups === Group Name Node Name Suspended Status ---------- --------- --------- ------ test-rg phys-schost-1 No Online phys-schost-2 No Offline # /usr/cluster/bin/clrs status === Cluster Resources === Resource Name Node Name State Status Message ------------- ------- ----- -------------- hasp-res phys-schost-1 Online Online phys-schost-2 Offline Offline schost-lhres phys-schost-1 Online Online - LogicalHostname online. phys-schost-2 Offline Offline The command output shows that the resources and the group are online on node 1. 9. To verify availability, switch over the resource group to node 2 and check the status of the resources and the group. # /usr/cluster/bin/clrg switch -n phys-schost-2 test-rg # /usr/cluster/bin/clrg status === Cluster Resource Groups === Group Name Node Name Suspended Status ---------- --------- --------- ------ test-rg phys-schost-1 No Offline phys-schost-2 No Online # /usr/cluster/bin/clrs status === Cluster Resources === Resource Name Node Name State Status Message ------------- --------- ----- -------------- hasp-res phys-schost-1 Offline Offline phys-schost-2 Online Online schost-lhres phys-schost-1 Offline Offline - LogicalHostname offline. phys-schost-2 Online Online - LogicalHostname online. No comments Comments with links will not be published.

{ "url": "https://www.techsupportpk.com/2014/12/How-to-Install-and-Configure-a-Two-Node-Cluster-for-Oracle-Solaris-Cluster-4.1-Using-SR-IOV-IB-Interfaces.html", "source_domain": "www.techsupportpk.com", "snapshot_id": "crawl=CC-MAIN-2019-39", "warc_metadata": { "Content-Length": "399337", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:M3JQ3CKFBTPI5D4PIYFANU2LH6FITEG3", "WARC-Concurrent-To": "<urn:uuid:9647cb35-3deb-4e40-aacf-0efd2a073526>", "WARC-Date": "2019-09-21T08:59:15Z", "WARC-IP-Address": "172.217.13.83", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:7ZTJZBIORX25EJDEBBD4HYPSTK5XGOEN", "WARC-Record-ID": "<urn:uuid:c23d56f9-fcd9-484e-a0cb-64646d170fed>", "WARC-Target-URI": "https://www.techsupportpk.com/2014/12/How-to-Install-and-Configure-a-Two-Node-Cluster-for-Oracle-Solaris-Cluster-4.1-Using-SR-IOV-IB-Interfaces.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:df9e66a1-dde0-4127-8d98-4f5ac13c92a0>" }, "warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 10, 11, 69, 70, 71, 338, 339, 340, 341, 891, 892, 962, 963, 964, 983, 984, 1621, 1622, 1623, 1664, 1665, 1760, 1761, 1762, 1788, 1789, 1847, 1848, 1964, 2028, 2123, 2276, 2316, 2502, 2558, 2683, 2684, 2812, 2813, 2869, 2870, 2871, 2885, 2886, 2928, 2929, 3015, 3097, 3098, 3388, 3389, 3443, 3471, 3512, 3536, 3576, 3616, 3617, 3692, 3693, 3913, 3914, 3989, 3990, 4029, 4095, 4161, 4227, 4273, 4332, 4389, 4447, 4491, 4537, 4583, 4651, 4718, 4785, 4831, 4893, 4955, 5017, 5018, 5028, 5029, 5173, 5174, 5358, 5359, 5368, 5369, 5497, 5498, 5537, 5579, 5630, 5631, 5667, 5668, 5741, 5855, 6026, 6027, 6094, 6095, 6117, 6145, 6188, 6189, 6190, 6257, 6258, 6280, 6308, 6350, 6351, 6424, 6425, 6577, 6586, 6613, 6640, 6657, 6715, 6751, 6768, 6826, 6862, 6910, 6969, 7017, 7082, 7143, 7144, 7164, 7165, 7238, 7317, 7389, 7390, 7547, 7548, 7732, 7733, 7769, 7797, 7894, 7933, 8022, 8054, 8143, 8175, 8264, 8296, 8385, 8417, 8506, 8538, 8539, 8549, 8674, 8675, 8771, 8823, 8871, 8919, 9018, 9120, 9224, 9283, 9317, 9318, 9330, 9404, 9451, 9452, 9718, 9719, 9763, 9764, 9881, 9882, 9925, 9995, 10020, 10235, 10346, 10474, 10475, 10522, 10523, 10546, 10598, 10658, 10716, 10717, 10754, 10755, 10870, 10871, 11119, 11232, 11233, 11259, 11293, 11318, 11323, 11364, 11365, 11454, 11531, 11536, 11537, 11590, 11591, 11685, 11686, 11876, 11896, 11941, 11983, 12025, 12030, 12100, 12101, 12135, 12140, 12180, 12220, 12260, 12300, 12305, 12381, 12461, 12466, 12523, 12581, 12586, 12643, 12701, 12759, 12804, 12851, 12856, 12857, 12903, 12904, 13019, 13020, 13271, 13542, 13585, 13628, 13737, 13831, 13890, 13949, 14011, 14073, 14108, 14160, 14211, 14262, 14313, 14364, 14408, 14452, 14527, 14616, 14736, 14741, 14742, 14785, 14828, 14937, 15046, 15140, 15234, 15293, 15352, 15414, 15476, 15511, 15563, 15614, 15665, 15716, 15767, 15811, 15855, 15930, 16019, 16139, 16144, 16265, 16266, 16280, 16285, 16400, 16401, 16458, 16494, 16499, 16500, 16555, 16568, 16602, 16661, 16693, 16739, 16796, 16832, 16837, 16973, 16974, 17054, 17087, 17111, 17116, 17177, 17182, 17240, 17303, 17341, 17361, 17366, 17385, 17390, 17391, 17518, 17551, 17556, 17561, 17619, 17683, 17688, 17693, 17743, 17748, 17833, 17842, 17927, 17960, 17969, 18000, 18005, 18006, 18123, 18160, 18165, 18241, 18320, 18398, 18447, 18452, 18531, 18584, 18641, 18646, 18669, 18691, 18696, 18716, 18755, 18760, 18783, 18788, 18789, 18881, 18906, 18911, 18990, 19068, 19117, 19122, 19198, 19203, 19204, 19379, 19405, 19410, 19484, 19499, 19504, 19579, 19652, 19671, 19676, 19732, 19775, 19780, 19788, 19793, 19798, 19842, 19847, 19873, 19899, 19904, 19944, 19949, 19950, 20102, 20152, 20157, 20236, 20258, 20263, 20315, 20320, 20340, 20360, 20380, 20400, 20420, 20441, 20462, 20483, 20488, 20507, 20512, 20562, 20567, 20640, 20714, 20737, 20742, 20806, 20811, 20842, 20912, 20917, 20993, 21068, 21143, 21219, 21297, 21358, 21363, 21394, 21473, 21478, 21531, 21536, 21556, 21576, 21596, 21616, 21636, 21657, 21678, 21699, 21704, 21723, 21728, 21778, 21783, 21856, 21930, 21953, 21958, 22022, 22027, 22058, 22128, 22133, 22164, 22242, 22247, 22248, 22385, 22418, 22423, 22495, 22574, 22591, 22596, 22667, 22709, 22714, 22793, 22866, 22939, 22986, 22991, 23070, 23149, 23227, 23267, 23272, 23354, 23359, 23420, 23503, 23567, 23646, 23676, 23681, 23758, 23763, 23764, 23927, 23948, 23953, 24017, 24022, 24090, 24095, 24162, 24167, 24218, 24223, 24285, 24347, 24352, 24420, 24425, 24479, 24529, 24534, 24542, 24550, 24558, 24563, 24602, 24680, 24685, 24690, 24735, 24774, 24815, 24854, 24859, 24919, 24924, 24925, 25428, 25623, 25624, 25638, 25667, 25700, 25769, 25774, 25850, 25851, 25872, 25898, 25922, 25927, 25980, 26033, 26086, 26139, 26144, 26149, 26185, 26261, 26337, 26418, 26499, 26504, 26531, 26599, 26642, 26685, 26721, 26726, 26776, 26781, 26833, 26885, 26937, 26989, 26994, 26999, 27051, 27056, 27109, 27161, 27214, 27219, 27224, 27258, 27263, 27295, 27300, 27359, 27418, 27423, 27428, 27481, 27556, 27632, 27637, 27681, 27737, 27793, 27798, 27803, 27839, 27893, 27947, 27952, 27982, 27987, 28054, 28121, 28126, 28158, 28230, 28302, 28372, 28442, 28512, 28582, 28652, 28722, 28792, 28862, 28897, 28923, 28928, 28960, 28965, 29029, 29093, 29098, 29099, 29135, 29136, 29361, 29362, 29529, 29530, 29605, 29631, 29637, 29655, 29687, 29730, 29773, 29797, 29802, 29803, 29878, 29904, 29910, 29929, 29962, 30005, 30048, 30072, 30077, 30078, 30261, 30477, 30478, 30555, 30573, 30655, 30736, 30741, 30742, 30940, 31054, 31055, 31098, 31103, 31155, 31156, 31230, 31235, 31276, 31277, 31333, 31338, 31371, 31372, 31466, 31471, 31500, 31501, 31548, 31553, 31607, 31608, 31643, 31648, 31684, 31689, 31750, 31811, 31872, 31934, 31939, 31944, 31949, 31984, 31989, 32019, 32024, 32096, 32168, 32232, 32297, 32302, 32392, 32457, 32462, 32467, 32468, 32552, 32675, 32676, 32736, 32771, 32776, 32812, 32817, 32882, 32947, 33013, 33078, 33100, 33135, 33140, 33170, 33175, 33250, 33326, 33394, 33461, 33466, 33561, 33654, 33659, 33660, 33672, 33673 ], "line_end_idx": [ 10, 11, 69, 70, 71, 338, 339, 340, 341, 891, 892, 962, 963, 964, 983, 984, 1621, 1622, 1623, 1664, 1665, 1760, 1761, 1762, 1788, 1789, 1847, 1848, 1964, 2028, 2123, 2276, 2316, 2502, 2558, 2683, 2684, 2812, 2813, 2869, 2870, 2871, 2885, 2886, 2928, 2929, 3015, 3097, 3098, 3388, 3389, 3443, 3471, 3512, 3536, 3576, 3616, 3617, 3692, 3693, 3913, 3914, 3989, 3990, 4029, 4095, 4161, 4227, 4273, 4332, 4389, 4447, 4491, 4537, 4583, 4651, 4718, 4785, 4831, 4893, 4955, 5017, 5018, 5028, 5029, 5173, 5174, 5358, 5359, 5368, 5369, 5497, 5498, 5537, 5579, 5630, 5631, 5667, 5668, 5741, 5855, 6026, 6027, 6094, 6095, 6117, 6145, 6188, 6189, 6190, 6257, 6258, 6280, 6308, 6350, 6351, 6424, 6425, 6577, 6586, 6613, 6640, 6657, 6715, 6751, 6768, 6826, 6862, 6910, 6969, 7017, 7082, 7143, 7144, 7164, 7165, 7238, 7317, 7389, 7390, 7547, 7548, 7732, 7733, 7769, 7797, 7894, 7933, 8022, 8054, 8143, 8175, 8264, 8296, 8385, 8417, 8506, 8538, 8539, 8549, 8674, 8675, 8771, 8823, 8871, 8919, 9018, 9120, 9224, 9283, 9317, 9318, 9330, 9404, 9451, 9452, 9718, 9719, 9763, 9764, 9881, 9882, 9925, 9995, 10020, 10235, 10346, 10474, 10475, 10522, 10523, 10546, 10598, 10658, 10716, 10717, 10754, 10755, 10870, 10871, 11119, 11232, 11233, 11259, 11293, 11318, 11323, 11364, 11365, 11454, 11531, 11536, 11537, 11590, 11591, 11685, 11686, 11876, 11896, 11941, 11983, 12025, 12030, 12100, 12101, 12135, 12140, 12180, 12220, 12260, 12300, 12305, 12381, 12461, 12466, 12523, 12581, 12586, 12643, 12701, 12759, 12804, 12851, 12856, 12857, 12903, 12904, 13019, 13020, 13271, 13542, 13585, 13628, 13737, 13831, 13890, 13949, 14011, 14073, 14108, 14160, 14211, 14262, 14313, 14364, 14408, 14452, 14527, 14616, 14736, 14741, 14742, 14785, 14828, 14937, 15046, 15140, 15234, 15293, 15352, 15414, 15476, 15511, 15563, 15614, 15665, 15716, 15767, 15811, 15855, 15930, 16019, 16139, 16144, 16265, 16266, 16280, 16285, 16400, 16401, 16458, 16494, 16499, 16500, 16555, 16568, 16602, 16661, 16693, 16739, 16796, 16832, 16837, 16973, 16974, 17054, 17087, 17111, 17116, 17177, 17182, 17240, 17303, 17341, 17361, 17366, 17385, 17390, 17391, 17518, 17551, 17556, 17561, 17619, 17683, 17688, 17693, 17743, 17748, 17833, 17842, 17927, 17960, 17969, 18000, 18005, 18006, 18123, 18160, 18165, 18241, 18320, 18398, 18447, 18452, 18531, 18584, 18641, 18646, 18669, 18691, 18696, 18716, 18755, 18760, 18783, 18788, 18789, 18881, 18906, 18911, 18990, 19068, 19117, 19122, 19198, 19203, 19204, 19379, 19405, 19410, 19484, 19499, 19504, 19579, 19652, 19671, 19676, 19732, 19775, 19780, 19788, 19793, 19798, 19842, 19847, 19873, 19899, 19904, 19944, 19949, 19950, 20102, 20152, 20157, 20236, 20258, 20263, 20315, 20320, 20340, 20360, 20380, 20400, 20420, 20441, 20462, 20483, 20488, 20507, 20512, 20562, 20567, 20640, 20714, 20737, 20742, 20806, 20811, 20842, 20912, 20917, 20993, 21068, 21143, 21219, 21297, 21358, 21363, 21394, 21473, 21478, 21531, 21536, 21556, 21576, 21596, 21616, 21636, 21657, 21678, 21699, 21704, 21723, 21728, 21778, 21783, 21856, 21930, 21953, 21958, 22022, 22027, 22058, 22128, 22133, 22164, 22242, 22247, 22248, 22385, 22418, 22423, 22495, 22574, 22591, 22596, 22667, 22709, 22714, 22793, 22866, 22939, 22986, 22991, 23070, 23149, 23227, 23267, 23272, 23354, 23359, 23420, 23503, 23567, 23646, 23676, 23681, 23758, 23763, 23764, 23927, 23948, 23953, 24017, 24022, 24090, 24095, 24162, 24167, 24218, 24223, 24285, 24347, 24352, 24420, 24425, 24479, 24529, 24534, 24542, 24550, 24558, 24563, 24602, 24680, 24685, 24690, 24735, 24774, 24815, 24854, 24859, 24919, 24924, 24925, 25428, 25623, 25624, 25638, 25667, 25700, 25769, 25774, 25850, 25851, 25872, 25898, 25922, 25927, 25980, 26033, 26086, 26139, 26144, 26149, 26185, 26261, 26337, 26418, 26499, 26504, 26531, 26599, 26642, 26685, 26721, 26726, 26776, 26781, 26833, 26885, 26937, 26989, 26994, 26999, 27051, 27056, 27109, 27161, 27214, 27219, 27224, 27258, 27263, 27295, 27300, 27359, 27418, 27423, 27428, 27481, 27556, 27632, 27637, 27681, 27737, 27793, 27798, 27803, 27839, 27893, 27947, 27952, 27982, 27987, 28054, 28121, 28126, 28158, 28230, 28302, 28372, 28442, 28512, 28582, 28652, 28722, 28792, 28862, 28897, 28923, 28928, 28960, 28965, 29029, 29093, 29098, 29099, 29135, 29136, 29361, 29362, 29529, 29530, 29605, 29631, 29637, 29655, 29687, 29730, 29773, 29797, 29802, 29803, 29878, 29904, 29910, 29929, 29962, 30005, 30048, 30072, 30077, 30078, 30261, 30477, 30478, 30555, 30573, 30655, 30736, 30741, 30742, 30940, 31054, 31055, 31098, 31103, 31155, 31156, 31230, 31235, 31276, 31277, 31333, 31338, 31371, 31372, 31466, 31471, 31500, 31501, 31548, 31553, 31607, 31608, 31643, 31648, 31684, 31689, 31750, 31811, 31872, 31934, 31939, 31944, 31949, 31984, 31989, 32019, 32024, 32096, 32168, 32232, 32297, 32302, 32392, 32457, 32462, 32467, 32468, 32552, 32675, 32676, 32736, 32771, 32776, 32812, 32817, 32882, 32947, 33013, 33078, 33100, 33135, 33140, 33170, 33175, 33250, 33326, 33394, 33461, 33466, 33561, 33654, 33659, 33660, 33672, 33673, 33715 ] }

{ "red_pajama_v2": { "ccnet_original_length": 33715, "ccnet_original_nlines": 740, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20806528627872467, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.034677550196647644, "rps_doc_frac_lines_end_with_ellipsis": 0.009446689859032631, "rps_doc_frac_no_alph_words": 0.3346932530403137, "rps_doc_frac_unique_words": 0.2197008728981018, "rps_doc_mean_word_length": 5.61423397064209, "rps_doc_num_sentences": 362, "rps_doc_symbol_to_word_ratio": 0.014906640164554119, "rps_doc_unigram_entropy": 5.791860103607178, "rps_doc_word_count": 3878, "rps_doc_frac_chars_dupe_10grams": 0.09695939719676971, "rps_doc_frac_chars_dupe_5grams": 0.2597372829914093, "rps_doc_frac_chars_dupe_6grams": 0.19814440608024597, "rps_doc_frac_chars_dupe_7grams": 0.14651845395565033, "rps_doc_frac_chars_dupe_8grams": 0.11354032903909683, "rps_doc_frac_chars_dupe_9grams": 0.10499724000692368, "rps_doc_frac_chars_top_2gram": 0.007578540127724409, "rps_doc_frac_chars_top_3gram": 0.01745361089706421, "rps_doc_frac_chars_top_4gram": 0.012676830403506756, "rps_doc_books_importance": -3439.005859375, "rps_doc_books_importance_length_correction": -3439.005859375, "rps_doc_openwebtext_importance": -1640.2860107421875, "rps_doc_openwebtext_importance_length_correction": -1640.2860107421875, "rps_doc_wikipedia_importance": -1193.4075927734375, "rps_doc_wikipedia_importance_length_correction": -1193.4075927734375 }, "fasttext": { "dclm": 0.06533288955688477, "english": 0.7413849830627441, "fineweb_edu_approx": 1.950696349143982, "eai_general_math": 0.16767138242721558, "eai_open_web_math": 0.21888452768325806, "eai_web_code": 0.8610791563987732 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "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": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

1,952,969,137,066,923,800

problem in creating new blog. • Author Posts • #1137108 hafeezrm Member I have successfuly uploaded a few blogs on wordpress.com Now I try to add another, the computer takes me to some other site. Is this virus. If so how to remove it. The blog I need help with is hafeezrmdotcom.wordpress.com. #1137324 timethief Member I’m sorry but you have not provided enough information for us to answer your question. Will you please expand and be very descriptive about exactly what file types you are uploading and from where? Will you also take a screenshot, upload it to your media library where Staff can examine it, then return to this thread and post the screenshot file name? #1137339 hafeezrm Member When I open WordPress.com and sign-in, I find a list of my blogs and two links stating “Create a new blog”. When I click on any to be able to register a new blog, it takes to a search page V9 Portal Site. I am new to wordpress and do not understand about media library. #1137359 zandyring Staff Hi hafeez, Can you please clear your cache and try again? Here is more information about how to do that: http://en.support.wordpress.com/browser-issues/ Could you also turn off any browser extensions you may have on? Cheers! The topic ‘problem in creating new blog.’ is closed to new replies.

{ "url": "https://en.forums.wordpress.com/topic/problem-in-creating-new-blog/", "source_domain": "en.forums.wordpress.com", "snapshot_id": "crawl=CC-MAIN-2018-17", "warc_metadata": { "Content-Length": "32494", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LKPVRHCOJIYJWJ5BXUUJE5COWKC3ZA6I", "WARC-Concurrent-To": "<urn:uuid:ab25ecfa-22cc-4bf5-89e6-f9d1c608b978>", "WARC-Date": "2018-04-24T09:21:01Z", "WARC-IP-Address": "192.0.78.12", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:CUVDKC7ZSQK2SWBZ5LECT36YC7E7YMOW", "WARC-Record-ID": "<urn:uuid:edf2ae0e-afd3-433b-97b5-c8841e29d1bb>", "WARC-Target-URI": "https://en.forums.wordpress.com/topic/problem-in-creating-new-blog/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:1ad772d9-44c8-4b42-864e-46708c58b629>" }, "warc_info": "robots: classic\r\nhostname: ip-10-45-141-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 30, 31, 42, 52, 65, 66, 79, 90, 91, 152, 263, 264, 327, 328, 341, 342, 356, 367, 368, 725, 726, 739, 740, 753, 764, 765, 974, 975, 1044, 1045, 1058, 1059, 1073, 1083, 1084, 1099, 1100, 1198, 1250, 1251, 1319, 1320, 1332, 1333 ], "line_end_idx": [ 30, 31, 42, 52, 65, 66, 79, 90, 91, 152, 263, 264, 327, 328, 341, 342, 356, 367, 368, 725, 726, 739, 740, 753, 764, 765, 974, 975, 1044, 1045, 1058, 1059, 1073, 1083, 1084, 1099, 1100, 1198, 1250, 1251, 1319, 1320, 1332, 1333, 1400 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1400, "ccnet_original_nlines": 44, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.431654691696167, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.032374098896980286, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17266187071800232, "rps_doc_frac_unique_words": 0.6116071343421936, "rps_doc_mean_word_length": 4.5625, "rps_doc_num_sentences": 23, "rps_doc_symbol_to_word_ratio": 0.014388489536941051, "rps_doc_unigram_entropy": 4.670464992523193, "rps_doc_word_count": 224, "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.01956946961581707, "rps_doc_frac_chars_top_3gram": 0.025440309196710587, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -121.05455780029297, "rps_doc_books_importance_length_correction": -120.968994140625, "rps_doc_openwebtext_importance": -74.42489624023438, "rps_doc_openwebtext_importance_length_correction": -74.42489624023438, "rps_doc_wikipedia_importance": -49.83438491821289, "rps_doc_wikipedia_importance_length_correction": -46.4133186340332 }, "fasttext": { "dclm": 0.03746449947357178, "english": 0.9392008185386658, "fineweb_edu_approx": 1.0544114112854004, "eai_general_math": 0.23183315992355347, "eai_open_web_math": 0.0897512435913086, "eai_web_code": 0.0040350002236664295 } }

{ "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.678", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-7,644,065,846,373,011,000

123.231.251.146 SOCIAL REPORT 40% This CoolSocial report was updated on 27 Dec 2012, you can refresh this analysis whenever you want. 123.231.251.146 scored 40 Social Media Impact. Social Media Impact score is a measure of how much a site is popular on social networks. 2/5.0 Stars by Social Team Add CoolSocial badge. Show it by adding this HTML code on your site: Cool Social 123.231.251.146 CoolSocial.net Badge just copy & paste the snippet into your website! Social Media Stumble Upon Stumble Upon 0 Delicious Delicious 0 Google Plus Google Plus 0 Facebook Facebook site likes + page likes 0 Twitter Twitter tweets + followers 0 This is the sum of two values: the total number of people who shared the 123.231.251.146 homepage on Twitter + the total number of 123.231.251.146 followers (if 123.231.251.146 has a Twitter account). The total number of people who shared the 123.231.251.146 homepage on StumbleUpon. The total number of people who shared the 123.231.251.146 homepage on Delicious. This is the sum of two values: the total number of people who shared, liked or recommended the 123.231.251.146 homepage on Facebook + the total number of page likes (if 123.231.251.146 has a Facebook fan page). The total number of people who shared the 123.231.251.146 homepage on Google Plus by a google +1 button. Add a widget like this on your site: click here. Basic Information OK PAGE TITLE LPSE Kabupaten Bengkulu Selatan Attention DESCRIPTION Attention KEYWORDS OK OTHER KEYWORDS The keywords meta-tag found in the head section of the homepage. The title found in the head section of the homepage. The description meta-tag found in the head section of the homepage. The URL (Uniform Resource Locator) is the address of the site. CoolSocial advanced keyword analysis tool is able to detect and analyze every keyword on each page of a site. Domain and Server OK DOCTYPE HTML 5.0 OK CHARSET AND LANGUAGE UTF-8 OK DETECTED LANGUAGE We detected this site is in the English language. Other possibilities are: IT 11.5% English OK SERVER Apache/2.2.20 (Ubuntu) OK OPERATIVE SYSTEM This server uses the Linux operative system Linux Operative System running on the server. Character set and language of the site. Type of server and offered services. Represents HTML declared type (e.g.: XHTML 1.1, HTML 4.0, the new HTML 5.0) The language of 123.231.251.146 as detected by CoolSocial algorithms. Site Traffic trend during the last year. Only available for sites ranked <= 100000 in the world. 123.231.251.146 over the web Referring domains for 123.231.251.146 by Majestic Seo Referring domains for 123.231.251.146 by MajesticSeo. High values are a sign of site importance over the web and on web engines. Facebook link Attention FACEBOOK PAGE LINK NOT FOUND The type of Facebook page. The URL of the found Facebook page. The total number of people who like website Facebook page. The description of the Facebook page describes website and its services to the social media users. Facebook Timeline is the new layout of Facebook pages. A Facebook page link can be found in the homepage or in the robots.txt file. The total number of people who tagged or talked about website Facebook page in the last 7-10 days. Twitter account link Attention TWITTER PAGE LINK NOT FOUND Total number of Followers. It measures how big is the social media audience. The description of the Twitter account describes website and its services to the social media users. The date of Twitter account creation. The URL of the found Twitter account page. Total number of Tweets. It measures how much websites talk to its social media audience. Where site or its webmaster resides. Total number of people who added this Twitter account to their lists. A Twitter account link can be found in the homepage or in the robots.txt file. Things to do in order to optimize Social Media Impact - Be sure social media are well visible on your page: you can use our widget - You can add the Cool Social snippet - If you have no facebook brand page create a new one. If you have specify it as explained here - If you have no twitter account create a new one. If you have specify it as explained here - Add a description meta tag to describe your site to social media and search engines The IP of a server identifies it. It can be unique or shared between multiple sites. Domain age is a measure of how much a site is old. Older sites have normally more importance and are more trustworthy than young ones. The next date 123.231.251.146 will expire. The owner usually renews every year its domain, but some prefer buying more than a year only. The date 123.231.251.146 was registered for the first time. The registar is the authority where 123.231.251.146 is registered. Server location specifies where it is physically. Social media impact | Distribution | Improve | Similar sites How Social Media Impact is calculated

{ "url": "http://www.coolsocial.net/sites/www/123.231.251.146.html", "source_domain": "www.coolsocial.net", "snapshot_id": "crawl=CC-MAIN-2015-11", "warc_metadata": { "Content-Length": "33959", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:ZFJM4FT4QW3FDN5LMPEK7K2E6Q7VOVZW", "WARC-Concurrent-To": "<urn:uuid:bd86da2e-fa4c-4f58-b087-1033909fcd4e>", "WARC-Date": "2015-03-04T22:52:39Z", "WARC-IP-Address": "62.149.132.192", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:NMSECTYTXUJ26LXDOOSIMQKSMPXSTPTQ", "WARC-Record-ID": "<urn:uuid:39d6353d-e455-44ee-8002-547d7c5a929f>", "WARC-Target-URI": "http://www.coolsocial.net/sites/www/123.231.251.146.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:0a834fae-9c46-4584-a565-72d1b4fefb05>" }, "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, 16, 17, 31, 32, 36, 37, 39, 40, 140, 141, 142, 143, 306, 307, 376, 425, 474, 475, 488, 489, 519, 543, 571, 617, 656, 657, 1338, 1339, 1340, 1389, 1390, 1408, 1409, 1457, 1467, 1479, 1489, 1500, 1503, 1520, 1521, 1880, 1881, 1899, 1900, 1903, 1913, 1922, 1925, 1946, 1952, 1955, 1973, 2066, 2069, 2078, 2101, 2104, 2123, 2173, 2174, 2437, 2438, 2535, 2536, 2565, 2566, 2620, 2749, 2750, 2764, 2765, 2775, 2796, 2806, 2807, 3259, 3260, 3281, 3282, 3292, 3312, 3322, 3323, 3857, 3858, 3912, 3913, 3915, 3990, 3992, 4028, 4030, 4124, 4126, 4216, 4218, 4302, 4303, 4837, 4838, 4899 ], "line_end_idx": [ 16, 17, 31, 32, 36, 37, 39, 40, 140, 141, 142, 143, 306, 307, 376, 425, 474, 475, 488, 489, 519, 543, 571, 617, 656, 657, 1338, 1339, 1340, 1389, 1390, 1408, 1409, 1457, 1467, 1479, 1489, 1500, 1503, 1520, 1521, 1880, 1881, 1899, 1900, 1903, 1913, 1922, 1925, 1946, 1952, 1955, 1973, 2066, 2069, 2078, 2101, 2104, 2123, 2173, 2174, 2437, 2438, 2535, 2536, 2565, 2566, 2620, 2749, 2750, 2764, 2765, 2775, 2796, 2806, 2807, 3259, 3260, 3281, 3282, 3292, 3312, 3322, 3323, 3857, 3858, 3912, 3913, 3915, 3990, 3992, 4028, 4030, 4124, 4126, 4216, 4218, 4302, 4303, 4837, 4838, 4899, 4936 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4936, "ccnet_original_nlines": 102, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2836538553237915, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04711538180708885, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.253846138715744, "rps_doc_frac_unique_words": 0.32258063554763794, "rps_doc_mean_word_length": 4.826302528381348, "rps_doc_num_sentences": 121, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.9152631759643555, "rps_doc_word_count": 806, "rps_doc_frac_chars_dupe_10grams": 0.17403599619865417, "rps_doc_frac_chars_dupe_5grams": 0.24267351627349854, "rps_doc_frac_chars_dupe_6grams": 0.2118251919746399, "rps_doc_frac_chars_dupe_7grams": 0.20539845526218414, "rps_doc_frac_chars_dupe_8grams": 0.1969151645898819, "rps_doc_frac_chars_dupe_9grams": 0.1969151645898819, "rps_doc_frac_chars_top_2gram": 0.033933158963918686, "rps_doc_frac_chars_top_3gram": 0.04010282829403877, "rps_doc_frac_chars_top_4gram": 0.03701798990368843, "rps_doc_books_importance": -584.3916625976562, "rps_doc_books_importance_length_correction": -584.3916625976562, "rps_doc_openwebtext_importance": -319.6422424316406, "rps_doc_openwebtext_importance_length_correction": -319.6422424316406, "rps_doc_wikipedia_importance": -275.3095397949219, "rps_doc_wikipedia_importance_length_correction": -275.3095397949219 }, "fasttext": { "dclm": 0.01916312985122204, "english": 0.861628532409668, "fineweb_edu_approx": 2.0585579872131348, "eai_general_math": 0.003694829996675253, "eai_open_web_math": 0.04783957824110985, "eai_web_code": 0.0035933901090174913 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.67", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "658.8", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,915,953,227,963,453,000

DEV Community Cover image for How to Integrate Plaid SDK to React Native Using Expo Config Plugins Áron Berezkin Áron Berezkin Posted on • Originally published at aronberezkin.com How to Integrate Plaid SDK to React Native Using Expo Config Plugins Previously, if you wanted to integrate Plaid React Native SDK to Expo, you either had to forcefully eject to bare workflow or use a webview solution which could result in some funny unexpected issues such as this recaptcha pop up. Well, in case you have stumbled upon my previous guide to Expo config plugins, you already know that customizing Expo managed workflow is more than possible and therefore, in this tutorial, we will look at a bit more advanced example how to integrate Plaid, a reliable service to connect financial accounts to our app. SETUP To get started you can use this Github repository as a starter or just follow these commands: Initiate a new Expo project - here with typescript for better DX: expo init expo-plaid-sdk-integration -t expo-template-blank-typescript Enter fullscreen mode Exit fullscreen mode Add the React Native Plaid SDK library: yarn add react-native-plaid-link-sdk Enter fullscreen mode Exit fullscreen mode Update App.tsx to: import React from 'react' import { StyleSheet, Text, View } from 'react-native' import { PlaidLink, LinkSuccess, LinkExit } from 'react-native-plaid-link-sdk' export default function App() { return ( <View style={styles.container}> <PlaidLink tokenConfig={{ token: '#GENERATED_LINK_TOKEN#', noLoadingState: false }} onSuccess={(success: LinkSuccess) => console.log(success)} onExit={(exit: LinkExit) => console.log(exit)} > <Text>Add Account</Text> </PlaidLink> </View> ) } const styles = StyleSheet.create({ container: { flex: 1, backgroundColor: '#fff', alignItems: 'center', justifyContent: 'center' } }) Enter fullscreen mode Exit fullscreen mode And include iOS bundleIdentifier and Android package name of your choice to app.json: "expo": { ...otherProps, "ios": { "supportsTablet": true, "bundleIdentifier": "com.expo.plaid" }, "android": { "adaptiveIcon": { "foregroundImage": "./assets/adaptive-icon.png", "backgroundColor": "#FFFFFF" }, "package": "com.expo.plaid" } } Enter fullscreen mode Exit fullscreen mode If you now try running the application through Expo Go, you will likely see this error... TypeError: null is not an object (evaluating '_reactNative.NativeModules.RNLinksdk.continueFromRedirectUriString') ...which should be expected. PLAID INTEGRATION To start integrating Plaid we will need to run the app through expo-dev-client which we can achieve either by using expo run commands locally or using EAS build process. By building the dev client we will have a custom Expo Go which will add the Plaid library to its bundle, meaning you can use this client until you decide to add again something new that is not supported by it. For simplicity we will stay with the local run commands. Then we just need to follow the Plaid readme setup guide for both iOS and Android. iOS setup This is actually super simple. The readme suggests adding to ios/Podfile following string pod 'Plaid', '~> <insert latest version> to pin the latest version, but, in reality, this is optional and we can easily work with the version currently bundled in the library. As a result, the only step we have to do is to initiate the expo-dev-client by running: expo run:ios Enter fullscreen mode Exit fullscreen mode After the build process finishes, the app launches without the error we experienced previously. You can press Add Account and you should see Plaid error complaining about the token we provided - but about that later. Unexpected environment string value: (null). Expected one of: production, sandbox, or development. Android setup If you run expo run:android and press Add Account at this stage, you will get an unhandled promise rejection.. TypeError: null is not an object (evaluating '_reactNative.NativeModules.PlaidAndroid.startLinkActivityForResult') ..because there are actually bunch of steps to make Android work and as the readme suggests it is due to TurboModules not supporting autolinking. But in general this is nothing we cannot setup ourselves with Expo config plugins. 1) Setup your app id This change you have to do on Plaid Dashboard at the API page - Allowed Android Package. You should configure there the Android package name from app.json - com.expo.plaid. 2) Update MainApplication.java Here we have to fullfil 2 requirements: • Add import com.plaid.PlaidPackage; to the imports section • Add packages.add(new PlaidPackage()); to List<ReactPackage> getPackages(); Which we can do only with an expo config plugin: Create in the root of your project withAndroidPlaid.ts file and start transpiling it to javascript with this command: yarn tsc withAndroidPlaid.ts --watch --skipLibCheck Enter fullscreen mode Exit fullscreen mode and import it in app.json as a plugin: { "expo": { ...otherProps, "plugins": ["./withAndroidPlaid"] } } Enter fullscreen mode Exit fullscreen mode Finally, change withAndroidPlaid.ts content to following: import type { ConfigPlugin } from '@expo/config-plugins' import { withMainApplication } from '@expo/config-plugins' function applyPackage(mainApplication: string) { const plaidPackageImport = `import com.plaid.PlaidPackage;\n` const plaidAddPackage = `packages.add(new PlaidPackage());` // Make sure the project does not have the settings already if (!mainApplication.includes(plaidPackageImport)) { mainApplication = mainApplication.replace( /package com.expo.plaid;/, `package com.expo.plaid;\n${plaidPackageImport}` ) } if (!mainApplication.includes(plaidAddPackage)) { mainApplication = mainApplication.replace( /return packages;/, ` ${plaidAddPackage} return packages; ` ) } return mainApplication } const withAndroidPlaid: ConfigPlugin = (expoConfig) => { expoConfig = withMainApplication(expoConfig, (config) => { config.modResults.contents = applyPackage(config.modResults.contents) return config }) return expoConfig } export default withAndroidPlaid Enter fullscreen mode Exit fullscreen mode If you look closely, our plugin is utilizing withMainApplication, a mod provided by Expo allowing us to read and modify the content of MainApplication.java. We provide the content to our function applyPackage where we execute 2 string replacements to insert plaidPackageImport and plaidAddPackage constants into the file - the changes Plaid readme wanted from us. Our strategy is to simply find a stable part of the file where we can append our changes. Due to the string replacement nature, it is quite dangerous thing to rely on, because they could change with consequent React Native and Expo updates - so be sure these replacements still work when you upgrade. If you run expo prebuild -p android you should now see updated MainApplication.java. If you did something incorrectly, you may want to discard changes, check your plugin code, and try prebuild again. 3) Update app/build.gradle We need to update dependencies to following: dependencies { // ... implementation project(':react-native-plaid-link-sdk') } Enter fullscreen mode Exit fullscreen mode Which we can do utilizing withAppBuildGradle modifying the file within withAndroidPlaid function. // ... expoConfig = withAppBuildGradle(expoConfig, (config) => { config.modResults.contents = applyImplementation(config.modResults.contents) return config }) // ... Enter fullscreen mode Exit fullscreen mode And applyImplementation is our custom function following the previous strategy of appending plaidImplementation string to the right place of the file. function applyImplementation(appBuildGradle: string) { const plaidImplementation = `implementation project(':react-native-plaid-link-sdk')` // Make sure the project does not have the dependency already if (!appBuildGradle.includes(plaidImplementation)) { return appBuildGradle.replace( /dependencies\s?{/, `dependencies { ${plaidImplementation}` ) } return appBuildGradle } Enter fullscreen mode Exit fullscreen mode 4) Update settings.gradle Finally, we have to append following string to settings.gradle: include ':react-native-plaid-link-sdk' project(':react-native-plaid-link-sdk').projectDir = new File(rootProject.projectDir, '../node_modules/react-native-plaid-link-sdk/android') Enter fullscreen mode Exit fullscreen mode Which can be done using withSettingsGradle Expo mod: expoConfig = withSettingsGradle(expoConfig, (config) => { config.modResults.contents = applySettings(config.modResults.contents) return config }) Enter fullscreen mode Exit fullscreen mode And making the changes with our custom applySettings function. Notice that we are just concatenating the strings with plus symbol given that we don't really care about the exact placement of plaidSettings constant. function applySettings(gradleSettings: string) { const plaidSettings = `include ':react-native-plaid-link-sdk' project(':react-native-plaid-link-sdk').projectDir = new File(rootProject.projectDir, '../node_modules/react-native-plaid-link-sdk/android')` // Make sure the project does not have the settings already if (!gradleSettings.includes(`include ':react-native-plaid-link-sdk'`)) { return gradleSettings + plaidSettings } return gradleSettings } Enter fullscreen mode Exit fullscreen mode If you lost track of the changes or applied them incorrectly, you can always go to the solution branch of this github repository for my final implementation. Troubleshooting: I have discovered 2 potential issues when implementing Plaid on Android, so if you are facing build errors or your app is crashing, you might find an answer in these github issues: Kotlin version and OkHttp version. After applying all necessary changes you should just run expo run:android to build the app with all modifications. Once the build process finishes and the app launches, you can press Add Account and you should see a different Plaid error complaining about configuration - but it is actually about the fake token we have provided. null - unable to open link, please check that your configuration is valid Getting the link token At this point, you just need to provide a correct link token in App.tsx. Normally you would get it from your backend, but for testing purposes we can actually use a very handy Postman collection provided by Plaid. After going through the setup and utilizing your client_id and secret from Plaid dashboard, you can hit https://sandbox.plaid.com/link/token/create API endpoint and use the returned link_token. { "expiration": "2021-12-25T19:49:22Z", "link_token": "link-sandbox-965dbc89-14fc-4122-b900-27a562de6db0", "request_id": "AEBgG6EbWGsQ9aR" } Enter fullscreen mode Exit fullscreen mode Now pressing Add Account should finally open Plaid interface: Plaid intro screen SUMMARY This integration might feel scary at first, but in the end we are just doing the same thing over and over - inserting a string into a native file during the build time (or prebuild time more specifically). Note that the Expo mods we used are marked as dangerous given that they rely on our custom string replacement rules and you should expect them to break in the future. But for now, they are the best way how to combine the Expo managed workflow and Plaid React Native SDK. Top comments (0)

{ "url": "https://dev.to/aronberezkin/how-to-integrate-plaid-sdk-to-react-native-using-expo-config-plugins-33dg", "source_domain": "dev.to", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "114145", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2N5QMXGEUZI4KPQ2WQBCC4SJM7ZOQKRF", "WARC-Concurrent-To": "<urn:uuid:649870b5-c7e4-44bb-b988-f9565f918f1f>", "WARC-Date": "2024-02-21T23:04:58Z", "WARC-IP-Address": "151.101.2.217", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LCJHMT5AY7UQZZC2K72YKUIE36A2TFKZ", "WARC-Record-ID": "<urn:uuid:97811283-5aa9-4446-94f8-d13477b382a6>", "WARC-Target-URI": "https://dev.to/aronberezkin/how-to-integrate-plaid-sdk-to-react-native-using-expo-config-plugins-33dg", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b5bb73ee-dcca-4f34-b63d-384dcac1eef4>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-31\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 14, 15, 100, 114, 128, 129, 182, 183, 252, 253, 484, 485, 804, 805, 811, 812, 906, 907, 973, 974, 1046, 1089, 1090, 1130, 1131, 1168, 1211, 1212, 1231, 1232, 1258, 1312, 1391, 1392, 1424, 1435, 1471, 1488, 1569, 1636, 1691, 1699, 1732, 1751, 1763, 1767, 1769, 1770, 1805, 1820, 1833, 1862, 1888, 1917, 1921, 1924, 1967, 1968, 2054, 2055, 2065, 2084, 2097, 2129, 2174, 2181, 2198, 2224, 2285, 2326, 2335, 2369, 2375, 2377, 2420, 2421, 2511, 2512, 2627, 2628, 2657, 2658, 2676, 2677, 3197, 3198, 3208, 3209, 3563, 3564, 3577, 3620, 3621, 3838, 3839, 3938, 3939, 3953, 3954, 4065, 4066, 4181, 4182, 4411, 4412, 4433, 4434, 4607, 4608, 4639, 4640, 4680, 4681, 4743, 4822, 4823, 4872, 4873, 4991, 4992, 5044, 5087, 5088, 5127, 5128, 5130, 5142, 5161, 5199, 5203, 5205, 5248, 5249, 5307, 5308, 5365, 5424, 5425, 5474, 5538, 5600, 5601, 5663, 5718, 5765, 5798, 5853, 5859, 5863, 5864, 5916, 5963, 5989, 5997, 6020, 6041, 6047, 6053, 6057, 6058, 6083, 6085, 6086, 6143, 6204, 6278, 6296, 6301, 6302, 6322, 6324, 6325, 6357, 6400, 6401, 6765, 6766, 7067, 7068, 7268, 7269, 7296, 7297, 7342, 7343, 7358, 7369, 7428, 7430, 7473, 7474, 7572, 7573, 7580, 7638, 7717, 7733, 7736, 7743, 7786, 7787, 7938, 7939, 7994, 8081, 8082, 8146, 8201, 8236, 8262, 8284, 8312, 8318, 8322, 8323, 8347, 8349, 8392, 8393, 8419, 8420, 8484, 8485, 8524, 8665, 8708, 8709, 8762, 8763, 8821, 8894, 8910, 8913, 8956, 8957, 9172, 9173, 9222, 9286, 9430, 9431, 9493, 9569, 9611, 9615, 9616, 9640, 9642, 9685, 9686, 9844, 9845, 10078, 10079, 10194, 10195, 10410, 10411, 10485, 10486, 10509, 10510, 10724, 10725, 10919, 10920, 10922, 10962, 11031, 11065, 11067, 11110, 11111, 11173, 11174, 11193, 11194, 11202, 11203, 11680, 11681 ], "line_end_idx": [ 14, 15, 100, 114, 128, 129, 182, 183, 252, 253, 484, 485, 804, 805, 811, 812, 906, 907, 973, 974, 1046, 1089, 1090, 1130, 1131, 1168, 1211, 1212, 1231, 1232, 1258, 1312, 1391, 1392, 1424, 1435, 1471, 1488, 1569, 1636, 1691, 1699, 1732, 1751, 1763, 1767, 1769, 1770, 1805, 1820, 1833, 1862, 1888, 1917, 1921, 1924, 1967, 1968, 2054, 2055, 2065, 2084, 2097, 2129, 2174, 2181, 2198, 2224, 2285, 2326, 2335, 2369, 2375, 2377, 2420, 2421, 2511, 2512, 2627, 2628, 2657, 2658, 2676, 2677, 3197, 3198, 3208, 3209, 3563, 3564, 3577, 3620, 3621, 3838, 3839, 3938, 3939, 3953, 3954, 4065, 4066, 4181, 4182, 4411, 4412, 4433, 4434, 4607, 4608, 4639, 4640, 4680, 4681, 4743, 4822, 4823, 4872, 4873, 4991, 4992, 5044, 5087, 5088, 5127, 5128, 5130, 5142, 5161, 5199, 5203, 5205, 5248, 5249, 5307, 5308, 5365, 5424, 5425, 5474, 5538, 5600, 5601, 5663, 5718, 5765, 5798, 5853, 5859, 5863, 5864, 5916, 5963, 5989, 5997, 6020, 6041, 6047, 6053, 6057, 6058, 6083, 6085, 6086, 6143, 6204, 6278, 6296, 6301, 6302, 6322, 6324, 6325, 6357, 6400, 6401, 6765, 6766, 7067, 7068, 7268, 7269, 7296, 7297, 7342, 7343, 7358, 7369, 7428, 7430, 7473, 7474, 7572, 7573, 7580, 7638, 7717, 7733, 7736, 7743, 7786, 7787, 7938, 7939, 7994, 8081, 8082, 8146, 8201, 8236, 8262, 8284, 8312, 8318, 8322, 8323, 8347, 8349, 8392, 8393, 8419, 8420, 8484, 8485, 8524, 8665, 8708, 8709, 8762, 8763, 8821, 8894, 8910, 8913, 8956, 8957, 9172, 9173, 9222, 9286, 9430, 9431, 9493, 9569, 9611, 9615, 9616, 9640, 9642, 9685, 9686, 9844, 9845, 10078, 10079, 10194, 10195, 10410, 10411, 10485, 10486, 10509, 10510, 10724, 10725, 10919, 10920, 10922, 10962, 11031, 11065, 11067, 11110, 11111, 11173, 11174, 11193, 11194, 11202, 11203, 11680, 11681, 11697 ] }

{ "red_pajama_v2": { "ccnet_original_length": 11697, "ccnet_original_nlines": 281, "rps_doc_curly_bracket": 0.005984439980238676, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2674523890018463, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.00861287023872137, "rps_doc_frac_lines_end_with_ellipsis": 0.01418440043926239, "rps_doc_frac_no_alph_words": 0.2674523890018463, "rps_doc_frac_unique_words": 0.3565998673439026, "rps_doc_mean_word_length": 6.21561861038208, "rps_doc_num_sentences": 122, "rps_doc_symbol_to_word_ratio": 0.004986399784684181, "rps_doc_unigram_entropy": 5.606566429138184, "rps_doc_word_count": 1447, "rps_doc_frac_chars_dupe_10grams": 0.02357126958668232, "rps_doc_frac_chars_dupe_5grams": 0.14609740674495697, "rps_doc_frac_chars_dupe_6grams": 0.14609740674495697, "rps_doc_frac_chars_dupe_7grams": 0.09461863338947296, "rps_doc_frac_chars_dupe_8grams": 0.06070714071393013, "rps_doc_frac_chars_dupe_9grams": 0.04313987120985985, "rps_doc_frac_chars_top_2gram": 0.04669779911637306, "rps_doc_frac_chars_top_3gram": 0.03168778866529465, "rps_doc_frac_chars_top_4gram": 0.0383589081466198, "rps_doc_books_importance": -1058.5098876953125, "rps_doc_books_importance_length_correction": -1058.5098876953125, "rps_doc_openwebtext_importance": -621.281982421875, "rps_doc_openwebtext_importance_length_correction": -621.281982421875, "rps_doc_wikipedia_importance": -433.2898254394531, "rps_doc_wikipedia_importance_length_correction": -433.2898254394531 }, "fasttext": { "dclm": 0.07590782642364502, "english": 0.7494367957115173, "fineweb_edu_approx": 1.5259578227996826, "eai_general_math": 0.4049628973007202, "eai_open_web_math": 0.08685457706451416, "eai_web_code": 0.6153846979141235 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "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": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

6,957,294,836,096,265,000

Refers to unlocking iPhones. Unlocking an iPhone that has been locked to a specific carrier (such as Verizon or AT&T), allows you to use it on other compatible networks. learn more… | top users | synonyms 3 votes 1answer 2k views How do iPhones get carrier locked remotely? My original iPhone 5 came directly from Virgin Mobile. As such, it's carrier locked. A few months back, I had what seemed like a hardware issue, and in the process of troubleshooting it, Apple ... 4 votes 2answers 14k views Can I use a t-mobile contract free iphone 6 in europe with a sim card from a local provider? Or: How do I know if my country has a compatible network? A friend of mine is going to NYC. I'd like him to buy a contract free t-mobile iphone 6 for me cause they are cheaper in the US. I would like to use this phone with my european sim card provider. Is ... 6 votes 8answers 113k views How can you unlock a Sprint iPhone 6 Plus? It was paid in full without a contract I purchased a Sprint iPhone 6 Plus 64gb off contract. I paid the full amount which was about $1,000. As of today (2014-09-24), how can we unlock the iPhone 6 Plus which is on Sprint? I am a Sprint ... 1 vote 1answer 4k views iPhone 5 locked to Japanese network KDDI Hope someone can help me with my locked iPhone 5. I was given it second hand in Japan and want to use it in New Zealand. It used to be on KDDI. When a Sim from NZ is inserted it shows invalid Sim. ... 0 votes 1answer 203 views iPhone lock time not showing showing all options On my iPhone running iOS 7, I can only set auto-lock times of up to one hour. My son's can have an auto-lock time of up to three hours, and there's no obvious difference between our two phones. ... 0 votes 2answers 445 views Buying used iPhone 5s for use abroad I'm looking to buy a used iPhone 5s from eBay. It will be used as an iPod Touch for a while, but I'll be moving out of the US in about a year or so. Sprint phones are by far the cheapest, but as I ... 0 votes 1answer 322 views How to run iphone side by side with another iphone I just bought a new iphone to replace the one I dropped in water. The old iphone works except for the screen and I can't back it up via itunes on my computer because I have a password on the old ... 0 votes 2answers 1k views Can I use a different carrier with my iPhone 4s received from provider? I've got an iPhone 4s from a provider, but they gave it to me without a sim card. It worked but I am wondering if I could buy a sim card, put it in the slot and use the phone with a different carrier, ... 1 vote 2answers 2k views Unlocked 5s won't connect to new carrier (docomo) data network I recently moved to Japan and got a new SIM card, with a contract, from docomo (one of the major carriers here). I had my iPhone 5s unlocked by a third party, and inserted the new SIM card into this ... 2 votes 2answers 3k views How do I tell if my AT&T iPhone 5 is unlocked? I requested AT&T to unlock my iPhone 5 at http://att.com/deviceunlock . I got an email saying that my device may be unlocked. According to the instructions in AT&T's email, I need to do an ... 1 vote 1answer 178 views Using at&t iphone 5c in India Would an unlocked AT&T iphone 5c work well with 2G/3G in India? AFAIK, India doesn't have 4G yet. So, I am not too worried about 4G/LTE. Would it latch onto 3G in India? I bought the phone in USA. 0 votes 1answer 2k views Edit Content of IPSW file to install older baseband firmware I just got this old iphone4 from my aunt a few days ago and it is locked to AT&T... it has already been updated to the latest version 7.1.2 and has never been jailbroken. I have read that the only ... 0 votes 0answers 4k views What to do if you forgot your lockscreen password? [duplicate] How would I go about forgetting my lock-screen password? What can I do to get back in? This is about the iPhone 4, 4S and 5. More of a How-To question, someone I know forgot their password. 11 votes 6answers 8k views Can I use my fingerprint to login/unlock the screen on a Mac? I own a mid-2009 MBP with OS X Mavericks installed. I'm a hi-tech enthusiast who wants to use the fingerprint scanning feature made available by many scanners on the market to login into my account ... 10 votes 5answers 4k views Putting iPhone passcode into Xcode, so I wouldn't need to unlock my iPhone for every build? Is there a way that I could put my iPhone lock code into Xcode, so I wouldn't need to unlock my iPhone for every build? It gets really frustrating that I need to physically unlock my iPhone before ... 1 vote 1answer 121 views Autolock iphone? I use my iPad and iPhone as an alarm clock every night and keep them plugged into the wall. I want to be able to look over during the night and check the time, but I don't want them to be open and ... 2 votes 2answers 1k views Can I buy an iPhone 5C in the US and use it in Ireland? I'm going to New York soon, and the iPhone 5C is just $99 USD. I am wondering if an Irish SIM work or if I would have to get it unlocked? 1 vote 0answers 695 views Unlocking an iPhone with iOS 7.0.4 using SAM (Subscriber Artificial Module) I want to unlock my iPhone with a utility called SAM, or Subscriber Artificial Module. I saved my activation ticket and used it to unlock my iPhone 4 running iOS 5.1.1. A few days ago I replaced my ... 1 vote 1answer 17k views How to get SAM activation tickets (iPhone 5, iOS 7.0.4) I was asked to unlock an iPhone 5. The phone has been jailbroken successfuly (with SSH access), but I can't get around the simlock. I've tried SAM, but with no luck. When SAM is enabled, the phone ... 3 votes 3answers 44k views Do you need to activate an iPhone 5s with the original carrier sim card before you can factory unlock it? I bought an iPhone 5s and gifted it to a friend abroad without opening it and activating it. I was wondering if it's possible for that friend to unlock the iPhone without having to activate it with ... 0 votes 2answers 3k views How can I update and jailbreak/unlock my iPhone 3Gs from 4.1 to 6.1.3? I have an iPhone 3Gs running iOS 4.1 (baseband 06.15.00, serial number: 8704244TEDG). I want to update it to iOS 6.1.3 instead of iOS 7. How can I update it, and unlock it using Ultrasn0w after ... 1 vote 2answers 892 views Does “reset network settings” on iPhone enable me to change mobile carriers? Say, for example, if I have the iPhone 4S, and I select "reset network settings" in "General", would that enable me to change mobile carriers from AT&T to T-mobile? 0 votes 0answers 141 views How to unlock iphone 5s? [closed] I was given an iPhone 5S for christmas and looks like it is locked to AT&T. How do i unlock it so I can use it overseas? I have looked online but there is no answer except for these suspicious ... 2 votes 0answers 451 views How to enter passcode created with Greek characters once the Greek keyboard has been disabled? I have an iPhone 4s with iOS 7 and I entered a passcode with Greek letters, then I removed the Greek keyboard and now my iPhone is locked. I can't unlock it because the Greek keyboard isn't there any ... 3 votes 2answers 881 views Is my Verizon iPhone 5c unlocked? I have a Verizon iPhone 5c. Is it unlocked so that I can just go to T-Mobile or AT&T prepaid, by just popping in the SIM card? 0 votes 1answer 80k views Sim Not valid when activating my iPhone I have a unlocked iPhone 4 or at least that's what I've been told when i bought it. But then I went ahead to unlock it again, when I put a SIM card in, it says no service or at least i hope that's ... 0 votes 1answer 256 views Can I use the T-mobile contract free iPhone 5S with my AT&T number? I am thinking of purchasing the contract-free 5S because my contract with AT&T just expired, and I will only need the phone in the US for a few more months. Will I be able to use my AT&T sim ... 0 votes 2answers 2k views Unlock Verizon 4S iPhone I just purchased used iPhone 4S from a Verizon customer in the United States. I would like to unlock it and take it to Europe and use it on a GSM network. How can I do this? Phone info: iPhone 4S ... 3 votes 0answers 258 views How to run a shell script upon user authentication (e.g. screen unlock)? I would like to specify a shell script (say one to send me an email) whenever a given user is authenticated, for example if prompted after sleep, fresh login or fast user switching. PS: I found ... 3 votes 1answer 4k views Unlock read-only USB key A free 8GB USB key given to me shows up in Snow Leopard as read-only. $ mount /dev/disk1 on /Volumes/USB DISK (ntfs, local, nodev, nosuid, read-only, noowners) How can I mount it read-write? ... 2 votes 2answers 4k views Can be iPhone detected in 'Find my iPhone' service after recover? I lost my iPhone and while it was turned on I could lock it and put in 'Lost mode' through Apple 'Find My iPhone' service. Unfortunately almost one month it's not found and until now I had hope to ... 2 votes 0answers 201 views Broken FileVault Drive I'm coming to you having a few issues with my old hard drive. Basically, my MacBook crashed a few days ago. It seems like my disk has some bad sectors and has started a kind of autodestruction ... 3 votes 2answers 2k views Does official AT&T unlock also upgrade the operating system? I have an AT&T iPhone 4 running iOS version 5.1.1. My contract with AT&T is complete, and they have authorized my unlock. However, the process is to backup and restore from iTunes, according ... 1 vote 3answers 19k views Unlocking old Sprint iPhone 4s I have an old Sprint iPhone 4s that hasn't been under contract for around a year now and I have a friend on T-Mobile whose contract doesn't end for another year. He still has a flip phone so I want to ... 1 vote 1answer 9k views Which carriers will my unlocked AT&T iPhone 4s work with? I purchased a subsidized AT&T iPhone 4s in October 2011 (model MC922LL/A). I just unlocked the phone through AT&T's unlock website and received an email confirmation. I have backed up and ... 0 votes 1answer 133 views How can I disable Siri for making reminders and calendar items? I would like Siri not to be able to make reminders and calendar items without asking for the lock screen password. When I ask Siri to create a new reminder, I would like to ask it to unlock my phone ... 2 votes 2answers 628 views Can a Operator locked iPhone be updated to iOs 7? I was wondering if a locked iPhone (with a contract of 2 years) can be updated to iOs 7 and still working well and under the same contract. 1 vote 2answers 6k views Can I use basic iPhone 5/5s/5c with Aio Wireless “Aio Basic” plan? I would like to buy an unlocked iPhone 5 or iPhone 5s, and use it with the Aio Basic plan from Aio Wireless, an AT&T prepaid subsidiary launched in mid-2013. On their web-site, Aio Basic @ 40 USD/... 1 vote 5answers 4k views How to know what's my iphone 4s carrier using IMEI? I have an iphone 4s ios 6.1.3 my cousin bought it from U.S.A or so he says. He says the carrier is Verizon CDMA. However in the settings I see carrier: virgin 14.0 I am outside the USA so i need a ... 2 votes 2answers 648 views Unlock Mac from Terminal or Automator In my attempt to start iPlayer and BBC News every morning, I have scheduled Automator to open a page. It does work, however my Mac stays locked, therefore I need to get out of my bed and enter the ... 1 vote 1answer 116 views Can a factory unlocked iPhone 5 be used with Sprint? If I were to buy a brand new factory unlocked iPhone off eBay would I then be able to use that phone on sprint? 4 votes 1answer 571 views Unlocked iPhone replacement If an iPhone is locked, then unlocked and then replaced for a refurbished one in an Apple Store, will the new one remain unlocked? 2 votes 0answers 52 views How does the Country Unlock Work I live in Korea, where the carriers offer a free and legal country unlock. You have to give them the serial number and IMEI. However, due to the language barrier, the instructions after this are not ... 1 vote 0answers 1k views iphone 4 verizon cdma unlocked in india and uprgaded to newer version cydia not installed I have an iPhone 4 (CDMA), bought it to India and unlocked unofficially by jailbreaking. Recently I upgraded to iOS 6.1.2, and now Cydia is missing. Everything else is working fine; I can make calls, ... 2 votes 4answers 26k views Is it possible to unlock a CDMA iPhone 4S (from Virgin Mobile) to use another SIM in it? My friend has an iPhone 4s, it was bought from in the USA from Virgin Mobile. I want to do a factory unlock (unlock the SIM). I already know how to jailbreak, would jailbreaking work? Any help would ... 1 vote 2answers 219 views Is it possibe to upgrade and re-jailbreak (in order to unlock) a 3Gs running on 4.1? I have a locked 3Gs running 4.1 and it's pretty annoying not be able to install anything on it anymore (most apps nowadays require at least 4.3) I can not unlock it officially because i bought second ... -2 votes 1answer 919 views How legit is this website in telling if the phone is sim unlocked [closed] How legit is this website. It says my phone is not sim locked but I'm to scared to update it and ruin the jailbreak unlock. Somebody said they could factory unlock my phone for free so I gave them my ... 3 votes 2answers 2k views Encrypted/Journaled Seagate won't accept Password I have a 2011 MacBook Pro Intel running Mountain Lion. I have a 2tb Seagate External Drive with 3 partitions: all three were set up the same way with different passwords as a person who used to live ... 1 vote 4answers 13k views Will an AT&T iPad purchased from Best Buy US work in india? I am planning to purchase iPad Mini wifi + cellular from Best Buy. The Best Buy representatives were not sure it will work in India with different service provider or not. They are selling iPad with ... 0 votes 0answers 22 views How can I check if an iphone is sim unlocked already? [duplicate] For the iPhone 4S and 5, is it possible to easily check if they are sim unlocked ? If so how ? I've already seen this question but sounds a bit more complicated than I hoped. What's the simplest ...

{ "url": "http://apple.stackexchange.com/questions/tagged/unlock?page=2&sort=newest&pagesize=15", "source_domain": "apple.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2016-26", "warc_metadata": { "Content-Length": "182969", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:G7JHVM3DODV2YDL33F4FQIBA4BPALNHK", "WARC-Concurrent-To": "<urn:uuid:58df556b-4896-4a39-b837-580f6ac417d9>", "WARC-Date": "2016-06-28T15:30:21Z", "WARC-IP-Address": "151.101.129.69", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:2ZVMAXKKZ5WFCWRNBBKNKASBXHXTAK5G", "WARC-Record-ID": "<urn:uuid:9179f80c-e566-4e38-aadd-46ccae1bea4a>", "WARC-Target-URI": "http://apple.stackexchange.com/questions/tagged/unlock?page=2&sort=newest&pagesize=15", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:132b80c7-f819-465c-a7c9-5160782ce5d1>" }, "warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 170, 171, 206, 207, 209, 215, 223, 232, 233, 277, 278, 475, 477, 483, 492, 502, 503, 654, 655, 858, 860, 866, 875, 886, 887, 969, 970, 1171, 1173, 1178, 1186, 1195, 1196, 1237, 1238, 1439, 1441, 1447, 1455, 1465, 1466, 1515, 1516, 1714, 1716, 1722, 1731, 1741, 1742, 1779, 1780, 1981, 1983, 1989, 1997, 2007, 2008, 2059, 2060, 2259, 2261, 2267, 2276, 2285, 2286, 2358, 2359, 2564, 2566, 2571, 2580, 2589, 2590, 2653, 2654, 2857, 2859, 2865, 2874, 2883, 2884, 2931, 2932, 3125, 3127, 3132, 3140, 3150, 3151, 3181, 3182, 3379, 3381, 3387, 3395, 3404, 3405, 3466, 3467, 3668, 3670, 3676, 3685, 3694, 3695, 3758, 3759, 3949, 3952, 3958, 3967, 3976, 3977, 4039, 4040, 4242, 4245, 4251, 4260, 4269, 4270, 4362, 4363, 4564, 4566, 4571, 4579, 4589, 4590, 4607, 4608, 4809, 4811, 4817, 4826, 4835, 4836, 4892, 4893, 5031, 5033, 5038, 5047, 5057, 5058, 5134, 5135, 5337, 5339, 5344, 5352, 5362, 5363, 5419, 5420, 5621, 5623, 5629, 5638, 5648, 5649, 5755, 5756, 5958, 5960, 5966, 5975, 5984, 5985, 6056, 6057, 6255, 6257, 6262, 6271, 6281, 6282, 6359, 6360, 6525, 6527, 6533, 6542, 6552, 6553, 6587, 6588, 6785, 6787, 6793, 6802, 6812, 6813, 6908, 6909, 7113, 7115, 7121, 7130, 7140, 7141, 7175, 7176, 7303, 7305, 7311, 7319, 7329, 7330, 7370, 7371, 7572, 7574, 7580, 7588, 7598, 7599, 7667, 7668, 7863, 7865, 7871, 7880, 7889, 7890, 7915, 7916, 8116, 8118, 8124, 8133, 8143, 8144, 8217, 8218, 8416, 8418, 8424, 8432, 8441, 8442, 8467, 8468, 8663, 8665, 8671, 8680, 8689, 8690, 8756, 8757, 8958, 8960, 8966, 8975, 8985, 8986, 9009, 9010, 9207, 9209, 9215, 9224, 9233, 9234, 9295, 9296, 9491, 9493, 9498, 9507, 9517, 9518, 9549, 9550, 9755, 9757, 9762, 9770, 9779, 9780, 9838, 9839, 10031, 10033, 10039, 10047, 10057, 10058, 10122, 10123, 10326, 10328, 10334, 10343, 10353, 10354, 10404, 10405, 10545, 10547, 10552, 10561, 10570, 10571, 10638, 10639, 10839, 10841, 10846, 10855, 10864, 10865, 10917, 10918, 11119, 11121, 11127, 11136, 11146, 11147, 11185, 11186, 11387, 11389, 11394, 11402, 11412, 11413, 11466, 11467, 11579, 11581, 11587, 11595, 11605, 11606, 11634, 11635, 11766, 11768, 11774, 11783, 11792, 11793, 11826, 11827, 12030, 12032, 12037, 12046, 12055, 12056, 12146, 12147, 12351, 12353, 12359, 12368, 12378, 12379, 12468, 12469, 12672, 12674, 12679, 12688, 12698, 12699, 12784, 12785, 12989, 12992, 12998, 13006, 13016, 13017, 13092, 13093, 13297, 13299, 13305, 13314, 13323, 13324, 13374, 13375, 13578, 13580, 13585, 13594, 13604, 13605, 13665, 13666, 13869, 13871, 13877, 13886, 13895, 13896, 13962, 13963 ], "line_end_idx": [ 170, 171, 206, 207, 209, 215, 223, 232, 233, 277, 278, 475, 477, 483, 492, 502, 503, 654, 655, 858, 860, 866, 875, 886, 887, 969, 970, 1171, 1173, 1178, 1186, 1195, 1196, 1237, 1238, 1439, 1441, 1447, 1455, 1465, 1466, 1515, 1516, 1714, 1716, 1722, 1731, 1741, 1742, 1779, 1780, 1981, 1983, 1989, 1997, 2007, 2008, 2059, 2060, 2259, 2261, 2267, 2276, 2285, 2286, 2358, 2359, 2564, 2566, 2571, 2580, 2589, 2590, 2653, 2654, 2857, 2859, 2865, 2874, 2883, 2884, 2931, 2932, 3125, 3127, 3132, 3140, 3150, 3151, 3181, 3182, 3379, 3381, 3387, 3395, 3404, 3405, 3466, 3467, 3668, 3670, 3676, 3685, 3694, 3695, 3758, 3759, 3949, 3952, 3958, 3967, 3976, 3977, 4039, 4040, 4242, 4245, 4251, 4260, 4269, 4270, 4362, 4363, 4564, 4566, 4571, 4579, 4589, 4590, 4607, 4608, 4809, 4811, 4817, 4826, 4835, 4836, 4892, 4893, 5031, 5033, 5038, 5047, 5057, 5058, 5134, 5135, 5337, 5339, 5344, 5352, 5362, 5363, 5419, 5420, 5621, 5623, 5629, 5638, 5648, 5649, 5755, 5756, 5958, 5960, 5966, 5975, 5984, 5985, 6056, 6057, 6255, 6257, 6262, 6271, 6281, 6282, 6359, 6360, 6525, 6527, 6533, 6542, 6552, 6553, 6587, 6588, 6785, 6787, 6793, 6802, 6812, 6813, 6908, 6909, 7113, 7115, 7121, 7130, 7140, 7141, 7175, 7176, 7303, 7305, 7311, 7319, 7329, 7330, 7370, 7371, 7572, 7574, 7580, 7588, 7598, 7599, 7667, 7668, 7863, 7865, 7871, 7880, 7889, 7890, 7915, 7916, 8116, 8118, 8124, 8133, 8143, 8144, 8217, 8218, 8416, 8418, 8424, 8432, 8441, 8442, 8467, 8468, 8663, 8665, 8671, 8680, 8689, 8690, 8756, 8757, 8958, 8960, 8966, 8975, 8985, 8986, 9009, 9010, 9207, 9209, 9215, 9224, 9233, 9234, 9295, 9296, 9491, 9493, 9498, 9507, 9517, 9518, 9549, 9550, 9755, 9757, 9762, 9770, 9779, 9780, 9838, 9839, 10031, 10033, 10039, 10047, 10057, 10058, 10122, 10123, 10326, 10328, 10334, 10343, 10353, 10354, 10404, 10405, 10545, 10547, 10552, 10561, 10570, 10571, 10638, 10639, 10839, 10841, 10846, 10855, 10864, 10865, 10917, 10918, 11119, 11121, 11127, 11136, 11146, 11147, 11185, 11186, 11387, 11389, 11394, 11402, 11412, 11413, 11466, 11467, 11579, 11581, 11587, 11595, 11605, 11606, 11634, 11635, 11766, 11768, 11774, 11783, 11792, 11793, 11826, 11827, 12030, 12032, 12037, 12046, 12055, 12056, 12146, 12147, 12351, 12353, 12359, 12368, 12378, 12379, 12468, 12469, 12672, 12674, 12679, 12688, 12698, 12699, 12784, 12785, 12989, 12992, 12998, 13006, 13016, 13017, 13092, 13093, 13297, 13299, 13305, 13314, 13323, 13324, 13374, 13375, 13578, 13580, 13585, 13594, 13604, 13605, 13665, 13666, 13869, 13871, 13877, 13886, 13895, 13896, 13962, 13963, 14161 ] }

{ "red_pajama_v2": { "ccnet_original_length": 14161, "ccnet_original_nlines": 403, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.36991870403289795, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.07598499208688736, "rps_doc_frac_lines_end_with_ellipsis": 0.10396040230989456, "rps_doc_frac_no_alph_words": 0.1807379573583603, "rps_doc_frac_unique_words": 0.2618688941001892, "rps_doc_mean_word_length": 4.0844011306762695, "rps_doc_num_sentences": 193, "rps_doc_symbol_to_word_ratio": 0.013758599758148193, "rps_doc_unigram_entropy": 5.546761512756348, "rps_doc_word_count": 2654, "rps_doc_frac_chars_dupe_10grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_5grams": 0.04474170133471489, "rps_doc_frac_chars_dupe_6grams": 0.019557200372219086, "rps_doc_frac_chars_dupe_7grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_8grams": 0.009594099596142769, "rps_doc_frac_chars_dupe_9grams": 0.009594099596142769, "rps_doc_frac_chars_top_2gram": 0.008302579633891582, "rps_doc_frac_chars_top_3gram": 0.0038745400961488485, "rps_doc_frac_chars_top_4gram": 0.005535060074180365, "rps_doc_books_importance": -1401.16650390625, "rps_doc_books_importance_length_correction": -1401.16650390625, "rps_doc_openwebtext_importance": -880.6762084960938, "rps_doc_openwebtext_importance_length_correction": -880.6762084960938, "rps_doc_wikipedia_importance": -697.9944458007812, "rps_doc_wikipedia_importance_length_correction": -697.9944458007812 }, "fasttext": { "dclm": 0.1417129635810852, "english": 0.9548929333686829, "fineweb_edu_approx": 0.9624925851821899, "eai_general_math": 0.0008059099782258272, "eai_open_web_math": 0.0788874626159668, "eai_web_code": 0.00024002999998629093 } }

{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-8,206,630,088,282,551,000

CameraIcon CameraIcon SearchIcon MyQuestionIcon MyQuestionIcon Question If two number which have least common factor 3 and 2 respectively are added Find the least common Prime factor of the new number formed Open in App Solution The two numbers will be of the form 3x and 2y. x is an odd number.(because 3 is the least factor) Therefore 3x is an odd number and 2y is an even number. Therefore, 3x + 2y is an odd number. flag Suggest Corrections thumbs-up 0 mid-banner-image mid-banner-image Join BYJU'S Learning Program similar_icon Related Videos thumbnail lock QUANTITATIVE APTITUDE Watch in App Join BYJU'S Learning Program

{ "url": "https://byjus.com/question-answer/if-two-number-which-have-least-common-factor-3-and-2-respectively-are-added-find/", "source_domain": "byjus.com", "snapshot_id": "CC-MAIN-2023-50", "warc_metadata": { "Content-Length": "126226", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:UE5L7BNTEFGHXCQNU4RZQ2JBQCWQN43G", "WARC-Concurrent-To": "<urn:uuid:07b25a6d-8e3e-40db-a529-642b35e1ccab>", "WARC-Date": "2023-12-09T05:40:59Z", "WARC-IP-Address": "34.36.4.163", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:SPBQZEFIVCJAJ36K4CPIUYDGQA4N6N2W", "WARC-Record-ID": "<urn:uuid:d80b8b51-60af-4958-a7a2-a53536b10295>", "WARC-Target-URI": "https://byjus.com/question-answer/if-two-number-which-have-least-common-factor-3-and-2-respectively-are-added-find/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:419f675b-96b5-4e31-a914-86c13ba22291>" }, "warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-11\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, 11, 22, 33, 48, 63, 72, 73, 209, 210, 222, 231, 232, 279, 330, 386, 423, 424, 425, 430, 450, 460, 462, 479, 496, 525, 538, 553, 563, 568, 590, 603 ], "line_end_idx": [ 11, 22, 33, 48, 63, 72, 73, 209, 210, 222, 231, 232, 279, 330, 386, 423, 424, 425, 430, 450, 460, 462, 479, 496, 525, 538, 553, 563, 568, 590, 603, 631 ] }

{ "red_pajama_v2": { "ccnet_original_length": 631, "ccnet_original_nlines": 31, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2950819730758667, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04918032884597778, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.14754098653793335, "rps_doc_frac_unique_words": 0.5899999737739563, "rps_doc_mean_word_length": 5.099999904632568, "rps_doc_num_sentences": 5, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 3.916471242904663, "rps_doc_word_count": 100, "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.0313725508749485, "rps_doc_frac_chars_top_3gram": 0.04117647185921669, "rps_doc_frac_chars_top_4gram": 0.05098038911819458, "rps_doc_books_importance": -62.98786544799805, "rps_doc_books_importance_length_correction": -74.61237335205078, "rps_doc_openwebtext_importance": -48.9400520324707, "rps_doc_openwebtext_importance_length_correction": -60.56455612182617, "rps_doc_wikipedia_importance": -38.06514358520508, "rps_doc_wikipedia_importance_length_correction": -49.68964767456055 }, "fasttext": { "dclm": 0.17763209342956543, "english": 0.8684927821159363, "fineweb_edu_approx": 1.9600632190704346, "eai_general_math": 0.80893874168396, "eai_open_web_math": 0.4076662063598633, "eai_web_code": 0.0001345899945590645 } }

{ "free_decimal_correspondence": { "primary": { "code": "512.7", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Algebra" } }, "secondary": { "code": "510", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-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": "18", "label": "Q&A Forum" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

952,451,894,284,655,600

Clear Filters Clear Filters How o you work the phase difference between the input and the output of a sine wave? 4 views (last 30 days) Here is my code: n = 0:49; % These are the time indices input = 7*cos(2*pi*0.125*n+pi/3); input_a = 2*input; input_b = 8*cos(2*pi*0.25*n); input_c = input_a + input_b; b = [5, -5]; % The filter coefficients y = conv(b,input); % The output signal y_a = conv(b,input_a); y_b = conv(b,input_b); y_c = conv(b,input_c); subplot(2,2,1); plot(input, 'b*-'); % Plot the input as a blue line hold on; plot(y, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,2); plot(input_a, 'b*-'); % Plot the input as a blue line hold on; plot(y_a, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,3); plot(input_b, 'b*-'); % Plot the input as a blue line hold on; plot(y_b, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis subplot(2,2,4); plot(input_c, 'b*-'); % Plot the input as a blue line hold on; plot(y_c, 'r.-'); % Plot the output as a red line hold on; xlabel('Time'); % Label x axis ylabel('Amplitude'); % Label y axis %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% How do i work the phase difference between the output of y_b to the input and the phase difference of y_c to the input. Accepted Answer Alan Moses Alan Moses on 2 Dec 2020 You may refer to this link posted in the answer to a similar question here. More Answers (0) Community Treasure Hunt Find the treasures in MATLAB Central and discover how the community can help you! Start Hunting!

{ "url": "https://nl.mathworks.com/matlabcentral/answers/665038-how-o-you-work-the-phase-difference-between-the-input-and-the-output-of-a-sine-wave", "source_domain": "nl.mathworks.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "118405", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OJEKGER3M64ZKNA45EFZCOL2AXPFL6TB", "WARC-Concurrent-To": "<urn:uuid:607879eb-3be3-4580-8755-a420fe5e865b>", "WARC-Date": "2024-05-19T20:14:55Z", "WARC-IP-Address": "23.34.160.82", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:5PBCEUFGRSRSEJ7SMONCXPNSAZLUB6CB", "WARC-Record-ID": "<urn:uuid:030910df-5880-425c-8266-679f1dd3c567>", "WARC-Target-URI": "https://nl.mathworks.com/matlabcentral/answers/665038-how-o-you-work-the-phase-difference-between-the-input-and-the-output-of-a-sine-wave", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2925ec18-888b-40e4-aab7-7d6f78a9ad23>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-29\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 14, 28, 29, 114, 115, 138, 155, 194, 228, 247, 277, 306, 345, 384, 407, 430, 453, 469, 521, 530, 578, 587, 618, 654, 670, 724, 733, 783, 792, 823, 859, 875, 929, 938, 988, 997, 1028, 1064, 1080, 1134, 1143, 1193, 1202, 1233, 1269, 1322, 1442, 1443, 1459, 1460, 1471, 1496, 1572, 1573, 1590, 1591, 1615, 1616, 1698, 1699 ], "line_end_idx": [ 14, 28, 29, 114, 115, 138, 155, 194, 228, 247, 277, 306, 345, 384, 407, 430, 453, 469, 521, 530, 578, 587, 618, 654, 670, 724, 733, 783, 792, 823, 859, 875, 929, 938, 988, 997, 1028, 1064, 1080, 1134, 1143, 1193, 1202, 1233, 1269, 1322, 1442, 1443, 1459, 1460, 1471, 1496, 1572, 1573, 1590, 1591, 1615, 1616, 1698, 1699, 1713 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1713, "ccnet_original_nlines": 60, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.22173912823200226, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.002173909917473793, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.39347827434539795, "rps_doc_frac_unique_words": 0.42248061299324036, "rps_doc_mean_word_length": 4.379845142364502, "rps_doc_num_sentences": 11, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.249261856079102, "rps_doc_word_count": 258, "rps_doc_frac_chars_dupe_10grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_5grams": 0.428318589925766, "rps_doc_frac_chars_dupe_6grams": 0.428318589925766, "rps_doc_frac_chars_dupe_7grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_8grams": 0.37168142199516296, "rps_doc_frac_chars_dupe_9grams": 0.37168142199516296, "rps_doc_frac_chars_top_2gram": 0.04955751821398735, "rps_doc_frac_chars_top_3gram": 0.07079645991325378, "rps_doc_frac_chars_top_4gram": 0.04601769894361496, "rps_doc_books_importance": -155.64939880371094, "rps_doc_books_importance_length_correction": -144.23321533203125, "rps_doc_openwebtext_importance": -113.65097045898438, "rps_doc_openwebtext_importance_length_correction": -113.65097045898438, "rps_doc_wikipedia_importance": -60.86747741699219, "rps_doc_wikipedia_importance_length_correction": -52.66584777832031 }, "fasttext": { "dclm": 0.9375750422477722, "english": 0.670007586479187, "fineweb_edu_approx": 3.0050201416015625, "eai_general_math": 0.9823891520500183, "eai_open_web_math": 0.7084409594535828, "eai_web_code": 0.6357186436653137 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.0285", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "621.3822", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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,630,308,064,471,142,000

Math Concepts Math is often called the universal language because no matter where you're from, a better understanding of math means a better understanding of the world around you. Learn about math concepts such as addition, subtraction, fractions, ratios and more. Learn More You've probably seen supplementary angles examples in your everyday life without knowing it. Whether you pass a leaning sign on a flat highway or walk by a shed with a lean-to roof — whenever two angles combine to form a straight, linear pair, there they are. By Mitch Ryan Mathematicians use something called interval notation to convey information about a range of values in a way that's clear and easy to understand. This form of writing is necessary because intervals are common concepts in calculus, algebra and statistics. By Marie Look Fundamental trigonometric identities, aka trig identities or trigo identities, are equations involving trigonometric functions that hold true for any value you substitute into their variables. By Marie Look Advertisement Algebra is the branch of mathematics that focuses on formulas, and one of its key concepts is the representation of linear equations, which describe straight lines. By Marie Look Whether you're studying up for a math test, helping your child with homework or just trying to brush up before trivia night, learning the basic ins and outs of polygons will serve you well. By Mitch Ryan A rhombus is a parallelogram shape with two pairs of parallel sides and four equal sides. These four sides of equal length also define the rhombus as an equilateral quadrilateral. Etymologically, the name of this shape stems from the Greek word "rhombos," which roughly translates to "spinning top." By Mitch Ryan Greater than, less than, equal to: These terms are mathematical expressions that allow the user to compare two numbers or equations. Once you've become familiar with these terms — and the symbols used to represent them — you'll be able to apply them to various math problems. By Zach Taras Advertisement As you might recall from math class, fractions and decimals are two different ways of representing the same thing. A third option, percentages, is a close cousin of decimals. However, making use of this knowledge requires knowing how to convert one into the other. By Zach Taras A number line is a pictorial representation of real numbers. It is most commonly used in elementary math classes to help students compare numbers and perform arithmetic operations like addition, subtraction, division and multiplication. By Mitch Ryan Mean, median, mode and sometimes range, are all different methods for finding probability distribution in statistics. Range can be a helpful yardstick when calculating data values that are close together, but it can quickly become confusing if there is a wide gap between the smallest value and the largest number. By Mitch Ryan As a child, when trying to come up with the biggest number possible, you might have said "infinity plus one." While technically infinity is the largest number because you cannot run out of numbers, the biggest numbers that we know of are still difficult to count but a bit more quantifiable. By Yara Simón Advertisement Do you need to calculate the rate at which something changes over time? Whether it's the change in the x-value over the change in the y-value of a line on a graph, or the distance travelled by a car over the course of an hour-long drive, you'll need a rate of change formula. By Sascha Bos Physicists use the displacement formula to find an object's change in position. It sounds simple, but calculating displacement can quickly get complicated. By Sascha Bos Frequency is a fundamental concept when you're talking about waves, whether that means electromagnetic waves like radio waves and visible light, or mechanical vibrations like sound waves. By Marie Look The wavelength formula is a fundamental concept in physics, particularly in the study of waves and electromagnetic radiation. By Yara Simón Advertisement In math, few skills are as practical as knowing how to do long division. It's the art of breaking down complex problems into manageable steps, making it an essential tool for students and adults alike. By Desiree Bowie We get it: You need help with the parabola equation because those graphs won't draw themselves. Here's how to draw a parabola from an equation. By Yara Simón Trying to figure out whether your research problem would benefit from qualitative vs. quantitative data? Learn about the differences and uses of each. By Yara Simón Distinguishing between discrete vs. continuous data and situations that call for each data type is important in ensuring you get your desired results. By Marie Look Advertisement Whether you're a math whiz or not, there are some pretty cool number theories, beliefs and coincidences to appreciate. How down with digits are you? By Alia Hoyt The scutoid is kind of like the Higgs boson. Researchers theorized the new shape existed. And then they went looking for it. We'll show you both a quick and dirty way, and a precise, more complicated formula for converting Celsius to Fahrenheit (and vice versa). By Sydney Murphy & Austin Henderson Many people get speed and velocity confused. It's no surprise because the terms are often used interchangeably. But they're not quite the same thing. So how do you find the velocity of an object? By Mark Mancini Advertisement Sir Isaac Newton's Law of Universal Gravitation helps put the laws of gravity into a mathematical formula. And the gravitational constant is the "G" in that formula. By Mark Mancini Both degrees and radians represent the measure of an angle in geometry. So, how do you convert one to the other? By Mark Mancini

{ "url": "https://science.howstuffworks.com/math-concepts", "source_domain": "science.howstuffworks.com", "snapshot_id": "CC-MAIN-2024-22", "warc_metadata": { "Content-Length": "240849", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FZETEU2O5QDBG4QC6K74LAIC64IR7ZE3", "WARC-Concurrent-To": "<urn:uuid:956e9eb4-ee3b-4121-8a85-485b255cddcc>", "WARC-Date": "2024-05-18T10:23:42Z", "WARC-IP-Address": "18.160.41.123", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6ZHQHWF5G4JS52CSRPEZHBLYKRNBB6IU", "WARC-Record-ID": "<urn:uuid:d0af4cc8-d8d4-465e-bd79-dc84e5c5f0fa>", "WARC-Target-URI": "https://science.howstuffworks.com/math-concepts", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c062d7c0-0bbf-4856-89fd-df0c12d6e782>" }, "warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-80\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 14, 15, 266, 267, 278, 279, 539, 540, 554, 555, 810, 811, 825, 826, 1019, 1020, 1034, 1035, 1049, 1050, 1215, 1216, 1230, 1231, 1421, 1422, 1436, 1437, 1737, 1738, 1752, 1753, 2029, 2030, 2044, 2045, 2059, 2060, 2325, 2326, 2340, 2341, 2578, 2579, 2593, 2594, 2909, 2910, 2924, 2925, 3217, 3218, 3232, 3233, 3247, 3248, 3524, 3525, 3539, 3540, 3696, 3697, 3711, 3712, 3900, 3901, 3915, 3916, 4042, 4043, 4057, 4058, 4072, 4073, 4275, 4276, 4293, 4294, 4438, 4439, 4453, 4454, 4605, 4606, 4620, 4621, 4772, 4773, 4787, 4788, 4802, 4803, 4952, 4953, 4966, 4967, 5092, 5093, 5231, 5232, 5268, 5269, 5465, 5466, 5482, 5483, 5497, 5498, 5664, 5665, 5681, 5682, 5795, 5796 ], "line_end_idx": [ 14, 15, 266, 267, 278, 279, 539, 540, 554, 555, 810, 811, 825, 826, 1019, 1020, 1034, 1035, 1049, 1050, 1215, 1216, 1230, 1231, 1421, 1422, 1436, 1437, 1737, 1738, 1752, 1753, 2029, 2030, 2044, 2045, 2059, 2060, 2325, 2326, 2340, 2341, 2578, 2579, 2593, 2594, 2909, 2910, 2924, 2925, 3217, 3218, 3232, 3233, 3247, 3248, 3524, 3525, 3539, 3540, 3696, 3697, 3711, 3712, 3900, 3901, 3915, 3916, 4042, 4043, 4057, 4058, 4072, 4073, 4275, 4276, 4293, 4294, 4438, 4439, 4453, 4454, 4605, 4606, 4620, 4621, 4772, 4773, 4787, 4788, 4802, 4803, 4952, 4953, 4966, 4967, 5092, 5093, 5231, 5232, 5268, 5269, 5465, 5466, 5482, 5483, 5497, 5498, 5664, 5665, 5681, 5682, 5795, 5796, 5811 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5811, "ccnet_original_nlines": 114, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.41720035672187805, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.003659649984911084, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11802379041910172, "rps_doc_frac_unique_words": 0.464550256729126, "rps_doc_mean_word_length": 4.955555438995361, "rps_doc_num_sentences": 53, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.526775360107422, "rps_doc_word_count": 945, "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.003843690035864711, "rps_doc_frac_chars_top_3gram": 0.011744610033929348, "rps_doc_frac_chars_top_4gram": 0.009395689703524113, "rps_doc_books_importance": -399.28204345703125, "rps_doc_books_importance_length_correction": -399.28204345703125, "rps_doc_openwebtext_importance": -246.41017150878906, "rps_doc_openwebtext_importance_length_correction": -246.41017150878906, "rps_doc_wikipedia_importance": -226.9707794189453, "rps_doc_wikipedia_importance_length_correction": -226.9707794189453 }, "fasttext": { "dclm": 0.7321977019309998, "english": 0.9345338940620422, "fineweb_edu_approx": 3.353630542755127, "eai_general_math": 0.9076784253120422, "eai_open_web_math": 0.48262977600097656, "eai_web_code": 0.021660389378666878 } }

{ "free_decimal_correspondence": { "primary": { "code": "510", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "" } }, "secondary": { "code": "516", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry, Algebraic" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,620,178,875,285,434,000

homeaboutarchivenewslettermembership! aboutarchivemembership! aboutarchivemembers! kottke.org posts about Jason Snell Powered by Movable Type posted by Jason Kottke Jan 02, 2015 Jason Snell on the supreme uncoolness of Movable Type, the outdated blogging software that powers Snell’s site, Daring Fireball, and also kottke.org. Regardless, it turns out that software can also be considered uncool, even if it still works. Not only is Movable Type uncool —the equivalent of ’80s hair metal, but the language it’s written in, Perl, is supremely uncool. Like, New Kids on the Block uncool. The razzing John Siracusa takes about being a Perl developer isn’t really because Perl is old, or bad, but because it’s just not what the cool kids are talking about. The world has moved on. And yet, sometimes that old stuff still works, and is still the best tool for the job. Movable Type is often maddening and frustrating, but it’s familiar, behaves consistently, and I know it better than any other piece of software. In other words, MT is like a member of my family. The Macintosh is 30 years old today posted by Jason Kottke Jan 24, 2014 Apple is celebrating the 30th anniversary of the Macintosh with a special subsite. Incredible that the Mac is still around; the 90s were a dire time for Apple and it’s amazing to see the current fantastic iMacs and Macbooks that came after some epically bad mid-90s machines. Here’s Steve Jobs introducing the original Mac in 1984 (a snippet of the full introduction video): Steven Levy writes about covering the introduction of the Mac for Rolling Stone. First, I met the machine. From the instant the woman running the demo switched on that strange-looking contraption (inspired in part by the Cuisinart food processor), I knew the Macintosh would change millions of lives, including my own. To understand that, you must realize how much 1984 really was not like 2014. Until that point, personal computers were locked in an esoteric realm of codes and commands. They looked unfriendly, with the letters of text growing in sickly phosphorescence. Even the simplest tasks required memorizing the proper intonations, then executing several exacting steps. But the Macintosh was friendly. It opened with a smile. Words appeared with the clarity of text on a printed page - and for the first time, ordinary people had the power to format text as professional printers did. Selecting and moving text was made dramatically easier by the then-quaint mouse accompanying the keyboard. You could draw on it. This humble shoebox-sized machine had a simplicity that instantly empowered you. Here’s the piece Levy wrote for Rolling Stone. If you have had any prior experience with personal computers, what you might expect to see is some sort of opaque code, called a “prompt,” consisting of phosphorescent green or white letters on a murky background. What you see with Macintosh is the Finder. On a pleasant, light background (you can later change the background to any of a number of patterns, if you like), little pictures called “icons” appear, representing choices available to you. A word-processing program might be represented by a pen, while the program that lets you draw pictures might have a paintbrush icon. A file would represent stored documents - book reports, letters, legal briefs and so forth. To see a particular file, you’d move the mouse, which would, in turn, move the cursor to the file you wanted. You’d tap a button on the mouse twice, and the contents of the file would appear on the screen: dark on light, just like a piece of paper. Levy has also appended a never-seen-before transcript of his interview with Steve Jobs onto the Kindle version of Insanely Great, a book Levy wrote about the Mac. Dave Winer participated on a panel of developers on launch day. The rollout on January 24th was like a college graduation ceremony. There were the fratboys, the insiders, the football players, and developers played a role too. We praised their product, their achievement, and they showed off our work. Apple took a serious stake in the success of software on their platform. They also had strong opinions about how our software should work, which in hindsight were almost all good ideas. The idea of user interface standards were at the time controversial. Today, you’ll get no argument from me. It’s better to have one way to do things, than have two or more, no matter how much better the new ones are. That day, I was on a panel of developers, talking to the press about the new machine. We were all gushing, all excited to be there. I still get goosebumps thinking about it today. MacOS System 1.1 emulator. (via @gruber) iFixit did a teardown of the 128K Macintosh. Jason Snell interviewed several Apple execs about the 30th anniversary for MacWorld. (via df) What’s clear when you talk to Apple’s executives is that the company believes that people don’t have to choose between a laptop, a tablet, and a smartphone. Instead, Apple believes that every one of its products has particular strengths for particular tasks, and that people should be able to switch among them with ease. This is why the Mac is still relevant, 30 years on-because sometimes a device with a keyboard and a trackpad is the best tool for the job. “It’s not an either/or,” Schiller said. “It’s a world where you’re going to have a phone, a tablet, a computer, you don’t have to choose. And so what’s more important is how you seamlessly move between them all…. It’s not like this is a laptop person and that’s a tablet person. It doesn’t have to be that way.” Snell previously interviewed Steve Jobs on the 20th anniversary of the Mac, which includes an essay that Jobs wrote for the very first issue of Macworld in 1984: The Macintosh is the future of Apple Computer. And it’s being done by a bunch of people who are incredibly talented but who in most organizations would be working three levels below the impact of the decisions they’re making in the organization. It’s one of those things that you know won’t last forever. The group might stay together maybe for one more iteration of the product, and then they’ll go their separate ways. For a very special moment, all of us have come together to make this new product. We feel this may be the best thing we’ll ever do with our lives. Here’s a look inside that first MacWorld issue. As always, Folklore.org is an amazing source for stories about the Mac told by the folks who were there. Susan Kare designed the icons, the interface elements, and fonts for the original Macintosh. Have a look at her Apple portfolio or buy some prints of the original Mac icons. Stephen Fry recounts his experience with the Mac, including the little tidbit that he and Douglas Adams bought the first two Macs in Europe (as far as he knows). I like to claim that I bought the second Macintosh computer ever sold in Europe in that January, 30 years ago. My friend and hero Douglas Adams was in the queue ahead of me. For all I know someone somewhere had bought one ten minutes earlier, but these were the first two that the only shop selling them in London had in stock on the 24th January 1984, so I’m sticking to my story. Review of the Mac in the NY Times from 1984. The Next Web has an interview with Daniel Kottke (no relation) and Randy Wigginton on programming the original Mac. TNW: When you look at today’s Macs, as well as the iPhone and the iPad, do you see how it traces back to that original genesis? Randy: It was more of a philosophy - let’s bring the theoretical into now - and the focus was on the user, not on the programmer. Before then it had always been let’s make it so programmers can do stuff and produce programs. Here, it was all about the user, and the programmers had to work their asses off to make it easy for the user to do what they wanted. It was the principle of least surprise. We never wanted [the Macintosh] to do something that people were shocked at. These are things that we just take for granted now. The whole undo paradigm? It didn’t exist before that. Like Daniel says, it’s definitely the case that there were academic and business places with similar technology, but they had never attempted to reach a mass market. Daniel: I’m just struck by the parallel now, thinking about what the Mac did. The paradigm before the Mac in terms of Apple products was command-line commands in the Apple II and the Apple III. In the open source world of Linux, I’m messing around with Raspberry Pis now, and it terrifies me, because I think, “This is not ready for the consumer,” but then I think about Android, which is built on top of Linux. So the Macintosh did for the Apple II paradigm what Android has done for Linux. A week after Jobs unveiled the Mac at the Apple shareholders meeting, he did the whole thing again at a meeting of the Boston Computer Society. Time has the recently unearthed video of the event.

{ "url": "https://kottke.org/tag/Jason%20Snell", "source_domain": "kottke.org", "snapshot_id": "crawl=CC-MAIN-2022-49", "warc_metadata": { "Content-Length": "21969", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:EWR3IDAJQNP45DVIBIZFL4372GW2RXQZ", "WARC-Concurrent-To": "<urn:uuid:0d7fa7de-c3e3-45b1-a7b0-6c74930e6b74>", "WARC-Date": "2022-11-27T02:08:52Z", "WARC-IP-Address": "162.247.141.135", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:KA6KE3TIIW6OHJ7PEUZCWVDZJ32IQ46E", "WARC-Record-ID": "<urn:uuid:b2789fb3-65f6-4557-a799-206cb0169d09>", "WARC-Target-URI": "https://kottke.org/tag/Jason%20Snell", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3d221e63-89a5-4a81-9bf3-10d2f5fdf900>" }, "warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 38, 62, 83, 84, 119, 120, 144, 145, 183, 184, 334, 335, 785, 786, 873, 874, 1069, 1070, 1106, 1107, 1145, 1146, 1229, 1230, 1522, 1523, 1604, 1605, 2204, 2205, 2630, 2631, 2678, 2679, 3603, 3604, 3767, 3768, 3832, 3833, 4474, 4475, 4655, 4656, 4697, 4698, 4743, 4744, 4838, 4839, 5300, 5301, 5613, 5614, 5776, 5777, 6345, 6346, 6394, 6395, 6500, 6501, 6675, 6676, 6838, 6839, 7221, 7222, 7267, 7268, 7384, 7385, 7513, 7514, 7739, 7740, 8097, 8098, 8264, 8265, 8757, 8758 ], "line_end_idx": [ 38, 62, 83, 84, 119, 120, 144, 145, 183, 184, 334, 335, 785, 786, 873, 874, 1069, 1070, 1106, 1107, 1145, 1146, 1229, 1230, 1522, 1523, 1604, 1605, 2204, 2205, 2630, 2631, 2678, 2679, 3603, 3604, 3767, 3768, 3832, 3833, 4474, 4475, 4655, 4656, 4697, 4698, 4743, 4744, 4838, 4839, 5300, 5301, 5613, 5614, 5776, 5777, 6345, 6346, 6394, 6395, 6500, 6501, 6675, 6676, 6838, 6839, 7221, 7222, 7267, 7268, 7384, 7385, 7513, 7514, 7739, 7740, 8097, 8098, 8264, 8265, 8757, 8758, 8953 ] }

{ "red_pajama_v2": { "ccnet_original_length": 8953, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.45551982522010803, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012325829826295376, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15005359053611755, "rps_doc_frac_unique_words": 0.40800514817237854, "rps_doc_mean_word_length": 4.6055521965026855, "rps_doc_num_sentences": 95, "rps_doc_symbol_to_word_ratio": 0.0005359100177884102, "rps_doc_unigram_entropy": 5.676567077636719, "rps_doc_word_count": 1549, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.01738155074417591, "rps_doc_frac_chars_dupe_6grams": 0.005606949795037508, "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.008410429581999779, "rps_doc_frac_chars_top_3gram": 0.0058872997760772705, "rps_doc_frac_chars_top_4gram": 0.0053265998139977455, "rps_doc_books_importance": -892.8468017578125, "rps_doc_books_importance_length_correction": -892.8468017578125, "rps_doc_openwebtext_importance": -537.1056518554688, "rps_doc_openwebtext_importance_length_correction": -537.1056518554688, "rps_doc_wikipedia_importance": -401.6788330078125, "rps_doc_wikipedia_importance_length_correction": -401.6788330078125 }, "fasttext": { "dclm": 0.020512999966740608, "english": 0.9682019352912903, "fineweb_edu_approx": 1.768541932106018, "eai_general_math": 0.13343262672424316, "eai_open_web_math": 0.1899736523628235, "eai_web_code": 0.034288350492715836 } }

{ "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.17", "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": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

2,248,143,414,631,939,300

write_attribute snippets ActiveRecord's write_attribute is deprecated Tagged write_attribute, attributes Languages ruby ActiveRecord's write_attribute is deprecated, so now you only have one hundred other ways of assigning attributes. My favorite for dynamic assignment of attributes is: class Dog def crap=(poo) self[:trash] = poo # don't try to use self.attributes[:trash] here you fool. end def crap self[:trash] # don't try to use self.attributes[:trash] here you fool. end end

{ "url": "https://snippets.aktagon.com/tags/1194-write-attribute", "source_domain": "snippets.aktagon.com", "snapshot_id": "crawl=CC-MAIN-2017-51", "warc_metadata": { "Content-Length": "76575", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:AR5TD7V5342NJVRKCBUNCZ673DDWA5I2", "WARC-Concurrent-To": "<urn:uuid:5f1c7223-bbd8-4bf8-b2e9-2ab4f8189511>", "WARC-Date": "2017-12-17T19:27:14Z", "WARC-IP-Address": "46.101.219.176", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JCKU7ANVTD2JV22SGEDC6WKUUCN6VDWY", "WARC-Record-ID": "<urn:uuid:9177a787-66e0-4a39-8f51-ce6bb6a22dbc>", "WARC-Target-URI": "https://snippets.aktagon.com/tags/1194-write-attribute", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:ce67725e-eab0-4624-acfe-e9f67c05d505>" }, "warc_info": "robots: classic\r\nhostname: ip-10-101-239-49.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 25, 26, 71, 72, 123, 124, 239, 240, 293, 294, 304, 321, 403, 409, 410, 421, 497, 503 ], "line_end_idx": [ 25, 26, 71, 72, 123, 124, 239, 240, 293, 294, 304, 321, 403, 409, 410, 421, 497, 503, 506 ] }

{ "red_pajama_v2": { "ccnet_original_length": 506, "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.31313130259513855, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2525252401828766, "rps_doc_frac_unique_words": 0.6349206566810608, "rps_doc_mean_word_length": 6.063492298126221, "rps_doc_num_sentences": 6, "rps_doc_symbol_to_word_ratio": 0.020202020183205605, "rps_doc_unigram_entropy": 3.5818004608154297, "rps_doc_word_count": 63, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_6grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_7grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_8grams": 0.23560209572315216, "rps_doc_frac_chars_dupe_9grams": 0.23560209572315216, "rps_doc_frac_chars_top_2gram": 0.141361266374588, "rps_doc_frac_chars_top_3gram": 0.1518324613571167, "rps_doc_frac_chars_top_4gram": 0.2041884809732437, "rps_doc_books_importance": -54.61273956298828, "rps_doc_books_importance_length_correction": -64.69824981689453, "rps_doc_openwebtext_importance": -27.4366455078125, "rps_doc_openwebtext_importance_length_correction": -37.522159576416016, "rps_doc_wikipedia_importance": -4.6787238121032715, "rps_doc_wikipedia_importance_length_correction": -14.764236450195312 }, "fasttext": { "dclm": 0.6502311825752258, "english": 0.7402909398078918, "fineweb_edu_approx": 2.0667684078216553, "eai_general_math": 0.9990977048873901, "eai_open_web_math": 0.28738319873809814, "eai_web_code": 0.7416796088218689 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-7,848,104,709,622,119,000

Jump to content lucascai992 Members • Content count 7 • Joined • Last visited Community Reputation 0 Neutral About lucascai992 1. and the reason for blocking the account? It truly is sad they banned a character level 22 shillen Oracle with a magestaff and 100k in the inventory, I still do not understand how you can be so sure that you use external programs. 1° the character never formed a party. 2° I banned the support and not the wizard. 3° Both characters never shared an area. 4° was 1 hour after having bought 400Ncoins in the account. 5° character level 22: / What does it cost me to do the character again? the truth that nothing will waste 1 night doing it and after that? another ban for no reason? What will happen next I reach level 40, invest time and others so that everything ends in the same way? It really is a shame. Regards 2. Maybe you do not understand the meaning of the email, since my language is Spanish and Google translates what it can. they are telling me that they did not find errors in the account, but they prefer to ban my account? I do not understand... admit that it is badly blocked and still decide to take away my access? I really do not understand it. 3. Banned Account :/ If I already send mails, I returned to answer what I posted here but now it's time to wait. What crime are you talking about? I do not use any kind of good programs I'll keep trying by mail .. Thanks for taking the time to answer me 4. Accounts Closed for Illegal Third-Party Programs I was a victim of mass bans. I signed the account without evidence for this issue "use third party program" the character was shillen oracle level 21 - 22 always raised level independently the character was never in party never play in party only game solitaire, my main character is a level 20 dark wizard I did the same as with the shillen oracle level up without a party independently ... it is a pity this wave of random bans because many times the victims are the ones who just started playing ... The maximum I got together with both chares was 1 Mage Staff ... so it was a pleasure to play lineage 2 again since gz x1 c4 that I was not playing. many years, no ?. Now I have to worry about 1 hour or 2 before they block access to the account I bought 400 Ncoins ...: / 5. Banned Account :/ I was a victim of mass bans. I signed the account without evidence for this issue "use third party program" the character was shillen oracle level 21 - 22 always raised level independently the character was never in party never play in party only game solitaire, my main character is a level 20 dark wizard I did the same as with the shillen oracle level up without a party independently ... it is a pity this wave of random bans because many times the victims are the ones who just started playing ... The maximum I got together with both chares was 1 Mage Staff ... so it was a pleasure to play lineage 2 again since gz x1 c4 that I was not playing. many years, no ?. Now I have to worry about 1 hour or 2 before they block access to the account I bought 400 Ncoins ...: / sorry for Google translator 6. Wrong acc blocked I think that happened to me, after 1 hour of buying nccoins they banned me the support account 7. Ban on using box ? I just spent the same just 1 hour after having bought 400Ncoins and also my backpack, I had the wizard in gludio sitting and killing mobs with the Shillen Oracle: /. I do not think it has to do with the internet crashes that I had just that I do not know, layers! I try to take it easy ×

{ "url": "https://forums.lineage2.com/profile/32322-lucascai992/", "source_domain": "forums.lineage2.com", "snapshot_id": "crawl=CC-MAIN-2020-24", "warc_metadata": { "Content-Length": "49578", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:33DGHLPFMI3YCOHS46ZI6PIM6YZQDY3Z", "WARC-Concurrent-To": "<urn:uuid:6a15670b-8131-4061-be76-b8d556813190>", "WARC-Date": "2020-05-26T05:35:24Z", "WARC-IP-Address": "50.112.176.34", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:JFAKJIFWMKORBJC4RVQJJTSEN7NWNIFO", "WARC-Record-ID": "<urn:uuid:6f752409-7145-410b-bb5c-965f22e86f00>", "WARC-Target-URI": "https://forums.lineage2.com/profile/32322-lucascai992/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9305e595-c8cd-41a0-8acc-b4e3472c8483>" }, "warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-52.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, 16, 17, 29, 30, 38, 56, 57, 63, 74, 75, 92, 93, 114, 115, 125, 126, 144, 145, 191, 192, 870, 1220, 1243, 1244, 1481, 1535, 1536, 2315, 2338, 2339, 3146, 3169, 3170, 3269, 3293, 3294, 3584 ], "line_end_idx": [ 16, 17, 29, 30, 38, 56, 57, 63, 74, 75, 92, 93, 114, 115, 125, 126, 144, 145, 191, 192, 870, 1220, 1243, 1244, 1481, 1535, 1536, 2315, 2338, 2339, 3146, 3169, 3170, 3269, 3293, 3294, 3584, 3585 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3585, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4385964870452881, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04183536022901535, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15789474546909332, "rps_doc_frac_unique_words": 0.3640483319759369, "rps_doc_mean_word_length": 4.146525859832764, "rps_doc_num_sentences": 44, "rps_doc_symbol_to_word_ratio": 0.012145750224590302, "rps_doc_unigram_entropy": 4.987347602844238, "rps_doc_word_count": 662, "rps_doc_frac_chars_dupe_10grams": 0.437158465385437, "rps_doc_frac_chars_dupe_5grams": 0.45974498987197876, "rps_doc_frac_chars_dupe_6grams": 0.45974498987197876, "rps_doc_frac_chars_dupe_7grams": 0.437158465385437, "rps_doc_frac_chars_dupe_8grams": 0.437158465385437, "rps_doc_frac_chars_dupe_9grams": 0.437158465385437, "rps_doc_frac_chars_top_2gram": 0.025500910356640816, "rps_doc_frac_chars_top_3gram": 0.021857919171452522, "rps_doc_frac_chars_top_4gram": 0.021857919171452522, "rps_doc_books_importance": -353.689453125, "rps_doc_books_importance_length_correction": -353.689453125, "rps_doc_openwebtext_importance": -186.74757385253906, "rps_doc_openwebtext_importance_length_correction": -186.74757385253906, "rps_doc_wikipedia_importance": -189.16261291503906, "rps_doc_wikipedia_importance_length_correction": -189.16261291503906 }, "fasttext": { "dclm": 0.02399688959121704, "english": 0.9747446775436401, "fineweb_edu_approx": 0.7997258901596069, "eai_general_math": 0.07236695289611816, "eai_open_web_math": 0.09052705764770508, "eai_web_code": 0.030909599736332893 } }

{ "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": "343.73", "labels": { "level_1": "Social sciences", "level_2": "Law", "level_3": "Criminal law" } } }, "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": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "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

-8,728,035,997,791,549,000

DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus DevicePairingResultStatus Enum Definition The result of the pairing action with an Association Endpoint (AEP) device object. For more information about AEP objects, see DeviceInformationKind. public : enum class DevicePairingResultStatus enum class winrt::Windows::Devices::Enumeration::DevicePairingResultStatus : int32_t public enum DevicePairingResultStatus Public Enum DevicePairingResultStatus var value = Windows.Devices.Enumeration.DevicePairingResultStatus.accessDenied; Attributes Windows 10 requirements Device family Windows 10 (introduced v10.0.10240.0) API contract Windows.Foundation.UniversalApiContract (introduced v1) Fields AccessDenied AccessDenied AccessDenied AccessDenied AccessDenied 12 Your application does not have the appropriate permissions level to pair the device object. AlreadyPaired AlreadyPaired AlreadyPaired AlreadyPaired AlreadyPaired 3 The device object has already been paired. AuthenticationFailure AuthenticationFailure AuthenticationFailure AuthenticationFailure AuthenticationFailure 9 Authentication failed, so the device is not paired. Either the device object or the application rejected the authentication. AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed AuthenticationNotAllowed 8 The authentication protocol is not supported, so the device is not paired. AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout AuthenticationTimeout 7 The authentication process timed out before it could complete. ConnectionRejected ConnectionRejected ConnectionRejected ConnectionRejected ConnectionRejected 4 The device object rejected the connection. Failed Failed Failed Failed Failed 19 An unknown failure occurred. HardwareFailure HardwareFailure HardwareFailure HardwareFailure HardwareFailure 6 The device object indicated there was a hardware failure. InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData InvalidCeremonyData 13 The ceremony data was incorrect. NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles NoSupportedProfiles 10 There are no network profiles for this device object to use. NotPaired NotPaired NotPaired NotPaired NotPaired 2 The device object is not currently paired. NotReadyToPair NotReadyToPair NotReadyToPair NotReadyToPair NotReadyToPair 1 The device object is not in a state where it can be paired. OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress OperationAlreadyInProgress 15 The device object is already attempting to pair or unpair. Paired Paired Paired Paired Paired 0 The device object is now paired. PairingCanceled PairingCanceled PairingCanceled PairingCanceled PairingCanceled 14 The pairing action was canceled before completion. ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet ProtectionLevelCouldNotBeMet 11 The minimum level of protection is not supported by the device object or the application. RejectedByHandler RejectedByHandler RejectedByHandler RejectedByHandler RejectedByHandler 17 The application handler rejected the pairing. RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation RemoteDeviceHasAssociation 18 The remove device already has an association. RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered RequiredHandlerNotRegistered 16 Either the event handler wasn't registered or a required DevicePairingKinds was not supported. TooManyConnections TooManyConnections TooManyConnections TooManyConnections TooManyConnections 5 The device object indicated it cannot accept any more incoming connections. Remarks Version history Windows version SDK version Value added 1511 10586 Failed 1511 10586 OperationAlreadyInProgress 1511 10586 PairingCanceled 1511 10586 RejectedByHandler 1511 10586 RemoteDeviceHasAssociation 1511 10586 RequiredHandlerNotRegistered

{ "url": "https://docs.microsoft.com/en-us/uwp/api/windows.devices.enumeration.devicepairingresultstatus", "source_domain": "docs.microsoft.com", "snapshot_id": "crawl=CC-MAIN-2019-35", "warc_metadata": { "Content-Length": "52009", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:FWKLOHF2HT7PAJKCKRSBZTTBNKSJ535T", "WARC-Concurrent-To": "<urn:uuid:1eced483-0fcb-467e-88d2-4ed455a40943>", "WARC-Date": "2019-08-22T10:28:24Z", "WARC-IP-Address": "104.108.100.37", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:WTHLL4A3A5Q5VOPQ7N62FLMVCPT6KJIX", "WARC-Record-ID": "<urn:uuid:879a2666-15d2-4f9b-8949-c0d09362de3c>", "WARC-Target-URI": "https://docs.microsoft.com/en-us/uwp/api/windows.devices.enumeration.devicepairingresultstatus", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:f3e24f2d-4f64-47cd-86e4-bd4f5a636a7b>" }, "warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-188.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 135, 136, 147, 148, 298, 299, 345, 430, 468, 506, 586, 597, 598, 622, 623, 637, 675, 688, 744, 745, 752, 753, 821, 822, 914, 915, 987, 988, 1031, 1032, 1144, 1145, 1270, 1271, 1398, 1399, 1474, 1475, 1587, 1588, 1651, 1652, 1749, 1750, 1793, 1794, 1832, 1833, 1862, 1863, 1945, 1946, 2004, 2005, 2108, 2109, 2142, 2143, 2246, 2247, 2308, 2309, 2361, 2362, 2405, 2406, 2483, 2484, 2544, 2545, 2683, 2684, 2743, 2744, 2781, 2782, 2815, 2816, 2899, 2900, 2951, 2952, 3100, 3101, 3191, 3192, 3285, 3286, 3332, 3333, 3471, 3472, 3518, 3519, 3667, 3668, 3763, 3764, 3861, 3862, 3938, 3939, 3947, 3948, 3964, 3965, 4005, 4023, 4061, 4088, 4117, 4155 ], "line_end_idx": [ 135, 136, 147, 148, 298, 299, 345, 430, 468, 506, 586, 597, 598, 622, 623, 637, 675, 688, 744, 745, 752, 753, 821, 822, 914, 915, 987, 988, 1031, 1032, 1144, 1145, 1270, 1271, 1398, 1399, 1474, 1475, 1587, 1588, 1651, 1652, 1749, 1750, 1793, 1794, 1832, 1833, 1862, 1863, 1945, 1946, 2004, 2005, 2108, 2109, 2142, 2143, 2246, 2247, 2308, 2309, 2361, 2362, 2405, 2406, 2483, 2484, 2544, 2545, 2683, 2684, 2743, 2744, 2781, 2782, 2815, 2816, 2899, 2900, 2951, 2952, 3100, 3101, 3191, 3192, 3285, 3286, 3332, 3333, 3471, 3472, 3518, 3519, 3667, 3668, 3763, 3764, 3861, 3862, 3938, 3939, 3947, 3948, 3964, 3965, 4005, 4023, 4061, 4088, 4117, 4155, 4194 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4194, "ccnet_original_nlines": 112, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19264069199562073, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.008658009581267834, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18831169605255127, "rps_doc_frac_unique_words": 0.39949747920036316, "rps_doc_mean_word_length": 9.271356582641602, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.616979122161865, "rps_doc_word_count": 398, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.03956640139222145, "rps_doc_frac_chars_dupe_6grams": 0.02872629091143608, "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.04227641969919205, "rps_doc_frac_chars_top_3gram": 0.04471544921398163, "rps_doc_frac_chars_top_4gram": 0.018428180366754532, "rps_doc_books_importance": -255.70248413085938, "rps_doc_books_importance_length_correction": -255.70248413085938, "rps_doc_openwebtext_importance": -120.30049896240234, "rps_doc_openwebtext_importance_length_correction": -120.30049896240234, "rps_doc_wikipedia_importance": -83.91883087158203, "rps_doc_wikipedia_importance_length_correction": -83.91883087158203 }, "fasttext": { "dclm": 0.02885317988693714, "english": 0.6765401363372803, "fineweb_edu_approx": 1.5706846714019775, "eai_general_math": 0.013141389936208725, "eai_open_web_math": 0.028502289205789566, "eai_web_code": 0.5309188961982727 } }

{ "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": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-5,736,311,233,549,987,000

Questions & Answers • Is SAP really a WMS as PKMS WMS? Or is it really a ERP? ERP are resource planning software and it seem that a lot of people get ERP mix-up with WMS and they purchase a software that does not meet it's real needs due to this confusion. So tell me is SAP really and WMS or just an ERP that allows you to manage some warehouse data mainly utilize for... wsimmons5 pointsBadges: • Can anyone tell me how does an OS function? Can anyone tell me how does an operating system function? waavar5 pointsBadges: • IFS Folder Security How do I secure an IFS folder? DBHP4504015 pointsBadges: • CPF5032 member already locked to this job I have a program written in RPGLE which calls numerous other programs. These programs all share similar files. In my main program, when trying to read a particular file, I get error CPF5032 even though I unlock the file right before I do the setll reade. As a result, I figured the lock must be... GHENDER215 pointsBadges: • Why was our Yahoo sevice suspended? Our business accessed our email through AT&T Yahoo. Without notice we were blocked and were unable to sign in. We received this message on our screen: YOUR INTERNET SERVICES HAVE BEEN SUSPENDED DUE TO VIOLATION OF THE AT&T YAHOO! TERMS OF SERVICE. How can I find out what happened and why?... Astridtylerwolfe5 pointsBadges: • SWP Traffic Management How do I write SWP Traffic management? peterfong15 pointsBadges: • I can’t find password protection manager on my Sony hd-e1 hard disk I reinstalled Windows 7 64-bit. After that I could not find password protection manager.exe on my Sony hd-e1 hard disk to unlock the secure portion of my hard disk. Please help. Shashank0045 pointsBadges: • Missing default apps on BlackBerry Z10 I'm using BlackBerry Z10. A few days back, I installed 10.3.1.634. And the issue came to see is, the OS has missing many default apps e.g. File manager Calculator Compass Video Pictures And many others Facebook and Twitter apps or also not working. Please help me out hot to locate apps and redress... harshitbhatia695 pointsBadges: • Create integrated chips for manufacturing laptop We want to create a laptop with the help of integrated chips. How can we create chips for a manufacturing laptop? 99899469945 pointsBadges: • LNK file on Mac A PC user sent me a video project in a LNK file that she wants me to view. I'm on a Mac. Is that possible? ChrisFlx5 pointsBadges: • IFS Access using Windows 10 For the last 3 years I've been able to access the IFS using my Windows 10 account firstname.lastname@outlook.com with no problem. We recently hired a new using who required access to the IFS using Windows 10. The new user, nor myself can access anything on the IFS with the outlook.com login, but we... DLM2007295 pointsBadges: • List of companies migrated from iSeries to some other platform Hi all, Can someone have list of some major companies which migrated from iSeries to any other platform? Regards, hunshabbir72,805 pointsBadges: • Password protect Dropbox directory I always use Dropbox and I have to start using it on my work PC. But I need to prevent the other employees from being able to access those files. Can I password protect my directory on my PC? Thanks! ITKE407,640 pointsBadges: • File size more than 180 GB for the data extracted from an internal table If I'm getting a file size more than 180 GB for the data extracted from an internal table. How do I resolve this issue? prateekdevnani5 pointsBadges: • Qrmtsign *FRCSIGNON Hi, I want stay in level *FRCSIGNON in system value but I have a web application who asks me to change in *VERIFY. Is it possible to stay *FRCSIGNON? Thanks S.Brossard Brossard5 pointsBadges: • NAP infrastructure for barrier to network access Which NAP infrastructure component serves as a barrier to network access? wilsonb5 pointsBadges: • How to use VCM research to determine how we can capture reports to ensure compliance Which reports in VCM are affected by Sarbanes-Oxley Act? jg97345 pointsBadges: • My LG10 micro controlled device Is there a scan that will tell me if someone is controlling my phone? Karma325 pointsBadges: • Source code for checking valid password in VB What's the source code for checking valid and invalid password in vb kkknfrnds5 pointsBadges: • Getting error on TempDB – how to resolve? The database consistency IO error on "path\tempdb.mdf" every day this error are getting we run the DBCC checkdb (TempDB) but no error why this error getting triggered. edwinjhoffer3,205 pointsBadges: Forgot Password No problem! Submit your e-mail address below. We'll send you an e-mail containing your password. Your password has been sent to: To follow this tag... There was an error processing your information. Please try again later. REGISTER or login: Forgot Password? By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy Thanks! We'll email you when relevant content is added and updated. Following

{ "url": "http://itknowledgeexchange.techtarget.com/itanswers/page/60/?offer=whp", "source_domain": "itknowledgeexchange.techtarget.com", "snapshot_id": "crawl=CC-MAIN-2016-22", "warc_metadata": { "Content-Length": "153598", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JV32YY6FTUO7E3RBNIBL5BG7OY3BC57Z", "WARC-Concurrent-To": "<urn:uuid:b769ebce-16a6-4cb6-b5d0-205e4a8ac274>", "WARC-Date": "2016-05-30T19:06:54Z", "WARC-IP-Address": "206.19.49.162", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:22ED7WG4BLJXCJW5WGGCTONKJKVRFVQQ", "WARC-Record-ID": "<urn:uuid:5ca48274-f13c-44bb-986a-92c848029035>", "WARC-Target-URI": "http://itknowledgeexchange.techtarget.com/itanswers/page/60/?offer=whp", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d4ade089-907c-4d8d-8fc5-b2ddbf300659>" }, "warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 20, 21, 81, 82, 381, 382, 410, 458, 459, 521, 522, 548, 572, 573, 608, 609, 639, 685, 686, 988, 989, 1018, 1058, 1059, 1357, 1358, 1394, 1421, 1422, 1465, 1466, 1496, 1568, 1569, 1751, 1752, 1783, 1826, 1827, 2133, 2134, 2169, 2222, 2223, 2341, 2342, 2372, 2392, 2393, 2504, 2505, 2533, 2565, 2566, 2873, 2874, 2903, 2970, 2971, 3089, 3090, 3125, 3164, 3165, 3369, 3370, 3400, 3477, 3478, 3602, 3603, 3637, 3661, 3662, 3834, 3835, 3863, 3916, 3917, 3995, 3996, 4023, 4112, 4113, 4174, 4175, 4201, 4237, 4238, 4312, 4313, 4340, 4390, 4391, 4464, 4465, 4494, 4540, 4541, 4713, 4714, 4750, 4751, 4767, 4768, 4865, 4866, 4898, 4899, 4921, 4922, 4994, 4995, 5014, 5015, 5032, 5251, 5252, 5320, 5321 ], "line_end_idx": [ 20, 21, 81, 82, 381, 382, 410, 458, 459, 521, 522, 548, 572, 573, 608, 609, 639, 685, 686, 988, 989, 1018, 1058, 1059, 1357, 1358, 1394, 1421, 1422, 1465, 1466, 1496, 1568, 1569, 1751, 1752, 1783, 1826, 1827, 2133, 2134, 2169, 2222, 2223, 2341, 2342, 2372, 2392, 2393, 2504, 2505, 2533, 2565, 2566, 2873, 2874, 2903, 2970, 2971, 3089, 3090, 3125, 3164, 3165, 3369, 3370, 3400, 3477, 3478, 3602, 3603, 3637, 3661, 3662, 3834, 3835, 3863, 3916, 3917, 3995, 3996, 4023, 4112, 4113, 4174, 4175, 4201, 4237, 4238, 4312, 4313, 4340, 4390, 4391, 4464, 4465, 4494, 4540, 4541, 4713, 4714, 4750, 4751, 4767, 4768, 4865, 4866, 4898, 4899, 4921, 4922, 4994, 4995, 5014, 5015, 5032, 5251, 5252, 5320, 5321, 5330 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5330, "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.3469785451889038, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.09259258955717087, "rps_doc_frac_lines_end_with_ellipsis": 0.04958678036928177, "rps_doc_frac_no_alph_words": 0.16764132678508759, "rps_doc_frac_unique_words": 0.43822842836380005, "rps_doc_mean_word_length": 4.748251914978027, "rps_doc_num_sentences": 70, "rps_doc_symbol_to_word_ratio": 0.005847950000315905, "rps_doc_unigram_entropy": 5.457776069641113, "rps_doc_word_count": 858, "rps_doc_frac_chars_dupe_10grams": 0.02896416001021862, "rps_doc_frac_chars_dupe_5grams": 0.06332842260599136, "rps_doc_frac_chars_dupe_6grams": 0.050564561039209366, "rps_doc_frac_chars_dupe_7grams": 0.04074620082974434, "rps_doc_frac_chars_dupe_8grams": 0.02896416001021862, "rps_doc_frac_chars_dupe_9grams": 0.02896416001021862, "rps_doc_frac_chars_top_2gram": 0.06062838062644005, "rps_doc_frac_chars_top_3gram": 0.0044182599522173405, "rps_doc_frac_chars_top_4gram": 0.00736377015709877, "rps_doc_books_importance": -425.283935546875, "rps_doc_books_importance_length_correction": -425.283935546875, "rps_doc_openwebtext_importance": -266.88775634765625, "rps_doc_openwebtext_importance_length_correction": -266.88775634765625, "rps_doc_wikipedia_importance": -121.8194580078125, "rps_doc_wikipedia_importance_length_correction": -121.8194580078125 }, "fasttext": { "dclm": 0.05462675914168358, "english": 0.9063687920570374, "fineweb_edu_approx": 1.2736009359359741, "eai_general_math": 0.01864599995315075, "eai_open_web_math": 0.08056288957595825, "eai_web_code": 0.0050112600438296795 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "2", "label": "Partially Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,056,083,393,921,533,000

Having problems with your PC Desktops ? I didnt get a boot disc with my computer and would like to make a copy Answers : On a new computer that didn't come with a reboot disk, they create a hidden partition on the hard drive to store this info. Provided that the hard drive has NEVER been re-formatted, it will still be there. Some manufatuers allow you to make a boot disk, others don't, in either case they do allow you to wipe your system and re-install their software at bootup. Hope this helps. Repair Help & Product Troubleshooting for PC Desktops Tips for a great answer: - Provide details, support with references or personal experience . - If you need clarification, ask it in the comment box . - It's 100% free, no registration required. Suggested Questions/Answers : How to install windows OS on Samsung N128 netbook My Windows XP installation has reached its half-life. (You do\015\012know that Windows has a half-life, don’t you? Every installation of\015\012Windows naturally degrades along a logarithmic curve until it becomes\015\012annoying, then ... Samsung N120-12GBK Netbook Missing NTLDR file The first thing to do is try to change back whatever hardware or software change you just made (this could be as simple as leaving a floppy disk in the drive or you need to reseat the IDE cables). If the contents of the drive are especially important ... ASUS Eee PC 2G Surf Notebook Reloading windows xp Replacement Drive? If you are talking about a Hard Drive the answer is: You can buy any hard drive as long as it is the same type from any computer store. Take your Hard Drive to the store and tell the sales person that you want another hard drive ... Dell Dimension 4600 PC Desktop The computer is asking for system diskette,what should i do? Are their any disks in the CD/DVD or the floppy drives? That would cause this. It is the most common cause. Is S.M.A.R.T. turned on in the BIOS? You will see a message during the POST that says it is enabled or disabled. The POST is the " ... Acer Veriton 7100 PC Desktop Windows failed to start !... Hello\015\012\015\012You seem to know a bit about computer so I will give you a good detailed solution which might be of help. READ CAREFULLY\015\012\015\012ASSUMPTION:\015\012 \015\012I guess that t ... Acer Aspire 5920-6727 Notebook Re: your suggestion for my Dell Lattitude D600 Hard Drive Problem Ok, now we have some good discourse! While I'd always prefer to use a friend's laptop to test my fringe hypotheses, having your own is a fine option too. And it sounds like you have an enclosure too, so you are pretty much all set. It's r ... PC Laptops Acer Aspire 5920 alt f10 to use my recovery dsk mismatch d2d32 This a very common error. I too have suffered from this but after about 15 hours of fighting with it.. I fix it. I could not use the ALT + F10 keys as I would get the D2D32 Type Mismatch Error. So lucky me when I got my laptop from acer I made the re ... Acer Aspire 5610-4648 Notebook Computer dies on me (can't say it better due to no technical knowledge; pls read :-) The 'click' sound you hear when your computer goes off is the hard drive head parking itself. It does this whenever the machine shuts down to prevent damage.As for the problem itself, I believe your computer is overheating. Th ... Acer TravelMate 290LCi Notebook My compaq desktop computer wont start up it keeps saying NTLDR missing Hi i have made lil resaerch for this problem so every user who suffurs from this problem can Fixt it on Fixya.com i wish this well helps everyone when u finish rate me plz cuz that was a day and half reasaerch took me a serious hard time but t(his i ... Compaq PC Desktops My HP Pavilion laptop will not boot. Usually the message about low virtual memory is because there isn't enough RAM and it was using up all the designated space on the hard drive as Virtual memory. (Uses a part of the hard drive like RAM)\015\012\015\012That shouldn't accoun ... HP Pavilion dv8000z Notebook I have a virus on my computer Toshiba Satellite You're going to need a few bits before you start:\0121) Drivers: Start here:http://uk.computers.toshiba-europe.com/innovation/download_drivers_bios.jsp...and download a complete set of drivers for the operating system yo ... Toshiba Satellite Pro A200-EZ2204X Notebook Having Trouble Reinstalling XP on my Dell Dimension 3000 Is the "New" HD in the system presently? If not install it. Boot from the original XP Restore disk (CD/DVD). When you get Windows going (from CD) go to COMPUTER and format your C: drive. Once this is done go ahead and run the Restore from the ori ... Dell Dimension 3000 PC Desktop Poweredge1300 no post Good news, you can save the machine, although it may take a while. There are a few ways to do this. If you are lucky enough that the boot sector of your BIOS didn't get corrupt and your computer still posts and you can put in a floppy. Then all you ... Dell PowerEdge 1300 Server Cant remember my password to my master screen name Password Recovery.\015\012Can't Log On to Windows XP?\015\012If that’s your only problem, then you probably have nothing to worry about. As long as you have your Windows XP CD, you can get back into your system using a simple but ef ... PC Desktops My PC has crashed and I had a few hundred pitures in my Kodak Gallery. Does this mean Iv}e lost them ?? Mrs E. Mc quade Hi gateside,\015\012\015\012When you say the computer crashed you mean Windows is not booting up to the desktop or it gives you a Blue screen error message on your monitor. If this is your case then your data actually is still in the hard ... PC Desktops I can log in to my computer i for got my password Assuming you are talking about logging in to Windows XP here are some things you can try:\015\012Windows XP Home Edition or Windows XP Professional in a workgroup\015\012loadTOCNode(3, 'whattotry');\015\012\015\012\015\012\015\0121.\015\0 ... Compaq PC Desktops My gateway g7-500 fails to start properly. Whemn power on I get a long beep followed by 2 short ones and the monitor screen remains black. Cause:This issue can be caused by any of the below situations.\015\012 \015\012\015\012New hardware conflicting with old hardware.\015\012Bad or failing hardware device.\015\012 ... PC Desktops Computer has frozen on windows logo 1) Which version of Windows ? For the following discussion I am assuming it is 2000, XP or higher. You may also want to print this, it's long.2) Is this this the low resolution Windows logo on the black scre ... Fujitsu Siemens SCALEO 600 (FSP:83C005617) PC Desktop Emergency Room: Code Blue If its a very old game then it might still run on dos. dos is the old operating system. you could run two opperating sytems if you want to do that then read this that i found on runing two opperating sytems\015\012\015\012First you need t ... Legacy Interactive Emergency Room: Code Blue for Windows I forget my computer password thatn is administator password in h . Place your Windows XP CD in your cd-rom and start yourcomputer (it’s assumed here that your XP CD is bootable – as it should be - and that you have your bios set to boot from CD)2. Keep your eye on the screen messages ... PC Desktops Instantaneous shutdown with no warnings! Software issue or errorErrors generated by software programs can cause a computer to reboot unexpectedly or without warning. If you are running Windows XP see the below section "For Windows XP users" before continuing. \015\012If you are not ru ... Toshiba Satellite A105 Notebook Forgotten Password need help to unlock my laptop I forgot my password Good.\015\012If that’s your only problem, then you probably have nothing to worry about. As long as you have your Windows XP CD, you can get back into your system using a simple but effective method made possible by a little known access ... Acer Aspire 3690-2196 Notebook I have a Acer 9410Z. I can't unlock it Hi Robert\015\012\015\012\015\012Please follow this procedure to change the password:\015\012\015\012\015\012\015\012\015\012XP. Go into safe mode by re-starting the computer and \015\012pressing F8 repeat ... Acer PC Laptops How do i format it Process for Windows XP Re-installationWINDOWS RE-INSTALLATION WILL WIPE OFF ALL THE DATA.1. Insert Windows XP operating System Disk In The CD Drive.2. Shut Down The system.3. Disconnect Everythi ... Dell Dimension 4600 PC Desktop My computer got broke so i installed new installion of windows xp and now that one got messed up and i need to restore the factory settings but i cant get the d2d erecovery to work can you help me my computer is an acer aspire one series mother board aoa150 Hi there !!Thank you for posting your question at FixYa.comYou have a partition on your hard drive that contains the backup\015\012image.If you can't see a drive D: or E: on "my computer" that means the\015\012partition is hid ... PC Laptops • Start your question with What, Why, How, When, etc. and end with a "?" • Be clear and specific • Use proper spelling and grammar all rights reserved to the respective owners || www.electronic-servicing.com || Terms of Use || Contact || Privacy Policy Load time: 1.5595 seconds

{ "url": "http://www.electronic-servicing.com/_pc_desktops/q1367611-didnt_get_boot", "source_domain": "www.electronic-servicing.com", "snapshot_id": "crawl=CC-MAIN-2017-13", "warc_metadata": { "Content-Length": "26206", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NZA7EVLULSENYPFSQ5YLYYJS322SB3XB", "WARC-Concurrent-To": "<urn:uuid:0139e08c-329c-467d-8793-7d1314316622>", "WARC-Date": "2017-03-23T10:41:34Z", "WARC-IP-Address": "104.27.178.222", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:OEIVCHVV2J6M35RTMZNDWD77RYTAG7KP", "WARC-Record-ID": "<urn:uuid:fef0e3e1-62aa-48e6-942b-7bbf8a1ebb54>", "WARC-Target-URI": "http://www.electronic-servicing.com/_pc_desktops/q1367611-didnt_get_boot", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:221b773b-495a-46f2-b936-1241ae6df294>" }, "warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 1, 41, 42, 113, 114, 115, 125, 126, 505, 559, 560, 585, 586, 654, 711, 755, 756, 786, 787, 837, 838, 839, 1106, 1107, 1126, 1127, 1128, 1412, 1413, 1434, 1435, 1436, 1719, 1720, 1781, 1782, 1783, 2055, 2056, 2085, 2086, 2087, 2322, 2323, 2389, 2390, 2391, 2645, 2646, 2709, 2710, 2711, 2997, 2998, 3083, 3084, 3085, 3350, 3351, 3422, 3423, 3424, 3697, 3698, 3735, 3736, 3737, 4009, 4010, 4058, 4059, 4060, 4330, 4331, 4388, 4389, 4390, 4672, 4673, 4695, 4696, 4697, 4977, 4978, 5029, 5030, 5031, 5280, 5281, 5401, 5402, 5403, 5658, 5659, 5709, 5710, 5711, 5973, 5974, 6113, 6114, 6115, 6309, 6310, 6346, 6347, 6348, 6614, 6615, 6641, 6642, 6643, 6943, 6944, 7010, 7011, 7012, 7248, 7249, 7290, 7291, 7292, 7573, 7574, 7644, 7645, 7646, 7919, 7920, 7959, 7960, 7961, 8187, 8188, 8207, 8208, 8209, 8439, 8440, 8698, 8699, 8700, 8942, 9017, 9043, 9079, 9201 ], "line_end_idx": [ 1, 41, 42, 113, 114, 115, 125, 126, 505, 559, 560, 585, 586, 654, 711, 755, 756, 786, 787, 837, 838, 839, 1106, 1107, 1126, 1127, 1128, 1412, 1413, 1434, 1435, 1436, 1719, 1720, 1781, 1782, 1783, 2055, 2056, 2085, 2086, 2087, 2322, 2323, 2389, 2390, 2391, 2645, 2646, 2709, 2710, 2711, 2997, 2998, 3083, 3084, 3085, 3350, 3351, 3422, 3423, 3424, 3697, 3698, 3735, 3736, 3737, 4009, 4010, 4058, 4059, 4060, 4330, 4331, 4388, 4389, 4390, 4672, 4673, 4695, 4696, 4697, 4977, 4978, 5029, 5030, 5031, 5280, 5281, 5401, 5402, 5403, 5658, 5659, 5709, 5710, 5711, 5973, 5974, 6113, 6114, 6115, 6309, 6310, 6346, 6347, 6348, 6614, 6615, 6641, 6642, 6643, 6943, 6944, 7010, 7011, 7012, 7248, 7249, 7290, 7291, 7292, 7573, 7574, 7644, 7645, 7646, 7919, 7920, 7959, 7960, 7961, 8187, 8188, 8207, 8208, 8209, 8439, 8440, 8698, 8699, 8700, 8942, 9017, 9043, 9079, 9201, 9226 ] }

{ "red_pajama_v2": { "ccnet_original_length": 9226, "ccnet_original_nlines": 147, "rps_doc_curly_bracket": 0.00010838999878615141, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3724413514137268, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.058911629021167755, "rps_doc_frac_lines_end_with_ellipsis": 0.0067567601799964905, "rps_doc_frac_no_alph_words": 0.20619070529937744, "rps_doc_frac_unique_words": 0.3921824097633362, "rps_doc_mean_word_length": 4.658631801605225, "rps_doc_num_sentences": 118, "rps_doc_symbol_to_word_ratio": 0.013479780405759811, "rps_doc_unigram_entropy": 5.6737284660339355, "rps_doc_word_count": 1535, "rps_doc_frac_chars_dupe_10grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_5grams": 0.043909940868616104, "rps_doc_frac_chars_dupe_6grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_7grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_8grams": 0.036638230085372925, "rps_doc_frac_chars_dupe_9grams": 0.036638230085372925, "rps_doc_frac_chars_top_2gram": 0.015102780424058437, "rps_doc_frac_chars_top_3gram": 0.008390430361032486, "rps_doc_frac_chars_top_4gram": 0.006292830221354961, "rps_doc_books_importance": -830.1620483398438, "rps_doc_books_importance_length_correction": -830.1620483398438, "rps_doc_openwebtext_importance": -471.31195068359375, "rps_doc_openwebtext_importance_length_correction": -471.31195068359375, "rps_doc_wikipedia_importance": -331.9764709472656, "rps_doc_wikipedia_importance_length_correction": -331.9764709472656 }, "fasttext": { "dclm": 0.019672630354762077, "english": 0.9024404287338257, "fineweb_edu_approx": 1.2412397861480713, "eai_general_math": 0.11632537841796875, "eai_open_web_math": 0.2695961594581604, "eai_web_code": 0.024815740063786507 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "005.456", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,260,501,650,580,964,000

Command-line Utilities for Everybody Else Here's a common problem: you've written a beautiful command-line utility - it's clean, it's refactored, it frankly sparkles. You tell folks about it, they want it, you send it to them. But, they won't use it. Why? Because there's no GUI and people love their GUIs. The people hates the command-line. What you need to do is wrap a GUI around your command-line utility. Not only that but for a minimum level of usability, your GUI better be: • cross-platform: works in any of the holy triumvirate of Windows, Unix or Mac • native look-and-feel: so people don't get put off opening files • easy-to-install: should not require esoteric knowledge Now there are existing solutions that are close but not quite there. For example, gooey is a clever library that wraps a GUI around Python command-line utilities. The downside of gooey is that it uses wxPython. Installing wxPython is difficult for end-users. If you have a standard Python distribution (and that's a big if), then you can install wxPython from the website, but you need to know the exact binary version of your Python. Otherwise, you need a C-compiler ecosystem. Trivial, right? Another solution might be to run a local web-server, which serves a local web-app to talk to your command-line utility. Sadly, webbrowsers are limited by a security feature, whereby open file dialogs are prevented from sending full pathnames to your webapp. This will cripple your command-line utility. Well it turns there is a solution using plain old standard Python. Every Python install comes with a GUI library tkinter that is native to a certain extent. tkinter is not very powerful, but offers just enough features to build a GUI for a command-line utility. Since tkinter comes standard with Python on all 3 major platforms, your only requirement is to install Python (which is easy), and you get a cross-platform solution with native file dialogs for free! So I wrote a module - tkform (http://github.com/boscoh/tkform) - that can wrap a tkinter GUI around command-line utilities. It's work flow is inspired by HTML forms. You construct the GUI in a linear fashion that will populate a single flowable page. There is a submit button at the bottom. When clicked with submit, your 'run' hook will get a JSON compatible parameter list that you can send to your command-line utility. You get a bunch of widgets (checkbox, radio buttions, text labels, file lists) and some decorators (size-adjustable text, lines, spaces), and buttons for extra actions. You get a nice output area to display logging information. It even gracefuly handles Python exceptions. There are links to click on to send your user to the ouput. I've even included a reoderable list widget that can display a list of filenames and elements that can be reordered and renamed, before the 'submit' button is pressed. This way your command-line utility can receive a list of filenames, ordered to your end-user's content. Imagine asking your end-user to do that on the command-line? And it's easy to install. Just ask your end-user to install Python, then download your package which includes the tkform library with your Python command-line utility. Add an '-i' interactive option to your utility to trigger the GUI. Include a clickable shell/command/batch file and tell your user to click that. Easy as.

{ "url": "http://boscoh.com/programming/command-line-utilities-for-everybody-else.html", "source_domain": "boscoh.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "6505", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:O244H5RTES7TACNZSEWM5JZXGLAB4Y4T", "WARC-Concurrent-To": "<urn:uuid:c1dfa339-0da2-4319-9d23-c930c593306d>", "WARC-Date": "2017-02-24T03:54:06Z", "WARC-IP-Address": "208.113.171.17", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:6TXIJLBRXOWZVEVPJ2TLI64DSONY5HVG", "WARC-Record-ID": "<urn:uuid:325005de-d170-44a9-9f62-2e7eda7bc520>", "WARC-Target-URI": "http://boscoh.com/programming/command-line-utilities-for-everybody-else.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bb6b8ab6-d1ad-4da9-8ee5-64add7d10cb0>" }, "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, 42, 43, 257, 258, 344, 345, 485, 486, 567, 635, 694, 695, 1190, 1191, 1494, 1495, 1957, 1958, 2381, 2382, 2715, 2716, 3049, 3050 ], "line_end_idx": [ 42, 43, 257, 258, 344, 345, 485, 486, 567, 635, 694, 695, 1190, 1191, 1494, 1495, 1957, 1958, 2381, 2382, 2715, 2716, 3049, 3050, 3372 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3372, "ccnet_original_nlines": 24, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3681318759918213, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.01923076994717121, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18681319057941437, "rps_doc_frac_unique_words": 0.4809437394142151, "rps_doc_mean_word_length": 4.834845542907715, "rps_doc_num_sentences": 39, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.053625583648682, "rps_doc_word_count": 551, "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.054054051637649536, "rps_doc_frac_chars_top_3gram": 0.041291289031505585, "rps_doc_frac_chars_top_4gram": 0.018018020316958427, "rps_doc_books_importance": -376.7606201171875, "rps_doc_books_importance_length_correction": -376.7606201171875, "rps_doc_openwebtext_importance": -198.8604736328125, "rps_doc_openwebtext_importance_length_correction": -198.8604736328125, "rps_doc_wikipedia_importance": -149.57122802734375, "rps_doc_wikipedia_importance_length_correction": -149.57122802734375 }, "fasttext": { "dclm": 0.506603479385376, "english": 0.9198455214500427, "fineweb_edu_approx": 1.5677911043167114, "eai_general_math": 0.6690616011619568, "eai_open_web_math": 0.20538294315338135, "eai_web_code": 0.7836549282073975 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "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

-3,158,257,403,498,964,500

Class: ActiveMerchant::Billing::AdyenGateway Inherits: Gateway • Object show all Defined in: lib/active_merchant/billing/gateways/adyen.rb Constant Summary collapse PAYMENT_API_VERSION = 'v40' RECURRING_API_VERSION = 'v30' STANDARD_ERROR_CODE_MAPPING = { '101' => STANDARD_ERROR_CODE[:incorrect_number], '103' => STANDARD_ERROR_CODE[:invalid_cvc], '131' => STANDARD_ERROR_CODE[:incorrect_address], '132' => STANDARD_ERROR_CODE[:incorrect_address], '133' => STANDARD_ERROR_CODE[:incorrect_address], '134' => STANDARD_ERROR_CODE[:incorrect_address], '135' => STANDARD_ERROR_CODE[:incorrect_address] } Constants inherited from Gateway Gateway::CREDIT_DEPRECATION_MESSAGE, Gateway::RECURRING_DEPRECATION_MESSAGE, Gateway::STANDARD_ERROR_CODE Instance Attribute Summary Attributes inherited from Gateway #options Instance Method Summary collapse Methods inherited from Gateway #add_field_to_post_if_present, #add_fields_to_post_if_present, #card_brand, card_brand, #generate_unique_id, inherited, supported_countries, #supported_countries, supported_countries=, supports?, #supports_network_tokenization?, #test? Methods included from CreditCardFormatting #expdate, #format Methods included from PostsData included, #raw_ssl_request, #ssl_get, #ssl_post, #ssl_request Constructor Details #initialize(options = {}) ⇒ AdyenGateway Returns a new instance of AdyenGateway. 32 33 34 35 36 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 32 def initialize(options = {}) requires!(options, :username, :password, :merchant_account) @username, @password, @merchant_account = options.values_at(:username, :password, :merchant_account) super end Instance Method Details #adjust(money, authorization, options = {}) ⇒ Object 96 97 98 99 100 101 102 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 96 def adjust(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_reference(post, authorization, options) add_extra_data(post, nil, options) commit('adjustAuthorisation', post, options) end #authorize(money, payment, options = {}) ⇒ Object 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 49 def authorize(money, payment, options = {}) requires!(options, :order_id) post = init_post(options) add_invoice(post, money, options) add_payment(post, payment, options) add_extra_data(post, payment, options) add_stored_credentials(post, payment, options) add_address(post, options) add_installments(post, options) if options[:installments] add_3ds(post, options) add_3ds_authenticated_data(post, options) add_splits(post, options) add_recurring_contract(post, options) commit('authorise', post, options) end #capture(money, authorization, options = {}) ⇒ Object 65 66 67 68 69 70 71 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 65 def capture(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_reference(post, authorization, options) add_splits(post, options) commit('capture', post, options) end #credit(money, payment, options = {}) ⇒ Object 81 82 83 84 85 86 87 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 81 def credit(money, payment, options = {}) post = init_post(options) add_invoice(post, money, options) add_payment(post, payment, options) add_shopper_reference(post, options) commit('refundWithData', post, options) end #purchase(money, payment, options = {}) ⇒ Object 38 39 40 41 42 43 44 45 46 47 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 38 def purchase(money, payment, options = {}) if options[:execute_threed] || options[:threed_dynamic] authorize(money, payment, options) else MultiResponse.run do |r| r.process { authorize(money, payment, options) } r.process { capture(money, r.authorization, capture_options(options)) } end end end #refund(money, authorization, options = {}) ⇒ Object 73 74 75 76 77 78 79 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 73 def refund(money, authorization, options = {}) post = init_post(options) add_invoice_for_modification(post, money, options) add_original_reference(post, authorization, options) add_splits(post, options) commit('refund', post, options) end #scrub(transcript) ⇒ Object 150 151 152 153 154 155 156 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 150 def scrub(transcript) transcript. gsub(%r((Authorization: Basic )\w+), '\1[FILTERED]'). gsub(%r(("number\\?":\\?")[^"]*)i, '\1[FILTERED]'). gsub(%r(("cvc\\?":\\?")[^"]*)i, '\1[FILTERED]'). gsub(%r(("cavv\\?":\\?")[^"]*)i, '\1[FILTERED]') end #store(credit_card, options = {}) ⇒ Object 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 104 def store(credit_card, options = {}) requires!(options, :order_id) post = init_post(options) add_invoice(post, 0, options) add_payment(post, credit_card, options) add_extra_data(post, credit_card, options) add_stored_credentials(post, credit_card, options) add_address(post, options) options[:recurring_contract_type] ||= 'RECURRING' add_recurring_contract(post, options) action = options[:tokenize_only] ? 'storeToken' : 'authorise' initial_response = commit(action, post, options) if initial_response.success? && card_not_stored?(initial_response) unsupported_failure_response(initial_response) else initial_response end end #supports_scrubbing?Boolean Returns: • (Boolean) 146 147 148 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 146 def supports_scrubbing? true end #unstore(options = {}) ⇒ Object 127 128 129 130 131 132 133 134 135 136 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 127 def unstore(options = {}) requires!(options, :shopper_reference, :recurring_detail_reference) post = {} add_shopper_reference(post, options) (post, options) post[:recurringDetailReference] = options[:recurring_detail_reference] commit('disable', post, options) end #verify(credit_card, options = {}) ⇒ Object 138 139 140 141 142 143 144 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 138 def verify(credit_card, options = {}) MultiResponse.run(:use_first_response) do |r| r.process { authorize(0, credit_card, options) } options[:idempotency_key] = nil r.process(:ignore_result) { void(r.authorization, options) } end end #void(authorization, options = {}) ⇒ Object 89 90 91 92 93 94 # File 'lib/active_merchant/billing/gateways/adyen.rb', line 89 def void(authorization, options = {}) post = init_post(options) endpoint = options[:cancel_or_refund] ? 'cancelOrRefund' : 'cancel' add_reference(post, authorization, options) commit(endpoint, post, options) end

{ "url": "https://rubydoc.info/github/Shopify/active_merchant/ActiveMerchant/Billing/AdyenGateway", "source_domain": "rubydoc.info", "snapshot_id": "crawl=CC-MAIN-2021-39", "warc_metadata": { "Content-Length": "62948", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QLQNS3FFC3FICXH3QTU6RZITMTP4Q2BW", "WARC-Concurrent-To": "<urn:uuid:0ca83099-0abe-4b6c-ae54-a215e5dcbcd2>", "WARC-Date": "2021-09-20T08:57:02Z", "WARC-IP-Address": "172.67.194.167", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3DFK2F66TCKMOQNEIOUAXSMYBLRAGXZL", "WARC-Record-ID": "<urn:uuid:fcc13d9e-2942-4e69-8ba1-9db2e62b9f54>", "WARC-Target-URI": "https://rubydoc.info/github/Shopify/active_merchant/ActiveMerchant/Billing/AdyenGateway", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b1a4dfaa-8ede-4420-b8a7-9c4558e4500c>" }, "warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-93\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, 45, 46, 56, 64, 75, 84, 96, 142, 143, 169, 170, 192, 198, 222, 228, 258, 260, 311, 357, 409, 461, 513, 565, 616, 618, 619, 652, 653, 759, 760, 787, 788, 822, 823, 832, 833, 866, 867, 898, 899, 1135, 1136, 1179, 1180, 1198, 1199, 1231, 1232, 1294, 1295, 1315, 1316, 1357, 1358, 1398, 1399, 1400, 1403, 1406, 1409, 1412, 1415, 1479, 1480, 1509, 1571, 1674, 1682, 1686, 1687, 1711, 1712, 1765, 1766, 1767, 1770, 1773, 1776, 1779, 1783, 1787, 1791, 1855, 1856, 1903, 1931, 1984, 2030, 2067, 2114, 2118, 2119, 2169, 2170, 2171, 2174, 2177, 2180, 2183, 2186, 2189, 2192, 2195, 2198, 2201, 2204, 2207, 2210, 2213, 2216, 2280, 2281, 2325, 2357, 2385, 2421, 2459, 2500, 2549, 2578, 2638, 2663, 2707, 2735, 2775, 2812, 2816, 2817, 2871, 2872, 2873, 2876, 2879, 2882, 2885, 2888, 2891, 2894, 2958, 2959, 3007, 3035, 3088, 3134, 3162, 3197, 3201, 3202, 3249, 3250, 3251, 3254, 3257, 3260, 3263, 3266, 3269, 3272, 3336, 3337, 3378, 3406, 3442, 3480, 3519, 3561, 3565, 3566, 3615, 3616, 3617, 3620, 3623, 3626, 3629, 3632, 3635, 3638, 3641, 3644, 3647, 3711, 3712, 3755, 3813, 3852, 3859, 3888, 3943, 4021, 4029, 4035, 4039, 4040, 4093, 4094, 4095, 4098, 4101, 4104, 4107, 4110, 4113, 4116, 4180, 4181, 4228, 4256, 4309, 4364, 4392, 4426, 4430, 4431, 4459, 4460, 4461, 4465, 4469, 4473, 4477, 4481, 4485, 4489, 4554, 4555, 4577, 4591, 4649, 4705, 4758, 4811, 4815, 4816, 4859, 4860, 4861, 4865, 4869, 4873, 4877, 4881, 4885, 4889, 4893, 4897, 4901, 4905, 4909, 4913, 4917, 4921, 4925, 4929, 4933, 4937, 4941, 4945, 4949, 5014, 5015, 5052, 5084, 5112, 5144, 5186, 5231, 5284, 5313, 5314, 5366, 5406, 5407, 5471, 5472, 5523, 5524, 5593, 5644, 5651, 5672, 5678, 5682, 5683, 5711, 5712, 5721, 5722, 5736, 5737, 5741, 5745, 5749, 5814, 5815, 5839, 5846, 5850, 5851, 5883, 5884, 5885, 5889, 5893, 5897, 5901, 5905, 5909, 5913, 5917, 5921, 5925, 5990, 5991, 6017, 6087, 6099, 6100, 6139, 6157, 6230, 6231, 6266, 6270, 6271, 6315, 6316, 6317, 6321, 6325, 6329, 6333, 6337, 6341, 6345, 6410, 6411, 6449, 6497, 6550, 6586, 6651, 6657, 6661, 6662, 6706, 6707, 6708, 6711, 6714, 6717, 6720, 6723, 6726, 6790, 6791, 6829, 6857, 6927, 6973, 7007 ], "line_end_idx": [ 45, 46, 56, 64, 75, 84, 96, 142, 143, 169, 170, 192, 198, 222, 228, 258, 260, 311, 357, 409, 461, 513, 565, 616, 618, 619, 652, 653, 759, 760, 787, 788, 822, 823, 832, 833, 866, 867, 898, 899, 1135, 1136, 1179, 1180, 1198, 1199, 1231, 1232, 1294, 1295, 1315, 1316, 1357, 1358, 1398, 1399, 1400, 1403, 1406, 1409, 1412, 1415, 1479, 1480, 1509, 1571, 1674, 1682, 1686, 1687, 1711, 1712, 1765, 1766, 1767, 1770, 1773, 1776, 1779, 1783, 1787, 1791, 1855, 1856, 1903, 1931, 1984, 2030, 2067, 2114, 2118, 2119, 2169, 2170, 2171, 2174, 2177, 2180, 2183, 2186, 2189, 2192, 2195, 2198, 2201, 2204, 2207, 2210, 2213, 2216, 2280, 2281, 2325, 2357, 2385, 2421, 2459, 2500, 2549, 2578, 2638, 2663, 2707, 2735, 2775, 2812, 2816, 2817, 2871, 2872, 2873, 2876, 2879, 2882, 2885, 2888, 2891, 2894, 2958, 2959, 3007, 3035, 3088, 3134, 3162, 3197, 3201, 3202, 3249, 3250, 3251, 3254, 3257, 3260, 3263, 3266, 3269, 3272, 3336, 3337, 3378, 3406, 3442, 3480, 3519, 3561, 3565, 3566, 3615, 3616, 3617, 3620, 3623, 3626, 3629, 3632, 3635, 3638, 3641, 3644, 3647, 3711, 3712, 3755, 3813, 3852, 3859, 3888, 3943, 4021, 4029, 4035, 4039, 4040, 4093, 4094, 4095, 4098, 4101, 4104, 4107, 4110, 4113, 4116, 4180, 4181, 4228, 4256, 4309, 4364, 4392, 4426, 4430, 4431, 4459, 4460, 4461, 4465, 4469, 4473, 4477, 4481, 4485, 4489, 4554, 4555, 4577, 4591, 4649, 4705, 4758, 4811, 4815, 4816, 4859, 4860, 4861, 4865, 4869, 4873, 4877, 4881, 4885, 4889, 4893, 4897, 4901, 4905, 4909, 4913, 4917, 4921, 4925, 4929, 4933, 4937, 4941, 4945, 4949, 5014, 5015, 5052, 5084, 5112, 5144, 5186, 5231, 5284, 5313, 5314, 5366, 5406, 5407, 5471, 5472, 5523, 5524, 5593, 5644, 5651, 5672, 5678, 5682, 5683, 5711, 5712, 5721, 5722, 5736, 5737, 5741, 5745, 5749, 5814, 5815, 5839, 5846, 5850, 5851, 5883, 5884, 5885, 5889, 5893, 5897, 5901, 5905, 5909, 5913, 5917, 5921, 5925, 5990, 5991, 6017, 6087, 6099, 6100, 6139, 6157, 6230, 6231, 6266, 6270, 6271, 6315, 6316, 6317, 6321, 6325, 6329, 6333, 6337, 6341, 6345, 6410, 6411, 6449, 6497, 6550, 6586, 6651, 6657, 6661, 6662, 6706, 6707, 6708, 6711, 6714, 6717, 6720, 6723, 6726, 6790, 6791, 6829, 6857, 6927, 6973, 7007, 7010 ] }

{ "red_pajama_v2": { "ccnet_original_length": 7010, "ccnet_original_nlines": 361, "rps_doc_curly_bracket": 0.007988589815795422, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.02345415949821472, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.012793179601430893, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5593461394309998, "rps_doc_frac_unique_words": 0.4755244851112366, "rps_doc_mean_word_length": 8.835664749145508, "rps_doc_num_sentences": 46, "rps_doc_symbol_to_word_ratio": 0.02842927910387516, "rps_doc_unigram_entropy": 4.963043689727783, "rps_doc_word_count": 572, "rps_doc_frac_chars_dupe_10grams": 0.04590423032641411, "rps_doc_frac_chars_dupe_5grams": 0.1086268275976181, "rps_doc_frac_chars_dupe_6grams": 0.1086268275976181, "rps_doc_frac_chars_dupe_7grams": 0.09062129259109497, "rps_doc_frac_chars_dupe_8grams": 0.07479224354028702, "rps_doc_frac_chars_dupe_9grams": 0.04590423032641411, "rps_doc_frac_chars_top_2gram": 0.11060546338558197, "rps_doc_frac_chars_top_3gram": 0.12089434266090393, "rps_doc_frac_chars_top_4gram": 0.01602691039443016, "rps_doc_books_importance": -442.384033203125, "rps_doc_books_importance_length_correction": -442.384033203125, "rps_doc_openwebtext_importance": -265.34027099609375, "rps_doc_openwebtext_importance_length_correction": -265.34027099609375, "rps_doc_wikipedia_importance": -90.21688842773438, "rps_doc_wikipedia_importance_length_correction": -90.21688842773438 }, "fasttext": { "dclm": 0.5487456917762756, "english": 0.4074065387248993, "fineweb_edu_approx": 2.6703245639801025, "eai_general_math": 0.6470960378646851, "eai_open_web_math": 0.5244587063789368, "eai_web_code": 0.11348426342010498 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "658.85", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Business", "level_3": "Management" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

624,690,978,643,358,700

How Can I Unblock and Access Sky Atlantic Abroad With a VPN? Sky Atlantic is home to the superb series the Game of Thrones, along with many other series unavailable on any other channel. With Sky Atlantic airing the final series of GOT, you will not want to miss finding out who will rule the Iron Throne. If you go abroad and you are restricted from watching GOT, you’re thinking of one question – how can I unblock and access Sky Atlantic abroad? Let’s talk more about our solution! Why Sky Atlantic Imposes Geo-Restrictions? So, what are geo-restrictions, and why are they put into place? This is a very good question. It all comes down to licensing rights. It may also be partly due to restrictions of being able to show content containing certain elements. This might include scenes such as gambling, in countries where gambling is prohibited. Whatever the reason, if you go to a country where Sky Atlantic is not licensed, you cannot watch it. This leads to you asking how to unblock and stream Sky Atlantic abroad. How Restrictions are Applied? Different countries around the world have a different range of IP addresses. Whenever you access a website or app, your IP address is noted and this is what stops or allows you to gain access to licensed content. Networks will know you’re not within one of the regions where Sky Atlantic streams its content, so you cannot access it. The answer to overcoming blocks and the question of how can I stream Sky Atlantic outside of the UK is changing your IP address. The downside is that doing so is not as simple as changing it yourself. You cannot simply choose an IP. For one, you would not know the range of IP addresses used in different countries. You cannot change it without help from a Virtual Private Network. How Does a VPN Help? ExpressVPN is an excellent choice, being the best provider on the market. We will look at some of the reasons we recommend them to people wondering how to watch Sky Atlantic abroad later. Before moving on and how you can overcome restrictions, we will explain how a VPN helps when you want to have websites believe you are located in the UK. This will also help you stream ITV abroad while using a UK IP address. ExpressVPN has 3,000 super-fast servers based in 94 countries around the world. When you take a subscription with them, they allow you to download software and connect to any of their servers. While you do not need to know all the ins-and-outs of a VPN when wondering how can I access Sky Atlantic outside of the UK, you need to understand that you have to choose a server based in the UK. Therefore, ExpressVPN helps by providing you with access to servers offering IP addresses in the country you need to unblock and watch Sky Atlantic. How to access Sky Atlantic abroad Change IP with ExpressVPN > Guide to Stream Sky Atlantic Abroad How to stream Sky Atlantic abroad Now that we have explained why geo-restrictions apply, how they are applied, and how a VPN can help you, we will continue with our tutorial to answer your question of how can I unblock and access Sky Atlantic abroad. 1. Step one – choose a plan from ExpressVPN. You can make savings of up to 49% if you decide to go with a yearly plan and get 15 months when paying for 12 months. 2. Download the software for your chosen device. There is a wide range of devices to choose from. 3. Install the software and open it up. 4. Choose a UK-based server and click connect. This is important in answering how to stream Sky Atlantic outside the United Kingdom. 5. You now have an IP address in the UK and can watch Sky Atlantic. Why Choose ExpressVPN? ExpressVPN Sky GO With a VPN in place, you can overcome the restrictions imposed by the networks and watch what you want, wherever you want. There are many good reasons for choosing ExpressVPN, some of which we have highlighted below. Of course, you can know much more about it if you read our ExpressVPN comprehensive review. ExpressVPN offers a range of plans suitable for all budgets with the biggest savings made on yearly plans. Now that you have found out how to access Sky Atlantic abroad with a VPN, you might wish to sign up for 12 months, save 49%, and get 15 months of online protection. Furthermore, the provider offers more than 3,000 servers located in 160 locations in 94 countries. All of the servers offer blazing -fast speed, which is precisely what’s needed when streaming HD content from other countries. After all, there is nothing worse than stuttering and pauses that occur just at the crucial moment in your program. Get ExpressVPN now > Summary You have found the answer to how can I unblock and access Sky Atlantic abroad. However, did you also know that ExpressVPN offers plenty of security features to protect you during day-to-day internet browsing? These include IPv6 leak protection along with DNS leak protection and more. What’s more, they offer full protection thanks to the 30-day money-back guarantee with no quibbles. Not that you are going to need it, but hey… With everything said, we recommend ExpressVPN for unblocking Sky Atlantic abroad. Grab your subscription and start streaming now! We will be happy to hear your thoughts Leave a reply This site uses Akismet to reduce spam. Learn how your comment data is processed. The-bestvpn : the reference on the VPNs

{ "url": "https://the-bestvpn.com/unblock-sky-atlantic/", "source_domain": "the-bestvpn.com", "snapshot_id": "crawl=CC-MAIN-2021-31", "warc_metadata": { "Content-Length": "102154", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5CDW3OHJIFZJR4CZOFYOOBX7MXUDSODJ", "WARC-Concurrent-To": "<urn:uuid:ca4ed95e-8d70-4bdf-bd1d-767434cd844d>", "WARC-Date": "2021-07-26T14:13:49Z", "WARC-IP-Address": "104.21.63.131", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:4EB44SSYKUU2AIFYLL4SU3AE43SLCKDX", "WARC-Record-ID": "<urn:uuid:fb13c7d7-38f0-4207-b9c1-1a8352e15a6d>", "WARC-Target-URI": "https://the-bestvpn.com/unblock-sky-atlantic/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e0f58d33-feba-46e9-810b-3a9f3b300a3f>" }, "warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-157.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, 61, 62, 486, 487, 530, 531, 664, 665, 954, 955, 1027, 1028, 1058, 1059, 1272, 1273, 1523, 1524, 1711, 1712, 1778, 1779, 1800, 1801, 1989, 1990, 2144, 2145, 2216, 2217, 2410, 2411, 2608, 2609, 2758, 2759, 2793, 2794, 2822, 2823, 2859, 2860, 2894, 2895, 3112, 3113, 3278, 3378, 3420, 3555, 3625, 3626, 3649, 3650, 3668, 3669, 3886, 3887, 3979, 3980, 4252, 4253, 4479, 4480, 4596, 4597, 4618, 4619, 4627, 4628, 4913, 4914, 5058, 5059, 5189, 5190, 5229, 5230, 5250, 5251, 5338, 5339 ], "line_end_idx": [ 61, 62, 486, 487, 530, 531, 664, 665, 954, 955, 1027, 1028, 1058, 1059, 1272, 1273, 1523, 1524, 1711, 1712, 1778, 1779, 1800, 1801, 1989, 1990, 2144, 2145, 2216, 2217, 2410, 2411, 2608, 2609, 2758, 2759, 2793, 2794, 2822, 2823, 2859, 2860, 2894, 2895, 3112, 3113, 3278, 3378, 3420, 3555, 3625, 3626, 3649, 3650, 3668, 3669, 3886, 3887, 3979, 3980, 4252, 4253, 4479, 4480, 4596, 4597, 4618, 4619, 4627, 4628, 4913, 4914, 5058, 5059, 5189, 5190, 5229, 5230, 5250, 5251, 5338, 5339, 5384 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5384, "ccnet_original_nlines": 82, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.44382545351982117, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03249768167734146, "rps_doc_frac_lines_end_with_ellipsis": 0.012048190459609032, "rps_doc_frac_no_alph_words": 0.1309192180633545, "rps_doc_frac_unique_words": 0.35927504301071167, "rps_doc_mean_word_length": 4.543710231781006, "rps_doc_num_sentences": 63, "rps_doc_symbol_to_word_ratio": 0.0009285099804401398, "rps_doc_unigram_entropy": 5.167323112487793, "rps_doc_word_count": 938, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.09619896858930588, "rps_doc_frac_chars_dupe_6grams": 0.06616611778736115, "rps_doc_frac_chars_dupe_7grams": 0.046691689640283585, "rps_doc_frac_chars_dupe_8grams": 0.03754106163978577, "rps_doc_frac_chars_dupe_9grams": 0.03754106163978577, "rps_doc_frac_chars_top_2gram": 0.054199911653995514, "rps_doc_frac_chars_top_3gram": 0.04387611150741577, "rps_doc_frac_chars_top_4gram": 0.032379161566495895, "rps_doc_books_importance": -468.5501708984375, "rps_doc_books_importance_length_correction": -468.5501708984375, "rps_doc_openwebtext_importance": -305.6188659667969, "rps_doc_openwebtext_importance_length_correction": -305.6188659667969, "rps_doc_wikipedia_importance": -216.50442504882812, "rps_doc_wikipedia_importance_length_correction": -216.50442504882812 }, "fasttext": { "dclm": 0.24502778053283691, "english": 0.9531521797180176, "fineweb_edu_approx": 1.378546118736267, "eai_general_math": 0.027918219566345215, "eai_open_web_math": 0.15386205911636353, "eai_web_code": 0.012669919990003109 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.677", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "389.29", "labels": { "level_1": "Social sciences", "level_2": "Commerce and Communication and traffic", "level_3": "Weights and measures and Metrology" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "6", "label": "Promotional/Advertisement" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "17", "label": "Product Page" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

3,287,823,237,323,454,000

Altova StyleVision 2022 Professional Edition Authentic View Context Menus Home Prev Top Next Right-clicking on some selected document content or node pops up a context menu with commands relevant to the selection or cursor location. Inserting elements The figure below shows the Insert submenu, which is a list of all elements that can be inserted at that current cursor location. The Insert Before submenu lists all elements that can be inserted before the current element. The Insert After submenu lists all elements that can be inserted after the current element. In the figure below, the current element is the para element. The bold and italic elements can be inserted within the current para element. eh_context_menu As can be seen below, the para and Office elements can be inserted before the current para element. eh_context_menu2 The node insertion, replacement (Apply), and markup removal (Clear) commands that are available in the context menu are also available in the Authentic View entry helpers and are fully described in that section. Insert entity Positioning the cursor over the Insert Entity command rolls out a submenu containing a list of all declared entities. Clicking an entity inserts it at the selection. See Define Entities for a description of how to define entities for the document. Insert CDATA Section This command is enabled when the cursor is placed within text. Clicking it inserts a CDATA section at the cursor insertion point. The CDATA section is delimited by start and end tags; to see these tags you should switch on large or small markup. Within CDATA sections, XML markup and parsing is ignored. XML markup characters (the ampersand, apostrophe, greater than, less than, and quote characters) are not treated as markup, but as literals. So CDATA sections are useful for text such as program code listings, which have XML markup characters. Remove node Positioning the mouse cursor over the Remove command pops up a menu list consisting of the selected node and all its removable ancestors (those that would not invalidate the document) up to the document element. Click the element to be removed. This is a quick way to delete an element or any removable ancestor. Note that clicking an ancestor element will remove all its descendants, including the selected element. Clear The Clear command clears the element markup from around the selection. If the entire node is selected, then the element markup is cleared for the entire node. If a text segment is selected, then the element markup is cleared from around that text segment only. Apply The Apply command applies a selected element to your selection in the main Window. For more details, see Authentic View entry helpers. Copy, Cut, Paste These are the standard Windows commands. Note, however, that the Paste command pastes copied text either as XML or as Text, depending on what the designer of the stylesheet has specified for the SPS as a whole. For information about how the Copy as XML and Copy as Text commands work, see the description of the Paste As command immediately below. Paste As The Paste As command offers the option of pasting as XML or as text an Authentic View XML fragment (which was copied to the clipboard). If the copied fragment is pasted as XML it is pasted together with its XML markup. If it is pasted as text, then only the text content of the copied fragment is pasted (not the XML markup, if any). The following situations are possible: An entire node together with its markup tags is highlighted in Authentic View and copied to the clipboard. (i) The node can be pasted as XML to any location where this node may validly be placed. It will not be pasted to an invalid location. (ii) If the node is pasted as text, then only the node's text content will be pasted (not the markup); the text content can be pasted to any location in the XML document where text may be pasted. A text fragment is highlighted in Authentic View and copied to the clipboard. (i) If this fragment is pasted as XML, then the XML markup tags of the texteven though these were not explicitly copied with the text fragmentwill be pasted along with the text, but only if the XML node is valid at the location where the fragment is pasted. (ii) If the fragment is pasted as text, then it can be pasted to any location in the XML document where text may be pasted. Note:Text will be copied to nodes where text is allowed, so it is up to you to ensure that the copied text does not invalidate the document. The copied text should therefore be: (i) lexically valid in the new location (for example, non-numeric characters in a numeric node would be invalid), and (ii) not otherwise invalidate the node (for example, four digits in a node that accepts only three-digit numbers would invalidate the node). Note:If the pasted text does in any way invalidate the document, this will be indicated by the text being displayed in red. Delete The Delete command removes the selected node and its contents. A node is considered to be selected for this purpose by placing the cursor within the node or by clicking either the start or end tag of the node. © 2016-2022 Altova GmbH

{ "url": "https://www.altova.com/manual/Stylevision/stylevisionprofessional/avinterface_contextmenus.html", "source_domain": "www.altova.com", "snapshot_id": "crawl=CC-MAIN-2022-33", "warc_metadata": { "Content-Length": "34992", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NPV5YJ2CGOTEBWYNA7JZJQNQLABPWVHM", "WARC-Concurrent-To": "<urn:uuid:21f4fc90-e137-4057-b6e4-15dc655b8e08>", "WARC-Date": "2022-08-18T05:52:43Z", "WARC-IP-Address": "23.78.169.249", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:3GIH3TXQQ3F2VIVUECWZCJFMAW43QWQH", "WARC-Record-ID": "<urn:uuid:aaf27815-f964-4a9b-afb9-022ba79dc6ba>", "WARC-Target-URI": "https://www.altova.com/manual/Stylevision/stylevisionprofessional/avinterface_contextmenus.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b24d05f0-bff9-4fc9-a861-27833c34cbef>" }, "warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 45, 46, 75, 76, 95, 96, 236, 237, 239, 240, 259, 260, 715, 716, 732, 733, 833, 834, 851, 852, 1064, 1065, 1067, 1068, 1082, 1083, 1331, 1332, 1334, 1335, 1356, 1357, 1905, 1906, 1908, 1909, 1921, 1922, 2339, 2340, 2342, 2343, 2349, 2350, 2611, 2612, 2614, 2615, 2621, 2622, 2757, 2758, 2760, 2761, 2778, 2779, 3127, 3128, 3130, 3131, 3140, 3141, 3514, 3515, 3517, 3518, 3956, 3957, 4417, 4418, 4420, 4421, 4858, 4859, 4861, 4862, 4986, 4987, 4989, 4990, 4997, 4998, 5208, 5209, 5211, 5212 ], "line_end_idx": [ 45, 46, 75, 76, 95, 96, 236, 237, 239, 240, 259, 260, 715, 716, 732, 733, 833, 834, 851, 852, 1064, 1065, 1067, 1068, 1082, 1083, 1331, 1332, 1334, 1335, 1356, 1357, 1905, 1906, 1908, 1909, 1921, 1922, 2339, 2340, 2342, 2343, 2349, 2350, 2611, 2612, 2614, 2615, 2621, 2622, 2757, 2758, 2760, 2761, 2778, 2779, 3127, 3128, 3130, 3131, 3140, 3141, 3514, 3515, 3517, 3518, 3956, 3957, 4417, 4418, 4420, 4421, 4858, 4859, 4861, 4862, 4986, 4987, 4989, 4990, 4997, 4998, 5208, 5209, 5211, 5212, 5235 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5235, "ccnet_original_nlines": 86, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4230387210845947, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.023833170533180237, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11519364267587662, "rps_doc_frac_unique_words": 0.28153154253959656, "rps_doc_mean_word_length": 4.6813063621521, "rps_doc_num_sentences": 45, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.818902969360352, "rps_doc_word_count": 888, "rps_doc_frac_chars_dupe_10grams": 0.05388500913977623, "rps_doc_frac_chars_dupe_5grams": 0.15034881234169006, "rps_doc_frac_chars_dupe_6grams": 0.12148184329271317, "rps_doc_frac_chars_dupe_7grams": 0.10392110049724579, "rps_doc_frac_chars_dupe_8grams": 0.09189318865537643, "rps_doc_frac_chars_dupe_9grams": 0.05388500913977623, "rps_doc_frac_chars_top_2gram": 0.010825109668076038, "rps_doc_frac_chars_top_3gram": 0.015636280179023743, "rps_doc_frac_chars_top_4gram": 0.012990140356123447, "rps_doc_books_importance": -378.7057800292969, "rps_doc_books_importance_length_correction": -378.7057800292969, "rps_doc_openwebtext_importance": -278.8443603515625, "rps_doc_openwebtext_importance_length_correction": -278.8443603515625, "rps_doc_wikipedia_importance": -245.592041015625, "rps_doc_wikipedia_importance_length_correction": -245.592041015625 }, "fasttext": { "dclm": 0.06452096253633499, "english": 0.8734762668609619, "fineweb_edu_approx": 2.571596622467041, "eai_general_math": 0.8528462648391724, "eai_open_web_math": 0.6163864731788635, "eai_web_code": 0.4780045747756958 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

235,139,137,558,274,050

Author avatar Ashutosh Singh Highlighting React Code in GitHub Flavored Markdown Ashutosh Singh • Sep 25, 2020 • 7 Min read • 1,220 Views • Sep 25, 2020 • 7 Min read • 1,220 Views Web Development Front End Web Development Client-side Frameworks React Introduction Since its release in 2004, Markdown has become one of the most popular markup languages. Technical writers widely use Markdown for blogs, articles, documentation, etc. because of its lightweight simplicity and cross-platform usage; even this guide is written in Markdown behind the scenes. GitHub uses its own version of markdown known as GitHub Flavored Markdown, enabling users to interact with other users, reference issues, or pull requests. Even if your project or repository doesn't include any markdown or .md files, you will still have to use markdown for README, issues, pull requests, gists, etc. Quite often, you will embed code snippets or blocks in Markdown. For example, embedding code when reporting a bug can save time and help the reviewers, maintainers, or anyone seeing that issue. You can also highlight code based on the programming language to improve the code's readability and context. In this guide, we will discuss how to insert and highlight React code in GitHub Flavored Markdown. Inserting Code You can insert code in GitHub Flavored Markdown (GFM) by either indenting your code four spaces or using fenced code blocks. For example, here is a sample code for a simple express server. 1 2 3 4 5 6 7 8 9 10 11 const express = require("express"); const app = express(); const port = 3000; app.get("/", (req, res) => { res.send("Hello World!"); }); app.listen(port, () => { console.log(`Example app listening at http://localhost:${port}`); }); javascript Copy and paste this code into a .md file in any GitHub repo or a gist and commit the changes. Here is how this Markdown file will look: no_indents Since you have not included any indents or fenced code blocks, GFM treats the code as regular text. You can see this GitHub gist here. Now indent the entire code four spaces. You will notice that the code block will fade once you have indented the code. fade_code Now commit this change, and you will see that the Markdown will format the code block this time. four_indent You can find this example gist here. Fenced Code Blocks You can also insert code in Markdown by placing triple backticks (```) before and after a code block. Notice that, like last time, the code will fade inside triple backticks. fenced_code_block Here is how this Markdown file will look: fenced_code You can find this example gist here. Highlighting Code To highlight code, write the name of the language the code is written in after the initial triple backticks. In the above example, the code is written in JavaScript, and hence javascript is added after triple backticks. highlighted_code Here is how this highlighted code will look: preview You can find this example gist here. Similarly, you can highlight code written in other programming languages such as Ruby, Python, etc. React is a JavaScript framework, or technically a library, so adding javascript after the triple backticks should work and highlight the code. Adding javascript after ``` does highlight the code, but it does so by treating it as a JavaScript code. Since React uses JSX to highlight React code, jsx should be used instead of javascript after the triple backticks. Here is a sample React code that illustrates this. 1 2 3 4 5 6 7 8 9 10 11 12 import React from 'react'; import './App.css'; function App() { return ( <div className="App"> Hello World! </div> ); } export default App; jsx First, javascript is added after the triple backticks. javascript_highlight Here is how this code is highlighted. preview You can find this example gist here. Now, jsx is added after the triple backticks. JSX_highlight Here is how the code is highlighted this time. preview You can find this example gist here. Though the differences are minute, you can see how the highlighting is changed based on the use of javascript and jsx after ```. In general, it is better to use jsx to highlight React code. Even in this guide, jsx is used in the above code block to highlight React code. preview Conclusion In this guide, we discussed how you can insert code in GitHub Flavored Markdown using indentation and fenced code blocks. We also discussed how to highlight JavaScript and React code in GitHub Flavored Markdown. Here are some resources that you may find useful: Happy coding! 5

{ "url": "https://www.pluralsight.com/guides/highlight-react-in-github-markdown", "source_domain": "www.pluralsight.com", "snapshot_id": "crawl=CC-MAIN-2021-17", "warc_metadata": { "Content-Length": "113536", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:LFXDQBXZSO2EQO65DUNNTIVHHLENSP5F", "WARC-Concurrent-To": "<urn:uuid:39e17025-c8f1-47b9-bde7-3e1327604896>", "WARC-Date": "2021-04-23T14:40:05Z", "WARC-IP-Address": "104.19.161.127", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:64CAQEN2XPUDH42BH7GW37BKX7XYQANE", "WARC-Record-ID": "<urn:uuid:cb3a365b-906b-4d4d-961f-9cfd9b155e3b>", "WARC-Target-URI": "https://www.pluralsight.com/guides/highlight-react-in-github-markdown", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:91d0474c-17f4-473a-be60-ef24a516eb82>" }, "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 (info@commoncrawl.org)\r\nhostname: ip-10-67-67-190.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, 14, 15, 30, 31, 83, 84, 99, 100, 117, 132, 148, 165, 180, 196, 212, 238, 261, 267, 268, 281, 282, 572, 573, 890, 891, 1194, 1195, 1294, 1295, 1310, 1311, 1436, 1437, 1501, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1523, 1526, 1562, 1585, 1604, 1605, 1634, 1662, 1666, 1667, 1692, 1760, 1764, 1775, 1776, 1912, 1913, 1924, 1925, 2060, 2061, 2180, 2181, 2191, 2192, 2289, 2290, 2339, 2340, 2359, 2360, 2535, 2536, 2554, 2555, 2597, 2598, 2610, 2611, 2648, 2649, 2667, 2668, 2905, 2906, 2951, 2952, 2960, 2961, 2998, 2999, 3099, 3100, 3348, 3349, 3464, 3465, 3516, 3517, 3519, 3521, 3523, 3525, 3527, 3529, 3531, 3533, 3535, 3538, 3541, 3544, 3571, 3591, 3592, 3609, 3620, 3646, 3670, 3681, 3686, 3688, 3689, 3709, 3713, 3714, 3769, 3770, 3791, 3792, 3830, 3831, 3839, 3840, 3877, 3878, 3924, 3925, 3939, 3940, 3987, 3988, 3996, 3997, 4034, 4035, 4164, 4165, 4307, 4308, 4316, 4317, 4328, 4329, 4541, 4542, 4592, 4593, 4607, 4608 ], "line_end_idx": [ 14, 15, 30, 31, 83, 84, 99, 100, 117, 132, 148, 165, 180, 196, 212, 238, 261, 267, 268, 281, 282, 572, 573, 890, 891, 1194, 1195, 1294, 1295, 1310, 1311, 1436, 1437, 1501, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1516, 1518, 1520, 1523, 1526, 1562, 1585, 1604, 1605, 1634, 1662, 1666, 1667, 1692, 1760, 1764, 1775, 1776, 1912, 1913, 1924, 1925, 2060, 2061, 2180, 2181, 2191, 2192, 2289, 2290, 2339, 2340, 2359, 2360, 2535, 2536, 2554, 2555, 2597, 2598, 2610, 2611, 2648, 2649, 2667, 2668, 2905, 2906, 2951, 2952, 2960, 2961, 2998, 2999, 3099, 3100, 3348, 3349, 3464, 3465, 3516, 3517, 3519, 3521, 3523, 3525, 3527, 3529, 3531, 3533, 3535, 3538, 3541, 3544, 3571, 3591, 3592, 3609, 3620, 3646, 3670, 3681, 3686, 3688, 3689, 3709, 3713, 3714, 3769, 3770, 3791, 3792, 3830, 3831, 3839, 3840, 3877, 3878, 3924, 3925, 3939, 3940, 3987, 3988, 3996, 3997, 4034, 4035, 4164, 4165, 4307, 4308, 4316, 4317, 4328, 4329, 4541, 4542, 4592, 4593, 4607, 4608, 4609 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4609, "ccnet_original_nlines": 163, "rps_doc_curly_bracket": 0.0017357299802824855, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3384955823421478, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0044247801415622234, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.20685841143131256, "rps_doc_frac_unique_words": 0.36032387614250183, "rps_doc_mean_word_length": 4.797570705413818, "rps_doc_num_sentences": 52, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.985981464385986, "rps_doc_word_count": 741, "rps_doc_frac_chars_dupe_10grams": 0.023628689348697662, "rps_doc_frac_chars_dupe_5grams": 0.19774964451789856, "rps_doc_frac_chars_dupe_6grams": 0.15611813962459564, "rps_doc_frac_chars_dupe_7grams": 0.11139240860939026, "rps_doc_frac_chars_dupe_8grams": 0.09507735818624496, "rps_doc_frac_chars_dupe_9grams": 0.023628689348697662, "rps_doc_frac_chars_top_2gram": 0.02025315910577774, "rps_doc_frac_chars_top_3gram": 0.037130799144506454, "rps_doc_frac_chars_top_4gram": 0.028129400685429573, "rps_doc_books_importance": -402.0579833984375, "rps_doc_books_importance_length_correction": -402.0579833984375, "rps_doc_openwebtext_importance": -201.07196044921875, "rps_doc_openwebtext_importance_length_correction": -201.07196044921875, "rps_doc_wikipedia_importance": -200.66102600097656, "rps_doc_wikipedia_importance_length_correction": -200.66102600097656 }, "fasttext": { "dclm": 0.3936437964439392, "english": 0.8544538617134094, "fineweb_edu_approx": 3.0899856090545654, "eai_general_math": 0.9571051001548767, "eai_open_web_math": 0.1360364556312561, "eai_web_code": 0.9875872135162354 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "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,638,126,699,578,154,000

0 $\begingroup$ I run a simple AR(1) model in my analysis using ols: ar.ols(df$y, order.max = 1)) However, I work with generations as my unit of analysis. Therefore, the first lag of y would be the observation of y at time t-30. How can I specify this in the AR(1) model in R? $\endgroup$ 0 $\begingroup$ If $y_t$ and $y_{t-1}$ are actually 30 observations apart, for AR(1) you can do the following: lm( tail(df$y,-30) ~ head(df$y,-30) ) This assumes the first observation is the oldest. If your variable has the first observation being the newest, switch head with tail. This would also imply overlapping observations. For AR(2) you would do lm( tail(df$y,-60) ~ tail(head(df$y,-30),-30) + head(df$y,-60) ) If you wish to trade off the added estimation efficiency due to overlapping observations for computational efficiency, you may use every 30th data point as follows: n=length(df$y) m=floor(n/30) index=seq(from=n,to=(n-m*30),by=-30) g=df$y[index] # g contains every 30th observation of y dropping the oldest few ar.ols(g, order.max = 1)) # for AR(1) ar.ols(g, order.max = 2)) # for AR(2) $\endgroup$ • $\begingroup$ If I misunderstood your setup, just let me know. Will update. $\endgroup$ – Richard Hardy Oct 21 at 10:21 • $\begingroup$ Thank you for your advice. Unfortunately, this does not work, because my dataset has about 100'000 observations and I therefore cannot regress the last 30 on the first 30 observations of y. I would like to set up an AR(I) and in a second step also an AR(II) process by comparing the correlation between an indicator in one generation and the one in the previous generation(s), whereas the generation length is assumed to be 30 years. $\endgroup$ – R-User Oct 21 at 12:07 • $\begingroup$ @R-User, note that my code does not regress the last 30 on the first 30. There is a minus sign in front. tail(df$y,-30) drops the first 30, while head(df$y,-30) drops the last 30 observations. I still do not understand the structure of your data: do your have yearly observations but are interested in generations (30 years)? Would looking at every 30th data point be what you are interested in? If so, my proposed code also works and will be slightly more efficient as it utilizes overlapping observations rather than just deleting 29 out of every 30 observations. But you could do that, too. $\endgroup$ – Richard Hardy Oct 21 at 12:53 • $\begingroup$ Thanks for the explanation. My datastructure is as follows: I do have yearly data consisting of moving averages over 30 years (e.g. the y of 1915 contains the average y for the generation 1900-1930, etc.). Now the aim is e.g. to regress the y of 1915 on the one of 1885 (as the second one is the average for the generation 1870-1900) in order to find the correlation between the two generations. $\endgroup$ – R-User Oct 21 at 13:13 • $\begingroup$ @R-User, then I think my code is just what you need. Alternatively, if you want to avoid overlapping observations and trade off a little bit of precision for computational efficiency, I will include code for that. $\endgroup$ – Richard Hardy Oct 21 at 13:17 Your Answer By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy Not the answer you're looking for? Browse other questions tagged or ask your own question.

{ "url": "https://stats.stackexchange.com/questions/432395/how-to-change-the-observation-for-the-first-lag-in-an-ar1-model", "source_domain": "stats.stackexchange.com", "snapshot_id": "crawl=CC-MAIN-2019-47", "warc_metadata": { "Content-Length": "144005", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:X3GQMUU5BVLXSQL7N672ULTA4I7Q775Z", "WARC-Concurrent-To": "<urn:uuid:9e4a6f34-d1c8-44ed-b7cd-968b778af241>", "WARC-Date": "2019-11-17T22:09:11Z", "WARC-IP-Address": "151.101.1.69", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:6J2RRJMMCRYWLSFCTZUIEYPXKNMEHFRX", "WARC-Record-ID": "<urn:uuid:931bec98-b940-4270-932d-413a41e1e141>", "WARC-Target-URI": "https://stats.stackexchange.com/questions/432395/how-to-change-the-observation-for-the-first-lag-in-an-ar1-model", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:49ef568e-cf3a-4df2-9440-d7c181692a18>" }, "warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-76.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 2, 16, 17, 70, 71, 100, 101, 280, 281, 293, 295, 309, 310, 405, 406, 444, 445, 627, 628, 651, 652, 717, 718, 883, 884, 899, 913, 950, 1029, 1067, 1105, 1117, 1241, 1730, 2386, 2837, 3113, 3114, 3126, 3127, 3227, 3228 ], "line_end_idx": [ 2, 16, 17, 70, 71, 100, 101, 280, 281, 293, 295, 309, 310, 405, 406, 444, 445, 627, 628, 651, 652, 717, 718, 883, 884, 899, 913, 950, 1029, 1067, 1105, 1117, 1241, 1730, 2386, 2837, 3113, 3114, 3126, 3127, 3227, 3228, 3318 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3318, "ccnet_original_nlines": 42, "rps_doc_curly_bracket": 0.0006027700146660209, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.354292631149292, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.030229749158024788, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.333736389875412, "rps_doc_frac_unique_words": 0.43462246656417847, "rps_doc_mean_word_length": 4.60405158996582, "rps_doc_num_sentences": 35, "rps_doc_symbol_to_word_ratio": 0.0036275701131671667, "rps_doc_unigram_entropy": 5.025572776794434, "rps_doc_word_count": 543, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07280000299215317, "rps_doc_frac_chars_dupe_6grams": 0.07280000299215317, "rps_doc_frac_chars_dupe_7grams": 0.0560000017285347, "rps_doc_frac_chars_dupe_8grams": 0.02239999920129776, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.019200000911951065, "rps_doc_frac_chars_top_3gram": 0.014000000432133675, "rps_doc_frac_chars_top_4gram": 0.025200000032782555, "rps_doc_books_importance": -421.3006896972656, "rps_doc_books_importance_length_correction": -421.3006896972656, "rps_doc_openwebtext_importance": -243.88394165039062, "rps_doc_openwebtext_importance_length_correction": -243.88394165039062, "rps_doc_wikipedia_importance": -152.28578186035156, "rps_doc_wikipedia_importance_length_correction": -152.28578186035156 }, "fasttext": { "dclm": 0.03022586926817894, "english": 0.893392026424408, "fineweb_edu_approx": 2.010385036468506, "eai_general_math": 0.19824033975601196, "eai_open_web_math": 0.5159905552864075, "eai_web_code": 0.00417286017909646 } }

{ "free_decimal_correspondence": { "primary": { "code": "519.5", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Probabilities; or, Mathematical statistics" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,897,042,792,998,214,000

Articulation of next container overwriting current container 3 posts / 0 new Letzter Beitrag Bild des Benutzers kunterbunt kunterbunt Offline Last seen vor 6 Monate 1 Woche Articulation of next container overwriting current container Software Version: Synfire 1.8.5 build 5 OS: Windows 10 Bug: Misbehaviour Reproduce-ability: 100% Reproduction steps 1. Create a new Arrangement 2. Create a new container with the size of 2 bars and call it Spiccatissimo 3. Draw a figure into the first bar of the container 4. Assign an articulation to the figure, in this case Spiccatissimo 5. Create a duplicate of that container and rename it to Staccato 6. Move the new container after the first container 7. Change the articulation of the second container figure to a different articulation than the figure of the first container, in this case Staccato 8. Select the range of the second bar for playback 9. loop playback 10. First time it plays correctly. The first figure with the first articulation 11. After that it will play the first figure using the articulation of the second figure articulation_overwrite.png P.S. I attached the sample project. Not sure if it can be used to reproduce. Bild des Benutzers andre andre Offline Last seen vor 2 Tage 13 Stunden Thanks for sharing your observations. Loop playback has a number of side effects and this is one of them. The articulation switch is sent shortly before the first note of a segment. That's why at the end of the loop, the articulation of the following segment is already sent, only milliseconds before it returns to the beginning for the next loop. There, the articulation switch of the first segment is a few milliseconds before the loop start, hence not sent again during a loop. Articulation switches take some time to go into effect. They can't therefore be tied exactly to the playback of a note. Their shifting has the said side effects. Bild des Benutzers kunterbunt kunterbunt Offline Last seen vor 6 Monate 1 Woche Well, then your loop playback needs to look ahead and plan ahead. It makes things more complex, but otherwise it gets unlogical for the user. Zum Verfassen von Kommentaren bitte Anmelden oder Registrieren. Scholarly Lite is a free theme, contributed to the Drupal Community by More than Themes.

{ "url": "https://users.cognitone.com/de/topic/articulation-next-container-overwriting-current-container", "source_domain": "users.cognitone.com", "snapshot_id": "crawl=CC-MAIN-2018-51", "warc_metadata": { "Content-Length": "64772", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:PCEQS2MWLF67JSYKSFQ34KVR7H4BDBSP", "WARC-Concurrent-To": "<urn:uuid:0c61af37-e327-40e2-8e33-4c11eeedabd7>", "WARC-Date": "2018-12-09T23:38:51Z", "WARC-IP-Address": "146.148.26.140", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:AVQKY37JWXGZCBHMHFGIR22G4TGPKOJ6", "WARC-Record-ID": "<urn:uuid:fb32df2c-b644-47e8-9553-9fc0ad5db22b>", "WARC-Target-URI": "https://users.cognitone.com/de/topic/articulation-next-container-overwriting-current-container", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:636af6c5-7801-4d5e-9b4b-0ee179eb8908>" }, "warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-143-18-132.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 61, 62, 78, 94, 124, 135, 143, 174, 175, 236, 237, 277, 292, 310, 334, 353, 354, 384, 385, 463, 518, 588, 656, 710, 860, 913, 932, 1014, 1105, 1106, 1133, 1134, 1211, 1212, 1237, 1243, 1251, 1283, 1284, 1322, 1323, 1766, 1767, 1929, 1930, 1960, 1971, 1979, 2010, 2011, 2153, 2154, 2218, 2219 ], "line_end_idx": [ 61, 62, 78, 94, 124, 135, 143, 174, 175, 236, 237, 277, 292, 310, 334, 353, 354, 384, 385, 463, 518, 588, 656, 710, 860, 913, 932, 1014, 1105, 1106, 1133, 1134, 1211, 1212, 1237, 1243, 1251, 1283, 1284, 1322, 1323, 1766, 1767, 1929, 1930, 1960, 1971, 1979, 2010, 2011, 2153, 2154, 2218, 2219, 2307 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2307, "ccnet_original_nlines": 54, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3931034505367279, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.009195400401949883, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.17241379618644714, "rps_doc_frac_unique_words": 0.4828495979309082, "rps_doc_mean_word_length": 4.857519626617432, "rps_doc_num_sentences": 31, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.728569984436035, "rps_doc_word_count": 379, "rps_doc_frac_chars_dupe_10grams": 0.07278653234243393, "rps_doc_frac_chars_dupe_5grams": 0.1596958190202713, "rps_doc_frac_chars_dupe_6grams": 0.13145029544830322, "rps_doc_frac_chars_dupe_7grams": 0.13145029544830322, "rps_doc_frac_chars_dupe_8grams": 0.07278653234243393, "rps_doc_frac_chars_dupe_9grams": 0.07278653234243393, "rps_doc_frac_chars_top_2gram": 0.03476371988654137, "rps_doc_frac_chars_top_3gram": 0.0260727908462286, "rps_doc_frac_chars_top_4gram": 0.029331879690289497, "rps_doc_books_importance": -205.56407165527344, "rps_doc_books_importance_length_correction": -205.56407165527344, "rps_doc_openwebtext_importance": -100.06566619873047, "rps_doc_openwebtext_importance_length_correction": -100.06566619873047, "rps_doc_wikipedia_importance": -73.82183837890625, "rps_doc_wikipedia_importance_length_correction": -73.82183837890625 }, "fasttext": { "dclm": 0.7205047607421875, "english": 0.7704389095306396, "fineweb_edu_approx": 1.6359171867370605, "eai_general_math": 0.13763642311096191, "eai_open_web_math": 0.15381669998168945, "eai_web_code": 0.03307783976197243 } }

{ "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": "781.5", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "Music theory" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "4", "label": "Missing Images or Figures" }, "secondary": { "code": "0", "label": "No missing content" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "21", "label": "Customer Support" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,897,874,134,606,559,000

RESUME Aus C64-Wiki Zur Navigation springenZur Suche springen Begriffsklärung Der Titel dieses Artikels ist mehrdeutig. RESUME (Begriffsklärung). RESUME Syntax: RESUME Parameter keine Einordnung Typ: Anweisung Kontext: Strukturkontrolle Aufgabe: Beendet eine Tastatur-Kontrollroutine Abkürzung: keine Token: $64 $39 (100 57) Verwandte Befehle ON KEY - DISABLE Dieser Artikel beschreibt das Simons'-Basic-Schlüsselwort RESUME. Typ: Anweisung Syntax: RESUME RESUME bildet den Abschluss einer BASIC-Routine, die auf die Tastendrücke reagiert, die durch ON KEY abgefangen werden sollen. Der Interpreter fährt daraufhin unmittelbar hinter der Stelle fort, an der er durch den Tastendruck unterbrochen wurde. Da eine solche Routine mit DISABLE beginnen sollte, schaltet RESUME den ON-KEY-Modus auch wieder ein. Dieser Befehl wurde in TSB um weitere Funktionen ergänzt, siehe RESUME (TSB). Beispiel[Bearbeiten | Quelltext bearbeiten] 10 ON KEY "abc",: GOTO 10000 ... langes Programm ... 10000 DISABLE 10010 tt$ = CHR$(STATUS) : REM gedrueckte Taste 10020 IF tt$ = "a" THEN PRINT AT(35,0)"ah!" 10030 IF tt$ = "b" THEN PRINT AT(35,0)"beh!" 10040 IF tt$ = "c" THEN PRINT AT(35,0)"zeh!" 10050 RESUME : REM bei Unterbrechung weiter machen Wenn der Benutzer irgendwann im Programmlauf "a", "b" oder "c" drückt, verzweigt die Programmausführung vorübergehend zu Zeile 10000 und setzt danach per RESUME an der unterbrochen Stelle fort.

{ "url": "https://www.c64-wiki.de/wiki/RESUME", "source_domain": "www.c64-wiki.de", "snapshot_id": "CC-MAIN-2024-30", "warc_metadata": { "Content-Length": "31159", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:DSVVOFUORHPRPBVSHUS65ZAZQK6O3JZG", "WARC-Concurrent-To": "<urn:uuid:c2d9ab21-f1df-4dca-a87a-914eaf63cddd>", "WARC-Date": "2024-07-20T10:37:41Z", "WARC-IP-Address": "46.163.72.250", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IRQUHWU4NVQENB6S55O3QCH3SNJGKCBR", "WARC-Record-ID": "<urn:uuid:44e81d0e-1358-4099-a054-e306f1fec9d4>", "WARC-Target-URI": "https://www.c64-wiki.de/wiki/RESUME", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c48ac7ec-5fa2-41fe-a19b-64951d691bc8>" }, "warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 7, 8, 21, 63, 147, 154, 169, 179, 185, 196, 211, 238, 285, 302, 326, 344, 361, 362, 363, 429, 430, 445, 460, 461, 810, 811, 812, 890, 891, 892, 936, 937, 966, 967, 991, 992, 1006, 1054, 1098, 1143, 1188, 1239, 1240 ], "line_end_idx": [ 7, 8, 21, 63, 147, 154, 169, 179, 185, 196, 211, 238, 285, 302, 326, 344, 361, 362, 363, 429, 430, 445, 460, 461, 810, 811, 812, 890, 891, 892, 936, 937, 966, 967, 991, 992, 1006, 1054, 1098, 1143, 1188, 1239, 1240, 1433 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1433, "ccnet_original_nlines": 43, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.03484321013092995, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.149825781583786, "rps_doc_frac_lines_end_with_ellipsis": 0.022727269679307938, "rps_doc_frac_no_alph_words": 0.3414634168148041, "rps_doc_frac_unique_words": 0.7105263471603394, "rps_doc_mean_word_length": 5.973684310913086, "rps_doc_num_sentences": 13, "rps_doc_symbol_to_word_ratio": 0.00696863979101181, "rps_doc_unigram_entropy": 4.723141193389893, "rps_doc_word_count": 190, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0, "rps_doc_frac_chars_dupe_6grams": 0, "rps_doc_frac_chars_dupe_7grams": 0, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013215860351920128, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -152.61813354492188, "rps_doc_books_importance_length_correction": -150.4052276611328, "rps_doc_openwebtext_importance": -88.056396484375, "rps_doc_openwebtext_importance_length_correction": -88.056396484375, "rps_doc_wikipedia_importance": -64.128173828125, "rps_doc_wikipedia_importance_length_correction": -57.177642822265625 }, "fasttext": { "dclm": 0.850898027420044, "english": 0.0047191898338496685, "fineweb_edu_approx": 2.5619118213653564, "eai_general_math": 0.03288019075989723, "eai_open_web_math": 0.7218930125236511, "eai_web_code": 0.5388650894165039 } }

{ "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.164", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,332,391,826,958,519,000

The Rise of Parody This is an excerpt from Dr. Silly Freehold’s talk, “The rise of parody.” This was given in Boar’s Blemish University on the 15th anniversary of Invocation Day – 3 years after the War of Injunction ended. You all, of course, know the story of the early days of the war. In Spring 225 1 the Great Firewall in the Pass of Commons was brought completely down by the Copyright Horde. The 17th and 34th Gnomish divisions were routed, but quickly regrouped and fell back toward the mines of Great Roll. They fought valiantly as they retreated, drawing the bulk of the Horde’s forces after them as they fell back. Many of these brave Gnomes were the first to be wounded with the Horde’s “fade-rounds,” their names and contributions to the fight now lost to us. Survivors tell of a desperate struggle to keep back the Horde from the civilian population until it could be evacuated under the Copper Mountains. As I said, it was a valiant effort, but it also left the city of Boar’s Blemish, just slightly to the North and East of the Pass of Commons, exposed to a Horde attack. The 17th Gnomish Infantry had attempted to fall back towards the city once the firewall had fallen, but were ambushed by a brigade of Patent Trolls who had somehow managed to get in front of them. Despite a numerical advantage, the Gnomes were no match for the aggressive trolls, and sustained nearly 50% casualties before linking back up with the 34th and it’s heroic stand. In desperation the Principal of Boar’s Blemish called to The Empty Throne for reinforcements, only to be told that none would be forthcoming. The Realm had not been prepared for war. The Dwarves of Red Mine we’re busy creating a software patch for the collapsed firewall, and wouldn’t be able to have an impact on the changing situation until they came out with new code, hopefully in the coming year. The Darned Elves will still refusing to take the field until they got what they felt was a fair exchange rate between socks and pennies 2. The Penny Gnomes, as I said, were preoccupied with saving the population around Great Roll. The Classics, as usual, ignored all calls for help. The Magicasters were on their own, and believed they had less than three days before the bulk of the Copyright Horde was in position to attack their city. It was then one of the greatest intelligence triumphs of the war occurred. Late one night, four days after the Great Firewall had collapsed, a lone Lawyer approached the Magicaster pickets and indicated a desire to defect. From this lone warrior the armed forces of The Realm learned the strategies governing the current invasion, as well as some insight into the nature of the Copyright Horde itself (which we’ll cover in tomorrow’s lecture). Of particular interest to the defenders in and around Boar’s Blemish was intelligence on a new type of weapon which the Horde intended to unleash upon the city, an injunction bomb. While the injunction had been a useful tool against individual soldiers or units, the Horde had not yet been able to make an injunction stick against an entire population center – there was nothing “infringing enough” to write an injunction which would hold against wide area. The Magicasters, however, with their presumed similarities towards certain Actualized Works 3 provided the Horde their first opportunity unleash the full power of their injunction weapons. The news of this bomb created great alarm within the city and among its defenders – the threat of an injunction bomb was truly terrifying. Yet the Horde’s tactic also provided the city’s hope of deliverance. Within hours of discovering their impending danger, the Magicasters of Boar’s Blemish began devising a novel defense for their imperiled town. They set about developing The Realm’s first parody shield. With speed and desperation born through terror, the Magicasters rewrote the town charter to retcon it’s history. The town scribes changed both the town name and the identity of those who lived there into forms which betrayed an obvious, yet slightly warped, tie to certain Actualized Works – thus breaking the power of the injunction. It was a dangerous chance, if the Parody Shield failed then Boar’s Blemish would almost certainly cease to exist. Six days later, when the Horde finally moved on the isolated city, the injunction bomb was finally detonated. It did no damage. Confused and demoralized, the Horde paused in their attack. Instead of moving on a devastated city and capturing defeated survivors, The Horde was faced with a suddenly confident enemy which was suddenly immune to their most powerful weapon. In their confusion, the defenders of Boar’s Blemish took to the offensive and began the process of driving the enemy from their boundaries. Six weeks from day the firewall came down, the bulk of The Horde had been pushed back through the Pass of Commons. The Realm would survive to fight another day. 1. The current calendar in The Realm begins with the establishment of the first US Patent Act. No one knows why, and the pixies aren’t saying. 2. The Darned Elves hold that the best basis for currency in The Realm is a single sock, taken from a dryer in the real world. The rest of The Realm is quite happy on the Penny Standard. 3. Even years after the Copyright Horde was defeated the citizens of The Realm were wary of referring to Actualized Works by name – they remembered how such mentions were used a targeting beacons during the war.

{ "url": "https://painfullyhopeful.me/2015/02/03/the-rise-of-parody/", "source_domain": "painfullyhopeful.me", "snapshot_id": "crawl=CC-MAIN-2020-16", "warc_metadata": { "Content-Length": "118548", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:QX5NUJFAMNE4ZK6TTFTIEK6JSB2FSBHI", "WARC-Concurrent-To": "<urn:uuid:89070a93-4180-42b7-9921-d1458c1784e9>", "WARC-Date": "2020-04-05T07:31:36Z", "WARC-IP-Address": "192.0.78.25", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:EDJ5UT6ZXZ6CZUMEFGDCOETIKGMSKYCH", "WARC-Record-ID": "<urn:uuid:48bfe402-8d7c-4b07-8049-8d12de75ccae>", "WARC-Target-URI": "https://painfullyhopeful.me/2015/02/03/the-rise-of-parody/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:22176945-a542-460d-9414-0d055ead5b29>" }, "warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-81.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, 19, 20, 224, 225, 921, 922, 1466, 1467, 1650, 1651, 2308, 2309, 2753, 2754, 3752, 3753, 3812, 3813, 4148, 4149, 4373, 4374, 4935, 4936, 4937, 5083, 5273 ], "line_end_idx": [ 19, 20, 224, 225, 921, 922, 1466, 1467, 1650, 1651, 2308, 2309, 2753, 2754, 3752, 3753, 3812, 3813, 4148, 4149, 4373, 4374, 4935, 4936, 4937, 5083, 5273, 5487 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5487, "ccnet_original_nlines": 27, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.4414498209953308, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0027880999259650707, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.11988847702741623, "rps_doc_frac_unique_words": 0.45638298988342285, "rps_doc_mean_word_length": 4.717021465301514, "rps_doc_num_sentences": 47, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.282890319824219, "rps_doc_word_count": 940, "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.015787100419402122, "rps_doc_frac_chars_top_3gram": 0.015336040407419205, "rps_doc_frac_chars_top_4gram": 0.010825440287590027, "rps_doc_books_importance": -580.2841186523438, "rps_doc_books_importance_length_correction": -580.2841186523438, "rps_doc_openwebtext_importance": -367.2372741699219, "rps_doc_openwebtext_importance_length_correction": -367.2372741699219, "rps_doc_wikipedia_importance": -306.5511474609375, "rps_doc_wikipedia_importance_length_correction": -306.5511474609375 }, "fasttext": { "dclm": 0.08029556274414062, "english": 0.9753827452659607, "fineweb_edu_approx": 2.435602903366089, "eai_general_math": 0.05930608883500099, "eai_open_web_math": 0.2937847971916199, "eai_web_code": 0.01072848029434681 } }

{ "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": "343.73", "labels": { "level_1": "Social sciences", "level_2": "Law", "level_3": "Criminal law" } } }, "bloom_cognitive_process": { "primary": { "code": "4", "label": "Analyze" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "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": "10", "label": "Knowledge Article" }, "secondary": { "code": "7", "label": "Creative Writing" } }, "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": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-879,388,992,992,513,800

Beefy Boxes and Bandwidth Generously Provided by pair Networks Do you know where your variables are? PerlMonks Conway's Kindergarten talk by TheoPetersen (Priest) on Aug 15, 2001 at 18:17 UTC ( #105050=monkdiscuss: print w/replies, xml ) Need Help?? Should you be looking for yet another commentary on good behavior in an on-line community, I recommend Conway's lightning talk on the subject. Replies are listed 'Best First'. Re: Conway's Kindergarten talk by mirod (Canon) on Aug 15, 2001 at 19:12 UTC By the way, that was not a talk. It was a song! What was the tune? Gilbert and Sullivan's patter song "I am the very model of a modern major-general"? If so, did he try singing it at speed? (For those who don't know, G&S were noted for their patter songs. They were very lighthearted songs that were meant to be sung extremely fast which practically trip over themselves. They are infamous for exercising your enunciation...) UPDATE Oops, premchai21 corrected me on the title. The patter is actually 'opera'. :) In case anyone is particularly interested, the song is from the light (comic) opera "Pirates of Penzance", and its original lyrics go along the following lines: GENERAL: I am the very model of a modern Major-General, I've information vegetable, animal, and mineral, I know the kings of England, and I quote the fights historical From Marathon to Waterloo, in order categorical; I'm very well acquainted, too, with matters mathematical, I understand equations, both the simple and quadratical, About binomial theorem I'm teeming with a lot o' news, With many cheerful facts about the square of the hypotenuse. ALL: With many cheerful facts, etc. etc. etc. GENERAL: I'm very good at integral and differential calculus; I know the scientific names of beings animalculus: In short, in matters vegetable, animal, and mineral, I am the very model of a modern Major-General. Three guesses why it appeals to geeks. :) Not quite at speed. Maybe 2/3 speed. It was still impressive. A decade ago I heard Stan Kelly Bootle do that to "Software Pirates of Pizants (sp?)". Great song. Log In? Username: Password: What's my password? Create A New User Node Status? node history Node Type: monkdiscuss [id://105050] Approved by root help Chatterbox? and all is quiet... How do I use this? | Other CB clients Other Users? Others romping around the Monastery: (5) As of 2017-10-22 10:12 GMT Sections? Information? Find Nodes? Leftovers? Voting Booth? My fridge is mostly full of: Results (272 votes). Check out past polls. Notices?

{ "url": "http://www.perlmonks.org/?node_id=105050", "source_domain": "www.perlmonks.org", "snapshot_id": "crawl=CC-MAIN-2017-43", "warc_metadata": { "Content-Length": "24190", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:2XSM2ZQZRUXURY3B2PQYML5VJOAANCWF", "WARC-Concurrent-To": "<urn:uuid:c07a0187-4b7d-4bc0-b936-ae3c97a243b5>", "WARC-Date": "2017-10-22T10:14:02Z", "WARC-IP-Address": "209.197.123.153", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LXLKKDCNCWJMIWAXA5ZHIZKZ2BYKXWOI", "WARC-Record-ID": "<urn:uuid:3f20a542-5f9b-4dca-81f3-44c32ac0f775>", "WARC-Target-URI": "http://www.perlmonks.org/?node_id=105050", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:9e9f1caa-2472-4baa-9ba3-295453e60e2f>" }, "warc_info": "robots: classic\r\nhostname: ip-10-183-219-92.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 63, 101, 103, 115, 116, 143, 144, 169, 256, 257, 400, 401, 434, 465, 511, 512, 564, 565, 674, 675, 720, 721, 963, 964, 977, 1027, 1028, 1232, 1233, 1297, 1363, 1443, 1509, 1584, 1658, 1730, 1808, 1817, 1876, 1885, 1955, 2023, 2093, 2157, 2166, 2167, 2217, 2218, 2288, 2395, 2396, 2404, 2414, 2424, 2425, 2445, 2463, 2476, 2489, 2526, 2543, 2548, 2560, 2580, 2581, 2619, 2632, 2673, 2700, 2710, 2723, 2735, 2746, 2764, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2808, 2809, 2810, 2811, 2812, 2813, 2814, 2861, 2862 ], "line_end_idx": [ 63, 101, 103, 115, 116, 143, 144, 169, 256, 257, 400, 401, 434, 465, 511, 512, 564, 565, 674, 675, 720, 721, 963, 964, 977, 1027, 1028, 1232, 1233, 1297, 1363, 1443, 1509, 1584, 1658, 1730, 1808, 1817, 1876, 1885, 1955, 2023, 2093, 2157, 2166, 2167, 2217, 2218, 2288, 2395, 2396, 2404, 2414, 2424, 2425, 2445, 2463, 2476, 2489, 2526, 2543, 2548, 2560, 2580, 2581, 2619, 2632, 2673, 2700, 2710, 2723, 2735, 2746, 2764, 2797, 2798, 2799, 2800, 2801, 2802, 2803, 2804, 2805, 2806, 2807, 2808, 2809, 2810, 2811, 2812, 2813, 2814, 2861, 2862, 2874 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2874, "ccnet_original_nlines": 94, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29505300521850586, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04593639820814133, "rps_doc_frac_lines_end_with_ellipsis": 0.010526319965720177, "rps_doc_frac_no_alph_words": 0.2632508873939514, "rps_doc_frac_unique_words": 0.6165048480033875, "rps_doc_mean_word_length": 4.7669901847839355, "rps_doc_num_sentences": 40, "rps_doc_symbol_to_word_ratio": 0.005300350021570921, "rps_doc_unigram_entropy": 5.243667125701904, "rps_doc_word_count": 412, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.09419552236795425, "rps_doc_frac_chars_dupe_6grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_7grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_8grams": 0.05498981848359108, "rps_doc_frac_chars_dupe_9grams": 0.05498981848359108, "rps_doc_frac_chars_top_2gram": 0.004582480061799288, "rps_doc_frac_chars_top_3gram": 0.009164970368146896, "rps_doc_frac_chars_top_4gram": 0.015274950303137302, "rps_doc_books_importance": -213.15335083007812, "rps_doc_books_importance_length_correction": -213.15335083007812, "rps_doc_openwebtext_importance": -101.79734802246094, "rps_doc_openwebtext_importance_length_correction": -101.79734802246094, "rps_doc_wikipedia_importance": -70.96728515625, "rps_doc_wikipedia_importance_length_correction": -70.96728515625 }, "fasttext": { "dclm": 0.08780937641859055, "english": 0.9529244899749756, "fineweb_edu_approx": 1.3489352464675903, "eai_general_math": 0.019548539072275162, "eai_open_web_math": 0.29015791416168213, "eai_web_code": 0.00001109000004362315 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "782.42164", "labels": { "level_1": "Arts", "level_2": "Music", "level_3": "Dramatic music" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "1", "label": "No Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-8,380,879,540,561,759,000

LLVM 6.0.0svn MipsSEISelLowering.cpp Go to the documentation of this file. 1 //===- MipsSEISelLowering.cpp - MipsSE DAG Lowering Interface -------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // Subclass of MipsTargetLowering specialized for mips32/64. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "MipsSEISelLowering.h" 15 #include "MipsMachineFunction.h" 16 #include "MipsRegisterInfo.h" 17 #include "MipsSubtarget.h" 18 #include "llvm/ADT/APInt.h" 19 #include "llvm/ADT/ArrayRef.h" 20 #include "llvm/ADT/STLExtras.h" 21 #include "llvm/ADT/SmallVector.h" 22 #include "llvm/ADT/Triple.h" 37 #include "llvm/IR/DebugLoc.h" 38 #include "llvm/IR/Intrinsics.h" 39 #include "llvm/Support/Casting.h" 41 #include "llvm/Support/Debug.h" 45 #include <algorithm> 46 #include <cassert> 47 #include <cstdint> 48 #include <iterator> 49 #include <utility> 50 51 using namespace llvm; 52 53 #define DEBUG_TYPE "mips-isel" 54 55 static cl::opt<bool> 56 UseMipsTailCalls("mips-tail-calls", cl::Hidden, 57 cl::desc("MIPS: permit tail calls."), cl::init(false)); 58 59 static cl::opt<bool> NoDPLoadStore("mno-ldc1-sdc1", cl::init(false), 60 cl::desc("Expand double precision loads and " 61 "stores to their single precision " 62 "counterparts")); 63 65 const MipsSubtarget &STI) 66 : MipsTargetLowering(TM, STI) { 67 // Set up the register classes 68 addRegisterClass(MVT::i32, &Mips::GPR32RegClass); 69 70 if (Subtarget.isGP64bit()) 71 addRegisterClass(MVT::i64, &Mips::GPR64RegClass); 72 73 if (Subtarget.hasDSP() || Subtarget.hasMSA()) { 74 // Expand all truncating stores and extending loads. 75 for (MVT VT0 : MVT::vector_valuetypes()) { 76 for (MVT VT1 : MVT::vector_valuetypes()) { 77 setTruncStoreAction(VT0, VT1, Expand); 81 } 82 } 83 } 84 85 if (Subtarget.hasDSP()) { 87 88 for (unsigned i = 0; i < array_lengthof(VecTys); ++i) { 89 addRegisterClass(VecTys[i], &Mips::DSPRRegClass); 90 91 // Expand all builtin opcodes. 92 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 93 setOperationAction(Opc, VecTys[i], Expand); 94 95 setOperationAction(ISD::ADD, VecTys[i], Legal); 96 setOperationAction(ISD::SUB, VecTys[i], Legal); 97 setOperationAction(ISD::LOAD, VecTys[i], Legal); 98 setOperationAction(ISD::STORE, VecTys[i], Legal); 100 } 101 107 } 108 109 if (Subtarget.hasDSPR2()) 111 112 if (Subtarget.hasMSA()) { 113 addMSAIntType(MVT::v16i8, &Mips::MSA128BRegClass); 114 addMSAIntType(MVT::v8i16, &Mips::MSA128HRegClass); 115 addMSAIntType(MVT::v4i32, &Mips::MSA128WRegClass); 116 addMSAIntType(MVT::v2i64, &Mips::MSA128DRegClass); 117 addMSAFloatType(MVT::v8f16, &Mips::MSA128HRegClass); 118 addMSAFloatType(MVT::v4f32, &Mips::MSA128WRegClass); 119 addMSAFloatType(MVT::v2f64, &Mips::MSA128DRegClass); 120 121 // f16 is a storage-only type, always promote it to f32. 122 addRegisterClass(MVT::f16, &Mips::MSA128HRegClass); 158 164 } 165 166 if (!Subtarget.useSoftFloat()) { 167 addRegisterClass(MVT::f32, &Mips::FGR32RegClass); 168 169 // When dealing with single precision only, use libcalls 170 if (!Subtarget.isSingleFloat()) { 171 if (Subtarget.isFP64bit()) 172 addRegisterClass(MVT::f64, &Mips::FGR64RegClass); 173 else 174 addRegisterClass(MVT::f64, &Mips::AFGR64RegClass); 175 } 176 } 177 182 183 if (Subtarget.hasCnMips()) 185 else if (Subtarget.isGP64bit()) 187 188 if (Subtarget.isGP64bit()) { 195 } 196 199 205 207 211 212 if (NoDPLoadStore) { 215 } 216 217 if (Subtarget.hasMips32r6()) { 218 // MIPS32r6 replaces the accumulator-based multiplies with a three register 219 // instruction 225 226 // MIPS32r6 replaces the accumulator-based division/remainder with separate 227 // three register division and remainder instructions. 234 235 // MIPS32r6 replaces conditional moves with an equivalent that removes the 236 // need for three GPR read ports. 240 244 245 assert(Subtarget.isFP64bit() && "FR=1 is required for MIPS32r6"); 249 251 252 // Floating point > and >= are supported via < and <= 257 262 } 263 264 if (Subtarget.hasMips64r6()) { 265 // MIPS64r6 replaces the accumulator-based multiplies with a three register 266 // instruction 272 273 // MIPS32r6 replaces the accumulator-based division/remainder with separate 274 // three register division and remainder instructions. 281 282 // MIPS64r6 replaces conditional moves with an equivalent that removes the 283 // need for three GPR read ports. 287 } 288 290 } 291 292 const MipsTargetLowering * 294 const MipsSubtarget &STI) { 295 return new MipsSETargetLowering(TM, STI); 296 } 297 298 const TargetRegisterClass * 300 if (VT == MVT::Untyped) 301 return Subtarget.hasDSP() ? &Mips::ACC64DSPRegClass : &Mips::ACC64RegClass; 302 304 } 305 306 // Enable MSA support for the given integer type and Register class. 309 addRegisterClass(Ty, RC); 310 311 // Expand all builtin opcodes. 312 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 313 setOperationAction(Opc, Ty, Expand); 314 321 339 340 if (Ty == MVT::v4i32 || Ty == MVT::v2i64) { 345 } 346 353 } 354 355 // Enable MSA support for the given floating-point type and Register class. 358 addRegisterClass(Ty, RC); 359 360 // Expand all builtin opcodes. 361 for (unsigned Opc = 0; Opc < ISD::BUILTIN_OP_END; ++Opc) 362 setOperationAction(Opc, Ty, Expand); 363 370 371 if (Ty != MVT::v8f16) { 383 391 } 392 } 393 394 SDValue MipsSETargetLowering::lowerSELECT(SDValue Op, SelectionDAG &DAG) const { 395 if(!Subtarget.hasMips32r6()) 396 return MipsTargetLowering::LowerOperation(Op, DAG); 397 398 EVT ResTy = Op->getValueType(0); 399 SDLoc DL(Op); 400 401 // Although MTC1_D64 takes an i32 and writes an f64, the upper 32 bits of the 402 // floating point register are undefined. Not really an issue as sel.d, which 403 // is produced from an FSELECT node, only looks at bit 0. 404 SDValue Tmp = DAG.getNode(MipsISD::MTC1_D64, DL, MVT::f64, Op->getOperand(0)); 405 return DAG.getNode(MipsISD::FSELECT, DL, ResTy, Tmp, Op->getOperand(1), 406 Op->getOperand(2)); 407 } 408 409 bool 411 unsigned, 412 unsigned, 413 bool *Fast) const { 415 417 // MIPS32r6/MIPS64r6 is required to support unaligned access. It's 418 // implementation defined whether this is handled by hardware, software, or 419 // a hybrid of the two but it's expected that most implementations will 420 // handle the majority of cases in hardware. 421 if (Fast) 422 *Fast = true; 423 return true; 424 } 425 426 switch (SVT) { 427 case MVT::i64: 428 case MVT::i32: 429 if (Fast) 430 *Fast = true; 431 return true; 432 default: 433 return false; 434 } 435 } 436 438 SelectionDAG &DAG) const { 439 switch(Op.getOpcode()) { 440 case ISD::LOAD: return lowerLOAD(Op, DAG); 441 case ISD::STORE: return lowerSTORE(Op, DAG); 442 case ISD::SMUL_LOHI: return lowerMulDiv(Op, MipsISD::Mult, true, true, DAG); 443 case ISD::UMUL_LOHI: return lowerMulDiv(Op, MipsISD::Multu, true, true, DAG); 444 case ISD::MULHS: return lowerMulDiv(Op, MipsISD::Mult, false, true, DAG); 445 case ISD::MULHU: return lowerMulDiv(Op, MipsISD::Multu, false, true, DAG); 446 case ISD::MUL: return lowerMulDiv(Op, MipsISD::Mult, true, false, DAG); 447 case ISD::SDIVREM: return lowerMulDiv(Op, MipsISD::DivRem, true, true, DAG); 448 case ISD::UDIVREM: return lowerMulDiv(Op, MipsISD::DivRemU, true, true, 449 DAG); 450 case ISD::INTRINSIC_WO_CHAIN: return lowerINTRINSIC_WO_CHAIN(Op, DAG); 451 case ISD::INTRINSIC_W_CHAIN: return lowerINTRINSIC_W_CHAIN(Op, DAG); 452 case ISD::INTRINSIC_VOID: return lowerINTRINSIC_VOID(Op, DAG); 453 case ISD::EXTRACT_VECTOR_ELT: return lowerEXTRACT_VECTOR_ELT(Op, DAG); 454 case ISD::BUILD_VECTOR: return lowerBUILD_VECTOR(Op, DAG); 455 case ISD::VECTOR_SHUFFLE: return lowerVECTOR_SHUFFLE(Op, DAG); 456 case ISD::SELECT: return lowerSELECT(Op, DAG); 457 } 458 459 return MipsTargetLowering::LowerOperation(Op, DAG); 460 } 461 462 // Fold zero extensions into MipsISD::VEXTRACT_[SZ]EXT_ELT 463 // 464 // Performs the following transformations: 465 // - Changes MipsISD::VEXTRACT_[SZ]EXT_ELT to zero extension if its 466 // sign/zero-extension is completely overwritten by the new one performed by 467 // the ISD::AND. 468 // - Removes redundant zero extensions performed by an ISD::AND. 471 const MipsSubtarget &Subtarget) { 472 if (!Subtarget.hasMSA()) 473 return SDValue(); 474 475 SDValue Op0 = N->getOperand(0); 476 SDValue Op1 = N->getOperand(1); 477 unsigned Op0Opcode = Op0->getOpcode(); 478 479 // (and (MipsVExtract[SZ]Ext $a, $b, $c), imm:$d) 480 // where $d + 1 == 2^n and n == 32 481 // or $d + 1 == 2^n and n <= 32 and ZExt 482 // -> (MipsVExtractZExt $a, $b, $c) 483 if (Op0Opcode == MipsISD::VEXTRACT_SEXT_ELT || 484 Op0Opcode == MipsISD::VEXTRACT_ZEXT_ELT) { 486 487 if (!Mask) 488 return SDValue(); 489 490 int32_t Log2IfPositive = (Mask->getAPIntValue() + 1).exactLogBase2(); 491 492 if (Log2IfPositive <= 0) 493 return SDValue(); // Mask+1 is not a power of 2 494 495 SDValue Op0Op2 = Op0->getOperand(2); 496 EVT ExtendTy = cast<VTSDNode>(Op0Op2)->getVT(); 497 unsigned ExtendTySize = ExtendTy.getSizeInBits(); 498 unsigned Log2 = Log2IfPositive; 499 500 if ((Op0Opcode == MipsISD::VEXTRACT_ZEXT_ELT && Log2 >= ExtendTySize) || 501 Log2 == ExtendTySize) { 502 SDValue Ops[] = { Op0->getOperand(0), Op0->getOperand(1), Op0Op2 }; 503 return DAG.getNode(MipsISD::VEXTRACT_ZEXT_ELT, SDLoc(Op0), 504 Op0->getVTList(), 505 makeArrayRef(Ops, Op0->getNumOperands())); 506 } 507 } 508 509 return SDValue(); 510 } 511 512 // Determine if the specified node is a constant vector splat. 513 // 514 // Returns true and sets Imm if: 515 // * N is a ISD::BUILD_VECTOR representing a constant splat 516 // 517 // This function is quite similar to MipsSEDAGToDAGISel::selectVSplat. The 518 // differences are that it assumes the MSA has already been checked and the 519 // arbitrary requirement for a maximum of 32-bit integers isn't applied (and 520 // must not be in order for binsri.d to be selectable). 521 static bool isVSplat(SDValue N, APInt &Imm, bool IsLittleEndian) { 523 524 if (!Node) 525 return false; 526 527 APInt SplatValue, SplatUndef; 528 unsigned SplatBitSize; 529 bool HasAnyUndefs; 530 531 if (!Node->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs, 532 8, !IsLittleEndian)) 533 return false; 534 535 Imm = SplatValue; 536 537 return true; 538 } 539 540 // Test whether the given node is an all-ones build_vector. 541 static bool isVectorAllOnes(SDValue N) { 542 // Look through bitcasts. Endianness doesn't matter because we are looking 543 // for an all-ones value. 544 if (N->getOpcode() == ISD::BITCAST) 545 N = N->getOperand(0); 546 548 549 if (!BVN) 550 return false; 551 552 APInt SplatValue, SplatUndef; 553 unsigned SplatBitSize; 554 bool HasAnyUndefs; 555 556 // Endianness doesn't matter in this context because we are looking for 557 // an all-ones value. 558 if (BVN->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs)) 559 return SplatValue.isAllOnesValue(); 560 561 return false; 562 } 563 564 // Test whether N is the bitwise inverse of OfNode. 565 static bool isBitwiseInverse(SDValue N, SDValue OfNode) { 566 if (N->getOpcode() != ISD::XOR) 567 return false; 568 569 if (isVectorAllOnes(N->getOperand(0))) 570 return N->getOperand(1) == OfNode; 571 572 if (isVectorAllOnes(N->getOperand(1))) 573 return N->getOperand(0) == OfNode; 574 575 return false; 576 } 577 578 // Perform combines where ISD::OR is the root node. 579 // 580 // Performs the following transformations: 581 // - (or (and $a, $mask), (and $b, $inv_mask)) => (vselect $mask, $a, $b) 582 // where $inv_mask is the bitwise inverse of $mask and the 'or' has a 128-bit 583 // vector type. 586 const MipsSubtarget &Subtarget) { 587 if (!Subtarget.hasMSA()) 588 return SDValue(); 589 590 EVT Ty = N->getValueType(0); 591 592 if (!Ty.is128BitVector()) 593 return SDValue(); 594 595 SDValue Op0 = N->getOperand(0); 596 SDValue Op1 = N->getOperand(1); 597 598 if (Op0->getOpcode() == ISD::AND && Op1->getOpcode() == ISD::AND) { 599 SDValue Op0Op0 = Op0->getOperand(0); 600 SDValue Op0Op1 = Op0->getOperand(1); 601 SDValue Op1Op0 = Op1->getOperand(0); 602 SDValue Op1Op1 = Op1->getOperand(1); 603 bool IsLittleEndian = !Subtarget.isLittle(); 604 605 SDValue IfSet, IfClr, Cond; 606 bool IsConstantMask = false; 607 APInt Mask, InvMask; 608 609 // If Op0Op0 is an appropriate mask, try to find it's inverse in either 610 // Op1Op0, or Op1Op1. Keep track of the Cond, IfSet, and IfClr nodes, while 611 // looking. 612 // IfClr will be set if we find a valid match. 613 if (isVSplat(Op0Op0, Mask, IsLittleEndian)) { 614 Cond = Op0Op0; 615 IfSet = Op0Op1; 616 617 if (isVSplat(Op1Op0, InvMask, IsLittleEndian) && 618 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 619 IfClr = Op1Op1; 620 else if (isVSplat(Op1Op1, InvMask, IsLittleEndian) && 621 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 622 IfClr = Op1Op0; 623 624 IsConstantMask = true; 625 } 626 627 // If IfClr is not yet set, and Op0Op1 is an appropriate mask, try the same 628 // thing again using this mask. 629 // IfClr will be set if we find a valid match. 630 if (!IfClr.getNode() && isVSplat(Op0Op1, Mask, IsLittleEndian)) { 631 Cond = Op0Op1; 632 IfSet = Op0Op0; 633 634 if (isVSplat(Op1Op0, InvMask, IsLittleEndian) && 635 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 636 IfClr = Op1Op1; 637 else if (isVSplat(Op1Op1, InvMask, IsLittleEndian) && 638 Mask.getBitWidth() == InvMask.getBitWidth() && Mask == ~InvMask) 639 IfClr = Op1Op0; 640 641 IsConstantMask = true; 642 } 643 644 // If IfClr is not yet set, try looking for a non-constant match. 645 // IfClr will be set if we find a valid match amongst the eight 646 // possibilities. 647 if (!IfClr.getNode()) { 648 if (isBitwiseInverse(Op0Op0, Op1Op0)) { 649 Cond = Op1Op0; 650 IfSet = Op1Op1; 651 IfClr = Op0Op1; 652 } else if (isBitwiseInverse(Op0Op1, Op1Op0)) { 653 Cond = Op1Op0; 654 IfSet = Op1Op1; 655 IfClr = Op0Op0; 656 } else if (isBitwiseInverse(Op0Op0, Op1Op1)) { 657 Cond = Op1Op1; 658 IfSet = Op1Op0; 659 IfClr = Op0Op1; 660 } else if (isBitwiseInverse(Op0Op1, Op1Op1)) { 661 Cond = Op1Op1; 662 IfSet = Op1Op0; 663 IfClr = Op0Op0; 664 } else if (isBitwiseInverse(Op1Op0, Op0Op0)) { 665 Cond = Op0Op0; 666 IfSet = Op0Op1; 667 IfClr = Op1Op1; 668 } else if (isBitwiseInverse(Op1Op1, Op0Op0)) { 669 Cond = Op0Op0; 670 IfSet = Op0Op1; 671 IfClr = Op1Op0; 672 } else if (isBitwiseInverse(Op1Op0, Op0Op1)) { 673 Cond = Op0Op1; 674 IfSet = Op0Op0; 675 IfClr = Op1Op1; 676 } else if (isBitwiseInverse(Op1Op1, Op0Op1)) { 677 Cond = Op0Op1; 678 IfSet = Op0Op0; 679 IfClr = Op1Op0; 680 } 681 } 682 683 // At this point, IfClr will be set if we have a valid match. 684 if (!IfClr.getNode()) 685 return SDValue(); 686 687 assert(Cond.getNode() && IfSet.getNode()); 688 689 // Fold degenerate cases. 690 if (IsConstantMask) { 691 if (Mask.isAllOnesValue()) 692 return IfSet; 693 else if (Mask == 0) 694 return IfClr; 695 } 696 697 // Transform the DAG into an equivalent VSELECT. 698 return DAG.getNode(ISD::VSELECT, SDLoc(N), Ty, Cond, IfSet, IfClr); 699 } 700 701 return SDValue(); 702 } 703 704 static SDValue genConstMult(SDValue X, APInt C, const SDLoc &DL, EVT VT, 705 EVT ShiftTy, SelectionDAG &DAG) { 706 // Return 0. 707 if (C == 0) 708 return DAG.getConstant(0, DL, VT); 709 710 // Return x. 711 if (C == 1) 712 return X; 713 714 // If c is power of 2, return (shl x, log2(c)). 715 if (C.isPowerOf2()) 716 return DAG.getNode(ISD::SHL, DL, VT, X, 717 DAG.getConstant(C.logBase2(), DL, ShiftTy)); 718 719 unsigned BitWidth = C.getBitWidth(); 720 APInt Floor = APInt(BitWidth, 1) << C.logBase2(); 721 APInt Ceil = C.isNegative() ? APInt(BitWidth, 0) : 722 APInt(BitWidth, 1) << C.ceilLogBase2(); 723 724 // If |c - floor_c| <= |c - ceil_c|, 725 // where floor_c = pow(2, floor(log2(c))) and ceil_c = pow(2, ceil(log2(c))), 726 // return (add constMult(x, floor_c), constMult(x, c - floor_c)). 727 if ((C - Floor).ule(Ceil - C)) { 728 SDValue Op0 = genConstMult(X, Floor, DL, VT, ShiftTy, DAG); 729 SDValue Op1 = genConstMult(X, C - Floor, DL, VT, ShiftTy, DAG); 730 return DAG.getNode(ISD::ADD, DL, VT, Op0, Op1); 731 } 732 733 // If |c - floor_c| > |c - ceil_c|, 734 // return (sub constMult(x, ceil_c), constMult(x, ceil_c - c)). 735 SDValue Op0 = genConstMult(X, Ceil, DL, VT, ShiftTy, DAG); 736 SDValue Op1 = genConstMult(X, Ceil - C, DL, VT, ShiftTy, DAG); 737 return DAG.getNode(ISD::SUB, DL, VT, Op0, Op1); 738 } 739 742 const MipsSETargetLowering *TL) { 743 EVT VT = N->getValueType(0); 744 745 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1))) 746 if (!VT.isVector()) 747 return genConstMult(N->getOperand(0), C->getAPIntValue(), SDLoc(N), VT, 748 TL->getScalarShiftAmountTy(DAG.getDataLayout(), VT), 749 DAG); 750 751 return SDValue(N, 0); 752 } 753 754 static SDValue performDSPShiftCombine(unsigned Opc, SDNode *N, EVT Ty, 755 SelectionDAG &DAG, 756 const MipsSubtarget &Subtarget) { 757 // See if this is a vector splat immediate node. 758 APInt SplatValue, SplatUndef; 759 unsigned SplatBitSize; 760 bool HasAnyUndefs; 761 unsigned EltSize = Ty.getScalarSizeInBits(); 763 764 if (!Subtarget.hasDSP()) 765 return SDValue(); 766 767 if (!BV || 768 !BV->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, HasAnyUndefs, 769 EltSize, !Subtarget.isLittle()) || 770 (SplatBitSize != EltSize) || 771 (SplatValue.getZExtValue() >= EltSize)) 772 return SDValue(); 773 774 SDLoc DL(N); 775 return DAG.getNode(Opc, DL, Ty, N->getOperand(0), 776 DAG.getConstant(SplatValue.getZExtValue(), DL, MVT::i32)); 777 } 778 781 const MipsSubtarget &Subtarget) { 782 EVT Ty = N->getValueType(0); 783 784 if ((Ty != MVT::v2i16) && (Ty != MVT::v4i8)) 785 return SDValue(); 786 787 return performDSPShiftCombine(MipsISD::SHLL_DSP, N, Ty, DAG, Subtarget); 788 } 789 790 // Fold sign-extensions into MipsISD::VEXTRACT_[SZ]EXT_ELT for MSA and fold 791 // constant splats into MipsISD::SHRA_DSP for DSPr2. 792 // 793 // Performs the following transformations: 794 // - Changes MipsISD::VEXTRACT_[SZ]EXT_ELT to sign extension if its 795 // sign/zero-extension is completely overwritten by the new one performed by 796 // the ISD::SRA and ISD::SHL nodes. 797 // - Removes redundant sign extensions performed by an ISD::SRA and ISD::SHL 798 // sequence. 799 // 800 // See performDSPShiftCombine for more information about the transformation 801 // used for DSPr2. 804 const MipsSubtarget &Subtarget) { 805 EVT Ty = N->getValueType(0); 806 807 if (Subtarget.hasMSA()) { 808 SDValue Op0 = N->getOperand(0); 809 SDValue Op1 = N->getOperand(1); 810 811 // (sra (shl (MipsVExtract[SZ]Ext $a, $b, $c), imm:$d), imm:$d) 812 // where $d + sizeof($c) == 32 813 // or $d + sizeof($c) <= 32 and SExt 814 // -> (MipsVExtractSExt $a, $b, $c) 815 if (Op0->getOpcode() == ISD::SHL && Op1 == Op0->getOperand(1)) { 816 SDValue Op0Op0 = Op0->getOperand(0); 817 ConstantSDNode *ShAmount = dyn_cast<ConstantSDNode>(Op1); 818 819 if (!ShAmount) 820 return SDValue(); 821 822 if (Op0Op0->getOpcode() != MipsISD::VEXTRACT_SEXT_ELT && 824 return SDValue(); 825 826 EVT ExtendTy = cast<VTSDNode>(Op0Op0->getOperand(2))->getVT(); 827 unsigned TotalBits = ShAmount->getZExtValue() + ExtendTy.getSizeInBits(); 828 829 if (TotalBits == 32 || 830 (Op0Op0->getOpcode() == MipsISD::VEXTRACT_SEXT_ELT && 831 TotalBits <= 32)) { 832 SDValue Ops[] = { Op0Op0->getOperand(0), Op0Op0->getOperand(1), 833 Op0Op0->getOperand(2) }; 834 return DAG.getNode(MipsISD::VEXTRACT_SEXT_ELT, SDLoc(Op0Op0), 835 Op0Op0->getVTList(), 836 makeArrayRef(Ops, Op0Op0->getNumOperands())); 837 } 838 } 839 } 840 841 if ((Ty != MVT::v2i16) && ((Ty != MVT::v4i8) || !Subtarget.hasDSPR2())) 842 return SDValue(); 843 844 return performDSPShiftCombine(MipsISD::SHRA_DSP, N, Ty, DAG, Subtarget); 845 } 846 847 850 const MipsSubtarget &Subtarget) { 851 EVT Ty = N->getValueType(0); 852 853 if (((Ty != MVT::v2i16) || !Subtarget.hasDSPR2()) && (Ty != MVT::v4i8)) 854 return SDValue(); 855 856 return performDSPShiftCombine(MipsISD::SHRL_DSP, N, Ty, DAG, Subtarget); 857 } 858 859 static bool isLegalDSPCondCode(EVT Ty, ISD::CondCode CC) { 860 bool IsV216 = (Ty == MVT::v2i16); 861 862 switch (CC) { 863 case ISD::SETEQ: 864 case ISD::SETNE: return true; 865 case ISD::SETLT: 866 case ISD::SETLE: 867 case ISD::SETGT: 868 case ISD::SETGE: return IsV216; 869 case ISD::SETULT: 870 case ISD::SETULE: 871 case ISD::SETUGT: 872 case ISD::SETUGE: return !IsV216; 873 default: return false; 874 } 875 } 876 878 EVT Ty = N->getValueType(0); 879 880 if ((Ty != MVT::v2i16) && (Ty != MVT::v4i8)) 881 return SDValue(); 882 883 if (!isLegalDSPCondCode(Ty, cast<CondCodeSDNode>(N->getOperand(2))->get())) 884 return SDValue(); 885 886 return DAG.getNode(MipsISD::SETCC_DSP, SDLoc(N), Ty, N->getOperand(0), 887 N->getOperand(1), N->getOperand(2)); 888 } 889 891 EVT Ty = N->getValueType(0); 892 893 if (Ty.is128BitVector() && Ty.isInteger()) { 894 // Try the following combines: 895 // (vselect (setcc $a, $b, SETLT), $b, $a)) -> (vsmax $a, $b) 896 // (vselect (setcc $a, $b, SETLE), $b, $a)) -> (vsmax $a, $b) 897 // (vselect (setcc $a, $b, SETLT), $a, $b)) -> (vsmin $a, $b) 898 // (vselect (setcc $a, $b, SETLE), $a, $b)) -> (vsmin $a, $b) 899 // (vselect (setcc $a, $b, SETULT), $b, $a)) -> (vumax $a, $b) 900 // (vselect (setcc $a, $b, SETULE), $b, $a)) -> (vumax $a, $b) 901 // (vselect (setcc $a, $b, SETULT), $a, $b)) -> (vumin $a, $b) 902 // (vselect (setcc $a, $b, SETULE), $a, $b)) -> (vumin $a, $b) 903 // SETGT/SETGE/SETUGT/SETUGE variants of these will show up initially but 904 // will be expanded to equivalent SETLT/SETLE/SETULT/SETULE versions by the 905 // legalizer. 906 SDValue Op0 = N->getOperand(0); 907 908 if (Op0->getOpcode() != ISD::SETCC) 909 return SDValue(); 910 911 ISD::CondCode CondCode = cast<CondCodeSDNode>(Op0->getOperand(2))->get(); 912 bool Signed; 913 914 if (CondCode == ISD::SETLT || CondCode == ISD::SETLE) 915 Signed = true; 916 else if (CondCode == ISD::SETULT || CondCode == ISD::SETULE) 917 Signed = false; 918 else 919 return SDValue(); 920 921 SDValue Op1 = N->getOperand(1); 922 SDValue Op2 = N->getOperand(2); 923 SDValue Op0Op0 = Op0->getOperand(0); 924 SDValue Op0Op1 = Op0->getOperand(1); 925 926 if (Op1 == Op0Op0 && Op2 == Op0Op1) 927 return DAG.getNode(Signed ? MipsISD::VSMIN : MipsISD::VUMIN, SDLoc(N), 928 Ty, Op1, Op2); 929 else if (Op1 == Op0Op1 && Op2 == Op0Op0) 930 return DAG.getNode(Signed ? MipsISD::VSMAX : MipsISD::VUMAX, SDLoc(N), 931 Ty, Op1, Op2); 932 } else if ((Ty == MVT::v2i16) || (Ty == MVT::v4i8)) { 933 SDValue SetCC = N->getOperand(0); 934 935 if (SetCC.getOpcode() != MipsISD::SETCC_DSP) 936 return SDValue(); 937 938 return DAG.getNode(MipsISD::SELECT_CC_DSP, SDLoc(N), Ty, 939 SetCC.getOperand(0), SetCC.getOperand(1), 940 N->getOperand(1), N->getOperand(2), SetCC.getOperand(2)); 941 } 942 943 return SDValue(); 944 } 945 947 const MipsSubtarget &Subtarget) { 948 EVT Ty = N->getValueType(0); 949 950 if (Subtarget.hasMSA() && Ty.is128BitVector() && Ty.isInteger()) { 951 // Try the following combines: 952 // (xor (or $a, $b), (build_vector allones)) 953 // (xor (or $a, $b), (bitcast (build_vector allones))) 954 SDValue Op0 = N->getOperand(0); 955 SDValue Op1 = N->getOperand(1); 956 SDValue NotOp; 957 959 NotOp = Op1; 960 else if (ISD::isBuildVectorAllOnes(Op1.getNode())) 961 NotOp = Op0; 962 else 963 return SDValue(); 964 965 if (NotOp->getOpcode() == ISD::OR) 966 return DAG.getNode(MipsISD::VNOR, SDLoc(N), Ty, NotOp->getOperand(0), 967 NotOp->getOperand(1)); 968 } 969 970 return SDValue(); 971 } 972 973 SDValue 975 SelectionDAG &DAG = DCI.DAG; 976 SDValue Val; 977 978 switch (N->getOpcode()) { 979 case ISD::AND: 980 Val = performANDCombine(N, DAG, DCI, Subtarget); 981 break; 982 case ISD::OR: 983 Val = performORCombine(N, DAG, DCI, Subtarget); 984 break; 985 case ISD::MUL: 986 return performMULCombine(N, DAG, DCI, this); 987 case ISD::SHL: 988 Val = performSHLCombine(N, DAG, DCI, Subtarget); 989 break; 990 case ISD::SRA: 991 return performSRACombine(N, DAG, DCI, Subtarget); 992 case ISD::SRL: 993 return performSRLCombine(N, DAG, DCI, Subtarget); 994 case ISD::VSELECT: 995 return performVSELECTCombine(N, DAG); 996 case ISD::XOR: 997 Val = performXORCombine(N, DAG, Subtarget); 998 break; 999 case ISD::SETCC: 1000 Val = performSETCCCombine(N, DAG); 1001 break; 1002 } 1003 1004 if (Val.getNode()) { 1005 DEBUG(dbgs() << "\nMipsSE DAG Combine:\n"; 1006 N->printrWithDepth(dbgs(), &DAG); 1007 dbgs() << "\n=> \n"; 1008 Val.getNode()->printrWithDepth(dbgs(), &DAG); 1009 dbgs() << "\n"); 1010 return Val; 1011 } 1012 1014 } 1015 1018 MachineBasicBlock *BB) const { 1019 switch (MI.getOpcode()) { 1020 default: 1022 case Mips::BPOSGE32_PSEUDO: 1023 return emitBPOSGE32(MI, BB); 1024 case Mips::SNZ_B_PSEUDO: 1025 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_B); 1026 case Mips::SNZ_H_PSEUDO: 1027 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_H); 1028 case Mips::SNZ_W_PSEUDO: 1029 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_W); 1030 case Mips::SNZ_D_PSEUDO: 1031 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_D); 1032 case Mips::SNZ_V_PSEUDO: 1033 return emitMSACBranchPseudo(MI, BB, Mips::BNZ_V); 1034 case Mips::SZ_B_PSEUDO: 1035 return emitMSACBranchPseudo(MI, BB, Mips::BZ_B); 1036 case Mips::SZ_H_PSEUDO: 1037 return emitMSACBranchPseudo(MI, BB, Mips::BZ_H); 1038 case Mips::SZ_W_PSEUDO: 1039 return emitMSACBranchPseudo(MI, BB, Mips::BZ_W); 1040 case Mips::SZ_D_PSEUDO: 1041 return emitMSACBranchPseudo(MI, BB, Mips::BZ_D); 1042 case Mips::SZ_V_PSEUDO: 1043 return emitMSACBranchPseudo(MI, BB, Mips::BZ_V); 1044 case Mips::COPY_FW_PSEUDO: 1045 return emitCOPY_FW(MI, BB); 1046 case Mips::COPY_FD_PSEUDO: 1047 return emitCOPY_FD(MI, BB); 1048 case Mips::INSERT_FW_PSEUDO: 1049 return emitINSERT_FW(MI, BB); 1050 case Mips::INSERT_FD_PSEUDO: 1051 return emitINSERT_FD(MI, BB); 1052 case Mips::INSERT_B_VIDX_PSEUDO: 1053 case Mips::INSERT_B_VIDX64_PSEUDO: 1054 return emitINSERT_DF_VIDX(MI, BB, 1, false); 1055 case Mips::INSERT_H_VIDX_PSEUDO: 1056 case Mips::INSERT_H_VIDX64_PSEUDO: 1057 return emitINSERT_DF_VIDX(MI, BB, 2, false); 1058 case Mips::INSERT_W_VIDX_PSEUDO: 1059 case Mips::INSERT_W_VIDX64_PSEUDO: 1060 return emitINSERT_DF_VIDX(MI, BB, 4, false); 1061 case Mips::INSERT_D_VIDX_PSEUDO: 1062 case Mips::INSERT_D_VIDX64_PSEUDO: 1063 return emitINSERT_DF_VIDX(MI, BB, 8, false); 1064 case Mips::INSERT_FW_VIDX_PSEUDO: 1065 case Mips::INSERT_FW_VIDX64_PSEUDO: 1066 return emitINSERT_DF_VIDX(MI, BB, 4, true); 1067 case Mips::INSERT_FD_VIDX_PSEUDO: 1068 case Mips::INSERT_FD_VIDX64_PSEUDO: 1069 return emitINSERT_DF_VIDX(MI, BB, 8, true); 1070 case Mips::FILL_FW_PSEUDO: 1071 return emitFILL_FW(MI, BB); 1072 case Mips::FILL_FD_PSEUDO: 1073 return emitFILL_FD(MI, BB); 1074 case Mips::FEXP2_W_1_PSEUDO: 1075 return emitFEXP2_W_1(MI, BB); 1076 case Mips::FEXP2_D_1_PSEUDO: 1077 return emitFEXP2_D_1(MI, BB); 1078 case Mips::ST_F16: 1079 return emitST_F16_PSEUDO(MI, BB); 1080 case Mips::LD_F16: 1081 return emitLD_F16_PSEUDO(MI, BB); 1082 case Mips::MSA_FP_EXTEND_W_PSEUDO: 1083 return emitFPEXTEND_PSEUDO(MI, BB, false); 1084 case Mips::MSA_FP_ROUND_W_PSEUDO: 1085 return emitFPROUND_PSEUDO(MI, BB, false); 1086 case Mips::MSA_FP_EXTEND_D_PSEUDO: 1087 return emitFPEXTEND_PSEUDO(MI, BB, true); 1088 case Mips::MSA_FP_ROUND_D_PSEUDO: 1089 return emitFPROUND_PSEUDO(MI, BB, true); 1090 } 1091 } 1092 1093 bool MipsSETargetLowering::isEligibleForTailCallOptimization( 1094 const CCState &CCInfo, unsigned NextStackOffset, 1095 const MipsFunctionInfo &FI) const { 1096 if (!UseMipsTailCalls) 1097 return false; 1098 1099 // Exception has to be cleared with eret. 1100 if (FI.isISR()) 1101 return false; 1102 1103 // Return false if either the callee or caller has a byval argument. 1104 if (CCInfo.getInRegsParamsCount() > 0 || FI.hasByvalArg()) 1105 return false; 1106 1107 // Return true if the callee's argument area is no larger than the 1108 // caller's. 1109 return NextStackOffset <= FI.getIncomingArgSize(); 1110 } 1111 1112 void MipsSETargetLowering:: 1113 getOpndList(SmallVectorImpl<SDValue> &Ops, 1114 std::deque<std::pair<unsigned, SDValue>> &RegsToPass, 1115 bool IsPICCall, bool GlobalOrExternal, bool InternalLinkage, 1116 bool IsCallReloc, CallLoweringInfo &CLI, SDValue Callee, 1117 SDValue Chain) const { 1118 Ops.push_back(Callee); 1119 MipsTargetLowering::getOpndList(Ops, RegsToPass, IsPICCall, GlobalOrExternal, 1120 InternalLinkage, IsCallReloc, CLI, Callee, 1121 Chain); 1122 } 1123 1124 SDValue MipsSETargetLowering::lowerLOAD(SDValue Op, SelectionDAG &DAG) const { 1125 LoadSDNode &Nd = *cast<LoadSDNode>(Op); 1126 1127 if (Nd.getMemoryVT() != MVT::f64 || !NoDPLoadStore) 1128 return MipsTargetLowering::lowerLOAD(Op, DAG); 1129 1130 // Replace a double precision load with two i32 loads and a buildpair64. 1131 SDLoc DL(Op); 1132 SDValue Ptr = Nd.getBasePtr(), Chain = Nd.getChain(); 1133 EVT PtrVT = Ptr.getValueType(); 1134 1135 // i32 load from lower address. 1136 SDValue Lo = DAG.getLoad(MVT::i32, DL, Chain, Ptr, MachinePointerInfo(), 1137 Nd.getAlignment(), Nd.getMemOperand()->getFlags()); 1138 1139 // i32 load from higher address. 1140 Ptr = DAG.getNode(ISD::ADD, DL, PtrVT, Ptr, DAG.getConstant(4, DL, PtrVT)); 1141 SDValue Hi = DAG.getLoad( 1142 MVT::i32, DL, Lo.getValue(1), Ptr, MachinePointerInfo(), 1143 std::min(Nd.getAlignment(), 4U), Nd.getMemOperand()->getFlags()); 1144 1145 if (!Subtarget.isLittle()) 1146 std::swap(Lo, Hi); 1147 1148 SDValue BP = DAG.getNode(MipsISD::BuildPairF64, DL, MVT::f64, Lo, Hi); 1149 SDValue Ops[2] = {BP, Hi.getValue(1)}; 1150 return DAG.getMergeValues(Ops, DL); 1151 } 1152 1153 SDValue MipsSETargetLowering::lowerSTORE(SDValue Op, SelectionDAG &DAG) const { 1154 StoreSDNode &Nd = *cast<StoreSDNode>(Op); 1155 1156 if (Nd.getMemoryVT() != MVT::f64 || !NoDPLoadStore) 1157 return MipsTargetLowering::lowerSTORE(Op, DAG); 1158 1159 // Replace a double precision store with two extractelement64s and i32 stores. 1160 SDLoc DL(Op); 1161 SDValue Val = Nd.getValue(), Ptr = Nd.getBasePtr(), Chain = Nd.getChain(); 1162 EVT PtrVT = Ptr.getValueType(); 1164 Val, DAG.getConstant(0, DL, MVT::i32)); 1166 Val, DAG.getConstant(1, DL, MVT::i32)); 1167 1168 if (!Subtarget.isLittle()) 1169 std::swap(Lo, Hi); 1170 1171 // i32 store to lower address. 1172 Chain = 1173 DAG.getStore(Chain, DL, Lo, Ptr, MachinePointerInfo(), Nd.getAlignment(), 1174 Nd.getMemOperand()->getFlags(), Nd.getAAInfo()); 1175 1176 // i32 store to higher address. 1177 Ptr = DAG.getNode(ISD::ADD, DL, PtrVT, Ptr, DAG.getConstant(4, DL, PtrVT)); 1178 return DAG.getStore(Chain, DL, Hi, Ptr, MachinePointerInfo(), 1179 std::min(Nd.getAlignment(), 4U), 1180 Nd.getMemOperand()->getFlags(), Nd.getAAInfo()); 1181 } 1182 1183 SDValue MipsSETargetLowering::lowerMulDiv(SDValue Op, unsigned NewOpc, 1184 bool HasLo, bool HasHi, 1185 SelectionDAG &DAG) const { 1186 // MIPS32r6/MIPS64r6 removed accumulator based multiplies. 1188 1189 EVT Ty = Op.getOperand(0).getValueType(); 1190 SDLoc DL(Op); 1191 SDValue Mult = DAG.getNode(NewOpc, DL, MVT::Untyped, 1192 Op.getOperand(0), Op.getOperand(1)); 1193 SDValue Lo, Hi; 1194 1195 if (HasLo) 1196 Lo = DAG.getNode(MipsISD::MFLO, DL, Ty, Mult); 1197 if (HasHi) 1198 Hi = DAG.getNode(MipsISD::MFHI, DL, Ty, Mult); 1199 1200 if (!HasLo || !HasHi) 1201 return HasLo ? Lo : Hi; 1202 1203 SDValue Vals[] = { Lo, Hi }; 1204 return DAG.getMergeValues(Vals, DL); 1205 } 1206 1208 SDValue InLo = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i32, In, 1209 DAG.getConstant(0, DL, MVT::i32)); 1210 SDValue InHi = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i32, In, 1211 DAG.getConstant(1, DL, MVT::i32)); 1212 return DAG.getNode(MipsISD::MTLOHI, DL, MVT::Untyped, InLo, InHi); 1213 } 1214 1215 static SDValue extractLOHI(SDValue Op, const SDLoc &DL, SelectionDAG &DAG) { 1216 SDValue Lo = DAG.getNode(MipsISD::MFLO, DL, MVT::i32, Op); 1217 SDValue Hi = DAG.getNode(MipsISD::MFHI, DL, MVT::i32, Op); 1218 return DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i64, Lo, Hi); 1219 } 1220 1221 // This function expands mips intrinsic nodes which have 64-bit input operands 1222 // or output values. 1223 // 1224 // out64 = intrinsic-node in64 1225 // => 1226 // lo = copy (extract-element (in64, 0)) 1227 // hi = copy (extract-element (in64, 1)) 1228 // mips-specific-node 1229 // v0 = copy lo 1230 // v1 = copy hi 1231 // out64 = merge-values (v0, v1) 1232 // 1233 static SDValue lowerDSPIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) { 1234 SDLoc DL(Op); 1235 bool HasChainIn = Op->getOperand(0).getValueType() == MVT::Other; 1237 unsigned OpNo = 0; 1238 1239 // See if Op has a chain input. 1240 if (HasChainIn) 1241 Ops.push_back(Op->getOperand(OpNo++)); 1242 1243 // The next operand is the intrinsic opcode. 1245 1246 // See if the next operand has type i64. 1247 SDValue Opnd = Op->getOperand(++OpNo), In64; 1248 1249 if (Opnd.getValueType() == MVT::i64) 1250 In64 = initAccumulator(Opnd, DL, DAG); 1251 else 1252 Ops.push_back(Opnd); 1253 1254 // Push the remaining operands. 1255 for (++OpNo ; OpNo < Op->getNumOperands(); ++OpNo) 1256 Ops.push_back(Op->getOperand(OpNo)); 1257 1258 // Add In64 to the end of the list. 1259 if (In64.getNode()) 1260 Ops.push_back(In64); 1261 1262 // Scan output. 1263 SmallVector<EVT, 2> ResTys; 1264 1265 for (SDNode::value_iterator I = Op->value_begin(), E = Op->value_end(); 1266 I != E; ++I) 1267 ResTys.push_back((*I == MVT::i64) ? MVT::Untyped : *I); 1268 1269 // Create node. 1270 SDValue Val = DAG.getNode(Opc, DL, ResTys, Ops); 1271 SDValue Out = (ResTys[0] == MVT::Untyped) ? extractLOHI(Val, DL, DAG) : Val; 1272 1273 if (!HasChainIn) 1274 return Out; 1275 1276 assert(Val->getValueType(1) == MVT::Other); 1277 SDValue Vals[] = { Out, SDValue(Val.getNode(), 1) }; 1278 return DAG.getMergeValues(Vals, DL); 1279 } 1280 1281 // Lower an MSA copy intrinsic into the specified SelectionDAG node 1282 static SDValue lowerMSACopyIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) { 1283 SDLoc DL(Op); 1284 SDValue Vec = Op->getOperand(1); 1285 SDValue Idx = Op->getOperand(2); 1286 EVT ResTy = Op->getValueType(0); 1287 EVT EltTy = Vec->getValueType(0).getVectorElementType(); 1288 1289 SDValue Result = DAG.getNode(Opc, DL, ResTy, Vec, Idx, 1290 DAG.getValueType(EltTy)); 1291 1292 return Result; 1293 } 1294 1295 static SDValue lowerMSASplatZExt(SDValue Op, unsigned OpNr, SelectionDAG &DAG) { 1296 EVT ResVecTy = Op->getValueType(0); 1297 EVT ViaVecTy = ResVecTy; 1298 bool BigEndian = !DAG.getSubtarget().getTargetTriple().isLittleEndian(); 1299 SDLoc DL(Op); 1300 1301 // When ResVecTy == MVT::v2i64, LaneA is the upper 32 bits of the lane and 1302 // LaneB is the lower 32-bits. Otherwise LaneA and LaneB are alternating 1303 // lanes. 1304 SDValue LaneA = Op->getOperand(OpNr); 1305 SDValue LaneB; 1306 1307 if (ResVecTy == MVT::v2i64) { 1308 LaneB = DAG.getConstant(0, DL, MVT::i32); 1309 ViaVecTy = MVT::v4i32; 1310 if(BigEndian) 1311 std::swap(LaneA, LaneB); 1312 } else 1313 LaneB = LaneA; 1314 1315 SDValue Ops[16] = { LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, 1316 LaneA, LaneB, LaneA, LaneB, LaneA, LaneB, LaneA, LaneB }; 1317 1318 SDValue Result = DAG.getBuildVector( 1319 ViaVecTy, DL, makeArrayRef(Ops, ViaVecTy.getVectorNumElements())); 1320 1321 if (ViaVecTy != ResVecTy) { 1322 SDValue One = DAG.getConstant(1, DL, ViaVecTy); 1323 Result = DAG.getNode(ISD::BITCAST, DL, ResVecTy, 1324 DAG.getNode(ISD::AND, DL, ViaVecTy, Result, One)); 1325 } 1326 1327 return Result; 1328 } 1329 1330 static SDValue lowerMSASplatImm(SDValue Op, unsigned ImmOp, SelectionDAG &DAG, 1331 bool IsSigned = false) { 1332 return DAG.getConstant( 1334 Op->getConstantOperandVal(ImmOp), IsSigned), 1335 SDLoc(Op), Op->getValueType(0)); 1336 } 1337 1338 static SDValue getBuildVectorSplat(EVT VecTy, SDValue SplatValue, 1339 bool BigEndian, SelectionDAG &DAG) { 1340 EVT ViaVecTy = VecTy; 1341 SDValue SplatValueA = SplatValue; 1342 SDValue SplatValueB = SplatValue; 1343 SDLoc DL(SplatValue); 1344 1345 if (VecTy == MVT::v2i64) { 1346 // v2i64 BUILD_VECTOR must be performed via v4i32 so split into i32's. 1347 ViaVecTy = MVT::v4i32; 1348 1349 SplatValueA = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, SplatValue); 1350 SplatValueB = DAG.getNode(ISD::SRL, DL, MVT::i64, SplatValue, 1351 DAG.getConstant(32, DL, MVT::i32)); 1352 SplatValueB = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, SplatValueB); 1353 } 1354 1355 // We currently hold the parts in little endian order. Swap them if 1356 // necessary. 1357 if (BigEndian) 1358 std::swap(SplatValueA, SplatValueB); 1359 1360 SDValue Ops[16] = { SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1361 SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1362 SplatValueA, SplatValueB, SplatValueA, SplatValueB, 1363 SplatValueA, SplatValueB, SplatValueA, SplatValueB }; 1364 1365 SDValue Result = DAG.getBuildVector( 1366 ViaVecTy, DL, makeArrayRef(Ops, ViaVecTy.getVectorNumElements())); 1367 1368 if (VecTy != ViaVecTy) 1369 Result = DAG.getNode(ISD::BITCAST, DL, VecTy, Result); 1370 1371 return Result; 1372 } 1373 1375 unsigned Opc, SDValue Imm, 1376 bool BigEndian) { 1377 EVT VecTy = Op->getValueType(0); 1378 SDValue Exp2Imm; 1379 SDLoc DL(Op); 1380 1381 // The DAG Combiner can't constant fold bitcasted vectors yet so we must do it 1382 // here for now. 1383 if (VecTy == MVT::v2i64) { 1384 if (ConstantSDNode *CImm = dyn_cast<ConstantSDNode>(Imm)) { 1385 APInt BitImm = APInt(64, 1) << CImm->getAPIntValue(); 1386 1387 SDValue BitImmHiOp = DAG.getConstant(BitImm.lshr(32).trunc(32), DL, 1388 MVT::i32); 1389 SDValue BitImmLoOp = DAG.getConstant(BitImm.trunc(32), DL, MVT::i32); 1390 1391 if (BigEndian) 1392 std::swap(BitImmLoOp, BitImmHiOp); 1393 1394 Exp2Imm = DAG.getNode( 1395 ISD::BITCAST, DL, MVT::v2i64, 1396 DAG.getBuildVector(MVT::v4i32, DL, 1397 {BitImmLoOp, BitImmHiOp, BitImmLoOp, BitImmHiOp})); 1398 } 1399 } 1400 1401 if (!Exp2Imm.getNode()) { 1402 // We couldnt constant fold, do a vector shift instead 1403 1404 // Extend i32 to i64 if necessary. Sign or zero extend doesn't matter since 1405 // only values 0-63 are valid. 1406 if (VecTy == MVT::v2i64) 1407 Imm = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i64, Imm); 1408 1409 Exp2Imm = getBuildVectorSplat(VecTy, Imm, BigEndian, DAG); 1410 1411 Exp2Imm = DAG.getNode(ISD::SHL, DL, VecTy, DAG.getConstant(1, DL, VecTy), 1412 Exp2Imm); 1413 } 1414 1415 return DAG.getNode(Opc, DL, VecTy, Op->getOperand(1), Exp2Imm); 1416 } 1417 1419 SDLoc DL(Op); 1420 EVT ResTy = Op->getValueType(0); 1421 SDValue Vec = Op->getOperand(2); 1422 bool BigEndian = !DAG.getSubtarget().getTargetTriple().isLittleEndian(); 1423 MVT ResEltTy = ResTy == MVT::v2i64 ? MVT::i64 : MVT::i32; 1424 SDValue ConstValue = DAG.getConstant(Vec.getScalarValueSizeInBits() - 1, 1425 DL, ResEltTy); 1426 SDValue SplatVec = getBuildVectorSplat(ResTy, ConstValue, BigEndian, DAG); 1427 1428 return DAG.getNode(ISD::AND, DL, ResTy, Vec, SplatVec); 1429 } 1430 1432 EVT ResTy = Op->getValueType(0); 1433 SDLoc DL(Op); 1434 SDValue One = DAG.getConstant(1, DL, ResTy); 1435 SDValue Bit = DAG.getNode(ISD::SHL, DL, ResTy, One, truncateVecElts(Op, DAG)); 1436 1437 return DAG.getNode(ISD::AND, DL, ResTy, Op->getOperand(1), 1438 DAG.getNOT(DL, Bit, ResTy)); 1439 } 1440 1442 SDLoc DL(Op); 1443 EVT ResTy = Op->getValueType(0); 1444 APInt BitImm = APInt(ResTy.getScalarSizeInBits(), 1) 1445 << cast<ConstantSDNode>(Op->getOperand(2))->getAPIntValue(); 1446 SDValue BitMask = DAG.getConstant(~BitImm, DL, ResTy); 1447 1448 return DAG.getNode(ISD::AND, DL, ResTy, Op->getOperand(1), BitMask); 1449 } 1450 1451 SDValue MipsSETargetLowering::lowerINTRINSIC_WO_CHAIN(SDValue Op, 1452 SelectionDAG &DAG) const { 1453 SDLoc DL(Op); 1454 unsigned Intrinsic = cast<ConstantSDNode>(Op->getOperand(0))->getZExtValue(); 1455 switch (Intrinsic) { 1456 default: 1457 return SDValue(); 1458 case Intrinsic::mips_shilo: 1459 return lowerDSPIntr(Op, DAG, MipsISD::SHILO); 1460 case Intrinsic::mips_dpau_h_qbl: 1461 return lowerDSPIntr(Op, DAG, MipsISD::DPAU_H_QBL); 1462 case Intrinsic::mips_dpau_h_qbr: 1463 return lowerDSPIntr(Op, DAG, MipsISD::DPAU_H_QBR); 1464 case Intrinsic::mips_dpsu_h_qbl: 1465 return lowerDSPIntr(Op, DAG, MipsISD::DPSU_H_QBL); 1466 case Intrinsic::mips_dpsu_h_qbr: 1467 return lowerDSPIntr(Op, DAG, MipsISD::DPSU_H_QBR); 1468 case Intrinsic::mips_dpa_w_ph: 1469 return lowerDSPIntr(Op, DAG, MipsISD::DPA_W_PH); 1470 case Intrinsic::mips_dps_w_ph: 1471 return lowerDSPIntr(Op, DAG, MipsISD::DPS_W_PH); 1472 case Intrinsic::mips_dpax_w_ph: 1473 return lowerDSPIntr(Op, DAG, MipsISD::DPAX_W_PH); 1474 case Intrinsic::mips_dpsx_w_ph: 1475 return lowerDSPIntr(Op, DAG, MipsISD::DPSX_W_PH); 1476 case Intrinsic::mips_mulsa_w_ph: 1477 return lowerDSPIntr(Op, DAG, MipsISD::MULSA_W_PH); 1478 case Intrinsic::mips_mult: 1479 return lowerDSPIntr(Op, DAG, MipsISD::Mult); 1480 case Intrinsic::mips_multu: 1481 return lowerDSPIntr(Op, DAG, MipsISD::Multu); 1482 case Intrinsic::mips_madd: 1483 return lowerDSPIntr(Op, DAG, MipsISD::MAdd); 1484 case Intrinsic::mips_maddu: 1485 return lowerDSPIntr(Op, DAG, MipsISD::MAddu); 1486 case Intrinsic::mips_msub: 1487 return lowerDSPIntr(Op, DAG, MipsISD::MSub); 1488 case Intrinsic::mips_msubu: 1489 return lowerDSPIntr(Op, DAG, MipsISD::MSubu); 1490 case Intrinsic::mips_addv_b: 1491 case Intrinsic::mips_addv_h: 1492 case Intrinsic::mips_addv_w: 1493 case Intrinsic::mips_addv_d: 1494 return DAG.getNode(ISD::ADD, DL, Op->getValueType(0), Op->getOperand(1), 1495 Op->getOperand(2)); 1496 case Intrinsic::mips_addvi_b: 1497 case Intrinsic::mips_addvi_h: 1498 case Intrinsic::mips_addvi_w: 1499 case Intrinsic::mips_addvi_d: 1500 return DAG.getNode(ISD::ADD, DL, Op->getValueType(0), Op->getOperand(1), 1501 lowerMSASplatImm(Op, 2, DAG)); 1502 case Intrinsic::mips_and_v: 1503 return DAG.getNode(ISD::AND, DL, Op->getValueType(0), Op->getOperand(1), 1504 Op->getOperand(2)); 1505 case Intrinsic::mips_andi_b: 1506 return DAG.getNode(ISD::AND, DL, Op->getValueType(0), Op->getOperand(1), 1507 lowerMSASplatImm(Op, 2, DAG)); 1508 case Intrinsic::mips_bclr_b: 1509 case Intrinsic::mips_bclr_h: 1510 case Intrinsic::mips_bclr_w: 1511 case Intrinsic::mips_bclr_d: 1512 return lowerMSABitClear(Op, DAG); 1513 case Intrinsic::mips_bclri_b: 1514 case Intrinsic::mips_bclri_h: 1515 case Intrinsic::mips_bclri_w: 1516 case Intrinsic::mips_bclri_d: 1517 return lowerMSABitClearImm(Op, DAG); 1518 case Intrinsic::mips_binsli_b: 1519 case Intrinsic::mips_binsli_h: 1520 case Intrinsic::mips_binsli_w: 1521 case Intrinsic::mips_binsli_d: { 1522 // binsli_x(IfClear, IfSet, nbits) -> (vselect LBitsMask, IfSet, IfClear) 1523 EVT VecTy = Op->getValueType(0); 1524 EVT EltTy = VecTy.getVectorElementType(); 1525 if (Op->getConstantOperandVal(3) >= EltTy.getSizeInBits()) 1526 report_fatal_error("Immediate out of range"); 1528 Op->getConstantOperandVal(3) + 1); 1529 return DAG.getNode(ISD::VSELECT, DL, VecTy, 1530 DAG.getConstant(Mask, DL, VecTy, true), 1531 Op->getOperand(2), Op->getOperand(1)); 1532 } 1533 case Intrinsic::mips_binsri_b: 1534 case Intrinsic::mips_binsri_h: 1535 case Intrinsic::mips_binsri_w: 1536 case Intrinsic::mips_binsri_d: { 1537 // binsri_x(IfClear, IfSet, nbits) -> (vselect RBitsMask, IfSet, IfClear) 1538 EVT VecTy = Op->getValueType(0); 1539 EVT EltTy = VecTy.getVectorElementType(); 1540 if (Op->getConstantOperandVal(3) >= EltTy.getSizeInBits()) 1541 report_fatal_error("Immediate out of range"); 1543 Op->getConstantOperandVal(3) + 1); 1544 return DAG.getNode(ISD::VSELECT, DL, VecTy, 1545 DAG.getConstant(Mask, DL, VecTy, true), 1546 Op->getOperand(2), Op->getOperand(1)); 1547 } 1548 case Intrinsic::mips_bmnz_v: 1549 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), Op->getOperand(3), 1550 Op->getOperand(2), Op->getOperand(1)); 1551 case Intrinsic::mips_bmnzi_b: 1552 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1553 lowerMSASplatImm(Op, 3, DAG), Op->getOperand(2), 1554 Op->getOperand(1)); 1555 case Intrinsic::mips_bmz_v: 1556 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), Op->getOperand(3), 1557 Op->getOperand(1), Op->getOperand(2)); 1558 case Intrinsic::mips_bmzi_b: 1559 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1560 lowerMSASplatImm(Op, 3, DAG), Op->getOperand(1), 1561 Op->getOperand(2)); 1562 case Intrinsic::mips_bneg_b: 1563 case Intrinsic::mips_bneg_h: 1564 case Intrinsic::mips_bneg_w: 1565 case Intrinsic::mips_bneg_d: { 1566 EVT VecTy = Op->getValueType(0); 1567 SDValue One = DAG.getConstant(1, DL, VecTy); 1568 1569 return DAG.getNode(ISD::XOR, DL, VecTy, Op->getOperand(1), 1570 DAG.getNode(ISD::SHL, DL, VecTy, One, 1571 truncateVecElts(Op, DAG))); 1572 } 1573 case Intrinsic::mips_bnegi_b: 1574 case Intrinsic::mips_bnegi_h: 1575 case Intrinsic::mips_bnegi_w: 1576 case Intrinsic::mips_bnegi_d: 1577 return lowerMSABinaryBitImmIntr(Op, DAG, ISD::XOR, Op->getOperand(2), 1578 !Subtarget.isLittle()); 1579 case Intrinsic::mips_bnz_b: 1580 case Intrinsic::mips_bnz_h: 1581 case Intrinsic::mips_bnz_w: 1582 case Intrinsic::mips_bnz_d: 1583 return DAG.getNode(MipsISD::VALL_NONZERO, DL, Op->getValueType(0), 1584 Op->getOperand(1)); 1585 case Intrinsic::mips_bnz_v: 1586 return DAG.getNode(MipsISD::VANY_NONZERO, DL, Op->getValueType(0), 1587 Op->getOperand(1)); 1588 case Intrinsic::mips_bsel_v: 1589 // bsel_v(Mask, IfClear, IfSet) -> (vselect Mask, IfSet, IfClear) 1590 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1591 Op->getOperand(1), Op->getOperand(3), 1592 Op->getOperand(2)); 1593 case Intrinsic::mips_bseli_b: 1594 // bseli_v(Mask, IfClear, IfSet) -> (vselect Mask, IfSet, IfClear) 1595 return DAG.getNode(ISD::VSELECT, DL, Op->getValueType(0), 1596 Op->getOperand(1), lowerMSASplatImm(Op, 3, DAG), 1597 Op->getOperand(2)); 1598 case Intrinsic::mips_bset_b: 1599 case Intrinsic::mips_bset_h: 1600 case Intrinsic::mips_bset_w: 1601 case Intrinsic::mips_bset_d: { 1602 EVT VecTy = Op->getValueType(0); 1603 SDValue One = DAG.getConstant(1, DL, VecTy); 1604 1605 return DAG.getNode(ISD::OR, DL, VecTy, Op->getOperand(1), 1606 DAG.getNode(ISD::SHL, DL, VecTy, One, 1607 truncateVecElts(Op, DAG))); 1608 } 1609 case Intrinsic::mips_bseti_b: 1610 case Intrinsic::mips_bseti_h: 1611 case Intrinsic::mips_bseti_w: 1612 case Intrinsic::mips_bseti_d: 1613 return lowerMSABinaryBitImmIntr(Op, DAG, ISD::OR, Op->getOperand(2), 1614 !Subtarget.isLittle()); 1615 case Intrinsic::mips_bz_b: 1616 case Intrinsic::mips_bz_h: 1617 case Intrinsic::mips_bz_w: 1618 case Intrinsic::mips_bz_d: 1619 return DAG.getNode(MipsISD::VALL_ZERO, DL, Op->getValueType(0), 1620 Op->getOperand(1)); 1621 case Intrinsic::mips_bz_v: 1622 return DAG.getNode(MipsISD::VANY_ZERO, DL, Op->getValueType(0), 1623 Op->getOperand(1)); 1624 case Intrinsic::mips_ceq_b: 1625 case Intrinsic::mips_ceq_h: 1626 case Intrinsic::mips_ceq_w: 1627 case Intrinsic::mips_ceq_d: 1628 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1629 Op->getOperand(2), ISD::SETEQ); 1630 case Intrinsic::mips_ceqi_b: 1631 case Intrinsic::mips_ceqi_h: 1632 case Intrinsic::mips_ceqi_w: 1633 case Intrinsic::mips_ceqi_d: 1634 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1635 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETEQ); 1636 case Intrinsic::mips_cle_s_b: 1637 case Intrinsic::mips_cle_s_h: 1638 case Intrinsic::mips_cle_s_w: 1639 case Intrinsic::mips_cle_s_d: 1640 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1641 Op->getOperand(2), ISD::SETLE); 1642 case Intrinsic::mips_clei_s_b: 1643 case Intrinsic::mips_clei_s_h: 1644 case Intrinsic::mips_clei_s_w: 1645 case Intrinsic::mips_clei_s_d: 1646 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1647 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETLE); 1648 case Intrinsic::mips_cle_u_b: 1649 case Intrinsic::mips_cle_u_h: 1650 case Intrinsic::mips_cle_u_w: 1651 case Intrinsic::mips_cle_u_d: 1652 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1653 Op->getOperand(2), ISD::SETULE); 1654 case Intrinsic::mips_clei_u_b: 1655 case Intrinsic::mips_clei_u_h: 1656 case Intrinsic::mips_clei_u_w: 1657 case Intrinsic::mips_clei_u_d: 1658 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1659 lowerMSASplatImm(Op, 2, DAG), ISD::SETULE); 1660 case Intrinsic::mips_clt_s_b: 1661 case Intrinsic::mips_clt_s_h: 1662 case Intrinsic::mips_clt_s_w: 1663 case Intrinsic::mips_clt_s_d: 1664 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1665 Op->getOperand(2), ISD::SETLT); 1666 case Intrinsic::mips_clti_s_b: 1667 case Intrinsic::mips_clti_s_h: 1668 case Intrinsic::mips_clti_s_w: 1669 case Intrinsic::mips_clti_s_d: 1670 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1671 lowerMSASplatImm(Op, 2, DAG, true), ISD::SETLT); 1672 case Intrinsic::mips_clt_u_b: 1673 case Intrinsic::mips_clt_u_h: 1674 case Intrinsic::mips_clt_u_w: 1675 case Intrinsic::mips_clt_u_d: 1676 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1677 Op->getOperand(2), ISD::SETULT); 1678 case Intrinsic::mips_clti_u_b: 1679 case Intrinsic::mips_clti_u_h: 1680 case Intrinsic::mips_clti_u_w: 1681 case Intrinsic::mips_clti_u_d: 1682 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1683 lowerMSASplatImm(Op, 2, DAG), ISD::SETULT); 1684 case Intrinsic::mips_copy_s_b: 1685 case Intrinsic::mips_copy_s_h: 1686 case Intrinsic::mips_copy_s_w: 1688 case Intrinsic::mips_copy_s_d: 1689 if (Subtarget.hasMips64()) 1690 // Lower directly into VEXTRACT_SEXT_ELT since i64 is legal on Mips64. 1692 else { 1693 // Lower into the generic EXTRACT_VECTOR_ELT node and let the type 1694 // legalizer and EXTRACT_VECTOR_ELT lowering sort it out. 1695 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op), 1696 Op->getValueType(0), Op->getOperand(1), 1697 Op->getOperand(2)); 1698 } 1699 case Intrinsic::mips_copy_u_b: 1700 case Intrinsic::mips_copy_u_h: 1701 case Intrinsic::mips_copy_u_w: 1703 case Intrinsic::mips_copy_u_d: 1704 if (Subtarget.hasMips64()) 1705 // Lower directly into VEXTRACT_ZEXT_ELT since i64 is legal on Mips64. 1707 else { 1708 // Lower into the generic EXTRACT_VECTOR_ELT node and let the type 1709 // legalizer and EXTRACT_VECTOR_ELT lowering sort it out. 1710 // Note: When i64 is illegal, this results in copy_s.w instructions 1711 // instead of copy_u.w instructions. This makes no difference to the 1712 // behaviour since i64 is only illegal when the register file is 32-bit. 1713 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op), 1714 Op->getValueType(0), Op->getOperand(1), 1715 Op->getOperand(2)); 1716 } 1717 case Intrinsic::mips_div_s_b: 1718 case Intrinsic::mips_div_s_h: 1719 case Intrinsic::mips_div_s_w: 1720 case Intrinsic::mips_div_s_d: 1721 return DAG.getNode(ISD::SDIV, DL, Op->getValueType(0), Op->getOperand(1), 1722 Op->getOperand(2)); 1723 case Intrinsic::mips_div_u_b: 1724 case Intrinsic::mips_div_u_h: 1725 case Intrinsic::mips_div_u_w: 1726 case Intrinsic::mips_div_u_d: 1727 return DAG.getNode(ISD::UDIV, DL, Op->getValueType(0), Op->getOperand(1), 1728 Op->getOperand(2)); 1729 case Intrinsic::mips_fadd_w: 1730 case Intrinsic::mips_fadd_d: 1731 // TODO: If intrinsics have fast-math-flags, propagate them. 1732 return DAG.getNode(ISD::FADD, DL, Op->getValueType(0), Op->getOperand(1), 1733 Op->getOperand(2)); 1734 // Don't lower mips_fcaf_[wd] since LLVM folds SETFALSE condcodes away 1735 case Intrinsic::mips_fceq_w: 1736 case Intrinsic::mips_fceq_d: 1737 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1738 Op->getOperand(2), ISD::SETOEQ); 1739 case Intrinsic::mips_fcle_w: 1740 case Intrinsic::mips_fcle_d: 1741 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1742 Op->getOperand(2), ISD::SETOLE); 1743 case Intrinsic::mips_fclt_w: 1744 case Intrinsic::mips_fclt_d: 1745 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1746 Op->getOperand(2), ISD::SETOLT); 1747 case Intrinsic::mips_fcne_w: 1748 case Intrinsic::mips_fcne_d: 1749 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1750 Op->getOperand(2), ISD::SETONE); 1751 case Intrinsic::mips_fcor_w: 1752 case Intrinsic::mips_fcor_d: 1753 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1754 Op->getOperand(2), ISD::SETO); 1755 case Intrinsic::mips_fcueq_w: 1756 case Intrinsic::mips_fcueq_d: 1757 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1758 Op->getOperand(2), ISD::SETUEQ); 1759 case Intrinsic::mips_fcule_w: 1760 case Intrinsic::mips_fcule_d: 1761 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1762 Op->getOperand(2), ISD::SETULE); 1763 case Intrinsic::mips_fcult_w: 1764 case Intrinsic::mips_fcult_d: 1765 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1766 Op->getOperand(2), ISD::SETULT); 1767 case Intrinsic::mips_fcun_w: 1768 case Intrinsic::mips_fcun_d: 1769 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1770 Op->getOperand(2), ISD::SETUO); 1771 case Intrinsic::mips_fcune_w: 1772 case Intrinsic::mips_fcune_d: 1773 return DAG.getSetCC(DL, Op->getValueType(0), Op->getOperand(1), 1774 Op->getOperand(2), ISD::SETUNE); 1775 case Intrinsic::mips_fdiv_w: 1776 case Intrinsic::mips_fdiv_d: 1777 // TODO: If intrinsics have fast-math-flags, propagate them. 1778 return DAG.getNode(ISD::FDIV, DL, Op->getValueType(0), Op->getOperand(1), 1779 Op->getOperand(2)); 1780 case Intrinsic::mips_ffint_u_w: 1781 case Intrinsic::mips_ffint_u_d: 1782 return DAG.getNode(ISD::UINT_TO_FP, DL, Op->getValueType(0), 1783 Op->getOperand(1)); 1784 case Intrinsic::mips_ffint_s_w: 1785 case Intrinsic::mips_ffint_s_d: 1786 return DAG.getNode(ISD::SINT_TO_FP, DL, Op->getValueType(0), 1787 Op->getOperand(1)); 1788 case Intrinsic::mips_fill_b: 1789 case Intrinsic::mips_fill_h: 1790 case Intrinsic::mips_fill_w: 1791 case Intrinsic::mips_fill_d: { 1792 EVT ResTy = Op->getValueType(0); 1794 Op->getOperand(1)); 1795 1796 // If ResTy is v2i64 then the type legalizer will break this node down into 1797 // an equivalent v4i32. 1798 return DAG.getBuildVector(ResTy, DL, Ops); 1799 } 1800 case Intrinsic::mips_fexp2_w: 1801 case Intrinsic::mips_fexp2_d: { 1802 // TODO: If intrinsics have fast-math-flags, propagate them. 1803 EVT ResTy = Op->getValueType(0); 1804 return DAG.getNode( 1805 ISD::FMUL, SDLoc(Op), ResTy, Op->getOperand(1), 1806 DAG.getNode(ISD::FEXP2, SDLoc(Op), ResTy, Op->getOperand(2))); 1807 } 1808 case Intrinsic::mips_flog2_w: 1809 case Intrinsic::mips_flog2_d: 1810 return DAG.getNode(ISD::FLOG2, DL, Op->getValueType(0), Op->getOperand(1)); 1811 case Intrinsic::mips_fmadd_w: 1812 case Intrinsic::mips_fmadd_d: 1813 return DAG.getNode(ISD::FMA, SDLoc(Op), Op->getValueType(0), 1814 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3)); 1815 case Intrinsic::mips_fmul_w: 1816 case Intrinsic::mips_fmul_d: 1817 // TODO: If intrinsics have fast-math-flags, propagate them. 1818 return DAG.getNode(ISD::FMUL, DL, Op->getValueType(0), Op->getOperand(1), 1819 Op->getOperand(2)); 1820 case Intrinsic::mips_fmsub_w: 1821 case Intrinsic::mips_fmsub_d: { 1822 // TODO: If intrinsics have fast-math-flags, propagate them. 1823 EVT ResTy = Op->getValueType(0); 1824 return DAG.getNode(ISD::FSUB, SDLoc(Op), ResTy, Op->getOperand(1), 1825 DAG.getNode(ISD::FMUL, SDLoc(Op), ResTy, 1826 Op->getOperand(2), Op->getOperand(3))); 1827 } 1828 case Intrinsic::mips_frint_w: 1829 case Intrinsic::mips_frint_d: 1830 return DAG.getNode(ISD::FRINT, DL, Op->getValueType(0), Op->getOperand(1)); 1831 case Intrinsic::mips_fsqrt_w: 1832 case Intrinsic::mips_fsqrt_d: 1833 return DAG.getNode(ISD::FSQRT, DL, Op->getValueType(0), Op->getOperand(1)); 1834 case Intrinsic::mips_fsub_w: 1835 case Intrinsic::mips_fsub_d: 1836 // TODO: If intrinsics have fast-math-flags, propagate them. 1837 return DAG.getNode(ISD::FSUB, DL, Op->getValueType(0), Op->getOperand(1), 1838 Op->getOperand(2)); 1839 case Intrinsic::mips_ftrunc_u_w: 1840 case Intrinsic::mips_ftrunc_u_d: 1841 return DAG.getNode(ISD::FP_TO_UINT, DL, Op->getValueType(0), 1842 Op->getOperand(1)); 1843 case Intrinsic::mips_ftrunc_s_w: 1844 case Intrinsic::mips_ftrunc_s_d: 1845 return DAG.getNode(ISD::FP_TO_SINT, DL, Op->getValueType(0), 1846 Op->getOperand(1)); 1847 case Intrinsic::mips_ilvev_b: 1848 case Intrinsic::mips_ilvev_h: 1849 case Intrinsic::mips_ilvev_w: 1850 case Intrinsic::mips_ilvev_d: 1851 return DAG.getNode(MipsISD::ILVEV, DL, Op->getValueType(0), 1852 Op->getOperand(1), Op->getOperand(2)); 1853 case Intrinsic::mips_ilvl_b: 1854 case Intrinsic::mips_ilvl_h: 1855 case Intrinsic::mips_ilvl_w: 1856 case Intrinsic::mips_ilvl_d: 1857 return DAG.getNode(MipsISD::ILVL, DL, Op->getValueType(0), 1858 Op->getOperand(1), Op->getOperand(2)); 1859 case Intrinsic::mips_ilvod_b: 1860 case Intrinsic::mips_ilvod_h: 1861 case Intrinsic::mips_ilvod_w: 1862 case Intrinsic::mips_ilvod_d: 1863 return DAG.getNode(MipsISD::ILVOD, DL, Op->getValueType(0), 1864 Op->getOperand(1), Op->getOperand(2)); 1865 case Intrinsic::mips_ilvr_b: 1866 case Intrinsic::mips_ilvr_h: 1867 case Intrinsic::mips_ilvr_w: 1868 case Intrinsic::mips_ilvr_d: 1869 return DAG.getNode(MipsISD::ILVR, DL, Op->getValueType(0), 1870 Op->getOperand(1), Op->getOperand(2)); 1871 case Intrinsic::mips_insert_b: 1872 case Intrinsic::mips_insert_h: 1873 case Intrinsic::mips_insert_w: 1874 case Intrinsic::mips_insert_d: 1875 return DAG.getNode(ISD::INSERT_VECTOR_ELT, SDLoc(Op), Op->getValueType(0), 1876 Op->getOperand(1), Op->getOperand(3), Op->getOperand(2)); 1877 case Intrinsic::mips_insve_b: 1878 case Intrinsic::mips_insve_h: 1879 case Intrinsic::mips_insve_w: 1880 case Intrinsic::mips_insve_d: { 1881 // Report an error for out of range values. 1882 int64_t Max; 1883 switch (Intrinsic) { 1884 case Intrinsic::mips_insve_b: Max = 15; break; 1885 case Intrinsic::mips_insve_h: Max = 7; break; 1886 case Intrinsic::mips_insve_w: Max = 3; break; 1887 case Intrinsic::mips_insve_d: Max = 1; break; 1888 default: llvm_unreachable("Unmatched intrinsic"); 1889 } 1890 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 1891 if (Value < 0 || Value > Max) 1892 report_fatal_error("Immediate out of range"); 1893 return DAG.getNode(MipsISD::INSVE, DL, Op->getValueType(0), 1894 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3), 1895 DAG.getConstant(0, DL, MVT::i32)); 1896 } 1897 case Intrinsic::mips_ldi_b: 1898 case Intrinsic::mips_ldi_h: 1899 case Intrinsic::mips_ldi_w: 1900 case Intrinsic::mips_ldi_d: 1901 return lowerMSASplatImm(Op, 1, DAG, true); 1902 case Intrinsic::mips_lsa: 1903 case Intrinsic::mips_dlsa: { 1904 EVT ResTy = Op->getValueType(0); 1905 return DAG.getNode(ISD::ADD, SDLoc(Op), ResTy, Op->getOperand(1), 1906 DAG.getNode(ISD::SHL, SDLoc(Op), ResTy, 1907 Op->getOperand(2), Op->getOperand(3))); 1908 } 1909 case Intrinsic::mips_maddv_b: 1910 case Intrinsic::mips_maddv_h: 1911 case Intrinsic::mips_maddv_w: 1912 case Intrinsic::mips_maddv_d: { 1913 EVT ResTy = Op->getValueType(0); 1914 return DAG.getNode(ISD::ADD, SDLoc(Op), ResTy, Op->getOperand(1), 1915 DAG.getNode(ISD::MUL, SDLoc(Op), ResTy, 1916 Op->getOperand(2), Op->getOperand(3))); 1917 } 1918 case Intrinsic::mips_max_s_b: 1919 case Intrinsic::mips_max_s_h: 1920 case Intrinsic::mips_max_s_w: 1921 case Intrinsic::mips_max_s_d: 1922 return DAG.getNode(MipsISD::VSMAX, DL, Op->getValueType(0), 1923 Op->getOperand(1), Op->getOperand(2)); 1924 case Intrinsic::mips_max_u_b: 1925 case Intrinsic::mips_max_u_h: 1926 case Intrinsic::mips_max_u_w: 1927 case Intrinsic::mips_max_u_d: 1928 return DAG.getNode(MipsISD::VUMAX, DL, Op->getValueType(0), 1929 Op->getOperand(1), Op->getOperand(2)); 1930 case Intrinsic::mips_maxi_s_b: 1931 case Intrinsic::mips_maxi_s_h: 1932 case Intrinsic::mips_maxi_s_w: 1933 case Intrinsic::mips_maxi_s_d: 1934 return DAG.getNode(MipsISD::VSMAX, DL, Op->getValueType(0), 1935 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG, true)); 1936 case Intrinsic::mips_maxi_u_b: 1937 case Intrinsic::mips_maxi_u_h: 1938 case Intrinsic::mips_maxi_u_w: 1939 case Intrinsic::mips_maxi_u_d: 1940 return DAG.getNode(MipsISD::VUMAX, DL, Op->getValueType(0), 1941 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 1942 case Intrinsic::mips_min_s_b: 1943 case Intrinsic::mips_min_s_h: 1944 case Intrinsic::mips_min_s_w: 1945 case Intrinsic::mips_min_s_d: 1946 return DAG.getNode(MipsISD::VSMIN, DL, Op->getValueType(0), 1947 Op->getOperand(1), Op->getOperand(2)); 1948 case Intrinsic::mips_min_u_b: 1949 case Intrinsic::mips_min_u_h: 1950 case Intrinsic::mips_min_u_w: 1951 case Intrinsic::mips_min_u_d: 1952 return DAG.getNode(MipsISD::VUMIN, DL, Op->getValueType(0), 1953 Op->getOperand(1), Op->getOperand(2)); 1954 case Intrinsic::mips_mini_s_b: 1955 case Intrinsic::mips_mini_s_h: 1956 case Intrinsic::mips_mini_s_w: 1957 case Intrinsic::mips_mini_s_d: 1958 return DAG.getNode(MipsISD::VSMIN, DL, Op->getValueType(0), 1959 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG, true)); 1960 case Intrinsic::mips_mini_u_b: 1961 case Intrinsic::mips_mini_u_h: 1962 case Intrinsic::mips_mini_u_w: 1963 case Intrinsic::mips_mini_u_d: 1964 return DAG.getNode(MipsISD::VUMIN, DL, Op->getValueType(0), 1965 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 1966 case Intrinsic::mips_mod_s_b: 1967 case Intrinsic::mips_mod_s_h: 1968 case Intrinsic::mips_mod_s_w: 1969 case Intrinsic::mips_mod_s_d: 1970 return DAG.getNode(ISD::SREM, DL, Op->getValueType(0), Op->getOperand(1), 1971 Op->getOperand(2)); 1972 case Intrinsic::mips_mod_u_b: 1973 case Intrinsic::mips_mod_u_h: 1974 case Intrinsic::mips_mod_u_w: 1975 case Intrinsic::mips_mod_u_d: 1976 return DAG.getNode(ISD::UREM, DL, Op->getValueType(0), Op->getOperand(1), 1977 Op->getOperand(2)); 1978 case Intrinsic::mips_mulv_b: 1979 case Intrinsic::mips_mulv_h: 1980 case Intrinsic::mips_mulv_w: 1981 case Intrinsic::mips_mulv_d: 1982 return DAG.getNode(ISD::MUL, DL, Op->getValueType(0), Op->getOperand(1), 1983 Op->getOperand(2)); 1984 case Intrinsic::mips_msubv_b: 1985 case Intrinsic::mips_msubv_h: 1986 case Intrinsic::mips_msubv_w: 1987 case Intrinsic::mips_msubv_d: { 1988 EVT ResTy = Op->getValueType(0); 1989 return DAG.getNode(ISD::SUB, SDLoc(Op), ResTy, Op->getOperand(1), 1990 DAG.getNode(ISD::MUL, SDLoc(Op), ResTy, 1991 Op->getOperand(2), Op->getOperand(3))); 1992 } 1993 case Intrinsic::mips_nlzc_b: 1994 case Intrinsic::mips_nlzc_h: 1995 case Intrinsic::mips_nlzc_w: 1996 case Intrinsic::mips_nlzc_d: 1997 return DAG.getNode(ISD::CTLZ, DL, Op->getValueType(0), Op->getOperand(1)); 1998 case Intrinsic::mips_nor_v: { 1999 SDValue Res = DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2000 Op->getOperand(1), Op->getOperand(2)); 2001 return DAG.getNOT(DL, Res, Res->getValueType(0)); 2002 } 2003 case Intrinsic::mips_nori_b: { 2004 SDValue Res = DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2005 Op->getOperand(1), 2006 lowerMSASplatImm(Op, 2, DAG)); 2007 return DAG.getNOT(DL, Res, Res->getValueType(0)); 2008 } 2009 case Intrinsic::mips_or_v: 2010 return DAG.getNode(ISD::OR, DL, Op->getValueType(0), Op->getOperand(1), 2011 Op->getOperand(2)); 2012 case Intrinsic::mips_ori_b: 2013 return DAG.getNode(ISD::OR, DL, Op->getValueType(0), 2014 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2015 case Intrinsic::mips_pckev_b: 2016 case Intrinsic::mips_pckev_h: 2017 case Intrinsic::mips_pckev_w: 2018 case Intrinsic::mips_pckev_d: 2019 return DAG.getNode(MipsISD::PCKEV, DL, Op->getValueType(0), 2020 Op->getOperand(1), Op->getOperand(2)); 2021 case Intrinsic::mips_pckod_b: 2022 case Intrinsic::mips_pckod_h: 2023 case Intrinsic::mips_pckod_w: 2024 case Intrinsic::mips_pckod_d: 2025 return DAG.getNode(MipsISD::PCKOD, DL, Op->getValueType(0), 2026 Op->getOperand(1), Op->getOperand(2)); 2027 case Intrinsic::mips_pcnt_b: 2028 case Intrinsic::mips_pcnt_h: 2029 case Intrinsic::mips_pcnt_w: 2030 case Intrinsic::mips_pcnt_d: 2031 return DAG.getNode(ISD::CTPOP, DL, Op->getValueType(0), Op->getOperand(1)); 2032 case Intrinsic::mips_sat_s_b: 2033 case Intrinsic::mips_sat_s_h: 2034 case Intrinsic::mips_sat_s_w: 2035 case Intrinsic::mips_sat_s_d: 2036 case Intrinsic::mips_sat_u_b: 2037 case Intrinsic::mips_sat_u_h: 2038 case Intrinsic::mips_sat_u_w: 2039 case Intrinsic::mips_sat_u_d: { 2040 // Report an error for out of range values. 2041 int64_t Max; 2042 switch (Intrinsic) { 2043 case Intrinsic::mips_sat_s_b: 2044 case Intrinsic::mips_sat_u_b: Max = 7; break; 2045 case Intrinsic::mips_sat_s_h: 2046 case Intrinsic::mips_sat_u_h: Max = 15; break; 2047 case Intrinsic::mips_sat_s_w: 2048 case Intrinsic::mips_sat_u_w: Max = 31; break; 2049 case Intrinsic::mips_sat_s_d: 2050 case Intrinsic::mips_sat_u_d: Max = 63; break; 2051 default: llvm_unreachable("Unmatched intrinsic"); 2052 } 2053 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2054 if (Value < 0 || Value > Max) 2055 report_fatal_error("Immediate out of range"); 2056 return SDValue(); 2057 } 2058 case Intrinsic::mips_shf_b: 2059 case Intrinsic::mips_shf_h: 2060 case Intrinsic::mips_shf_w: { 2061 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2062 if (Value < 0 || Value > 255) 2063 report_fatal_error("Immediate out of range"); 2064 return DAG.getNode(MipsISD::SHF, DL, Op->getValueType(0), 2065 Op->getOperand(2), Op->getOperand(1)); 2066 } 2067 case Intrinsic::mips_sldi_b: 2068 case Intrinsic::mips_sldi_h: 2069 case Intrinsic::mips_sldi_w: 2070 case Intrinsic::mips_sldi_d: { 2071 // Report an error for out of range values. 2072 int64_t Max; 2073 switch (Intrinsic) { 2074 case Intrinsic::mips_sldi_b: Max = 15; break; 2075 case Intrinsic::mips_sldi_h: Max = 7; break; 2076 case Intrinsic::mips_sldi_w: Max = 3; break; 2077 case Intrinsic::mips_sldi_d: Max = 1; break; 2078 default: llvm_unreachable("Unmatched intrinsic"); 2079 } 2080 int64_t Value = cast<ConstantSDNode>(Op->getOperand(3))->getSExtValue(); 2081 if (Value < 0 || Value > Max) 2082 report_fatal_error("Immediate out of range"); 2083 return SDValue(); 2084 } 2085 case Intrinsic::mips_sll_b: 2086 case Intrinsic::mips_sll_h: 2087 case Intrinsic::mips_sll_w: 2088 case Intrinsic::mips_sll_d: 2089 return DAG.getNode(ISD::SHL, DL, Op->getValueType(0), Op->getOperand(1), 2090 truncateVecElts(Op, DAG)); 2091 case Intrinsic::mips_slli_b: 2092 case Intrinsic::mips_slli_h: 2093 case Intrinsic::mips_slli_w: 2094 case Intrinsic::mips_slli_d: 2095 return DAG.getNode(ISD::SHL, DL, Op->getValueType(0), 2096 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2097 case Intrinsic::mips_splat_b: 2098 case Intrinsic::mips_splat_h: 2099 case Intrinsic::mips_splat_w: 2100 case Intrinsic::mips_splat_d: 2101 // We can't lower via VECTOR_SHUFFLE because it requires constant shuffle 2102 // masks, nor can we lower via BUILD_VECTOR & EXTRACT_VECTOR_ELT because 2103 // EXTRACT_VECTOR_ELT can't extract i64's on MIPS32. 2104 // Instead we lower to MipsISD::VSHF and match from there. 2105 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2106 lowerMSASplatZExt(Op, 2, DAG), Op->getOperand(1), 2107 Op->getOperand(1)); 2108 case Intrinsic::mips_splati_b: 2109 case Intrinsic::mips_splati_h: 2110 case Intrinsic::mips_splati_w: 2111 case Intrinsic::mips_splati_d: 2112 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2113 lowerMSASplatImm(Op, 2, DAG), Op->getOperand(1), 2114 Op->getOperand(1)); 2115 case Intrinsic::mips_sra_b: 2116 case Intrinsic::mips_sra_h: 2117 case Intrinsic::mips_sra_w: 2118 case Intrinsic::mips_sra_d: 2119 return DAG.getNode(ISD::SRA, DL, Op->getValueType(0), Op->getOperand(1), 2120 truncateVecElts(Op, DAG)); 2121 case Intrinsic::mips_srai_b: 2122 case Intrinsic::mips_srai_h: 2123 case Intrinsic::mips_srai_w: 2124 case Intrinsic::mips_srai_d: 2125 return DAG.getNode(ISD::SRA, DL, Op->getValueType(0), 2126 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2127 case Intrinsic::mips_srari_b: 2128 case Intrinsic::mips_srari_h: 2129 case Intrinsic::mips_srari_w: 2130 case Intrinsic::mips_srari_d: { 2131 // Report an error for out of range values. 2132 int64_t Max; 2133 switch (Intrinsic) { 2134 case Intrinsic::mips_srari_b: Max = 7; break; 2135 case Intrinsic::mips_srari_h: Max = 15; break; 2136 case Intrinsic::mips_srari_w: Max = 31; break; 2137 case Intrinsic::mips_srari_d: Max = 63; break; 2138 default: llvm_unreachable("Unmatched intrinsic"); 2139 } 2140 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2141 if (Value < 0 || Value > Max) 2142 report_fatal_error("Immediate out of range"); 2143 return SDValue(); 2144 } 2145 case Intrinsic::mips_srl_b: 2146 case Intrinsic::mips_srl_h: 2147 case Intrinsic::mips_srl_w: 2148 case Intrinsic::mips_srl_d: 2149 return DAG.getNode(ISD::SRL, DL, Op->getValueType(0), Op->getOperand(1), 2150 truncateVecElts(Op, DAG)); 2151 case Intrinsic::mips_srli_b: 2152 case Intrinsic::mips_srli_h: 2153 case Intrinsic::mips_srli_w: 2154 case Intrinsic::mips_srli_d: 2155 return DAG.getNode(ISD::SRL, DL, Op->getValueType(0), 2156 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2157 case Intrinsic::mips_srlri_b: 2158 case Intrinsic::mips_srlri_h: 2159 case Intrinsic::mips_srlri_w: 2160 case Intrinsic::mips_srlri_d: { 2161 // Report an error for out of range values. 2162 int64_t Max; 2163 switch (Intrinsic) { 2164 case Intrinsic::mips_srlri_b: Max = 7; break; 2165 case Intrinsic::mips_srlri_h: Max = 15; break; 2166 case Intrinsic::mips_srlri_w: Max = 31; break; 2167 case Intrinsic::mips_srlri_d: Max = 63; break; 2168 default: llvm_unreachable("Unmatched intrinsic"); 2169 } 2170 int64_t Value = cast<ConstantSDNode>(Op->getOperand(2))->getSExtValue(); 2171 if (Value < 0 || Value > Max) 2172 report_fatal_error("Immediate out of range"); 2173 return SDValue(); 2174 } 2175 case Intrinsic::mips_subv_b: 2176 case Intrinsic::mips_subv_h: 2177 case Intrinsic::mips_subv_w: 2178 case Intrinsic::mips_subv_d: 2179 return DAG.getNode(ISD::SUB, DL, Op->getValueType(0), Op->getOperand(1), 2180 Op->getOperand(2)); 2181 case Intrinsic::mips_subvi_b: 2182 case Intrinsic::mips_subvi_h: 2183 case Intrinsic::mips_subvi_w: 2184 case Intrinsic::mips_subvi_d: 2185 return DAG.getNode(ISD::SUB, DL, Op->getValueType(0), 2186 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2187 case Intrinsic::mips_vshf_b: 2188 case Intrinsic::mips_vshf_h: 2189 case Intrinsic::mips_vshf_w: 2190 case Intrinsic::mips_vshf_d: 2191 return DAG.getNode(MipsISD::VSHF, DL, Op->getValueType(0), 2192 Op->getOperand(1), Op->getOperand(2), Op->getOperand(3)); 2193 case Intrinsic::mips_xor_v: 2194 return DAG.getNode(ISD::XOR, DL, Op->getValueType(0), Op->getOperand(1), 2195 Op->getOperand(2)); 2196 case Intrinsic::mips_xori_b: 2197 return DAG.getNode(ISD::XOR, DL, Op->getValueType(0), 2198 Op->getOperand(1), lowerMSASplatImm(Op, 2, DAG)); 2199 case Intrinsic::thread_pointer: { 2200 EVT PtrVT = getPointerTy(DAG.getDataLayout()); 2201 return DAG.getNode(MipsISD::ThreadPointer, DL, PtrVT); 2202 } 2203 } 2204 } 2205 2206 static SDValue lowerMSALoadIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, 2207 const MipsSubtarget &Subtarget) { 2208 SDLoc DL(Op); 2209 SDValue ChainIn = Op->getOperand(0); 2210 SDValue Address = Op->getOperand(2); 2211 SDValue Offset = Op->getOperand(3); 2212 EVT ResTy = Op->getValueType(0); 2213 EVT PtrTy = Address->getValueType(0); 2214 2215 // For N64 addresses have the underlying type MVT::i64. This intrinsic 2216 // however takes an i32 signed constant offset. The actual type of the 2217 // intrinsic is a scaled signed i10. 2218 if (Subtarget.isABI_N64()) 2219 Offset = DAG.getNode(ISD::SIGN_EXTEND, DL, PtrTy, Offset); 2220 2221 Address = DAG.getNode(ISD::ADD, DL, PtrTy, Address, Offset); 2222 return DAG.getLoad(ResTy, DL, ChainIn, Address, MachinePointerInfo(), 2223 /* Alignment = */ 16); 2224 } 2225 2226 SDValue MipsSETargetLowering::lowerINTRINSIC_W_CHAIN(SDValue Op, 2227 SelectionDAG &DAG) const { 2228 unsigned Intr = cast<ConstantSDNode>(Op->getOperand(1))->getZExtValue(); 2229 switch (Intr) { 2230 default: 2231 return SDValue(); 2232 case Intrinsic::mips_extp: 2233 return lowerDSPIntr(Op, DAG, MipsISD::EXTP); 2234 case Intrinsic::mips_extpdp: 2235 return lowerDSPIntr(Op, DAG, MipsISD::EXTPDP); 2236 case Intrinsic::mips_extr_w: 2237 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_W); 2238 case Intrinsic::mips_extr_r_w: 2239 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_R_W); 2240 case Intrinsic::mips_extr_rs_w: 2241 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_RS_W); 2242 case Intrinsic::mips_extr_s_h: 2243 return lowerDSPIntr(Op, DAG, MipsISD::EXTR_S_H); 2244 case Intrinsic::mips_mthlip: 2245 return lowerDSPIntr(Op, DAG, MipsISD::MTHLIP); 2246 case Intrinsic::mips_mulsaq_s_w_ph: 2247 return lowerDSPIntr(Op, DAG, MipsISD::MULSAQ_S_W_PH); 2248 case Intrinsic::mips_maq_s_w_phl: 2249 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_S_W_PHL); 2250 case Intrinsic::mips_maq_s_w_phr: 2251 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_S_W_PHR); 2252 case Intrinsic::mips_maq_sa_w_phl: 2253 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_SA_W_PHL); 2254 case Intrinsic::mips_maq_sa_w_phr: 2255 return lowerDSPIntr(Op, DAG, MipsISD::MAQ_SA_W_PHR); 2256 case Intrinsic::mips_dpaq_s_w_ph: 2257 return lowerDSPIntr(Op, DAG, MipsISD::DPAQ_S_W_PH); 2258 case Intrinsic::mips_dpsq_s_w_ph: 2259 return lowerDSPIntr(Op, DAG, MipsISD::DPSQ_S_W_PH); 2260 case Intrinsic::mips_dpaq_sa_l_w: 2261 return lowerDSPIntr(Op, DAG, MipsISD::DPAQ_SA_L_W); 2262 case Intrinsic::mips_dpsq_sa_l_w: 2263 return lowerDSPIntr(Op, DAG, MipsISD::DPSQ_SA_L_W); 2264 case Intrinsic::mips_dpaqx_s_w_ph: 2265 return lowerDSPIntr(Op, DAG, MipsISD::DPAQX_S_W_PH); 2266 case Intrinsic::mips_dpaqx_sa_w_ph: 2267 return lowerDSPIntr(Op, DAG, MipsISD::DPAQX_SA_W_PH); 2268 case Intrinsic::mips_dpsqx_s_w_ph: 2269 return lowerDSPIntr(Op, DAG, MipsISD::DPSQX_S_W_PH); 2270 case Intrinsic::mips_dpsqx_sa_w_ph: 2271 return lowerDSPIntr(Op, DAG, MipsISD::DPSQX_SA_W_PH); 2272 case Intrinsic::mips_ld_b: 2273 case Intrinsic::mips_ld_h: 2274 case Intrinsic::mips_ld_w: 2275 case Intrinsic::mips_ld_d: 2276 return lowerMSALoadIntr(Op, DAG, Intr, Subtarget); 2277 } 2278 } 2279 2280 static SDValue lowerMSAStoreIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, 2281 const MipsSubtarget &Subtarget) { 2282 SDLoc DL(Op); 2283 SDValue ChainIn = Op->getOperand(0); 2284 SDValue Value = Op->getOperand(2); 2285 SDValue Address = Op->getOperand(3); 2286 SDValue Offset = Op->getOperand(4); 2287 EVT PtrTy = Address->getValueType(0); 2288 2289 // For N64 addresses have the underlying type MVT::i64. This intrinsic 2290 // however takes an i32 signed constant offset. The actual type of the 2291 // intrinsic is a scaled signed i10. 2292 if (Subtarget.isABI_N64()) 2293 Offset = DAG.getNode(ISD::SIGN_EXTEND, DL, PtrTy, Offset); 2294 2295 Address = DAG.getNode(ISD::ADD, DL, PtrTy, Address, Offset); 2296 2297 return DAG.getStore(ChainIn, DL, Value, Address, MachinePointerInfo(), 2298 /* Alignment = */ 16); 2299 } 2300 2301 SDValue MipsSETargetLowering::lowerINTRINSIC_VOID(SDValue Op, 2302 SelectionDAG &DAG) const { 2303 unsigned Intr = cast<ConstantSDNode>(Op->getOperand(1))->getZExtValue(); 2304 switch (Intr) { 2305 default: 2306 return SDValue(); 2307 case Intrinsic::mips_st_b: 2308 case Intrinsic::mips_st_h: 2309 case Intrinsic::mips_st_w: 2310 case Intrinsic::mips_st_d: 2311 return lowerMSAStoreIntr(Op, DAG, Intr, Subtarget); 2312 } 2313 } 2314 2315 /// \brief Check if the given BuildVectorSDNode is a splat. 2316 /// This method currently relies on DAG nodes being reused when equivalent, 2317 /// so it's possible for this to return false even when isConstantSplat returns 2318 /// true. 2319 static bool isSplatVector(const BuildVectorSDNode *N) { 2320 unsigned int nOps = N->getNumOperands(); 2321 assert(nOps > 1 && "isSplatVector has 0 or 1 sized build vector"); 2322 2323 SDValue Operand0 = N->getOperand(0); 2324 2325 for (unsigned int i = 1; i < nOps; ++i) { 2326 if (N->getOperand(i) != Operand0) 2327 return false; 2328 } 2329 2330 return true; 2331 } 2332 2333 // Lower ISD::EXTRACT_VECTOR_ELT into MipsISD::VEXTRACT_SEXT_ELT. 2334 // 2335 // The non-value bits resulting from ISD::EXTRACT_VECTOR_ELT are undefined. We 2336 // choose to sign-extend but we could have equally chosen zero-extend. The 2337 // DAGCombiner will fold any sign/zero extension of the ISD::EXTRACT_VECTOR_ELT 2338 // result into this node later (possibly changing it to a zero-extend in the 2339 // process). 2340 SDValue MipsSETargetLowering:: 2341 lowerEXTRACT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG) const { 2342 SDLoc DL(Op); 2343 EVT ResTy = Op->getValueType(0); 2344 SDValue Op0 = Op->getOperand(0); 2345 EVT VecTy = Op0->getValueType(0); 2346 2347 if (!VecTy.is128BitVector()) 2348 return SDValue(); 2349 2350 if (ResTy.isInteger()) { 2351 SDValue Op1 = Op->getOperand(1); 2352 EVT EltTy = VecTy.getVectorElementType(); 2353 return DAG.getNode(MipsISD::VEXTRACT_SEXT_ELT, DL, ResTy, Op0, Op1, 2354 DAG.getValueType(EltTy)); 2355 } 2356 2357 return Op; 2358 } 2359 2360 static bool isConstantOrUndef(const SDValue Op) { 2361 if (Op->isUndef()) 2362 return true; 2363 if (isa<ConstantSDNode>(Op)) 2364 return true; 2365 if (isa<ConstantFPSDNode>(Op)) 2366 return true; 2367 return false; 2368 } 2369 2371 for (unsigned i = 0; i < Op->getNumOperands(); ++i) 2372 if (isConstantOrUndef(Op->getOperand(i))) 2373 return true; 2374 return false; 2375 } 2376 2377 // Lowers ISD::BUILD_VECTOR into appropriate SelectionDAG nodes for the 2378 // backend. 2379 // 2380 // Lowers according to the following rules: 2381 // - Constant splats are legal as-is as long as the SplatBitSize is a power of 2382 // 2 less than or equal to 64 and the value fits into a signed 10-bit 2383 // immediate 2384 // - Constant splats are lowered to bitconverted BUILD_VECTORs if SplatBitSize 2385 // is a power of 2 less than or equal to 64 and the value does not fit into a 2386 // signed 10-bit immediate 2387 // - Non-constant splats are legal as-is. 2388 // - Non-constant non-splats are lowered to sequences of INSERT_VECTOR_ELT. 2389 // - All others are illegal and must be expanded. 2390 SDValue MipsSETargetLowering::lowerBUILD_VECTOR(SDValue Op, 2391 SelectionDAG &DAG) const { 2392 BuildVectorSDNode *Node = cast<BuildVectorSDNode>(Op); 2393 EVT ResTy = Op->getValueType(0); 2394 SDLoc DL(Op); 2395 APInt SplatValue, SplatUndef; 2396 unsigned SplatBitSize; 2397 bool HasAnyUndefs; 2398 2399 if (!Subtarget.hasMSA() || !ResTy.is128BitVector()) 2400 return SDValue(); 2401 2402 if (Node->isConstantSplat(SplatValue, SplatUndef, SplatBitSize, 2403 HasAnyUndefs, 8, 2404 !Subtarget.isLittle()) && SplatBitSize <= 64) { 2405 // We can only cope with 8, 16, 32, or 64-bit elements 2406 if (SplatBitSize != 8 && SplatBitSize != 16 && SplatBitSize != 32 && 2407 SplatBitSize != 64) 2408 return SDValue(); 2409 2410 // If the value isn't an integer type we will have to bitcast 2411 // from an integer type first. Also, if there are any undefs, we must 2412 // lower them to defined values first. 2413 if (ResTy.isInteger() && !HasAnyUndefs) 2414 return Op; 2415 2416 EVT ViaVecTy; 2417 2418 switch (SplatBitSize) { 2419 default: 2420 return SDValue(); 2421 case 8: 2422 ViaVecTy = MVT::v16i8; 2423 break; 2424 case 16: 2425 ViaVecTy = MVT::v8i16; 2426 break; 2427 case 32: 2428 ViaVecTy = MVT::v4i32; 2429 break; 2430 case 64: 2431 // There's no fill.d to fall back on for 64-bit values 2432 return SDValue(); 2433 } 2434 2435 // SelectionDAG::getConstant will promote SplatValue appropriately. 2436 SDValue Result = DAG.getConstant(SplatValue, DL, ViaVecTy); 2437 2438 // Bitcast to the type we originally wanted 2439 if (ViaVecTy != ResTy) 2440 Result = DAG.getNode(ISD::BITCAST, SDLoc(Node), ResTy, Result); 2441 2442 return Result; 2443 } else if (isSplatVector(Node)) 2444 return Op; 2445 else if (!isConstantOrUndefBUILD_VECTOR(Node)) { 2446 // Use INSERT_VECTOR_ELT operations rather than expand to stores. 2447 // The resulting code is the same length as the expansion, but it doesn't 2448 // use memory operations 2449 EVT ResTy = Node->getValueType(0); 2450 2451 assert(ResTy.isVector()); 2452 2453 unsigned NumElts = ResTy.getVectorNumElements(); 2454 SDValue Vector = DAG.getUNDEF(ResTy); 2455 for (unsigned i = 0; i < NumElts; ++i) { 2456 Vector = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, ResTy, Vector, 2457 Node->getOperand(i), 2458 DAG.getConstant(i, DL, MVT::i32)); 2459 } 2460 return Vector; 2461 } 2462 2463 return SDValue(); 2464 } 2465 2466 // Lower VECTOR_SHUFFLE into SHF (if possible). 2467 // 2468 // SHF splits the vector into blocks of four elements, then shuffles these 2469 // elements according to a <4 x i2> constant (encoded as an integer immediate). 2470 // 2471 // It is therefore possible to lower into SHF when the mask takes the form: 2472 // <a, b, c, d, a+4, b+4, c+4, d+4, a+8, b+8, c+8, d+8, ...> 2473 // When undef's appear they are treated as if they were whatever value is 2474 // necessary in order to fit the above forms. 2475 // 2476 // For example: 2477 // %2 = shufflevector <8 x i16> %0, <8 x i16> undef, 2478 // <8 x i32> <i32 3, i32 2, i32 1, i32 0, 2479 // i32 7, i32 6, i32 5, i32 4> 2480 // is lowered to: 2481 // (SHF_H $w0, $w1, 27) 2482 // where the 27 comes from: 2483 // 3 + (2 << 2) + (1 << 4) + (0 << 6) 2485 SmallVector<int, 16> Indices, 2486 SelectionDAG &DAG) { 2487 int SHFIndices[4] = { -1, -1, -1, -1 }; 2488 2489 if (Indices.size() < 4) 2490 return SDValue(); 2491 2492 for (unsigned i = 0; i < 4; ++i) { 2493 for (unsigned j = i; j < Indices.size(); j += 4) { 2494 int Idx = Indices[j]; 2495 2496 // Convert from vector index to 4-element subvector index 2497 // If an index refers to an element outside of the subvector then give up 2498 if (Idx != -1) { 2499 Idx -= 4 * (j / 4); 2500 if (Idx < 0 || Idx >= 4) 2501 return SDValue(); 2502 } 2503 2504 // If the mask has an undef, replace it with the current index. 2505 // Note that it might still be undef if the current index is also undef 2506 if (SHFIndices[i] == -1) 2507 SHFIndices[i] = Idx; 2508 2509 // Check that non-undef values are the same as in the mask. If they 2510 // aren't then give up 2511 if (!(Idx == -1 || Idx == SHFIndices[i])) 2512 return SDValue(); 2513 } 2514 } 2515 2516 // Calculate the immediate. Replace any remaining undefs with zero 2517 APInt Imm(32, 0); 2518 for (int i = 3; i >= 0; --i) { 2519 int Idx = SHFIndices[i]; 2520 2521 if (Idx == -1) 2522 Idx = 0; 2523 2524 Imm <<= 2; 2525 Imm |= Idx & 0x3; 2526 } 2527 2528 SDLoc DL(Op); 2529 return DAG.getNode(MipsISD::SHF, DL, ResTy, 2530 DAG.getConstant(Imm, DL, MVT::i32), Op->getOperand(0)); 2531 } 2532 2533 /// Determine whether a range fits a regular pattern of values. 2534 /// This function accounts for the possibility of jumping over the End iterator. 2535 template <typename ValType> 2536 static bool 2538 unsigned CheckStride, 2540 ValType ExpectedIndex, unsigned ExpectedIndexStride) { 2541 auto &I = Begin; 2542 2543 while (I != End) { 2544 if (*I != -1 && *I != ExpectedIndex) 2545 return false; 2546 ExpectedIndex += ExpectedIndexStride; 2547 2548 // Incrementing past End is undefined behaviour so we must increment one 2549 // step at a time and check for End at each step. 2550 for (unsigned n = 0; n < CheckStride && I != End; ++n, ++I) 2551 ; // Empty loop body. 2552 } 2553 return true; 2554 } 2555 2556 // Determine whether VECTOR_SHUFFLE is a SPLATI. 2557 // 2558 // It is a SPLATI when the mask is: 2559 // <x, x, x, ...> 2560 // where x is any valid index. 2561 // 2562 // When undef's appear in the mask they are treated as if they were whatever 2563 // value is necessary in order to fit the above form. 2564 static bool isVECTOR_SHUFFLE_SPLATI(SDValue Op, EVT ResTy, 2565 SmallVector<int, 16> Indices, 2566 SelectionDAG &DAG) { 2567 assert((Indices.size() % 2) == 0); 2568 2569 int SplatIndex = -1; 2570 for (const auto &V : Indices) { 2571 if (V != -1) { 2572 SplatIndex = V; 2573 break; 2574 } 2575 } 2576 2577 return fitsRegularPattern<int>(Indices.begin(), 1, Indices.end(), SplatIndex, 2578 0); 2579 } 2580 2581 // Lower VECTOR_SHUFFLE into ILVEV (if possible). 2582 // 2583 // ILVEV interleaves the even elements from each vector. 2584 // 2585 // It is possible to lower into ILVEV when the mask consists of two of the 2586 // following forms interleaved: 2587 // <0, 2, 4, ...> 2588 // <n, n+2, n+4, ...> 2589 // where n is the number of elements in the vector. 2590 // For example: 2591 // <0, 0, 2, 2, 4, 4, ...> 2592 // <0, n, 2, n+2, 4, n+4, ...> 2593 // 2594 // When undef's appear in the mask they are treated as if they were whatever 2595 // value is necessary in order to fit the above forms. 2597 SmallVector<int, 16> Indices, 2598 SelectionDAG &DAG) { 2599 assert((Indices.size() % 2) == 0); 2600 2601 SDValue Wt; 2602 SDValue Ws; 2603 const auto &Begin = Indices.begin(); 2604 const auto &End = Indices.end(); 2605 2606 // Check even elements are taken from the even elements of one half or the 2607 // other and pick an operand accordingly. 2608 if (fitsRegularPattern<int>(Begin, 2, End, 0, 2)) 2609 Wt = Op->getOperand(0); 2610 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 2)) 2611 Wt = Op->getOperand(1); 2612 else 2613 return SDValue(); 2614 2615 // Check odd elements are taken from the even elements of one half or the 2616 // other and pick an operand accordingly. 2617 if (fitsRegularPattern<int>(Begin + 1, 2, End, 0, 2)) 2618 Ws = Op->getOperand(0); 2619 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 2)) 2620 Ws = Op->getOperand(1); 2621 else 2622 return SDValue(); 2623 2624 return DAG.getNode(MipsISD::ILVEV, SDLoc(Op), ResTy, Ws, Wt); 2625 } 2626 2627 // Lower VECTOR_SHUFFLE into ILVOD (if possible). 2628 // 2629 // ILVOD interleaves the odd elements from each vector. 2630 // 2631 // It is possible to lower into ILVOD when the mask consists of two of the 2632 // following forms interleaved: 2633 // <1, 3, 5, ...> 2634 // <n+1, n+3, n+5, ...> 2635 // where n is the number of elements in the vector. 2636 // For example: 2637 // <1, 1, 3, 3, 5, 5, ...> 2638 // <1, n+1, 3, n+3, 5, n+5, ...> 2639 // 2640 // When undef's appear in the mask they are treated as if they were whatever 2641 // value is necessary in order to fit the above forms. 2643 SmallVector<int, 16> Indices, 2644 SelectionDAG &DAG) { 2645 assert((Indices.size() % 2) == 0); 2646 2647 SDValue Wt; 2648 SDValue Ws; 2649 const auto &Begin = Indices.begin(); 2650 const auto &End = Indices.end(); 2651 2652 // Check even elements are taken from the odd elements of one half or the 2653 // other and pick an operand accordingly. 2654 if (fitsRegularPattern<int>(Begin, 2, End, 1, 2)) 2655 Wt = Op->getOperand(0); 2656 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + 1, 2)) 2657 Wt = Op->getOperand(1); 2658 else 2659 return SDValue(); 2660 2661 // Check odd elements are taken from the odd elements of one half or the 2662 // other and pick an operand accordingly. 2663 if (fitsRegularPattern<int>(Begin + 1, 2, End, 1, 2)) 2664 Ws = Op->getOperand(0); 2665 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + 1, 2)) 2666 Ws = Op->getOperand(1); 2667 else 2668 return SDValue(); 2669 2670 return DAG.getNode(MipsISD::ILVOD, SDLoc(Op), ResTy, Wt, Ws); 2671 } 2672 2673 // Lower VECTOR_SHUFFLE into ILVR (if possible). 2674 // 2675 // ILVR interleaves consecutive elements from the right (lowest-indexed) half of 2676 // each vector. 2677 // 2678 // It is possible to lower into ILVR when the mask consists of two of the 2679 // following forms interleaved: 2680 // <0, 1, 2, ...> 2681 // <n, n+1, n+2, ...> 2682 // where n is the number of elements in the vector. 2683 // For example: 2684 // <0, 0, 1, 1, 2, 2, ...> 2685 // <0, n, 1, n+1, 2, n+2, ...> 2686 // 2687 // When undef's appear in the mask they are treated as if they were whatever 2688 // value is necessary in order to fit the above forms. 2690 SmallVector<int, 16> Indices, 2691 SelectionDAG &DAG) { 2692 assert((Indices.size() % 2) == 0); 2693 2694 SDValue Wt; 2695 SDValue Ws; 2696 const auto &Begin = Indices.begin(); 2697 const auto &End = Indices.end(); 2698 2699 // Check even elements are taken from the right (lowest-indexed) elements of 2700 // one half or the other and pick an operand accordingly. 2701 if (fitsRegularPattern<int>(Begin, 2, End, 0, 1)) 2702 Wt = Op->getOperand(0); 2703 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 1)) 2704 Wt = Op->getOperand(1); 2705 else 2706 return SDValue(); 2707 2708 // Check odd elements are taken from the right (lowest-indexed) elements of 2709 // one half or the other and pick an operand accordingly. 2710 if (fitsRegularPattern<int>(Begin + 1, 2, End, 0, 1)) 2711 Ws = Op->getOperand(0); 2712 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 1)) 2713 Ws = Op->getOperand(1); 2714 else 2715 return SDValue(); 2716 2717 return DAG.getNode(MipsISD::ILVR, SDLoc(Op), ResTy, Ws, Wt); 2718 } 2719 2720 // Lower VECTOR_SHUFFLE into ILVL (if possible). 2721 // 2722 // ILVL interleaves consecutive elements from the left (highest-indexed) half 2723 // of each vector. 2724 // 2725 // It is possible to lower into ILVL when the mask consists of two of the 2726 // following forms interleaved: 2727 // <x, x+1, x+2, ...> 2728 // <n+x, n+x+1, n+x+2, ...> 2729 // where n is the number of elements in the vector and x is half n. 2730 // For example: 2731 // <x, x, x+1, x+1, x+2, x+2, ...> 2732 // <x, n+x, x+1, n+x+1, x+2, n+x+2, ...> 2733 // 2734 // When undef's appear in the mask they are treated as if they were whatever 2735 // value is necessary in order to fit the above forms. 2737 SmallVector<int, 16> Indices, 2738 SelectionDAG &DAG) { 2739 assert((Indices.size() % 2) == 0); 2740 2741 unsigned HalfSize = Indices.size() / 2; 2742 SDValue Wt; 2743 SDValue Ws; 2744 const auto &Begin = Indices.begin(); 2745 const auto &End = Indices.end(); 2746 2747 // Check even elements are taken from the left (highest-indexed) elements of 2748 // one half or the other and pick an operand accordingly. 2749 if (fitsRegularPattern<int>(Begin, 2, End, HalfSize, 1)) 2750 Wt = Op->getOperand(0); 2751 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + HalfSize, 1)) 2752 Wt = Op->getOperand(1); 2753 else 2754 return SDValue(); 2755 2756 // Check odd elements are taken from the left (highest-indexed) elements of 2757 // one half or the other and pick an operand accordingly. 2758 if (fitsRegularPattern<int>(Begin + 1, 2, End, HalfSize, 1)) 2759 Ws = Op->getOperand(0); 2760 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + HalfSize, 2761 1)) 2762 Ws = Op->getOperand(1); 2763 else 2764 return SDValue(); 2765 2766 return DAG.getNode(MipsISD::ILVL, SDLoc(Op), ResTy, Ws, Wt); 2767 } 2768 2769 // Lower VECTOR_SHUFFLE into PCKEV (if possible). 2770 // 2771 // PCKEV copies the even elements of each vector into the result vector. 2772 // 2773 // It is possible to lower into PCKEV when the mask consists of two of the 2774 // following forms concatenated: 2775 // <0, 2, 4, ...> 2776 // <n, n+2, n+4, ...> 2777 // where n is the number of elements in the vector. 2778 // For example: 2779 // <0, 2, 4, ..., 0, 2, 4, ...> 2780 // <0, 2, 4, ..., n, n+2, n+4, ...> 2781 // 2782 // When undef's appear in the mask they are treated as if they were whatever 2783 // value is necessary in order to fit the above forms. 2785 SmallVector<int, 16> Indices, 2786 SelectionDAG &DAG) { 2787 assert((Indices.size() % 2) == 0); 2788 2789 SDValue Wt; 2790 SDValue Ws; 2791 const auto &Begin = Indices.begin(); 2792 const auto &Mid = Indices.begin() + Indices.size() / 2; 2793 const auto &End = Indices.end(); 2794 2795 if (fitsRegularPattern<int>(Begin, 1, Mid, 0, 2)) 2796 Wt = Op->getOperand(0); 2797 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size(), 2)) 2798 Wt = Op->getOperand(1); 2799 else 2800 return SDValue(); 2801 2802 if (fitsRegularPattern<int>(Mid, 1, End, 0, 2)) 2803 Ws = Op->getOperand(0); 2804 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size(), 2)) 2805 Ws = Op->getOperand(1); 2806 else 2807 return SDValue(); 2808 2809 return DAG.getNode(MipsISD::PCKEV, SDLoc(Op), ResTy, Ws, Wt); 2810 } 2811 2812 // Lower VECTOR_SHUFFLE into PCKOD (if possible). 2813 // 2814 // PCKOD copies the odd elements of each vector into the result vector. 2815 // 2816 // It is possible to lower into PCKOD when the mask consists of two of the 2817 // following forms concatenated: 2818 // <1, 3, 5, ...> 2819 // <n+1, n+3, n+5, ...> 2820 // where n is the number of elements in the vector. 2821 // For example: 2822 // <1, 3, 5, ..., 1, 3, 5, ...> 2823 // <1, 3, 5, ..., n+1, n+3, n+5, ...> 2824 // 2825 // When undef's appear in the mask they are treated as if they were whatever 2826 // value is necessary in order to fit the above forms. 2828 SmallVector<int, 16> Indices, 2829 SelectionDAG &DAG) { 2830 assert((Indices.size() % 2) == 0); 2831 2832 SDValue Wt; 2833 SDValue Ws; 2834 const auto &Begin = Indices.begin(); 2835 const auto &Mid = Indices.begin() + Indices.size() / 2; 2836 const auto &End = Indices.end(); 2837 2838 if (fitsRegularPattern<int>(Begin, 1, Mid, 1, 2)) 2839 Wt = Op->getOperand(0); 2840 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size() + 1, 2)) 2841 Wt = Op->getOperand(1); 2842 else 2843 return SDValue(); 2844 2845 if (fitsRegularPattern<int>(Mid, 1, End, 1, 2)) 2846 Ws = Op->getOperand(0); 2847 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size() + 1, 2)) 2848 Ws = Op->getOperand(1); 2849 else 2850 return SDValue(); 2851 2852 return DAG.getNode(MipsISD::PCKOD, SDLoc(Op), ResTy, Ws, Wt); 2853 } 2854 2855 // Lower VECTOR_SHUFFLE into VSHF. 2856 // 2857 // This mostly consists of converting the shuffle indices in Indices into a 2858 // BUILD_VECTOR and adding it as an operand to the resulting VSHF. There is 2859 // also code to eliminate unused operands of the VECTOR_SHUFFLE. For example, 2860 // if the type is v8i16 and all the indices are less than 8 then the second 2861 // operand is unused and can be replaced with anything. We choose to replace it 2862 // with the used operand since this reduces the number of instructions overall. 2864 SmallVector<int, 16> Indices, 2865 SelectionDAG &DAG) { 2867 SDValue Op0; 2868 SDValue Op1; 2869 EVT MaskVecTy = ResTy.changeVectorElementTypeToInteger(); 2870 EVT MaskEltTy = MaskVecTy.getVectorElementType(); 2871 bool Using1stVec = false; 2872 bool Using2ndVec = false; 2873 SDLoc DL(Op); 2874 int ResTyNumElts = ResTy.getVectorNumElements(); 2875 2876 for (int i = 0; i < ResTyNumElts; ++i) { 2877 // Idx == -1 means UNDEF 2878 int Idx = Indices[i]; 2879 2880 if (0 <= Idx && Idx < ResTyNumElts) 2881 Using1stVec = true; 2882 if (ResTyNumElts <= Idx && Idx < ResTyNumElts * 2) 2883 Using2ndVec = true; 2884 } 2885 2886 for (SmallVector<int, 16>::iterator I = Indices.begin(); I != Indices.end(); 2887 ++I) 2888 Ops.push_back(DAG.getTargetConstant(*I, DL, MaskEltTy)); 2889 2890 SDValue MaskVec = DAG.getBuildVector(MaskVecTy, DL, Ops); 2891 2892 if (Using1stVec && Using2ndVec) { 2893 Op0 = Op->getOperand(0); 2894 Op1 = Op->getOperand(1); 2895 } else if (Using1stVec) 2896 Op0 = Op1 = Op->getOperand(0); 2897 else if (Using2ndVec) 2898 Op0 = Op1 = Op->getOperand(1); 2899 else 2900 llvm_unreachable("shuffle vector mask references neither vector operand?"); 2901 2902 // VECTOR_SHUFFLE concatenates the vectors in an vectorwise fashion. 2903 // <0b00, 0b01> + <0b10, 0b11> -> <0b00, 0b01, 0b10, 0b11> 2904 // VSHF concatenates the vectors in a bitwise fashion: 2905 // <0b00, 0b01> + <0b10, 0b11> -> 2906 // 0b0100 + 0b1110 -> 0b01001110 2907 // <0b10, 0b11, 0b00, 0b01> 2908 // We must therefore swap the operands to get the correct result. 2909 return DAG.getNode(MipsISD::VSHF, DL, ResTy, MaskVec, Op1, Op0); 2910 } 2911 2912 // Lower VECTOR_SHUFFLE into one of a number of instructions depending on the 2913 // indices in the shuffle. 2914 SDValue MipsSETargetLowering::lowerVECTOR_SHUFFLE(SDValue Op, 2915 SelectionDAG &DAG) const { 2916 ShuffleVectorSDNode *Node = cast<ShuffleVectorSDNode>(Op); 2917 EVT ResTy = Op->getValueType(0); 2918 2919 if (!ResTy.is128BitVector()) 2920 return SDValue(); 2921 2922 int ResTyNumElts = ResTy.getVectorNumElements(); 2923 SmallVector<int, 16> Indices; 2924 2925 for (int i = 0; i < ResTyNumElts; ++i) 2926 Indices.push_back(Node->getMaskElt(i)); 2927 2928 // splati.[bhwd] is preferable to the others but is matched from 2929 // MipsISD::VSHF. 2930 if (isVECTOR_SHUFFLE_SPLATI(Op, ResTy, Indices, DAG)) 2931 return lowerVECTOR_SHUFFLE_VSHF(Op, ResTy, Indices, DAG); 2932 SDValue Result; 2933 if ((Result = lowerVECTOR_SHUFFLE_ILVEV(Op, ResTy, Indices, DAG))) 2934 return Result; 2935 if ((Result = lowerVECTOR_SHUFFLE_ILVOD(Op, ResTy, Indices, DAG))) 2936 return Result; 2937 if ((Result = lowerVECTOR_SHUFFLE_ILVL(Op, ResTy, Indices, DAG))) 2938 return Result; 2939 if ((Result = lowerVECTOR_SHUFFLE_ILVR(Op, ResTy, Indices, DAG))) 2940 return Result; 2941 if ((Result = lowerVECTOR_SHUFFLE_PCKEV(Op, ResTy, Indices, DAG))) 2942 return Result; 2943 if ((Result = lowerVECTOR_SHUFFLE_PCKOD(Op, ResTy, Indices, DAG))) 2944 return Result; 2945 if ((Result = lowerVECTOR_SHUFFLE_SHF(Op, ResTy, Indices, DAG))) 2946 return Result; 2947 return lowerVECTOR_SHUFFLE_VSHF(Op, ResTy, Indices, DAG); 2948 } 2949 2951 MipsSETargetLowering::emitBPOSGE32(MachineInstr &MI, 2952 MachineBasicBlock *BB) const { 2953 // $bb: 2954 // bposge32_pseudo $vr0 2955 // => 2956 // $bb: 2957 // bposge32 $tbb 2958 // $fbb: 2959 // li $vr2, 0 2960 // b $sink 2961 // $tbb: 2962 // li $vr1, 1 2963 // $sink: 2964 // $vr0 = phi($vr2, $fbb, $vr1, $tbb) 2965 2966 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 2968 const TargetRegisterClass *RC = &Mips::GPR32RegClass; 2969 DebugLoc DL = MI.getDebugLoc(); 2970 const BasicBlock *LLVM_BB = BB->getBasicBlock(); 2972 MachineFunction *F = BB->getParent(); 2973 MachineBasicBlock *FBB = F->CreateMachineBasicBlock(LLVM_BB); 2974 MachineBasicBlock *TBB = F->CreateMachineBasicBlock(LLVM_BB); 2976 F->insert(It, FBB); 2977 F->insert(It, TBB); 2978 F->insert(It, Sink); 2979 2980 // Transfer the remainder of BB and its successor edges to Sink. 2981 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)), 2982 BB->end()); 2984 2985 // Add successors. 2986 BB->addSuccessor(FBB); 2987 BB->addSuccessor(TBB); 2988 FBB->addSuccessor(Sink); 2989 TBB->addSuccessor(Sink); 2990 2991 // Insert the real bposge32 instruction to $BB. 2992 BuildMI(BB, DL, TII->get(Mips::BPOSGE32)).addMBB(TBB); 2993 // Insert the real bposge32c instruction to $BB. 2994 BuildMI(BB, DL, TII->get(Mips::BPOSGE32C_MMR3)).addMBB(TBB); 2995 2996 // Fill $FBB. 2997 unsigned VR2 = RegInfo.createVirtualRegister(RC); 2998 BuildMI(*FBB, FBB->end(), DL, TII->get(Mips::ADDiu), VR2) 2999 .addReg(Mips::ZERO).addImm(0); 3000 BuildMI(*FBB, FBB->end(), DL, TII->get(Mips::B)).addMBB(Sink); 3001 3002 // Fill $TBB. 3003 unsigned VR1 = RegInfo.createVirtualRegister(RC); 3004 BuildMI(*TBB, TBB->end(), DL, TII->get(Mips::ADDiu), VR1) 3005 .addReg(Mips::ZERO).addImm(1); 3006 3007 // Insert phi function to $Sink. 3008 BuildMI(*Sink, Sink->begin(), DL, TII->get(Mips::PHI), 3009 MI.getOperand(0).getReg()) 3010 .addReg(VR2) 3011 .addMBB(FBB) 3012 .addReg(VR1) 3013 .addMBB(TBB); 3014 3015 MI.eraseFromParent(); // The pseudo instruction is gone now. 3016 return Sink; 3017 } 3018 3019 MachineBasicBlock *MipsSETargetLowering::emitMSACBranchPseudo( 3020 MachineInstr &MI, MachineBasicBlock *BB, unsigned BranchOp) const { 3021 // $bb: 3022 // vany_nonzero $rd, $ws 3023 // => 3024 // $bb: 3025 // bnz.b $ws, $tbb 3026 // b $fbb 3027 // $fbb: 3028 // li $rd1, 0 3029 // b $sink 3030 // $tbb: 3031 // li $rd2, 1 3032 // $sink: 3033 // $rd = phi($rd1, $fbb, $rd2, $tbb) 3034 3035 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3037 const TargetRegisterClass *RC = &Mips::GPR32RegClass; 3038 DebugLoc DL = MI.getDebugLoc(); 3039 const BasicBlock *LLVM_BB = BB->getBasicBlock(); 3041 MachineFunction *F = BB->getParent(); 3042 MachineBasicBlock *FBB = F->CreateMachineBasicBlock(LLVM_BB); 3043 MachineBasicBlock *TBB = F->CreateMachineBasicBlock(LLVM_BB); 3045 F->insert(It, FBB); 3046 F->insert(It, TBB); 3047 F->insert(It, Sink); 3048 3049 // Transfer the remainder of BB and its successor edges to Sink. 3050 Sink->splice(Sink->begin(), BB, std::next(MachineBasicBlock::iterator(MI)), 3051 BB->end()); 3053 3054 // Add successors. 3055 BB->addSuccessor(FBB); 3056 BB->addSuccessor(TBB); 3057 FBB->addSuccessor(Sink); 3058 TBB->addSuccessor(Sink); 3059 3060 // Insert the real bnz.b instruction to $BB. 3061 BuildMI(BB, DL, TII->get(BranchOp)) 3062 .addReg(MI.getOperand(1).getReg()) 3063 .addMBB(TBB); 3064 3065 // Fill $FBB. 3066 unsigned RD1 = RegInfo.createVirtualRegister(RC); 3067 BuildMI(*FBB, FBB->end(), DL, TII->get(Mips::ADDiu), RD1) 3068 .addReg(Mips::ZERO).addImm(0); 3069 BuildMI(*FBB, FBB->end(), DL, TII->get(Mips::B)).addMBB(Sink); 3070 3071 // Fill $TBB. 3072 unsigned RD2 = RegInfo.createVirtualRegister(RC); 3073 BuildMI(*TBB, TBB->end(), DL, TII->get(Mips::ADDiu), RD2) 3074 .addReg(Mips::ZERO).addImm(1); 3075 3076 // Insert phi function to $Sink. 3077 BuildMI(*Sink, Sink->begin(), DL, TII->get(Mips::PHI), 3078 MI.getOperand(0).getReg()) 3079 .addReg(RD1) 3080 .addMBB(FBB) 3081 .addReg(RD2) 3082 .addMBB(TBB); 3083 3084 MI.eraseFromParent(); // The pseudo instruction is gone now. 3085 return Sink; 3086 } 3087 3088 // Emit the COPY_FW pseudo instruction. 3089 // 3090 // copy_fw_pseudo $fd, $ws, n 3091 // => 3092 // copy_u_w $rt, $ws, $n 3093 // mtc1 $rt, $fd 3094 // 3095 // When n is zero, the equivalent operation can be performed with (potentially) 3096 // zero instructions due to register overlaps. This optimization is never valid 3097 // for lane 1 because it would require FR=0 mode which isn't supported by MSA. 3099 MipsSETargetLowering::emitCOPY_FW(MachineInstr &MI, 3100 MachineBasicBlock *BB) const { 3102 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3103 DebugLoc DL = MI.getDebugLoc(); 3104 unsigned Fd = MI.getOperand(0).getReg(); 3105 unsigned Ws = MI.getOperand(1).getReg(); 3106 unsigned Lane = MI.getOperand(2).getImm(); 3107 3108 if (Lane == 0) { 3109 unsigned Wt = Ws; 3110 if (!Subtarget.useOddSPReg()) { 3111 // We must copy to an even-numbered MSA register so that the 3112 // single-precision sub-register is also guaranteed to be even-numbered. 3113 Wt = RegInfo.createVirtualRegister(&Mips::MSA128WEvensRegClass); 3114 3115 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Wt).addReg(Ws); 3116 } 3117 3118 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_lo); 3119 } else { 3120 unsigned Wt = RegInfo.createVirtualRegister( 3121 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass : 3122 &Mips::MSA128WEvensRegClass); 3123 3124 BuildMI(*BB, MI, DL, TII->get(Mips::SPLATI_W), Wt).addReg(Ws).addImm(Lane); 3125 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_lo); 3126 } 3127 3128 MI.eraseFromParent(); // The pseudo instruction is gone now. 3129 return BB; 3130 } 3131 3132 // Emit the COPY_FD pseudo instruction. 3133 // 3134 // copy_fd_pseudo $fd, $ws, n 3135 // => 3136 // splati.d $wt, $ws, $n 3137 // copy $fd, $wt:sub_64 3138 // 3139 // When n is zero, the equivalent operation can be performed with (potentially) 3140 // zero instructions due to register overlaps. This optimization is always 3141 // valid because FR=1 mode which is the only supported mode in MSA. 3143 MipsSETargetLowering::emitCOPY_FD(MachineInstr &MI, 3144 MachineBasicBlock *BB) const { 3146 3148 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3149 unsigned Fd = MI.getOperand(0).getReg(); 3150 unsigned Ws = MI.getOperand(1).getReg(); 3151 unsigned Lane = MI.getOperand(2).getImm() * 2; 3152 DebugLoc DL = MI.getDebugLoc(); 3153 3154 if (Lane == 0) 3155 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Ws, 0, Mips::sub_64); 3156 else { 3157 unsigned Wt = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3158 3159 BuildMI(*BB, MI, DL, TII->get(Mips::SPLATI_D), Wt).addReg(Ws).addImm(1); 3160 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Fd).addReg(Wt, 0, Mips::sub_64); 3161 } 3162 3163 MI.eraseFromParent(); // The pseudo instruction is gone now. 3164 return BB; 3165 } 3166 3167 // Emit the INSERT_FW pseudo instruction. 3168 // 3169 // insert_fw_pseudo $wd, $wd_in, $n, $fs 3170 // => 3171 // subreg_to_reg $wt:sub_lo, $fs 3172 // insve_w $wd[$n], $wd_in, $wt[0] 3174 MipsSETargetLowering::emitINSERT_FW(MachineInstr &MI, 3175 MachineBasicBlock *BB) const { 3177 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3178 DebugLoc DL = MI.getDebugLoc(); 3179 unsigned Wd = MI.getOperand(0).getReg(); 3180 unsigned Wd_in = MI.getOperand(1).getReg(); 3181 unsigned Lane = MI.getOperand(2).getImm(); 3182 unsigned Fs = MI.getOperand(3).getReg(); 3183 unsigned Wt = RegInfo.createVirtualRegister( 3184 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass : 3185 &Mips::MSA128WEvensRegClass); 3186 3187 BuildMI(*BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3188 .addImm(0) 3189 .addReg(Fs) 3190 .addImm(Mips::sub_lo); 3191 BuildMI(*BB, MI, DL, TII->get(Mips::INSVE_W), Wd) 3192 .addReg(Wd_in) 3193 .addImm(Lane) 3194 .addReg(Wt) 3195 .addImm(0); 3196 3197 MI.eraseFromParent(); // The pseudo instruction is gone now. 3198 return BB; 3199 } 3200 3201 // Emit the INSERT_FD pseudo instruction. 3202 // 3203 // insert_fd_pseudo $wd, $fs, n 3204 // => 3205 // subreg_to_reg $wt:sub_64, $fs 3206 // insve_d $wd[$n], $wd_in, $wt[0] 3208 MipsSETargetLowering::emitINSERT_FD(MachineInstr &MI, 3209 MachineBasicBlock *BB) const { 3211 3213 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3214 DebugLoc DL = MI.getDebugLoc(); 3215 unsigned Wd = MI.getOperand(0).getReg(); 3216 unsigned Wd_in = MI.getOperand(1).getReg(); 3217 unsigned Lane = MI.getOperand(2).getImm(); 3218 unsigned Fs = MI.getOperand(3).getReg(); 3219 unsigned Wt = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3220 3221 BuildMI(*BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3222 .addImm(0) 3223 .addReg(Fs) 3224 .addImm(Mips::sub_64); 3225 BuildMI(*BB, MI, DL, TII->get(Mips::INSVE_D), Wd) 3226 .addReg(Wd_in) 3227 .addImm(Lane) 3228 .addReg(Wt) 3229 .addImm(0); 3230 3231 MI.eraseFromParent(); // The pseudo instruction is gone now. 3232 return BB; 3233 } 3234 3235 // Emit the INSERT_([BHWD]|F[WD])_VIDX pseudo instruction. 3236 // 3237 // For integer: 3238 // (INSERT_([BHWD]|F[WD])_PSEUDO $wd, $wd_in, $n, $rs) 3239 // => 3240 // (SLL $lanetmp1, $lane, <log2size) 3241 // (SLD_B $wdtmp1, $wd_in, $wd_in, $lanetmp1) 3242 // (INSERT_[BHWD], $wdtmp2, $wdtmp1, 0, $rs) 3243 // (NEG $lanetmp2, $lanetmp1) 3244 // (SLD_B $wd, $wdtmp2, $wdtmp2, $lanetmp2) 3245 // 3246 // For floating point: 3247 // (INSERT_([BHWD]|F[WD])_PSEUDO $wd, $wd_in, $n, $fs) 3248 // => 3249 // (SUBREG_TO_REG $wt, $fs, <subreg>) 3250 // (SLL $lanetmp1, $lane, <log2size) 3251 // (SLD_B $wdtmp1, $wd_in, $wd_in, $lanetmp1) 3252 // (INSVE_[WD], $wdtmp2, 0, $wdtmp1, 0) 3253 // (NEG $lanetmp2, $lanetmp1) 3254 // (SLD_B $wd, $wdtmp2, $wdtmp2, $lanetmp2) 3255 MachineBasicBlock *MipsSETargetLowering::emitINSERT_DF_VIDX( 3256 MachineInstr &MI, MachineBasicBlock *BB, unsigned EltSizeInBytes, 3257 bool IsFP) const { 3259 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3260 DebugLoc DL = MI.getDebugLoc(); 3261 unsigned Wd = MI.getOperand(0).getReg(); 3262 unsigned SrcVecReg = MI.getOperand(1).getReg(); 3263 unsigned LaneReg = MI.getOperand(2).getReg(); 3264 unsigned SrcValReg = MI.getOperand(3).getReg(); 3265 3266 const TargetRegisterClass *VecRC = nullptr; 3267 // FIXME: This should be true for N32 too. 3268 const TargetRegisterClass *GPRRC = 3269 Subtarget.isABI_N64() ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3270 unsigned SubRegIdx = Subtarget.isABI_N64() ? Mips::sub_32 : 0; 3271 unsigned ShiftOp = Subtarget.isABI_N64() ? Mips::DSLL : Mips::SLL; 3272 unsigned EltLog2Size; 3273 unsigned InsertOp = 0; 3274 unsigned InsveOp = 0; 3275 switch (EltSizeInBytes) { 3276 default: 3277 llvm_unreachable("Unexpected size"); 3278 case 1: 3279 EltLog2Size = 0; 3280 InsertOp = Mips::INSERT_B; 3281 InsveOp = Mips::INSVE_B; 3282 VecRC = &Mips::MSA128BRegClass; 3283 break; 3284 case 2: 3285 EltLog2Size = 1; 3286 InsertOp = Mips::INSERT_H; 3287 InsveOp = Mips::INSVE_H; 3288 VecRC = &Mips::MSA128HRegClass; 3289 break; 3290 case 4: 3291 EltLog2Size = 2; 3292 InsertOp = Mips::INSERT_W; 3293 InsveOp = Mips::INSVE_W; 3294 VecRC = &Mips::MSA128WRegClass; 3295 break; 3296 case 8: 3297 EltLog2Size = 3; 3298 InsertOp = Mips::INSERT_D; 3299 InsveOp = Mips::INSVE_D; 3300 VecRC = &Mips::MSA128DRegClass; 3301 break; 3302 } 3303 3304 if (IsFP) { 3305 unsigned Wt = RegInfo.createVirtualRegister(VecRC); 3306 BuildMI(*BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Wt) 3307 .addImm(0) 3308 .addReg(SrcValReg) 3309 .addImm(EltSizeInBytes == 8 ? Mips::sub_64 : Mips::sub_lo); 3310 SrcValReg = Wt; 3311 } 3312 3313 // Convert the lane index into a byte index 3314 if (EltSizeInBytes != 1) { 3315 unsigned LaneTmp1 = RegInfo.createVirtualRegister(GPRRC); 3316 BuildMI(*BB, MI, DL, TII->get(ShiftOp), LaneTmp1) 3317 .addReg(LaneReg) 3318 .addImm(EltLog2Size); 3319 LaneReg = LaneTmp1; 3320 } 3321 3322 // Rotate bytes around so that the desired lane is element zero 3323 unsigned WdTmp1 = RegInfo.createVirtualRegister(VecRC); 3324 BuildMI(*BB, MI, DL, TII->get(Mips::SLD_B), WdTmp1) 3325 .addReg(SrcVecReg) 3326 .addReg(SrcVecReg) 3327 .addReg(LaneReg, 0, SubRegIdx); 3328 3329 unsigned WdTmp2 = RegInfo.createVirtualRegister(VecRC); 3330 if (IsFP) { 3331 // Use insve.df to insert to element zero 3332 BuildMI(*BB, MI, DL, TII->get(InsveOp), WdTmp2) 3333 .addReg(WdTmp1) 3334 .addImm(0) 3335 .addReg(SrcValReg) 3336 .addImm(0); 3337 } else { 3338 // Use insert.df to insert to element zero 3339 BuildMI(*BB, MI, DL, TII->get(InsertOp), WdTmp2) 3340 .addReg(WdTmp1) 3341 .addReg(SrcValReg) 3342 .addImm(0); 3343 } 3344 3345 // Rotate elements the rest of the way for a full rotation. 3346 // sld.df inteprets $rt modulo the number of columns so we only need to negate 3347 // the lane index to do this. 3348 unsigned LaneTmp2 = RegInfo.createVirtualRegister(GPRRC); 3349 BuildMI(*BB, MI, DL, TII->get(Subtarget.isABI_N64() ? Mips::DSUB : Mips::SUB), 3350 LaneTmp2) 3351 .addReg(Subtarget.isABI_N64() ? Mips::ZERO_64 : Mips::ZERO) 3352 .addReg(LaneReg); 3353 BuildMI(*BB, MI, DL, TII->get(Mips::SLD_B), Wd) 3354 .addReg(WdTmp2) 3355 .addReg(WdTmp2) 3356 .addReg(LaneTmp2, 0, SubRegIdx); 3357 3358 MI.eraseFromParent(); // The pseudo instruction is gone now. 3359 return BB; 3360 } 3361 3362 // Emit the FILL_FW pseudo instruction. 3363 // 3364 // fill_fw_pseudo $wd, $fs 3365 // => 3366 // implicit_def $wt1 3367 // insert_subreg $wt2:subreg_lo, $wt1, $fs 3368 // splati.w $wd, $wt2[0] 3370 MipsSETargetLowering::emitFILL_FW(MachineInstr &MI, 3371 MachineBasicBlock *BB) const { 3373 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3374 DebugLoc DL = MI.getDebugLoc(); 3375 unsigned Wd = MI.getOperand(0).getReg(); 3376 unsigned Fs = MI.getOperand(1).getReg(); 3377 unsigned Wt1 = RegInfo.createVirtualRegister( 3378 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass 3379 : &Mips::MSA128WEvensRegClass); 3380 unsigned Wt2 = RegInfo.createVirtualRegister( 3381 Subtarget.useOddSPReg() ? &Mips::MSA128WRegClass 3382 : &Mips::MSA128WEvensRegClass); 3383 3384 BuildMI(*BB, MI, DL, TII->get(Mips::IMPLICIT_DEF), Wt1); 3385 BuildMI(*BB, MI, DL, TII->get(Mips::INSERT_SUBREG), Wt2) 3386 .addReg(Wt1) 3387 .addReg(Fs) 3388 .addImm(Mips::sub_lo); 3389 BuildMI(*BB, MI, DL, TII->get(Mips::SPLATI_W), Wd).addReg(Wt2).addImm(0); 3390 3391 MI.eraseFromParent(); // The pseudo instruction is gone now. 3392 return BB; 3393 } 3394 3395 // Emit the FILL_FD pseudo instruction. 3396 // 3397 // fill_fd_pseudo $wd, $fs 3398 // => 3399 // implicit_def $wt1 3400 // insert_subreg $wt2:subreg_64, $wt1, $fs 3401 // splati.d $wd, $wt2[0] 3403 MipsSETargetLowering::emitFILL_FD(MachineInstr &MI, 3404 MachineBasicBlock *BB) const { 3406 3408 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3409 DebugLoc DL = MI.getDebugLoc(); 3410 unsigned Wd = MI.getOperand(0).getReg(); 3411 unsigned Fs = MI.getOperand(1).getReg(); 3412 unsigned Wt1 = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3413 unsigned Wt2 = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3414 3415 BuildMI(*BB, MI, DL, TII->get(Mips::IMPLICIT_DEF), Wt1); 3416 BuildMI(*BB, MI, DL, TII->get(Mips::INSERT_SUBREG), Wt2) 3417 .addReg(Wt1) 3418 .addReg(Fs) 3419 .addImm(Mips::sub_64); 3420 BuildMI(*BB, MI, DL, TII->get(Mips::SPLATI_D), Wd).addReg(Wt2).addImm(0); 3421 3422 MI.eraseFromParent(); // The pseudo instruction is gone now. 3423 return BB; 3424 } 3425 3426 // Emit the ST_F16_PSEDUO instruction to store a f16 value from an MSA 3427 // register. 3428 // 3429 // STF16 MSA128F16:$wd, mem_simm10:$addr 3430 // => 3431 // copy_u.h $rtemp,$wd[0] 3432 // sh $rtemp, $addr 3433 // 3434 // Safety: We can't use st.h & co as they would over write the memory after 3435 // the destination. It would require half floats be allocated 16 bytes(!) of 3436 // space. 3438 MipsSETargetLowering::emitST_F16_PSEUDO(MachineInstr &MI, 3439 MachineBasicBlock *BB) const { 3440 3442 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3443 DebugLoc DL = MI.getDebugLoc(); 3444 unsigned Ws = MI.getOperand(0).getReg(); 3445 unsigned Rt = MI.getOperand(1).getReg(); 3446 const MachineMemOperand &MMO = **MI.memoperands_begin(); 3447 unsigned Imm = MMO.getOffset(); 3448 3449 // Caution: A load via the GOT can expand to a GPR32 operand, a load via 3450 // spill and reload can expand as a GPR64 operand. Examine the 3451 // operand in detail and default to ABI. 3452 const TargetRegisterClass *RC = 3453 MI.getOperand(1).isReg() ? RegInfo.getRegClass(MI.getOperand(1).getReg()) 3454 : (Subtarget.isABI_O32() ? &Mips::GPR32RegClass 3455 : &Mips::GPR64RegClass); 3456 const bool UsingMips32 = RC == &Mips::GPR32RegClass; 3457 unsigned Rs = RegInfo.createVirtualRegister(&Mips::GPR32RegClass); 3458 3459 BuildMI(*BB, MI, DL, TII->get(Mips::COPY_U_H), Rs).addReg(Ws).addImm(0); 3460 if(!UsingMips32) { 3461 unsigned Tmp = RegInfo.createVirtualRegister(&Mips::GPR64RegClass); 3462 BuildMI(*BB, MI, DL, TII->get(Mips::SUBREG_TO_REG), Tmp) 3463 .addImm(0) 3464 .addReg(Rs) 3465 .addImm(Mips::sub_32); 3466 Rs = Tmp; 3467 } 3468 BuildMI(*BB, MI, DL, TII->get(UsingMips32 ? Mips::SH : Mips::SH64)) 3469 .addReg(Rs) 3470 .addReg(Rt) 3471 .addImm(Imm) 3473 &MMO, MMO.getOffset(), MMO.getSize())); 3474 3475 MI.eraseFromParent(); 3476 return BB; 3477 } 3478 3479 // Emit the LD_F16_PSEDUO instruction to load a f16 value into an MSA register. 3480 // 3481 // LD_F16 MSA128F16:$wd, mem_simm10:$addr 3482 // => 3483 // lh $rtemp, $addr 3484 // fill.h $wd, $rtemp 3485 // 3486 // Safety: We can't use ld.h & co as they over-read from the source. 3487 // Additionally, if the address is not modulo 16, 2 cases can occur: 3488 // a) Segmentation fault as the load instruction reads from a memory page 3489 // memory it's not supposed to. 3490 // b) The load crosses an implementation specific boundary, requiring OS 3491 // intervention. 3493 MipsSETargetLowering::emitLD_F16_PSEUDO(MachineInstr &MI, 3494 MachineBasicBlock *BB) const { 3495 3497 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3498 DebugLoc DL = MI.getDebugLoc(); 3499 unsigned Wd = MI.getOperand(0).getReg(); 3500 3501 // Caution: A load via the GOT can expand to a GPR32 operand, a load via 3502 // spill and reload can expand as a GPR64 operand. Examine the 3503 // operand in detail and default to ABI. 3504 const TargetRegisterClass *RC = 3505 MI.getOperand(1).isReg() ? RegInfo.getRegClass(MI.getOperand(1).getReg()) 3506 : (Subtarget.isABI_O32() ? &Mips::GPR32RegClass 3507 : &Mips::GPR64RegClass); 3508 3509 const bool UsingMips32 = RC == &Mips::GPR32RegClass; 3510 unsigned Rt = RegInfo.createVirtualRegister(RC); 3511 3512 MachineInstrBuilder MIB = 3513 BuildMI(*BB, MI, DL, TII->get(UsingMips32 ? Mips::LH : Mips::LH64), Rt); 3514 for (unsigned i = 1; i < MI.getNumOperands(); i++) 3515 MIB.add(MI.getOperand(i)); 3516 3517 if(!UsingMips32) { 3518 unsigned Tmp = RegInfo.createVirtualRegister(&Mips::GPR32RegClass); 3519 BuildMI(*BB, MI, DL, TII->get(Mips::COPY), Tmp).addReg(Rt, 0, Mips::sub_32); 3520 Rt = Tmp; 3521 } 3522 3523 BuildMI(*BB, MI, DL, TII->get(Mips::FILL_H), Wd).addReg(Rt); 3524 3525 MI.eraseFromParent(); 3526 return BB; 3527 } 3528 3529 // Emit the FPROUND_PSEUDO instruction. 3530 // 3531 // Round an FGR64Opnd, FGR32Opnd to an f16. 3532 // 3533 // Safety: Cycle the operand through the GPRs so the result always ends up 3534 // the correct MSA register. 3535 // 3536 // FIXME: This copying is strictly unnecessary. If we could tie FGR32Opnd:$Fs 3537 // / FGR64Opnd:$Fs and MSA128F16:$Wd to the same physical register 3538 // (which they can be, as the MSA registers are defined to alias the 3539 // FPU's 64 bit and 32 bit registers) the result can be accessed using 3540 // the correct register class. That requires operands be tie-able across 3541 // register classes which have a sub/super register class relationship. 3542 // 3543 // For FPG32Opnd: 3544 // 3545 // FPROUND MSA128F16:$wd, FGR32Opnd:$fs 3546 // => 3547 // mfc1 $rtemp, $fs 3548 // fill.w $rtemp, $wtemp 3549 // fexdo.w $wd, $wtemp, $wtemp 3550 // 3551 // For FPG64Opnd on mips32r2+: 3552 // 3553 // FPROUND MSA128F16:$wd, FGR64Opnd:$fs 3554 // => 3555 // mfc1 $rtemp, $fs 3556 // fill.w $rtemp, $wtemp 3557 // mfhc1 $rtemp2, $fs 3558 // insert.w $wtemp[1], $rtemp2 3559 // insert.w $wtemp[3], $rtemp2 3560 // fexdo.w $wtemp2, $wtemp, $wtemp 3561 // fexdo.h $wd, $temp2, $temp2 3562 // 3563 // For FGR64Opnd on mips64r2+: 3564 // 3565 // FPROUND MSA128F16:$wd, FGR64Opnd:$fs 3566 // => 3567 // dmfc1 $rtemp, $fs 3568 // fill.d $rtemp, $wtemp 3569 // fexdo.w $wtemp2, $wtemp, $wtemp 3570 // fexdo.h $wd, $wtemp2, $wtemp2 3571 // 3572 // Safety note: As $wtemp is UNDEF, we may provoke a spurious exception if the 3573 // undef bits are "just right" and the exception enable bits are 3574 // set. By using fill.w to replicate $fs into all elements over 3575 // insert.w for one element, we avoid that potiential case. If 3576 // fexdo.[hw] causes an exception in, the exception is valid and it 3577 // occurs for all elements. 3579 MipsSETargetLowering::emitFPROUND_PSEUDO(MachineInstr &MI, 3580 MachineBasicBlock *BB, 3581 bool IsFGR64) const { 3582 3583 // Strictly speaking, we need MIPS32R5 to support MSA. We'll be generous 3584 // here. It's technically doable to support MIPS32 here, but the ISA forbids 3585 // it. 3587 3588 bool IsFGR64onMips64 = Subtarget.hasMips64() && IsFGR64; 3589 bool IsFGR64onMips32 = !Subtarget.hasMips64() && IsFGR64; 3590 3592 DebugLoc DL = MI.getDebugLoc(); 3593 unsigned Wd = MI.getOperand(0).getReg(); 3594 unsigned Fs = MI.getOperand(1).getReg(); 3595 3596 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3597 unsigned Wtemp = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3598 const TargetRegisterClass *GPRRC = 3599 IsFGR64onMips64 ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3600 unsigned MFC1Opc = IsFGR64onMips64 3601 ? Mips::DMFC1 3602 : (IsFGR64onMips32 ? Mips::MFC1_D64 : Mips::MFC1); 3603 unsigned FILLOpc = IsFGR64onMips64 ? Mips::FILL_D : Mips::FILL_W; 3604 3605 // Perform the register class copy as mentioned above. 3606 unsigned Rtemp = RegInfo.createVirtualRegister(GPRRC); 3607 BuildMI(*BB, MI, DL, TII->get(MFC1Opc), Rtemp).addReg(Fs); 3608 BuildMI(*BB, MI, DL, TII->get(FILLOpc), Wtemp).addReg(Rtemp); 3609 unsigned WPHI = Wtemp; 3610 3611 if (IsFGR64onMips32) { 3612 unsigned Rtemp2 = RegInfo.createVirtualRegister(GPRRC); 3613 BuildMI(*BB, MI, DL, TII->get(Mips::MFHC1_D64), Rtemp2).addReg(Fs); 3614 unsigned Wtemp2 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3615 unsigned Wtemp3 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3616 BuildMI(*BB, MI, DL, TII->get(Mips::INSERT_W), Wtemp2) 3617 .addReg(Wtemp) 3618 .addReg(Rtemp2) 3619 .addImm(1); 3620 BuildMI(*BB, MI, DL, TII->get(Mips::INSERT_W), Wtemp3) 3621 .addReg(Wtemp2) 3622 .addReg(Rtemp2) 3623 .addImm(3); 3624 WPHI = Wtemp3; 3625 } 3626 3627 if (IsFGR64) { 3628 unsigned Wtemp2 = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3629 BuildMI(*BB, MI, DL, TII->get(Mips::FEXDO_W), Wtemp2) 3630 .addReg(WPHI) 3631 .addReg(WPHI); 3632 WPHI = Wtemp2; 3633 } 3634 3635 BuildMI(*BB, MI, DL, TII->get(Mips::FEXDO_H), Wd).addReg(WPHI).addReg(WPHI); 3636 3637 MI.eraseFromParent(); 3638 return BB; 3639 } 3640 3641 // Emit the FPEXTEND_PSEUDO instruction. 3642 // 3643 // Expand an f16 to either a FGR32Opnd or FGR64Opnd. 3644 // 3645 // Safety: Cycle the result through the GPRs so the result always ends up 3646 // the correct floating point register. 3647 // 3648 // FIXME: This copying is strictly unnecessary. If we could tie FGR32Opnd:$Fd 3649 // / FGR64Opnd:$Fd and MSA128F16:$Ws to the same physical register 3650 // (which they can be, as the MSA registers are defined to alias the 3651 // FPU's 64 bit and 32 bit registers) the result can be accessed using 3652 // the correct register class. That requires operands be tie-able across 3653 // register classes which have a sub/super register class relationship. I 3654 // haven't checked. 3655 // 3656 // For FGR32Opnd: 3657 // 3658 // FPEXTEND FGR32Opnd:$fd, MSA128F16:$ws 3659 // => 3660 // fexupr.w $wtemp, $ws 3661 // copy_s.w $rtemp, $ws[0] 3662 // mtc1 $rtemp, $fd 3663 // 3664 // For FGR64Opnd on Mips64: 3665 // 3666 // FPEXTEND FGR64Opnd:$fd, MSA128F16:$ws 3667 // => 3668 // fexupr.w $wtemp, $ws 3669 // fexupr.d $wtemp2, $wtemp 3670 // copy_s.d $rtemp, $wtemp2s[0] 3671 // dmtc1 $rtemp, $fd 3672 // 3673 // For FGR64Opnd on Mips32: 3674 // 3675 // FPEXTEND FGR64Opnd:$fd, MSA128F16:$ws 3676 // => 3677 // fexupr.w $wtemp, $ws 3678 // fexupr.d $wtemp2, $wtemp 3679 // copy_s.w $rtemp, $wtemp2[0] 3680 // mtc1 $rtemp, $ftemp 3681 // copy_s.w $rtemp2, $wtemp2[1] 3682 // $fd = mthc1 $rtemp2, $ftemp 3684 MipsSETargetLowering::emitFPEXTEND_PSEUDO(MachineInstr &MI, 3685 MachineBasicBlock *BB, 3686 bool IsFGR64) const { 3687 3688 // Strictly speaking, we need MIPS32R5 to support MSA. We'll be generous 3689 // here. It's technically doable to support MIPS32 here, but the ISA forbids 3690 // it. 3692 3693 bool IsFGR64onMips64 = Subtarget.hasMips64() && IsFGR64; 3694 bool IsFGR64onMips32 = !Subtarget.hasMips64() && IsFGR64; 3695 3697 DebugLoc DL = MI.getDebugLoc(); 3698 unsigned Fd = MI.getOperand(0).getReg(); 3699 unsigned Ws = MI.getOperand(1).getReg(); 3700 3701 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3702 const TargetRegisterClass *GPRRC = 3703 IsFGR64onMips64 ? &Mips::GPR64RegClass : &Mips::GPR32RegClass; 3704 unsigned MTC1Opc = IsFGR64onMips64 3705 ? Mips::DMTC1 3706 : (IsFGR64onMips32 ? Mips::MTC1_D64 : Mips::MTC1); 3707 unsigned COPYOpc = IsFGR64onMips64 ? Mips::COPY_S_D : Mips::COPY_S_W; 3708 3709 unsigned Wtemp = RegInfo.createVirtualRegister(&Mips::MSA128WRegClass); 3710 unsigned WPHI = Wtemp; 3711 3712 BuildMI(*BB, MI, DL, TII->get(Mips::FEXUPR_W), Wtemp).addReg(Ws); 3713 if (IsFGR64) { 3714 WPHI = RegInfo.createVirtualRegister(&Mips::MSA128DRegClass); 3715 BuildMI(*BB, MI, DL, TII->get(Mips::FEXUPR_D), WPHI).addReg(Wtemp); 3716 } 3717 3718 // Perform the safety regclass copy mentioned above. 3719 unsigned Rtemp = RegInfo.createVirtualRegister(GPRRC); 3720 unsigned FPRPHI = IsFGR64onMips32 3721 ? RegInfo.createVirtualRegister(&Mips::FGR64RegClass) 3722 : Fd; 3723 BuildMI(*BB, MI, DL, TII->get(COPYOpc), Rtemp).addReg(WPHI).addImm(0); 3724 BuildMI(*BB, MI, DL, TII->get(MTC1Opc), FPRPHI).addReg(Rtemp); 3725 3726 if (IsFGR64onMips32) { 3727 unsigned Rtemp2 = RegInfo.createVirtualRegister(GPRRC); 3728 BuildMI(*BB, MI, DL, TII->get(Mips::COPY_S_W), Rtemp2) 3729 .addReg(WPHI) 3730 .addImm(1); 3731 BuildMI(*BB, MI, DL, TII->get(Mips::MTHC1_D64), Fd) 3732 .addReg(FPRPHI) 3733 .addReg(Rtemp2); 3734 } 3735 3736 MI.eraseFromParent(); 3737 return BB; 3738 } 3739 3740 // Emit the FEXP2_W_1 pseudo instructions. 3741 // 3742 // fexp2_w_1_pseudo $wd, $wt 3743 // => 3744 // ldi.w $ws, 1 3745 // fexp2.w $wd, $ws, $wt 3747 MipsSETargetLowering::emitFEXP2_W_1(MachineInstr &MI, 3748 MachineBasicBlock *BB) const { 3750 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3751 const TargetRegisterClass *RC = &Mips::MSA128WRegClass; 3752 unsigned Ws1 = RegInfo.createVirtualRegister(RC); 3753 unsigned Ws2 = RegInfo.createVirtualRegister(RC); 3754 DebugLoc DL = MI.getDebugLoc(); 3755 3756 // Splat 1.0 into a vector 3757 BuildMI(*BB, MI, DL, TII->get(Mips::LDI_W), Ws1).addImm(1); 3758 BuildMI(*BB, MI, DL, TII->get(Mips::FFINT_U_W), Ws2).addReg(Ws1); 3759 3760 // Emit 1.0 * fexp2(Wt) 3761 BuildMI(*BB, MI, DL, TII->get(Mips::FEXP2_W), MI.getOperand(0).getReg()) 3762 .addReg(Ws2) 3763 .addReg(MI.getOperand(1).getReg()); 3764 3765 MI.eraseFromParent(); // The pseudo instruction is gone now. 3766 return BB; 3767 } 3768 3769 // Emit the FEXP2_D_1 pseudo instructions. 3770 // 3771 // fexp2_d_1_pseudo $wd, $wt 3772 // => 3773 // ldi.d $ws, 1 3774 // fexp2.d $wd, $ws, $wt 3776 MipsSETargetLowering::emitFEXP2_D_1(MachineInstr &MI, 3777 MachineBasicBlock *BB) const { 3779 MachineRegisterInfo &RegInfo = BB->getParent()->getRegInfo(); 3780 const TargetRegisterClass *RC = &Mips::MSA128DRegClass; 3781 unsigned Ws1 = RegInfo.createVirtualRegister(RC); 3782 unsigned Ws2 = RegInfo.createVirtualRegister(RC); 3783 DebugLoc DL = MI.getDebugLoc(); 3784 3785 // Splat 1.0 into a vector 3786 BuildMI(*BB, MI, DL, TII->get(Mips::LDI_D), Ws1).addImm(1); 3787 BuildMI(*BB, MI, DL, TII->get(Mips::FFINT_U_D), Ws2).addReg(Ws1); 3788 3789 // Emit 1.0 * fexp2(Wt) 3790 BuildMI(*BB, MI, DL, TII->get(Mips::FEXP2_D), MI.getOperand(0).getReg()) 3791 .addReg(Ws2) 3792 .addReg(MI.getOperand(1).getReg()); 3793 3794 MI.eraseFromParent(); // The pseudo instruction is gone now. 3795 return BB; 3796 } SDValue getStore(SDValue Chain, const SDLoc &dl, SDValue Val, SDValue Ptr, MachinePointerInfo PtrInfo, unsigned Alignment=0, MachineMemOperand::Flags MMOFlags=MachineMemOperand::MONone, const AAMDNodes &AAInfo=AAMDNodes()) Helper function to build ISD::STORE nodes. const MipsTargetLowering * createMipsSETargetLowering(const MipsTargetMachine &TM, const MipsSubtarget &STI) Fast - This calling convention attempts to make calls as fast as possible (e.g. Definition: CallingConv.h:43 uint64_t CallInst * C BITCAST - This operator converts between integer, vector and FP values, as if the value was stored to... Definition: ISDOpcodes.h:545 static SDValue genConstMult(SDValue X, APInt C, const SDLoc &DL, EVT VT, EVT ShiftTy, SelectionDAG &DAG) const MachineInstrBuilder & add(const MachineOperand &MO) const BUILTIN_OP_END - This must be the last enum value in this list. Definition: ISDOpcodes.h:834 FMINNUM/FMAXNUM - Perform floating-point minimum or maximum on two values. Definition: ISDOpcodes.h:569 EVT getValueType() const Return the ValueType of the referenced return value. static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector") void setLoadExtAction(unsigned ExtType, MVT ValVT, MVT MemVT, LegalizeAction Action) Indicate that the specified load with extension does not work with the specified type and indicate wh... EXTRACT_ELEMENT - This is used to get the lower or upper (determined by a Constant, which is required to be operand #1) half of the integer or float value specified as operand #0. Definition: ISDOpcodes.h:184 uint64_t getZExtValue() const Get zero extended value. Definition: APInt.h:1542 unsigned getOpcode() const Return the SelectionDAG opcode value for this node. SDValue getSetCC(const SDLoc &DL, EVT VT, SDValue LHS, SDValue RHS, ISD::CondCode Cond) Helper function to make it easier to build SetCC's if you just have an ISD::CondCode instead of an SD... Definition: SelectionDAG.h:898 typename SuperClass::const_iterator const_iterator Definition: SmallVector.h:329 const TargetRegisterClass * getRegClass(unsigned Reg) const Return the register class of the specified virtual register. const MipsSubtarget & Subtarget bool isConstantSplat(APInt &SplatValue, APInt &SplatUndef, unsigned &SplatBitSize, bool &HasAnyUndefs, unsigned MinSplatBits=0, bool isBigEndian=false) const Check if this is a constant splat, and if so, find the smallest element size that splats the vector... LLVM_ATTRIBUTE_NORETURN void report_fatal_error(Error Err, bool gen_crash_diag=true) Report a serious error, calling any installed error handler. Definition: Error.cpp:115 BR_CC - Conditional branch. Definition: ISDOpcodes.h:617 Compute iterated dominance frontiers using a linear time algorithm. Definition: AllocatorList.h:24 value_iterator value_end() const static SDValue initAccumulator(SDValue In, const SDLoc &DL, SelectionDAG &DAG) bool allowsMisalignedMemoryAccesses(EVT VT, unsigned AS=0, unsigned Align=1, bool *Fast=nullptr) const override Determine if the target supports unaligned memory accesses. static SDValue performVSELECTCombine(SDNode *N, SelectionDAG &DAG) VECTOR_SHUFFLE(VEC1, VEC2) - Returns a vector, of the same type as VEC1/VEC2. Definition: ISDOpcodes.h:342 EVT getScalarType() const If this is a vector type, return the element type, otherwise return this. Definition: ValueTypes.h:260 virtual const TargetRegisterClass * getRepRegClassFor(MVT VT) const Return the 'representative' register class for the specified value type. LLVM_ATTRIBUTE_ALWAYS_INLINE size_type size() const Definition: SmallVector.h:136 MachineBasicBlock * EmitInstrWithCustomInserter(MachineInstr &MI, MachineBasicBlock *MBB) const override This method should be implemented by targets that mark instructions with the 'usesCustomInserter' fla... unsigned createVirtualRegister(const TargetRegisterClass *RegClass) createVirtualRegister - Create and return a new virtual register in the function with the specified r... const SDValue & getBasePtr() const EVT getValueType(unsigned ResNo) const Return the type of a specified result. const DebugLoc & getDebugLoc() const Returns the debug location id of this MachineInstr. Definition: MachineInstr.h:268 static SDValue performANDCombine(SDNode *N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) unsigned getReg() const getReg - Returns the register number. const SDValue & getValue() const void transferSuccessorsAndUpdatePHIs(MachineBasicBlock *FromMBB) Transfers all the successors, as in transferSuccessors, and update PHI operands in the successor bloc... SDVTList getVTList() const static APInt getLowBitsSet(unsigned numBits, unsigned loBitsSet) Get a value with low bits set. Definition: APInt.h:641 MVT getSimpleVT() const Return the SimpleValueType held in the specified simple EVT. Definition: ValueTypes.h:253 const MipsInstrInfo * getInstrInfo() const override AAMDNodes getAAInfo() const Returns the AA info that describes the dereference. const SDValue & getChain() const uint64_t getSize() const Return the size in bytes of the memory reference. bool isABI_O32() const unsigned getAlignment() const APInt trunc(unsigned width) const Truncate to new width. Definition: APInt.cpp:818 A debug info location. Definition: DebugLoc.h:34 bool isInteger() const Return true if this is an integer or a vector integer type. Definition: ValueTypes.h:141 F(f) MachineBasicBlock * EmitInstrWithCustomInserter(MachineInstr &MI, MachineBasicBlock *MBB) const override This method should be implemented by targets that mark instructions with the 'usesCustomInserter' fla... SDNode * getNode() const get the SDNode which holds the desired result SDValue getNode(unsigned Opcode, const SDLoc &DL, EVT VT, ArrayRef< SDUse > Ops) Gets or creates the specified node. SDValue PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const override This method will be invoked for all target nodes and for any target-independent nodes that the target... MachineMemOperand * getMemOperand() const Return a MachineMemOperand object describing the memory reference performed by operation. OUTCHAIN = ATOMIC_FENCE(INCHAIN, ordering, scope) This corresponds to the fence instruction. Definition: ISDOpcodes.h:748 Select with condition operator - This selects between a true value and a false value (ops #2 and #3) ... Definition: ISDOpcodes.h:404 unsigned getBitWidth() const Return the number of bits in the APInt. Definition: APInt.h:1488 This SDNode is used to implement the code generator support for the llvm IR shufflevector instruction... void setTruncStoreAction(MVT ValVT, MVT MemVT, LegalizeAction Action) Indicate that the specified truncating store does not work with the specified type and indicate what ... void printrWithDepth(raw_ostream &O, const SelectionDAG *G=nullptr, unsigned depth=100) const Print a SelectionDAG node and children up to depth "depth." The given SelectionDAG allows target-spec... RESULT,OUTCHAIN = INTRINSIC_W_CHAIN(INCHAIN, INTRINSICID, arg1, ...) This node represents a target in... Definition: ISDOpcodes.h:159 const Triple & getTargetTriple() const getTargetTriple - Return the target triple string. SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override LowerOperation - Provide custom lowering hooks for some operations. bool hasMips64() const SDIVREM/UDIVREM - Divide two integers and produce both a quotient and remainder result. Definition: ISDOpcodes.h:209 bool hasDSPR2() const static SDValue lowerMSAStoreIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, const MipsSubtarget &Subtarget) A description of a memory reference used in the backend. const HexagonInstrInfo * TII ArrayRef< T > makeArrayRef(const T &OneElt) Construct an ArrayRef from a single element. Definition: ArrayRef.h:451 Shift and rotation operations. Definition: ISDOpcodes.h:379 unsigned getNumOperands() const Access to explicit operands of the instruction. Definition: MachineInstr.h:293 BUILD_PAIR - This is the opposite of EXTRACT_ELEMENT in some ways. Definition: ISDOpcodes.h:190 This class consists of common code factored out of the SmallVector class to reduce code duplication b... Definition: APFloat.h:42 void eraseFromParent() Unlink 'this' from the containing basic block and delete it. unsigned getScalarValueSizeInBits() const bool isGP64bit() const void setCondCodeAction(ISD::CondCode CC, MVT VT, LegalizeAction Action) Indicate that the specified condition code is or isn't supported on the target and indicate what to d... SimpleValueType SimpleTy static SDValue lowerMSABitClearImm(SDValue Op, SelectionDAG &DAG) bool hasMips32r6() const static bool isConstantOrUndefBUILD_VECTOR(const BuildVectorSDNode *Op) unsigned getOpcode() const Returns the opcode of this MachineInstr. Definition: MachineInstr.h:290 void setOperationAction(unsigned Op, MVT VT, LegalizeAction Action) Indicate that the specified operation does not work with the specified type and indicate what to do a... const DataLayout & getDataLayout() const Definition: SelectionDAG.h:388 MachineMemOperand * getMachineMemOperand(MachinePointerInfo PtrInfo, MachineMemOperand::Flags f, uint64_t s, unsigned base_alignment, const AAMDNodes &AAInfo=AAMDNodes(), const MDNode *Ranges=nullptr, SyncScope::ID SSID=SyncScope::System, AtomicOrdering Ordering=AtomicOrdering::NotAtomic, AtomicOrdering FailureOrdering=AtomicOrdering::NotAtomic) getMachineMemOperand - Allocate a new MachineMemOperand. This file implements a class to represent arbitrary precision integral constant values and operations... static SDValue lowerVECTOR_SHUFFLE_VSHF(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) SDValue getMergeValues(ArrayRef< SDValue > Ops, const SDLoc &dl) Create a MERGE_VALUES node from the given operands. unsigned getScalarSizeInBits() const Definition: ValueTypes.h:298 unsigned getSizeInBits() const Return the size of the specified value type in bits. Definition: ValueTypes.h:292 static bool isVSplat(SDValue N, APInt &Imm, bool IsLittleEndian) [SU]INT_TO_FP - These operators convert integers (whose interpreted sign depends on the first letter)... Definition: ISDOpcodes.h:455 void computeRegisterProperties(const TargetRegisterInfo *TRI) Once all of the register classes are added, this allows us to compute derived properties we expose... Select with a vector condition (op #0) and two vector operands (ops #1 and #2), returning a vector re... Definition: ISDOpcodes.h:398 static bool isVECTOR_SHUFFLE_SPLATI(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) Simple integer binary arithmetic operators. Definition: ISDOpcodes.h:200 static bool isConstantOrUndef(const SDValue Op) unsigned getIncomingArgSize() const SDValue getUNDEF(EVT VT) Return an UNDEF node. UNDEF does not have a useful SDLoc. Definition: SelectionDAG.h:830 CondCode ISD::CondCode enum - These are ordered carefully to make the bitfields below work out... Definition: ISDOpcodes.h:916 TargetConstant* - Like Constant*, but the DAG does not do any folding, simplification, or lowering of the constant. Definition: ISDOpcodes.h:125 SDValue getTargetConstant(uint64_t Val, const SDLoc &DL, EVT VT, bool isOpaque=false) Definition: SelectionDAG.h:558 static SDValue lowerVECTOR_SHUFFLE_ILVR(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) amdgpu Simplify well known AMD library false Value * Callee RESULT = INTRINSIC_WO_CHAIN(INTRINSICID, arg1, arg2, ...) This node represents a target intrinsic fun... Definition: ISDOpcodes.h:151 MachineBasicBlock * CreateMachineBasicBlock(const BasicBlock *bb=nullptr) CreateMachineBasicBlock - Allocate a new MachineBasicBlock. This class is used to represent ISD::STORE nodes. FP_TO_[US]INT - Convert a floating point value to a signed or unsigned integer. Definition: ISDOpcodes.h:498 BUILD_VECTOR(ELT0, ELT1, ELT2, ELT3,...) - Return a vector with the specified, possibly variable... Definition: ISDOpcodes.h:302 TargetInstrInfo - Interface to description of machine instruction set. static APInt getHighBitsSet(unsigned numBits, unsigned hiBitsSet) Get a value with high bits set. Definition: APInt.h:629 static SDValue performORCombine(SDNode *N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) static SDValue lowerMSASplatImm(SDValue Op, unsigned ImmOp, SelectionDAG &DAG, bool IsSigned=false) virtual void getOpndList(SmallVectorImpl< SDValue > &Ops, std::deque< std::pair< unsigned, SDValue >> &RegsToPass, bool IsPICCall, bool GlobalOrExternal, bool InternalLinkage, bool IsCallReloc, CallLoweringInfo &CLI, SDValue Callee, SDValue Chain) const This function fills Ops, which is the list of operands that will later be used when a function call n... MachineInstrBuilder BuildMI(MachineFunction &MF, const DebugLoc &DL, const MCInstrDesc &MCID) Builder interface. Specify how to create the initial instruction itself. static MDTuple * get(LLVMContext &Context, ArrayRef< Metadata *> MDs) Definition: Metadata.h:1164 bool isNegative() const Determine sign of this APInt. Definition: APInt.h:357 const SDValue & getBasePtr() const initializer< Ty > init(const Ty &Val) Definition: CommandLine.h:406 OUTCHAIN = INTRINSIC_VOID(INCHAIN, INTRINSICID, arg1, arg2, ...) This node represents a target intrin... Definition: ISDOpcodes.h:166 bool isAllOnesValue() const Determine if all bits are set. Definition: APInt.h:389 static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC") static SDValue lowerVECTOR_SHUFFLE_ILVEV(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) MVT getPointerTy(const DataLayout &DL, uint32_t AS=0) const Return the pointer type for the given address space, defaults to the pointer type from the data layou... static SDValue lowerDSPIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) Machine Value Type. bool isLittleEndian() const Tests whether the target triple is little endian. Definition: Triple.cpp:1470 LLVM Basic Block Representation. Definition: BasicBlock.h:59 static SDValue lowerMSALoadIntr(SDValue Op, SelectionDAG &DAG, unsigned Intr, const MipsSubtarget &Subtarget) static SDValue getBuildVectorSplat(EVT VecTy, SDValue SplatValue, bool BigEndian, SelectionDAG &DAG) void addRegisterClass(MVT VT, const TargetRegisterClass *RC) Add the specified register class as an available regclass for the specified value type... Simple binary floating point operators. Definition: ISDOpcodes.h:259 void setTargetDAGCombine(ISD::NodeType NT) Targets should invoke this method for each target independent node that they want to provide a custom... static bool isLegalDSPCondCode(EVT Ty, ISD::CondCode CC) unsigned getVectorNumElements() const Given a vector type, return the number of elements it contains. Definition: ValueTypes.h:273 static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC") LLVM_ATTRIBUTE_ALWAYS_INLINE iterator begin() Definition: SmallVector.h:116 const SDValue & getOperand(unsigned Num) const INSERT_VECTOR_ELT(VECTOR, VAL, IDX) - Returns VECTOR with the element at IDX replaced with VAL... Definition: ISDOpcodes.h:307 static bool isVectorAllOnes(SDValue N) static SDValue lowerVECTOR_SHUFFLE_PCKEV(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static const unsigned End const APInt & getAPIntValue() const static SDValue performSRACombine(SDNode *N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) static mvt_range vector_valuetypes() X = FP_EXTEND(Y) - Extend a smaller FP type into a larger FP type. Definition: ISDOpcodes.h:530 SDValue lowerLOAD(SDValue Op, SelectionDAG &DAG) const Extended Value Type. Definition: ValueTypes.h:34 static bool fitsRegularPattern(typename SmallVectorImpl< ValType >::const_iterator Begin, unsigned CheckStride, typename SmallVectorImpl< ValType >::const_iterator End, ValType ExpectedIndex, unsigned ExpectedIndexStride) Determine whether a range fits a regular pattern of values. bool isSingleFloat() const unsigned ceilLogBase2() const Definition: APInt.h:1730 This structure contains all information that is necessary for lowering calls. bool hasMips64r6() const This class contains a discriminated union of information about pointers in memory operands... unsigned getNumOperands() const Return the number of values used by this operation. #define llvm_unreachable(msg) Marks that the current location is not supposed to be reachable. APInt lshr(unsigned shiftAmt) const Logical right-shift function. Definition: APInt.h:959 SDValue getLoad(EVT VT, const SDLoc &dl, SDValue Chain, SDValue Ptr, MachinePointerInfo PtrInfo, unsigned Alignment=0, MachineMemOperand::Flags MMOFlags=MachineMemOperand::MONone, const AAMDNodes &AAInfo=AAMDNodes(), const MDNode *Ranges=nullptr) Loads are not normal binary operators: their result type is not determined by their operands... bool isBuildVectorAllOnes(const SDNode *N) Return true if the specified node is a BUILD_VECTOR where all of the elements are ~0 or undef... Iterator for intrusive lists based on ilist_node. CCState - This class holds information needed while lowering arguments and return values... void addSuccessor(MachineBasicBlock *Succ, BranchProbability Prob=BranchProbability::getUnknown()) Add Succ as a successor of this MachineBasicBlock. static SDValue truncateVecElts(SDValue Op, SelectionDAG &DAG) static SDValue performSHLCombine(SDNode *N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) bool isLittle() const mmo_iterator memoperands_begin() const Access to memory operands of the instruction. Definition: MachineInstr.h:389 const MipsRegisterInfo * getRegisterInfo() const override EXTRACT_VECTOR_ELT(VECTOR, IDX) - Returns a single element from VECTOR identified by the (potentially... Definition: ISDOpcodes.h:314 EVT getVectorElementType() const Given a vector type, return the type of each element. Definition: ValueTypes.h:265 static SDValue performMULCombine(SDNode *N, SelectionDAG &DAG, const TargetLowering::DAGCombinerInfo &DCI, const MipsSETargetLowering *TL) double Log2(double Value) Return the log base 2 of the specified value. Definition: MathExtras.h:520 This is used to represent a portion of an LLVM function in a low-level Data Dependence DAG representa... Definition: SelectionDAG.h:209 value_iterator value_begin() const This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small... Definition: SmallVector.h:864 SDValue getBuildVector(EVT VT, const SDLoc &DL, ArrayRef< SDValue > Ops) Return an ISD::BUILD_VECTOR node. Definition: SelectionDAG.h:712 static SDValue lowerMSABitClear(SDValue Op, SelectionDAG &DAG) constexpr size_t array_lengthof(T(&)[N]) Find the length of an array. Definition: STLExtras.h:720 bool hasCnMips() const EVT changeVectorElementTypeToInteger() const Return a vector with the same number of elements as this vector, but with the element type converted ... Definition: ValueTypes.h:96 BRCOND - Conditional branch. Definition: ISDOpcodes.h:611 const MachineInstrBuilder & addMemOperand(MachineMemOperand *MMO) const Wrapper class for IR location info (IR ordering and DebugLoc) to be passed into SDNode creation funct... static SDValue lowerMSACopyIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc) Represents one node in the SelectionDAG. SDValue getNOT(const SDLoc &DL, SDValue Val, EVT VT) Create a bitwise NOT operation as (XOR Val, -1). int64_t getImm() const SDValue LowerOperation(SDValue Op, SelectionDAG &DAG) const override LowerOperation - Provide custom lowering hooks for some operations. bool hasDSP() const unsigned logBase2() const Definition: APInt.h:1727 raw_ostream & dbgs() dbgs() - This returns a reference to a raw_ostream for debugging messages. Definition: Debug.cpp:132 void swap(llvm::BitVector &LHS, llvm::BitVector &RHS) Implement std::swap in terms of BitVector swap. Definition: BitVector.h:923 static SDValue performXORCombine(SDNode *N, SelectionDAG &DAG, const MipsSubtarget &Subtarget) static SDValue performSETCCCombine(SDNode *N, SelectionDAG &DAG) EVT getMemoryVT() const Return the type of the in-memory value. Class for arbitrary precision integers. Definition: APInt.h:69 static bool isSplatVector(const BuildVectorSDNode *N) Check if the given BuildVectorSDNode is a splat. A "pseudo-class" with methods for operating on BUILD_VECTORs. Select(COND, TRUEVAL, FALSEVAL). Definition: ISDOpcodes.h:389 static SDValue performDSPShiftCombine(unsigned Opc, SDNode *N, EVT Ty, SelectionDAG &DAG, const MipsSubtarget &Subtarget) bool isPowerOf2() const Check if this APInt's value is a power of two greater than zero. Definition: APInt.h:457 ZERO_EXTEND - Used for integer types, zeroing the new bits. Definition: ISDOpcodes.h:445 static cl::opt< bool > NoDPLoadStore("mno-ldc1-sdc1", cl::init(false), cl::desc("Expand double precision loads and " "stores to their single precision " "counterparts")) static SDValue lowerVECTOR_SHUFFLE_ILVOD(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static SDValue lowerMSASplatZExt(SDValue Op, unsigned OpNr, SelectionDAG &DAG) static SDValue performSRLCombine(SDNode *N, SelectionDAG &DAG, TargetLowering::DAGCombinerInfo &DCI, const MipsSubtarget &Subtarget) FCOPYSIGN(X, Y) - Return the value of X with the sign of Y. Definition: ISDOpcodes.h:287 int getMaskElt(unsigned Idx) const FMINNAN/FMAXNAN - Behave identically to FMINNUM/FMAXNUM, except that when a single input is NaN... Definition: ISDOpcodes.h:572 static bool isBitwiseInverse(SDValue N, SDValue OfNode) MachineRegisterInfo - Keep track of information for virtual and physical registers, including vreg register classes, use/def chains for registers, etc. Representation of each machine instruction. Definition: MachineInstr.h:59 const MachineFunction * getParent() const Return the MachineFunction containing this basic block. LLVM_ATTRIBUTE_ALWAYS_INLINE iterator end() Definition: SmallVector.h:120 bool isVector() const Return true if this is a vector value type. Definition: ValueTypes.h:151 const MachineInstrBuilder & addImm(int64_t Val) const Add a new immediate operand. Bitwise operators - logical and, logical or, logical xor. Definition: ISDOpcodes.h:362 void splice(iterator Where, MachineBasicBlock *Other, iterator From) Take an instruction from MBB 'Other' at the position From, and insert it into this MBB right before '... MachineRegisterInfo & getRegInfo() getRegInfo - Return information about the registers currently in use. SMUL_LOHI/UMUL_LOHI - Multiply two integers of type iN, producing a signed/unsigned value of type i[2... Definition: ISDOpcodes.h:205 bool is128BitVector() const Return true if this is a 128-bit vector type. Definition: ValueTypes.h:182 const MCInstrDesc & get(unsigned Opcode) const Return the machine instruction descriptor that corresponds to the specified instruction opcode... Definition: MCInstrInfo.h:45 LOAD and STORE have token chains as their first operand, then the same operands as an LLVM load/store... Definition: ISDOpcodes.h:581 const TargetRegisterClass * getRepRegClassFor(MVT VT) const override Return the 'representative' register class for the specified value type. #define I(x, y, z) Definition: MD5.cpp:58 #define N const TargetSubtargetInfo & getSubtarget() const Definition: SelectionDAG.h:390 Flags getFlags() const Return the raw flags of the source value,. SDValue lowerSTORE(SDValue Op, SelectionDAG &DAG) const const BasicBlock * getBasicBlock() const Return the LLVM basic block that this instance corresponded to originally. static SDValue lowerMSABinaryBitImmIntr(SDValue Op, SelectionDAG &DAG, unsigned Opc, SDValue Imm, bool BigEndian) MipsFunctionInfo - This class is derived from MachineFunction private Mips target-specific informatio... LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val) Definition: Casting.h:323 bool useOddSPReg() const const MachineInstrBuilder & addReg(unsigned RegNo, unsigned flags=0, unsigned SubReg=0) const Add a new virtual register operand. unsigned getOpcode() const FSINCOS - Compute both fsin and fcos as a single operation. Definition: ISDOpcodes.h:575 SDValue getValue(unsigned R) const unsigned getInRegsParamsCount() const bool hasMips32r2() const bool isReg() const isReg - Tests if this is a MO_Register operand. SDValue getConstant(uint64_t Val, const SDLoc &DL, EVT VT, bool isTarget=false, bool isOpaque=false) Create a ConstantSDNode wrapping a constant value. bool isABI_N64() const assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef()) void insert(iterator MBBI, MachineBasicBlock *MBB) int64_t getOffset() const For normal values, this is a byte offset added to the base address. LLVM Value Representation. Definition: Value.h:73 uint64_t getConstantOperandVal(unsigned Num) const Helper method returns the integer value of a ConstantSDNode operand. FMA - Perform a * b + c with no intermediate rounding step. Definition: ISDOpcodes.h:277 SDValue getValueType(EVT) std::underlying_type< E >::type Mask() Get a bitmask with 1s in all places up to the high-order bit of E's largest value. Definition: BitmaskEnum.h:81 bool isUndef() const Return true if the type of the node type undefined. static SDValue lowerVECTOR_SHUFFLE_SHF(SDValue Op, EVT ResTy, SmallVector< int, 16 > Indices, SelectionDAG &DAG) static SDValue lo

{ "url": "http://llvm.org/doxygen/MipsSEISelLowering_8cpp_source.html", "source_domain": "llvm.org", "snapshot_id": "crawl=CC-MAIN-2017-47", "warc_metadata": { "Content-Length": "1048833", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BSITCDIIGQYOJ2BUTQF3U7QLGOWF7UR3", "WARC-Concurrent-To": "<urn:uuid:4bf263ae-4084-4b75-8f9a-ae3191eb7fdc>", "WARC-Date": "2017-11-23T02:00:01Z", "WARC-IP-Address": "54.67.122.174", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:RPPBIOCHH2YEIEUKKBK7NCMNIUTPRLYP", "WARC-Record-ID": "<urn:uuid:2aa3df59-92ac-4950-a78f-ffe1fc893e97>", "WARC-Target-URI": "http://llvm.org/doxygen/MipsSEISelLowering_8cpp_source.html", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:c14d4872-1d6e-4a4d-9077-210215d4f89a>" }, "warc_info": "robots: classic\r\nhostname: ip-10-143-69-18.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 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, 15, 38, 76, 159, 164, 202, 207, 282, 325, 330, 413, 418, 482, 488, 572, 576, 611, 647, 680, 710, 741, 775, 810, 847, 879, 912, 947, 984, 1019, 1043, 1065, 1087, 1110, 1132, 1136, 1161, 1165, 1199, 1203, 1227, 1278, 1338, 1342, 1414, 1464, 1504, 1526, 1530, 1560, 1596, 1631, 1685, 1689, 1720, 1774, 1778, 1830, 1887, 1934, 1981, 2024, 2030, 2036, 2042, 2046, 2076, 2080, 2140, 2194, 2198, 2233, 2294, 2342, 2346, 2398, 2450, 2503, 2557, 2564, 2569, 2576, 2581, 2612, 2617, 2648, 2704, 2760, 2816, 2872, 2930, 2988, 3046, 3051, 3113, 3170, 3175, 3182, 3187, 3225, 3280, 3285, 3347, 3386, 3418, 3473, 3483, 3539, 3546, 3553, 3558, 3563, 3595, 3632, 3637, 3671, 3678, 3683, 3688, 3693, 3698, 3703, 3729, 3736, 3741, 3777, 3858, 3878, 3883, 3964, 4024, 4029, 4109, 4148, 4153, 4158, 4229, 4234, 4239, 4298, 4303, 4310, 4315, 4351, 4432, 4452, 4457, 4538, 4598, 4603, 4683, 4722, 4729, 4734, 4740, 4745, 4776, 4809, 4856, 4862, 4867, 4899, 4928, 5009, 5014, 5020, 5025, 5098, 5129, 5134, 5170, 5232, 5274, 5279, 5284, 5289, 5338, 5345, 5350, 5356, 5361, 5441, 5472, 5477, 5513, 5575, 5617, 5622, 5627, 5656, 5661, 5668, 5674, 5679, 5764, 5798, 5855, 5860, 5898, 5917, 5922, 6005, 6088, 6151, 6235, 6312, 6337, 6343, 6348, 6357, 6372, 6387, 6412, 6417, 6489, 6570, 6647, 6697, 6712, 6731, 6749, 6756, 6761, 6781, 6801, 6821, 6836, 6855, 6873, 6887, 6906, 6913, 6919, 6924, 6956, 6986, 7034, 7084, 7166, 7249, 7328, 7408, 7485, 7567, 7644, 7655, 7731, 7805, 7873, 7949, 8013, 8081, 8133, 8140, 8145, 8202, 8208, 8213, 8276, 8283, 8330, 8402, 8483, 8504, 8573, 8612, 8642, 8665, 8670, 8707, 8744, 8788, 8793, 8848, 8888, 8934, 8975, 9027, 9075, 9080, 9096, 9119, 9124, 9199, 9204, 9234, 9287, 9292, 9334, 9387, 9442, 9479, 9484, 9562, 9591, 9664, 9728, 9751, 9799, 9806, 9813, 9818, 9841, 9847, 9852, 9919, 9926, 9963, 10027, 10034, 10113, 10193, 10274, 10334, 10405, 10410, 10426, 10445, 10450, 10485, 10513, 10537, 10542, 10626, 10652, 10671, 10676, 10699, 10704, 10722, 10728, 10733, 10797, 10842, 10922, 10953, 10994, 11021, 11026, 11031, 11046, 11065, 11070, 11105, 11133, 11157, 11162, 11239, 11266, 11349, 11390, 11395, 11414, 11420, 11425, 11481, 11543, 11580, 11599, 11604, 11648, 11688, 11693, 11737, 11777, 11782, 11801, 11807, 11812, 11868, 11875, 11922, 12000, 12082, 12102, 12141, 12171, 12194, 12199, 12233, 12238, 12269, 12292, 12297, 12334, 12371, 12376, 12449, 12491, 12533, 12575, 12617, 12667, 12672, 12705, 12739, 12765, 12770, 12847, 12928, 12945, 12997, 13048, 13068, 13089, 13094, 13148, 13218, 13239, 13298, 13368, 13389, 13394, 13422, 13429, 13434, 13515, 13552, 13604, 13675, 13695, 13716, 13721, 13775, 13845, 13866, 13925, 13995, 14016, 14021, 14049, 14056, 14061, 14132, 14201, 14224, 14253, 14298, 14318, 14339, 14360, 14412, 14432, 14453, 14474, 14526, 14546, 14567, 14588, 14640, 14660, 14681, 14702, 14754, 14774, 14795, 14816, 14868, 14888, 14909, 14930, 14982, 15002, 15023, 15044, 15096, 15116, 15137, 15158, 15165, 15172, 15177, 15244, 15271, 15294, 15299, 15347, 15352, 15383, 15410, 15442, 15461, 15486, 15505, 15512, 15517, 15571, 15644, 15651, 15656, 15679, 15685, 15690, 15767, 15806, 15824, 15841, 15881, 15886, 15904, 15921, 15936, 15941, 15994, 16019, 16064, 16114, 16119, 16161, 16216, 16272, 16317, 16322, 16364, 16447, 16518, 16556, 16621, 16690, 16743, 16750, 16755, 16796, 16865, 16929, 16997, 17050, 17056, 17061, 17100, 17134, 17139, 17212, 17237, 17314, 17372, 17383, 17388, 17415, 17421, 17426, 17501, 17525, 17564, 17618, 17653, 17681, 17705, 17755, 17760, 17790, 17813, 17818, 17834, 17912, 17952, 17986, 18031, 18054, 18059, 18077, 18132, 18196, 18202, 18207, 18246, 18280, 18285, 18335, 18358, 18363, 18441, 18447, 18452, 18532, 18589, 18596, 18643, 18715, 18796, 18836, 18917, 18934, 18941, 19021, 19044, 19083, 19117, 19122, 19153, 19190, 19227, 19232, 19301, 19337, 19379, 19420, 19490, 19532, 19595, 19600, 19620, 19643, 19648, 19710, 19733, 19738, 19806, 19885, 19890, 19918, 19977, 20002, 20071, 20101, 20168, 20194, 20245, 20252, 20259, 20266, 20271, 20348, 20371, 20376, 20454, 20460, 20465, 20470, 20509, 20543, 20548, 20625, 20648, 20653, 20731, 20737, 20742, 20805, 20844, 20849, 20868, 20890, 20925, 20947, 20969, 20991, 21028, 21051, 21074, 21097, 21136, 21164, 21171, 21177, 21182, 21216, 21221, 21271, 21294, 21299, 21380, 21403, 21408, 21484, 21526, 21532, 21537, 21571, 21576, 21626, 21662, 21729, 21796, 21863, 21930, 21998, 22066, 22134, 22202, 22281, 22362, 22381, 22418, 22423, 22464, 22487, 22492, 22571, 22589, 22594, 22653, 22673, 22739, 22760, 22770, 22793, 22798, 22835, 22872, 22914, 22956, 22961, 23002, 23078, 23098, 23144, 23220, 23240, 23299, 23338, 23343, 23393, 23416, 23421, 23483, 23530, 23593, 23600, 23605, 23628, 23634, 23639, 23678, 23712, 23717, 23789, 23825, 23875, 23935, 23972, 24009, 24029, 24034, 24052, 24108, 24126, 24136, 24159, 24164, 24204, 24279, 24307, 24314, 24319, 24342, 24348, 24353, 24365, 24399, 24417, 24422, 24453, 24473, 24527, 24539, 24558, 24611, 24623, 24643, 24693, 24713, 24767, 24779, 24799, 24854, 24874, 24929, 24953, 24996, 25016, 25065, 25077, 25099, 25140, 25153, 25161, 25167, 25194, 25243, 25283, 25310, 25362, 25385, 25403, 25411, 25417, 25424, 25430, 25467, 25499, 25514, 25548, 25583, 25614, 25670, 25701, 25757, 25788, 25844, 25875, 25931, 25962, 26018, 26048, 26103, 26133, 26188, 26218, 26273, 26303, 26358, 26388, 26443, 26476, 26510, 26543, 26577, 26612, 26648, 26683, 26719, 26758, 26799, 26850, 26889, 26930, 26981, 27020, 27061, 27112, 27151, 27192, 27243, 27283, 27325, 27375, 27415, 27457, 27507, 27540, 27574, 27607, 27641, 27676, 27712, 27747, 27783, 27808, 27848, 27873, 27913, 27954, 28003, 28043, 28091, 28132, 28180, 28220, 28267, 28275, 28282, 28288, 28355, 28410, 28452, 28481, 28501, 28507, 28555, 28577, 28597, 28603, 28678, 28743, 28763, 28769, 28842, 28861, 28918, 28925, 28931, 28964, 29012, 29072, 29139, 29202, 29231, 29260, 29344, 29393, 29407, 29414, 29420, 29504, 29550, 29556, 29614, 29667, 29673, 29752, 29772, 29832, 29870, 29876, 29914, 29993, 30051, 30057, 30096, 30178, 30210, 30273, 30345, 30351, 30384, 30409, 30415, 30492, 30537, 30579, 30586, 30592, 30677, 30725, 30731, 30789, 30843, 30849, 30934, 30954, 31035, 31073, 31119, 31165, 31171, 31204, 31229, 31235, 31272, 31286, 31366, 31421, 31427, 31465, 31547, 31615, 31654, 31709, 31716, 31722, 31798, 31828, 31861, 31926, 31932, 31980, 32000, 32059, 32102, 32124, 32130, 32147, 32200, 32217, 32270, 32276, 32304, 32334, 32340, 32375, 32418, 32425, 32431, 32504, 32545, 32618, 32659, 32732, 32739, 32745, 32827, 32892, 32957, 33022, 33029, 33035, 33119, 33145, 33153, 33189, 33200, 33246, 33292, 33319, 33340, 33361, 33399, 33407, 33487, 33507, 33579, 33604, 33610, 33648, 33670, 33715, 33721, 33772, 33778, 33825, 33876, 33882, 33925, 33970, 33981, 34008, 34014, 34052, 34109, 34152, 34158, 34200, 34226, 34253, 34259, 34281, 34315, 34321, 34399, 34418, 34480, 34486, 34508, 34563, 34646, 34652, 34675, 34693, 34699, 34749, 34808, 34851, 34858, 34864, 34937, 35021, 35041, 35080, 35119, 35158, 35221, 35227, 35288, 35320, 35326, 35347, 35354, 35360, 35446, 35488, 35519, 35598, 35618, 35624, 35705, 35784, 35800, 35844, 35865, 35871, 35907, 35955, 35984, 36004, 36035, 36048, 36069, 36075, 36157, 36221, 36227, 36270, 36343, 36349, 36383, 36437, 36492, 36549, 36557, 36563, 36584, 36591, 36597, 36681, 36712, 36742, 36793, 36832, 36839, 36845, 36916, 36959, 36987, 37027, 37067, 37095, 37101, 37134, 37211, 37240, 37246, 37320, 37388, 37430, 37505, 37513, 37519, 37593, 37613, 37634, 37677, 37683, 37761, 37819, 37877, 37937, 37943, 37986, 38059, 38065, 38094, 38155, 38161, 38182, 38189, 38195, 38228, 38252, 38291, 38314, 38334, 38340, 38425, 38448, 38481, 38547, 38607, 38613, 38687, 38704, 38780, 38786, 38807, 38848, 38854, 38883, 38919, 38960, 39018, 39026, 39034, 39040, 39072, 39133, 39139, 39221, 39258, 39289, 39351, 39357, 39422, 39428, 39508, 39524, 39532, 39538, 39608, 39615, 39621, 39641, 39680, 39719, 39798, 39862, 39941, 39962, 40043, 40049, 40111, 40118, 40124, 40163, 40183, 40234, 40319, 40325, 40390, 40425, 40432, 40438, 40458, 40497, 40556, 40623, 40684, 40690, 40765, 40772, 40778, 40849, 40882, 40902, 40986, 41013, 41028, 41052, 41086, 41138, 41177, 41234, 41273, 41330, 41369, 41426, 41465, 41522, 41559, 41614, 41651, 41706, 41744, 41800, 41838, 41894, 41933, 41990, 42023, 42074, 42108, 42160, 42193, 42244, 42278, 42330, 42363, 42414, 42448, 42500, 42535, 42570, 42605, 42640, 42719, 42745, 42781, 42817, 42853, 42889, 42968, 43005, 43039, 43118, 43144, 43179, 43258, 43295, 43330, 43365, 43400, 43435, 43475, 43511, 43547, 43583, 43619, 43662, 43699, 43736, 43773, 43812, 43892, 43931, 43979, 44044, 44096, 44137, 44187, 44233, 44278, 44286, 44323, 44360, 44397, 44436, 44516, 44555, 44603, 44668, 44720, 44761, 44811, 44857, 44902, 44910, 44945, 45028, 45073, 45109, 45173, 45228, 45254, 45288, 45371, 45416, 45451, 45515, 45570, 45596, 45631, 45666, 45701, 45738, 45777, 45828, 45834, 45899, 45943, 45977, 45985, 46021, 46057, 46093, 46129, 46205, 46235, 46269, 46303, 46337, 46371, 46444, 46470, 46504, 46577, 46603, 46638, 46710, 46774, 46818, 46844, 46880, 46953, 47017, 47072, 47098, 47133, 47168, 47203, 47240, 47279, 47330, 47336, 47400, 47444, 47478, 47486, 47522, 47558, 47594, 47630, 47705, 47735, 47768, 47801, 47834, 47867, 47937, 47963, 47996, 48066, 48092, 48126, 48160, 48194, 48228, 48298, 48336, 48371, 48406, 48441, 48476, 48546, 48601, 48637, 48673, 48709, 48745, 48815, 48853, 48890, 48927, 48964, 49001, 49071, 49126, 49162, 49198, 49234, 49270, 49340, 49379, 49416, 49453, 49490, 49527, 49597, 49647, 49683, 49719, 49755, 49791, 49861, 49899, 49936, 49973, 50010, 50047, 50117, 50172, 50208, 50244, 50280, 50316, 50386, 50425, 50462, 50499, 50536, 50573, 50643, 50693, 50730, 50767, 50804, 50841, 50874, 50951, 50964, 51037, 51101, 51162, 51208, 51234, 51242, 51279, 51316, 51353, 51390, 51423, 51500, 51513, 51586, 51650, 51724, 51799, 51878, 51939, 51985, 52011, 52019, 52055, 52091, 52127, 52163, 52243, 52269, 52305, 52341, 52377, 52413, 52493, 52519, 52554, 52589, 52656, 52736, 52762, 52839, 52874, 52909, 52979, 53018, 53053, 53088, 53158, 53197, 53232, 53267, 53337, 53376, 53411, 53446, 53516, 53555, 53590, 53625, 53695, 53732, 53768, 53804, 53874, 53913, 53949, 53985, 54055, 54094, 54130, 54166, 54236, 54275, 54310, 54345, 54415, 54453, 54489, 54525, 54595, 54634, 54669, 54704, 54771, 54851, 54877, 54915, 54953, 55020, 55046, 55084, 55122, 55189, 55215, 55250, 55285, 55320, 55357, 55396, 55422, 55428, 55510, 55540, 55589, 55597, 55633, 55671, 55738, 55777, 55803, 55857, 55926, 55934, 55970, 56006, 56088, 56124, 56160, 56227, 56291, 56326, 56361, 56428, 56508, 56534, 56570, 56608, 56675, 56714, 56787, 56834, 56880, 56888, 56924, 56960, 57042, 57078, 57114, 57196, 57231, 57266, 57333, 57413, 57439, 57478, 57517, 57584, 57610, 57649, 57688, 57755, 57781, 57817, 57853, 57889, 57925, 57991, 58036, 58071, 58106, 58141, 58176, 58241, 58286, 58322, 58358, 58394, 58430, 58496, 58541, 58576, 58611, 58646, 58681, 58746, 58791, 58828, 58865, 58902, 58939, 59020, 59084, 59120, 59156, 59192, 59230, 59280, 59299, 59326, 59379, 59431, 59483, 59535, 59591, 59599, 59678, 59714, 59766, 59832, 59895, 59936, 59944, 59978, 60012, 60046, 60080, 60129, 60161, 60196, 60235, 60307, 60353, 60399, 60407, 60443, 60479, 60515, 60553, 60592, 60664, 60710, 60756, 60764, 60800, 60836, 60872, 60908, 60974, 61019, 61055, 61091, 61127, 61163, 61229, 61274, 61311, 61348, 61385, 61422, 61488, 61550, 61587, 61624, 61661, 61698, 61764, 61820, 61856, 61892, 61928, 61964, 62030, 62075, 62111, 62147, 62183, 62219, 62285, 62330, 62367, 62404, 62441, 62478, 62544, 62606, 62643, 62680, 62717, 62754, 62820, 62876, 62912, 62948, 62984, 63020, 63100, 63126, 63162, 63198, 63234, 63270, 63350, 63376, 63411, 63446, 63481, 63516, 63595, 63621, 63657, 63693, 63729, 63767, 63806, 63878, 63924, 63970, 63978, 64013, 64048, 64083, 64118, 64199, 64235, 64301, 64346, 64402, 64410, 64447, 64513, 64538, 64575, 64631, 64639, 64672, 64750, 64776, 64810, 64869, 64925, 64961, 64997, 65033, 65069, 65135, 65180, 65216, 65252, 65288, 65324, 65390, 65435, 65470, 65505, 65540, 65575, 65657, 65693, 65729, 65765, 65801, 65837, 65873, 65909, 65947, 65997, 66016, 66043, 66079, 66131, 66167, 66220, 66256, 66309, 66345, 66398, 66454, 66462, 66541, 66577, 66629, 66653, 66661, 66695, 66729, 66765, 66844, 66880, 66932, 66996, 67041, 67049, 67084, 67119, 67154, 67191, 67241, 67260, 67287, 67339, 67390, 67441, 67492, 67548, 67556, 67635, 67671, 67723, 67747, 67755, 67789, 67823, 67857, 67891, 67970, 68003, 68038, 68073, 68108, 68143, 68203, 68259, 68295, 68331, 68367, 68403, 68483, 68562, 68621, 68686, 68751, 68807, 68833, 68870, 68907, 68944, 68981, 69046, 69101, 69127, 69161, 69195, 69229, 69263, 69342, 69375, 69410, 69445, 69480, 69515, 69575, 69631, 69667, 69703, 69739, 69777, 69827, 69846, 69873, 69925, 69978, 70031, 70084, 70140, 70148, 70227, 70263, 70315, 70339, 70347, 70381, 70415, 70449, 70483, 70562, 70595, 70630, 70665, 70700, 70735, 70795, 70851, 70887, 70923, 70959, 70997, 71047, 71066, 71093, 71145, 71198, 71251, 71304, 71360, 71368, 71447, 71483, 71535, 71559, 71567, 71602, 71637, 71672, 71707, 71786, 71812, 71848, 71884, 71920, 71956, 72016, 72072, 72107, 72142, 72177, 72212, 72277, 72341, 72375, 72454, 72480, 72515, 72575, 72631, 72671, 72724, 72785, 72793, 72801, 72808, 72814, 72897, 72937, 72957, 73000, 73043, 73085, 73124, 73168, 73174, 73251, 73328, 73371, 73404, 73469, 73475, 73542, 73618, 73647, 73654, 73660, 73730, 73763, 73842, 73864, 73879, 73903, 73936, 73987, 74022, 74075, 74110, 74163, 74200, 74255, 74293, 74349, 74386, 74441, 74476, 74529, 74571, 74631, 74671, 74729, 74769, 74827, 74868, 74927, 74968, 75027, 75067, 75125, 75165, 75223, 75263, 75321, 75361, 75419, 75460, 75519, 75561, 75621, 75662, 75721, 75763, 75823, 75856, 75889, 75922, 75955, 76012, 76020, 76027, 76033, 76117, 76157, 76177, 76220, 76261, 76304, 76346, 76390, 76396, 76473, 76550, 76593, 76626, 76691, 76697, 76764, 76770, 76847, 76876, 76883, 76889, 76956, 76989, 77068, 77090, 77105, 77129, 77162, 77195, 77228, 77261, 77319, 77327, 77334, 77340, 77405, 77486, 77571, 77586, 77647, 77694, 77767, 77773, 77816, 77822, 77870, 77910, 77930, 77938, 77944, 77963, 77970, 77976, 78047, 78055, 78139, 78219, 78304, 78386, 78404, 78440, 78508, 78528, 78567, 78606, 78646, 78652, 78687, 78711, 78717, 78748, 78787, 78835, 78909, 78941, 78949, 78955, 78972, 78979, 78985, 79040, 79065, 79084, 79119, 79138, 79175, 79194, 79214, 79221, 79227, 79285, 79333, 79352, 79372, 79379, 79385, 79462, 79479, 79487, 79536, 79620, 79695, 79713, 79797, 79880, 79912, 79959, 80040, 80095, 80160, 80193, 80254, 80293, 80313, 80349, 80378, 80403, 80409, 80467, 80491, 80497, 80567, 80590, 80644, 80705, 80780, 80806, 80830, 80836, 80904, 80980, 81025, 81071, 81088, 81094, 81114, 81120, 81150, 81165, 81189, 81203, 81232, 81245, 81260, 81289, 81302, 81317, 81346, 81359, 81374, 81435, 81459, 81467, 81473, 81547, 81613, 81619, 81669, 81698, 81768, 81774, 81795, 81833, 81850, 81905, 81977, 82057, 82088, 82129, 82135, 82167, 82173, 82228, 82272, 82319, 82389, 82416, 82457, 82465, 82486, 82494, 82500, 82524, 82531, 82537, 82590, 82598, 82678, 82763, 82771, 82852, 82918, 82997, 83048, 83056, 83077, 83135, 83182, 83218, 83241, 83270, 83303, 83346, 83382, 83409, 83455, 83461, 83491, 83515, 83521, 83562, 83619, 83647, 83653, 83717, 83797, 83820, 83846, 83877, 83901, 83909, 83915, 83985, 84063, 84094, 84121, 84127, 84201, 84230, 84278, 84302, 84310, 84318, 84324, 84397, 84421, 84458, 84489, 84495, 84516, 84531, 84537, 84554, 84578, 84586, 84592, 84612, 84662, 84724, 84731, 84737, 84806, 84892, 84925, 84942, 84970, 85031, 85054, 85060, 85085, 85128, 85148, 85192, 85198, 85277, 85333, 85399, 85427, 85435, 85454, 85461, 85467, 85521, 85529, 85570, 85593, 85629, 85637, 85719, 85778, 85842, 85878, 85905, 85946, 85952, 85979, 86017, 86038, 86060, 86073, 86081, 86089, 86095, 86179, 86189, 86196, 86202, 86257, 86265, 86327, 86335, 86415, 86452, 86475, 86502, 86559, 86580, 86612, 86648, 86656, 86738, 86798, 86834, 86861, 86902, 86908, 86926, 86944, 86987, 87026, 87032, 87113, 87161, 87217, 87247, 87321, 87351, 87362, 87386, 87392, 87472, 87520, 87580, 87610, 87688, 87718, 87729, 87753, 87759, 87827, 87834, 87840, 87895, 87903, 87964, 87972, 88052, 88089, 88112, 88141, 88198, 88219, 88251, 88289, 88297, 88379, 88439, 88475, 88502, 88543, 88549, 88567, 88585, 88628, 88667, 88673, 88753, 88801, 88857, 88887, 88965, 88995, 89006, 89030, 89036, 89115, 89163, 89223, 89253, 89335, 89365, 89376, 89400, 89406, 89474, 89481, 89487, 89541, 89549, 89635, 89656, 89664, 89743, 89780, 89803, 89830, 89887, 89908, 89940, 89976, 89984, 90066, 90126, 90162, 90189, 90230, 90236, 90254, 90272, 90315, 90354, 90360, 90443, 90507, 90563, 90593, 90667, 90697, 90708, 90732, 90738, 90820, 90884, 90944, 90974, 91052, 91082, 91093, 91117, 91123, 91190, 91197, 91203, 91257, 91265, 91348, 91372, 91380, 91459, 91496, 91523, 91556, 91629, 91650, 91690, 91736, 91744, 91826, 91886, 91922, 91949, 91990, 91996, 92042, 92060, 92078, 92121, 92160, 92166, 92249, 92313, 92376, 92406, 92491, 92521, 92532, 92556, 92562, 92644, 92708, 92775, 92805, 92890, 92900, 92930, 92941, 92965, 92971, 93038, 93045, 93051, 93106, 93114, 93192, 93200, 93280, 93318, 93341, 93368, 93425, 93446, 93483, 93524, 93532, 93614, 93674, 93710, 93737, 93778, 93784, 93802, 93820, 93863, 93925, 93964, 93970, 94026, 94056, 94130, 94160, 94171, 94195, 94201, 94255, 94285, 94357, 94387, 94398, 94422, 94428, 94496, 94503, 94509, 94564, 94572, 94649, 94657, 94737, 94775, 94798, 94827, 94884, 94905, 94942, 94985, 94993, 95075, 95135, 95171, 95198, 95239, 95245, 95263, 95281, 95324, 95386, 95425, 95431, 95487, 95517, 95595, 95625, 95636, 95660, 95666, 95720, 95750, 95826, 95856, 95867, 95891, 95897, 95965, 95972, 95978, 96018, 96026, 96107, 96188, 96271, 96352, 96437, 96522, 96558, 96585, 96604, 96623, 96687, 96743, 96775, 96807, 96827, 96882, 96888, 96935, 96966, 96994, 97000, 97042, 97068, 97125, 97151, 97159, 97165, 97248, 97259, 97322, 97328, 97392, 97398, 97438, 97469, 97500, 97530, 97567, 97595, 97632, 97643, 97725, 97731, 97806, 97871, 97932, 97972, 98011, 98045, 98117, 98188, 98195, 98201, 98284, 98316, 98383, 98416, 98481, 98520, 98526, 98561, 98585, 98591, 98646, 98682, 98688, 98733, 98779, 98785, 98856, 98880, 98940, 99004, 99026, 99099, 99120, 99193, 99214, 99286, 99307, 99379, 99400, 99473, 99494, 99567, 99588, 99659, 99680, 99744, 99751, 99757, 99815, 99852, 99866, 99896, 99908, 99922, 99945, 99960, 99980, 99997, 100012, 100032, 100048, 100092, 100098, 100166, 100226, 100264, 100319, 100363, 100431, 100499, 100525, 100551, 100578, 100584, 100655, 100737, 100755, 100761, 100786, 100815, 100844, 100875, 100906, 100912, 100966, 101027, 101082, 101149, 101155, 101175, 101231, 101295, 101332, 101401, 101407, 101427, 101483, 101547, 101584, 101590, 101629, 101690, 101723, 101742, 101761, 101780, 101800, 101806, 101873, 101892, 101899, 101905, 101973, 102047, 102061, 102092, 102104, 102118, 102143, 102159, 102174, 102194, 102211, 102226, 102246, 102262, 102305, 102311, 102379, 102439, 102477, 102532, 102576, 102644, 102712, 102738, 102764, 102791, 102797, 102868, 102950, 102968, 102974, 102999, 103028, 103057, 103088, 103119, 103125, 103176, 103218, 103259, 103279, 103285, 103305, 103361, 103425, 103462, 103531, 103537, 103557, 103613, 103677, 103714, 103720, 103759, 103820, 103853, 103872, 103891, 103910, 103930, 103936, 104003, 104022, 104029, 104035, 104080, 104088, 104123, 104134, 104164, 104186, 104194, 104279, 104364, 104448, 104505, 104542, 104610, 104648, 104695, 104742, 104791, 104797, 104820, 104844, 104882, 104949, 105028, 105099, 105105, 105170, 105178, 105184, 105266, 105281, 105332, 105389, 105425, 105431, 105513, 105595, 105603, 105609, 105676, 105693, 105700, 105706, 105751, 105759, 105794, 105805, 105835, 105864, 105872, 105957, 106037, 106110, 106167, 106204, 106210, 106278, 106325, 106372, 106425, 106463, 106469, 106490, 106572, 106585, 106660, 106666, 106745, 106827, 106835, 106841, 106908, 106925, 106932, 106938, 106985, 106993, 107039, 107050, 107088, 107128, 107187, 107224, 107292, 107330, 107377, 107427, 107476, 107523, 107574, 107631, 107667, 107673, 107735, 107752, 107770, 107799, 107855, 107876, 107896, 107914, 107932, 107938, 108005, 108022, 108029, 108035, 108082, 108090, 108127, 108138, 108176, 108216, 108275, 108312, 108318, 108386, 108424, 108471, 108521, 108570, 108617, 108692, 108698, 108760, 108777, 108795, 108824, 108880, 108901, 108921, 108939, 108957, 108963, 109030, 109047, 109054, 109060, 109124, 109132, 109153, 109213, 109224, 109266, 109317, 109367, 109402, 109451, 109459, 109487, 109547, 109558, 109601, 109643, 109694, 109739, 109774, 109823, 109889, 109961, 109986, 110054, 110092, 110139, 110193, 110245, 110299, 110305, 110355, 110404, 110445, 110520, 110589, 110662, 110690, 110719, 110747, 110779, 110794, 110837, 110851, 110874, 110907, 110938, 110976, 110989, 111003, 111026, 111059, 111090, 111128, 111141, 111155, 111178, 111211, 111242, 111280, 111293, 111307, 111330, 111363, 111394, 111432, 111445, 111453, 111459, 111477, 111535, 111597, 111614, 111639, 111705, 111727, 111735, 111741, 111791, 111824, 111888, 111944, 111967, 111995, 112021, 112029, 112035, 112105, 112167, 112225, 112250, 112275, 112313, 112319, 112381, 112399, 112447, 112501, 112523, 112540, 112565, 112583, 112598, 112647, 112702, 112724, 112749, 112767, 112775, 112781, 112847, 112932, 112968, 113032, 113117, 113133, 113199, 113223, 113277, 113299, 113321, 113360, 113366, 113433, 113450, 113457, 113463, 113508, 113516, 113548, 113559, 113585, 113633, 113663, 113720, 113757, 113825, 113863, 113910, 113957, 114009, 114064, 114102, 114154, 114209, 114247, 114253, 114316, 114379, 114398, 114416, 114445, 114525, 114531, 114598, 114615, 114622, 114628, 114673, 114681, 114713, 114724, 114750, 114798, 114828, 114885, 114922, 114928, 114996, 115034, 115081, 115128, 115204, 115280, 115286, 115349, 115412, 115431, 115449, 115478, 115558, 115564, 115631, 115648, 115655, 115661, 115737, 115755, 115763, 115809, 115820, 115851, 115876, 115884, 115965, 116047, 116062, 116125, 116162, 116168, 116236, 116274, 116321, 116368, 116431, 116469, 116475, 116554, 116623, 116670, 116708, 116788, 116842, 116873, 116932, 117005, 117011, 117090, 117115, 117189, 117252, 117269, 117287, 117316, 117332, 117340, 117414, 117432, 117450, 117469, 117515, 117521, 117549, 117566, 117573, 117579, 117664, 117672, 117719, 117730, 117755, 117782, 117790, 117864, 117938, 118017, 118054, 118132, 118154, 118217, 118254, 118260, 118328, 118366, 118413, 118419, 118498, 118567, 118614, 118652, 118732, 118786, 118817, 118823, 118882, 118937, 118943, 118975, 119054, 119111, 119144, 119150, 119175, 119249, 119332, 119348, 119356, 119362, 119429, 119435, 119463, 119480, 119487, 119493, 119538, 119546, 119595, 119603, 119683, 119717, 119725, 119808, 119880, 119954, 120030, 120108, 120185, 120193, 120216, 120224, 120269, 120280, 120305, 120335, 120371, 120379, 120415, 120423, 120468, 120479, 120504, 120534, 120561, 120597, 120633, 120673, 120709, 120717, 120753, 120761, 120806, 120817, 120843, 120873, 120913, 120951, 120959, 121043, 121113, 121182, 121250, 121323, 121356, 121420, 121449, 121477, 121483, 121562, 121645, 121658, 121664, 121727, 121791, 121797, 121835, 121882, 121929, 121935, 122003, 122081, 122122, 122191, 122232, 122252, 122309, 122381, 122387, 122448, 122509, 122574, 122642, 122671, 122677, 122706, 122768, 122842, 122921, 123000, 123061, 123082, 123104, 123122, 123183, 123205, 123227, 123245, 123266, 123274, 123280, 123301, 123380, 123440, 123460, 123481, 123502, 123510, 123516, 123599, 123605, 123633, 123650, 123657, 123663, 123709, 123717, 123775, 123783, 123862, 123907, 123915, 123998, 124070, 124144, 124220, 124298, 124377, 124402, 124410, 124433, 124441, 124487, 124498, 124527, 124559, 124584, 124592, 124625, 124633, 124679, 124690, 124719, 124752, 124789, 124815, 124823, 124856, 124864, 124910, 124921, 124950, 124983, 125019, 125047, 125084, 125120, 125185, 125214, 125242, 125248, 125327, 125410, 125423, 125429, 125492, 125556, 125562, 125600, 125647, 125694, 125700, 125768, 125809, 125878, 125919, 125939, 125996, 126072, 126078, 126156, 126185, 126191, 126263, 126284, 126352, 126426, 126434, 126440, 126499, 126560, 126600, 126660, 126672, 126749, 126818, 126824, 126853, 126915, 126976, 126996, 127014, 127072, 127094, 127117, 127125, 127131, 127159, 127176, 127183, 127189, 127237, 127245, 127279, 127290, 127311, 127341, 127400, 127437, 127505, 127567, 127623, 127679, 127717, 127723, 127756, 127822, 127894, 127900, 127930, 128009, 128028, 128070, 128076, 128143, 128160, 128167, 128173, 128221, 128229, 128263, 128274, 128295, 128325, 128384, 128421, 128489, 128551, 128607, 128663, 128701, 128707, 128740, 128806, 128878, 128884, 128914, 128993, 129012, 129054, 129060, 129127, 129144, 129151, 129374, 129417, 129526, 129606, 129635, 129657, 129762, 129791, 129896, 129960, 130024, 130053, 130128, 130157, 130182, 130235, 130343, 130428, 130533, 130713, 130742, 130772, 130797, 130822, 130849, 130901, 130989, 131098, 131129, 131180, 131210, 131270, 131331, 131363, 131521, 131624, 131709, 131770, 131796, 131824, 131853, 131921, 131952, 131985, 132064, 132176, 132236, 132303, 132381, 132410, 132436, 132510, 132539, 132607, 132688, 132740, 132770, 132875, 132988, 133056, 133161, 133196, 133235, 133274, 133311, 133363, 133394, 133527, 133551, 133589, 133622, 133687, 133792, 133819, 133884, 133915, 133939, 133963, 134024, 134053, 134105, 134133, 134185, 134218, 134243, 134293, 134316, 134346, 134380, 134403, 134429, 134452, 134478, 134501, 134561, 134590, 134595, 134700, 134813, 134838, 134884, 134965, 135001, 135075, 135180, 135222, 135312, 135405, 135434, 135539, 135568, 135597, 135637, 135662, 135767, 135837, 135942, 136036, 136141, 136246, 136275, 136314, 136365, 136434, 136502, 136525, 136613, 136642, 136664, 136775, 136832, 136861, 136905, 136950, 136977, 137008, 137037, 137069, 137117, 137148, 137215, 137244, 137349, 137374, 137397, 137466, 137508, 137531, 137603, 137712, 137737, 137803, 137828, 137899, 137926, 137967, 137998, 138066, 138171, 138212, 138243, 138591, 138648, 138753, 138867, 138932, 138984, 139021, 139050, 139081, 139134, 139163, 139228, 139333, 139362, 139424, 139526, 139631, 139660, 139770, 139814, 139843, 139891, 139927, 139952, 140010, 140041, 140050, 140139, 140168, 140284, 140313, 140399, 140430, 140544, 140604, 140709, 140738, 140812, 140872, 140922, 141002, 141031, 141131, 141160, 141231, 141297, 141329, 141353, 141485, 141585, 141839, 141944, 142038, 142111, 142181, 142209, 142233, 142263, 142287, 142322, 142360, 142390, 142495, 142524, 142552, 142583, 142607, 142680, 142795, 142855, 142960, 143033, 143053, 143081, 143131, 143159, 143192, 143220, 143330, 143431, 143492, 143582, 143622, 143651, 143694, 143799, 143856, 143894, 143958, 143987, 144061, 144107, 144137, 144184, 144282, 144311, 144350, 144465, 144491, 144527, 144660, 144697, 144764, 144793, 144848, 144869, 144897, 145119, 145179, 145206, 145236, 145261, 145339, 145364, 145458, 145490, 145542, 145572, 145637, 145673, 145703, 145727, 145974, 146070, 146113, 146210, 146260, 146352, 146451, 146502, 146564, 146697, 146719, 146758, 146804, 146835, 146893, 146998, 147027, 147060, 147114, 147143, 147282, 147308, 147354, 147383, 147488, 147519, 147554, 147665, 147695, 147768, 147802, 147833, 147896, 147937, 147966, 147994, 148017, 148062, 148167, 148195, 148224, 148253, 148325, 148430, 148507, 148548, 148601, 148650, 148673, 148742, 148810, 148830, 148856, 148881, 148902, 148977, 149003, 149057, 149105, 149133, 149228, 149293, 149317, 149357, 149397, 149420, 149474, 149523, 149585, 149618, 149647, 149769, 149793, 149862, 149886, 149946, 149975, 150145, 150260, 150339, 150472, 150532, 150561, 150596, 150695, 150724, 150780, 150932, 150976, 151006, 151048, 151104, 151148, 151178, 151200, 151244, 151273, 151327, 151356, 151414, 151443, 151512, 151629, 151664, 151734, 151839, 151868, 151896, 151942, 151971, 152018, 152116, 152145, 152250, 152279, 152348, 152429, 152448, 152471, 152481, 152530, 152561, 152584, 152627, 152683, 152724, 152799, 152913, 153018, 153152, 153178, 153203, 153297, 153333, 153360, 153420, 153449, 153484, 153522, 153547, 153566, 153614, 153715, 153766, 153789, 153849, 153900, 153926, 153994, 154021, 154044, 154095, 154164, 154224, 154253, 154279, 154318, 154405, 154434, 154455, 154507, 154620 ], "line_end_idx": [ 15, 38, 76, 159, 164, 202, 207, 282, 325, 330, 413, 418, 482, 488, 572, 576, 611, 647, 680, 710, 741, 775, 810, 847, 879, 912, 947, 984, 1019, 1043, 1065, 1087, 1110, 1132, 1136, 1161, 1165, 1199, 1203, 1227, 1278, 1338, 1342, 1414, 1464, 1504, 1526, 1530, 1560, 1596, 1631, 1685, 1689, 1720, 1774, 1778, 1830, 1887, 1934, 1981, 2024, 2030, 2036, 2042, 2046, 2076, 2080, 2140, 2194, 2198, 2233, 2294, 2342, 2346, 2398, 2450, 2503, 2557, 2564, 2569, 2576, 2581, 2612, 2617, 2648, 2704, 2760, 2816, 2872, 2930, 2988, 3046, 3051, 3113, 3170, 3175, 3182, 3187, 3225, 3280, 3285, 3347, 3386, 3418, 3473, 3483, 3539, 3546, 3553, 3558, 3563, 3595, 3632, 3637, 3671, 3678, 3683, 3688, 3693, 3698, 3703, 3729, 3736, 3741, 3777, 3858, 3878, 3883, 3964, 4024, 4029, 4109, 4148, 4153, 4158, 4229, 4234, 4239, 4298, 4303, 4310, 4315, 4351, 4432, 4452, 4457, 4538, 4598, 4603, 4683, 4722, 4729, 4734, 4740, 4745, 4776, 4809, 4856, 4862, 4867, 4899, 4928, 5009, 5014, 5020, 5025, 5098, 5129, 5134, 5170, 5232, 5274, 5279, 5284, 5289, 5338, 5345, 5350, 5356, 5361, 5441, 5472, 5477, 5513, 5575, 5617, 5622, 5627, 5656, 5661, 5668, 5674, 5679, 5764, 5798, 5855, 5860, 5898, 5917, 5922, 6005, 6088, 6151, 6235, 6312, 6337, 6343, 6348, 6357, 6372, 6387, 6412, 6417, 6489, 6570, 6647, 6697, 6712, 6731, 6749, 6756, 6761, 6781, 6801, 6821, 6836, 6855, 6873, 6887, 6906, 6913, 6919, 6924, 6956, 6986, 7034, 7084, 7166, 7249, 7328, 7408, 7485, 7567, 7644, 7655, 7731, 7805, 7873, 7949, 8013, 8081, 8133, 8140, 8145, 8202, 8208, 8213, 8276, 8283, 8330, 8402, 8483, 8504, 8573, 8612, 8642, 8665, 8670, 8707, 8744, 8788, 8793, 8848, 8888, 8934, 8975, 9027, 9075, 9080, 9096, 9119, 9124, 9199, 9204, 9234, 9287, 9292, 9334, 9387, 9442, 9479, 9484, 9562, 9591, 9664, 9728, 9751, 9799, 9806, 9813, 9818, 9841, 9847, 9852, 9919, 9926, 9963, 10027, 10034, 10113, 10193, 10274, 10334, 10405, 10410, 10426, 10445, 10450, 10485, 10513, 10537, 10542, 10626, 10652, 10671, 10676, 10699, 10704, 10722, 10728, 10733, 10797, 10842, 10922, 10953, 10994, 11021, 11026, 11031, 11046, 11065, 11070, 11105, 11133, 11157, 11162, 11239, 11266, 11349, 11390, 11395, 11414, 11420, 11425, 11481, 11543, 11580, 11599, 11604, 11648, 11688, 11693, 11737, 11777, 11782, 11801, 11807, 11812, 11868, 11875, 11922, 12000, 12082, 12102, 12141, 12171, 12194, 12199, 12233, 12238, 12269, 12292, 12297, 12334, 12371, 12376, 12449, 12491, 12533, 12575, 12617, 12667, 12672, 12705, 12739, 12765, 12770, 12847, 12928, 12945, 12997, 13048, 13068, 13089, 13094, 13148, 13218, 13239, 13298, 13368, 13389, 13394, 13422, 13429, 13434, 13515, 13552, 13604, 13675, 13695, 13716, 13721, 13775, 13845, 13866, 13925, 13995, 14016, 14021, 14049, 14056, 14061, 14132, 14201, 14224, 14253, 14298, 14318, 14339, 14360, 14412, 14432, 14453, 14474, 14526, 14546, 14567, 14588, 14640, 14660, 14681, 14702, 14754, 14774, 14795, 14816, 14868, 14888, 14909, 14930, 14982, 15002, 15023, 15044, 15096, 15116, 15137, 15158, 15165, 15172, 15177, 15244, 15271, 15294, 15299, 15347, 15352, 15383, 15410, 15442, 15461, 15486, 15505, 15512, 15517, 15571, 15644, 15651, 15656, 15679, 15685, 15690, 15767, 15806, 15824, 15841, 15881, 15886, 15904, 15921, 15936, 15941, 15994, 16019, 16064, 16114, 16119, 16161, 16216, 16272, 16317, 16322, 16364, 16447, 16518, 16556, 16621, 16690, 16743, 16750, 16755, 16796, 16865, 16929, 16997, 17050, 17056, 17061, 17100, 17134, 17139, 17212, 17237, 17314, 17372, 17383, 17388, 17415, 17421, 17426, 17501, 17525, 17564, 17618, 17653, 17681, 17705, 17755, 17760, 17790, 17813, 17818, 17834, 17912, 17952, 17986, 18031, 18054, 18059, 18077, 18132, 18196, 18202, 18207, 18246, 18280, 18285, 18335, 18358, 18363, 18441, 18447, 18452, 18532, 18589, 18596, 18643, 18715, 18796, 18836, 18917, 18934, 18941, 19021, 19044, 19083, 19117, 19122, 19153, 19190, 19227, 19232, 19301, 19337, 19379, 19420, 19490, 19532, 19595, 19600, 19620, 19643, 19648, 19710, 19733, 19738, 19806, 19885, 19890, 19918, 19977, 20002, 20071, 20101, 20168, 20194, 20245, 20252, 20259, 20266, 20271, 20348, 20371, 20376, 20454, 20460, 20465, 20470, 20509, 20543, 20548, 20625, 20648, 20653, 20731, 20737, 20742, 20805, 20844, 20849, 20868, 20890, 20925, 20947, 20969, 20991, 21028, 21051, 21074, 21097, 21136, 21164, 21171, 21177, 21182, 21216, 21221, 21271, 21294, 21299, 21380, 21403, 21408, 21484, 21526, 21532, 21537, 21571, 21576, 21626, 21662, 21729, 21796, 21863, 21930, 21998, 22066, 22134, 22202, 22281, 22362, 22381, 22418, 22423, 22464, 22487, 22492, 22571, 22589, 22594, 22653, 22673, 22739, 22760, 22770, 22793, 22798, 22835, 22872, 22914, 22956, 22961, 23002, 23078, 23098, 23144, 23220, 23240, 23299, 23338, 23343, 23393, 23416, 23421, 23483, 23530, 23593, 23600, 23605, 23628, 23634, 23639, 23678, 23712, 23717, 23789, 23825, 23875, 23935, 23972, 24009, 24029, 24034, 24052, 24108, 24126, 24136, 24159, 24164, 24204, 24279, 24307, 24314, 24319, 24342, 24348, 24353, 24365, 24399, 24417, 24422, 24453, 24473, 24527, 24539, 24558, 24611, 24623, 24643, 24693, 24713, 24767, 24779, 24799, 24854, 24874, 24929, 24953, 24996, 25016, 25065, 25077, 25099, 25140, 25153, 25161, 25167, 25194, 25243, 25283, 25310, 25362, 25385, 25403, 25411, 25417, 25424, 25430, 25467, 25499, 25514, 25548, 25583, 25614, 25670, 25701, 25757, 25788, 25844, 25875, 25931, 25962, 26018, 26048, 26103, 26133, 26188, 26218, 26273, 26303, 26358, 26388, 26443, 26476, 26510, 26543, 26577, 26612, 26648, 26683, 26719, 26758, 26799, 26850, 26889, 26930, 26981, 27020, 27061, 27112, 27151, 27192, 27243, 27283, 27325, 27375, 27415, 27457, 27507, 27540, 27574, 27607, 27641, 27676, 27712, 27747, 27783, 27808, 27848, 27873, 27913, 27954, 28003, 28043, 28091, 28132, 28180, 28220, 28267, 28275, 28282, 28288, 28355, 28410, 28452, 28481, 28501, 28507, 28555, 28577, 28597, 28603, 28678, 28743, 28763, 28769, 28842, 28861, 28918, 28925, 28931, 28964, 29012, 29072, 29139, 29202, 29231, 29260, 29344, 29393, 29407, 29414, 29420, 29504, 29550, 29556, 29614, 29667, 29673, 29752, 29772, 29832, 29870, 29876, 29914, 29993, 30051, 30057, 30096, 30178, 30210, 30273, 30345, 30351, 30384, 30409, 30415, 30492, 30537, 30579, 30586, 30592, 30677, 30725, 30731, 30789, 30843, 30849, 30934, 30954, 31035, 31073, 31119, 31165, 31171, 31204, 31229, 31235, 31272, 31286, 31366, 31421, 31427, 31465, 31547, 31615, 31654, 31709, 31716, 31722, 31798, 31828, 31861, 31926, 31932, 31980, 32000, 32059, 32102, 32124, 32130, 32147, 32200, 32217, 32270, 32276, 32304, 32334, 32340, 32375, 32418, 32425, 32431, 32504, 32545, 32618, 32659, 32732, 32739, 32745, 32827, 32892, 32957, 33022, 33029, 33035, 33119, 33145, 33153, 33189, 33200, 33246, 33292, 33319, 33340, 33361, 33399, 33407, 33487, 33507, 33579, 33604, 33610, 33648, 33670, 33715, 33721, 33772, 33778, 33825, 33876, 33882, 33925, 33970, 33981, 34008, 34014, 34052, 34109, 34152, 34158, 34200, 34226, 34253, 34259, 34281, 34315, 34321, 34399, 34418, 34480, 34486, 34508, 34563, 34646, 34652, 34675, 34693, 34699, 34749, 34808, 34851, 34858, 34864, 34937, 35021, 35041, 35080, 35119, 35158, 35221, 35227, 35288, 35320, 35326, 35347, 35354, 35360, 35446, 35488, 35519, 35598, 35618, 35624, 35705, 35784, 35800, 35844, 35865, 35871, 35907, 35955, 35984, 36004, 36035, 36048, 36069, 36075, 36157, 36221, 36227, 36270, 36343, 36349, 36383, 36437, 36492, 36549, 36557, 36563, 36584, 36591, 36597, 36681, 36712, 36742, 36793, 36832, 36839, 36845, 36916, 36959, 36987, 37027, 37067, 37095, 37101, 37134, 37211, 37240, 37246, 37320, 37388, 37430, 37505, 37513, 37519, 37593, 37613, 37634, 37677, 37683, 37761, 37819, 37877, 37937, 37943, 37986, 38059, 38065, 38094, 38155, 38161, 38182, 38189, 38195, 38228, 38252, 38291, 38314, 38334, 38340, 38425, 38448, 38481, 38547, 38607, 38613, 38687, 38704, 38780, 38786, 38807, 38848, 38854, 38883, 38919, 38960, 39018, 39026, 39034, 39040, 39072, 39133, 39139, 39221, 39258, 39289, 39351, 39357, 39422, 39428, 39508, 39524, 39532, 39538, 39608, 39615, 39621, 39641, 39680, 39719, 39798, 39862, 39941, 39962, 40043, 40049, 40111, 40118, 40124, 40163, 40183, 40234, 40319, 40325, 40390, 40425, 40432, 40438, 40458, 40497, 40556, 40623, 40684, 40690, 40765, 40772, 40778, 40849, 40882, 40902, 40986, 41013, 41028, 41052, 41086, 41138, 41177, 41234, 41273, 41330, 41369, 41426, 41465, 41522, 41559, 41614, 41651, 41706, 41744, 41800, 41838, 41894, 41933, 41990, 42023, 42074, 42108, 42160, 42193, 42244, 42278, 42330, 42363, 42414, 42448, 42500, 42535, 42570, 42605, 42640, 42719, 42745, 42781, 42817, 42853, 42889, 42968, 43005, 43039, 43118, 43144, 43179, 43258, 43295, 43330, 43365, 43400, 43435, 43475, 43511, 43547, 43583, 43619, 43662, 43699, 43736, 43773, 43812, 43892, 43931, 43979, 44044, 44096, 44137, 44187, 44233, 44278, 44286, 44323, 44360, 44397, 44436, 44516, 44555, 44603, 44668, 44720, 44761, 44811, 44857, 44902, 44910, 44945, 45028, 45073, 45109, 45173, 45228, 45254, 45288, 45371, 45416, 45451, 45515, 45570, 45596, 45631, 45666, 45701, 45738, 45777, 45828, 45834, 45899, 45943, 45977, 45985, 46021, 46057, 46093, 46129, 46205, 46235, 46269, 46303, 46337, 46371, 46444, 46470, 46504, 46577, 46603, 46638, 46710, 46774, 46818, 46844, 46880, 46953, 47017, 47072, 47098, 47133, 47168, 47203, 47240, 47279, 47330, 47336, 47400, 47444, 47478, 47486, 47522, 47558, 47594, 47630, 47705, 47735, 47768, 47801, 47834, 47867, 47937, 47963, 47996, 48066, 48092, 48126, 48160, 48194, 48228, 48298, 48336, 48371, 48406, 48441, 48476, 48546, 48601, 48637, 48673, 48709, 48745, 48815, 48853, 48890, 48927, 48964, 49001, 49071, 49126, 49162, 49198, 49234, 49270, 49340, 49379, 49416, 49453, 49490, 49527, 49597, 49647, 49683, 49719, 49755, 49791, 49861, 49899, 49936, 49973, 50010, 50047, 50117, 50172, 50208, 50244, 50280, 50316, 50386, 50425, 50462, 50499, 50536, 50573, 50643, 50693, 50730, 50767, 50804, 50841, 50874, 50951, 50964, 51037, 51101, 51162, 51208, 51234, 51242, 51279, 51316, 51353, 51390, 51423, 51500, 51513, 51586, 51650, 51724, 51799, 51878, 51939, 51985, 52011, 52019, 52055, 52091, 52127, 52163, 52243, 52269, 52305, 52341, 52377, 52413, 52493, 52519, 52554, 52589, 52656, 52736, 52762, 52839, 52874, 52909, 52979, 53018, 53053, 53088, 53158, 53197, 53232, 53267, 53337, 53376, 53411, 53446, 53516, 53555, 53590, 53625, 53695, 53732, 53768, 53804, 53874, 53913, 53949, 53985, 54055, 54094, 54130, 54166, 54236, 54275, 54310, 54345, 54415, 54453, 54489, 54525, 54595, 54634, 54669, 54704, 54771, 54851, 54877, 54915, 54953, 55020, 55046, 55084, 55122, 55189, 55215, 55250, 55285, 55320, 55357, 55396, 55422, 55428, 55510, 55540, 55589, 55597, 55633, 55671, 55738, 55777, 55803, 55857, 55926, 55934, 55970, 56006, 56088, 56124, 56160, 56227, 56291, 56326, 56361, 56428, 56508, 56534, 56570, 56608, 56675, 56714, 56787, 56834, 56880, 56888, 56924, 56960, 57042, 57078, 57114, 57196, 57231, 57266, 57333, 57413, 57439, 57478, 57517, 57584, 57610, 57649, 57688, 57755, 57781, 57817, 57853, 57889, 57925, 57991, 58036, 58071, 58106, 58141, 58176, 58241, 58286, 58322, 58358, 58394, 58430, 58496, 58541, 58576, 58611, 58646, 58681, 58746, 58791, 58828, 58865, 58902, 58939, 59020, 59084, 59120, 59156, 59192, 59230, 59280, 59299, 59326, 59379, 59431, 59483, 59535, 59591, 59599, 59678, 59714, 59766, 59832, 59895, 59936, 59944, 59978, 60012, 60046, 60080, 60129, 60161, 60196, 60235, 60307, 60353, 60399, 60407, 60443, 60479, 60515, 60553, 60592, 60664, 60710, 60756, 60764, 60800, 60836, 60872, 60908, 60974, 61019, 61055, 61091, 61127, 61163, 61229, 61274, 61311, 61348, 61385, 61422, 61488, 61550, 61587, 61624, 61661, 61698, 61764, 61820, 61856, 61892, 61928, 61964, 62030, 62075, 62111, 62147, 62183, 62219, 62285, 62330, 62367, 62404, 62441, 62478, 62544, 62606, 62643, 62680, 62717, 62754, 62820, 62876, 62912, 62948, 62984, 63020, 63100, 63126, 63162, 63198, 63234, 63270, 63350, 63376, 63411, 63446, 63481, 63516, 63595, 63621, 63657, 63693, 63729, 63767, 63806, 63878, 63924, 63970, 63978, 64013, 64048, 64083, 64118, 64199, 64235, 64301, 64346, 64402, 64410, 64447, 64513, 64538, 64575, 64631, 64639, 64672, 64750, 64776, 64810, 64869, 64925, 64961, 64997, 65033, 65069, 65135, 65180, 65216, 65252, 65288, 65324, 65390, 65435, 65470, 65505, 65540, 65575, 65657, 65693, 65729, 65765, 65801, 65837, 65873, 65909, 65947, 65997, 66016, 66043, 66079, 66131, 66167, 66220, 66256, 66309, 66345, 66398, 66454, 66462, 66541, 66577, 66629, 66653, 66661, 66695, 66729, 66765, 66844, 66880, 66932, 66996, 67041, 67049, 67084, 67119, 67154, 67191, 67241, 67260, 67287, 67339, 67390, 67441, 67492, 67548, 67556, 67635, 67671, 67723, 67747, 67755, 67789, 67823, 67857, 67891, 67970, 68003, 68038, 68073, 68108, 68143, 68203, 68259, 68295, 68331, 68367, 68403, 68483, 68562, 68621, 68686, 68751, 68807, 68833, 68870, 68907, 68944, 68981, 69046, 69101, 69127, 69161, 69195, 69229, 69263, 69342, 69375, 69410, 69445, 69480, 69515, 69575, 69631, 69667, 69703, 69739, 69777, 69827, 69846, 69873, 69925, 69978, 70031, 70084, 70140, 70148, 70227, 70263, 70315, 70339, 70347, 70381, 70415, 70449, 70483, 70562, 70595, 70630, 70665, 70700, 70735, 70795, 70851, 70887, 70923, 70959, 70997, 71047, 71066, 71093, 71145, 71198, 71251, 71304, 71360, 71368, 71447, 71483, 71535, 71559, 71567, 71602, 71637, 71672, 71707, 71786, 71812, 71848, 71884, 71920, 71956, 72016, 72072, 72107, 72142, 72177, 72212, 72277, 72341, 72375, 72454, 72480, 72515, 72575, 72631, 72671, 72724, 72785, 72793, 72801, 72808, 72814, 72897, 72937, 72957, 73000, 73043, 73085, 73124, 73168, 73174, 73251, 73328, 73371, 73404, 73469, 73475, 73542, 73618, 73647, 73654, 73660, 73730, 73763, 73842, 73864, 73879, 73903, 73936, 73987, 74022, 74075, 74110, 74163, 74200, 74255, 74293, 74349, 74386, 74441, 74476, 74529, 74571, 74631, 74671, 74729, 74769, 74827, 74868, 74927, 74968, 75027, 75067, 75125, 75165, 75223, 75263, 75321, 75361, 75419, 75460, 75519, 75561, 75621, 75662, 75721, 75763, 75823, 75856, 75889, 75922, 75955, 76012, 76020, 76027, 76033, 76117, 76157, 76177, 76220, 76261, 76304, 76346, 76390, 76396, 76473, 76550, 76593, 76626, 76691, 76697, 76764, 76770, 76847, 76876, 76883, 76889, 76956, 76989, 77068, 77090, 77105, 77129, 77162, 77195, 77228, 77261, 77319, 77327, 77334, 77340, 77405, 77486, 77571, 77586, 77647, 77694, 77767, 77773, 77816, 77822, 77870, 77910, 77930, 77938, 77944, 77963, 77970, 77976, 78047, 78055, 78139, 78219, 78304, 78386, 78404, 78440, 78508, 78528, 78567, 78606, 78646, 78652, 78687, 78711, 78717, 78748, 78787, 78835, 78909, 78941, 78949, 78955, 78972, 78979, 78985, 79040, 79065, 79084, 79119, 79138, 79175, 79194, 79214, 79221, 79227, 79285, 79333, 79352, 79372, 79379, 79385, 79462, 79479, 79487, 79536, 79620, 79695, 79713, 79797, 79880, 79912, 79959, 80040, 80095, 80160, 80193, 80254, 80293, 80313, 80349, 80378, 80403, 80409, 80467, 80491, 80497, 80567, 80590, 80644, 80705, 80780, 80806, 80830, 80836, 80904, 80980, 81025, 81071, 81088, 81094, 81114, 81120, 81150, 81165, 81189, 81203, 81232, 81245, 81260, 81289, 81302, 81317, 81346, 81359, 81374, 81435, 81459, 81467, 81473, 81547, 81613, 81619, 81669, 81698, 81768, 81774, 81795, 81833, 81850, 81905, 81977, 82057, 82088, 82129, 82135, 82167, 82173, 82228, 82272, 82319, 82389, 82416, 82457, 82465, 82486, 82494, 82500, 82524, 82531, 82537, 82590, 82598, 82678, 82763, 82771, 82852, 82918, 82997, 83048, 83056, 83077, 83135, 83182, 83218, 83241, 83270, 83303, 83346, 83382, 83409, 83455, 83461, 83491, 83515, 83521, 83562, 83619, 83647, 83653, 83717, 83797, 83820, 83846, 83877, 83901, 83909, 83915, 83985, 84063, 84094, 84121, 84127, 84201, 84230, 84278, 84302, 84310, 84318, 84324, 84397, 84421, 84458, 84489, 84495, 84516, 84531, 84537, 84554, 84578, 84586, 84592, 84612, 84662, 84724, 84731, 84737, 84806, 84892, 84925, 84942, 84970, 85031, 85054, 85060, 85085, 85128, 85148, 85192, 85198, 85277, 85333, 85399, 85427, 85435, 85454, 85461, 85467, 85521, 85529, 85570, 85593, 85629, 85637, 85719, 85778, 85842, 85878, 85905, 85946, 85952, 85979, 86017, 86038, 86060, 86073, 86081, 86089, 86095, 86179, 86189, 86196, 86202, 86257, 86265, 86327, 86335, 86415, 86452, 86475, 86502, 86559, 86580, 86612, 86648, 86656, 86738, 86798, 86834, 86861, 86902, 86908, 86926, 86944, 86987, 87026, 87032, 87113, 87161, 87217, 87247, 87321, 87351, 87362, 87386, 87392, 87472, 87520, 87580, 87610, 87688, 87718, 87729, 87753, 87759, 87827, 87834, 87840, 87895, 87903, 87964, 87972, 88052, 88089, 88112, 88141, 88198, 88219, 88251, 88289, 88297, 88379, 88439, 88475, 88502, 88543, 88549, 88567, 88585, 88628, 88667, 88673, 88753, 88801, 88857, 88887, 88965, 88995, 89006, 89030, 89036, 89115, 89163, 89223, 89253, 89335, 89365, 89376, 89400, 89406, 89474, 89481, 89487, 89541, 89549, 89635, 89656, 89664, 89743, 89780, 89803, 89830, 89887, 89908, 89940, 89976, 89984, 90066, 90126, 90162, 90189, 90230, 90236, 90254, 90272, 90315, 90354, 90360, 90443, 90507, 90563, 90593, 90667, 90697, 90708, 90732, 90738, 90820, 90884, 90944, 90974, 91052, 91082, 91093, 91117, 91123, 91190, 91197, 91203, 91257, 91265, 91348, 91372, 91380, 91459, 91496, 91523, 91556, 91629, 91650, 91690, 91736, 91744, 91826, 91886, 91922, 91949, 91990, 91996, 92042, 92060, 92078, 92121, 92160, 92166, 92249, 92313, 92376, 92406, 92491, 92521, 92532, 92556, 92562, 92644, 92708, 92775, 92805, 92890, 92900, 92930, 92941, 92965, 92971, 93038, 93045, 93051, 93106, 93114, 93192, 93200, 93280, 93318, 93341, 93368, 93425, 93446, 93483, 93524, 93532, 93614, 93674, 93710, 93737, 93778, 93784, 93802, 93820, 93863, 93925, 93964, 93970, 94026, 94056, 94130, 94160, 94171, 94195, 94201, 94255, 94285, 94357, 94387, 94398, 94422, 94428, 94496, 94503, 94509, 94564, 94572, 94649, 94657, 94737, 94775, 94798, 94827, 94884, 94905, 94942, 94985, 94993, 95075, 95135, 95171, 95198, 95239, 95245, 95263, 95281, 95324, 95386, 95425, 95431, 95487, 95517, 95595, 95625, 95636, 95660, 95666, 95720, 95750, 95826, 95856, 95867, 95891, 95897, 95965, 95972, 95978, 96018, 96026, 96107, 96188, 96271, 96352, 96437, 96522, 96558, 96585, 96604, 96623, 96687, 96743, 96775, 96807, 96827, 96882, 96888, 96935, 96966, 96994, 97000, 97042, 97068, 97125, 97151, 97159, 97165, 97248, 97259, 97322, 97328, 97392, 97398, 97438, 97469, 97500, 97530, 97567, 97595, 97632, 97643, 97725, 97731, 97806, 97871, 97932, 97972, 98011, 98045, 98117, 98188, 98195, 98201, 98284, 98316, 98383, 98416, 98481, 98520, 98526, 98561, 98585, 98591, 98646, 98682, 98688, 98733, 98779, 98785, 98856, 98880, 98940, 99004, 99026, 99099, 99120, 99193, 99214, 99286, 99307, 99379, 99400, 99473, 99494, 99567, 99588, 99659, 99680, 99744, 99751, 99757, 99815, 99852, 99866, 99896, 99908, 99922, 99945, 99960, 99980, 99997, 100012, 100032, 100048, 100092, 100098, 100166, 100226, 100264, 100319, 100363, 100431, 100499, 100525, 100551, 100578, 100584, 100655, 100737, 100755, 100761, 100786, 100815, 100844, 100875, 100906, 100912, 100966, 101027, 101082, 101149, 101155, 101175, 101231, 101295, 101332, 101401, 101407, 101427, 101483, 101547, 101584, 101590, 101629, 101690, 101723, 101742, 101761, 101780, 101800, 101806, 101873, 101892, 101899, 101905, 101973, 102047, 102061, 102092, 102104, 102118, 102143, 102159, 102174, 102194, 102211, 102226, 102246, 102262, 102305, 102311, 102379, 102439, 102477, 102532, 102576, 102644, 102712, 102738, 102764, 102791, 102797, 102868, 102950, 102968, 102974, 102999, 103028, 103057, 103088, 103119, 103125, 103176, 103218, 103259, 103279, 103285, 103305, 103361, 103425, 103462, 103531, 103537, 103557, 103613, 103677, 103714, 103720, 103759, 103820, 103853, 103872, 103891, 103910, 103930, 103936, 104003, 104022, 104029, 104035, 104080, 104088, 104123, 104134, 104164, 104186, 104194, 104279, 104364, 104448, 104505, 104542, 104610, 104648, 104695, 104742, 104791, 104797, 104820, 104844, 104882, 104949, 105028, 105099, 105105, 105170, 105178, 105184, 105266, 105281, 105332, 105389, 105425, 105431, 105513, 105595, 105603, 105609, 105676, 105693, 105700, 105706, 105751, 105759, 105794, 105805, 105835, 105864, 105872, 105957, 106037, 106110, 106167, 106204, 106210, 106278, 106325, 106372, 106425, 106463, 106469, 106490, 106572, 106585, 106660, 106666, 106745, 106827, 106835, 106841, 106908, 106925, 106932, 106938, 106985, 106993, 107039, 107050, 107088, 107128, 107187, 107224, 107292, 107330, 107377, 107427, 107476, 107523, 107574, 107631, 107667, 107673, 107735, 107752, 107770, 107799, 107855, 107876, 107896, 107914, 107932, 107938, 108005, 108022, 108029, 108035, 108082, 108090, 108127, 108138, 108176, 108216, 108275, 108312, 108318, 108386, 108424, 108471, 108521, 108570, 108617, 108692, 108698, 108760, 108777, 108795, 108824, 108880, 108901, 108921, 108939, 108957, 108963, 109030, 109047, 109054, 109060, 109124, 109132, 109153, 109213, 109224, 109266, 109317, 109367, 109402, 109451, 109459, 109487, 109547, 109558, 109601, 109643, 109694, 109739, 109774, 109823, 109889, 109961, 109986, 110054, 110092, 110139, 110193, 110245, 110299, 110305, 110355, 110404, 110445, 110520, 110589, 110662, 110690, 110719, 110747, 110779, 110794, 110837, 110851, 110874, 110907, 110938, 110976, 110989, 111003, 111026, 111059, 111090, 111128, 111141, 111155, 111178, 111211, 111242, 111280, 111293, 111307, 111330, 111363, 111394, 111432, 111445, 111453, 111459, 111477, 111535, 111597, 111614, 111639, 111705, 111727, 111735, 111741, 111791, 111824, 111888, 111944, 111967, 111995, 112021, 112029, 112035, 112105, 112167, 112225, 112250, 112275, 112313, 112319, 112381, 112399, 112447, 112501, 112523, 112540, 112565, 112583, 112598, 112647, 112702, 112724, 112749, 112767, 112775, 112781, 112847, 112932, 112968, 113032, 113117, 113133, 113199, 113223, 113277, 113299, 113321, 113360, 113366, 113433, 113450, 113457, 113463, 113508, 113516, 113548, 113559, 113585, 113633, 113663, 113720, 113757, 113825, 113863, 113910, 113957, 114009, 114064, 114102, 114154, 114209, 114247, 114253, 114316, 114379, 114398, 114416, 114445, 114525, 114531, 114598, 114615, 114622, 114628, 114673, 114681, 114713, 114724, 114750, 114798, 114828, 114885, 114922, 114928, 114996, 115034, 115081, 115128, 115204, 115280, 115286, 115349, 115412, 115431, 115449, 115478, 115558, 115564, 115631, 115648, 115655, 115661, 115737, 115755, 115763, 115809, 115820, 115851, 115876, 115884, 115965, 116047, 116062, 116125, 116162, 116168, 116236, 116274, 116321, 116368, 116431, 116469, 116475, 116554, 116623, 116670, 116708, 116788, 116842, 116873, 116932, 117005, 117011, 117090, 117115, 117189, 117252, 117269, 117287, 117316, 117332, 117340, 117414, 117432, 117450, 117469, 117515, 117521, 117549, 117566, 117573, 117579, 117664, 117672, 117719, 117730, 117755, 117782, 117790, 117864, 117938, 118017, 118054, 118132, 118154, 118217, 118254, 118260, 118328, 118366, 118413, 118419, 118498, 118567, 118614, 118652, 118732, 118786, 118817, 118823, 118882, 118937, 118943, 118975, 119054, 119111, 119144, 119150, 119175, 119249, 119332, 119348, 119356, 119362, 119429, 119435, 119463, 119480, 119487, 119493, 119538, 119546, 119595, 119603, 119683, 119717, 119725, 119808, 119880, 119954, 120030, 120108, 120185, 120193, 120216, 120224, 120269, 120280, 120305, 120335, 120371, 120379, 120415, 120423, 120468, 120479, 120504, 120534, 120561, 120597, 120633, 120673, 120709, 120717, 120753, 120761, 120806, 120817, 120843, 120873, 120913, 120951, 120959, 121043, 121113, 121182, 121250, 121323, 121356, 121420, 121449, 121477, 121483, 121562, 121645, 121658, 121664, 121727, 121791, 121797, 121835, 121882, 121929, 121935, 122003, 122081, 122122, 122191, 122232, 122252, 122309, 122381, 122387, 122448, 122509, 122574, 122642, 122671, 122677, 122706, 122768, 122842, 122921, 123000, 123061, 123082, 123104, 123122, 123183, 123205, 123227, 123245, 123266, 123274, 123280, 123301, 123380, 123440, 123460, 123481, 123502, 123510, 123516, 123599, 123605, 123633, 123650, 123657, 123663, 123709, 123717, 123775, 123783, 123862, 123907, 123915, 123998, 124070, 124144, 124220, 124298, 124377, 124402, 124410, 124433, 124441, 124487, 124498, 124527, 124559, 124584, 124592, 124625, 124633, 124679, 124690, 124719, 124752, 124789, 124815, 124823, 124856, 124864, 124910, 124921, 124950, 124983, 125019, 125047, 125084, 125120, 125185, 125214, 125242, 125248, 125327, 125410, 125423, 125429, 125492, 125556, 125562, 125600, 125647, 125694, 125700, 125768, 125809, 125878, 125919, 125939, 125996, 126072, 126078, 126156, 126185, 126191, 126263, 126284, 126352, 126426, 126434, 126440, 126499, 126560, 126600, 126660, 126672, 126749, 126818, 126824, 126853, 126915, 126976, 126996, 127014, 127072, 127094, 127117, 127125, 127131, 127159, 127176, 127183, 127189, 127237, 127245, 127279, 127290, 127311, 127341, 127400, 127437, 127505, 127567, 127623, 127679, 127717, 127723, 127756, 127822, 127894, 127900, 127930, 128009, 128028, 128070, 128076, 128143, 128160, 128167, 128173, 128221, 128229, 128263, 128274, 128295, 128325, 128384, 128421, 128489, 128551, 128607, 128663, 128701, 128707, 128740, 128806, 128878, 128884, 128914, 128993, 129012, 129054, 129060, 129127, 129144, 129151, 129374, 129417, 129526, 129606, 129635, 129657, 129762, 129791, 129896, 129960, 130024, 130053, 130128, 130157, 130182, 130235, 130343, 130428, 130533, 130713, 130742, 130772, 130797, 130822, 130849, 130901, 130989, 131098, 131129, 131180, 131210, 131270, 131331, 131363, 131521, 131624, 131709, 131770, 131796, 131824, 131853, 131921, 131952, 131985, 132064, 132176, 132236, 132303, 132381, 132410, 132436, 132510, 132539, 132607, 132688, 132740, 132770, 132875, 132988, 133056, 133161, 133196, 133235, 133274, 133311, 133363, 133394, 133527, 133551, 133589, 133622, 133687, 133792, 133819, 133884, 133915, 133939, 133963, 134024, 134053, 134105, 134133, 134185, 134218, 134243, 134293, 134316, 134346, 134380, 134403, 134429, 134452, 134478, 134501, 134561, 134590, 134595, 134700, 134813, 134838, 134884, 134965, 135001, 135075, 135180, 135222, 135312, 135405, 135434, 135539, 135568, 135597, 135637, 135662, 135767, 135837, 135942, 136036, 136141, 136246, 136275, 136314, 136365, 136434, 136502, 136525, 136613, 136642, 136664, 136775, 136832, 136861, 136905, 136950, 136977, 137008, 137037, 137069, 137117, 137148, 137215, 137244, 137349, 137374, 137397, 137466, 137508, 137531, 137603, 137712, 137737, 137803, 137828, 137899, 137926, 137967, 137998, 138066, 138171, 138212, 138243, 138591, 138648, 138753, 138867, 138932, 138984, 139021, 139050, 139081, 139134, 139163, 139228, 139333, 139362, 139424, 139526, 139631, 139660, 139770, 139814, 139843, 139891, 139927, 139952, 140010, 140041, 140050, 140139, 140168, 140284, 140313, 140399, 140430, 140544, 140604, 140709, 140738, 140812, 140872, 140922, 141002, 141031, 141131, 141160, 141231, 141297, 141329, 141353, 141485, 141585, 141839, 141944, 142038, 142111, 142181, 142209, 142233, 142263, 142287, 142322, 142360, 142390, 142495, 142524, 142552, 142583, 142607, 142680, 142795, 142855, 142960, 143033, 143053, 143081, 143131, 143159, 143192, 143220, 143330, 143431, 143492, 143582, 143622, 143651, 143694, 143799, 143856, 143894, 143958, 143987, 144061, 144107, 144137, 144184, 144282, 144311, 144350, 144465, 144491, 144527, 144660, 144697, 144764, 144793, 144848, 144869, 144897, 145119, 145179, 145206, 145236, 145261, 145339, 145364, 145458, 145490, 145542, 145572, 145637, 145673, 145703, 145727, 145974, 146070, 146113, 146210, 146260, 146352, 146451, 146502, 146564, 146697, 146719, 146758, 146804, 146835, 146893, 146998, 147027, 147060, 147114, 147143, 147282, 147308, 147354, 147383, 147488, 147519, 147554, 147665, 147695, 147768, 147802, 147833, 147896, 147937, 147966, 147994, 148017, 148062, 148167, 148195, 148224, 148253, 148325, 148430, 148507, 148548, 148601, 148650, 148673, 148742, 148810, 148830, 148856, 148881, 148902, 148977, 149003, 149057, 149105, 149133, 149228, 149293, 149317, 149357, 149397, 149420, 149474, 149523, 149585, 149618, 149647, 149769, 149793, 149862, 149886, 149946, 149975, 150145, 150260, 150339, 150472, 150532, 150561, 150596, 150695, 150724, 150780, 150932, 150976, 151006, 151048, 151104, 151148, 151178, 151200, 151244, 151273, 151327, 151356, 151414, 151443, 151512, 151629, 151664, 151734, 151839, 151868, 151896, 151942, 151971, 152018, 152116, 152145, 152250, 152279, 152348, 152429, 152448, 152471, 152481, 152530, 152561, 152584, 152627, 152683, 152724, 152799, 152913, 153018, 153152, 153178, 153203, 153297, 153333, 153360, 153420, 153449, 153484, 153522, 153547, 153566, 153614, 153715, 153766, 153789, 153849, 153900, 153926, 153994, 154021, 154044, 154095, 154164, 154224, 154253, 154279, 154318, 154405, 154434, 154455, 154507, 154620, 154637 ] }

{ "red_pajama_v2": { "ccnet_original_length": 154637, "ccnet_original_nlines": 3941, "rps_doc_curly_bracket": 0.002431500004604459, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.0898795872926712, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0727924332022667, "rps_doc_frac_lines_end_with_ellipsis": 0.011415529996156693, "rps_doc_frac_no_alph_words": 0.5143348574638367, "rps_doc_frac_unique_words": 0.3796241879463196, "rps_doc_mean_word_length": 6.5745744705200195, "rps_doc_num_sentences": 1418, "rps_doc_symbol_to_word_ratio": 0.0036410600878298283, "rps_doc_unigram_entropy": 7.353488922119141, "rps_doc_word_count": 17030, "rps_doc_frac_chars_dupe_10grams": 0.03947661817073822, "rps_doc_frac_chars_dupe_5grams": 0.13484570384025574, "rps_doc_frac_chars_dupe_6grams": 0.10428258776664734, "rps_doc_frac_chars_dupe_7grams": 0.08634840697050095, "rps_doc_frac_chars_dupe_8grams": 0.07037913799285889, "rps_doc_frac_chars_dupe_9grams": 0.04981914162635803, "rps_doc_frac_chars_top_2gram": 0.008708080276846886, "rps_doc_frac_chars_top_3gram": 0.005689280107617378, "rps_doc_frac_chars_top_4gram": 0.008395479992032051, "rps_doc_books_importance": -16924.875, "rps_doc_books_importance_length_correction": -16924.875, "rps_doc_openwebtext_importance": -8800.1865234375, "rps_doc_openwebtext_importance_length_correction": -8800.1865234375, "rps_doc_wikipedia_importance": -6239.83447265625, "rps_doc_wikipedia_importance_length_correction": -6239.83447265625 }, "fasttext": { "dclm": 0.5959136486053467, "english": 0.24030305445194244, "fineweb_edu_approx": 2.3537797927856445, "eai_general_math": 0.6130691170692444, "eai_open_web_math": 0.07946628332138062, "eai_web_code": 0.6272284984588623 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.4", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-9,182,161,104,492,527,000

Can I inject Database values into CSS Hi, I am working on a site in which I want to allow basic themeing based on the user logged in. Essentially I just want to store some image urls and colours in MongoDB and then have these values inserted into the correct places in my code. The image urls are fairly straight forward I think. However I also want a nice clean way of changing colours across the site. I will be setting up my css so there are theme classes in place on relevant elements so really I just want to change the style definitions to change the colour. E.g. .bgColour1 { background-color: red; } what I really want is: .bgColour1 { background-color: <VARFROMDB>; } Then throughout the site the bgColour class will reflect the user’s choice for bgColour1. Before Meteor I would have done this inside <style></style> tags in the head. I’ve looked at pre-processors like LESS and SASS but I don’t think they suit the “on the fly” nature of this exercise. Any help would be much appreciated. :+1: 1 Like You’ll be able to do this with CSS Variables once they’re supported in more browsers: https://developer.mozilla.org/en-US/docs/Web/CSS/Using_CSS_variables In the meantime you can programmatically insert <style> elements into the <head>, which will be interpreted on the fly. For instance something like this should work: var $style = $("<style type='text/css'></style>"); $style.text(`body { background-color: ${varFromDb};`); $("head").append($style); It would be interesting to make a package that makes this reactive and declarative! 2 Likes If you have a predefined set of styles, you can just define these in CSS and then apply the class names dynamically. Even if you’re doing lots of mix and matching, just break up the classes into small components and apply them piecemeal. eg: class=“redBg blueBorder whiteFont” If you’re creating urls or styles dynamically (for bg images and such), you can apply the styles inline and use handlebar variables that way. If you want them applied to your whole site, just apply them to container level elements. Thanks rahul That solution should do nicely. Will try it out! Surprising that Meteor does not support CSS manipulation out of the box since it parses all files anyway. pcm, yes the handlebars solution could work, it’s just I think it is easier to manage, if elements and containers are only styled via class references rather than inline styling. Which is why i’d rather modify the class definition! :grin: Thank you both for answering :star: Hm, you could use something like https://github.com/jsstyles/jss You could use SASS with https://www.grooveui.com GrooveUI allows on the fly modification of SASS variables. Hello You can use styled components for this. (If you use React) It is integrated into our router with SSR built in (not for data depending on user tho) You’d have to use the develop branch but I can help you with it.

{ "url": "https://forums.meteor.com/t/can-i-inject-database-values-into-css/18437", "source_domain": "forums.meteor.com", "snapshot_id": "crawl=CC-MAIN-2022-21", "warc_metadata": { "Content-Length": "32685", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BYRCSEYVEFHJBVYBCLSLV75LQPO4V5TM", "WARC-Concurrent-To": "<urn:uuid:c17f0346-6a7f-4204-a015-68d42ac4b970>", "WARC-Date": "2022-05-19T15:47:07Z", "WARC-IP-Address": "64.71.144.203", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AMZGT6HKWMQ3JODZMKZXH6SYFJJOA6SU", "WARC-Record-ID": "<urn:uuid:ee3e91df-0b6f-4253-97fd-14f9740228fa>", "WARC-Target-URI": "https://forums.meteor.com/t/can-i-inject-database-values-into-css/18437", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:2cd8a983-d76f-4810-9cad-cbc19da3965a>" }, "warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-60\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 38, 39, 43, 44, 136, 137, 333, 334, 569, 570, 575, 576, 589, 615, 617, 618, 641, 642, 655, 689, 691, 692, 782, 783, 861, 862, 981, 982, 1018, 1019, 1024, 1025, 1032, 1033, 1188, 1189, 1355, 1356, 1407, 1462, 1488, 1489, 1573, 1574, 1582, 1583, 1821, 1822, 1861, 1862, 2094, 2095, 2108, 2109, 2158, 2159, 2265, 2266, 2505, 2506, 2542, 2543, 2608, 2609, 2658, 2659, 2718, 2719, 2725, 2726, 2785, 2786, 2874, 2875 ], "line_end_idx": [ 38, 39, 43, 44, 136, 137, 333, 334, 569, 570, 575, 576, 589, 615, 617, 618, 641, 642, 655, 689, 691, 692, 782, 783, 861, 862, 981, 982, 1018, 1019, 1024, 1025, 1032, 1033, 1188, 1189, 1355, 1356, 1407, 1462, 1488, 1489, 1573, 1574, 1582, 1583, 1821, 1822, 1861, 1862, 2094, 2095, 2108, 2109, 2158, 2159, 2265, 2266, 2505, 2506, 2542, 2543, 2608, 2609, 2658, 2659, 2718, 2719, 2725, 2726, 2785, 2786, 2874, 2875, 2939 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2939, "ccnet_original_nlines": 74, "rps_doc_curly_bracket": 0.0023817599285393953, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3888888955116272, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.04285714030265808, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.19365079700946808, "rps_doc_frac_unique_words": 0.5159235596656799, "rps_doc_mean_word_length": 4.8428874015808105, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.119405746459961, "rps_doc_word_count": 471, "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.01052169967442751, "rps_doc_frac_chars_top_3gram": 0.007891279645264149, "rps_doc_frac_chars_top_4gram": 0.009644890204071999, "rps_doc_books_importance": -259.8742980957031, "rps_doc_books_importance_length_correction": -259.8742980957031, "rps_doc_openwebtext_importance": -134.7577362060547, "rps_doc_openwebtext_importance_length_correction": -134.7577362060547, "rps_doc_wikipedia_importance": -96.23381042480469, "rps_doc_wikipedia_importance_length_correction": -96.23381042480469 }, "fasttext": { "dclm": 0.06631922721862793, "english": 0.8858165144920349, "fineweb_edu_approx": 1.4513965845108032, "eai_general_math": 0.9194030165672302, "eai_open_web_math": 0.27026236057281494, "eai_web_code": 0.8358539342880249 } }

{ "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": "006.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Cognitive science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

8,887,329,794,645,112,000

About | FAQ | Help Ask Your Question 0 How does the "ensure" attribute from the "service" resource test if a service is running? asked 2016-06-09 16:35:10 -0500 tinatinatina gravatar image Just to give a bit of context. I'm working on a script to provision Mercurial. There is an init script with "start" and "stop" capabilities. I've written the following block to make sure the service is running. service { 'hg_serve': ensure => running, enable => true, } I'm running into an issue where this service tries to start itself every time the above resource runs. But of course after the initial provisioning, the port is already in use, so all subsequent provisioning fails because it tries to start a mercurial server on the same port. Isn't ensure supposed to just check its status, instead of starting it? I think the service provider is failing to recognize the status of this service and that's why it just tries to start it "to get the job done". I've been looking through the puppet source code but can't find where the checks for "ensure" is located. edit retag flag offensive close merge delete 2 Answers Sort by » oldest newest most voted 1 answered 2016-06-09 21:32:23 -0500 virtblackbelt gravatar image Have you tried, by hand, to see whether the service thinks it is running (as opposed to just the appropriate processes running). For example, RHEL "service hgserve status" or "systemctl status hgserve"? I've run across a couple of misbehaving applications that don't properly start and report status, so every time Puppet checked status it said it wasn't running and tried to start it. edit flag offensive delete link more Comments look into hasstatus => false, and the pattern param. More info in my full answer. DarylW gravatar imageDarylW ( 2016-06-09 21:54:23 -0500 )edit Dary, where is the full answer? it seems I met with same issue, I am using a command such as " ps -ef|grep daemonname" as the status check. and I am sure it will return 0, but it seems the service status check does not use the return value 0/1 to decide whether to start/stop/restart service. jamwu2 gravatar imagejamwu2 ( 2018-05-09 06:20:47 -0500 )edit 1 answered 2016-06-09 21:57:41 -0500 DarylW gravatar image If your init script doesn't have a 'status' option, you have ways to tell the puppet service resource 'hasstatus => false, and you can give it further information about how to figure out status. run 'puppet describe service' to see info about param options. Specifically, this part of the output... Puppet 2.7 and newer expect init scripts to have a working status command. If this isn't the case for any of your services' init scripts, you will need to set `hasstatus` to false and possibly specify a custom status command in the `status` attribute. As a last resort, Puppet will attempt to search the process table by calling whatever command is listed in the `ps` fact. The default search pattern is the name of the service, but you can specify it with the `pattern` attribute. edit flag offensive delete link more Your Answer Please start posting anonymously - your entry will be published after you log in or create a new account. Add Answer Question Tools 1 follower Stats Asked: 2016-06-09 16:35:10 -0500 Seen: 214 times Last updated: Jun 09 '16

{ "url": "https://ask.puppet.com/question/26522/how-does-the-ensure-attribute-from-the-service-resource-test-if-a-service-is-running/", "source_domain": "ask.puppet.com", "snapshot_id": "crawl=CC-MAIN-2018-22", "warc_metadata": { "Content-Length": "73485", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:KNH6SAB65DPT46OC6ENQ63SGQZQYJHNY", "WARC-Concurrent-To": "<urn:uuid:db73888d-9fbf-4edc-9107-78f0b4a1116f>", "WARC-Date": "2018-05-21T10:32:40Z", "WARC-IP-Address": "138.197.54.145", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:MJE536TVT3UCPDVFJYBRARGJYUSIGYBF", "WARC-Record-ID": "<urn:uuid:ac6525af-f710-4347-bd51-d39892858f20>", "WARC-Target-URI": "https://ask.puppet.com/question/26522/how-does-the-ensure-attribute-from-the-service-resource-test-if-a-service-is-running/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:87f629b5-5c9f-4fa4-a28a-acd7dc190a56>" }, "warc_info": "robots: classic\r\nhostname: ip-10-143-78-161.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 19, 37, 39, 40, 130, 131, 163, 164, 192, 193, 224, 225, 273, 274, 336, 337, 407, 408, 432, 456, 477, 481, 482, 759, 760, 832, 833, 977, 978, 1084, 1085, 1130, 1131, 1141, 1142, 1177, 1179, 1180, 1215, 1216, 1245, 1246, 1632, 1633, 1670, 1671, 1680, 1681, 1763, 1764, 1826, 1827, 2120, 2121, 2183, 2185, 2186, 2221, 2222, 2244, 2245, 2503, 2504, 2545, 2546, 2621, 2693, 2763, 2839, 2914, 2987, 3028, 3065, 3066, 3078, 3079, 3185, 3186, 3197, 3198, 3213, 3214, 3225, 3226, 3232, 3233, 3266, 3267, 3283, 3284 ], "line_end_idx": [ 19, 37, 39, 40, 130, 131, 163, 164, 192, 193, 224, 225, 273, 274, 336, 337, 407, 408, 432, 456, 477, 481, 482, 759, 760, 832, 833, 977, 978, 1084, 1085, 1130, 1131, 1141, 1142, 1177, 1179, 1180, 1215, 1216, 1245, 1246, 1632, 1633, 1670, 1671, 1680, 1681, 1763, 1764, 1826, 1827, 2120, 2121, 2183, 2185, 2186, 2221, 2222, 2244, 2245, 2503, 2504, 2545, 2546, 2621, 2693, 2763, 2839, 2914, 2987, 3028, 3065, 3066, 3078, 3079, 3185, 3186, 3197, 3198, 3213, 3214, 3225, 3226, 3232, 3233, 3266, 3267, 3283, 3284, 3308 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3308, "ccnet_original_nlines": 90, "rps_doc_curly_bracket": 0.0006045899935998023, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3319559097290039, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015151520259678364, "rps_doc_frac_lines_end_with_ellipsis": 0.010989010334014893, "rps_doc_frac_no_alph_words": 0.27410468459129333, "rps_doc_frac_unique_words": 0.468634694814682, "rps_doc_mean_word_length": 4.702951908111572, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.0013774100225418806, "rps_doc_unigram_entropy": 5.096645355224609, "rps_doc_word_count": 542, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.02432326041162014, "rps_doc_frac_chars_dupe_6grams": 0.02432326041162014, "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.023538639768958092, "rps_doc_frac_chars_top_3gram": 0.014123190194368362, "rps_doc_frac_chars_top_4gram": 0.018046289682388306, "rps_doc_books_importance": -350.3868103027344, "rps_doc_books_importance_length_correction": -350.3868103027344, "rps_doc_openwebtext_importance": -202.24908447265625, "rps_doc_openwebtext_importance_length_correction": -202.24908447265625, "rps_doc_wikipedia_importance": -131.0492706298828, "rps_doc_wikipedia_importance_length_correction": -131.0492706298828 }, "fasttext": { "dclm": 0.11674386262893677, "english": 0.9001171588897705, "fineweb_edu_approx": 1.3621304035186768, "eai_general_math": 0.19973492622375488, "eai_open_web_math": 0.07308679819107056, "eai_web_code": 0.04716796055436134 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.445", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "0", "label": "No Artifacts" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "3", "label": "Intermediate Reasoning" }, "secondary": { "code": "2", "label": "Basic Reasoning" } }, "technical_correctness": { "primary": { "code": "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,997,919,382,633,098,000

# SNMP::Info::Layer7::Neoteris # # Copyright (c) 2012 Eric Miller # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions are met: # # * Redistributions of source code must retain the above copyright notice, # this list of conditions and the following disclaimer. # * Redistributions in binary form must reproduce the above copyright # notice, this list of conditions and the following disclaimer in the # documentation and/or other materials provided with the distribution. # * Neither the name of the University of California, Santa Cruz nor the # names of its contributors may be used to endorse or promote products # derived from this software without specific prior written permission. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE # LIABLE FOR # ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE # POSSIBILITY OF SUCH DAMAGE. package SNMP::Info::Layer7::Neoteris; use strict; use Exporter; use SNMP::Info::Layer7; @SNMP::Info::Layer7::Neoteris::ISA = qw/SNMP::Info::Layer7 Exporter/; @SNMP::Info::Layer7::Neoteris::EXPORT_OK = qw//; use vars qw/$VERSION %GLOBALS %MIBS %FUNCS %MUNGE/; $VERSION = '3.05'; %MIBS = ( %SNMP::Info::Layer7::MIBS, 'UCD-SNMP-MIB' => 'versionTag', 'JUNIPER-IVE-MIB' => 'productVersion', ); %GLOBALS = ( %SNMP::Info::Layer7::GLOBALS, 'os_ver' => 'productVersion', 'cpu' => 'iveCpuUtil', ); %FUNCS = ( %SNMP::Info::Layer7::FUNCS, ); %MUNGE = ( %SNMP::Info::Layer7::MUNGE, ); sub vendor { return 'juniper'; } sub os { return 'ive'; } sub serial { return ''; } 1; __END__ =head1 NAME SNMP::Info::Layer7::Neoteris - SNMP Interface to Juniper SSL VPN appliances =head1 AUTHORS Eric Miller =head1 SYNOPSIS # Let SNMP::Info determine the correct subclass for you. my $neoteris = new SNMP::Info( AutoSpecify => 1, Debug => 1, DestHost => 'myrouter', Community => 'public', Version => 2 ) or die "Can't connect to DestHost.\n"; my $class = $neoteris->class(); print "SNMP::Info determined this device to fall under subclass : $class\n"; =head1 DESCRIPTION Subclass for Juniper SSL VPN appliances =head2 Inherited Classes =over =item SNMP::Info::Layer7 =back =head2 Required MIBs =over =item F =item F =item Inherited Classes' MIBs See L for its own MIB requirements. =back =head1 GLOBALS These are methods that return scalar value from SNMP =over =item $neoteris->vendor() Returns 'juniper'. =item $neoteris->os() Returns C<'ive'>. =item $neoteris->os_ver() C =item $neoteris->cpu() C =item $neoteris->serial() Returns ''. =back =head2 Globals imported from SNMP::Info::Layer7 See documentation in L for details. =head1 TABLE ENTRIES These are methods that return tables of information in the form of a reference to a hash. =head2 Table Methods imported from SNMP::Info::Layer7 See documentation in L for details. =cut

{ "url": "http://cpansearch.perl.org/src/OLIVER/SNMP-Info-3.05/Info/Layer7/Neoteris.pm", "source_domain": "cpansearch.perl.org", "snapshot_id": "crawl=CC-MAIN-2015-48", "warc_metadata": { "Content-Length": "4267", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:JOQCFCDFNUCPZU7UVXUX5N66ODF72XTK", "WARC-Concurrent-To": "<urn:uuid:e1b81610-772a-45e4-8f1e-bba480b0a79f>", "WARC-Date": "2015-11-30T00:24:11Z", "WARC-IP-Address": "199.15.177.162", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:WS7LHYWLPT467363FBHPYOXC4I42VX6T", "WARC-Record-ID": "<urn:uuid:a73d883d-9dda-43e0-b98e-b630c8fcb766>", "WARC-Target-URI": "http://cpansearch.perl.org/src/OLIVER/SNMP-Info-3.05/Info/Layer7/Neoteris.pm", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:25123025-fa9d-415e-aa6e-1d4fd330964f>" }, "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 ], "line_end_idx": [ 3486 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3486, "ccnet_original_nlines": 0, "rps_doc_curly_bracket": 0.0017211700323969126, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.1320512741804123, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.2282051295042038, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.36538460850715637, "rps_doc_frac_unique_words": 0.5294117331504822, "rps_doc_mean_word_length": 5.875565528869629, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0.03846153989434242, "rps_doc_unigram_entropy": 5.126463413238525, "rps_doc_word_count": 442, "rps_doc_frac_chars_dupe_10grams": 0.05236811935901642, "rps_doc_frac_chars_dupe_5grams": 0.13246053457260132, "rps_doc_frac_chars_dupe_6grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_7grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_8grams": 0.09472467750310898, "rps_doc_frac_chars_dupe_9grams": 0.09472467750310898, "rps_doc_frac_chars_top_2gram": 0.01386214978992939, "rps_doc_frac_chars_top_3gram": 0.013092029839754105, "rps_doc_frac_chars_top_4gram": 0.017712749540805817, "rps_doc_books_importance": -345.31951904296875, "rps_doc_books_importance_length_correction": -345.31951904296875, "rps_doc_openwebtext_importance": -177.024169921875, "rps_doc_openwebtext_importance_length_correction": -177.024169921875, "rps_doc_wikipedia_importance": -191.69219970703125, "rps_doc_wikipedia_importance_length_correction": -191.69219970703125 }, "fasttext": { "dclm": 0.0964694619178772, "english": 0.5849725604057312, "fineweb_edu_approx": 1.3186695575714111, "eai_general_math": 0.9035494923591614, "eai_open_web_math": 0.1757487654685974, "eai_web_code": 0.3940771818161011 } }

{ "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.072", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

8,713,105,656,225,758,000

import wx #---------------------------------------------------------------------- ID_CopyBtn = wx.NewId() ID_PasteBtn = wx.NewId() ID_BitmapBtn = wx.NewId() #---------------------------------------------------------------------- class ClipTextPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) self.log = log #self.SetFont(wx.Font(10, wx.SWISS, wx.NORMAL, wx.BOLD, False)) sizer = wx.BoxSizer(wx.VERTICAL) sizer.Add( wx.StaticText( self, -1, "Copy/Paste text to/from\n" "this window and other apps" ), 0, wx.EXPAND|wx.ALL, 2 ) self.text = wx.TextCtrl(self, -1, "", style=wx.TE_MULTILINE|wx.HSCROLL) sizer.Add(self.text, 1, wx.EXPAND) hsz = wx.BoxSizer(wx.HORIZONTAL) hsz.Add(wx.Button(self, ID_CopyBtn, " Copy "), 1, wx.EXPAND|wx.ALL, 2) hsz.Add(wx.Button(self, ID_PasteBtn, " Paste "), 1, wx.EXPAND|wx.ALL, 2) sizer.Add(hsz, 0, wx.EXPAND) sizer.Add( wx.Button(self, ID_BitmapBtn, " Copy Bitmap "), 0, wx.EXPAND|wx.ALL, 2 ) self.Bind(wx.EVT_BUTTON, self.OnCopy, id=ID_CopyBtn) self.Bind(wx.EVT_BUTTON, self.OnPaste, id=ID_PasteBtn) self.Bind(wx.EVT_BUTTON, self.OnCopyBitmap, id=ID_BitmapBtn) self.SetAutoLayout(True) self.SetSizer(sizer) def OnCopy(self, evt): self.do = wx.TextDataObject() self.do.SetText(self.text.GetValue()) if wx.TheClipboard.Open(): wx.TheClipboard.SetData(self.do) wx.TheClipboard.Close() else: wx.MessageBox("Unable to open the clipboard", "Error") def OnPaste(self, evt): success = False do = wx.TextDataObject() if wx.TheClipboard.Open(): success = wx.TheClipboard.GetData(do) wx.TheClipboard.Close() if success: self.text.SetValue(do.GetText()) else: wx.MessageBox( "There is no data in the clipboard in the required format", "Error" ) def OnCopyBitmap(self, evt): dlg = wx.FileDialog(self, "Choose a bitmap to copy", wildcard="*.bmp") if dlg.ShowModal() == wx.ID_OK: bmp = wx.Bitmap(dlg.GetPath(), wx.BITMAP_TYPE_BMP) bmpdo = wx.BitmapDataObject(bmp) if wx.TheClipboard.Open(): wx.TheClipboard.SetData(bmpdo) wx.TheClipboard.Close() wx.MessageBox( "The bitmap is now in the Clipboard. Switch to a graphics\n" "editor and try pasting it in..." ) else: wx.MessageBox( "There is no data in the clipboard in the required format", "Error" ) dlg.Destroy() #---------------------------------------------------------------------- class OtherDropTarget(wx.PyDropTarget): def __init__(self, window, log): wx.PyDropTarget.__init__(self) self.log = log self.do = wx.FileDataObject() self.SetDataObject(self.do) def OnEnter(self, x, y, d): self.log.WriteText("OnEnter: %d, %d, %d\n" % (x, y, d)) return wx.DragCopy #def OnDragOver(self, x, y, d): # self.log.WriteText("OnDragOver: %d, %d, %d\n" % (x, y, d)) # return wx.DragCopy def OnLeave(self): self.log.WriteText("OnLeave\n") def OnDrop(self, x, y): self.log.WriteText("OnDrop: %d %d\n" % (x, y)) return True def OnData(self, x, y, d): self.log.WriteText("OnData: %d, %d, %d\n" % (x, y, d)) self.GetData() self.log.WriteText("%s\n" % self.do.GetFilenames()) return d class MyFileDropTarget(wx.FileDropTarget): def __init__(self, window, log): wx.FileDropTarget.__init__(self) self.window = window self.log = log def OnDropFiles(self, x, y, filenames): self.window.SetInsertionPointEnd() self.window.WriteText("\n%d file(s) dropped at %d,%d:\n" % (len(filenames), x, y)) for file in filenames: self.window.WriteText(file + '\n') class MyTextDropTarget(wx.TextDropTarget): def __init__(self, window, log): wx.TextDropTarget.__init__(self) self.window = window self.log = log def OnDropText(self, x, y, text): self.window.WriteText("(%d, %d)\n%s\n" % (x, y, text)) def OnDragOver(self, x, y, d): return wx.DragCopy class FileDropPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) #self.SetFont(wx.Font(10, wx.SWISS, wx.NORMAL, wx.BOLD, False)) sizer = wx.BoxSizer(wx.VERTICAL) sizer.Add( wx.StaticText(self, -1, " \nDrag some files here:"), 0, wx.EXPAND|wx.ALL, 2 ) self.text = wx.TextCtrl( self, -1, "", style = wx.TE_MULTILINE|wx.HSCROLL|wx.TE_READONLY ) dt = MyFileDropTarget(self, log) self.text.SetDropTarget(dt) sizer.Add(self.text, 1, wx.EXPAND) sizer.Add( wx.StaticText(self, -1, " \nDrag some text here:"), 0, wx.EXPAND|wx.ALL, 2 ) self.text2 = wx.TextCtrl( self, -1, "", style = wx.TE_MULTILINE|wx.HSCROLL|wx.TE_READONLY ) dt = MyTextDropTarget(self.text2, log) self.text2.SetDropTarget(dt) sizer.Add(self.text2, 1, wx.EXPAND) self.SetAutoLayout(True) self.SetSizer(sizer) def WriteText(self, text): self.text.WriteText(text) def SetInsertionPointEnd(self): self.text.SetInsertionPointEnd() #---------------------------------------------------------------------- #---------------------------------------------------------------------- class TestPanel(wx.Panel): def __init__(self, parent, log): wx.Panel.__init__(self, parent, -1) self.SetAutoLayout(True) outsideSizer = wx.BoxSizer(wx.VERTICAL) msg = "Clipboard / Drag-And-Drop" text = wx.StaticText(self, -1, "", style=wx.ALIGN_CENTRE) text.SetFont(wx.Font(24, wx.SWISS, wx.NORMAL, wx.BOLD, False)) text.SetLabel(msg) w,h = text.GetTextExtent(msg) text.SetSize(wx.Size(w,h+1)) text.SetForegroundColour(wx.BLUE) outsideSizer.Add(text, 0, wx.EXPAND|wx.ALL, 5) outsideSizer.Add(wx.StaticLine(self, -1), 0, wx.EXPAND) inSizer = wx.BoxSizer(wx.HORIZONTAL) inSizer.Add(ClipTextPanel(self, log), 1, wx.EXPAND) inSizer.Add(FileDropPanel(self, log), 1, wx.EXPAND) outsideSizer.Add(inSizer, 1, wx.EXPAND) self.SetSizer(outsideSizer) #---------------------------------------------------------------------- def runTest(frame, nb, log): win = TestPanel(nb, log) return win #---------------------------------------------------------------------- overview = """\ This demo shows some examples of data transfer through clipboard or drag and drop. In wxWindows, these two ways to transfer data (either between different applications or inside one and the same) are very similar which allows to implement both of them using almost the same code - or, in other words, if you implement drag and drop support for your application, you get clipboard support for free and vice versa. At the heart of both clipboard and drag and drop operations lies the wxDataObject class. The objects of this class (or, to be precise, classes derived from it) represent the data which is being carried by the mouse during drag and drop operation or copied to or pasted from the clipboard. wxDataObject is a "smart" piece of data because it knows which formats it supports (see GetFormatCount and GetAllFormats) and knows how to render itself in any of them (see GetDataHere). It can also receive its value from the outside in a format it supports if it implements the SetData method. Please see the documentation of this class for more details. Both clipboard and drag and drop operations have two sides: the source and target, the data provider and the data receiver. These which may be in the same application and even the same window when, for example, you drag some text from one position to another in a word processor. Let us describe what each of them should do. """ if __name__ == '__main__': import sys,os import run run.main(['', os.path.basename(sys.argv[0])] + sys.argv[1:])

{ "url": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/wx/wxPython-r218/wxPython/demo/DragAndDrop.py", "source_domain": "fossies.org", "snapshot_id": "crawl=CC-MAIN-2016-44", "warc_metadata": { "Content-Length": "9322", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:OA3ELFNYXYEAZYK52JJ563VS7DZEEALM", "WARC-Concurrent-To": "<urn:uuid:6e1a24b8-81fd-401b-b09b-fed2a6198866>", "WARC-Date": "2016-10-24T10:42:10Z", "WARC-IP-Address": "138.201.17.217", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:ETMSTKNHPJTE25DLWCOEZTNVWQWIOBL5", "WARC-Record-ID": "<urn:uuid:90e0d7e2-1810-48ed-aad3-af743f15c268>", "WARC-Target-URI": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/wx/wxPython-r218/wxPython/demo/DragAndDrop.py", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b6fafe1f-0132-49e3-b985-285a1d562be0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 6061, 6062, 6707, 6708 ], "line_end_idx": [ 6061, 6062, 6707, 6708, 7149 ] }

{ "red_pajama_v2": { "ccnet_original_length": 7149, "ccnet_original_nlines": 4, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.19034995138645172, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02704136073589325, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4549310803413391, "rps_doc_frac_unique_words": 0.44412606954574585, "rps_doc_mean_word_length": 6.944126129150391, "rps_doc_num_sentences": 235, "rps_doc_symbol_to_word_ratio": 0.0068928999826312065, "rps_doc_unigram_entropy": 5.253512382507324, "rps_doc_word_count": 698, "rps_doc_frac_chars_dupe_10grams": 0.02764596976339817, "rps_doc_frac_chars_dupe_5grams": 0.17165257036685944, "rps_doc_frac_chars_dupe_6grams": 0.13637301325798035, "rps_doc_frac_chars_dupe_7grams": 0.111821748316288, "rps_doc_frac_chars_dupe_8grams": 0.07055910676717758, "rps_doc_frac_chars_dupe_9grams": 0.03837424889206886, "rps_doc_frac_chars_top_2gram": 0.0053641400299966335, "rps_doc_frac_chars_top_3gram": 0.004332580137997866, "rps_doc_frac_chars_top_4gram": 0.004126260057091713, "rps_doc_books_importance": -476.74908447265625, "rps_doc_books_importance_length_correction": -476.74908447265625, "rps_doc_openwebtext_importance": -157.65892028808594, "rps_doc_openwebtext_importance_length_correction": -157.65892028808594, "rps_doc_wikipedia_importance": -130.7601776123047, "rps_doc_wikipedia_importance_length_correction": -130.7601776123047 }, "fasttext": { "dclm": 0.9135609269142151, "english": 0.4036865234375, "fineweb_edu_approx": 3.0543460845947266, "eai_general_math": 0.9808907508850098, "eai_open_web_math": 0.1575501561164856, "eai_web_code": 0.9482624530792236 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.452", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

4,100,606,007,212,807,000

Previous: , Up: Miscellaneous [Contents][Index] 7.8.3 How to check for software updates The GnuPG Project operates a server to query the current versions of software packages related to GnuPG. GPGME can be used to access this online database and check whether a new version of a software package is available. Data type: gpgme_query_swdb_result_t SINCE: 1.8.0 This is a pointer to a structure used to store the result of a gpgme_op_query_swdb operation. After success full call to that function, you can retrieve the pointer to the result with gpgme_op_query_swdb_result. The structure contains the following member: name This is the name of the package. iversion The currently installed version or an empty string. This value is either a copy of the argument given to gpgme_op_query_swdb or the version of the installed software as figured out by GPGME or GnuPG. created This gives the date the file with the list of version numbers has originally be created by the GnuPG project. retrieved This gives the date the file was downloaded. warning If this flag is set either an error has occurred or some of the information in this structure are not properly set. For example if the version number of the installed software could not be figured out, the update flag may not reflect a required update status. update If this flag is set an update of the software is available. urgent If this flag is set an available update is important. noinfo If this flag is set, no valid information could be retrieved. unknown If this flag is set the given name is not known. tooold If this flag is set the available information is not fresh enough. error If this flag is set some other error has occurred. version The version string of the latest released version. reldate The release date of the latest released version. Function: gpgme_error_t gpgme_op_query_swdb (gpgme_ctx_t ctx, const char *name, const char *iversion, gpgme_data_t reserved) SINCE: 1.8.0 Query the software version database for software package name and check against the installed version given by iversion. If iversion is given as NULL a check is only done if GPGME can figure out the version by itself (for example when using "gpgme" or "gnupg"). If NULL is used for name the current gpgme version is checked. reserved must be set to 0. Function: gpgme_query_swdb_result_t gpgme_op_query_swdb_result (gpgme_ctx_t ctx) SINCE: 1.8.0 The function gpgme_op_query_swdb_result returns a gpgme_query_swdb_result_t pointer to a structure holding the result of a gpgme_op_query_swdb operation. The pointer is only valid if the last operation on the context was a successful call to gpgme_op_query_swdb. If that call failed, the result might be a NULL pointer. The returned pointer is only valid until the next operation is started on the context ctx. Here is an example on how to check whether GnuPG is current: #include <gpgme.h> int main (void) { gpg_error_t err; gpgme_ctx_t ctx; gpgme_query_swdb_result_t result; gpgme_check_version (NULL); err = gpgme_new (&ctx); if (err) fprintf (stderr, "error creating context: %s\n", gpg_strerror (err)); else { gpgme_set_protocol (ctx, GPGME_PROTOCOL_GPGCONF); err = gpgme_op_query_swdb (ctx, "gnupg", NULL, 0); if (err) fprintf (stderr, "error querying swdb: %s\n", gpg_strerror (err)); else { result = gpgme_op_query_swdb_result (ctx); if (!result) fprintf (stderr, "error querying swdb\n"); if (!result->warning && !result->update) printf ("GnuPG version %s is current\n", result->iversion); else if (!result->warning && result->update) printf ("GnuPG version %s can be updated to %s\n", result->iversion, result->version); else fprintf (stderr, "error finding the update status\n"); } gpgme_release (ctx); } return 0; } Previous: , Up: Miscellaneous [Contents][Index]

{ "url": "https://www.gnupg.org/documentation/manuals/gpgme/Checking-for-updates.html", "source_domain": "www.gnupg.org", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "9706", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:5H45G3FZHXHARI5NGNT4VPEJUM75WVEF", "WARC-Concurrent-To": "<urn:uuid:291f87da-a415-4a64-83d1-38cb348f583a>", "WARC-Date": "2018-02-22T07:10:05Z", "WARC-IP-Address": "217.69.76.60", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:PZQJIHWDPJBECUNHT7JJ43SWSML4MGYX", "WARC-Record-ID": "<urn:uuid:5002f0c1-ed94-4da0-8378-b1eeec449dc3>", "WARC-Target-URI": "https://www.gnupg.org/documentation/manuals/gpgme/Checking-for-updates.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:d008f59d-1492-48fb-9a3e-f894c6f9ffd0>" }, "warc_info": "robots: classic\r\nhostname: ip-10-171-90-19.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 50, 51, 52, 92, 93, 315, 316, 353, 354, 367, 368, 625, 626, 631, 632, 665, 666, 675, 676, 876, 877, 885, 886, 996, 997, 1007, 1008, 1053, 1054, 1062, 1063, 1323, 1324, 1331, 1332, 1392, 1393, 1400, 1401, 1455, 1456, 1463, 1464, 1526, 1527, 1535, 1536, 1585, 1586, 1593, 1594, 1661, 1662, 1668, 1669, 1720, 1721, 1729, 1730, 1781, 1782, 1790, 1791, 1840, 1841, 1966, 1967, 1980, 1981, 2333, 2334, 2415, 2416, 2429, 2430, 2841, 2842, 2903, 2904, 2923, 2924, 2928, 2940, 2942, 2961, 2980, 3016, 3017, 3047, 3073, 3084, 3158, 3165, 3171, 3227, 3228, 3285, 3300, 3375, 3386, 3396, 3449, 3472, 3527, 3578, 3631, 3670, 3725, 3788, 3844, 3859, 3926, 3936, 3963, 3969, 3981, 3983, 3984 ], "line_end_idx": [ 50, 51, 52, 92, 93, 315, 316, 353, 354, 367, 368, 625, 626, 631, 632, 665, 666, 675, 676, 876, 877, 885, 886, 996, 997, 1007, 1008, 1053, 1054, 1062, 1063, 1323, 1324, 1331, 1332, 1392, 1393, 1400, 1401, 1455, 1456, 1463, 1464, 1526, 1527, 1535, 1536, 1585, 1586, 1593, 1594, 1661, 1662, 1668, 1669, 1720, 1721, 1729, 1730, 1781, 1782, 1790, 1791, 1840, 1841, 1966, 1967, 1980, 1981, 2333, 2334, 2415, 2416, 2429, 2430, 2841, 2842, 2903, 2904, 2923, 2924, 2928, 2940, 2942, 2961, 2980, 3016, 3017, 3047, 3073, 3084, 3158, 3165, 3171, 3227, 3228, 3285, 3300, 3375, 3386, 3396, 3449, 3472, 3527, 3578, 3631, 3670, 3725, 3788, 3844, 3859, 3926, 3936, 3963, 3969, 3981, 3983, 3984, 4033 ] }

{ "red_pajama_v2": { "ccnet_original_length": 4033, "ccnet_original_nlines": 118, "rps_doc_curly_bracket": 0.001487729954533279, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.32536521553993225, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015936249867081642, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.24302789568901062, "rps_doc_frac_unique_words": 0.33511584997177124, "rps_doc_mean_word_length": 5.190731048583984, "rps_doc_num_sentences": 41, "rps_doc_symbol_to_word_ratio": 0.0013280200073495507, "rps_doc_unigram_entropy": 4.694985389709473, "rps_doc_word_count": 561, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.14594779908657074, "rps_doc_frac_chars_dupe_6grams": 0.09684065729379654, "rps_doc_frac_chars_dupe_7grams": 0.031593408435583115, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013736260123550892, "rps_doc_frac_chars_top_3gram": 0.024038460105657578, "rps_doc_frac_chars_top_4gram": 0.028846150264143944, "rps_doc_books_importance": -313.87969970703125, "rps_doc_books_importance_length_correction": -313.87969970703125, "rps_doc_openwebtext_importance": -123.6434555053711, "rps_doc_openwebtext_importance_length_correction": -123.6434555053711, "rps_doc_wikipedia_importance": -123.96527099609375, "rps_doc_wikipedia_importance_length_correction": -123.96527099609375 }, "fasttext": { "dclm": 0.2867956757545471, "english": 0.7473256587982178, "fineweb_edu_approx": 1.9204301834106445, "eai_general_math": 0.7327438592910767, "eai_open_web_math": 0.09150440245866776, "eai_web_code": 0.9331973195075989 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.82", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

3,896,505,089,982,429,700

I noticed the new javascript parser. Impressive! I don't know who the author is, but I wanted to signal a minor issue: tables require closing pipe to be recognized. Instead they're optional in Creole. -- [[Michele Tomaiuolo]], 2007-02-28 From what I've read on Meatball about InfiniteMonkey, I guess that it's an effort for the meatball successor. It has very interesting plans, by the way. -- [[Radomir Dopieralski]], 2007-Mar-01 ----------------- moved from [[Talk]]: == Converting Markup -> 2007-Apr-14 I'm not sure where to put this, so I'll mention it here. So far we have focussed on making Creole easy for the users to write in and relatively easy to parse (mainly convert from Creole to HTML and other markups). But there is also a second aspect, one that also is an indication of how clear and well defined the language is: the possibility and ease of converting **to** Creole from various popular markups. This will be needed to migrate wikis. It will be needed for wiki engines that use WYSIWYG editors. It's also a good test on how well defined and streamlined the markup is. Note that this doesn't mean that Creole should have **all** features that HTML offers, of course. -- [[Radomir Dopieralski]], 2007-Apr-14 Escape characters will help there (see [[Nyctergatis]] sandbox with Creole output). -- [[YvesPiguet]], 2007-Apr-14 Not if they use "heuristics" or come together with insane markup -- then you'd have to escape practically every "hot" character, making the result totally unreadable for humans. -- [[Radomir Dopieralski]], 2007-Apr-14 That's definitively //not// what I want. NME could probably be smarter for its Creole output, but using nowiki instead of escape char is //much// worse. -- [[YvesPiguet]], 2007-4-14 ----------------- ==Can't add engines to locked pages...== Maybe you'll add it for me, and change the page text to give an alternative path for adding new engines in future. [Virtuoso Universal Server|http://virtuoso.openlinksw.com/wiki/main/Main/VOSIndex] powers the [OpenLink Data Spaces|http://virtuoso.openlinksw.com/wiki/main/Main/OdsIndex], among which you will find the [ODS Wiki|http://virtuoso.openlinksw.com/dataspace/dav/wiki/Main/OdsWiki]. I think the latter would be the engine by your definitions, but that may be open to discussion.... -- [[MacTed]], 2008-Mar-18

{ "url": "http://wikicreole.org/wiki/Talk.Engines?version=4&skin=raw", "source_domain": "wikicreole.org", "snapshot_id": "crawl=CC-MAIN-2019-26", "warc_metadata": { "Content-Length": "2657", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:MXSYXQEHDCQGVZZZIMKN7QMJO34PUJW7", "WARC-Concurrent-To": "<urn:uuid:dd6316e7-fb53-4fd0-bee1-d2234c29caca>", "WARC-Date": "2019-06-20T10:17:17Z", "WARC-IP-Address": "5.45.108.145", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:AMJMJQFJPLMARBG3U3LX3F2UOIAB6SYZ", "WARC-Record-ID": "<urn:uuid:0e97496c-387a-4557-8727-5da5df730cf2>", "WARC-Target-URI": "http://wikicreole.org/wiki/Talk.Engines?version=4&skin=raw", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:3814701e-780f-4f08-a547-265a9183fc66>" }, "warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-166-244-242.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 49, 50, 202, 203, 240, 241, 394, 395, 435, 436, 437, 455, 476, 512, 513, 1193, 1194, 1234, 1235, 1320, 1321, 1352, 1353, 1531, 1532, 1572, 1573, 1726, 1727, 1756, 1757, 1775, 1776, 1817, 1818, 2312, 2313 ], "line_end_idx": [ 49, 50, 202, 203, 240, 241, 394, 395, 435, 436, 437, 455, 476, 512, 513, 1193, 1194, 1234, 1235, 1320, 1321, 1352, 1353, 1531, 1532, 1572, 1573, 1726, 1727, 1756, 1757, 1775, 1776, 1817, 1818, 2312, 2313, 2339 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2339, "ccnet_original_nlines": 37, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3358924984931946, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.026871399953961372, "rps_doc_frac_lines_end_with_ellipsis": 0.02631578966975212, "rps_doc_frac_no_alph_words": 0.29558542370796204, "rps_doc_frac_unique_words": 0.6114457845687866, "rps_doc_mean_word_length": 5.25602388381958, "rps_doc_num_sentences": 28, "rps_doc_symbol_to_word_ratio": 0.003838770091533661, "rps_doc_unigram_entropy": 5.024541854858398, "rps_doc_word_count": 332, "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.030945559963583946, "rps_doc_frac_chars_top_3gram": 0.013753579929471016, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -273.28302001953125, "rps_doc_books_importance_length_correction": -273.28302001953125, "rps_doc_openwebtext_importance": -154.8933868408203, "rps_doc_openwebtext_importance_length_correction": -154.8933868408203, "rps_doc_wikipedia_importance": -140.39227294921875, "rps_doc_wikipedia_importance_length_correction": -140.39227294921875 }, "fasttext": { "dclm": 0.057844821363687515, "english": 0.8602020144462585, "fineweb_edu_approx": 1.519604206085205, "eai_general_math": 0.9285677075386047, "eai_open_web_math": 0.6445693969726562, "eai_web_code": 0.8343625664710999 } }

{ "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "5", "label": "Social/Forum" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "5", "label": "Comment Section" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-643,153,227,952,296,400

Компьютеры и Internet. Базы данных. Oracle 9i: Перевод с английского.. увеличить В этой книге рассматриваются основные инструментальные средства разработки Oracle, предназначенные для новой версии базы данных Oracle9i (версия 9.0), но она, безусловно, может также применяться для изучения версий Oracle8 и 8i. В примерах данной книги представлены различные аспекты разработки приложений в среде Oracle, но основной акцент сделан на разработке Web-приложений.Книга предназначена в основном для начинающих пользователей, но в ней приведено много советов и рекомендаций, которые будут интересны и для разработчиков среднего уровня.

{ "url": "https://rosreestr-office.ru/kompyutery-i-internet-bazy-dannyh-oracle-9i-perevod-s-anglijskogo/", "source_domain": "rosreestr-office.ru", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "51249", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CGIBMVWTIM3KL44KDENWLZUPXILY4RED", "WARC-Concurrent-To": "<urn:uuid:8bca95df-ba43-4b61-9546-c21aceb758a7>", "WARC-Date": "2024-03-04T12:14:01Z", "WARC-IP-Address": "38.242.209.8", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:VE2Z5O2JHJKXAZZCFTLGRPKUYE6R2NFG", "WARC-Record-ID": "<urn:uuid:6b329d81-b148-4efb-93b6-244d17717803>", "WARC-Target-URI": "https://rosreestr-office.ru/kompyutery-i-internet-bazy-dannyh-oracle-9i-perevod-s-anglijskogo/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e6ef0881-5e20-40ca-9b01-3db52e75aa29>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-169\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, 71, 72, 82, 83 ], "line_end_idx": [ 71, 72, 82, 83, 630 ] }

{ "red_pajama_v2": { "ccnet_original_length": 630, "ccnet_original_nlines": 4, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.019607840105891228, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.9117646813392639, "rps_doc_frac_unique_words": 0.792682945728302, "rps_doc_mean_word_length": 6.5731706619262695, "rps_doc_num_sentences": 7, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 4.042230129241943, "rps_doc_word_count": 82, "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.0371057502925396, "rps_doc_frac_chars_top_3gram": 0, "rps_doc_frac_chars_top_4gram": 0, "rps_doc_books_importance": -37.13412094116211, "rps_doc_books_importance_length_correction": -48.85175704956055, "rps_doc_openwebtext_importance": -24.485595703125, "rps_doc_openwebtext_importance_length_correction": -36.20323181152344, "rps_doc_wikipedia_importance": -17.815031051635742, "rps_doc_wikipedia_importance_length_correction": -29.53266716003418 }, "fasttext": { "dclm": 0.9232672452926636, "english": 0.00003020999974978622, "fineweb_edu_approx": 1.907341480255127, "eai_general_math": -0.000009890000001178123, "eai_open_web_math": 0.11256200075149536, "eai_web_code": 0.7917876243591309 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.75", "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": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-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": "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": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "2", "label": "High School Level" }, "secondary": { "code": "1", "label": "General Audience" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

3,697,877,358,810,306,000

to top Android APIs SearchViewActionBar.java ← Back The file containing the source code shown below is located in the corresponding directory in <sdk>/samples/android-<version>/... /* * Copyright (C) 2010 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.example.android.apis.view; import com.example.android.apis.R; import android.app.Activity; import android.app.SearchManager; import android.app.SearchableInfo; import android.content.Context; import android.os.Bundle; import android.view.Menu; import android.view.MenuInflater; import android.view.MenuItem; import android.view.View; import android.view.Window; import android.view.MenuItem.OnActionExpandListener; import android.widget.Button; import android.widget.SearchView; import android.widget.TextView; import java.util.List; /** * This demonstrates the usage of SearchView in an ActionBar as a menu item. * It sets a SearchableInfo on the SearchView for suggestions and submitting queries to. */ public class SearchViewActionBar extends Activity implements SearchView.OnQueryTextListener { private SearchView mSearchView; private TextView mStatusView; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedInstanceState); getWindow().requestFeature(Window.FEATURE_ACTION_BAR); setContentView(R.layout.searchview_actionbar); mStatusView = (TextView) findViewById(R.id.status_text); } @Override public boolean onCreateOptionsMenu(Menu menu) { super.onCreateOptionsMenu(menu); MenuInflater inflater = getMenuInflater(); inflater.inflate(R.menu.searchview_in_menu, menu); MenuItem searchItem = menu.findItem(R.id.action_search); mSearchView = (SearchView) searchItem.getActionView(); setupSearchView(searchItem); return true; } private void setupSearchView(MenuItem searchItem) { if (isAlwaysExpanded()) { mSearchView.setIconifiedByDefault(false); } else { searchItem.setShowAsActionFlags(MenuItem.SHOW_AS_ACTION_IF_ROOM | MenuItem.SHOW_AS_ACTION_COLLAPSE_ACTION_VIEW); } SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE); if (searchManager != null) { List<SearchableInfo> searchables = searchManager.getSearchablesInGlobalSearch(); // Try to use the "applications" global search provider SearchableInfo info = searchManager.getSearchableInfo(getComponentName()); for (SearchableInfo inf : searchables) { if (inf.getSuggestAuthority() != null && inf.getSuggestAuthority().startsWith("applications")) { info = inf; } } mSearchView.setSearchableInfo(info); } mSearchView.setOnQueryTextListener(this); } public boolean onQueryTextChange(String newText) { mStatusView.setText("Query = " + newText); return false; } public boolean onQueryTextSubmit(String query) { mStatusView.setText("Query = " + query + " : submitted"); return false; } public boolean onClose() { mStatusView.setText("Closed!"); return false; } protected boolean isAlwaysExpanded() { return false; } }

{ "url": "https://tool.oschina.net/uploads/apidocs/android/resources/samples/ApiDemos/src/com/example/android/apis/view/SearchViewActionBar.html", "source_domain": "tool.oschina.net", "snapshot_id": "CC-MAIN-2024-10", "warc_metadata": { "Content-Length": "15865", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:22TBAEMCW5RKLMH6SVDTEM2PERXV2S2N", "WARC-Concurrent-To": "<urn:uuid:420fc91f-4b33-47c0-8c7e-dae5ff38a691>", "WARC-Date": "2024-03-03T12:33:40Z", "WARC-IP-Address": "180.76.198.147", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DMB5YP2XGJQIWZGW6TWWPUM2RYGJHWJC", "WARC-Record-ID": "<urn:uuid:f63f6f51-779a-4ca6-b073-f698fb26b018>", "WARC-Target-URI": "https://tool.oschina.net/uploads/apidocs/android/resources/samples/ApiDemos/src/com/example/android/apis/view/SearchViewActionBar.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:6fae0a33-0c1d-41ed-a00c-b100dab2ce30>" }, "warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-126\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, 7, 20, 22, 23, 48, 49, 56, 57, 186, 187, 190, 244, 247, 314, 382, 425, 428, 479, 482, 553, 622, 698, 769, 803, 807, 808, 847, 848, 883, 884, 913, 947, 982, 1014, 1040, 1066, 1100, 1130, 1156, 1184, 1237, 1267, 1301, 1333, 1334, 1357, 1358, 1362, 1439, 1528, 1532, 1626, 1627, 1663, 1697, 1698, 1712, 1769, 1813, 1876, 1877, 1932, 1933, 1998, 2004, 2005, 2019, 2071, 2112, 2113, 2164, 2223, 2288, 2351, 2388, 2389, 2410, 2416, 2417, 2473, 2474, 2508, 2562, 2579, 2655, 2724, 2734, 2735, 2831, 2868, 2961, 2962, 3030, 3117, 3170, 3224, 3307, 3339, 3357, 3371, 3420, 3430, 3431, 3481, 3487, 3488, 3543, 3594, 3616, 3622, 3623, 3676, 3742, 3764, 3770, 3771, 3802, 3842, 3864, 3870, 3871, 3914, 3936, 3942 ], "line_end_idx": [ 7, 20, 22, 23, 48, 49, 56, 57, 186, 187, 190, 244, 247, 314, 382, 425, 428, 479, 482, 553, 622, 698, 769, 803, 807, 808, 847, 848, 883, 884, 913, 947, 982, 1014, 1040, 1066, 1100, 1130, 1156, 1184, 1237, 1267, 1301, 1333, 1334, 1357, 1358, 1362, 1439, 1528, 1532, 1626, 1627, 1663, 1697, 1698, 1712, 1769, 1813, 1876, 1877, 1932, 1933, 1998, 2004, 2005, 2019, 2071, 2112, 2113, 2164, 2223, 2288, 2351, 2388, 2389, 2410, 2416, 2417, 2473, 2474, 2508, 2562, 2579, 2655, 2724, 2734, 2735, 2831, 2868, 2961, 2962, 3030, 3117, 3170, 3224, 3307, 3339, 3357, 3371, 3420, 3430, 3431, 3481, 3487, 3488, 3543, 3594, 3616, 3622, 3623, 3676, 3742, 3764, 3770, 3771, 3802, 3842, 3864, 3870, 3871, 3914, 3936, 3942, 3943 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3943, "ccnet_original_nlines": 124, "rps_doc_curly_bracket": 0.0065939598716795444, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.10381679236888885, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.03206107020378113, "rps_doc_frac_lines_end_with_ellipsis": 0.00800000037997961, "rps_doc_frac_no_alph_words": 0.41374045610427856, "rps_doc_frac_unique_words": 0.6126760840415955, "rps_doc_mean_word_length": 9.630281448364258, "rps_doc_num_sentences": 85, "rps_doc_symbol_to_word_ratio": 0.0015267200069501996, "rps_doc_unigram_entropy": 4.862490653991699, "rps_doc_word_count": 284, "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.021937839686870575, "rps_doc_frac_chars_top_3gram": 0.009506399743258953, "rps_doc_frac_chars_top_4gram": 0.011700180359184742, "rps_doc_books_importance": -341.2099609375, "rps_doc_books_importance_length_correction": -341.2099609375, "rps_doc_openwebtext_importance": -209.6385040283203, "rps_doc_openwebtext_importance_length_correction": -209.6385040283203, "rps_doc_wikipedia_importance": -161.19093322753906, "rps_doc_wikipedia_importance_length_correction": -161.19093322753906 }, "fasttext": { "dclm": 0.9740697145462036, "english": 0.3467411696910858, "fineweb_edu_approx": 1.6388399600982666, "eai_general_math": 0.8287901878356934, "eai_open_web_math": 0.08528625965118408, "eai_web_code": 0.6657308340072632 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "-1", "labels": { "level_1": "", "level_2": "", "level_3": "" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "-1", "label": "Abstain" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "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": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

7,903,426,027,024,591,000

Class: Stupidedi::Schema::LoopDef Inherits: AbstractDef show all Includes: Inspect Defined in: lib/stupidedi/schema/loop_def.rb Overview See Also: • 2.2.2 Loops • B.1.3.12.4 Loops of Data Segments Instance Attribute Summary collapse Constructors collapse Instance Method Summary collapse Methods included from Inspect #inspect Methods inherited from AbstractDef #component?, #composite?, #definition?, #element?, #functional_group?, #interchange?, #repeated?, #segment?, #simple?, #table?, #transaction_set?, #usage? Constructor Details #initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent) ⇒ LoopDef Returns a new instance of LoopDef 37 38 39 40 41 42 43 44 45 46 47 48 # File 'lib/stupidedi/schema/loop_def.rb', line 37 def initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent) @id, @repeat_count, @header_segment_uses, @loop_defs, @trailer_segment_uses, @parent = id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent # Delay re-parenting until the entire definition tree has a root # to prevent unnecessarily copying objects unless parent.nil? @header_segment_uses = @header_segment_uses.map{|x| x.copy(:parent => self) } @loop_defs = @loop_defs.map{|x| x.copy(:parent => self) } @trailer_segment_uses = @trailer_segment_uses.map{|x| x.copy(:parent => self) } end end Instance Attribute Details #header_segment_usesArray<SegmentUse> (readonly) Returns: 22 23 24 # File 'lib/stupidedi/schema/loop_def.rb', line 22 def header_segment_uses @header_segment_uses end #idString (readonly) Returns: • (String) 16 17 18 # File 'lib/stupidedi/schema/loop_def.rb', line 16 def id @id end #loop_defsArray<LoopDef> (readonly) Returns: 28 29 30 # File 'lib/stupidedi/schema/loop_def.rb', line 28 def loop_defs @loop_defs end #parentLoopDef, TableDef (readonly) Returns: 31 32 33 # File 'lib/stupidedi/schema/loop_def.rb', line 31 def parent @parent end #repeat_countRepeatCount (readonly) Returns: 19 20 21 # File 'lib/stupidedi/schema/loop_def.rb', line 19 def repeat_count @repeat_count end #trailer_segment_usesArray<SegmentUse> (readonly) Returns: 25 26 27 # File 'lib/stupidedi/schema/loop_def.rb', line 25 def trailer_segment_uses @trailer_segment_uses end Class Method Details .build(id, repeat_count, *children) ⇒ LoopDef Returns: 136 137 138 139 140 141 142 143 144 145 146 147 148 149 # File 'lib/stupidedi/schema/loop_def.rb', line 136 def build(id, repeat_count, *children) header, children = children.split_when{|x| x.is_a?(LoopDef) } loop_defs, trailer = children.split_when{|x| x.is_a?(SegmentUse) } # @todo: Ensure there is at least one SegmentUse in header if header.empty? raise Exceptions::InvalidSchemaError, "first child must be a SegmentUse" elsif header.head.repeat_count.include?(2) "first child must have RepeatCount.bounded(1)" end new(id, repeat_count, header, loop_defs, trailer, nil) end Instance Method Details #bounded?Boolean Returns: • (Boolean) See Also: • B.1.1.3.11.1 Loop Control Segments • B.1.1.3.12.4 Loops of Data Segments Bounded Loops 67 68 69 70 # File 'lib/stupidedi/schema/loop_def.rb', line 67 def bounded? @header_segment_uses.head.definition.id == :LS and @trailer_segment_uses.last.definition.id == :LE end #childrenArray<SegmentUse, LoopDef> Returns: 83 84 85 # File 'lib/stupidedi/schema/loop_def.rb', line 83 def children @header_segment_uses + @loop_defs + @trailer_segment_uses end #code_listsAbstractSet<CodeList> Returns: 97 98 99 # File 'lib/stupidedi/schema/loop_def.rb', line 97 def code_lists children.map(&:code_lists).inject(&:|) end #copy(changes = {}) ⇒ LoopDef Returns: 51 52 53 54 55 56 57 58 59 # File 'lib/stupidedi/schema/loop_def.rb', line 51 def copy(changes = {}) LoopDef.new \ changes.fetch(:id, @id), changes.fetch(:repeat_count, @repeat_count), changes.fetch(:header_segment_uses, @header_segment_uses), changes.fetch(:loop_defs, @loop_defs), changes.fetch(:trailer_segment_uses, @trailer_segment_uses), changes.fetch(:parent, @parent) end #emptyLoopVal Returns: • (LoopVal) 88 89 90 # File 'lib/stupidedi/schema/loop_def.rb', line 88 def empty Values::LoopVal.new(self, []) end #entry_segment_useSegmentUse Returns: 78 79 80 # File 'lib/stupidedi/schema/loop_def.rb', line 78 def entry_segment_use @header_segment_uses.head end #hierarchical?Boolean Returns: • (Boolean) See Also: • 5.6 HL-initiated Loop 73 74 75 # File 'lib/stupidedi/schema/loop_def.rb', line 73 def hierarchical? @header_segment_uses.head.definition.id == :HL end #loop?Boolean Returns: • (Boolean) 92 93 94 # File 'lib/stupidedi/schema/loop_def.rb', line 92 def loop? true end #pretty_print(q) This method returns an undefined value. 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 # File 'lib/stupidedi/schema/loop_def.rb', line 102 def pretty_print(q) q.text("LoopDef[#{@id}]") q.group(2, "(", ")") do q.breakable "" @header_segment_uses.each do |e| unless q.current_group.first? q.text "," q.breakable end q.pp e end @loop_defs.each do |e| unless q.current_group.first? q.text "," q.breakable end q.pp e end @trailer_segment_uses.each do |e| unless q.current_group.first? q.text "," q.breakable end q.pp e end end end #repeatable?Boolean Returns: • (Boolean) 61 62 63 # File 'lib/stupidedi/schema/loop_def.rb', line 61 def repeatable? @repeat_count.try{|r| r.include?(2) } end

{ "url": "http://www.rubydoc.info/github/kputnam/stupidedi/Stupidedi/Schema/LoopDef", "source_domain": "www.rubydoc.info", "snapshot_id": "crawl=CC-MAIN-2016-22", "warc_metadata": { "Content-Length": "58293", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VANY6LY3V6MB23R6ADG4RK6JHXDYKO4R", "WARC-Concurrent-To": "<urn:uuid:13a4e56b-9e87-4a01-822d-903921132f17>", "WARC-Date": "2016-05-28T07:57:25Z", "WARC-IP-Address": "173.255.227.96", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:24IGK62XOR7F4LOZTIIJG37YI7COUJHO", "WARC-Record-ID": "<urn:uuid:67d5c432-722a-41f3-b9d7-e1936ff2cacd>", "WARC-Target-URI": "http://www.rubydoc.info/github/kputnam/stupidedi/Stupidedi/Schema/LoopDef", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:bef956af-88a9-4c90-b59b-7639b62c0b48>" }, "warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 34, 35, 45, 66, 76, 84, 96, 129, 130, 139, 140, 150, 151, 167, 205, 206, 242, 243, 265, 266, 299, 300, 330, 331, 340, 341, 376, 377, 532, 533, 553, 554, 656, 657, 691, 692, 693, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 781, 782, 877, 966, 1049, 1050, 1117, 1162, 1183, 1266, 1339, 1423, 1429, 1433, 1434, 1461, 1462, 1511, 1512, 1521, 1522, 1523, 1524, 1527, 1530, 1533, 1584, 1585, 1609, 1632, 1636, 1637, 1658, 1659, 1668, 1669, 1682, 1683, 1684, 1687, 1690, 1693, 1744, 1745, 1752, 1758, 1762, 1763, 1799, 1800, 1809, 1810, 1811, 1812, 1815, 1818, 1821, 1872, 1873, 1887, 1900, 1904, 1905, 1941, 1942, 1951, 1952, 1953, 1954, 1957, 1960, 1963, 2014, 2015, 2026, 2036, 2040, 2041, 2077, 2078, 2087, 2088, 2089, 2090, 2093, 2096, 2099, 2150, 2151, 2168, 2184, 2188, 2189, 2239, 2240, 2249, 2250, 2251, 2252, 2255, 2258, 2261, 2312, 2313, 2338, 2362, 2366, 2367, 2388, 2389, 2435, 2436, 2445, 2446, 2447, 2448, 2452, 2456, 2460, 2464, 2468, 2472, 2476, 2480, 2484, 2488, 2492, 2496, 2500, 2504, 2556, 2557, 2596, 2662, 2731, 2732, 2793, 2812, 2854, 2895, 2940, 2991, 2997, 2998, 3055, 3059, 3060, 3084, 3085, 3102, 3103, 3112, 3113, 3127, 3128, 3138, 3139, 3178, 3232, 3233, 3234, 3237, 3240, 3243, 3246, 3297, 3298, 3311, 3364, 3414, 3418, 3419, 3455, 3456, 3465, 3466, 3467, 3468, 3471, 3474, 3477, 3528, 3529, 3542, 3602, 3606, 3607, 3640, 3641, 3650, 3651, 3652, 3653, 3656, 3659, 3662, 3713, 3714, 3729, 3770, 3774, 3775, 3805, 3806, 3815, 3816, 3817, 3818, 3821, 3824, 3827, 3830, 3833, 3836, 3839, 3842, 3845, 3896, 3897, 3920, 3936, 3965, 4014, 4077, 4120, 4185, 4221, 4225, 4226, 4240, 4241, 4250, 4251, 4265, 4266, 4267, 4270, 4273, 4276, 4327, 4328, 4338, 4370, 4374, 4375, 4404, 4405, 4414, 4415, 4416, 4417, 4420, 4423, 4426, 4477, 4478, 4500, 4528, 4532, 4533, 4555, 4556, 4565, 4566, 4580, 4581, 4591, 4592, 4618, 4619, 4620, 4623, 4626, 4629, 4680, 4681, 4699, 4748, 4752, 4753, 4767, 4768, 4777, 4778, 4792, 4793, 4794, 4797, 4800, 4803, 4854, 4855, 4865, 4872, 4876, 4877, 4894, 4895, 4935, 4936, 4937, 4938, 4942, 4946, 4950, 4954, 4958, 4962, 4966, 4970, 4974, 4978, 4982, 4986, 4990, 4994, 4998, 5002, 5006, 5010, 5014, 5018, 5022, 5026, 5030, 5034, 5038, 5042, 5046, 5098, 5099, 5119, 5147, 5173, 5192, 5229, 5265, 5284, 5304, 5314, 5327, 5335, 5362, 5398, 5417, 5437, 5447, 5460, 5468, 5506, 5542, 5561, 5581, 5591, 5604, 5612, 5618, 5622, 5623, 5643, 5644, 5653, 5654, 5668, 5669, 5670, 5673, 5676, 5679, 5730, 5731, 5747, 5787 ], "line_end_idx": [ 34, 35, 45, 66, 76, 84, 96, 129, 130, 139, 140, 150, 151, 167, 205, 206, 242, 243, 265, 266, 299, 300, 330, 331, 340, 341, 376, 377, 532, 533, 553, 554, 656, 657, 691, 692, 693, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 781, 782, 877, 966, 1049, 1050, 1117, 1162, 1183, 1266, 1339, 1423, 1429, 1433, 1434, 1461, 1462, 1511, 1512, 1521, 1522, 1523, 1524, 1527, 1530, 1533, 1584, 1585, 1609, 1632, 1636, 1637, 1658, 1659, 1668, 1669, 1682, 1683, 1684, 1687, 1690, 1693, 1744, 1745, 1752, 1758, 1762, 1763, 1799, 1800, 1809, 1810, 1811, 1812, 1815, 1818, 1821, 1872, 1873, 1887, 1900, 1904, 1905, 1941, 1942, 1951, 1952, 1953, 1954, 1957, 1960, 1963, 2014, 2015, 2026, 2036, 2040, 2041, 2077, 2078, 2087, 2088, 2089, 2090, 2093, 2096, 2099, 2150, 2151, 2168, 2184, 2188, 2189, 2239, 2240, 2249, 2250, 2251, 2252, 2255, 2258, 2261, 2312, 2313, 2338, 2362, 2366, 2367, 2388, 2389, 2435, 2436, 2445, 2446, 2447, 2448, 2452, 2456, 2460, 2464, 2468, 2472, 2476, 2480, 2484, 2488, 2492, 2496, 2500, 2504, 2556, 2557, 2596, 2662, 2731, 2732, 2793, 2812, 2854, 2895, 2940, 2991, 2997, 2998, 3055, 3059, 3060, 3084, 3085, 3102, 3103, 3112, 3113, 3127, 3128, 3138, 3139, 3178, 3232, 3233, 3234, 3237, 3240, 3243, 3246, 3297, 3298, 3311, 3364, 3414, 3418, 3419, 3455, 3456, 3465, 3466, 3467, 3468, 3471, 3474, 3477, 3528, 3529, 3542, 3602, 3606, 3607, 3640, 3641, 3650, 3651, 3652, 3653, 3656, 3659, 3662, 3713, 3714, 3729, 3770, 3774, 3775, 3805, 3806, 3815, 3816, 3817, 3818, 3821, 3824, 3827, 3830, 3833, 3836, 3839, 3842, 3845, 3896, 3897, 3920, 3936, 3965, 4014, 4077, 4120, 4185, 4221, 4225, 4226, 4240, 4241, 4250, 4251, 4265, 4266, 4267, 4270, 4273, 4276, 4327, 4328, 4338, 4370, 4374, 4375, 4404, 4405, 4414, 4415, 4416, 4417, 4420, 4423, 4426, 4477, 4478, 4500, 4528, 4532, 4533, 4555, 4556, 4565, 4566, 4580, 4581, 4591, 4592, 4618, 4619, 4620, 4623, 4626, 4629, 4680, 4681, 4699, 4748, 4752, 4753, 4767, 4768, 4777, 4778, 4792, 4793, 4794, 4797, 4800, 4803, 4854, 4855, 4865, 4872, 4876, 4877, 4894, 4895, 4935, 4936, 4937, 4938, 4942, 4946, 4950, 4954, 4958, 4962, 4966, 4970, 4974, 4978, 4982, 4986, 4990, 4994, 4998, 5002, 5006, 5010, 5014, 5018, 5022, 5026, 5030, 5034, 5038, 5042, 5046, 5098, 5099, 5119, 5147, 5173, 5192, 5229, 5265, 5284, 5304, 5314, 5327, 5335, 5362, 5398, 5417, 5437, 5447, 5460, 5468, 5506, 5542, 5561, 5581, 5591, 5604, 5612, 5618, 5622, 5623, 5643, 5644, 5653, 5654, 5668, 5669, 5670, 5673, 5676, 5679, 5730, 5731, 5747, 5787, 5790 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5790, "ccnet_original_nlines": 423, "rps_doc_curly_bracket": 0.0031088099349290133, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.07668232172727585, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.005477310158312321, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5297339558601379, "rps_doc_frac_unique_words": 0.5017856955528259, "rps_doc_mean_word_length": 7.189285755157471, "rps_doc_num_sentences": 127, "rps_doc_symbol_to_word_ratio": 0.04068858176469803, "rps_doc_unigram_entropy": 5.1192169189453125, "rps_doc_word_count": 560, "rps_doc_frac_chars_dupe_10grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_5grams": 0.11674118041992188, "rps_doc_frac_chars_dupe_6grams": 0.11674118041992188, "rps_doc_frac_chars_dupe_7grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_8grams": 0.08445107191801071, "rps_doc_frac_chars_dupe_9grams": 0.08445107191801071, "rps_doc_frac_chars_top_2gram": 0.13859911262989044, "rps_doc_frac_chars_top_3gram": 0.15648286044597626, "rps_doc_frac_chars_top_4gram": 0.053651269525289536, "rps_doc_books_importance": -503.99285888671875, "rps_doc_books_importance_length_correction": -503.99285888671875, "rps_doc_openwebtext_importance": -308.4957275390625, "rps_doc_openwebtext_importance_length_correction": -308.4957275390625, "rps_doc_wikipedia_importance": -266.1270446777344, "rps_doc_wikipedia_importance_length_correction": -266.1270446777344 }, "fasttext": { "dclm": 0.06765515357255936, "english": 0.44610467553138733, "fineweb_edu_approx": 2.3152780532836914, "eai_general_math": 0.6658350825309753, "eai_open_web_math": 0.2058066725730896, "eai_web_code": 0.35691434144973755 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.74", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "10", "label": "Knowledge Article" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "5", "label": "Exceptionally Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-6,414,317,273,701,722,000

Results See more... Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking (How-To) Jailbreaking your iPhone, iPad and iPod touch opens up your iDevices to a whole slew of possibilities that are otherwise not possible with Apple's default operating system. However, before you can ever hope to jailbreak, you have to ensure that you fulfill the necessary requirements like the supported devices and firmware versions. That is to say that jailbreaking isn't always an option. Take for example the iOS 6 jailbreak, it is currently limited only to older devices. However, there are iOS tweaks that don't require a jailbreak. For those who are rocking devices with no jailbreak, here are some Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking. iOS Tweaks You Can Do Right Now Without Jailbreaking Awesome iOS Tweaks You Can Do Right Now Without Jailbreaking Check Your iPhone's Actual Signal Strength Check Actual Signal Strength iPhone Let's face it, the default signal strength indicator on the iPhone isn't exactly the most accurate. Should you feel that your iPhone's signal strength indicator just doesn't cut it, you can perform the steps below to have the signal strength displayed in numbers [in decibels(dBm)] instead of bars. This is applicable for an iPhone running iOS 4.1 or later. 1. Launch your device's Phone app. 2. Dial these: *3001#12345#* 3. Then tap the Call button. This will cause your iPhone to enter in Field Test mode. You should notice that your signal strength indicator is displayed in numbers instead of the traditional signal bar. At this point, you can toggle between both signal strength mode by just tapping on it. If you want to the tweak to be permanent (but still reversible), then proceed with the next step. 4. Hold down the power button until you can see the Slide to Power Off button. 5. Let go of the Power button and press the Home button until the Field Test quits and you're back to the Home screen. The lower the number displayed, the stronger the signal. To return to the default signal bars, just dial *3001#12345#* again then tap call. Then just press the Home button twice to return to the default signal bar. Hide Stock iOS Apps Without Jailbreaking Hide-Stock-iOS-Apps If you find yourself annoyed by stock iOS apps cluttering your Springboard, there is a trick that will allow you to hide stock iOS apps without jailbreaking. You can do this via two web-based solutions which are both simple to perform. You are not actually deleting the app but instead you are hiding it temporarily. Rebooting your iPhone will cause the hidden apps to reappear. For a detailed tutorial on how to hide stock apps without jailbreaking, just click here. Use Siri to Ask Directions Via Google Maps Use Siri to Ask Directions Via Google Maps Now that Google Maps is back in iOS, users now have a solid alternative to Apple's iOS 6 Maps. While jailbreak users can easily make Google Maps the default mapping application on their iPhone, everyone else simply doesn't have that option yet unfortunately. This is one of the downsides of being inside the walled garden of iOS. However, there is a way for you to use Siri to get directions with Google Maps and of course, you won't need a jailbreak for this. The trick is actually pretty simple. Apple has actually included a little feature in Siri that will enable you to open an address using any third-party mapping application. Whenever you use Siri, you simply need to add “via transit” at the end of your voice command query. For example, you can say “Give me directions to the Empire State Building via transit” and this should have Siri open other mapping apps installed in your device or download from the iTunes App Store. Just tap Google Maps or any other map app of your choice for the required directions. This is a simple trick that makes your iPhone think that you require public transit directions, which iOS 6 Maps doesn't have. So you will be referred to a different map app. Just ensure that you toggle through car or walking depending on your needs. Tether Your iPhone's Data Connection Tether Your iPhone's Data Connection For the uninitiated, tethering allows you to connect to the internet using your laptop or other devices through your smartphone's data plan. In most cases, some carriers can provide tethering services to their clients but usually it would take additional charges. For a jailbreak user, he has numerous options when it comes to tethering jailbreak apps. However, there is a service that will let you tether your iPhone wirelessly without exorbitant fees, fancy hacking skills, or jailbreaking required. There is a web app called Tether.com that offers tethering services to iPhone owners. So you can take advantage of your iPhone's data plan for tethering just as long as you have cellular coverage. Basically, what you need to do is simply download the Tether app for your computer and visit tether.com/web on your iPhone. Then on your computer using the Tether app, you will setup an ad hoc network. The process is pretty straightforward and can be a little tricky in the beginning. To get a better idea about how the service works, check out the video below: Tether works just as advertised, although there is one minor catch. Tether is NOT free. In order to use the service, you will need to pay an annual fee of $29.95. Still, $30 is nothing next to the usual $20 fee you pay your carrier monthly for tethering privileges. This is especially a good deal for those who can't jailbreak their iPhones. Create Custom Vibrations for Your Contacts Create Custom Vibrations for Your Contacts Some features in iOS are not exactly marketed properly by Apple so some of them just earn the designation of being "hidden features." One such feature is the ability to create contact-specific custom vibrations. To access this feature, you will simply need to navigate to Settings > General > Accessibility > Custom Vibrations and enable the option. Then just go to your Phone app select a contact > Edit > vibration > Create New Vibration. Here you can easily create custom vibrations for that particular contact. Hide Newsstand Without Jailbreaking Hide Newsstand Without Jailbreaking Newsstand is an app that most people don't really care for. However for some reason, you won't be able to uninstall it or even just put it in a folder so it gets out of your sight. Well, here's an easy and fast solution to hide Newsstand using a Mac (Windows version coming soon). You will simply need to download Filippo Bigarella’s StifleStand. Just follow the steps below: 1. Download StifleStand (Mac only). 2. Launch StifleStand and plug your iOS device running iOS 5 or higher. 3. Wait until StifleStand detects your device. 4. Look for the Newsstand folder on your device. 5. Click the Hide Newsstand button in StifleStand. 6. You should see that the Newsstand app will disappear and a folder named Magic will take its place. This folder behaves just like a normal folder which means that you can move, rename, or fill it with additional apps. If you wish to restore Newsstand, just open the folder, go into Wiggle Mode and drag the Newsstand icon outside the folder. Again, this tweak is for Mac users only. And there you have it, some of the most noteworthy iOS tweaks that you can do without jailbreaking your device. These may not be the most elegant solutions for a particular problem but they're certainly better than nothing. This is especially true if jailbreaking is not an option. Got other iOS tweaks that require no jailbreak to share? Contact Us for News Tips, Corrections and Feedback Related posts 5 comments Leave a message... • KitchenKnives5 years, 2 months ago I used another method to put Newsstand into a folder. Does this one still crash the springboard if you try to open it? • KitchenKnives5 years, 2 months ago I used another method of putting Newsstand into a folder, does this one still crash the springboard if you try to open it? • Patrick Gumban5 years, 1 month ago I believe that such bug is present when you try to open the Newsstand folder. Feel free to share your method. :) • Mike5 years, 2 months ago How do you change the AT&T to Tim? • Patrick Gumban5 years, 1 month ago You can use a jailbreak tweak like ChangeCarrier or Zeppelin to customize the carrier name on your iPhone. Hope this helps!

{ "url": "http://jaxov.com/2012/12/ios-tweaks-without-jailbreaking/", "source_domain": "jaxov.com", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "48401", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:BLX6H547SIJC7SORMJJAFTRHYXATUZSS", "WARC-Concurrent-To": "<urn:uuid:cf804f30-ccd9-4a5a-9fcc-5e80e9d8c550>", "WARC-Date": "2018-02-21T15:20:11Z", "WARC-IP-Address": "209.58.137.71", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:ESDTDEZ732VH474ESPKDQCUZHMD5I37A", "WARC-Record-ID": "<urn:uuid:3eddbf1c-1247-436f-997e-b19f417419d5>", "WARC-Target-URI": "http://jaxov.com/2012/12/ios-tweaks-without-jailbreaking/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:fef61099-773b-477b-a8dd-b8572b4be1b9>" }, "warc_info": "robots: classic\r\nhostname: ip-10-184-2-158.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 8, 9, 21, 22, 92, 93, 760, 761, 814, 815, 876, 877, 920, 921, 957, 958, 1316, 1317, 1354, 1385, 1775, 1856, 1977, 1978, 2193, 2194, 2235, 2236, 2256, 2257, 2725, 2726, 2769, 2770, 2813, 2814, 3312, 3313, 3836, 3837, 4088, 4089, 4126, 4127, 4164, 4165, 4667, 4668, 5227, 5228, 5570, 5571, 5614, 5615, 5658, 5659, 6174, 6175, 6211, 6212, 6248, 6249, 6625, 6626, 6664, 6738, 6787, 6838, 6891, 6995, 6996, 7279, 7280, 7562, 7563, 7620, 7621, 7672, 7673, 7687, 7688, 7699, 7718, 7719, 7725, 7764, 7765, 7888, 7889, 7895, 7934, 7935, 8062, 8063, 8071, 8112, 8113, 8232, 8233, 8239, 8269, 8270, 8310, 8311, 8319, 8360, 8361 ], "line_end_idx": [ 8, 9, 21, 22, 92, 93, 760, 761, 814, 815, 876, 877, 920, 921, 957, 958, 1316, 1317, 1354, 1385, 1775, 1856, 1977, 1978, 2193, 2194, 2235, 2236, 2256, 2257, 2725, 2726, 2769, 2770, 2813, 2814, 3312, 3313, 3836, 3837, 4088, 4089, 4126, 4127, 4164, 4165, 4667, 4668, 5227, 5228, 5570, 5571, 5614, 5615, 5658, 5659, 6174, 6175, 6211, 6212, 6248, 6249, 6625, 6626, 6664, 6738, 6787, 6838, 6891, 6995, 6996, 7279, 7280, 7562, 7563, 7620, 7621, 7672, 7673, 7687, 7688, 7699, 7718, 7719, 7725, 7764, 7765, 7888, 7889, 7895, 7934, 7935, 8062, 8063, 8071, 8112, 8113, 8232, 8233, 8239, 8269, 8270, 8310, 8311, 8319, 8360, 8361, 8490 ] }

{ "red_pajama_v2": { "ccnet_original_length": 8490, "ccnet_original_nlines": 107, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.40500298142433167, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0035735599230974913, "rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383, "rps_doc_frac_no_alph_words": 0.14770697057247162, "rps_doc_frac_unique_words": 0.33847230672836304, "rps_doc_mean_word_length": 4.6930623054504395, "rps_doc_num_sentences": 98, "rps_doc_symbol_to_word_ratio": 0.0035735599230974913, "rps_doc_unigram_entropy": 5.483918190002441, "rps_doc_word_count": 1427, "rps_doc_frac_chars_dupe_10grams": 0.058533668518066406, "rps_doc_frac_chars_dupe_5grams": 0.12826639413833618, "rps_doc_frac_chars_dupe_6grams": 0.11333432793617249, "rps_doc_frac_chars_dupe_7grams": 0.08406749367713928, "rps_doc_frac_chars_dupe_8grams": 0.07555621862411499, "rps_doc_frac_chars_dupe_9grams": 0.06510377675294876, "rps_doc_frac_chars_top_2gram": 0.013438849709928036, "rps_doc_frac_chars_top_3gram": 0.007167390082031488, "rps_doc_frac_chars_top_4gram": 0.008959240280091763, "rps_doc_books_importance": -600.0208740234375, "rps_doc_books_importance_length_correction": -600.0208740234375, "rps_doc_openwebtext_importance": -445.2013244628906, "rps_doc_openwebtext_importance_length_correction": -445.2013244628906, "rps_doc_wikipedia_importance": -286.8431396484375, "rps_doc_wikipedia_importance_length_correction": -286.8431396484375 }, "fasttext": { "dclm": 0.0328027606010437, "english": 0.9115947484970093, "fineweb_edu_approx": 1.5155234336853027, "eai_general_math": 0.02391826920211315, "eai_open_web_math": 0.1624191403388977, "eai_web_code": 0.006699199788272381 } }

{ "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": "621.392", "labels": { "level_1": "Industrial arts, Technology, and Engineering", "level_2": "Engineering", "level_3": "Mechanical engineering and Machinery" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "12", "label": "Listicle" } }, "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

6,981,409,602,795,445,000

C#学习教程：System.MissingMethodException：json数组的反序列化时出错分享 System.MissingMethodException：json数组的反序列化时出错反序列化jsonString时出错。错误是Type 'oodleListingsUser' is not supported for deserialization of an array. 我的反序列化代码是 string jsonString = new WebClient().DownloadString("http://api.oodle.com/api/v2/listings?key=TEST&region=region_value&category=category_value&format=json"); JavaScriptSerializer ser = new JavaScriptSerializer(); jsonOodleApi p = ser.Deserialize(jsonString); 我对jsonOodleApi的定义是 public class jsonOodleApi { public oodleCurrent current; public oodleListings[] listings; public oodleMeta meta; public string state { get; set; } } 定义oodleCurrentoodleMeta我不给予因为它的完美！ oodleListings的定义是 public class oodleListings { public string id { get; set; } public string title { get; set; } public oodleListingsUser user; // I have skipped some of fields because it have no issue at all. } oodleListingsUser的定义是 public class oodleListingsUser { public string id { get; set; } public string url { get; set; } public string name { get; set; } public string photo { get; set; } } 问题是我的jsonString有时只返回一个user的值（ oodleListingsUser的类型），有时它返回用户的数组，有时它返回用户的null！当它只返回一个用户时，它运行得非常好！没有任何问题。但是当它返回用户数组时，绽放！错误发生Type 'oodleListingsUser' is not supported for deserialization of an array. 即使我已经尝试过public oodleListingsUser[] user但是它给出了错误 No parameterless constructor defined for type of 'oodleListingsUser[]' 对于只返回一个用户的值！现在我该怎么做才能解决这个问题？尝试： public oodleListings[] listings = new oodleListings[0]; 或者将其List 上述就是C#学习教程：System.MissingMethodException：json数组的反序列化时出错分享的全部内容，如果对大家有所用处且需要了解更多关于C#学习教程，希望大家多多关注—猴子技术宅（www.ssfiction.com）本文来自网络收集，不代表猴子技术宅立场，如涉及侵权请点击右边联系管理员删除。如若转载，请注明出处：https://www.ssfiction.com/ckf/1031705.html 发表评论邮箱地址不会被公开。必填项已用*标注

{ "url": "https://www.ssfiction.com/ckf/1031705.html", "source_domain": "www.ssfiction.com", "snapshot_id": "crawl=CC-MAIN-2022-05", "warc_metadata": { "Content-Length": "53208", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:VURHFJ2YKPL43TZTZ4GYXOWAIJNXGIAX", "WARC-Concurrent-To": "<urn:uuid:f9b403e2-7dde-4113-bcb3-1f69ed6e1d30>", "WARC-Date": "2022-01-17T03:35:04Z", "WARC-IP-Address": "47.108.50.60", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LKIILJSBTK67WHRKUVCYL2Z3TLJR2J5X", "WARC-Record-ID": "<urn:uuid:578b2b3c-bb2a-44d8-a649-760a89a149ca>", "WARC-Target-URI": "https://www.ssfiction.com/ckf/1031705.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:30394f39-0c56-4f1b-a36f-5164bc9d251a>" }, "warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-118\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 54, 55, 56, 101, 102, 121, 122, 200, 201, 211, 212, 473, 474, 493, 494, 645, 646, 681, 682, 700, 701, 896, 897, 919, 920, 1087, 1088, 1165, 1166, 1194, 1195, 1291, 1292, 1340, 1341, 1414, 1415, 1428, 1429, 1446, 1447, 1451, 1452, 1510, 1511, 1520, 1521, 1643, 1644, 1683, 1684, 1738, 1739, 1744, 1745 ], "line_end_idx": [ 54, 55, 56, 101, 102, 121, 122, 200, 201, 211, 212, 473, 474, 493, 494, 645, 646, 681, 682, 700, 701, 896, 897, 919, 920, 1087, 1088, 1165, 1166, 1194, 1195, 1291, 1292, 1340, 1341, 1414, 1415, 1428, 1429, 1446, 1447, 1451, 1452, 1510, 1511, 1520, 1521, 1643, 1644, 1683, 1684, 1738, 1739, 1744, 1745, 1764 ] }

{ "red_pajama_v2": { "ccnet_original_length": 1764, "ccnet_original_nlines": 55, "rps_doc_curly_bracket": 0.011337869800627232, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.11501596868038177, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.015974439680576324, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.4760383367538452, "rps_doc_frac_unique_words": 0.5642856955528259, "rps_doc_mean_word_length": 10.321428298950195, "rps_doc_num_sentences": 17, "rps_doc_symbol_to_word_ratio": 0.009584659710526466, "rps_doc_unigram_entropy": 4.008687973022461, "rps_doc_word_count": 140, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_6grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_7grams": 0.12456747144460678, "rps_doc_frac_chars_dupe_8grams": 0.08027681708335876, "rps_doc_frac_chars_dupe_9grams": 0.08027681708335876, "rps_doc_frac_chars_top_2gram": 0.058131489902734756, "rps_doc_frac_chars_top_3gram": 0.041522491723299026, "rps_doc_frac_chars_top_4gram": 0.04982699081301689, "rps_doc_books_importance": -109.83870697021484, "rps_doc_books_importance_length_correction": -101.89079284667969, "rps_doc_openwebtext_importance": -71.67254638671875, "rps_doc_openwebtext_importance_length_correction": -71.67254638671875, "rps_doc_wikipedia_importance": -56.265838623046875, "rps_doc_wikipedia_importance_length_correction": -52.96495056152344 }, "fasttext": { "dclm": 0.9835176467895508, "english": 0.09122200310230255, "fineweb_edu_approx": 2.8210346698760986, "eai_general_math": 0.10074961185455322, "eai_open_web_math": 0.062226951122283936, "eai_web_code": 0.9934364557266235 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1332", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.133", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "23", "label": "Tutorial" }, "secondary": { "code": "8", "label": "Documentation" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "3", "label": "Mostly Correct" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,299,193,589,465,291,000

Sensuctl Sensuctl is a command line tool for managing resources within Sensu. It works by calling Sensu’s underlying API to create, read, update, and delete resources, events, and entities. Sensuctl is available for Linux, macOS, and Windows. See the installation guide to install and configure sensuctl. Getting help Sensuctl supports a --help flag for each command and subcommand. # See command and global flags sensuctl --help # See subcommands and flags sensuctl check --help # See usage and flags sensuctl check delete --help First-time setup To set up sensuctl, run sensuctl configure to log in to sensuctl and connect to the Sensu backend. sensuctl configure When prompted, input the Sensu backend URL and your Sensu access credentials. ? Sensu Backend URL: http://127.0.0.1:8080 ? Username: admin ? Password: P@ssw0rd! ? Namespace: default ? Preferred output format: tabular Sensu backend URL The HTTP or HTTPS URL where sensuctl can connect to the Sensu backend server, defaulting to http://127.0.0.1:8080. When connecting to a Sensu cluster, connect sensuctl to any single backend in the cluster. For more information on configuring the Sensu backend URL, see the backend reference. Username | password | namespace By default, Sensu includes a user named admin with password P@ssw0rd! and a default namespace. Your ability to get, list, create, update, and delete resources with sensuctl depends on the permissions assigned to your Sensu user. For more information about configuring Sensu access control, see the RBAC reference. Preferred output format Sensuctl supports the following output formats: Once logged in, you can change the output format using sensuctl config set-format or set it per command using the --format flag. Managing sensuctl The sencutl config command lets you view the current sensuctl configuration and set the namespace and output format. View sensuctl config To view the active configuration for sensuctl: sensuctl config view Sensuctl configuration includes the Sensu backend url, Sensu edition (Core or Enterprise), the default output format for the current user, and the default namespace for the current user. api-url: http://127.0.0.1:8080 edition: core format: wrapped-json namespace: default Set output format You can use the set-format command to change the default output format for the current user. For example, to change the output format to tabular: sensuctl config set-format tabular Set namespace You can use the set-namespace command to change the default namespace for the current user. For more information about configuring Sensu access control, see the RBAC reference. For example, to change the default namespace to development: sensuctl config set-namespace development Log out of sensuctl To log out of sensuctl: sensuctl logout To log back in: sensuctl configure View the sensuctl version number To display the current version of sensuctl: sensuctl version Global flags Global flags modify settings specific to sensuctl, such as the Sensu backend URL and namespace. You can use global flags with most sensuctl commands. --api-url string host URL of Sensu installation --cache-dir string path to directory containing cache & temporary files --config-dir string path to directory containing configuration files --namespace string namespace in which we perform actions (default: "default") Creating resources The sensuctl create command allows you to create or update resources by reading from STDIN or a flag configured file (-f). The create command accepts Sensu resource definitions in wrapped-json and yaml. Both JSON and YAML resource definitions wrap the contents of the resource in spec and identify the resource type (see below for an example, and this table for a list of supported types). See the reference docs for information about creating resource definitions. For example, the following file my-resources.json specifies two resources: a marketing-site check and a slack handler. { "type": "CheckConfig", "spec": { "command": "check-http.go -u https://dean-learner.book", "subscriptions": ["demo"], "interval": 15, "handlers": ["slack"], "metadata" : { "name": "marketing-site", "namespace": "default" } } } { "type": "Handler", "api_version": "core/v2", "metadata": { "name": "slack", "namespace": "default" }, "spec": { "command": "sensu-slack-handler --channel '#monitoring'", "env_vars": [ "SLACK_WEBHOOK_URL=https://hooks.slack.com/services/T00000000/B00000000/XXXXXXXXXXXXXXXXXXXXXXXX" ], "filters": [ "is_incident", "not_silenced" ], "handlers": [], "runtime_assets": [], "timeout": 0, "type": "pipe" } } NOTE: Commas cannot be included between JSON resource definitions when using sensuctl create. To create all resources from my-resources.json using sensuctl create: sensuctl create --file my-resources.json Or: cat my-resources.json | sensuctl create sensuctl create resource types sensuctl create types AdhocRequest adhoc_request Asset asset CheckConfig check_config ClusterRole cluster_role ClusterRoleBinding cluster_role_binding Entity entity Event event EventFilter event_filter Handler handler Hook hook HookConfig hook_config Mutator mutator Namespace namespace Role role RoleBinding role_binding Silenced silenced Updating resources Sensuctl allows you to update resource definitions using a text editor. To use sensuctl edit, specify the resource type and resource name. For example, to edit a handler named slack using sensuctl edit: sensuctl edit handler slack sensuctl edit resource types sensuctl edit types asset check cluster cluster-role cluster-role-binding entity event filter handler hook mutator namespace role role-binding silenced user Managing resources Sensuctl provides the following commands to manage Sensu resources. Subcommands Sensuctl provides a standard set of list, info, and delete operations for most resource types. list list resources info NAME show detailed resource information given resource name delete NAME delete resource given resource name For example, to list all monitoring checks: sensuctl check list To write all checks to my-resources.json in wrapped-json format: sensuctl check list --format wrapped-json > my-resources.json To see the definition for a check named check-cpu in wrapped-json format: sensuctl check info check-cpu --format wrapped-json In addition to the standard operations, commands may support subcommands or flags that allow you to take special action based on the resource type; the following sections call out those resource-specific operations. For a list of subcommands specific to a resource, run sensuctl TYPE --help. sensuctl check In addition to the standard subcommands, sensuctl provides a command to execute a check on demand, given the check name. sensuctl check execute NAME For example, the following command executes the check-cpu check with an attached message: sensuctl check execute check-cpu --reason "giving a sensuctl demo" You can also use the --subscriptions flag to override the subscriptions in the check definition: sensuctl check execute check-cpu --subscriptions demo,webserver sensuctl cluster The sensuctl cluster command lets you manage a Sensu cluster using the following subcommands. health get sensu health status member-add add cluster member to an existing cluster, with comma-separated peer addresses member-list list cluster members member-remove remove cluster member by ID member-update update cluster member by ID with comma-separated peer addresses To view cluster members: sensuctl cluster member-list To see the health of your Sensu cluster: sensuctl cluster health sensuctl event In addition to the standard subcommands, sensuctl provides a command to resolve an event. sensuctl event resolve ENTITY CHECK For example, the following command manually resolves an event created by the entity webserver1 and the check check-http: sensuctl event resolve webserver1 check-http sensuctl namespace See the RBAC reference for information about using access control with namespaces. sensuctl user See the RBAC reference for information about local user management with sensuctl. Time formats Sensuctl supports multiple time formats depending on the manipulated resource. Supported canonical time zone IDs are defined in the tz database. WARNING: Canonical zone IDs (i.e. America/Vancouver) are not supported on Windows. Dates with time Full dates with time are used to specify an exact point in time, which can be used with silencing entries, for example. The following formats are supported: • RFC3339 with numeric zone offset: 2018-05-10T07:04:00-08:00 or 2018-05-10T15:04:00Z • RFC3339 with space delimiters and numeric zone offset: 2018-05-10 07:04:00 -08:00 • Sensu alpha legacy format with canonical zone ID: May 10 2018 7:04AM America/Vancouver Shell auto-completion Installation (Bash Shell) Make sure bash completion is installed. If you use a current Linux in a non-minimal installation, bash completion should be available. On macOS, install with: brew install bash-completion Then add the following to your ~/.bash_profile: if [ -f $(brew --prefix)/etc/bash_completion ]; then . $(brew --prefix)/etc/bash_completion fi Once bash-completion is available, add the following to your ~/.bash_profile: source <(sensuctl completion bash) You can now source your ~/.bash_profile or launch a new terminal to utilize completion. source ~/.bash_profile Installation (ZSH) Add the following to your ~/.zshrc: source <(sensuctl completion zsh) You can now source your ~/.zshrc or launch a new terminal to utilize completion. source ~/.zshrc Usage sensuctl Tab check configure event user asset completion entity handler sensuctl check Tab create delete import list Configuration files During configuration, sensuctl creates configuration files that contain information for connecting to your Sensu Go deployment. You can find them at $HOME/.config/sensu/sensuctl/profile and $HOME/.config/sensu/sensuctl/profile. For example: cat .config/sensu/sensuctl/profile { "format": "tabular", "namespace": "demo" } cat .config/sensu/sensuctl/cluster { "api-url": "http://localhost:8080", "trusted-ca-file": "", "insecure-skip-tls-verify": false, "access_token": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "expires_at": 1550082282, "refresh_token": "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx" } These are useful if you want to know what cluster you’re connecting to, or what namespace you’re currently configured to use.

{ "url": "https://docs.uchiwa.io/sensu-go/5.1/sensuctl/reference/", "source_domain": "docs.uchiwa.io", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "78388", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:CQNJ4XG3BE6MGGNXBEPBGZ7W6JQ5CNH3", "WARC-Concurrent-To": "<urn:uuid:bd305436-2207-4014-9dc4-6ccd8af3277d>", "WARC-Date": "2019-03-26T18:17:51Z", "WARC-IP-Address": "52.2.175.150", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:XU23ME47MP6Y2XEGNDVZD3JWZ6Z67UKD", "WARC-Record-ID": "<urn:uuid:eebd5c32-6fd8-4dba-bbea-4e07620da97f>", "WARC-Target-URI": "https://docs.uchiwa.io/sensu-go/5.1/sensuctl/reference/", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b495698d-328c-490e-ac7c-3587bbf254d2>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-63-100-22.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 17, 18, 314, 315, 328, 329, 394, 395, 426, 442, 443, 471, 493, 494, 516, 545, 546, 563, 564, 663, 664, 683, 684, 762, 763, 806, 824, 846, 867, 902, 903, 921, 922, 1214, 1215, 1247, 1248, 1562, 1563, 1587, 1588, 1636, 1637, 1766, 1767, 1785, 1786, 1903, 1904, 1925, 1926, 1973, 1974, 1995, 1996, 2183, 2184, 2215, 2229, 2250, 2269, 2270, 2288, 2289, 2435, 2436, 2471, 2472, 2486, 2487, 2725, 2726, 2768, 2769, 2789, 2790, 2814, 2815, 2831, 2832, 2848, 2849, 2868, 2869, 2902, 2903, 2947, 2948, 2965, 2966, 2979, 2980, 3130, 3131, 3186, 3264, 3337, 3420, 3421, 3440, 3441, 3907, 3908, 4027, 4028, 4030, 4055, 4067, 4128, 4159, 4179, 4206, 4225, 4257, 4286, 4292, 4296, 4298, 4300, 4321, 4349, 4365, 4386, 4413, 4418, 4430, 4492, 4510, 4614, 4621, 4638, 4659, 4680, 4687, 4707, 4733, 4751, 4770, 4774, 4776, 4777, 4871, 4872, 4942, 4943, 4984, 4985, 4989, 4990, 5030, 5031, 5062, 5063, 5085, 5124, 5174, 5228, 5265, 5291, 5330, 5360, 5403, 5404, 5423, 5424, 5563, 5564, 5628, 5629, 5657, 5658, 5687, 5688, 5708, 5741, 5782, 5813, 5845, 5846, 5865, 5866, 5934, 5935, 5947, 5948, 6043, 6044, 6086, 6168, 6231, 6232, 6276, 6277, 6297, 6298, 6363, 6364, 6426, 6427, 6501, 6502, 6554, 6555, 6847, 6848, 6863, 6864, 6985, 6986, 7014, 7015, 7105, 7106, 7173, 7174, 7271, 7272, 7336, 7337, 7354, 7355, 7449, 7450, 7491, 7587, 7625, 7670, 7751, 7752, 7777, 7778, 7807, 7808, 7849, 7850, 7874, 7875, 7890, 7891, 7981, 7982, 8018, 8019, 8140, 8141, 8186, 8187, 8206, 8207, 8290, 8291, 8305, 8306, 8388, 8389, 8402, 8403, 8548, 8549, 8632, 8633, 8649, 8650, 8807, 8808, 8896, 8982, 9073, 9074, 9096, 9097, 9123, 9124, 9283, 9284, 9313, 9314, 9362, 9363, 9416, 9455, 9458, 9459, 9537, 9538, 9573, 9574, 9662, 9663, 9686, 9687, 9706, 9707, 9743, 9744, 9778, 9779, 9860, 9861, 9877, 9878, 9884, 9885, 9898, 9899, 9940, 9984, 9985, 10004, 10005, 10034, 10035, 10055, 10056, 10297, 10298, 10333, 10335, 10358, 10380, 10382, 10418, 10420, 10458, 10483, 10520, 10572, 10600, 10652, 10654, 10655 ], "line_end_idx": [ 1, 2, 3, 4, 5, 6, 7, 8, 17, 18, 314, 315, 328, 329, 394, 395, 426, 442, 443, 471, 493, 494, 516, 545, 546, 563, 564, 663, 664, 683, 684, 762, 763, 806, 824, 846, 867, 902, 903, 921, 922, 1214, 1215, 1247, 1248, 1562, 1563, 1587, 1588, 1636, 1637, 1766, 1767, 1785, 1786, 1903, 1904, 1925, 1926, 1973, 1974, 1995, 1996, 2183, 2184, 2215, 2229, 2250, 2269, 2270, 2288, 2289, 2435, 2436, 2471, 2472, 2486, 2487, 2725, 2726, 2768, 2769, 2789, 2790, 2814, 2815, 2831, 2832, 2848, 2849, 2868, 2869, 2902, 2903, 2947, 2948, 2965, 2966, 2979, 2980, 3130, 3131, 3186, 3264, 3337, 3420, 3421, 3440, 3441, 3907, 3908, 4027, 4028, 4030, 4055, 4067, 4128, 4159, 4179, 4206, 4225, 4257, 4286, 4292, 4296, 4298, 4300, 4321, 4349, 4365, 4386, 4413, 4418, 4430, 4492, 4510, 4614, 4621, 4638, 4659, 4680, 4687, 4707, 4733, 4751, 4770, 4774, 4776, 4777, 4871, 4872, 4942, 4943, 4984, 4985, 4989, 4990, 5030, 5031, 5062, 5063, 5085, 5124, 5174, 5228, 5265, 5291, 5330, 5360, 5403, 5404, 5423, 5424, 5563, 5564, 5628, 5629, 5657, 5658, 5687, 5688, 5708, 5741, 5782, 5813, 5845, 5846, 5865, 5866, 5934, 5935, 5947, 5948, 6043, 6044, 6086, 6168, 6231, 6232, 6276, 6277, 6297, 6298, 6363, 6364, 6426, 6427, 6501, 6502, 6554, 6555, 6847, 6848, 6863, 6864, 6985, 6986, 7014, 7015, 7105, 7106, 7173, 7174, 7271, 7272, 7336, 7337, 7354, 7355, 7449, 7450, 7491, 7587, 7625, 7670, 7751, 7752, 7777, 7778, 7807, 7808, 7849, 7850, 7874, 7875, 7890, 7891, 7981, 7982, 8018, 8019, 8140, 8141, 8186, 8187, 8206, 8207, 8290, 8291, 8305, 8306, 8388, 8389, 8402, 8403, 8548, 8549, 8632, 8633, 8649, 8650, 8807, 8808, 8896, 8982, 9073, 9074, 9096, 9097, 9123, 9124, 9283, 9284, 9313, 9314, 9362, 9363, 9416, 9455, 9458, 9459, 9537, 9538, 9573, 9574, 9662, 9663, 9686, 9687, 9706, 9707, 9743, 9744, 9778, 9779, 9860, 9861, 9877, 9878, 9884, 9885, 9898, 9899, 9940, 9984, 9985, 10004, 10005, 10034, 10035, 10055, 10056, 10297, 10298, 10333, 10335, 10358, 10380, 10382, 10418, 10420, 10458, 10483, 10520, 10572, 10600, 10652, 10654, 10655, 10780 ] }

{ "red_pajama_v2": { "ccnet_original_length": 10780, "ccnet_original_nlines": 339, "rps_doc_curly_bracket": 0.001484230044297874, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.2168494462966919, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.021934200078248978, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.2572283148765564, "rps_doc_frac_unique_words": 0.27916964888572693, "rps_doc_mean_word_length": 5.962777614593506, "rps_doc_num_sentences": 87, "rps_doc_symbol_to_word_ratio": 0.0019940200727432966, "rps_doc_unigram_entropy": 5.242739677429199, "rps_doc_word_count": 1397, "rps_doc_frac_chars_dupe_10grams": 0.03241296857595444, "rps_doc_frac_chars_dupe_5grams": 0.13661465048789978, "rps_doc_frac_chars_dupe_6grams": 0.07755102217197418, "rps_doc_frac_chars_dupe_7grams": 0.06986795365810394, "rps_doc_frac_chars_dupe_8grams": 0.05258103087544441, "rps_doc_frac_chars_dupe_9grams": 0.043217290192842484, "rps_doc_frac_chars_top_2gram": 0.015846339985728264, "rps_doc_frac_chars_top_3gram": 0.010804319754242897, "rps_doc_frac_chars_top_4gram": 0.00864346046000719, "rps_doc_books_importance": -870.2305908203125, "rps_doc_books_importance_length_correction": -870.2305908203125, "rps_doc_openwebtext_importance": -608.1761474609375, "rps_doc_openwebtext_importance_length_correction": -608.1761474609375, "rps_doc_wikipedia_importance": -465.58343505859375, "rps_doc_wikipedia_importance_length_correction": -465.58343505859375 }, "fasttext": { "dclm": 0.0573388896882534, "english": 0.6924066543579102, "fineweb_edu_approx": 2.4440648555755615, "eai_general_math": 0.7361815571784973, "eai_open_web_math": 0.059112489223480225, "eai_web_code": 0.8036242127418518 } }

{ "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.457", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "4", "label": "Missing Images or Figures" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

5,806,152,193,819,645,000

source: rtems/c/src/lib/libbsp/shared/console.c @ 1c6926c1 Last change on this file since 1c6926c1 was 1c6926c1, checked in by Kevin Kirspel <kevin-kirspel@…>, on Mar 21, 2017 at 7:39:48 PM termios: Synchronize with latest FreeBSD headers Adding modified FreeBSD headers to synchronize RTEMS termios with FreeBSD. Modify termios to support dedicated input and output baud for termios structure. Updated BSPs to use dedicated input and output baud in termios structure. Updated tools to use dedicated input and output baud in termios structure. Updated termios testsuites to use dedicated input and output baud in termios structure. Close #2897. • Property mode set to 100644 File size: 9.6 KB Line 1/** 2 * @file 3 * 4 * @ingroup Console 5 * 6 * @brief Extension of the generic libchip console driver shell 7 */ 8 9/* 10 * COPYRIGHT (c) 1989-2011, 2016. 11 * On-Line Applications Research Corporation (OAR). 12 * 13 * The license and distribution terms for this file may be 14 * found in the file LICENSE in this distribution or at 15 * http://www.rtems.org/license/LICENSE. 16 */ 17 18#include <bsp.h> 19#include <bsp/fatal.h> 20#include <rtems/libio.h> 21#include <rtems/console.h> 22#include <stdlib.h> 23#include <assert.h> 24#include <termios.h> 25 26#include <rtems/termiostypes.h> 27#include <libchip/serial.h> 28#include "console_private.h" 29 30unsigned long Console_Port_Count = 0; 31console_tbl **Console_Port_Tbl = NULL; 32console_data *Console_Port_Data = NULL; 33rtems_device_minor_number Console_Port_Minor = 0; 34static bool console_initialized = false; 35 36/* 37 * console_find_console_entry 38 * 39 * This method is used to search the console entries for a 40 * specific device entry. 41 */ 42console_tbl* console_find_console_entry( 43 const char *match, 44 size_t length, 45 rtems_device_minor_number *match_minor 46) 47{ 48 rtems_device_minor_number minor; 49 50 /* 51 * The the match name is NULL get the minor number entry. 52 */ 53 if (match == NULL) { 54 if (*match_minor < Console_Port_Count) 55 return Console_Port_Tbl[*match_minor]; 56 return NULL; 57 } 58 59 for (minor=0; minor < Console_Port_Count ; minor++) { 60 console_tbl *cptr = Console_Port_Tbl[minor]; 61 62 /* 63 * Console table entries include /dev/ prefix, device names passed 64 * in on command line do not. 65 */ 66 if ( !strncmp( cptr->sDeviceName, match, length ) ) { 67 *match_minor = minor; 68 return cptr; 69 } 70 } 71 72 return NULL; 73} 74 75/* 76 * console_initialize_data 77 * 78 * This method is used to initialize the table of pointers to the 79 * serial port configuration structure entries. 80 */ 81void console_initialize_data(void) 82{ 83 int i; 84 85 if ( Console_Port_Tbl ) 86 return; 87 88 /* 89 * Allocate memory for the table of device pointers. 90 */ 91 Console_Port_Count = Console_Configuration_Count; 92 Console_Port_Tbl = malloc( Console_Port_Count * sizeof( console_tbl * ) ); 93 if (Console_Port_Tbl == NULL) 94 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_0 ); 95 96 /* 97 * Allocate memory for the table of device specific data pointers. 98 */ 99 Console_Port_Data = calloc( Console_Port_Count, sizeof( console_data ) ); 100 if ( Console_Port_Data == NULL ) { 101 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_3 ); 102 } 103 104 /* 105 * Fill in the Console Table 106 */ 107 for (i=0 ; i < Console_Port_Count ; i++) { 108 Console_Port_Tbl[i] = &Console_Configuration_Ports[i]; 109 } 110} 111 112/* 113 * console_register_devices 114 * 115 * This method is used to add dynamically discovered devices to the 116 * set of serial ports supported. 117 */ 118void console_register_devices( 119 console_tbl *new_ports, 120 size_t number_of_ports 121) 122{ 123 int old_number_of_ports; 124 int i; 125 126 /* 127 * Initialize the console data elements 128 */ 129 console_initialize_data(); 130 131 /* 132 * console_initialize() has been invoked so it is now too late to 133 * register devices. 134 */ 135 if ( console_initialized ) { 136 bsp_fatal( BSP_FATAL_CONSOLE_MULTI_INIT ); 137 } 138 139 /* 140 * Allocate memory for the console port extension 141 */ 142 old_number_of_ports = Console_Port_Count; 143 Console_Port_Count += number_of_ports; 144 Console_Port_Tbl = realloc( 145 Console_Port_Tbl, 146 Console_Port_Count * sizeof(console_tbl *) 147 ); 148 if ( Console_Port_Tbl == NULL ) { 149 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_1 ); 150 } 151 152 /* 153 * Since we can only add devices before console_initialize(), 154 * the data area will contain no information and must be zero 155 * before it is used. So extend the area and zero it out. 156 */ 157 Console_Port_Data = realloc( 158 Console_Port_Data, 159 Console_Port_Count * sizeof(console_data) 160 ); 161 if ( Console_Port_Data == NULL ) { 162 bsp_fatal( BSP_FATAL_CONSOLE_NO_MEMORY_2 ); 163 } 164 memset(Console_Port_Data, '\0', Console_Port_Count * sizeof(console_data)); 165 166 /* 167 * Now add the new devices at the end. 168 */ 169 for (i=0 ; i < number_of_ports ; i++) { 170 Console_Port_Tbl[old_number_of_ports + i] = &new_ports[i]; 171 } 172} 173 174/* 175 * console_open 176 * 177 * open a port as a termios console. 178 */ 179rtems_device_driver console_open( 180 rtems_device_major_number major, 181 rtems_device_minor_number minor, 182 void * arg 183) 184{ 185 rtems_status_code status; 186 rtems_libio_open_close_args_t *args = arg; 187 rtems_libio_ioctl_args_t IoctlArgs; 188 struct termios Termios; 189 rtems_termios_callbacks Callbacks; 190 console_tbl *cptr; 191 struct rtems_termios_tty *current_tty; 192 193 /* 194 * Verify the port number is valid. 195 */ 196 if ( minor > Console_Port_Count ) { 197 return RTEMS_INVALID_NUMBER; 198 } 199 200 /* 201 * Open the port as a termios console driver. 202 */ 203 204 cptr = Console_Port_Tbl[minor]; 205 Callbacks.firstOpen = cptr->pDeviceFns->deviceFirstOpen; 206 Callbacks.lastClose = cptr->pDeviceFns->deviceLastClose; 207 Callbacks.pollRead = cptr->pDeviceFns->deviceRead; 208 Callbacks.write = cptr->pDeviceFns->deviceWrite; 209 Callbacks.setAttributes = cptr->pDeviceFns->deviceSetAttributes; 210 if (cptr->pDeviceFlow != NULL) { 211 Callbacks.stopRemoteTx = cptr->pDeviceFlow->deviceStopRemoteTx; 212 Callbacks.startRemoteTx = cptr->pDeviceFlow->deviceStartRemoteTx; 213 } else { 214 Callbacks.stopRemoteTx = NULL; 215 Callbacks.startRemoteTx = NULL; 216 } 217 Callbacks.outputUsesInterrupts = cptr->pDeviceFns->deviceOutputUsesInterrupts; 218 219 /* XXX what about 220 * Console_Port_Tbl[minor].ulMargin, 221 * Console_Port_Tbl[minor].ulHysteresis); 222 */ 223 224 status = rtems_termios_open( major, minor, arg, &Callbacks ); 225 Console_Port_Data[minor].termios_data = args->iop->data1; 226 227 /* Get tty pointur from the Console_Port_Data */ 228 current_tty = Console_Port_Data[minor].termios_data; 229 230 if ( (current_tty->refcount == 1) ) { 231 232 /* 233 * If this BSP has a preferred default rate, then use that. 234 */ 235 #if defined(BSP_DEFAULT_BAUD_RATE) 236 rtems_termios_set_initial_baud( current_tty, BSP_DEFAULT_BAUD_RATE ); 237 #endif 238 239 /* 240 * If it's the first open, modified, if need, the port parameters 241 */ 242 if ( minor != Console_Port_Minor ) { 243 /* 244 * If this is not the console we do not want ECHO and so forth 245 */ 246 IoctlArgs.iop = args->iop; 247 IoctlArgs.command = TIOCGETA; 248 IoctlArgs.buffer = &Termios; 249 rtems_termios_ioctl( &IoctlArgs ); 250 251 Termios.c_lflag = ICANON; 252 IoctlArgs.command = TIOCSETA; 253 rtems_termios_ioctl( &IoctlArgs ); 254 } 255 } 256 257 if ( (args->iop->flags&LIBIO_FLAGS_READ) && 258 cptr->pDeviceFlow && 259 cptr->pDeviceFlow->deviceStartRemoteTx) { 260 cptr->pDeviceFlow->deviceStartRemoteTx(minor); 261 } 262 263 return status; 264} 265 266/* 267 * console_close 268 * 269 * This routine closes a port that has been opened as console. 270 */ 271rtems_device_driver console_close( 272 rtems_device_major_number major, 273 rtems_device_minor_number minor, 274 void * arg 275) 276{ 277 rtems_libio_open_close_args_t *args = arg; 278 struct rtems_termios_tty *current_tty; 279 console_tbl *cptr; 280 281 cptr = Console_Port_Tbl[minor]; 282 283 /* Get tty pointer from the Console_Port_Data */ 284 current_tty = Console_Port_Data[minor].termios_data; 285 286 /* Get the tty refcount to determine if we need to do deviceStopRemoteTx. 287 * Stop only if it's the last one opened. 288 */ 289 if ( (current_tty->refcount == 1) ) { 290 if ( (args->iop->flags&LIBIO_FLAGS_READ) && 291 cptr->pDeviceFlow && 292 cptr->pDeviceFlow->deviceStopRemoteTx) { 293 cptr->pDeviceFlow->deviceStopRemoteTx(minor); 294 } 295 } 296 297 return rtems_termios_close (arg); 298} 299 300/* 301 * console_initialize 302 * 303 * Routine called to initialize the console device driver. 304 */ 305rtems_device_driver console_initialize( 306 rtems_device_major_number major, 307 rtems_device_minor_number minor_arg, 308 void *arg 309) 310{ 311 rtems_status_code status; 312 rtems_device_minor_number minor; 313 console_tbl *port; 314 315 /* 316 * If we have no devices which were registered earlier then we 317 * must still initialize pointers for Console_Port_Tbl and 318 * Console_Port_Data. 319 */ 320 console_initialize_data(); 321 322 /* 323 * console_initialize has been invoked so it is now too late to 324 * register devices. 325 */ 326 console_initialized = true; 327 328 /* 329 * Initialize the termio interface, our table of pointers to device 330 * information structures, and determine if the user has explicitly 331 * specified which device is to be used for the console. 332 */ 333 rtems_termios_initialize(); 334 bsp_console_select(); 335 336 /* 337 * Iterate over all of the console devices we know about 338 * and initialize them. 339 */ 340 for (minor=0 ; minor < Console_Port_Count ; minor++) { 341 /* 342 * First perform the configuration dependent probe, then the 343 * device dependent probe 344 */ 345 port = Console_Port_Tbl[minor]; 346 347 if ( (!port->deviceProbe || port->deviceProbe(minor)) && 348 port->pDeviceFns->deviceProbe(minor)) { 349 350 if (port->sDeviceName != NULL) { 351 status = rtems_io_register_name( port->sDeviceName, major, minor ); 352 if (status != RTEMS_SUCCESSFUL) { 353 bsp_fatal( BSP_FATAL_CONSOLE_REGISTER_DEV_0 ); 354 } 355 } 356 357 if (minor == Console_Port_Minor) { 358 status = rtems_io_register_name( CONSOLE_DEVICE_NAME, major, minor ); 359 if (status != RTEMS_SUCCESSFUL) { 360 bsp_fatal( BSP_FATAL_CONSOLE_REGISTER_DEV_1 ); 361 } 362 } 363 364 /* 365 * Initialize the hardware device. 366 */ 367 port->pDeviceFns->deviceInitialize(minor); 368 369 } 370 } 371 372 return RTEMS_SUCCESSFUL; 373} Note: See TracBrowser for help on using the repository browser.

{ "url": "https://devel.rtems.org/browser/rtems/c/src/lib/libbsp/shared/console.c?rev=1c6926c11f2e5efcb166c668b097d64a0321d66e", "source_domain": "devel.rtems.org", "snapshot_id": "crawl=CC-MAIN-2019-30", "warc_metadata": { "Content-Length": "67005", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:HIUGM74X4T5CF7HSWS3M7CE47HJHIY3W", "WARC-Concurrent-To": "<urn:uuid:bda7c6f4-43e6-4356-a3ad-f74637e04bf3>", "WARC-Date": "2019-07-17T02:42:38Z", "WARC-IP-Address": "140.211.10.146", "WARC-Identified-Payload-Type": "application/xhtml+xml", "WARC-Payload-Digest": "sha1:426OCQRK2N742YT3CQACXCXZZE33VANS", "WARC-Record-ID": "<urn:uuid:dadae7fd-b95d-4e69-8b88-a0e45913346e>", "WARC-Target-URI": "https://devel.rtems.org/browser/rtems/c/src/lib/libbsp/shared/console.c?rev=1c6926c11f2e5efcb166c668b097d64a0321d66e", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:b40c136d-77b7-4071-b192-8aa373b4e480>" }, "warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-153-241-164.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 59, 60, 191, 192, 241, 242, 308, 379, 450, 520, 591, 635, 636, 649, 650, 682, 700, 706, 711, 721, 725, 746, 750, 815, 820, 822, 826, 863, 918, 923, 985, 1044, 1088, 1094, 1097, 1116, 1141, 1168, 1197, 1219, 1241, 1264, 1267, 1301, 1331, 1362, 1365, 1420, 1478, 1536, 1591, 1650, 1653, 1658, 1691, 1696, 1758, 1787, 1793, 1836, 1874, 1913, 1956, 1960, 1964, 2002, 2005, 2012, 2074, 2082, 2107, 2152, 2199, 2218, 2224, 2227, 2285, 2337, 2340, 2349, 2422, 2458, 2468, 2528, 2558, 2579, 2587, 2593, 2596, 2613, 2617, 2620, 2625, 2655, 2660, 2729, 2780, 2786, 2823, 2827, 2838, 2841, 2869, 2883, 2886, 2893, 2950, 2958, 3012, 3093, 3127, 3177, 3180, 3187, 3258, 3266, 3345, 3385, 3436, 3443, 3447, 3455, 3489, 3498, 3546, 3608, 3615, 3620, 3624, 3630, 3662, 3668, 3740, 3778, 3785, 3819, 3848, 3882, 3887, 3892, 3923, 3936, 3940, 3948, 3993, 4002, 4034, 4038, 4046, 4118, 4145, 4154, 4188, 4238, 4245, 4249, 4257, 4313, 4322, 4369, 4413, 4446, 4471, 4521, 4529, 4568, 4619, 4626, 4630, 4638, 4705, 4772, 4835, 4844, 4878, 4904, 4953, 4961, 5001, 5052, 5059, 5140, 5144, 5152, 5197, 5206, 5251, 5318, 5325, 5330, 5334, 5340, 5360, 5366, 5407, 5414, 5451, 5489, 5527, 5562, 5567, 5572, 5616, 5664, 5711, 5756, 5803, 5845, 5894, 5898, 5906, 5947, 5956, 5997, 6033, 6040, 6044, 6052, 6103, 6112, 6116, 6153, 6226, 6299, 6367, 6436, 6513, 6551, 6623, 6696, 6710, 6749, 6788, 6795, 6879, 6883, 6906, 6955, 7009, 7018, 7022, 7089, 7152, 7156, 7210, 7268, 7272, 7315, 7319, 7329, 7397, 7408, 7450, 7529, 7543, 7547, 7557, 7630, 7641, 7685, 7697, 7769, 7782, 7822, 7861, 7900, 7944, 7948, 7985, 8024, 8068, 8077, 8084, 8088, 8137, 8167, 8218, 8272, 8279, 8283, 8303, 8308, 8312, 8318, 8339, 8345, 8412, 8419, 8457, 8495, 8533, 8568, 8573, 8578, 8626, 8675, 8717, 8721, 8759, 8763, 8817, 8875, 8879, 8958, 9005, 9014, 9057, 9108, 9142, 9196, 9251, 9260, 9267, 9271, 9310, 9315, 9319, 9325, 9351, 9357, 9420, 9427, 9470, 9509, 9552, 9588, 9593, 9598, 9638, 9677, 9715, 9719, 9727, 9795, 9859, 9886, 9895, 9927, 9931, 9939, 10009, 10036, 10045, 10078, 10082, 10090, 10164, 10238, 10301, 10310, 10343, 10370, 10374, 10382, 10445, 10475, 10484, 10544, 10554, 10623, 10657, 10668, 10707, 10711, 10775, 10827, 10831, 10873, 10952, 10997, 11057, 11070, 11081, 11085, 11129, 11210, 11255, 11315, 11328, 11339, 11343, 11355, 11399, 11412, 11464, 11468, 11477, 11484, 11488, 11518, 11523 ], "line_end_idx": [ 59, 60, 191, 192, 241, 242, 308, 379, 450, 520, 591, 635, 636, 649, 650, 682, 700, 706, 711, 721, 725, 746, 750, 815, 820, 822, 826, 863, 918, 923, 985, 1044, 1088, 1094, 1097, 1116, 1141, 1168, 1197, 1219, 1241, 1264, 1267, 1301, 1331, 1362, 1365, 1420, 1478, 1536, 1591, 1650, 1653, 1658, 1691, 1696, 1758, 1787, 1793, 1836, 1874, 1913, 1956, 1960, 1964, 2002, 2005, 2012, 2074, 2082, 2107, 2152, 2199, 2218, 2224, 2227, 2285, 2337, 2340, 2349, 2422, 2458, 2468, 2528, 2558, 2579, 2587, 2593, 2596, 2613, 2617, 2620, 2625, 2655, 2660, 2729, 2780, 2786, 2823, 2827, 2838, 2841, 2869, 2883, 2886, 2893, 2950, 2958, 3012, 3093, 3127, 3177, 3180, 3187, 3258, 3266, 3345, 3385, 3436, 3443, 3447, 3455, 3489, 3498, 3546, 3608, 3615, 3620, 3624, 3630, 3662, 3668, 3740, 3778, 3785, 3819, 3848, 3882, 3887, 3892, 3923, 3936, 3940, 3948, 3993, 4002, 4034, 4038, 4046, 4118, 4145, 4154, 4188, 4238, 4245, 4249, 4257, 4313, 4322, 4369, 4413, 4446, 4471, 4521, 4529, 4568, 4619, 4626, 4630, 4638, 4705, 4772, 4835, 4844, 4878, 4904, 4953, 4961, 5001, 5052, 5059, 5140, 5144, 5152, 5197, 5206, 5251, 5318, 5325, 5330, 5334, 5340, 5360, 5366, 5407, 5414, 5451, 5489, 5527, 5562, 5567, 5572, 5616, 5664, 5711, 5756, 5803, 5845, 5894, 5898, 5906, 5947, 5956, 5997, 6033, 6040, 6044, 6052, 6103, 6112, 6116, 6153, 6226, 6299, 6367, 6436, 6513, 6551, 6623, 6696, 6710, 6749, 6788, 6795, 6879, 6883, 6906, 6955, 7009, 7018, 7022, 7089, 7152, 7156, 7210, 7268, 7272, 7315, 7319, 7329, 7397, 7408, 7450, 7529, 7543, 7547, 7557, 7630, 7641, 7685, 7697, 7769, 7782, 7822, 7861, 7900, 7944, 7948, 7985, 8024, 8068, 8077, 8084, 8088, 8137, 8167, 8218, 8272, 8279, 8283, 8303, 8308, 8312, 8318, 8339, 8345, 8412, 8419, 8457, 8495, 8533, 8568, 8573, 8578, 8626, 8675, 8717, 8721, 8759, 8763, 8817, 8875, 8879, 8958, 9005, 9014, 9057, 9108, 9142, 9196, 9251, 9260, 9267, 9271, 9310, 9315, 9319, 9325, 9351, 9357, 9420, 9427, 9470, 9509, 9552, 9588, 9593, 9598, 9638, 9677, 9715, 9719, 9727, 9795, 9859, 9886, 9895, 9927, 9931, 9939, 10009, 10036, 10045, 10078, 10082, 10090, 10164, 10238, 10301, 10310, 10343, 10370, 10374, 10382, 10445, 10475, 10484, 10544, 10554, 10623, 10657, 10668, 10707, 10711, 10775, 10827, 10831, 10873, 10952, 10997, 11057, 11070, 11081, 11085, 11129, 11210, 11255, 11315, 11328, 11339, 11343, 11355, 11399, 11412, 11464, 11468, 11477, 11484, 11488, 11518, 11523, 11586 ] }

{ "red_pajama_v2": { "ccnet_original_length": 11586, "ccnet_original_nlines": 391, "rps_doc_curly_bracket": 0.00500603998079896, "rps_doc_ldnoobw_words": 1, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.13159145414829254, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.02042754925787449, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.5320665240287781, "rps_doc_frac_unique_words": 0.5855048894882202, "rps_doc_mean_word_length": 6.37785005569458, "rps_doc_num_sentences": 75, "rps_doc_symbol_to_word_ratio": 0.006650830153375864, "rps_doc_unigram_entropy": 6.143853187561035, "rps_doc_word_count": 1228, "rps_doc_frac_chars_dupe_10grams": 0.03345249965786934, "rps_doc_frac_chars_dupe_5grams": 0.06652195751667023, "rps_doc_frac_chars_dupe_6grams": 0.04187947139143944, "rps_doc_frac_chars_dupe_7grams": 0.04187947139143944, "rps_doc_frac_chars_dupe_8grams": 0.03345249965786934, "rps_doc_frac_chars_dupe_9grams": 0.03345249965786934, "rps_doc_frac_chars_top_2gram": 0.01021450012922287, "rps_doc_frac_chars_top_3gram": 0.008682330138981342, "rps_doc_frac_chars_top_4gram": 0.011746680364012718, "rps_doc_books_importance": -974.9349975585938, "rps_doc_books_importance_length_correction": -974.9349975585938, "rps_doc_openwebtext_importance": -532.4391479492188, "rps_doc_openwebtext_importance_length_correction": -532.4391479492188, "rps_doc_wikipedia_importance": -358.9370422363281, "rps_doc_wikipedia_importance_length_correction": -358.9370422363281 }, "fasttext": { "dclm": 0.03720211982727051, "english": 0.15387077629566193, "fineweb_edu_approx": 2.3745322227478027, "eai_general_math": 0.000012280000191822182, "eai_open_web_math": 0.6671059727668762, "eai_web_code": 0.930761992931366 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "004.16", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "3", "label": "Academic Writing" } }, "reasoning_depth": { "primary": { "code": "4", "label": "Advanced Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "4", "label": "Graduate/Expert Level" }, "secondary": { "code": "3", "label": "Undergraduate Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-714,125,805,937,551,900

Splunk® Enterprise Search Reference Download manual as PDF Download topic as PDF from Description The from command retrieves data from a dataset, such as a data model dataset, a CSV lookup, a KV Store lookup, a saved search, or a table dataset. Design a search that uses the from command to reference a dataset. Optionally add additional SPL such as lookups, eval expressions, and transforming commands to the search Save the result as a report, alert, or dashboard panel. If you use Splunk Cloud, or use Splunk Enterprise and have installed the Splunk Datasets Add-on, you can also save the search as a table dataset. See the Usage section. Syntax | from <dataset_type>:<dataset_name> Required arguments <dataset_type> Syntax: <dataset_type> Description: The type of dataset. Valid values are: datamodel, inputlookup, and savedsearch. The datamodel dataset type can be either a data model dataset or a table dataset. You create data model datasets with the Data Model Editor. You can create table datasets with the Table Editor if you use Splunk Cloud or use Splunk Enterprise and have installed the Splunk Datasets Add-on. The inputlookup dataset type can be either a CSV lookup or a KV Store lookup. The savedsearch dataset type is a saved search. You can use from to reference any saved search as a dataset. See About datasets in the Knowledge Manager Manual. <dataset_name> Syntax: <dataset_name> Description: The name of the dataset that you want to retrieve data from. If the dataset_type is a data model, the syntax is <datamodel_name>.<dataset_name>. If the name of the dataset contains spaces, enclose the dataset name in quotation marks. Example: If the data model name is internal_server, and the dataset name is splunkdaccess, specify internal_server.splunkdaccess for the dataset_name. In older versions of the Splunk software, the term "data model object" was used. That term has been replaced with "data model dataset". Optional arguments None. Usage When you use the from command, you must reference an existing dataset. You can reference any dataset listed in the Datasets listing page (data model datasets, CSV lookup files, CSV lookup definitions, and table datasets). You can also reference saved searches and KV Store lookup definitions. See View and manage datasets in the Knowledge Manager Manual. When you create a report, alert, dashboard panel, or table dataset that is based on a from search that references a dataset, that knowledge object has a dependency on the referenced dataset. This is dataset extension. When you make a change to the original dataset, such as removing or adding fields, that change propagates down to the reports, alerts, dashboard panels, and tables that have been extended from that original dataset. See Dataset extension in the Knowledge Manager Manual. The from command is a generating command, and should be the first command in the search. Generating commands use a leading pipe character. However, you can use the from command inside the append command. Examples 1. Search a data model Search a data model that contains internal server log events for REST API calls. In this example, internal_server is the data model name and splunkdaccess is the dataset inside the internal_server data model. | from datamodel:internal_server.splunkdaccess 2. Search a lookup file Search a lookup file that contains geographic attributes for each country, such as continent, two-letter ISO code, and subregion. | from inputlookup:geo_attr_countries.csv 3. Retrieve data by using a lookup file Search the contents of the KV store collection kvstorecoll that have a CustID value greater than 500 and a CustName value that begins with the letter P. The collection is referenced in a lookup table called kvstorecoll_lookup. Using the stats command, provide a count of the events received from the table. | from inputlookup:kvstorecoll_lookup | where (CustID>500) AND (CustName="P*") | stats count 4. Retrieve data using a saved search Retrieve the timestamp and client IP from the saved search called mysecurityquery. | from savedsearch:mysecurityquery | fields _time clientip ... 5. Specify a dataset name that contains spaces When the name of a dataset includes spaces, enclose the dataset name in quotation marks. | from savedsearch:"Top five sourcetypes" See also inputlookup, datamodel PREVIOUS format NEXT gauge This documentation applies to the following versions of Splunk® Enterprise: 6.5.0, 6.5.1, 6.5.1612 (Splunk Cloud only), 6.5.2, 6.5.3, 6.5.4, 6.5.5, 6.5.6, 6.5.7, 6.5.8, 6.5.9, 6.6.0, 6.6.1, 6.6.2, 6.6.3, 6.6.4, 6.6.5, 6.6.6, 6.6.7, 6.6.8, 7.0.0, 7.0.1, 7.0.2, 7.0.3, 7.0.4, 7.1.0, 7.1.1 Was this documentation topic helpful? Enter your email address, and someone from the documentation team will respond to you: Please provide your comments here. Ask a question or make a suggestion. You must be logged into splunk.com in order to post comments. Log in now. Please try to keep this discussion focused on the content covered in this documentation topic. If you have a more general question about Splunk functionality or are experiencing a difficulty with Splunk, consider posting a question to Splunkbase Answers. 0 out of 1000 Characters

{ "url": "http://docs.splunk.com/Documentation/Splunk/7.1.0/SearchReference/From", "source_domain": "docs.splunk.com", "snapshot_id": "crawl=CC-MAIN-2018-26", "warc_metadata": { "Content-Length": "115859", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:6ZIIBXST6RCC7NEFSA3727XOUGDXBTZK", "WARC-Concurrent-To": "<urn:uuid:bd2efedc-6b83-42a6-b989-7334d5326f02>", "WARC-Date": "2018-06-20T13:41:15Z", "WARC-IP-Address": "52.42.79.172", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:DOGRJ7KRLCWYUIZHZQS5YCEXQTAZ2DTR", "WARC-Record-ID": "<urn:uuid:56628af2-7498-4c1d-b183-15cf08f9c770>", "WARC-Target-URI": "http://docs.splunk.com/Documentation/Splunk/7.1.0/SearchReference/From", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:e35d12bf-877a-4786-a5ee-7dc44930490d>" }, "warc_info": "robots: classic\r\nhostname: ip-10-164-228-103.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 19, 20, 37, 38, 61, 62, 84, 85, 90, 91, 103, 104, 251, 252, 626, 627, 650, 651, 658, 659, 696, 697, 716, 717, 732, 755, 848, 1137, 1215, 1324, 1376, 1391, 1414, 1661, 1812, 1813, 1949, 1950, 1969, 1970, 1976, 1977, 1983, 1984, 2339, 2340, 2829, 2830, 2969, 2970, 3035, 3036, 3045, 3046, 3069, 3070, 3279, 3280, 3327, 3328, 3352, 3353, 3483, 3484, 3526, 3527, 3567, 3568, 3875, 3876, 3969, 3970, 4008, 4009, 4092, 4093, 4156, 4157, 4204, 4205, 4294, 4295, 4337, 4338, 4347, 4348, 4371, 4372, 4381, 4388, 4395, 4401, 4402, 4689, 4690, 4691, 4729, 4730, 4817, 4818, 4890, 4891, 4965, 4966, 5221, 5222 ], "line_end_idx": [ 19, 20, 37, 38, 61, 62, 84, 85, 90, 91, 103, 104, 251, 252, 626, 627, 650, 651, 658, 659, 696, 697, 716, 717, 732, 755, 848, 1137, 1215, 1324, 1376, 1391, 1414, 1661, 1812, 1813, 1949, 1950, 1969, 1970, 1976, 1977, 1983, 1984, 2339, 2340, 2829, 2830, 2969, 2970, 3035, 3036, 3045, 3046, 3069, 3070, 3279, 3280, 3327, 3328, 3352, 3353, 3483, 3484, 3526, 3527, 3567, 3568, 3875, 3876, 3969, 3970, 4008, 4009, 4092, 4093, 4156, 4157, 4204, 4205, 4294, 4295, 4337, 4338, 4347, 4348, 4371, 4372, 4381, 4388, 4395, 4401, 4402, 4689, 4690, 4691, 4729, 4730, 4817, 4818, 4890, 4891, 4965, 4966, 5221, 5222, 5246 ] }

{ "red_pajama_v2": { "ccnet_original_length": 5246, "ccnet_original_nlines": 106, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.29038113355636597, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.018148820847272873, "rps_doc_frac_lines_end_with_ellipsis": 0.00934579037129879, "rps_doc_frac_no_alph_words": 0.2912885844707489, "rps_doc_frac_unique_words": 0.3595505654811859, "rps_doc_mean_word_length": 5.148564338684082, "rps_doc_num_sentences": 113, "rps_doc_symbol_to_word_ratio": 0.0009074399713426828, "rps_doc_unigram_entropy": 4.962739944458008, "rps_doc_word_count": 801, "rps_doc_frac_chars_dupe_10grams": 0.037827350199222565, "rps_doc_frac_chars_dupe_5grams": 0.1025703176856041, "rps_doc_frac_chars_dupe_6grams": 0.08680891990661621, "rps_doc_frac_chars_dupe_7grams": 0.05868088826537132, "rps_doc_frac_chars_dupe_8grams": 0.05868088826537132, "rps_doc_frac_chars_dupe_9grams": 0.037827350199222565, "rps_doc_frac_chars_top_2gram": 0.028370510786771774, "rps_doc_frac_chars_top_3gram": 0.016973810270428658, "rps_doc_frac_chars_top_4gram": 0.015276430174708366, "rps_doc_books_importance": -389.4061279296875, "rps_doc_books_importance_length_correction": -389.4061279296875, "rps_doc_openwebtext_importance": -208.5775146484375, "rps_doc_openwebtext_importance_length_correction": -208.5775146484375, "rps_doc_wikipedia_importance": -122.48080444335938, "rps_doc_wikipedia_importance_length_correction": -122.48080444335938 }, "fasttext": { "dclm": 0.18088054656982422, "english": 0.7831308841705322, "fineweb_edu_approx": 2.270883321762085, "eai_general_math": 0.6186164617538452, "eai_open_web_math": 0.06681478023529053, "eai_web_code": 0.8714621663093567 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.467", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.776", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

4,565,873,978,345,464,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. I am trying to write a regular expression to match any string that satisfies the following criteria. The string begins and ends with a matching pair of parentheses '(' ')' There may be any number of parentheses within it. For example my regex shud match : ( ( p(x)+q(x) ) . (p(x) * q(x) ) ) but not match ( p(x)+q(x) ) . ( p(x) * q(x) ) How do i write such a regex share|improve this question Are you trying to say that all the internal parenthesis must match as well? If that is the case, I believe you would need to use a Push-Down-Automata instead of a regular expression to solve that, as a Finite-State-Automata (which define the space for a regex) does not allow for that type of a check. – aperkins Sep 13 '10 at 16:11 To clarify my comment - if you are looking for a regex to solve a[n]b[n], where you have an equal number of a – aperkins Sep 13 '10 at 16:11 dangit - stupid enter key - continuing: an equal number of a's and b's, then you would not be able to solve that general case with a regular expression. Based on what you have described, it seems like that is what you are looking for (in a variation, of course) which would require a PDA. – aperkins Sep 13 '10 at 16:12 To clarify, i am assuming that in my input all parentheses match. The only issue is that i want to capture those strings where the very first '(' matches the last ')'. That is, something like ( ... ) – AnkurVj Sep 13 '10 at 16:21 Now if i write a regex like ^$.*$$ JavaStyle then i match also the strings of the form (..)(..) and not just ( .... ) – AnkurVj Sep 13 '10 at 16:23 show 1 more comment 2 Answers 2 up vote 2 down vote accepted Please do a better search next time: http://www.google.com/search?q=site%3Astackoverflow.com+regex+match+parentheses&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a Here's your answer: http://stackoverflow.com/questions/546433/regular-expression-to-match-outer-brackets share|improve this answer Thanx for the pointer – AnkurVj Sep 13 '10 at 16:32 Yep, as the accepted answer notes - this is a simple algorithmic problem, not really appropriate for regex. Thanks for the link. – aperkins Sep 13 '10 at 16:55 add comment Doing any sort of parsing like this using regular expressions is difficult and almost always a bad idea. See this answer to this question. Oh, the horror! share|improve this answer lol nicely put by the author – AnkurVj Sep 13 '10 at 17:24 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/3702206/matching-parantheses-using-a-regular-expression", "source_domain": "stackoverflow.com", "snapshot_id": "crawl=CC-MAIN-2014-23", "warc_metadata": { "Content-Length": "79859", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:V5AP5E7U7SFCYAHWVAWS4PSQMYOP5CCM", "WARC-Concurrent-To": "<urn:uuid:42a15804-5588-4d32-beea-320acf4195b8>", "WARC-Date": "2014-07-23T23:01:48Z", "WARC-IP-Address": "198.252.206.16", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:XBDO2ZA4XPKZZAQAWBWNZWQ6F24WZRY5", "WARC-Record-ID": "<urn:uuid:03ef4be3-4a21-4793-95a4-435f40d7658b>", "WARC-Target-URI": "http://stackoverflow.com/questions/3702206/matching-parantheses-using-a-regular-expression", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:01ff89ec-8b42-4b77-af1c-616d3f433bd6>" }, "warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 25, 157, 158, 259, 260, 331, 332, 382, 383, 417, 418, 453, 454, 468, 469, 501, 502, 530, 531, 559, 564, 898, 903, 1045, 1050, 1371, 1376, 1607, 1612, 1763, 1783, 1784, 1796, 1797, 1826, 1827, 2015, 2016, 2121, 2122, 2148, 2153, 2206, 2211, 2372, 2384, 2385, 2540, 2541, 2567, 2572, 2632, 2644, 2645, 2657, 2658, 2660, 2668, 2669, 2747, 2748 ], "line_end_idx": [ 25, 157, 158, 259, 260, 331, 332, 382, 383, 417, 418, 453, 454, 468, 469, 501, 502, 530, 531, 559, 564, 898, 903, 1045, 1050, 1371, 1376, 1607, 1612, 1763, 1783, 1784, 1796, 1797, 1826, 1827, 2015, 2016, 2121, 2122, 2148, 2153, 2206, 2211, 2372, 2384, 2385, 2540, 2541, 2567, 2572, 2632, 2644, 2645, 2657, 2658, 2660, 2668, 2669, 2747, 2748, 2838 ] }

{ "red_pajama_v2": { "ccnet_original_length": 2838, "ccnet_original_nlines": 61, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.37463125586509705, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.005899710115045309, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.3023598790168762, "rps_doc_frac_unique_words": 0.47228381037712097, "rps_doc_mean_word_length": 4.65188455581665, "rps_doc_num_sentences": 30, "rps_doc_symbol_to_word_ratio": 0.002949849935248494, "rps_doc_unigram_entropy": 4.927626132965088, "rps_doc_word_count": 451, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07054337114095688, "rps_doc_frac_chars_dupe_6grams": 0.07054337114095688, "rps_doc_frac_chars_dupe_7grams": 0.020972350612282753, "rps_doc_frac_chars_dupe_8grams": 0, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.01906578056514263, "rps_doc_frac_chars_top_3gram": 0.026692090556025505, "rps_doc_frac_chars_top_4gram": 0.03431839868426323, "rps_doc_books_importance": -317.77978515625, "rps_doc_books_importance_length_correction": -317.77978515625, "rps_doc_openwebtext_importance": -190.23390197753906, "rps_doc_openwebtext_importance_length_correction": -190.23390197753906, "rps_doc_wikipedia_importance": -139.52252197265625, "rps_doc_wikipedia_importance_length_correction": -139.52252197265625 }, "fasttext": { "dclm": 0.33957868814468384, "english": 0.8482621312141418, "fineweb_edu_approx": 1.0031183958053589, "eai_general_math": 0.002724289894104004, "eai_open_web_math": 0.45768141746520996, "eai_web_code": 0.000013830000170855783 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.13", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "2", "label": "Understand" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "5", "label": "Social/Forum" }, "secondary": { "code": "4", "label": "Code/Software" } }, "extraction_artifacts": { "primary": { "code": "3", "label": "Irrelevant Content" }, "secondary": { "code": "1", "label": "Leftover HTML" } }, "missing_content": { "primary": { "code": "2", "label": "Click Here References" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "18", "label": "Q&A Forum" }, "secondary": { "code": "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": "3", "label": "Undergraduate Level" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-3,702,387,502,569,288,000

Cisco Blogs Share Happy Bastille Day: Vive La France - July 14, 2006 - 1 Comment PARIS, FRANCE – (In spirit) – France is in the news quite a bit these days. All the world is talking about the famous French World Cup headbutt heard around the world. Lip-readers have been hired to determine was was said* and apologies have been issued, however the World Cup still resides in Rome. Also in the news today is Bastille Day. On this same day in 1789 a movement for freedom was started when the famous prison was stormed by the French citizenry. It was an attack to the core of French royalty. The French Revolution had begun and now we have the French Republic.This blog entry is clearly about broadband. Why? Because broadband is also a revolution. It is a revolution from static, cookie-cutter information. Broadband is about anytime, anywhere information. Broadband is a personalized communication revolution. With broadband, you can have your information how you want it, when you want, where you want it and in what form you want it. Traditional, royal information fed to us via print is slowly fading away. Broadband is managing businesses, managing supply chains and managing financial markets. It is a management tool and a time-saving tool, as well as a consumer information tool. Just as the French royalty could not stop the French Revolution, so too will traditional communications not be able to stop the steady onslaught of the Broadband Revolution.As it is Bastille Day and we’re talking about broadband, I would encourage you to read a previous blog entry from my colleague in Paris, Olivier Esper. He writes about how France is also a leader in the broadband revolution.So, Happy Bastille Day and Happy Communications Revolution.*Lip readers have conjectured that Italian defender Marco Materazzi said something along the lines of “your mother and sister wear Army boots” (or some such). My thesis is that Materazzi actually said, “Italian broadband via FastWeb and Italtel is better than French broadband.” Those indeed could be head-butting words. : ) In an effort to keep conversations fresh, Cisco Blogs closes comments after 60 days. Please visit the Cisco Blogs hub page for the latest content. 1 Comments 1. In practice, the advertised bandwidth is not always reliably available to the customer; ISPs often allow a greater number of subscribers than their backbone connection can handle, under the assumption that most users will not be using their full connection capacity very frequently. This aggregation strategy works more often than not, so users can typically burst to their full bandwidth most of the time; however, peer-to-peer (P2P) file sharing systems, often requiring extended durations of high bandwidth, stress these assumptions, and can cause major problems for ISPs who have excessively overbooked their capacity. For more on this topic, see traffic shaping. As takeup for these introductory products increases, telcos are starting to offer higher bit rate services. For existing connections, this most of the time simply involves reconfiguring the existing equipment at each end of the connection. Share

{ "url": "https://blogs.cisco.com/gov/happy_bastille_day_vive_la_france", "source_domain": "blogs.cisco.com", "snapshot_id": "crawl=CC-MAIN-2018-09", "warc_metadata": { "Content-Length": "47534", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:4LI5P2Z4TGEIV7YGS7QA6ZMURII7I4BC", "WARC-Concurrent-To": "<urn:uuid:67980406-5323-4188-bfa7-2b1a3a5f7a9a>", "WARC-Date": "2018-02-19T06:05:11Z", "WARC-IP-Address": "173.37.216.10", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:LXD6X5VVVLDWJX5R2ZVJONDMSJ3RG2IP", "WARC-Record-ID": "<urn:uuid:77cd8f80-45b2-42f6-9fec-ce95d1c515ab>", "WARC-Target-URI": "https://blogs.cisco.com/gov/happy_bastille_day_vive_la_france", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:a9de1450-552c-4095-a104-d889c7a25155>" }, "warc_info": "robots: classic\r\nhostname: ip-10-47-182-162.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf" }

{ "line_start_idx": [ 0, 12, 18, 19, 54, 55, 83, 84, 2070, 2071, 2218, 2219, 2230, 2231, 3144, 3145 ], "line_end_idx": [ 12, 18, 19, 54, 55, 83, 84, 2070, 2071, 2218, 2219, 2230, 2231, 3144, 3145, 3150 ] }

{ "red_pajama_v2": { "ccnet_original_length": 3150, "ccnet_original_nlines": 15, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3862876296043396, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.006688959896564484, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.15217390656471252, "rps_doc_frac_unique_words": 0.5326732993125916, "rps_doc_mean_word_length": 5.055445671081543, "rps_doc_num_sentences": 33, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.197370529174805, "rps_doc_word_count": 505, "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.017626319080591202, "rps_doc_frac_chars_top_3gram": 0.010575789958238602, "rps_doc_frac_chars_top_4gram": 0.010184099897742271, "rps_doc_books_importance": -290.4344787597656, "rps_doc_books_importance_length_correction": -290.4344787597656, "rps_doc_openwebtext_importance": -201.65875244140625, "rps_doc_openwebtext_importance_length_correction": -201.65875244140625, "rps_doc_wikipedia_importance": -145.51046752929688, "rps_doc_wikipedia_importance_length_correction": -145.51046752929688 }, "fasttext": { "dclm": 0.021327199414372444, "english": 0.9606616497039795, "fineweb_edu_approx": 2.014685869216919, "eai_general_math": 0.022671040147542953, "eai_open_web_math": 0.25828665494918823, "eai_web_code": 0.0005311400163918734 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.6", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "303.483", "labels": { "level_1": "Social sciences", "level_2": "", "level_3": "Social sciences — Dictionaries" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "9", "label": "Personal/Misc" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "-1", "label": "Abstain" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "16", "label": "Personal Blog" }, "secondary": { "code": "13", "label": "News (Org.)" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-4,372,496,134,486,656,000

Safari, the world’s most comprehensive technology and business learning platform. Find the exact information you need to solve a problem on the fly, or go deeper to master the technologies and skills you need to succeed Start Free Trial No credit card required O'Reilly logo Moodle Administration Essentials Book Description Learn how to set up, maintain, and support your Moodle site efficiently In Detail This book begins with a brief look at Moodle's background and an examination of its architectural structure and LAMP architecture. You'll learn to create user accounts and understand the methods of authentication based on manual accounts and e-mail-based self-registrations. You'll then develop the Moodle site structure and course set up, and discover how to edit it through a sample faculty site. Next, you'll configure two of the standard themes in Moodle and apply them to organizational branding. You'll also explore how plugins are configured and installed, and learn about backing up, resetting, and restoring Moodle courses. Finally, you'll learn Moodle's security options, along with performance testing, and how to use the built-in Moodle performance testing script. What You Will Learn • Manage user accounts, authenticate users, and control user permissions with roles • Enhance your Moodle site with plugins such as activity modules, admin reports, admin tools, and more • Brand your Moodle site with configured themes • Set up the structure of your site using categories in Moodle • Prepare your site for end-of-year rollover • Install Moodle on a Linux Server • Monitor the usage and performance of your Moodle site • Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the files e-mailed directly to you. Table of Contents 1. Moodle Administration Essentials 1. Table of Contents 2. Moodle Administration Essentials 3. Credits 4. About the Authors 5. About the Reviewers 6. www.PacktPub.com 1. Support files, eBooks, discount offers, and more 1. Why subscribe? 2. Free access for Packt account holders 7. Preface 1. What this book covers 2. What you need for this book 3. Who this book is for 4. Conventions 5. Reader feedback 6. Customer support 1. Errata 2. Piracy 3. Questions 8. 1. Moodle in a Nutshell 1. Background of Moodle 2. Architecture of Moodle 3. Installing Moodle 1. Server specifications 1. Hardware 2. Software 2. Code specifications 1. Moodle download 2. File permissions 3. Database setup 4. Moodledata directory setup 5. Moodle installer 6. Essential configurations 1. Email settings 2. System paths 3. Cron 4. Updating Moodle 1. Upgrading from one version to another 1. Cloning your Moodle site 2. Upgrade preparation 3. Moodle code directory 4. Moodle data directory 5. Moodle database 6. Moodle download 2. Maintaining the version code 3. When to update 5. Summary 9. 2. Managing User Accounts and Authentication 1. Creating users 2. Editing a user 1. Searching for a user account 2. Editing the user account 3. Uploading users 1. Preparing the spreadsheet 2. Uploading the spreadsheet 4. User authentication 1. Authentication types 2. How to enable authentication plugins 3. Authentication configuration for a single user creation 4. Authentication configuration for the CSV file user upload 5. Manual authentication 1. The optional configuration 6. Email-based self-registration authentication 1. The optional configuration 5. Summary 10. 3. Managing Categories and Courses 1. Category creation 2. Course and category management 3. Course creation 4. Uploading courses 1. Preparing the spreadsheet 2. Uploading the spreadsheet 5. Course templates 1. Restore a course 2. Clone a course 6. Summary 11. 4. Managing Site Appearance 1. Configuring the landing page 2. Configuring the front page 3. Global theme settings 4. Introducing the Clean theme 1. Configuring the Clean theme 5. Introducing the More theme 1. Configuring the More theme 6. Cloning a theme 7. Summary 12. 5. Role Management 1. Understanding terminologies 2. Standard roles 3. Managing role permissions 1. Cloning a role 2. Creating a new role 3. Creating a course requester role 4. Applying a role override for a specific context 5. Testing a role 6. Manually adding a user to a course 7. Enabling self-enrolment for a course 4. Other custom roles 5. Summary 13. 6. Managing Site Plugins 1. What are plugins? 2. Where to find plugins 3. Considerations when choosing a plugin 4. Installing plugins 1. Manually installing a plugin ZIP file 2. Installing a plugin from the Moodle plugins directory 3. Installing a plugin from a source control URL 5. Editing plugin settings 6. Updating plugins 7. Uninstalling plugins 8. Summary 14. 7. End of Year Course Rollover 1. Rollover implementation 1. Backup of the entire Moodle site 2. Duplication of courses in the same Moodle after backups 3. Resetting courses after a backup 4. Selecting the right approach 2. Course backup 1. Teacher permissions in course backup 2. Course creator permissions in course backup 3. Administrator permissions in course backup 4. Making a backup of a course 5. Setting up automated course backups 3. Course restore 1. Teacher permissions in course restore 2. Course creator permissions in course restore 3. Administrator permissions in course restore 4. Restoring a course 4. Course reset 5. Summary 15. 8. Miscellaneous Admin Tasks 1. Monitoring Moodle usage 1. Statistics 2. Reports 1. Comments 2. Backups 3. Config changes 4. Course overview 5. Events list 6. Logs 7. Live logs 8. Performance overview 9. Question instances 10. Security overview 11. Statistics 12. Event monitoring rules 13. Spam cleaner 2. Performance testing 1. JMeter 2. Performance comparison 3. Security and resilience 1. Security 2. IP Blocker 3. Site policies 4. HTTP security 5. Notifications 6. Anti-Virus 7. Security overview report 4. General considerations 1. Force users to log in 2. Disable log in as a guest 3. Enable timezones 4. Enable cron 5. Debug messages 6. Purge all caches 7. Enhancing the My Home page or Dashboard 8. Language customization 9. Enabling site administrators 10. Enabling maintenance mode 11. Support contact details 12. Administration search box 5. Summary 16. Index

{ "url": "https://www.safaribooksonline.com/library/view/moodle-administration-essentials/9781784395476/", "source_domain": "www.safaribooksonline.com", "snapshot_id": "crawl=CC-MAIN-2017-09", "warc_metadata": { "Content-Length": "73759", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NT2BKMYM5W23QBQPLRD5DR4HIQ65V7HP", "WARC-Concurrent-To": "<urn:uuid:813cf2ee-d176-428d-b47b-3e01151182a6>", "WARC-Date": "2017-02-26T01:23:10Z", "WARC-IP-Address": "151.101.33.132", "WARC-Identified-Payload-Type": null, "WARC-Payload-Digest": "sha1:SHRZKKZG7CXLILNWNJY5UEF372UCPPW6", "WARC-Record-ID": "<urn:uuid:8549509b-9afe-4a85-bbc7-52e8f1ad210b>", "WARC-Target-URI": "https://www.safaribooksonline.com/library/view/moodle-administration-essentials/9781784395476/", "WARC-Truncated": "length", "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:57284ad6-38d0-4cff-8bd3-a1a58244e947>" }, "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, 82, 83, 221, 222, 239, 240, 264, 265, 279, 312, 313, 330, 331, 403, 404, 414, 415, 546, 547, 1049, 1050, 1194, 1195, 1215, 1216, 1302, 1303, 1408, 1409, 1459, 1460, 1525, 1526, 1573, 1574, 1611, 1612, 1670, 1671, 1985, 1986, 2008, 2009, 2049, 2076, 2118, 2135, 2162, 2191, 2217, 2277, 2305, 2356, 2373, 2406, 2445, 2477, 2500, 2527, 2555, 2575, 2595, 2618, 2651, 2683, 2717, 2746, 2781, 2805, 2829, 2862, 2893, 2925, 2955, 2997, 3029, 3069, 3101, 3131, 3153, 3180, 3231, 3271, 3306, 3343, 3380, 3411, 3442, 3484, 3512, 3531, 3585, 3611, 3637, 3679, 3717, 3744, 3783, 3822, 3853, 3887, 3937, 4006, 4077, 4112, 4154, 4212, 4254, 4273, 4318, 4347, 4389, 4416, 4445, 4484, 4523, 4551, 4581, 4609, 4628, 4666, 4706, 4744, 4777, 4816, 4857, 4895, 4935, 4962, 4981, 5010, 5049, 5075, 5112, 5140, 5173, 5219, 5280, 5308, 5356, 5406, 5436, 5455, 5490, 5519, 5552, 5601, 5631, 5682, 5749, 5808, 5843, 5871, 5903, 5922, 5963, 5998, 6044, 6113, 6159, 6201, 6226, 6276, 6333, 6389, 6430, 6479, 6505, 6556, 6614, 6671, 6703, 6727, 6746, 6785, 6820, 6844, 6865, 6889, 6912, 6942, 6973, 7000, 7020, 7045, 7081, 7115, 7149, 7176, 7215, 7244, 7275, 7295, 7331, 7366, 7388, 7412, 7439, 7466, 7493, 7517, 7555, 7589, 7624, 7663, 7693, 7718, 7746, 7776, 7829, 7865, 7907, 7947, 7985, 8025, 8044 ], "line_end_idx": [ 82, 83, 221, 222, 239, 240, 264, 265, 279, 312, 313, 330, 331, 403, 404, 414, 415, 546, 547, 1049, 1050, 1194, 1195, 1215, 1216, 1302, 1303, 1408, 1409, 1459, 1460, 1525, 1526, 1573, 1574, 1611, 1612, 1670, 1671, 1985, 1986, 2008, 2009, 2049, 2076, 2118, 2135, 2162, 2191, 2217, 2277, 2305, 2356, 2373, 2406, 2445, 2477, 2500, 2527, 2555, 2575, 2595, 2618, 2651, 2683, 2717, 2746, 2781, 2805, 2829, 2862, 2893, 2925, 2955, 2997, 3029, 3069, 3101, 3131, 3153, 3180, 3231, 3271, 3306, 3343, 3380, 3411, 3442, 3484, 3512, 3531, 3585, 3611, 3637, 3679, 3717, 3744, 3783, 3822, 3853, 3887, 3937, 4006, 4077, 4112, 4154, 4212, 4254, 4273, 4318, 4347, 4389, 4416, 4445, 4484, 4523, 4551, 4581, 4609, 4628, 4666, 4706, 4744, 4777, 4816, 4857, 4895, 4935, 4962, 4981, 5010, 5049, 5075, 5112, 5140, 5173, 5219, 5280, 5308, 5356, 5406, 5436, 5455, 5490, 5519, 5552, 5601, 5631, 5682, 5749, 5808, 5843, 5871, 5903, 5922, 5963, 5998, 6044, 6113, 6159, 6201, 6226, 6276, 6333, 6389, 6430, 6479, 6505, 6556, 6614, 6671, 6703, 6727, 6746, 6785, 6820, 6844, 6865, 6889, 6912, 6942, 6973, 7000, 7020, 7045, 7081, 7115, 7149, 7176, 7215, 7244, 7275, 7295, 7331, 7366, 7388, 7412, 7439, 7466, 7493, 7517, 7555, 7589, 7624, 7663, 7693, 7718, 7746, 7776, 7829, 7865, 7907, 7947, 7985, 8025, 8044, 8059 ] }

{ "red_pajama_v2": { "ccnet_original_length": 8059, "ccnet_original_nlines": 216, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.20046620070934296, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0054390099830925465, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.33721834421157837, "rps_doc_frac_unique_words": 0.3589743673801422, "rps_doc_mean_word_length": 5.0532546043396, "rps_doc_num_sentences": 201, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.198794841766357, "rps_doc_word_count": 1014, "rps_doc_frac_chars_dupe_10grams": 0, "rps_doc_frac_chars_dupe_5grams": 0.07025761157274246, "rps_doc_frac_chars_dupe_6grams": 0.031615931540727615, "rps_doc_frac_chars_dupe_7grams": 0.018735360354185104, "rps_doc_frac_chars_dupe_8grams": 0.018735360354185104, "rps_doc_frac_chars_dupe_9grams": 0, "rps_doc_frac_chars_top_2gram": 0.013661200180649757, "rps_doc_frac_chars_top_3gram": 0.022248240187764168, "rps_doc_frac_chars_top_4gram": 0.014636999927461147, "rps_doc_books_importance": -578.31298828125, "rps_doc_books_importance_length_correction": -578.31298828125, "rps_doc_openwebtext_importance": -292.8965759277344, "rps_doc_openwebtext_importance_length_correction": -292.8965759277344, "rps_doc_wikipedia_importance": -216.1768341064453, "rps_doc_wikipedia_importance_length_correction": -216.1768341064453 }, "fasttext": { "dclm": 0.9898528456687927, "english": 0.7478158473968506, "fineweb_edu_approx": 1.1776559352874756, "eai_general_math": 0.011552750132977962, "eai_open_web_math": 0.019583940505981445, "eai_web_code": 0.0001128899966715835 } }

{ "free_decimal_correspondence": { "primary": { "code": "004.072", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } }, "secondary": { "code": "371.392", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Teachers, Teaching, and School management and organization" } } }, "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": "2", "label": "Click Here References" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "6", "label": "Content Listing" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "6", "label": "Not Applicable/Indeterminate" }, "secondary": { "code": "4", "label": "Highly Correct" } }, "education_level": { "primary": { "code": "3", "label": "Undergraduate Level" }, "secondary": { "code": "4", "label": "Graduate/Expert Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-5,142,496,146,890,240,000

In the realm of mathematics, regrouping is a fundamental concept that plays a crucial role in performing operations such as addition and subtraction with multi-digit numbers. It is a strategy that allows us to manipulate numbers effectively and arrive at accurate results. In this article, we will delve into the meaning of regrouping, explore its applications, and provide step-by-step explanations along with relevant examples. So let’s embark on this mathematical journey and unlock the secrets of regrouping! Understanding Regrouping in Math Regrouping, also known as “carrying” or “borrowing,” involves rearranging digits within numbers when performing mathematical operations. It mainly comes into play when dealing with numbers that have more than one digit. The primary purpose of regrouping is to ensure accurate computations and maintain the place value system. Regrouping in Addition When adding multi-digit numbers, regrouping occurs when the sum of digits in a specific place value column exceeds nine. Let’s understand this concept with an example: Example 1: Consider the addition problem: 58 + 47. Here’s how regrouping helps us solve it: 58 + 47 ------- 105 To solve this problem, we start by adding the digits in the ones column: 8 + 7 equals 15. Since 15 is greater than nine, we regroup the ten’s value by carrying the digit 1 to the tens column. The remaining value, 5, stays in the ones column. Then, we add the digits in the tens column, including the carried value, which gives us 5 + 4 + 1, equaling 10. Finally, we write down the resulting sum, 105. Regrouping in Subtraction In subtraction, regrouping comes into play when the digit being subtracted is larger than the corresponding digit in the minuend. Let’s consider an example: Example 2: Let’s subtract 364 from 598. Regrouping is necessary in this scenario: 598 - 364 ------- 234 Starting from the ones column, we subtract 4 from 8, which gives us 4. In the tens column, we need to subtract 6 from 9. However, since 6 is larger than 9, we need to regroup. We borrow 1 from the hundreds column and increase the value of the tens column by 10, making it 19. Now, we subtract 6 from 19, resulting in 13. Finally, we subtract 3 from 5 in the hundreds column, giving us 2. Thus, the difference between 598 and 364 is 234. Teaching Regrouping in Math: A Step-by-Step Approach To ensure a thorough understanding of regrouping among students, it is crucial to follow a step-by-step teaching approach. Let’s explore three essential steps to help students grasp this concept effectively. Step 1: Introduce Manipulatives and Hands-on Experience To provide students with a concrete understanding of regrouping, begin by using manipulatives such as base-10 blocks or Montessori decimal system beads. These physical objects help students visualize the concept of tens, units, hundreds, and thousands. By engaging in hands-on activities, students can count and exchange units for tens or vice versa, gaining a tangible sense of regrouping. Step 2: Utilize Visual Representations Once students have experienced regrouping through manipulatives, introduce visual representations to aid their understanding. Visuals can include diagrams, charts, or drawings that illustrate the regrouping process. Online math programs like Happy Numbers offer interactive problems with visual cues to reinforce the concept. Visuals bridge the gap between the use of manipulatives and the eventual transition to pencil-and-paper calculations. Step 3: Progress to Traditional Methods After students have gained proficiency with manipulatives and visual representations, gradually introduce them to traditional pencil-and-paper methods of performing regrouping operations. Emphasize the importance of place value and guide them through the step-by-step procedures. Practice problems with varying difficulty levels will help solidify their understanding and enhance their computational skills. Importance of Regrouping in Real-Life Situations Regrouping is not limited to mathematical exercises; its applications extend beyond the classroom into real-life situations. Let’s explore a few instances where regrouping is relevant: Financial Transactions Regrouping becomes essential when handling monetary transactions involving large sums of money. For instance, when calculating the total cost of groceries, if the units exceed nine, regrouping is necessary to accurately determine the total amount. Time Management Regrouping plays a role in time management as well. When scheduling appointments or allocating time for various activities, regrouping can help ensure efficient utilization of time slots and effective time management. Data Analysis In fields such as statistics, regrouping aids in organizing and analyzing data. Grouping data into categories or intervals allows for better visualization and comprehension of information. Conclusion Regrouping is a fundamental concept in mathematics that enables us to perform accurate calculations, understand place value, and solve complex problems. By following a systematic teaching approach and providing students with manipulatives, visuals, and practice opportunities, we can help them develop a deep conceptual understanding of regrouping. The applications of regrouping extend beyond the math classroom, enhancing financial literacy, time management, and data analysis skills. So, embrace the power of regrouping and unlock the potential for mathematical success! FAQ What are some common examples of regrouping in math? ne common example of regrouping in math is when adding two-digit numbers, such as 48 + 37. Here, regrouping occurs when adding the ones column because 8 + 7 equals 15, which is greater than 9. So, we regroup the 10s by carrying over the value to the 10s column and write down the units. Another example is in subtraction, where regrouping is necessary when subtracting numbers with larger digits in the same place value. For instance, subtracting 209 from 395 requires regrouping in both the tens and ones columns. Are there different methods of regrouping in math? Yes, there are different methods of regrouping in math. The most commonly used methods are the traditional method, which involves carrying or borrowing digits when performing addition or subtraction, and the expanded form method, where numbers are expanded into their place value components and regrouping is done based on the values of the digits. How can regrouping be applied to addition and subtraction problems? Regrouping is applied in addition when the sum of digits in a column is greater than 9. In such cases, we carry the excess value to the next higher place value column. For subtraction, regrouping is required when the digit being subtracted is larger than the corresponding digit in the minuend. We borrow from the higher place value column to adjust the value and ensure accurate subtraction. How does regrouping relate to place value in mathematics? Regrouping is closely tied to the concept of place value in mathematics. It involves rearranging or exchanging digits within numbers to maintain the value of each digit based on its position or place value. By regrouping, we ensure that the value of each digit is correctly represented within the number, thereby preserving the place value system. Are there any online resources or apps for practicing regrouping in math? Yes, there are several online resources and apps available for practicing regrouping in math. Some popular options include educational websites like Khan Academy, MathPlayground, and SplashLearn, which offer interactive games, worksheets, and tutorials specifically designed to help students practice regrouping. Additionally, educational math apps such as Happy Numbers and Mathletics also provide regrouping practice modules to enhance learning and understanding. Opt out or Contact us anytime. See our Privacy Notice Follow us on Reddit for more insights and updates. Comments (0) Welcome to A*Help comments! We’re all about debate and discussion at A*Help. We value the diverse opinions of users, so you may find points of view that you don’t agree with. And that’s cool. However, there are certain things we’re not OK with: attempts to manipulate our data in any way, for example, or the posting of discriminative, offensive, hateful, or disparaging material. Your email address will not be published. Required fields are marked * Login Register | Lost your password?

{ "url": "https://academichelp.net/stem/math/what-is-regrouping.html", "source_domain": "academichelp.net", "snapshot_id": "CC-MAIN-2023-40", "warc_metadata": { "Content-Length": "203678", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:EWZWDNRI3PLXF4353XSO5T2PIS7YKVYD", "WARC-Concurrent-To": "<urn:uuid:7d73a5b7-ea30-4d55-8242-73b8c253c5d7>", "WARC-Date": "2023-09-27T05:56:21Z", "WARC-IP-Address": "172.67.70.165", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:IF6EGRZF355Z3TFDXZ7JNCWJCRSSZDIF", "WARC-Record-ID": "<urn:uuid:e726e467-e1c5-4b21-a15b-d7e9f8616b37>", "WARC-Target-URI": "https://academichelp.net/stem/math/what-is-regrouping.html", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:db2f32cc-60b1-48cc-a1b0-9075c25a194a>" }, "warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-67-67-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 513, 514, 547, 548, 874, 875, 898, 899, 1067, 1068, 1160, 1161, 1168, 1175, 1183, 1189, 1190, 1591, 1592, 1618, 1619, 1776, 1777, 1859, 1860, 1868, 1876, 1884, 1890, 1891, 2328, 2329, 2382, 2383, 2591, 2592, 2648, 2649, 3040, 3041, 3080, 3081, 3525, 3526, 3566, 3567, 3975, 3976, 4025, 4026, 4211, 4212, 4235, 4236, 4484, 4485, 4501, 4502, 4720, 4721, 4735, 4736, 4925, 4926, 4937, 4938, 5512, 5513, 5517, 5518, 5571, 5572, 5859, 5860, 6088, 6089, 6140, 6141, 6490, 6491, 6559, 6560, 6953, 6954, 7012, 7013, 7361, 7362, 7436, 7437, 7903, 7904, 7958, 7959, 8010, 8011, 8024, 8025, 8053, 8054, 8103, 8104, 8408, 8409, 8480, 8481, 8487, 8488 ], "line_end_idx": [ 513, 514, 547, 548, 874, 875, 898, 899, 1067, 1068, 1160, 1161, 1168, 1175, 1183, 1189, 1190, 1591, 1592, 1618, 1619, 1776, 1777, 1859, 1860, 1868, 1876, 1884, 1890, 1891, 2328, 2329, 2382, 2383, 2591, 2592, 2648, 2649, 3040, 3041, 3080, 3081, 3525, 3526, 3566, 3567, 3975, 3976, 4025, 4026, 4211, 4212, 4235, 4236, 4484, 4485, 4501, 4502, 4720, 4721, 4735, 4736, 4925, 4926, 4937, 4938, 5512, 5513, 5517, 5518, 5571, 5572, 5859, 5860, 6088, 6089, 6140, 6141, 6490, 6491, 6559, 6560, 6953, 6954, 7012, 7013, 7361, 7362, 7436, 7437, 7903, 7904, 7958, 7959, 8010, 8011, 8024, 8025, 8053, 8054, 8103, 8104, 8408, 8409, 8480, 8481, 8487, 8488, 8518 ] }

{ "red_pajama_v2": { "ccnet_original_length": 8518, "ccnet_original_nlines": 108, "rps_doc_curly_bracket": 0, "rps_doc_ldnoobw_words": 0, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.3609851002693176, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.0032404400408267975, "rps_doc_frac_lines_end_with_ellipsis": 0, "rps_doc_frac_no_alph_words": 0.18211276829242706, "rps_doc_frac_unique_words": 0.3598130941390991, "rps_doc_mean_word_length": 5.400311470031738, "rps_doc_num_sentences": 77, "rps_doc_symbol_to_word_ratio": 0, "rps_doc_unigram_entropy": 5.424766540527344, "rps_doc_word_count": 1284, "rps_doc_frac_chars_dupe_10grams": 0.020767230540513992, "rps_doc_frac_chars_dupe_5grams": 0.06259013712406158, "rps_doc_frac_chars_dupe_6grams": 0.042111340910196304, "rps_doc_frac_chars_dupe_7grams": 0.026824340224266052, "rps_doc_frac_chars_dupe_8grams": 0.020767230540513992, "rps_doc_frac_chars_dupe_9grams": 0.020767230540513992, "rps_doc_frac_chars_top_2gram": 0.02422844059765339, "rps_doc_frac_chars_top_3gram": 0.018459759652614594, "rps_doc_frac_chars_top_4gram": 0.01038361992686987, "rps_doc_books_importance": -698.5225219726562, "rps_doc_books_importance_length_correction": -698.5225219726562, "rps_doc_openwebtext_importance": -434.7918395996094, "rps_doc_openwebtext_importance_length_correction": -434.7918395996094, "rps_doc_wikipedia_importance": -315.17877197265625, "rps_doc_wikipedia_importance_length_correction": -315.17877197265625 }, "fasttext": { "dclm": 0.9833950996398926, "english": 0.8842111229896545, "fineweb_edu_approx": 3.3929824829101562, "eai_general_math": 0.8255244493484497, "eai_open_web_math": 0.21181941032409668, "eai_web_code": 0.13637399673461914 } }

{ "free_decimal_correspondence": { "primary": { "code": "513.2", "labels": { "level_1": "Science and Natural history", "level_2": "Mathematics", "level_3": "Geometry" } }, "secondary": { "code": "372.7", "labels": { "level_1": "Social sciences", "level_2": "Education", "level_3": "Education, Elementary and Kindergarten" } } }, "bloom_cognitive_process": { "primary": { "code": "2", "label": "Understand" }, "secondary": { "code": "3", "label": "Apply" } }, "bloom_knowledge_domain": { "primary": { "code": "2", "label": "Conceptual" }, "secondary": { "code": "3", "label": "Procedural" } }, "document_type_v1": { "primary": { "code": "3", "label": "Reference/Encyclopedic/Educational" }, "secondary": { "code": "-1", "label": "Abstain" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "0", "label": "No missing content" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "10", "label": "Knowledge Article" }, "secondary": { "code": "23", "label": "Tutorial" } }, "reasoning_depth": { "primary": { "code": "2", "label": "Basic Reasoning" }, "secondary": { "code": "3", "label": "Intermediate Reasoning" } }, "technical_correctness": { "primary": { "code": "4", "label": "Highly Correct" }, "secondary": { "code": "3", "label": "Mostly Correct" } }, "education_level": { "primary": { "code": "1", "label": "General Audience" }, "secondary": { "code": "2", "label": "High School Level" } } }

e3c4dd7183f5f028f56d5a7988cc68c4

-3,724,150,155,380,891,000

Project General Profile oscam-emu.11384.patch Joe User, 2017-06-15 00:51 View differences: CMakeLists.txt (working copy) 101 101 ${CMAKE_CURRENT_SOURCE_DIR}/csctapi 102 102 ${CMAKE_CURRENT_SOURCE_DIR}/cscrypt 103 103 ${CMAKE_CURRENT_SOURCE_DIR}/minilzo 104 ${CMAKE_CURRENT_SOURCE_DIR}/ffdecsa 104 105 ${CMAKE_CURRENT_SOURCE_DIR}/extapi/cygwin 105 106 /usr/include/w32api 106 107 ${OPTIONAL_INCLUDE_DIR} ...... 110 111 ${CMAKE_CURRENT_SOURCE_DIR}/csctapi 111 112 ${CMAKE_CURRENT_SOURCE_DIR}/cscrypt 112 113 ${CMAKE_CURRENT_SOURCE_DIR}/minilzo 114 ${CMAKE_CURRENT_SOURCE_DIR}/ffdecsa 113 115 ${OPTIONAL_INCLUDE_DIR} 114 116 ) 115 117 endif (OSCamOperatingSystem MATCHES "Windows/Cygwin") ...... 420 422 # Manage config.h based on command line parameters 421 423 # Manipulate config file based on given parameters and read unset parameters 422 424 425 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --enabled WITH_EMU OUTPUT_VARIABLE CONFIG_WITH_EMU OUTPUT_STRIP_TRAILING_WHITESPACE) 426 if (CONFIG_WITH_EMU MATCHES "Y" AND NOT WITH_EMU EQUAL 1) 427 add_definitions ("-DWITH_EMU") 428 set (WITH_EMU "1") 429 message(STATUS " EMU is added by config compiling with EMU") 430 endif(CONFIG_WITH_EMU MATCHES "Y" AND NOT WITH_EMU EQUAL 1) 431 423 432 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --show-valid OUTPUT_VARIABLE config_vars_string OUTPUT_STRIP_TRAILING_WHITESPACE) 424 433 string(REGEX MATCHALL "[A-Z0-9_]+" config_vars ${config_vars_string}) 425 434 ...... 449 458 add_subdirectory (csctapi) 450 459 add_subdirectory (minilzo) 451 460 add_subdirectory (cscrypt) 461 add_subdirectory (ffdecsa) 452 462 453 463 #----------------------- file groups ------------------------------ 454 464 execute_process (COMMAND ${CMAKE_CURRENT_SOURCE_DIR}/config.sh --enabled MODULE_CAMD33 OUTPUT_VARIABLE CAMD33 OUTPUT_STRIP_TRAILING_WHITESPACE) ...... 498 508 499 509 set (exe_name "oscam") 500 510 add_executable (${exe_name} ${exe_srcs} ${exe_hdrs}) 501 target_link_libraries (${exe_name} ${csoscam} ${csmodules} ${csreaders} csctapi cscrypt minilzo) 511 target_link_libraries (${exe_name} ${csoscam} ${csmodules} ${csreaders} csctapi cscrypt minilzo ffdecsa) 502 512 if(HAVE_LIBRT AND HAVE_LIBUSB) 503 513 if (LIBUSBDIR) 504 514 set (libusb_link "imp_libusb") ...... 647 657 execute_process(COMMAND ${CMAKE_C_COMPILER} -dumpmachine COMMAND tr -d '\n' OUTPUT_VARIABLE CS_TARGET) 648 658 add_definitions ("-D'CS_TARGET=\"${CS_TARGET}\"'") 649 659 #----------------------- global compile and link options ------------------------------ 660 #enable sse2 on x86 661 if (CMAKE_SYSTEM_PROCESSOR MATCHES "(x86)|(X86)|(amd64)|(AMD64)") 662 set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -msse -msse2 -msse3") 663 endif (CMAKE_SYSTEM_PROCESSOR MATCHES "(x86)|(X86)|(amd64)|(AMD64)") 664 650 665 # disable warning about unused but set variables in gcc 4.6+ 651 666 if (CMAKE_COMPILER_IS_GNUCC) 652 667 execute_process(COMMAND ${CMAKE_C_COMPILER} -dumpversion OUTPUT_VARIABLE GCC_VERSION) ...... 731 746 732 747 #-------------------------------------------------------------------------------- 733 748 749 if (NOT OSCamOperatingSystem MATCHES "Mac OS X") 750 if (NOT DEFINED ENV{ANDROID_NDK}) 751 if (NOT DEFINED ENV{ANDROID_STANDALONE_TOOLCHAIN}) 752 if(WITH_EMU) 753 if(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 754 execute_process(COMMAND cp ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key ${CMAKE_CURRENT_BINARY_DIR}/SoftCam.Key) 755 else(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 756 execute_process(COMMAND touch ${CMAKE_CURRENT_BINARY_DIR}/SoftCam.Key) 757 endif(EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/SoftCam.Key) 758 execute_process(COMMAND touch ${CMAKE_CURRENT_BINARY_DIR}/utils/SoftCam.Key) 759 set (CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,--format=binary -Wl,SoftCam.Key -Wl,--format=default" ) 760 endif(WITH_EMU) 761 endif (NOT DEFINED ENV{ANDROID_STANDALONE_TOOLCHAIN}) 762 endif (NOT DEFINED ENV{ANDROID_NDK}) 763 endif (NOT OSCamOperatingSystem MATCHES "Mac OS X") 764 734 765 #----------------------- installation ----------------------------- 735 766 736 767 file (GLOB config_files "${CMAKE_CURRENT_SOURCE_DIR}/Distribution/oscam.*") ...... 819 850 endif(STATICLIBUSB AND NOT LIBUSBDIR) 820 851 endif (HAVE_LIBUSB) 821 852 853 if (WITH_EMU) 854 message(STATUS " Compile with EMU support") 855 endif (WITH_EMU) 856 822 857 message (STATUS "") Makefile (working copy) 65 65 66 66 LDFLAGS = -Wl,--gc-sections 67 67 68 TARGETHELP := $(shell $(CC) --target-help 2>&1) 69 ifneq (,$(findstring sse2,$(TARGETHELP))) 70 override CFLAGS += -fexpensive-optimizations -mmmx -msse -msse2 -msse3 71 else 72 override CFLAGS += -fexpensive-optimizations 73 endif 74 68 75 # The linker for powerpc have bug that prevents --gc-sections from working 69 76 # Check for the linker version and if it matches disable --gc-sections 70 77 # For more information about the bug see: ...... 268 275 SRC-$(CONFIG_MODULE_CCCAM) += module-cccam.c 269 276 SRC-$(CONFIG_MODULE_CCCSHARE) += module-cccshare.c 270 277 SRC-$(CONFIG_MODULE_CONSTCW) += module-constcw.c 278 SRC-$(CONFIG_WITH_EMU) += module-emulator.c 279 SRC-$(CONFIG_WITH_EMU) += module-emulator-osemu.c 280 SRC-$(CONFIG_WITH_EMU) += module-emulator-stream.c 281 SRC-$(CONFIG_WITH_EMU) += ffdecsa/ffdecsa.c 282 UNAME := $(shell uname -s) 283 ifneq ($(UNAME),Darwin) 284 ifndef ANDROID_NDK 285 ifndef ANDROID_STANDALONE_TOOLCHAIN 286 ifeq "$(CONFIG_WITH_EMU)" "y" 287 TOUCH_SK := $(shell touch SoftCam.Key) 288 override LDFLAGS += -Wl,--format=binary -Wl,SoftCam.Key -Wl,--format=default 289 endif 290 endif 291 endif 292 endif 271 293 SRC-$(CONFIG_CS_CACHEEX) += module-csp.c 272 294 SRC-$(CONFIG_CW_CYCLE_CHECK) += module-cw-cycle-check.c 273 295 SRC-$(CONFIG_WITH_AZBOX) += module-dvbapi-azbox.c ...... 365 387 # starts the compilation. 366 388 all: 367 389 @./config.sh --use-flags "$(USE_FLAGS)" --objdir "$(OBJDIR)" --make-config.mak 368 @-mkdir -p $(OBJDIR)/cscrypt $(OBJDIR)/csctapi $(OBJDIR)/minilzo $(OBJDIR)/webif 390 @-mkdir -p $(OBJDIR)/cscrypt $(OBJDIR)/csctapi $(OBJDIR)/minilzo $(OBJDIR)/ffdecsa $(OBJDIR)/webif 369 391 @-printf "\ 370 392 +-------------------------------------------------------------------------------\n\ 371 393 | OSCam ver: $(VER) rev: $(SVN_REV) target: $(TARGET)\n\ config.h (working copy) 1 1 #ifndef CONFIG_H_ 2 2 #define CONFIG_H_ 3 3 4 #define WITH_EMU 1 4 5 #define WEBIF 1 5 6 #define WEBIF_LIVELOG 1 6 7 #define WEBIF_JQUERY 1 config.sh (working copy) 1 1 #!/bin/sh 2 2 3 addons="WEBIF WEBIF_LIVELOG WEBIF_JQUERY TOUCH WITH_SSL HAVE_DVBAPI READ_SDT_CHARSETS IRDETO_GUESSING CS_ANTICASC WITH_DEBUG MODULE_MONITOR WITH_LB CS_CACHEEX CW_CYCLE_CHECK LCDSUPPORT LEDSUPPORT CLOCKFIX IPV6SUPPORT" 3 addons="WEBIF WEBIF_LIVELOG WEBIF_JQUERY TOUCH WITH_SSL HAVE_DVBAPI READ_SDT_CHARSETS IRDETO_GUESSING CS_ANTICASC WITH_DEBUG MODULE_MONITOR WITH_LB CS_CACHEEX CW_CYCLE_CHECK LCDSUPPORT LEDSUPPORT CLOCKFIX IPV6SUPPORT WITH_EMU" 4 4 protocols="MODULE_CAMD33 MODULE_CAMD35 MODULE_CAMD35_TCP MODULE_NEWCAMD MODULE_CCCAM MODULE_CCCSHARE MODULE_GBOX MODULE_RADEGAST MODULE_SCAM MODULE_SERIAL MODULE_CONSTCW MODULE_PANDORA MODULE_GHTTP" 5 5 readers="READER_NAGRA READER_IRDETO READER_CONAX READER_CRYPTOWORKS READER_SECA READER_VIACCESS READER_VIDEOGUARD READER_DRE READER_TONGFANG READER_BULCRYPT READER_GRIFFIN READER_DGCRYPT" 6 6 card_readers="CARDREADER_PHOENIX CARDREADER_INTERNAL CARDREADER_SC8IN1 CARDREADER_MP35 CARDREADER_SMARGO CARDREADER_DB2COM CARDREADER_STAPI CARDREADER_STAPI5 CARDREADER_STINGER CARDREADER_DRECAS" ...... 24 24 # CONFIG_LEDSUPPORT=n 25 25 CONFIG_CLOCKFIX=y 26 26 # CONFIG_IPV6SUPPORT=n 27 CONFIG_WITH_EMU=y 27 28 # CONFIG_MODULE_CAMD33=n 28 29 CONFIG_MODULE_CAMD35=y 29 30 CONFIG_MODULE_CAMD35_TCP=y ...... 289 290 290 291 update_deps() { 291 292 # Calculate dependencies 292 enabled_any $(get_opts readers) $(get_opts card_readers) && enable_opt WITH_CARDREADER >/dev/null 293 disabled_all $(get_opts readers) $(get_opts card_readers) && disable_opt WITH_CARDREADER >/dev/null 293 enabled_any $(get_opts readers) $(get_opts card_readers) WITH_EMU && enable_opt WITH_CARDREADER >/dev/null 294 disabled_all $(get_opts readers) $(get_opts card_readers) WITH_EMU && disable_opt WITH_CARDREADER >/dev/null 294 295 disabled WEBIF && disable_opt WEBIF_LIVELOG >/dev/null 295 296 disabled WEBIF && disable_opt WEBIF_JQUERY >/dev/null 296 297 enabled MODULE_CCCSHARE && enable_opt MODULE_CCCAM >/dev/null 297 298 enabled_any CARDREADER_DB2COM CARDREADER_MP35 CARDREADER_SC8IN1 CARDREADER_STINGER && enable_opt CARDREADER_PHOENIX >/dev/null 299 enabled WITH_EMU && enable_opt READER_VIACCESS >/dev/null 300 enabled WITH_EMU && enable_opt READER_DRE >/dev/null 301 enabled WITH_EMU && enable_opt MODULE_NEWCAMD >/dev/null 298 302 } 299 303 300 304 list_config() { ...... 344 348 not_have_flag USE_LIBCRYPTO && echo "CONFIG_LIB_AES=y" || echo "# CONFIG_LIB_AES=n" 345 349 enabled MODULE_CCCAM && echo "CONFIG_LIB_RC6=y" || echo "# CONFIG_LIB_RC6=n" 346 350 not_have_flag USE_LIBCRYPTO && enabled MODULE_CCCAM && echo "CONFIG_LIB_SHA1=y" || echo "# CONFIG_LIB_SHA1=n" 347 enabled_any READER_DRE MODULE_SCAM READER_VIACCESS && echo "CONFIG_LIB_DES=y" || echo "# CONFIG_LIB_DES=n" 348 enabled_any MODULE_CCCAM READER_NAGRA READER_SECA && echo "CONFIG_LIB_IDEA=y" || echo "# CONFIG_LIB_IDEA=n" 349 not_have_flag USE_LIBCRYPTO && enabled_any READER_CONAX READER_CRYPTOWORKS READER_NAGRA && echo "CONFIG_LIB_BIGNUM=y" || echo "# CONFIG_LIB_BIGNUM=n" 351 enabled_any READER_DRE MODULE_SCAM READER_VIACCESS WITH_EMU && echo "CONFIG_LIB_DES=y" || echo "# CONFIG_LIB_DES=n" 352 enabled_any MODULE_CCCAM READER_NAGRA READER_SECA WITH_EMU && echo "CONFIG_LIB_IDEA=y" || echo "# CONFIG_LIB_IDEA=n" 353 not_have_flag USE_LIBCRYPTO && enabled_any READER_CONAX READER_CRYPTOWORKS READER_NAGRA WITH_EMU && echo "CONFIG_LIB_BIGNUM=y" || echo "# CONFIG_LIB_BIGNUM=n" 350 354 } 351 355 352 356 make_config_c() { ...... 457 461 LEDSUPPORT "LED support" $(check_test "LEDSUPPORT") \ 458 462 CLOCKFIX "Clockfix (disable on old systems!)" $(check_test "CLOCKFIX") \ 459 463 IPV6SUPPORT "IPv6 support (experimental)" $(check_test "IPV6SUPPORT") \ 464 WITH_EMU "Emulator support" $(check_test "WITH_EMU") \ 460 465 2> ${tempfile} 461 466 462 467 opt=${?} cscrypt/md5.c (working copy) 25 25 26 26 #if !defined(WITH_SSL) && !defined(WITH_LIBCRYPTO) 27 27 28 typedef struct MD5Context 29 { 30 uint32_t buf[4]; 31 uint32_t bits[2]; 32 uint32_t in[16]; 33 } MD5_CTX; 34 35 28 #ifdef __i386__ 36 29 #define byteReverse(a, b) 37 30 #else ...... 155 148 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 156 149 * initialization constants. 157 150 */ 158 static void MD5_Init(MD5_CTX *ctx) 151 void MD5_Init(MD5_CTX *ctx) 159 152 { 160 153 ctx->buf[0] = 0x67452301; 161 154 ctx->buf[1] = 0xefcdab89; ...... 170 163 * Update context to reflect the concatenation of another buffer full 171 164 * of bytes. 172 165 */ 173 static void MD5_Update(MD5_CTX *ctx, const unsigned char *buf, unsigned int len) 166 void MD5_Update(MD5_CTX *ctx, const unsigned char *buf, unsigned int len) 174 167 { 175 168 uint32_t t; 176 169 ...... 219 212 * Final wrapup - pad to 64-byte boundary with the bit pattern 220 213 * 1 0* (64-bit count of bits processed, MSB-first) 221 214 */ 222 static void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx) 215 void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx) 223 216 { 224 217 unsigned count; 225 218 unsigned char *p; cscrypt/md5.h (working copy) 7 7 #define MD5_DIGEST_LENGTH 16 8 8 9 9 unsigned char *MD5(const unsigned char *input, unsigned long len, unsigned char *output_hash); 10 #endif 11 10 12 char *__md5_crypt(const char *text_pass, const char *salt, char *crypted_passwd); 11 typedef struct MD5Context { 12 uint32_t buf[4]; 13 uint32_t bits[2]; 14 uint32_t in[16]; 15 } MD5_CTX; 13 16 17 void MD5_Init(MD5_CTX *ctx); 18 void MD5_Update(MD5_CTX *ctx, const unsigned char *buf, unsigned int len); 19 void MD5_Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx); 14 20 #endif 21 char *__md5_crypt(const char *text_pass, const char *salt, char *crypted_passwd); 22 #endif csctapi/cardreaders.h (working copy) 14 14 extern const struct s_cardreader cardreader_stapi; 15 15 extern const struct s_cardreader cardreader_stinger; 16 16 extern const struct s_cardreader cardreader_drecas; 17 extern const struct s_cardreader cardreader_emu; 17 18 18 19 #endif ffdecsa/CMakeLists.txt (working copy) 1 project (ffdecsa) 2 3 file (GLOB ffdecsa_srcs "ffdecsa.c") 4 file (GLOB ffdecsa_hdrs "*.h") 5 6 set (lib_name "ffdecsa") 7 8 add_library (${lib_name} STATIC ${ffdecsa_srcs} ${ffdecsa_hdrs}) ffdecsa/COPYING (working copy) 1 GNU GENERAL PUBLIC LICENSE 2 Version 2, June 1991 3 4 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 5 675 Mass Ave, Cambridge, MA 02139, USA 6 Everyone is permitted to copy and distribute verbatim copies 7 of this license document, but changing it is not allowed. 8 9 Preamble 10 11 The licenses for most software are designed to take away your 12 freedom to share and change it. By contrast, the GNU General Public 13 License is intended to guarantee your freedom to share and change free 14 software--to make sure the software is free for all its users. This 15 General Public License applies to most of the Free Software 16 Foundation's software and to any other program whose authors commit to 17 using it. (Some other Free Software Foundation software is covered by 18 the GNU Library General Public License instead.) You can apply it to 19 your programs, too. 20 21 When we speak of free software, we are referring to freedom, not 22 price. Our General Public Licenses are designed to make sure that you 23 have the freedom to distribute copies of free software (and charge for 24 this service if you wish), that you receive source code or can get it 25 if you want it, that you can change the software or use pieces of it 26 in new free programs; and that you know you can do these things. 27 28 To protect your rights, we need to make restrictions that forbid 29 anyone to deny you these rights or to ask you to surrender the rights. 30 These restrictions translate to certain responsibilities for you if you 31 distribute copies of the software, or if you modify it. 32 33 For example, if you distribute copies of such a program, whether 34 gratis or for a fee, you must give the recipients all the rights that 35 you have. You must make sure that they, too, receive or can get the 36 source code. And you must show them these terms so they know their 37 rights. 38 39 We protect your rights with two steps: (1) copyright the software, and 40 (2) offer you this license which gives you legal permission to copy, 41 distribute and/or modify the software. 42 43 Also, for each author's protection and ours, we want to make certain 44 that everyone understands that there is no warranty for this free 45 software. If the software is modified by someone else and passed on, we 46 want its recipients to know that what they have is not the original, so 47 that any problems introduced by others will not reflect on the original 48 authors' reputations. 49 50 Finally, any free program is threatened constantly by software 51 patents. We wish to avoid the danger that redistributors of a free 52 program will individually obtain patent licenses, in effect making the 53 program proprietary. To prevent this, we have made it clear that any 54 patent must be licensed for everyone's free use or not licensed at all. 55 56 The precise terms and conditions for copying, distribution and 57 modification follow. 58 59 GNU GENERAL PUBLIC LICENSE 60 TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 62 0. This License applies to any program or other work which contains 63 a notice placed by the copyright holder saying it may be distributed 64 under the terms of this General Public License. The "Program", below, 65 refers to any such program or work, and a "work based on the Program" 66 means either the Program or any derivative work under copyright law: 67 that is to say, a work containing the Program or a portion of it, 68 either verbatim or with modifications and/or translated into another 69 language. (Hereinafter, translation is included without limitation in 70 the term "modification".) Each licensee is addressed as "you". 71 72 Activities other than copying, distribution and modification are not 73 covered by this License; they are outside its scope. The act of 74 running the Program is not restricted, and the output from the Program 75 is covered only if its contents constitute a work based on the 76 Program (independent of having been made by running the Program). 77 Whether that is true depends on what the Program does. 78 79 1. You may copy and distribute verbatim copies of the Program's 80 source code as you receive it, in any medium, provided that you 81 conspicuously and appropriately publish on each copy an appropriate 82 copyright notice and disclaimer of warranty; keep intact all the 83 notices that refer to this License and to the absence of any warranty; 84 and give any other recipients of the Program a copy of this License 85 along with the Program. 86 87 You may charge a fee for the physical act of transferring a copy, and 88 you may at your option offer warranty protection in exchange for a fee. 89 90 2. You may modify your copy or copies of the Program or any portion 91 of it, thus forming a work based on the Program, and copy and 92 distribute such modifications or work under the terms of Section 1 93 above, provided that you also meet all of these conditions: 94 95 a) You must cause the modified files to carry prominent notices 96 stating that you changed the files and the date of any change. 97 98 b) You must cause any work that you distribute or publish, that in 99 whole or in part contains or is derived from the Program or any 100 part thereof, to be licensed as a whole at no charge to all third 101 parties under the terms of this License. 102 103 c) If the modified program normally reads commands interactively 104 when run, you must cause it, when started running for such 105 interactive use in the most ordinary way, to print or display an 106 announcement including an appropriate copyright notice and a 107 notice that there is no warranty (or else, saying that you provide 108 a warranty) and that users may redistribute the program under 109 these conditions, and telling the user how to view a copy of this 110 License. (Exception: if the Program itself is interactive but 111 does not normally print such an announcement, your work based on 112 the Program is not required to print an announcement.) 113 114 These requirements apply to the modified work as a whole. If 115 identifiable sections of that work are not derived from the Program, 116 and can be reasonably considered independent and separate works in 117 themselves, then this License, and its terms, do not apply to those 118 sections when you distribute them as separate works. But when you 119 distribute the same sections as part of a whole which is a work based 120 on the Program, the distribution of the whole must be on the terms of 121 this License, whose permissions for other licensees extend to the 122 entire whole, and thus to each and every part regardless of who wrote it. 123 124 Thus, it is not the intent of this section to claim rights or contest 125 your rights to work written entirely by you; rather, the intent is to 126 exercise the right to control the distribution of derivative or 127 collective works based on the Program. 128 129 In addition, mere aggregation of another work not based on the Program 130 with the Program (or with a work based on the Program) on a volume of 131 a storage or distribution medium does not bring the other work under 132 the scope of this License. 133 134 3. You may copy and distribute the Program (or a work based on it, 135 under Section 2) in object code or executable form under the terms of 136 Sections 1 and 2 above provided that you also do one of the following: 137 138 a) Accompany it with the complete corresponding machine-readable 139 source code, which must be distributed under the terms of Sections 140 1 and 2 above on a medium customarily used for software interchange; or, 141 142 b) Accompany it with a written offer, valid for at least three 143 years, to give any third party, for a charge no more than your 144 cost of physically performing source distribution, a complete 145 machine-readable copy of the corresponding source code, to be 146 distributed under the terms of Sections 1 and 2 above on a medium 147 customarily used for software interchange; or, 148 149 c) Accompany it with the information you received as to the offer 150 to distribute corresponding source code. (This alternative is 151 allowed only for noncommercial distribution and only if you 152 received the program in object code or executable form with such 153 an offer, in accord with Subsection b above.) 154 155 The source code for a work means the preferred form of the work for 156 making modifications to it. For an executable work, complete source 157 code means all the source code for all modules it contains, plus any 158 associated interface definition files, plus the scripts used to 159 control compilation and installation of the executable. However, as a 160 special exception, the source code distributed need not include 161 anything that is normally distributed (in either source or binary 162 form) with the major components (compiler, kernel, and so on) of the 163 operating system on which the executable runs, unless that component 164 itself accompanies the executable. 165 166 If distribution of executable or object code is made by offering 167 access to copy from a designated place, then offering equivalent 168 access to copy the source code from the same place counts as 169 distribution of the source code, even though third parties are not 170 compelled to copy the source along with the object code. 171 172 4. You may not copy, modify, sublicense, or distribute the Program 173 except as expressly provided under this License. Any attempt 174 otherwise to copy, modify, sublicense or distribute the Program is 175 void, and will automatically terminate your rights under this License. 176 However, parties who have received copies, or rights, from you under 177 this License will not have their licenses terminated so long as such 178 parties remain in full compliance. 179 180 5. You are not required to accept this License, since you have not 181 signed it. However, nothing else grants you permission to modify or 182 distribute the Program or its derivative works. These actions are 183 prohibited by law if you do not accept this License. Therefore, by 184 modifying or distributing the Program (or any work based on the 185 Program), you indicate your acceptance of this License to do so, and 186 all its terms and conditions for copying, distributing or modifying 187 the Program or works based on it. 188 189 6. Each time you redistribute the Program (or any work based on the 190 Program), the recipient automatically receives a license from the 191 original licensor to copy, distribute or modify the Program subject to 192 these terms and conditions. You may not impose any further 193 restrictions on the recipients' exercise of the rights granted herein. 194 You are not responsible for enforcing compliance by third parties to 195 this License. 196 197 7. If, as a consequence of a court judgment or allegation of patent 198 infringement or for any other reason (not limited to patent issues), 199 conditions are imposed on you (whether by court order, agreement or 200 otherwise) that contradict the conditions of this License, they do not 201 excuse you from the conditions of this License. If you cannot 202 distribute so as to satisfy simultaneously your obligations under this 203 License and any other pertinent obligations, then as a consequence you 204 may not distribute the Program at all. For example, if a patent 205 license would not permit royalty-free redistribution of the Program by 206 all those who receive copies directly or indirectly through you, then 207 the only way you could satisfy both it and this License would be to 208 refrain entirely from distribution of the Program. 209 210 If any portion of this section is held invalid or unenforceable under 211 any particular circumstance, the balance of the section is intended to 212 apply and the section as a whole is intended to apply in other 213 circumstances. 214 215 It is not the purpose of this section to induce you to infringe any 216 patents or other property right claims or to contest validity of any 217 such claims; this section has the sole purpose of protecting the 218 integrity of the free software distribution system, which is 219 implemented by public license practices. Many people have made 220 generous contributions to the wide range of software distributed 221 through that system in reliance on consistent application of that 222 system; it is up to the author/donor to decide if he or she is willing 223 to distribute software through any other system and a licensee cannot 224 impose that choice. 225 226 This section is intended to make thoroughly clear what is believed to 227 be a consequence of the rest of this License. 228 229 8. If the distribution and/or use of the Program is restricted in 230 certain countries either by patents or by copyrighted interfaces, the 231 original copyright holder who places the Program under this License 232 may add an explicit geographical distribution limitation excluding 233 those countries, so that distribution is permitted only in or among 234 countries not thus excluded. In such case, this License incorporates 235 the limitation as if written in the body of this License. 236 237 9. The Free Software Foundation may publish revised and/or new versions 238 of the General Public License from time to time. Such new versions will 239 be similar in spirit to the present version, but may differ in detail to 240 address new problems or concerns. 241 242 Each version is given a distinguishing version number. If the Program 243 specifies a version number of this License which applies to it and "any 244 later version", you have the option of following the terms and conditions 245 either of that version or of any later version published by the Free 246 Software Foundation. If the Program does not specify a version number of 247 this License, you may choose any version ever published by the Free Software 248 Foundation. 249 250 10. If you wish to incorporate parts of the Program into other free 251 programs whose distribution conditions are different, write to the author 252 to ask for permission. For software which is copyrighted by the Free 253 Software Foundation, write to the Free Software Foundation; we sometimes 254 make exceptions for this. Our decision will be guided by the two goals 255 of preserving the free status of all derivatives of our free software and 256 of promoting the sharing and reuse of software generally. 257 258 NO WARRANTY 259 260 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 REPAIR OR CORRECTION. 269 270 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 POSSIBILITY OF SUCH DAMAGES. 279 280 END OF TERMS AND CONDITIONS 281 282 Appendix: How to Apply These Terms to Your New Programs 283 284 If you develop a new program, and you want it to be of the greatest 285 possible use to the public, the best way to achieve this is to make it 286 free software which everyone can redistribute and change under these terms. 287 288 To do so, attach the following notices to the program. It is safest 289 to attach them to the start of each source file to most effectively 290 convey the exclusion of warranty; and each file should have at least 291 the "copyright" line and a pointer to where the full notice is found. 292 293 <one line to give the program's name and a brief idea of what it does.> 294 Copyright (C) 19yy <name of author> 295 296 This program is free software; you can redistribute it and/or modify 297 it under the terms of the GNU General Public License as published by 298 the Free Software Foundation; either version 2 of the License, or 299 (at your option) any later version. 300 301 This program is distributed in the hope that it will be useful, 302 but WITHOUT ANY WARRANTY; without even the implied warranty of 303 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 GNU General Public License for more details. 305 306 You should have received a copy of the GNU General Public License 307 along with this program; if not, write to the Free Software 308 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 309 310 Also add information on how to contact you by electronic and paper mail. 311 312 If the program is interactive, make it output a short notice like this 313 when it starts in an interactive mode: 314 315 Gnomovision version 69, Copyright (C) 19yy name of author 316 Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 This is free software, and you are welcome to redistribute it 318 under certain conditions; type `show c' for details. 319 320 The hypothetical commands `show w' and `show c' should show the appropriate 321 parts of the General Public License. Of course, the commands you use may 322 be called something other than `show w' and `show c'; they could even be 323 mouse-clicks or menu items--whatever suits your program. 324 325 You should also get your employer (if you work as a programmer) or your 326 school, if any, to sign a "copyright disclaimer" for the program, if 327 necessary. Here is a sample; alter the names: 328 329 Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 332 <signature of Ty Coon>, 1 April 1989 333 Ty Coon, President of Vice 334 335 This General Public License does not permit incorporating your program into 336 proprietary programs. If your program is a subroutine library, you may 337 consider it more useful to permit linking proprietary applications with the 338 library. If this is what you want to do, use the GNU Library General 339 Public License instead of this License. ffdecsa/Makefile (working copy) 1 parent: 2 @$(MAKE) --no-print-directory -C .. ffdecsa/ffdecsa.c (working copy) 1 /* FFdecsa -- fast decsa algorithm 2 * 3 * Copyright (C) 2003-2004 fatih89r 4 * 5 * This program is free software; you can redistribute it and/or modify 6 * it under the terms of the GNU General Public License as published by 7 * the Free Software Foundation; either version 2 of the License, or 8 * (at your option) any later version. 9 * 10 * This program is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * GNU General Public License for more details. 14 * 15 * You should have received a copy of the GNU General Public License 16 * along with this program; if not, write to the Free Software 17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 18 */ 19 20 21 #include <sys/types.h> 22 #include <string.h> 23 #include <stdio.h> 24 #include <stdlib.h> 25 26 #include "ffdecsa.h" 27 28 #ifndef NULL 29 #define NULL 0 30 #endif 31 32 //#define DEBUG 33 #ifdef DEBUG 34 #define DBG(a) a 35 #else 36 #define DBG(a) 37 #endif 38 39 //// parallelization stuff, large speed differences are possible 40 // possible choices 41 #define PARALLEL_32_4CHAR 320 42 #define PARALLEL_32_4CHARA 321 43 #define PARALLEL_32_INT 322 44 #define PARALLEL_64_8CHAR 640 45 #define PARALLEL_64_8CHARA 641 46 #define PARALLEL_64_2INT 642 47 #define PARALLEL_64_LONG 643 48 #define PARALLEL_64_MMX 644 49 #define PARALLEL_128_16CHAR 1280 50 #define PARALLEL_128_16CHARA 1281 51 #define PARALLEL_128_4INT 1282 52 #define PARALLEL_128_2LONG 1283 53 #define PARALLEL_128_2MMX 1284 54 #define PARALLEL_128_SSE 1285 55 #define PARALLEL_128_SSE2 1286 56 57 //////// our choice //////////////// our choice //////////////// our choice //////////////// our choice //////// 58 #ifndef PARALLEL_MODE 59 60 #if defined(__x86_64__) || defined(_M_X64) 61 #define PARALLEL_MODE PARALLEL_128_SSE2 62 63 #elif defined(__mips__) || defined(__mips) || defined(__MIPS__) 64 #define PARALLEL_MODE PARALLEL_64_LONG 65 66 #elif defined(__sh__) || defined(__SH4__) 67 #define PARALLEL_MODE PARALLEL_32_INT 68 #define COPY_UNALIGNED_PKT 69 #define MEMALIGN_VAL 4 70 71 #else 72 #define PARALLEL_MODE PARALLEL_32_INT 73 #endif 74 75 #endif 76 //////// our choice //////////////// our choice //////////////// our choice //////////////// our choice //////// 77 78 #include "parallel_generic.h" 79 //// conditionals 80 #if PARALLEL_MODE==PARALLEL_32_4CHAR 81 #include "parallel_032_4char.h" 82 #elif PARALLEL_MODE==PARALLEL_32_4CHARA 83 #include "parallel_032_4charA.h" 84 #elif PARALLEL_MODE==PARALLEL_32_INT 85 #include "parallel_032_int.h" 86 #elif PARALLEL_MODE==PARALLEL_64_8CHAR 87 #include "parallel_064_8char.h" 88 #elif PARALLEL_MODE==PARALLEL_64_8CHARA 89 #include "parallel_064_8charA.h" 90 #elif PARALLEL_MODE==PARALLEL_64_2INT 91 #include "parallel_064_2int.h" 92 #elif PARALLEL_MODE==PARALLEL_64_LONG 93 #include "parallel_064_long.h" 94 #elif PARALLEL_MODE==PARALLEL_64_MMX 95 #include "parallel_064_mmx.h" 96 #elif PARALLEL_MODE==PARALLEL_128_16CHAR 97 #include "parallel_128_16char.h" 98 #elif PARALLEL_MODE==PARALLEL_128_16CHARA 99 #include "parallel_128_16charA.h" 100 #elif PARALLEL_MODE==PARALLEL_128_4INT 101 #include "parallel_128_4int.h" 102 #elif PARALLEL_MODE==PARALLEL_128_2LONG 103 #include "parallel_128_2long.h" 104 #elif PARALLEL_MODE==PARALLEL_128_2MMX 105 #include "parallel_128_2mmx.h" 106 #elif PARALLEL_MODE==PARALLEL_128_SSE 107 #include "parallel_128_sse.h" 108 #elif PARALLEL_MODE==PARALLEL_128_SSE2 109 #include "parallel_128_sse2.h" 110 #else 111 #error "unknown/undefined parallel mode" 112 #endif 113 114 // stuff depending on conditionals 115 116 #define BYTES_PER_GROUP (GROUP_PARALLELISM/8) 117 #define BYPG BYTES_PER_GROUP 118 #define BITS_PER_GROUP GROUP_PARALLELISM 119 #define BIPG BITS_PER_GROUP 120 121 // platform specific 122 123 #ifdef __arm__ 124 #if !defined(MEMALIGN_VAL) || MEMALIGN_VAL<4 125 #undef MEMALIGN_VAL 126 #define MEMALIGN_VAL 4 127 #endif 128 #define COPY_UNALIGNED_PKT 129 #endif 130 131 // 132 133 #ifndef MALLOC 134 #define MALLOC(X) malloc(X) 135 #endif 136 #ifndef FREE 137 #define FREE(X) free(X) 138 #endif 139 #ifdef MEMALIGN_VAL 140 #define MEMALIGN __attribute__((aligned(MEMALIGN_VAL))) 141 #else 142 #define MEMALIGN 143 #endif 144 145 //// debug tool 146 147 #ifdef DEBUG 148 static void dump_mem(const char *string, const unsigned char *p, int len, int linelen){ 149 int i; 150 for(i=0;i<len;i++){ 151 if(i%linelen==0&&i) fprintf(stderr,"\n"); 152 if(i%linelen==0) fprintf(stderr,"%s %08x:",string,i); 153 else{ 154 if(i%8==0) fprintf(stderr," "); 155 if(i%4==0) fprintf(stderr," "); 156 } 157 fprintf(stderr," %02x",p[i]); 158 } 159 if(i%linelen==0) fprintf(stderr,"\n"); 160 } 161 #endif 162 163 ////////////////////////////////////////////////////////////////////////////////// 164 165 struct csa_key_t{ 166 unsigned char ck[8]; 167 // used by stream 168 int iA[8]; // iA[0] is for A1, iA[7] is for A8 169 int iB[8]; // iB[0] is for B1, iB[7] is for B8 170 // used by stream (group) 171 MEMALIGN group ck_g[8][8]; // [byte][bit:0=LSB,7=MSB] 172 MEMALIGN group iA_g[8][4]; // [0 for A1][0 for LSB] 173 MEMALIGN group iB_g[8][4]; // [0 for B1][0 for LSB] 174 // used by block 175 unsigned char kk[56]; 176 // used by block (group) 177 MEMALIGN batch kkmulti[56]; // many times the same byte in every batch 178 }; 179 180 struct csa_keys_t{ 181 struct csa_key_t even; 182 struct csa_key_t odd; 183 }; 184 185 //-----stream cypher 186 187 //-----key schedule for stream decypher 188 static void key_schedule_stream( 189 unsigned char *ck, // [In] ck[0]-ck[7] 8 bytes | Key. 190 int *iA, // [Out] iA[0]-iA[7] 8 nibbles | Key schedule. 191 int *iB) // [Out] iB[0]-iB[7] 8 nibbles | Key schedule. 192 { 193 iA[0]=(ck[0]>>4)&0xf; 194 iA[1]=(ck[0] )&0xf; 195 iA[2]=(ck[1]>>4)&0xf; 196 iA[3]=(ck[1] )&0xf; 197 iA[4]=(ck[2]>>4)&0xf; 198 iA[5]=(ck[2] )&0xf; 199 iA[6]=(ck[3]>>4)&0xf; 200 iA[7]=(ck[3] )&0xf; 201 iB[0]=(ck[4]>>4)&0xf; 202 iB[1]=(ck[4] )&0xf; 203 iB[2]=(ck[5]>>4)&0xf; 204 iB[3]=(ck[5] )&0xf; 205 iB[4]=(ck[6]>>4)&0xf; 206 iB[5]=(ck[6] )&0xf; 207 iB[6]=(ck[7]>>4)&0xf; 208 iB[7]=(ck[7] )&0xf; 209 } 210 211 //----- stream main function 212 213 #define STREAM_INIT 214 #include "stream.c" 215 #undef STREAM_INIT 216 217 #define STREAM_NORMAL 218 #include "stream.c" 219 #undef STREAM_NORMAL 220 221 222 //-----block decypher 223 224 //-----key schedule for block decypher 225 226 static void key_schedule_block( 227 unsigned char *ck, // [In] ck[0]-ck[7] 8 bytes | Key. 228 unsigned char *kk) // [Out] kk[0]-kk[55] 56 bytes | Key schedule. 229 { 230 static const unsigned char key_perm[0x40] = { 231 0x12,0x24,0x09,0x07,0x2A,0x31,0x1D,0x15, 0x1C,0x36,0x3E,0x32,0x13,0x21,0x3B,0x40, 232 0x18,0x14,0x25,0x27,0x02,0x35,0x1B,0x01, 0x22,0x04,0x0D,0x0E,0x39,0x28,0x1A,0x29, 233 0x33,0x23,0x34,0x0C,0x16,0x30,0x1E,0x3A, 0x2D,0x1F,0x08,0x19,0x17,0x2F,0x3D,0x11, 234 0x3C,0x05,0x38,0x2B,0x0B,0x06,0x0A,0x2C, 0x20,0x3F,0x2E,0x0F,0x03,0x26,0x10,0x37, 235 }; 236 237 int i,j,k; 238 int bit[64]; 239 int newbit[64]; 240 int kb[7][8]; 241 242 // 56 steps 243 // 56 key bytes kk(55)..kk(0) by key schedule from ck 244 245 // kb(6,0) .. kb(6,7) = ck(0) .. ck(7) 246 kb[6][0] = ck[0]; 247 kb[6][1] = ck[1]; 248 kb[6][2] = ck[2]; 249 kb[6][3] = ck[3]; 250 kb[6][4] = ck[4]; 251 kb[6][5] = ck[5]; 252 kb[6][6] = ck[6]; 253 kb[6][7] = ck[7]; 254 255 // calculate kb[5] .. kb[0] 256 for(i=5; i>=0; i--){ 257 // 64 bit perm on kb 258 for(j=0; j<8; j++){ 259 for(k=0; k<8; k++){ 260 bit[j*8+k] = (kb[i+1][j] >> (7-k)) & 1; 261 newbit[key_perm[j*8+k]-1] = bit[j*8+k]; 262 } 263 } 264 for(j=0; j<8; j++){ 265 kb[i][j] = 0; 266 for(k=0; k<8; k++){ 267 kb[i][j] |= newbit[j*8+k] << (7-k); 268 } 269 } 270 } 271 272 // xor to give kk 273 for(i=0; i<7; i++){ 274 for(j=0; j<8; j++){ 275 kk[i*8+j] = kb[i][j] ^ i; 276 } 277 } 278 279 } 280 281 //-----block utils 282 283 static inline __attribute__((always_inline)) void trasp_N_8 (unsigned char *in,unsigned char* out,int count){ 284 int *ri=(int *)in; 285 int *ibi=(int *)out; 286 int j,i,k,g; 287 // copy and first step 288 for(g=0;g<count;g++){ 289 ri[g]=ibi[2*g]; 290 ri[GROUP_PARALLELISM+g]=ibi[2*g+1]; 291 } 292 //dump_mem("NE1 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 293 // now 01230123 294 #define INTS_PER_ROW (GROUP_PARALLELISM/8*2) 295 for(j=0;j<8;j+=4){ 296 for(i=0;i<2;i++){ 297 for(k=0;k<INTS_PER_ROW;k++){ 298 unsigned int t,b; 299 t=ri[INTS_PER_ROW*(j+i)+k]; 300 b=ri[INTS_PER_ROW*(j+i+2)+k]; 301 ri[INTS_PER_ROW*(j+i)+k]= (t&0x0000ffff) | ((b )<<16); 302 ri[INTS_PER_ROW*(j+i+2)+k]= ((t )>>16) | (b&0xffff0000) ; 303 } 304 } 305 } 306 //dump_mem("NE2 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 307 // now 01010101 308 for(j=0;j<8;j+=2){ 309 for(i=0;i<1;i++){ 310 for(k=0;k<INTS_PER_ROW;k++){ 311 unsigned int t,b; 312 t=ri[INTS_PER_ROW*(j+i)+k]; 313 b=ri[INTS_PER_ROW*(j+i+1)+k]; 314 ri[INTS_PER_ROW*(j+i)+k]= (t&0x00ff00ff) | ((b&0x00ff00ff)<<8); 315 ri[INTS_PER_ROW*(j+i+1)+k]= ((t&0xff00ff00)>>8) | (b&0xff00ff00); 316 } 317 } 318 } 319 //dump_mem("NE3 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 320 // now 00000000 321 } 322 323 static inline __attribute__((always_inline)) void trasp_8_N (unsigned char *in,unsigned char* out,int count){ 324 int *ri=(int *)in; 325 int *bdi=(int *)out; 326 int j,i,k,g; 327 #define INTS_PER_ROW (GROUP_PARALLELISM/8*2) 328 //dump_mem("NE1 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 329 // now 00000000 330 for(j=0;j<8;j+=2){ 331 for(i=0;i<1;i++){ 332 for(k=0;k<INTS_PER_ROW;k++){ 333 unsigned int t,b; 334 t=ri[INTS_PER_ROW*(j+i)+k]; 335 b=ri[INTS_PER_ROW*(j+i+1)+k]; 336 ri[INTS_PER_ROW*(j+i)+k]= (t&0x00ff00ff) | ((b&0x00ff00ff)<<8); 337 ri[INTS_PER_ROW*(j+i+1)+k]= ((t&0xff00ff00)>>8) | (b&0xff00ff00); 338 } 339 } 340 } 341 //dump_mem("NE2 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 342 // now 01010101 343 for(j=0;j<8;j+=4){ 344 for(i=0;i<2;i++){ 345 for(k=0;k<INTS_PER_ROW;k++){ 346 unsigned int t,b; 347 t=ri[INTS_PER_ROW*(j+i)+k]; 348 b=ri[INTS_PER_ROW*(j+i+2)+k]; 349 ri[INTS_PER_ROW*(j+i)+k]= (t&0x0000ffff) | ((b )<<16); 350 ri[INTS_PER_ROW*(j+i+2)+k]= ((t )>>16) | (b&0xffff0000) ; 351 } 352 } 353 } 354 //dump_mem("NE3 r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 355 // now 01230123 356 for(g=0;g<count;g++){ 357 bdi[2*g]=ri[g]; 358 bdi[2*g+1]=ri[GROUP_PARALLELISM+g]; 359 } 360 } 361 362 //-----block main function 363 364 // block group 365 static void block_decypher_group( 366 batch *kkmulti, // [In] kkmulti[0]-kkmulti[55] 56 batches | Key schedule (each batch has repeated equal bytes). 367 unsigned char *ib, // [In] (ib0,ib1,...ib7)...x32 32*8 bytes | Initialization vector. 368 unsigned char *bd, // [Out] (bd0,bd1,...bd7)...x32 32*8 bytes | Block decipher. 369 int count) 370 { 371 // int is faster than unsigned char. apparently not 372 static const unsigned char block_sbox[0x100] = { 373 0x3A,0xEA,0x68,0xFE,0x33,0xE9,0x88,0x1A, 0x83,0xCF,0xE1,0x7F,0xBA,0xE2,0x38,0x12, 374 0xE8,0x27,0x61,0x95,0x0C,0x36,0xE5,0x70, 0xA2,0x06,0x82,0x7C,0x17,0xA3,0x26,0x49, 375 0xBE,0x7A,0x6D,0x47,0xC1,0x51,0x8F,0xF3, 0xCC,0x5B,0x67,0xBD,0xCD,0x18,0x08,0xC9, 376 0xFF,0x69,0xEF,0x03,0x4E,0x48,0x4A,0x84, 0x3F,0xB4,0x10,0x04,0xDC,0xF5,0x5C,0xC6, 377 0x16,0xAB,0xAC,0x4C,0xF1,0x6A,0x2F,0x3C, 0x3B,0xD4,0xD5,0x94,0xD0,0xC4,0x63,0x62, 378 0x71,0xA1,0xF9,0x4F,0x2E,0xAA,0xC5,0x56, 0xE3,0x39,0x93,0xCE,0x65,0x64,0xE4,0x58, 379 0x6C,0x19,0x42,0x79,0xDD,0xEE,0x96,0xF6, 0x8A,0xEC,0x1E,0x85,0x53,0x45,0xDE,0xBB, 380 0x7E,0x0A,0x9A,0x13,0x2A,0x9D,0xC2,0x5E, 0x5A,0x1F,0x32,0x35,0x9C,0xA8,0x73,0x30, 381 382 0x29,0x3D,0xE7,0x92,0x87,0x1B,0x2B,0x4B, 0xA5,0x57,0x97,0x40,0x15,0xE6,0xBC,0x0E, 383 0xEB,0xC3,0x34,0x2D,0xB8,0x44,0x25,0xA4, 0x1C,0xC7,0x23,0xED,0x90,0x6E,0x50,0x00, 384 0x99,0x9E,0x4D,0xD9,0xDA,0x8D,0x6F,0x5F, 0x3E,0xD7,0x21,0x74,0x86,0xDF,0x6B,0x05, 385 0x8E,0x5D,0x37,0x11,0xD2,0x28,0x75,0xD6, 0xA7,0x77,0x24,0xBF,0xF0,0xB0,0x02,0xB7, 386 0xF8,0xFC,0x81,0x09,0xB1,0x01,0x76,0x91, 0x7D,0x0F,0xC8,0xA0,0xF2,0xCB,0x78,0x60, 387 0xD1,0xF7,0xE0,0xB5,0x98,0x22,0xB3,0x20, 0x1D,0xA6,0xDB,0x7B,0x59,0x9F,0xAE,0x31, 388 0xFB,0xD3,0xB6,0xCA,0x43,0x72,0x07,0xF4, 0xD8,0x41,0x14,0x55,0x0D,0x54,0x8B,0xB9, 389 0xAD,0x46,0x0B,0xAF,0x80,0x52,0x2C,0xFA, 0x8C,0x89,0x66,0xFD,0xB2,0xA9,0x9B,0xC0, 390 }; 391 MEMALIGN unsigned char r[GROUP_PARALLELISM*(8+56)]; /* 56 because we will move back in memory while looping */ 392 MEMALIGN unsigned char sbox_in[GROUP_PARALLELISM],sbox_out[GROUP_PARALLELISM],perm_out[GROUP_PARALLELISM]; 393 int roff; 394 int i,g,count_all=GROUP_PARALLELISM; 395 396 roff=GROUP_PARALLELISM*56; 397 398 #define FASTTRASP1 399 #ifndef FASTTRASP1 400 for(g=0;g<count;g++){ 401 // Init registers 402 int j; 403 for(j=0;j<8;j++){ 404 r[roff+GROUP_PARALLELISM*j+g]=ib[8*g+j]; 405 } 406 } 407 #else 408 trasp_N_8((unsigned char *)&r[roff],(unsigned char *)ib,count); 409 #endif 410 //dump_mem("OLD r[roff]",&r[roff],GROUP_PARALLELISM*8,GROUP_PARALLELISM); 411 412 // loop over kk[55]..kk[0] 413 for(i=55;i>=0;i--){ 414 { 415 MEMALIGN batch tkkmulti=kkmulti[i]; 416 batch *si=(batch *)sbox_in; 417 batch *r6_N=(batch *)(r+roff+GROUP_PARALLELISM*6); 418 for(g=0;g<count_all/BYTES_PER_BATCH;g++){ 419 si[g]=B_FFXOR(tkkmulti,r6_N[g]); //FIXME: introduce FASTBATCH? 420 } 421 } 422 423 // table lookup, this works on only one byte at a time 424 // most difficult part of all 425 // - can't be parallelized 426 // - can't be synthetized through boolean terms (8 input bits are too many) 427 for(g=0;g<count_all;g++){ 428 sbox_out[g]=block_sbox[sbox_in[g]]; 429 } 430 431 // bit permutation 432 { 433 unsigned char *po=(unsigned char *)perm_out; 434 unsigned char *so=(unsigned char *)sbox_out; 435 //dump_mem("pre perm ",(unsigned char *)so,GROUP_PARALLELISM,GROUP_PARALLELISM); 436 for(g=0;g<count_all;g+=BYTES_PER_BATCH){ 437 MEMALIGN batch in,out; 438 in=*(batch *)&so[g]; 439 440 out=B_FFOR( 441 B_FFOR( 442 B_FFOR( 443 B_FFOR( 444 B_FFOR( 445 B_FFSH8L(B_FFAND(in,B_FFN_ALL_29()),1), 446 B_FFSH8L(B_FFAND(in,B_FFN_ALL_02()),6)), 447 B_FFSH8L(B_FFAND(in,B_FFN_ALL_04()),3)), 448 B_FFSH8R(B_FFAND(in,B_FFN_ALL_10()),2)), 449 B_FFSH8R(B_FFAND(in,B_FFN_ALL_40()),6)), 450 B_FFSH8R(B_FFAND(in,B_FFN_ALL_80()),4)); 451 452 *(batch *)&po[g]=out; 453 } 454 //dump_mem("post perm",(unsigned char *)po,GROUP_PARALLELISM,GROUP_PARALLELISM); 455 } 456 457 roff-=GROUP_PARALLELISM; /* virtual shift of registers */ 458 459 #if 0 460 /* one by one */ 461 for(g=0;g<count_all;g++){ 462 r[roff+GROUP_PARALLELISM*0+g]=r[roff+GROUP_PARALLELISM*8+g]^sbox_out[g]; 463 r[roff+GROUP_PARALLELISM*6+g]^=perm_out[g]; 464 r[roff+GROUP_PARALLELISM*4+g]^=r[roff+GROUP_PARALLELISM*0+g]; 465 r[roff+GROUP_PARALLELISM*3+g]^=r[roff+GROUP_PARALLELISM*0+g]; 466 r[roff+GROUP_PARALLELISM*2+g]^=r[roff+GROUP_PARALLELISM*0+g]; 467 } 468 #else 469 for(g=0;g<count_all;g+=BEST_SPAN){ 470 XOR_BEST_BY(&r[roff+GROUP_PARALLELISM*0+g],&r[roff+GROUP_PARALLELISM*8+g],&sbox_out[g]); 471 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM*6+g],&perm_out[g]); 472 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM*4+g],&r[roff+GROUP_PARALLELISM*0+g]); 473 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM*3+g],&r[roff+GROUP_PARALLELISM*0+g]); 474 XOREQ_BEST_BY(&r[roff+GROUP_PARALLELISM*2+g],&r[roff+GROUP_PARALLELISM*0+g]); 475 } 476 #endif 477 } 478 479 #define FASTTRASP2 480 #ifndef FASTTRASP2 481 for(g=0;g<count;g++){ 482 // Copy results 483 int j; 484 for(j=0;j<8;j++){ 485 bd[8*g+j]=r[roff+GROUP_PARALLELISM*j+g]; 486 } 487 } 488 #else 489 trasp_8_N((unsigned char *)&r[roff],(unsigned char *)bd,count); 490 #endif 491 } 492 493 //-----------------------------------EXTERNAL INTERFACE 494 495 //-----get internal parallelism 496 497 int get_internal_parallelism(void){ 498 return GROUP_PARALLELISM; 499 } 500 501 //-----get suggested cluster size 502 503 int get_suggested_cluster_size(void){ 504 int r; 505 r=GROUP_PARALLELISM+GROUP_PARALLELISM/10; 506 if(r<GROUP_PARALLELISM+5) r=GROUP_PARALLELISM+5; 507 return r; 508 } 509 510 //-----key structure 511 512 void *get_key_struct(void){ 513 struct csa_keys_t *keys=(struct csa_keys_t *)MALLOC(sizeof(struct csa_keys_t)); 514 if(keys) { 515 static const unsigned char pk[8] = { 0,0,0,0,0,0,0,0 }; 516 set_control_words(keys,pk,pk); 517 } 518 return keys; 519 } 520 521 void free_key_struct(void *keys){ 522 return FREE(keys); 523 } 524 525 //-----set control words 526 527 static void schedule_key(struct csa_key_t *key, const unsigned char *pk){ 528 // could be made faster, but is not run often 529 int bi,by; 530 int i,j; 531 // key 532 memcpy(key->ck,pk,8); 533 // precalculations for stream 534 key_schedule_stream(key->ck,key->iA,key->iB); 535 for(by=0;by<8;by++){ 536 for(bi=0;bi<8;bi++){ 537 key->ck_g[by][bi]=(key->ck[by]&(1<<bi))?FF1():FF0(); 538 } 539 } 540 for(by=0;by<8;by++){ 541 for(bi=0;bi<4;bi++){ 542 key->iA_g[by][bi]=(key->iA[by]&(1<<bi))?FF1():FF0(); 543 key->iB_g[by][bi]=(key->iB[by]&(1<<bi))?FF1():FF0(); 544 } 545 } 546 // precalculations for block 547 key_schedule_block(key->ck,key->kk); 548 for(i=0;i<56;i++){ 549 for(j=0;j<BYTES_PER_BATCH;j++){ 550 *(((unsigned char *)&key->kkmulti[i])+j)=key->kk[i]; 551 } 552 } 553 } 554 555 void set_control_words(void *keys, const unsigned char *ev, const unsigned char *od){ 556 schedule_key(&((struct csa_keys_t *)keys)->even,ev); 557 schedule_key(&((struct csa_keys_t *)keys)->odd,od); 558 } 559 560 void set_even_control_word(void *keys, const unsigned char *pk){ 561 schedule_key(&((struct csa_keys_t *)keys)->even,pk); 562 } 563 564 void set_odd_control_word(void *keys, const unsigned char *pk){ 565 schedule_key(&((struct csa_keys_t *)keys)->odd,pk); 566 } 567 568 //-----get control words 569 570 void get_control_words(void *keys, unsigned char *even, unsigned char *odd){ 571 memcpy(even,&((struct csa_keys_t *)keys)->even.ck,8); 572 memcpy(odd,&((struct csa_keys_t *)keys)->odd.ck,8); 573 } 574 575 //----- decrypt 576 577 int decrypt_packets(void *keys, unsigned char **cluster){ 578 // statistics, currently unused 579 int stat_no_scramble=0; 580 int stat_reserved=0; 581 int stat_decrypted[2]={0,0}; 582 int stat_decrypted_mini=0; 583 unsigned char **clst; 584 unsigned char **clst2; 585 int grouped; 586 int group_ev_od; 587 int advanced; 588 int can_advance; 589 unsigned char *g_pkt[GROUP_PARALLELISM]; 590 int g_len[GROUP_PARALLELISM]; 591 int g_offset[GROUP_PARALLELISM]; 592 int g_n[GROUP_PARALLELISM]; 593 int g_residue[GROUP_PARALLELISM]; 594 unsigned char *pkt; 595 int xc0,ev_od,len,offset,n,residue; 596 struct csa_key_t* k; 597 int i,j,iter,g; 598 int t23,tsmall; 599 int alive[24]; 600 //icc craziness int pad1=0; //////////align! FIXME 601 unsigned char *encp[GROUP_PARALLELISM]; 602 MEMALIGN unsigned char stream_in[GROUP_PARALLELISM*8]; 603 MEMALIGN unsigned char stream_out[GROUP_PARALLELISM*8]; 604 MEMALIGN unsigned char ib[GROUP_PARALLELISM*8]; 605 MEMALIGN unsigned char block_out[GROUP_PARALLELISM*8]; 606 #ifdef COPY_UNALIGNED_PKT 607 unsigned char *unaligned[GROUP_PARALLELISM]; 608 MEMALIGN unsigned char alignedBuff[GROUP_PARALLELISM][188]; 609 #endif 610 struct stream_regs regs; 611 612 //icc craziness i=(int)&pad1;//////////align!!! FIXME 613 614 // build a list of packets to be processed 615 clst=cluster; 616 grouped=0; 617 advanced=0; 618 can_advance=1; 619 group_ev_od=-1; // silence incorrect compiler warning 620 pkt=*clst; 621 do{ // find a new packet 622 if(grouped==GROUP_PARALLELISM){ 623 // full 624 break; 625 } 626 if(pkt==NULL){ 627 // no more ranges 628 break; 629 } 630 if(pkt>=*(clst+1)){ 631 // out of this range, try next 632 clst++;clst++; 633 pkt=*clst; 634 continue; 635 } 636 637 do{ // handle this packet 638 xc0=pkt[3]&0xc0; 639 DBG(fprintf(stderr," exam pkt=%p, xc0=%02x, can_adv=%i\n",pkt,xc0,can_advance)); 640 if(xc0==0x00){ 641 DBG(fprintf(stderr,"skip clear pkt %p (can_advance is %i)\n",pkt,can_advance)); 642 advanced+=can_advance; 643 stat_no_scramble++; 644 break; 645 } 646 if(xc0==0x40){ 647 DBG(fprintf(stderr,"skip reserved pkt %p (can_advance is %i)\n",pkt,can_advance)); 648 advanced+=can_advance; 649 stat_reserved++; 650 break; 651 } 652 if(xc0==0x80||xc0==0xc0){ // encrypted 653 ev_od=(xc0&0x40)>>6; // 0 even, 1 odd 654 if(grouped==0) group_ev_od=ev_od; // this group will be all even (or odd) 655 if(group_ev_od==ev_od){ // could be added to group 656 pkt[3]&=0x3f; // consider it decrypted now 657 if(pkt[3]&0x20){ // incomplete packet 658 offset=4+pkt[4]+1; 659 len=188-offset; 660 n=len>>3; 661 residue=len-(n<<3); 662 if(n==0){ // decrypted==encrypted! 663 DBG(fprintf(stderr,"DECRYPTED MINI! (can_advance is %i)\n",can_advance)); 664 advanced+=can_advance; 665 stat_decrypted_mini++; 666 break; // this doesn't need more processing 667 } 668 }else{ 669 len=184; 670 offset=4; 671 n=23; 672 residue=0; 673 } 674 g_pkt[grouped]=pkt; 675 g_len[grouped]=len; 676 g_offset[grouped]=offset; 677 g_n[grouped]=n; 678 g_residue[grouped]=residue; 679 DBG(fprintf(stderr,"%2i: eo=%i pkt=%p len=%03i n=%2i residue=%i\n",grouped,ev_od,pkt,len,n,residue)); 680 grouped++; 681 advanced+=can_advance; 682 stat_decrypted[ev_od]++; 683 } 684 else{ 685 can_advance=0; 686 DBG(fprintf(stderr,"skip pkt %p and can_advance set to 0\n",pkt)); 687 break; // skip and go on 688 } 689 } 690 } while(0); 691 692 if(can_advance){ 693 // move range start forward 694 *clst+=188; 695 } 696 // next packet, if there is one 697 pkt+=188; 698 } while(1); 699 DBG(fprintf(stderr,"-- result: grouped %i pkts, advanced %i pkts\n",grouped,advanced)); 700 701 // delete empty ranges and compact list 702 clst2=cluster; 703 for(clst=cluster;*clst!=NULL;clst+=2){ 704 // if not empty 705 if(*clst<*(clst+1)){ 706 // it will remain 707 *clst2=*clst; 708 *(clst2+1)=*(clst+1); 709 clst2+=2; 710 } 711 } 712 *clst2=NULL; 713 714 if(grouped==0){ 715 // no processing needed 716 return advanced; 717 } 718 719 // sort them, longest payload first 720 // we expect many n=23 packets and a few n<23 721 DBG(fprintf(stderr,"PRESORTING\n")); 722 for(i=0;i<grouped;i++){ 723 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 724 } 725 // grouped is always <= GROUP_PARALLELISM 726 727 #define g_swap(a,b) \ 728 pkt=g_pkt[a]; \ 729 g_pkt[a]=g_pkt[b]; \ 730 g_pkt[b]=pkt; \ 731 \ 732 len=g_len[a]; \ 733 g_len[a]=g_len[b]; \ 734 g_len[b]=len; \ 735 \ 736 offset=g_offset[a]; \ 737 g_offset[a]=g_offset[b]; \ 738 g_offset[b]=offset; \ 739 \ 740 n=g_n[a]; \ 741 g_n[a]=g_n[b]; \ 742 g_n[b]=n; \ 743 \ 744 residue=g_residue[a]; \ 745 g_residue[a]=g_residue[b]; \ 746 g_residue[b]=residue; 747 748 // step 1: move n=23 packets before small packets 749 t23=0; 750 tsmall=grouped-1; 751 for(;;){ 752 for(;t23<grouped;t23++){ 753 if(g_n[t23]!=23) break; 754 } 755 DBG(fprintf(stderr,"t23 after for =%i\n",t23)); 756 757 for(;tsmall>=0;tsmall--){ 758 if(g_n[tsmall]==23) break; 759 } 760 DBG(fprintf(stderr,"tsmall after for =%i\n",tsmall)); 761 762 if(tsmall-t23<1) break; 763 764 DBG(fprintf(stderr,"swap t23=%i,tsmall=%i\n",t23,tsmall)); 765 766 g_swap(t23,tsmall); 767 768 t23++; 769 tsmall--; 770 DBG(fprintf(stderr,"new t23=%i,tsmall=%i\n\n",t23,tsmall)); 771 } 772 DBG(fprintf(stderr,"packets with n=23, t23=%i grouped=%i\n",t23,grouped)); 773 DBG(fprintf(stderr,"MIDSORTING\n")); 774 for(i=0;i<grouped;i++){ 775 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 776 } 777 778 // step 2: sort small packets in decreasing order of n (bubble sort is enough) 779 for(i=t23;i<grouped;i++){ 780 for(j=i+1;j<grouped;j++){ 781 if(g_n[j]>g_n[i]){ 782 g_swap(i,j); 783 } 784 } 785 } 786 DBG(fprintf(stderr,"POSTSORTING\n")); 787 for(i=0;i<grouped;i++){ 788 DBG(fprintf(stderr,"%2i of %2i: pkt=%p len=%03i n=%2i residue=%i\n",i,grouped,g_pkt[i],g_len[i],g_n[i],g_residue[i])); 789 } 790 791 // we need to know how many packets need 23 iterations, how many 22... 792 for(i=0;i<=23;i++){ 793 alive[i]=0; 794 } 795 // count 796 alive[23-1]=t23; 797 for(i=t23;i<grouped;i++){ 798 alive[g_n[i]-1]++; 799 } 800 // integrate 801 for(i=22;i>=0;i--){ 802 alive[i]+=alive[i+1]; 803 } 804 DBG(fprintf(stderr,"ALIVE\n")); 805 for(i=0;i<=23;i++){ 806 DBG(fprintf(stderr,"alive%2i=%i\n",i,alive[i])); 807 } 808 809 // choose key 810 if(group_ev_od==0){ 811 k=&((struct csa_keys_t *)keys)->even; 812 } 813 else{ 814 k=&((struct csa_keys_t *)keys)->odd; 815 } 816 817 //INIT 818 //#define INITIALIZE_UNUSED_INPUT 819 #ifdef INITIALIZE_UNUSED_INPUT 820 // unnecessary zeroing. 821 // without this, we operate on uninitialized memory 822 // when grouped<GROUP_PARALLELISM, but it's not a problem, 823 // as final results will be discarded. 824 // random data makes debugging sessions difficult. 825 for(j=0;j<GROUP_PARALLELISM*8;j++) stream_in[j]=0; 826 DBG(fprintf(stderr,"--- WARNING: you could gain speed by not initializing unused memory ---\n")); 827 #else 828 DBG(fprintf(stderr,"--- WARNING: DEBUGGING IS MORE DIFFICULT WHEN PROCESSING RANDOM DATA CHANGING AT EVERY RUN! ---\n")); 829 #endif 830 831 for(g=0;g<grouped;g++){ 832 encp[g]=g_pkt[g]; 833 DBG(fprintf(stderr,"header[%i]=%p (%02x)\n",g,encp[g],*(encp[g]))); 834 encp[g]+=g_offset[g]; // skip header 835 #ifdef COPY_UNALIGNED_PKT 836 if(((int)encp[g])&0x03) { 837 memcpy(alignedBuff[g],encp[g],g_len[g]); 838 unaligned[g]=encp[g]; ... This diff was truncated because it exceeds the maximum size that can be displayed.

{ "url": "https://tvheadend.org/attachments/5404/oscam-emu.11384.patch", "source_domain": "tvheadend.org", "snapshot_id": "crawl=CC-MAIN-2019-13", "warc_metadata": { "Content-Length": "233127", "Content-Type": "application/http; msgtype=response", "WARC-Block-Digest": "sha1:NTRLSW6YDN5C7KK5L5LG5K6WKAQORYA7", "WARC-Concurrent-To": "<urn:uuid:b41701e1-4433-4c39-acf1-2f19f573e1e3>", "WARC-Date": "2019-03-22T21:12:23Z", "WARC-IP-Address": "104.31.95.73", "WARC-Identified-Payload-Type": "text/html", "WARC-Payload-Digest": "sha1:7552ATJBU4RNRM3PSZX7FKCW5IYMLTC4", "WARC-Record-ID": "<urn:uuid:dceb9ee1-aeeb-4a2f-9a37-6a43765affdc>", "WARC-Target-URI": "https://tvheadend.org/attachments/5404/oscam-emu.11384.patch", "WARC-Truncated": null, "WARC-Type": "response", "WARC-Warcinfo-ID": "<urn:uuid:398d93fb-7bd3-4079-b051-4652c6566998>" }, "warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin (info@commoncrawl.org)\r\nhostname: ip-10-152-225-239.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/" }

{ "line_start_idx": [ 0, 8, 9, 17, 18, 26, 27, 49, 50, 77, 78, 96, 97, 127, 135, 175, 183, 223, 231, 271, 275, 315, 323, 369, 377, 401, 409, 437, 444, 452, 492, 500, 540, 548, 588, 592, 632, 640, 668, 676, 682, 690, 744, 751, 759, 810, 818, 895, 903, 904, 908, 1056, 1060, 1118, 1122, 1154, 1158, 1178, 1182, 1245, 1249, 1309, 1313, 1314, 1322, 1467, 1475, 1545, 1553, 1554, 1561, 1569, 1596, 1604, 1631, 1639, 1666, 1670, 1697, 1705, 1706, 1714, 1782, 1790, 1934, 1941, 1949, 1950, 1958, 1981, 1989, 2042, 2046, 2143, 2147, 2252, 2260, 2291, 2299, 2317, 2325, 2357, 2364, 2372, 2475, 2483, 2534, 2542, 2630, 2634, 2654, 2658, 2724, 2728, 2790, 2794, 2863, 2867, 2868, 2876, 2937, 2945, 2974, 2982, 3072, 3079, 3087, 3088, 3096, 3178, 3186, 3187, 3191, 3240, 3244, 3278, 3282, 3333, 3337, 3352, 3356, 3408, 3412, 3523, 3527, 3581, 3585, 3658, 3662, 3717, 3721, 3799, 3803, 3920, 3924, 3941, 3945, 3999, 4003, 4040, 4044, 4096, 4100, 4101, 4109, 4177, 4185, 4186, 4194, 4270, 4277, 4285, 4324, 4332, 4352, 4360, 4361, 4365, 4379, 4383, 4429, 4433, 4450, 4454, 4455, 4463, 4483, 4507, 4513, 4514, 4520, 4548, 4554, 4555, 4558, 4606, 4609, 4651, 4654, 4725, 4728, 4733, 4736, 4781, 4784, 4790, 4793, 4794, 4800, 4875, 4881, 4952, 4958, 5000, 5007, 5015, 5060, 5068, 5119, 5127, 5176, 5180, 5224, 5228, 5278, 5282, 5333, 5337, 5381, 5385, 5412, 5416, 5440, 5444, 5463, 5467, 5503, 5507, 5537, 5541, 5580, 5584, 5661, 5665, 5671, 5675, 5681, 5685, 5691, 5695, 5701, 5709, 5750, 5758, 5814, 5822, 5872, 5879, 5887, 5913, 5921, 5926, 5934, 6014, 6018, 6100, 6104, 6204, 6212, 6225, 6233, 6317, 6325, 6382, 6406, 6410, 6428, 6432, 6450, 6454, 6455, 6457, 6476, 6480, 6496, 6500, 6524, 6528, 6551, 6576, 6580, 6590, 6594, 6595, 6597, 6815, 6817, 7044, 7048, 7247, 7251, 7439, 7443, 7639, 7646, 7652, 7674, 7680, 7698, 7704, 7727, 7730, 7748, 7754, 7779, 7785, 7808, 7814, 7841, 7848, 7856, 7857, 7865, 7881, 7889, 7915, 7919, 8018, 8022, 8123, 8127, 8235, 8239, 8349, 8357, 8413, 8421, 8476, 8484, 8547, 8555, 8683, 8687, 8746, 8750, 8804, 8808, 8866, 8874, 8876, 8884, 8885, 8893, 8909, 8916, 8924, 9009, 9017, 9095, 9103, 9214, 9218, 9326, 9330, 9439, 9443, 9594, 9598, 9715, 9719, 9837, 9841, 10001, 10009, 10011, 10019, 10020, 10028, 10046, 10053, 10061, 10125, 10133, 10210, 10218, 10296, 10300, 10364, 10372, 10389, 10397, 10398, 10406, 10416, 10445, 10451, 10452, 10458, 10509, 10515, 10516, 10519, 10545, 10548, 10550, 10553, 10571, 10574, 10593, 10596, 10614, 10617, 10628, 10631, 10632, 10638, 10654, 10660, 10686, 10692, 10698, 10705, 10713, 10785, 10793, 10822, 10830, 10834, 10838, 10873, 10877, 10905, 10913, 10915, 10923, 10950, 10958, 10985, 10992, 11000, 11070, 11078, 11091, 11099, 11103, 11107, 11188, 11192, 11266, 11274, 11276, 11284, 11297, 11305, 11306, 11313, 11321, 11384, 11392, 11444, 11452, 11456, 11460, 11537, 11541, 11611, 11619, 11621, 11629, 11646, 11654, 11673, 11702, 11706, 11735, 11739, 11740, 11744, 11839, 11842, 11849, 11855, 11856, 11859, 11941, 11944, 11972, 11975, 11993, 11996, 12015, 12018, 12036, 12039, 12050, 12056, 12057, 12060, 12089, 12092, 12167, 12170, 12241, 12247, 12254, 12257, 12339, 12342, 12349, 12386, 12392, 12443, 12449, 12502, 12508, 12560, 12563, 12612, 12618, 12619, 12625, 12632, 12670, 12672, 12690, 12692, 12693, 12695, 12732, 12734, 12765, 12767, 12768, 12770, 12795, 12797, 12798, 12800, 12865, 12896, 12898, 12931, 12933, 12963, 12965, 12966, 12968, 13025, 13027, 13092, 13094, 13156, 13158, 13217, 13219, 13220, 13222, 13238, 13241, 13242, 13245, 13309, 13312, 13381, 13384, 13455, 13458, 13527, 13530, 13590, 13593, 13664, 13667, 13738, 13741, 13811, 13814, 13834, 13837, 13838, 13841, 13908, 13911, 13982, 13985, 14056, 14059, 14129, 14132, 14201, 14204, 14269, 14272, 14273, 14276, 14343, 14346, 14417, 14420, 14492, 14495, 14551, 14554, 14555, 14558, 14625, 14628, 14698, 14701, 14770, 14773, 14841, 14844, 14852, 14855, 14856, 14859, 14932, 14935, 15004, 15007, 15046, 15049, 15050, 15053, 15124, 15127, 15193, 15196, 15269, 15272, 15344, 15347, 15419, 15422, 15444, 15447, 15448, 15451, 15516, 15519, 15587, 15590, 15661, 15664, 15734, 15737, 15809, 15812, 15813, 15816, 15881, 15884, 15905, 15908, 15910, 15913, 15946, 15949, 16016, 16019, 16020, 16023, 16093, 16096, 16165, 16168, 16239, 16242, 16312, 16315, 16384, 16387, 16453, 16456, 16525, 16528, 16599, 16602, 16666, 16669, 16670, 16673, 16742, 16745, 16810, 16813, 16884, 16887, 16950, 16953, 17019, 17022, 17077, 17080, 17081, 17084, 17150, 17153, 17217, 17220, 17288, 17291, 17356, 17359, 17430, 17433, 17501, 17504, 17528, 17531, 17532, 17535, 17605, 17608, 17680, 17683, 17684, 17687, 17757, 17760, 17822, 17825, 17892, 17895, 17955, 17958, 17959, 17962, 18030, 18033, 18100, 18103, 18104, 18107, 18178, 18181, 18249, 18253, 18323, 18327, 18372, 18376, 18377, 18381, 18450, 18454, 18517, 18521, 18590, 18594, 18659, 18663, 18734, 18738, 18804, 18808, 18878, 18882, 18949, 18953, 19022, 19026, 19085, 19089, 19091, 19095, 19157, 19161, 19230, 19234, 19301, 19305, 19373, 19377, 19444, 19448, 19518, 19522, 19592, 19596, 19662, 19666, 19740, 19744, 19745, 19749, 19819, 19823, 19893, 19897, 19961, 19965, 20004, 20008, 20009, 20013, 20084, 20088, 20158, 20162, 20231, 20235, 20262, 20266, 20267, 20271, 20340, 20344, 20414, 20418, 20489, 20493, 20494, 20498, 20567, 20571, 20642, 20646, 20723, 20727, 20728, 20732, 20799, 20803, 20870, 20874, 20940, 20944, 21010, 21014, 21084, 21088, 21139, 21143, 21144, 21148, 21218, 21222, 21289, 21293, 21357, 21361, 21430, 21434, 21484, 21488, 21489, 21493, 21561, 21565, 21634, 21638, 21707, 21711, 21775, 21779, 21850, 21854, 21918, 21922, 21988, 21992, 22061, 22065, 22134, 22138, 22173, 22177, 22178, 22182, 22247, 22251, 22316, 22320, 22381, 22385, 22452, 22456, 22513, 22517, 22519, 22523, 22592, 22596, 22658, 22662, 22729, 22733, 22804, 22808, 22877, 22881, 22950, 22954, 22989, 22993, 22994, 22998, 23067, 23071, 23140, 23144, 23211, 23215, 23283, 23287, 23351, 23355, 23424, 23428, 23496, 23500, 23534, 23538, 23539, 23543, 23613, 23617, 23683, 23687, 23758, 23762, 23822, 23826, 23897, 23901, 23970, 23974, 23988, 23992, 23993, 23997, 24067, 24071, 24140, 24144, 24212, 24216, 24287, 24291, 24354, 24358, 24429, 24433, 24504, 24508, 24573, 24577, 24648, 24652, 24722, 24726, 24794, 24798, 24849, 24853, 24854, 24858, 24928, 24932, 25003, 25007, 25070, 25074, 25089, 25093, 25094, 25098, 25166, 25170, 25239, 25243, 25308, 25312, 25373, 25377, 25441, 25445, 25510, 25514, 25580, 25584, 25655, 25659, 25729, 25733, 25753, 25757, 25758, 25762, 25832, 25836, 25882, 25886, 25888, 25892, 25960, 25964, 26034, 26038, 26106, 26110, 26177, 26181, 26249, 26253, 26323, 26327, 26385, 26389, 26390, 26394, 26468, 26472, 26545, 26549, 26622, 26626, 26660, 26664, 26665, 26669, 26740, 26744, 26816, 26820, 26894, 26898, 26967, 26971, 27045, 27049, 27126, 27130, 27142, 27146, 27147, 27151, 27221, 27225, 27299, 27303, 27373, 27377, 27450, 27454, 27526, 27530, 27604, 27608, 27666, 27670, 27671, 27675, 27694, 27698, 27699, 27703, 27778, 27782, 27855, 27859, 27930, 27934, 28009, 28013, 28082, 28086, 28160, 28164, 28235, 28239, 28312, 28316, 28338, 28342, 28343, 28347, 28423, 28427, 28495, 28499, 28574, 28578, 28654, 28658, 28732, 28736, 28809, 28813, 28888, 28892, 28962, 28966, 28995, 28999, 29000, 29004, 29039, 29043, 29045, 29049, 29106, 29110, 29111, 29115, 29185, 29189, 29260, 29264, 29340, 29344, 29345, 29349, 29420, 29424, 29492, 29496, 29565, 29569, 29639, 29643, 29644, 29648, 29724, 29728, 29769, 29773, 29774, 29778, 29851, 29855, 29928, 29932, 30002, 30006, 30046, 30050, 30051, 30055, 30123, 30127, 30194, 30198, 30264, 30268, 30317, 30321, 30322, 30326, 30396, 30400, 30464, 30468, 30530, 30534, 30535, 30539, 30612, 30616, 30617, 30621, 30692, 30696, 30735, 30739, 30740, 30744, 30806, 30810, 30888, 30892, 30958, 30962, 31019, 31023, 31024, 31028, 31104, 31108, 31182, 31186, 31259, 31263, 31320, 31324, 31325, 31329, 31401, 31405, 31474, 31478, 31525, 31529, 31530, 31534, 31607, 31611, 31686, 31690, 31691, 31695, 31734, 31738, 31767, 31771, 31772, 31776, 31852, 31856, 31928, 31932, 32008, 32012, 32082, 32086, 32126, 32158, 32160, 32168, 32170, 32207, 32240, 32242, 32277, 32279, 32282, 32284, 32321, 32323, 32326, 32328, 32400, 32402, 32474, 32476, 32545, 32547, 32586, 32588, 32591, 32594, 32661, 32664, 32730, 32733, 32798, 32801, 32849, 32852, 32855, 32858, 32927, 32930, 32993, 32996, 33057, 33060, 33064, 33067, 33068, 33071, 33072, 33075, 33098, 33101, 33121, 33124, 33143, 33146, 33166, 33169, 33170, 33173, 33194, 33197, 33198, 33201, 33214, 33217, 33232, 33235, 33242, 33245, 33246, 33249, 33265, 33268, 33281, 33284, 33301, 33304, 33310, 33313, 33328, 33331, 33338, 33341, 33342, 33345, 33410, 33413, 33433, 33436, 33470, 33473, 33507, 33510, 33544, 33547, 33581, 33584, 33618, 33621, 33655, 33658, 33692, 33695, 33729, 33732, 33766, 33769, 33803, 33806, 33840, 33843, 33877, 33880, 33914, 33917, 33951, 33954, 33988, 33991, 33992, 33995, 34108, 34111, 34133, 34136, 34137, 34140, 34183, 34186, 34226, 34229, 34230, 34233, 34297, 34300, 34339, 34342, 34343, 34346, 34388, 34391, 34429, 34432, 34459, 34462, 34485, 34488, 34489, 34492, 34498, 34501, 34539, 34542, 34549, 34552, 34553, 34556, 34563, 34566, 34679, 34682, 34683, 34686, 34716, 34719, 34737, 34740, 34777, 34780, 34812, 34815, 34855, 34858, 34891, 34894, 34931, 34934, 34964, 34967, 35006, 35009, 35041, 35044, 35084, 35087, 35120, 35123, 35161, 35164, 35195, 35198, 35236, 35239, 35270, 35273, 35310, 35313, 35343, 35346, 35387, 35390, 35423, 35426, 35468, 35471, 35505, 35509, 35548, 35552, 35583, 35587, 35627, 35631, 35663, 35667, 35706, 35710, 35741, 35745, 35783, 35787, 35817, 35821, 35860, 35864, 35895, 35899, 35905, 35909, 35950, 35954, 35961, 35965, 35966, 35970, 36005, 36009, 36010, 36014, 36060, 36064, 36093, 36097, 36138, 36142, 36170, 36174, 36175, 36179, 36200, 36204, 36205, 36209, 36224, 36228, 36273, 36277, 36297, 36301, 36324, 36328, 36335, 36339, 36366, 36370, 36377, 36381, 36382, 36386, 36389, 36393, 36394, 36398, 36413, 36417, 36445, 36449, 36456, 36460, 36473, 36477, 36501, 36505, 36512, 36516, 36536, 36540, 36596, 36600, 36606, 36610, 36627, 36631, 36638, 36642, 36643, 36647, 36663, 36667, 36668, 36672, 36685, 36689, 36777, 36781, 36790, 36794, 36816, 36820, 36866, 36870, 36928, 36932, 36942, 36946, 36984, 36988, 37026, 37030, 37036, 37040, 37074, 37078, 37082, 37086, 37127, 37131, 37133, 37137, 37144, 37148, 37149, 37153, 37236, 37240, 37241, 37245, 37263, 37267, 37289, 37293, 37311, 37315, 37371, 37375, 37431, 37435, 37461, 37465, 37527, 37531, 37591, 37595, 37655, 37659, 37676, 37680, 37703, 37707, 37732, 37736, 37808, 37812, 37815, 37819, 37820, 37824, 37843, 37847, 37872, 37876, 37900, 37904, 37907, 37911, 37912, 37916, 37937, 37941, 37942, 37946, 37986, 37990, 38023, 38027, 38091, 38095, 38168, 38172, 38245, 38249, 38251, 38255, 38281, 38285, 38311, 38315, 38341, 38345, 38371, 38375, 38401, 38405, 38431, 38435, 38461, 38465, 38491, 38495, 38521, 38525, 38551, 38555, 38581, 38585, 38611, 38615, 38641, 38645, 38671, 38675, 38701, 38705, 38731, 38735, 38737, 38741, 38742, 38746, 38775, 38779, 38780, 38784, 38804, 38808, 38828, 38832, 38851, 38855, 38856, 38860, 38882, 38886, 38906, 38910, 38931, 38935, 38936, 38940, 38941, 38945, 38967, 38971, 38972, 38976, 39015, 39019, 39020, 39024, 39056, 39060, 39122, 39126, 39197, 39201, 39203, 39207, 39255, 39259, 39345, 39349, 39435, 39439, 39525, 39529, 39615, 39619, 39624, 39628, 39629, 39633, 39646, 39650, 39665, 39669, 39687, 39691, 39707, 39711, 39712, 39716, 39730, 39734, 39790, 39794, 39795, 39799, 39840, 39844, 39864, 39868, 39888, 39892, 39912, 39916, 39936, 39940, 39960, 39964, 39984, 39988, 40008, 40012, 40032, 40036, 40037, 40041, 40071, 40075, 40098, 40102, 40127, 40131, 40155, 40159, 40185, 40189, 40237, 40241, 40289, 40293, 40301, 40305, 40311, 40315, 40339, 40343, 40363, 40367, 40393, 40397, 40441, 40445, 40453, 40457, 40463, 40467, 40471, 40475, 40476, 40480, 40500, 40504, 40526, 40530, 40554, 40558, 40590, 40594, 40600, 40604, 40608, 40612, 40613, 40617, 40619, 40623, 40624, 40628, 40647, 40651, 40652, 40656, 40766, 40770, 40791, 40795, 40818, 40822, 40837, 40841, 40866, 40870, 40894, 40898, 40918, 40922, 40962, 40966, 40970, 40974, 41048, 41052, 41068, 41072, 41117, 41121, 41142, 41146, 41168, 41172, 41207, 41211, 41237, 41241, 41277, 41281, 41319, 41323, 41405, 41409, 41487, 41491, 41499, 41503, 41509, 41513, 41517, 41521, 41595, 41599, 41615, 41619, 41640, 41644, 41666, 41670, 41705, 41709, 41735, 41739, 41775, 41779, 41817, 41821, 41901, 41905, 41981, 41985, 41993, 41997, 42003, 42007, 42011, 42015, 42089, 42093, 42109, 42113, 42115, 42119, 42120, 42124, 42234, 42238, 42259, 42263, 42286, 42290, 42305, 42309, 42354, 42358, 42432, 42436, 42452, 42456, 42477, 42481, 42503, 42507, 42542, 42546, 42572, 42576, 42612, 42616, 42654, 42658, 42738, 42742, 42818, 42822, 42830, 42834, 42840, 42844, 42848, 42852, 42926, 42930, 42946, 42950, 42971, 42975, 42997, 43001, 43036, 43040, 43066, 43070, 43106, 43110, 43148, 43152, 43234, 43238, 43316, 43320, 43328, 43332, 43338, 43342, 43346, 43350, 43424, 43428, 43444, 43448, 43472, 43476, 43496, 43500, 43540, 43544, 43548, 43552, 43554, 43558, 43559, 43563, 43590, 43594, 43595, 43599, 43614, 43618, 43652, 43656, 43777, 43781, 43873, 43877, 43962, 43966, 43979, 43983, 43985, 43989, 44043, 44047, 44098, 44102, 44188, 44192, 44278, 44282, 44368, 44372, 44458, 44462, 44548, 44552, 44638, 44642, 44728, 44732, 44818, 44822, 44823, 44827, 44913, 44917, 45003, 45007, 45093, 45097, 45183, 45187, 45273, 45277, 45363, 45367, 45453, 45457, 45543, 45547, 45552, 45556, 45670, 45674, 45783, 45787, 45799, 45803, 45842, 45846, 45847, 45851, 45880, 45884, 45885, 45889, 45908, 45912, 45931, 45935, 45959, 45963, 45986, 45990, 46001, 46005, 46027, 46031, 46078, 46082, 46088, 46092, 46096, 46100, 46106, 46110, 46176, 46180, 46187, 46191, 46265, 46269, 46270, 46274, 46303, 46307, 46329, 46333, 46339, 46343, 46385, 46389, 46423, 46427, 46484, 46488, 46536, 46540, 46624, 46628, 46636, 46640, 46646, 46650, 46651, 46655, 46714, 46718, 46752, 46756, 46787, 46791, 46871, 46875, 46905, 46909, 46951, 46955, 46961, 46965, 46966, 46970, 46993, 46997, 47003, 47007, 47058, 47062, 47113, 47117, 47198, 47202, 47249, 47253, 47284, 47288, 47317, 47321, 47322, 47326, 47346, 47350, 47363, 47367, 47380, 47384, 47397, 47401, 47414, 47418, 47470, 47474, 47527, 47531, 47584, 47588, 47641, 47645, 47698, 47702, 47755, 47759, 47760, 47764, 47794, 47798, 47806, 47810, 47891, 47895, 47901, 47905, 47906, 47910, 47972, 47976, 47977, 47981, 47987, 47991, 48008, 48012, 48042, 48046, 48125, 48129, 48179, 48183, 48251, 48255, 48323, 48327, 48395, 48399, 48405, 48409, 48415, 48419, 48458, 48462, 48557, 48561, 48627, 48631, 48715, 48719, 48803, 48807, 48891, 48895, 48901, 48905, 48912, 48916, 48920, 48924, 48925, 48929, 48948, 48952, 48971, 48975, 48999, 49003, 49023, 49027, 49038, 49042, 49064, 49068, 49115, 49119, 49125, 49129, 49133, 49137, 49143, 49147, 49213, 49217, 49224, 49228, 49230, 49234, 49235, 49239, 49295, 49299, 49300, 49304, 49336, 49340, 49341, 49345, 49381, 49385, 49413, 49417, 49419, 49423, 49424, 49428, 49462, 49466, 49467, 49471, 49509, 49513, 49522, 49526, 49570, 49574, 49625, 49629, 49641, 49645, 49647, 49651, 49652, 49656, 49677, 49681, 49682, 49686, 49714, 49718, 49800, 49804, 49817, 49821, 49881, 49885, 49920, 49924, 49930, 49934, 49949, 49953, 49955, 49959, 49960, 49964, 49998, 50002, 50023, 50027, 50029, 50033, 50034, 50038, 50063, 50067, 50068, 50072, 50146, 50150, 50198, 50202, 50215, 50219, 50230, 50234, 50241, 50245, 50269, 50273, 50303, 50307, 50355, 50359, 50382, 50386, 50411, 50415, 50474, 50478, 50484, 50488, 50492, 50496, 50519, 50523, 50548, 50552, 50611, 50615, 50674, 50678, 50684, 50688, 50692, 50696, 50725, 50729, 50768, 50772, 50793, 50797, 50833, 50837, 50896, 50900, 50906, 50910, 50914, 50918, 50920, 50924, 50925, 50929, 51015, 51019, 51074, 51078, 51132, 51136, 51138, 51142, 51143, 51147, 51212, 51216, 51271, 51275, 51277, 51281, 51282, 51286, 51350, 51354, 51408, 51412, 51414, 51418, 51419, 51423, 51448, 51452, 51453, 51457, 51534, 51538, 51594, 51598, 51652, 51656, 51658, 51662, 51663, 51667, 51683, 51687, 51688, 51692, 51750, 51754, 51788, 51792, 51818, 51822, 51845, 51849, 51880, 51884, 51913, 51917, 51941, 51945, 51970, 51974, 51989, 51993, 52012, 52016, 52032, 52036, 52055, 52059, 52102, 52106, 52138, 52142, 52177, 52181, 52211, 52215, 52251, 52255, 52277, 52281, 52319, 52323, 52346, 52350, 52368, 52372, 52390, 52394, 52411, 52415, 52467, 52471, 52513, 52517, 52574, 52578, 52636, 52640, 52690, 52694, 52751, 52755, 52781, 52785, 52832, 52836, 52898, 52902, 52909, 52913, 52940, 52944, 52945, 52949, 53004, 53008, 53009, 53013, 53058, 53062, 53078, 53082, 53095, 53099, 53113, 53117, 53134, 53138, 53194, 53198, 53211, 53215, 53242, 53246, 53282, 53286, 53300, 53304, 53317, 53321, 53327, 53331, 53350, 53354, 53378, 53382, 53395, 53399, 53405, 53409, 53433, 53437, 53474, 53478, 53499, 53503, 53520, 53524, 53540, 53544, 53550, 53554, 53555, 53559, 53589, 53593, 53616, 53620, 53709, 53713, 53734, 53738, 53826, 53830, 53861, 53865, 53893, 53897, 53912, 53916, 53924, 53928, 53949, 53953, 54044, 54048, 54079, 54083, 54108, 54112, 54127, 54131, 54139, 54143, 54188, 54192, 54238, 54242, 54324, 54328, 54387, 54391, 54445, 54449, 54497, 54501, 54532, 54536, 54564, 54568, 54590, 54594, 54626, 54630, 54677, 54681, 54769, 54773, 54810, 54814, 54851, 54855, 54913, 54917, 54931, 54935, 54952, 54956, 54977, 54981, 55003, 55007, 55025, 55029, 55052, 55056, 55068, 55072, 55102, 55106, 55136, 55140, 55176, 55180, 55206, 55210, 55248, 55252, 55364, 55368, 55389, 55393, 55426, 55430, 55465, 55469, 55479, 55483, 55497, 55501, 55526, 55530, 55607, 55611, 55646, 55650, 55660, 55664, 55672, 55676, 55692, 55696, 55697, 55701, 55722, 55726, 55760, 55764, 55782, 55786, 55792, 55796, 55832, 55836, 55850, 55854, 55868, 55872, 55962, 55966, 55967, 55971, 56013, 56017, 56034, 56038, 56079, 56083, 56103, 56107, 56132, 56136, 56161, 56165, 56185, 56189, 56217, 56221, 56237, 56241, 56247, 56251, 56255, 56259, 56274, 56278, 56279, 56283, 56301, 56305, 56333, 56337, 56358, 56362, 56366, 56370, 56371, 56375, 56414, 56418, 56467, 56471, 56510, 56514, 56540, 56544, 56667, 56671, 56677, 56681, 56725, 56729, 56730, 56734, 56756, 56760, 56780, 56784, 56809, 56813, 56833, 56837, 56839, 56843, 56863, 56867, 56892, 56896, 56916, 56920, 56922, 56926, 56952, 56956, 56987, 56991, 57017, 57021, 57023, 57027, 57043, 57047, 57068, 57072, 57088, 57092, 57094, 57098, 57126, 57130, 57163, 57167, 57193, 57197, 57198, 57202, 57254, 57258, 57267, 57271, 57291, 57295, 57306, 57310, 57339, 57343, 57373, 57377, 57383, 57387, 57435, 57439, 57444, 57448, 57478, 57482, 57515, 57519, 57525, 57529, 57583, 57587, 57592, 57596, 57624, 57628, 57633, 57637, 57696, 57700, 57701, 57705, 57729, 57733, 57734, 57738, 57749, 57753, 57767, 57771, 57831, 57835, 57839, 57843, 57922, 57926, 57965, 57969, 57995, 57999, 58122, 58126, 58132, 58136, 58137, 58141, 58222, 58226, 58254, 58258, 58288, 58292, 58317, 58321, 58342, 58346, 58354, 58358, 58364, 58368, 58372, 58376, 58416, 58420, 58446, 58450, 58573, 58577, 58583, 58587, 58588, 58592, 58665, 58669, 58691, 58695, 58711, 58715, 58719, 58723, 58734, 58738, 58757, 58761, 58789, 58793, 58816, 58820, 58824, 58828, 58843, 58847, 58869, 58873, 58899, 58903, 58907, 58911, 58945, 58949, 58971, 58975, 59028, 59032, 59038, 59042, 59043, 59047, 59063, 59067, 59089, 59093, 59135, 59139, 59143, 59147, 59155, 59159, 59200, 59204, 59208, 59212, 59213, 59217, 59226, 59230, 59264, 59268, 59299, 59303, 59327, 59331, 59383, 59387, 59446, 59450, 59489, 59493, 59544, 59548, 59601, 59605, 59703, 59707, 59713, 59717, 59839, 59843, 59850, 59854, 59855, 59859, 59885, 59889, 59911, 59915, 59987, 59991, 60032, 60036, 60062, 60066, 60096, 60100, 60147, 60151, 60179 ], "line_end_idx": [ 8, 9, 17, 18, 26, 27, 49, 50, 77, 78, 96, 97, 127, 135, 175, 183, 223, 231, 271, 275, 315, 323, 369, 377, 401, 409, 437, 444, 452, 492, 500, 540, 548, 588, 592, 632, 640, 668, 676, 682, 690, 744, 751, 759, 810, 818, 895, 903, 904, 908, 1056, 1060, 1118, 1122, 1154, 1158, 1178, 1182, 1245, 1249, 1309, 1313, 1314, 1322, 1467, 1475, 1545, 1553, 1554, 1561, 1569, 1596, 1604, 1631, 1639, 1666, 1670, 1697, 1705, 1706, 1714, 1782, 1790, 1934, 1941, 1949, 1950, 1958, 1981, 1989, 2042, 2046, 2143, 2147, 2252, 2260, 2291, 2299, 2317, 2325, 2357, 2364, 2372, 2475, 2483, 2534, 2542, 2630, 2634, 2654, 2658, 2724, 2728, 2790, 2794, 2863, 2867, 2868, 2876, 2937, 2945, 2974, 2982, 3072, 3079, 3087, 3088, 3096, 3178, 3186, 3187, 3191, 3240, 3244, 3278, 3282, 3333, 3337, 3352, 3356, 3408, 3412, 3523, 3527, 3581, 3585, 3658, 3662, 3717, 3721, 3799, 3803, 3920, 3924, 3941, 3945, 3999, 4003, 4040, 4044, 4096, 4100, 4101, 4109, 4177, 4185, 4186, 4194, 4270, 4277, 4285, 4324, 4332, 4352, 4360, 4361, 4365, 4379, 4383, 4429, 4433, 4450, 4454, 4455, 4463, 4483, 4507, 4513, 4514, 4520, 4548, 4554, 4555, 4558, 4606, 4609, 4651, 4654, 4725, 4728, 4733, 4736, 4781, 4784, 4790, 4793, 4794, 4800, 4875, 4881, 4952, 4958, 5000, 5007, 5015, 5060, 5068, 5119, 5127, 5176, 5180, 5224, 5228, 5278, 5282, 5333, 5337, 5381, 5385, 5412, 5416, 5440, 5444, 5463, 5467, 5503, 5507, 5537, 5541, 5580, 5584, 5661, 5665, 5671, 5675, 5681, 5685, 5691, 5695, 5701, 5709, 5750, 5758, 5814, 5822, 5872, 5879, 5887, 5913, 5921, 5926, 5934, 6014, 6018, 6100, 6104, 6204, 6212, 6225, 6233, 6317, 6325, 6382, 6406, 6410, 6428, 6432, 6450, 6454, 6455, 6457, 6476, 6480, 6496, 6500, 6524, 6528, 6551, 6576, 6580, 6590, 6594, 6595, 6597, 6815, 6817, 7044, 7048, 7247, 7251, 7439, 7443, 7639, 7646, 7652, 7674, 7680, 7698, 7704, 7727, 7730, 7748, 7754, 7779, 7785, 7808, 7814, 7841, 7848, 7856, 7857, 7865, 7881, 7889, 7915, 7919, 8018, 8022, 8123, 8127, 8235, 8239, 8349, 8357, 8413, 8421, 8476, 8484, 8547, 8555, 8683, 8687, 8746, 8750, 8804, 8808, 8866, 8874, 8876, 8884, 8885, 8893, 8909, 8916, 8924, 9009, 9017, 9095, 9103, 9214, 9218, 9326, 9330, 9439, 9443, 9594, 9598, 9715, 9719, 9837, 9841, 10001, 10009, 10011, 10019, 10020, 10028, 10046, 10053, 10061, 10125, 10133, 10210, 10218, 10296, 10300, 10364, 10372, 10389, 10397, 10398, 10406, 10416, 10445, 10451, 10452, 10458, 10509, 10515, 10516, 10519, 10545, 10548, 10550, 10553, 10571, 10574, 10593, 10596, 10614, 10617, 10628, 10631, 10632, 10638, 10654, 10660, 10686, 10692, 10698, 10705, 10713, 10785, 10793, 10822, 10830, 10834, 10838, 10873, 10877, 10905, 10913, 10915, 10923, 10950, 10958, 10985, 10992, 11000, 11070, 11078, 11091, 11099, 11103, 11107, 11188, 11192, 11266, 11274, 11276, 11284, 11297, 11305, 11306, 11313, 11321, 11384, 11392, 11444, 11452, 11456, 11460, 11537, 11541, 11611, 11619, 11621, 11629, 11646, 11654, 11673, 11702, 11706, 11735, 11739, 11740, 11744, 11839, 11842, 11849, 11855, 11856, 11859, 11941, 11944, 11972, 11975, 11993, 11996, 12015, 12018, 12036, 12039, 12050, 12056, 12057, 12060, 12089, 12092, 12167, 12170, 12241, 12247, 12254, 12257, 12339, 12342, 12349, 12386, 12392, 12443, 12449, 12502, 12508, 12560, 12563, 12612, 12618, 12619, 12625, 12632, 12670, 12672, 12690, 12692, 12693, 12695, 12732, 12734, 12765, 12767, 12768, 12770, 12795, 12797, 12798, 12800, 12865, 12896, 12898, 12931, 12933, 12963, 12965, 12966, 12968, 13025, 13027, 13092, 13094, 13156, 13158, 13217, 13219, 13220, 13222, 13238, 13241, 13242, 13245, 13309, 13312, 13381, 13384, 13455, 13458, 13527, 13530, 13590, 13593, 13664, 13667, 13738, 13741, 13811, 13814, 13834, 13837, 13838, 13841, 13908, 13911, 13982, 13985, 14056, 14059, 14129, 14132, 14201, 14204, 14269, 14272, 14273, 14276, 14343, 14346, 14417, 14420, 14492, 14495, 14551, 14554, 14555, 14558, 14625, 14628, 14698, 14701, 14770, 14773, 14841, 14844, 14852, 14855, 14856, 14859, 14932, 14935, 15004, 15007, 15046, 15049, 15050, 15053, 15124, 15127, 15193, 15196, 15269, 15272, 15344, 15347, 15419, 15422, 15444, 15447, 15448, 15451, 15516, 15519, 15587, 15590, 15661, 15664, 15734, 15737, 15809, 15812, 15813, 15816, 15881, 15884, 15905, 15908, 15910, 15913, 15946, 15949, 16016, 16019, 16020, 16023, 16093, 16096, 16165, 16168, 16239, 16242, 16312, 16315, 16384, 16387, 16453, 16456, 16525, 16528, 16599, 16602, 16666, 16669, 16670, 16673, 16742, 16745, 16810, 16813, 16884, 16887, 16950, 16953, 17019, 17022, 17077, 17080, 17081, 17084, 17150, 17153, 17217, 17220, 17288, 17291, 17356, 17359, 17430, 17433, 17501, 17504, 17528, 17531, 17532, 17535, 17605, 17608, 17680, 17683, 17684, 17687, 17757, 17760, 17822, 17825, 17892, 17895, 17955, 17958, 17959, 17962, 18030, 18033, 18100, 18103, 18104, 18107, 18178, 18181, 18249, 18253, 18323, 18327, 18372, 18376, 18377, 18381, 18450, 18454, 18517, 18521, 18590, 18594, 18659, 18663, 18734, 18738, 18804, 18808, 18878, 18882, 18949, 18953, 19022, 19026, 19085, 19089, 19091, 19095, 19157, 19161, 19230, 19234, 19301, 19305, 19373, 19377, 19444, 19448, 19518, 19522, 19592, 19596, 19662, 19666, 19740, 19744, 19745, 19749, 19819, 19823, 19893, 19897, 19961, 19965, 20004, 20008, 20009, 20013, 20084, 20088, 20158, 20162, 20231, 20235, 20262, 20266, 20267, 20271, 20340, 20344, 20414, 20418, 20489, 20493, 20494, 20498, 20567, 20571, 20642, 20646, 20723, 20727, 20728, 20732, 20799, 20803, 20870, 20874, 20940, 20944, 21010, 21014, 21084, 21088, 21139, 21143, 21144, 21148, 21218, 21222, 21289, 21293, 21357, 21361, 21430, 21434, 21484, 21488, 21489, 21493, 21561, 21565, 21634, 21638, 21707, 21711, 21775, 21779, 21850, 21854, 21918, 21922, 21988, 21992, 22061, 22065, 22134, 22138, 22173, 22177, 22178, 22182, 22247, 22251, 22316, 22320, 22381, 22385, 22452, 22456, 22513, 22517, 22519, 22523, 22592, 22596, 22658, 22662, 22729, 22733, 22804, 22808, 22877, 22881, 22950, 22954, 22989, 22993, 22994, 22998, 23067, 23071, 23140, 23144, 23211, 23215, 23283, 23287, 23351, 23355, 23424, 23428, 23496, 23500, 23534, 23538, 23539, 23543, 23613, 23617, 23683, 23687, 23758, 23762, 23822, 23826, 23897, 23901, 23970, 23974, 23988, 23992, 23993, 23997, 24067, 24071, 24140, 24144, 24212, 24216, 24287, 24291, 24354, 24358, 24429, 24433, 24504, 24508, 24573, 24577, 24648, 24652, 24722, 24726, 24794, 24798, 24849, 24853, 24854, 24858, 24928, 24932, 25003, 25007, 25070, 25074, 25089, 25093, 25094, 25098, 25166, 25170, 25239, 25243, 25308, 25312, 25373, 25377, 25441, 25445, 25510, 25514, 25580, 25584, 25655, 25659, 25729, 25733, 25753, 25757, 25758, 25762, 25832, 25836, 25882, 25886, 25888, 25892, 25960, 25964, 26034, 26038, 26106, 26110, 26177, 26181, 26249, 26253, 26323, 26327, 26385, 26389, 26390, 26394, 26468, 26472, 26545, 26549, 26622, 26626, 26660, 26664, 26665, 26669, 26740, 26744, 26816, 26820, 26894, 26898, 26967, 26971, 27045, 27049, 27126, 27130, 27142, 27146, 27147, 27151, 27221, 27225, 27299, 27303, 27373, 27377, 27450, 27454, 27526, 27530, 27604, 27608, 27666, 27670, 27671, 27675, 27694, 27698, 27699, 27703, 27778, 27782, 27855, 27859, 27930, 27934, 28009, 28013, 28082, 28086, 28160, 28164, 28235, 28239, 28312, 28316, 28338, 28342, 28343, 28347, 28423, 28427, 28495, 28499, 28574, 28578, 28654, 28658, 28732, 28736, 28809, 28813, 28888, 28892, 28962, 28966, 28995, 28999, 29000, 29004, 29039, 29043, 29045, 29049, 29106, 29110, 29111, 29115, 29185, 29189, 29260, 29264, 29340, 29344, 29345, 29349, 29420, 29424, 29492, 29496, 29565, 29569, 29639, 29643, 29644, 29648, 29724, 29728, 29769, 29773, 29774, 29778, 29851, 29855, 29928, 29932, 30002, 30006, 30046, 30050, 30051, 30055, 30123, 30127, 30194, 30198, 30264, 30268, 30317, 30321, 30322, 30326, 30396, 30400, 30464, 30468, 30530, 30534, 30535, 30539, 30612, 30616, 30617, 30621, 30692, 30696, 30735, 30739, 30740, 30744, 30806, 30810, 30888, 30892, 30958, 30962, 31019, 31023, 31024, 31028, 31104, 31108, 31182, 31186, 31259, 31263, 31320, 31324, 31325, 31329, 31401, 31405, 31474, 31478, 31525, 31529, 31530, 31534, 31607, 31611, 31686, 31690, 31691, 31695, 31734, 31738, 31767, 31771, 31772, 31776, 31852, 31856, 31928, 31932, 32008, 32012, 32082, 32086, 32126, 32158, 32160, 32168, 32170, 32207, 32240, 32242, 32277, 32279, 32282, 32284, 32321, 32323, 32326, 32328, 32400, 32402, 32474, 32476, 32545, 32547, 32586, 32588, 32591, 32594, 32661, 32664, 32730, 32733, 32798, 32801, 32849, 32852, 32855, 32858, 32927, 32930, 32993, 32996, 33057, 33060, 33064, 33067, 33068, 33071, 33072, 33075, 33098, 33101, 33121, 33124, 33143, 33146, 33166, 33169, 33170, 33173, 33194, 33197, 33198, 33201, 33214, 33217, 33232, 33235, 33242, 33245, 33246, 33249, 33265, 33268, 33281, 33284, 33301, 33304, 33310, 33313, 33328, 33331, 33338, 33341, 33342, 33345, 33410, 33413, 33433, 33436, 33470, 33473, 33507, 33510, 33544, 33547, 33581, 33584, 33618, 33621, 33655, 33658, 33692, 33695, 33729, 33732, 33766, 33769, 33803, 33806, 33840, 33843, 33877, 33880, 33914, 33917, 33951, 33954, 33988, 33991, 33992, 33995, 34108, 34111, 34133, 34136, 34137, 34140, 34183, 34186, 34226, 34229, 34230, 34233, 34297, 34300, 34339, 34342, 34343, 34346, 34388, 34391, 34429, 34432, 34459, 34462, 34485, 34488, 34489, 34492, 34498, 34501, 34539, 34542, 34549, 34552, 34553, 34556, 34563, 34566, 34679, 34682, 34683, 34686, 34716, 34719, 34737, 34740, 34777, 34780, 34812, 34815, 34855, 34858, 34891, 34894, 34931, 34934, 34964, 34967, 35006, 35009, 35041, 35044, 35084, 35087, 35120, 35123, 35161, 35164, 35195, 35198, 35236, 35239, 35270, 35273, 35310, 35313, 35343, 35346, 35387, 35390, 35423, 35426, 35468, 35471, 35505, 35509, 35548, 35552, 35583, 35587, 35627, 35631, 35663, 35667, 35706, 35710, 35741, 35745, 35783, 35787, 35817, 35821, 35860, 35864, 35895, 35899, 35905, 35909, 35950, 35954, 35961, 35965, 35966, 35970, 36005, 36009, 36010, 36014, 36060, 36064, 36093, 36097, 36138, 36142, 36170, 36174, 36175, 36179, 36200, 36204, 36205, 36209, 36224, 36228, 36273, 36277, 36297, 36301, 36324, 36328, 36335, 36339, 36366, 36370, 36377, 36381, 36382, 36386, 36389, 36393, 36394, 36398, 36413, 36417, 36445, 36449, 36456, 36460, 36473, 36477, 36501, 36505, 36512, 36516, 36536, 36540, 36596, 36600, 36606, 36610, 36627, 36631, 36638, 36642, 36643, 36647, 36663, 36667, 36668, 36672, 36685, 36689, 36777, 36781, 36790, 36794, 36816, 36820, 36866, 36870, 36928, 36932, 36942, 36946, 36984, 36988, 37026, 37030, 37036, 37040, 37074, 37078, 37082, 37086, 37127, 37131, 37133, 37137, 37144, 37148, 37149, 37153, 37236, 37240, 37241, 37245, 37263, 37267, 37289, 37293, 37311, 37315, 37371, 37375, 37431, 37435, 37461, 37465, 37527, 37531, 37591, 37595, 37655, 37659, 37676, 37680, 37703, 37707, 37732, 37736, 37808, 37812, 37815, 37819, 37820, 37824, 37843, 37847, 37872, 37876, 37900, 37904, 37907, 37911, 37912, 37916, 37937, 37941, 37942, 37946, 37986, 37990, 38023, 38027, 38091, 38095, 38168, 38172, 38245, 38249, 38251, 38255, 38281, 38285, 38311, 38315, 38341, 38345, 38371, 38375, 38401, 38405, 38431, 38435, 38461, 38465, 38491, 38495, 38521, 38525, 38551, 38555, 38581, 38585, 38611, 38615, 38641, 38645, 38671, 38675, 38701, 38705, 38731, 38735, 38737, 38741, 38742, 38746, 38775, 38779, 38780, 38784, 38804, 38808, 38828, 38832, 38851, 38855, 38856, 38860, 38882, 38886, 38906, 38910, 38931, 38935, 38936, 38940, 38941, 38945, 38967, 38971, 38972, 38976, 39015, 39019, 39020, 39024, 39056, 39060, 39122, 39126, 39197, 39201, 39203, 39207, 39255, 39259, 39345, 39349, 39435, 39439, 39525, 39529, 39615, 39619, 39624, 39628, 39629, 39633, 39646, 39650, 39665, 39669, 39687, 39691, 39707, 39711, 39712, 39716, 39730, 39734, 39790, 39794, 39795, 39799, 39840, 39844, 39864, 39868, 39888, 39892, 39912, 39916, 39936, 39940, 39960, 39964, 39984, 39988, 40008, 40012, 40032, 40036, 40037, 40041, 40071, 40075, 40098, 40102, 40127, 40131, 40155, 40159, 40185, 40189, 40237, 40241, 40289, 40293, 40301, 40305, 40311, 40315, 40339, 40343, 40363, 40367, 40393, 40397, 40441, 40445, 40453, 40457, 40463, 40467, 40471, 40475, 40476, 40480, 40500, 40504, 40526, 40530, 40554, 40558, 40590, 40594, 40600, 40604, 40608, 40612, 40613, 40617, 40619, 40623, 40624, 40628, 40647, 40651, 40652, 40656, 40766, 40770, 40791, 40795, 40818, 40822, 40837, 40841, 40866, 40870, 40894, 40898, 40918, 40922, 40962, 40966, 40970, 40974, 41048, 41052, 41068, 41072, 41117, 41121, 41142, 41146, 41168, 41172, 41207, 41211, 41237, 41241, 41277, 41281, 41319, 41323, 41405, 41409, 41487, 41491, 41499, 41503, 41509, 41513, 41517, 41521, 41595, 41599, 41615, 41619, 41640, 41644, 41666, 41670, 41705, 41709, 41735, 41739, 41775, 41779, 41817, 41821, 41901, 41905, 41981, 41985, 41993, 41997, 42003, 42007, 42011, 42015, 42089, 42093, 42109, 42113, 42115, 42119, 42120, 42124, 42234, 42238, 42259, 42263, 42286, 42290, 42305, 42309, 42354, 42358, 42432, 42436, 42452, 42456, 42477, 42481, 42503, 42507, 42542, 42546, 42572, 42576, 42612, 42616, 42654, 42658, 42738, 42742, 42818, 42822, 42830, 42834, 42840, 42844, 42848, 42852, 42926, 42930, 42946, 42950, 42971, 42975, 42997, 43001, 43036, 43040, 43066, 43070, 43106, 43110, 43148, 43152, 43234, 43238, 43316, 43320, 43328, 43332, 43338, 43342, 43346, 43350, 43424, 43428, 43444, 43448, 43472, 43476, 43496, 43500, 43540, 43544, 43548, 43552, 43554, 43558, 43559, 43563, 43590, 43594, 43595, 43599, 43614, 43618, 43652, 43656, 43777, 43781, 43873, 43877, 43962, 43966, 43979, 43983, 43985, 43989, 44043, 44047, 44098, 44102, 44188, 44192, 44278, 44282, 44368, 44372, 44458, 44462, 44548, 44552, 44638, 44642, 44728, 44732, 44818, 44822, 44823, 44827, 44913, 44917, 45003, 45007, 45093, 45097, 45183, 45187, 45273, 45277, 45363, 45367, 45453, 45457, 45543, 45547, 45552, 45556, 45670, 45674, 45783, 45787, 45799, 45803, 45842, 45846, 45847, 45851, 45880, 45884, 45885, 45889, 45908, 45912, 45931, 45935, 45959, 45963, 45986, 45990, 46001, 46005, 46027, 46031, 46078, 46082, 46088, 46092, 46096, 46100, 46106, 46110, 46176, 46180, 46187, 46191, 46265, 46269, 46270, 46274, 46303, 46307, 46329, 46333, 46339, 46343, 46385, 46389, 46423, 46427, 46484, 46488, 46536, 46540, 46624, 46628, 46636, 46640, 46646, 46650, 46651, 46655, 46714, 46718, 46752, 46756, 46787, 46791, 46871, 46875, 46905, 46909, 46951, 46955, 46961, 46965, 46966, 46970, 46993, 46997, 47003, 47007, 47058, 47062, 47113, 47117, 47198, 47202, 47249, 47253, 47284, 47288, 47317, 47321, 47322, 47326, 47346, 47350, 47363, 47367, 47380, 47384, 47397, 47401, 47414, 47418, 47470, 47474, 47527, 47531, 47584, 47588, 47641, 47645, 47698, 47702, 47755, 47759, 47760, 47764, 47794, 47798, 47806, 47810, 47891, 47895, 47901, 47905, 47906, 47910, 47972, 47976, 47977, 47981, 47987, 47991, 48008, 48012, 48042, 48046, 48125, 48129, 48179, 48183, 48251, 48255, 48323, 48327, 48395, 48399, 48405, 48409, 48415, 48419, 48458, 48462, 48557, 48561, 48627, 48631, 48715, 48719, 48803, 48807, 48891, 48895, 48901, 48905, 48912, 48916, 48920, 48924, 48925, 48929, 48948, 48952, 48971, 48975, 48999, 49003, 49023, 49027, 49038, 49042, 49064, 49068, 49115, 49119, 49125, 49129, 49133, 49137, 49143, 49147, 49213, 49217, 49224, 49228, 49230, 49234, 49235, 49239, 49295, 49299, 49300, 49304, 49336, 49340, 49341, 49345, 49381, 49385, 49413, 49417, 49419, 49423, 49424, 49428, 49462, 49466, 49467, 49471, 49509, 49513, 49522, 49526, 49570, 49574, 49625, 49629, 49641, 49645, 49647, 49651, 49652, 49656, 49677, 49681, 49682, 49686, 49714, 49718, 49800, 49804, 49817, 49821, 49881, 49885, 49920, 49924, 49930, 49934, 49949, 49953, 49955, 49959, 49960, 49964, 49998, 50002, 50023, 50027, 50029, 50033, 50034, 50038, 50063, 50067, 50068, 50072, 50146, 50150, 50198, 50202, 50215, 50219, 50230, 50234, 50241, 50245, 50269, 50273, 50303, 50307, 50355, 50359, 50382, 50386, 50411, 50415, 50474, 50478, 50484, 50488, 50492, 50496, 50519, 50523, 50548, 50552, 50611, 50615, 50674, 50678, 50684, 50688, 50692, 50696, 50725, 50729, 50768, 50772, 50793, 50797, 50833, 50837, 50896, 50900, 50906, 50910, 50914, 50918, 50920, 50924, 50925, 50929, 51015, 51019, 51074, 51078, 51132, 51136, 51138, 51142, 51143, 51147, 51212, 51216, 51271, 51275, 51277, 51281, 51282, 51286, 51350, 51354, 51408, 51412, 51414, 51418, 51419, 51423, 51448, 51452, 51453, 51457, 51534, 51538, 51594, 51598, 51652, 51656, 51658, 51662, 51663, 51667, 51683, 51687, 51688, 51692, 51750, 51754, 51788, 51792, 51818, 51822, 51845, 51849, 51880, 51884, 51913, 51917, 51941, 51945, 51970, 51974, 51989, 51993, 52012, 52016, 52032, 52036, 52055, 52059, 52102, 52106, 52138, 52142, 52177, 52181, 52211, 52215, 52251, 52255, 52277, 52281, 52319, 52323, 52346, 52350, 52368, 52372, 52390, 52394, 52411, 52415, 52467, 52471, 52513, 52517, 52574, 52578, 52636, 52640, 52690, 52694, 52751, 52755, 52781, 52785, 52832, 52836, 52898, 52902, 52909, 52913, 52940, 52944, 52945, 52949, 53004, 53008, 53009, 53013, 53058, 53062, 53078, 53082, 53095, 53099, 53113, 53117, 53134, 53138, 53194, 53198, 53211, 53215, 53242, 53246, 53282, 53286, 53300, 53304, 53317, 53321, 53327, 53331, 53350, 53354, 53378, 53382, 53395, 53399, 53405, 53409, 53433, 53437, 53474, 53478, 53499, 53503, 53520, 53524, 53540, 53544, 53550, 53554, 53555, 53559, 53589, 53593, 53616, 53620, 53709, 53713, 53734, 53738, 53826, 53830, 53861, 53865, 53893, 53897, 53912, 53916, 53924, 53928, 53949, 53953, 54044, 54048, 54079, 54083, 54108, 54112, 54127, 54131, 54139, 54143, 54188, 54192, 54238, 54242, 54324, 54328, 54387, 54391, 54445, 54449, 54497, 54501, 54532, 54536, 54564, 54568, 54590, 54594, 54626, 54630, 54677, 54681, 54769, 54773, 54810, 54814, 54851, 54855, 54913, 54917, 54931, 54935, 54952, 54956, 54977, 54981, 55003, 55007, 55025, 55029, 55052, 55056, 55068, 55072, 55102, 55106, 55136, 55140, 55176, 55180, 55206, 55210, 55248, 55252, 55364, 55368, 55389, 55393, 55426, 55430, 55465, 55469, 55479, 55483, 55497, 55501, 55526, 55530, 55607, 55611, 55646, 55650, 55660, 55664, 55672, 55676, 55692, 55696, 55697, 55701, 55722, 55726, 55760, 55764, 55782, 55786, 55792, 55796, 55832, 55836, 55850, 55854, 55868, 55872, 55962, 55966, 55967, 55971, 56013, 56017, 56034, 56038, 56079, 56083, 56103, 56107, 56132, 56136, 56161, 56165, 56185, 56189, 56217, 56221, 56237, 56241, 56247, 56251, 56255, 56259, 56274, 56278, 56279, 56283, 56301, 56305, 56333, 56337, 56358, 56362, 56366, 56370, 56371, 56375, 56414, 56418, 56467, 56471, 56510, 56514, 56540, 56544, 56667, 56671, 56677, 56681, 56725, 56729, 56730, 56734, 56756, 56760, 56780, 56784, 56809, 56813, 56833, 56837, 56839, 56843, 56863, 56867, 56892, 56896, 56916, 56920, 56922, 56926, 56952, 56956, 56987, 56991, 57017, 57021, 57023, 57027, 57043, 57047, 57068, 57072, 57088, 57092, 57094, 57098, 57126, 57130, 57163, 57167, 57193, 57197, 57198, 57202, 57254, 57258, 57267, 57271, 57291, 57295, 57306, 57310, 57339, 57343, 57373, 57377, 57383, 57387, 57435, 57439, 57444, 57448, 57478, 57482, 57515, 57519, 57525, 57529, 57583, 57587, 57592, 57596, 57624, 57628, 57633, 57637, 57696, 57700, 57701, 57705, 57729, 57733, 57734, 57738, 57749, 57753, 57767, 57771, 57831, 57835, 57839, 57843, 57922, 57926, 57965, 57969, 57995, 57999, 58122, 58126, 58132, 58136, 58137, 58141, 58222, 58226, 58254, 58258, 58288, 58292, 58317, 58321, 58342, 58346, 58354, 58358, 58364, 58368, 58372, 58376, 58416, 58420, 58446, 58450, 58573, 58577, 58583, 58587, 58588, 58592, 58665, 58669, 58691, 58695, 58711, 58715, 58719, 58723, 58734, 58738, 58757, 58761, 58789, 58793, 58816, 58820, 58824, 58828, 58843, 58847, 58869, 58873, 58899, 58903, 58907, 58911, 58945, 58949, 58971, 58975, 59028, 59032, 59038, 59042, 59043, 59047, 59063, 59067, 59089, 59093, 59135, 59139, 59143, 59147, 59155, 59159, 59200, 59204, 59208, 59212, 59213, 59217, 59226, 59230, 59264, 59268, 59299, 59303, 59327, 59331, 59383, 59387, 59446, 59450, 59489, 59493, 59544, 59548, 59601, 59605, 59703, 59707, 59713, 59717, 59839, 59843, 59850, 59854, 59855, 59859, 59885, 59889, 59911, 59915, 59987, 59991, 60032, 60036, 60062, 60066, 60096, 60100, 60147, 60151, 60179, 60265 ] }

{ "red_pajama_v2": { "ccnet_original_length": 60265, "ccnet_original_nlines": 2899, "rps_doc_curly_bracket": 0.004994609858840704, "rps_doc_ldnoobw_words": 2, "rps_doc_lorem_ipsum": 0, "rps_doc_stop_word_fraction": 0.18955901265144348, "rps_doc_ut1_blacklist": 0, "rps_doc_frac_all_caps_words": 0.07072208821773529, "rps_doc_frac_lines_end_with_ellipsis": 0.00586206978186965, "rps_doc_frac_no_alph_words": 0.46679556369781494, "rps_doc_frac_unique_words": 0.3564629554748535, "rps_doc_mean_word_length": 5.761898040771484, "rps_doc_num_sentences": 242, "rps_doc_symbol_to_word_ratio": 0.015319399535655975, "rps_doc_unigram_entropy": 6.99612283706665, "rps_doc_word_count": 7249, "rps_doc_frac_chars_dupe_10grams": 0.030501820147037506, "rps_doc_frac_chars_dupe_5grams": 0.10074698179960251, "rps_doc_frac_chars_dupe_6grams": 0.0796542763710022, "rps_doc_frac_chars_dupe_7grams": 0.059878379106521606, "rps_doc_frac_chars_dupe_8grams": 0.045824550092220306, "rps_doc_frac_chars_dupe_9grams": 0.037780120968818665, "rps_doc_frac_chars_top_2gram": 0.011970889754593372, "rps_doc_frac_chars_top_3gram": 0.006703699938952923, "rps_doc_frac_chars_top_4gram": 0.004405289888381958, "rps_doc_books_importance": -5681.3173828125, "rps_doc_books_importance_length_correction": -5681.3173828125, "rps_doc_openwebtext_importance": -3571.466064453125, "rps_doc_openwebtext_importance_length_correction": -3571.466064453125, "rps_doc_wikipedia_importance": -2895.502197265625, "rps_doc_wikipedia_importance_length_correction": -2895.502197265625 }, "fasttext": { "dclm": 0.052745819091796875, "english": 0.5381042957305908, "fineweb_edu_approx": 1.5420218706130981, "eai_general_math": 0.34214168787002563, "eai_open_web_math": 0.15593910217285156, "eai_web_code": 0.6112354397773743 } }

{ "free_decimal_correspondence": { "primary": { "code": "005.1", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computer programming" } }, "secondary": { "code": "004.02", "labels": { "level_1": "General works, books and libraries, information sciences", "level_2": "", "level_3": "Computers and Computer science" } } }, "bloom_cognitive_process": { "primary": { "code": "3", "label": "Apply" }, "secondary": { "code": "4", "label": "Analyze" } }, "bloom_knowledge_domain": { "primary": { "code": "3", "label": "Procedural" }, "secondary": { "code": "2", "label": "Conceptual" } }, "document_type_v1": { "primary": { "code": "4", "label": "Code/Software" }, "secondary": { "code": "3", "label": "Reference/Encyclopedic/Educational" } }, "extraction_artifacts": { "primary": { "code": "0", "label": "No Artifacts" }, "secondary": { "code": "3", "label": "Irrelevant Content" } }, "missing_content": { "primary": { "code": "1", "label": "Truncated Snippets" }, "secondary": { "code": "-1", "label": "Abstain" } }, "document_type_v2": { "primary": { "code": "8", "label": "Documentation" }, "secondary": { "code": "22", "label": "Truncated" } }, "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