id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
844,943,689,266,146,000 |
cancel
Showing results for
Search instead for
Did you mean:
CCV Problem
I have implemented an AIM solution for my client in php requiring CCV. The solution is based on sample code and works perfectly in the sandbox, which returns the expected responses to the sample CVV numbers provided by authorize.net.
However, on the live site, my client is experiencing a large percentage of DECLINES, which cite error code 2 -65. I can see nothing in the code to account for this.
Any ideas would be appreciated.
dwhill
Member
5 REPLIES 5
Sound like they are rejecting based on some of the response.
Need to know the CCV response code to see why it is rejected.
39
Card Code Response
Value: The card code verification (CCV) response code
Format:
M = Match
N = No Match
P = Not Processed
S = Should have been present
U = Issuer unable to process request
Notes: Indicates the result of the CCV filter.
For more information about CCV, see the Merchant Integration Guide at http://www.authorize.net/support/merchant/.
RaynorC1emen7
Expert
They're getting "No Match".
However, when they enter the card information through the Merchant Terminal, they always are accepted.
Check your code to see if it get pass correctly.
On test account, it always 'P' not processed, unless you are doing one of the triggering specific transaction response (900 for match, etc)
http://community.developer.authorize.net/t5/Integration-and-Testing/Triggering-Specific-Transaction-...
First, thanks for taking time with this.
I pass the sample CCV numbers correctly in the Sandbox, which returns the expected responses (Match for 900, No Match for 901, etc.).
However, on the live site, we're getting a lot of DECLINES due to CCV mismatch. Each of these is accepted when input through the Merchant console. There doesn't seem to be any pattern to the declines, either. Occurs for multiple card types.
so, if it work is merchant account and not working thru AIM, then somewhere in the code is not passing the value correctly. Can you run test on the test account to see if it pass the value correctly?
|
{
"url": "https://community.developer.cybersource.com/t5/Integration-and-Testing/CCV-Problem/td-p/32884",
"source_domain": "community.developer.cybersource.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "510963",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LT34YW7HHNDCGZHZIYRSEKEUVMRE6CHI",
"WARC-Concurrent-To": "<urn:uuid:245ca0d1-b5bf-40ac-a28b-50bda8bac1b6>",
"WARC-Date": "2024-09-21T00:29:41Z",
"WARC-IP-Address": "52.85.151.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A4FPIIXWIFAZC3BINM7JINVXGC5JZBMY",
"WARC-Record-ID": "<urn:uuid:04286607-e4da-49ab-86b3-ac80d2a7c540>",
"WARC-Target-URI": "https://community.developer.cybersource.com/t5/Integration-and-Testing/CCV-Problem/td-p/32884",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:58189d3d-5f98-4be4-85e8-ce9396ba5037>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-225\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,
28,
48,
63,
64,
76,
77,
311,
312,
314,
315,
480,
481,
483,
484,
516,
517,
524,
531,
543,
544,
605,
606,
668,
669,
672,
691,
745,
753,
763,
776,
794,
823,
860,
907,
1021,
1035,
1042,
1043,
1071,
1072,
1074,
1075,
1178,
1179,
1229,
1230,
1232,
1233,
1373,
1374,
1478,
1479,
1520,
1521,
1523,
1524,
1658,
1659,
1661,
1662,
1903,
1904
],
"line_end_idx": [
7,
28,
48,
63,
64,
76,
77,
311,
312,
314,
315,
480,
481,
483,
484,
516,
517,
524,
531,
543,
544,
605,
606,
668,
669,
672,
691,
745,
753,
763,
776,
794,
823,
860,
907,
1021,
1035,
1042,
1043,
1071,
1072,
1074,
1075,
1178,
1179,
1229,
1230,
1232,
1233,
1373,
1374,
1478,
1479,
1520,
1521,
1523,
1524,
1658,
1659,
1661,
1662,
1903,
1904,
2103
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2103,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34953704476356506,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053240738809108734,
"rps_doc_frac_lines_end_with_ellipsis": 0.015625,
"rps_doc_frac_no_alph_words": 0.19907407462596893,
"rps_doc_frac_unique_words": 0.5089820623397827,
"rps_doc_mean_word_length": 4.90119743347168,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.0023148099426180124,
"rps_doc_unigram_entropy": 4.762381076812744,
"rps_doc_word_count": 334,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07819180935621262,
"rps_doc_frac_chars_dupe_6grams": 0.053756870329380035,
"rps_doc_frac_chars_dupe_7grams": 0.053756870329380035,
"rps_doc_frac_chars_dupe_8grams": 0.053756870329380035,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012217470444738865,
"rps_doc_frac_chars_top_3gram": 0.0146609703078866,
"rps_doc_frac_chars_top_4gram": 0.020769700407981873,
"rps_doc_books_importance": -200.99050903320312,
"rps_doc_books_importance_length_correction": -200.99050903320312,
"rps_doc_openwebtext_importance": -110.48046875,
"rps_doc_openwebtext_importance_length_correction": -110.48046875,
"rps_doc_wikipedia_importance": -101.23690032958984,
"rps_doc_wikipedia_importance_length_correction": -101.23690032958984
},
"fasttext": {
"dclm": 0.04767506942152977,
"english": 0.8944535851478577,
"fineweb_edu_approx": 1.6543829441070557,
"eai_general_math": 0.187333881855011,
"eai_open_web_math": 0.22140449285507202,
"eai_web_code": 0.04046136140823364
}
}
|
{
"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": "652.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Business communication, Typewriting, Copying processes, and Word processing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,376,815,223,682,766,000 |
HTML Tags – Bi-Directional Override Tag
What is HTML <bdo> tag ?
HTML <bdo> tag stands for Bi-Directional Override.
HTML <bdo> tag specifies text direction to a display.
This specifies the text direction or used to change the current direction.
Why HTML <bdo> tag is used ?
HTML <bdo> tag is useful for displaying Arabic, and other languages that are written from right to left.
HTML beginners tutorial !!!
Click to Learn More about – HTML Tutorial for beginners
Syntax :
<bdo dir="rtl/ltl"> Some text</bdo>
Example :
<!DOCTYPE html>
<html>
<head>
<title>HTML bdo tag</title>
</head>
<body>
<p><b>displaying text from right to left</b></p>
<bdo dir="rtl">This text is written from right to left.</bdo>
<br />
<p><b>displaying text from left to right</b></p>
<bdo dir="ltr">This text is written from left to right.</bdo>
</body>
</html>
Output :
<bdo> Tag Attributes
HTML <bdo> tag support following specific attributes.
SnoAttributesValueDescription
1dirrtl
ltr
Define direction of right to left.
Define direction of left to right.
Global Attributes
HTML <bdo> tag also support global attributes.
SnoAttributesValueDescription
1idunique_nameDeclared unique id for an element.
2classclass_nameDeclared one or more classnames for an element.
3stylestylesCSS inline styles specify an element.
4titletitleSpecify extra details of element contain, this will display as a “tooltip” for an elements.
Event Attributes
HTML <bdo> tag support following Event attributes.
SnoAttributesValueDescription
1onfocusscriptelement gets focus on object when script tobe run.
2onblurscriptelement lose the focus on object when scrip tobe run.
3onabortscriptelement gets aborted on object when script tobe run.
4onchangescriptelement gets anytime change on object when script tobe run.
5onbeforeunloadscriptelement gets unloaded on object when scrip tobe run.
6onclickscriptclicked on object when script tobe run.
7ondblclickscriptdouble click on object when script tobe run.
8onkeydownscriptkey is pressed when script tobe run.
9onkeypressscriptkey is pressed over element then released when script tobe run.
10onkeyupscriptkey is released over element when script tobe run.
11onmousedownscriptmouse button was pressed over an element when script tobe run.
12onmouseoutscriptmouse pointer release over an element when script tobe run.
13onmousemovescriptrun mouse pointer moved when script tobe run.
14onmouseoverscriptrun mouse pointer move over when script tobe run.
15onmouseupscriptmouse button is released when script tobe run.
16onresetscriptform has been reset when script tobe run.
17onselectscriptSelect some content when script tobe run.
18onsubmitscriptform has been submitted when script tobe run.
19onloadscriptobject has load when script tobe run.
20onchangescriptallow to change the object when script tobe run.
21onunloadscriptunload to the browser window when script tobe run.
22ondragscriptelement being dragged when script tobe run.
23ondragendscriptelement being stop dragged when script tobe run.
24ondragenterscriptelement being go target dragged when script tobe run.
25ondragleavescriptelement being leave to target dragged when script tobe run.
26ondragoverscriptelement being over to target dragged when script tobe run.
27ondragstartscriptelement being start dragged when script tobe run.
28ondropscriptelement being dropped when script tobe run.
29onerrorscriptelement error occurs when script tobe run.
30onmessagescriptelement message display when script tobe run.
31onerrorscriptelement error occurs when script tobe run.
32onmousewheelscriptmouse wheel will be rotate when script tobe run.
33onscrollscriptscrollbar is scroll when script tobe run.
34onresizescriptelement should be resize when script tobe run.
35onselectscriptall element content selected when script tobe run.
36onstoragescriptelement should be store in target when script tobe run.
Browser Compatibility
SnoBrowserSupport
1ChromeYes
2FirefoxYes
3EdgeYes
4OperaYes
5SafariYes
6Internet ExplorerYes
|
{
"url": "https://cstechbook.com/2020/12/31/html-tags-16-bi-directional-override-tag/",
"source_domain": "cstechbook.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "207263",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZUS2SQLD7IWI7DO6YBTG2PKB2CZUVAYW",
"WARC-Concurrent-To": "<urn:uuid:3d18f0e4-faf4-4fb0-a4a7-3473535d6ee1>",
"WARC-Date": "2024-04-17T01:47:20Z",
"WARC-IP-Address": "160.153.0.146",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KDNXARLOSAG6SCHX7HZZAYGVOSNGS3QG",
"WARC-Record-ID": "<urn:uuid:c4e09d3b-3f5d-4b8a-8d8f-31d475eb9fc7>",
"WARC-Target-URI": "https://cstechbook.com/2020/12/31/html-tags-16-bi-directional-override-tag/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:101d59b6-a980-4a35-89ca-3687af3747b3>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\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,
40,
41,
42,
67,
68,
119,
120,
174,
175,
250,
251,
252,
281,
282,
387,
388,
416,
417,
473,
474,
483,
484,
520,
521,
531,
532,
548,
555,
562,
592,
600,
607,
658,
722,
731,
782,
846,
854,
862,
863,
872,
873,
894,
895,
949,
950,
980,
988,
992,
1027,
1062,
1063,
1081,
1082,
1129,
1130,
1160,
1209,
1273,
1323,
1426,
1427,
1444,
1445,
1496,
1497,
1527,
1592,
1659,
1726,
1801,
1875,
1929,
1991,
2044,
2125,
2191,
2273,
2351,
2416,
2485,
2549,
2606,
2664,
2726,
2778,
2843,
2910,
2968,
3034,
3107,
3186,
3263,
3332,
3390,
3448,
3511,
3569,
3638,
3696,
3759,
3826,
3899,
3900,
3922,
3923,
3941,
3952,
3964,
3973,
3983,
3994
],
"line_end_idx": [
40,
41,
42,
67,
68,
119,
120,
174,
175,
250,
251,
252,
281,
282,
387,
388,
416,
417,
473,
474,
483,
484,
520,
521,
531,
532,
548,
555,
562,
592,
600,
607,
658,
722,
731,
782,
846,
854,
862,
863,
872,
873,
894,
895,
949,
950,
980,
988,
992,
1027,
1062,
1063,
1081,
1082,
1129,
1130,
1160,
1209,
1273,
1323,
1426,
1427,
1444,
1445,
1496,
1497,
1527,
1592,
1659,
1726,
1801,
1875,
1929,
1991,
2044,
2125,
2191,
2273,
2351,
2416,
2485,
2549,
2606,
2664,
2726,
2778,
2843,
2910,
2968,
3034,
3107,
3186,
3263,
3332,
3390,
3448,
3511,
3569,
3638,
3696,
3759,
3826,
3899,
3900,
3922,
3923,
3941,
3952,
3964,
3973,
3983,
3994,
4015
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4015,
"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.242514967918396,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01946108043193817,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.193113774061203,
"rps_doc_frac_unique_words": 0.36538460850715637,
"rps_doc_mean_word_length": 6.340384483337402,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.486678600311279,
"rps_doc_word_count": 520,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1892629712820053,
"rps_doc_frac_chars_dupe_6grams": 0.13800424337387085,
"rps_doc_frac_chars_dupe_7grams": 0.037609949707984924,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.07643312215805054,
"rps_doc_frac_chars_top_3gram": 0.14437367022037506,
"rps_doc_frac_chars_top_4gram": 0.1753108948469162,
"rps_doc_books_importance": -294.89434814453125,
"rps_doc_books_importance_length_correction": -294.89434814453125,
"rps_doc_openwebtext_importance": -125.25164031982422,
"rps_doc_openwebtext_importance_length_correction": -125.25164031982422,
"rps_doc_wikipedia_importance": -149.2595977783203,
"rps_doc_wikipedia_importance_length_correction": -149.2595977783203
},
"fasttext": {
"dclm": 0.331298828125,
"english": 0.6056262850761414,
"fineweb_edu_approx": 3.1759185791015625,
"eai_general_math": 0.18845665454864502,
"eai_open_web_math": 0.09853147715330124,
"eai_web_code": 0.4999542832374573
}
}
|
{
"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": "-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": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,468,545,999,948,855,300 |
Though Proxy.sh meets many of our basic requirements, in our tests the company’s Safejumper application had constant errors when trying to connect. Given that we were looking for a simple, reliable VPN, this was a dealbreaker. We also found a story from 2013 with bizarre statements from the company about monitoring traffic on a specific server due to concerns about unlawful behavior of a user on the network. Though the transparency is impressive, the decision to actively monitor traffic is disconcerting. In a response given to TorrentFreak at the time, the company stated, “The situation also shows that the only solution we have to help law enforcement agencies find problematic use across our network, is to clearly install a logging capacity on it. As a result, we are able to either comply or shut down the servers we have in a particular location (it happened to us in Czech Republic few months ago).”
When using the OpenVPN protocol, many VPN apps will give you the option of using either the TCP or UDP protocol. TCP is the protocol that you normally use to browse the web and download files. UDP is more common for streaming applications such as video, music, and gaming. The difference is in how computers and servers send network packets, the unit of data used to exchange information over the internet.
Opera VPN works only through the Opera web browser, and it shouldn't be used for sensitive communications. Once very fast, Opera's VPN connections were painfully slow in our most recent tests. The Opera VPN mobile apps, which were full-fledged VPN services that performed decently in our 2017 tests, unfortunately closed up shop at the end of April 2018.
The IVPN app's default settings are great for most people, who should be happy just smashing the Connect button and not fiddling with settings. On a desktop or an Android device, the company supports only the OpenVPN protocol we recommend and uses AES 256-bit encryption (what we consider the standard at this point). Our budget pick, TorGuard, defaults to the weaker (but also acceptable) AES 128-bit encryption unless you manually change it.
Regardless of what country you are from, encryption remains the best route to online safety. A private VPN is the surest tool to provide that secure encryption. TorGuard provides quality privacy services in over 50 countries world wide. Our VPN service will help you keep your search habits and personal information secret, protect your IP address so websites can’t associate them with your browsing habits, hide your activity on public Wi-Fi hotspots to keep crooks out, bypass censorship to access blocked websites, keep you anonymous on Bittorrent and safeguard your right to online privacy. If you want to keep unscrupulous companies and people from seeing and intercepting your online activity and sensitive personal information, you need private VPN encryption.
Transport Layer Security (SSL/TLS) can tunnel an entire network's traffic (as it does in the OpenVPN project and SoftEther VPN project[8]) or secure an individual connection. A number of vendors provide remote-access VPN capabilities through SSL. An SSL VPN can connect from locations where IPsec runs into trouble with Network Address Translation and firewall rules.
Consider a public Wi-Fi network, perhaps at a coffee shop or airport. Usually, you would connect without a second thought, but do you know who might be keeping tabs on the network traffic? Can you even be confident the hotspot is legitimate, or might it be operated by a criminal who's hunting for your personal data? Think about the passwords, banking details, credit card numbers, and just any private information that you send every time you go online.
VPN use, for example, allows an IBM employee to work from home in a Chicago suburb while accessing the company intranet located in a building in New York City, as if he was right there on the New York office’s network. The same technology can be used by consumers to bridge their phones and laptops to their home network so, while on the road, they can securely access files from their home computers.
The service uses Advanced Encryption Standard with a 256-bit key, a common method employed by VPN services. Connections are protected using 2048-bit public key encryption. For privacy, the service offers a malware detection software. What is good about the software is that it can be downloaded and used without providing any personal information. This holds as long as you use the free version of the software and never contact customer support.
Subscription VPN Providers usually take your privacy a bit more seriously, since you’re paying for the service. It’s unusual for them to show ads, although whether they do logging or store data about your usage varies from company to company. They usually offer free trials so you can give the service a shot first, but remember: just because you’re paying for a service doesn’t mean you shouldn’t do your homework.
They left a vunerability up for 3 years. Never bothered to do anything about it and never bothered to see if anyone took advantage of the vulnerability.So either they're flat out lying and knew they were being hacked and couldn't do anything about it or it's actually a back door they put there purposely. Can someone explain Googles behavior makes any sense?
Subscription VPN Providers usually take your privacy a bit more seriously, since you’re paying for the service. It’s unusual for them to show ads, although whether they do logging or store data about your usage varies from company to company. They usually offer free trials so you can give the service a shot first, but remember: just because you’re paying for a service doesn’t mean you shouldn’t do your homework.
VPN services can also be defined as connections between specific computers, typically servers in separate data centers, when security requirements for their exchanges exceed what the enterprise network can deliver. Increasingly, enterprises also use VPN connections in either remote access mode or site-to-site mode to connect -- or connect to -- resources in a public infrastructure-as-a-service environment.
These services offer many ways to connect, including without the service's client software; support operating systems and devices, such as routers or set-top boxes, beyond just the "big four" operating systems (Windows, Mac, Android and iOS); have hundreds, or even thousands, of servers in dozens of countries; and generally let the user sign up and pay anonymously.
VyprVPN offers the fastest VPN download for Windows, Mac, Android, iOS, TV and Router, enabling you to secure your desktop and mobile devices in seconds while receiving the fastest connection speeds around. Download the fastest VPN service with apps that are secure, easy-to-use and reliable. VyprVPN also includes time-saving features like one-click connect, one-tap server selection and a ping test to choose the fastest server.
The best VPN services offer a robust balance of functions, server location, connectivity protocols, and price. Some are great for occasional use, others are geared towards surrounding location constraints that companies place on their apps and services, and others are focused on people who download a lot of content and want some privacy while they do.
In an overcrowded VPN market, ExpressVPN continues to stand out from the rest and remains the top recommendation at Restore Privacy. It is based in the British Virgin Islands and offers secure, user-friendly apps for all devices. Extensive testing for the ExpressVPN review found it to be very secure, with exceptional speeds and reliability throughout the server network.
StrongVPN has exit nodes in 43 cities, 20 countries, and supports PPTP, L2TP, SSTP, IPSec, and OpenVPN protocols–you’ll be hard pressed to find a device you can’t configure to use their service. There are no bandwidth caps, speed limits, or restrictions on protocols or services (torrenting, Netflix, you name it, they don’t care). Additionally, StrongVPN maintains no server logs.
CyberGhost is transparent about its company structure, posting photos and bios on its website of everyone from the CEO to the cleaning lady, and privacy fanatics will like that the company is based in Romania rather than the U.S. But CyberGhost's full-service subscription price is among the most expensive, unless you pay for two or three years up front.
Remote-access VPNs come in two forms. One is a network access server (NAS), which is a dedicated server, or an application running on a shared server. In this case, users need to connect to the NAS over the Internet to access the VPN. Users key in their credentials to access the VPN, which is validated by the NAS either by using a separate authentication server or its own authentication process.
Servers – IVPN offers 51 servers located in 23 countries. IVPN offers a multi-hop feature for in all of these servers, which basically scatters the traffic of users by moving it through different servers before finally reaching its true destination. This serves to enhance the security and helps protect the identity of the user. It is this feature that sets the VPN’s network apart from its competitors, something I found really good during IVPN review.
Logging: When you connect to a VPN, you’re trusting the VPN service provider with your data. Your communications may be secure from eavesdropping, but other systems on the same VPN—especially the operator—can log your data if they choose. If this bothers you (e.g., you’re the privacy/security advocate or the downloader), make absolutely sure you know your provider’s logging policies before signing up. This applies to location as well—if your company doesn’t keep logs, it may not matter as much where it’s located. (There’s a popular rumor that US-based VPN providers are required to log, in case the government wants them. This isn’t true, but the government can always request whatever data they have if they do log.) For a good list of VPN providers that don’t log your activities when connected (and many that do), check out this TorrentFreak article.
Beyond those two factors, it’s difficult to make blanket statements about what makes a trustworthy VPN. At the bare minimum, a good VPN provider should not collect and keep any logs of its customers’ browsing history. If it does, that puts your privacy at risk should someone access (or even release) those logs without authorization. But deciding when to a trust a logging policy isn’t easy. As the EFF points out, “Some VPNs with exemplary privacy policies could be run by devious people.” You don’t need to have done anything illegal to prefer that law enforcement and criminals alike not have access to a browsing history that may include your bank, medical websites, or that one thing you looked at around 2 a.m. that one time.
Tunnel endpoints must be authenticated before secure VPN tunnels can be established. User-created remote-access VPNs may use passwords, biometrics, two-factor authentication or other cryptographic methods. Network-to-network tunnels often use passwords or digital certificates. They permanently store the key to allow the tunnel to establish automatically, without intervention from the administrator.
We have tested each of these services in as repeatable a manner as possible, but it's worth remembering that networks can be fickle. To get the clearest picture of a VPN's performance, we would have to perform these tests many more times, at different locations and different times of day. We think of these tests as more of a snapshot of performance that establishes a replicable metric for measuring each service. Your mileage with these services will almost certainly vary somewhat from mine.
VPNs secure your traffic and route it through an intermediary server so it can’t be traced. But if privacy is not of chief concern to you, then there are other alternative proxy methods that offer faster speed. A SOCKS proxy, for example, does pretty much the same thing as a VPN without the encryption. Without having to encrypt and decrypt traffic, SOCKS proxy users can get faster speeds and still mask their IP address.
A Mozilla executive says Google’s redesign has made YouTube slower on Firefox and Edge. Chris Peterson, the software community’s technical program manager, tweeted on Tuesday that the video sharing site loads at a fifth of the speed on non-Chrome browsers due to its architecture, as first reported by Sofpedia. “YouTube’s Polymer redesign relies on the deprecated Shadow DOM v0 API only implemented in Chrome,” he wrote. “YouTube serves a Shadow DOM polyfill to Firefox and Edge that is, unsurprisingly, slower than Chrome’s native implementation.
In many cases, each of these offices also have LANs. But how do the LANs connect? For some very specialized solutions, companies lease private lines to connect the offices. That can be very expensive. Instead, most companies opt to geographically connect separated private LANs over the public internet. To protect their data, they set up VPNs between offices, encrypting the data as it traverses the public internet.
Using a VPN tends to slow down internet connections simply because doing so adds more steps to the process of transferring data over the web. Every time you click a link in your browser, it sends a request through your local network, out onto the public internet, and to a web server that responds with the requested information. With a VPN, the path is a little more circuitous, and that's why so many of you don't use a VPN.
BILLED {{orderCtrl.currencySymbolSpaced}}{{orderCtrl.getIntervalPrice('middle', 'middle', true)}} FIRST {{getInterval('middle')}} MONTHS, THEN {{orderCtrl.currencySymbolSpaced}}{{orderCtrl.getIntervalPrice('middle', 'middle', true)*2}} EVERY {{getInterval('middle')}} MONTHS
Two networks can be connected over an intranet using a site-to-site VPN connection. This type of VPN connection might be necessary, for example, for two departments in separate locations, whose data is highly sensitive, to communicate with each other. For instance, the finance department might need to communicate with the human resources department to exchange payroll information.
IPVanish is one of the few providers that owns and operates its own network of servers, rather than rents servers out from third parties. This guarantees customers a sturdy, uncongested connection and better privacy. The IPVanish apps include an auto-select feature that connects you to the fastest available server in a given country or city. You can monitor upload and download speed in real time. Traffic is protected by 256-bit AES encryption, and a zero logs policy ensures that no usage data is ever recorded. A single subscription allows users to connect up to five devices at once. IPVanish is particularly popular with Kodi users due to its fast speeds, great privacy features and because it is easy to install on most devices popular with Kodi users including the Amazon Fire Stick.
Without a VPN, your connection is fully open. Your ISP, employer, the Wi-Fi router in the coffee shop mentioned above, any server along the way, or a person with the right tools can look at your data, log it and use it in ways you can’t control. Government agencies can monitor your online activity and share the retained metadata with each other, including across country borders through intelligence alliances such as “14 Eyes.” Based on your IP address, which depends on your geographic location, third-party sites and services may charge different prices or display intrusive targeted advertising.
If you don’t mind doing a little extra tinkering in a more complicated app to save some money, we recommend TorGuard because it’s trustworthy, secure, and fast. TorGuard is well-regarded in trust and transparency; it was also the fastest service we tried despite being less expensive than much of the competition, and its server network spans more than 50 locations, more than twice as many as our top pick. But TorGuard’s apps aren’t as easy to use as IVPN’s: TorGuard includes settings and labels that allow extra flexibility but clutter the experience for anyone new to VPNs. And unlike IVPN, TorGuard doesn’t natively support OpenVPN connections on iOS, making it a significantly worse choice on Apple devices than it is if you use Windows, ChromeOS, or Android.
Nevertheless, the point of a VPN is to remain private and to have your internet activity kept as private as possible. For that reason, we’re choosing Mullvad as the best overall VPN (see our full review of Mullvad). The interface needs a lot of work, but the company does a great job at privacy. Mullvad doesn’t ask for your email address, and you can mail your payment in cash if you want to. Like many other VPNs, Mullvad has a no-logging policy and doesn’t even collect any identifying metadata from your usage.
CyberGhost has been around since 2011 and has come out strongly as a supporter of "civil rights, a free society, and an uncensored Internet culture." We really liked how the company specifically showcases, on their Web site, how folks normally prevented from accessing such important services as Facebook and YouTube can bring those services into their lives via a VPN.
Hotspot Shield depends on a custom VPN protocol that's not been publicly analyzed by independent experts. We don't know how private or secure it really is. The company has been accused of spying on users (it denies the allegations), and complaints abound online about Hotspot Shield software installing on PCs without users' permission. All this, and the company's U.S. location, may scare away customers who want to protect their privacy.
So our advice is to not use a free VPN unless it really is for occasional, very casual use. For the odd IP-hopping use case, they can work. But if you're planning on using the VPN a lot and for streaming video etc we'd highly recommend going for one of the overall best VPN services - they're not free but they're also pretty cheap in the grand scheme of things.
All that being said, some VPNs are still all around faster than others. Below we’ve listed our top five fastest VPNs tested in the last year, out of a total of nearly two dozen premium providers. Speed tests we run factor largely into this list, but other non-quantifiable parameters based on our personal experience are also taken into consideration. These include how well they stream HD video and game online.
Most VPNs won’t keep any logs of user activity. Not only is this of benefit to their customers (and a great selling point) it’s also of huge benefit to them (as detailed logging can quickly consume disk after disk worth of resources). Many of the largest VPN providers will tell you as much: not only do they have no interest in keeping logs, but given the sheer size of their operation they can’t even begin to set aside the disk space to do so.
A mix of features and price make a good VPN, but plenty of bad VPNs masquerade as good ones. Look for articles written by trustworthy sources that discuss the merits of each service based on its features, versus simple rundowns and user testimonials, which are almost always polluted by a combination of fanatical users and corporate bootstrapping in attempt to get their names out to potential customers.
I have a question. I subscribed to yearly plan of Vypr VPN about 6 months ago in the Chicago, US. Now, I have freshly moved to India on a job trip. My concern is that I am unable to access Netflix US with Vypr VPN. Also, the BBC iPlayer is taking too long to buffer videos. I believe Vypr is one of the fastest VPN services in industry and Golden Frog surely doesn’t compromises a bit when it comes to their standards. But, still I am left with sluggish network speed. Can you help me with it?
Logging Policy – IPVanish has been involved in a case where the company handed over user information to Homeland Security. The user was suspected of involvement in child pornography. Again, commenting on the decision of IPVanish to assist agencies in catching a suspect is an ethical gray area that I choose my readers to discuss on what they think in the comment section. However, the brand has since changed ownership with the company StackPath. The CEO of the company clearly stated that they are committed to the no logs policy. I think they deserve the benefit of the doubt considering that they weren’t a part of IPVanish when the case occurred.
In some organization intranets, the data of a department, such as human resources, is so sensitive that the network segment of the department is physically disconnected from the rest of the intranet. While this protects the data of the human resources department, it creates information accessibility problems for authorized users not physically connected to the separate network segment.
As we previously noted, we don't recommend relying on our picks to get around geographic restrictions on copyrighted content. The practice is likely illegal, and it violates the terms of service of your ISP, VPN, and content provider. On top of that, it often doesn't work—we couldn't access Netflix over any of the services we tried, and of the four streams we loaded on BBC iPlayer, only two worked a few days later.
Hotspot Shield depends on a custom VPN protocol that's not been publicly analyzed by independent experts. We don't know how private or secure it really is. The company has been accused of spying on users (it denies the allegations), and complaints abound online about Hotspot Shield software installing on PCs without users' permission. All this, and the company's U.S. location, may scare away customers who want to protect their privacy.
Authentication that occurs during the creation of a PPTP-based VPN connection uses the same authentication mechanisms as PPP connections, such as Extensible Authentication Protocol (EAP), Microsoft Challenge-Handshake Authentication Protocol (MS-CHAP), Microsoft Challenge-Handshake Authentication Protocol version 2 (MS-CHAP v2), CHAP, Shiva Password Authentication Protocol (SPAP), and Password Authentication Protocol (PAP). PPTP inherits encryption, compression, or both of PPP payloads from PPP. For PPTP connections, EAP-Transport Layer Security (EAP-TLS), MS-CHAP, or MS-CHAP v2 must be used for the PPP payloads to be encrypted using Microsoft Point-to-Point Encryption (MPPE).
IP / DNS leak test – PureVPN’s security mechanisms are based on the AES 256 bit encryption. This is the modern industry-standard of encryption that every VPN worth buying uses. Together with this mode of encryption and PureVPN’s DNS protection features, the possibility of IP or DNS leaks is all but completely ruled out. With security becoming a matter of utmost importance for users all over the world, PureVPN delivers just the right combination of speed and security for the users’ peace of mind.
ZenMate has a lightweight app that is really simple to use. It offers good security and connects with any server of your choice almost instantly. The speeds remain fairly stable across servers and is faster than dozens of other VPNs. I would recommend its free browser extensions, as there are better premium apps available for lower rates than ZenMate.
The virtual router architecture,[21][22] as opposed to BGP/MPLS techniques, requires no modification to existing routing protocols such as BGP. By the provisioning of logically independent routing domains, the customer operating a VPN is completely responsible for the address space. In the various MPLS tunnels, the different PPVPNs are disambiguated by their label, but do not need routing distinguishers.
I recently bought a PureVPN year subscription. Mostly i did it beacuse my internet provider around 9p.m. until midnight donwgrade the speed, ISP throttling at is best. At that time of the night i use it almost all the time to stream content on KODI, and without a VPN wasn’t possible at all. To guarantee the best performance in terms of speed i should use the Stream mode or any other option from the PureVPN app? (KODI is installed on a android device).
The virtual router architecture,[21][22] as opposed to BGP/MPLS techniques, requires no modification to existing routing protocols such as BGP. By the provisioning of logically independent routing domains, the customer operating a VPN is completely responsible for the address space. In the various MPLS tunnels, the different PPVPNs are disambiguated by their label, but do not need routing distinguishers.
Jurisdiction – From the point of view of privacy, nothing is more important than the jurisdiction in which a VPN provider operates. VPN providers based in countries like the UK, the US, Canada, New Zealand, and Australia have to follow data retention laws and cooperate with agencies for surveillance purposes. However, if a VPN provider truly follows a zero-logging policy, then users can consider their privacy secure even if the VPN is based in one of the countries as above. Nonetheless, given the choice, you should avoid VPNs that fall in the jurisdiction of agencies notorious for their surveillance programs.
The first runs in the VPN client app on your computer, so if the VPN connection fails while the VPN client app is running, that VPN client app can turn off the computer or mobile device's internet connection. However, if your VPN connection has failed because the VPN client app itself crashed, then the kill switch may not work, and your IP and data may leak onto the internet.
ProtonVPN is a superb service provided by the developers of Proton Mail. It is a secure VPN provider that lets people use the service on an unlimited basis. This makes it perfect for privately surfing the web on a daily basis. On the downside, it throttles free-users’ bandwidth. This means that the free ProtonVPN service will not provide the speeds necessary for doing data-intensive tasks such as streaming in HD. ProtonVPN is a superb VPN that many people may find useful for unblocking censored news.
To narrow the hundreds of VPN providers down to a manageable list, we first looked at reviews from dedicated sites like vpnMentor and TorrentFreak, research and recommendations from noncommercial sources such as That One Privacy Site and privacytools.io, and user experiences and tips on various subreddits and technology-focused websites like Lifehacker and Ars Technica. We settled on 32 VPNs that were repeatedly recommended. From there, we dug into the details of how each one handled issues from technology to subscriptions:
Servers – The number of servers and geographical distribution of these servers is another important factor that determines the quality of a VPN. The greater the server network, the fewer problems you are likely to encounter such as overcrowded servers and downtime. A strong server infrastructure signifies a high standard of VPN performance standard.
For the Routing and Remote Access service, MPPE encryption strengths are configured on the Encryption tab on the properties of a remote access policy to use 40-bit (the Basic setting), 56-bit (the Strong setting), or 128-bit (the Strongest setting) encryption keys. Administrators should use 40-bit MPPE encryption keys to connect with older operating systems that do not support 56-bit or 128-bit encryption keys (this includes older Windows operating systems and operating systems from companies other than Microsoft). Otherwise, use 128-bit encryption keys. Encryption strengths for L2TP/IPSec connections use 56-bit DES (the Basic or Strong setting) or 168-bit 3DES (the Strongest setting).
You may be considering going with one of the handful of free VPN services available. Why pay for something you can get for free, right? Unfortunately there’s a ton of limitations and risks with using a free VPN. Most offer tiny bandwidth allowances, limited server locations, even capped speeds, as they want to convert you into a paid customer to unlock the full product. Don’t expect to be able to stream more than a few Youtube clips, that’s for sure.
L2TP uses UDP messages over IP networks for both tunnel maintenance and tunneled data. The payloads of encapsulated PPP frames can be encrypted or compressed (or both); however, L2TP clients do not negotiate the use of MPPE for L2TP connections. Encryption for L2TP connections is provided by IPSec Encapsulating Security Payload (ESP) in transport mode.
If you’re an online gamer who uses a VPN to access another region’s servers (or because you got IP banned), the most important factor in choosing a VPN is latency. The ping time between the game servers and your computer or console is mostly what determines how much lag you’ll experience. If you want to stay competitive, figure out where the game’s regional servers are hosted and choose the nearest VPN server.
Our results were similar in other parts of the world, with IVPN ranking near the top regardless of the test, day, or time. The exception was in Asia, where its Hong Kong servers didn’t perform well. At the time of our initial tests in spring of 2018, IVPN didn’t offer any other servers in Asia aside from Hong Kong. Since then, the company has added locations in Singapore and Tokyo, but we haven’t run a new series of standardized tests with either location.
We recommend against using any so-called free VPN. Free VPN services tend to be significantly slower than their premium counterparts. Their servers are usually congested and the apps often impose bandwidth limits or data caps. Server selection is more limited as well. Besides speed, free VPNs often use shady practices to make money, such as collecting your browsing data to sell to third parties and injecting ads into browsers. Some even carry malware payloads to infect your device.
For the Routing and Remote Access service, MPPE encryption strengths are configured on the Encryption tab on the properties of a remote access policy to use 40-bit (the Basic setting), 56-bit (the Strong setting), or 128-bit (the Strongest setting) encryption keys. Administrators should use 40-bit MPPE encryption keys to connect with older operating systems that do not support 56-bit or 128-bit encryption keys (this includes older Windows operating systems and operating systems from companies other than Microsoft). Otherwise, use 128-bit encryption keys. Encryption strengths for L2TP/IPSec connections use 56-bit DES (the Basic or Strong setting) or 168-bit 3DES (the Strongest setting).
The basic monthly allowance is only 2GB, but if you register with an email address, that jumps to 10GB. If you run out of data before the end of the month, you can always switch over to the even more generous Hotspot Shield.For even more free data, you can let Windscribe use your computer to mine cryptocurrency. That feature seems a bit creepy, but it's entirely optional and you can adjust the amount of power drawn.
TorGuard offers applications for every major platform, including Windows, macOS, and Android. And unlike our top pick, it also supports OpenVPN on ChromeOS. (Though TorGuard does offer an iOS app, it doesn’t natively support the OpenVPN protocol that allows for the easiest and most reliable secure connections.) Using these apps, you can manually select a server, click Connect, and not worry about the rest. But otherwise, the applications aren’t as refined or easy to use as IVPN’s. New users are likely to find themselves out of their depth when modifying anything but the most basic functions, such as auto-connecting at launch or minimizing the app.
The country connections, meanwhile, matter most to those who want to spoof their location; however, non-spoofers should also make sure there are connections in their home country. If you live in Los Angeles, for example, and want access to American content, then you’ll need a VPN that provides U.S. connections. It won’t work to try and watch Amazon Prime Video over a Dutch VPN connection, because as far as Hulu’s concerned your computer is in the Netherlands.
Games are another type of VPN users that don’t compromise on speed (like others). They play multiplayer games that demand a faster Internet connection. When playing a game hosted on a server deployed in a distant location, server latency issue occurs. This is one thing that makes gamers go berserk. For example, you are playing CS Go and you’re about to headshot your opponent, and DAMN you missed it because of high ping rates. That can seriously make you furious and cost you a game. Be aware gamers! Using a fastest VPN service will certainly make you free from all the worries and focus on the game. A fast VPN connection will minimize the lag you experience and give you best gaming experience at a minimal fee. All the major players in the fast VPN category have optimized servers best designed to cater gamer needs. Learn how a gaming VPN can improve your multiplayer experience.
OVPN was regularly the fastest VPN in our tests regardless of the time of week or location. We also liked the app’s clean design and its simple and well-labeled settings pane. But OVPN is a small startup with a limited server network: At this writing, the company has servers in just seven countries, none in Asia. That makes it less versatile for finding less congested routes or geoshifting. OVPN also hasn’t released an Android app yet, so even non-iOS device owners will have to resort to the clunky, third-party OpenVPN Connect app on their phones. When we reached out for details about the company’s operational security, founder and CEO David Wibergh was open to questions and gave us answers that led us to believe that the company acted in the best interest of its customers’ privacy and security. He noted that after an uptick in data requests from local authorities in Sweden—all of which OVPN responded to by explaining that it lacked any pertinent data—the company published a blog post to detail just how little information it keeps.
Internet Protocol Security (IPsec) was initially developed by the Internet Engineering Task Force (IETF) for IPv6, which was required in all standards-compliant implementations of IPv6 before RFC 6434 made it only a recommendation.[7] This standards-based security protocol is also widely used with IPv4 and the Layer 2 Tunneling Protocol. Its design meets most security goals: authentication, integrity, and confidentiality. IPsec uses encryption, encapsulating an IP packet inside an IPsec packet. De-encapsulation happens at the end of the tunnel, where the original IP packet is decrypted and forwarded to its intended destination.
VyprVPN is a powerful contender if you’re after performance and security. It boasts great speeds due to a staggering network of 700+ serves and more than 200K IP addresses. They own and manage their servers, which translates into reliable uptime, lag-free performance, top-notch support and great speeds. Add in unlimited bandwidth and P2P support, successful handling of Netflix and Steam geo blocks, and you can check all your VPN must-have features right off the bat.
We considered native apps for Windows, Mac, and Android to be mandatory because they’re easier to use than open-source or third-party VPN apps like Tunnelblick; that in turn makes it easier to stay secure. For more-advanced users, adding VPN connections to Wi-Fi routers can help secure all connections on a home network without having to manage devices individually.
ExpressVPN attempts to build trust in other ways, even without a public face. Court records from 2017 demonstrate that when Turkish authorities seized ExpressVPN servers in the country looking for information, they found nothing of value, as promised by ExpressVPN’s no-logging policy. ExpressVPN also highlights initiatives such as open-source leak-testing tools, developer content about how the company implements different technologies, and support for the efforts of OpenMedia and the EFF. The ExpressVPN representative even offered to arrange a confidential call between our writer and the owners of the company. However, without being able to discuss their identities or learn about other senior leadership, we believed that wouldn’t have been enough to change our recommendation, so we declined. In the end, trust is such a crucial part of deciding which VPN to use that we had to pass on ExpressVPN.
Computer and software providers work hard to make sure that the devices you buy are safe right out of the box. But they don't provide everything you'll need. Antivirus software, for example, consistently outperforms the built-in protections. In the same vein, VPN software lets you use the web and Wi-Fi with confidence that your information will remain secure. It's critically important and often overlooked.
×
|
{
"url": "http://x10vpn.com/vpnservice7/free-vpn-torrenting-vpn-free.html",
"source_domain": "x10vpn.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "41899",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WUTV6J2XHFUK4GTJLDKTOAYXUTM6OMGV",
"WARC-Concurrent-To": "<urn:uuid:155f251c-64a6-4d89-84a0-d035432fd787>",
"WARC-Date": "2019-07-20T16:26:33Z",
"WARC-IP-Address": "192.198.90.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q7EJS224MYXD6M2ZO4H36QWKI2ZY6OAP",
"WARC-Record-ID": "<urn:uuid:00a5c5cf-3305-4cce-a77d-8fc4bf3c361a>",
"WARC-Target-URI": "http://x10vpn.com/vpnservice7/free-vpn-torrenting-vpn-free.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e7b5ecf-9ef3-41c5-9c38-6fd2d060facd>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-95-236-185.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
914,
1321,
1322,
1677,
1678,
1679,
2123,
2891,
3259,
3715,
4117,
4564,
4565,
4981,
5341,
5757,
6167,
6168,
6536,
6967,
7321,
7694,
8076,
8432,
8831,
9286,
10146,
10879,
11281,
11777,
12201,
12750,
13168,
13169,
13596,
13871,
14255,
15048,
15650,
16417,
16932,
16933,
17303,
17304,
17305,
17745,
18108,
18521,
18968,
19374,
19868,
20520,
20909,
21328,
21768,
21769,
22455,
22456,
22457,
22958,
23312,
23720,
24176,
24584,
24585,
25202,
25581,
26087,
26617,
26969,
27664,
27665,
28120,
28475,
28889,
29350,
29837,
30532,
30952,
31608,
32072,
32960,
34008,
34644,
35115,
35483,
36391,
36801
],
"line_end_idx": [
1,
914,
1321,
1322,
1677,
1678,
1679,
2123,
2891,
3259,
3715,
4117,
4564,
4565,
4981,
5341,
5757,
6167,
6168,
6536,
6967,
7321,
7694,
8076,
8432,
8831,
9286,
10146,
10879,
11281,
11777,
12201,
12750,
13168,
13169,
13596,
13871,
14255,
15048,
15650,
16417,
16932,
16933,
17303,
17304,
17305,
17745,
18108,
18521,
18968,
19374,
19868,
20520,
20909,
21328,
21768,
21769,
22455,
22456,
22457,
22958,
23312,
23720,
24176,
24584,
24585,
25202,
25581,
26087,
26617,
26969,
27664,
27665,
28120,
28475,
28889,
29350,
29837,
30532,
30952,
31608,
32072,
32960,
34008,
34644,
35115,
35483,
36391,
36801,
36802
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 36802,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.0006521400064229965,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4088059067726135,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035808831453323364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14337466657161713,
"rps_doc_frac_unique_words": 0.2766314446926117,
"rps_doc_mean_word_length": 5.011743068695068,
"rps_doc_num_sentences": 311,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.269970417022705,
"rps_doc_word_count": 5961,
"rps_doc_frac_chars_dupe_10grams": 0.10677824169397354,
"rps_doc_frac_chars_dupe_5grams": 0.10791631788015366,
"rps_doc_frac_chars_dupe_6grams": 0.10677824169397354,
"rps_doc_frac_chars_dupe_7grams": 0.10677824169397354,
"rps_doc_frac_chars_dupe_8grams": 0.10677824169397354,
"rps_doc_frac_chars_dupe_9grams": 0.10677824169397354,
"rps_doc_frac_chars_top_2gram": 0.004351459909230471,
"rps_doc_frac_chars_top_3gram": 0.0013389099622145295,
"rps_doc_frac_chars_top_4gram": 0.001104600029066205,
"rps_doc_books_importance": -2910.52197265625,
"rps_doc_books_importance_length_correction": -2910.52197265625,
"rps_doc_openwebtext_importance": -1622.1236572265625,
"rps_doc_openwebtext_importance_length_correction": -1622.1236572265625,
"rps_doc_wikipedia_importance": -1141.452392578125,
"rps_doc_wikipedia_importance_length_correction": -1141.452392578125
},
"fasttext": {
"dclm": 0.1491701602935791,
"english": 0.9455388188362122,
"fineweb_edu_approx": 1.823992133140564,
"eai_general_math": 0.10109984874725342,
"eai_open_web_math": 0.09371793270111084,
"eai_web_code": 0.27722346782684326
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,064,432,659,700,549,000 |
Provided by: erlang-manpages_22.0.7+dfsg-1_all bug
NAME
init - Coordination of system startup.
DESCRIPTION
This module is preloaded and contains the code for the init system process that
coordinates the startup of the system. The first function evaluated at startup is
boot(BootArgs), where BootArgs is a list of command-line arguments supplied to the Erlang
runtime system from the local operating system; see erl(1).
init reads the boot script, which contains instructions on how to initiate the system. For
more information about boot scripts, see script(5).
init also contains functions to restart, reboot, and stop the system.
EXPORTS
boot(BootArgs) -> no_return()
Types:
BootArgs = [binary()]
Starts the Erlang runtime system. This function is called when the emulator is
started and coordinates system startup.
BootArgs are all command-line arguments except the emulator flags, that is, flags
and plain arguments; see erl(1).
init interprets some of the flags, see section Command-Line Flags below. The
remaining flags ("user flags") and plain arguments are passed to the init loop and
can be retrieved by calling get_arguments/0 and get_plain_arguments/0,
respectively.
get_argument(Flag) -> {ok, Arg} | error
Types:
Flag = atom()
Arg = [Values :: [string()]]
Returns all values associated with the command-line user flag Flag. If Flag is
provided several times, each Values is returned in preserved order. Example:
% erl -a b c -a d
...
1> init:get_argument(a).
{ok,[["b","c"],["d"]]}
The following flags are defined automatically and can be retrieved using this
function:
root:
The installation directory of Erlang/OTP, $ROOT:
2> init:get_argument(root).
{ok,[["/usr/local/otp/releases/otp_beam_solaris8_r10b_patched"]]}
progname:
The name of the program which started Erlang:
3> init:get_argument(progname).
{ok,[["erl"]]}
home:
The home directory:
4> init:get_argument(home).
{ok,[["/home/harry"]]}
Returns error if no value is associated with Flag.
get_arguments() -> Flags
Types:
Flags = [{Flag :: atom(), Values :: [string()]}]
Returns all command-line flags and the system-defined flags, see get_argument/1.
get_plain_arguments() -> [Arg]
Types:
Arg = string()
Returns any plain command-line arguments as a list of strings (possibly empty).
get_status() -> {InternalStatus, ProvidedStatus}
Types:
InternalStatus = internal_status()
ProvidedStatus = term()
internal_status() = starting | started | stopping
The current status of the init process can be inspected. During system startup
(initialization), InternalStatus is starting, and ProvidedStatus indicates how far
the boot script has been interpreted. Each {progress, Info} term interpreted in the
boot script affects ProvidedStatus, that is, ProvidedStatus gets the value of Info.
reboot() -> ok
All applications are taken down smoothly, all code is unloaded, and all ports are
closed before the system terminates. If command-line flag -heart was specified, the
heart program tries to reboot the system. For more information, see heart(3erl).
To limit the shutdown time, the time init is allowed to spend taking down
applications, command-line flag -shutdown_time is to be used.
restart() -> ok
The system is restarted inside the running Erlang node, which means that the
emulator is not restarted. All applications are taken down smoothly, all code is
unloaded, and all ports are closed before the system is booted again in the same
way as initially started. The same BootArgs are used again.
To limit the shutdown time, the time init is allowed to spend taking down
applications, command-line flag -shutdown_time is to be used.
script_id() -> Id
Types:
Id = term()
Gets the identity of the boot script used to boot the system. Id can be any Erlang
term. In the delivered boot scripts, Id is {Name, Vsn}. Name and Vsn are strings.
stop() -> ok
The same as stop(0).
stop(Status) -> ok
Types:
Status = integer() >= 0 | string()
All applications are taken down smoothly, all code is unloaded, and all ports are
closed before the system terminates by calling halt(Status). If command-line flag
-heart was specified, the heart program is terminated before the Erlang node
terminates. For more information, see heart(3erl).
To limit the shutdown time, the time init is allowed to spend taking down
applications, command-line flag -shutdown_time is to be used.
COMMAND-LINE FLAGS
Warning:
The support for loading of code from archive files is experimental. The only purpose of
releasing it before it is ready is to obtain early feedback. The file format, semantics,
interfaces, and so on, can be changed in a future release. The -code_path_choice flag is
also experimental.
The init module interprets the following command-line flags:
--:
Everything following -- up to the next flag is considered plain arguments and can be
retrieved using get_plain_arguments/0.
-code_path_choice Choice:
Can be set to strict or relaxed. It controls how each directory in the code path is to
be interpreted:
* Strictly as it appears in the boot script, or
* init is to be more relaxed and try to find a suitable directory if it can choose
from a regular ebin directory and an ebin directory in an archive file.
This flag is particular useful when you want to elaborate with code loading from
archives without editing the boot script. For more information about interpretation of
boot scripts, see script(5). The flag has also a similar effect on how the code server
works; see code(3erl).
-epmd_module Module:
Specifies the module to use for registration and lookup of node names. Defaults to
erl_epmd.
-eval Expr:
Scans, parses, and evaluates an arbitrary expression Expr during system
initialization. If any of these steps fail (syntax error, parse error, or exception
during evaluation), Erlang stops with an error message. In the following example
Erlang is used as a hexadecimal calculator:
% erl -noshell -eval 'R = 16#1F+16#A0, io:format("~.16B~n", [R])' \\
-s erlang halt
BF
If multiple -eval expressions are specified, they are evaluated sequentially in the
order specified. -eval expressions are evaluated sequentially with -s and -run
function calls (this also in the order specified). As with -s and -run, an evaluation
that does not terminate blocks the system initialization process.
-extra:
Everything following -extra is considered plain arguments and can be retrieved using
get_plain_arguments/0.
-run Mod [Func [Arg1, Arg2, ...]]:
Evaluates the specified function call during system initialization. Func defaults to
start. If no arguments are provided, the function is assumed to be of arity 0.
Otherwise it is assumed to be of arity 1, taking the list [Arg1,Arg2,...] as argument.
All arguments are passed as strings. If an exception is raised, Erlang stops with an
error message.
Example:
% erl -run foo -run foo bar -run foo bar baz 1 2
This starts the Erlang runtime system and evaluates the following functions:
foo:start()
foo:bar()
foo:bar(["baz", "1", "2"]).
The functions are executed sequentially in an initialization process, which then
terminates normally and passes control to the user. This means that a -run call that
does not return blocks further processing; to avoid this, use some variant of spawn in
such cases.
-s Mod [Func [Arg1, Arg2, ...]]:
Evaluates the specified function call during system initialization. Func defaults to
start. If no arguments are provided, the function is assumed to be of arity 0.
Otherwise it is assumed to be of arity 1, taking the list [Arg1,Arg2,...] as argument.
All arguments are passed as atoms. If an exception is raised, Erlang stops with an
error message.
Example:
% erl -s foo -s foo bar -s foo bar baz 1 2
This starts the Erlang runtime system and evaluates the following functions:
foo:start()
foo:bar()
foo:bar([baz, '1', '2']).
The functions are executed sequentially in an initialization process, which then
terminates normally and passes control to the user. This means that a -s call that
does not return blocks further processing; to avoid this, use some variant of spawn in
such cases.
Because of the limited length of atoms, it is recommended to use -run instead.
EXAMPLE
% erl -- a b -children thomas claire -ages 7 3 -- x y
...
1> init:get_plain_arguments().
["a","b","x","y"]
2> init:get_argument(children).
{ok,[["thomas","claire"]]}
3> init:get_argument(ages).
{ok, [["7","3"]]}
4> init:get_argument(silly).
error
SEE ALSO
erl_prim_loader(3erl), heart(3erl)
|
{
"url": "http://manpages.ubuntu.com/manpages/eoan/man3/init.3erl.html",
"source_domain": "manpages.ubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "16793",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OVLI2Q4UXTTB7NOA4LP4R4LVXWSPUTCY",
"WARC-Concurrent-To": "<urn:uuid:5d032c2e-08b1-4aa9-99f9-5894f8aa03d1>",
"WARC-Date": "2019-07-23T08:30:17Z",
"WARC-IP-Address": "91.189.95.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A2J3DJKKMLA25XP4OLHIEX5ICXIHWPBU",
"WARC-Record-ID": "<urn:uuid:31384d90-19a7-4d2e-bae9-f8e788301599>",
"WARC-Target-URI": "http://manpages.ubuntu.com/manpages/eoan/man3/init.3erl.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a755d8d2-bebd-4311-a44f-f9014e36d72e>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-158-17-71.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,
51,
52,
57,
58,
104,
105,
117,
118,
216,
314,
412,
479,
480,
578,
637,
638,
715,
716,
724,
725,
762,
763,
784,
785,
824,
825,
923,
977,
978,
1076,
1123,
1124,
1222,
1320,
1418,
1446,
1447,
1494,
1495,
1516,
1517,
1548,
1594,
1595,
1693,
1784,
1785,
1817,
1835,
1874,
1911,
1912,
2010,
2034,
2035,
2057,
2124,
2125,
2169,
2251,
2252,
2278,
2342,
2343,
2391,
2422,
2423,
2445,
2483,
2484,
2528,
2567,
2568,
2633,
2634,
2666,
2667,
2688,
2689,
2755,
2756,
2851,
2852,
2890,
2891,
2912,
2913,
2945,
2946,
3040,
3041,
3097,
3098,
3119,
3120,
3172,
3213,
3280,
3281,
3379,
3477,
3575,
3673,
3674,
3696,
3697,
3795,
3893,
3988,
3989,
4087,
4163,
4164,
4187,
4188,
4286,
4384,
4482,
4556,
4557,
4655,
4731,
4732,
4757,
4758,
4779,
4780,
4809,
4810,
4908,
5004,
5005,
5025,
5026,
5061,
5062,
5088,
5089,
5110,
5111,
5163,
5164,
5262,
5360,
5458,
5523,
5524,
5622,
5698,
5699,
5718,
5719,
5731,
5829,
5927,
6025,
6051,
6052,
6120,
6121,
6134,
6232,
6282,
6283,
6318,
6416,
6443,
6444,
6503,
6504,
6602,
6687,
6688,
6786,
6884,
6982,
7016,
7017,
7047,
7145,
7166,
7167,
7188,
7286,
7384,
7482,
7537,
7538,
7616,
7640,
7652,
7653,
7751,
7849,
7947,
8024,
8025,
8042,
8140,
8174,
8175,
8219,
8317,
8415,
8513,
8611,
8637,
8638,
8658,
8659,
8717,
8718,
8806,
8807,
8828,
8847,
8884,
8885,
8983,
9081,
9179,
9202,
9203,
9245,
9343,
9441,
9539,
9637,
9663,
9664,
9684,
9685,
9737,
9738,
9826,
9827,
9848,
9867,
9902,
9903,
10001,
10099,
10197,
10220,
10221,
10311,
10312,
10320,
10321,
10382,
10393,
10394,
10432,
10457,
10496,
10530,
10565,
10590,
10626,
10639,
10640,
10649,
10650
],
"line_end_idx": [
51,
52,
57,
58,
104,
105,
117,
118,
216,
314,
412,
479,
480,
578,
637,
638,
715,
716,
724,
725,
762,
763,
784,
785,
824,
825,
923,
977,
978,
1076,
1123,
1124,
1222,
1320,
1418,
1446,
1447,
1494,
1495,
1516,
1517,
1548,
1594,
1595,
1693,
1784,
1785,
1817,
1835,
1874,
1911,
1912,
2010,
2034,
2035,
2057,
2124,
2125,
2169,
2251,
2252,
2278,
2342,
2343,
2391,
2422,
2423,
2445,
2483,
2484,
2528,
2567,
2568,
2633,
2634,
2666,
2667,
2688,
2689,
2755,
2756,
2851,
2852,
2890,
2891,
2912,
2913,
2945,
2946,
3040,
3041,
3097,
3098,
3119,
3120,
3172,
3213,
3280,
3281,
3379,
3477,
3575,
3673,
3674,
3696,
3697,
3795,
3893,
3988,
3989,
4087,
4163,
4164,
4187,
4188,
4286,
4384,
4482,
4556,
4557,
4655,
4731,
4732,
4757,
4758,
4779,
4780,
4809,
4810,
4908,
5004,
5005,
5025,
5026,
5061,
5062,
5088,
5089,
5110,
5111,
5163,
5164,
5262,
5360,
5458,
5523,
5524,
5622,
5698,
5699,
5718,
5719,
5731,
5829,
5927,
6025,
6051,
6052,
6120,
6121,
6134,
6232,
6282,
6283,
6318,
6416,
6443,
6444,
6503,
6504,
6602,
6687,
6688,
6786,
6884,
6982,
7016,
7017,
7047,
7145,
7166,
7167,
7188,
7286,
7384,
7482,
7537,
7538,
7616,
7640,
7652,
7653,
7751,
7849,
7947,
8024,
8025,
8042,
8140,
8174,
8175,
8219,
8317,
8415,
8513,
8611,
8637,
8638,
8658,
8659,
8717,
8718,
8806,
8807,
8828,
8847,
8884,
8885,
8983,
9081,
9179,
9202,
9203,
9245,
9343,
9441,
9539,
9637,
9663,
9664,
9684,
9685,
9737,
9738,
9826,
9827,
9848,
9867,
9902,
9903,
10001,
10099,
10197,
10220,
10221,
10311,
10312,
10320,
10321,
10382,
10393,
10394,
10432,
10457,
10496,
10530,
10565,
10590,
10626,
10639,
10640,
10649,
10650,
10691
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10691,
"ccnet_original_nlines": 263,
"rps_doc_curly_bracket": 0.002057810081169009,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.290723979473114,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009615380316972733,
"rps_doc_frac_lines_end_with_ellipsis": 0.007575760129839182,
"rps_doc_frac_no_alph_words": 0.27319005131721497,
"rps_doc_frac_unique_words": 0.29449838399887085,
"rps_doc_mean_word_length": 5.223300933837891,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0.0045248898677527905,
"rps_doc_unigram_entropy": 5.267491817474365,
"rps_doc_word_count": 1236,
"rps_doc_frac_chars_dupe_10grams": 0.3121127486228943,
"rps_doc_frac_chars_dupe_5grams": 0.3451053202152252,
"rps_doc_frac_chars_dupe_6grams": 0.3317843973636627,
"rps_doc_frac_chars_dupe_7grams": 0.32729244232177734,
"rps_doc_frac_chars_dupe_8grams": 0.32729244232177734,
"rps_doc_frac_chars_dupe_9grams": 0.32729244232177734,
"rps_doc_frac_chars_top_2gram": 0.013940519653260708,
"rps_doc_frac_chars_top_3gram": 0.012081779539585114,
"rps_doc_frac_chars_top_4gram": 0.013630730099976063,
"rps_doc_books_importance": -696.0278930664062,
"rps_doc_books_importance_length_correction": -696.0278930664062,
"rps_doc_openwebtext_importance": -370.117919921875,
"rps_doc_openwebtext_importance_length_correction": -370.117919921875,
"rps_doc_wikipedia_importance": -297.6742858886719,
"rps_doc_wikipedia_importance_length_correction": -297.6742858886719
},
"fasttext": {
"dclm": 0.2926037907600403,
"english": 0.772905170917511,
"fineweb_edu_approx": 2.7307727336883545,
"eai_general_math": 0.9233250617980957,
"eai_open_web_math": 0.3315736651420593,
"eai_web_code": 0.9702233672142029
}
}
|
{
"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": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,031,498,928,051,839,000 |
Blogger pushing through Facebook and Twitter To be frank, I never intended this to last too much. I have been (and proudly, like a true hipster) avoiding creating a Facebook account and the Twitter one I only opened because I wanted to explore it as a machine to machine messaging system and never looked back after that idea bombed. So this year I went on Facebook and reactivated my interest in Twitter, now with a more social focus. The reason doesn't really matter, but I'll share it anyway: I had an asshole colleague that refused to talk to me on anything else other than Facebook Messenger. Now we barely talk to each other, anyway. So, what have I learned from this experience? Before I answer that question, I want to tell you about how I thought it would go when I went in.
What I thought going in
I have been keeping this blog since 2007, carefully sharing whatever I thought important, especially since I am a very forgetful person and I needed a place to store valuable tidbits of information. So when Facebook blew up I merely scoffed. Have other people use some sort of weird platform to share what they think; let them post cat videos and share whenever they go to the toilet: I am above this. I carefully study and solve the problem, read the book, research new stuff, link to everything in the information that I think relevant. I have my own template, I control the code on my blog, people can chat with me and others directly, comment on whatever I have done. I can also edit a post and update it with changes that I either learn as I evolve. My posts have permanent links that look like their title, suckers! I really don't need Facebook at all.
And Twitter. Phaw! 140 characters? What is this, SMSes online? If you really have something to say, say it in bulk. It's a completely useless platform. I might take a second look at it and use it as a chat system for the blog, at most (I actually did that for a while, a long time ago). I am not social, I am antisocial, suckers! I really don't need Twitter at all.
There you go. Superior as fuck, I entered the social media having a lot of smug preconceptions that I feel ashamed for. I apologize.
Facebook
So what did I learn from months on Facebook? Nothing. Hah! To be honest, I didn't disrespect Facebook that much to begin with. I had high hopes that once I connect with all my friends I would share of their interesting experiences and projects, we would communicate and collaborate better, we would organize more parties or gettogethers, meet up more frequently if we are in the same area. Be interesting, passionate; you know... social. Instead I got cute animal videos, big pointless images with texts plastered all over them - like this would give more gravitas to bland clichés, pictures of people on vacation or at parties - as if I care about their mugs more than the location, political opinion bile, sexist jokes, driving videos, random philosophical musings, and so on and so on. Oh, I learned a lot from Facebook, most of it being how many stupid and pointless things people do. Hell, I am probably friends with people I don't really know for a good reason, not just because I am an asshole who only thinks about himself!
Not everything is bad, clearly. The messenger is the only widespread method of online communication outside email. I know when people's birthdays are (and what day it is currently). People sometimes post their achievements, link to their blog posts, share some interesting information that they either stumbled upon on the Internet (most of the time) or thought about or did themselves, there are events that I learn about from other people going there, like concerts and software meetings and so on. Oh, and the Unfollow button is a gem, however cowardly it is! However, I am no longer "reading my Facebook", I am scrolling at warp speed. I've developed internal filters for spammy bullshit and most of the time, after going through three days worth of stuff, I have only five or six links that I opened for later, one of them being probably a music video on YouTube. It still takes a huge amount of time sifting through all the shit.
Twitter
What about Twitter? Huge fucking surprise there! Forced to distill the information they share, people on Twitter either share links to relevant content or small bits of their actual thoughts, real time, while they are thinking them. There is not a comfortable mechanism for long conversations, group conferences or complicated Like-like mechanism. You do have a button to like or retweet something, but it's more of a nod towards the author that what they shared is good, not some cog in an algorithm to tell someone what YOU need. More work stuff is being shared, books that have been read and enjoyed, real time reactions to TV or cinema shows, bits of relevant code, all kind of stuff. In fact, very few people that spam Facebook are even active on Twitter. Twitter is less about a person than about the moment; it's more Zen if you want to go that way. You are not friends with folks, you just appreciate what they share. It's less personal, yet more revealing, a side effect that I had not expected. And when you reply to a tweet, you are aware of how public it is and how disassociated from the post you reply to it is. There is no ego trip on posting the most sarcastic comment like on Facebook.
Not everything is rosy there, either. They have a similar Facebooky thing that shows the title and the image/video of a shared link so you can open them directly there. So if I want to emulate the same type of behaviour on Twitter, you can by endlessly posting links to stupid stuff and follow other people who do that. You can Follow whoever you want and that means that if you are exaggerating, you end up with a deluge of posts that you have no chance of getting out of. I still haven't gotten used to the hashtag thingie. I only follow people and I only use the default Twitter website, so I am not an "advanced user", but I can tell you that after three days worth of Twitter posts that I have missed, I open around 50 links that I intend to follow up on.
So?
Some of the mental filters developed apply to both situations. The same funny ha-ha video that spams the Facebook site can be ignored just as well on the Twitter page as well. Big font misspelled or untranslatable text smacked on top of a meaningless picture is ignored by tradition, since it looks like a big ad I already have a trained eye for from years of browsing the web before ad blockers were invented.
Some of the opinion pieces are really good and I wouldn't have had the opportunity to read them if all I was looking for was news sites and some RSS feed, yet because of the time it takes to find them, I get less time in which I can pay attention to them. I catch myself feeling annoyed with the length of a text or skipping paragraphs, even when I know that those paragraphs are well researched pieces of gold. I feel like I still need to train myself to focus on what is relevant, yet I am so fucking unwilling to let go of the things that are not.
With tweaking, both platforms may become useful. For example one can unfollow all his friends on Facebook, leaving only the messaging and the occasional event and birthday notification to go through. It's a bit radical, but you can do it. I haven't played with the "Hide post (show fewer posts like this)" functionality, it could be pretty cool if it works. Twitter doesn't have a good default filtering system, though, even if I get more useful information from it. That doesn't mean that specialized Twitter clients don't have all kinds of features I have not tried. There is also the software guy way: developing your own software to sift through the stuff. One idea I had, for example, was something that uses OCR to restore images and videos to text.
Bottom line: Facebook, in its raw form, it's almost useless to me. I remember some guy making fun of it and he was so right: "Facebook is not cool. Parents are on it!". You ask someone to connect with you, which is a two directional connection, even if they couldn't care less about you, then you need to make an effort to remove the stuff they just vomit online. The graphical features of the site make it susceptible to graphical spam - everything big and flashy and lacking substance. Twitter is less so and I have been surprised to see how much actual usable information is shared there. The unidirectional following system also leads to more complex data flow and structure, not just big blobs of similar people sharing base stuff that appeals to all.
But hey! "What about you, Siderite? What are you posting on Facebook and Twitter?" You'll just have to become friends and follow me to see, right? Nah, just kidding. My main content creation platform is still Blogger and I am using this system called If This Then That to share any new post on both social networks. Sometimes I read some news or I watch some video and I use the Facebook sharing buttons to express my appreciation for the content without actually writing anything about it and occasionally I retweet something that I find really spectacular on Twitter. Because of my feelings towards the two systems, even if I find an interesting link on Tweeter, I just like it then share it on Facebook if I don't feel it's really something. So, yeah, I am also spamming more on Facebook than on Twitter.
What else?
I haven't touched Google+, which I feel is a failed social platform and only collects various YouTube comments without accurately conveying my interests. I also haven't spoken about LinkedIn, which I think is a great networking platform, but I use it - as I believe it should be - exclusively for promoting my work and finding employment. I've used some strong language above, not because I am passionate about the subject but because I am not. I find it's appropriate though and won't apologize for it. I couldn't care less if people go or don't go on social networks and surely I am not an trendsetter so that Zuckerberg would worry. I only shared my own experience.
For the future I will probably continue to use both systems unless I finally implement one of the good ideas that would allow me to focus more on what matters, thus renouncing parts of my unhealthy habits. I am curious on how this will evolve in the near future and after I leave my current hiatus and go look for employment or start my own business.
Comments
Be the first to post a comment
Post a comment
|
{
"url": "https://siderite.dev/blog/what-i-learned-from-four-months-on.html",
"source_domain": "siderite.dev",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "34892",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CPO2GBCSJBI7MIRHMINAOJIUJZNCDZGK",
"WARC-Concurrent-To": "<urn:uuid:52acfc51-9e3a-4da4-a69f-7aaff3bc3ca6>",
"WARC-Date": "2022-01-27T08:28:07Z",
"WARC-IP-Address": "89.38.208.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XFBDEQCVPZHDTLAFKFWGECZOTDCO4IDN",
"WARC-Record-ID": "<urn:uuid:7ef7e43e-608b-4b07-bafa-8074ee18d01a>",
"WARC-Target-URI": "https://siderite.dev/blog/what-i-learned-from-four-months-on.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b9d5c32-edaf-4a68-a41d-25fa0abd421f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-84\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,
784,
785,
809,
810,
811,
1670,
1671,
2037,
2038,
2171,
2172,
2181,
2182,
2183,
3215,
3216,
4152,
4153,
4161,
4162,
4163,
5366,
5367,
6128,
6129,
6133,
6134,
6135,
6546,
6547,
7098,
7099,
7855,
7856,
8613,
8614,
9422,
9423,
9434,
9435,
9436,
10105,
10106,
10457,
10458,
10467,
10468,
10499,
10500
],
"line_end_idx": [
784,
785,
809,
810,
811,
1670,
1671,
2037,
2038,
2171,
2172,
2181,
2182,
2183,
3215,
3216,
4152,
4153,
4161,
4162,
4163,
5366,
5367,
6128,
6129,
6133,
6134,
6135,
6546,
6547,
7098,
7099,
7855,
7856,
8613,
8614,
9422,
9423,
9434,
9435,
9436,
10105,
10106,
10457,
10458,
10467,
10468,
10499,
10500,
10514
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10514,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 7,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4765375852584839,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050569478422403336,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12255124747753143,
"rps_doc_frac_unique_words": 0.3366754651069641,
"rps_doc_mean_word_length": 4.386279582977295,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0.00045558001147583127,
"rps_doc_unigram_entropy": 5.605376720428467,
"rps_doc_word_count": 1895,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.005293549969792366,
"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.005774780176579952,
"rps_doc_frac_chars_top_3gram": 0.002887390088289976,
"rps_doc_frac_chars_top_4gram": 0.004331090021878481,
"rps_doc_books_importance": -1126.332275390625,
"rps_doc_books_importance_length_correction": -1126.332275390625,
"rps_doc_openwebtext_importance": -528.4644165039062,
"rps_doc_openwebtext_importance_length_correction": -528.4644165039062,
"rps_doc_wikipedia_importance": -520.7901000976562,
"rps_doc_wikipedia_importance_length_correction": -520.7901000976562
},
"fasttext": {
"dclm": 0.16329115629196167,
"english": 0.9715380668640137,
"fineweb_edu_approx": 1.1689798831939697,
"eai_general_math": 0.13841956853866577,
"eai_open_web_math": 0.1726946234703064,
"eai_web_code": 0.04925454035401344
}
}
|
{
"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": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,568,668,722,809,493,000 |
Zu finden unter
Buffer Underrun
Buffer Underrun
Bücher zum Thema bei Amazon.de
Ein Buffer Underrung tritt generell dann auf, wenn ein Zwischenspeicher (=Buffer) so viel schneller ausgelesen wird als dass Daten hineingeschrieben werden, so dass er schliesslich 'leer gelesen' ist und bei einem erneuten Lesezugriff keine Daten mehr vorhanden sind.
Dieses Problem tritt bspw. bei (älteren) CD-Brennern auf:
Diese Geräte besitzen einen Buffer um die Daten, die vom PC zum Schreiben geliefert werden vor dem Schreiben kurz zwischenzuspeichern um einen gleichmässigen Datenstrom zu gewährleisten.
Liest der CD-Brenner nun schneller aus diesem Buffer aus, als der PC Daten liefern kann (weil er zum Beispiel während des Brennvorgangs plötzlich mit der Nutzung eines anderen Programms belastet wird), kommt es zu einem Buffer Underrun und somit zum Abbruch des Brennvorgangs. (Techniken, die Brenner dagegen einsetzten sind bspw. das sog. burn proof)
SUCHE
AKTIONEN
WERBUNG
NEUIGKEITEN
22.09-29.09.2023:
Neue Begriffe
13.6.2006:
Begriff-Schnellsuche: http://clexi.com/ram
|
{
"url": "https://www.computerlexikon.com/was-ist-buffer-underrun?highlight=Daten",
"source_domain": "www.computerlexikon.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "17366",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FCCVZ5TWPLF6LRMT6Z5QSHGJ3EQV4LB5",
"WARC-Concurrent-To": "<urn:uuid:9658f5eb-3ad5-4a53-944e-bb07879b6f56>",
"WARC-Date": "2023-09-29T13:36:59Z",
"WARC-IP-Address": "5.9.110.84",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:52JKPHFB2FIYFP72U357KATUK2TJHZ7S",
"WARC-Record-ID": "<urn:uuid:392714cc-4182-4330-9b8a-e07c54e9e7d0>",
"WARC-Target-URI": "https://www.computerlexikon.com/was-ist-buffer-underrun?highlight=Daten",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5f66c7ce-cf8f-4292-a40a-59977a400b89>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221\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,
33,
34,
50,
51,
52,
83,
84,
352,
353,
411,
412,
599,
600,
952,
958,
959,
960,
961,
963,
965,
966,
967,
968,
977,
978,
986,
987,
999,
1017,
1031,
1032,
1043
],
"line_end_idx": [
16,
17,
33,
34,
50,
51,
52,
83,
84,
352,
353,
411,
412,
599,
600,
952,
958,
959,
960,
961,
963,
965,
966,
967,
968,
977,
978,
986,
987,
999,
1017,
1031,
1032,
1043,
1085
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1085,
"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.015075379982590675,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.040201008319854736,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23115578293800354,
"rps_doc_frac_unique_words": 0.7094594836235046,
"rps_doc_mean_word_length": 5.95945930480957,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.522191524505615,
"rps_doc_word_count": 148,
"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.0476190485060215,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -71.22705841064453,
"rps_doc_books_importance_length_correction": -71.22705841064453,
"rps_doc_openwebtext_importance": -53.65154266357422,
"rps_doc_openwebtext_importance_length_correction": -43.44208908081055,
"rps_doc_wikipedia_importance": -30.367074966430664,
"rps_doc_wikipedia_importance_length_correction": -30.367074966430664
},
"fasttext": {
"dclm": 0.9502612352371216,
"english": 0.0013690500054508448,
"fineweb_edu_approx": 1.5056748390197754,
"eai_general_math": 0.003550470108166337,
"eai_open_web_math": 0.949224054813385,
"eai_web_code": 0.7199106812477112
}
}
|
{
"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.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": "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": "10",
"label": "Knowledge Article"
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,315,356,140,374,114,000 |
Modio can help not get banned?
Discussion in 'Xbox 360' started by Soul Syrtic, Feb 5, 2010 with 13 replies and 5,170 views.
Thread Status:
Not open for further replies.
1. Soul Syrtic
Soul Syrtic Enthusiast
Messages:
243
Ratings:
20
Ok I'm assuming that most of you know about a Microsoft employee called "The Pro" (that rhymed) that bans all 9th/10th prestiges even though he doesn't know if they are legit or not. I was wondering if you use modio and use the Profile tool (not sure what it's called) and make it to where if someone reports you it reports a non-existing/fake console keeping you from getting banned. Would this work to where "The Pro"/ M$ cannot ban you at all? Also, I've heard that this doesn't protect your gamertag to be suspended, is that true?
Thanks,
Soul Syrtic
2. STRATEGIZER
STRATEGIZER Getting There
Messages:
1,749
Ratings:
417
if MS are going to ban you, you'll be banned. no two way's about it :thumbdown: FAIL
3. soccerman184
soccerman184 Enthusiast
Messages:
65
Ratings:
4
yeah microsoft probably doesn't report you by sending a report on your profile lol
4. OP
Soul Syrtic
Soul Syrtic Enthusiast
Messages:
243
Ratings:
20
but doesn't it also take the console's id and reset it to all 0's?
5. KiD CuDi
KiD CuDi Enthusiast
Messages:
848
Ratings:
447
No, and it will not work no one is going to outsmart ms they a multimillion corporation. Come on
6. I EAT BABIES
I EAT BABIES Do you own a Johnny West?
Messages:
1,239
Ratings:
149
It does nothing. It is a myth that has been cracked and does nothing.
7. jfleezy15
jfleezy15 Enthusiast
Messages:
314
Ratings:
78
your totally right about no one outsmarting M$. oh wait... what is jtag? FAIL
8. HaVoC UnDeaD
HaVoC UnDeaD Seasoned Member
Messages:
1,338
Ratings:
293
yea i dont think that will work but if you do get banned for being 9th/10th i dont think it will be a permanent ban
9. Mute-
Mute- Contributor
Messages:
3,833
Ratings:
434
I have heard of nulling your ids so it will report a glitched account/fake account and nothing will happen. But no clue if that is even true.
10. xPRIVATEMAIDENx
xPRIVATEMAIDENx Enthusiast
Messages:
152
Ratings:
11
i thot they cant ban you unless they have proof that you hack/modded, so cant you complain to microsoft about it?see if they can do something about it? if we cant,:cursing: the :cursing: pro
11. Guld
Guld Enthusiast
Messages:
207
Ratings:
28
Most you can do is null your ID's for console and profile. But that's about it. This won't prevent M$ but you can not get complaints filed against your ID's because it sends the complaint with the ID of 0000000. Happy modding.
12. FOAMY SQUIRRLE
FOAMY SQUIRRLE Newbie
Messages:
9
Ratings:
0
I tryed using modio. i failed horribly
13. AdReNaLiiNe
AdReNaLiiNe Enthusiast
Messages:
230
Ratings:
41
dude what is with your internet speed :| check mine out compared to yours lol:thumbup:
14. II BurnCo II
II BurnCo II Enthusiast
Messages:
149
Ratings:
13
Share This Page
Thread Status:
Not open for further replies.
|
{
"url": "https://www.se7ensins.com/forums/threads/modio-can-help-not-get-banned.147047/",
"source_domain": "www.se7ensins.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "134533",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VTL3UARD3XH7WRCM7J2G6NZYWHAN65SW",
"WARC-Concurrent-To": "<urn:uuid:83ea7660-88b8-4a2a-9003-fc977f7b5184>",
"WARC-Date": "2018-10-18T09:42:36Z",
"WARC-IP-Address": "192.124.249.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GDKU7BAREKW5CVPR5KNBCMFQ3EIFY3EA",
"WARC-Record-ID": "<urn:uuid:407160f1-5e05-4ab9-9799-f2f4fa75e744>",
"WARC-Target-URI": "https://www.se7ensins.com/forums/threads/modio-can-help-not-get-banned.147047/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f763b6bd-9a62-439d-8881-56c17f3fc9b0>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-93-236-233.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,
33,
34,
128,
129,
144,
174,
191,
192,
219,
220,
234,
242,
255,
262,
801,
802,
803,
815,
831,
837,
854,
855,
885,
886,
900,
910,
923,
931,
1020,
1026,
1044,
1045,
1073,
1074,
1088,
1095,
1108,
1114,
1201,
1207,
1215,
1231,
1232,
1259,
1260,
1274,
1282,
1295,
1302,
1373,
1379,
1393,
1394,
1418,
1419,
1433,
1441,
1454,
1462,
1563,
1569,
1587,
1588,
1631,
1632,
1646,
1656,
1669,
1677,
1751,
1757,
1772,
1773,
1798,
1799,
1813,
1821,
1834,
1841,
1923,
1929,
1947,
1948,
1981,
1982,
1996,
2006,
2019,
2027,
2147,
2153,
2164,
2165,
2187,
2188,
2202,
2212,
2225,
2233,
2379,
2385,
2407,
2408,
2439,
2440,
2454,
2462,
2475,
2482,
2677,
2683,
2694,
2695,
2715,
2716,
2730,
2738,
2751,
2758,
2989,
2995,
3016,
3017,
3043,
3044,
3058,
3064,
3077,
3083,
3126,
3132,
3150,
3151,
3178,
3179,
3193,
3201,
3214,
3221,
3312,
3318,
3337,
3338,
3366,
3367,
3381,
3389,
3402,
3409,
3410,
3426,
3427,
3442
],
"line_end_idx": [
1,
2,
33,
34,
128,
129,
144,
174,
191,
192,
219,
220,
234,
242,
255,
262,
801,
802,
803,
815,
831,
837,
854,
855,
885,
886,
900,
910,
923,
931,
1020,
1026,
1044,
1045,
1073,
1074,
1088,
1095,
1108,
1114,
1201,
1207,
1215,
1231,
1232,
1259,
1260,
1274,
1282,
1295,
1302,
1373,
1379,
1393,
1394,
1418,
1419,
1433,
1441,
1454,
1462,
1563,
1569,
1587,
1588,
1631,
1632,
1646,
1656,
1669,
1677,
1751,
1757,
1772,
1773,
1798,
1799,
1813,
1821,
1834,
1841,
1923,
1929,
1947,
1948,
1981,
1982,
1996,
2006,
2019,
2027,
2147,
2153,
2164,
2165,
2187,
2188,
2202,
2212,
2225,
2233,
2379,
2385,
2407,
2408,
2439,
2440,
2454,
2462,
2475,
2482,
2677,
2683,
2694,
2695,
2715,
2716,
2730,
2738,
2751,
2758,
2989,
2995,
3016,
3017,
3043,
3044,
3058,
3064,
3077,
3083,
3126,
3132,
3150,
3151,
3178,
3179,
3193,
3201,
3214,
3221,
3312,
3318,
3337,
3338,
3366,
3367,
3381,
3389,
3402,
3409,
3410,
3426,
3427,
3442,
3471
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3471,
"ccnet_original_nlines": 155,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34518519043922424,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04592593014240265,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26814815402030945,
"rps_doc_frac_unique_words": 0.4797687828540802,
"rps_doc_mean_word_length": 4.495182991027832,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.0014814799651503563,
"rps_doc_unigram_entropy": 5.164758682250977,
"rps_doc_word_count": 519,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07372482120990753,
"rps_doc_frac_chars_dupe_6grams": 0.07372482120990753,
"rps_doc_frac_chars_dupe_7grams": 0.07372482120990753,
"rps_doc_frac_chars_dupe_8grams": 0.04286326840519905,
"rps_doc_frac_chars_dupe_9grams": 0.04286326840519905,
"rps_doc_frac_chars_top_2gram": 0.06943848729133606,
"rps_doc_frac_chars_top_3gram": 0.0128589803352952,
"rps_doc_frac_chars_top_4gram": 0.016288040205836296,
"rps_doc_books_importance": -254.60443115234375,
"rps_doc_books_importance_length_correction": -254.60443115234375,
"rps_doc_openwebtext_importance": -168.1454315185547,
"rps_doc_openwebtext_importance_length_correction": -168.1454315185547,
"rps_doc_wikipedia_importance": -127.02326965332031,
"rps_doc_wikipedia_importance_length_correction": -127.02326965332031
},
"fasttext": {
"dclm": 0.3581220507621765,
"english": 0.8986632227897644,
"fineweb_edu_approx": 1.1342021226882935,
"eai_general_math": 0.001083369948901236,
"eai_open_web_math": 0.22826272249221802,
"eai_web_code": 0.00025231001200154424
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,075,318,116,052,093,400 |
skip to navigation
skip to content
BinPy 0.3
Virtualizing Electronics
Package Documentation
Latest Version: 0.3.1
It is a library which serves as a base to develop circuit based applications and educational software on top of it. BinPy is a clear representation of fundamentals. Everything has been written from scratch such as gates, logical operations, etc. This package does not depend on any external library other than pure Python. It aims to extend the hardware programming concepts to Python.
How to use
BinPy comes with a console that is a simple wrapper around the classic python console from which you can directly use the BinPy Resources.
To start it, simply issue:
$ binpy
if BinPy is installed in your path.
Documentation
Documentation is available for reference at http://docs.binpy.org
Installation
Linux
Install with pip
sudo apt-get install python-pip setuptools ipython
sudo pip install https://github.com/BinPy/BinPy/zipball/master
Install using git
sudo apt-get install git setuptools ipython
git clone https://github.com/BinPy/BinPy.git
cd BinPy/
sudo python setup.py install
How To Contribute
File Type Py Version Uploaded on Size
BinPy-0.3.linux-x86_64.tar.gz (md5)
built for Linux-3.11.0-18-generic-x86_64-with-glibc2.4
"dumb" binary any 2014-03-16 86KB
BinPy-0.3.tar.gz (md5) Source 2014-03-17 37KB
BinPy-0.3.win-amd64.exe (md5) MS Windows installer any 2014-03-10 305KB
|
{
"url": "https://pypi.python.org/pypi/BinPy/0.3",
"source_domain": "pypi.python.org",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "19211",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AEUW6KEDDAJI7MP5ZGFGETWZQLTPGODT",
"WARC-Concurrent-To": "<urn:uuid:dfd994cd-5468-4bd6-9fde-bac1b34052f7>",
"WARC-Date": "2016-08-28T02:15:41Z",
"WARC-IP-Address": "151.101.20.223",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WPZWY7LGOENHGG7QFUEJKP7T7NTUTGZ5",
"WARC-Record-ID": "<urn:uuid:efd101a7-5cd9-4e15-a9bb-0860a2ef2903>",
"WARC-Target-URI": "https://pypi.python.org/pypi/BinPy/0.3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1800da6-4b89-49c5-b13b-2718cd8ed338>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 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,
19,
35,
36,
46,
47,
72,
73,
95,
96,
118,
119,
505,
506,
517,
518,
657,
658,
685,
686,
694,
695,
731,
732,
746,
747,
813,
814,
827,
828,
834,
835,
852,
853,
904,
967,
968,
986,
987,
1031,
1076,
1086,
1115,
1116,
1134,
1135,
1137,
1175,
1211,
1266,
1300,
1346
],
"line_end_idx": [
19,
35,
36,
46,
47,
72,
73,
95,
96,
118,
119,
505,
506,
517,
518,
657,
658,
685,
686,
694,
695,
731,
732,
746,
747,
813,
814,
827,
828,
834,
835,
852,
853,
904,
967,
968,
986,
987,
1031,
1076,
1086,
1115,
1116,
1134,
1135,
1137,
1175,
1211,
1266,
1300,
1346,
1417
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1417,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20886075496673584,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012658230029046535,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31012657284736633,
"rps_doc_frac_unique_words": 0.6666666865348816,
"rps_doc_mean_word_length": 5.84375,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.647706985473633,
"rps_doc_word_count": 192,
"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.008021390065550804,
"rps_doc_frac_chars_top_3gram": 0.030303029343485832,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -173.25962829589844,
"rps_doc_books_importance_length_correction": -172.5639190673828,
"rps_doc_openwebtext_importance": -91.4686279296875,
"rps_doc_openwebtext_importance_length_correction": -91.4686279296875,
"rps_doc_wikipedia_importance": -69.07726287841797,
"rps_doc_wikipedia_importance_length_correction": -63.75373840332031
},
"fasttext": {
"dclm": 0.018273290246725082,
"english": 0.7363155484199524,
"fineweb_edu_approx": 2.2826759815216064,
"eai_general_math": 0.0825807973742485,
"eai_open_web_math": 0.013670380227267742,
"eai_web_code": 0.0821232795715332
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,703,192,442,288,245,000 |
wiki:Admin/Installation
Version 53 (modified by pferreir, 4 years ago) (diff)
--
Installing Indico
Only v0.97+
0. Before starting
Currently, Indico can only run on mod_python, using the Apache httpd server. Make sure you install them for your operating system (as well as Python, of course), if you don't have them yet. These are the recommended versions:
• Python 2.4+
• Apache httpd 2.2+
• mod_python 3.3+
• setuptools 0.6 - older versions of Python (<=2.4)
Some older versions will probably work, but we cannot guarantee that everything goes fine. Regarding Python, don't hesitate to use 2.5 or 2.6 - we plan to move from 2.4 soon, anyway.
If you're building indico from the development source, please easy_install jstools first.
Since the setup process fetches all the other dependencies automatically, just install libxml2, libxslt (both with Python bindings), PIL and ReportLab manually, and jump to the next section.
This is the complete list of dependencies (if for some reason you need to install them manually):
1. Installing it
There are two options:
• Fetching a release - get it here;
• Checking out a Git tree (development sources);
fetching a release
You can do it using easy_install, a tarball or an egg file, as explained here.
from Git
You should have checked out a cds-indico directory. cd into it and simply do (as root):
# python setup.py install
The setup script will fetch all the dependencies for you and install Indico as a Python EGG in your Python library path.
2. Post-Install script
The next step is to run indico_initial_setup:
# indico_initial_setup
No previous installation of Indico was found.
Please specify a directory prefix:
[/opt/indico]:
and follow the instructions that the script will provide. By default, Indico will be installed under /opt/indico, but the setup script allows you to specify other paths.
By the end of the process, you should have obtained some information on how to start the database:
If you are running ZODB on this host:
- Review etc/zodb.conf and etc/zdctl.conf to make sure everything is ok.
- To start the database run: zdaemon -C etc/zdctl.conf start
As well as some information on the paths:
indico.conf: /opt/indico/etc/indico.conf
BinDir: /opt/indico/bin
DocumentationDir: /opt/indico/doc
ConfigurationDir: /opt/indico/etc
HtdocsDir: /opt/indico/htdocs
3. Configuring Apache
Then you should configure Apache HTTPD, by adding the following lines to your httpd configuration file:
PythonInterpreter main_interpreter
PythonImport MaKaC::setEnvironment main_interpreter
<Directory "/your/htdocs">
AddHandler python-program .py
PythonHandler mod_python.publisher
Allow from All
</Directory>
<Directory "/your/htdocs/services">
SetHandler python-program
PythonHandler MaKaC.services.handler
PythonInterpreter main_interpreter
Allow from All
</Directory>
Alias /indico/images "/your/htdocs/images"
Alias /indico "/your/htdocs"
(/your/htdocs should be the same as HtdocsDir, mentioned above)
Accessing http://localhost/indico/index.py should give you the main Indico page.
4. Indico config file
The next step should be inspecting indico.conf and configuring it to fit your server configuration. indico.conf replaces the old config.xml, so you will have to update it with the paramaters that you already have in your config.xml.
5. Migration
If you are using an existing DB, please read this.
6. Future installations
Once you have succeeded to install Indico for the first time, you can automatize the upgrading process with a single script. This script should basically include the following actions:
$ easy_install indico
$ indico_initial_setup --existing-config=/opt/indico/etc/indico.conf #replace with your path to your indico.conf
# restart apache
/path/to/httpd restart
|
{
"url": "http://indico-software.org/wiki/Admin/Installation?version=53",
"source_domain": "indico-software.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "14707",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M424A6EEE3QU4NRIZV77U3S5732WT35A",
"WARC-Concurrent-To": "<urn:uuid:a826d4d9-0719-4426-a281-e49c1094d4dc>",
"WARC-Date": "2014-08-21T10:08:23Z",
"WARC-IP-Address": "137.138.4.160",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OS5MRBACI7Z5BPH5ZQUUAXFGZRMSFNT4",
"WARC-Record-ID": "<urn:uuid:70385fdb-9a58-4e3b-9347-28b598f8e784>",
"WARC-Target-URI": "http://indico-software.org/wiki/Admin/Installation?version=53",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4c0ad2d-8b4c-4910-a291-0c352de7f5ce>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
24,
25,
79,
80,
83,
84,
102,
103,
115,
116,
135,
136,
362,
363,
379,
401,
421,
475,
476,
659,
660,
750,
751,
942,
943,
1041,
1042,
1059,
1060,
1083,
1084,
1122,
1173,
1174,
1193,
1194,
1273,
1274,
1283,
1284,
1372,
1373,
1399,
1400,
1521,
1522,
1545,
1546,
1592,
1593,
1617,
1663,
1698,
1714,
1715,
1885,
1886,
1985,
1986,
2024,
2098,
2160,
2161,
2203,
2204,
2254,
2255,
2293,
2331,
2369,
2410,
2411,
2433,
2434,
2538,
2539,
2574,
2626,
2627,
2654,
2688,
2727,
2746,
2759,
2760,
2796,
2826,
2867,
2906,
2925,
2938,
2939,
2982,
3011,
3012,
3076,
3077,
3158,
3159,
3181,
3182,
3415,
3416,
3429,
3430,
3481,
3482,
3506,
3507,
3692,
3693,
3715,
3716,
3829,
3830,
3847
],
"line_end_idx": [
24,
25,
79,
80,
83,
84,
102,
103,
115,
116,
135,
136,
362,
363,
379,
401,
421,
475,
476,
659,
660,
750,
751,
942,
943,
1041,
1042,
1059,
1060,
1083,
1084,
1122,
1173,
1174,
1193,
1194,
1273,
1274,
1283,
1284,
1372,
1373,
1399,
1400,
1521,
1522,
1545,
1546,
1592,
1593,
1617,
1663,
1698,
1714,
1715,
1885,
1886,
1985,
1986,
2024,
2098,
2160,
2161,
2203,
2204,
2254,
2255,
2293,
2331,
2369,
2410,
2411,
2433,
2434,
2538,
2539,
2574,
2626,
2627,
2654,
2688,
2727,
2746,
2759,
2760,
2796,
2826,
2867,
2906,
2925,
2938,
2939,
2982,
3011,
3012,
3076,
3077,
3158,
3159,
3181,
3182,
3415,
3416,
3429,
3430,
3481,
3482,
3506,
3507,
3692,
3693,
3715,
3716,
3829,
3830,
3847,
3869
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3869,
"ccnet_original_nlines": 116,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2970922887325287,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007585340179502964,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28445005416870117,
"rps_doc_frac_unique_words": 0.4914933741092682,
"rps_doc_mean_word_length": 5.606805324554443,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.005056890193372965,
"rps_doc_unigram_entropy": 5.17964506149292,
"rps_doc_word_count": 529,
"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.011126100085675716,
"rps_doc_frac_chars_top_3gram": 0.0053944699466228485,
"rps_doc_frac_chars_top_4gram": 0.012137560173869133,
"rps_doc_books_importance": -376.63348388671875,
"rps_doc_books_importance_length_correction": -376.63348388671875,
"rps_doc_openwebtext_importance": -208.9489288330078,
"rps_doc_openwebtext_importance_length_correction": -208.9489288330078,
"rps_doc_wikipedia_importance": -182.5821075439453,
"rps_doc_wikipedia_importance_length_correction": -182.5821075439453
},
"fasttext": {
"dclm": 0.3253345489501953,
"english": 0.8093870878219604,
"fineweb_edu_approx": 2.048722743988037,
"eai_general_math": 0.661449670791626,
"eai_open_web_math": 0.3440936803817749,
"eai_web_code": 0.7156378030776978
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,065,827,351,167,203,000 |
Register for Maths, Science, English, Reasoning Olympiad Exams Register here | Book Free Demo for Live Olympiad Classes here | Check Olympiad Exam Dates here | Buy Practice Papers for IMO, IOM, HEO, IOEL etc here | Login here to participate in all India free mock test on every Saturday
Was this article Helpful?
Decimals
Decimals
science Square
Science Square
What are Decimals? We all come across a lot of numbers which are not integers. So what are they and how can be they represented and what role does this play in mathematics? We will learn about these questions and try to find the relevant answers
A fraction whose denominator is a power of ten and whose numerator is expressed by figures placed to the right of a decimal point is decimal.
In simple words we all know that on dividing the fractions, we get remainder which means that the number cannot be further divided but it’s not true. On further division of number we get decimal values.
• Decimals also have place values like Tenths (1/10), Hundredths (1/100), etc.
Maths class 6 Decimals
Example1: Write the number in decimal form
1. a) 5+10+2/10 b) 4+5+7/10
Solution: a) 2/10 can be written as 0.2
Hence the expression becomes 5+10+0.2 = 15.2
1. b) 7/10 becomes 0.7
Hence the expression becomes 4+5+0.7 = 9.7
• As we know that fractions can be changed to decimals, it is also 100 percent true that decimals can also be changed to their fraction values.
Example 2: Convert the following to its decimal or fraction value:
1. a) 1/2 b) 4.5
Solution: a) 1/2 can be changed to 5/10 by writing its equivalent fraction and hence we can write it as 0.5
1. b) 4.5 can be written as 4+5/10 which will be 40/10+5/10 which will be 45/10 and after reducing we get 9/2 as the fraction.
Hundredths
We all know that 1 m = 100 cm.
And also we can say that 1 cm =1/100 m
Here 1/100 represents a fraction of a meter and hence it will surely have a decimal value which is actually 0.01.
Maths class 6 Decimals
Comparing Decimals
Comparison of decimal values involves few steps which are:
Step 1: Check the whole number.
Step 2: Check the Tenths place
Step 3: Check the Hundredths place
Example 4: Compare the following:
1. a) 45.25 and 14.23 b) 32.52 and 32.56
Solution: a) Here on comparing the whole number 45 and 14 we get that 45.25 > 14.23
1. b) Here both the whole numbers are same therefore we check the tenth place which is 5 in both the cases and hence on checking the hundredth place we get 2 and 6 which means 32.56 > 35.5
Using Decimals
Money:
1 Rupee = 100 Paisa which means
1 Paisa = 1/100 Rupee
Length:
1 m =100 cm
1 cm = 1/100 m
Weight:
1 kg = 1000g
1 g = 1/1000 kg.
Example 5: Rani had Rs. 18.50. She bought one ice-cream for Rs 11.75. How much money does she have now?
Solution: Money with Rani initially = Rs.18.50
Cost of Ice cream = 11.75
Money left = Rs. 18.50 – Rs. 11.75 = Rs. 5.25
Additions and Subtraction of Decimals
The addition and subtraction operations on decimals are exactly same as that of integers. Let’s learn from an example.
Maths class 6 Decimals
Practice Questions
Q1) Rahgav bought vegetables weighing 9 kg. Out of this, 3 kg 500 g is onions, 2 kg 200 g is tomatoes and the rest is Green vegetables. What is the weight of the green vegetables?
Q2) Add the following:
1. a) Rs. 20.45 to Rs. 78.65
2. b) 1m 20 cm to 600cm
3. c) 2kg 30 g to 4kg 200 g
Q3) Nasreen bought 3 m 20 cm cloth for her shirt and 2 m 5 cm cloth for her trouser. Find the total length of cloth bought by her.
Q4) Express in Rupee as decimals
1. a) 45 paisa b) 12 paisa c) 100 paisa d) 30 paisa
Q5) Which is greater?
1. 98 and 1.098
2. 2 or 4.3
3. 23 or 4.22
4. 1 or 9.01
Q6) Write the following in decimal words:
1. 45
2. 62
3. 24
4. 369
Recap
• Every fraction with denominator 10 can be written in decimal notation and vice-versa.
• Every fraction with denominator 100 can be written in decimal notation and vice-versa.
• In the place value table, as we go from left to the right, the multiplying factor becomes 1/10 of the previous factor.
• Every decimal can be written as a fraction.
• Any two decimal numbers can be compared among themselves. The comparison can start with the whole part. If the whole parts are equal then the tenth parts can be compared and so on.
• The place value 1/10 signifies the decimal value 0.1 whereas the place value 1/100 signifies the decimal value 0.01.
Quiz for Decimals
Q.1
Find: 9.0034 + 5.030089=?
a) 14.0033479
b) 14.0033489
c) 14.0033499
d) 14.003369
Q.2
Find the product of 0.25 * 0.025=?
a) 0.00625
b) 0.0625
c) 0.625
d) 0.000625
Q.3
0.7499 lies between?
a) 0.7-0.7299
b) 0.71-0.7599
c) 0.71-0.7490
d) 0.7450-0.7497
Q.4
Which one of the following decimals is the greatest? 0.009935, 0.009859, 0.009939, 0.009981
a) 0.009859
b) 0.009859
c) 0.009939
d) 0.009981
Q.5
The fraction equivalent of 0.238 is __________.
a)
119/500
b)
238/500
c)
119/1000
d)
none of the above
Q.6
Convert: 542gm to kg
a)
5.42Kg
b)
0.0542Kg
c)
0.542Kg
d)
none of the above
Q.7
Convert: 2009 paisa to rupees.
a)
Rs. 2.9
b)
Rs. 200.9
c)
Rs. 2.009
d)
Rs. 20.09
Q.8
Sumit weighed himself on Monday and found he has gained 1 1/4 kg. Earlier his weight was 46 3/8 kg. What was his weight on Monday express in decimals?
a) 47.535
b) 47.625
c) 48.625
d) 48.535
Q.9
Express 6.03 as a mixed fraction.
a) 6 3/100
b) 6 100/3
c) 60 3/10
d) 6 30/100
Q.10
Which one is the smallest of the following decimals? 0.00237, 0.00212, 0.00281, 0.00231
a) 0.00231
b) 0.00237
c) 0.00212
d) 0.00281
Your Score: 0/10
Other Chapters of Class 6
EXPLORE
70%
|
{
"url": "https://maths.olympiadsuccess.com/class-6-decimals",
"source_domain": "maths.olympiadsuccess.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "148035",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3UN6ZK7UTAUVY4AKTMH2NHSXISUM4X4W",
"WARC-Concurrent-To": "<urn:uuid:d61da1d4-8b87-44ae-8a6f-a59caca385ac>",
"WARC-Date": "2021-10-21T17:05:48Z",
"WARC-IP-Address": "104.26.10.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ST7LL5VOZP45CETCKOH2FHKHZKQ5OWDH",
"WARC-Record-ID": "<urn:uuid:7b054dbf-2b3a-4236-afc7-62ab6b3c6f44>",
"WARC-Target-URI": "https://maths.olympiadsuccess.com/class-6-decimals",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b72472e0-d138-4746-b157-327378d65376>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-231\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,
287,
288,
314,
315,
324,
325,
334,
349,
364,
365,
611,
612,
754,
755,
958,
959,
1040,
1041,
1064,
1065,
1108,
1109,
1139,
1140,
1180,
1181,
1226,
1227,
1252,
1253,
1296,
1297,
1443,
1444,
1511,
1512,
1531,
1532,
1640,
1641,
1770,
1771,
1782,
1783,
1814,
1815,
1854,
1855,
1969,
1970,
1993,
1994,
2013,
2014,
2073,
2074,
2106,
2107,
2138,
2139,
2174,
2175,
2209,
2210,
2253,
2254,
2338,
2339,
2530,
2531,
2546,
2547,
2554,
2555,
2587,
2588,
2610,
2611,
2619,
2620,
2632,
2633,
2648,
2649,
2657,
2658,
2671,
2672,
2689,
2690,
2794,
2795,
2842,
2843,
2869,
2870,
2916,
2917,
2955,
2956,
3075,
3076,
3099,
3100,
3119,
3120,
3300,
3301,
3324,
3325,
3356,
3382,
3412,
3413,
3544,
3545,
3578,
3579,
3633,
3634,
3656,
3657,
3675,
3689,
3705,
3720,
3721,
3763,
3764,
3772,
3780,
3788,
3797,
3798,
3804,
3805,
3895,
3986,
3987,
4110,
4158,
4343,
4464,
4465,
4483,
4484,
4488,
4489,
4515,
4516,
4530,
4544,
4558,
4571,
4572,
4576,
4577,
4612,
4613,
4624,
4634,
4643,
4655,
4656,
4660,
4661,
4682,
4683,
4697,
4712,
4727,
4744,
4745,
4749,
4750,
4842,
4843,
4855,
4867,
4879,
4891,
4892,
4896,
4897,
4945,
4946,
4949,
4950,
4958,
4959,
4962,
4963,
4971,
4972,
4975,
4976,
4985,
4986,
4989,
4990,
5008,
5009,
5013,
5014,
5035,
5036,
5039,
5040,
5047,
5048,
5051,
5052,
5061,
5062,
5065,
5066,
5074,
5075,
5078,
5079,
5097,
5098,
5102,
5103,
5134,
5135,
5138,
5139,
5147,
5148,
5151,
5152,
5162,
5163,
5166,
5167,
5177,
5178,
5181,
5182,
5192,
5193,
5197,
5198,
5349,
5350,
5360,
5370,
5380,
5390,
5391,
5395,
5396,
5430,
5431,
5442,
5453,
5464,
5476,
5477,
5482,
5483,
5571,
5572,
5583,
5594,
5605,
5616,
5617,
5634,
5635,
5661,
5662,
5674,
5675
],
"line_end_idx": [
287,
288,
314,
315,
324,
325,
334,
349,
364,
365,
611,
612,
754,
755,
958,
959,
1040,
1041,
1064,
1065,
1108,
1109,
1139,
1140,
1180,
1181,
1226,
1227,
1252,
1253,
1296,
1297,
1443,
1444,
1511,
1512,
1531,
1532,
1640,
1641,
1770,
1771,
1782,
1783,
1814,
1815,
1854,
1855,
1969,
1970,
1993,
1994,
2013,
2014,
2073,
2074,
2106,
2107,
2138,
2139,
2174,
2175,
2209,
2210,
2253,
2254,
2338,
2339,
2530,
2531,
2546,
2547,
2554,
2555,
2587,
2588,
2610,
2611,
2619,
2620,
2632,
2633,
2648,
2649,
2657,
2658,
2671,
2672,
2689,
2690,
2794,
2795,
2842,
2843,
2869,
2870,
2916,
2917,
2955,
2956,
3075,
3076,
3099,
3100,
3119,
3120,
3300,
3301,
3324,
3325,
3356,
3382,
3412,
3413,
3544,
3545,
3578,
3579,
3633,
3634,
3656,
3657,
3675,
3689,
3705,
3720,
3721,
3763,
3764,
3772,
3780,
3788,
3797,
3798,
3804,
3805,
3895,
3986,
3987,
4110,
4158,
4343,
4464,
4465,
4483,
4484,
4488,
4489,
4515,
4516,
4530,
4544,
4558,
4571,
4572,
4576,
4577,
4612,
4613,
4624,
4634,
4643,
4655,
4656,
4660,
4661,
4682,
4683,
4697,
4712,
4727,
4744,
4745,
4749,
4750,
4842,
4843,
4855,
4867,
4879,
4891,
4892,
4896,
4897,
4945,
4946,
4949,
4950,
4958,
4959,
4962,
4963,
4971,
4972,
4975,
4976,
4985,
4986,
4989,
4990,
5008,
5009,
5013,
5014,
5035,
5036,
5039,
5040,
5047,
5048,
5051,
5052,
5061,
5062,
5065,
5066,
5074,
5075,
5078,
5079,
5097,
5098,
5102,
5103,
5134,
5135,
5138,
5139,
5147,
5148,
5151,
5152,
5162,
5163,
5166,
5167,
5177,
5178,
5181,
5182,
5192,
5193,
5197,
5198,
5349,
5350,
5360,
5370,
5380,
5390,
5391,
5395,
5396,
5430,
5431,
5442,
5453,
5464,
5476,
5477,
5482,
5483,
5571,
5572,
5583,
5594,
5605,
5616,
5617,
5634,
5635,
5661,
5662,
5674,
5675,
5678
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5678,
"ccnet_original_nlines": 275,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2842942178249359,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01457918994128704,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45394301414489746,
"rps_doc_frac_unique_words": 0.3731490671634674,
"rps_doc_mean_word_length": 4.054294109344482,
"rps_doc_num_sentences": 167,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.3653669357299805,
"rps_doc_word_count": 1013,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04163622856140137,
"rps_doc_frac_chars_dupe_6grams": 0.020452890545129776,
"rps_doc_frac_chars_dupe_7grams": 0.020452890545129776,
"rps_doc_frac_chars_dupe_8grams": 0.020452890545129776,
"rps_doc_frac_chars_dupe_9grams": 0.020452890545129776,
"rps_doc_frac_chars_top_2gram": 0.012174339964985847,
"rps_doc_frac_chars_top_3gram": 0.014609199948608875,
"rps_doc_frac_chars_top_4gram": 0.01387874037027359,
"rps_doc_books_importance": -719.2567138671875,
"rps_doc_books_importance_length_correction": -719.2567138671875,
"rps_doc_openwebtext_importance": -378.1674499511719,
"rps_doc_openwebtext_importance_length_correction": -378.1674499511719,
"rps_doc_wikipedia_importance": -267.62420654296875,
"rps_doc_wikipedia_importance_length_correction": -267.62420654296875
},
"fasttext": {
"dclm": 0.8382869362831116,
"english": 0.8548295497894287,
"fineweb_edu_approx": 2.971203088760376,
"eai_general_math": 0.9836512804031372,
"eai_open_web_math": 0.684836745262146,
"eai_web_code": 0.021344659850001335
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-770,122,638,830,483,700 |
Python test tasks at technical interview in Cogniance company
Some time ago I was interviewed as python developer to appropriate position in Cogniance company. There were several test tasks:
# 1. get dict keys in descending order by values
from operator import itemgetter
d = {‘aa’: 12, ‘bb’: 32, ‘cc’: -45, ‘dd’: 43}
print [key for key, value in sorted(d.items(), key=itemgetter(1), reverse=True)]
# or
items = d.items()
items.sort(key=itemgetter(1), reverse=True)
# 2. function to calculate sum provided as string like “i1+i2+…+in”
def calculate(str):
return reduce(lambda sum, x: sum + int(x), str.split(‘+’), 0)
“”” 3.
You are given ‘n’ strings w1, w2, ……, wn. Let Si denote the set of strings formed by considering all unique substrings of the string wi. A substring is defined as a contiguous sequence of one or more characters in the string. More information on substrings can be found here. Let ‘S’ = {S1 U S2 U …. Sn} .i.e ‘S’ is a set of strings formed by considering all the unique strings in all sets S1, S2, ….. Sn. You will be given many queries and for each query, you will be given an integer ‘k’. Your task is to output the lexicographically kth smallest string from the set ‘S’.
Input:The first line of input contains a single integer ‘n’, denoting the number of strings. Each of the next ‘n’ lines consists of a string. The string on the ith line (1<=i<=n) is denoted by wi and has a length mi. The next line consists of a single integer ‘q’, denoting the number of queries. Each of the next ‘q’ lines consists of a single integer ‘k’.
Note: The input strings consist only of lowercase english alphabets ‘a’ – ‘z’.
Output:
Output ‘q’ lines, where the ith line consists of a string which is the answer to the ith query. If the input is invalid (‘k’ > |S|), output “INVALID” (quotes for clarity) for that case.
Constraints:
1<=n<=50
1<=mi<=2000
1<=q<=500
1<=k<=1000000000
Sample Input:
2
aab
aac
3
3
8
23
Sample Output:
aab
c
INVALID
Explanation:
For the sample test case, we have 2 strings “aab” and “aac”.
S1 = {“a”, “aa”, “aab”, “ab”, “b”} . These are the 5 unique substrings of “aab”.
S2 = {“a”, “aa”, “aac”, “ac”, “c” } . These are the 5 unique substrings of “aac”.
Now, S = {S1 U S2} = {“a”, “aa”, “aab”, “aac”, “ab”, “ac”, “b”, “c”}. Totally, 8 unique strings are present in the set ‘S’.
The lexicographically 3rd smallest string in ‘S’ is “aab” and the lexicographically 8th smallest string in ‘S’ is “c”. Since there are only 8 distinct substrings, the answer to the last query is “INVALID”.
“””
import sys
def getline():
“”” interface for getting lines from some source
“””
return sys.stdin.readline()
def substrings(str):
“”” generator: all substrings
“””
n_s = len(str)
for start in xrange(n_s):
for end in xrange(start + 1, n_s + 1):
yield str[start:end]
# get input data and construct S
unique_set = set()
n = int(getline())
for i in xrange(n):
for substr in substrings(getline().strip()):
unique_set.add(substr)
S = sorted(unique_set)
# get queries and output result strings for them
for i in xrange(int(getline())):
try:
print S[int(getline()) – 1]
except IndexError:
print ‘INVALID’
Advertisements
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
%d bloggers like this:
|
{
"url": "https://kikudjiro.wordpress.com/2012/02/19/python-test-tasks-at-technical-interview-in-c/",
"source_domain": "kikudjiro.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "69378",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OSVTESSBGTMQ5TDPJPYTEN453ANV6ZTN",
"WARC-Concurrent-To": "<urn:uuid:b4e089fe-3495-4fee-8d6b-1819f16953d4>",
"WARC-Date": "2019-01-23T01:43:58Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:32VVM6CQSWKWRWZDYPNSB3F3D6VM2JIS",
"WARC-Record-ID": "<urn:uuid:e8817c5a-b235-439f-a7e1-c751f4adc54e>",
"WARC-Target-URI": "https://kikudjiro.wordpress.com/2012/02/19/python-test-tasks-at-technical-interview-in-c/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2c8c840-1649-425e-b108-ba0033340de5>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-157-176-71.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,
62,
63,
192,
193,
242,
274,
320,
401,
406,
424,
469,
470,
538,
558,
620,
621,
628,
1202,
1203,
1561,
1562,
1641,
1642,
1650,
1836,
1837,
1850,
1859,
1871,
1881,
1898,
1899,
1913,
1915,
1919,
1923,
1925,
1927,
1929,
1932,
1933,
1948,
1952,
1954,
1962,
1963,
1976,
1977,
2038,
2119,
2202,
2327,
2533,
2534,
2538,
2539,
2550,
2551,
2566,
2615,
2619,
2647,
2648,
2669,
2700,
2705,
2721,
2748,
2789,
2813,
2814,
2847,
2848,
2867,
2886,
2906,
2951,
2976,
2999,
3000,
3049,
3082,
3087,
3117,
3136,
3154,
3155,
3157,
3158,
3173,
3174,
3188,
3189,
3244,
3245,
3264,
3265,
3338,
3339,
3353,
3354,
3421,
3422,
3438,
3439,
3506,
3507,
3522,
3523,
3591,
3592,
3609,
3610
],
"line_end_idx": [
62,
63,
192,
193,
242,
274,
320,
401,
406,
424,
469,
470,
538,
558,
620,
621,
628,
1202,
1203,
1561,
1562,
1641,
1642,
1650,
1836,
1837,
1850,
1859,
1871,
1881,
1898,
1899,
1913,
1915,
1919,
1923,
1925,
1927,
1929,
1932,
1933,
1948,
1952,
1954,
1962,
1963,
1976,
1977,
2038,
2119,
2202,
2327,
2533,
2534,
2538,
2539,
2550,
2551,
2566,
2615,
2619,
2647,
2648,
2669,
2700,
2705,
2721,
2748,
2789,
2813,
2814,
2847,
2848,
2867,
2886,
2906,
2951,
2976,
2999,
3000,
3049,
3082,
3087,
3117,
3136,
3154,
3155,
3157,
3158,
3173,
3174,
3188,
3189,
3244,
3245,
3264,
3265,
3338,
3339,
3353,
3354,
3421,
3422,
3438,
3439,
3506,
3507,
3522,
3523,
3591,
3592,
3609,
3610,
3632
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3632,
"ccnet_original_nlines": 113,
"rps_doc_curly_bracket": 0.0033039599657058716,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2508324086666107,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031076580286026,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34850165247917175,
"rps_doc_frac_unique_words": 0.4482758641242981,
"rps_doc_mean_word_length": 4.651724338531494,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.011098779737949371,
"rps_doc_unigram_entropy": 5.180813312530518,
"rps_doc_word_count": 580,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12157153338193893,
"rps_doc_frac_chars_dupe_6grams": 0.06968124955892563,
"rps_doc_frac_chars_dupe_7grams": 0.04744255170226097,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011119349859654903,
"rps_doc_frac_chars_top_3gram": 0.016308380290865898,
"rps_doc_frac_chars_top_4gram": 0.031134169548749924,
"rps_doc_books_importance": -387.7481384277344,
"rps_doc_books_importance_length_correction": -387.7481384277344,
"rps_doc_openwebtext_importance": -231.73350524902344,
"rps_doc_openwebtext_importance_length_correction": -231.73350524902344,
"rps_doc_wikipedia_importance": -160.66273498535156,
"rps_doc_wikipedia_importance_length_correction": -160.66273498535156
},
"fasttext": {
"dclm": 0.9472944140434265,
"english": 0.7731104493141174,
"fineweb_edu_approx": 2.709348440170288,
"eai_general_math": 0.024428900331258774,
"eai_open_web_math": 0.08011425286531448,
"eai_web_code": 0.0003652599989436567
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
9,170,306,160,590,835,000 |
What is the difference between bounds and frame?
What is the difference between bounds and frame?
Frame is used by the view’s parent view to place it inside the parent view. Bounds is used by the view itself to place it’s own content (like a scroll view does while scrolling).
What is the difference between frames and bounds in Swift?
TLDR: Bounds refers to the views own coordinate system while Frame refers to the views parent coordinate system.
What is frame in Uiview?
Frame A view’s frame ( CGRect ) is the position of its rectangle in the superview ‘s coordinate system. By default it starts at the top left. Bounds A view’s bounds ( CGRect ) expresses a view rectangle in its own coordinate system.
What is a views frame Swift?
A view’s frame specifies the view’s size and its position relative to its superview. Because a view’s size is always specified by its frame, a view is always a rectangle. A CGRect contains the members origin and size. The origin is a structure of type CGPoint and contains two CGFloat properties: x and y.
What is the difference between frame and image?
The question looks innocent enough. A video is a sequence of images (called frames) captured and eventually displayed at a given frequency. However, by stopping at a specific frame of the sequence, a single video frame, i.e. an image, is obtained.
Are bounds origin always zero?
The origins of a bounds is not always zero. Remember I said that the bounds origin is the origin of the view with respect to its own coordinate system, so in the majority of cases, the bounds origin is (0, 0) . But not always. A transform on the view’s coordinate system will affect its origin.
What is multithreading in Swift?
Multithreading can be defined as the process which facilitates the CPU to create and execute concurrent threads. Typically, a CPU performs one operation at a time.
What is the purpose of a keyframe?
To create an action in a digital animation sequence, you first need to define the start and end points for that action. These markers are called keyframes, and they’re used as anchor points for actions in all different types of animation programs, including Adobe After Effects, Animate, and Character Animator.
What is the difference between the transition and frame parameter?
The transition duration defines the amount of time spent interpolating a trace from one state to another (currently limited to scatter traces), while the frame duration defines the total time spent in that state, including time spent transitioning.
How many types of frames are there?
In general, there are two main categories of frame structures, namely the braced frame structure and rigid frame structure.
What is first responder in Xcode?
The first responder is usually the first object in a responder chain to receive an event or action message.
Is Swift synchronous or asynchronous?
Although Swift functions are synchronous by default, we can make them asynchronous by adding one keyword: async . Inside asynchronous functions, we can call other asynchronous functions using a second keyword: await . As a result, you’ll often hear Swift developers talk about async/await as a way of coding.
What is deadlock in Swift?
Deadlock. The word Deadlock refers to a situation in which a set of different threads sharing the same resource are waiting for each other release the resource to finish its tasks. When working with the GCD, if we do not fully understand the GCD’s concepts, we may create a deadlock in our code.
What is the difference between the transition and frame parameter in Plotly?
What are the two types of framing?
Framing can be of two types, fixed sized framing and variable sized framing. Here the size of the frame is fixed and so the frame length acts as delimiter of the frame.
|
{
"url": "https://www.tag-challenge.com/2022/10/10/what-is-the-difference-between-bounds-and-frame/",
"source_domain": "www.tag-challenge.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "49576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SASOVNSVSD3RC3ETGRNJYV6RUJX6KSMH",
"WARC-Concurrent-To": "<urn:uuid:3faf8e9e-2a63-4775-8f63-1250a4d28831>",
"WARC-Date": "2023-03-26T08:41:20Z",
"WARC-IP-Address": "172.67.155.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WX3A3TY3LXDOV4A6MPLNQ3V2QAQMMH2O",
"WARC-Record-ID": "<urn:uuid:15582e0a-2b35-4518-a8d2-8f7ce78e9b9c>",
"WARC-Target-URI": "https://www.tag-challenge.com/2022/10/10/what-is-the-difference-between-bounds-and-frame/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:29ab7862-d98b-4311-bd1e-5d348ab9be13>"
},
"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 ([email protected])\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.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,
49,
50,
99,
100,
279,
280,
339,
340,
453,
454,
479,
480,
713,
714,
743,
744,
1050,
1051,
1099,
1100,
1348,
1349,
1380,
1381,
1676,
1677,
1710,
1711,
1875,
1876,
1911,
1912,
2224,
2225,
2292,
2293,
2542,
2543,
2579,
2580,
2704,
2705,
2739,
2740,
2848,
2849,
2887,
2888,
3197,
3198,
3225,
3226,
3522,
3523,
3600,
3601,
3636,
3637
],
"line_end_idx": [
49,
50,
99,
100,
279,
280,
339,
340,
453,
454,
479,
480,
713,
714,
743,
744,
1050,
1051,
1099,
1100,
1348,
1349,
1380,
1381,
1676,
1677,
1710,
1711,
1875,
1876,
1911,
1912,
2224,
2225,
2292,
2293,
2542,
2543,
2579,
2580,
2704,
2705,
2739,
2740,
2848,
2849,
2887,
2888,
3197,
3198,
3225,
3226,
3522,
3523,
3600,
3601,
3636,
3637,
3805
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3805,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4077025055885315,
"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.13678619265556335,
"rps_doc_frac_unique_words": 0.38810640573501587,
"rps_doc_mean_word_length": 4.7574334144592285,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.844463348388672,
"rps_doc_word_count": 639,
"rps_doc_frac_chars_dupe_10grams": 0.03684211149811745,
"rps_doc_frac_chars_dupe_5grams": 0.0802631601691246,
"rps_doc_frac_chars_dupe_6grams": 0.06315789371728897,
"rps_doc_frac_chars_dupe_7grams": 0.06315789371728897,
"rps_doc_frac_chars_dupe_8grams": 0.06315789371728897,
"rps_doc_frac_chars_dupe_9grams": 0.03684211149811745,
"rps_doc_frac_chars_top_2gram": 0.02368420921266079,
"rps_doc_frac_chars_top_3gram": 0.020723680034279823,
"rps_doc_frac_chars_top_4gram": 0.03750000149011612,
"rps_doc_books_importance": -296.6277160644531,
"rps_doc_books_importance_length_correction": -296.6277160644531,
"rps_doc_openwebtext_importance": -178.38279724121094,
"rps_doc_openwebtext_importance_length_correction": -178.38279724121094,
"rps_doc_wikipedia_importance": -146.81884765625,
"rps_doc_wikipedia_importance_length_correction": -146.81884765625
},
"fasttext": {
"dclm": 0.972747266292572,
"english": 0.9295164346694946,
"fineweb_edu_approx": 3.3453736305236816,
"eai_general_math": 0.9624567627906799,
"eai_open_web_math": 0.36118441820144653,
"eai_web_code": 0.8852113485336304
}
}
|
{
"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": "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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,617,442,349,638,488,000 |
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGravatar Fabrice Fontaine <[email protected]>2020-11-07 19:52:55 +0100
committerGravatar Peter Korsgaard <[email protected]>2020-11-14 10:57:06 +0100
commit2ddc01ee308de2a56d1c2f18f107073772f6213c (patch)
tree594f765290779171ac0e1eaeb6304adade26006e
parent8dc2dcb4c5c090d4862f4ca6ab167902f7b412a8 (diff)
downloadbuildroot-2ddc01ee308de2a56d1c2f18f107073772f6213c.tar.gz
buildroot-2ddc01ee308de2a56d1c2f18f107073772f6213c.tar.bz2
package/slirp: security bump to version 4.3.1
- Use an up to date fork (spice slirp is archived and has not been updated since 2012) - Add COPYRIGHT as the license file - BSD-4-Clause has been replaced by BSD-3-Clause since https://gitlab.freedesktop.org/slirp/libslirp/-/commit/3bac39137a652b24b89d5b9e2a39600619fbe1d3 https://gitlab.freedesktop.org/slirp/libslirp/-/commit/f9f6e69c4e1d9a43af30bfe791b31789ffa04954 - Add hash file - Switch to meson-package - Fix multiple security vulnerabilities: CVE-2014-3640, CVE-2017-11434, CVE-2019-6778, CVE-2019-9824, CVE-2019-14378 and CVE-2020-10756 Signed-off-by: Fabrice Fontaine <[email protected]> Reviewed-by: Alistair Francis <[email protected]> Signed-off-by: Peter Korsgaard <[email protected]> (cherry picked from commit 97fcae8ddf71b02402225ed1b3d0e3d5ea367ed5) Signed-off-by: Peter Korsgaard <[email protected]>
-rw-r--r--package/slirp/Config.in17
-rw-r--r--package/slirp/slirp.hash3
-rw-r--r--package/slirp/slirp.mk20
3 files changed, 16 insertions, 24 deletions
diff --git a/package/slirp/Config.in b/package/slirp/Config.in
index 51dea9700f..8f57c4fa6a 100644
--- a/package/slirp/Config.in
+++ b/package/slirp/Config.in
@@ -1,16 +1,10 @@
config BR2_PACKAGE_SLIRP
bool "slirp"
help
- The Spice project aims to provide a complete open source
- solution for interaction with virtualized desktop devices.
- The Spice project deals with both the virtualized devices
- and the front-end. Interaction between front-end and
- back-end is done using VD-Interfaces.
+ libslirp is a user-mode networking library used by virtual
+ machines, containers or various tools.
- This package implements the slirp-part for Spice. Slirp
- emulates a PPP or SLIP connection over a normal terminal.
-
- http://www.spice-space.org/
+ https://gitlab.freedesktop.org/slirp/libslirp/
NOTE:
This package has some history of a unique kind:
@@ -21,5 +15,6 @@ config BR2_PACKAGE_SLIRP
- during that period, QEMU (Fabrice BELLARD) forked the code
and included it in QEMU
- and it was imported from this breed by the Spice project
- around May 2009
- - which is what we use here
+ around May 2009 which archived it in 2012
+ - So we switched to
+ https://gitlab.freedesktop.org/slirp/libslirp
diff --git a/package/slirp/slirp.hash b/package/slirp/slirp.hash
new file mode 100644
index 0000000000..3051179df9
--- /dev/null
+++ b/package/slirp/slirp.hash
@@ -0,0 +1,3 @@
+# Locally computed:
+sha256 6b1641f04d41bc45f94018ac8d42d3c9f3ba0e463cbeacf5f26fe83fc050161e libslirp-v4.3.1.tar.bz2
+sha256 b28aecf4796a6a22054167f0a976de13d9db335669d37afd2dc7ea4c335e1e13 COPYRIGHT
diff --git a/package/slirp/slirp.mk b/package/slirp/slirp.mk
index 7cfead65e2..4351818952 100644
--- a/package/slirp/slirp.mk
+++ b/package/slirp/slirp.mk
@@ -4,18 +4,12 @@
#
################################################################################
-# There's no tarball releases of slirp, so we use the git repo
-# Also, there's no tag, so we use a random SHA1 (master's HEAD
-# of today)
-SLIRP_VERSION = 8c2da74c1385242f20799fec8c04f8378edc6550
-SLIRP_SITE = git://anongit.freedesktop.org/spice/slirp
-SLIRP_LICENSE = BSD-4-Clause, BSD-2-Clause
-# Note: The license file 'COPYRIGHT' is missing from the sources,
-# although some files refer to it.
+SLIRP_VERSION = 4.3.1
+SLIRP_SOURCE = libslirp-v$(SLIRP_VERSION).tar.bz2
+SLIRP_SITE = \
+ https://gitlab.freedesktop.org/slirp/libslirp/-/archive/v$(SLIRP_VERSION)
+SLIRP_LICENSE = BSD-3-Clause
+SLIRP_LICENSE_FILES = COPYRIGHT
SLIRP_INSTALL_STAGING = YES
-# As we're using the git tree, there's no ./configure,
-# so we need to autoreconf.
-SLIRP_AUTORECONF = YES
-
-$(eval $(autotools-package))
+$(eval $(meson-package))
|
{
"url": "https://git.buildroot.net/buildroot/commit/?h=2020.08.x&id=2ddc01ee308de2a56d1c2f18f107073772f6213c",
"source_domain": "git.buildroot.net",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "14729",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LNUYNTCDNNPDUGCA5SBZBBBQQEXLASVO",
"WARC-Concurrent-To": "<urn:uuid:e9f245ae-8a55-4f3f-be07-38318586d5f8>",
"WARC-Date": "2021-01-21T10:34:22Z",
"WARC-IP-Address": "140.211.167.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RGYXWGKKJTXGAZUA2PBEV6RXI33SKJGU",
"WARC-Record-ID": "<urn:uuid:17cfe29d-a279-49b2-a771-d34b82fdc258>",
"WARC-Target-URI": "https://git.buildroot.net/buildroot/commit/?h=2020.08.x&id=2ddc01ee308de2a56d1c2f18f107073772f6213c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4e4f8b5f-c5c7-491e-b2dc-cd88b60ea51f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
47,
56,
63,
69,
155,
236,
291,
336,
390,
456,
515,
561,
1402,
1438,
1474,
1509,
1554,
1617,
1653,
1683,
1713,
1731,
1756,
1769,
1774,
1833,
1894,
1954,
2009,
2049,
2110,
2151,
2209,
2269,
2271,
2301,
2350,
2356,
2404,
2447,
2508,
2532,
2591,
2609,
2639,
2683,
2705,
2753,
2818,
2839,
2868,
2882,
2913,
2929,
2950,
3047,
3130,
3191,
3227,
3256,
3285,
3303,
3305,
3386,
3450,
3514,
3527,
3585,
3641,
3685,
3752,
3788,
3811,
3862,
3878,
3954,
3984,
4017,
4045,
4101,
4130,
4154,
4156,
4186
],
"line_end_idx": [
34,
47,
56,
63,
69,
155,
236,
291,
336,
390,
456,
515,
561,
1402,
1438,
1474,
1509,
1554,
1617,
1653,
1683,
1713,
1731,
1756,
1769,
1774,
1833,
1894,
1954,
2009,
2049,
2110,
2151,
2209,
2269,
2271,
2301,
2350,
2356,
2404,
2447,
2508,
2532,
2591,
2609,
2639,
2683,
2705,
2753,
2818,
2839,
2868,
2882,
2913,
2929,
2950,
3047,
3130,
3191,
3227,
3256,
3285,
3303,
3305,
3386,
3450,
3514,
3527,
3585,
3641,
3685,
3752,
3788,
3811,
3862,
3878,
3954,
3984,
4017,
4045,
4101,
4130,
4154,
4156,
4186,
4211
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4211,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15572033822536469,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04237287864089012,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45974576473236084,
"rps_doc_frac_unique_words": 0.6229946613311768,
"rps_doc_mean_word_length": 8.657753944396973,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.09427966177463531,
"rps_doc_unigram_entropy": 5.252779483795166,
"rps_doc_word_count": 374,
"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.004941320046782494,
"rps_doc_frac_chars_top_3gram": 0.013897470198571682,
"rps_doc_frac_chars_top_4gram": 0.025941940024495125,
"rps_doc_books_importance": -416.3312072753906,
"rps_doc_books_importance_length_correction": -416.3312072753906,
"rps_doc_openwebtext_importance": -246.51356506347656,
"rps_doc_openwebtext_importance_length_correction": -246.51356506347656,
"rps_doc_wikipedia_importance": -193.4697265625,
"rps_doc_wikipedia_importance_length_correction": -193.4697265625
},
"fasttext": {
"dclm": 0.5922749638557434,
"english": 0.6308487057685852,
"fineweb_edu_approx": 2.4004709720611572,
"eai_general_math": 0.021613959223031998,
"eai_open_web_math": 0.5966265797615051,
"eai_web_code": 0.013328970409929752
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-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": "22",
"label": "Truncated"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-220,127,693,496,241,000 |
Detect obscured window
Hi,
My problem is identical to the one here, partially solved:
–> stackoverflow.com/questions/23550423/high-cpu-usage-when-glfw-opengl-window-isnt-visible
GLFW uses 100% CPU when the gl-window is obscured, either by another window or minimized.
By using glfwSetWindowIconifyCallback, I am able to detect a minimized gl-window and reduce CPU usage, but I unable to do the same when another window covers the gl-window.
… and losing focus, as a trigger, is not an option for me either.
Is there any work-around for this?
Note that it is not GLFW using 100% CPU, but your application.
If you want to only run your game/render loop when an event occurs, you can use glfwWaitEvents() or glfwWaitEventsTimeout().
There isn’t a way to know when your application is obscured, but you can detect if you have input focus. So you could run your render loop freely when you have input focus, and then use glfwWaitEvents() when you don’t.
Here is the relevant issue. You can subscribe to that for progress updates.
https://github.com/glfw/glfw/issues/680
If the issue @elmindreda describes is the one affecting you, I’d implement a soft-vsync using sleep when windowed as a workaround, this works well for me.
@dougbinks
Thank you. Yes some laziness in the description there. In actuality it’s not using 100% either, more like 65%. Using input focus won’t work for the program I’m building, which is more like a “player” (ie VLC) than a video game. I want it to run continuously.
How might I implement soft-vsync? I’m not looking for hand-holding here, just something to start with for trial-and-error.
@elmindreda
Yes that is the issue exactly. I am also using OSX.
I will follow that thread, and the references to “application code” & “NSWindowDidChangeOcclusionStateNotification” are useful in the meantime. Thank you.
The soft approach simply uses usleep.
So you get the current frame time, and calculate (desired_frametime - frametime) then convert to microseconds (multiply by a million) and usleep for that amount of time if it’s a positive value.
|
{
"url": "https://discourse.glfw.org/t/detect-obscured-window/687",
"source_domain": "discourse.glfw.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "27386",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4SDTOAHMJTCD74ETSQ6PCZ2NH7SU7ZVB",
"WARC-Concurrent-To": "<urn:uuid:45580753-745d-4058-a72f-6253b2343201>",
"WARC-Date": "2022-05-19T22:43:29Z",
"WARC-IP-Address": "64.62.250.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S33REXXZUJRL7CZ6OMM57242T5AICGGP",
"WARC-Record-ID": "<urn:uuid:14d518f9-d83b-4b1d-9519-61cb43d45a7b>",
"WARC-Target-URI": "https://discourse.glfw.org/t/detect-obscured-window/687",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab09134c-7ae0-4510-938c-cfb1fd2b553b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-222\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,
23,
24,
28,
87,
179,
180,
270,
443,
509,
510,
545,
546,
609,
610,
735,
736,
955,
956,
1032,
1033,
1073,
1074,
1229,
1230,
1241,
1242,
1501,
1502,
1625,
1626,
1638,
1639,
1691,
1846,
1847,
1885,
1886
],
"line_end_idx": [
23,
24,
28,
87,
179,
180,
270,
443,
509,
510,
545,
546,
609,
610,
735,
736,
955,
956,
1032,
1033,
1073,
1074,
1229,
1230,
1241,
1242,
1501,
1502,
1625,
1626,
1638,
1639,
1691,
1846,
1847,
1885,
1886,
2080
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2080,
"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.39696311950683594,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03470715880393982,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23644252121448517,
"rps_doc_frac_unique_words": 0.5123456716537476,
"rps_doc_mean_word_length": 5.070987701416016,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.002169199986383319,
"rps_doc_unigram_entropy": 4.785608768463135,
"rps_doc_word_count": 324,
"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.01095557026565075,
"rps_doc_frac_chars_top_3gram": 0.014607430435717106,
"rps_doc_frac_chars_top_4gram": 0.02069384977221489,
"rps_doc_books_importance": -212.9126434326172,
"rps_doc_books_importance_length_correction": -212.9126434326172,
"rps_doc_openwebtext_importance": -125.76517486572266,
"rps_doc_openwebtext_importance_length_correction": -125.76517486572266,
"rps_doc_wikipedia_importance": -103.30168151855469,
"rps_doc_wikipedia_importance_length_correction": -103.30168151855469
},
"fasttext": {
"dclm": 0.8371230959892273,
"english": 0.8877995014190674,
"fineweb_edu_approx": 1.8115569353103638,
"eai_general_math": 0.9566704630851746,
"eai_open_web_math": 0.18979549407958984,
"eai_web_code": 0.8906092643737793
}
}
|
{
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,105,589,383,602,989,000 |
Drivers.Tips
Sony Vaio Svt21225Cxb Drivers
Install and download Sony Vaio Svt21225Cxb drivers from the web here to your Windows system so that all of your hardware and peripheral devices will act as your hardware device should act. Drivers are just tiny little files that is entirely composed of computer coded instructions for the CPU to interpret and put into action in order for the PC to utilize the particular device that the driver file belongs to. Without precise drivers installed on the system the device is inoperable and will never work. You have to have the proper files actually installed on your Windows operating system in order to utilize this certain piece of hardware.
Pretty much all hardware devices connected to your computer in one way or another need correct drivers installed on the PC in order for the hardware to be utilized. These devices can be a printer, hard disk drive, camera or other external or internal devices that you can connect to your PC by way of plugging in a cable or simply directly plugging it in to the motherboard.
• BRAND: Sony
• MODEL: Vaio Svt21225Cxb
• SYSTEM TYPE: Personal Computer
• OS: Windows XP, Vista, 7, 8, 10
Because even though each device from the same company is different from one another, there are a lot of different drivers, too. This is the biggest reason why it is a mammoth task to find a specific Sony Vaio Svt21225Cxb driver that you are looking for. For instance, every cell phone made by Samsung has to have a specific driver made just to make it work with a computer. That comes out to many, many driver files only for a specific brand of hardware devices.
Finding and downloading the proper driver may feel like a never-ending experience. Browse these tips in order to make quick work of finding the driver you need.
1. The brand of the device (if it is a built-in device connected to the computer then you just need the brand of the computer)
2. Model number of the device for which you are searching for.
3. The exact type of Windows that is on your computer. (for all types of Windows PCs, right-click on "My Computer" or aka "Computer" and then you should left-click on "Properties". An information panel about your PC should now be open)
4. You need to know if you have a 32-bit or 64-bit operating system. (if your operating system is 64-bit it will be stated in the box that pops up from right-clicking on "My Computer" or aka "Computer" and then left-clicking on "Properties". If 64-bit is not stated then assume 32-bit.)
If you do not want to be searching for hours for a driver, then you MUST know the brand, model and type of device and Windows version that the device is attached to. Once you have accurate info about the model and maker of the device in question you are able to now begin locating Sony Vaio Svt21225Cxb drivers for the device you need so that you can download and then install them correctly on your hard drive.
A good portion of brand name devices and hardware list drivers of their hardware products online for use on their customer computers. A few, but not all device maker's sites are really that easy to find and navigate with any sense of direction. Some brand's websites do not like to think of Joe Consumer and how hard it is attempting to manually install Sony Vaio Svt21225Cxb device drivers on a Windows operating system. A lot of consumers have a hard time figuring out the exact driver they should be looking for and attempting to navigate through the gauntlet of poorly coded websites can be very aggravating.
You can never be too careful when downloading Vaio Svt21225Cxb drivers and files from a site you have never seen before. Try to stick to the manufacturer's website to be safe. Viruses and other malware can make their way into drivers and other common files. Installing a file that you think is a Vaio Svt21225Cxb driver can be a big mistake if you ended up installing a virus. Even the best anti-virus can not stop ALL viruses. This is why we send you directly to the manufacturer's website. The manufacturer's sites are more trusted than anyone else's.
Get SonyVaio Svt21225Cxb Parts style=
After you searched, found and then download the real driver for the device attached to your computer system, you can then install the device onto your Windows system. You may need to uncompress the file after downloading if the file ends with .zip, .7z or .rar. After you do that you are able to install the driver. In some instances when the device driver fails to install you must install the Sony Vaio Svt21225Cxb driver manually.
The best way to install Sony Vaio Svt21225Cxb drivers:
1. On the Windows desktop, Right-click on "My Computer" or "Computer". Left-click on "Manage".
2. When the window opens up then left-click on "Device Manager". You should now see all the devices connected to your computer.
3. Double-click on any yellow exclamation points that you see. Another box will open up.
4. Click on the "Driver" tab near the top of the box.
5. Click on "Update Driver".
6. If asked to locate the driver on your hard drive, point the PC to look where you have downloaded your Sony Vaio Svt21225Cxb driver.
7. After you have finished, a reboot is most likely next.
Get your Sony Vaio Svt21225Cxb driver by following the link below.
Download Sony Vaio Svt21225Cxb Drivers
We make every effort to make sure every link is working as it should.
|
{
"url": "http://www.drivers.tips/Sony/Vaio_Svt21225Cxb/",
"source_domain": "www.drivers.tips",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "9428",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:27DJ3HCPGYKF7AVD3CO3YTVCI33TPQG4",
"WARC-Concurrent-To": "<urn:uuid:5847cc79-f646-4852-82ab-ad4cf2559c87>",
"WARC-Date": "2017-04-27T11:05:25Z",
"WARC-IP-Address": "104.18.56.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:W7IMIPKFALT2WXFQ7QIA4B6JMXTKVIOH",
"WARC-Record-ID": "<urn:uuid:9a251d51-360b-4345-ac09-b3c0cfb479bc>",
"WARC-Target-URI": "http://www.drivers.tips/Sony/Vaio_Svt21225Cxb/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9d35c17-eba8-439c-aa0d-713fff24b6de>"
},
"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,
13,
14,
44,
45,
689,
1064,
1080,
1108,
1143,
1179,
1642,
1803,
1932,
1997,
2235,
2524,
2936,
3549,
4103,
4141,
4142,
4576,
4631,
4728,
4858,
4949,
5005,
5036,
5173,
5233,
5300,
5339
],
"line_end_idx": [
13,
14,
44,
45,
689,
1064,
1080,
1108,
1143,
1179,
1642,
1803,
1932,
1997,
2235,
2524,
2936,
3549,
4103,
4141,
4142,
4576,
4631,
4728,
4858,
4949,
5005,
5036,
5173,
5233,
5300,
5339,
5408
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5408,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4420289993286133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015398549847304821,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14130434393882751,
"rps_doc_frac_unique_words": 0.33438819646835327,
"rps_doc_mean_word_length": 4.52320671081543,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.073200702667236,
"rps_doc_word_count": 948,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06623134016990662,
"rps_doc_frac_chars_dupe_6grams": 0.014925369992852211,
"rps_doc_frac_chars_dupe_7grams": 0.014925369992852211,
"rps_doc_frac_chars_dupe_8grams": 0.014925369992852211,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04547575116157532,
"rps_doc_frac_chars_top_3gram": 0.04430970177054405,
"rps_doc_frac_chars_top_4gram": 0.030317159369587898,
"rps_doc_books_importance": -541.4149169921875,
"rps_doc_books_importance_length_correction": -541.4149169921875,
"rps_doc_openwebtext_importance": -313.8883972167969,
"rps_doc_openwebtext_importance_length_correction": -313.8883972167969,
"rps_doc_wikipedia_importance": -230.11270141601562,
"rps_doc_wikipedia_importance_length_correction": -230.11270141601562
},
"fasttext": {
"dclm": 0.06417697668075562,
"english": 0.9352838397026062,
"fineweb_edu_approx": 1.7151764631271362,
"eai_general_math": 0.0969124436378479,
"eai_open_web_math": 0.20593732595443726,
"eai_web_code": 0.03562397137284279
}
}
|
{
"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.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-597,480,021,280,885,600 |
How to delete a channel from a Git Repository
There are two stages to the process: Hiding the channel so it is no longer available to import, and cleaning up the repo by deleting the project files that the channel was using.
First you should delete the ChannelConfiguration.xml file from the Git repo, this will hide the channel so it no longer shows up in the Import Channels screen.
Next you can delete all the non-shared project files (not shared and other) for the channel. This step is optional, but recommended to keep your repository tidy.
Warning: Do not delete shared or other files if they are still be used by another channel.
If you accidentally delete files for another channel you will not be able to import it (it will give an error about not be able to find file dependencies).
Generic channel deletion process [top]
This process assumes that you are familiar with whatever version of Git you are using.
1. Logon to Git.
2. Hide the channel:
1. Delete the …/<your repo>/Channels/<Iguana channel name with guid>/ChannelConfiguration.xml file.
3. Delete Channel files:
1. Delete all the files in …/<your repo>/<Iguana channel name with guid>/
Delete a Github channel [top]
This process assumes that you are able to logon to Github and find the channel you wish to delete.
1. Logon to Github.
2. Go to your repo.
3. Hide the channel: Delete the …/<your repo>/Channels/<Iguana channel name with guid>/ChannelConfiguration.xml file:
1. For example: your-git-repo/Channels/HL7_Random_Message_Generator_-_copy-88CC981CACF7834C6E27BE7E3BCA7377/ChannelConfiguration.xml
2. Click the Delete (rubbish bin) icon on the right above the code:
3. Scroll to the bottom of the screen (or press the End key on the keyboard).
4. Click the green Commit button to finalize (commit) the delete:
4. Delete non-shared Channel files: Delete all the files in …/<your repo>/<Iguana channel name with guid>/
1. Click on the linked name of the channel you are deleting:
2. This will bring up a list on non-shared files that can safely be deleted:
3. Click on each file individually and delete them using the same “delete then commit” process you used to delete the configuration file.
Delete a Bitbucket channel [top]
This process assumes that you are able to logon to Bitbucket and find the channel you wish to delete.
Follow the same process as for github, above (detailed steps with screenshots coming very soon).
1. Logon to Bitbucket
2. Go to your repo
3. Click Source in the Navigation menu on the left to view the Channels:
4. Hide the channel: Delete the …/<your repo>/Channels/<Iguana channel name with guid>/ChannelConfiguration.xml file
1. For example: your-bitbucket-repo/Channels/LLP_Custom_Client-82D03CFADFD49F690EC69B7FB7EA9D1C/ChannelConfiguration.xml
2. Select the Delete option from the menu on the right above the code:
3. Click the Commit button in the dialog window to finalize (commit) the delete:
5. Delete non-shared Channel files: Delete all the files in …/<your repo>/<Iguana channel name with guid>/:
1. Click Source in the Navigation menu on the left to view the Channels:
2. Click on the linked name of the channel you are deleting:
3. This will bring up a list on non-shared files that can safely be deleted:
4. Click on each file individually and delete them using the same “delete then commit” process you used to delete the configuration file.
Note: Between each file deletion you will need to repeat the first two steps (click Source, then click channel link) to return to the list of non-shared files.
Leave a Reply
|
{
"url": "http://help.interfaceware.com/v6/how-to-delete-a-channel-from-a-git-repository",
"source_domain": "help.interfaceware.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "73116",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H6RDBGHCIAMTFPWTZ4BXFTYEVAQW4QVB",
"WARC-Concurrent-To": "<urn:uuid:d796b669-e175-41bd-b7a0-4b3cad90f667>",
"WARC-Date": "2017-06-28T03:48:20Z",
"WARC-IP-Address": "104.196.200.220",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SDOYRSMKMWNN5EJXHV2YIKOQ4CWA45LX",
"WARC-Record-ID": "<urn:uuid:38674942-9650-4a8c-94e4-fdcb1962975c>",
"WARC-Target-URI": "http://help.interfaceware.com/v6/how-to-delete-a-channel-from-a-git-repository",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a983e06-00c1-4923-94fc-f998a465088f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-81-17.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
46,
47,
226,
227,
387,
388,
550,
551,
642,
643,
799,
800,
839,
840,
927,
928,
947,
970,
1074,
1101,
1180,
1181,
1211,
1212,
1311,
1312,
1334,
1356,
1476,
1613,
1685,
1767,
1837,
1946,
2011,
2092,
2234,
2235,
2268,
2269,
2371,
2372,
2469,
2470,
2472,
2473,
2497,
2518,
2593,
2712,
2837,
2912,
2997,
3107,
3184,
3249,
3330,
3472,
3638,
3639,
3641,
3642
],
"line_end_idx": [
46,
47,
226,
227,
387,
388,
550,
551,
642,
643,
799,
800,
839,
840,
927,
928,
947,
970,
1074,
1101,
1180,
1181,
1211,
1212,
1311,
1312,
1334,
1356,
1476,
1613,
1685,
1767,
1837,
1946,
2011,
2092,
2234,
2235,
2268,
2269,
2371,
2372,
2469,
2470,
2472,
2473,
2497,
2518,
2593,
2712,
2837,
2912,
2997,
3107,
3184,
3249,
3330,
3472,
3638,
3639,
3641,
3642,
3655
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3655,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37383177876472473,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00267023011110723,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22696928679943085,
"rps_doc_frac_unique_words": 0.2824561297893524,
"rps_doc_mean_word_length": 4.9052629470825195,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.008010679855942726,
"rps_doc_unigram_entropy": 4.482203960418701,
"rps_doc_word_count": 570,
"rps_doc_frac_chars_dupe_10grams": 0.38161659240722656,
"rps_doc_frac_chars_dupe_5grams": 0.4878397583961487,
"rps_doc_frac_chars_dupe_6grams": 0.4699570834636688,
"rps_doc_frac_chars_dupe_7grams": 0.4599427878856659,
"rps_doc_frac_chars_dupe_8grams": 0.43240341544151306,
"rps_doc_frac_chars_dupe_9grams": 0.40951359272003174,
"rps_doc_frac_chars_top_2gram": 0.039341919124126434,
"rps_doc_frac_chars_top_3gram": 0.032188840210437775,
"rps_doc_frac_chars_top_4gram": 0.022532189264893532,
"rps_doc_books_importance": -341.73284912109375,
"rps_doc_books_importance_length_correction": -341.73284912109375,
"rps_doc_openwebtext_importance": -201.33175659179688,
"rps_doc_openwebtext_importance_length_correction": -201.33175659179688,
"rps_doc_wikipedia_importance": -185.65872192382812,
"rps_doc_wikipedia_importance_length_correction": -185.65872192382812
},
"fasttext": {
"dclm": 0.2602008581161499,
"english": 0.8957114219665527,
"fineweb_edu_approx": 1.1435660123825073,
"eai_general_math": 0.0881548523902893,
"eai_open_web_math": 0.32569605112075806,
"eai_web_code": 0.019753750413656235
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.135",
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,253,111,160,006,978,000 |
FANDOM
CLOSED WEBSITE
This page is about a website which no longer exists.
Ooskar2
A screenshot of ooskar.com.
ooskar.com
ooskar.com used to be a shock site that showed three old men in a shower doing sexual acts. The song The Fishin' Hole by Andy Griffith played in the background. The video has since been removed from the home page, and the website was shut down by the Sweden police for containing child pornography. However, the video is still accessible and was moved to another page on the website. There is also a variant of the site that used a script which tried to prevent the user from closing the site by displaying alot/infinite alert boxes when clicking the close button.
Ooskar
A screenshot of ooskar.com, before it was completely shut down by the Sweden police.
The website went through some changes. A few months before the website was shut down, the user was presented with a page filled with random yellow text on a red background.
Links
NOTE: The following website contains .
• 1.ooskar.com
• nobrain.dk • Version with the malicious script
• sourmath[dot]com • Exactly the same thing as above
• 5o.dk • Another mirror
• web.archive.org/web/20110202101310/moldymen.com/ • Version with no malicious scripts, but alot of porn ads and the text "Can you spot the mothballs?"
|
{
"url": "http://screamer.wikia.com/wiki/Ooskar.com",
"source_domain": "screamer.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "220638",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S5DXAUYAPY4TCUX7V4B4ISU5G3EKMXOM",
"WARC-Concurrent-To": "<urn:uuid:cf1a6f4e-d4fe-462f-8ded-906a61e4375f>",
"WARC-Date": "2018-03-19T18:25:14Z",
"WARC-IP-Address": "151.101.128.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PCES37QD26QONZ3EQF3AUNRIHAFPJ5HG",
"WARC-Record-ID": "<urn:uuid:bc69e8bf-1e38-447c-a4bf-46c978b8bd54>",
"WARC-Target-URI": "http://screamer.wikia.com/wiki/Ooskar.com",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7a60a5db-0aa8-4b46-b6a7-2b71def825c3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-204-149.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
9,
24,
77,
85,
86,
114,
115,
126,
127,
692,
699,
700,
785,
786,
959,
960,
966,
967,
1006,
1007,
1024,
1075,
1130,
1157
],
"line_end_idx": [
7,
8,
9,
24,
77,
85,
86,
114,
115,
126,
127,
692,
699,
700,
785,
786,
959,
960,
966,
967,
1006,
1007,
1024,
1075,
1130,
1157,
1310
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1310,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 3,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38235294818878174,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025735290721058846,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18014706671237946,
"rps_doc_frac_unique_words": 0.5668202638626099,
"rps_doc_mean_word_length": 4.764976978302002,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.429146766662598,
"rps_doc_word_count": 217,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08123791217803955,
"rps_doc_frac_chars_dupe_6grams": 0.04835589975118637,
"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.03868471831083298,
"rps_doc_frac_chars_top_3gram": 0.025145070627331734,
"rps_doc_frac_chars_top_4gram": 0.042553190141916275,
"rps_doc_books_importance": -124.74655151367188,
"rps_doc_books_importance_length_correction": -124.74655151367188,
"rps_doc_openwebtext_importance": -70.64228057861328,
"rps_doc_openwebtext_importance_length_correction": -70.64228057861328,
"rps_doc_wikipedia_importance": -42.62042999267578,
"rps_doc_wikipedia_importance_length_correction": -42.620399475097656
},
"fasttext": {
"dclm": 0.019534649327397346,
"english": 0.9506271481513977,
"fineweb_edu_approx": 1.5818668603897095,
"eai_general_math": 0.014354709535837173,
"eai_open_web_math": 0.04172921180725098,
"eai_web_code": 0.013786910101771355
}
}
|
{
"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": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"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": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,432,347,679,585,550,000 |
• After 15+ years, we've made a big change: Android Forums is now Early Bird Club. Learn more here.
Help dialing glitch in 2.1 contacts?
tonyv69
Member
May 1, 2010
54
17
kc
ok i just got back from my sprint store, not sure what to do.
heres the issue
problem: step 1. open contacts select a contact
2. press green call button to make the call.
the phone dials the wrong number.
it seems random which number it picks to dial
they were going to reflash my phone to 2.1 again, but on a whim he took out his
moment and tried it, his phone was doing it too...
he asked another rep over to try his phone and it was missdialing as well
when you tap the number it dials correctly
can anyone check their phone to confirm if this is a 2.1 glitch?
I too am getting the same random number dialing. But I don't know if this was happening in earlier versions or not because all my contacts have at least 2 numbers so I have never tried to dial using this method. I have always pressed the number that I want to dial. This really not a problem for me, just "old habit" I guess.
Upvote 0
I can't seem to reproduce this bug...are you talking about the physical green call button or the little green phone icon next to a contacts phone number? Either way, it has called the correct number each time...if everyone else has this bug, I must be doing something wrong when I attempt to reproduce it.
Yeah it seems they are talking about the physical call button. The icons on screen work fine. Doesn't matter if the contact has 1 or several numbers. Pressing the button dials a random number. If the contact has no number listed (just an email address for example) it does nothing. I rarely press that green button so I doubt I ever would have noticed this.
Upvote 0
The Green button is a Redial for the last person that you called.
In Android 1.5the Green button would dial the contact who is selected. In Android 2.1, you have to touch the contact then touch the phone number you want to dial.
I'm not sure if its a bug or an interface change.
I can tell you it has nothing to do with who you have recently called... This has happened twice and both times it was people I don't think I have talked to since I have had my Moment...
Upvote 0
In addition, since upgrade to 2.1, none of the contact numbers with *82 prefix show up in contacts. When I go into edit mode, the *82 prefix numbers are present; they just don't show up when viewing contacts. This is a significant problem, as I need to block my number for most calls, but unblock for others.
Do any of you know a setting fix or workaround? It makes no sense to have to dial these numbers...
Thanks
Upvote 0
In addition, since upgrade to 2.1, none of the contact numbers with *82 prefix show up in contacts. When I go into edit mode, the *82 prefix numbers are present; they just don't show up when viewing contacts. This is a significant problem, as I need to block my number for most calls, but unblock for others.
Do any of you know a setting fix or workaround? It makes no sense to have to dial these numbers...
Thanks
Upvote 0
BEST TECH IN 2023
We've been tracking upcoming products and ranking the best tech since 2007. Thanks for trusting our opinion: we get rewarded through affiliate links that earn us a commission and we invite you to learn more about us.
Smartphones
|
{
"url": "https://forum.earlybird.club/threads/dialing-glitch-in-2-1-contacts.79189/",
"source_domain": "forum.earlybird.club",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "364764",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PSQIRZJKJIUXCTAJSSXA76X7XL5YKNYG",
"WARC-Concurrent-To": "<urn:uuid:91033158-00a8-4d7e-8120-0d0fe770a6a3>",
"WARC-Date": "2024-04-20T01:28:59Z",
"WARC-IP-Address": "157.230.209.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V2M3BKWSGXMIG6CMIONUMPUCFVSRSVLO",
"WARC-Record-ID": "<urn:uuid:388f2477-620b-4655-b49e-bcc72b10a846>",
"WARC-Target-URI": "https://forum.earlybird.club/threads/dialing-glitch-in-2-1-contacts.79189/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:43abc46f-4b25-4f7c-9e37-da7b43b6a811>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-82\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,
102,
103,
140,
141,
149,
150,
157,
169,
172,
175,
178,
240,
256,
304,
349,
383,
429,
509,
560,
634,
677,
678,
743,
745,
1071,
1073,
1082,
1388,
1389,
1747,
1749,
1758,
1824,
1825,
1988,
1989,
2039,
2040,
2227,
2229,
2238,
2547,
2548,
2647,
2648,
2655,
2657,
2666,
2975,
2976,
3075,
3076,
3083,
3085,
3094,
3095,
3113,
3114,
3331,
3332
],
"line_end_idx": [
102,
103,
140,
141,
149,
150,
157,
169,
172,
175,
178,
240,
256,
304,
349,
383,
429,
509,
560,
634,
677,
678,
743,
745,
1071,
1073,
1082,
1388,
1389,
1747,
1749,
1758,
1824,
1825,
1988,
1989,
2039,
2040,
2227,
2229,
2238,
2547,
2548,
2647,
2648,
2655,
2657,
2666,
2975,
2976,
3075,
3076,
3083,
3085,
3094,
3095,
3113,
3114,
3331,
3332,
3343
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3343,
"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.4444444477558136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03252033144235611,
"rps_doc_frac_lines_end_with_ellipsis": 0.06557376682758331,
"rps_doc_frac_no_alph_words": 0.1693766862154007,
"rps_doc_frac_unique_words": 0.4149443507194519,
"rps_doc_mean_word_length": 4.103338718414307,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.009485090151429176,
"rps_doc_unigram_entropy": 5.102325439453125,
"rps_doc_word_count": 629,
"rps_doc_frac_chars_dupe_10grams": 0.2561022937297821,
"rps_doc_frac_chars_dupe_5grams": 0.2561022937297821,
"rps_doc_frac_chars_dupe_6grams": 0.2561022937297821,
"rps_doc_frac_chars_dupe_7grams": 0.2561022937297821,
"rps_doc_frac_chars_dupe_8grams": 0.2561022937297821,
"rps_doc_frac_chars_dupe_9grams": 0.2561022937297821,
"rps_doc_frac_chars_top_2gram": 0.013948080129921436,
"rps_doc_frac_chars_top_3gram": 0.008136380463838577,
"rps_doc_frac_chars_top_4gram": 0.017822550609707832,
"rps_doc_books_importance": -362.6899108886719,
"rps_doc_books_importance_length_correction": -362.6899108886719,
"rps_doc_openwebtext_importance": -195.59791564941406,
"rps_doc_openwebtext_importance_length_correction": -195.59791564941406,
"rps_doc_wikipedia_importance": -99.69578552246094,
"rps_doc_wikipedia_importance_length_correction": -99.69578552246094
},
"fasttext": {
"dclm": 0.0690801665186882,
"english": 0.9712557792663574,
"fineweb_edu_approx": 0.9969967603683472,
"eai_general_math": 0.11066299676895142,
"eai_open_web_math": 0.12503480911254883,
"eai_web_code": 0.07372503727674484
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,903,082,064,296,845,000 |
Filter out 9 of 10 elements in an async stream
I have an async data stream that sends more data than I want to process. Is there an efficient way to toss 9 of 10 elements?
If you really only want to keep one in every ten elements, you could do this trivially with AsyncAlgorithms' chunks(ofCount:) method:
asyncSequence.chunks(ofCount: 10)
.compactMap(\.first)
But why do you want to do this? If the issue is data rate, something like their throttle(...) methods might be more applicable. And if your stream isn't an AsyncSequence then you'll have to either convert it to one or use a different approach entirely.
1 Like
This would be perfect but I'm trying to use the beta CoreHID to get data from an HID device. CoreHID function monitorNotifications returns an AsyncThrowingStream. It conforms to AsyncSequence, so I should be able to use AsyncAlgorithms? I'll check it out.
Thanks for responding!
Throttle works! Thanks.
One question:
Why is it showing up as _throttle, not throttle?
|
{
"url": "https://forums.swift.org/t/filter-out-9-of-10-elements-in-an-async-stream/73511",
"source_domain": "forums.swift.org",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "18795",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D63GL65AK6TPYDFFZVCDH7VU546DA6MU",
"WARC-Concurrent-To": "<urn:uuid:708acf7a-a8e7-4b21-bdea-29c4c1f29e99>",
"WARC-Date": "2024-08-13T01:48:35Z",
"WARC-IP-Address": "184.105.99.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TYD6YZLIXM5CUXN5U5N5FYT6WOXHQXAU",
"WARC-Record-ID": "<urn:uuid:33056b7d-8180-482c-8662-7dde701eae31>",
"WARC-Target-URI": "https://forums.swift.org/t/filter-out-9-of-10-elements-in-an-async-stream/73511",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1d46bfd4-9134-44c2-af44-a049ec434b70>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-252\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,
47,
48,
173,
174,
308,
309,
343,
366,
367,
620,
621,
628,
629,
885,
886,
909,
910,
934,
935,
949
],
"line_end_idx": [
47,
48,
173,
174,
308,
309,
343,
366,
367,
620,
621,
628,
629,
885,
886,
909,
910,
934,
935,
949,
997
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 997,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4396135210990906,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028985509648919106,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19323670864105225,
"rps_doc_frac_unique_words": 0.6121212244033813,
"rps_doc_mean_word_length": 4.7272725105285645,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.004830920137465,
"rps_doc_unigram_entropy": 4.414719581604004,
"rps_doc_word_count": 165,
"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.023076919838786125,
"rps_doc_frac_chars_top_3gram": 0.012820510193705559,
"rps_doc_frac_chars_top_4gram": 0.03333333134651184,
"rps_doc_books_importance": -78.25140380859375,
"rps_doc_books_importance_length_correction": -78.25140380859375,
"rps_doc_openwebtext_importance": -35.267295837402344,
"rps_doc_openwebtext_importance_length_correction": -21.218046188354492,
"rps_doc_wikipedia_importance": -22.24448585510254,
"rps_doc_wikipedia_importance_length_correction": -22.24448585510254
},
"fasttext": {
"dclm": 0.9759088754653931,
"english": 0.9219514727592468,
"fineweb_edu_approx": 2.065232276916504,
"eai_general_math": 0.9497044086456299,
"eai_open_web_math": 0.28258389234542847,
"eai_web_code": 0.9610598683357239
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,184,829,150,724,723,000 |
helpf.pro
Регистрация
v8: Получение данных из ХралищаЗначений
Bell
14.07.2014 17:53Прочитано: 15753
Здравствйте,
Форма Списка справочинка.
Данные в хранилще есть. В элемент они попадают, но при открытии элемента картикнка не видна, что сделал не так.
ДанныеХЗ (ХранилищеЗначений)
ДанныеАдрес (Строка) Реквизит элемента спр.
&НаСервереПроцедура ОбработкаВыбораПодборНаСервере(ВыбранноеЗначение) ТаблицаФайлов = ПолучитьИзВременногоХранилища(ВыбранноеЗначение.АдресХЗ); Для Каждого СтрокаФайл Из ТаблицаФайлов Цикл Файл = Новый Файл(СтрокаФайл.Значение.Имя); ХранимыйФайл = Справочники.ХранилищеДанныхСправочники.СоздатьЭлемент(); ХранимыйФайл.СсылкаНаОбъект = СсылкаНаОбъект; ХранимыйФайл.Наименование = Файл.Имя; ХранимыйФайл.ДанныеПуть = Файл.Путь; ХранимыйФайл.ДанныеТекущаяДата = ТекущаяДата();
// ??? ХранимыйФайл.ДанныеХЗ = Новый ХранилищеЗначения(СтрокаФайл.Значение.Хранение, Новый СжатиеДанных()); ХранимыйФайл.Записать(); КонецЦикла; Элементы.Список.Обновить(); КонецПроцедуры
Yandex
Возможно, вас также заинтересует
Реклама на портале
Bell
14.07.2014 17:57Ответ № 1
Код 1C v 8.3
&НаСервереПроцедура ОбработкаВыбораПодборНаСервере(ВыбранноеЗначение) ТаблицаФайлов = ПолучитьИзВременногоХранилища(ВыбранноеЗначение.АдресХЗ); Для Каждого СтрокаФайл Из ТаблицаФайлов Цикл Файл = Новый Файл(СтрокаФайл.Значение.Имя); ХранимыйФайл = Справочники.ХранилищеДанныхСправочники.СоздатьЭлемент(); ХранимыйФайл.СсылкаНаОбъект = СсылкаНаОбъект; ХранимыйФайл.Наименование = Файл.Имя; ХранимыйФайл.ДанныеПуть = Файл.Путь; ХранимыйФайл.ДанныеТекущаяДата = ТекущаяДата(); ХранимыйФайл.ДанныеХЗ = Новый ХранилищеЗначения(СтрокаФайл.Значение.Хранение, Новый СжатиеДанных()); ХранимыйФайл.Записать(); КонецЦикла; Элементы.Список.Обновить(); КонецПроцедуры
E_Migachev
15.07.2014 00:58Ответ № 2
Как-то у тебя сложно или я чего-то не понял, вообщем так:
Добавление картинки
Код 1C v 8.2 УП
&НаКлиенте
Процедура ДобавитьКартинку(Команда)
ИмяФайла = "";
ПутьФайла = "";
//Вызываем Диалоговое окно и помещаем файл Картинки из локальной файловой системы во временное хранилище
Если ПоместитьФайл(ПутьФайла, , ИмяФайла, Истина) = Истина Тогда
//в строковый реквизит ФОТО нашей формы сохраняем ссылку на Картинку во временном хранилище
Фото = ПутьФайла;
//для создания нового элемента в Справочнике Файлы и записи Картинки в его реквизит Файл
//переходим на сервер с помощью вызова серверной процедуры
УстановитьКартинку();
КонецЕсли;
//условие ЕСЛИ нужно для того, чтобы если пользователь отказался от выбора файла
//мы не вызывали серверную процедуру УстановитьКартинку()
КонецПроцедуры
Действия по установке (загрузке) картинки и ее отображения на форме нашего справочника Сотрудника необходимо выполнять на стороне сервера. Это особенность работы системы с файлами. Именно для этого в тексте процедуры ДобавитьКартинку осуществляется вызов другой процедуры УстановитьКартинку(), которая будет выполняться на сервере.
В программном модуле, ниже процедуры ДобавитьКартинку(Команда) пишем следующий программный код:
Код 1C v 8.2 УП
&НаСервере
Процедура УстановитьКартинку()
//создаем новый элемент в Справочнике Файлы
НовыйФайлКартинки = Справочники.Файлы.СоздатьЭлемент();
//в реквизит СправочникаФайлы Файл помещаем выбранную ранее Картинку
НовыйФайлКартинки.Файл = Новый ХранилищеЗначения(ПолучитьИзВременногоХранилища(Фото));
Фото = ПоместитьВоВременноеХранилище(НовыйФайлКартинки.Файл.Получить());
//записываем новый элемент справочника Файлы
НовыйФайлКартинки.Записать();
//устанавливаем значение реквизита Картинка Справочника Сотрудники
Объект.Картинка = НовыйФайлКартинки.Ссылка;
КонецПроцедуры
Чтобы при открытии картинка отобразилась:
Код 1C v 8.2 УП
&НаСервере
Процедура ПриСозданииНаСервере(Отказ, СтандартнаяОбработка)
//отображение картинки при открытии формы справочника
Фото = ПолучитьНавигационнуюСсылку(Объект.Картинка, "Файл");
//устанавливаем автомасштаб для картинки
Элементы.Фото.РазмерКартинки = РазмерКартинки.АвтоРазмер;
КонецПроцедуры
Bell
15.07.2014 10:13Ответ № 3
1) я в ообщей форме помещаю данные в ХранилищеЗначений. (данные заполнены)
2) При нажатии кпонки на общей форме создаются элементы справочника. Все данные из хранилища заполняются в элементе спр, а вот с картикой проблема. Я сейчас еще разок книгу читану. Где то рядом брожу.(Процедура ОбработкаВыбора)
Bell
15.07.2014 10:19Ответ № 4
&НаСервереПроцедура ОбработкаВыбораПодборНаСервере(ВыбранноеЗначение) ТаблицаФайлов = ПолучитьИзВременногоХранилища(ВыбранноеЗначение.АдресХЗ); Для Каждого СтрокаФайл Из ТаблицаФайлов Цикл Файл = Новый Файл(СтрокаФайл.Значение.Имя); ХранимыйФайл = Справочники.ХранилищеДанныхСправочники.СоздатьЭлемент();
// ????????
.ХранимыйФайл.ДанныеХЗ = Новый ХранилищеЗначения(СтрокаФайл.Значение.Хранение, Новый СжатиеДанных());
КонецЦикла;
КонецПроцедуры;
Bell
15.07.2014 11:48Ответ № 5
Если написать (выбараю 2 картинки)
Сообщить(СтрокаФайл.Значение.Хранение);
Выводит
"e1cib/tempstorage/07d3bf97-8ce4-4205-b9ac-bd9bc076e4b2" Строка
"e1cib/tempstorage/07d3bf97-8ce4-4205-b9ac-bd9bc076e4b3" Строка
Этот алгоритм не отрабатывает..
ХранимыйФайл.ДанныеХЗ = Новый ХранилищеЗначения(СтрокаФайл.Значение.Хранение, Новый СжатиеДанных());
E_Migachev
15.07.2014 14:09Ответ № 6
у тебя обычные формы что ли? то вот https://help1c.com/faq/view/391.html
Bell
16.07.2014 12:19Ответ № 7
Да нет управляемая.
Для того что бы избавиться от модальности я решил передавать данные через хранилище.
Вот алгорит выгрузки из общей формы
Bell
16.07.2014 12:20Ответ № 8
Код 1C v 8.х
&НаКлиентеПроцедура Загрузить() Если НЕ ПроверитьЗаполнение() Тогда Возврат; КонецЕсли; ОчиститьСообщения(); Если СписокФайлов.Количество() = 0 Тогда ТекстСообщения = НСтр("ru='Файлы не выбраны !!!'"); ОбщегоНазначенияКлиентСервер.СообщитьПользователю(ТекстСообщения); Возврат; КонецЕсли; ПомещаемыеФайлы = Новый Массив; Для каждого СтрокаФайл Из СписокФайлов Цикл Описание = Новый ОписаниеПередаваемогоФайла(СтрокаФайл.ПолноеИмяФайла, ""); ПомещаемыеФайлы.Добавить(Описание); КонецЦикла; // ------------------------------------------------------------------------------- ПомещенныеФайлы = Новый Массив; СписокЗагруженныхФайлов = Новый СписокЗначений; Если ПоместитьФайлы(ПомещаемыеФайлы, ПомещенныеФайлы, , Ложь) Тогда Для каждого Файл Из ПомещенныеФайлы Цикл СписокЗагруженныхФайлов.Добавить(Файл); КонецЦикла; Закрыть(Истина); Иначе Сообщение = Новый СообщениеПользователю(); Сообщение.Текст = НСтр("ru = 'Файлы не загружены'", "ru"); Сообщение.Сообщить(); КонецЕсли; // РАНЬШЕ БЫЛО БЕЗ ЭТОГО Все работает // Через хранилище -------------------------------------------------------------------------- // Что бы не было модальных окон //АдресХЗ = ПоместитьВыбранныеФайлыВХранилище(ПомещаемыеФайлы); // Не передает свойства файла АдресХЗ = ПоместитьВыбранныеФайлыВХранилище(СписокЗагруженныхФайлов); Структура = Новый Структура; Структура.Вставить("АдресХЗ",АдресХЗ); ОповеститьОВыборе(Структура); КонецПроцедуры
DJ_Serega
16.07.2014 12:22Ответ № 9
блин... да что с синтаксисом ;( капец какой-то
Bell
16.07.2014 12:22Ответ № 10
Код 1C v 8.2 УП
&НаКлиентеПроцедура Загрузить() Если НЕ ПроверитьЗаполнение() Тогда Возврат; КонецЕсли; ОчиститьСообщения(); Если СписокФайлов.Количество() = 0 Тогда ТекстСообщения = НСтр("ru='Файлы не выбраны !!!'"); ОбщегоНазначенияКлиентСервер.СообщитьПользователю(ТекстСообщения); Возврат; КонецЕсли; ПомещаемыеФайлы = Новый Массив; Для каждого СтрокаФайл Из СписокФайлов Цикл Описание = Новый ОписаниеПередаваемогоФайла(СтрокаФайл.ПолноеИмяФайла, ""); ПомещаемыеФайлы.Добавить(Описание); КонецЦикла; // ------------------------------------------------------------------------------- ПомещенныеФайлы = Новый Массив; СписокЗагруженныхФайлов = Новый СписокЗначений; Если ПоместитьФайлы(ПомещаемыеФайлы, ПомещенныеФайлы, , Ложь) Тогда Для каждого Файл Из ПомещенныеФайлы Цикл СписокЗагруженныхФайлов.Добавить(Файл); КонецЦикла; Закрыть(Истина); Иначе Сообщение = Новый СообщениеПользователю(); Сообщение.Текст = НСтр("ru = 'Файлы не загружены'", "ru"); Сообщение.Сообщить(); КонецЕсли; // РАНЬШЕ БЫЛО БЕЗ ЭТОГО Все работает // Через хранилище -------------------------------------------------------------------------- // Что бы не было модальных окон //АдресХЗ = ПоместитьВыбранныеФайлыВХранилище(ПомещаемыеФайлы); // Не передает свойства файла АдресХЗ = ПоместитьВыбранныеФайлыВХранилище(СписокЗагруженныхФайлов); Структура = Новый Структура; Структура.Вставить("АдресХЗ",АдресХЗ); ОповеститьОВыборе(Структура); КонецПроцедуры
DJ_Serega
16.07.2014 12:22Ответ № 11
E_Migachev, объясни как нужно вставлять ) наверно с видео )
Bell
16.07.2014 12:29Ответ № 12
E_Migachev
16.07.2014 12:48Ответ № 13
(12) да, напишу вечерком
для bell:
в управляемых формах принцип следующий:
Простой пример справочника с картинкой
Отображения картинки текущего элемента списка
В новой версии платформы 1С 8.2 работа с картинками производится отличным от предыдущих платформ методом, разобраться с которым без примеров сложно. Подробно можно прочитать в книге Разработка управляемого интерфейса глава 3.18. Работа с файлами и картинками. Примеры данной статья являются переработанными и дополненными примерами книги.
Картинка как и раньше (8.1) хранится в базе в реквизите (реквизите ТЧ) с типом ХранилищеЗначения, но записать данные в реквизит с этим типом обычном способом нельзя, запись производится в предопределенной процедуре «ПередЗаписьюНаСервере».
Для отображения картинки создается элемент формы поле картинки, данными для которого, является реквизит формы (с типом Строка(0)), содержащий навигационную ссылку на картинку (можно получить функцией «ПолучитьНавигационнуюСсылку») или адрес во временном хранилище (пол.ф. «ПоместитьФайл»)
Ниже приведен код части примера:
Код 1C v 8.2 УП
&НаКлиенте
Процедура ЗагрузитьФотографию(Команда)
Перем ВыбранноеИмя,АдресВременногоХранилища;
Если ПоместитьФайл(АдресВременногоХранилища, "", ВыбранноеИмя, Истина, УникальныйИдентификатор) Тогда
АдресКартинки = АдресВременногоХранилища;
Модифицированность = Истина;
КонецЕсли;
КонецПроцедуры
&НаСервере
Процедура ПередЗаписьюНаСервере(Отказ, ТекущийОбъект, ПараметрыЗаписи)
Если ЭтоАдресВременногоХранилища(АдресКартинки) Тогда
ДвоичныеДанные = ПолучитьИзВременногоХранилища(АдресКартинки);
ТекущийОбъект.Фото = Новый ХранилищеЗначения(ДвоичныеДанные, Новый СжатиеДанных());
КонецЕсли;
КонецПроцедуры
&НаСервере
Процедура ПриЧтенииНаСервере(ТекущийОбъект)
АдресКартинки = ПолучитьНавигационнуюСсылку(ТекущийОбъект.Ссылка, "Фото");
КонецПроцедуры
&НаСервере
Процедура ПриЗаписиНаСервере(Отказ, ТекущийОбъект, ПараметрыЗаписи)
Если ЭтоАдресВременногоХранилища(АдресКартинки) Тогда
УдалитьИзВременногоХранилища(АдресКартинки);
КонецЕсли;
АдресКартинки = ПолучитьНавигационнуюСсылку(ТекущийОбъект.Ссылка, "Фото");
КонецПроцедуры
В книге Разработка управляемого интерфейса используется дополнительно поле для сохранения имени файла оно необходимо если нужно чтобы программа запомнила из какой папки пользователь предпочитает добавлять или выгружать файлы.
В процедуре ПриЗаписиНаСервере на первый взгляд можно убрать код удаление из временного хранилища т.к. ф. ПоместитьФайл вызывается с параметром УникальныйИдентификатор формы т.е. объект хранилища будет существовать до закрытия формы, но рекумендуется освобождать ресурсы сразу (если пользователь загрузит картинку и нажмет записать, форма не закрыта и объект будет существовать до закрытия).
Bell
22.07.2014 13:54Ответ № 14
СФ файл
E_Migachev
23.07.2014 01:41Ответ № 15
скачал, посмотрю
E_Migachev
24.07.2014 00:22Ответ № 16
Пока разбирался - написал по твоему CF статейку: https://help1c.com/faq/view/1562.html
Что изменил:
В общей форме
Код 1C v 8.3
&НаКлиенте
Процедура Загрузить()
Если НЕ ПроверитьЗаполнение() Тогда
Возврат;
КонецЕсли;
ОчиститьСообщения();
Если СписокФайлов.Количество() = 0 Тогда
Сообщить("Файлы не выбраны !!!'");
Возврат;
КонецЕсли;
ПомещаемыеФайлы = Новый Массив;
Для каждого СтрокаФайл Из СписокФайлов Цикл
Описание = Новый ОписаниеПередаваемогоФайла(СтрокаФайл.ПолноеИмяФайла, "");
ПомещаемыеФайлы.Добавить(Описание);
КонецЦикла;
// -------------------------------------------------------------------------------
ПомещенныеФайлы = Новый Массив;
СписокЗагруженныхФайлов = Новый СписокЗначений;
Если ПоместитьФайлы(ПомещаемыеФайлы, ПомещенныеФайлы, , Ложь, УникальныйИдентификатор) Тогда
Закрыть(Истина);
Иначе
Сообщение = Новый СообщениеПользователю();
Сообщение.Текст = НСтр("ru = 'Файлы не загружены'", "ru");
Сообщение.Сообщить();
КонецЕсли;
ОповеститьОВыборе(ПомещенныеФайлы);
КонецПроцедуры
и в доп форме:
Код 1C v 8.3
&НаСервере
Процедура ОбработкаВыбораПодборНаСервере(ВыбранноеЗначение)
Для Каждого СтрокаФайл Из ВыбранноеЗначение Цикл
Файл = Новый Файл(СтрокаФайл.Имя);
ХранимыйФайл = Справочники.ХранилищеДанныхСправочники.СоздатьЭлемент();
ХранимыйФайл.Наименование = Файл.Имя;
ХранимыйФайл.ДанныеПуть = Файл.Путь;
ХранимыйФайл.ДанныеТекущаяДата = ТекущаяДата();
ХранимыйФайл.ДанныеХЗ = Новый ХранилищеЗначения(ПолучитьИзВременногоХранилища(СтрокаФайл.Хранение), Новый СжатиеДанных());
ХранимыйФайл.Записать();
КонецЦикла;
Элементы.Список.Обновить();
КонецПроцедуры
результат в DT
Скачать DT - Платформа 8.3.4
DJ_Serega
24.07.2014 10:38Ответ № 17
(16) только по ссылке 404 ;)
Bell
24.07.2014 10:54Ответ № 18
СПАСИБО. Не обратил внимания на то что ПоместитьФайлы помещает во временное хранилище
E_Migachev
24.07.2014 11:22Ответ № 19
(17) охх ) не правильно вставил ссылку, поздно уже было ) вот Загрузка картинок в базу 1С (сохранение в хранилище значений)
и статья П. Чистова на эту тему Работа с изображениями (картинками) в интерфейсе Такси
DJ_Serega
24.07.2014 12:49Ответ № 20
(19) аналогично =)
Подсказка: Для редактирования своего ответа щелкните по значку (справа)
Вы не можете отправить комментарий анонимно, пожалуйста войдите или зарегистрируйтесь.
|
{
"url": "https://helpf.pro/help/view/14551.html",
"source_domain": "helpf.pro",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "66836",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QXV3UJZ4YFIEPGXYPPBXWGUIN26JAUYB",
"WARC-Concurrent-To": "<urn:uuid:1797f3dc-7a5f-4130-83b8-e9ec5ce56b54>",
"WARC-Date": "2020-10-27T18:54:32Z",
"WARC-IP-Address": "193.200.74.220",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DNZ7JD2XAUQBVVZQQOM5DOG3JFVMDPX3",
"WARC-Record-ID": "<urn:uuid:04727e5a-d235-49cd-bb81-0da8d0920775>",
"WARC-Target-URI": "https://helpf.pro/help/view/14551.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4cd6c5a3-5284-4384-ada7-658946af0ffb>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-50.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,
10,
22,
23,
63,
64,
69,
102,
103,
116,
142,
143,
255,
256,
285,
286,
330,
331,
805,
806,
994,
995,
1002,
1035,
1054,
1059,
1085,
1098,
1855,
1866,
1892,
1893,
1951,
1952,
1972,
1973,
1989,
2001,
2037,
2052,
2068,
2173,
2238,
2240,
2332,
2350,
2439,
2498,
2520,
2532,
2613,
2671,
2686,
2687,
3019,
3020,
3116,
3117,
3133,
3145,
3176,
3220,
3276,
3345,
3432,
3505,
3550,
3580,
3647,
3691,
3706,
3707,
3749,
3750,
3766,
3778,
3838,
3892,
3953,
3994,
4052,
4067,
4072,
4098,
4099,
4174,
4175,
4404,
4405,
4410,
4436,
4437,
4757,
4758,
4770,
4771,
4879,
4880,
4892,
4893,
4909,
4910,
4915,
4941,
4942,
4978,
4979,
5019,
5020,
5029,
5030,
5096,
5097,
5163,
5164,
5196,
5197,
5298,
5299,
5310,
5336,
5337,
5410,
5411,
5416,
5442,
5443,
5463,
5464,
5549,
5550,
5586,
5587,
5592,
5618,
5631,
7087,
7097,
7123,
7124,
7171,
7172,
7177,
7204,
7220,
8676,
8686,
8713,
8714,
8774,
8775,
8780,
8807,
8808,
8819,
8846,
8847,
8872,
8873,
8883,
8884,
8924,
8925,
8964,
8965,
9011,
9012,
9351,
9352,
9592,
9593,
9882,
9883,
9916,
9917,
9933,
9945,
9946,
9985,
10030,
10132,
10174,
10203,
10214,
10229,
10230,
10241,
10312,
10366,
10429,
10513,
10524,
10539,
10540,
10551,
10595,
10670,
10685,
10686,
10697,
10765,
10819,
10864,
10875,
10876,
10951,
10966,
10967,
11193,
11194,
11586,
11587,
11592,
11619,
11620,
11628,
11629,
11640,
11667,
11668,
11685,
11686,
11697,
11724,
11725,
11812,
11813,
11814,
11827,
11828,
11842,
11843,
11856,
11868,
11890,
11891,
11927,
11936,
11947,
11948,
11969,
12010,
12045,
12054,
12065,
12066,
12098,
12142,
12218,
12254,
12266,
12267,
12350,
12390,
12438,
12439,
12532,
12533,
12550,
12551,
12557,
12558,
12601,
12660,
12682,
12683,
12694,
12695,
12731,
12732,
12747,
12748,
12763,
12764,
12777,
12790,
12850,
12851,
12900,
12935,
13007,
13066,
13126,
13190,
13313,
13340,
13352,
13353,
13381,
13382,
13399,
13400,
13415,
13416,
13445,
13446,
13456,
13483,
13484,
13513,
13514,
13519,
13546,
13547,
13633,
13634,
13645,
13672,
13673,
13798,
13799,
13886,
13887,
13897,
13924,
13925,
13944,
13945,
14017
],
"line_end_idx": [
10,
22,
23,
63,
64,
69,
102,
103,
116,
142,
143,
255,
256,
285,
286,
330,
331,
805,
806,
994,
995,
1002,
1035,
1054,
1059,
1085,
1098,
1855,
1866,
1892,
1893,
1951,
1952,
1972,
1973,
1989,
2001,
2037,
2052,
2068,
2173,
2238,
2240,
2332,
2350,
2439,
2498,
2520,
2532,
2613,
2671,
2686,
2687,
3019,
3020,
3116,
3117,
3133,
3145,
3176,
3220,
3276,
3345,
3432,
3505,
3550,
3580,
3647,
3691,
3706,
3707,
3749,
3750,
3766,
3778,
3838,
3892,
3953,
3994,
4052,
4067,
4072,
4098,
4099,
4174,
4175,
4404,
4405,
4410,
4436,
4437,
4757,
4758,
4770,
4771,
4879,
4880,
4892,
4893,
4909,
4910,
4915,
4941,
4942,
4978,
4979,
5019,
5020,
5029,
5030,
5096,
5097,
5163,
5164,
5196,
5197,
5298,
5299,
5310,
5336,
5337,
5410,
5411,
5416,
5442,
5443,
5463,
5464,
5549,
5550,
5586,
5587,
5592,
5618,
5631,
7087,
7097,
7123,
7124,
7171,
7172,
7177,
7204,
7220,
8676,
8686,
8713,
8714,
8774,
8775,
8780,
8807,
8808,
8819,
8846,
8847,
8872,
8873,
8883,
8884,
8924,
8925,
8964,
8965,
9011,
9012,
9351,
9352,
9592,
9593,
9882,
9883,
9916,
9917,
9933,
9945,
9946,
9985,
10030,
10132,
10174,
10203,
10214,
10229,
10230,
10241,
10312,
10366,
10429,
10513,
10524,
10539,
10540,
10551,
10595,
10670,
10685,
10686,
10697,
10765,
10819,
10864,
10875,
10876,
10951,
10966,
10967,
11193,
11194,
11586,
11587,
11592,
11619,
11620,
11628,
11629,
11640,
11667,
11668,
11685,
11686,
11697,
11724,
11725,
11812,
11813,
11814,
11827,
11828,
11842,
11843,
11856,
11868,
11890,
11891,
11927,
11936,
11947,
11948,
11969,
12010,
12045,
12054,
12065,
12066,
12098,
12142,
12218,
12254,
12266,
12267,
12350,
12390,
12438,
12439,
12532,
12533,
12550,
12551,
12557,
12558,
12601,
12660,
12682,
12683,
12694,
12695,
12731,
12732,
12747,
12748,
12763,
12764,
12777,
12790,
12850,
12851,
12900,
12935,
13007,
13066,
13126,
13190,
13313,
13340,
13352,
13353,
13381,
13382,
13399,
13400,
13415,
13416,
13445,
13446,
13456,
13483,
13484,
13513,
13514,
13519,
13546,
13547,
13633,
13634,
13645,
13672,
13673,
13798,
13799,
13886,
13887,
13897,
13924,
13925,
13944,
13945,
14017,
14103
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14103,
"ccnet_original_nlines": 318,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.004891059827059507,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019119609147310257,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9644286036491394,
"rps_doc_frac_unique_words": 0.44408687949180603,
"rps_doc_mean_word_length": 9.06918716430664,
"rps_doc_num_sentences": 196,
"rps_doc_symbol_to_word_ratio": 0.0004446399980224669,
"rps_doc_unigram_entropy": 5.832014083862305,
"rps_doc_word_count": 1243,
"rps_doc_frac_chars_dupe_10grams": 0.36893463134765625,
"rps_doc_frac_chars_dupe_5grams": 0.4385700225830078,
"rps_doc_frac_chars_dupe_6grams": 0.398651659488678,
"rps_doc_frac_chars_dupe_7grams": 0.39102280139923096,
"rps_doc_frac_chars_dupe_8grams": 0.3810875415802002,
"rps_doc_frac_chars_dupe_9grams": 0.36893463134765625,
"rps_doc_frac_chars_top_2gram": 0.007983679883182049,
"rps_doc_frac_chars_top_3gram": 0.004790210165083408,
"rps_doc_frac_chars_top_4gram": 0.01428190991282463,
"rps_doc_books_importance": -975.9290161132812,
"rps_doc_books_importance_length_correction": -975.9290161132812,
"rps_doc_openwebtext_importance": -610.70703125,
"rps_doc_openwebtext_importance_length_correction": -610.70703125,
"rps_doc_wikipedia_importance": -572.8749389648438,
"rps_doc_wikipedia_importance_length_correction": -572.8749389648438
},
"fasttext": {
"dclm": 0.9500308632850647,
"english": 0.00001556999995955266,
"fineweb_edu_approx": 3.469137191772461,
"eai_general_math": 0.00008309000259032473,
"eai_open_web_math": 0.27486270666122437,
"eai_web_code": 0.4195559620857239
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,404,005,276,827,816,000 |
Eduardo Santos Eduardo Santos - 1 year ago 90
PHP Question
Array shuffle repeating values
I have this code that make a query on a table and then do an insert in another insert a field with random integer value, but it is repeating when I have many records.
Code:
$d = connection::select(select * from tabela1);
foreach ($d as $reg) {
$c1 = $reg['c1'];
$c2 = $reg['c2'];
$c3 = $reg['c3'];
$count = count($reg);
$numbers = range(1, $count- 1);
srand((float) microtime() * 10000000);
shuffle($numbers);
foreach ($numbers as $number) {
}
connection::exec("insert into table2 (c1,c2,c3,seq)values('$c1','$c2','$c3',$number)");
}
Answer Source
You should create the array of random numbers outside the main foreach loop. Then just use one element of the array for each insert. This way you won't ever get any duplicates.
$d = connection::select("select * from tabela1");
$rows = $d->fetchAll();
$count = count($rows);
$numbers = range(1, $count);
srand((float) microtime() * 10000000);
shuffle($numbers);
foreach ($rows as $i => $reg) {
$number = $numbers[$i];
$c1 = $reg['c1'];
$c2 = $reg['c2'];
$c3 = $reg['c3'];
connection::exec("insert into table2 (c1,c2,c3,seq)values('$c1','$c2','$c3',$number)");
}
Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download
|
{
"url": "https://codedump.io/share/znFVap0Y3css/1/array-shuffle-repeating-values",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "42566",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y72AQUYKT37MCBINY2ALPLWEEBLCI3QJ",
"WARC-Concurrent-To": "<urn:uuid:5d575034-440b-4045-8845-d309e54f6cbc>",
"WARC-Date": "2018-05-23T10:59:14Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KF6QZB2TIDHDUZGLAWPEZ2U5CGJOEMYE",
"WARC-Record-ID": "<urn:uuid:398a0cff-c572-44f5-8024-0416a73ead3b>",
"WARC-Target-URI": "https://codedump.io/share/znFVap0Y3css/1/array-shuffle-repeating-values",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:954c6d5f-a9e2-440c-97a0-77613d0a8984>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-188-198.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,
46,
59,
60,
91,
92,
259,
260,
266,
267,
315,
316,
339,
340,
358,
376,
394,
395,
417,
418,
450,
489,
508,
540,
541,
543,
544,
632,
634,
635,
649,
650,
827,
828,
878,
902,
925,
954,
993,
1012,
1044,
1072,
1094,
1116,
1138,
1230,
1232
],
"line_end_idx": [
46,
59,
60,
91,
92,
259,
260,
266,
267,
315,
316,
339,
340,
358,
376,
394,
395,
417,
418,
450,
489,
508,
540,
541,
543,
544,
632,
634,
635,
649,
650,
827,
828,
878,
902,
925,
954,
993,
1012,
1044,
1072,
1094,
1116,
1138,
1230,
1232,
1333
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1333,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0.0045011299662292,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16470588743686676,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008823529817163944,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4264705777168274,
"rps_doc_frac_unique_words": 0.6397515535354614,
"rps_doc_mean_word_length": 5.5714287757873535,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.517871856689453,
"rps_doc_word_count": 161,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1538461446762085,
"rps_doc_frac_chars_dupe_6grams": 0.046822741627693176,
"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.028985509648919106,
"rps_doc_frac_chars_top_3gram": 0.06020066887140274,
"rps_doc_frac_chars_top_4gram": 0.07580824941396713,
"rps_doc_books_importance": -183.7197265625,
"rps_doc_books_importance_length_correction": -183.7197265625,
"rps_doc_openwebtext_importance": -106.38509368896484,
"rps_doc_openwebtext_importance_length_correction": -106.38509368896484,
"rps_doc_wikipedia_importance": -59.18964767456055,
"rps_doc_wikipedia_importance_length_correction": -59.18772888183594
},
"fasttext": {
"dclm": 0.9902889132499695,
"english": 0.6683011651039124,
"fineweb_edu_approx": 3.1740152835845947,
"eai_general_math": 0.6156290173530579,
"eai_open_web_math": 0.1920487880706787,
"eai_web_code": 0.007599890232086182
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,171,442,357,995,500,000 |
Solved thread
This post is marked as solved. If you think the information contained on this thread must be part of the official documentation, please contribute submitting a pull request to its repository.
Add PHP function to Volt
Hello, i want to use PHP's strtotime function on volt. I followed the tutorial and include the following code in the services.php file:
$view = new View();
$volt = new Volt($view, $di);
$compiler = $volt->getCompiler();
$compiler->addFunction('strtotime', 'strtotime');
But, when i tried it, it says strtotime is undefined. Is there a specific place where i need to put those code or there's something else ?
6.3k
Accepted
answer
Try adding volt to the di
$di['volt'] = $volt;
3.8k
It works. Thanks :D
|
{
"url": "https://forum.phalconphp.com/discussion/6844/add-php-function-to-volt",
"source_domain": "forum.phalconphp.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "19108",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PWX2NQZ4XD7DOE6XNUWI3IGPESWBGFA2",
"WARC-Concurrent-To": "<urn:uuid:e25dbd57-194a-4d56-a84e-107ab508d962>",
"WARC-Date": "2018-03-20T11:23:19Z",
"WARC-IP-Address": "104.27.166.231",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LPOMKKBS4CWE4RHWCPGGURTUBG5LNDHD",
"WARC-Record-ID": "<urn:uuid:d1afeb31-94ca-445a-b19a-34b6b91b7b0d>",
"WARC-Target-URI": "https://forum.phalconphp.com/discussion/6844/add-php-function-to-volt",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:072a67e0-e84e-41f1-84bf-633136e39533>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-230-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
14,
15,
207,
208,
233,
234,
370,
371,
391,
421,
455,
505,
506,
645,
646,
647,
648,
653,
662,
669,
670,
696,
697,
718,
719,
720,
725,
726
],
"line_end_idx": [
14,
15,
207,
208,
233,
234,
370,
371,
391,
421,
455,
505,
506,
645,
646,
647,
648,
653,
662,
669,
670,
696,
697,
718,
719,
720,
725,
726,
745
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 745,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31137725710868835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023952100425958633,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.269461065530777,
"rps_doc_frac_unique_words": 0.719298243522644,
"rps_doc_mean_word_length": 4.885964870452881,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.24373722076416,
"rps_doc_word_count": 114,
"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,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -70.75248718261719,
"rps_doc_books_importance_length_correction": -70.75263977050781,
"rps_doc_openwebtext_importance": -42.62644577026367,
"rps_doc_openwebtext_importance_length_correction": -42.6265983581543,
"rps_doc_wikipedia_importance": -39.24094009399414,
"rps_doc_wikipedia_importance_length_correction": -39.2410888671875
},
"fasttext": {
"dclm": 0.5807314515113831,
"english": 0.8424675464630127,
"fineweb_edu_approx": 2.626248836517334,
"eai_general_math": 0.6343042254447937,
"eai_open_web_math": 0.1545979380607605,
"eai_web_code": 0.18973815441131592
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,563,152,306,405,823,500 |
澳门威利斯人_威利斯人娱乐「手机版」
来自 网络资讯 2020-05-01 05:34 的文章
当前位置: 澳门威利斯人 > 网络资讯 > 正文
官方文档翻译
Most of the things you might want to do visually are donewith view objects—instances of the UIView class.A view object defines a rectangular region on the screen and handles thedrawing and touch events in that region. A view can also act as a parent forother views and coordinate the placement and sizing of those views. TheUIViewclass does most of thework in managing these relationships between views, but you can also customizethe default behavior as needed.
brief
Windows do not have any visible content themselves but provide a basic container for your application’s views
Views are responsible for
• drawing content
• Drawing involves using graphics technologies such as Core Graphics, OpenGL ES, or UIKit to draw shapes, images, and text inside a view’s rectangular area
• handling multitouch events
• A view responds to touch events in its rectangular area either by using gesture recognizers or by handling touch events directly
• managing the layout of any subviews.
• In the view hierarchy, parent views are responsible for positioning and sizing their child views and can do so dynamically
非常多你或然想要做的可视化是由视图对象达成的——及UIView类的实例。视图对象在荧屏上定义了一个矩形区域，并在该区域内部管理理绘图和触摸事件。视图也足以当做其余视图的父视图，并为这一个视图定位和定尺寸。UIView类的大多做事是管制这一个视图间关系，你也足以依附必要自定义暗中同意行为。
view Architecture
Views work in conjunction with Core Animation layers to handle the rendering and animating of a view’s content. Every view in UIKit is backed by a layer object (usually an instance of the CALayer class), which manages the backing store for the view and handles view-related animations. Most operations you perform should be through the UIView interface. However, in situations where you need more control over the rendering or animation behavior of your view, you can perform operations through its layer instead.
Every view has a corresponding layer object that can be accessed from that view’s layer property. (Because a bar button item is not a view, you cannot access its layer directly.) Behind those layer objects are Core Animation rendering objects and ultimately the hardware buffers used to manage the actual bits on the screen
图片 1
view-layer
The use of Core Animation layer objects has important implications for performance. The actual drawing code of a view object is called as little as possible, and when the code is called, the results are cached by Core Animation and reused as much as possible later. Reusing already-rendered content eliminates the expensive drawing cycle usually needed to update views. Reuse of this content is especially important during animations, where the existing content can be manipulated. Such reuse is much less expensive than creating new content.
Views work in conjunction with Core Animation layers tohandle the rendering and animating of a view’s content.Every view in UIKit is backed by a layer object (usually an instance of theCALayerclass), which manages the backing store for the view and handles view-related animations.Mostoperations you perform should be through theUIViewinterface. However, insituations where you need more control over the rendering or animation behaviorof your view, you can perform operations through its layer instead.
View Hierarchies and Subview Management
Each superview stores its subviews in an ordered array and the order in that array also affects the visibility of each subview.
The arrangement of views in a view hierarchy also determines how your application responds to events. When a touch occurs inside a specific view, the system sends an event object with the touch information directly to that view for handling. However, if the view does not handle a particular touch event, it can pass the event object along to its superview. If the superview does not handle the event, it passes the event object to its superview, and so on up the responder chain. Specific views can also pass the event object to an intervening responder object, such as a view controller. If no object handles the event, it eventually reaches the application object, which generally discards it.
视图结合内核动漫(Core Animation卡塔尔层一齐，来管理视图内容的渲染和卡通片。通过二个层对象(平日是CALayer类的贰个实例卡塔尔国，在UIKit框架里的每一个视图都辅助管理视图的后台存款和储蓄和拍卖视图相关的各个卡通。你试行的半数以上操作应该依附UIView接口。但是，在你要求更加多的调节关于渲染（rendering）或动漫视图的一颦一笑的景观下，你能够试行操作它的层来替代。
The View Drawing Cycle
The UIView class uses an on-demand drawing model for presenting content. When a view first appears on the screen, the system asks it to draw its content. The system captures a snapshot of this content and uses that snapshot as the view’s visual representation. If you never change the view’s content, the view’s drawing code may never be called again. The snapshot image is reused for most operations involving the view. If you do change the content, you notify the system that the view has changed. The view then repeats the process of drawing the view and capturing a snapshot of the new results.
When the contents of your view change, you do not redraw those changes directly. Instead, you invalidate the view using either the setNeedsDisplay or setNeedsDisplayInRect: method. These methods tell the system that the contents of the view changed and need to be redrawn at the next opportunity. The system waits until the end of the current run loop before initiating any drawing operations. This delay gives you a chance to invalidate multiple views, add or remove views from your hierarchy, hide views, resize views, and reposition views all at once. All of the changes you make are then reflected at the same time.
Changing a view’s geometry does not automatically cause the system to redraw the view’s content. The view’s contentMode property determines how changes to the view’s geometry are interpreted. Most content modes stretch or reposition the existing snapshot within the view’s boundaries and do not create a new one. For more information about how content modes affect the drawing cycle of your view
When the time comes to render your view’s content, the actual drawing process varies depending on the view and its configuration. System views typically implement private drawing methods to render their content. Those same system views often expose interfaces that you can use to configure the view’s actual appearance. For custom UIView subclasses, you typically override the drawRect: method of your view and use that method to draw your view’s content. There are also other ways to provide a view’s content, such as setting the contents of the underlying layer directly, but overriding the drawRect: method is the most common technique.
To understand the relationship between views and layers, ithelps to look at an example.Figure 1-1showsthe view architecture from the ViewTransitions sample application along withthe relationship to the underlying Core Animation layers. The views in theapplication include a window (which is also a view), a genericUIViewobject that acts as acontainer view, an image view, a toolbar for displaying controls, and a barbutton item (which is not a view itself but which manages a view internally).(The actual ViewTransitions sample application includes anadditional image view that is used to implement transitions. For simplicity,and because that view is usually hidden, it is not included inFigure 1-1.) Every view has a corresponding layerobject that can be accessed from that view’s layer property.(Because a bar button item is not a view, you cannot access its layerdirectly.) Behind those layer objects are Core Animation rendering objects andultimately the hardware buffers used to manage the actual bits on the screen.
Content Modes
Each view has a content mode that controls how the view recycles its content in response to changes in the view’s geometry and whether it recycles its content at all. When a view is first displayed, it renders its content as usual and the results are captured in an underlying bitmap. After that, changes to the view’s geometry do not always cause the bitmap to be recreated. Instead, the value in the contentMode property determines whether the bitmap should be scaled to fit the new bounds or simply pinned to one corner or edge of the view.
图片 2
scale_aspect.jpg
The content mode of a view is applied whenever you do the following:
• Change the width or height of the view’s frame or bounds rectangles.
• Assign a transform that includes a scaling factor to the view’s transform property.
By default, the contentMode property for most views is set to UIViewContentModeScaleToFill
you can also set the content mode to the UIViewContentModeRedraw value when you specifically want your custom views to redraw themselves during scaling and resizing operations. Setting your view’s content mode to this value forces the system to call your view’s drawRect: method in response to geometry changes. In general, you should avoid using this value whenever possible, and you should certainly not use it with the standard system views
为了通晓视图和层之间的关系，看个例子更有帮助。图1-1体现了ViewTransitions演示应用中的视图布局，以致跟底层的基石动漫层之间的关联。应用中的视图包涵三个窗口，叁个通用的UIView对象，它充当容器视图(container view卡塔尔,一个图像视图，用于显示控件的工具栏，和三个工具栏按键项(它本人不是三个视图，不过在内处了多少个视图卡塔尔。(实际的ViewTransitions演示应用还隐含叁个额外的图像视图，用来落实联网（transitions）。因为非常视图平日是藏身的，为简易起见没包蕴在图1-1里卡塔尔(قطر每二个视图都有一个对应的层对象，能够从该视图的layer属性访谈。(因为工具栏按键项不是三个视图，你不可能间接待上访谈它的层State of Qatar那些层对象的背后是内核动漫渲染对象，最后硬件缓存（hardware buffers）用来管理显示器上的莫过于位。
Stretchable Views
图片 3
button_scale.jpg
You specify the stretchable area of a view using the contentStretch property.
The view’s content mode also plays a role in determining how the view’s stretchable area is used.Stretchable areas are only used when the content mode would cause the view’s content to be scaled. This means that stretchable views are supported only with the UIViewContentModeScaleToFill, UIViewContentModeScaleAspectFit, and UIViewContentModeScaleAspectFill content modes. If you specify a content mode that pins the content to an edge or corner (and thus does not actually scale the content), the view ignores the stretchable area.
Note: The use of the contentStretch property is recommended over the creation of a stretchable UIImage object when specifying the background for a view. Stretchable views are handled entirely in the Core Animation layer, which typically offers better performance.
Figure 1-1Architecture of the views in a sample application
Built-In Animation Support
frame—Use this to animate position and size changes for the view.
bounds—Use this to animate changes to the size of the view.
center—Use this to animate the position of the view.
transform—Use this to rotate or scale the view.
alpha—Use this to change the transparency of the view.
backgroundColor—Use this to change the background color of the view.
contentStretch—Use this to change how the view’s contents stretch.
图片 4
View Geometry and Coordinate Systems
The default coordinate system in UIKit has its origin in the top-left corner and has axes that extend down and to the right from the origin point.
Important: Some iOS technologies define default coordinate systems whose origin point and orientation differ from those used by UIKit. For example, Core Graphics and OpenGL ES use a coordinate system whose origin lies in the lower-left corner of the view or window and whose y-axis points upward relative to the screen. Your code must take such differences into account when drawing or creating content and adjust coordinate values (or the default orientation of the coordinate system) as needed.
The use of Core Animation layer objects has importantimplications for performance. The actual drawing code of a view object iscalled as little as possible, and when the code is called, the results arecached by Core Animation and reused as much as possible later. Reusingalready-rendered content eliminates the expensive drawing cycle usually neededto update views.Reuse of this content is especially important during animations, where the existing content can be manipulated.Suchreuse is much less expensive than creating new content.
The Relationship of the Frame, Bounds, and Center Properties
• The frame property contains the frame rectangle, which specifies the size and location of the view in its superview’s coordinate system.
• The bounds property contains the bounds rectangle, which specifies the size of the view (and its content origin) in the view’s own local coordinate system.
• The center property contains the known center point of the view in the superview’s coordinate system.
If you are changing only the position of the view (and not its size), the center property is the preferred way to do so. The value in the center property is always valid, even if scaling or rotation factors have been added to the view’s transform. The same is not true for the value in the frame property, which is considered invalid if the view’s transform is not equal to the identity transform.
By default, a view’s frame is not clipped to its superview’s frame. Thus, any subviews that lie outside of their superview’s frame are rendered in their entirety. You can change this behavior, though, by setting the superview’s clipsToBounds property to YES. Regardless of whether or not subviews are clipped visually, touch events always respect the bounds rectangle of the target view’s superview. In other words, touch events occurring in a part of a view that lies outside of its superview’s bounds rectangle are not delivered to that view.
内核动漫层对象的施用对品质有很主要的意义。视图的对象的实际上绘图代码会被尽只怕少的调用，现代码被调用时，结果通过根底动漫缓存，并在今后尽量多的任用。重用已经被渲染的内容减少了家常要求改革视图的高昂的绘图周期。在动漫时那个存在的内容能被操作，并且以此内容的录取是更为注重的。那样的选定比成立新剧情省去消耗。
Coordinate System Transformations
• To modify your entire view, modify the affine transform in the transform property of your view.
• To modify specific pieces of content in your view’s drawRect: method, modify the affine transform associated with the active graphics context.
You would not use this property to make permanent changes to your view, such as modifying its position or size a view within its superview’s coordinate space. For that type of change, you should modify the frame rectangle of your view instead.
Note: When modifying the transform property of your view, all transformations are performed relative to the center point of the view.
In your view’s drawRect: method, you use affine transforms to position and orient the items you plan to draw. Rather than fix the position of an object at some location in your view, it is simpler to create each object relative to a fixed point, typically (0, 0), and use a transform to position the object immediately prior to drawing. That way, if the position of the object changes in your view, all you have to do is modify the transform, which is much faster and less expensive than recreating the object at its new location. You can retrieve the affine transform associated with a graphics context using the CGContextGetCTM function and you can use the related Core Graphics functions to set or modify this transform during drawing.（i don't quiet understand)
Important: If a view’s transform property is not the identity transform, the value of that view’s frame property is undefined and must be ignored. When applying transforms to a view, you must use the view’s bounds and center properties to get the size and position of the view. The frame rectangles of any subviews are still valid because they are relative to the view’s bounds.
In addition to providing its own content, a view can act asa container for other views. When one view contains another, a parent-childrelationship is created between the two views. The child view in therelationship is known as the subview and the parent view is known asthe superview. The creation of this type of relationship has implicationsfor both the visual appearance of your application and the application’s behavior.
Points Versus Pixels
One point does not necessarily correspond to one pixel on the screen.
图片 5
At the device level, all coordinates you specify in your view must be converted to pixels at some point. However, the mapping of points in the user coordinate space to pixels in the device coordinate space is normally handled by the system. Both UIKit and Core Graphics use a primarily vector-based drawing model where all coordinate values are specified using points. Thus, if you draw a curve using Core Graphics, you specify the curve using the same values, regardless of the resolution of the underlying screen.
而外提供它本人的剧情，视图还可以充任此外视图的器皿。当一个视图包括了另二个时，在这里三个视图之间就创立了父亲和儿子关系。在这里个关系中的子视图平日被称为子视图，而父视图则被称作superview。那连串型的关系的创办对于你利用的可视化外观和接纳的行事都有早晚的震慑。
The Runtime Interaction Model for Views
Any time a user interacts with your user interface, or any time your own code programmatically changes something, a complex sequence of events takes place inside of UIKit to handle that interaction. At specific points during that sequence, UIKit calls out to your view classes and gives them a chance to respond on behalf of your application.
图片 6
UIKit interactions with your view objects
The following steps break the event sequence in Figure 1-7 down even further and explain what happens at each stage and how you might want your application to react in response.
1. The user touches the screen.
2. The hardware reports the touch event to the UIKit framework.
3. The UIKit framework packages the touch into a UIEvent object and dispatches it to the appropriate view. (For a detailed explanation of how UIKit delivers events to your views, see Event Handling Guide for iOS.)
4. The event-handling code of your view responds to the event. For example, your code might:
• Change the properties (frame, bounds, alpha, and so on) of the view or its subviews.
• Call the setNeedsLayout method to mark the view (or its subviews) as needing a layout update.
• Call the setNeedsDisplay or setNeedsDisplayInRect: method to mark the view (or its subviews) as needing to be redrawn.
• Notify a controller about changes to some piece of data.
Of course, it is up to you to decide which of these things the view should do and which methods it should call.
1. If the geometry of a view changed for any reason, UIKit updates its subviews according to the following rules:
a. If you have configured autoresizing rules for your views, UIKit adjusts each view according to those rules. For more information about how autoresizing rules work, see Handling Layout Changes Automatically Using Autoresizing Rules.
b. If the view implements the layoutSubviews method, UIKit calls it.You can override this method in your custom views and use it to adjust the position and size of any subviews. For example, a view that provides a large scrollable area would need to use several subviews as “tiles” rather than create one large view, which is not likely to fit in memory anyway. In its implementation of this method, the view would hide any subviews that are now offscreen or reposition them and use them to draw newly exposed content. As part of this process, the view’s layout code can also invalidate any views that need to be redrawn.
1. If any part of any view was marked as needing to be redrawn, UIKit asks the view to redraw itself.For custom views that explicitly define a drawRect: method, UIKit calls that method. Your implementation of this method should redraw the specified area of the view as quickly as possible and nothing else. Do not make additional layout changes at this point and do not make other changes to your application’s data model. The purpose of this method is to update the visual content of your view.Standard system views typically do not implement a drawRect: method but instead manage their drawing at this time.
2. Any updated views are composited with the rest of the application’s visible content and sent to the graphics hardware for display.
3. The graphics hardware transfers the rendered content to the screen.
Note: The preceding update model applies primarily to applications that use standard system views and drawing techniques. Applications that use OpenGL ES for drawing typically configure a single full-screen view and draw directly to the associated OpenGL ES graphics context. In such a case, the view may still handle touch events but, because it is full-
screen, it would not need to lay out subviews.
Visually, the content of a subview obscures all or part ofthe content of its parent view. If the subview is totally opaque, then the areaoccupied by the subview completely obscures the corresponding area of theparent. If the subview is partially transparent, the content from the two viewsis blended together prior to being displayed on the screen. Each superviewstores its subviews in an ordered array and the order in that array alsoaffects the visibility of each subview. If two sibling subviews overlap eachother, the one that was added last (or was moved to the end of the subviewarray) appears on top of the other.
Tips for Using Views Effectively
• Views Do Not Always Have a Corresponding View Controller
• Minimize Custom Drawing
• Take Advantage of Content Modes
• Declare Views as Opaque Whenever Possible
• Adjust Your View’s Drawing Behavior When Scrolling
• Do Not Customize Controls by Embedding Subviews
在视觉上，子视图的源委掩瞒了上上下下或部分它的父视图的内容。假诺子视图是完全不透明的，则子视图并吞的区域完全覆盖了父视图的照顾区域。假如子视图部分透明的，则四个视图的剧情在呈现到显示器上事情发生在此之前被混合在联合签字。各个父视图把它们的子视图遵照一定顺序存在一个数组里，该每个也影响了每种子视图的可以知道性。假设三个弟兄子视图互相重叠，则后加(或被移到子视图数组的末段的卡塔尔国的视图展现在前三个视图的上面。
The superview-subview relationship also impacts severalview behaviors. Changing the size of a parent view has a ripple effect that cancause the size and position of any subviews to change too. When you change thesize of a parent view, you can control the resizing behavior of each subview byconfiguring the view appropriately. Other changes that affect subviews includehiding a superview, changing a superview’s alpha (transparency), or applying amathematical transform to a superview’s coordinate system.
父亲和儿子视图关系也潜濡默化了一部分视图行为。改革父视图的尺寸会时有产生四个连锁反应，引致子视图的尺寸和任务也时有产生转移。当您改造父视图的尺码时，通过适本地配置那几个视图，你可以看到调整每种子视图调度大小的行为(resizing behavior卡塔尔国。此外影响子视图的更正还包蕴隐形父视图，改造父视图的阿尔法值，或给父视图的坐标种类利用多个数学调换。
The arrangement of views in a view hierarchy alsodetermines how your application responds to events. When a touch occurs insidea specific view, the system sends an event object with the touch informationdirectly to that view for handling. However, if the view does not handle aparticular touch event, it can pass the event object along to its superview. Ifthe superview does not handle the event, it passes the event object to itssuperview, and so on up the responder chain. Specific views can also pass theevent object to an interveningresponder object,such as a view controller. If no object handles the event, it eventuallyreaches the application object, which generally discards it.
视图在视图等级次序里的排列也调整了应用程序怎么样对事件做出响应。当触摸发生在二个一定视图内部时，系统间接发送二个具备触摸音讯的平地风波目的让其处理。然则，若是该视图未有拍卖特定的触摸事件，它可以向前传递事件指标到它的父视图。如果它的父视图还不曾拍卖该事件，则把事件传递给父视图的父视图，如此这般逐级进步响应链。特定视图也得以传递事件指标给多少个介怀中间的响应对象，例如二个视图调节器。如果未有对象管理该事件，它聊到底会被传送到应用程序对象，平常由应用程序对象把它废弃。
For more information about how to create view hierarchies,see“Creating and Managing a View Hierarchy.”
至于如何创立视图等级次序的越多音信，请看“Creating and Managing a View Hierarchy.”
TheUIViewclassuses an on-demand drawing model for presenting content. When a view firstappears on the screen, the system asks it to draw its content. The systemcaptures a snapshot of this content and uses that snapshot as the view’s visualrepresentation. If you never change the view’s content, the view’s drawing codemay never be called again. The snapshot image is reused for most operationsinvolving the view. If you do change the content, you notify the system thatthe view has changed. The view then repeats the process of drawing the view andcapturing a snapshot of the new results.
UIView类使用一种按需绘制模型(on-demand drawing modelState of Qatar来表现视图内容。当视图第三次出以往显示屏上时，系统必要它绘制其故事情节。系统捕捉该内容的快速照相，并利用该快速照相作为视图的视觉彰显(visual representationState of Qatar。借使您或多或少也未有改正视图的剧情，那视图的绘图代码大概不会再被调用。快速照相图片被波及视图的大多数操作所接收。借使您对剧情做了更动，你须要文告系统告知它视图已经改造。然后视图重复绘制视图进度，并捕捉新的快速照相。
When the contents of your view change, you do not redrawthose changes directly. Instead, you invalidate the view using either the setNeedsDisplay or setNeedsDisplayInRect:method.These methods tell the system that the contents of the view changed and need tobe redrawn at the next opportunity. The system waits until the end of thecurrent run loop before initiating any drawing operations. This delay gives youa chance to invalidate multiple views, add or remove views from your hierarchy,hide views, resize views, and reposition views all at once. All of the changesyou make are then reflected at the same time.
当你的视图内容产生退换时，你不会一贯重新绘制这些改变。你可以用setNeedsDisplay或setNeedsDisplayInRect:方法让视图无效。那几个格局告诉系统视图的内容已经产生改动，须要在下一次再度绘制。该系统在运转任何绘图操作此前，等待眼下运作循环的终结。该延时给你二次时机，用来二遍性完结吐弃四个视图，从视图档期的顺序里增进或删除视图，隐蔽视图，调节视图大小，重新配置视图等。全体那一个你做的变动就要同时反映出来。
Note: Changinga view’s geometry does not automatically cause the system to redraw the view’scontent. The view’scontentModepropertydetermines how changes to the view’s geometry are interpreted. Most contentmodes stretch or reposition the existing snapshot within the view’s boundariesand do not create a new one. For more information about how content modesaffect the drawing cycle of your view, see“Content Modes.”
在乎：改动视图的几何构造并不会自动招致系统重画视图内容。视图的contentMode属性鲜明了哪些转移视图的几何解释。大好些个内容形式都以在视图边界里拉伸或重新配置已经存在的快照，并不供给创立新视图内容。掌握越多关于内容方式怎么着影响视图的绘图周期，请看“Content Modes.”
When the time comes to render your view’s content, the actual drawing process varies depending on the view and its configuration. System views typically implement private drawing methods to render their content. Those same system views often expose interfaces that you can use to configure the view’s actual appearance. For customUIViewsubclasses, you typicallyoverride the drawRect:method of your view and use that method to draw yourview’s content. There are also other ways to provide a view’s content, such assetting the contents of the underlying layer directly, but overriding thedrawRect:method is the mostcommon technique.
当开端渲染视图内容时，实际的绘图进度依据视图和它的配备而退换。系统视图平常试行私有绘图方法来渲染它们的从头到尾的经过。这一个相像的体系视图日常暴揭穿接口，令你能够用来安插视图实际的外观。为了定制UIView子类，你日常重载视图的drawRect:方法，并用该办法绘制视图的内容。还会有别的方法来提供一个视图的剧情，比方直接设置底层内容，可是重载drawRect:方法是最通用的技术。
For more information about how to draw content for customviews, see“Implementing Your Drawing Code.”
越来越多关于怎么样绘制自定义视图的内容方面包车型大巴音讯，请看“Implementing Your Drawing Code.”
Each view has a content mode that controls how the viewrecycles its content in response to changes in the view’s geometry and whetherit recycles its content at all. When a view is first displayed, it renders itscontent as usual and the results are captured in an underlying bitmap. Afterthat, changes to the view’s geometry do not always cause the bitmap to berecreated. Instead, the value in thecontentModepropertydetermines whether the bitmap should be scaled to fit the new bounds or simplypinned to one corner or edge of the view.
各样视图皆有二个内容情势（content model），在视图几何外形发生变化时，用来支配视图如何回收聘用它的剧情来响应视图几何外形的转移，以至是不是回收重用其全体内容。当视图被第三回展现时，它跟日常一律渲染它的内容，何况结果被抓走到一个尾部位图里。然后，视图几何外形的改观并不总是变成重新创设位图。相反，contentMode属性的值决定了该位图是或不是应该缩放来适应新的疆界，或只须要轻便的定位到视图的叁个角落或一边。
The content mode of a view is applied whenever you do thefollowing:
视图的剧情情势被应用到以下情况：
·Change the width or height ofthe view’sframeorboundsrectangles.
校正视图框架或矩形边界(frameorbounds卡塔尔的长短或宽度。
·Assign a transform thatincludes a scaling factor to the view’stransformproperty.
给视图transform的质量分配多少个转变，该调换满含三个缩放因子。
By default, thecontentModeproperty for most views is set to UIViewContentModeScaleToFill,which causes the view’s contents to be scaled to fit the new frame size.Figure 1-2shows the results that occur for somecontent modes that are available. As you can see from the figure, not allcontent modes result in the view’s bounds being filled entirely, and those thatdo might distort the view’s content.
暗许时，大好些个视图的开始和结果情势属性被设为UIViewContentModeScaleToFill，该装置招致视图的内容被缩放以适应新的框架尺寸。图1-2显示了一部分可用的源委格局作用。正如您在图中阅览，不是独具的内容形式招致视图边界被全然填满，而且那多个真正填满边界的图片可能走样。
Figure 1-2 Content mode comparisons
图1-2内容情势相比
图片 7
本文由澳门威利斯人发布于网络资讯,转载请注明出处：官方文档翻译
关键词： 澳门威利斯人 日记本 文档 官方 Guide
|
{
"url": "https://www.hfpgjx.com/wangluozixun/765.html",
"source_domain": "www.hfpgjx.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "41511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WULWF64GNIVCEVNOU2XH7EALZBTJETT6",
"WARC-Concurrent-To": "<urn:uuid:3b4ab348-6c9b-4996-83e3-15252ea829f0>",
"WARC-Date": "2020-09-28T19:31:45Z",
"WARC-IP-Address": "156.237.148.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KWS26LZREBJGJWS6DARVKA23Y7ZDVPUS",
"WARC-Record-ID": "<urn:uuid:e0878a24-f955-4447-9d73-0626cf125ee3>",
"WARC-Target-URI": "https://www.hfpgjx.com/wangluozixun/765.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:56537fe1-7f40-44a2-9c4d-b2f163704ced>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-234.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,
19,
20,
49,
74,
75,
82,
83,
545,
546,
552,
553,
663,
664,
690,
691,
711,
871,
902,
1037,
1078,
1207,
1208,
1353,
1354,
1372,
1373,
1887,
1888,
2212,
2213,
2218,
2219,
2230,
2231,
2774,
2775,
3279,
3280,
3320,
3321,
3449,
3450,
4147,
4148,
4346,
4347,
4370,
4371,
4970,
4971,
5591,
5592,
5988,
5989,
6629,
6630,
7653,
7654,
7668,
7669,
8213,
8214,
8219,
8220,
8237,
8238,
8307,
8308,
8381,
8469,
8470,
8561,
8562,
9006,
9007,
9410,
9411,
9429,
9430,
9435,
9436,
9453,
9454,
9532,
10065,
10066,
10330,
10331,
10391,
10392,
10419,
10420,
10486,
10546,
10599,
10647,
10702,
10771,
10838,
10839,
10844,
10845,
10882,
10883,
11030,
11031,
11528,
11529,
12064,
12065,
12126,
12127,
12268,
12428,
12534,
12535,
12933,
12934,
13479,
13480,
13633,
13634,
13668,
13669,
13769,
13916,
13917,
14161,
14295,
14296,
15061,
15062,
15441,
15442,
15868,
15869,
15890,
15891,
15961,
15962,
15967,
15968,
16484,
16485,
16619,
16620,
16660,
16661,
17004,
17005,
17010,
17011,
17053,
17054,
17232,
17233,
17267,
17333,
17549,
17644,
17733,
17831,
17954,
18015,
18016,
18128,
18129,
18245,
18484,
18485,
19107,
19108,
19720,
19856,
19929,
19930,
20286,
20333,
20334,
20955,
20956,
20989,
20990,
21051,
21079,
21115,
21161,
21216,
21268,
21269,
21475,
21476,
21982,
21983,
22162,
22163,
22850,
22851,
23086,
23087,
23190,
23191,
23253,
23254,
23843,
23844,
24110,
24111,
24723,
24724,
24941,
24942,
25357,
25358,
25502,
25503,
26134,
26135,
26327,
26328,
26429,
26430,
26495,
26496,
27031,
27032,
27244,
27245,
27313,
27314,
27331,
27332,
27397,
27398,
27434,
27435,
27517,
27518,
27554,
27555,
27952,
27953,
28098,
28099,
28135,
28136,
28147,
28148,
28153,
28154,
28186,
28187
],
"line_end_idx": [
19,
20,
49,
74,
75,
82,
83,
545,
546,
552,
553,
663,
664,
690,
691,
711,
871,
902,
1037,
1078,
1207,
1208,
1353,
1354,
1372,
1373,
1887,
1888,
2212,
2213,
2218,
2219,
2230,
2231,
2774,
2775,
3279,
3280,
3320,
3321,
3449,
3450,
4147,
4148,
4346,
4347,
4370,
4371,
4970,
4971,
5591,
5592,
5988,
5989,
6629,
6630,
7653,
7654,
7668,
7669,
8213,
8214,
8219,
8220,
8237,
8238,
8307,
8308,
8381,
8469,
8470,
8561,
8562,
9006,
9007,
9410,
9411,
9429,
9430,
9435,
9436,
9453,
9454,
9532,
10065,
10066,
10330,
10331,
10391,
10392,
10419,
10420,
10486,
10546,
10599,
10647,
10702,
10771,
10838,
10839,
10844,
10845,
10882,
10883,
11030,
11031,
11528,
11529,
12064,
12065,
12126,
12127,
12268,
12428,
12534,
12535,
12933,
12934,
13479,
13480,
13633,
13634,
13668,
13669,
13769,
13916,
13917,
14161,
14295,
14296,
15061,
15062,
15441,
15442,
15868,
15869,
15890,
15891,
15961,
15962,
15967,
15968,
16484,
16485,
16619,
16620,
16660,
16661,
17004,
17005,
17010,
17011,
17053,
17054,
17232,
17233,
17267,
17333,
17549,
17644,
17733,
17831,
17954,
18015,
18016,
18128,
18129,
18245,
18484,
18485,
19107,
19108,
19720,
19856,
19929,
19930,
20286,
20333,
20334,
20955,
20956,
20989,
20990,
21051,
21079,
21115,
21161,
21216,
21268,
21269,
21475,
21476,
21982,
21983,
22162,
22163,
22850,
22851,
23086,
23087,
23190,
23191,
23253,
23254,
23843,
23844,
24110,
24111,
24723,
24724,
24941,
24942,
25357,
25358,
25502,
25503,
26134,
26135,
26327,
26328,
26429,
26430,
26495,
26496,
27031,
27032,
27244,
27245,
27313,
27314,
27331,
27332,
27397,
27398,
27434,
27435,
27517,
27518,
27554,
27555,
27952,
27953,
28098,
28099,
28135,
28136,
28147,
28148,
28153,
28154,
28186,
28187,
28214
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28214,
"ccnet_original_nlines": 252,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3868800699710846,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0015807199524715543,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18632681667804718,
"rps_doc_frac_unique_words": 0.21329708397388458,
"rps_doc_mean_word_length": 5.809441566467285,
"rps_doc_num_sentences": 214,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5360493659973145,
"rps_doc_word_count": 4046,
"rps_doc_frac_chars_dupe_10grams": 0.21169963479042053,
"rps_doc_frac_chars_dupe_5grams": 0.3070410490036011,
"rps_doc_frac_chars_dupe_6grams": 0.27768561244010925,
"rps_doc_frac_chars_dupe_7grams": 0.2642841935157776,
"rps_doc_frac_chars_dupe_8grams": 0.25364816188812256,
"rps_doc_frac_chars_dupe_9grams": 0.23203574120998383,
"rps_doc_frac_chars_top_2gram": 0.013699210248887539,
"rps_doc_frac_chars_top_3gram": 0.006509250029921532,
"rps_doc_frac_chars_top_4gram": 0.004892580211162567,
"rps_doc_books_importance": -1735.1275634765625,
"rps_doc_books_importance_length_correction": -1735.1275634765625,
"rps_doc_openwebtext_importance": -1149.9822998046875,
"rps_doc_openwebtext_importance_length_correction": -1149.9822998046875,
"rps_doc_wikipedia_importance": -862.2959594726562,
"rps_doc_wikipedia_importance_length_correction": -862.2959594726562
},
"fasttext": {
"dclm": 0.063477523624897,
"english": 0.7984700202941895,
"fineweb_edu_approx": 2.342881202697754,
"eai_general_math": 0.5905206203460693,
"eai_open_web_math": 0.12834352254867554,
"eai_web_code": 0.8172828555107117
}
}
|
{
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,765,418,443,844,492,000 |
;
Polyline QML Type
A linear shape defined by a collection of segments. More...
Import Statement: import Esri.ArcGISRuntime 100.13
Since: Esri.ArcGISRuntime 100.0
Inherits:
Multipart
Detailed Description
Polyline geometries represent the shape and location of linear features, such as a street in a road network, a contour line representing an elevation value, or a hiking trail. A Polyline can be used to define geometry for features and graphics, or as input or output for tasks or geoprocessing operations, such as the output of a network trace.
A Polyline is composed of a series of connected Segments, where each segment defines a continuous line between a start and an end point. You can define a new Polyline from a collection of Point to create a series of straight LineSegment connecting the points you specified. You can use PolylineBuilder to build a Polyline, one point at a time, or to modify an existing Polyline.
Additionally, Polyline can have multiple parts. Each part is a series of connected segments, but the parts can be disjoint from each other. For example, a Polyline representing a street that ends and then starts again a block later. Parts can also intersect at one or more vertices. For example, in a Polyline representing a river and its tributaries. The Polyline class inherits from Multipart, which provides members for iterating the segments and points of each part in a Polyline.
Polyline is immutable. Instead of changing the properties of an existing Polyline, you can create new Polyline instances, or use PolylineBuilder.
See also JsonSerializable.
Your browser is no longer supported. Please upgrade your browser for the best experience. See our browser deprecation post for more details.
|
{
"url": "https://developers.arcgis.com/qt/qml/api-reference/qml-esri-arcgisruntime-polyline.html",
"source_domain": "developers.arcgis.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "351398",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RXWLUQX7K7OXDMJULVIXL2HB3E6ZN55W",
"WARC-Concurrent-To": "<urn:uuid:43ee9a05-ef58-47ad-a618-2d1cd91b1643>",
"WARC-Date": "2022-01-21T01:28:24Z",
"WARC-IP-Address": "99.84.110.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C23OUGFA3GBSRL3X6NSYHUL64ZGJXBMO",
"WARC-Record-ID": "<urn:uuid:b7479b17-345c-4aeb-a2ac-118e702d7863>",
"WARC-Target-URI": "https://developers.arcgis.com/qt/qml/api-reference/qml-esri-arcgisruntime-polyline.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a06075f2-7882-496a-94bf-c885f06ece19>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-13\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,
2,
3,
21,
22,
82,
83,
134,
166,
176,
177,
187,
188,
209,
210,
555,
556,
935,
936,
1421,
1422,
1568,
1569,
1596,
1597
],
"line_end_idx": [
2,
3,
21,
22,
82,
83,
134,
166,
176,
177,
187,
188,
209,
210,
555,
556,
935,
936,
1421,
1422,
1568,
1569,
1596,
1597,
1737
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1737,
"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.39751553535461426,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012422359548509121,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.1428571343421936,
"rps_doc_frac_unique_words": 0.4855072498321533,
"rps_doc_mean_word_length": 5.094202995300293,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.0031055898871272802,
"rps_doc_unigram_entropy": 4.4803385734558105,
"rps_doc_word_count": 276,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03698435053229332,
"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.03840683028101921,
"rps_doc_frac_chars_top_3gram": 0.019203409552574158,
"rps_doc_frac_chars_top_4gram": 0.025604549795389175,
"rps_doc_books_importance": -123.82979583740234,
"rps_doc_books_importance_length_correction": -113.8594970703125,
"rps_doc_openwebtext_importance": -56.83559799194336,
"rps_doc_openwebtext_importance_length_correction": -56.83559799194336,
"rps_doc_wikipedia_importance": -59.54792022705078,
"rps_doc_wikipedia_importance_length_correction": -53.48163986206055
},
"fasttext": {
"dclm": 0.45787549018859863,
"english": 0.8892207145690918,
"fineweb_edu_approx": 2.8567869663238525,
"eai_general_math": 0.9512937068939209,
"eai_open_web_math": 0.32965683937072754,
"eai_web_code": 0.8415345549583435
}
}
|
{
"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": "526.0285636",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Astronomy",
"level_3": "Geodesy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,101,086,296,897,344,900 |
Games PC and Playstation
Paula Michelle 21:19 21 Feb 2005
Locked
Would anyone care to offer an opinion as to how a PC compares to a Sony Playstation2 for someone who wants a computer for games? After all, the playstation is only a fraction of the price of a games PC and yet both platforms offer the same games.
Technotiger 21:22 21 Feb 2005
Hi, if all the person wants is to play games, then I would say that the PS2 would be best.
Cheers.
steven_frost 21:26 21 Feb 2005
playstaion 2
bukkaz 21:30 21 Feb 2005
Depends on the sort of game.
I think games like Call Of duty are better on PC because of the controls, but that's just my opinion.
Bleep 21:36 21 Feb 2005
As a cost comparision the PS2 wins hands down, however I good gaming PC is a much more powerful gaming platform than a PS2 abit at a higher cost...
I have a powerful gaming PC,XBOX,PS2 and enjoy all equally, I guess I could leave without my PC for games but could'nt my XBOX and PS2.
Alot comes down to personal preference keyboard or controller? as playing a good arcade racing game is alot easier with a controller than a keyboard etc..
No doubt there will be people that prefer PC's to consoles for games so it really depends on what games you play and how important graphics and resolution is too you? i'm a bit old school and dont think graphics make a game, gamplay is much more important. But at the same time I really enoy running DOOM3 on my PC at ultra high res and all the eye candy on full the thrill of the quality of visuals.
Anyhow whats the reason behind the post?
Paula Michelle 22:07 21 Feb 2005
Reason behind the post:
I have an old computer which I need to upgrade/replace due to 1) no room left on two small hddrives to load games; 2) MX440 graphics card too slow for new games; and so on...but the monitor is fine and the PC does all my accounts fine with a copy of office 2000 I was given last year, and is OK for the internet. The budget is only £500. That is plenty for a computer when there are a thousand other things to spend the money on. I don't do video editing or anything, and should I want an expensive PC for those sort of tasks then it'll have to wait until I can afford it. Everytime I ask a question about upgrading my PC whether it's the graphics or the processor or the motherboard and memory I always end up having to say what I want the PC for and if its for games. And if I say it is, then it always ends up far too expensive. So I'm thinking of getting a cheap option (non-games) upgrade (eg Sempron, bigger hard drive, dvd writer and reader) leaving enough to get a Sony Playstation for the games department.
Does that make sense?
Totally-braindead 22:14 21 Feb 2005
I like the PC for games as I like the combination of using the keyboard and mouse for controlling it and the graphics do tend to be better, but the catch is the companies that design the games keep raising the bar with regards the specification you need to run a new game and therefore you end up having to spend money to upgrade your PC to make sure you can play the latest games. Its a bit of a vicious circle as well as there being compatability issues with some of the games and certain graphics cards etc. Overall I suppose the Playstation 2 is better, its cheaper, you know the games going to work, and you don't have to keep adding/upgrading bits on to it to ensure you can play the game. But a comparison between the two this way is a bit unfair in certain ways, if you just want to play games and thats all you want to do then a Playstation is probably the way to go but a PC can do much much more than a Playstation. I like mucking about with my computer and am quite willing to add on bits every year or so, and PCs do an awful lot more than a PS2 is capable of, being on this Forum for instance, wordprocessing, spreadsheets, email, graphics manipulation, cd creating, video manipulation, sound manipulation etc etc. A PS2 can't do this so I'll stick with my PC. Oh and as a plus, if you wait about a year after a games release you can pick the PC version up a lot cheaper than the PS2 equivalent although when they're newly released they tend to be about the same price.
Totally-braindead 22:20 21 Feb 2005
Sorry, it took me so long to write what I did that I missed what you said. Yes what you said makes sense, it may be the way to go. Thinking about, it all the upgrades I've done over the past 2 years to my computer have all been to ensure I can play the latest games. The upgrades have probably cost me roughly what a PS2 would.
HXP 22:24 21 Feb 2005
PS2 is good for Grand Tourisimo but if that were available on the PC I wouldn't have got a PS2.
A wider bariety of games available for PC but you do pat 10 times more for a PC ....
HXP
Starfox 22:41 21 Feb 2005
Another opinion for you.
In our family we have a top gaming Pc,Playstation 2,X Box and Nintendo Gamecube.Yes I know we are all gaming nutters.
You can't beat a top pc for the choice of games nor the graphical excellence during gameplay.
The Playstation 2 is the market leader for video consoles and has a great range of games but many are just utter rubbish,so watch what you buy.
Nintendo Gamecube - Nintendo alway has had and still has the best quality games,most are very playable and the kids love the titles available for younger players.
X-Box Good but expensive and the games cost a fortune.
So if it's just games you want buy a console but that is all they can do, play games or play DVD's,
Hope this helps.
Paula Michelle 22:53 21 Feb 2005
If I'd had a grand to throw away a month ago I would have bought a new PC with the AMD Athlon 64 socket 939 3500+ 90n "Winchester" processor, a gig of RAM, a Geforce 6600GT graphics card, a 160gb HDD, DVD ROM and DVD RW with all the usual options, Windows XP and several "quiet" options and other enhancements (see Holly Computers)without monitor or speakers and I would have been very happy with it, I suspect.
And I nearly did order it, even though I couldn't afford it.
The trouble is, most of the expense would be for games. There is no other reason for buying such a fast processor/enormous RAM/ lightning fast graphics card and the quiet options would be unneccessary without the added power and fans. In fact I have worked out that without games in mind you could easily save £500 and still have a decent PC.
Unfortunately, I have commitments and it would be folly to spend a grand like that when I have other priorities so I have had to take a serious look at what my options are and what the costs are. There are many folk who would love to drive a Ferrari but few who would re-mortgage their house for it. It is all a question of balancing luxuries, money and sensible spending as opposed to being hijacked by an obsession.
But maybe I can have my cake and eat it with the games console......?
I wonder if anyone else thinks this way.
This thread is now locked and can not be replied to.
Elsewhere on IDG sites
Alienware 17 R4 2017 review
Interview: Camille Walala on her giant 3D installation inspired by childhood funfair visits
Best iPad buying guide 2017
Où regarder le British Open 2017 ?
|
{
"url": "http://www.techadvisor.co.uk/forum/helproom-1/games-pc-playstation-185763/",
"source_domain": "www.techadvisor.co.uk",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "70730",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NLELFVQMLSB5OCTREHXVR535OLPX7V4X",
"WARC-Concurrent-To": "<urn:uuid:92cb0877-78dc-46f0-859f-95ac2f45829e>",
"WARC-Date": "2017-07-20T13:06:28Z",
"WARC-IP-Address": "104.17.177.56",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FOMN4XNX54UECFC4Z44FAM7QWKCN6CIR",
"WARC-Record-ID": "<urn:uuid:67119cd5-04c4-4268-ad8f-0ac65b882c48>",
"WARC-Target-URI": "http://www.techadvisor.co.uk/forum/helproom-1/games-pc-playstation-185763/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:191dcd30-2406-4fb7-b199-e9938e5924fa>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-147-76.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
26,
61,
68,
69,
316,
317,
349,
350,
441,
442,
450,
451,
484,
485,
498,
499,
526,
527,
556,
658,
659,
685,
686,
834,
835,
836,
972,
973,
974,
1129,
1130,
1131,
1532,
1533,
1534,
1575,
1576,
1611,
1612,
1636,
2652,
2674,
2675,
2713,
2714,
4198,
4199,
4237,
4238,
4566,
4567,
4591,
4592,
4688,
4689,
4774,
4775,
4779,
4780,
4808,
4809,
4834,
4835,
4836,
4954,
4955,
5049,
5050,
5051,
5195,
5196,
5197,
5360,
5361,
5362,
5417,
5418,
5419,
5519,
5520,
5521,
5538,
5539,
5574,
5575,
5987,
5988,
6049,
6050,
6393,
6394,
6812,
6813,
6883,
6924,
6925,
6978,
6979,
7002,
7003,
7031,
7032,
7124,
7125,
7153,
7154
],
"line_end_idx": [
25,
26,
61,
68,
69,
316,
317,
349,
350,
441,
442,
450,
451,
484,
485,
498,
499,
526,
527,
556,
658,
659,
685,
686,
834,
835,
836,
972,
973,
974,
1129,
1130,
1131,
1532,
1533,
1534,
1575,
1576,
1611,
1612,
1636,
2652,
2674,
2675,
2713,
2714,
4198,
4199,
4237,
4238,
4566,
4567,
4591,
4592,
4688,
4689,
4774,
4775,
4779,
4780,
4808,
4809,
4834,
4835,
4836,
4954,
4955,
5049,
5050,
5051,
5195,
5196,
5197,
5360,
5361,
5362,
5417,
5418,
5419,
5519,
5520,
5521,
5538,
5539,
5574,
5575,
5987,
5988,
6049,
6050,
6393,
6394,
6812,
6813,
6883,
6924,
6925,
6978,
6979,
7002,
7003,
7031,
7032,
7124,
7125,
7153,
7154,
7188
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7188,
"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.46611252427101135,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06393861770629883,
"rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383,
"rps_doc_frac_no_alph_words": 0.14386188983917236,
"rps_doc_frac_unique_words": 0.38700148463249207,
"rps_doc_mean_word_length": 4.120384216308594,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.0031969300471246243,
"rps_doc_unigram_entropy": 5.470227241516113,
"rps_doc_word_count": 1354,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.007528230082243681,
"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.009858399629592896,
"rps_doc_frac_chars_top_3gram": 0.0177451204508543,
"rps_doc_frac_chars_top_4gram": 0.006811259780079126,
"rps_doc_books_importance": -713.5999755859375,
"rps_doc_books_importance_length_correction": -713.5999755859375,
"rps_doc_openwebtext_importance": -400.7733459472656,
"rps_doc_openwebtext_importance_length_correction": -400.7733459472656,
"rps_doc_wikipedia_importance": -267.79443359375,
"rps_doc_wikipedia_importance_length_correction": -267.79443359375
},
"fasttext": {
"dclm": 0.07503533363342285,
"english": 0.9667814373970032,
"fineweb_edu_approx": 0.970896303653717,
"eai_general_math": 0.040305379778146744,
"eai_open_web_math": 0.11806374788284302,
"eai_web_code": 0.008984680287539959
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,285,415,301,981,039,000 |
Python os.system() Examples
The following are code examples for showing how to use os.system(). They are from open source Python projects. You can vote up the examples you like or vote down the ones you don't like.
Example 1
Project: pyblish-win Author: pyblish File: _osx_support.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def _read_output(commandstring):
"""Output from successful command execution or None"""
# Similar to os.popen(commandstring, "r").read(),
# but without actually using os.popen because that
# function is not usable during python bootstrap.
# tempfile is also not available then.
import contextlib
try:
import tempfile
fp = tempfile.NamedTemporaryFile()
except ImportError:
fp = open("/tmp/_osx_support.%s"%(
os.getpid(),), "w+b")
with contextlib.closing(fp) as fp:
cmd = "%s 2>/dev/null >'%s'" % (commandstring, fp.name)
return fp.read().strip() if not os.system(cmd) else None
Example 2
Project: pyblish-win Author: pyblish File: mailcap.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def listmailcapfiles():
"""Return a list of all mailcap files found on the system."""
# XXX Actually, this is Unix-specific
if 'MAILCAPS' in os.environ:
str = os.environ['MAILCAPS']
mailcaps = str.split(':')
else:
if 'HOME' in os.environ:
home = os.environ['HOME']
else:
# Don't bother with getpwuid()
home = '.' # Last resort
mailcaps = [home + '/.mailcap', '/etc/mailcap',
'/usr/etc/mailcap', '/usr/local/etc/mailcap']
return mailcaps
# Part 2: the parser.
Example 3
Project: pyblish-win Author: pyblish File: mailcap.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def findmatch(caps, MIMEtype, key='view', filename="/dev/null", plist=[]):
"""Find a match for a mailcap entry.
Return a tuple containing the command line, and the mailcap entry
used; (None, None) if no match is found. This may invoke the
'test' command of several matching entries before deciding which
entry to use.
"""
entries = lookup(caps, MIMEtype, key)
# XXX This code should somehow check for the needsterminal flag.
for e in entries:
if 'test' in e:
test = subst(e['test'], filename, plist)
if test and os.system(test) != 0:
continue
command = subst(e[key], MIMEtype, filename, plist)
return command, e
return None, None
Example 4
Project: pyblish-win Author: pyblish File: mailcap.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def test():
import sys
caps = getcaps()
if not sys.argv[1:]:
show(caps)
return
for i in range(1, len(sys.argv), 2):
args = sys.argv[i:i+2]
if len(args) < 2:
print "usage: mailcap [MIMEtype file] ..."
return
MIMEtype = args[0]
file = args[1]
command, e = findmatch(caps, MIMEtype, 'view', file)
if not command:
print "No viewer found for", type
else:
print "Executing:", command
sts = os.system(command)
if sts:
print "Exit status:", sts
Example 5
Project: pyblish-win Author: pyblish File: os.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def popen2(cmd, mode="t", bufsize=-1):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd'
may be a sequence, in which case arguments will be passed directly to
the program without shell intervention (as with os.spawnv()). If 'cmd'
is a string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdin, child_stdout) are returned."""
import warnings
msg = "os.popen2 is deprecated. Use the subprocess module."
warnings.warn(msg, DeprecationWarning, stacklevel=2)
import subprocess
PIPE = subprocess.PIPE
p = subprocess.Popen(cmd, shell=isinstance(cmd, basestring),
bufsize=bufsize, stdin=PIPE, stdout=PIPE,
close_fds=True)
return p.stdin, p.stdout
Example 6
Project: pyblish-win Author: pyblish File: os.py GNU Lesser General Public License v3.0 6 votes vote down vote up
def popen4(cmd, mode="t", bufsize=-1):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd'
may be a sequence, in which case arguments will be passed directly to
the program without shell intervention (as with os.spawnv()). If 'cmd'
is a string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdin, child_stdout_stderr) are returned."""
import warnings
msg = "os.popen4 is deprecated. Use the subprocess module."
warnings.warn(msg, DeprecationWarning, stacklevel=2)
import subprocess
PIPE = subprocess.PIPE
p = subprocess.Popen(cmd, shell=isinstance(cmd, basestring),
bufsize=bufsize, stdin=PIPE, stdout=PIPE,
stderr=subprocess.STDOUT, close_fds=True)
return p.stdin, p.stdout
Example 7
Project: flask-ci Author: vicenteneto File: run_nose.py MIT License 6 votes vote down vote up
def run(self, settings, **options):
args = list()
if options[Nose.WITH_XUNIT]:
args.append(Nose.WITH_XUNIT_PARAM)
args.append('%s=%s' % (Nose.XUNIT_FILE_PARAM, options[Nose.XUNIT_FILE]))
if options[Nose.COVER_XML] or options[Nose.COVER_HTML]:
args.append(Nose.WITH_COVERAGE_PARAM)
args.append('%s=%s' % (Nose.COVER_PACKAGE_PARAM, ','.join(getattr(settings, Settings.PROJECT_APPS, []))))
if options[Nose.COVER_XML]:
args.append(Nose.COVER_XML_PARAM)
args.append('%s=%s' % (Nose.COVER_XML_FILE_PARAM, options[Nose.COVER_XML_FILE]))
if options[Nose.COVER_HTML]:
args.append(Nose.COVER_HTML_PARAM)
args.append('%s=%s' % (Nose.COVER_HTML_DIR_PARAM, options[Nose.COVER_HTML_DIR]))
if options[Nose.COVER_BRANCHES]:
args.append(Nose.COVER_BRANCHES_PARAM)
command = '%s %s' % (Nose.NOSE_TESTS, ' '.join(args))
os.system(command)
if Nose.WITH_COVERAGE_PARAM in args:
os.remove(Nose.COVERAGE_FILE)
Example 8
Project: arm_now Author: nongiach File: arm_now.py MIT License 6 votes vote down vote up
def run_qemu(arch, kernel, dtb, rootfs, add_qemu_options):
dtb = "" if not os.path.exists(dtb) else "-dtb {}".format(dtb)
options = qemu_options[arch][1].format(arch=arch, kernel=kernel, rootfs=rootfs, dtb=dtb)
arch = qemu_options[arch][0]
print("Starting qemu-system-{}".format(arch))
qemu_config = "-serial stdio -monitor null {add_qemu_options}".format(add_qemu_options=add_qemu_options)
cmd = """stty intr ^]
export QEMU_AUDIO_DRV="none"
qemu-system-{arch} {options} \
-m 256M \
-nographic \
{qemu_config} \
{dtb} \
-no-reboot
stty intr ^c
""".format(arch=arch, qemu_config=qemu_config, options=options, dtb=dtb)
pgreen(cmd)
os.system(cmd)
Example 9
Project: arm_now Author: nongiach File: arm_now.py MIT License 6 votes vote down vote up
def check_dependencies_or_exit():
dependencies = [
which("e2cp",
ubuntu="apt-get install e2tools",
arch="yaourt -S e2tools",
darwin="brew install e2tools gettext e2fsprogs\nbrew unlink e2fsprogs && brew link e2fsprogs -f"),
which("qemu-system-arm",
ubuntu="apt-get install qemu",
kali="apt-get install qemu-system",
arch="pacman -S qemu-arch-extra",
darwin="brew install qemu"),
which("unzip",
ubuntu="apt-get install unzip",
arch="pacman -S unzip",
darwin="brew install unzip")
]
if not all(dependencies):
print("requirements missing, plz install them", file=sys.stderr)
sys.exit(1)
Example 10
Project: GIG Author: palash25 File: gig.py MIT License 6 votes vote down vote up
def generate(self, arg):
if not self.git_init():
click.echo(
click.style(
"[WARN] Git is not initialized yet", fg='yellow'))
if click.confirm(
'Do you want to initialize GIT in this directory?',
abort=False):
os.system('git init .')
else:
click.echo(
click.style(
"[INFO] GITIGNORE was not generated.", fg='blue'))
quit()
if self.gi_not_exists(self.__dest):
self.process(arg)
else:
click.echo(
click.style(
"[WARN] GITINGNORE already exists.", fg='yellow'))
if click.confirm('Do you want to overwrite?', abort=False):
self.process(arg)
Example 11
Project: keras_mixnets Author: titu1994 File: setup.py MIT License 6 votes vote down vote up
def run(self):
try:
self.status('Removing previous builds...')
rmtree(os.path.join(base_path, 'dist'))
except OSError:
pass
self.status('Building Source and Wheel (universal) distribution...')
os.system('{0} setup.py sdist bdist_wheel'.format(sys.executable))
self.status('Pushing git tags...')
os.system('git tag v{0}'.format(get_version()))
os.system('git push --tags')
try:
self.status('Removing build artifacts...')
rmtree(os.path.join(base_path, 'build'))
rmtree(os.path.join(base_path, '{}.egg-info'.format(PACKAGE_NAME)))
except OSError:
pass
sys.exit()
Example 12
Project: Att-ChemdNER Author: lingluodlut File: utils.py Apache License 2.0 6 votes vote down vote up
def get_perf(filename):
''' run conlleval.pl perl script to obtain
precision/recall and F1 score '''
_conlleval = PREFIX + 'conlleval'
if not isfile(_conlleval):
#download('http://www-etud.iro.umontreal.ca/~mesnilgr/atis/conlleval.pl')
os.system('wget https://www.comp.nus.edu.sg/%7Ekanmy/courses/practicalNLP_2008/packages/conlleval.pl')
chmod('conlleval.pl', stat.S_IRWXU) # give the execute permissions
out = []
proc = subprocess.Popen(["perl", _conlleval], stdin=subprocess.PIPE, stdout=subprocess.PIPE)
stdout, _ = proc.communicate(open(filename).read())
for line in stdout.split('\n'):
if 'accuracy' in line:
out = line.split()
break
# out = ['accuracy:', '16.26%;', 'precision:', '0.00%;', 'recall:', '0.00%;', 'FB1:', '0.00']
precision = float(out[3][:-2])
recall = float(out[5][:-2])
f1score = float(out[7])
return {'p':precision, 'r':recall, 'f1':f1score}
Example 13
Project: Mzo-Cli Author: jamesstidard File: setup.py MIT License 6 votes vote down vote up
def run(self):
try:
self.status('Removing previous builds…')
rmtree(os.path.join(here, 'dist'))
except OSError:
pass
self.status('Building Source and Wheel (universal) distribution…')
os.system('{0} setup.py sdist bdist_wheel --universal'.format(sys.executable))
self.status('Uploading the package to PyPi via Twine…')
os.system('twine upload dist/*')
self.status('Pushing git tags…')
os.system('git tag v{0}'.format(about['__version__']))
os.system('git push --tags')
sys.exit()
# Where the magic happens:
Example 14
Project: twitter-export-image-fill Author: mwichary File: twitter-export-image-fill.py The Unlicense 6 votes vote down vote up
def download_video(url, local_filename):
if not download_videos:
return True
try:
local_filename_escaped = local_filename.replace(' ', '\ ')
command = '%s -q --no-warnings %s --exec \'mv {} %s\' &>/dev/null' % \
(youtube_dl_path, url, local_filename_escaped)
if os.system(command) > 0:
return False
if os.path.isfile(local_filename):
return True
else:
return False
except:
return False
# Downloads an avatar image for a tweet.
# @return Whether data was rewritten
Example 15
Project: AutoDL Author: tanguofu File: param.py BSD 3-Clause "New" or "Revised" License 6 votes vote down vote up
def reconfigure(self):
param = self.param
param.gpu_nums = gpu.get_nr_gpu()
# TODO compute the minibatch by GPU MEM
param.all_step = max(int(param.epoch * param.train_nums / param.minibatch), 10)
param.step_per_epoch = max(int(param.train_nums / param.minibatch), 1)
param.batch_size = max(int(param.minibatch / param.gpu_nums), 1)
param.minibatch = param.batch_size*param.gpu_nums
#this is nessary compute lr with epoch
param.train_nums = (param.train_nums // param.minibatch) * param.minibatch
#update checkoint name for easy run mulitimes
param.checkpoint = param.checkpoint + "/" + "_".join([ param.name, "batch"+str(param.minibatch), "layer"+str(param.resnet_layer)])
if not os.path.exists(param.checkpoint):
os.system("mkdir -p " + param.checkpoint)
logging.info("reconfigure:"+repr(self.param))
Example 16
Project: Shellware Author: NullArray File: shellware.py GNU General Public License v3.0 6 votes vote down vote up
def autorun(dir, fileName, run):
# Copy to C:\Users
os.system('copy %s %s'%(fileName, dir))
# Queries Windows registry for the autorun key value
# Stores the key values in runkey array
key = OpenKey(HKEY_LOCAL_MACHINE, run)
runkey =[]
try:
i = 0
while True:
subkey = EnumValue(key, i)
runkey.append(subkey[0])
i += 1
except WindowsError:
pass
# Set key
if 'foobar' not in runkey:
try:
key= OpenKey(HKEY_LOCAL_MACHINE, run,0,KEY_ALL_ACCESS)
SetValueEx(key ,'foobar',0,REG_SZ,r"C:\Users\shellware.exe")
key.Close()
except WindowsError:
pass
Example 17
Project: CACConsole Author: foospidy File: CloudAtCostConsole.py GNU General Public License v2.0 6 votes vote down vote up
def do_ping(self, serverid):
"""ping: Ping a server. Usage: ping [<serverid>|all] """
if not self.using:
self.sendLine('No account selected! Type: help use')
return
servers = self.cac.get_server_info()
for i in range(0, len(servers)):
server_data = servers[i]
sid = server_data['sid'].encode('UTF-8')
ip = server_data['ip'].encode('UTF-8')
if 'all' == serverid:
response = os.system('ping -c 3 ' + ip)
elif serverid == sid:
response = os.system('ping -c 3 ' + ip)
Example 18
Project: mycode Author: gmraabe File: usopen.py GNU General Public License v3.0 5 votes vote down vote up
def ping_router(hostname):
response = os.system("ping -c 1 " + hostname)
#and then check the response...
if response == 0:
return True
else:
return False
## Check interfaces - Issue "show ip init brief"
Example 19
Project: mycode Author: gmraabe File: r2-d2.py GNU General Public License v3.0 5 votes vote down vote up
def ping_router(hostname):
response = os.system("ping -c 1 " + hostname)
#and then check the response...
if response == 0:
return True
else:
return False
## Check interfaces - Issue "show ip init brief"
Example 20
Project: malcode Author: moonsea File: filtersamemd5.py GNU General Public License v3.0 5 votes vote down vote up
def genAsm(filepath, total, asmpath):
ExecStr = "ndisasm -a -u '" + filepath + "' > " + asmpath
# print ExecStr
res = os.system(ExecStr)
log('asming', filepath + '(' + asmpath + ') :' + str(res), subpath='ndisasm')
return total + 1
Example 21
Project: malcode Author: moonsea File: wingenasm.py GNU General Public License v3.0 5 votes vote down vote up
def genAsm(filepath, total):
ExecStr = idalPath + " -c -A -S" + idcPath + " '" + filepath + "'"
# print ExecStr
os.system(ExecStr)
return total + 1
Example 22
Project: malcode Author: moonsea File: virusgenasm.py GNU General Public License v3.0 5 votes vote down vote up
def genAsm(filepath, total, asmpath):
ExecStr = "ndisasm -a -u '" + filepath + "' > " + asmpath
# print ExecStr
res = os.system(ExecStr)
log('asming', filepath + '(' + asmpath + ') :' + str(res), subpath='ndisasm')
return total + 1
Example 23
Project: malcode Author: moonsea File: winfailgenasm.py GNU General Public License v3.0 5 votes vote down vote up
def genAsm(filepath):
ExecStr = idalPath + " -c -A -S" + idcPath + " " + filepath
# print ExecStr
os.system(ExecStr)
Example 24
Project: malcode Author: moonsea File: dosgenasm.py GNU General Public License v3.0 5 votes vote down vote up
def genAsm(filepath, total):
ExecStr = idalPath + " -c -A -S" + idcPath + " \"" + filepath + "\""
# print ExecStr
os.system(ExecStr)
return total + 1
Example 25
Project: photometry-sans-frustration Author: mnicholl File: queryPS1.py MIT License 5 votes vote down vote up
def PS1cutouts(ra,dec,filt):
print '\nSearching for PS1 images of field...\n'
ps1_url = 'http://ps1images.stsci.edu/cgi-bin/ps1filenames.py?'
ps1_url += '&ra='+str(ra)
ps1_url += '&dec='+str(dec)
ps1_url += '&filters='+filt
ps1_im = requests.get(ps1_url)
try:
image_name = ps1_im.text.split()[17]
print 'Image found: ' + image_name + '\n'
cutout_url = 'http://ps1images.stsci.edu/cgi-bin/fitscut.cgi?&filetypes=stack&size=2500'
cutout_url += '&ra='+str(ra)
cutout_url += '&dec='+str(dec)
cutout_url += '&filters='+filt
cutout_url += '&format=fits'
cutout_url += '&red='+image_name
dest_file = filt + '_template.fits'
cmd = 'wget -O %s "%s"' % (dest_file, cutout_url)
os.system(cmd)
print 'Template downloaded as ' + dest_file + '\n'
except:
print '\nPS1 template search failed!\n'
Example 26
Project: pyblish-win Author: pyblish File: xxci.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def go(args):
for file in args:
print file + ':'
if differing(file):
showdiffs(file)
if askyesno('Check in ' + file + ' ? '):
sts = os.system('rcs -l ' + file) # ignored
sts = os.system('ci -l ' + file)
Example 27
Project: pyblish-win Author: pyblish File: xxci.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def differing(file):
cmd = 'co -p ' + file + ' 2>/dev/null | cmp -s - ' + file
sts = os.system(cmd)
return sts != 0
Example 28
Project: pyblish-win Author: pyblish File: xxci.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def showdiffs(file):
cmd = 'rcsdiff ' + file + ' 2>&1 | ${PAGER-more}'
sts = os.system(cmd)
Example 29
Project: pyblish-win Author: pyblish File: pytree_idempotency.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def diff(fn, tree):
f = open("@", "w")
try:
f.write(str(tree))
finally:
f.close()
try:
return os.system("diff -u %s @" % fn)
finally:
os.remove("@")
Example 30
Project: pyblish-win Author: pyblish File: _osx_support.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def _get_system_version():
"""Return the OS X system version as a string"""
# Reading this plist is a documented way to get the system
# version (see the documentation for the Gestalt Manager)
# We avoid using platform.mac_ver to avoid possible bootstrap issues during
# the build of Python itself (distutils is used to build standard library
# extensions).
global _SYSTEM_VERSION
if _SYSTEM_VERSION is None:
_SYSTEM_VERSION = ''
try:
f = open('/System/Library/CoreServices/SystemVersion.plist')
except IOError:
# We're on a plain darwin box, fall back to the default
# behaviour.
pass
else:
try:
m = re.search(r'<key>ProductUserVisibleVersion</key>\s*'
r'<string>(.*?)</string>', f.read())
finally:
f.close()
if m is not None:
_SYSTEM_VERSION = '.'.join(m.group(1).split('.')[:2])
# else: fall back to the default behaviour
return _SYSTEM_VERSION
Example 31
Project: pyblish-win Author: pyblish File: _osx_support.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def _supports_universal_builds():
"""Returns True if universal builds are supported on this system"""
# As an approximation, we assume that if we are running on 10.4 or above,
# then we are running with an Xcode environment that supports universal
# builds, in particular -isysroot and -arch arguments to the compiler. This
# is in support of allowing 10.4 universal builds to run on 10.3.x systems.
osx_version = _get_system_version()
if osx_version:
try:
osx_version = tuple(int(i) for i in osx_version.split('.'))
except ValueError:
osx_version = ''
return bool(osx_version >= (10, 4)) if osx_version else False
Example 32
Project: pyblish-win Author: pyblish File: _osx_support.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def _remove_unsupported_archs(_config_vars):
"""Remove any unsupported archs from config vars"""
# Different Xcode releases support different sets for '-arch'
# flags. In particular, Xcode 4.x no longer supports the
# PPC architectures.
#
# This code automatically removes '-arch ppc' and '-arch ppc64'
# when these are not supported. That makes it possible to
# build extensions on OSX 10.7 and later with the prebuilt
# 32-bit installer on the python.org website.
# skip checks if the compiler was overriden with a CC env variable
if 'CC' in os.environ:
return _config_vars
if re.search('-arch\s+ppc', _config_vars['CFLAGS']) is not None:
# NOTE: Cannot use subprocess here because of bootstrap
# issues when building Python itself
status = os.system(
"""echo 'int main{};' | """
"""'%s' -c -arch ppc -x c -o /dev/null /dev/null 2>/dev/null"""
%(_config_vars['CC'].replace("'", "'\"'\"'"),))
if status:
# The compile failed for some reason. Because of differences
# across Xcode and compiler versions, there is no reliable way
# to be sure why it failed. Assume here it was due to lack of
# PPC support and remove the related '-arch' flags from each
# config variables not explicitly overriden by an environment
# variable. If the error was for some other reason, we hope the
# failure will show up again when trying to compile an extension
# module.
for cv in _UNIVERSAL_CONFIG_VARS:
if cv in _config_vars and cv not in os.environ:
flags = _config_vars[cv]
flags = re.sub('-arch\s+ppc\w*\s', ' ', flags)
_save_modified_value(_config_vars, cv, flags)
return _config_vars
Example 33
Project: pyblish-win Author: pyblish File: _osx_support.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def customize_config_vars(_config_vars):
"""Customize Python build configuration variables.
Called internally from sysconfig with a mutable mapping
containing name/value pairs parsed from the configured
makefile used to build this interpreter. Returns
the mapping updated as needed to reflect the environment
in which the interpreter is running; in the case of
a Python from a binary installer, the installed
environment may be very different from the build
environment, i.e. different OS levels, different
built tools, different available CPU architectures.
This customization is performed whenever
distutils.sysconfig.get_config_vars() is first
called. It may be used in environments where no
compilers are present, i.e. when installing pure
Python dists. Customization of compiler paths
and detection of unavailable archs is deferred
until the first extension module build is
requested (in distutils.sysconfig.customize_compiler).
Currently called from distutils.sysconfig
"""
if not _supports_universal_builds():
# On Mac OS X before 10.4, check if -arch and -isysroot
# are in CFLAGS or LDFLAGS and remove them if they are.
# This is needed when building extensions on a 10.3 system
# using a universal build of python.
_remove_universal_flags(_config_vars)
# Allow user to override all archs with ARCHFLAGS env var
_override_all_archs(_config_vars)
# Remove references to sdks that are not found
_check_for_unavailable_sdk(_config_vars)
return _config_vars
Example 34
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def __init__(self, cmd, capturestderr=False, bufsize=-1):
"""The parameter 'cmd' is the shell command to execute in a
sub-process. On UNIX, 'cmd' may be a sequence, in which case arguments
will be passed directly to the program without shell intervention (as
with os.spawnv()). If 'cmd' is a string it will be passed to the shell
(as with os.system()). The 'capturestderr' flag, if true, specifies
that the object should capture standard error output of the child
process. The default is false. If the 'bufsize' parameter is
specified, it specifies the size of the I/O buffers to/from the child
process."""
_cleanup()
self.cmd = cmd
p2cread, p2cwrite = os.pipe()
c2pread, c2pwrite = os.pipe()
if capturestderr:
errout, errin = os.pipe()
self.pid = os.fork()
if self.pid == 0:
# Child
os.dup2(p2cread, 0)
os.dup2(c2pwrite, 1)
if capturestderr:
os.dup2(errin, 2)
self._run_child(cmd)
os.close(p2cread)
self.tochild = os.fdopen(p2cwrite, 'w', bufsize)
os.close(c2pwrite)
self.fromchild = os.fdopen(c2pread, 'r', bufsize)
if capturestderr:
os.close(errin)
self.childerr = os.fdopen(errout, 'r', bufsize)
else:
self.childerr = None
Example 35
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def popen2(cmd, bufsize=-1, mode='t'):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd' may
be a sequence, in which case arguments will be passed directly to the
program without shell intervention (as with os.spawnv()). If 'cmd' is a
string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdout, child_stdin) are returned."""
w, r = os.popen2(cmd, mode, bufsize)
return r, w
Example 36
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def popen4(cmd, bufsize=-1, mode='t'):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd' may
be a sequence, in which case arguments will be passed directly to the
program without shell intervention (as with os.spawnv()). If 'cmd' is a
string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdout_stderr, child_stdin) are returned."""
w, r = os.popen4(cmd, mode, bufsize)
return r, w
Example 37
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def popen2(cmd, bufsize=-1, mode='t'):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd' may
be a sequence, in which case arguments will be passed directly to the
program without shell intervention (as with os.spawnv()). If 'cmd' is a
string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdout, child_stdin) are returned."""
inst = Popen3(cmd, False, bufsize)
return inst.fromchild, inst.tochild
Example 38
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def popen3(cmd, bufsize=-1, mode='t'):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd' may
be a sequence, in which case arguments will be passed directly to the
program without shell intervention (as with os.spawnv()). If 'cmd' is a
string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdout, child_stdin, child_stderr) are returned."""
inst = Popen3(cmd, True, bufsize)
return inst.fromchild, inst.tochild, inst.childerr
Example 39
Project: pyblish-win Author: pyblish File: popen2.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def popen4(cmd, bufsize=-1, mode='t'):
"""Execute the shell command 'cmd' in a sub-process. On UNIX, 'cmd' may
be a sequence, in which case arguments will be passed directly to the
program without shell intervention (as with os.spawnv()). If 'cmd' is a
string it will be passed to the shell (as with os.system()). If
'bufsize' is specified, it sets the buffer size for the I/O pipes. The
file objects (child_stdout_stderr, child_stdin) are returned."""
inst = Popen4(cmd, bufsize)
return inst.fromchild, inst.tochild
Example 40
Project: pyblish-win Author: pyblish File: pydoc.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def getpager():
"""Decide what method to use for paging through text."""
if type(sys.stdout) is not types.FileType:
return plainpager
if not hasattr(sys.stdin, "isatty"):
return plainpager
if not sys.stdin.isatty() or not sys.stdout.isatty():
return plainpager
if 'PAGER' in os.environ:
if sys.platform == 'win32': # pipes completely broken in Windows
return lambda text: tempfilepager(plain(text), os.environ['PAGER'])
elif os.environ.get('TERM') in ('dumb', 'emacs'):
return lambda text: pipepager(plain(text), os.environ['PAGER'])
else:
return lambda text: pipepager(text, os.environ['PAGER'])
if os.environ.get('TERM') in ('dumb', 'emacs'):
return plainpager
if sys.platform == 'win32' or sys.platform.startswith('os2'):
return lambda text: tempfilepager(plain(text), 'more <')
if hasattr(os, 'system') and os.system('(less) 2>/dev/null') == 0:
return lambda text: pipepager(text, 'less')
import tempfile
(fd, filename) = tempfile.mkstemp()
os.close(fd)
try:
if hasattr(os, 'system') and os.system('more "%s"' % filename) == 0:
return lambda text: pipepager(text, 'more')
else:
return ttypager
finally:
os.unlink(filename)
Example 41
Project: pyblish-win Author: pyblish File: pydoc.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def tempfilepager(text, cmd):
"""Page through text by invoking a program on a temporary file."""
import tempfile
filename = tempfile.mktemp()
file = open(filename, 'w')
file.write(_encode(text))
file.close()
try:
os.system(cmd + ' "' + filename + '"')
finally:
os.unlink(filename)
Example 42
Project: pyblish-win Author: pyblish File: mhlib.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def test():
global mh, f
os.system('rm -rf $HOME/Mail/@test')
mh = MH()
def do(s): print s; print eval(s)
do('mh.listfolders()')
do('mh.listallfolders()')
testfolders = ['@test', '@test/test1', '@test/test2',
'@test/test1/test11', '@test/test1/test12',
'@test/test1/test11/test111']
for t in testfolders: do('mh.makefolder(%r)' % (t,))
do('mh.listsubfolders(\'@test\')')
do('mh.listallsubfolders(\'@test\')')
f = mh.openfolder('@test')
do('f.listsubfolders()')
do('f.listallsubfolders()')
do('f.getsequences()')
seqs = f.getsequences()
seqs['foo'] = IntSet('1-10 12-20', ' ').tolist()
print seqs
f.putsequences(seqs)
do('f.getsequences()')
for t in reversed(testfolders): do('mh.deletefolder(%r)' % (t,))
do('mh.getcontext()')
context = mh.getcontext()
f = mh.openfolder(context)
do('f.getcurrent()')
for seq in ('first', 'last', 'cur', '.', 'prev', 'next',
'first:3', 'last:3', 'cur:3', 'cur:-3',
'prev:3', 'next:3',
'1:3', '1:-3', '100:3', '100:-3', '10000:3', '10000:-3',
'all'):
try:
do('f.parsesequence(%r)' % (seq,))
except Error, msg:
print "Error:", msg
stuff = os.popen("pick %r 2>/dev/null" % (seq,)).read()
list = map(int, stuff.split())
print list, "<-- pick"
Example 43
Project: pyblish-win Author: pyblish File: pdb.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def help():
for dirname in sys.path:
fullname = os.path.join(dirname, 'pdb.doc')
if os.path.exists(fullname):
sts = os.system('${PAGER-more} '+fullname)
if sts: print '*** Pager exit status:', sts
break
else:
print 'Sorry, can\'t find the help file "pdb.doc"',
print 'along the Python search path'
Example 44
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def __init__(self,cmd,mode='r',bufsize=None):
if mode != 'r':
raise ValueError,'popen()-emulation only supports read mode'
import tempfile
self.tmpfile = tmpfile = tempfile.mktemp()
os.system(cmd + ' > %s' % tmpfile)
self.pipe = open(tmpfile,'rb')
self.bufsize = bufsize
self.mode = mode
Example 45
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def _syscmd_ver(system='', release='', version='',
supported_platforms=('win32','win16','dos','os2')):
""" Tries to figure out the OS version used and returns
a tuple (system,release,version).
It uses the "ver" shell command for this which is known
to exists on Windows, DOS and OS/2. XXX Others too ?
In case this fails, the given parameters are used as
defaults.
"""
if sys.platform not in supported_platforms:
return system,release,version
# Try some common cmd strings
for cmd in ('ver','command /c ver','cmd /c ver'):
try:
pipe = popen(cmd)
info = pipe.read()
if pipe.close():
raise os.error,'command failed'
# XXX How can I suppress shell errors from being written
# to stderr ?
except os.error,why:
#print 'Command %s failed: %s' % (cmd,why)
continue
except IOError,why:
#print 'Command %s failed: %s' % (cmd,why)
continue
Example 46
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def _platform(*args):
""" Helper to format the platform string in a filename
compatible format e.g. "system-version-machine".
"""
# Format the platform string
platform = string.join(
map(string.strip,
filter(len, args)),
'-')
# Cleanup some possible filename obstacles...
replace = string.replace
platform = replace(platform,' ','_')
platform = replace(platform,'/','-')
platform = replace(platform,'\\','-')
platform = replace(platform,':','-')
platform = replace(platform,';','-')
platform = replace(platform,'"','-')
platform = replace(platform,'(','-')
platform = replace(platform,')','-')
# No need to report 'unknown' information...
platform = replace(platform,'unknown','')
# Fold '--'s and remove trailing '-'
while 1:
cleaned = replace(platform,'--','-')
if cleaned == platform:
break
platform = cleaned
while platform[-1] == '-':
platform = platform[:-1]
return platform
Example 47
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def system():
""" Returns the system/OS name, e.g. 'Linux', 'Windows' or 'Java'.
An empty string is returned if the value cannot be determined.
"""
return uname()[0]
Example 48
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def release():
""" Returns the system's release, e.g. '2.2.0' or 'NT'
An empty string is returned if the value cannot be determined.
"""
return uname()[2]
Example 49
Project: pyblish-win Author: pyblish File: platform.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def version():
""" Returns the system's release version, e.g. '#3 on degas'
An empty string is returned if the value cannot be determined.
"""
return uname()[3]
Example 50
Project: pyblish-win Author: pyblish File: test_xpickle.py GNU Lesser General Public License v3.0 5 votes vote down vote up
def have_python_version(name):
"""Check whether the given name is a valid Python binary and has
test.test_support.
This respects your PATH.
Args:
name: short string name of a Python binary such as "python2.4".
Returns:
True if the name is valid, False otherwise.
"""
return os.system(name + " -c 'import test.test_support'") == 0
|
{
"url": "https://www.programcreek.com/python/example/74/os.system",
"source_domain": "www.programcreek.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "155249",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M7GJ5PJI4V7QMH5J5457J6VROFJ6ABZB",
"WARC-Concurrent-To": "<urn:uuid:e4a229bf-0c47-43d7-9ad1-04657d87f830>",
"WARC-Date": "2020-01-28T09:41:25Z",
"WARC-IP-Address": "104.25.252.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QAOO3WHMV7OIHF3WCWIMYOOWE4LBK45D",
"WARC-Record-ID": "<urn:uuid:70599377-cbe2-4834-9509-ddf6b54c9f75>",
"WARC-Target-URI": "https://www.programcreek.com/python/example/74/os.system",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1c96c014-5054-4732-b7a4-e50301623c86>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43.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,
28,
29,
216,
217,
227,
358,
391,
450,
504,
559,
613,
656,
678,
687,
711,
754,
778,
821,
855,
856,
895,
959,
1025,
1035,
1161,
1185,
1251,
1293,
1326,
1363,
1397,
1407,
1440,
1478,
1492,
1535,
1572,
1628,
1690,
1710,
1711,
1712,
1735,
1745,
1871,
1946,
1987,
1988,
2058,
2124,
2193,
2211,
2212,
2220,
2262,
2331,
2353,
2377,
2430,
2476,
2501,
2560,
2586,
2609,
2619,
2745,
2757,
2772,
2793,
2818,
2837,
2852,
2893,
2924,
2950,
3005,
3024,
3051,
3074,
3135,
3159,
3205,
3219,
3259,
3296,
3316,
3359,
3369,
3490,
3529,
3610,
3692,
3776,
3857,
3941,
4011,
4039,
4112,
4177,
4178,
4208,
4243,
4316,
4391,
4440,
4478,
4488,
4609,
4648,
4729,
4811,
4895,
4976,
5060,
5137,
5165,
5238,
5303,
5304,
5334,
5369,
5442,
5517,
5592,
5630,
5640,
5741,
5777,
5799,
5800,
5837,
5884,
5969,
6033,
6083,
6201,
6237,
6283,
6376,
6413,
6460,
6553,
6594,
6645,
6646,
6708,
6735,
6736,
6781,
6824,
6834,
6930,
6989,
7056,
7149,
7182,
7232,
7341,
7367,
7403,
7441,
7466,
7494,
7525,
7548,
7574,
7594,
7671,
7687,
7707,
7717,
7813,
7847,
7868,
7894,
7944,
7986,
8101,
8138,
8187,
8241,
8293,
8340,
8367,
8415,
8455,
8500,
8514,
8544,
8617,
8638,
8649,
8737,
8762,
8794,
8818,
8847,
8918,
8948,
9020,
9054,
9094,
9112,
9140,
9173,
9248,
9271,
9272,
9316,
9346,
9360,
9384,
9413,
9484,
9556,
9591,
9602,
9702,
9717,
9730,
9785,
9837,
9861,
9878,
9879,
9956,
10031,
10032,
10075,
10131,
10168,
10169,
10182,
10237,
10290,
10370,
10394,
10411,
10412,
10432,
10443,
10552,
10576,
10623,
10661,
10699,
10730,
10813,
10924,
10999,
11004,
11017,
11114,
11170,
11206,
11237,
11268,
11286,
11291,
11389,
11424,
11459,
11489,
11490,
11544,
11555,
11653,
11668,
11681,
11734,
11781,
11805,
11822,
11823,
11898,
11985,
11986,
12050,
12091,
12092,
12133,
12196,
12233,
12234,
12253,
12254,
12255,
12283,
12294,
12428,
12469,
12495,
12511,
12512,
12519,
12582,
12657,
12712,
12743,
12762,
12801,
12819,
12829,
12848,
12858,
12875,
12876,
12877,
12918,
12956,
12967,
13088,
13111,
13138,
13139,
13181,
13190,
13238,
13326,
13405,
13478,
13536,
13537,
13585,
13668,
13673,
13727,
13866,
13871,
13920,
13975,
13984,
14039,
14050,
14171,
14204,
14224,
14265,
14266,
14320,
14361,
14401,
14413,
14419,
14427,
14441,
14471,
14499,
14509,
14531,
14538,
14539,
14550,
14578,
14585,
14643,
14707,
14722,
14745,
14754,
14765,
14895,
14924,
14983,
15004,
15060,
15070,
15073,
15112,
15113,
15148,
15176,
15228,
15279,
15283,
15308,
15352,
15377,
15422,
15433,
15546,
15573,
15574,
15624,
15625,
15661,
15683,
15703,
15713,
15734,
15735,
15785,
15796,
15908,
15935,
15985,
16021,
16043,
16063,
16073,
16094,
16095,
16145,
16156,
16277,
16315,
16377,
16397,
16426,
16508,
16509,
16531,
16542,
16659,
16688,
16759,
16779,
16802,
16803,
16825,
16836,
16955,
16993,
17055,
17075,
17104,
17186,
17187,
17209,
17220,
17341,
17363,
17427,
17447,
17471,
17482,
17599,
17628,
17701,
17721,
17744,
17745,
17767,
17778,
17895,
17924,
17925,
17978,
17979,
18047,
18048,
18078,
18110,
18142,
18143,
18178,
18179,
18188,
18233,
18234,
18284,
18285,
18382,
18383,
18420,
18459,
18498,
18535,
18576,
18577,
18621,
18622,
18680,
18681,
18704,
18705,
18764,
18765,
18777,
18826,
18837,
18960,
18974,
18996,
19021,
19049,
19077,
19130,
19190,
19240,
19251,
19374,
19395,
19457,
19482,
19503,
19514,
19637,
19658,
19712,
19738,
19749,
19886,
19906,
19929,
19938,
19965,
19978,
19996,
20005,
20051,
20064,
20088,
20099,
20230,
20257,
20310,
20373,
20435,
20515,
20593,
20612,
20613,
20640,
20641,
20673,
20702,
20715,
20788,
20812,
20880,
20905,
20922,
20936,
20953,
21026,
21093,
21114,
21140,
21170,
21240,
21295,
21296,
21324,
21335,
21466,
21500,
21572,
21650,
21726,
21806,
21886,
21887,
21927,
21947,
21960,
22032,
22059,
22088,
22155,
22166,
22297,
22342,
22398,
22464,
22525,
22550,
22556,
22624,
22686,
22749,
22799,
22800,
22871,
22898,
22926,
22927,
22996,
23060,
23105,
23133,
23173,
23249,
23309,
23328,
23402,
23477,
23552,
23625,
23699,
23776,
23853,
23875,
23921,
23985,
24030,
24097,
24163,
24164,
24189,
24200,
24331,
24372,
24427,
24428,
24488,
24547,
24601,
24662,
24718,
24770,
24823,
24876,
24932,
24933,
24978,
25029,
25082,
25135,
25186,
25237,
25283,
25342,
25343,
25389,
25397,
25398,
25439,
25503,
25567,
25634,
25679,
25725,
25726,
25788,
25826,
25827,
25878,
25923,
25924,
25949,
25960,
26085,
26143,
26211,
26291,
26369,
26449,
26527,
26601,
26672,
26750,
26770,
26789,
26812,
26850,
26888,
26914,
26952,
26981,
27007,
27027,
27059,
27092,
27122,
27156,
27189,
27215,
27272,
27299,
27357,
27383,
27411,
27471,
27485,
27519,
27530,
27655,
27694,
27774,
27852,
27932,
28004,
28083,
28149,
28194,
28215,
28226,
28351,
28390,
28470,
28548,
28628,
28700,
28779,
28852,
28897,
28918,
28929,
29054,
29093,
29173,
29251,
29331,
29403,
29482,
29548,
29591,
29636,
29647,
29772,
29811,
29891,
29969,
30049,
30121,
30200,
30280,
30322,
30382,
30393,
30518,
30557,
30637,
30715,
30795,
30867,
30946,
31019,
31055,
31100,
31111,
31235,
31251,
31312,
31359,
31385,
31426,
31452,
31510,
31536,
31566,
31639,
31719,
31777,
31853,
31867,
31936,
31988,
32014,
32080,
32145,
32216,
32268,
32269,
32289,
32329,
32346,
32355,
32432,
32488,
32502,
32530,
32543,
32572,
32583,
32707,
32737,
32808,
32828,
32861,
32892,
32922,
32939,
32948,
32995,
33008,
33037,
33048,
33172,
33184,
33201,
33242,
33256,
33294,
33321,
33351,
33409,
33472,
33521,
33578,
33617,
33659,
33690,
33719,
33751,
33778,
33806,
33859,
33874,
33899,
33926,
33995,
34021,
34051,
34082,
34107,
34168,
34224,
34260,
34333,
34357,
34370,
34417,
34444,
34476,
34540,
34579,
34611,
34622,
34744,
34756,
34785,
34837,
34874,
34929,
34985,
35003,
35013,
35073,
35119,
35130,
35257,
35303,
35304,
35328,
35401,
35425,
35476,
35519,
35558,
35589,
35615,
35626,
35753,
35804,
35805,
35872,
35873,
35933,
35975,
35976,
36040,
36101,
36102,
36163,
36181,
36182,
36190,
36238,
36276,
36277,
36311,
36365,
36378,
36408,
36439,
36468,
36516,
36585,
36615,
36644,
36699,
36720,
36748,
36803,
36825,
36836,
36963,
36985,
36986,
37045,
37102,
37110,
37143,
37171,
37197,
37229,
37242,
37243,
37293,
37322,
37363,
37404,
37446,
37487,
37528,
37569,
37610,
37651,
37652,
37701,
37747,
37748,
37789,
37802,
37847,
37879,
37897,
37924,
37955,
37988,
37989,
38010,
38021,
38148,
38162,
38163,
38234,
38235,
38306,
38307,
38315,
38338,
38349,
38476,
38491,
38492,
38551,
38552,
38623,
38624,
38632,
38655,
38666,
38793,
38808,
38809,
38874,
38875,
38946,
38947,
38955,
38978,
38989,
39120,
39151,
39220,
39243,
39244,
39273,
39274,
39284,
39356,
39357,
39370,
39422,
39430
],
"line_end_idx": [
28,
29,
216,
217,
227,
358,
391,
450,
504,
559,
613,
656,
678,
687,
711,
754,
778,
821,
855,
856,
895,
959,
1025,
1035,
1161,
1185,
1251,
1293,
1326,
1363,
1397,
1407,
1440,
1478,
1492,
1535,
1572,
1628,
1690,
1710,
1711,
1712,
1735,
1745,
1871,
1946,
1987,
1988,
2058,
2124,
2193,
2211,
2212,
2220,
2262,
2331,
2353,
2377,
2430,
2476,
2501,
2560,
2586,
2609,
2619,
2745,
2757,
2772,
2793,
2818,
2837,
2852,
2893,
2924,
2950,
3005,
3024,
3051,
3074,
3135,
3159,
3205,
3219,
3259,
3296,
3316,
3359,
3369,
3490,
3529,
3610,
3692,
3776,
3857,
3941,
4011,
4039,
4112,
4177,
4178,
4208,
4243,
4316,
4391,
4440,
4478,
4488,
4609,
4648,
4729,
4811,
4895,
4976,
5060,
5137,
5165,
5238,
5303,
5304,
5334,
5369,
5442,
5517,
5592,
5630,
5640,
5741,
5777,
5799,
5800,
5837,
5884,
5969,
6033,
6083,
6201,
6237,
6283,
6376,
6413,
6460,
6553,
6594,
6645,
6646,
6708,
6735,
6736,
6781,
6824,
6834,
6930,
6989,
7056,
7149,
7182,
7232,
7341,
7367,
7403,
7441,
7466,
7494,
7525,
7548,
7574,
7594,
7671,
7687,
7707,
7717,
7813,
7847,
7868,
7894,
7944,
7986,
8101,
8138,
8187,
8241,
8293,
8340,
8367,
8415,
8455,
8500,
8514,
8544,
8617,
8638,
8649,
8737,
8762,
8794,
8818,
8847,
8918,
8948,
9020,
9054,
9094,
9112,
9140,
9173,
9248,
9271,
9272,
9316,
9346,
9360,
9384,
9413,
9484,
9556,
9591,
9602,
9702,
9717,
9730,
9785,
9837,
9861,
9878,
9879,
9956,
10031,
10032,
10075,
10131,
10168,
10169,
10182,
10237,
10290,
10370,
10394,
10411,
10412,
10432,
10443,
10552,
10576,
10623,
10661,
10699,
10730,
10813,
10924,
10999,
11004,
11017,
11114,
11170,
11206,
11237,
11268,
11286,
11291,
11389,
11424,
11459,
11489,
11490,
11544,
11555,
11653,
11668,
11681,
11734,
11781,
11805,
11822,
11823,
11898,
11985,
11986,
12050,
12091,
12092,
12133,
12196,
12233,
12234,
12253,
12254,
12255,
12283,
12294,
12428,
12469,
12495,
12511,
12512,
12519,
12582,
12657,
12712,
12743,
12762,
12801,
12819,
12829,
12848,
12858,
12875,
12876,
12877,
12918,
12956,
12967,
13088,
13111,
13138,
13139,
13181,
13190,
13238,
13326,
13405,
13478,
13536,
13537,
13585,
13668,
13673,
13727,
13866,
13871,
13920,
13975,
13984,
14039,
14050,
14171,
14204,
14224,
14265,
14266,
14320,
14361,
14401,
14413,
14419,
14427,
14441,
14471,
14499,
14509,
14531,
14538,
14539,
14550,
14578,
14585,
14643,
14707,
14722,
14745,
14754,
14765,
14895,
14924,
14983,
15004,
15060,
15070,
15073,
15112,
15113,
15148,
15176,
15228,
15279,
15283,
15308,
15352,
15377,
15422,
15433,
15546,
15573,
15574,
15624,
15625,
15661,
15683,
15703,
15713,
15734,
15735,
15785,
15796,
15908,
15935,
15985,
16021,
16043,
16063,
16073,
16094,
16095,
16145,
16156,
16277,
16315,
16377,
16397,
16426,
16508,
16509,
16531,
16542,
16659,
16688,
16759,
16779,
16802,
16803,
16825,
16836,
16955,
16993,
17055,
17075,
17104,
17186,
17187,
17209,
17220,
17341,
17363,
17427,
17447,
17471,
17482,
17599,
17628,
17701,
17721,
17744,
17745,
17767,
17778,
17895,
17924,
17925,
17978,
17979,
18047,
18048,
18078,
18110,
18142,
18143,
18178,
18179,
18188,
18233,
18234,
18284,
18285,
18382,
18383,
18420,
18459,
18498,
18535,
18576,
18577,
18621,
18622,
18680,
18681,
18704,
18705,
18764,
18765,
18777,
18826,
18837,
18960,
18974,
18996,
19021,
19049,
19077,
19130,
19190,
19240,
19251,
19374,
19395,
19457,
19482,
19503,
19514,
19637,
19658,
19712,
19738,
19749,
19886,
19906,
19929,
19938,
19965,
19978,
19996,
20005,
20051,
20064,
20088,
20099,
20230,
20257,
20310,
20373,
20435,
20515,
20593,
20612,
20613,
20640,
20641,
20673,
20702,
20715,
20788,
20812,
20880,
20905,
20922,
20936,
20953,
21026,
21093,
21114,
21140,
21170,
21240,
21295,
21296,
21324,
21335,
21466,
21500,
21572,
21650,
21726,
21806,
21886,
21887,
21927,
21947,
21960,
22032,
22059,
22088,
22155,
22166,
22297,
22342,
22398,
22464,
22525,
22550,
22556,
22624,
22686,
22749,
22799,
22800,
22871,
22898,
22926,
22927,
22996,
23060,
23105,
23133,
23173,
23249,
23309,
23328,
23402,
23477,
23552,
23625,
23699,
23776,
23853,
23875,
23921,
23985,
24030,
24097,
24163,
24164,
24189,
24200,
24331,
24372,
24427,
24428,
24488,
24547,
24601,
24662,
24718,
24770,
24823,
24876,
24932,
24933,
24978,
25029,
25082,
25135,
25186,
25237,
25283,
25342,
25343,
25389,
25397,
25398,
25439,
25503,
25567,
25634,
25679,
25725,
25726,
25788,
25826,
25827,
25878,
25923,
25924,
25949,
25960,
26085,
26143,
26211,
26291,
26369,
26449,
26527,
26601,
26672,
26750,
26770,
26789,
26812,
26850,
26888,
26914,
26952,
26981,
27007,
27027,
27059,
27092,
27122,
27156,
27189,
27215,
27272,
27299,
27357,
27383,
27411,
27471,
27485,
27519,
27530,
27655,
27694,
27774,
27852,
27932,
28004,
28083,
28149,
28194,
28215,
28226,
28351,
28390,
28470,
28548,
28628,
28700,
28779,
28852,
28897,
28918,
28929,
29054,
29093,
29173,
29251,
29331,
29403,
29482,
29548,
29591,
29636,
29647,
29772,
29811,
29891,
29969,
30049,
30121,
30200,
30280,
30322,
30382,
30393,
30518,
30557,
30637,
30715,
30795,
30867,
30946,
31019,
31055,
31100,
31111,
31235,
31251,
31312,
31359,
31385,
31426,
31452,
31510,
31536,
31566,
31639,
31719,
31777,
31853,
31867,
31936,
31988,
32014,
32080,
32145,
32216,
32268,
32269,
32289,
32329,
32346,
32355,
32432,
32488,
32502,
32530,
32543,
32572,
32583,
32707,
32737,
32808,
32828,
32861,
32892,
32922,
32939,
32948,
32995,
33008,
33037,
33048,
33172,
33184,
33201,
33242,
33256,
33294,
33321,
33351,
33409,
33472,
33521,
33578,
33617,
33659,
33690,
33719,
33751,
33778,
33806,
33859,
33874,
33899,
33926,
33995,
34021,
34051,
34082,
34107,
34168,
34224,
34260,
34333,
34357,
34370,
34417,
34444,
34476,
34540,
34579,
34611,
34622,
34744,
34756,
34785,
34837,
34874,
34929,
34985,
35003,
35013,
35073,
35119,
35130,
35257,
35303,
35304,
35328,
35401,
35425,
35476,
35519,
35558,
35589,
35615,
35626,
35753,
35804,
35805,
35872,
35873,
35933,
35975,
35976,
36040,
36101,
36102,
36163,
36181,
36182,
36190,
36238,
36276,
36277,
36311,
36365,
36378,
36408,
36439,
36468,
36516,
36585,
36615,
36644,
36699,
36720,
36748,
36803,
36825,
36836,
36963,
36985,
36986,
37045,
37102,
37110,
37143,
37171,
37197,
37229,
37242,
37243,
37293,
37322,
37363,
37404,
37446,
37487,
37528,
37569,
37610,
37651,
37652,
37701,
37747,
37748,
37789,
37802,
37847,
37879,
37897,
37924,
37955,
37988,
37989,
38010,
38021,
38148,
38162,
38163,
38234,
38235,
38306,
38307,
38315,
38338,
38349,
38476,
38491,
38492,
38551,
38552,
38623,
38624,
38632,
38655,
38666,
38793,
38808,
38809,
38874,
38875,
38946,
38947,
38955,
38978,
38989,
39120,
39151,
39220,
39243,
39244,
39273,
39274,
39284,
39356,
39357,
39370,
39422,
39430,
39496
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 39496,
"ccnet_original_nlines": 958,
"rps_doc_curly_bracket": 0.0008608499774709344,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15660883486270905,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023088200017809868,
"rps_doc_frac_lines_end_with_ellipsis": 0.004171010106801987,
"rps_doc_frac_no_alph_words": 0.40300512313842773,
"rps_doc_frac_unique_words": 0.28800591826438904,
"rps_doc_mean_word_length": 6.037018775939941,
"rps_doc_num_sentences": 611,
"rps_doc_symbol_to_word_ratio": 0.011849500238895416,
"rps_doc_unigram_entropy": 6.0464935302734375,
"rps_doc_word_count": 4052,
"rps_doc_frac_chars_dupe_10grams": 0.30933693051338196,
"rps_doc_frac_chars_dupe_5grams": 0.3608453869819641,
"rps_doc_frac_chars_dupe_6grams": 0.32908183336257935,
"rps_doc_frac_chars_dupe_7grams": 0.32458508014678955,
"rps_doc_frac_chars_dupe_8grams": 0.3169814348220825,
"rps_doc_frac_chars_dupe_9grams": 0.31575503945350647,
"rps_doc_frac_chars_top_2gram": 0.012509199790656567,
"rps_doc_frac_chars_top_3gram": 0.026571830734610558,
"rps_doc_frac_chars_top_4gram": 0.03474776819348335,
"rps_doc_books_importance": -3366.1748046875,
"rps_doc_books_importance_length_correction": -3366.1748046875,
"rps_doc_openwebtext_importance": -2029.091064453125,
"rps_doc_openwebtext_importance_length_correction": -2029.091064453125,
"rps_doc_wikipedia_importance": -1509.434814453125,
"rps_doc_wikipedia_importance_length_correction": -1509.434814453125
},
"fasttext": {
"dclm": 0.6483111381530762,
"english": 0.5374549031257629,
"fineweb_edu_approx": 2.426398754119873,
"eai_general_math": 0.31016069650650024,
"eai_open_web_math": 0.2036525011062622,
"eai_web_code": 0.07882130146026611
}
}
|
{
"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": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,156,500,632,129,566,000 |
Coding with Balls
February 19, 2017
Makt
Filed under: Uncategorized — codingwithballs @ 03:19
About a week back we released a new demo called “Makt” at Datastorm in Gothenburg and won the Amiga 500 demo competition there.
While we *strongly* recommend you watch it on proper hardware and a nice fat CRT you can also check out this youtube capture:
Preface
When I heard Datastorm would return after a 3-year break I knew we had to make something special for the Amiga competition there. Mainly because I’ve really enjoyed previous Datastorms (it’s *the* oldschool party for me), but also because it was likely there’d be some decent competition. (And it was! Although it’d be cool if more groups ventured away from the comfort of 1992-style..)
I also knew exactly which project to choose from my list of “stuff I’d really like to implement (but rarely get the time to start)”. For a while I’d been playing with the idea of making A500 versions of the main effects in You are Lucy and Dataskull and if I managed to pull it off I hoped it’d be a proper party banger.
I obviously didn’t plan to port those effects directly. Lucy and Dataskull were made for high-end 060 / AGA machines and even there their chunkybuffer effects were chugging along at 16 to 25 frames per second. Instead I wanted to do something that would give a similar look & feel, while running on much less capable (and much more fun!) hardware.
Note: While writing this I’ve been informed that there are unimaginative and uninformed people out there who believe the whole thing is just an animation (“it’s only 1 bitplane so you have room for a lot. durrr…”). While hilarious it’s of course also utter bollocks. 🙂
So, what *is* the trick then? Image-based rendering! Just like on serious computers! Or.. well… BOBs, really.
Bob the billboard imposter
All the effects in the demo are drawn using a (fairly low) number of bobs which are used to stencil parts of a texture into a single bitplane. In other words: you move small pixel masks around in the framebuffer while also scrolling the texture that you can see “through” the mask.
It’s all pretty much Amiga Blitter 101, although I did have to spend a bit of time rediscovering the blitter’s reverse mode for the first time in ages.
But while it’s basic stuff at this level (not unlike “plotting pixels in a buffer”), the really interesting bit comes when you decide *how* to move things around and what to put in the source texures. What we’ve effectively got here is a fast way of drawing a lot of moving pixels by just playing with the on-screen bob positions and the texture coordinates. As such, the “real work” was to use this rendering technique to create visuals that looked powerful (and quite atypical) for the old A500.
Details on the bob rendering:
• All bobs are 32×32 pixels (48×32 blit size to enable scrolling)
• We use suitably noisy / dithered masks to make things nice’n’fuzzy and avoid any unattractive sharp edges where the bobs overlap.
• The bob plotter is fairly fast by itself but definitely not record material. I also did some basic experiments interleaving it with the coordinate transformations but saw surprisingly little improvement. Things seemed fast enough for what we needed so I didn’t pursue it further.
• In the final demo (with copper post-processing & music) all effects run at 25 fps on a standard A500, except for the wobbly intestine which drops down to 16 fps for a few seconds.
• Different effects use different texture sizes, from 96×96 in the cube parts to 960×256 for the intestine.
• In the spirit of Just Hacking It As We Go Along each part has it’s own bob routine that’s 90% the same as the others.
• Most of the parts draw just 70-80 bobs per frame. The intestine uses the most, maxing out at around 100 on-screen bobs.
• Everything is drawn into just 1 bitplane. The 2 most recent frames are displayed using 2 bitplanes and then a bunch of flickering copper gradients are applied on top.
On to the effect code!
Face
This was the first thing I tried out after deciding to do bob imposters, mainly because it seemed like it’d give results with fairly little work.
The goal was to make “something that looks like You are Lucy on A500” and I even ended up using a texture (post-processed and dithered to 2 colors) and depth map from there.
The parallax effect in Lucy does per-pixel depth distortion but that’s of course a no-go on A500. Instead we just assign a depth value to each of the bobs and do per-bob depth distortion. If the bobs overlap a bit and the depth projection works out, then it just might look ok! 🙂
An important point for all the effects were that the source images needed to be detailed enough to give a feeling of depth and surface texture. In practice this was handled by playing with contrast and blur in Photoshop before noisedithering down to 2 colors.
Texture from You are Lucy
Texture from You are Lucy
Depth map (just a slightly blurred version of the texture)
Depth map (just a slightly blurred version of the texture)
1 bitplane texture used in Makt
1 bitplane texture used in Makt
In action!
Aaaand action!
Other tech stuff:
• The dataset consists of one picture (256×256 x 1bpl) and around 80 vertices for the bobs.
• The bobs are pre-sorted and never switch drawing order
• The depth transforms are done in two stages:
• Regular projection (makes the face turn slightly as it moves around the screen).
• A Face Dragging Vector for more brutal mimicry (e.g. when it gets stretched and torn apart).
• As far as I remember there’s no animation of the texture coordinates at all. It could probably have been used for more interesting distortion and stretching.
• Like in several of the other parts the blitter only clears every 2nd line of the current framebuffer. This adds a nice little messy trail of pixels after the bobs and also helps hide some of the glitches where they don’t overlap.
Wobbly Intestine
Pretty much the same effect as the face, just with a larger texture and more bobs (higher density and larger object). The intention here was to take it a bit slower & more majestic to give the idea that it miiight be the last effect already.
The waving and pulsating is just a simple sine-distortion. I had originally planned a much more interesting twist here (no, not actual twisting) but I got a bit short on time (and also noticed that I was already quite close to dropping below 25 fps as it was).
Due to the higher number of bobs this was the only part where I had to do any culling prior to the actual plotting stage in order to (mostly) reach 25 fps. The quick zoom-out before the waving begins drops down to every 3rd frame though (e.g. 16.6 fps).
Warped cubes
This is all done by changing the texture coordinates and there’s no movement of the actual bobs themselves except for a randomized 0-7 pixels jitter (which adds a *lot* to the final look though!)
The deformation is just the standard thing you’d do for a grid expander: scaling the texture coordinates based on the bobs distance from a given point (mainly the center of the screen because I’m old). However, since we’re just offsetting the textures per-bob rather than stretching them it looks a bit rawer and less generic. It just becomes a mess if you distort too much of course, so we try to avoid that.
The patterned cube is rendered into a 96×96 bitplane buffer which is then used as the source texture for the bobs. The cube drawing is really naive and inefficient but I never got around to optimizing it. That would’ve enabled for a fair bit more bobs on screen but as the effect still looked ok it wasn’t a major priority.
Zoomer
This was a bit more fun and, together with the Skull, one of the few effects to use animated bob masks and multiple textures.
The idea is simple enough though: just adapt a normal “endless zoomer” effect to stencil-bob rendering:
1. “Pre-generate several images of the same motive with different zoom levels.” In the demo there’s 4 badly looping ones.
2. “Zoom a bit on one image.” Here done simply by applying a uniform scale to all the texture coordinates, while the bobs themselves don’t move at all. Obviously we’re just sliding different bits of the underlying image around, but at scaling factors in the range of 0.7 – 1.3 it looks decent.
3. “Blend between two images at different zoom levels.” Which we did by jittering in more and more pixels from the next image, while removing the bobs using the previous texture.
As it would’ve been too slow to draw all the bobs for both images at the same time we just jittered in 8 at the time. E.g. for a given zoom factor you have:
– Draw X bobs with texture 0
– Draw 80-8-X bobs with texture 1
– Draw 8 bobs with texture 1, using masks with increasing amounts of pixels.
zoomdither
Jitter-mixing in action (some artifacts here due to reading outside of the texture)
With proper textures and a bit of coloring
With proper textures and a bit of coloring
Moving around in the picture just came down to offsetting the center of the coordinate scaling. This of course won’t affect the pre-generated images so if you move too far, too slow and don’t flash the screen enough then it might look a bit crap.
Cuberush
Both this part and the warped cubes would go nicely in a 4k intro as there’s really no data to speak of. We’re rendering cubes to textures again, but this time we’re keeping 64 of them in memory and updating one per frame. Different textures are then selected for each cluster of bobs that ends up on the screen. Each cube consists of 4 bobs and the depth scaling is simply done by moving the bobs closer together or further apart.
For each line-of-bobs there are 8 cubes, thus there’s a total of: 3 lines x 8 cubes x 4 bobs = 96 bobs in total, although there’s always some that are off-screen and get culled. (On a side-note: I was really lazy this time around and just immediately culled anything close to the screen edges. It’s sloppy but it’s less of a concern with the kind of busy & noisy visuals we have here.)
The bobs can move freely around in 3D but as I couldn’t use too many of them I opted for simple linear patterns and only rotating around the z-axis. I kinda wish I’d pushed that a little bit further.
The movement patterns were set up (there were just 3 lines in 3d space, so “keyframed” is kinda misleading) by hooking in mouse & keyboard controls to the effect code itself. Perhaps a bit overkill but I think the end result got better than what I’d managed by just typing in coordinates by hand.
Adjusting movement patterns
Adjusting movement patterns
This is also the only part where there’s just 1 bitplane enabled instead of mixing the two most recent frames. I wanted fast movement while still being able to make out the sharp patterns in the cubes and the pseudo-afterburn of the 2nd bitplane just made the visuals too smudgy.
Skull
This is the fun one. The face & the wobbly intestine were effectively just “2D images with a bit of depth added” (and the cuberush more traditional imposter billboarding) but here I wanted something that I could play around with properly in 3D. It’s somewhat related to Dataskull (they’re both rotating a bunch of points that make up a skull) but while Dataskull uses (comparatively) many particles, Makt relies on less than 100 of them and clever texturing instead.
As for the subject matter I just like a good skull effect. They’re interesting to look at, corny enough to remind us that all of this demostuff is just a good laugh, and kinda tough & evil in the right setting.
The basic principle of the effect is easy, as always:
1. Generate some images of a 3D skull from different angles. We used 4 different images to represent 180 degrees rotation around the y-axis.
2. Also generate depth maps for the same angles (e.g. just dump the z-buffer).
3. For each of the 4 images make a small batch of bobs. Assign the bobs z-values based on the depth map.
4. Find some way to draw this *efficiently* while using bobs from different batches based on how you’d like to rotate the on-screen skull.
Points 1. – 3. here are pretty much the same as what we did for the face and the intestine. The main differences being that the texture and depth map was now generated by rendering a skull object in OpenGL rather than retouching photos of faces and tree branches in Photoshop.
skullz0
One of the depth buffers, this time in 16 bit packed into 2 color channels
The 4 images used to create the rotating skull:
skull-2 skull-1 skull0 skull1
The last point – actually making stuff look good and doing it with reasonable performance – required quite a bit of experimentation and content-specific tweaking.
This is what we ended up with:
• Generate the data for each of the 4 images / batches as described above.
• Obviously you only need to deal with 2 of the 4 batches in any specific frame. For instance: if you want to render the object at 22 degrees rotation (around the y-axis) then you use the image (and accompanying bob batch) representing 0 degrees, the next one representing 60 degrees, and then just “mix them together in some way”.
• At the rendering level the “mixing together” was done in the same way as for the zoomer: use bob masks with different amounts of pixels.
• Determining which bobs to remove and which to add while rotating was done mainly based on each bobs x-coordinate in the original “straight-on” position (e.g. the position the texture was generated in). This required quite a bit of tweaking to make sure enough bobs were actually removed (so we didn’t always render 2 full batches) without too many gaps appearing. Of course: for performance reasons this culling of bobs was done *before* anything was actually rotated.
• Rotation around the x-axis (when the skull nods or tips back-/forward) is just basic 3D rotation and required no custom work. We just had to make sure it didn’t tip too far as there were no textures showing the top or bottom of the skull (quite similar to Dataskull which also had a hole in the head).
• Sorting the bobs in real-time (on top of all the other stuff going on) was a bit too slow. What we did instead was to pre-sort and merge 2 & 2 batches (e.g. one buffer with batches A+B, one with B+C and one with C+D). Simply presorting based on the z-value of each bob in its original “straight-on” position worked surprisingly well.
skulldissolve
Dissolving a single batch of bobs as the rotate
fullskullshorter
And using all 4 batches & textures. In the demo some of the glitches and noticeable transitions are covered up by the 2nd bitplane “afterglow” and color flashes. 🙂
And that’s about it really. Summing it up now it seems very straight-forward but there was a significant amount of trying, adjusting and tweaking involved. 🙂
Tooling
As always in recent years there were some ad-hoc tools involved. The main “tool” this time was messy piece of 68k asm code for manually placing bobs in 2D space, sampling each bob’s z-value from a depth map and then checking the results on the fly. It’s a “tool” only in the most rudimentary sense, with mouse control and F-keys used to control different drawing and rendering modes. I had various versions of this for each of the effects depending on the specific characteristics of each and I hope I never have to edit any of those sources again.
A word of warning though: This is very much the development process *I* prefer. If you were to do similar effects on Amiga (that would be awesome by the way!) then you’d probably be better off doing a lot more of the data generation in a high-level language on a PC. For instance: generating a texture atlas with impostors from many different angles might give much better results than manually picking them from a small number of full images. That said, when experimenting with new stuff I like to stay in Asm-One (on a blisteringly fast WinUae-emulated Amiga) to minimize the amount of mental context switches, benefit from all the old bits of code I’ve got and be able to freely move prototype code to the actual effect (when it’s not too slow).
Post processing
Nothing new in the copper department for this demo, except for the orange bars briefly used in the early zoomer glitch-outs. The rest of the copper coloring was taken directly from Party Elkstravaganza and then dumbed down to only use one base color (whereas Elkstravaganza blended multiple). We’re also just sampling from the same color table that I described in a previous post.
I originally planned to do a lot more fancy stuff here but then I kinda fell in love with the rawer single-gradient look and stuck with it.
Data accounting
It’s actually a rather small demo. Uncrunched it comes in at just above 500k and after going through Cranker it’s 322k. No attempt was ever made to reduce the file size during development as I tend to postpone that until it’s really required. Here the only real concern was memory usage rather than disk space. We kept the voice sample separate from the tune itself so that it could be kept in slowmem until it was needed. Other than that there was none of the tedious janitorial RAM-shuffling you sometimes have to do.
The larger bits of data are:
• 131k for the soundtrack
• 72k for the voice sample
• 40k texture data for the Skull (four 1-bitplane images at 320×256, where 30-50% is completely empty)
• 40k texture data for the Zoomer (four images at 320×256)
• 30k texture data for the wobbly intestine (960×256, again with a lot of empty space)
• 8k texture for the face (256×256)
• 37k of sine tables (!) just because I forgot they were there.
• 34k for the intro text, “MAKT” logo, end text, bob masks & stencil patterns for the cubes
• 32k color table (same as in Elkstravaganza but not delta-modulated this time as there was need to crunch)
• 13k (or thereabouts) of inefficiently stored bob coordinate data, including at least 2 batches that were never used.
Missed opportunities
Of which there were *so many* this time around!
Even when excluding the crazier and potentially-impossible ideas I’d say that the final product is only about 65% of what we aimed for. Some of the missing bits might show up in a later demo but I’ll definitely do something completely different first.
Things that weren’t:
• Mixing different bob masks in the same frame. This looked promising in the trials and there are actually more masks in the demo data.
• Morphing and growing stuff on objects. Would’ve made the skull way more evil.
• Lots of ideas for abstract patterns in both the effects and the backgrounds (we don’t fear the black background of death but it’s not always what we aim for either).
• Some fairly glitchy bitplane-distortions were also implemented but never used.
• Feedback effects! The bob rendering would be well suited for noisy variations on Dweezil-style chaos zoomers.
• The entire first part. Lug00ber finished the soundtrack for it and I have one-and-a-half effect ready (completely different stuff from what’s in the main part).
• The intro sequence for part 2 was not planned to be just text. 🙂
Onwards
It was great fun working on this one. The effects were fun to play around with and looked *almost* the way I imagined them in my head. I would of course have liked to spend more time at the party than just two late nights but the last two days of hotel coding were quite enjoyable and without any of the desperation & doubts that can appear when you’re over-tired and fed up.
In summary: we still like to make demos and we still enjoy winning compos so we’ll continue with both.
June 10, 2016
Amiga Elkstravaganza
Filed under: Uncategorized — codingwithballs @ 08:14
Not too long ago we released “Party Elkstravaganza” – the invitation for Solskogen 2016. It’s a 36 kilobyte intro for Amiga 500 and it took home the 1st prize in the olschool intro compo at Simulaatio. It’s also the first Spaceballs production in 14 years with music from my old partner in crime, Teis! (The previous one being a grossly underrated diskmag intro )
The main effect was inspired by 2 animations from El Visio (a man of many great ideas!). I hadn’t yet thought of making a new Solskogen invitation so there wasn’t any real plan to it, but I really liked the patterns and decided to try replicating them in realtime on the A500. (Thinking that even if it failed the process and / or results might still be interesting.)
Patterns and movement
I quickly lost hope of instinctively “seeing” the logic behind the patterns and simply asking El Visio for the algorithms he used didn’t feel like enough of a challenge (with Amiga coding being a prestigious e-sport and everything).
Thus, I ended up staring at the clips for a long time, looking for pattern repetitions, and then just copied the motion without actually understanding it. The result of this was a (fairly inelegant and messy) piece of 68k asm code which generated 2D vertices and edges that matched El Visio’s animations.
Simply precalculating the vertex postions offline and including them as data was of course an option, but doing it at run-time is more fun, takes less space and (most importantly) makes it a lot easier to experiment with the effect while putting the actual production together.
Rendering
Throughout the intro we’re switching between different “scenes”, each one a 50 frames long loop with a specific pattern movement and triangle size.
The data for a full loop is generated before it is shown (while we’re displaying the previous scene) and it consists of 4-color (2 bitplanes) slices that are 320 pixels wide. There are 50 slices (one for each frame) and they’re typically between 30 and 100 pixels tall (the height of each slice depends on the triangle positions for the corresponding frame).
A single slice
A single slice
When displaying the effect a single slice of data is repeated multiple times (and sometimes mirrored) using the Copper, in order to fill the entire 256 pixel height of the screen.
The reason for doing this rather than naively drawing lines and filling bitplanes for the whole screen with the Blitter is of course that the latter would be too slow to achieve 50 FPS. We are of course using the Blitter when pre-generating the slices – that processing doesn’t have any impact on the display framerate since it happens in parallel with displaying the previous scene.
As for memory usage the different loops in the intro range from around 140k to 310k.
Colors (of which there are a lot)
We’re using a total of 4 bitplanes, but not all the 16 color registers that enables. There’s 2 bitplanes for the patterns (background + two triangle colors) and 2 bitplanes for the text overlays (background/transparent + outline and text fill colors).
All color values are in 12bit RGB (which is the OCS/ECS hardware maximum) but there’s a lot of semi-controlled flickering to provide temporal antialiasing and make things look extra cool on 50hz CRT screens.
The colors for the overlay (or rather, the overlay blended on the patterns) are simply set once per frame. They’re flickered slightly every frame and also flashed in sync with the music (of course!).
The triangle patterns are colored using two Copper gradients. Each of these have 64 entries which means the colors can change every 4th scanline (for 256 lines display height). The gradients are also offset 2 scanlines every second frame in order to smoothen them out (again: especially nice on CRTs).
The gradients are generated and modified in different ways throughout the intro by interpolating between different colors and brightness levels. As the basis for this I used a pre-generated table of colors containing 256 different gradients, each with 64 entries. This is actually a photo of neon tubes which has been cropped and post-processed in Photoshop. In raw form this takes up 32k but slightly reorganized and delta-encoded it crunched very well (keeping the file size well below the important 40k limit). In other words: no reason to bother with removing unused data or try to generate something with code.
The base color table - Obviously 12 bit RGB isn't all that hot on its own so we'll have to add a bit of Flicker & Flash!
The base color table – Obviously 12 bit RGB isn’t all that hot on its own so we’ll have to add a bit of Flicker & Flash!
-
The generated gradients applied to the effect. (The first three patterns use Copper mirroring and the gradients are swapped for each slice.)
Text plotter
The overlays are generated at runtime (as opposed to in DPaint or Photoshop). This was necessary both to keep the file size down and to have enough memory available for the triangle pattern data. The plotter uses a bitmap font (one size only) with 2 bitplanes (outline and fill). Each character is manually positioned using a bare-bones editor and all the text is stored as arrays of {CharacterIndex, Xpos, Ypos} which are then used to plot characters with the Blitter. The editor itself (not included in the intro) was also implemented in 68k assembler because I have nothing better to do with my time.
The overlays are an example of what you can get away with through composition, coloring and motion. Some of the text screens look absolutely horrid on their own but (in my opinion) work out nicely in the final product.
Control flow and logistics
Sounds awfully enterprise’ish, but it’s just about “what should happen when”.
Only about half of the available RAM on a standard A500 is accessible to the custom HW chips (meaning that the other half can’t be used for things that are on-screen). This meant data for the next scene had to be generated on-the-fly and shuffled around in parallel with displaying the current scene.
While interrupts and pseudo-multi-threading isn’t exactly rocket surgery it was still a bit finicky to combine everything with the sync and progression of the intro.
There’s VBlank interrupt code which handles all color changes and updates to the on-screen 50 FPS effect (mainly by generating new Copper lists). It also initiates the jobs running in parallel with the effect, which are:
Generate new pattern and store it in “public memory”. A heavy job which can take anywhere from 5 – 20 seconds depending on the pattern.
Move new pattern into chip mem – happens once the screen has faded to black, in order to hide glitches when the old data is overwritten.
Plot new text overlay – starts after the interrupt code has switched off the previous overlay (as there was no memory for doublebuffering the overlays).
-
The mainloop for the non-interrupt code. Exciting stuff!
The interrupt code stealing cycles from the pattern generation each frame imposed some limitations on the visuals and ordering of the parts. If the next pattern already takes a lot of time to generate and we make it even slower by using complex color gradients in the current part then we’ll have to watch the same scene for a very long time. It could be argued that we don’t need many different patterns if we have nice color variations, but when I’ve made a decent piece of code I’d like to show it off a bit.
Size optimization
As there was never any real risk of exceeding the 64k limit of the compo at Simulaatio I didn’t bother much with size optimizations. However, when I saw how small it got when crunched with CrunchMania (50-something kilobytes) I figured we should cater to the real oldschool connoisseurs by getting it below 40k.
In the end it turned out to be very easy: Delta-encoding the color table (in addition to the high-precision sine table) obviously improved crunch rate quite a bit. Blueberry’s awesome Shrinkler also gave much better results than CrunchMania (as expected). And finally: Teis delivered a final version of the soundtrack that was both cooler and smaller than the previous one.
Stuff that didn’t happen
As always there were some ideas and potential optimizations that never made it.
• Keeping 2 smaller patterns in chip memory at the same time and switching seamlessly between them. This could’ve provided a bit more variation and most of the code was actually in place.
• Playing more with the overlay and background colors, for instance by using gradients for the text fill.
• Optimizing the pattern generation enough that each frame slice could be rendered in real-time. This would have freed up lots of memory and allowed much more variation in the effect patterns. I’m not sure it would have worked but precalculating the Blitter config data for all the lines and / or done CPU linedrawing in parallel with the Blitter might be worthwhile.
Final thoughts
Doing a short one-trick-pony intro (as opposed to a larger demo) was a nice and fairly smooth experience (even the last 30h crunch before the deadline wasn’t too bad). I’ll definitely do more projects like this in order to play with new ideas (I tend to be a lot more motivated when there’s an actual release target in front of me).
And of course: you should all come to Solskogen. It’s a great party with a really unique atmosphere and a very nice rural location not too far from Oslo. 🙂
May 10, 2016
Dataskull
Filed under: Uncategorized — codingwithballs @ 19:12
A couple of people have asked about the effects in Dataskull so I figured I’d post this (originally from an email right after the demo compo).
And just to remind you what it’s all about: Dataskull is a demo for “high-end Amigas” (AGA, 68060 CPU at 50MHz or above) which was released at last years Assembly in Helsinki (where it ended up 3rd in the Amiga compo).
This was a fairly quick project done in about a week (right after the much more time-consuming Korreks) because I didn’t want to show up at Assembly without a demo when they had their first dedicated Amiga compo since 1999 (and because my friend Wrec deserved a birthday greeting!)
The main effect was based on some old ideas and unfinished code I’d wanted to pick up again and its main purpose was to look massive and voxel’ish.
The tech
It’s actually just z-sorted point sprites with a lot of hacking. 🙂 (Note: these aren’t Amiga hardware sprites, but “CPU sprites” plotted into a chunky buffer).
Offline processing
I started with volume data from a CT scan of a skull which I downsampled and thresholded to a more manageable size, storing the resulting points (those with high enough density) as regular 3d coords.
Since this was still far too much data for the poor A1200 I then did optimistic (lossy) view-dependent pre-culling to bring it down to a manageable number of sprites. This was basically just brute-forced by rendering the object from a lot of different angles and then removing the points that didn’t contribute enough to the final image (because they were too small, occluded by other sprites, or not visible in enough frames).
The final skull object used in the demo consists of just 1909 3D points (the cluster of spheres is 1828 points).
Realtime
The points were transformed in 3D, z-sorted (cheaper than a z-/span- buffer due to the slow memory, small sprites and relatively high penalty of conditionals) and rendered with basic depth shading (and 2D screenspace clipping) into a 160 x 96 pixels buffer (1/4 size of the final screen).
This was then used as the source for various combinations of 2 post-processing effects which produced the final 320 x 192 screen buffer.
The noise filter does edge detection on the z-shaded sprite buffer and spawns 2D dots which move pseudo-randomly out from the edges.
The voronoi filter just uses precalculated look-up tables to draw voronoi cells that are colored based on the contents of the 160 x 96 sprite buffer. (In other words, it’s just basic “tunnel effect tables”.) There are 8 different tables for different amounts of cells (“voronoi resolution”, if you will). Each buffer is 320 x 192 x 16bits.
And while all of this runs at ~16FPS (every third frame) on an A1200 with a 50MHz 68060 CPU we adjust the hardware color registers from the vblank interrupt at 50 FPS to add instant coolness and give an illusion of higher effect frame rate (at the risk of triggering some photosensitive epilepsy).
I also switched between 2 different sprite renderers throughout the demo to balance performance against the zoom level of the object: One slightly faster version that just plotted fixed-size squares, and one slower but better looking version that plotted circular(‘ish) shapes at different sizes.
Highest voronoi resolution - sprite size adjusted to match object size
Highest voronoi resolution – sprite size adjusted to match the on-screen size of the object
Too small sprites causing ugly gaps - Increase sprite size or apply aggressive post-processing!
Too small sprites causing ugly gaps – Increase sprite size or apply aggressive post-processing!
Lowest voronoi resolution - ok sprite size
Lowest voronoi resolution – ok sprite size
A couple of weeks after the compo I also did some work on a final version of the demo. The intro part has been improved quite a bit, but I never got around to fixing the sync and post-proc for the main part. I’ll see if I manage to get it out at some point.
March 29, 2015
Slow and inaccurate screenspace voronoi vectorization.
Filed under: Uncategorized — codingwithballs @ 16:56
<@Slummy_> speaking of anti-advisory.. I’ve been doing screenspace voronoi vectorization in 100% asm recently. 😀
<@Slummy_> worst thing is that it’s just for playing around, or “offline precalc” at most, so it could’ve been done in any sane language on a PC
<@Slummy_> but hey, it’s been too long since I did any amigacoding so it seemed like a decent way of playing a bit
<@Raylight-PwL> Slummy_: any tip on algo for that btw? voronoi is da shit you know!
Basically the task is: take a 2D voronoi diagram rendered as pixels and convert each cell to a polygon.
Without going into any detail of how (or why) it was implemented in 68k asm, this is the basic approach. It’ll obviously also work for other 2D graphics with “voronoi-like” characteristics (convex shaps with lots of straight edges) but it’s far from a general purpose vectorizer.
Render your voronoi with a different ID (colour) for each cell.
voir1
Identify all the corners / vertices in the image. I do this by scanning through the buffer and comparing each pixel to 3 of its neighbours: (x+1), (y+1) and (x+1, y+1), as well as some special-casing for edges. In the general case a pixel is on a vertex if it has a different colour than at least 2 of its 3 neighbours, and those neighbours are also different.
For each detected vertex store it’s screen space position (x,y) as well as the IDs of the 4 sampled pixels (e.g. the 3 or 4 cells that this vertex is part of)
voir2
voir2b
Then, for each cell in the screen buffer find:
• All vertices participating in the cell
• The cell’s bounding box
• The center of the bounding box
voir3
To get a polygon out of this we need to sort the vertices according to winding order. In other words: for each vertex find the angle of the vector from the centre of the bounding box and then sort the vertices according to those.
Finding the angle, either through the magic of basic trigonometry or the glorious path of brute force, is left as an exercise for the reader. 🙂
voir3b
And voila!
voir4
While it’s neither clever nor elegant it worked as intended.
November 17, 2011
So, it’s been really quiet in here…. but we made a new demo!
Filed under: Uncategorized — codingwithballs @ 19:23
I will get back to the effects from Norwegian Kindness in the not-so-distant future, but in the meantime, check out “You are Lucy” – the latest AGA/060 demo from Spaceballs. It won the oldschool demo competition at Kindergarden 2011, and a videocapture can be found at: http://capped.tv/spaceballs-you_are_lucy or on youtube.
As a matter of fact, a large part of You are Lucy is based on an effect derived from Norwegian Kindness. It’s been massively optimized (through the well-proven technique of slapping one’s forehead, saying “doh!”, and reimplementing from scratch) and has several new features, but the fundamental concept is still the same as in the blue’ish twister from NK.
Separated at birth:
A playful twister showing a bit of voxelized curves in full 3D. (Norwegian Kindness)
A handsome model wearing the latest in volumetric post-processing. (You are Lucy)
April 17, 2011
Bitplanes + colour registers = A private rainbow!
Filed under: Uncategorized — Tags: , , — codingwithballs @ 13:10
Most of the parts in Norwegian Kindness use a simple, but effective, trick to achieve a bit more colour and (all-important) Freshness. As the Amiga has bitplane-based graphics, regardless of whether your actual effect code works in a “chunky” 1-byte-per-pixel mode or not, we’re able to combine the output of the main effect code (your typical cube, tunnel or zoomer) with a separate colour overlay, somewhat similar to colouring a greyscale photo. From the CPU’s point of view this operation has no performance cost, as it’s handled by the Amiga graphics hardware instead of requiring explicit (CPU) per-pixel blending. The only additional overall impact is the increased DMA/memory traffic caused by the hardware having to read more bitplane data, but the exactly same cost would have been incurred by using all 8 bitplanes (i.e. rendering 256 colors) in the effect code itself. In “modern” demos this additional overhead is also negligible compared to the time spent by the CPU on various tasks.
As a result we can go from this (effect only, rendered in 64 colours with a linear greyscale palette):
to this (no change in effect code, only 2 bitplanes of static overlay added + a new palette with 4 * 64 entries):
without any performance impact whatsoever.
The 2 bitplane overlay used to “select” between the 4 different 64 colour palettes for each pixel in this case looks like this (colouring only for illustration purposes):
In the demo this trick was applied to almost all the effects (we’ve never cared much for subtlety), with the exception of the blue’ish voxel twister, the initial greyscale clouds, and the text screens. In most cases (as above) the effect itself uses 64 colours and therefore renders into 6 bitplanes (all effects are originally rendered in chunky pixel mode and then converted to bitplanes). This leaves 2 bitplanes for the colour overlay (since the Amiga AGA chipset supports a total of 8 bitplanes), allowing us to create a fairly low-resolution gradient with 4 different palettes. Two effects (the flying anti-aliased cubes and the red-white volume/grid effect) are instead rendered in 32 colours, providing 3 bitplanes / 8 palettes and a somewhat smoother gradient.
What could have been better?
As always things took a lot longer than expected, and even with top-notch Datastorm organizers extending deadlines until compo-start, and numerous friendly providers of Jaloviina, Aquavit and beer, there were issues we simply did not get around to fixing in time for release (as for the “final release” it was just intended to get the demo out, not change the demo noticeably).
In some parts the dithered static overlays are very noticeable, creating a visible aliasing effect and breaking the illusion of a smooth colour gradient. This could have been avoided/improved on both by making the overlays dynamic (animating them) and chosing colour gradients with less contrast between the 4/8 different palettes. It also appears that some video projectors and screens amplify the banding/aliasing effect, making it appear “worse than it actually is” (this might be caused by conversion of the 24bit Amiga colour output to 16bit RGB565, or similar gremlins in the pixel-tubes). During the development of the demo I considered toning down the colour gradient in some parts (for instance the orange-purple clouds), but eventually decided against it as I was afraid it would lose some of its effect on the big-screen (again with the subtlety…) Unfortunately I never got around to animating the overlays, which could have been done in an interrupt at 50Hz (i.e. higher than the effect refresh rate, thus creating an illusion of higher overall performance and a smoother final image). However, Ephidrena used this animated technique in their demo Dancing In Software Foam Oil (some might argue that the effect is less noteworthy, but the issues due to “steep gradients” are also a lot less noticeable).
April 15, 2011
Norwegian Kindness? Is that a joke?
Filed under: Uncategorized — Tags: , , — codingwithballs @ 17:03
Yes, it is.
But it’s also an AGA/68060 demo which was released at Datastorm 2011, where it won the Amiga demo competition.
Although the demo group Spaceballs hasn’t been completely dead in recent years, NK is still somewhat of a “comeback demo” as it’s our first production to contain new effects since around 2004 (rather than rehashed code from yesteryear mixed with blurred video borrowed from the internet). The ideas behind the different effects were thought out between 2005 and 2010, but the majority of the actual code (except for basic frameworks and the infamous ‘Texture Mapper from 1999’) was developed between September ’10 and February ’11. Most of the effects were implemented in September and October (with testing and optimization cycles relying heavily on WinUAE, irc and email due to the lack of an actual Amiga). The actual “linking” and demomaking took place during one intense week right before Kindergarden (where we were unable to finish the demo) and 1.5 week before/during Datastorm.
As always the demo ended up as something quite different than what we originally planned, but in the end I’m fairly happy with it as an in-you-face effect show. The fact that we beat Ephidrena, the uncrowned kings of subtle design touches on Amiga (you won’t notice, but they know it’s there!), shows that good old-fashioned “flash the screen and keep hitting them with new effects”-design ™ still works with the retro-geeks of today.
The next post deal with the colour gradient trick used in NK (and in the Eph/Kvg/RNO demo from Datastorm), before we get into some of the more effect-specific code later on.
Blog at WordPress.com.
|
{
"url": "https://codingwithballs.wordpress.com/category/uncategorized/",
"source_domain": "codingwithballs.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "121903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O2EOHWVEMFHP45WHJEGMSTCVZBRXANIC",
"WARC-Concurrent-To": "<urn:uuid:97d5cdc9-925a-42da-8ac7-9ff64ba7c70d>",
"WARC-Date": "2017-08-22T09:00:45Z",
"WARC-IP-Address": "192.0.78.13",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:347COGMMDWSSI3YQIPN53GNF2LHVSYPW",
"WARC-Record-ID": "<urn:uuid:deb015f7-5585-45a1-8f26-db1ccf8b292d>",
"WARC-Target-URI": "https://codingwithballs.wordpress.com/category/uncategorized/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:41297a4d-1d57-40e2-8738-879cd5f315a7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-154-143-44.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 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,
18,
19,
37,
38,
43,
44,
97,
98,
226,
352,
353,
361,
362,
749,
750,
1071,
1072,
1420,
1421,
1690,
1691,
1801,
1802,
1829,
1830,
2112,
2113,
2265,
2763,
2764,
2794,
2795,
2863,
2997,
3281,
3465,
3575,
3697,
3821,
3992,
3993,
4016,
4017,
4022,
4023,
4169,
4343,
4623,
4624,
4884,
4885,
4911,
4912,
4938,
4939,
4998,
4999,
5058,
5059,
5091,
5092,
5124,
5125,
5136,
5137,
5152,
5153,
5171,
5172,
5266,
5325,
5374,
5461,
5560,
5722,
5956,
5957,
5974,
5975,
6217,
6218,
6479,
6733,
6734,
6747,
6748,
6944,
7354,
7355,
7679,
7680,
7687,
7688,
7814,
7918,
7919,
8043,
8339,
8520,
8521,
8678,
8707,
8741,
8818,
8819,
8830,
8831,
8915,
8916,
8959,
8960,
9003,
9004,
9251,
9252,
9261,
9262,
9694,
10080,
10081,
10281,
10578,
10579,
10607,
10608,
10636,
10637,
10917,
10918,
10924,
10925,
11392,
11393,
11604,
11605,
11659,
11800,
11879,
11984,
12123,
12124,
12401,
12402,
12410,
12411,
12486,
12487,
12535,
12536,
12566,
12567,
12569,
12732,
12763,
12764,
12841,
13175,
13316,
13789,
14095,
14433,
14447,
14448,
14496,
14497,
14514,
14515,
14679,
14680,
14838,
14839,
14847,
14848,
15397,
15398,
16147,
16148,
16164,
16165,
16546,
16686,
16687,
16703,
16704,
17224,
17225,
17254,
17255,
17283,
17312,
17417,
17478,
17567,
17605,
17671,
17765,
17875,
17996,
17997,
18018,
18019,
18067,
18319,
18320,
18341,
18342,
18480,
18562,
18732,
18815,
18929,
19094,
19163,
19164,
19172,
19173,
19549,
19550,
19653,
19654,
19668,
19669,
19690,
19691,
19744,
19745,
20109,
20110,
20478,
20479,
20501,
20502,
20735,
21040,
21318,
21319,
21329,
21330,
21478,
21837,
21838,
21853,
21854,
21869,
21870,
22050,
22434,
22435,
22520,
22521,
22555,
22556,
22808,
23016,
23017,
23217,
23519,
24135,
24136,
24257,
24258,
24379,
24380,
24382,
24383,
24524,
24525,
24538,
24539,
25143,
25144,
25363,
25364,
25391,
25392,
25470,
25471,
25772,
25773,
25939,
26160,
26296,
26433,
26586,
26587,
26589,
26590,
26647,
26648,
27160,
27161,
27179,
27180,
27492,
27866,
27867,
27892,
27893,
27973,
27974,
28164,
28272,
28642,
28643,
28658,
28659,
28992,
28993,
29149,
29150,
29163,
29164,
29174,
29175,
29228,
29229,
29372,
29373,
29592,
29593,
29875,
29876,
30024,
30025,
30034,
30035,
30195,
30196,
30215,
30216,
30416,
30844,
30845,
30958,
30959,
30968,
30969,
31258,
31259,
31396,
31529,
31869,
31870,
32168,
32169,
32466,
32467,
32538,
32539,
32631,
32632,
32728,
32729,
32825,
32826,
32869,
32870,
32913,
32914,
33172,
33173,
33188,
33189,
33244,
33245,
33298,
33299,
33412,
33413,
33558,
33559,
33674,
33675,
33759,
33760,
33864,
33865,
34145,
34146,
34210,
34211,
34217,
34218,
34579,
34580,
34739,
34740,
34746,
34747,
34754,
34755,
34802,
34803,
34846,
34874,
34909,
34910,
34916,
34917,
35147,
35148,
35292,
35293,
35300,
35301,
35312,
35313,
35319,
35320,
35381,
35382,
35400,
35401,
35462,
35463,
35516,
35517,
35843,
35844,
36202,
36203,
36223,
36224,
36309,
36310,
36392,
36393,
36408,
36409,
36459,
36460,
36525,
36526,
37525,
37628,
37629,
37743,
37744,
37787,
37788,
37959,
37960,
38730,
38731,
38760,
39138,
39139,
40455,
40456,
40471,
40472,
40508,
40509,
40574,
40575,
40587,
40588,
40699,
41587,
42022,
42023,
42198,
42199
],
"line_end_idx": [
18,
19,
37,
38,
43,
44,
97,
98,
226,
352,
353,
361,
362,
749,
750,
1071,
1072,
1420,
1421,
1690,
1691,
1801,
1802,
1829,
1830,
2112,
2113,
2265,
2763,
2764,
2794,
2795,
2863,
2997,
3281,
3465,
3575,
3697,
3821,
3992,
3993,
4016,
4017,
4022,
4023,
4169,
4343,
4623,
4624,
4884,
4885,
4911,
4912,
4938,
4939,
4998,
4999,
5058,
5059,
5091,
5092,
5124,
5125,
5136,
5137,
5152,
5153,
5171,
5172,
5266,
5325,
5374,
5461,
5560,
5722,
5956,
5957,
5974,
5975,
6217,
6218,
6479,
6733,
6734,
6747,
6748,
6944,
7354,
7355,
7679,
7680,
7687,
7688,
7814,
7918,
7919,
8043,
8339,
8520,
8521,
8678,
8707,
8741,
8818,
8819,
8830,
8831,
8915,
8916,
8959,
8960,
9003,
9004,
9251,
9252,
9261,
9262,
9694,
10080,
10081,
10281,
10578,
10579,
10607,
10608,
10636,
10637,
10917,
10918,
10924,
10925,
11392,
11393,
11604,
11605,
11659,
11800,
11879,
11984,
12123,
12124,
12401,
12402,
12410,
12411,
12486,
12487,
12535,
12536,
12566,
12567,
12569,
12732,
12763,
12764,
12841,
13175,
13316,
13789,
14095,
14433,
14447,
14448,
14496,
14497,
14514,
14515,
14679,
14680,
14838,
14839,
14847,
14848,
15397,
15398,
16147,
16148,
16164,
16165,
16546,
16686,
16687,
16703,
16704,
17224,
17225,
17254,
17255,
17283,
17312,
17417,
17478,
17567,
17605,
17671,
17765,
17875,
17996,
17997,
18018,
18019,
18067,
18319,
18320,
18341,
18342,
18480,
18562,
18732,
18815,
18929,
19094,
19163,
19164,
19172,
19173,
19549,
19550,
19653,
19654,
19668,
19669,
19690,
19691,
19744,
19745,
20109,
20110,
20478,
20479,
20501,
20502,
20735,
21040,
21318,
21319,
21329,
21330,
21478,
21837,
21838,
21853,
21854,
21869,
21870,
22050,
22434,
22435,
22520,
22521,
22555,
22556,
22808,
23016,
23017,
23217,
23519,
24135,
24136,
24257,
24258,
24379,
24380,
24382,
24383,
24524,
24525,
24538,
24539,
25143,
25144,
25363,
25364,
25391,
25392,
25470,
25471,
25772,
25773,
25939,
26160,
26296,
26433,
26586,
26587,
26589,
26590,
26647,
26648,
27160,
27161,
27179,
27180,
27492,
27866,
27867,
27892,
27893,
27973,
27974,
28164,
28272,
28642,
28643,
28658,
28659,
28992,
28993,
29149,
29150,
29163,
29164,
29174,
29175,
29228,
29229,
29372,
29373,
29592,
29593,
29875,
29876,
30024,
30025,
30034,
30035,
30195,
30196,
30215,
30216,
30416,
30844,
30845,
30958,
30959,
30968,
30969,
31258,
31259,
31396,
31529,
31869,
31870,
32168,
32169,
32466,
32467,
32538,
32539,
32631,
32632,
32728,
32729,
32825,
32826,
32869,
32870,
32913,
32914,
33172,
33173,
33188,
33189,
33244,
33245,
33298,
33299,
33412,
33413,
33558,
33559,
33674,
33675,
33759,
33760,
33864,
33865,
34145,
34146,
34210,
34211,
34217,
34218,
34579,
34580,
34739,
34740,
34746,
34747,
34754,
34755,
34802,
34803,
34846,
34874,
34909,
34910,
34916,
34917,
35147,
35148,
35292,
35293,
35300,
35301,
35312,
35313,
35319,
35320,
35381,
35382,
35400,
35401,
35462,
35463,
35516,
35517,
35843,
35844,
36202,
36203,
36223,
36224,
36309,
36310,
36392,
36393,
36408,
36409,
36459,
36460,
36525,
36526,
37525,
37628,
37629,
37743,
37744,
37787,
37788,
37959,
37960,
38730,
38731,
38760,
39138,
39139,
40455,
40456,
40471,
40472,
40508,
40509,
40574,
40575,
40587,
40588,
40699,
41587,
42022,
42023,
42198,
42199,
42221
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 42221,
"ccnet_original_nlines": 463,
"rps_doc_curly_bracket": 0.00004736999835586175,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42633193731307983,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0186300091445446,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17278200387954712,
"rps_doc_frac_unique_words": 0.24493452906608582,
"rps_doc_mean_word_length": 4.623432159423828,
"rps_doc_num_sentences": 346,
"rps_doc_symbol_to_word_ratio": 0.00045439001405611634,
"rps_doc_unigram_entropy": 6.227128982543945,
"rps_doc_word_count": 7255,
"rps_doc_frac_chars_dupe_10grams": 0.0028023701161146164,
"rps_doc_frac_chars_dupe_5grams": 0.0389350987970829,
"rps_doc_frac_chars_dupe_6grams": 0.021643860265612602,
"rps_doc_frac_chars_dupe_7grams": 0.013415619730949402,
"rps_doc_frac_chars_dupe_8grams": 0.006678000092506409,
"rps_doc_frac_chars_dupe_9grams": 0.004591119941323996,
"rps_doc_frac_chars_top_2gram": 0.008198429830372334,
"rps_doc_frac_chars_top_3gram": 0.0016098699998110533,
"rps_doc_frac_chars_top_4gram": 0.0050085000693798065,
"rps_doc_books_importance": -3506.07421875,
"rps_doc_books_importance_length_correction": -3506.07421875,
"rps_doc_openwebtext_importance": -1987.9930419921875,
"rps_doc_openwebtext_importance_length_correction": -1987.9930419921875,
"rps_doc_wikipedia_importance": -1644.383544921875,
"rps_doc_wikipedia_importance_length_correction": -1644.383544921875
},
"fasttext": {
"dclm": 0.07411795854568481,
"english": 0.9394077658653259,
"fineweb_edu_approx": 1.5862691402435303,
"eai_general_math": 0.775330662727356,
"eai_open_web_math": 0.278667151927948,
"eai_web_code": 0.3502364754676819
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0954",
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,261,013,625,060,999,000 |
Empty dropdown slot without dropdown options
So I have made this block,
cool set block script pic
With a read-only slot so you cannot type anything in there, but there is still a dropdown that I cannot remove: when clicking on the slot, there is still an empty drop down option. Is there any way to remove this?
Hint: :gear: on the "Edit input name"
Are you looking for this?
untitled script pic - 2024-06-12T201826.447
untitled script pic - 2024-06-12T201822.980
oh haha i didnt realize I could have done that
but what I want is to prevent this:
image
I don't think there's an option to do that. I'm pretty sure the reason the empty drop-down option exists is so CALL & friends don't break.
i know why it exists, but in this case, it can only be empty anyway.
This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.
|
{
"url": "https://forum.snap.berkeley.edu/t/empty-dropdown-slot-without-dropdown-options/17018",
"source_domain": "forum.snap.berkeley.edu",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "27527",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UZ4IGDKYZVWWVUNFFNVZXTHBGU6NYX3E",
"WARC-Concurrent-To": "<urn:uuid:cb9a7b42-ab04-418d-b4da-7c227e908538>",
"WARC-Date": "2024-07-17T17:29:52Z",
"WARC-IP-Address": "165.227.181.19",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X4Y7ZBPW7ALVHYBGWGV5VX3RD5PNGZ2J",
"WARC-Record-ID": "<urn:uuid:3d539a52-455d-4f48-807a-f1d6ef1097c6>",
"WARC-Target-URI": "https://forum.snap.berkeley.edu/t/empty-dropdown-slot-without-dropdown-options/17018",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1819586a-aefb-490f-9f5e-1b485d60376d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-246\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,
45,
46,
73,
99,
313,
314,
352,
353,
379,
423,
424,
468,
469,
516,
552,
558,
559,
698,
699,
768,
769
],
"line_end_idx": [
45,
46,
73,
99,
313,
314,
352,
353,
379,
423,
424,
468,
469,
516,
552,
558,
559,
698,
699,
768,
769,
869
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 869,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41791045665740967,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04477611929178238,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20895521342754364,
"rps_doc_frac_unique_words": 0.6168830990791321,
"rps_doc_mean_word_length": 4.350649356842041,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.359920501708984,
"rps_doc_word_count": 154,
"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.04029851034283638,
"rps_doc_frac_chars_top_3gram": 0.03582090139389038,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -98.05815124511719,
"rps_doc_books_importance_length_correction": -98.05815124511719,
"rps_doc_openwebtext_importance": -60.484256744384766,
"rps_doc_openwebtext_importance_length_correction": -54.921234130859375,
"rps_doc_wikipedia_importance": -48.548797607421875,
"rps_doc_wikipedia_importance_length_correction": -48.548797607421875
},
"fasttext": {
"dclm": 0.023731650784611702,
"english": 0.937229335308075,
"fineweb_edu_approx": 0.8345839977264404,
"eai_general_math": 0.5451860427856445,
"eai_open_web_math": 0.18441134691238403,
"eai_web_code": 0.2432534098625183
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,478,638,297,770,969,000 |
modctl(2) - NetBSD Manual Pages
Command: Section: Arch: Collection:
MODCTL(2) NetBSD System Calls Manual MODCTL(2)
NAME
modctl -- module control
LIBRARY
Standard C Library (libc, -lc)
SYNOPSIS
#include <sys/module.h> int modctl(int operation, void *argp);
DESCRIPTION
modctl() provides control over loaded kernel modules. The argument operation is one of MODCTL_LOAD, MODCTL_UNLOAD, MODCTL_STAT, or MODCTL_EXISTS. The argument argp depends on the operation to be per- formed. Operations are: MODCTL_LOAD Load a module. The argp argument should be a pointer to a modctl_load_t structure, described below. MODCTL_UNLOAD Unload a module. In this case, argp should be a string containing the name of the module to be unloaded. MODCTL_STAT Return a list of loaded modules. In this case, the argp argument should be a struct iovec pointing to a suitable block of memory. The kernel will fill this block with · a count of the number of modules loaded, · an array of modstat_t structures, one per loaded mod- ule, and · a series of NUL-terminated strings containing the mod- ules' required modules lists. If the block is not large enough, the data returned will be truncated to fit. The kernel will then update the iov_len member of the iovec to reflect the size of the complete report, regardless of whether this is larger or smaller than the size passed in. MODCTL_EXISTS Test to see if the kernel was compiled with ``options MODULAR'' and whether or not modules may be loaded at the moment. In this case, argp should be an integer. It should be ``0'' to test if a user can load a module via MODCTL_LOAD, or it should be ``1'' to test if the system can autoload modules. Note that this test does not con- sider the sysctl kern.module.autoload. Data Types The modctl_load_t structure used with MODCTL_LOAD contains the following elements, which should be filled in by the caller: const char *ml_filename The name/path of the module to load. int ml_flags Zero or more of the following flag values: MODCTL_NO_PROP Don't load <module>.plist. MODCTL_LOAD_FORCE Ignore kernel version mismatch. const char *ml_props Externalized proplib dictionary to pass to module. size_t ml_propslen Size of the dictionary blob. ml_props may be NULL in which case ml_propslen must be 0. An upper limit of 4096 bytes is imposed on the value of ml_propslen. Attempting to load a pro- plib dictionary larger than this size will return ENOMEM. The modstat_t structure used with MODCTL_STAT contains the following ele- ments, which are filled in by the kernel: char ms_name[MAXMODNAME] The name of the module. modsrc_t ms_source One of the following enumerated constants: MODULE_SOURCE_KERNEL The module is compiled into the kernel. MODULE_SOURCE_BOOT The module was provided by the bootstrap loader. MODULE_SOURCE_FILESYS The module was loaded from the file sys- tem. modclass_t ms_class One of the following enumerated constants: MODULE_CLASS_SECMODEL Security model. MODULE_CLASS_VFS File system. MODULE_CLASS_DRIVER Device driver. MODULE_CLASS_EXEC Executable file format. MODULE_CLASS_MISC Miscellaneous. uint64_t ms_addr The load address within the kernel of the module's text seg- ment. (This value is available only for privileged users.) u_int ms_size Loaded size of the module's text segment. (This value is available only for privileged users.) u_int ms_refcnt Current number of live references to this module. u_int ms_flags The module's flags: MODFLAG_MUST_FORCE The "force" flag must be specified to reload this module. MODFLAG_AUTO_LOADED The module was auto-loaded by the operat- ing system. uint_ms_reqoffset The offset (in bytes) from the beginning of the required-module data.
RETURN VALUES
Upon successful completion, the value returned is 0. Otherwise, a value of -1 is returned and errno is set to indicate the error.
ERRORS
modctl() will fail if: [EBUSY] The argument operation is MODCTL_UNLOAD and the module is in use or the module is compiled into the kernel. [EDEADLK] The argument operation is MODCTL_LOAD and there is a circular dependency in the module's dependency chain. [EEXIST] The argument operation is MODCTL_LOAD and the module is already loaded. [EFAULT] A bad address was given for argp. [EFBIG] The argument operation is MODCTL_LOAD, the specified module resides in the file system, and the module's default proplib file was too large. [EINVAL] The argument operation is invalid. The argument operation is MODCTL_LOAD and ml_props is not NULL and ``ml_propslen'' is 0, or ml_props is NULL and ``ml_propslen'' is not 0. The kernel is unable to internalize the plist. Or, there is a problem with the module or <module>.plist. [ENAMETOOLONG] A module name/path is too long. [ENOENT] The argument operation is MODCTL_LOAD and the module or a dependency can't be found. The argument operation is MODCTL_UNLOAD and no module by the name of argp is loaded. [ENOEXEC] The argument operation is MODCTL_LOAD and the module is not a valid object for the system. Most likely, one or more undefined symbols could not be resolved by the in-kernel linker. [ENOMEM] There was not enough memory to perform the operation. [ENOSYS] The argument operation is MODLOAD_EXIST and the kernel does not include ``options MODULAR''. [EPERM] Not allowed to perform the operation. [EPROGMISMATCH] The argument operation is MODCTL_LOAD, the ml_flags field in the modctl_load_t structure does not include MODCTL_LOAD_FORCE, and the requested module does not match the current kernel's version information.
SEE ALSO
module(7), sysctl(7), module(9)
HISTORY
The modctl() function call first appeared in NetBSD 5.0. NetBSD 10.99 April 26, 2020 NetBSD 10.99
Powered by man-cgi (2021-06-01). Maintained for NetBSD by Kimmo Suominen. Based on man-cgi by Panagiotis Christias.
|
{
"url": "https://man.netbsd.org/sparc64/modctl.2",
"source_domain": "man.netbsd.org",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "19349",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4Y65WVR2K2PV75SKYQITONYDVPET4XUS",
"WARC-Concurrent-To": "<urn:uuid:fcff6e08-6221-4820-8e00-407789bfcc9d>",
"WARC-Date": "2023-01-27T11:19:51Z",
"WARC-IP-Address": "85.208.94.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:COPPISZKBP4WLWAEAOQIBGJSETFBJ2BE",
"WARC-Record-ID": "<urn:uuid:184a56cc-20f6-494d-8653-8bb501c86e73>",
"WARC-Target-URI": "https://man.netbsd.org/sparc64/modctl.2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fd6556ab-0a1c-4795-a8d2-558f81554dfd>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-142\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,
32,
33,
71,
150,
151,
152,
157,
182,
190,
221,
230,
293,
305,
3701,
3715,
3845,
3852,
5520,
5529,
5561,
5569,
5667
],
"line_end_idx": [
32,
33,
71,
150,
151,
152,
157,
182,
190,
221,
230,
293,
305,
3701,
3715,
3845,
3852,
5520,
5529,
5561,
5569,
5667,
5782
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5782,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32482394576072693,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06161972135305405,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21654930710792542,
"rps_doc_frac_unique_words": 0.37599092721939087,
"rps_doc_mean_word_length": 5.134768009185791,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.0008802799857221544,
"rps_doc_unigram_entropy": 5.018658638000488,
"rps_doc_word_count": 883,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.15571239590644836,
"rps_doc_frac_chars_dupe_6grams": 0.1477723866701126,
"rps_doc_frac_chars_dupe_7grams": 0.06440228968858719,
"rps_doc_frac_chars_dupe_8grams": 0.05028672143816948,
"rps_doc_frac_chars_dupe_9grams": 0.04058226943016052,
"rps_doc_frac_chars_top_2gram": 0.03153948113322258,
"rps_doc_frac_chars_top_3gram": 0.05293339118361473,
"rps_doc_frac_chars_top_4gram": 0.058226730674505234,
"rps_doc_books_importance": -474.6896057128906,
"rps_doc_books_importance_length_correction": -474.6896057128906,
"rps_doc_openwebtext_importance": -282.4284362792969,
"rps_doc_openwebtext_importance_length_correction": -282.4284362792969,
"rps_doc_wikipedia_importance": -214.74012756347656,
"rps_doc_wikipedia_importance_length_correction": -214.74012756347656
},
"fasttext": {
"dclm": 0.05952543020248413,
"english": 0.7764115929603577,
"fineweb_edu_approx": 2.6182210445404053,
"eai_general_math": 0.7991146445274353,
"eai_open_web_math": 0.18603718280792236,
"eai_web_code": 0.8815566897392273
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"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": "-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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,563,335,277,799,907,000 |
PageSpeed Insights でのモバイル分析
PageSpeed Insights は、ページを分析して、モバイル ネットワークでページを 1 秒未満で表示するための推奨事項にそのページが準拠しているかどうかを確認します。調査によれば、1 秒を超える遅延があるとユーザーの思考の流れが中断し、ユーザーの利便性が低下します。Google では、端末やネットワークの種類に関わらず、ユーザーのページへの関心を持続させ、最適な利便性を提供することを目標としています。
1 秒という時間の制約を満たすのは簡単ではありませんが、この時間内にページ全体を表示する必要はありません。代わりに、スクロールせずに見える範囲（ATF）のコンテンツを 1 秒未満で配信し表示します。こうすることで、ユーザーは可能な限り早くページの利用を開始できます。続いて、ユーザーがコンテンツの最初のページを読み進める間に残りのページをバックグラウンドで徐々に配信できます。
待ち時間の長いモバイル ネットワークへの適応
モバイル端末で ATF を 1 秒未満で表示するという基準を満たすには、他のネットワークでは生じない特有の課題があります。ユーザーは多種多様な 2G、3G、4G ネットワークを通じてサイトにアクセスする可能性があります。以下のように、ネットワークの遅延時間は有線接続に比べて大幅に長く、ATF コンテンツを表示する際の時間の制約である 1,000 ミリ秒のうちの大部分を消費します。
4G は世界中で主流となっているネットワークの種類です。ユーザーの大多数は 4G ネットワークでページにアクセスすると考えられます。そのため、各ネットワーク リクエストには平均で 100 ミリ秒かかると想定する必要があります。
その点を考慮して、もう一度、1 秒未満で表示するという基準について考えてみましょう。一般的なブラウザとサーバーの間の一連の通信を見ると、この時間のうちすでに 300 ミリ秒が、DNS ルックアップによる IP アドレスからホスト名（google.com など）への解決、ネットワーク ラウンド トリップによる TCP ハンドシェイク、オプションの TLS 接続といったネットワークのオーバーヘッドに費やされています。これにより、残りは 700 ミリ秒となります。
1 秒未満での表示の実現
ネットワークの遅延時間を差し引くと残りの時間はわずか 700 ミリ秒ですが、やるべきことはまだたくさんあります。サーバーでは応答のレンダリング、クライアント側アプリケーションではコードの実行、ブラウザではコンテンツのレイアウトとレンダリングなどが必要です。この点を考慮すると、次の基準を満たせば 1 秒未満での表示を実現できることになります。
（1）サーバーは応答をレンダリングする必要がある（200 ミリ秒未満）
サーバーの応答時間とは、サーバーが最初の HTML を返すまでの時間からネットワークの転送時間を引いた時間です。残された時間は少ないため、この時間は最小限に抑える必要があります。理想的なのは 200 ミリ秒以内ですが、できればさらに短い方がよいでしょう。
（2）リダイレクト数を最小限に抑える
HTTP リダイレクトが増えると、余分なネットワーク ラウンド トリップが 1 回または 2 回（追加の DNS ルックアップが必要な場合は 2 回）追加され、4G ネットワークでは数百ミリ秒の余分な遅延が発生することになります。そのため Google では、リダイレクトの数を最小限にすること、理想的にはリダイレクトを完全になくすことをウェブマスターに強くすすめています。これは、HTML ドキュメントでは特に重要です（可能な場合は、「m.」によるリダイレクトを避けてください）。
（3）最初のレンダリングまでのラウンド トリップの数は最小限に抑える
TCP が通信量を制御する仕組み（TCP スロースタート）が実装されているため、新しい TCP 接続はクライアントとサーバーの間で利用可能な帯域幅すべてをすぐに使用することはできません。このため、新しい TCP 接続の最初のラウンド トリップでは、サーバーから送信できるパケット数は最大 10 個（～14 KB）に制御されています。サーバーは、このデータの確認応答がクライアントから送信されるまで待ってから、輻輳ウィンドウを増やしてデータ配信量を増やすことができます。
また、10 個のパケット（IW10）の制限は TCP 標準の最近のアップデートであることにも注意してください。これを利用するためには、サーバーが最新バージョンにアップグレードされていることを確認する必要があります。最新バージョンにアップグレードされていない場合、パケット数の制限が 3～4 個となる可能性が高くなります。
この TCP の動作のため、コンテンツを最適化し、最初のページ レンダリングに必要なデータの配信に要するラウンド トリップの数を最小限に抑えることが重要です。ATF コンテンツを 98 KB 未満にすることができれば理想的です。そうすることで、ブラウザはわずか 3 回のラウンド トリップでページを描画でき、サーバーの応答遅延とクライアント側のレンダリングに十分な時間を確保できます。
（4）スクロールせずに見える範囲のコンテンツでは、レンダリングをブロックする外部の JavaScript や CSS を使用しない
ブラウザでは、ページをユーザーに表示する前に解析する必要があります。ブラウザで解析中に非同期ではない、またはブロック外部スクリプトを検出した場合、ブラウザは解析を停止してそのリソースをダウンロードしなければなりません。そのたびにネットワーク ラウンド トリップが追加されるため、最初のページ レンダリング時間が遅くなります。
そのため、スクロールせずに見える範囲の領域を表示するのに必要な JavaScript や CSS はインライン化し、ページにさらに機能を追加するために必要な JavaScript や CSS は ATF コンテンツが配信された後に読み込む必要があります。
（5）ブラウザのレイアウトとレンダリングのための時間を確保しておく（200 ミリ秒）
HTML、CSS、JavaScript の実行を解析するプロセスには時間とクライアントのリソースが費やされます。モバイル端末の処理速度やページの複雑さによっては、このプロセスには数百ミリ秒かかる場合があります。ブラウザのオーバーヘッドのために 200 ミリ秒を確保しておくことをおすすめします。
（6）JavaScript の実行とレンダリング時間を最適化する
複雑なスクリプトや非効率的なコードの実行には数十～数百ミリ秒かかります。ブラウザに付属するデベロッパー ツールを使用してコードをプロファイリングし、最適化します。Chrome デベロッパー ツールのインタラクティブ コースは概要を知るのに最適です。ぜひご覧ください。
よくある質問
JQuery などの JavaScript ライブラリを使用している場合はどうすればよいですか？
JQuery など多くの JavaScript ライブラリは、インタラクティブ性やアニメーションなどの効果を付加してページの魅力を高めるために使用されています。ただし、こうした動作の多くは、スクロールせずに見える範囲のコンテンツが表示された後に追加しても差し支えありません。そのような JavaScript の実行や読み込みの処理を、ページの読み込みの後に移動することを検討してください。
ページの作成に JavaScript フレームワークを使用している場合はどうすればよいですか？
クライアントサイドの JavaScript を使ってページのコンテンツを作成している場合は、関連する JavaScript モジュールをインライン化して、余分なネットワーク ラウンド トリップを避けることを検討してください。同様に、サーバーサイド レンダリングを使用すると、最初のページの読み込みのパフォーマンスが大幅に改善される場合があります。JS テンプレートをサーバー上でレンダリングし、その結果を HTML にインライン化してから、アプリケーションの読み込み後にクライアントサイド テンプレートを使用します。
ページで重要な CSS を特定する方法を教えてください。
Chrome デベロッパー ツールで [Audits] パネルを開いてウェブページ パフォーマンス レポートを実行し、生成されたレポートで [Remove unused CSS rules] を探します。あるいは、他のサードパーティのツールまたはスクリプトを使用して、各ページでどの CSS セレクタが適用されているかを特定します。
これらのおすすめの方法は自動化できますか？
もちろんです。商用やオープンソースのウェブ パフォーマンス最適化（WPO）製品は数多くあります。このような製品を使用すると、上記の基準の一部またはすべてを満たすことができます。オープンソース ソリューションについては、PageSpeed 最適化ツールをご覧ください。
こうした基準を満たすにはサーバーをどのように調整すればよいですか？
まず、サーバーが最新バージョンのオペレーティング システムを実行していることを確認します。最初の TCP 輻輳ウィンドウのサイズ（IW10）が大きくなったメリットを活用するには、Linux カーネル 2.6.39 以降が必要です。他のオペレーティング システムについては、該当のドキュメントをご覧ください。
サーバーの応答時間を最適化するには、コードをインストルメント化するか、アプリケーション監視ソリューションを使用してボトルネック（スクリプトの実行時間、データベースの呼び出し、RPC リクエスト、レンダリングなど）を特定します。200 ミリ秒以内に HTML レスポンスをレンダリングすることが目標です。
コンテンツ セキュリティ ポリシー（CSP）について教えてください。
CSP を使用している場合は、デフォルトのポリシーの更新が必要となる場合があります。
まず、インライン CSS 属性は多くの場合不要なコードの重複の原因となるため、可能であれば HTML 要素のインライン CSS 属性（例: < p style=...>）を使用しないでください。インライン CSS 属性はデフォルトで CSP によりブロックされます（「style-src」の「unsafe inline」を通じて無効になります）。CSP が有効になっていると、デフォルトですべてのインライン スクリプト タグがブロックされます。インライン JavaScript がある場合は、CSP ポリシーを更新してスクリプト ハッシュ値またはナンス値を使用するか、「unsafe-inline」を使用してすべてのインライン スクリプトが実行されるようにします。インライン スタイルがある場合は、CSP ポリシーを更新してスタイル ハッシュ値またはナンス値を使用するか、「unsafe-inline」を使用してすべてのインライン スタイルのブロックが処理されるようにします。
他にご不明な点がある場合は、お気軽に PageSpeed Insights のヘルプグループ（pagespeed-insights-discuss）をご利用ください。
|
{
"url": "https://developers.google.com/speed/docs/insights/mobile?hl=ja",
"source_domain": "developers.google.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "65421",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E4HBSWKX3VWFQ3WUVTPYKYDEBEEJQDGS",
"WARC-Concurrent-To": "<urn:uuid:a24c4f46-d2b9-4997-a586-a055252002b2>",
"WARC-Date": "2021-12-08T13:57:59Z",
"WARC-IP-Address": "142.251.45.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M64HT5ZNRUEATJQFUERQUGEMWZFHQXVI",
"WARC-Record-ID": "<urn:uuid:8498c5b7-375b-42a9-90aa-b213632e9293>",
"WARC-Target-URI": "https://developers.google.com/speed/docs/insights/mobile?hl=ja",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c8f8e237-52b0-45db-bd87-15dc63d207be>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\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,
28,
29,
237,
238,
427,
428,
451,
452,
644,
645,
759,
760,
992,
993,
1006,
1007,
1179,
1180,
1216,
1344,
1363,
1605,
1640,
1641,
1876,
1877,
2038,
2039,
2232,
2233,
2299,
2300,
2463,
2464,
2592,
2593,
2636,
2784,
2817,
2951,
2952,
2959,
2960,
3009,
3204,
3252,
3511,
3540,
3707,
3729,
3863,
3897,
4051,
4203,
4238,
4281,
4724,
4725
],
"line_end_idx": [
28,
29,
237,
238,
427,
428,
451,
452,
644,
645,
759,
760,
992,
993,
1006,
1007,
1179,
1180,
1216,
1344,
1363,
1605,
1640,
1641,
1876,
1877,
2038,
2039,
2232,
2233,
2299,
2300,
2463,
2464,
2592,
2593,
2636,
2784,
2817,
2951,
2952,
2959,
2960,
3009,
3204,
3252,
3511,
3540,
3707,
3729,
3863,
3897,
4051,
4203,
4238,
4281,
4724,
4725,
4808
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4808,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.004511279985308647,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07969924807548523,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8481202721595764,
"rps_doc_frac_unique_words": 0.7942386865615845,
"rps_doc_mean_word_length": 20.460905075073242,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.0015037599951028824,
"rps_doc_unigram_entropy": 5.067143440246582,
"rps_doc_word_count": 243,
"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.010257439687848091,
"rps_doc_frac_chars_top_3gram": 0.008447299711406231,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -275.3923034667969,
"rps_doc_books_importance_length_correction": -275.3923034667969,
"rps_doc_openwebtext_importance": -113.6451644897461,
"rps_doc_openwebtext_importance_length_correction": -113.6451644897461,
"rps_doc_wikipedia_importance": -84.66036224365234,
"rps_doc_wikipedia_importance_length_correction": -84.66036224365234
},
"fasttext": {
"dclm": 0.2887713313102722,
"english": 0,
"fineweb_edu_approx": 3.0996086597442627,
"eai_general_math": 0.0008011499885469675,
"eai_open_web_math": 0.044150590896606445,
"eai_web_code": 0.5930888652801514
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,443,283,080,881,996,000 |
ECS, IComponentData wont show in inspector
Hey people,
I just started exploring ECS, and i am trying to get a handle on it. So i am attempting to make a single cube rotate.
I follow, kinda, the simple example of rotation given by unity.
The following uses exactly the same structure as the IComponentData structs defined in the entities package.
using System;
using Unity.Entities;
[Serializable]
public struct RotationSpeed : IComponentData {
public float Value;
}
// This wrapper component is currently necessary to add ComponentData to GameObjects.
// In the future we want to make this wrapper component automatic.
public class RotationSpeedComponent : ComponentDataWrapper<RotationSpeed> { }
Problem is that unlike the ones in the entity package when i try to drag and drop them in the inspector it just informs me that it doesnt derive from monobehavior. I am trying to see why that happens, because it makes no sense to me
So the problem was that my *.cs file was named RotationSpeed.cs
The file should have the name of the wrapper class and not the struct
|
{
"url": "https://discussions.unity.com/t/ecs-icomponentdata-wont-show-in-inspector/208275",
"source_domain": "discussions.unity.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "21249",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ATIXUEH2WZA5PJGOP4HYQ7C3CIZQQS52",
"WARC-Concurrent-To": "<urn:uuid:784f5fe0-63dc-41a5-9a74-0441b62adbd1>",
"WARC-Date": "2023-09-28T02:47:14Z",
"WARC-IP-Address": "184.104.178.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F5NU6RDCCKBQWFFLMWBNGHX2N2PGVXQY",
"WARC-Record-ID": "<urn:uuid:07a9997e-7751-4c43-ba65-cef808dd07c2>",
"WARC-Target-URI": "https://discussions.unity.com/t/ecs-icomponentdata-wont-show-in-inspector/208275",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1fc2c8d5-6b06-4010-89f8-445565944c35>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-200\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,
43,
44,
56,
57,
175,
239,
348,
349,
363,
385,
386,
401,
448,
472,
474,
475,
561,
628,
706,
707,
940,
941,
1005
],
"line_end_idx": [
43,
44,
56,
57,
175,
239,
348,
349,
363,
385,
386,
401,
448,
472,
474,
475,
561,
628,
706,
707,
940,
941,
1005,
1074
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1074,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0.0037243899423629045,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4285714328289032,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024630539119243622,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15270936489105225,
"rps_doc_frac_unique_words": 0.6213017702102661,
"rps_doc_mean_word_length": 5.047337055206299,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.382625102996826,
"rps_doc_word_count": 169,
"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.023446660488843918,
"rps_doc_frac_chars_top_3gram": 0.021101990714669228,
"rps_doc_frac_chars_top_4gram": 0.025791319087147713,
"rps_doc_books_importance": -97.89897155761719,
"rps_doc_books_importance_length_correction": -97.89897155761719,
"rps_doc_openwebtext_importance": -46.29731750488281,
"rps_doc_openwebtext_importance_length_correction": -35.20539474487305,
"rps_doc_wikipedia_importance": -44.60734176635742,
"rps_doc_wikipedia_importance_length_correction": -44.60734176635742
},
"fasttext": {
"dclm": 0.5336815118789673,
"english": 0.8797351121902466,
"fineweb_edu_approx": 1.7694315910339355,
"eai_general_math": 0.9938055276870728,
"eai_open_web_math": 0.16814768314361572,
"eai_web_code": 0.9888830780982971
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,208,890,002,208,947,200 |
Menu
Java assignment1
0 Comment
Exercise 24.3: (pg no. 971)(Implement a doubly linked list) The MyLinkedList class used in Listing 24.5 isa one-way directional linked list that enables one-way traversal of the list. Modifythe Node class to add the new data field name previous to refer to the previousnode in the list, as follows:public class Node<E< {E element;Node<E< next;Node<E< previous;public Node(E e) {element = e;}}Implement a new class named TwoWayLinkedList that uses a doubly linked listto store elements. Define TwoWayLinkedList to implements MyList. You needto implement all the methods defined in MyLinkedList as well as the methodslistIterator() and listIterator(int index). Both return an instance ofjava.util.ListIterator<E< (see Figure 20.4). The former sets the cursor tothe head of the list and the latter to the element at the specified index.PDF-Introduction-to-Java-Programming-and-Data-Structures-Comprehensive-11th.pdfPosted: 6 months agoDue: 10/07/2019Budget: $30Tags: java AssignmentAnswers 2Prof. Dan.4.6 (46)4.8 (2k )Chat6 months agoPurchase the answer to view itDocumentation.docxTry it first(plagiarism check)Buy answer $50CHAD mulligan5.0 (12)4.7 (15)Chat6 months agoPurchase the answer to view itlinkedlist.zipTry it first(plagiarism check)Buy answer $30Bids 61Michelle MalkKATHERINE BECKSAsad UllahRESPECT WRITERwizard kimMukul5078Dr Candice_2547PHD doctorateWIZARD_KIMChrisProfimhmd.fmbithehProfessor LizzGradeSaverMalik TutorDr_Aabirah_786ansRohanTiny ChrisJessica LuisAll Works solverprof avrilJenny BoomDrNicNgaokite_solTalented WriterWendy LewisProf. Dan.Nancy DrewRey writerbrilliant answersProf. NicholasMiss ProfessorcomputerscienceANN HARRISProf.MacQueenkim woodsAdrian Monroework solutionsPh.D A Gradeperfectouniversity workTerry RobertsFavouritewriterSara WaynesAngelo Grahamsphyllis youngSterling Tutorhassanriaz123DexterMasters00000PLAGIARISMPROFJUMAAAsarapaul2013KIBBZMORIAProff work phd imtrqhasibfastestwriter1Emily Claresmart-tutorshivam5883code wizardEmily MichaelOther questions 10I need a 2 -3 page paperHealthcare administrationnursing hwpsychologyCST-111 Week 7 Topic 7 DQ 2Journal Essay(2) home workMKT 500 ASSIGNMENT 2 MARKETING MANEGEMENTCapitalism vs. SocialismChallenges in Long-Term CareRated 1 timesJava Homework(Note: I have attached the book below) (pg number 971)24.3: (Implement a doubly linked list) The MyLinkedList class used in Listing 24.5 isa one-way directional linked list that …Rated 1 timesJava AssignmentExercise 24.3: (pg no. 971)(Implement a doubly linked list) The MyLinkedList class used in Listing 24.5 isa one-way directional linked list that enables one-way traversal of the list. …Rated 1 timesJava Assignment2Project One consists of programming exercise:25.3 , 25.4, 25.5, 25.6 and 25.7 — (p.g no. 1006)Not ratedProject Project One consists of programming exercise 25.3, 25.4, 25.5, 25.6 and 25.7on — (p.g no. 1006)Note: I have attached the book .Not rated Project OneProject One consists of programming exercise 25.3, 25.4, 25.5, 25.6 and 25.7on — (p.g no. 1006)Note: I have attached the book .Not ratedJava homeworkExercise 24.3: (pg no. 971)(Implement a doubly linked list) The MyLinkedList class used in Listing 24.5 isa one-way directional linked list that enables one-way traversal of the …Not ratedJava project**** Project Two consists of implementing 28.13at page 1103**28.13 (4 * 4 16 tails problem) Listing 28.14, NineTail.java, presents a solution forthe nine tails problem. Revise this program …Not ratedJava Assignment1Exercise: 28.13 (pg number: 1103)(4 * 4 16 tails problem) Listing 28.14, NineTail.java, presents a solution forthe nine tails problem. Revise this program for the 4 * 4 16 tails problem.Note …Not ratedjava homework(Implement hashCode for string) Write a method that returns a hash code for stringusing the approach described in Section 27.3.2 with b value 31. The functionheader is as follows:public static int …Not ratedProject oneProject One consists of programming exercise 25.3, 25.4, 25.5, 25.6 and 25.7on — (p.g no. 1006)Note: I have attached the book .10/07/201930computerscience
|
{
"url": "http://harlaneanderson.com/java-assignment1/",
"source_domain": "harlaneanderson.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "21275",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TUGBDYRRRPDMTWWZ35HSQ3GUCPEMQY2H",
"WARC-Concurrent-To": "<urn:uuid:2f56215d-a7fc-4531-aa63-2c37b790f719>",
"WARC-Date": "2021-10-27T01:04:18Z",
"WARC-IP-Address": "85.90.247.197",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4MNNYRFEHBVP6IL4VKX3R4AG3PNCYRM4",
"WARC-Record-ID": "<urn:uuid:026cb5e9-e4a4-4e63-b98c-b3daedf3eb38>",
"WARC-Target-URI": "http://harlaneanderson.com/java-assignment1/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f54236ff-93c2-43ed-a903-89a5171c15cf>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-80\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,
5,
6,
23,
24,
34,
35
],
"line_end_idx": [
5,
6,
23,
24,
34,
35,
4109
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4109,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0.0009734699851833284,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17520858347415924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021454110741615295,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39928486943244934,
"rps_doc_frac_unique_words": 0.49803149700164795,
"rps_doc_mean_word_length": 6.624015808105469,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0.00715136993676424,
"rps_doc_unigram_entropy": 5.149484157562256,
"rps_doc_word_count": 508,
"rps_doc_frac_chars_dupe_10grams": 0.2861812710762024,
"rps_doc_frac_chars_dupe_5grams": 0.3111441433429718,
"rps_doc_frac_chars_dupe_6grams": 0.30520057678222656,
"rps_doc_frac_chars_dupe_7grams": 0.2861812710762024,
"rps_doc_frac_chars_dupe_8grams": 0.2861812710762024,
"rps_doc_frac_chars_dupe_9grams": 0.2861812710762024,
"rps_doc_frac_chars_top_2gram": 0.023774150758981705,
"rps_doc_frac_chars_top_3gram": 0.01931649073958397,
"rps_doc_frac_chars_top_4gram": 0.020208019763231277,
"rps_doc_books_importance": -412.8085632324219,
"rps_doc_books_importance_length_correction": -412.8085632324219,
"rps_doc_openwebtext_importance": -258.9981689453125,
"rps_doc_openwebtext_importance_length_correction": -258.9981689453125,
"rps_doc_wikipedia_importance": -190.07809448242188,
"rps_doc_wikipedia_importance_length_correction": -190.07809448242188
},
"fasttext": {
"dclm": 0.021375829353928566,
"english": 0.6893572807312012,
"fineweb_edu_approx": 2.338972568511963,
"eai_general_math": 0.41437292098999023,
"eai_open_web_math": 0.05941342934966087,
"eai_web_code": 0.7028329372406006
}
}
|
{
"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": "2",
"label": "Academic/Research"
}
},
"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": "1",
"label": "Truncated Snippets"
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-963,070,198,549,914,000 |
7
Since 1996 Jakob Nielsen annually publishes a list of "Top 10 Mistakes in Web Design". The top mistake in the latest list is Bad Search. It has not always been that way. In 2005 Bad Search was listed as number 5, and in 2003 it was not listed at all.
Overly literal search engines reduce usability in that they're unable to handle typos, plurals, hyphens, and other variants of the query terms. Such search engines are particularly difficult for elderly users, but they hurt everybody. - Jakob Nielsen
From experience I know it is often much better to search using an external search engine with keywords and the extension site:theWebSite.com, e.g. on Google, Bing, Yahoo and others. Problem is that it's probably not known and used as much as it could be. It leaves those users with either navigating the structure on the site or using the web sites internal search engine. If it is bad, the user will probably not find what she wants and move away from the site.
Now, Jakob Nielsen is not the only one expressing the problem with search. Peter Morville, author of Information Architecture for the World Wide Web, says that search is the "worst usability problem on the Web". Still "search" is one of the most used techniques to find content on the web. I often see misspelled words that don't render a search result, nor a suggested word list.
This is an example from BBC:
BBC display search result of a misspelled word
Using Google and the extension site:bbc.com, gives a result where the misspelled word have been corrected to azerbaijan and then showing search results from BBC web site. Also the user is informed that there were no results for the misspelled word on BBC. That's great, as long as Google does a good job in anticipating what I want to search for and the user knows how to use the extension site:bbc.com.
Google search result of a displayed word
Problem is that internal search engines often don't display a suggested spelling. It is possible to add suggested spelling and even different spellings based on different context. This can be displayed in different ways, thus the question: How to display misspelled words on search results?
Related question: How to display search results for different versions of an item?
Note to reviewer: This is a user refined question from the original too wide question asked march 28 2012.
• I am a little confused here,are you trying to show the search results for the misspelled words or different variations of the word? – Mervin Mar 29 '12 at 8:20
• @MFrank2012 Sorry about that. I'm trying to correct the misspelled word and give the user different suggestions on what the misspelled word could be corrected to. In short - correction variations. – Benny Skogberg Mar 29 '12 at 8:30
• 5
It's not about displaying them but rather about teaching your internal search engine to recognize them. – dnbrv Mar 29 '12 at 15:07
• 1
Interesting question. My initial thought was 'italic' but looking at the Google example that might need a 2nd thought. Looking forward to the answers here. – greenforest Mar 29 '12 at 17:29
4
I think there are two parts to resolving this.
1. The first is trying to ensure that people don't make spelling mistakes or at least helping them prevent making spelling mistakes. Though you can't get someone to have perfect spelling all the time, you can reduce the chances of the mistake by using Autocomplete, which can easily help fill out what the user might be searching for
enter image description here
2. The second aspect is recognizing that the user has made a spelling mistake despite the search engines help and there is no close matching word. Google does this rather poorly by giving you an error message like this:
enter image description here
However Bing offers an alternate solution:
enter image description here
So going by Bings approach, the layout I would potentially come up would be:
mockup
download bmml source – Wireframes created with Balsamiq Mockups
The only difference here is that we are showing the different spellings matches (now how the matching is done will depend on the ranking algorithm used by the search engine to match against the keyword entered and the word found in the site and of course we will have to take into consideration as to how much of a match is considered as a good match and how many variations to show and all) and the user can click on the other matches to filter down into the search results.
| improve this answer | |
• 2
Minor clarification: Google does return results for misspelled words - see the OP - it's just that their algorithm didn't pick up "acabacadra" as a misspelling of "abacadabra" and Bing's did. I believe the unfriendly message you saw occurs when there are no results despite their attempts to error-correct for you. – peteorpeter Mar 29 '12 at 22:14
• Point noted :),maybe I shouldnt be answering questions at 1 am in the night – Mervin Mar 29 '12 at 22:31
2
The first thing that came to my mind is the typical MS Word spelling correction hint:
Red, "curvy" or dashed underlined text
– Underlining the misspelled word in red, "curvy" or dashed.
Now I wonder if we can safely assume that users are used to "right clicking misspelled words will bring up spelling correction/alternatives"?
In any case, I'd say that the visual hint is a strong and established one and could well be used in the given context.
Edit: Visualization of how I'd employ the hint (Mockup blatantly stolen from MFrank2012)
enter image description here
| improve this answer | |
• But most browsers also do spell check for you nowadays,so how do you plan to override that? – Mervin Mar 29 '12 at 21:31
• @MFrank2012 – see your mockup with my amendment ;) – vzwick Mar 29 '12 at 21:44
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://ux.stackexchange.com/questions/19435/how-to-display-misspelled-words-on-search-results",
"source_domain": "ux.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "169874",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CE5VVMXJTRI5AWH24ESELLOLBEN3ZJLE",
"WARC-Concurrent-To": "<urn:uuid:ab88acf2-d06c-4251-9641-dda37fd08686>",
"WARC-Date": "2020-09-21T10:15:08Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KRYA7CKK7DYCTE4CH7IKNN257T6KYLH4",
"WARC-Record-ID": "<urn:uuid:18291a1e-8584-4f4e-90ba-a03556a5e720>",
"WARC-Target-URI": "https://ux.stackexchange.com/questions/19435/how-to-display-misspelled-words-on-search-results",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2d1085a4-4289-4b03-be1e-4ddc220c9fe4>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-59.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
254,
255,
506,
507,
970,
971,
1352,
1353,
1382,
1383,
1430,
1431,
1835,
1836,
1877,
1878,
2169,
2170,
2253,
2254,
2255,
2362,
2363,
2527,
2764,
2770,
2906,
2912,
3106,
3108,
3109,
3156,
3157,
3493,
3494,
3527,
3528,
3750,
3751,
3784,
3785,
3832,
3833,
3866,
3867,
3948,
3949,
3956,
3957,
4021,
4022,
4498,
4499,
4525,
4531,
4884,
4993,
4995,
4996,
5082,
5083,
5122,
5123,
5184,
5185,
5327,
5328,
5447,
5448,
5449,
5538,
5539,
5568,
5569,
5595,
5720,
5804,
5805,
5817,
5818,
5918,
5919
],
"line_end_idx": [
2,
3,
254,
255,
506,
507,
970,
971,
1352,
1353,
1382,
1383,
1430,
1431,
1835,
1836,
1877,
1878,
2169,
2170,
2253,
2254,
2255,
2362,
2363,
2527,
2764,
2770,
2906,
2912,
3106,
3108,
3109,
3156,
3157,
3493,
3494,
3527,
3528,
3750,
3751,
3784,
3785,
3832,
3833,
3866,
3867,
3948,
3949,
3956,
3957,
4021,
4022,
4498,
4499,
4525,
4531,
4884,
4993,
4995,
4996,
5082,
5083,
5122,
5123,
5184,
5185,
5327,
5328,
5447,
5448,
5449,
5538,
5539,
5568,
5569,
5595,
5720,
5804,
5805,
5817,
5818,
5918,
5919,
6009
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6009,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4196721315383911,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014754099771380424,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18196721374988556,
"rps_doc_frac_unique_words": 0.4034917652606964,
"rps_doc_mean_word_length": 4.5771098136901855,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.436365127563477,
"rps_doc_word_count": 1031,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010171649977564812,
"rps_doc_frac_chars_dupe_6grams": 0.010171649977564812,
"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.008476370014250278,
"rps_doc_frac_chars_top_3gram": 0.011866919696331024,
"rps_doc_frac_chars_top_4gram": 0.015257470309734344,
"rps_doc_books_importance": -476.86883544921875,
"rps_doc_books_importance_length_correction": -476.86883544921875,
"rps_doc_openwebtext_importance": -317.1180114746094,
"rps_doc_openwebtext_importance_length_correction": -317.1180114746094,
"rps_doc_wikipedia_importance": -213.00086975097656,
"rps_doc_wikipedia_importance_length_correction": -213.00086975097656
},
"fasttext": {
"dclm": 0.09883928298950195,
"english": 0.9386049509048462,
"fineweb_edu_approx": 2.1577024459838867,
"eai_general_math": 0.05118680000305176,
"eai_open_web_math": 0.1503322720527649,
"eai_web_code": 0.009108070284128189
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,011,599,296,975,593,000 |
Linear function
In mathematics, the term linear function refers to two distinct but related notions:[1]
As a polynomial functionEdit
Graphs of two linear functions.
In calculus, analytic geometry and related areas, a linear function is a polynomial of degree one or less, including the zero polynomial (the latter not being considered to have degree zero).
When the function is of only one variable, it is of the form
where a and b are constants, often real numbers. The graph of such a function of one variable is a nonvertical line. a is frequently referred to as the slope of the line, and b as the intercept.
If a > 0 then the gradient is positive and the graph slopes upwards.
If a < 0 then the gradient is negative and the graph slopes downwards.
For a function of any finite number of variables, the general formula is
and the graph is a hyperplane of dimension k.
A constant function is also considered linear in this context, as it is a polynomial of degree zero or is the zero polynomial. Its graph, when there is only one variable, is a horizontal line.
In this context, a function that is also a linear map (the other meaning) may be referred to as a homogeneous linear function or a linear form. In the context of linear algebra, the polynomial functions of degree 0 or 1 are the scalar-valued affine maps.
As a linear mapEdit
The integral of a function is a linear map from the vector space of integrable functions to the real numbers.
In linear algebra, a linear function is a map f between two vector spaces s.t.
Here a denotes a constant belonging to some field K of scalars (for example, the real numbers) and x and y are elements of a vector space, which might be K itself.
In other terms the linear function preserves vector addition and scalar multiplication.
Some authors use "linear function" only for linear maps that take values in the scalar field;[6] these are more commonly called linear forms.
The "linear functions" of calculus qualify as "linear maps" when (and only when) f(0, ..., 0) = 0, or, equivalently, when the above constant b equals zero. Geometrically, the graph of the function must pass through the origin.
See alsoEdit
NotesEdit
1. ^ "The term linear function means a linear form in some textbooks and an affine function in others." Vaserstein 2006, p. 50-1
2. ^ Stewart 2012, p. 23
3. ^ A. Kurosh (1975). Higher Algebra. Mir Publishers. p. 214.
4. ^ T. M. Apostol (1981). Mathematical Analysis. Addison-Wesley. p. 345.
5. ^ Shores 2007, p. 71
6. ^ Gelfand 1961
ReferencesEdit
|
{
"url": "https://en.m.wikipedia.org/wiki/Linear_function",
"source_domain": "en.m.wikipedia.org",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "63858",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XOWOOMIDM3CCTP3VSOHDWOLYVVHGSRMY",
"WARC-Concurrent-To": "<urn:uuid:b6f33e4a-bc8f-4065-8cdb-90125daf62a3>",
"WARC-Date": "2023-04-01T07:19:40Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RVQFBQSHAGUDPQ72R76WU2VMHIPYVANA",
"WARC-Record-ID": "<urn:uuid:219668d7-0afd-4251-8960-38ec1d1d0e26>",
"WARC-Target-URI": "https://en.m.wikipedia.org/wiki/Linear_function",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5802aeee-4649-444e-8c0e-e9b7a870fa43>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-202\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,
16,
17,
105,
106,
135,
136,
138,
170,
171,
363,
364,
425,
426,
428,
429,
624,
625,
694,
695,
766,
767,
842,
843,
845,
846,
892,
893,
1086,
1087,
1342,
1343,
1363,
1364,
1366,
1476,
1477,
1556,
1557,
1559,
1561,
1562,
1726,
1727,
1815,
1816,
1958,
1959,
2186,
2187,
2200,
2201,
2211,
2212,
2343,
2370,
2435,
2511,
2537,
2557,
2558
],
"line_end_idx": [
16,
17,
105,
106,
135,
136,
138,
170,
171,
363,
364,
425,
426,
428,
429,
624,
625,
694,
695,
766,
767,
842,
843,
845,
846,
892,
893,
1086,
1087,
1342,
1343,
1363,
1364,
1366,
1476,
1477,
1556,
1557,
1559,
1561,
1562,
1726,
1727,
1815,
1816,
1958,
1959,
2186,
2187,
2200,
2201,
2211,
2212,
2343,
2370,
2435,
2511,
2537,
2557,
2558,
2572
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2572,
"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.37798166275024414,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01100916974246502,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.236697256565094,
"rps_doc_frac_unique_words": 0.41743117570877075,
"rps_doc_mean_word_length": 4.504587173461914,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.001834859955124557,
"rps_doc_unigram_entropy": 4.5611958503723145,
"rps_doc_word_count": 436,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05957230180501938,
"rps_doc_frac_chars_dupe_6grams": 0.02138493023812771,
"rps_doc_frac_chars_dupe_7grams": 0.02138493023812771,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05702647939324379,
"rps_doc_frac_chars_top_3gram": 0.016802439466118813,
"rps_doc_frac_chars_top_4gram": 0.02138493023812771,
"rps_doc_books_importance": -248.09652709960938,
"rps_doc_books_importance_length_correction": -248.09652709960938,
"rps_doc_openwebtext_importance": -154.48995971679688,
"rps_doc_openwebtext_importance_length_correction": -154.48995971679688,
"rps_doc_wikipedia_importance": -140.55165100097656,
"rps_doc_wikipedia_importance_length_correction": -140.55165100097656
},
"fasttext": {
"dclm": 0.6708013415336609,
"english": 0.8699010014533997,
"fineweb_edu_approx": 3.4444894790649414,
"eai_general_math": 0.9999886751174927,
"eai_open_web_math": 0.8818376064300537,
"eai_web_code": 0.9254390597343445
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "515.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,950,392,777,903,053,300 |
StructTS
0th
Percentile
Fit Structural Time Series
Fit a structural model for a time series by maximum likelihood.
Keywords
ts
Usage
StructTS(x, type = c("level", "trend", "BSM"), init = NULL, fixed = NULL, optim.control = NULL)
Arguments
x
a univariate numeric time series. Missing values are allowed.
type
the class of structural model. If omitted, a BSM is used for a time series with frequency(x) > 1, and a local trend model otherwise. Can be abbreviated.
init
initial values of the variance parameters.
fixed
optional numeric vector of the same length as the total number of parameters. If supplied, only NA entries in fixed will be varied. Probably most useful for setting variances to zero.
optim.control
List of control parameters for optim. Method "L-BFGS-B" is used.
Details
Structural time series models are (linear Gaussian) state-space models for (univariate) time series based on a decomposition of the series into a number of components. They are specified by a set of error variances, some of which may be zero.
The simplest model is the local level model specified by type = "level". This has an underlying level $m[t]$ which evolves by $$\mu_{t+1} = \mu_t + \xi_t, \qquad \xi_t \sim N(0, \sigma^2_\xi)$$ The observations are $$x_t = \mu_t + \epsilon_t, \qquad \epsilon_t \sim N(0, \sigma^2_\epsilon)$$ There are two parameters, $\sigma^2_\xi$ and $\sigma^2_eps$. It is an ARIMA(0,1,1) model, but with restrictions on the parameter set.
The local linear trend model, type = "trend", has the same measurement equation, but with a time-varying slope in the dynamics for $m[t]$, given by $$ \mu_{t+1} = \mu_t + \nu_t + \xi_t, \qquad \xi_t \sim N(0, \sigma^2_\xi) $$ $$ \nu_{t+1} = \nu_t + \zeta_t, \qquad \zeta_t \sim N(0, \sigma^2_\zeta) $$ with three variance parameters. It is not uncommon to find $\sigma^2_\zeta = 0$ (which reduces to the local level model) or $\sigma^2_\xi = 0$, which ensures a smooth trend. This is a restricted ARIMA(0,2,2) model.
The basic structural model, type = "BSM", is a local trend model with an additional seasonal component. Thus the measurement equation is $$x_t = \mu_t + \gamma_t + \epsilon_t, \qquad \epsilon_t \sim N(0, \sigma^2_\epsilon)$$ where $s[t]$ is a seasonal component with dynamics $$ \gamma_{t+1} = -\gamma_t + \cdots + \gamma_{t-s+2} + \omega_t, \qquad \omega_t \sim N(0, \sigma^2_\omega) $$ The boundary case $\sigma^2_w = 0$ corresponds to a deterministic (but arbitrary) seasonal pattern. (This is sometimes known as the ‘dummy variable’ version of the BSM.)
Value
A list of class "StructTS" with components:
coef
the estimated variances of the components.
loglik
the maximized log-likelihood. Note that as all these models are non-stationary this includes a diffuse prior for some observations and hence is not comparable to arima nor different types of structural models.
loglik0
the maximized log-likelihood with the constant used prior to R 3.0.0, for backwards compatibility.
data
the time series x.
residuals
the standardized residuals.
fitted
a multiple time series with one component for the level, slope and seasonal components, estimated contemporaneously (that is at time $t$ and not at the end of the series).
call
the matched call.
series
the name of the series x.
code
the convergence code returned by optim.
model, model0
Lists representing the Kalman Filter used in the fitting. See KalmanLike. model0 is the initial state of the filter, model its final state.
xtsp
the tsp attributes of x.
Note
Optimization of structural models is a lot harder than many of the references admit. For example, the AirPassengers data are considered in Brockwell & Davis (1996): their solution appears to be a local maximum, but nowhere near as good a fit as that produced by StructTS. It is quite common to find fits with one or more variances zero, and this can include $sigma^2_eps$.
References
Brockwell, P. J. & Davis, R. A. (1996). Introduction to Time Series and Forecasting. Springer, New York. Sections 8.2 and 8.5.
Durbin, J. and Koopman, S. J. (2001) Time Series Analysis by State Space Methods. Oxford University Press.
Harvey, A. C. (1989) Forecasting, Structural Time Series Models and the Kalman Filter. Cambridge University Press.
Harvey, A. C. (1993) Time Series Models. 2nd Edition, Harvester Wheatsheaf.
See Also
KalmanLike, tsSmooth; stl for different kind of (seasonal) decomposition.
Aliases
• StructTS
• print.StructTS
• predict.StructTS
Examples
library(stats) ## see also JohnsonJohnson, Nile and AirPassengers require(graphics) trees <- window(treering, start = 0) (fit <- StructTS(trees, type = "level")) plot(trees) lines(fitted(fit), col = "green") tsdiag(fit) (fit <- StructTS(log10(UKgas), type = "BSM")) par(mfrow = c(4, 1)) # to give appropriate aspect ratio for next plot. plot(log10(UKgas)) plot(cbind(fitted(fit), resids=resid(fit)), main = "UK gas consumption") ## keep some parameters fixed; trace optimizer: StructTS(log10(UKgas), type = "BSM", fixed = c(0.1,0.001,NA,NA), optim.control = list(trace = TRUE))
Documentation reproduced from package stats, version 3.2.2, License: Part of R 3.2.2
Community examples
Looks like there are no examples yet.
|
{
"url": "https://www.rdocumentation.org/packages/stats/versions/3.2.2/topics/StructTS",
"source_domain": "www.rdocumentation.org",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "20645",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R44BAAJ6CIRFIUQTY2IYTFR3LE2YCHZA",
"WARC-Concurrent-To": "<urn:uuid:ea49f77b-927f-467d-a917-9571d4414159>",
"WARC-Date": "2021-02-27T18:27:27Z",
"WARC-IP-Address": "52.5.82.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VKTMW3D4ZIZS46DVIC2PZJH3X4PSUOCI",
"WARC-Record-ID": "<urn:uuid:e5696cb3-058f-404a-850a-42c20bf37316>",
"WARC-Target-URI": "https://www.rdocumentation.org/packages/stats/versions/3.2.2/topics/StructTS",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2fccc33d-daa0-4a9c-95b8-d20a0903a3a9>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-43.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,
9,
10,
14,
15,
26,
27,
54,
55,
119,
120,
129,
132,
138,
234,
244,
246,
308,
313,
466,
471,
514,
520,
704,
718,
783,
791,
792,
1035,
1036,
1462,
1463,
1980,
1981,
2539,
2540,
2546,
2547,
2591,
2596,
2639,
2646,
2856,
2864,
2963,
2968,
2987,
2997,
3025,
3032,
3204,
3209,
3227,
3234,
3260,
3265,
3305,
3319,
3459,
3464,
3489,
3490,
3495,
3496,
3869,
3870,
3881,
3882,
4009,
4010,
4117,
4118,
4233,
4234,
4310,
4311,
4320,
4321,
4395,
4396,
4404,
4417,
4436,
4457,
4466,
5044,
5129,
5130,
5149,
5150
],
"line_end_idx": [
9,
10,
14,
15,
26,
27,
54,
55,
119,
120,
129,
132,
138,
234,
244,
246,
308,
313,
466,
471,
514,
520,
704,
718,
783,
791,
792,
1035,
1036,
1462,
1463,
1980,
1981,
2539,
2540,
2546,
2547,
2591,
2596,
2639,
2646,
2856,
2864,
2963,
2968,
2987,
2997,
3025,
3032,
3204,
3209,
3227,
3234,
3260,
3265,
3305,
3319,
3459,
3464,
3489,
3490,
3495,
3496,
3869,
3870,
3881,
3882,
4009,
4010,
4117,
4118,
4233,
4234,
4310,
4311,
4320,
4321,
4395,
4396,
4404,
4417,
4436,
4457,
4466,
5044,
5129,
5130,
5149,
5150,
5187
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5187,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.001927900011651218,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21422861516475677,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03117506019771099,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37250199913978577,
"rps_doc_frac_unique_words": 0.449664443731308,
"rps_doc_mean_word_length": 5.174496650695801,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0.0039968001656234264,
"rps_doc_unigram_entropy": 5.30772066116333,
"rps_doc_word_count": 745,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04461738094687462,
"rps_doc_frac_chars_dupe_6grams": 0.032684821635484695,
"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.031128399074077606,
"rps_doc_frac_chars_top_3gram": 0.015564199537038803,
"rps_doc_frac_chars_top_4gram": 0.0072632902301847935,
"rps_doc_books_importance": -530.8141479492188,
"rps_doc_books_importance_length_correction": -530.8141479492188,
"rps_doc_openwebtext_importance": -308.7821350097656,
"rps_doc_openwebtext_importance_length_correction": -308.7821350097656,
"rps_doc_wikipedia_importance": -241.7743682861328,
"rps_doc_wikipedia_importance_length_correction": -241.7743682861328
},
"fasttext": {
"dclm": 0.03995656967163086,
"english": 0.8185789585113525,
"fineweb_edu_approx": 2.2208609580993652,
"eai_general_math": 0.998130738735199,
"eai_open_web_math": 0.8354690074920654,
"eai_web_code": 0.9816723465919495
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,965,067,787,277,436,000 |
Loading
fastcompany:
Recent Royal College of Art graduate Po-Chih Lai has designed a skateboard that can cruise down stairs without a second thought. Called the Stair Rover, it’s the semi of skateboards, an 8-wheeled beast that’s quite literally “rocking” an aluminum Y-frame to transform stairs into a passive-propelling landscape.
Watch: This Skateboard Lets You Ride Down Stairs With Unbelievable Ease
07.09.12 ♥ 107
fastcompany:
Is this really depressing or is it just that I’m reading it on my smartphone, alone in a crowded cafe?
newsweek:
ADDICTED TO INTERNETS, Y’ALL!
(But srsly, think this whole thing is making us a little nutso? That’s our cover this week: How ‘connection addiction’ is re-wiring our brains.)
An excerpt:
Questions about the Internet’s deleterious effects on the mind are at least as old as hyperlinks. But even among Web skeptics, the idea that a new technology might influence how we think and feel—let alone contribute to a great American crack-up—was considered silly and naive, like waving a cane at electric light or blaming the television for kids these days. Instead, the Internet was seen as just another medium, a delivery system, not a diabolical machine. It made people happier and more productive. And where was the proof otherwise?
Now, however, the proof is starting to pile up. The first good, peer-reviewed research is emerging, and the picture is much gloomier than the trumpet blasts of Web utopians have allowed. The current incarnation of the Internet—portable, social, accelerated, and all-pervasive—may be making us not just dumber or lonelier but more depressed and anxious, prone to obsessive-compulsive and attention-deficit disorders, even outright psychotic. Our digitized minds can scan like those of drug addicts, and normal people are breaking down in sad and seemingly new ways.
Want more? Read: Is the Web Driving Us Mad?
Today we stand at the Information Age’s frontier: the Hybrid Age. The Hybrid Age is a new sociotechnical era that is unfolding as technologies merge with each other and humans merge with technology ⎯ both at the same time. Information technology’s exponentially increasing power is propelling other fields forward at accelerating rates, allowing them to transcend their individual limitations in scale and speed. This applies to DNA sequencing, 3-D printing and manufacturing, and almost every other technological sphere. Other fields are also helping IT to accelerate, even potentially overcoming Moore’s Law, which predicted that integrated-circuit capacity doubles approximately every two years. Microprocessors are now reaching the physical limitation of two-dimensional silicon chips as transistors reach atomic size. Computer scientists are teaming up with physicists to explore subatomic quantum computing, in which electrons could become conduits of unique data; biologists have made breakthroughs in molecular computing, which uses enzymes and DNA strands to replace silicon chips altogether. Silicon Valley might soon be something of a misnomer as ever more companies and universities start investing in research on oxygen, carbon, nitrogen and phosphorus.The cross-pollination of leading-edge sectors such as information technology, biotechnology, pervasive computing, robotics, neuroscience and nanotechnology spells the end of certain turf wars over nomenclature.
It is neither the “Bio Age” nor the “Nano Age” nor the “Neuro Age,” but the hybrid of all of these at the same time. At the same time, our own relationship to technology is moving beyond the instrumental to the existential. There is an accelerating centripetal dance between what technologies are doing outside us and inside us. Externally, technology no longer simply processes our instructions on a one-way street. Instead, it increasingly provides intelligent feedback. Internally, we are moving beyond using technology only to dominate nature toward making ourselves the template for technology, integrating technologies within ourselves physically. We don’t just use technology; we absorb it.
The Hybrid Age – new TED book by technologist futurists Parag Khanna and Ayesha Khanna explores our co-evolution with technology. (via explore-blog)
inothernews:
YOU’RE NUMBER TWO Italian defender Leonardo Bonucci, top, reacted as Spanish players celebrated after winning the Euro 2012 soccer championship match on Sunday at the Olympic Stadium in Kiev. Spain won 4-0. (Photo: Jeff Pachouda / AFP-Getty via The Wall Street Journal)
07.03.12 ♥ 44
mothernaturenetwork:
Higgs boson ready for prime time
On July 4, scientists will unveil new evidence suggesting the ‘God particle’ really exists, a revelation that could affect how we think about the universe.
07.03.12 ♥ 245
07.01.12 ♥ 8692
futuramb:
The productivity puzzle: More work, less stuffeconomist.com
The productivity puzzleMore work, less stuffBritain’s strange, weak, job-rich economic recoveryTHE economy is in a bad way. Exports are sinking, the cost of bank credit is rising, the state is cutting back and businesses anxious…
Interesting how countries approach the economic downturn in different ways. The long term answer to the economic squeeze and increasing talent wars sooner or later have to result in lowered expectations which UK businesses seems to have acknowledged already.
futuramb:
The productivity puzzle: More work, less stuff
economist.com
The productivity puzzle
More work, less stuff
Britain’s strange, weak, job-rich economic recovery
THE economy is in a bad way. Exports are sinking, the cost of bank credit is rising, the state is cutting back and businesses anxious…
Interesting how countries approach the economic downturn in different ways. The long term answer to the economic squeeze and increasing talent wars sooner or later have to result in lowered expectations which UK businesses seems to have acknowledged already.
07.01.12 ♥ 6
zaporn:
Black and White
( At DeviantART by deadlittlebluething )
always1895:
Welcome to the 200th Always1895.net post!! The number 200 is a clean, round figure that is traditionally thought of as a significant milestone or marker (e.g. the United States celebrated it’s Bicentennial back in 1976 marking 200 years since we adopted the Declaration…
scinerds:
How Many Neutrons and Protons Can Get Along? Maybe 7,000
Image: This illustration of the nuclear landscape shows atomic isotopes arranged by an increasing number of protons (up) and neutrons (right). The dark blue blocks represent stable isotopes, while the lighter blue blocks are unstable isotopes that have been observed. The gray blocks are possible isotopes that have not yet been observed. The yellow clouds represent the drip lines that bound the possible nuclides. A June 2012 study estimated total of roughly 7,000 nuclides are possible. Credit: Andy Sproles, Oak Ridge National Laboratory
Scientists have long wondered whether there is a limit to the number of protons and neutrons that can be clustered together to form the nucleus of an atom. A new study comes closer than ever to finding the answer by estimating the total number of nucleus variations that can exist.
The periodic table of elements includes 118 known species of atoms, and each of these exists (either naturally or synthetically) in several versions with differing numbers of neutrons, giving rise to a total of about 3,000 different atomic nuclei. As technology has improved over the years, physicists have been building heavier and heavier atoms — element 117 was created only last year, and researchers are hot on the trail of 119. New projects are in the works to add and subtract neutrons to known elements to create ever more exotic variations, known as isotopes.
But where does it end?
Continue..
n-a-s-a:
Conjunctions near Dawn
Image Credit & Copyright: Luis Argerich
06.30.12 ♥ 38689
decayintostars:
Pierce by *JaimeIbarra
Model: Jessa
scinerds:
When does a minute last 61 seconds?
On this coming Sunday June 30, intrepid horologists from around the world will daringly attempt to hold back the relentless onslaught of time. Well, to be fair it won’t actually be that difficult. July 1st is scheduled to start an entire second later than it should, a feat of temporal distortion that will be accomplished by making the final minute of the month last 61 seconds.
And should you feel put out by this, you can take it up with the Earth and its wobbly spin.
2012 features a leap second — that ever so important added slice of time that compensates for inconsistencies in the Earth’s rotation. It takes our planet just over 86,400 seconds to make its 360-degree rotation. But because the Earth is affected by the gravitational pull of the Sun and Moon, along with the rolling of the tides, our planet’s rotation is slightly slowed down.
These rotational mis-steps cause the Earth to get out of synch with International Atomic Time (IAT), which uses the pulsation of atoms to measure time to an accuracy of several billionths of a second. In order to resynchronize solar time with IAT time, the Coordinated Universal Time (UTC) is adjusted every few years to give us the odd 86,401 second day.
Now, while this might seem like much ado about nothing, a recent article by Laurent Banguet in Cosmos Magazine noted that it’s not without controversy:
The leap second has long caused debate among member countries of the International Telecommunication Union (ITU), with some arguing for it to be abolished in favour of the exclusive use of atomic time.
Every time a second is added, the world’s computers need to be manually adjusted, a costly practice that also boosts the risk of error.
High-precision systems such as satellites and some data networks will have to factor in the leap second or risk provoking a calculation catastrophe.
It’s for this reason, notes Banguet, that rocket launches are never scheduled for leap-second dates.
This will be the 25th intervention, with the last three leap seconds happening in 2008, 2005, and 1998. Back in 1972, the year they started the practice, they had to add an excruciating two seconds to the clock.
So, what are you going to do with that extra second on June 30?
06.24.12 ♥ 17989
06.24.12 ♥ 380
|
{
"url": "http://9gadgets.tumblr.com/",
"source_domain": "9gadgets.tumblr.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "146263",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UFQ5WPCS35Z3QTGSUCMGX6PGHWTSX6M7",
"WARC-Concurrent-To": "<urn:uuid:7513cda1-d4e9-420c-83fc-ab66abddaafb>",
"WARC-Date": "2014-09-21T04:03:38Z",
"WARC-IP-Address": "66.6.41.21",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FSULJMVLPIGF6X5MEVLEZZTXBCZVH6N5",
"WARC-Record-ID": "<urn:uuid:0627cd1b-3825-4881-af83-a196c458e58a>",
"WARC-Target-URI": "http://9gadgets.tumblr.com/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b069f4d6-3b8f-4341-b2b5-d00ae26913b0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 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,
2,
10,
11,
24,
25,
337,
338,
410,
411,
426,
427,
440,
441,
544,
545,
555,
556,
587,
588,
733,
734,
746,
747,
1288,
1289,
1854,
1855,
1899,
1900,
3377,
3378,
4076,
4077,
4226,
4227,
4240,
4241,
4515,
4516,
4530,
4531,
4552,
4553,
4586,
4742,
4743,
4758,
4774,
4784,
4785,
4845,
5084,
5085,
5344,
5345,
5355,
5356,
5403,
5417,
5418,
5442,
5443,
5465,
5466,
5518,
5519,
5663,
5664,
5923,
5924,
5937,
5938,
5946,
5947,
5963,
5964,
6005,
6006,
6018,
6019,
6290,
6291,
6301,
6302,
6359,
6360,
6902,
6903,
7185,
7186,
7755,
7756,
7779,
7780,
7791,
7792,
7801,
7802,
7825,
7826,
7867,
7868,
7885,
7886,
7902,
7903,
7926,
7927,
7941,
7942,
7952,
7953,
7989,
7990,
8370,
8371,
8463,
8464,
8842,
8843,
9199,
9200,
9352,
9353,
9555,
9556,
9692,
9693,
9842,
9843,
9944,
9945,
10157,
10158,
10222,
10223,
10240
],
"line_end_idx": [
2,
10,
11,
24,
25,
337,
338,
410,
411,
426,
427,
440,
441,
544,
545,
555,
556,
587,
588,
733,
734,
746,
747,
1288,
1289,
1854,
1855,
1899,
1900,
3377,
3378,
4076,
4077,
4226,
4227,
4240,
4241,
4515,
4516,
4530,
4531,
4552,
4553,
4586,
4742,
4743,
4758,
4774,
4784,
4785,
4845,
5084,
5085,
5344,
5345,
5355,
5356,
5403,
5417,
5418,
5442,
5443,
5465,
5466,
5518,
5519,
5663,
5664,
5923,
5924,
5937,
5938,
5946,
5947,
5963,
5964,
6005,
6006,
6018,
6019,
6290,
6291,
6301,
6302,
6359,
6360,
6902,
6903,
7185,
7186,
7755,
7756,
7779,
7780,
7791,
7792,
7801,
7802,
7825,
7826,
7867,
7868,
7885,
7886,
7902,
7903,
7926,
7927,
7941,
7942,
7952,
7953,
7989,
7990,
8370,
8371,
8463,
8464,
8842,
8843,
9199,
9200,
9352,
9353,
9555,
9556,
9692,
9693,
9842,
9843,
9944,
9945,
10157,
10158,
10222,
10223,
10240,
10254
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10254,
"ccnet_original_nlines": 137,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3610144257545471,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012928890064358711,
"rps_doc_frac_lines_end_with_ellipsis": 0.021739130839705467,
"rps_doc_frac_no_alph_words": 0.19592243432998657,
"rps_doc_frac_unique_words": 0.4909204840660095,
"rps_doc_mean_word_length": 5.205385208129883,
"rps_doc_num_sentences": 96,
"rps_doc_symbol_to_word_ratio": 0.0014917999505996704,
"rps_doc_unigram_entropy": 5.987525463104248,
"rps_doc_word_count": 1597,
"rps_doc_frac_chars_dupe_10grams": 0.07963430881500244,
"rps_doc_frac_chars_dupe_5grams": 0.09467100352048874,
"rps_doc_frac_chars_dupe_6grams": 0.09467100352048874,
"rps_doc_frac_chars_dupe_7grams": 0.09467100352048874,
"rps_doc_frac_chars_dupe_8grams": 0.07963430881500244,
"rps_doc_frac_chars_dupe_9grams": 0.07963430881500244,
"rps_doc_frac_chars_top_2gram": 0.004210270009934902,
"rps_doc_frac_chars_top_3gram": 0.004330569878220558,
"rps_doc_frac_chars_top_4gram": 0.004691449925303459,
"rps_doc_books_importance": -851.9812622070312,
"rps_doc_books_importance_length_correction": -851.9812622070312,
"rps_doc_openwebtext_importance": -508.39654541015625,
"rps_doc_openwebtext_importance_length_correction": -508.39654541015625,
"rps_doc_wikipedia_importance": -391.7311096191406,
"rps_doc_wikipedia_importance_length_correction": -391.7311096191406
},
"fasttext": {
"dclm": 0.14023131132125854,
"english": 0.9237250089645386,
"fineweb_edu_approx": 2.6312055587768555,
"eai_general_math": 0.33484703302383423,
"eai_open_web_math": 0.32068848609924316,
"eai_web_code": 0.013591050170361996
}
}
|
{
"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": "338.9",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "1",
"label": "News/Editorial"
},
"secondary": {
"code": "9",
"label": "Personal/Misc"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,118,527,263,971,866,000 |
Aktive Verteidigung gegen Krypto-Trojaner
29.02.2016 yahe code legacy security thoughts
Mit Locky sieht die IT-Welt derzeit einen der koordiniertesten Trojanerangriff der jüngeren Zeit. Während er sich Anfangs als Schläfer getarnt haben soll, findet er inzwischen auf unterschiedlichsten Wegen sein Ziel: als Word- oder Excel-Dokument mit schädlichem Makro; als JavaScript-Datei, die sich z.B. als angebliches Sipgate-Fax tarnt; oder gar als altmodische und als ausgestorben geglaubte Batch-Datei. Bei den Opfern des Verschlüsselungstrojaners handelt es sich auch um größere Organisationen wie Krankenhäuser und ein Fraunhofer-Institut. Man ging zeitweise von 5000 Neuinfektionen pro Stunde aus.
Die Vorschläge für Gegenmaßnahmen sehen derzeit noch eher mager aus. Die einen raten zur Symptombekämpfung durch Backups, deaktivierte Makros und Virenscannern. Andere wiederum versuchen, den Krypto-Trojaner anhand seiner Funktionsweise zu erkennen und so eine Anti-Malware-Software auf Heuristikbasis zu entwickeln.
Um sich erfolgreich gegen solch einen Trojanerangriff zur Wehr zu setzen, muss man jedoch an mehreren Baustellen aktiv werden und anstatt unterschiedlichste Teilmaßnahmen einzuführen, sollte man sich überlegen, welche Kombination von Maßnahmen zu einem ganzheitlichen Schutz führen kann. Die folgende Auflistung soll dabei eine kleine Hilfestellung für einen aktiven Umgang mit solch einem Infektionsrisiko bieten. Das folgende Dreiergespann aus Vermeidung, Erkennung und Behebung ist auch in der Medizin durchaus weit verbreitet.
Zuerst einmal sollte man natürlich das Thema Vermeidung betrachten. Hierzu zählen Dinge wie das Deaktivieren der Makrofunktion in Office-Anwendungen und die Aufklärung von Mailnutzern darüber, dass Office-Anhänge von außen nicht zu öffnen und ZIP-Dateien von außen nicht zu entpacken sind. Auch das Deaktivieren von JavaScript auf exponierten Arbeitsplätzen oder gar der Wechsel auf ein Betriebssystem mit konsequenter Trennung von Ausführungsrechten und Dateinamen kann eine Option darstellen.
Anschließend sollte man sich darum kümmern, eine Erkennung eines erfolgreichen Angriffs zu ermöglichen. Erst, wenn eine Infektion erkannt werden kann, kann sie im Anschluss auch behoben werden. Leider ist es noch häufig so, dass eine Erkennung lediglich durch Virenscanner erfolgt. Diese sind jedoch so spezifisch an einzelne Schädlinge und deren Verhalten angepasst, dass neue Generationen häufig für längere Zeit unentdeckt bleiben. Anstatt Verhaltensmuster der Schädlinge zu untersuchen, ist es daher sinnvoller, Standardverhaltensmuster seiner Mitarbeiter zu aggregieren und Abweichungen von diesem Standardverhalten in einem Sicherheitsmonitoring zu sammeln. So ist es möglich, auch neue Schädlinge anhand eines vom Durchschnitt abweichenden Verhaltens zu erkennen. Beispielsweise könnte zum Erkennen eines Krypto-Trojaners die durchschnittliche Anzahl an neu erstellten, bearbeiteten und gelöschten Dateien pro Tag herhalten. Während ein typischer Büroarbeiter eher selten viele Dateien gleichzeitig anlegt und gleichzeitig viele Dateien löscht, ist genau das das Hauptgeschäft von Krypto-Trojanern. Solch eine Erkennung von Abweichungen kann mit Canaries ergänzt werden. Dabei handelt es sich um Dateien, die extra als Opfer für einen Verschlüsselungstrojaner bereitgestellt werden und deren Bearbeitung als ein eindeutiges Indiz für das Vorhandensein eines Krypto-Trojaners dienen kann. Das Ziel der Erkennung ist es, von einem Problem zu erfahren, noch bevor der Nutzer etwa Ungewöhnliches feststellt.
Abschließend muss das Thema der Behebung betrachtet werden. Hierzu zählen an erster Stelle regelmäßige Backups. Das häufig kommunizierte Mantra, Dateien auf einem externen Datenträger zu sichern und diesen anschließend wieder vom Computer zu trennen, stellt in den meisten Umgebungen keinen ausreichenden Schutz dar. Denn während des Backups kann auch der externe Datenträger befallen und verschlüsselt werden. Der eigentliche Wunsch hinter solch einer Aussage ist vielmehr, eine Sicherung zu erstellen, die von einer eventuellen Infektion nicht beeinflusst werden kann. Sinnvolle Varianten können hierbei extern durchgeführte Backups sein, die nicht vom infizierten Nutzer angestoßen und demnach auch nicht vom infizierten Nutzer modifiziert werden können. Auch lokale Backups unter der Hoheit eines anderen Systemnutzers stellen eine Möglichkeit dar. Noch sinnvoller als ein einfaches Backup ist eine Versionierung, die zwar mehr Speicherplatz benötigt, dafür aber auch eine selektive Wiederherstellung von Dateiinhalten unterschiedlichster Zeitpunkte ermöglicht.
Die Implementierung eines entsprechenden Schutzes ist auch mit einfachen Tools möglich, wobei speziell entwickelte Werkzeuge wesentlich mehr Komfort bieten können. Im Folgenden soll eine Erkennung und Behandlung eines Krypto-Trojaner-Angriffs mit Hilfe von Mercurial dargestellt werden. Anbei folgt ein beispielhaftes Skript zur Erkennung von Abweichungen in der Bearbeitung von Dateien. Das Script ermittelt Abweichungen von der durchschnittlichen Menge an erstellten/gelöschten/bearbeiteten Dateien. Zudem prüft es separat die Veränderung eines Canaries. Das Script ist nur als Proof-of-Concept eines dateiorientierten, Host-basierten, sowie Anomalie-basierten Intrusion Detection Systems zu verstehen.
#!/usr/bin/php
<?php
// user-defined values
define("CHECKFOLDER", "/testpit/");
define("CHECKCANARY", CHECKFOLDER . "data/do-not-edit.txt");
define("STATUSFILE", CHECKFOLDER . "status/status");
// deviation of user behaviour from previously collected behaviour
define("DEVIATIONVALUE", 0.5); // default deviation of 50% is allowed
// generated values
define("CHECKDATE", date("Ymd-His"));
// concatenated actions
define("ADDREMOVECMD", "hg addremove -R \"" . CHECKFOLDER . "\" -X \"" . CHECKCANARY . "\"");
define("COMMITCMD", "hg commit -R \"" . CHECKFOLDER . "\" -X \"" . CHECKCANARY . "\" -m \"" . CHECKDATE . "\"");
define("STATUSCMD", "hg status -R \"" . CHECKFOLDER . "\"");
// static definitions
define("ADDEDHINT", "A");
define("MISSINGHINT", "!");
define("MODIFIEDHINT", "M");
define("NOTTRACKEDHINT","?");
define("REMOVEDHINT", "R");
define("HINTDELIMITER", " ");
define("STATISTICSDELIMITER", ":");
function check_filename($line, $filename) {
$result = false;
$parts = explode(HINTDELIMITER, $line, 2);
if ((false !== $parts) && (2 === count($parts))) {
$result = (0 == strcasecmp(CHECKFOLDER . $parts[1], $filename));
}
return $result;
}
function check_hint($line, $hint) {
$result = false;
$parts = explode(HINTDELIMITER, $line, 2);
if ((false !== $parts) && (2 === count($parts))) {
$result = (0 == strcasecmp($parts[0], $hint));
}
return $result;
}
function get_statistics_text($additions, $deletions, $modifications) {
return (CHECKDATE . STATISTICSDELIMITER . ADDEDHINT . STATISTICSDELIMITER . $additions .
STATISTICSDELIMITER . MODIFIEDHINT . STATISTICSDELIMITER . $modifications .
STATISTICSDELIMITER . REMOVEDHINT . STATISTICSDELIMITER . $deletions);
}
function check_statistics($additions, $deletions, $modifications) {
$result = true;
// with any modification there's nothing to check
if (0 < ($additions + $deletions + $modifications)) {
// read statistics and execute statistics checkvg_additions_count = 0;
$avg_additions_count = 0;
$avg_additions_value = 0;
$avg_deletions_count = 0;
$avg_deletions_value = 0;
$avg_modifications_count = 0;
$avg_modifications_value = 0;
if (is_file(STATUSFILE)) {
$statistics = file(STATUSFILE, FILE_IGNORE_NEW_LINES | FILE_SKIP_EMPTY_LINES);
if ((false !== $statistics) && (0 < count($statistics))) {
// calculate average additions, deletions and modifications from statistics data
foreach ($statistics as $line) {
$parts = explode(STATISTICSDELIMITER, $line, 7);
if ((false !== $parts) && (7 === count($parts))) {
// check if value is integer and bigger than 0
if (is_numeric($parts[2]) && (0 < $parts[2])) {
$avg_additions_value += $parts[2];
$avg_additions_count++;
}
if (is_numeric($parts[6]) && (0 < $parts[6])) {
$avg_deletions_value += $parts[6];
$avg_deletions_count++;
}
if (is_numeric($parts[4]) && (0 < $parts[4])) {
$avg_modifications_value += $parts[4];
$avg_modifications_count++;
}
}
}
}
}
// there's nothing wrong when nothing happened
if (0 < $additions) {
// when actions has never been seen then that's a deviation
if (0 === $avg_additions_count) {
$result = false;
} else {
// more additions than expected
if (((1.0 + DEVIATIONVALUE) * ($avg_additions_value / $avg_additions_count)) < $additions) {
$result = false;
}
}
}
// there's nothing wrong when nothing happened
if (0 < $deletions) {
// when actions has never been seen then that's a deviation
if (0 === $avg_deletions_count) {
$result = false;
} else {
// more deletions than expected
if (((1 + DEVIATIONVALUE) * ($avg_deletions_value / $avg_deletions_count)) < $deletions) {
$result = false;
}
}
}
// there's nothing wrong when nothing happened
if (0 < $modifications) {
// when actions has never been seen then that's a deviation
if (0 === $avg_modifications_count) {
$result = false;
} else {
// more modifications than expected
if (((1 + DEVIATIONVALUE) * ($avg_modifications_value / $avg_modifications_count)) < $modifications) {
$result = false;
}
}
}
}
// add new result to statistics
file_put_contents(STATUSFILE,
get_statistics_text($additions, $deletions, $modifications) . "\n",
FILE_APPEND | LOCK_EX);
return $result;
}
function main() {
$additions = 0;
$deletions = 0;
$modifications = 0;
$canary_found = false;
// retrieve information about file changes
exec(STATUSCMD, $output);
// accept file changes right away
exec(ADDREMOVECMD);
exec(COMMITCMD);
// iterate through file changes
foreach ($output as $line) {
// check if the canary file is part of the modifications
if (check_filename($line, CHECKCANARY)) {
$canary_found = true;
} else {
// check if a file has been added
if (check_hint($line, ADDEDHINT) || check_hint($line, NOTTRACKEDHINT)) {
$additions++;
} else {
// check if a file has been deleted
if (check_hint($line, MISSINGHINT) || check_hint($line, REMOVEDHINT)) {
$deletions++;
} else {
// check if a file has been modified
if (check_hint($line, MODIFIEDHINT)) {
$modifications++;
}
}
}
}
}
if (0 < ($additions + $deletions + $modifications)) {
// accept file changes
exec(ADDREMOVECMD);
exec(COMMITCMD);
}
// print result
print(get_statistics_text($additions, $deletions, $modifications) . "\n");
// the canary has been modified
if ($canary_found) {
//!!! do something
print("ALERT! CANARY HAS BEEN MODIFIED!\n");
}
// check if the modifications do not match the statistics
if (!check_statistics($additions, $deletions, $modifications)) {
//!!! do something
print("ALERT! BEHAVIOUR DOES NOT MATCH STATISTICS!\n");
}
}
// execute application
main();
?>
Bei jedem Aufruf ermittelt das Script mit Hilfe von Mercurial, welche Dateien in einem Repository/Ordner hinzugefügt, entfernt oder bearbeitet wurden. Sollte sich darunter die Canary-Datei befinden, wird Alarm geschlagen. Zudem wird eine statistische Analyse durchgeführt. In diesem einfachen Beispiel gilt als Abweichung, wenn mehr als 150% der durchschnittlichen Dateioperationen erkannt wurden. Wird solch eine Abweichung erkannt, wird ebenfalls Alarm geschlagen. Durch die Verwendung von Mercurial ließen sich zudem zu jeder Zeit alle bearbeiteten Dateien rekonstruieren.
In einem realen Umfeld könnte solch eine Analyse natürlich noch viel tiefergreifend sein. So könnten beispielsweise folgende Prüfungen mit einfließen, um Anomalien besser erkennen zu können:
• Es könnte die Uhrzeit der Dateibearbeitung mit in die Analyse einfließen. In Kombination mit der Auswertung von Arbeitsplänen und/oder Anwesenheitszeiten ließen sich bessere Modelle erstellen. So sollte es seltener der Fall sein, dass Dateien eines Mitarbeiters bearbeitet werden, der gar nicht anwesend ist.
• Es könnte die Relation der Dateibearbeitungen untereinander betrachtet werden. Beispielswiese werden Büromitarbeiter wesentlich mehr Dateien erstellen und bearbeiten als löschen, da Arbeitsergebnisse selten wieder vernichtet werden.
• Es könnte das ursprüngliche Dateidatum mit berücksichtigt werden. Beispielsweise ist es eher unüblich, dass Dateien ab einem bestimmten Alter noch einmal bearbeitet werden. Stattdessen werden sie eher als Referenz vorgehalten, anstatt als aktives Arbeitsdokument zu fungieren.
Je besser das erstellte Modell ist, mit dem das Verhalten der Systemnutzer abgeglichen wird, desto schneller erkennt man in Ausnahmesituationen einen potentiellen Angreifer. Nicht immer müssen das externe Angreifer sein. Auch interne Mitarbeiter, die ein ungewöhnliches Verhalten an den Tag legen, können auf diese Weise unter Umständen identifiziert werden. Es muss nicht einmal zwingend eine böse Absicht hinter diesem Verhalten stecken, evtl. stellt ein Mitarbeiter einfach eine Ausnahme zur üblichen Regel dar.
Generell sollte man sich bei solch einer Angriffserkennung auf Basis von Abweichungsermittlungen daran gewöhnen, auch False Positives zu erhalten. Diese sind durchaus wünschenswert, da sie einerseits zeigen, dass die durchgeführten Analysen tatsächlich einen Effekt haben und einem andererseits Verbesserungspotentiale in den erstellten Anomaliemodellen aufzeigen.
Search
Categories
administration (44)
arduino (12)
calcpw (2)
code (37)
hardware (16)
java (2)
legacy (113)
linux (30)
publicity (7)
review (2)
security (63)
thoughts (22)
update (9)
windows (17)
wordpress (19)
|
{
"url": "https://yahe.sh/aktive-verteidigung-gegen-krypto-trojaner/",
"source_domain": "yahe.sh",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "24563",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:42FUH5K7OSZ7JQP2FKYWPHOYUBTEQDFY",
"WARC-Concurrent-To": "<urn:uuid:ddcaa699-49ef-4e0a-9e1f-6873fb2b2e79>",
"WARC-Date": "2021-10-28T14:00:35Z",
"WARC-IP-Address": "213.109.162.97",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5ROESZAEXN4Y2VXV5XSZXYYSG6PVA7BC",
"WARC-Record-ID": "<urn:uuid:8bf45536-2502-405f-ab50-4e33ead9068d>",
"WARC-Target-URI": "https://yahe.sh/aktive-verteidigung-gegen-krypto-trojaner/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ff4bfc88-80dc-4fba-9bcc-01a89859461b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-132\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,
42,
43,
89,
90,
698,
699,
1016,
1017,
1548,
1549,
2044,
2045,
3556,
3557,
4623,
4624,
5329,
5330,
5345,
5351,
5376,
5414,
5477,
5533,
5534,
5603,
5675,
5676,
5698,
5738,
5739,
5765,
5861,
5979,
6045,
6046,
6070,
6102,
6134,
6166,
6198,
6230,
6231,
6269,
6307,
6308,
6354,
6375,
6376,
6423,
6478,
6549,
6555,
6556,
6576,
6580,
6581,
6619,
6640,
6641,
6688,
6743,
6796,
6802,
6803,
6823,
6827,
6828,
6901,
6994,
7094,
7189,
7193,
7194,
7264,
7284,
7285,
7339,
7397,
7478,
7514,
7550,
7586,
7622,
7658,
7694,
7695,
7728,
7815,
7882,
7973,
8016,
8077,
8140,
8201,
8263,
8314,
8354,
8370,
8432,
8483,
8523,
8539,
8601,
8656,
8700,
8716,
8730,
8742,
8752,
8760,
8761,
8814,
8842,
8910,
8952,
8979,
8996,
9038,
9141,
9170,
9182,
9192,
9200,
9201,
9254,
9282,
9350,
9392,
9419,
9436,
9478,
9579,
9608,
9620,
9630,
9638,
9639,
9692,
9724,
9792,
9838,
9865,
9882,
9928,
10041,
10070,
10082,
10092,
10100,
10106,
10107,
10143,
10177,
10267,
10313,
10314,
10334,
10338,
10339,
10359,
10383,
10407,
10431,
10432,
10459,
10460,
10507,
10537,
10538,
10576,
10600,
10621,
10622,
10658,
10691,
10754,
10802,
10832,
10847,
10889,
10970,
10994,
11011,
11057,
11139,
11165,
11184,
11233,
11284,
11316,
11330,
11342,
11352,
11360,
11366,
11367,
11425,
11454,
11480,
11503,
11509,
11510,
11530,
11609,
11610,
11646,
11671,
11696,
11747,
11753,
11754,
11816,
11885,
11910,
11972,
11978,
11982,
11983,
12008,
12018,
12019,
12022,
12023,
12599,
12600,
12791,
12792,
13105,
13342,
13623,
13624,
14139,
14140,
14505,
14506,
14507,
14514,
14515,
14526,
14527,
14547,
14560,
14571,
14581,
14595,
14604,
14617,
14628,
14642,
14653,
14667,
14681,
14692,
14705
],
"line_end_idx": [
42,
43,
89,
90,
698,
699,
1016,
1017,
1548,
1549,
2044,
2045,
3556,
3557,
4623,
4624,
5329,
5330,
5345,
5351,
5376,
5414,
5477,
5533,
5534,
5603,
5675,
5676,
5698,
5738,
5739,
5765,
5861,
5979,
6045,
6046,
6070,
6102,
6134,
6166,
6198,
6230,
6231,
6269,
6307,
6308,
6354,
6375,
6376,
6423,
6478,
6549,
6555,
6556,
6576,
6580,
6581,
6619,
6640,
6641,
6688,
6743,
6796,
6802,
6803,
6823,
6827,
6828,
6901,
6994,
7094,
7189,
7193,
7194,
7264,
7284,
7285,
7339,
7397,
7478,
7514,
7550,
7586,
7622,
7658,
7694,
7695,
7728,
7815,
7882,
7973,
8016,
8077,
8140,
8201,
8263,
8314,
8354,
8370,
8432,
8483,
8523,
8539,
8601,
8656,
8700,
8716,
8730,
8742,
8752,
8760,
8761,
8814,
8842,
8910,
8952,
8979,
8996,
9038,
9141,
9170,
9182,
9192,
9200,
9201,
9254,
9282,
9350,
9392,
9419,
9436,
9478,
9579,
9608,
9620,
9630,
9638,
9639,
9692,
9724,
9792,
9838,
9865,
9882,
9928,
10041,
10070,
10082,
10092,
10100,
10106,
10107,
10143,
10177,
10267,
10313,
10314,
10334,
10338,
10339,
10359,
10383,
10407,
10431,
10432,
10459,
10460,
10507,
10537,
10538,
10576,
10600,
10621,
10622,
10658,
10691,
10754,
10802,
10832,
10847,
10889,
10970,
10994,
11011,
11057,
11139,
11165,
11184,
11233,
11284,
11316,
11330,
11342,
11352,
11360,
11366,
11367,
11425,
11454,
11480,
11503,
11509,
11510,
11530,
11609,
11610,
11646,
11671,
11696,
11747,
11753,
11754,
11816,
11885,
11910,
11972,
11978,
11982,
11983,
12008,
12018,
12019,
12022,
12023,
12599,
12600,
12791,
12792,
13105,
13342,
13623,
13624,
14139,
14140,
14505,
14506,
14507,
14514,
14515,
14526,
14527,
14547,
14560,
14571,
14581,
14595,
14604,
14617,
14628,
14642,
14653,
14667,
14681,
14692,
14705,
14719
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14719,
"ccnet_original_nlines": 255,
"rps_doc_curly_bracket": 0.005163390189409256,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06729201227426529,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0326264314353466,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3556280732154846,
"rps_doc_frac_unique_words": 0.45354124903678894,
"rps_doc_mean_word_length": 6.869395732879639,
"rps_doc_num_sentences": 112,
"rps_doc_symbol_to_word_ratio": 0.00040782999712973833,
"rps_doc_unigram_entropy": 6.046407699584961,
"rps_doc_word_count": 1539,
"rps_doc_frac_chars_dupe_10grams": 0.03698448836803436,
"rps_doc_frac_chars_dupe_5grams": 0.05921301990747452,
"rps_doc_frac_chars_dupe_6grams": 0.0472947396337986,
"rps_doc_frac_chars_dupe_7grams": 0.0472947396337986,
"rps_doc_frac_chars_dupe_8grams": 0.04076806828379631,
"rps_doc_frac_chars_dupe_9grams": 0.03698448836803436,
"rps_doc_frac_chars_top_2gram": 0.008323869667947292,
"rps_doc_frac_chars_top_3gram": 0.003688989905640483,
"rps_doc_frac_chars_top_4gram": 0.00624290993437171,
"rps_doc_books_importance": -1092.6776123046875,
"rps_doc_books_importance_length_correction": -1092.6776123046875,
"rps_doc_openwebtext_importance": -582.8582763671875,
"rps_doc_openwebtext_importance_length_correction": -582.8582763671875,
"rps_doc_wikipedia_importance": -376.943359375,
"rps_doc_wikipedia_importance_length_correction": -376.943359375
},
"fasttext": {
"dclm": 0.9821903705596924,
"english": 0.013025219552218914,
"fineweb_edu_approx": 2.1953558921813965,
"eai_general_math": 0.10277628898620605,
"eai_open_web_math": 0.3049048185348511,
"eai_web_code": 0.5866408348083496
}
}
|
{
"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": "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": "-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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,439,257,436,503,636,500 |
http://www.perlmonks.org?node_id=114561
asinghvi has asked for the wisdom of the Perl Monks concerning the following question:
My program looks like this.
....
$var1 ... $var2... $var3 ... sub get_vars { local (*variables) = *main::; #-- Some checking on certain variables }
When I call get_vars before defining $var1, $var2, $var3, then %variables does not contain them.
When I call get_vars after defining $var1, $var2, $var3 then %variables has them. Isn't *variables reading *main:: at compile time. What am I missing?
Thanks
Replies are listed 'Best First'.
Re: using symbol table lookup
by dragonchild (Archbishop) on Sep 25, 2001 at 20:04 UTC
What on earth do you want to fiddle with the symbol table for?? It's dangerous, messy, and there's better ways to do it.
As for your questions, *variables is bound to *main:: when you bind it. Hence, if the variable hasn't been created yet, it's not in *main::. Compilation doesn't populate anything. All it does is convert the script to opcodes. When those opcodes execute, that's when the SV's are created, and a reference entered into *main::.
------
We are the carpenters and bricklayers of the Information Age.
Don't go borrowing trouble. For programmers, this means Worry only about what you need to implement.
My purpose is that my perl scripts read many text files
So rather than checking each one in each script, I thought
I would always make my filename variables always as
"something_file". And have a standard subroutine that checks
all %main:: scalar variables =~ /\_file/ and do the checks
on each entry (Like file exists, file is readable etc.)
.
Use Exporter, or write a subroutine in each program that returns the filename, or a hash reference of values.
Leave symbol-table mucking about for when there's really no other way to do that (basically run-time code generation).
Rather odd way to do it I would have thought. Is there something inherently wrong with this approach:
my $dir = 'c:/'; opendir DIR, $dir or die "Oops cna't open $dir $!\n"; my @files = grep { /\.pl$/ } readdir DIR; close DIR; $_ = $dir.$_ for @files; # add full path print "Here are all the files:\n"; print "$_\n" for @files;
This finds all the files in my root dir which end in .pl but I could use the regex in the grep to match anything. I don't see any reason to mess with the symbol table. Just wrap this sort of code in a sub that you can call from wherever....
cheers
tachyon
s&&rsenoyhcatreve&&&s&n.+t&"$'$`$\"$\&"&ee&&y&srve&&d&&print
|
{
"url": "https://www.perlmonks.org/?node_id=114561;displaytype=print;replies=1",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "7431",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PYP6POVFQH6M7A3NGMD73ZIIJCOE4ZKQ",
"WARC-Concurrent-To": "<urn:uuid:612da57b-39cb-4eff-bcf4-671c3f7d3368>",
"WARC-Date": "2021-12-05T22:10:20Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PXLH3QP6M4TW6MOQ3BRBY7W3ZG5GKFIQ",
"WARC-Record-ID": "<urn:uuid:d52dbd98-0fd2-4701-9af8-d4e8df4c1f1c>",
"WARC-Target-URI": "https://www.perlmonks.org/?node_id=114561;displaytype=print;replies=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:167dbff0-46fb-48be-90e7-e3e78b42958c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-133\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,
40,
41,
128,
129,
157,
158,
163,
278,
279,
376,
527,
528,
535,
536,
569,
599,
656,
781,
782,
1112,
1113,
1124,
1190,
1191,
1296,
1297,
1359,
1424,
1482,
1549,
1615,
1677,
1685,
1803,
1804,
1931,
1932,
2042,
2043,
2276,
2277,
2526,
2527,
2542,
2543,
2559,
2560
],
"line_end_idx": [
40,
41,
128,
129,
157,
158,
163,
278,
279,
376,
527,
528,
535,
536,
569,
599,
656,
781,
782,
1112,
1113,
1124,
1190,
1191,
1296,
1297,
1359,
1424,
1482,
1549,
1615,
1677,
1685,
1803,
1804,
1931,
1932,
2042,
2043,
2276,
2277,
2526,
2527,
2542,
2543,
2559,
2560,
2628
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2628,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0.0015220700297504663,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34358975291252136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02222222089767456,
"rps_doc_frac_lines_end_with_ellipsis": 0.0416666716337204,
"rps_doc_frac_no_alph_words": 0.27350425720214844,
"rps_doc_frac_unique_words": 0.550000011920929,
"rps_doc_mean_word_length": 4.590000152587891,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.01196581032127142,
"rps_doc_unigram_entropy": 5.093709945678711,
"rps_doc_word_count": 400,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.035947710275650024,
"rps_doc_frac_chars_dupe_6grams": 0.035947710275650024,
"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.013071900233626366,
"rps_doc_frac_chars_top_3gram": 0.019607840105891228,
"rps_doc_frac_chars_top_4gram": 0.017429189756512642,
"rps_doc_books_importance": -249.2140350341797,
"rps_doc_books_importance_length_correction": -249.2140350341797,
"rps_doc_openwebtext_importance": -129.1335906982422,
"rps_doc_openwebtext_importance_length_correction": -129.1335906982422,
"rps_doc_wikipedia_importance": -106.49139404296875,
"rps_doc_wikipedia_importance_length_correction": -106.49139404296875
},
"fasttext": {
"dclm": 0.3606838583946228,
"english": 0.8780983090400696,
"fineweb_edu_approx": 1.8508834838867188,
"eai_general_math": 0.9393806457519531,
"eai_open_web_math": 0.2399977445602417,
"eai_web_code": 0.7093096971511841
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,384,878,647,542,305,000 |
Examples for 8th grade - page 59
1. Tiles
wall-tiles-img-5 How many square tiles with the content 121 cm2 has to be ordered for the paving of the square room with a side length of 2.75 meters?
2. Chord 2
circle_ Point A has distance 13 cm from the center of the circle with radius r = 5 cm. Calculate the length of the chord connecting the points T1 and T2 of contact of tangents led from point A to the circle.
3. Four classses
think Students of all 7, 8 and 9 classes in one school may take up 4,5,6 and 7 abreast and nobody will left. How many is the average count of pupils in one class if there are always four classes each grade?
4. Solutions
bilde How much 60% solution and how much 35% solution is needed to create 100 l of 40% solution?
5. Tram
tramvaj-skoda In the three-part tram went 109 passengers in front of others, 92 after others and in the middle half of all. How many passengers went in tram total?
6. Minute
compass Two boys started from one place. First went north at velocity 3 m/s and the second to the east with velocity 4 m/s. How far apart they are after minute?
7. Journey to grandma
moto_1 Daniel traveled to grandma. He travel 100 km along. Halfway travel by train, one quarter by bus, one tenth by the bicycle and the rest travel by car. How many km travel km by car?
8. Square garden
garden_4 On the plan with a scale of 1:1500 is drawn as a square garden with area 4 cm2. How many meters is long garden fence? Determine the actual acreage gardens.
9. Wheel
bicycle_1 Diameter of motocycle wheel is 63 cm. How many times rotates wheel on roand long 1 km?
10. Ring
prsten The ring made from gold and copper alloy has a weight of 14.5 g and a volume of 1.03 cm3. How much gold and how much copper it contains? The metal densities are Au 19.3 g/cm³ and Cu 8.94 kg·dm-3
11. Plan scale
geodet At what scale is drawn plan of the building, where one side of the building is 45 meters long is on the plan expressed by a straight line 12 mm long.
12. Sisters
sestry20091 Sisters Janka and Danka are saved together 220 CZK. On a trip to Janka wants to take a fifth of her savings and Danka quarter. Then they will have 50 CZK on the trip. How much money saved Janka and Danka?
13. Cutting circles
circles2_2 From the square 1 m side we have to cut the circles with a radius of 10 cm. How many discs we cut and how many percent will be waste?
14. Earth's surface
earth_globe The greater part of the earth's surface (r = 6371 km) is covered by oceans; their area is approximately 71% of the Earth's surface. What is the approximate area of the land?
15. Three numbers
numbers_9 Find three numbers so that the second number is 4 times greater than the first and the third is lower by 5 than the second number. Their sum is 67.
16. Mrs XY
crime Mrs Novak is employed. In January 2015 the gross income reached € 1193. Insurance is a 286.32 euros, and income taz 136 euros. Employer precipitated Mrs. Novak in recent clashes € 142, of which 64 euro for the savings account, and 78 euros for repayment of
17. Borrowed book
TB Jane must as soon as possible return a borrowed book. She figured that when she read 15 pages a day return book in time. Then she read 18 pages a day and then return the book one day before. How many pages should have a book?
18. New refrigerator
lednice New refrigerator sells for 878 USD, Monday will be 25% discount. How much USD will save, and what will be the price?
19. Square vs rectangle
ctverec Square and rectangle have the same area contents. The length of the rectangle is 9 greater and width 6 less than side of the square. Calculate the side of a square.
20. Sinus
sine_cosine Determine the smallest integer p for which the equation 5 sin x = p has no solution.
Do you have interesting mathematical example that you can't solve it? Enter it and we can try to solve it.
To this e-mail address we will reply solution; solved examples are also published here. Please enter e-mail correctly and check whether you don't have a full mailbox.
|
{
"url": "https://www.hackmath.net/en/examples/8th-grade-(13y)?page_num=59",
"source_domain": "www.hackmath.net",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "29497",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J33ZV4GM4IHKSAWT66KZPYP3MTH5CF6Z",
"WARC-Concurrent-To": "<urn:uuid:82707681-7c4c-42da-a012-433e454d4c2f>",
"WARC-Date": "2017-08-21T04:24:24Z",
"WARC-IP-Address": "37.9.175.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EWVH2C7KIKUMMTXJI2WMGI4NUAO34VFI",
"WARC-Record-ID": "<urn:uuid:c5b52cd7-3121-494f-ab3b-0ff18652f00c>",
"WARC-Target-URI": "https://www.hackmath.net/en/examples/8th-grade-(13y)?page_num=59",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77125763-61fb-4a4a-a701-2d7d60b9678f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-28-10.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
33,
34,
45,
200,
213,
425,
444,
655,
670,
771,
781,
949,
961,
1126,
1150,
1341,
1360,
1529,
1540,
1641,
1652,
1858,
1875,
2036,
2050,
2271,
2293,
2442,
2464,
2654,
2674,
2836,
2849,
3116,
3136,
3369,
3392,
3521,
3547,
3724,
3736,
3837,
3838,
3945,
3946,
3947,
3948
],
"line_end_idx": [
33,
34,
45,
200,
213,
425,
444,
655,
670,
771,
781,
949,
961,
1126,
1150,
1341,
1360,
1529,
1540,
1641,
1652,
1858,
1875,
2036,
2050,
2271,
2293,
2442,
2464,
2654,
2674,
2836,
2849,
3116,
3136,
3369,
3392,
3521,
3547,
3724,
3736,
3837,
3838,
3945,
3946,
3947,
3948,
4114
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4114,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3643410801887512,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01107420027256012,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22812846302986145,
"rps_doc_frac_unique_words": 0.4663144052028656,
"rps_doc_mean_word_length": 4.09775447845459,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.343655586242676,
"rps_doc_word_count": 757,
"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.01611863076686859,
"rps_doc_frac_chars_top_3gram": 0.007092200219631195,
"rps_doc_frac_chars_top_4gram": 0.009026429615914822,
"rps_doc_books_importance": -381.8460693359375,
"rps_doc_books_importance_length_correction": -381.8460693359375,
"rps_doc_openwebtext_importance": -266.9432067871094,
"rps_doc_openwebtext_importance_length_correction": -266.9432067871094,
"rps_doc_wikipedia_importance": -185.67494201660156,
"rps_doc_wikipedia_importance_length_correction": -185.67494201660156
},
"fasttext": {
"dclm": 0.7378628849983215,
"english": 0.9377758502960205,
"fineweb_edu_approx": 2.111854314804077,
"eai_general_math": 0.9189807176589966,
"eai_open_web_math": 0.2863174080848694,
"eai_web_code": 0.00837040040642023
}
}
|
{
"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": "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": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,489,996,333,241,322,000 |
Linux Blog
PIPE
Section: Linux Programmer's Manual (7)
Updated: 2005-12-08
Index Return to Main Contents
NAME
pipe - overview of pipes and FIFOs
DESCRIPTION
Pipes and FIFOs (also known as named pipes) provide a unidirectional interprocess communication channel. A pipe has a read end and a write end. Data written to the write end of a pipe can be read from the read end of the pipe.
A pipe is created using pipe(2), which creates a new pipe and returns two file descriptors, one referring to the read end of the pipe, the other referring to the write end. Pipes can be used to create a communication channel between related processes; see pipe(2) for an example.
A FIFO (short for First In First Out) has a name within the file system (created using mkfifo(3)), and is opened using open(2). Any process may open a FIFO, assuming the file permissions allow it. The read end is opened using the O_RDONLY flag; the write end is opened using the O_WRONLY flag. See fifo(7) for further details. Note: although FIFOs have a pathname in the file system, I/O on FIFOs does not involve operations on the underlying device (if there is one).
I/O on Pipes and FIFOs
The only difference between pipes and FIFOs is the manner in which they are created and opened. Once these tasks have been accomplished, I/O on pipes and FIFOs has exactly the same semantics.
If a process attempts to read from an empty pipe, then read(2) will block until data is available. If a process attempts to write to a full pipe (see below), then write(2) blocks until sufficient data has been read from the pipe to allow the write to complete. Non-blocking I/O is possible by using the fcntl(2) F_SETFL operation to enable the O_NONBLOCK open file status flag.
The communication channel provided by a pipe is a byte stream: there is no concept of message boundaries.
If all file descriptors referring to the write end of a pipe have been closed, then an attempt to read(2) from the pipe will see end-of-file (read(2) will return 0). If all file descriptors referring to the read end of a pipe have been closed, then a write(2) will cause a SIGPIPE signal to be generated for the calling process. If the calling process is ignoring this signal, then write(2) fails with the error EPIPE. An application that uses pipe(2) and fork(2) should use suitable close(2) calls to close unnecessary duplicate file descriptors; this ensures that end-of-file and SIGPIPE/EPIPE are delivered when appropriate.
It is not possible to apply lseek(2) to a pipe.
Pipe Capacity
A pipe has a limited capacity. If the pipe is full, then a write(2) will block or fail, depending on whether the O_NONBLOCK flag is set (see below). Different implementations have different limits for the pipe capacity. Applications should not rely on a particular capacity: an application should be designed so that a reading process consumes data as soon as it is available, so that a writing process does not remain blocked.
In Linux versions before 2.6.11, the capacity of a pipe was the same as the system page size (e.g., 4096 bytes on x86). Since Linux 2.6.11, the pipe capacity is 65536 bytes.
PIPE_BUF
POSIX.1-2001 says that write(2)s of less than PIPE_BUF bytes must be atomic: the output data is written to the pipe as a contiguous sequence. Writes of more than PIPE_BUF bytes may be non-atomic: the kernel may interleave the data with data written by other processes. POSIX.1-2001 requires PIPE_BUF to be at least 512 bytes. (On Linux, PIPE_BUF is 4096 bytes.) The precise semantics depend on whether the file descriptor is non-blocking (O_NONBLOCK), whether there are multiple writers to the pipe, and on n, the number of bytes to be written:
O_NONBLOCK disabled, n <= PIPE_BUF
All n bytes are written atomically; write(2) may block if there is not room for n bytes to be written immediately
O_NONBLOCK enabled, n <= PIPE_BUF
If there is room to write n bytes to the pipe, then write(2) succeeds immediately, writing all n bytes; otherwise write(2) fails, with errno set to EAGAIN.
O_NONBLOCK disabled, n > PIPE_BUF
The write is non-atomic: the data given to write(2) may be interleaved with write(2)s by other process; the write(2) blocks until n bytes have been written.
O_NONBLOCK enabled, n > PIPE_BUF
If the pipe is full, then write(2) fails, with errno set to EAGAIN. Otherwise, from 1 to n bytes may be written (i.e., a "partial write" may occur; the caller should check the return value from write(2) to see how many bytes were actually written), and these bytes may be interleaved with writes by other processes.
Open File Status Flags
The only open file status flags that can be meaningfully applied to a pipe or FIFO are O_NONBLOCK and O_ASYNC.
Setting the O_ASYNC flag for the read end of a pipe causes a signal (SIGIO by default) to be generated when new input becomes available on the pipe (see fcntl(2) for details). On Linux, O_ASYNC is supported for pipes and FIFOs only since kernel 2.6.
Portability notes
On some systems (but not Linux), pipes are bidirectional: data can be transmitted in both directions between the pipe ends. According to POSIX.1-2001, pipes only need to be unidirectional. Portable applications should avoid reliance on bidirectional pipe semantics.
SEE ALSO
dup(2), fcntl(2), open(2), pipe(2), poll(2), select(2), socketpair(2), stat(2), mkfifo(3), epoll(7), fifo(7)
Index
NAME
DESCRIPTION
I/O on Pipes and FIFOs
Pipe Capacity
PIPE_BUF
Open File Status Flags
Portability notes
SEE ALSO
Random Man Pages:
glknots
capabilities
mkdir
bpe
|
{
"url": "http://www.thelinuxblog.com/linux-man-pages/7/pipe",
"source_domain": "www.thelinuxblog.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "33002",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W7JOL4OX4BUFILLHSMCGP7UXUL5WY3PN",
"WARC-Concurrent-To": "<urn:uuid:cd1620b2-4e62-4eb3-a69c-779f5efa3e37>",
"WARC-Date": "2017-07-27T08:42:16Z",
"WARC-IP-Address": "192.185.159.183",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:B2LPXRLTER7TDV3YPDQYOZFLMUGILGLR",
"WARC-Record-ID": "<urn:uuid:a4db669c-5e55-43d6-9f62-432abca415cf>",
"WARC-Target-URI": "http://www.thelinuxblog.com/linux-man-pages/7/pipe",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b7e3d134-1a00-4d1c-b4d9-01c287c6a306>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-168-177.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
11,
12,
17,
18,
57,
77,
107,
109,
110,
115,
116,
153,
154,
166,
167,
394,
395,
675,
676,
1147,
1148,
1171,
1172,
1364,
1365,
1743,
1744,
1850,
1851,
2479,
2480,
2530,
2531,
2545,
2546,
2974,
2975,
3151,
3152,
3161,
3162,
3707,
3742,
3856,
3890,
4046,
4080,
4237,
4270,
4586,
4588,
4589,
4612,
4613,
4724,
4725,
4977,
4978,
4996,
4997,
5265,
5266,
5275,
5276,
5385,
5386,
5387,
5389,
5390,
5396,
5397,
5402,
5414,
5437,
5451,
5460,
5483,
5501,
5510,
5511,
5512,
5513,
5514,
5532,
5540,
5553,
5559,
5563
],
"line_end_idx": [
11,
12,
17,
18,
57,
77,
107,
109,
110,
115,
116,
153,
154,
166,
167,
394,
395,
675,
676,
1147,
1148,
1171,
1172,
1364,
1365,
1743,
1744,
1850,
1851,
2479,
2480,
2530,
2531,
2545,
2546,
2974,
2975,
3151,
3152,
3161,
3162,
3707,
3742,
3856,
3890,
4046,
4080,
4237,
4270,
4586,
4588,
4589,
4612,
4613,
4724,
4725,
4977,
4978,
4996,
4997,
5265,
5266,
5275,
5276,
5385,
5386,
5387,
5389,
5390,
5396,
5397,
5402,
5414,
5437,
5451,
5460,
5483,
5501,
5510,
5511,
5512,
5513,
5514,
5532,
5540,
5553,
5559,
5563,
5564
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5564,
"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.35520920157432556,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04922067001461983,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23543888330459595,
"rps_doc_frac_unique_words": 0.3268398344516754,
"rps_doc_mean_word_length": 4.659090995788574,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.046744346618652,
"rps_doc_word_count": 924,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1207897812128067,
"rps_doc_frac_chars_dupe_6grams": 0.07409988343715668,
"rps_doc_frac_chars_dupe_7grams": 0.04901278018951416,
"rps_doc_frac_chars_dupe_8grams": 0.01300812978297472,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021138209849596024,
"rps_doc_frac_chars_top_3gram": 0.021138209849596024,
"rps_doc_frac_chars_top_4gram": 0.009291520342230797,
"rps_doc_books_importance": -559.7871704101562,
"rps_doc_books_importance_length_correction": -559.7871704101562,
"rps_doc_openwebtext_importance": -307.82861328125,
"rps_doc_openwebtext_importance_length_correction": -307.82861328125,
"rps_doc_wikipedia_importance": -152.33094787597656,
"rps_doc_wikipedia_importance_length_correction": -152.33094787597656
},
"fasttext": {
"dclm": 0.04572486877441406,
"english": 0.8921870589256287,
"fineweb_edu_approx": 3.0497961044311523,
"eai_general_math": 0.7011944055557251,
"eai_open_web_math": 0.1264662742614746,
"eai_web_code": 0.5652552843093872
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"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": "-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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,326,990,589,934,761,000 |
heyandroid.com... domain worth 500?
Last Updated:
1. elryry
elryry New Member This Topic's Starter
Joined:
Feb 22, 2010
Messages:
2
Likes Received:
0
Advertisement
2. bbrosen
bbrosen Well-Known Member
Joined:
Dec 3, 2009
Messages:
314
Likes Received:
31
A domain name is worth nothing. When it is attached to a popular website that makes money, then it is worth something. Back in the late 90's and about 2000-2001 people were paying big prices for domain names, but no one pays those kinds of prices anymore for just a domain name. It is just someone trying to capitalize on the expanding poularity of the Android name...if I was a web designer now, I used to be, I would not pay hardly anything for a domain name, it's just ridiculous unless it is already a successful working website with traffic. Then I am sure it would be worth much more than 500.00
3. lunatic59
lunatic59 Moderati ergo sum Moderator
Joined:
Jun 12, 2010
Messages:
30,616
Likes Received:
23,005
I thought domain squatting was illegal?
4. elryry
elryry New Member This Topic's Starter
Joined:
Feb 22, 2010
Messages:
2
Likes Received:
0
In what way is selling that domain considered domain squatting?
5. mikedt
mikedt 你好 Guide
Joined:
Sep 22, 2010
Messages:
18,978
Likes Received:
9,448
Not really. 'hey' and 'android' are common dictionary words. IANAL but I think domain name squatting only applies to proper registered trademarks, e.g. Verizon or Microsoft. Although try telling Monster Cable that, who sent their legal thugs after anyone who dared use the common dictionary word 'monster'.
6. lunatic59
lunatic59 Moderati ergo sum Moderator
Joined:
Jun 12, 2010
Messages:
30,616
Likes Received:
23,005
I suppose technically it isn't since "android" is also a common word, however the ad specifically states "Premium Android Domain" which one could reasonably infer the Android
7. Isthmus
Isthmus Well-Known Member
Joined:
Jan 6, 2010
Messages:
772
Likes Received:
119
True in most instances but not all. For example, Sex.com just sold last month for US$13 million, with no site attached to it. This is a million dollars less than the last time it changed hands (US$14 Million in 2006), yet still the most expensive domain name ever.
Here is a picture of the top 10 most expensive domain names as of late October 2010:
[IMG]
Some of them seem like natural names people would gravitate to, but to be honest I personally don't recognize the sites most of these might be attached to.
Share This Page
Loading...
|
{
"url": "http://androidforums.com/threads/heyandroid-com-domain-worth-500.221467/",
"source_domain": "androidforums.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "73732",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:334Y23VUZTJO3FJ7CCPC6I5PBF474RLS",
"WARC-Concurrent-To": "<urn:uuid:c988f66c-c6bd-46c8-951d-5e231f765938>",
"WARC-Date": "2016-10-27T10:50:35Z",
"WARC-IP-Address": "173.192.24.230",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4GJ5KKM5SNDD2PPHQ3A32UDSTWZUIAO5",
"WARC-Record-ID": "<urn:uuid:99aee94f-836e-4bbe-be95-ba9d0e9504e9>",
"WARC-Target-URI": "http://androidforums.com/threads/heyandroid-com-domain-worth-500.221467/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e06bad2-737c-4bbb-a95e-7e31799dcf58>"
},
"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,
36,
37,
38,
52,
53,
65,
66,
109,
110,
122,
139,
153,
159,
179,
185,
186,
204,
217,
218,
248,
249,
261,
277,
291,
299,
319,
326,
932,
938,
953,
954,
996,
997,
1009,
1026,
1040,
1051,
1071,
1082,
1126,
1132,
1144,
1145,
1188,
1189,
1201,
1218,
1232,
1238,
1258,
1264,
1332,
1338,
1350,
1351,
1371,
1372,
1384,
1401,
1415,
1426,
1446,
1456,
1767,
1773,
1788,
1789,
1831,
1832,
1844,
1861,
1875,
1886,
1906,
1917,
2096,
2102,
2115,
2116,
2146,
2147,
2159,
2175,
2189,
2197,
2217,
2225,
2494,
2495,
2584,
2585,
2596,
2597,
2757,
2763,
2764,
2780,
2781
],
"line_end_idx": [
36,
37,
38,
52,
53,
65,
66,
109,
110,
122,
139,
153,
159,
179,
185,
186,
204,
217,
218,
248,
249,
261,
277,
291,
299,
319,
326,
932,
938,
953,
954,
996,
997,
1009,
1026,
1040,
1051,
1071,
1082,
1126,
1132,
1144,
1145,
1188,
1189,
1201,
1218,
1232,
1238,
1258,
1264,
1332,
1338,
1350,
1351,
1371,
1372,
1384,
1401,
1415,
1426,
1446,
1456,
1767,
1773,
1788,
1789,
1831,
1832,
1844,
1861,
1875,
1886,
1906,
1917,
2096,
2102,
2115,
2116,
2146,
2147,
2159,
2175,
2189,
2197,
2217,
2225,
2494,
2495,
2584,
2585,
2596,
2597,
2757,
2763,
2764,
2780,
2781,
2791
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2791,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30297398567199707,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024163570255041122,
"rps_doc_frac_lines_end_with_ellipsis": 0.010101010091602802,
"rps_doc_frac_no_alph_words": 0.28624534606933594,
"rps_doc_frac_unique_words": 0.5397590398788452,
"rps_doc_mean_word_length": 4.720481872558594,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.005576210096478462,
"rps_doc_unigram_entropy": 5.099298477172852,
"rps_doc_word_count": 415,
"rps_doc_frac_chars_dupe_10grams": 0.16845329105854034,
"rps_doc_frac_chars_dupe_5grams": 0.16845329105854034,
"rps_doc_frac_chars_dupe_6grams": 0.16845329105854034,
"rps_doc_frac_chars_dupe_7grams": 0.16845329105854034,
"rps_doc_frac_chars_dupe_8grams": 0.16845329105854034,
"rps_doc_frac_chars_dupe_9grams": 0.16845329105854034,
"rps_doc_frac_chars_top_2gram": 0.046452268958091736,
"rps_doc_frac_chars_top_3gram": 0.021439509466290474,
"rps_doc_frac_chars_top_4gram": 0.021439509466290474,
"rps_doc_books_importance": -197.2184600830078,
"rps_doc_books_importance_length_correction": -197.2184600830078,
"rps_doc_openwebtext_importance": -113.63341522216797,
"rps_doc_openwebtext_importance_length_correction": -113.63341522216797,
"rps_doc_wikipedia_importance": -76.61628723144531,
"rps_doc_wikipedia_importance_length_correction": -76.61628723144531
},
"fasttext": {
"dclm": 0.0824384093284607,
"english": 0.9466431140899658,
"fineweb_edu_approx": 1.669569492340088,
"eai_general_math": 0.003865299979224801,
"eai_open_web_math": 0.13424092531204224,
"eai_web_code": 0.000007269999969139462
}
}
|
{
"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": "338.9282",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,959,987,218,916,879,000 |
1
I am trying to find the last four Channel entries (Named: Post) with a Category relatedTo "Support" (id: 458) AND Tag relatedTo: "Widget1" (id: 469) I've had success using Category or Tag but not both: This Craft Query works for Category
for entry in craft.entries.section('Post').relatedTo('458').orderBy('postDate desc').limit(4).all()
How can I add the dynamic Tag to the Craft query? The dynamic Tag matches the slug of the current page "widget1" or slug of another page "widget2".
Thank you.
1
You'll probably want to read up a bit on relations in the Craft docs, but I think something like this should work
{# First get the category elements #}
{% set supportCategory = craft.categories().id(458).one() %}
{% set widgetCategory = craft.categories().id(459).one() %}
{# Now we use those elements in our query #}
{% set entries = craft.entries().section('Post').relatedTo(['and',
{ element: supportCategory },
{ element: widgetCategory }
]).all() %}
{% for entry in entries %}
{# ... your code #}
{% endfor %}
I believe the relation needs an element, but you might be able to do something like .relatedTo(['and', 458, 459]).
|improve this answer|||||
1
Thank you brianjhanson, you got me 95% there and pointed me to my final solution.
My entry.slug for each page is the exact title of the tag I want to relate to, so this is the code I settled on.
{% set supportCategory = craft.categories().id(458).one() %}
{% set productTags = craft.tags().title(entry.slug).one() %}
{# Now we use those elements in our query #}
{% set entries = craft.entries().section('Post').relatedTo(['and',
{ element: supportCategory },
{ element: productTags }
]).orderBy('postDate desc').limit(4).all() %}
|improve this answer|||||
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://craftcms.stackexchange.com/questions/32807/craft-query-by-category-and-tag/32816",
"source_domain": "craftcms.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "143175",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:77N6Q3GT2Y653CZWMISDLHNFJVPSETZS",
"WARC-Concurrent-To": "<urn:uuid:90688304-ec47-49d5-bd88-1034ac8d162a>",
"WARC-Date": "2020-04-05T13:23:34Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V4WORPQA2S7II5KTE2UGQH4GOTCZUW7W",
"WARC-Record-ID": "<urn:uuid:0a9eeae1-e668-487f-9b8e-48647e79e5be>",
"WARC-Target-URI": "https://craftcms.stackexchange.com/questions/32807/craft-query-by-category-and-tag/32816",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:88e80be8-23fa-4406-8c12-0c116ff8b778>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
241,
242,
342,
343,
491,
492,
503,
504,
506,
507,
621,
622,
660,
721,
781,
782,
827,
894,
926,
956,
968,
969,
996,
1018,
1031,
1032,
1147,
1148,
1174,
1176,
1177,
1259,
1260,
1373,
1374,
1435,
1496,
1497,
1542,
1609,
1642,
1670,
1716,
1742,
1743,
1755,
1756,
1856,
1857
],
"line_end_idx": [
2,
3,
241,
242,
342,
343,
491,
492,
503,
504,
506,
507,
621,
622,
660,
721,
781,
782,
827,
894,
926,
956,
968,
969,
996,
1018,
1031,
1032,
1147,
1148,
1174,
1176,
1177,
1259,
1260,
1373,
1374,
1435,
1496,
1497,
1542,
1609,
1642,
1670,
1716,
1742,
1743,
1755,
1756,
1856,
1857,
1947
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1947,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0.016435539349913597,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2702702581882477,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018018020316958427,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3490990996360779,
"rps_doc_frac_unique_words": 0.5369649529457092,
"rps_doc_mean_word_length": 5.396887302398682,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.020270269364118576,
"rps_doc_unigram_entropy": 4.673007488250732,
"rps_doc_word_count": 257,
"rps_doc_frac_chars_dupe_10grams": 0.1514059156179428,
"rps_doc_frac_chars_dupe_5grams": 0.1514059156179428,
"rps_doc_frac_chars_dupe_6grams": 0.1514059156179428,
"rps_doc_frac_chars_dupe_7grams": 0.1514059156179428,
"rps_doc_frac_chars_dupe_8grams": 0.1514059156179428,
"rps_doc_frac_chars_dupe_9grams": 0.1514059156179428,
"rps_doc_frac_chars_top_2gram": 0.014419609680771828,
"rps_doc_frac_chars_top_3gram": 0.014419609680771828,
"rps_doc_frac_chars_top_4gram": 0.0634462907910347,
"rps_doc_books_importance": -168.82997131347656,
"rps_doc_books_importance_length_correction": -168.82997131347656,
"rps_doc_openwebtext_importance": -97.97061157226562,
"rps_doc_openwebtext_importance_length_correction": -97.97061157226562,
"rps_doc_wikipedia_importance": -83.86927795410156,
"rps_doc_wikipedia_importance_length_correction": -83.86927795410156
},
"fasttext": {
"dclm": 0.24213260412216187,
"english": 0.725464940071106,
"fineweb_edu_approx": 1.0359795093536377,
"eai_general_math": 0.0003641800140030682,
"eai_open_web_math": 0.08588778972625732,
"eai_web_code": 0.00021523000032175332
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,066,877,412,880,072,000 |
evernote and apple notesSkye Gould/Tech Insider
Evernote didn't make too many friends following its recent decision to raise prices on its paid services and limit the free version of its app to just two devices.
If you ask me, there's no compelling reason for most iPhone and Mac users to pay for Evernote when Apple Notes offers a lot of the same features and costs nothing. (Apple Notes does use your iCloud account storage, but it'll take up a negligible amount of space.)
So, how do you make the switch if you've been an Evernote user all this time? Luckily, it's really easy to migrate your Evernote notes to Apple Notes.
First, make sure you have the Mac version of Evernote and log in. Also make sure your Mac is running El Capitan, the current version of the Mac OS that includes the updated version of Apple Notes. You can upgrade to El Capitan in the Mac App Store. You should also be running iOS 9 on your iPhone or iPad.
View As: One Page Slides
|
{
"url": "http://www.businessinsider.com/how-to-transfer-evernote-notes-to-apple-notes-2016-6",
"source_domain": "www.businessinsider.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "99532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GWP4L5AYNKJ6KSSQSNN7LLNVJGYB53UF",
"WARC-Concurrent-To": "<urn:uuid:5bbfbf49-2664-436f-88cd-7b462450f2bf>",
"WARC-Date": "2017-09-23T13:21:57Z",
"WARC-IP-Address": "151.101.32.64",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CVY7327WE7GAZVRXPRRBVKROKD7FIKWE",
"WARC-Record-ID": "<urn:uuid:9c15498d-9f6e-46d3-9f30-a760391e3cfc>",
"WARC-Target-URI": "http://www.businessinsider.com/how-to-transfer-evernote-notes-to-apple-notes-2016-6",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dbd2114a-d8ca-45ed-be93-f109de731761>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-208-113.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,
48,
49,
213,
214,
478,
479,
630,
631,
937,
938
],
"line_end_idx": [
48,
49,
213,
214,
478,
479,
630,
631,
937,
938,
962
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 962,
"ccnet_original_nlines": 10,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4146341383457184,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004878050182014704,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1170731708407402,
"rps_doc_frac_unique_words": 0.625,
"rps_doc_mean_word_length": 4.306818008422852,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.44355583190918,
"rps_doc_word_count": 176,
"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.04749339818954468,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -87.80398559570312,
"rps_doc_books_importance_length_correction": -87.80398559570312,
"rps_doc_openwebtext_importance": -57.7444953918457,
"rps_doc_openwebtext_importance_length_correction": -44.28974914550781,
"rps_doc_wikipedia_importance": -46.8504753112793,
"rps_doc_wikipedia_importance_length_correction": -46.8504753112793
},
"fasttext": {
"dclm": 0.107997827231884,
"english": 0.931509792804718,
"fineweb_edu_approx": 1.392687201499939,
"eai_general_math": 0.0206028800457716,
"eai_open_web_math": 0.03719108924269676,
"eai_web_code": 0.01060342974960804
}
}
|
{
"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": "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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,259,845,988,781,625,000 |
Home » RDBMS Server » Security » synonym how get info on how user has access to it (Oracle Database 11g Enterprise Edition Release 11.2.0.3.0)
synonym how get info on how user has access to it [message #669483] Tue, 24 April 2018 14:20 Go to next message
wtolentino
Messages: 348
Registered: March 2005
Senior Member
there is a synonym called CHIPS_MUNI and is based on a view called lps.muni_chips. this CHIPS_MUNI is used on forms application. basically all the user has access to the synonym CHIPS_MUNI.
i want to find out how does a user for example PREA has access to the synonym CHIPS_MUNI. since the all_ views are only limited and i can only use it for what i have access to, i can't see what PREA has. and since i do not have a dba data dictionary access i also cannot see what PREA has. now i asked for our database administrator help and they can't see how does PREA has access to the CHIPS_MUNI synonym. i think maybe they missed some data dictionary.
what dba data dictionary or if you have a query that uses dba dictionary and i can request it to be run by our dba. to get the info on how PREA has access to the synonym CHIPS_MUNI (grants, privileges, objects ...). that will be helpful.
thanks so much.
Re: synonym how get info on how user has access to it [message #669484 is a reply to message #669483] Tue, 24 April 2018 14:37 Go to previous messageGo to next message
BlackSwan
Messages: 26766
Registered: January 2009
Location: SoCal
Senior Member
>since the all_ views are only limited and i can only use it for what i have access to,
Which schema is "yours"?
post SQL & results that show how you obtain access to LPS.MUNI_CHIPS
select object_owner, object_type from all_objects where object_name = 'CHIPS_MUNI';
POST results from SQL above.
>i think maybe they missed some data dictionary.
Why does the problem lies with somebody else & not you.
Re: synonym how get info on how user has access to it [message #669485 is a reply to message #669483] Wed, 25 April 2018 00:32 Go to previous messageGo to next message
Michel Cadot
Messages: 67988
Registered: March 2007
Location: Nanterre, France, http://...
Senior Member
Account Moderator
There are no specific privileges on synonyms.
A user can "access" a synonym if he/she can access the base object (which may be far away in case of synonym of synonym of synonym of synonym...).
There are no views that sees that outside the account you want to know the privileges (it would be something like ALL_ALL_SYNONYMS).
Re: synonym how get info on how user has access to it [message #669513 is a reply to message #669483] Thu, 26 April 2018 13:45 Go to previous message
Michel Cadot
Messages: 67988
Registered: March 2007
Location: Nanterre, France, http://...
Senior Member
Account Moderator
Any feedback?
Previous Topic: What encryption algorithm Oracle 12
Next Topic: How to setup Password rotation
Goto Forum:
Current Time: Sat Oct 16 02:47:16 CDT 2021
|
{
"url": "https://pafumi.netwww.orafaq.com/forum/t/204609/",
"source_domain": "pafumi.netwww.orafaq.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "23956",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A2ZHW5NKH4MIWEU3IVCIJAZB4OXUFIDW",
"WARC-Concurrent-To": "<urn:uuid:00417c19-a736-48e1-9aea-9b22387c50b1>",
"WARC-Date": "2021-10-16T07:47:17Z",
"WARC-IP-Address": "85.93.89.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3QTTYUBDQVUD7B2N7RFEZQ65K6DS5CCU",
"WARC-Record-ID": "<urn:uuid:60d3ef12-5c8e-4583-8fd7-0263fd7c0e0d>",
"WARC-Target-URI": "https://pafumi.netwww.orafaq.com/forum/t/204609/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:43de0dbe-044c-4342-b92b-be883ee1c35a>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191\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,
143,
255,
266,
280,
303,
317,
507,
508,
965,
966,
1204,
1205,
1221,
1389,
1399,
1415,
1440,
1456,
1470,
1558,
1583,
1584,
1653,
1654,
1738,
1739,
1768,
1769,
1818,
1874,
2042,
2055,
2071,
2094,
2133,
2147,
2165,
2166,
2212,
2359,
2360,
2493,
2494,
2644,
2657,
2673,
2696,
2735,
2749,
2767,
2768,
2782,
2783,
2835,
2878,
2890,
2893,
2894,
2895
],
"line_end_idx": [
143,
255,
266,
280,
303,
317,
507,
508,
965,
966,
1204,
1205,
1221,
1389,
1399,
1415,
1440,
1456,
1470,
1558,
1583,
1584,
1653,
1654,
1738,
1739,
1768,
1769,
1818,
1874,
2042,
2055,
2071,
2094,
2133,
2147,
2165,
2166,
2212,
2359,
2360,
2493,
2494,
2644,
2657,
2673,
2696,
2735,
2749,
2767,
2768,
2782,
2783,
2835,
2878,
2890,
2893,
2894,
2895,
2937
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2937,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3867313861846924,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03398057818412781,
"rps_doc_frac_lines_end_with_ellipsis": 0.03333333134651184,
"rps_doc_frac_no_alph_words": 0.23139159381389618,
"rps_doc_frac_unique_words": 0.3920792043209076,
"rps_doc_mean_word_length": 4.506930828094482,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.01779934950172901,
"rps_doc_unigram_entropy": 4.842662811279297,
"rps_doc_word_count": 505,
"rps_doc_frac_chars_dupe_10grams": 0.25,
"rps_doc_frac_chars_dupe_5grams": 0.4231107234954834,
"rps_doc_frac_chars_dupe_6grams": 0.4152021110057831,
"rps_doc_frac_chars_dupe_7grams": 0.34094902873039246,
"rps_doc_frac_chars_dupe_8grams": 0.28427064418792725,
"rps_doc_frac_chars_dupe_9grams": 0.25,
"rps_doc_frac_chars_top_2gram": 0.04217926040291786,
"rps_doc_frac_chars_top_3gram": 0.04349736124277115,
"rps_doc_frac_chars_top_4gram": 0.03954305872321129,
"rps_doc_books_importance": -283.5884704589844,
"rps_doc_books_importance_length_correction": -283.5884704589844,
"rps_doc_openwebtext_importance": -134.55455017089844,
"rps_doc_openwebtext_importance_length_correction": -134.55455017089844,
"rps_doc_wikipedia_importance": -120.27642822265625,
"rps_doc_wikipedia_importance_length_correction": -120.27642822265625
},
"fasttext": {
"dclm": 0.050372540950775146,
"english": 0.9379421472549438,
"fineweb_edu_approx": 1.1525354385375977,
"eai_general_math": 0.023840490728616714,
"eai_open_web_math": 0.12776857614517212,
"eai_web_code": 0.003166560083627701
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,013,136,054,731,757,000 |
Published on
Written by Jacky Chou
How To Calculate Correlation Coefficient In Excel
Key Takeaway:
• Understanding the correlation coefficient is important in analyzing the relationship between two variables. It measures the strength and direction of the relationship.
• Excel has a built-in function that can easily calculate the correlation coefficient between two variables. However, it is also possible to manually calculate it using a formula.
• When interpreting correlation coefficient results, it is important to understand the difference between positive and negative correlation, the strength of the correlation, and the distinction between correlation and causation.
Are you looking for a quick and accurate way to calculate correlations? Excel is an ideal tool to easily calculate correlation coefficients, allowing you to analyze your data and draw meaningful insights. Unlock the power of Excel to swiftly calculate correlations and make informed decisions.
Understanding Correlation Coefficient
Calculating the correlation coefficient is a fundamental tool for statisticians and data analysts working with large data sets in Excel. This statistical measure enables professionals to understand the relationship between two variables and make informed decisions based on the result. The correlation coefficient measures the degree of association between two variables and ranges between -1 to 1. A value of -1 indicates a strong negative correlation, 0 indicates no correlation, and 1 indicates a strong positive correlation. By understanding correlation coefficient, professionals can identify trends and patterns in data to solve complex business problems and improve decision-making.
To calculate correlation coefficient in Excel, first, calculate the covariance between two variables and then divide it by the product of the standard deviation of the two variables. The formula for calculating the correlation coefficient is =COVARIANCE.S(array1, array2)/(STDEV.S(array1)*STDEV.S(array2)). Using this formula, we can determine the degree of association between two variables, such as temperature and ice cream sales. By analyzing the data, we can determine if there is any correlation between the two variables and use this information to create effective strategies.
It is important to note that correlation does not necessarily imply causation. For example, we may observe a positive correlation between ice cream sales and temperature, but it does not mean that one causes the other. Therefore, it is essential to analyze the data and consider other factors that may influence the results. By understanding the limitations of correlation analysis, we can use it to draw meaningful conclusions and make informed decisions.
In my previous role as a data analyst, I used correlation coefficient analysis to evaluate the performance of a retail store. By analyzing the relationship between sales and marketing initiatives, we were able to identify the most effective strategies and make data-driven decisions. This analysis enabled us to understand the correlation between different factors and make informed business decisions.
Understanding Correlation Coefficient-How to Calculate Correlation Coefficient in Excel,
Image credits: chouprojects.com by Adam Jones
How to Calculate Correlation Coefficient
In today’s data-driven world, calculating correlation coefficient is a crucial task for researchers and analysts. It is an essential tool to measure the relationship between two variables. Here’s a quick and practical guide to help you calculate correlation coefficient in Excel, making your data analysis process faster and more accurate.
1. Select the two sets of data that you want to analyze. Go to the “Data” menu and click on “Data Analysis” under the “Data Tools” section. If you don’t see this option, you’ll need to install the “Analysis ToolPak” add-in.
2. In the “Data Analysis” dialog, select “Correlation” and click on “OK.”
3. In the “Correlation” dialog, select the range of your two sets of data. Then, choose where you want the output to be placed – either in a new worksheet or in a specific location – and click “OK.”
In addition, keep in mind that correlation does not imply causation. Although two variables may have a strong correlation coefficient, it does not necessarily mean that one causes the other. Hence, it is essential to conduct further analysis to confirm causation and establish a relationship between your variables.
To know more about Excel formulas and data analysis techniques, make sure to check out our other articles on “How to Calculate Hours Worked in Excel” and keep up-to-date with the latest technology trends. Don’t miss out on the advantages of staying ahead in the race.
How to Calculate Correlation Coefficient-How to Calculate Correlation Coefficient in Excel,
Image credits: chouprojects.com by David Washington
Tips for Interpreting Correlation Coefficient Results
When interpreting correlation coefficient results, there are some useful tips to keep in mind. These will help you understand the relationship between the two variables being studied and draw meaningful conclusions from your data.
• Consider the strength of the correlation: A correlation coefficient of 1 indicates a perfect positive relationship, while -1 indicates a perfect negative relationship. A value of 0 means there is no relationship. The closer the value is to -1 or 1, the stronger the relationship between the variables.
• Take into account the significance of the correlation: The significance level (usually denoted by p) tells you how likely it is that the correlation occurred by chance. A significance level of 0.05 means there is a 5% chance the correlation occurred randomly. If the significance level is high, it may not be a reliable result.
• Beware of mistaking correlation for causation: Just because two variables are correlated doesn’t necessarily mean that one causes the other. There may be other variables that are responsible for the relationship observed.
It is also important to keep in mind any limitations or potential sources of bias in your data when interpreting correlation coefficients. These may include sampling bias, confounding variables, or missing data.
To fully understand the relationship between your variables, it is important to not only focus on the correlation coefficient itself, but also to examine the nature of the relationship graphically and in the context of your research question.
Don’t miss out on the insights that can be gained from examining correlation coefficient results. By following these tips, you can confidently analyze your data and draw meaningful conclusions from your research.
Tips for Interpreting Correlation Coefficient Results-How to Calculate Correlation Coefficient in Excel,
Image credits: chouprojects.com by Yuval Arnold
Five Facts About How to Calculate Correlation Coefficient in Excel:
• ✅ Correlation coefficient measures the strength and direction of the linear relationship between two variables. (Source: Excel Easy)
• ✅ Correlation coefficient ranges from -1 to 1. (Source: DataCamp)
• ✅ A positive correlation coefficient indicates a direct relationship between variables, while a negative correlation coefficient indicates an inverse relationship. (Source: Investopedia)
• ✅ Excel provides several functions for calculating correlation coefficient, including CORREL and PEARSON. (Source: Spreadsheeto)
• ✅ Correlation coefficient can be used to identify trends, make predictions, and inform decision-making in various industries including finance, marketing, and healthcare. (Source: The Balance Small Business)
FAQs about How To Calculate Correlation Coefficient In Excel
How to Calculate Correlation Coefficient in Excel?
To calculate correlation coefficient in Excel, follow the below-mentioned steps:
1. Select the data range for which you want to calculate the correlation coefficient.
2. Click on the “Insert” tab and then click on “Scatterplot”.
3. Select the scatterplot with the smooth line and markers option.
4. Right-click on the scatterplot and select “Add Trendline”.
5. Choose the “Linear” trendline and mark the checkbox for “Display equation on chart” and “Display R-squared value on chart”.
6. The correlation coefficient value will appear on the chart. Alternatively, you can find it in the trendline equation.
What is the formula to calculate correlation coefficient in Excel?
The formula to calculate correlation coefficient in Excel is:
=CORREL(array1,array2)
Where array1 is the range of the first set of data values and array2 is the range of the second set of data values.
What does the correlation coefficient value mean?
The correlation coefficient value represents the strength and direction of the relationship between two variables. A value of +1 indicates a perfect positive correlation, a value of -1 indicates a perfect negative correlation, and a value of 0 indicates no correlation.
How to interpret the correlation coefficient value?
A correlation coefficient value closer to +1 or -1 indicates a strong correlation between two variables. A value closer to 0 indicates a weak correlation between two variables.
What is the difference between Pearson and Spearman correlation coefficient?
Pearson correlation coefficient is used to measure the linear correlation between two variables, whereas Spearman correlation coefficient is used to measure the monotonic relationship between two variables. While Pearson’s correlation can detect only linear relationships, Spearman’s correlation can detect nonlinear relationships as well.
How to calculate correlation coefficient for more than two variables in Excel?
You can calculate the correlation coefficient for more than two variables in Excel by using the “Analysis ToolPak” add-in. The steps to do so are:
1. Click on the “File” menu and then select “Options”.
2. Click on “Add-Ins” and then select “Excel Add-Ins” from the Manage dropdown menu and click on “Go”.
3. Select “Analysis ToolPak” and click on “OK”.
4. Click on “Data Analysis” from the “Data” ribbon.
5. Select “Correlation” and click on “OK”.
6. Select the data range for which you want to calculate the correlation coefficient and click on “OK”.
7. The correlation matrix will be displayed in a new worksheet.
Related Articles
How To Set Print Area In Excel: Step-By-Step Guide
Key Takeaway: Understanding Print Area in Excel: Print Area is ...
How To Separate Text In Excel: A Step-By-Step Guide
Key Takeaway: Separating text in Excel can help organize and ...
How To Shift Cells Down In Excel: A Step-By-Step Guide
Key Takeaway: Method 1: Cut and Insert Cells: This method ...
Leave a Comment
|
{
"url": "https://chouprojects.com/how-to-calculate-correlation-coefficient-in-excel-8/",
"source_domain": "chouprojects.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "99495",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P4KZMXS74LDPH37LZMEAGCAGMSL6Q2WR",
"WARC-Concurrent-To": "<urn:uuid:38f9245c-94aa-4f15-924a-d0cd3f4736e8>",
"WARC-Date": "2024-05-20T21:41:03Z",
"WARC-IP-Address": "34.230.232.255",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HKCUVVT6EMSFVARPE3CD6JZGBMZMOFD4",
"WARC-Record-ID": "<urn:uuid:70061079-15f5-4722-a5c9-fe9fa2b6dd16>",
"WARC-Target-URI": "https://chouprojects.com/how-to-calculate-correlation-coefficient-in-excel-8/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4e630d13-4d4f-4990-aca9-78261e8394fa>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-184\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,
13,
35,
36,
86,
87,
101,
102,
274,
456,
687,
688,
982,
983,
1021,
1022,
1712,
1713,
2298,
2299,
2756,
2757,
3160,
3161,
3250,
3251,
3297,
3298,
3339,
3340,
3680,
3681,
3907,
3983,
4184,
4185,
4501,
4502,
4770,
4771,
4863,
4864,
4916,
4917,
4971,
4972,
5203,
5204,
5510,
5842,
6068,
6069,
6281,
6282,
6525,
6526,
6739,
6740,
6845,
6846,
6894,
6895,
6963,
6964,
7101,
7171,
7362,
7495,
7707,
7708,
7769,
7770,
7821,
7822,
7903,
7904,
7992,
8056,
8125,
8189,
8318,
8441,
8442,
8509,
8510,
8572,
8573,
8596,
8597,
8713,
8714,
8764,
8765,
9035,
9036,
9088,
9089,
9266,
9267,
9344,
9345,
9685,
9686,
9765,
9766,
9913,
9914,
9971,
10076,
10126,
10180,
10225,
10331,
10397,
10398,
10415,
10416,
10467,
10468,
10535,
10536,
10588,
10589,
10654,
10655,
10710,
10711,
10773,
10774
],
"line_end_idx": [
13,
35,
36,
86,
87,
101,
102,
274,
456,
687,
688,
982,
983,
1021,
1022,
1712,
1713,
2298,
2299,
2756,
2757,
3160,
3161,
3250,
3251,
3297,
3298,
3339,
3340,
3680,
3681,
3907,
3983,
4184,
4185,
4501,
4502,
4770,
4771,
4863,
4864,
4916,
4917,
4971,
4972,
5203,
5204,
5510,
5842,
6068,
6069,
6281,
6282,
6525,
6526,
6739,
6740,
6845,
6846,
6894,
6895,
6963,
6964,
7101,
7171,
7362,
7495,
7707,
7708,
7769,
7770,
7821,
7822,
7903,
7904,
7992,
8056,
8125,
8189,
8318,
8441,
8442,
8509,
8510,
8572,
8573,
8596,
8597,
8713,
8714,
8764,
8765,
9035,
9036,
9088,
9089,
9266,
9267,
9344,
9345,
9685,
9686,
9765,
9766,
9913,
9914,
9971,
10076,
10126,
10180,
10225,
10331,
10397,
10398,
10415,
10416,
10467,
10468,
10535,
10536,
10588,
10589,
10654,
10655,
10710,
10711,
10773,
10774,
10789
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10789,
"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.3539958894252777,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013319670222699642,
"rps_doc_frac_lines_end_with_ellipsis": 0.023255810141563416,
"rps_doc_frac_no_alph_words": 0.1839139312505722,
"rps_doc_frac_unique_words": 0.2694947123527527,
"rps_doc_mean_word_length": 5.502183437347412,
"rps_doc_num_sentences": 113,
"rps_doc_symbol_to_word_ratio": 0.0015368900494650006,
"rps_doc_unigram_entropy": 5.104913234710693,
"rps_doc_word_count": 1603,
"rps_doc_frac_chars_dupe_10grams": 0.044784579426050186,
"rps_doc_frac_chars_dupe_5grams": 0.2539682388305664,
"rps_doc_frac_chars_dupe_6grams": 0.18616780638694763,
"rps_doc_frac_chars_dupe_7grams": 0.1427437663078308,
"rps_doc_frac_chars_dupe_8grams": 0.07879818975925446,
"rps_doc_frac_chars_dupe_9grams": 0.0565759614109993,
"rps_doc_frac_chars_top_2gram": 0.11972788721323013,
"rps_doc_frac_chars_top_3gram": 0.03492062911391258,
"rps_doc_frac_chars_top_4gram": 0.048639461398124695,
"rps_doc_books_importance": -755.92236328125,
"rps_doc_books_importance_length_correction": -755.92236328125,
"rps_doc_openwebtext_importance": -372.4696960449219,
"rps_doc_openwebtext_importance_length_correction": -372.4696960449219,
"rps_doc_wikipedia_importance": -312.1918640136719,
"rps_doc_wikipedia_importance_length_correction": -312.1918640136719
},
"fasttext": {
"dclm": 0.41357719898223877,
"english": 0.8974732756614685,
"fineweb_edu_approx": 3.11887264251709,
"eai_general_math": 0.9623451232910156,
"eai_open_web_math": 0.4438283443450928,
"eai_web_code": 0.2925257086753845
}
}
|
{
"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.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": "-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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,270,615,856,055,373,000 |
Skip site navigation (1)Skip section navigation (2)
FreeBSD Manual Pages
Man Page or Keyword Search:
Man Architecture
Apropos Keyword Search (all sections) Output format
home | help
LWRESD(8) BIND9 LWRESD(8)
NAME
lwresd - lightweight resolver daemon
SYNOPSIS
lwresd [-C config-file] [-d debug-level] [-f] [-g] [-i pid-file]
[-n #cpus] [-P port] [-p port] [-s] [-t directory] [-u user]
[-v]
DESCRIPTION
lwresd is the daemon providing name lookup services to clients that use
the BIND 9 lightweight resolver library. It is essentially a
stripped-down, caching-only name server that answers queries using the
BIND 9 lightweight resolver protocol rather than the DNS protocol.
lwresd listens for resolver queries on a UDP port on the IPv4 loopback
interface, 127.0.0.1. This means that lwresd can only be used by
processes running on the local machine. By default UDP port number 921
is used for lightweight resolver requests and responses.
Incoming lightweight resolver requests are decoded by the server which
then resolves them using the DNS protocol. When the DNS lookup
completes, lwresd encodes the answers in the lightweight resolver
format and returns them to the client that made the request.
If /etc/resolv.conf contains any nameserver entries, lwresd sends
recursive DNS queries to those servers. This is similar to the use of
forwarders in a caching name server. If no nameserver entries are
present, or if forwarding fails, lwresd resolves the queries
autonomously starting at the root name servers, using a built-in list
of root server hints.
OPTIONS
-C config-file
Use config-file as the configuration file instead of the default,
/etc/resolv.conf.
-d debug-level
Set the daemon's debug level to debug-level. Debugging traces from
lwresd become more verbose as the debug level increases.
-f Run the server in the foreground (i.e. do not daemonize).
-g Run the server in the foreground and force all logging to stderr.
-n #cpus
Create #cpus worker threads to take advantage of multiple CPUs. If
not specified, lwresd will try to determine the number of CPUs
present and create one thread per CPU. If it is unable to determine
the number of CPUs, a single worker thread will be created.
-P port
Listen for lightweight resolver queries on port port. If not
specified, the default is port 921.
-p port
Send DNS lookups to port port. If not specified, the default is port
53. This provides a way of testing the lightweight resolver daemon
with a name server that listens for queries on a non-standard port
number.
-s Write memory usage statistics to stdout on exit.
Note: This option is mainly of interest to BIND 9 developers and may
be removed or changed in a future release.
-t directory
chroot() to directory after processing the command line arguments,
but before reading the configuration file.
Warning: This option should be used in conjunction with the -u
option, as chrooting a process running as root doesn't enhance
security on most systems; the way chroot() is defined allows a
process with root privileges to escape a chroot jail.
-u user
setuid() to user after completing privileged operations, such as
creating sockets that listen on privileged ports.
-v Report the version number and exit.
FILES
/etc/resolv.conf
The default configuration file.
/var/run/lwresd.pid
The default process-id file.
SEE ALSO
named(8), lwres(3), resolver(5).
AUTHOR
Internet Systems Consortium
COPYRIGHT
Copyright (C) 2004, 2005 Internet Systems Consortium, Inc. ("ISC")
BIND9 June 30, 2000 LWRESD(8)
NAME | SYNOPSIS | DESCRIPTION | OPTIONS | FILES | SEE ALSO | AUTHOR | COPYRIGHT
Want to link to this manual page? Use this URL:
<https://www.freebsd.org/cgi/man.cgi?query=lwresd&sektion=8&manpath=FreeBSD+6.2-RELEASE>
home | help
|
{
"url": "https://www.freebsd.org/cgi/man.cgi?query=lwresd&sektion=8&apropos=0&manpath=FreeBSD+6.2-RELEASE",
"source_domain": "www.freebsd.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "36641",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H26DRPKMMIQDBDZGJTYASGMHVVJF2ZUM",
"WARC-Concurrent-To": "<urn:uuid:f4daa272-8498-4446-9886-27360bd6c318>",
"WARC-Date": "2017-05-25T18:40:48Z",
"WARC-IP-Address": "8.8.178.110",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:I5AEYEHFOD56QR5SNOAHSN2JCBDAHYB4",
"WARC-Record-ID": "<urn:uuid:b110401d-308c-4616-b168-ef2eec9572bb>",
"WARC-Target-URI": "https://www.freebsd.org/cgi/man.cgi?query=lwresd&sektion=8&apropos=0&manpath=FreeBSD+6.2-RELEASE",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9d1eb459-6ddd-4f98-b876-f1fc2499d6af>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 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,
52,
53,
74,
75,
103,
120,
172,
184,
263,
264,
269,
313,
314,
323,
395,
470,
489,
490,
502,
581,
649,
727,
801,
802,
880,
952,
1030,
1094,
1095,
1173,
1243,
1316,
1384,
1385,
1458,
1535,
1608,
1676,
1753,
1782,
1783,
1791,
1813,
1889,
1917,
1918,
1940,
2017,
2084,
2085,
2153,
2154,
2230,
2231,
2247,
2324,
2397,
2475,
2545,
2546,
2561,
2632,
2678,
2679,
2694,
2773,
2850,
2927,
2945,
2946,
3005,
3084,
3137,
3138,
3158,
3235,
3288,
3361,
3434,
3507,
3571,
3572,
3587,
3662,
3722,
3723,
3769,
3770,
3776,
3800,
3842,
3843,
3870,
3909,
3910,
3919,
3959,
3960,
3967,
4002,
4003,
4013,
4087,
4088,
4167,
4168,
4248,
4249,
4297,
4386,
4387
],
"line_end_idx": [
52,
53,
74,
75,
103,
120,
172,
184,
263,
264,
269,
313,
314,
323,
395,
470,
489,
490,
502,
581,
649,
727,
801,
802,
880,
952,
1030,
1094,
1095,
1173,
1243,
1316,
1384,
1385,
1458,
1535,
1608,
1676,
1753,
1782,
1783,
1791,
1813,
1889,
1917,
1918,
1940,
2017,
2084,
2085,
2153,
2154,
2230,
2231,
2247,
2324,
2397,
2475,
2545,
2546,
2561,
2632,
2678,
2679,
2694,
2773,
2850,
2927,
2945,
2946,
3005,
3084,
3137,
3138,
3158,
3235,
3288,
3361,
3434,
3507,
3571,
3572,
3587,
3662,
3722,
3723,
3769,
3770,
3776,
3800,
3842,
3843,
3870,
3909,
3910,
3919,
3959,
3960,
3967,
4002,
4003,
4013,
4087,
4088,
4167,
4168,
4248,
4249,
4297,
4386,
4387,
4398
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4398,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.280548632144928,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05236908048391342,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25561097264289856,
"rps_doc_frac_unique_words": 0.4589877724647522,
"rps_doc_mean_word_length": 5.136125564575195,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.003740649903193116,
"rps_doc_unigram_entropy": 5.14741849899292,
"rps_doc_word_count": 573,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0801902785897255,
"rps_doc_frac_chars_dupe_6grams": 0.061841659247875214,
"rps_doc_frac_chars_dupe_7grams": 0.025823989883065224,
"rps_doc_frac_chars_dupe_8grams": 0.025823989883065224,
"rps_doc_frac_chars_dupe_9grams": 0.025823989883065224,
"rps_doc_frac_chars_top_2gram": 0.05164797976613045,
"rps_doc_frac_chars_top_3gram": 0.014271150343120098,
"rps_doc_frac_chars_top_4gram": 0.012911990284919739,
"rps_doc_books_importance": -376.6888427734375,
"rps_doc_books_importance_length_correction": -376.6888427734375,
"rps_doc_openwebtext_importance": -227.0382843017578,
"rps_doc_openwebtext_importance_length_correction": -227.0382843017578,
"rps_doc_wikipedia_importance": -152.128173828125,
"rps_doc_wikipedia_importance_length_correction": -152.128173828125
},
"fasttext": {
"dclm": 0.07818335294723511,
"english": 0.8286498785018921,
"fineweb_edu_approx": 2.6048402786254883,
"eai_general_math": 0.17365777492523193,
"eai_open_web_math": 0.19705629348754883,
"eai_web_code": 0.36033958196640015
}
}
|
{
"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.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": "-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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,218,422,217,860,490,000 |
College Algebra (10th Edition)
Published by Pearson
ISBN 10: 0321979478
ISBN 13: 978-0-32197-947-6
Chapter 5 - Section 5.6 - Complex Numbers; Quadratic Equations in the Complex Number System - 5.6 Assess Your Understanding: 45
Answer
Having $2+i$ as a zero means that its conjugate $2-i$ must also be a zero of the function.
Work Step by Step
RECALL: The Conjugate Pairs Theorem states that if $a+bi$ is a zero of a polynomial function with real coefficients, then $a-bi$ is also a zero of the function. The given statement is false since having $2+i$ as a zero of a polynomial function with real coefficients means that $2-i$ is also a zero of the function.
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answer
After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.
|
{
"url": "https://www.gradesaver.com/textbooks/math/algebra/college-algebra-10th-edition/chapter-5-section-5-6-complex-numbers-quadratic-equations-in-the-complex-number-system-5-6-assess-your-understanding-page-395/45",
"source_domain": "www.gradesaver.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "67182",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B7HLXZB6QFVKWASGJWUXANPSWNJUZMJ2",
"WARC-Concurrent-To": "<urn:uuid:e5d48fbf-2b1d-449f-99ed-517d308b38c4>",
"WARC-Date": "2018-07-17T14:05:42Z",
"WARC-IP-Address": "107.23.12.46",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QM6WFORVXYEHRRMSBP3N3CYKAIK5X27W",
"WARC-Record-ID": "<urn:uuid:d89b7012-220b-4756-acb5-9b8ea4d84836>",
"WARC-Target-URI": "https://www.gradesaver.com/textbooks/math/algebra/college-algebra-10th-edition/chapter-5-section-5-6-complex-numbers-quadratic-equations-in-the-complex-number-system-5-6-assess-your-understanding-page-395/45",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe022167-6071-4010-9b0a-a6a58b00e0b0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-159-151-213.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,
31,
32,
53,
73,
100,
101,
229,
230,
237,
238,
329,
330,
348,
349,
665,
685,
686,
755,
756,
775,
776
],
"line_end_idx": [
31,
32,
53,
73,
100,
101,
229,
230,
237,
238,
329,
330,
348,
349,
665,
685,
686,
755,
756,
775,
776,
935
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 935,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35680750012397766,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014084509573876858,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2957746386528015,
"rps_doc_frac_unique_words": 0.5833333134651184,
"rps_doc_mean_word_length": 4.647435665130615,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.278778553009033,
"rps_doc_word_count": 156,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2524137794971466,
"rps_doc_frac_chars_dupe_6grams": 0.19310344755649567,
"rps_doc_frac_chars_dupe_7grams": 0.19310344755649567,
"rps_doc_frac_chars_dupe_8grams": 0.12689654529094696,
"rps_doc_frac_chars_dupe_9grams": 0.12689654529094696,
"rps_doc_frac_chars_top_2gram": 0.04137931019067764,
"rps_doc_frac_chars_top_3gram": 0.04827585816383362,
"rps_doc_frac_chars_top_4gram": 0.04137931019067764,
"rps_doc_books_importance": -66.60931396484375,
"rps_doc_books_importance_length_correction": -66.60931396484375,
"rps_doc_openwebtext_importance": -42.426719665527344,
"rps_doc_openwebtext_importance_length_correction": -30.297937393188477,
"rps_doc_wikipedia_importance": -27.910869598388672,
"rps_doc_wikipedia_importance_length_correction": -27.910869598388672
},
"fasttext": {
"dclm": 0.16841453313827515,
"english": 0.8616848587989807,
"fineweb_edu_approx": 1.598909616470337,
"eai_general_math": 0.9783691763877869,
"eai_open_web_math": 0.6479442715644836,
"eai_web_code": 0.23440980911254883
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,470,244,966,747,779,000 |
How Cyber Recovery Works
The Cyber Recovery solution maintains mission-critical business data and technology configurations in a secure, air-gapped ‘vault’ environment that can be used for recovery or analysis. The Cyber Recovery Vault (CR Vault) is physically isolated from an unsecure system or network. The Cyber Recovery solution enables access to the CR Vault only long enough to replicate data from the production system. At all other times, the CR Vault is secured and off the network. A deduplication process is performed in the production environment to expedite the replication process so that connection time to the CR Vault is as short as possible.
Within the CR Vault, the Cyber Recovery software creates point-in-time (PIT) retention-locked copies that can be validated and then used for recovery of the production system.
Figure 1 High-level solution architecture
Pict 1. High Level Solution Architecture
Cyber Recovery architecture
As shown in the following diagram, the Cyber Recovery solution uses Data Domain systems to replicate data from the production system to the CR Vault through a dedicated replication data link.
Figure 2 Cyber Recovery architecture
Pict 2. Cyber Recovery Archiceture
How the Dell EMC Cyber Recovery Vault Works To Help You Recover From Attacks?
Dell EMC Cyber Recovery is a complete, isolated recovery solution that can help you minimize downtime, expense, and lost revenue by providing a resilient backup to critical data and a path to recovery from a cyber attack. To start, Dell EMC offers professional services that help you assess, plan, implement, and validate your cyber recovery solution.
Production environments are vulnerable to attack. Dell EMC Cyber Recovery keeps your data in a vault, where it is physically and logically isolated from other systems and locations. Physically, the Cyber Recovery Vault resides in a restricted room or area in your facility accessible only by authorized physical access, which limits the ability of in-house saboteurs that wish to hold your data for ransom to complete their objectives.
Pict 3. Dell EMC Cyber Recovery
CyberSense security analytics looks for indicators of compromised data and can help you discover the who, how, and the why, so you can recover quickly from attack.
https://www.youtube.com/watch?v=xJzllq4AXxk
Source:
https://www.delltechnologies.com/en-id/data-protection/cyber-recovery-solution.htm
https://www.channelsparkit.com/Share/6xyvoJVm1/
Scroll to Top
|
{
"url": "https://saptatunas.com/how-cyber-recovery-works/",
"source_domain": "saptatunas.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "229049",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UELHWDAPF7BQQINPBDG5DRRJKPXBR775",
"WARC-Concurrent-To": "<urn:uuid:7510047e-676b-4995-8fbb-6d563983491c>",
"WARC-Date": "2023-09-26T08:44:27Z",
"WARC-IP-Address": "45.77.244.129",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UJIVB6ZGTJOWJLY6EWMQ2Y3BG2G2K3HA",
"WARC-Record-ID": "<urn:uuid:625e2f23-7045-4022-af83-41e281b9effc>",
"WARC-Target-URI": "https://saptatunas.com/how-cyber-recovery-works/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:24da7392-0b9b-4708-945f-2e23d3e29d22>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
25,
26,
662,
663,
839,
840,
882,
883,
924,
925,
953,
954,
1146,
1147,
1184,
1185,
1220,
1221,
1299,
1300,
1652,
1653,
2089,
2090,
2122,
2123,
2287,
2288,
2332,
2333,
2341,
2342,
2425,
2426,
2474,
2475
],
"line_end_idx": [
25,
26,
662,
663,
839,
840,
882,
883,
924,
925,
953,
954,
1146,
1147,
1184,
1185,
1220,
1221,
1299,
1300,
1652,
1653,
2089,
2090,
2122,
2123,
2287,
2288,
2332,
2333,
2341,
2342,
2425,
2426,
2474,
2475,
2488
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2488,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3002159893512726,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0280777495354414,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16414687037467957,
"rps_doc_frac_unique_words": 0.44077134132385254,
"rps_doc_mean_word_length": 5.600551128387451,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.567211627960205,
"rps_doc_word_count": 363,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03738318011164665,
"rps_doc_frac_chars_dupe_6grams": 0.03738318011164665,
"rps_doc_frac_chars_dupe_7grams": 0.03738318011164665,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.09591735899448395,
"rps_doc_frac_chars_top_3gram": 0.0472208596765995,
"rps_doc_frac_chars_top_4gram": 0.039350710809230804,
"rps_doc_books_importance": -153.21058654785156,
"rps_doc_books_importance_length_correction": -153.21058654785156,
"rps_doc_openwebtext_importance": -97.9079360961914,
"rps_doc_openwebtext_importance_length_correction": -97.9079360961914,
"rps_doc_wikipedia_importance": -50.66384506225586,
"rps_doc_wikipedia_importance_length_correction": -50.66384506225586
},
"fasttext": {
"dclm": 0.12728309631347656,
"english": 0.8901329040527344,
"fineweb_edu_approx": 1.7664130926132202,
"eai_general_math": 0.2361658811569214,
"eai_open_web_math": 0.33375388383865356,
"eai_web_code": 0.04509979113936424
}
}
|
{
"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.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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,780,603,616,427,143,000 |
* Posts by Nigel Brown
233 publicly visible posts • joined 29 Jul 2006
Page:
Between you, EE and the lamppost ... this UK cell network is knackered
Nigel Brown
Just today??
Anything other than 4G is pretty dire every day.
Dangerous Android banking bot leak signals new malware wave
Nigel Brown
And possibly keeping away from less than salubrious websites.......
Facebook tells Viz to f**k right off
Nigel Brown
These so-called "standards" of Zucks
seem to depend very much on which side of the bed the particular censor monkey got out of.
In this Facebook and Google-owned world, it's time to rethink privacy
Nigel Brown
" I need to buy a TV, but can't find anything but smart, so I'm not buying period"
How about buying the tv but NOT connecting it to the net?
US rapper slams Earth is Round conspiracy in Twitter marathon
Nigel Brown
Bbbbbbob-uh
Anyone else hearing his name pronounced by Rowan Atkinson?
Facebook Messenger: All your numbers are belong to us
Nigel Brown
Not me Zuck.
Don't have and wont have the mobile app - I use the mobile browser.
Don't have, don't want, don't need and wont have the messenger app. Why do I need that when I have WhatsApp and old fashioned text messaging available? The world doesn't start and stop with Facebook.
Friends Reunited to shut down. What do you mean, 'is it still going?'
Nigel Brown
Still chuckling
that it was sold to the owners of The Beano.
Stephen Hawking reckons he's cracked the black hole paradox
Nigel Brown
So what is it?
It's an orange swirly thing in space.
Foetuses offered vaginal music streaming service
Nigel Brown
Theoretically..
...the mum to be would need a licence from the PRS due this being classed as a broadcast.
Obama: What will solve America's gun problem? What could it be? *snaps fingers* Technology!
Nigel Brown
Clearly a film buff
Did the Prez get his technological idea from watching Skyfall?
How to solve a Rubik's Cube in five seconds
Nigel Brown
Or you could
just go out and get a girlfriend.....
Facebook conjures up a trap for the unwary: scanning your camera for your friends
Nigel Brown
Simple solution
Use a browser, not the app.
Bacon can kill: Official
Nigel Brown
The biggest danger
is to my mental health from reading all the garbage that these organisations pump out.
I'm not going to stop eating bacon, but I sure as heck am going to stop listening to 'experts'.
Rights groups: Darn you Facebook with your 'government names'
Nigel Brown
Can i just point out one thing?
My real name isn't Nigel Brown. How simple was that?
Mastercard facial recog-ware will unlock your money using SELFIES
Nigel Brown
Checks article date for April 1st date tag....
Nope, not a joke.
Stop the world, I want to get off.
Costa Coffee Club members wake up and smell the data breach
Nigel Brown
Re: Not that bothered
Ask the 1.4 billion Facebook users, of whom probably 1.3 billion give accurate details.
Google wants Marvin the Paranoid Android's personality in the cloud
Nigel Brown
Well, if you call it a robot.
It's more like an electronic sulking machine.
Ford: Our latest car gizmo will CHOKE OFF your FUEL if you're speeding
Nigel Brown
Re: My wife's car has automatic headlights.
Wrong.
Sidelights are in the main useless, being like a glow-worm in a jam jar on a lot of cars. There is no excuse for not using dipped headlights if you want to be seen. Things have moved on, you don't 'save the battery' by using sidelights instead of headlights!
Hello? Police? Yes, I'm a car and my idiot driver's crashed me
Nigel Brown
How severe does the 'crash' need to be..
...before the system alerts the blues & twos brigades? Pretty sure they'll be less than impressed if they're called out to every minor shunt or bollard bump.
My self-driving cars may lead to human driver ban, says Tesla's Musk
Nigel Brown
This just in
http://www.delphi.com/delphi-drive
Nigel Brown
Re: Not a problem solved
Self drive is a solution looking for a problem.
Nigel Brown
Re: Am I the only one...
What happens when it encounters something that it hasn't been programmed to recognise and avoid? Hopefully it will default to 'get-the-hell-out-of-the-way' mode, but given the number of patches that software requires to 'fix' all the undocumented features , that's not a given.
Nigel Brown
Am I the only one...
I am deeply, deeply uneasy about this. I know driving standards are pretty poor, but I still don't trust a 'puter to do it instead of a human.
Facebook unveils P2P moola-to-mates payment feature
Nigel Brown
If any of my friends need money..
..they can bloody well come and ask me to my face!
Shove off, ugly folk, says site for people who love themselves
Nigel Brown
What was it they used to say?
Beauty is in the eye of the beer holder?
Nokia boss smashes net neutrality activists
Nigel Brown
Not *really* sure
that I want an internet connected car doing the driving for me.
"Before I apply the brakes, please watch this safety video. Video can be skipped in 5 seconds....."
Porn on Blogger – Google takes stiff action
Nigel Brown
The job is rated at £125 a week
Not a lot but it's all I can afford to pay.
ATTENTION SETI scientists! It's TOO LATE: ALIENS will ATTACK in 2049
Nigel Brown
Mostly harmless
Apart from those who despise everyone but themselves.
UN negotiations menaced by topless women. Or not
Nigel Brown
Mayonnaise?
What's wrong with the much more palatable crème fraiche?
Car? Check. Driver? Nope. OK, let's go, says British govt
Nigel Brown
Welcome to Johnnycabs
Douglas Quaid: Where am I?
Johnnycab: You're in a Johnnycab.
Douglas Quaid: I mean, what am I doing here?
Johnnycab: I'm sorry. Would you please rephrase the question?
Douglas Quaid: How did I get in this taxi?
Johnnycab: The door opened. You got in.
[Johnnycab rolls his eyes]
Post-pub nosh neckfiller: 1.5 MILLION SCOVILLE masala omelette
Nigel Brown
Only half the story
What about the following morning, shall we tactfully call it the 'exit plan'?
Quantum computing is so powerful it takes two years to understand what happened
Nigel Brown
So what is it? *
I'm afraid you lost me halfway through the opening sentence!
*It's a big swirly orange thing in space!
Hawking: RISE of the MACHINES could DESTROY HUMANITY
Nigel Brown
AI doesn't worry me..
...it's Natural Stupidity that will be the downfall of the human race.
Online tat bazaar eBay collapses in UK
Nigel Brown
El Reg hacks need to actually *look* at the modern fleabay
Most sellers now are businesses, the sellers of 'second hand crap' have faded into a minority, driven out by scamming buyers, the lack of ability to leave negative feedback about a bad buyer, and the decision to charge the seller a %age of the postal charges.
Apple Watch will CONQUER smartwatch world – analysts
Nigel Brown
I have a perfectly functional watch
I also have a smartphone with a large screen. At my age I need bigger screens not ruddy smaller.
Google extends app refund window to two hours
Nigel Brown
Refund?
I only ever opt for the free apps anyway. If there's a feature I want that's only in the paid for version then I usually seek out another freebie that gives me that feature. Guess I'm just ludicrously tight, or is it too many years of freetarderyness© :)
eBay, Facebook, Tumblr ALL go TITSUP in me-too MULTI-FAIL
Nigel Brown
Can someone please explain to a non techy bod like me
What exactly is involved in server maintenance? Oil and filters and re-gap the plugs?
CNN 'tech analyst' on NAKED CELEBS: WHO IS this mystery '4chan' PERSON?
Nigel Brown
What does CNN stand for?
I'm guessing it's Cartoon Network (something)
Video of US journalist 'beheading' pulled from social media
Nigel Brown
Nice 180 degree turn from Facebook
They used to leave these things up, trot out some corporate guff about right to know, public awareness etc. Perhaps now they are starting to listen to their outraged products they'll start to respond about requests to take down the child and animal abuse pages, videos, etc.
Microsoft: Just what the world needs – a $25 Nokia dumbphone
Nigel Brown
Re: Motorcyclists have a perfect use for this phone.
Bugger, missed that bit. :(
Nigel Brown
Motorcyclists have a perfect use for this phone.
Squirreled away under the seat, on silent, you have a perfect tracker should your expensive motorcycle be stolen. People have been touting this idea for some time, using an old forgotten phone from the back of the drawer.
Robot cars to hit Blighty in 2015
Nigel Brown
Joke
I have had an epiphany.
I used to shudder at the thought of these things beetling about unattended, but then I realised that at last, German car manufacturers will be able to ensure that their indicators do actually get used.
Too rich for an iPhone 6? How about a gold-plated Brikk?
Nigel Brown
An awful lot of money to play Candy Crush.....
Facebook: Want to stay in touch? Then it's Messenger or NOTHING
Nigel Brown
I junked the app months ago.
Just using the web browser now. If they remove that option then hell, I can always wait until I get home to find out my friends highest score on the latest faddy game, or see a photo of their lunch......
HP settles suit with popstar Chubby Checker over todger tester app
Nigel Brown
Well I *was*..
...going to question if there really is a market for this app, but then I remembered about all the fart generator apps and decided not to ask.
Klingon and Maori roar into 'mutt's nuts' dictionary
Nigel Brown
Joke
In Korea it translates as
Hors d'ouvres or dumplings :)
Surprise! Google chairman blasts EU's privacy ruling
Nigel Brown
Other search engines are available....
...as my local BBC radio station keeps telling us.
Selfies are so 2013. Get ready for DRONIES – the next hipster-cam-gasm
Nigel Brown
Re: What do I think of it?
I really wish I could upvote this more than once.
Candy Crush King sees IPO go sour as stock price heads south
Nigel Brown
Re: Send in the clones
That game is on mobile devices already.
Nigel Brown
Send in the clones
Am I correct in assuming that all their games are a rip off of Bejewelled, just with different graphics?
Page:
|
{
"url": "https://forums.theregister.com/user/140/",
"source_domain": "forums.theregister.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "95587",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P33T367HTWFICD66FQSZEZ2XEYERPNUV",
"WARC-Concurrent-To": "<urn:uuid:00d5ad43-6d36-469c-ab29-f7a1fdf3c2b3>",
"WARC-Date": "2023-09-23T20:45:36Z",
"WARC-IP-Address": "104.18.4.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PIN2QKSKODRSWMHHQX4IRLHTSDZHZD5O",
"WARC-Record-ID": "<urn:uuid:b744325f-3e11-4b99-932a-79f621efd409>",
"WARC-Target-URI": "https://forums.theregister.com/user/140/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6594accb-e392-46ab-b5f6-b0e127cf3f0a>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-105\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,
23,
24,
72,
73,
79,
80,
151,
152,
164,
165,
178,
179,
228,
229,
289,
290,
302,
303,
371,
372,
409,
410,
422,
423,
460,
461,
552,
553,
623,
624,
636,
637,
720,
721,
779,
780,
842,
843,
855,
856,
868,
869,
928,
929,
983,
984,
996,
997,
1010,
1011,
1079,
1080,
1280,
1281,
1351,
1352,
1364,
1365,
1381,
1382,
1427,
1428,
1488,
1489,
1501,
1502,
1517,
1518,
1556,
1557,
1606,
1607,
1619,
1620,
1636,
1637,
1727,
1728,
1820,
1821,
1833,
1834,
1854,
1855,
1918,
1919,
1963,
1964,
1976,
1977,
1990,
1991,
2029,
2030,
2112,
2113,
2125,
2126,
2142,
2143,
2171,
2172,
2197,
2198,
2210,
2211,
2230,
2231,
2318,
2319,
2415,
2416,
2478,
2479,
2491,
2492,
2524,
2525,
2578,
2579,
2645,
2646,
2658,
2659,
2706,
2707,
2725,
2726,
2761,
2762,
2822,
2823,
2835,
2836,
2858,
2859,
2947,
2948,
3016,
3017,
3029,
3030,
3060,
3061,
3107,
3108,
3179,
3180,
3192,
3193,
3237,
3238,
3245,
3246,
3505,
3506,
3569,
3570,
3582,
3583,
3624,
3625,
3783,
3784,
3853,
3854,
3866,
3867,
3880,
3881,
3916,
3917,
3929,
3930,
3955,
3956,
4004,
4005,
4017,
4018,
4043,
4044,
4322,
4323,
4335,
4336,
4357,
4358,
4501,
4502,
4554,
4555,
4567,
4568,
4602,
4603,
4654,
4655,
4718,
4719,
4731,
4732,
4762,
4763,
4804,
4805,
4849,
4850,
4862,
4863,
4881,
4882,
4946,
4947,
5047,
5048,
5092,
5093,
5105,
5106,
5138,
5139,
5183,
5184,
5253,
5254,
5266,
5267,
5283,
5284,
5338,
5339,
5388,
5389,
5401,
5402,
5414,
5415,
5472,
5473,
5531,
5532,
5544,
5545,
5567,
5568,
5595,
5596,
5630,
5631,
5676,
5677,
5739,
5740,
5783,
5784,
5824,
5825,
5852,
5853,
5916,
5917,
5929,
5930,
5950,
5951,
6029,
6030,
6110,
6111,
6123,
6124,
6141,
6142,
6203,
6204,
6246,
6247,
6300,
6301,
6313,
6314,
6336,
6337,
6408,
6409,
6448,
6449,
6461,
6462,
6521,
6522,
6782,
6783,
6836,
6837,
6849,
6850,
6886,
6887,
6984,
6985,
7031,
7032,
7044,
7045,
7053,
7054,
7309,
7310,
7368,
7369,
7381,
7382,
7436,
7437,
7523,
7524,
7596,
7597,
7609,
7610,
7635,
7636,
7682,
7683,
7743,
7744,
7756,
7757,
7792,
7793,
8068,
8069,
8130,
8131,
8143,
8144,
8197,
8198,
8226,
8227,
8239,
8240,
8289,
8290,
8512,
8513,
8547,
8548,
8560,
8565,
8566,
8590,
8591,
8793,
8794,
8851,
8852,
8864,
8865,
8912,
8913,
8977,
8978,
8990,
8991,
9020,
9021,
9225,
9226,
9293,
9294,
9306,
9307,
9322,
9323,
9466,
9467,
9520,
9521,
9533,
9538,
9539,
9565,
9566,
9596,
9597,
9650,
9651,
9663,
9664,
9703,
9704,
9755,
9756,
9827,
9828,
9840,
9841,
9868,
9869,
9919,
9920,
9981,
9982,
9994,
9995,
10018,
10019,
10059,
10060,
10072,
10073,
10092,
10093,
10198,
10199
],
"line_end_idx": [
23,
24,
72,
73,
79,
80,
151,
152,
164,
165,
178,
179,
228,
229,
289,
290,
302,
303,
371,
372,
409,
410,
422,
423,
460,
461,
552,
553,
623,
624,
636,
637,
720,
721,
779,
780,
842,
843,
855,
856,
868,
869,
928,
929,
983,
984,
996,
997,
1010,
1011,
1079,
1080,
1280,
1281,
1351,
1352,
1364,
1365,
1381,
1382,
1427,
1428,
1488,
1489,
1501,
1502,
1517,
1518,
1556,
1557,
1606,
1607,
1619,
1620,
1636,
1637,
1727,
1728,
1820,
1821,
1833,
1834,
1854,
1855,
1918,
1919,
1963,
1964,
1976,
1977,
1990,
1991,
2029,
2030,
2112,
2113,
2125,
2126,
2142,
2143,
2171,
2172,
2197,
2198,
2210,
2211,
2230,
2231,
2318,
2319,
2415,
2416,
2478,
2479,
2491,
2492,
2524,
2525,
2578,
2579,
2645,
2646,
2658,
2659,
2706,
2707,
2725,
2726,
2761,
2762,
2822,
2823,
2835,
2836,
2858,
2859,
2947,
2948,
3016,
3017,
3029,
3030,
3060,
3061,
3107,
3108,
3179,
3180,
3192,
3193,
3237,
3238,
3245,
3246,
3505,
3506,
3569,
3570,
3582,
3583,
3624,
3625,
3783,
3784,
3853,
3854,
3866,
3867,
3880,
3881,
3916,
3917,
3929,
3930,
3955,
3956,
4004,
4005,
4017,
4018,
4043,
4044,
4322,
4323,
4335,
4336,
4357,
4358,
4501,
4502,
4554,
4555,
4567,
4568,
4602,
4603,
4654,
4655,
4718,
4719,
4731,
4732,
4762,
4763,
4804,
4805,
4849,
4850,
4862,
4863,
4881,
4882,
4946,
4947,
5047,
5048,
5092,
5093,
5105,
5106,
5138,
5139,
5183,
5184,
5253,
5254,
5266,
5267,
5283,
5284,
5338,
5339,
5388,
5389,
5401,
5402,
5414,
5415,
5472,
5473,
5531,
5532,
5544,
5545,
5567,
5568,
5595,
5596,
5630,
5631,
5676,
5677,
5739,
5740,
5783,
5784,
5824,
5825,
5852,
5853,
5916,
5917,
5929,
5930,
5950,
5951,
6029,
6030,
6110,
6111,
6123,
6124,
6141,
6142,
6203,
6204,
6246,
6247,
6300,
6301,
6313,
6314,
6336,
6337,
6408,
6409,
6448,
6449,
6461,
6462,
6521,
6522,
6782,
6783,
6836,
6837,
6849,
6850,
6886,
6887,
6984,
6985,
7031,
7032,
7044,
7045,
7053,
7054,
7309,
7310,
7368,
7369,
7381,
7382,
7436,
7437,
7523,
7524,
7596,
7597,
7609,
7610,
7635,
7636,
7682,
7683,
7743,
7744,
7756,
7757,
7792,
7793,
8068,
8069,
8130,
8131,
8143,
8144,
8197,
8198,
8226,
8227,
8239,
8240,
8289,
8290,
8512,
8513,
8547,
8548,
8560,
8565,
8566,
8590,
8591,
8793,
8794,
8851,
8852,
8864,
8865,
8912,
8913,
8977,
8978,
8990,
8991,
9020,
9021,
9225,
9226,
9293,
9294,
9306,
9307,
9322,
9323,
9466,
9467,
9520,
9521,
9533,
9538,
9539,
9565,
9566,
9596,
9597,
9650,
9651,
9663,
9664,
9703,
9704,
9755,
9756,
9827,
9828,
9840,
9841,
9868,
9869,
9919,
9920,
9981,
9982,
9994,
9995,
10018,
10019,
10059,
10060,
10072,
10073,
10092,
10093,
10198,
10199,
10204
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10204,
"ccnet_original_nlines": 418,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3672710359096527,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04184100031852722,
"rps_doc_frac_lines_end_with_ellipsis": 0.01909307949244976,
"rps_doc_frac_no_alph_words": 0.1641097217798233,
"rps_doc_frac_unique_words": 0.465863436460495,
"rps_doc_mean_word_length": 4.505450248718262,
"rps_doc_num_sentences": 126,
"rps_doc_symbol_to_word_ratio": 0.00790330022573471,
"rps_doc_unigram_entropy": 5.954576015472412,
"rps_doc_word_count": 1743,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01859162002801895,
"rps_doc_frac_chars_dupe_6grams": 0.015280780382454395,
"rps_doc_frac_chars_dupe_7grams": 0.010187190026044846,
"rps_doc_frac_chars_dupe_8grams": 0.010187190026044846,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06621672958135605,
"rps_doc_frac_chars_top_3gram": 0.010696549899876118,
"rps_doc_frac_chars_top_4gram": 0.0035655200481414795,
"rps_doc_books_importance": -1017.4658203125,
"rps_doc_books_importance_length_correction": -1017.4658203125,
"rps_doc_openwebtext_importance": -631.7842407226562,
"rps_doc_openwebtext_importance_length_correction": -631.7842407226562,
"rps_doc_wikipedia_importance": -403.62322998046875,
"rps_doc_wikipedia_importance_length_correction": -403.62322998046875
},
"fasttext": {
"dclm": 0.19375920295715332,
"english": 0.9272436499595642,
"fineweb_edu_approx": 1.2988289594650269,
"eai_general_math": 0.012727799825370312,
"eai_open_web_math": 0.09314460307359695,
"eai_web_code": 0.0014548300532624125
}
}
|
{
"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": "303.4833",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"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": "16",
"label": "Personal Blog"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,046,592,322,361,322,000 |
Privacy exist only when you have information within closed boundaries or inside your network perimeter.Data does not become private as far it can be accessed on the World Wide Web (www) It all depends how you wish to secure information and to whom this information can be accessible and shared. The internet is a world class market place to get access to everyone’s details or information and it is the worlds market place to sell or buy. The potential of keeping things safe on the internet cannot be guaranteed unless you own the market place itself and decide who should have access to those information and how you manage to secure those information.
Technically speaking all data which exist on a LAN (Local Area Network) are the only one’s which is private and privacy makes sense, whichever network has expanded to WAN (Wide Area Network) is no more private rather a public network . The Internet is a place of information and not a place of data confidentiality. As long information exist on the internet, data is considered to be public with restricted public access. Data or information which is present on-premise surrounding is never pubic unless these information is kept outside the on-premise which is otherwise known as public network or Cloud. When i mean on-premise i mean a place within your vicinity or inside your company or inside your house.Data on cloud is outside the perimeter of data privacy and it is totally up-to the cloud host to keep information secure and it can be also called like a private cloud.The internet is a public cloud where information is not private.
Advertisement
Leave a Reply
Please log in using one of these methods to post your comment:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://learnmystuff.com/2020/06/26/privacy/",
"source_domain": "learnmystuff.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "105446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TL3BALMTP44AOMDIUR72JMYDKNI63GFP",
"WARC-Concurrent-To": "<urn:uuid:f37219be-011c-4bfd-943d-ad342a4a0716>",
"WARC-Date": "2023-06-03T22:06:23Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PSWFI6QYQFCNI6DKY3SHSA57N54XG4GT",
"WARC-Record-ID": "<urn:uuid:66ea0948-4dea-4c8d-aa7f-f01d82f7b6bf>",
"WARC-Target-URI": "https://learnmystuff.com/2020/06/26/privacy/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:95339a1b-5840-4e63-8baa-dc4a919ac969>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-7\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,
655,
656,
1598,
1599,
1613,
1614,
1628,
1629,
1692,
1693,
1712,
1713,
1786,
1787,
1802,
1803,
1871,
1872,
1889,
1890
],
"line_end_idx": [
655,
656,
1598,
1599,
1613,
1614,
1628,
1629,
1692,
1693,
1712,
1713,
1786,
1787,
1802,
1803,
1871,
1872,
1889,
1890,
1970
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1970,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4641909897327423,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0053050401620566845,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09814324229955673,
"rps_doc_frac_unique_words": 0.4498480260372162,
"rps_doc_mean_word_length": 4.832826614379883,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.609210014343262,
"rps_doc_word_count": 329,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031446538865566254,
"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.035220131278038025,
"rps_doc_frac_chars_top_3gram": 0.022641509771347046,
"rps_doc_frac_chars_top_4gram": 0.017610060051083565,
"rps_doc_books_importance": -153.89430236816406,
"rps_doc_books_importance_length_correction": -153.89430236816406,
"rps_doc_openwebtext_importance": -102.81965637207031,
"rps_doc_openwebtext_importance_length_correction": -102.81965637207031,
"rps_doc_wikipedia_importance": -72.09423065185547,
"rps_doc_wikipedia_importance_length_correction": -72.09423065185547
},
"fasttext": {
"dclm": 0.04446220025420189,
"english": 0.9219379425048828,
"fineweb_edu_approx": 2.291896104812622,
"eai_general_math": 0.00011015000200131908,
"eai_open_web_math": 0.06926888227462769,
"eai_web_code": -0.000003580000111469417
}
}
|
{
"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": "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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,360,844,949,105,431,600 |
Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
Register
Language:
Alice and Bob
Time Limit: 5000MSMemory Limit: 65536K
Total Submissions: 948Accepted: 265
Description
This is a puzzle for two persons, let's say Alice and Bob. Alice draws an n-vertex convex polygon and numbers its vertices with integers 1, 2, ..., n in an arbitrary way. Then she draws a number of noncrossing diagonals (the vertices of the polygon are not considered to be crossing points). She informs Bob about the sides and the diagonals of the polygon but not telling him which are which. Each side and diagonal is specified by its ends. Bob has to guess the order of the vertices on the border of the polygon. Help him solve the puzzle.
Example
If n = 4 and (1,3), (4,2), (1,2), (4,1), (2,3) are the ends of four sides and one diagonal then the order of the vertices on the border of this polygon is 1, 3, 2, 4 (with the accuracy to shifting and reversing).
Task
Write a program which for each data set:
reads the description of sides and diagonals given to Bob by Alice,
computes the order of the vertices on the border of the polygon,
writes the result.
Input
The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 <= d <= 20. The data sets follow.
Each data set consists of exactly two consecutive lines.
The first of those lines contains exactly two integers n and m separated by a single space, 3 <= n <= 10 000, 0 <= m <= n - 3. Integer n is the number of vertices of a polygon and integer m is the number of its diagonals, respectively.
The second of those lines contains exactly 2( m + n ) integers separated by single spaces. Those are ends of all sides and some diagonals of the polygon. Integers aj, bj on positions 2j - 1 and 2j, 1 <= j <= m + n, 1 <= aj <= n, 1 <= bj <= n, aj != bj, specify ends of a side or a diagonal. The sides and the diagonals can be given in an arbitrary order. There are no duplicates.
Alice does not cheat, i.e. the puzzle always has a solution.
Output
The output should consist of exactly d lines, one line for each data set.
Line i, 1 <= i <= d, should contain a sequence of n integers separated by single spaces - a permutation of 1, 2, ..., n, i.e. the numbers of subsequent vertices on the border of the polygon from the i-th data set; the sequence should always start from 1 and its second element should be the smaller vertex of the two border neighbours of vertex 1.
Sample Input
1
4 1
1 3 4 2 1 2 4 1 2 3
Sample Output
1 3 2 4
Source
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
|
{
"url": "http://poj.org/problem?id=1429",
"source_domain": "poj.org",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "7842",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O3BWZ4FAT3JNJEWW2P4IPRDGDM4RJ2OL",
"WARC-Concurrent-To": "<urn:uuid:f407e664-06ce-4e6b-8e4f-2488ff57f8b3>",
"WARC-Date": "2016-04-29T10:04:15Z",
"WARC-IP-Address": "162.105.31.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ELEDEGOQWWLG2Q4E7BADFQ5KHMXZDCV6",
"WARC-Record-ID": "<urn:uuid:fd3e67d4-9df3-4f3d-8d6f-1a86d29529c6>",
"WARC-Target-URI": "http://poj.org/problem?id=1429",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:008718e0-5174-4e98-ab81-f5ee8a60a554>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
50,
60,
70,
77,
96,
105,
120,
134,
143,
152,
169,
186,
202,
216,
235,
249,
258,
268,
279,
289,
303,
342,
378,
379,
391,
392,
935,
936,
937,
945,
946,
1159,
1160,
1161,
1166,
1167,
1208,
1209,
1277,
1342,
1361,
1362,
1368,
1369,
1507,
1508,
1565,
1566,
1802,
1803,
2183,
2184,
2245,
2246,
2253,
2254,
2328,
2329,
2677,
2678,
2691,
2692,
2694,
2698,
2718,
2719,
2733,
2734,
2742,
2743,
2750,
2751,
2795,
2796,
2824,
2825,
2826,
2888
],
"line_end_idx": [
50,
60,
70,
77,
96,
105,
120,
134,
143,
152,
169,
186,
202,
216,
235,
249,
258,
268,
279,
289,
303,
342,
378,
379,
391,
392,
935,
936,
937,
945,
946,
1159,
1160,
1161,
1166,
1167,
1208,
1209,
1277,
1342,
1361,
1362,
1368,
1369,
1507,
1508,
1565,
1566,
1802,
1803,
2183,
2184,
2245,
2246,
2253,
2254,
2328,
2329,
2677,
2678,
2691,
2692,
2694,
2698,
2718,
2719,
2733,
2734,
2742,
2743,
2750,
2751,
2795,
2796,
2824,
2825,
2826,
2888,
2929
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2929,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34662577509880066,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007668709848076105,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26840490102767944,
"rps_doc_frac_unique_words": 0.3941747546195984,
"rps_doc_mean_word_length": 4.281553268432617,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.003067479934543371,
"rps_doc_unigram_entropy": 4.785336017608643,
"rps_doc_word_count": 515,
"rps_doc_frac_chars_dupe_10grams": 0.039909299463033676,
"rps_doc_frac_chars_dupe_5grams": 0.1437641680240631,
"rps_doc_frac_chars_dupe_6grams": 0.09841269999742508,
"rps_doc_frac_chars_dupe_7grams": 0.0693877562880516,
"rps_doc_frac_chars_dupe_8grams": 0.05532880127429962,
"rps_doc_frac_chars_dupe_9grams": 0.05532880127429962,
"rps_doc_frac_chars_top_2gram": 0.024943310767412186,
"rps_doc_frac_chars_top_3gram": 0.03265305981040001,
"rps_doc_frac_chars_top_4gram": 0.034467119723558426,
"rps_doc_books_importance": -306.9045104980469,
"rps_doc_books_importance_length_correction": -306.9045104980469,
"rps_doc_openwebtext_importance": -142.18331909179688,
"rps_doc_openwebtext_importance_length_correction": -142.18331909179688,
"rps_doc_wikipedia_importance": -124.94406127929688,
"rps_doc_wikipedia_importance_length_correction": -124.94406127929688
},
"fasttext": {
"dclm": 0.8152891993522644,
"english": 0.877608597278595,
"fineweb_edu_approx": 2.379390001296997,
"eai_general_math": 0.9972928762435913,
"eai_open_web_math": 0.5447570085525513,
"eai_web_code": 0.8341838121414185
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,432,573,838,271,682,000 |
2
Este es un código de agregar pilas, lo que no logro entender bien es que en el prototipo de la función le estoy pasando el *& mi pregunta es ¿por que si solo uso el * el código sigue funcionando sin necesidad de usar *& , hay alguna diferencia entre usar * y *& ?Gracias.
#include<iostream>
struct Nodo{
int dato;
Nodo *siguiente;
};
void agregar_pila(Nodo *&, int);
using namespace std;
int main(){
Nodo *pila = NULL;
agregar_pila(pila, 6);
agregar_pila(pila, 12);
return 0;
}
void agregar_pila(Nodo *&pila, int n){
Nodo *nuevo_nodo = new Nodo();
nuevo_nodo->dato = n;
nuevo_nodo->siguiente = pila;
pila = nuevo_nodo;
cout<<"Elemento "<<n<<" agregado correctamente a la pila"<<endl;
}
2
2 respuestas 2
Reset to default
1
TLDR: Si quitas ese &, el programa, aunque no de errores, dejará de funcionar correctamente, como demostraré luego.
Qué hace el &?
Hay que comenzar diciendo que el código es C++. No compilaría correctamente con un compilador de C. En C no se admite el poner un & como parte de la declaración de un parámetro.
En C++ el poner & delante de un parámetro indica que éste se pasa por referencia. Así pues, en tu función:
void agregar_pila(Nodo *&pila, int n){
...
}
el parámetro pila es de tipo "referencia a puntero a Nodo". Esto quiere decir que la variable que le vayas a pasar como parámetro ha de ser de tipo "puntero a nodo", pero la funcion lo que recibirá será una referencia al puntero que le pases.
Eso es lo que permite que dentro de la función, cuando haces:
pila = nuevo_nodo;
estés modificando la variable que habías recibido como parámetro, en vez de una copia de esa variable que sería lo que ocurriría si no fuera de tipo referencia.
En definitiva, cuando el programa principal llama a esa función por ejemplo aquí:
agregar_pila(pila, 6);
la variable pila de la función main() es pasada como referencia a agregar_pila(), por lo que la variable pila dentro de esa función alterará directamente la variable pila de main().
Como consecuencia, una vez que la función retorne, la variable pila de main() habrá cambiado de valor. Esto podemos verificarlo imprimiendo esa variable:
int main(){
Nodo *pila = NULL;
cout << pila << endl;
agregar_pila(pila, 6);
cout << pila << endl;
agregar_pila(pila, 12);
cout << pila << endl;
return 0;
}
Al ejecutarlo veremos:
0
Elemento 6 agregado correctamente a la pila
0x2383280
Elemento 12 agregado correctamente a la pila
0x23832a0
Como ves, cada vez que se llama a la función, la variable pila cambia de valor, como debe ser para apuntar al nuevo elemento insertado en la cabeza de la pila.
¿Y si no ponemos &?
Si no se pone & el programa compila y ejecuta sin errores, pero no funciona correctamente. Al no poner & la variable no se pasa por referencia, sino por copia. Esto implica que la variable pila de la función agregar_pila() es una variable independiente de la variable pila del programa principal.
Así cuando en la función haces pila=nuevo_nodo; estás modificando sólo la variable local de la función agregar_pila(), pero la variable pila de main() permanecerá inalterada.
En efecto, si pruebas a ejecutar el mismo experimento de antes pero quitando el & en el parámetro (no hace falta ni siquiera modificar main()), verás que ahora imprime:
0
Elemento 6 agregado correctamente a la pila
0
Elemento 12 agregado correctamente a la pila
0
O sea, la variable pila de main() sigue valiendo siempre NULL. Por ello, aunque el dato se inserta, no se actualiza el puntero a la cabeza de la cola, con lo que la implementación no es correcta.
Bonus: implementación en C (sin &)
Ya que C no tiene la posibilidad de marcar como "referencia" un parámetro ¿cómo se podría lograr esto mismo? (es decir, que la función modifique una variable que en realidad pertenece a main())
La solución es que en lugar de pasar el puntero pila a la función, le pasemos la dirección en que se halla el puntero pila, es decir &pila. De ese modo la función no recibiría ya un puntero a Nodo, sino la dirección de un puntero a Nodo, es decir, un puntero a puntero a Nodo. A través de esa dirección podrá modificar el puntero original.
La cosa sería entonces así:
#include<stdio.h>
struct Nodo{
int dato;
Nodo *siguiente;
};
void agregar_pila(Nodo **, int);
int main(){
Nodo *pila = NULL;
printf("%p\n", pila);
agregar_pila(&pila, 6);
printf("%p\n", pila);
agregar_pila(&pila, 12);
printf("%p\n", pila);
return 0;
}
void agregar_pila(Nodo **pila, int n){ // <--- Atención al doble asterisco
Nodo *nuevo_nodo = new Nodo();
nuevo_nodo->dato = n;
nuevo_nodo->siguiente = *pila; // <--- Atención al asterisco aqui
*pila = nuevo_nodo; // <--- y aquí
printf("Elemento %d agregado correctamente a la pila\n", n);
}
Y vemos al ejecutar que efectivamente la variable pila de main() resulta modificada como debe ser:
(nil)
Elemento 6 agregado correctamente a la pila
0x1761280
Elemento 12 agregado correctamente a la pila
0x17612a0
1
¿hay alguna diferencia entre usar * y *& ?
Para saber la diferencia entre puntero (*) y referencia (&) te conviene leer ¿Cual es la diferencia entre int * e int &?.
No logro entender bien es que en el prototipo de la función le estoy pasando el *&
Sabemos que el puntero es un asterisco (*) y referencia es un et (&), así que *& es una referencia a puntero. Si leíste el hilo que enlacé, sabrás que una referencia (&) a efectos prácticos es indistinguible del objeto al que referencian, y es por eso que si quitas el et (&) el código sigue funcionando.
Podemos comprobarlo con este código de ejemplo:
#define MUESTRA(X) std::cout << __FUNCTION__ << '\n' \
<< '\t' << "Typeid: " << typeid(X).name() << '\n' \
<< '\t' << "Valor: " << X << '\n' \
<< '\t' << "Direccion: " << &X << '\n' \
<< '\t' << "Apunta a: " << *X << '\n'
void puntero(int *p)
{
MUESTRA(p);
}
void referencia_puntero(int *&rp)
{
MUESTRA(rp);
}
int main(int argc, char **)
{
int *p = &argc;
MUESTRA(p);
puntero(p);
referencia_puntero(p);
return 0;
};
El código anterior genera una salida parecida a esta (he editado los valores de los punteros para mejor comprensión, en cada ejecución serán diferentes):
main
Typeid: Pi
Valor: 0x28
Direccion: 0x18
Apunta a: 1
puntero
Typeid: Pi
Valor: 0x28
Direccion: 0xe8
Apunta a: 1
referencia_puntero
Typeid: Pi
Valor: 0x28
Direccion: 0x18
Apunta a: 1
Vemos que el puntero p de main contiene la dirección 0x28 y está alojado en la dirección 0x18, cuando lo pasamos a la función puntero su contenido es el mismo que en main (0x28) pero es un puntero diferente porque su dirección ha variado (antes 0x18, ahora 0xe8); pero cuando lo pasamos a la función referencia_puntero tanto el valor como la dirección es la misma que en main, a efectos prácticos la referencia a puntero es indistinguible del puntero original (como cualquier referencia a otros datos).
Dado que tanto en formato referencia a puntero como en formato puntero, el contenido del puntero no varía (0x28) es "indiferente" usar puntero (*) o referencia a puntero (&*) para este caso concreto.
Tu Respuesta
Al pulsar en “Publica tu respuesta”, muestras tu consentimiento a nuestros términos de servicio, política de privacidad y política de cookies
¿No es la respuesta que buscas? Examina otras preguntas con la etiqueta o formula tu propia pregunta.
|
{
"url": "https://es.stackoverflow.com/questions/450523/por-que-si-cambio-por-solo-el-el-programa-sigue-funcionando",
"source_domain": "es.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "232023",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SQNMBPXAVY7NKZMDADVOE3AU7GCAUPWR",
"WARC-Concurrent-To": "<urn:uuid:89f9a339-849f-4f3c-8468-ff54248d1708>",
"WARC-Date": "2022-05-23T18:24:46Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ANIEHMU2FGUMHUGTKWSJV4PMRCY32UIF",
"WARC-Record-ID": "<urn:uuid:f067b45e-131e-410f-97fd-b2cb215d410c>",
"WARC-Target-URI": "https://es.stackoverflow.com/questions/450523/por-que-si-cambio-por-solo-el-el-programa-sigue-funcionando",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dfa44cf-dfc7-4ef1-882f-9f913249cb0b>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\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,
2,
3,
275,
276,
277,
296,
297,
310,
324,
345,
348,
349,
382,
383,
404,
405,
417,
418,
441,
446,
473,
501,
502,
516,
518,
519,
558,
593,
619,
653,
676,
677,
746,
748,
750,
751,
766,
767,
784,
786,
787,
903,
904,
919,
920,
1098,
1099,
1206,
1207,
1246,
1253,
1255,
1256,
1499,
1500,
1562,
1563,
1586,
1587,
1748,
1749,
1831,
1832,
1859,
1860,
2042,
2043,
2197,
2198,
2210,
2211,
2234,
2239,
2265,
2266,
2293,
2319,
2320,
2348,
2374,
2375,
2389,
2391,
2392,
2415,
2416,
2418,
2462,
2472,
2517,
2527,
2528,
2688,
2689,
2709,
2710,
3007,
3008,
3183,
3184,
3353,
3354,
3356,
3400,
3402,
3447,
3449,
3450,
3646,
3647,
3682,
3683,
3877,
3878,
4218,
4219,
4247,
4248,
4266,
4267,
4280,
4294,
4315,
4318,
4319,
4352,
4353,
4365,
4366,
4389,
4394,
4420,
4448,
4474,
4475,
4504,
4530,
4531,
4545,
4547,
4548,
4623,
4658,
4684,
4756,
4808,
4809,
4874,
4876,
4877,
4976,
4977,
4983,
5027,
5037,
5082,
5092,
5094,
5095,
5138,
5139,
5261,
5262,
5345,
5346,
5651,
5652,
5700,
5701,
5756,
5816,
5860,
5909,
5955,
5956,
5977,
5979,
5995,
5997,
5998,
6032,
6034,
6051,
6053,
6054,
6082,
6084,
6104,
6105,
6121,
6122,
6138,
6165,
6166,
6180,
6183,
6184,
6338,
6339,
6344,
6359,
6375,
6395,
6411,
6419,
6434,
6450,
6470,
6486,
6505,
6520,
6536,
6556,
6572,
6573,
7076,
7077,
7277,
7278,
7291,
7292,
7434,
7435
],
"line_end_idx": [
2,
3,
275,
276,
277,
296,
297,
310,
324,
345,
348,
349,
382,
383,
404,
405,
417,
418,
441,
446,
473,
501,
502,
516,
518,
519,
558,
593,
619,
653,
676,
677,
746,
748,
750,
751,
766,
767,
784,
786,
787,
903,
904,
919,
920,
1098,
1099,
1206,
1207,
1246,
1253,
1255,
1256,
1499,
1500,
1562,
1563,
1586,
1587,
1748,
1749,
1831,
1832,
1859,
1860,
2042,
2043,
2197,
2198,
2210,
2211,
2234,
2239,
2265,
2266,
2293,
2319,
2320,
2348,
2374,
2375,
2389,
2391,
2392,
2415,
2416,
2418,
2462,
2472,
2517,
2527,
2528,
2688,
2689,
2709,
2710,
3007,
3008,
3183,
3184,
3353,
3354,
3356,
3400,
3402,
3447,
3449,
3450,
3646,
3647,
3682,
3683,
3877,
3878,
4218,
4219,
4247,
4248,
4266,
4267,
4280,
4294,
4315,
4318,
4319,
4352,
4353,
4365,
4366,
4389,
4394,
4420,
4448,
4474,
4475,
4504,
4530,
4531,
4545,
4547,
4548,
4623,
4658,
4684,
4756,
4808,
4809,
4874,
4876,
4877,
4976,
4977,
4983,
5027,
5037,
5082,
5092,
5094,
5095,
5138,
5139,
5261,
5262,
5345,
5346,
5651,
5652,
5700,
5701,
5756,
5816,
5860,
5909,
5955,
5956,
5977,
5979,
5995,
5997,
5998,
6032,
6034,
6051,
6053,
6054,
6082,
6084,
6104,
6105,
6121,
6122,
6138,
6165,
6166,
6180,
6183,
6184,
6338,
6339,
6344,
6359,
6375,
6395,
6411,
6419,
6434,
6450,
6470,
6486,
6505,
6520,
6536,
6556,
6572,
6573,
7076,
7077,
7277,
7278,
7291,
7292,
7434,
7435,
7536
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7536,
"ccnet_original_nlines": 223,
"rps_doc_curly_bracket": 0.0029193200170993805,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10006414353847504,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01603592000901699,
"rps_doc_frac_lines_end_with_ellipsis": 0.004464290104806423,
"rps_doc_frac_no_alph_words": 0.2706863284111023,
"rps_doc_frac_unique_words": 0.31200000643730164,
"rps_doc_mean_word_length": 4.848888874053955,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.0025657499209046364,
"rps_doc_unigram_entropy": 5.072331428527832,
"rps_doc_word_count": 1125,
"rps_doc_frac_chars_dupe_10grams": 0.023831350728869438,
"rps_doc_frac_chars_dupe_5grams": 0.19890008866786957,
"rps_doc_frac_chars_dupe_6grams": 0.15087075531482697,
"rps_doc_frac_chars_dupe_7grams": 0.13143904507160187,
"rps_doc_frac_chars_dupe_8grams": 0.09129238873720169,
"rps_doc_frac_chars_dupe_9grams": 0.05682859942317009,
"rps_doc_frac_chars_top_2gram": 0.02566453069448471,
"rps_doc_frac_chars_top_3gram": 0.02566453069448471,
"rps_doc_frac_chars_top_4gram": 0.035197071731090546,
"rps_doc_books_importance": -564.83154296875,
"rps_doc_books_importance_length_correction": -564.83154296875,
"rps_doc_openwebtext_importance": -332.8181457519531,
"rps_doc_openwebtext_importance_length_correction": -332.8181457519531,
"rps_doc_wikipedia_importance": -225.47117614746094,
"rps_doc_wikipedia_importance_length_correction": -225.47117614746094
},
"fasttext": {
"dclm": 0.9202769994735718,
"english": 0.0013373700203374028,
"fineweb_edu_approx": 1.4142029285430908,
"eai_general_math": 0.011872709728777409,
"eai_open_web_math": 0.5488461256027222,
"eai_web_code": 0.8999704718589783
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,824,592,998,809,745,000 |
;;; eev-code.el -- `code-c-d', that generates and evaluates Lisp defuns.
;; Copyright (C) 2012 Free Software Foundation, Inc.
;;
;; This file is (not yet?) part of GNU eev.
;;
;; GNU eev 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, either version 3 of the License, or
;; (at your option) any later version.
;;
;; GNU eev 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 GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
;;
;; Author: Eduardo Ochs <[email protected]>
;; Maintainer: Eduardo Ochs <[email protected]>
;; Version: 2012nov08
;; Keywords: e-scripts
;;
;; Latest version: <http://angg.twu.net/eev-current/eev-code.el>
;; htmlized: <http://angg.twu.net/eev-current/eev-code.el.html>
;; See also: <http://angg.twu.net/eev-current/eev-readme.el.html>
;; <http://angg.twu.net/eev-intros/find-eev-intro.html>
;; <http://angg.twu.net/eev-intros/find-code-c-d-intro.html>
;; (find-eev-intro)
;; (find-code-c-d-intro)
;;; Commentary:
;; A simple and flexible implementation of argument lists.
;; Inspired by: (find-node "(cl)Argument Lists")
;; (find-node "(cl)Argument Lists" "&body")
;; See also: (find-elnode "Symbol Type" "`:'")
;; (find-elnode "Constant Variables")
;; The name "tail call" is misleading - this is recursive,
;; but not a tail call in the usual sense.
;;
(defun ee-tail-call (fmt rest)
"An internal function used to support keyword-argument pairs."
(cond ((null rest) "")
((keywordp (car rest))
(apply (intern (format fmt (car rest)))
(cdr rest)))
(t (error "Wrong rest: %S" rest))))
;;; _ _ _
;;; __ _| (_)___| |_ ___
;;; / _` | | / __| __/ __|
;;; | (_| | | \__ \ |_\__ \
;;; \__,_|_|_|___/\__|___/
;;;
(defun ee-aref (alist idx)
"Like `aref', but for alists.
Example: (ee-aref '((1 . one) (2 . two) (3 . three)) 2)
-> two"
(cdr (assoc idx alist)))
(defun ee-adel (alist idx)
"Like `remq', but for alists. This is non-destructive, so wrap it in a setq.
Example: (ee-adel '((1 . one) (2 . two) (3 . three)) 2)
-> ((1 . one) (3 . three))"
(remq (assoc idx alist) alist))
(defun ee-aset (alist idx newelt)
"Like `aset', but for alists. This is non-destructive, so wrap it in a setq.
Example: (ee-aset '((1 . one) (2 . two) (3 . three)) 2 'foo)
-> ((2 . foo) (1 . one) (3 . three))"
(cons (cons idx newelt) (ee-adel alist idx)))
(defun ee-areplace (alist idx newelt)
"Like `ee-aset', but keeping the order.
Examples: (ee-areplace '((1 . one) (2 . two) (3 . three)) 2 'foo)
-> ((1 . one) (2 . foo) (3 . three))
(ee-areplace '((1 . one) (2 . two) (3 . three)) 0 'zero)
-> ((0 . zero) (1 . one) (2 . two) (3 . three))"
(if (ee-aref alist idx)
(progn (setcdr (assoc idx alist) newelt)
alist)
(cons (cons idx newelt) alist)))
;;; _ _ _
;;; ___ ___ __| | ___ ___ __| | _ __ __ _(_)_ __ ___
;;; / __/ _ \ / _` |/ _ \_____ / __|____ / _` |_____| '_ \ / _` | | '__/ __|
;;; | (_| (_) | (_| | __/_____| (_|_____| (_| |_____| |_) | (_| | | | \__ \
;;; \___\___/ \__,_|\___| \___| \__,_| | .__/ \__,_|_|_| |___/
;;; |_|
;; Old: (find-evardescr 'code-c-d-keywords)
;; (find-evariable 'code-c-d-keywords)
(defvar ee-code-c-d-pairs nil
"Each (code-c-d C D) call generates an entry (C (ee-expand D)) here.
A new entry with the same C as a previous one will replace the
previous one. This list is maintained by `ee-code-c-d-add-pair' and
is used by some functions in \"eev-insert.el\".")
(defun ee-code-c-d-add-pair (c d)
(setq ee-code-c-d-pairs (ee-areplace ee-code-c-d-pairs c (list d))))
;;; _ _
;;; ___ ___ __| | ___ ___ __| |
;;; / __/ _ \ / _` |/ _ \_____ / __|____ / _` |
;;; | (_| (_) | (_| | __/_____| (_|_____| (_| |
;;; \___\___/ \__,_|\___| \___| \__,_|
;;;
;; See: (find-code-c-d-intro)
;; code-c-d: top-level functions
;;
(defun code-c-d (c d &rest rest)
(ee-code-c-d-add-pair c d)
(eval (ee-read (apply 'ee-code-c-d c d rest))))
(defun find-code-c-d (c d &rest rest)
(find-estring-elisp (apply 'ee-code-c-d c d rest)))
(defun ee-code-c-d (c d &rest rest)
(if (stringp (car rest))
(setq rest (cons :info rest)))
(concat (ee-code-c-d-base c d)
(ee-code-c-d-rest rest)))
;; Support for extra arguments
;;
(defun ee-code-c-d-rest (rest)
(ee-tail-call "ee-code-c-d-%S" rest))
(defun ee-code-c-d-base (c d)
(ee-template0 "
;; {(ee-S `(find-code-c-d ,c ,d ,@rest))}
;; {(ee-S `(ee-code-c-d-base ,c ,d))}
(setq ee-{c}dir \"{d}\")
(setq ee-{c}tagsfile \"{d}TAGS\")
(defun ee-{c}file (str)
(concat (ee-expand ee-{c}dir) str))
(defun ee-use-{c}-tags ()
(setq tags-file-name ee-{c}tagsfile))
(defun find-{c}file (str &rest pos-spec-list)
(interactive (list \"\"))
(ee-use-{c}-tags)
(apply 'find-fline (ee-{c}file str) pos-spec-list))
(defun find-{c}tag (str &rest pos-spec-list)
(ee-use-{c}-tags)
(apply 'ee-find-tag str pos-spec-list))
(defun find-{c}sh (command &rest pos-spec-list)
(apply 'ee-find-xxxsh ee-{c}dir command pos-spec-list))
(defun find-{c}sh0 (command)
(funcall 'ee-find-xxxsh0 ee-{c}dir command))
(defun find-{c}sh00 (command)
(funcall 'ee-find-xxxsh00 ee-{c}dir command))
(defun find-{c}w3m (furl &rest pos-spec-list)
(apply 'find-w3m (ee-{c}file furl) pos-spec-list))
(defun find-{c}grep (grep-command-args &rest pos-spec-list)
(apply 'ee-find-grep ee-{c}dir grep-command-args pos-spec-list))
"))
(defun ee-code-c-d-:info (info &rest rest)
(concat (ee-template0 "
;; {(ee-S `(ee-code-c-d-:info ,info ,@rest))}
(defun find-{c}node (page &rest pos-spec-list)
(interactive (list \"\"))
(setq ee-info-code \"{c}\") ;; for M-h M-i
(setq ee-info-file \"{info}\") ;; for M-h M-i
(apply 'find-node (format \"({info})%s\" page) pos-spec-list))
") (ee-code-c-d-rest rest)))
(defun ee-code-c-d-:linfo (manual &rest rest)
(concat (ee-template0 "
;; {(ee-S `(ee-code-c-d-:linfo ,manual ,@rest))}
(defun find-{c}node (section &rest pos-spec-list)
(interactive (list \"\"))
(apply 'ee-find-node ee-{c}dir \"{manual}\" section pos-spec-list))
") (ee-code-c-d-rest rest)))
(defun ee-code-c-d-:gz (&rest rest)
(concat (ee-template0 "
;; {(ee-S `(ee-code-c-d-:gz ,@rest))}
(defun find-{c}file (str &rest pos-spec-list)
(interactive (list \"\"))
(ee-use-{c}-tags)
(apply 'find-fline-gz (ee-{c}file str) pos-spec-list))
") (ee-code-c-d-rest rest)))
(defun ee-code-c-d-:anchor (&rest rest)
(concat (ee-template0 "
;; {(ee-S `(ee-code-c-d-:anchor ,@rest))}
(defun find-{c} (str &rest pos-spec-list)
(apply 'find-anchor (ee-{c}file str) pos-spec-list))
") (ee-code-c-d-rest rest)))
(defun ee-code-c-d-:wget (url &rest rest)
(concat (ee-template0 "
;; {(ee-S `(ee-code-c-d-:wget ,url ,@rest))}
(defun ee-{c}url (semiurl) (concat \"{url}\" semiurl))
(defun find-{c}wget (semiurl &rest pos-spec-list)
(interactive (list \"\"))
(apply 'find-wget (ee-{c}url semiurl) pos-spec-list))
") (ee-code-c-d-rest rest)))
(defun ee-code-c-d-:grep (&rest rest) (ee-code-c-d-rest rest)) ; compat
;; support functions
;;
(defun ee-find-node (dir manual page &rest pos-spec-list)
(apply 'find-node (format "(%s%s)%s" dir manual page) pos-spec-list))
(defun ee-find-grep (dir grep-command-args &rest pos-spec-list)
"Example: (ee-find-grep ee-eetcdir \"grep -niH -e tetris *\")
Note: the POS-SPEC-LIST arguments are currently not used."
(let ((default-directory (ee-expand (or dir default-directory))))
(grep grep-command-args)))
;; a test
;; (find-estring-elisp (ee-code-c-d-base "@@@" "!!!"))
;; (find-estring-elisp (ee-code-c-d "CCC" "DDD"))
;;; _ _
;;; ___ ___ __| | ___ ___ __| |___
;;; / __/ _ \ / _` |/ _ \_____ / __|____ / _` / __|
;;; | (_| (_) | (_| | __/_____| (_|_____| (_| \__ \
;;; \___\___/ \__,_|\___| \___| \__,_|___/
;;;
;; Some default `code-c-d's (debian-centric)
(defun ee-locate-library (fname)
(if (locate-library fname)
(file-name-directory (locate-library fname))))
(defvar ee-emacs-lisp-directory
(or (ee-locate-library "loadup.el")
(format "/usr/share/emacs/%d.%d/lisp/"
emacs-major-version emacs-minor-version)))
(defvar ee-emacs-leim-directory
(or (ee-locate-library "leim-list.el")
(format "/usr/share/emacs/%d.%d/leim/"
emacs-major-version emacs-minor-version)))
(code-c-d "e" ee-emacs-lisp-directory "emacs" :gz) ; (find-enode "Top")
(code-c-d "el" ee-emacs-lisp-directory "elisp" :gz) ; (find-elnode "Top")
(code-c-d "eli" ee-emacs-lisp-directory "eintr" :gz) ; (find-elinode "Top")
(code-c-d "eleim" ee-emacs-leim-directory :gz)
(code-c-d "equail" (ee-eleimfile "quail/") :gz)
(code-c-d "eetc" data-directory :gz)
(code-c-d "eev" (ee-locate-library "eev-code.el") :anchor) ; (find-eev "")
;; (find-efile "")
;; (find-equailfile "")
;; (find-equailfile "latin-ltx.el")
(code-c-d "ud" "/usr/share/doc/" :gz) ; (find-udfile "bash/")
(code-c-d "vldi" "/var/lib/dpkg/info/") ; (find-vldifile "bash.list")
(provide 'eev-code)
;; Local Variables:
;; coding: raw-text-unix
;; ee-anchor-format: "\253%s\273"
;; ee-anchor-format: "defun %s "
;; no-byte-compile: t
;; End:
|
{
"url": "http://angg.twu.net/eev-current/eev-code.el.html",
"source_domain": "angg.twu.net",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "23900",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KJTQHZYYHINSTGKY64J5DOQNC2TUEYVA",
"WARC-Concurrent-To": "<urn:uuid:4d094818-fe2d-423b-acb4-d4ca0411ab88>",
"WARC-Date": "2018-10-20T02:58:15Z",
"WARC-IP-Address": "192.129.162.2",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SNO3YYXWYLA5HTFOZOE4E64KWTUVO2HC",
"WARC-Record-ID": "<urn:uuid:9e954a7b-704b-4142-b65a-320f0d7553b8>",
"WARC-Target-URI": "http://angg.twu.net/eev-current/eev-code.el.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e6ddc4b6-b14b-4075-9ca1-7e97bc42a7c2>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-51-147-142.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,
73,
74,
127,
130,
174,
177,
244,
316,
385,
424,
427,
489,
555,
620,
668,
671,
740,
810,
813,
865,
917,
942,
967,
970,
1035,
1105,
1177,
1249,
1326,
1393,
1465,
1466,
1482,
1483,
1484,
1485,
1486,
1545,
1594,
1651,
1701,
1752,
1811,
1854,
1857,
1888,
1953,
1978,
2009,
2058,
2087,
2131,
2132,
2133,
2134,
2162,
2190,
2218,
2246,
2274,
2302,
2303,
2330,
2362,
2418,
2458,
2485,
2486,
2513,
2592,
2648,
2702,
2736,
2737,
2771,
2850,
2911,
2965,
3013,
3014,
3052,
3094,
3160,
3218,
3285,
3344,
3370,
3417,
3437,
3474,
3475,
3553,
3631,
3709,
3787,
3865,
3943,
3987,
4031,
4032,
4062,
4133,
4196,
4264,
4314,
4315,
4349,
4420,
4421,
4422,
4423,
4424,
4425,
4474,
4523,
4572,
4621,
4670,
4719,
4749,
4750,
4783,
4786,
4824,
4853,
4903,
4941,
4995,
5033,
5060,
5097,
5130,
5166,
5167,
5198,
5201,
5232,
5272,
5273,
5303,
5321,
5367,
5409,
5437,
5474,
5501,
5542,
5571,
5614,
5663,
5694,
5717,
5774,
5822,
5845,
5890,
5941,
6002,
6034,
6084,
6117,
6168,
6217,
6273,
6336,
6406,
6413,
6414,
6457,
6483,
6533,
6583,
6614,
6665,
6719,
6787,
6819,
6820,
6866,
6892,
6945,
6998,
7029,
7102,
7134,
7135,
7171,
7196,
7238,
7287,
7318,
7341,
7401,
7433,
7434,
7474,
7499,
7545,
7590,
7648,
7680,
7681,
7723,
7748,
7797,
7855,
7908,
7939,
7998,
8030,
8031,
8104,
8105,
8126,
8129,
8187,
8259,
8260,
8324,
8388,
8447,
8515,
8546,
8547,
8548,
8558,
8613,
8663,
8664,
8665,
8666,
8719,
8772,
8825,
8878,
8931,
8984,
9029,
9030,
9063,
9092,
9145,
9177,
9215,
9260,
9317,
9349,
9390,
9435,
9492,
9493,
9572,
9651,
9730,
9778,
9826,
9865,
9866,
9944,
9945,
9964,
9988,
10024,
10025,
10090,
10161,
10162,
10163,
10164,
10184,
10185,
10186,
10187,
10188,
10208,
10244,
10279,
10313,
10337
],
"line_end_idx": [
73,
74,
127,
130,
174,
177,
244,
316,
385,
424,
427,
489,
555,
620,
668,
671,
740,
810,
813,
865,
917,
942,
967,
970,
1035,
1105,
1177,
1249,
1326,
1393,
1465,
1466,
1482,
1483,
1484,
1485,
1486,
1545,
1594,
1651,
1701,
1752,
1811,
1854,
1857,
1888,
1953,
1978,
2009,
2058,
2087,
2131,
2132,
2133,
2134,
2162,
2190,
2218,
2246,
2274,
2302,
2303,
2330,
2362,
2418,
2458,
2485,
2486,
2513,
2592,
2648,
2702,
2736,
2737,
2771,
2850,
2911,
2965,
3013,
3014,
3052,
3094,
3160,
3218,
3285,
3344,
3370,
3417,
3437,
3474,
3475,
3553,
3631,
3709,
3787,
3865,
3943,
3987,
4031,
4032,
4062,
4133,
4196,
4264,
4314,
4315,
4349,
4420,
4421,
4422,
4423,
4424,
4425,
4474,
4523,
4572,
4621,
4670,
4719,
4749,
4750,
4783,
4786,
4824,
4853,
4903,
4941,
4995,
5033,
5060,
5097,
5130,
5166,
5167,
5198,
5201,
5232,
5272,
5273,
5303,
5321,
5367,
5409,
5437,
5474,
5501,
5542,
5571,
5614,
5663,
5694,
5717,
5774,
5822,
5845,
5890,
5941,
6002,
6034,
6084,
6117,
6168,
6217,
6273,
6336,
6406,
6413,
6414,
6457,
6483,
6533,
6583,
6614,
6665,
6719,
6787,
6819,
6820,
6866,
6892,
6945,
6998,
7029,
7102,
7134,
7135,
7171,
7196,
7238,
7287,
7318,
7341,
7401,
7433,
7434,
7474,
7499,
7545,
7590,
7648,
7680,
7681,
7723,
7748,
7797,
7855,
7908,
7939,
7998,
8030,
8031,
8104,
8105,
8126,
8129,
8187,
8259,
8260,
8324,
8388,
8447,
8515,
8546,
8547,
8548,
8558,
8613,
8663,
8664,
8665,
8666,
8719,
8772,
8825,
8878,
8931,
8984,
9029,
9030,
9063,
9092,
9145,
9177,
9215,
9260,
9317,
9349,
9390,
9435,
9492,
9493,
9572,
9651,
9730,
9778,
9826,
9865,
9866,
9944,
9945,
9964,
9988,
10024,
10025,
10090,
10161,
10162,
10163,
10164,
10184,
10185,
10186,
10187,
10188,
10208,
10244,
10279,
10313,
10337,
10344
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10344,
"ccnet_original_nlines": 279,
"rps_doc_curly_bracket": 0.008894040249288082,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10951638221740723,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013416539877653122,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5566302537918091,
"rps_doc_frac_unique_words": 0.36193618178367615,
"rps_doc_mean_word_length": 6.002200126647949,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.227831840515137,
"rps_doc_word_count": 909,
"rps_doc_frac_chars_dupe_10grams": 0.01979471929371357,
"rps_doc_frac_chars_dupe_5grams": 0.1411290317773819,
"rps_doc_frac_chars_dupe_6grams": 0.09787389636039734,
"rps_doc_frac_chars_dupe_7grams": 0.060850441455841064,
"rps_doc_frac_chars_dupe_8grams": 0.0491202287375927,
"rps_doc_frac_chars_dupe_9grams": 0.042521990835666656,
"rps_doc_frac_chars_top_2gram": 0.02309384010732174,
"rps_doc_frac_chars_top_3gram": 0.006414960138499737,
"rps_doc_frac_chars_top_4gram": 0.00879765022546053,
"rps_doc_books_importance": -1669.2889404296875,
"rps_doc_books_importance_length_correction": -1669.2889404296875,
"rps_doc_openwebtext_importance": -865.5765380859375,
"rps_doc_openwebtext_importance_length_correction": -865.5765380859375,
"rps_doc_wikipedia_importance": -502.4718017578125,
"rps_doc_wikipedia_importance_length_correction": -502.4718017578125
},
"fasttext": {
"dclm": 0.5287207961082458,
"english": 0.5205336809158325,
"fineweb_edu_approx": 1.311294436454773,
"eai_general_math": 0.20642393827438354,
"eai_open_web_math": 0.4794570207595825,
"eai_web_code": 0.8703227043151855
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,371,441,197,907,467,000 |
tag:blogger.com,1999:blog-4169710303065679169.post7150258375410952616..comments2015-12-01T02:18:18.434-08:00Comments on A Wider View : BLOG HAS MOVED *<a href="http://blog.orapub.com">HERE</a>*: Understanding Oracle DB User CallsCraig Shallahamer, President/Founder, OraPubhttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-4169710303065679169.post-25669115433837479322012-06-20T01:43:37.504-07:002012-06-20T01:43:37.504-07:00Hi Craig You are so right. Sometimes it just helps...Hi Craig<br />You are so right. Sometimes it just helps to know what you're talking about. "User Calls", among som many other things, sounds so obvious and self explanatory. But if you ask Oracle DBAs, most of them will probably stumble in their answer.<br /><br />Great post! Hope to see you in San Fransisco. You still owe me that coffee :-)<br /><br />Regards Lasse Jenssen, NorwayL. Jenssenhttp://www.blogger.com/profile/[email protected]
|
{
"url": "http://shallahamer-orapub.blogspot.com/feeds/7150258375410952616/comments/default",
"source_domain": "shallahamer-orapub.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "4135",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WE2NKA7XUPTTDQGMZTZH7F4JKXNGGRHW",
"WARC-Concurrent-To": "<urn:uuid:19f7a970-d273-477e-a3c7-7003e7875d76>",
"WARC-Date": "2015-12-02T05:06:14Z",
"WARC-IP-Address": "216.58.217.129",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7HXVYUV54ZNCZT7G36HZOXSE7YRXLPYQ",
"WARC-Record-ID": "<urn:uuid:607d2fae-52a2-489c-80b9-0776fdf0afc9>",
"WARC-Target-URI": "http://shallahamer-orapub.blogspot.com/feeds/7150258375410952616/comments/default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e4194210-eebd-4aaa-a274-0254cbdcdf52>"
},
"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": [
1014
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1014,
"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.19834710657596588,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03719007968902588,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44628098607063293,
"rps_doc_frac_unique_words": 0.8172042965888977,
"rps_doc_mean_word_length": 8.666666984558105,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.008264459669589996,
"rps_doc_unigram_entropy": 4.241034984588623,
"rps_doc_word_count": 93,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06947890669107437,
"rps_doc_frac_chars_dupe_6grams": 0.06947890669107437,
"rps_doc_frac_chars_dupe_7grams": 0.06947890669107437,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014888339675962925,
"rps_doc_frac_chars_top_3gram": 0.019851120188832283,
"rps_doc_frac_chars_top_4gram": 0.032258059829473495,
"rps_doc_books_importance": -80.1302719116211,
"rps_doc_books_importance_length_correction": -80.1302719116211,
"rps_doc_openwebtext_importance": -40.894386291503906,
"rps_doc_openwebtext_importance_length_correction": -27.002222061157227,
"rps_doc_wikipedia_importance": -15.88132095336914,
"rps_doc_wikipedia_importance_length_correction": -15.88132095336914
},
"fasttext": {
"dclm": 0.49989157915115356,
"english": 0.6713828444480896,
"fineweb_edu_approx": 1.365035057067871,
"eai_general_math": 0.0015149699756875634,
"eai_open_web_math": 0.6495383381843567,
"eai_web_code": 0.0011965000303462148
}
}
|
{
"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": "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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,374,153,212,164,139,000 |
Export (0) Print
Expand All
SocketPermission Class
Controls rights to make or accept connections on a transport address.
Namespace: System.Net
Assembly: System (in system.dll)
'Declaration
<SerializableAttribute> _
Public NotInheritable Class SocketPermission
Inherits CodeAccessPermission
Implements IUnrestrictedPermission
'Usage
Dim instance As SocketPermission
/** @attribute SerializableAttribute() */
public final class SocketPermission extends CodeAccessPermission implements IUnrestrictedPermission
SerializableAttribute
public final class SocketPermission extends CodeAccessPermission implements IUnrestrictedPermission
Not applicable.
SocketPermission instances control permission to accept connections or initiate Socket connections. A Socket permission can be established for a host name or IP address, a port number, and a transport protocol.
NoteNote:
Avoid creating socket permissions using host names, as these names have to be resolved to IP addresses, and this might block the stack.
The following example demonstrates how to use the SocketPermission class to set, change, and enforce various socket access restrictions.
' Creates a SocketPermission restricting access to and from all URIs.
Dim mySocketPermission1 As New SocketPermission(PermissionState.None)
' The socket to which this permission will apply will allow connections from www.contoso.com.
mySocketPermission1.AddPermission(NetworkAccess.Accept, TransportType.Tcp, "www.contoso.com", 11000)
' Creates a SocketPermission which will allow the target Socket to connect with www.southridgevideo.com.
Dim mySocketPermission2 As New SocketPermission(NetworkAccess.Connect, TransportType.Tcp, "www.southridgevideo.com", 11002)
' Creates a SocketPermission from the union of two SocketPermissions.
Dim mySocketPermissionUnion As SocketPermission = CType(mySocketPermission1.Union(mySocketPermission2), SocketPermission)
' Checks to see if the union was successfully created by using the IsSubsetOf method.
If mySocketPermission1.IsSubsetOf(mySocketPermissionUnion) And mySocketPermission2.IsSubsetOf(mySocketPermissionUnion) Then
Console.WriteLine("This union contains permissions from both mySocketPermission1 and mySocketPermission2")
' Prints the allowable accept URIs to the console.
Console.WriteLine("This union accepts connections on :")
Dim myEnumerator As IEnumerator = mySocketPermissionUnion.AcceptList
While myEnumerator.MoveNext()
Console.WriteLine(CType(myEnumerator.Current, EndpointPermission).ToString())
End While
Console.WriteLine("This union establishes connections on : ")
' Prints the allowable connect URIs to the console.
Console.WriteLine("This union permits connections to :")
myEnumerator = mySocketPermissionUnion.ConnectList
While myEnumerator.MoveNext()
Console.WriteLine(CType(myEnumerator.Current, EndpointPermission).ToString())
End While
End If
' Creates a SocketPermission from the intersect of two SocketPermissions.
Dim mySocketPermissionIntersect As SocketPermission = CType(mySocketPermission1.Intersect(mySocketPermissionUnion), SocketPermission)
' mySocketPermissionIntersect should now contain the permissions of mySocketPermission1.
If mySocketPermission1.IsSubsetOf(mySocketPermissionIntersect) Then
Console.WriteLine("This is expected")
End If
' mySocketPermissionIntersect should not contain the permissios of mySocketPermission2.
If mySocketPermission2.IsSubsetOf(mySocketPermissionIntersect) Then
Console.WriteLine("This should not print")
End If
' Creates a copy of the intersect SocketPermission.
Dim mySocketPermissionIntersectCopy As SocketPermission = CType(mySocketPermissionIntersect.Copy(), SocketPermission)
If mySocketPermissionIntersectCopy.Equals(mySocketPermissionIntersect) Then
Console.WriteLine("Copy successfull")
End If
' Converts a SocketPermission to XML format and then immediately converts it back to a SocketPermission.
mySocketPermission1.FromXml(mySocketPermission1.ToXml())
' Checks to see if permission for this socket resource is unrestricted. If it is, then there is no need to
' demand that permissions be enforced.
If mySocketPermissionUnion.IsUnrestricted() Then
'Do nothing. There are no restrictions.
Else
' Enforces the permissions found in mySocketPermissionUnion on any Socket Resources used below this statement.
mySocketPermissionUnion.Demand()
End If
Dim myIpHostEntry As IPHostEntry = Dns.Resolve("www.contoso.com")
Dim myLocalEndPoint As New IPEndPoint(myIpHostEntry.AddressList(0), 11000)
Dim s As New Socket(myLocalEndPoint.Address.AddressFamily, SocketType.Stream, ProtocolType.Tcp)
Try
s.Connect(myLocalEndPoint)
Catch e As Exception
Console.WriteLine(("Exception Thrown: " + e.ToString()))
End Try
' Perform all socket operations in here.
s.Close()
End Sub 'MySocketPermission
// Creates a SocketPermission restricting access to and from all URIs.
SocketPermission mySocketPermission1
= new SocketPermission(PermissionState.None);
// The socket to which this permission will apply will allow
// connections from www.contoso.com.
mySocketPermission1.AddPermission(NetworkAccess.Accept,
TransportType.Tcp, "www.contoso.com", 11000);
// Creates a SocketPermission which will allow the target Socket to
// connect with www.southridgevideo.com.
SocketPermission mySocketPermission2
= new SocketPermission(NetworkAccess.Connect,
TransportType.Tcp, "www.southridgevideo.com", 11002);
// Creates a SocketPermission from the union of two SocketPermissions.
SocketPermission mySocketPermissionUnion
= (SocketPermission)mySocketPermission1.Union(mySocketPermission2);
// Checks to see if the union was successfully created by using the
// IsSubsetOf method.
if (mySocketPermission1.IsSubsetOf(mySocketPermissionUnion)
&& mySocketPermission2.IsSubsetOf(mySocketPermissionUnion)) {
Console.WriteLine("This union contains permissions from both " + "mySocketPermission1 and mySocketPermission2");
// Prints the allowable accept URIs to the console.
Console.WriteLine("This union accepts connections on :");
IEnumerator myEnumerator = mySocketPermissionUnion.
get_AcceptList();
while (myEnumerator.MoveNext()) {
Console.WriteLine(((EndpointPermission)myEnumerator.
get_Current()).ToString());
}
// Prints the allowable connect URIs to the console.
Console.WriteLine("This union permits connections to :");
myEnumerator = mySocketPermissionUnion.get_ConnectList();
while (myEnumerator.MoveNext()) {
Console.WriteLine(((EndpointPermission)myEnumerator.
get_Current()).ToString());
}
}
// Creates a SocketPermission from the intersect of two
// SocketPermissions.
SocketPermission mySocketPermissionIntersect
= (SocketPermission)mySocketPermission1.
Intersect(mySocketPermissionUnion);
// mySocketPermissionIntersect should now contain the permissions of // mySocketPermission1.
if (mySocketPermission1.IsSubsetOf(mySocketPermissionIntersect)) {
Console.WriteLine("This is expected");
}
// mySocketPermissionIntersect should not contain the permissios of // mySocketPermission2.
if (mySocketPermission2.IsSubsetOf(mySocketPermissionIntersect)) {
Console.WriteLine("This should not print");
}
// Creates a copy of the intersect SocketPermission.
SocketPermission mySocketPermissionIntersectCopy
= (SocketPermission)mySocketPermissionIntersect.Copy();
if (mySocketPermissionIntersectCopy.
Equals(mySocketPermissionIntersect)) {
Console.WriteLine("Copy successfull");
}
// Converts a SocketPermission to XML format and then immediately
// converts it back to a SocketPermission.
mySocketPermission1.FromXml(mySocketPermission1.ToXml());
// Checks to see if permission for this socket resource is
// unrestricted. If it is, then there is no need to
// demand that permissions be enforced.
if (mySocketPermissionUnion.IsUnrestricted()) {
//Do nothing. There are no restrictions.
}
else {
// Enforces the permissions found in mySocketPermissionUnion on
// any Socket Resources used below this statement.
mySocketPermissionUnion.Demand();
}
IPHostEntry myIpHostEntry = Dns.Resolve("www.contoso.com");
IPEndPoint myLocalEndPoint = new IPEndPoint(myIpHostEntry.
get_AddressList()[0], 11000);
Socket s = new Socket(myLocalEndPoint.get_Address().
get_AddressFamily(), SocketType.Stream, ProtocolType.Tcp);
try {
s.Connect(myLocalEndPoint);
}
catch (System.Exception e) {
Console.WriteLine("Exception Thrown: " + e.ToString());
}
// Perform all socket operations in here.
s.Close();
Any public static (Shared in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.
Windows 98, Windows Server 2000 SP4, Windows Millennium Edition, Windows Server 2003, Windows XP Media Center Edition, Windows XP Professional x64 Edition, Windows XP SP2, Windows XP Starter Edition
The Microsoft .NET Framework 3.0 is supported on Windows Vista, Microsoft Windows XP SP2, and Windows Server 2003 SP1.
.NET Framework
Supported in: 3.0, 2.0, 1.1, 1.0
Community Additions
ADD
Show:
© 2014 Microsoft
|
{
"url": "http://msdn.microsoft.com/en-us/library/f6k7w4t4(v=vs.85).aspx?cs-save-lang=1&cs-lang=vb",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "59983",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNRAVXIWMTOWQITP7F3BKP3RZJY3M5QE",
"WARC-Concurrent-To": "<urn:uuid:fe6255c6-5cab-4061-99ab-4b51edf441a6>",
"WARC-Date": "2014-10-01T01:18:19Z",
"WARC-IP-Address": "157.56.148.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ICMBJ2HWV7LMOUMM3V2EU6ICQSJG7QH3",
"WARC-Record-ID": "<urn:uuid:4db556da-18fe-45d5-bdba-0569a4e4a950>",
"WARC-Target-URI": "http://msdn.microsoft.com/en-us/library/f6k7w4t4(v=vs.85).aspx?cs-save-lang=1&cs-lang=vb",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:91e18498-b910-4d6c-828f-005d8447a31f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
17,
28,
29,
52,
53,
123,
124,
146,
179,
180,
193,
219,
264,
295,
331,
338,
371,
372,
415,
515,
538,
638,
654,
655,
866,
867,
877,
878,
1014,
1015,
1152,
1153,
1226,
1299,
1303,
1400,
1504,
1508,
1616,
1743,
1747,
1820,
1945,
1949,
2038,
2165,
2278,
2285,
2342,
2405,
2412,
2487,
2523,
2610,
2626,
2633,
2701,
2708,
2766,
2829,
2836,
2893,
2929,
3016,
3032,
3043,
3120,
3257,
3261,
3353,
3424,
3468,
3478,
3569,
3640,
3689,
3699,
3703,
3758,
3879,
3883,
3962,
4006,
4016,
4124,
4184,
4188,
4192,
4303,
4345,
4397,
4401,
4445,
4453,
4571,
4610,
4620,
4624,
4693,
4771,
4775,
4874,
4881,
4914,
4938,
5001,
5012,
5016,
5060,
5073,
5101,
5102,
5173,
5211,
5261,
5323,
5360,
5417,
5467,
5536,
5577,
5615,
5666,
5724,
5795,
5837,
5909,
5978,
6000,
6061,
6127,
6276,
6332,
6394,
6395,
6451,
6477,
6515,
6576,
6616,
6622,
6679,
6741,
6742,
6804,
6842,
6903,
6943,
6949,
6951,
6952,
7009,
7031,
7077,
7122,
7162,
7277,
7344,
7387,
7389,
7504,
7571,
7619,
7621,
7622,
7675,
7725,
7785,
7786,
7823,
7866,
7909,
7911,
7912,
7979,
8022,
8080,
8140,
8193,
8233,
8281,
8327,
8329,
8336,
8405,
8461,
8499,
8501,
8502,
8562,
8621,
8655,
8656,
8709,
8772,
8778,
8810,
8812,
8841,
8901,
8903,
8945,
8956,
8957,
9097,
9098,
9297,
9298,
9417,
9418,
9433,
9434,
9467,
9468,
9488,
9489,
9493,
9499
],
"line_end_idx": [
17,
28,
29,
52,
53,
123,
124,
146,
179,
180,
193,
219,
264,
295,
331,
338,
371,
372,
415,
515,
538,
638,
654,
655,
866,
867,
877,
878,
1014,
1015,
1152,
1153,
1226,
1299,
1303,
1400,
1504,
1508,
1616,
1743,
1747,
1820,
1945,
1949,
2038,
2165,
2278,
2285,
2342,
2405,
2412,
2487,
2523,
2610,
2626,
2633,
2701,
2708,
2766,
2829,
2836,
2893,
2929,
3016,
3032,
3043,
3120,
3257,
3261,
3353,
3424,
3468,
3478,
3569,
3640,
3689,
3699,
3703,
3758,
3879,
3883,
3962,
4006,
4016,
4124,
4184,
4188,
4192,
4303,
4345,
4397,
4401,
4445,
4453,
4571,
4610,
4620,
4624,
4693,
4771,
4775,
4874,
4881,
4914,
4938,
5001,
5012,
5016,
5060,
5073,
5101,
5102,
5173,
5211,
5261,
5323,
5360,
5417,
5467,
5536,
5577,
5615,
5666,
5724,
5795,
5837,
5909,
5978,
6000,
6061,
6127,
6276,
6332,
6394,
6395,
6451,
6477,
6515,
6576,
6616,
6622,
6679,
6741,
6742,
6804,
6842,
6903,
6943,
6949,
6951,
6952,
7009,
7031,
7077,
7122,
7162,
7277,
7344,
7387,
7389,
7504,
7571,
7619,
7621,
7622,
7675,
7725,
7785,
7786,
7823,
7866,
7909,
7911,
7912,
7979,
8022,
8080,
8140,
8193,
8233,
8281,
8327,
8329,
8336,
8405,
8461,
8499,
8501,
8502,
8562,
8621,
8655,
8656,
8709,
8772,
8778,
8810,
8812,
8841,
8901,
8903,
8945,
8956,
8957,
9097,
9098,
9297,
9298,
9417,
9418,
9433,
9434,
9467,
9468,
9488,
9489,
9493,
9499,
9515
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9515,
"ccnet_original_nlines": 218,
"rps_doc_curly_bracket": 0.0021019401028752327,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19545766711235046,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01169992983341217,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33241569995880127,
"rps_doc_frac_unique_words": 0.3203883469104767,
"rps_doc_mean_word_length": 8.902913093566895,
"rps_doc_num_sentences": 164,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.100564002990723,
"rps_doc_word_count": 824,
"rps_doc_frac_chars_dupe_10grams": 0.43620502948760986,
"rps_doc_frac_chars_dupe_5grams": 0.5496183037757874,
"rps_doc_frac_chars_dupe_6grams": 0.532715380191803,
"rps_doc_frac_chars_dupe_7grams": 0.5057252049446106,
"rps_doc_frac_chars_dupe_8grams": 0.48391494154930115,
"rps_doc_frac_chars_dupe_9grams": 0.48391494154930115,
"rps_doc_frac_chars_top_2gram": 0.027808070182800293,
"rps_doc_frac_chars_top_3gram": 0.026172300800681114,
"rps_doc_frac_chars_top_4gram": 0.015267180278897285,
"rps_doc_books_importance": -627.980224609375,
"rps_doc_books_importance_length_correction": -627.980224609375,
"rps_doc_openwebtext_importance": -384.02703857421875,
"rps_doc_openwebtext_importance_length_correction": -384.02703857421875,
"rps_doc_wikipedia_importance": -368.13092041015625,
"rps_doc_wikipedia_importance_length_correction": -368.13092041015625
},
"fasttext": {
"dclm": 0.033511821180582047,
"english": 0.5651862621307373,
"fineweb_edu_approx": 2.4559242725372314,
"eai_general_math": 0.5145060420036316,
"eai_open_web_math": 0.12306743860244751,
"eai_web_code": 0.5937895774841309
}
}
|
{
"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": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,086,444,819,621,149,700 |
AnteriorPosterior
8. Cálculos con fechas
Por: MysQL Hispano, 2006
Actualizado: 27-04-2019 15:46
Tiempo de lectura estimado: 9 min.
MySQL (MySQL Hispano)
8. Cálculos con fechas
MySQL proporciona diversas funciones que se pueden usar para efectuar cálculos sobre fechas, por ejemplo, para calcular edades o extraer partes de una fecha (día, mes, año, etc).
Para determinar la edad de cada una de nuestras mascotas, tenemos que calcular la diferencia de años de la fecha actual y la fecha de nacimiento, y entonces substraer uno si la fecha actual ocurre antes en el calendario que la fecha de nacimiento. Las siguientes consultas muestran la fecha actual, la fecha de nacimiento y la edad para cada mascota.
mysql> SELECT nombre, nacimiento, CURRENT_DATE,
-> (YEAR(CURRENT_DATE) - YEAR(nacimiento))
-> - (RIGHT(CURRENT_DATE,5) < RIGHT(nacimiento,5)) AS edad FROM mascotas;
+--------+------------+--------------+------+
| nombre | nacimiento | CURRENT_DATE | edad |
+--------+------------+--------------+------+
| Fluffy | 1999-02-04 | 2002-12-23 | 3 |
| Mau | 1998-03-17 | 2002-12-23 | 4 |
| Buffy | 1999-05-13 | 2002-12-23 | 3 |
| FanFan | 2000-08-27 | 2002-12-23 | 2 |
| Kaiser | 1989-08-31 | 2002-12-23 | 13 |
| Chispa | 1998-09-11 | 2002-12-23 | 4 |
| Wicho | 2000-02-09 | 2002-12-23 | 2 |
| Skim | 2001-04-29 | 2002-12-23 | 1 |
| Pelusa | 2000-03-30 | 2002-12-23 | 2 |
+--------+------------+--------------+------+
9 rows in set (0.01 sec)
Aquí, YEAR() obtiene únicamente el año y RIGHT() obtiene los cinco caracteres más a la derecha de cada una de las fechas, que representan el mes y el día (MM-DD). La parte de la expresión que compara los valores MM-DD se evalúa a 1 o 0, y permite ajustar el valor de la edad en el caso de que el valor MM-DD de la fecha actual ocurra antes del valor MM-DD de la fecha de nacimiento.
Dado que la expresión en sí es bastante fea, se ha usado un alias (edad) que es el que aparece como etiqueta en la columna que muestra el resultado de la consulta.
Esta consulta debe trabajar bien, pero el resultado puede ser de alguna manera más útil si las filas son presentadas en algún orden. Para ello haremos uso de la cláusula ORDER BY.
Por ejemplo, para ordenar por nombre, usaremos la siguiente consulta:
mysql> SELECT nombre, nacimiento, CURRENT_DATE,
-> (YEAR(CURRENT_DATE) - YEAR(nacimiento))
-> - (RIGHT(CURRENT_DATE,5) < RIGHT(nacimiento,5))
-> AS edad FROM mascotas ORDER BY nombre;
+--------+------------+--------------+------+
| nombre | nacimiento | CURRENT_DATE | edad |
+--------+------------+--------------+------+
| Buffy | 1999-05-13 | 2002-12-23 | 3 |
| Chispa | 1998-09-11 | 2002-12-23 | 4 |
| FanFan | 2000-08-27 | 2002-12-23 | 2 |
| Fluffy | 1999-02-04 | 2002-12-23 | 3 |
| Kaiser | 1989-08-31 | 2002-12-23 | 13 |
| Mau | 1998-03-17 | 2002-12-23 | 4 |
| Pelusa | 2000-03-30 | 2002-12-23 | 2 |
| Skim | 2001-04-29 | 2002-12-23 | 1 |
| Wicho | 2000-02-09 | 2002-12-23 | 2 |
+--------+------------+--------------+------+
9 rows in set (0.00 sec)
Para ordenar por edad en lugar de nombre, únicamente tenemos que usar una cláusula ORDER BY diferente:
mysql> SELECT nombre, nacimiento, CURRENT_DATE,
-> (YEAR(CURRENT_DATE) - YEAR(nacimiento))
-> - (RIGHT(CURRENT_DATE,5) < RIGHT(nacimiento,5))
-> AS edad FROM mascotas ORDER BY edad;
+--------+------------+--------------+------+
| nombre | nacimiento | CURRENT_DATE | edad |
+--------+------------+--------------+------+
| Skim | 2001-04-29 | 2002-12-23 | 1 |
| FanFan | 2000-08-27 | 2002-12-23 | 2 |
| Wicho | 2000-02-09 | 2002-12-23 | 2 |
| Pelusa | 2000-03-30 | 2002-12-23 | 2 |
| Fluffy | 1999-02-04 | 2002-12-23 | 3 |
| Buffy | 1999-05-13 | 2002-12-23 | 3 |
| Mau | 1998-03-17 | 2002-12-23 | 4 |
| Chispa | 1998-09-11 | 2002-12-23 | 4 |
| Kaiser | 1989-08-31 | 2002-12-23 | 13 |
+--------+------------+--------------+------+
9 rows in set (0.01 sec)
Una consulta similar puede ser usada para determinar la edad que tenía una mascota cuando falleció. Para determinar que animalitos ya fallecieron, la condición es que el valor en el campo fallecimiento no sea nulo (NULL). Entonces, para los registros con valor no-nulo, calculamos la diferencia entre los valores fallecimiento y nacimiento.
mysql> SELECT nombre, nacimiento, fallecimiento,
-> (YEAR(fallecimiento) - YEAR(nacimiento))
-> - (RIGHT(fallecimiento,5) < RIGHT(nacimiento,5))
-> AS edad FROM mascotas WHERE fallecimiento IS NOT NULL;
+--------+------------+---------------+------+
| nombre | nacimiento | fallecimiento | edad |
+--------+------------+---------------+------+
| Kaiser | 1989-08-31 | 1997-07-29 | 7 |
+--------+------------+---------------+------+
1 row in set (0.01 sec)
La consulta usa fallecimiento IS NOT NULL, en vez de fallecimiento < > NULL porque NULL es un valor especial. Esto será explicando más a detalle posteriormente.
¿Qué sucede si deseamos conocer cuáles de nuestras mascotas cumplen años el próximo mes? Para este tipo de cálculos, el año y el día son irrelevantes; simplemente tenemos que extraer el valor del mes en la columna nacimiento. Como se mencionó anteriormente, MySQL proporciona diversas funciones para trabajar y manipular fechas, en este caso haremos uso de la función MONTH(). Para ver como trabaja, vamos a ejecutar una consulta muy simple que muestra tanto el valor de una fecha como el valor que regresa la función MONTH().
mysql> SELECT nombre, nacimiento, MONTH(nacimiento) FROM mascotas;
+--------+------------+-------------------+
| nombre | nacimiento | MONTH(nacimiento) |
+--------+------------+-------------------+
| Fluffy | 1999-02-04 | 2 |
| Mau | 1998-03-17 | 3 |
| Buffy | 1999-05-13 | 5 |
| FanFan | 2000-08-27 | 8 |
| Kaiser | 1989-08-31 | 8 |
| Chispa | 1998-09-11 | 9 |
| Wicho | 2000-02-09 | 2 |
| Skim | 2001-04-29 | 4 |
| Pelusa | 2000-03-30 | 3 |
+--------+------------+-------------------+
9 rows in set (0.00 sec)
Encontrar los animalitos cuyo cumpleaños es el próximo mes es muy sencillo. Suponiendo que el mes actual es Abril (valor 4), entonces tenemos que buscar los registros cuyo valor de mes sea 5 (Mayo).
mysql> SELECT nombre, nacimiento FROM mascotas WHERE MONTH(nacimiento) = 5;
+--------+------------+
| nombre | nacimiento |
+--------+------------+
| Buffy | 1999-05-13 |
+--------+------------+
1 row in set (0.00 sec)
Aquí habrá por supuesto una complicación si el mes actual es Diciembre. No podemos simplemente agregar uno al número del mes (12) y buscar los registros cuyo mes de nacimiento sea 13 porque dicho mes no existe. En vez de esto, tenemos que buscar los animalitos que nacieron en Enero (mes 1).
Sin embargo, lo mejor es que podemos escribir una consulta que funcione no importando cuál sea el mes actual. La función DATE_ADD() nos permite agregar un intervalo de tiempo a una fecha dada. Si agregamos un mes al valor regresado por la función NOW(), y entonces extraemos el valor del mes con la función MONTH(), el resultado es que siempre obtendremos el mes siguiente.
La consulta que resuelve nuestro problema queda así:
mysql> SELECT nombre, nacimiento FROM mascotas
-> WHERE MONTH(nacimiento) = MONTH(DATE\_ADD(NOW(), INTERVAL 1 MONTH));
1434 visitas desde el 27-04-2019
AnteriorPosterior
|
{
"url": "https://aprendeaprogramar.com/cursos/verApartado.php?id=18008",
"source_domain": "aprendeaprogramar.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "25919",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EGQSQBF7QIIRPFYU2S4SKKAERRWSRBV2",
"WARC-Concurrent-To": "<urn:uuid:dfaf5420-ac3b-42fb-ad91-281b274b0dd7>",
"WARC-Date": "2019-12-06T11:20:29Z",
"WARC-IP-Address": "185.224.137.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3NQZORHGEAJ4W6KKBYH7BC2UEV77SAPS",
"WARC-Record-ID": "<urn:uuid:c43b4663-95a2-4269-87ef-4aebe132d235>",
"WARC-Target-URI": "https://aprendeaprogramar.com/cursos/verApartado.php?id=18008",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2df41006-708a-4ef4-9e9e-47036d663151>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.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,
42,
43,
68,
98,
133,
134,
136,
137,
159,
160,
183,
184,
363,
364,
715,
716,
764,
808,
883,
929,
975,
1021,
1067,
1113,
1159,
1205,
1251,
1297,
1343,
1389,
1435,
1481,
1506,
1507,
1890,
1891,
2055,
2056,
2236,
2237,
2307,
2308,
2356,
2400,
2452,
2495,
2541,
2587,
2633,
2679,
2725,
2771,
2817,
2863,
2909,
2955,
3001,
3047,
3093,
3118,
3119,
3222,
3223,
3271,
3315,
3367,
3408,
3454,
3500,
3546,
3592,
3638,
3684,
3730,
3776,
3822,
3868,
3914,
3960,
4006,
4031,
4032,
4373,
4374,
4423,
4468,
4521,
4580,
4627,
4674,
4721,
4768,
4815,
4839,
4840,
5001,
5002,
5529,
5530,
5597,
5641,
5685,
5729,
5773,
5817,
5861,
5905,
5949,
5993,
6037,
6081,
6125,
6169,
6194,
6195,
6394,
6395,
6471,
6495,
6519,
6543,
6567,
6591,
6615,
6616,
6908,
6909,
7283,
7284,
7337,
7338,
7385,
7458,
7459,
7492,
7493
],
"line_end_idx": [
18,
19,
42,
43,
68,
98,
133,
134,
136,
137,
159,
160,
183,
184,
363,
364,
715,
716,
764,
808,
883,
929,
975,
1021,
1067,
1113,
1159,
1205,
1251,
1297,
1343,
1389,
1435,
1481,
1506,
1507,
1890,
1891,
2055,
2056,
2236,
2237,
2307,
2308,
2356,
2400,
2452,
2495,
2541,
2587,
2633,
2679,
2725,
2771,
2817,
2863,
2909,
2955,
3001,
3047,
3093,
3118,
3119,
3222,
3223,
3271,
3315,
3367,
3408,
3454,
3500,
3546,
3592,
3638,
3684,
3730,
3776,
3822,
3868,
3914,
3960,
4006,
4031,
4032,
4373,
4374,
4423,
4468,
4521,
4580,
4627,
4674,
4721,
4768,
4815,
4839,
4840,
5001,
5002,
5529,
5530,
5597,
5641,
5685,
5729,
5773,
5817,
5861,
5905,
5949,
5993,
6037,
6081,
6125,
6169,
6194,
6195,
6394,
6395,
6471,
6495,
6519,
6543,
6567,
6591,
6615,
6616,
6908,
6909,
7283,
7284,
7337,
7338,
7385,
7458,
7459,
7492,
7493,
7510
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7510,
"ccnet_original_nlines": 138,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.034939758479595184,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05481927841901779,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5216867327690125,
"rps_doc_frac_unique_words": 0.31514477729797363,
"rps_doc_mean_word_length": 5.228285312652588,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.102447032928467,
"rps_doc_word_count": 898,
"rps_doc_frac_chars_dupe_10grams": 0.0783812627196312,
"rps_doc_frac_chars_dupe_5grams": 0.18317359685897827,
"rps_doc_frac_chars_dupe_6grams": 0.15974441170692444,
"rps_doc_frac_chars_dupe_7grams": 0.10351438075304031,
"rps_doc_frac_chars_dupe_8grams": 0.10351438075304031,
"rps_doc_frac_chars_dupe_9grams": 0.0783812627196312,
"rps_doc_frac_chars_top_2gram": 0.04430244863033295,
"rps_doc_frac_chars_top_3gram": 0.02534610964357853,
"rps_doc_frac_chars_top_4gram": 0.0402555912733078,
"rps_doc_books_importance": -762.56103515625,
"rps_doc_books_importance_length_correction": -762.56103515625,
"rps_doc_openwebtext_importance": -435.3828430175781,
"rps_doc_openwebtext_importance_length_correction": -435.3828430175781,
"rps_doc_wikipedia_importance": -303.1720275878906,
"rps_doc_wikipedia_importance_length_correction": -303.1720275878906
},
"fasttext": {
"dclm": 0.9991028308868408,
"english": 0.011249969713389874,
"fineweb_edu_approx": 1.1711914539337158,
"eai_general_math": 0.0031837199348956347,
"eai_open_web_math": 0.5835673809051514,
"eai_web_code": 0.9882215857505798
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,436,267,556,324,250,000 |
USB Type-C OTG cable
I have an USB C OTG smartphone, and I’ve been looking at the fiio M3 Pro for a while. I would like to connect the M3 Pro to my phone since the M3 Pro can act as a USB DAC, so do I need a special OTG cable for USB C to USB C or just normal USB C to USB C ones? Thanks!
I’m pretty sure if it’s type c to type c you only need a regular short type c cable
I was researching this quite a bit a few weeks ago. From what I found, the pinout on one end of an OTG cable is effectively different than a standard USB cable. In USB-speak this is what makes your phone appear as a “host” to something like a DAC or thumb drive instead of the phone’s usual “device” role for situations like when the phone is connected to a computer.
Yes, this is needed for micro b for sure, but for type c devices I don’t think an otg cable is needed anymore (because I think that it now depends on the phone to support an otg mode rather than a special cable if you are going from c to c). That being said there are some cables that will prevent some phones from providing power to connected devices that can be helpful in preventing unneeded phone battery drain because it’s trying to charge the connected device.
I use this cable for USB Dac with my Fiio BTR5. Two other cables that I bought before did not work.But I’m not sure if the other’s were only made for charge and not used for data transfer.
Thanks for your replies! So I’m looking for a USB c to USB c cable that can transfer data and not charge the slave device. Something like that?
Depending of the actual Mobile device (maybe other device as well) and it’s setting.
Some phones does pop-up settings in connection “what you want to do with the connected device”.
What is the connection’s function “only data, photos, charge etc”. So if it’s possible just select not charge.
Good cables should be universal and meet needed standards for all functions (easier to find).
Would this work for iPhones lightning port as well?
I Phones need oftly the Camera Adapter to work with USB Dac. I don’t know exactly what the M3 Pro is like, but I wouldn’t rely on anything else to work.
The OTG works and I can use the fiio m3 pro as a DAC to my Huawei nova 5t. The problem is the reverse charging. In DAC mode, my phone recognizes it as a pair of headphones, so no USB connection prompt comes up. Any solutions to stop the phone from reverse charging? Much appreciated.
This might be worth to try “developer options and select always prompt when connecting usb and reboot”
Apple’s Lightning ports can use regular 12-watt charging with a USB-A cable and faster charging via USB-C . Micro-USB and Mini-USB can provide only regular charging regardless of a USB-A or USB-C connection
|
{
"url": "https://forum.hifiguides.com/t/usb-type-c-otg-cable/17370",
"source_domain": "forum.hifiguides.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "34742",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TCS3E2EWFP26IGFPLOFO6HFPL3U4YREW",
"WARC-Concurrent-To": "<urn:uuid:e6c61014-753b-4db5-a5b4-9290d9b3bcf8>",
"WARC-Date": "2022-05-26T07:50:40Z",
"WARC-IP-Address": "104.21.31.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CR5BC5ULKRRHHECUSMRAQX2ZXFLFPDZM",
"WARC-Record-ID": "<urn:uuid:2fb55ecd-b2dc-4ed4-9686-526906ea4d5f>",
"WARC-Target-URI": "https://forum.hifiguides.com/t/usb-type-c-otg-cable/17370",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:564b5dab-d376-4fa9-9648-8efc67bd9807>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-177\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,
21,
22,
290,
291,
375,
376,
744,
745,
1212,
1213,
1402,
1403,
1547,
1548,
1633,
1729,
1840,
1934,
1935,
1987,
1988,
2141,
2142,
2426,
2427,
2530,
2531
],
"line_end_idx": [
21,
22,
290,
291,
375,
376,
744,
745,
1212,
1213,
1402,
1403,
1547,
1548,
1633,
1729,
1840,
1934,
1935,
1987,
1988,
2141,
2142,
2426,
2427,
2530,
2531,
2737
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2737,
"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.44822007417678833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09870550036430359,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1229773536324501,
"rps_doc_frac_unique_words": 0.43713733553886414,
"rps_doc_mean_word_length": 4.166344165802002,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.964907169342041,
"rps_doc_word_count": 517,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.013927579857409,
"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.01299906987696886,
"rps_doc_frac_chars_top_3gram": 0.011142060160636902,
"rps_doc_frac_chars_top_4gram": 0.012534819543361664,
"rps_doc_books_importance": -282.81689453125,
"rps_doc_books_importance_length_correction": -282.81689453125,
"rps_doc_openwebtext_importance": -156.8837432861328,
"rps_doc_openwebtext_importance_length_correction": -156.8837432861328,
"rps_doc_wikipedia_importance": -67.50267028808594,
"rps_doc_wikipedia_importance_length_correction": -67.50267028808594
},
"fasttext": {
"dclm": 0.3854284882545471,
"english": 0.9341187477111816,
"fineweb_edu_approx": 1.3903433084487915,
"eai_general_math": 0.5222772359848022,
"eai_open_web_math": 0.24167221784591675,
"eai_web_code": 0.05614883080124855
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,492,807,461,686,172,000 |
Create a gist now
Instantly share code, notes, and snippets.
Embed
Laravel IDE Helper for Netbeans / PhpStorm / Sublime Text 2 CodeIntel, generated using https://github.com/barryvdh/laravel-ide-helper
<?php
/**
* A helper file for Laravel 5, to provide autocomplete information to your IDE
* Generated for Laravel 5.5.13 on 2017-09-28.
*
* @author Barry vd. Heuvel <[email protected]>
* @see https://github.com/barryvdh/laravel-ide-helper
*/
namespace {
exit("This file should not be included, only analyzed by your IDE");
}
namespace Illuminate\Support\Facades {
class App {
/**
* Get the version number of the application.
*
* @return string
* @static
*/
public static function version()
{
return \Illuminate\Foundation\Application::version();
}
/**
* Run the given array of bootstrap classes.
*
* @param array $bootstrappers
* @return void
* @static
*/
public static function bootstrapWith($bootstrappers)
{
\Illuminate\Foundation\Application::bootstrapWith($bootstrappers);
}
/**
* Register a callback to run after loading the environment.
*
* @param \Closure $callback
* @return void
* @static
*/
public static function afterLoadingEnvironment($callback)
{
\Illuminate\Foundation\Application::afterLoadingEnvironment($callback);
}
/**
* Register a callback to run before a bootstrapper.
*
* @param string $bootstrapper
* @param \Closure $callback
* @return void
* @static
*/
public static function beforeBootstrapping($bootstrapper, $callback)
{
\Illuminate\Foundation\Application::beforeBootstrapping($bootstrapper, $callback);
}
/**
* Register a callback to run after a bootstrapper.
*
* @param string $bootstrapper
* @param \Closure $callback
* @return void
* @static
*/
public static function afterBootstrapping($bootstrapper, $callback)
{
\Illuminate\Foundation\Application::afterBootstrapping($bootstrapper, $callback);
}
/**
* Determine if the application has been bootstrapped before.
*
* @return bool
* @static
*/
public static function hasBeenBootstrapped()
{
return \Illuminate\Foundation\Application::hasBeenBootstrapped();
}
/**
* Set the base path for the application.
*
* @param string $basePath
* @return $this
* @static
*/
public static function setBasePath($basePath)
{
return \Illuminate\Foundation\Application::setBasePath($basePath);
}
/**
* Get the path to the application "app" directory.
*
* @param string $path Optionally, a path to append to the app path
* @return string
* @static
*/
public static function path($path = '')
{
return \Illuminate\Foundation\Application::path($path);
}
/**
* Get the base path of the Laravel installation.
*
* @param string $path Optionally, a path to append to the base path
* @return string
* @static
*/
public static function basePath($path = '')
{
return \Illuminate\Foundation\Application::basePath($path);
}
/**
* Get the path to the bootstrap directory.
*
* @param string $path Optionally, a path to append to the bootstrap path
* @return string
* @static
*/
public static function bootstrapPath($path = '')
{
return \Illuminate\Foundation\Application::bootstrapPath($path);
}
/**
* Get the path to the application configuration files.
*
* @param string $path Optionally, a path to append to the config path
* @return string
* @static
*/
public static function configPath($path = '')
{
return \Illuminate\Foundation\Application::configPath($path);
}
/**
* Get the path to the database directory.
*
* @param string $path Optionally, a path to append to the database path
* @return string
* @static
*/
public static function databasePath($path = '')
{
return \Illuminate\Foundation\Application::databasePath($path);
}
/**
* Set the database directory.
*
* @param string $path
* @return $this
* @static
*/
public static function useDatabasePath($path)
{
return \Illuminate\Foundation\Application::useDatabasePath($path);
}
/**
* Get the path to the language files.
*
* @return string
* @static
*/
public static function langPath()
{
return \Illuminate\Foundation\Application::langPath();
}
/**
* Get the path to the public / web directory.
*
* @return string
* @static
*/
public static function publicPath()
{
return \Illuminate\Foundation\Application::publicPath();
}
/**
* Get the path to the storage directory.
*
* @return string
* @static
*/
public static function storagePath()
{
return \Illuminate\Foundation\Application::storagePath();
}
/**
* Set the storage directory.
*
* @param string $path
* @return $this
* @static
*/
public static function useStoragePath($path)
{
return \Illuminate\Foundation\Application::useStoragePath($path);
}
/**
* Get the path to the resources directory.
*
* @param string $path
* @return string
* @static
*/
public static function resourcePath($path = '')
{
return \Illuminate\Foundation\Application::resourcePath($path);
}
/**
* Get the path to the environment file directory.
*
* @return string
* @static
*/
public static function environmentPath()
{
return \Illuminate\Foundation\Application::environmentPath();
}
/**
* Set the directory for the environment file.
*
* @param string $path
* @return $this
* @static
*/
public static function useEnvironmentPath($path)
{
return \Illuminate\Foundation\Application::useEnvironmentPath($path);
}
/**
* Set the environment file to be loaded during bootstrapping.
*
* @param string $file
* @return $this
* @static
*/
public static function loadEnvironmentFrom($file)
{
return \Illuminate\Foundation\Application::loadEnvironmentFrom($file);
}
/**
* Get the environment file the application is using.
*
* @return string
* @static
*/
public static function environmentFile()
{
return \Illuminate\Foundation\Application::environmentFile();
}
/**
* Get the fully qualified path to the environment file.
*
* @return string
* @static
*/
public static function environmentFilePath()
{
return \Illuminate\Foundation\Application::environmentFilePath();
}
/**
* Get or check the current application environment.
*
* @return string|bool
* @static
*/
public static function environment()
{
return \Illuminate\Foundation\Application::environment();
}
/**
* Determine if application is in local environment.
*
* @return bool
* @static
*/
public static function isLocal()
{
return \Illuminate\Foundation\Application::isLocal();
}
/**
* Detect the application's current environment.
*
* @param \Closure $callback
* @return string
* @static
*/
public static function detectEnvironment($callback)
{
return \Illuminate\Foundation\Application::detectEnvironment($callback);
}
/**
* Determine if we are running in the console.
*
* @return bool
* @static
*/
public static function runningInConsole()
{
return \Illuminate\Foundation\Application::runningInConsole();
}
/**
* Determine if we are running unit tests.
*
* @return bool
* @static
*/
public static function runningUnitTests()
{
return \Illuminate\Foundation\Application::runningUnitTests();
}
/**
* Register all of the configured providers.
*
* @return void
* @static
*/
public static function registerConfiguredProviders()
{
\Illuminate\Foundation\Application::registerConfiguredProviders();
}
/**
* Register a service provider with the application.
*
* @param \Illuminate\Support\ServiceProvider|string $provider
* @param array $options
* @param bool $force
* @return \Illuminate\Support\ServiceProvider
* @static
*/
public static function register($provider, $options = array(), $force = false)
{
return \Illuminate\Foundation\Application::register($provider, $options, $force);
}
/**
* Get the registered service provider instance if it exists.
*
* @param \Illuminate\Support\ServiceProvider|string $provider
* @return \Illuminate\Support\ServiceProvider|null
* @static
*/
public static function getProvider($provider)
{
return \Illuminate\Foundation\Application::getProvider($provider);
}
/**
* Resolve a service provider instance from the class name.
*
* @param string $provider
* @return \Illuminate\Support\ServiceProvider
* @static
*/
public static function resolveProvider($provider)
{
return \Illuminate\Foundation\Application::resolveProvider($provider);
}
/**
* Load and boot all of the remaining deferred providers.
*
* @return void
* @static
*/
public static function loadDeferredProviders()
{
\Illuminate\Foundation\Application::loadDeferredProviders();
}
/**
* Load the provider for a deferred service.
*
* @param string $service
* @return void
* @static
*/
public static function loadDeferredProvider($service)
{
\Illuminate\Foundation\Application::loadDeferredProvider($service);
}
/**
* Register a deferred provider and service.
*
* @param string $provider
* @param string|null $service
* @return void
* @static
*/
public static function registerDeferredProvider($provider, $service = null)
{
\Illuminate\Foundation\Application::registerDeferredProvider($provider, $service);
}
/**
* Resolve the given type from the container.
*
* (Overriding Container::make)
*
* @param string $abstract
* @param array $parameters
* @return mixed
* @static
*/
public static function make($abstract, $parameters = array())
{
return \Illuminate\Foundation\Application::make($abstract, $parameters);
}
/**
* Determine if the given abstract type has been bound.
*
* (Overriding Container::bound)
*
* @param string $abstract
* @return bool
* @static
*/
public static function bound($abstract)
{
return \Illuminate\Foundation\Application::bound($abstract);
}
/**
* Determine if the application has booted.
*
* @return bool
* @static
*/
public static function isBooted()
{
return \Illuminate\Foundation\Application::isBooted();
}
/**
* Boot the application's service providers.
*
* @return void
* @static
*/
public static function boot()
{
\Illuminate\Foundation\Application::boot();
}
/**
* Register a new boot listener.
*
* @param mixed $callback
* @return void
* @static
*/
public static function booting($callback)
{
\Illuminate\Foundation\Application::booting($callback);
}
/**
* Register a new "booted" listener.
*
* @param mixed $callback
* @return void
* @static
*/
public static function booted($callback)
{
\Illuminate\Foundation\Application::booted($callback);
}
/**
* {@inheritdoc}
*
* @static
*/
public static function handle($request, $type = 1, $catch = true)
{
return \Illuminate\Foundation\Application::handle($request, $type, $catch);
}
/**
* Determine if middleware has been disabled for the application.
*
* @return bool
* @static
*/
public static function shouldSkipMiddleware()
{
return \Illuminate\Foundation\Application::shouldSkipMiddleware();
}
/**
* Get the path to the cached services.php file.
*
* @return string
* @static
*/
public static function getCachedServicesPath()
{
return \Illuminate\Foundation\Application::getCachedServicesPath();
}
/**
* Get the path to the cached packages.php file.
*
* @return string
* @static
*/
public static function getCachedPackagesPath()
{
return \Illuminate\Foundation\Application::getCachedPackagesPath();
}
/**
* Determine if the application configuration is cached.
*
* @return bool
* @static
*/
public static function configurationIsCached()
{
return \Illuminate\Foundation\Application::configurationIsCached();
}
/**
* Get the path to the configuration cache file.
*
* @return string
* @static
*/
public static function getCachedConfigPath()
{
return \Illuminate\Foundation\Application::getCachedConfigPath();
}
/**
* Determine if the application routes are cached.
*
* @return bool
* @static
*/
public static function routesAreCached()
{
return \Illuminate\Foundation\Application::routesAreCached();
}
/**
* Get the path to the routes cache file.
*
* @return string
* @static
*/
public static function getCachedRoutesPath()
{
return \Illuminate\Foundation\Application::getCachedRoutesPath();
}
/**
* Determine if the application is currently down for maintenance.
*
* @return bool
* @static
*/
public static function isDownForMaintenance()
{
return \Illuminate\Foundation\Application::isDownForMaintenance();
}
/**
* Throw an HttpException with the given data.
*
* @param int $code
* @param string $message
* @param array $headers
* @return void
* @throws \Symfony\Component\HttpKernel\Exception\HttpException
* @static
*/
public static function abort($code, $message = '', $headers = array())
{
\Illuminate\Foundation\Application::abort($code, $message, $headers);
}
/**
* Register a terminating callback with the application.
*
* @param \Closure $callback
* @return $this
* @static
*/
public static function terminating($callback)
{
return \Illuminate\Foundation\Application::terminating($callback);
}
/**
* Terminate the application.
*
* @return void
* @static
*/
public static function terminate()
{
\Illuminate\Foundation\Application::terminate();
}
/**
* Get the service providers that have been loaded.
*
* @return array
* @static
*/
public static function getLoadedProviders()
{
return \Illuminate\Foundation\Application::getLoadedProviders();
}
/**
* Get the application's deferred services.
*
* @return array
* @static
*/
public static function getDeferredServices()
{
return \Illuminate\Foundation\Application::getDeferredServices();
}
/**
* Set the application's deferred services.
*
* @param array $services
* @return void
* @static
*/
public static function setDeferredServices($services)
{
\Illuminate\Foundation\Application::setDeferredServices($services);
}
/**
* Add an array of services to the application's deferred services.
*
* @param array $services
* @return void
* @static
*/
public static function addDeferredServices($services)
{
\Illuminate\Foundation\Application::addDeferredServices($services);
}
/**
* Determine if the given service is a deferred service.
*
* @param string $service
* @return bool
* @static
*/
public static function isDeferredService($service)
{
return \Illuminate\Foundation\Application::isDeferredService($service);
}
/**
* Configure the real-time facade namespace.
*
* @param string $namespace
* @return void
* @static
*/
public static function provideFacades($namespace)
{
\Illuminate\Foundation\Application::provideFacades($namespace);
}
/**
* Define a callback to be used to configure Monolog.
*
* @param callable $callback
* @return $this
* @static
*/
public static function configureMonologUsing($callback)
{
return \Illuminate\Foundation\Application::configureMonologUsing($callback);
}
/**
* Determine if the application has a custom Monolog configurator.
*
* @return bool
* @static
*/
public static function hasMonologConfigurator()
{
return \Illuminate\Foundation\Application::hasMonologConfigurator();
}
/**
* Get the custom Monolog configurator for the application.
*
* @return callable
* @static
*/
public static function getMonologConfigurator()
{
return \Illuminate\Foundation\Application::getMonologConfigurator();
}
/**
* Get the current application locale.
*
* @return string
* @static
*/
public static function getLocale()
{
return \Illuminate\Foundation\Application::getLocale();
}
/**
* Set the current application locale.
*
* @param string $locale
* @return void
* @static
*/
public static function setLocale($locale)
{
\Illuminate\Foundation\Application::setLocale($locale);
}
/**
* Determine if application locale is the given locale.
*
* @param string $locale
* @return bool
* @static
*/
public static function isLocale($locale)
{
return \Illuminate\Foundation\Application::isLocale($locale);
}
/**
* Register the core class aliases in the container.
*
* @return void
* @static
*/
public static function registerCoreContainerAliases()
{
\Illuminate\Foundation\Application::registerCoreContainerAliases();
}
/**
* Flush the container of all bindings and resolved instances.
*
* @return void
* @static
*/
public static function flush()
{
\Illuminate\Foundation\Application::flush();
}
/**
* Get the application namespace.
*
* @return string
* @throws \RuntimeException
* @static
*/
public static function getNamespace()
{
return \Illuminate\Foundation\Application::getNamespace();
}
/**
* Define a contextual binding.
*
* @param string $concrete
* @return \Illuminate\Contracts\Container\ContextualBindingBuilder
* @static
*/
public static function when($concrete)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::when($concrete);
}
/**
* Returns true if the container can return an entry for the given identifier.
*
* Returns false otherwise.
*
* `has($id)` returning true does not mean that `get($id)` will not throw an exception.
* It does however mean that `get($id)` will not throw a `NotFoundExceptionInterface`.
*
* @param string $id Identifier of the entry to look for.
* @return bool
* @static
*/
public static function has($id)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::has($id);
}
/**
* Determine if the given abstract type has been resolved.
*
* @param string $abstract
* @return bool
* @static
*/
public static function resolved($abstract)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::resolved($abstract);
}
/**
* Determine if a given type is shared.
*
* @param string $abstract
* @return bool
* @static
*/
public static function isShared($abstract)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::isShared($abstract);
}
/**
* Determine if a given string is an alias.
*
* @param string $name
* @return bool
* @static
*/
public static function isAlias($name)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::isAlias($name);
}
/**
* Register a binding with the container.
*
* @param string|array $abstract
* @param \Closure|string|null $concrete
* @param bool $shared
* @return void
* @static
*/
public static function bind($abstract, $concrete = null, $shared = false)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::bind($abstract, $concrete, $shared);
}
/**
* Determine if the container has a method binding.
*
* @param string $method
* @return bool
* @static
*/
public static function hasMethodBinding($method)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::hasMethodBinding($method);
}
/**
* Bind a callback to resolve with Container::call.
*
* @param string $method
* @param \Closure $callback
* @return void
* @static
*/
public static function bindMethod($method, $callback)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::bindMethod($method, $callback);
}
/**
* Get the method binding for the given method.
*
* @param string $method
* @param mixed $instance
* @return mixed
* @static
*/
public static function callMethodBinding($method, $instance)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::callMethodBinding($method, $instance);
}
/**
* Add a contextual binding to the container.
*
* @param string $concrete
* @param string $abstract
* @param \Closure|string $implementation
* @return void
* @static
*/
public static function addContextualBinding($concrete, $abstract, $implementation)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::addContextualBinding($concrete, $abstract, $implementation);
}
/**
* Register a binding if it hasn't already been registered.
*
* @param string $abstract
* @param \Closure|string|null $concrete
* @param bool $shared
* @return void
* @static
*/
public static function bindIf($abstract, $concrete = null, $shared = false)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::bindIf($abstract, $concrete, $shared);
}
/**
* Register a shared binding in the container.
*
* @param string|array $abstract
* @param \Closure|string|null $concrete
* @return void
* @static
*/
public static function singleton($abstract, $concrete = null)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::singleton($abstract, $concrete);
}
/**
* "Extend" an abstract type in the container.
*
* @param string $abstract
* @param \Closure $closure
* @return void
* @throws \InvalidArgumentException
* @static
*/
public static function extend($abstract, $closure)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::extend($abstract, $closure);
}
/**
* Register an existing instance as shared in the container.
*
* @param string $abstract
* @param mixed $instance
* @return mixed
* @static
*/
public static function instance($abstract, $instance)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::instance($abstract, $instance);
}
/**
* Assign a set of tags to a given binding.
*
* @param array|string $abstracts
* @param array|mixed $tags
* @return void
* @static
*/
public static function tag($abstracts, $tags)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::tag($abstracts, $tags);
}
/**
* Resolve all of the bindings for a given tag.
*
* @param string $tag
* @return array
* @static
*/
public static function tagged($tag)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::tagged($tag);
}
/**
* Alias a type to a different name.
*
* @param string $abstract
* @param string $alias
* @return void
* @static
*/
public static function alias($abstract, $alias)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::alias($abstract, $alias);
}
/**
* Bind a new callback to an abstract's rebind event.
*
* @param string $abstract
* @param \Closure $callback
* @return mixed
* @static
*/
public static function rebinding($abstract, $callback)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::rebinding($abstract, $callback);
}
/**
* Refresh an instance on the given target and method.
*
* @param string $abstract
* @param mixed $target
* @param string $method
* @return mixed
* @static
*/
public static function refresh($abstract, $target, $method)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::refresh($abstract, $target, $method);
}
/**
* Wrap the given closure such that its dependencies will be injected when executed.
*
* @param \Closure $callback
* @param array $parameters
* @return \Closure
* @static
*/
public static function wrap($callback, $parameters = array())
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::wrap($callback, $parameters);
}
/**
* Call the given Closure / class@method and inject its dependencies.
*
* @param callable|string $callback
* @param array $parameters
* @param string|null $defaultMethod
* @return mixed
* @static
*/
public static function call($callback, $parameters = array(), $defaultMethod = null)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::call($callback, $parameters, $defaultMethod);
}
/**
* Get a closure to resolve the given type from the container.
*
* @param string $abstract
* @return \Closure
* @static
*/
public static function factory($abstract)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::factory($abstract);
}
/**
* An alias function name for make().
*
* @param string $abstract
* @param array $parameters
* @return mixed
* @static
*/
public static function makeWith($abstract, $parameters = array())
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::makeWith($abstract, $parameters);
}
/**
* Finds an entry of the container by its identifier and returns it.
*
* @param string $id Identifier of the entry to look for.
* @throws NotFoundExceptionInterface No entry was found for **this** identifier.
* @throws ContainerExceptionInterface Error while retrieving the entry.
* @return mixed Entry.
* @static
*/
public static function get($id)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::get($id);
}
/**
* Instantiate a concrete instance of the given type.
*
* @param string $concrete
* @return mixed
* @throws \Illuminate\Contracts\Container\BindingResolutionException
* @static
*/
public static function build($concrete)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::build($concrete);
}
/**
* Register a new resolving callback.
*
* @param string $abstract
* @param \Closure|null $callback
* @return void
* @static
*/
public static function resolving($abstract, $callback = null)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::resolving($abstract, $callback);
}
/**
* Register a new after resolving callback for all types.
*
* @param string $abstract
* @param \Closure|null $callback
* @return void
* @static
*/
public static function afterResolving($abstract, $callback = null)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::afterResolving($abstract, $callback);
}
/**
* Get the container's bindings.
*
* @return array
* @static
*/
public static function getBindings()
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::getBindings();
}
/**
* Get the alias for an abstract if available.
*
* @param string $abstract
* @return string
* @throws \LogicException
* @static
*/
public static function getAlias($abstract)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::getAlias($abstract);
}
/**
* Remove all of the extender callbacks for a given type.
*
* @param string $abstract
* @return void
* @static
*/
public static function forgetExtenders($abstract)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::forgetExtenders($abstract);
}
/**
* Remove a resolved instance from the instance cache.
*
* @param string $abstract
* @return void
* @static
*/
public static function forgetInstance($abstract)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::forgetInstance($abstract);
}
/**
* Clear all of the instances from the container.
*
* @return void
* @static
*/
public static function forgetInstances()
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::forgetInstances();
}
/**
* Set the globally available instance of the container.
*
* @return static
* @static
*/
public static function getInstance()
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::getInstance();
}
/**
* Set the shared instance of the container.
*
* @param \Illuminate\Contracts\Container\Container|null $container
* @return static
* @static
*/
public static function setInstance($container = null)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::setInstance($container);
}
/**
* Determine if a given offset exists.
*
* @param string $key
* @return bool
* @static
*/
public static function offsetExists($key)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::offsetExists($key);
}
/**
* Get the value at a given offset.
*
* @param string $key
* @return mixed
* @static
*/
public static function offsetGet($key)
{
//Method inherited from \Illuminate\Container\Container
return \Illuminate\Foundation\Application::offsetGet($key);
}
/**
* Set the value at a given offset.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function offsetSet($key, $value)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::offsetSet($key, $value);
}
/**
* Unset the value at a given offset.
*
* @param string $key
* @return void
* @static
*/
public static function offsetUnset($key)
{
//Method inherited from \Illuminate\Container\Container
\Illuminate\Foundation\Application::offsetUnset($key);
}
}
class Artisan {
/**
* Run the console application.
*
* @param \Symfony\Component\Console\Input\InputInterface $input
* @param \Symfony\Component\Console\Output\OutputInterface $output
* @return int
* @static
*/
public static function handle($input, $output = null)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::handle($input, $output);
}
/**
* Terminate the application.
*
* @param \Symfony\Component\Console\Input\InputInterface $input
* @param int $status
* @return void
* @static
*/
public static function terminate($input, $status)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
\App\Console\Kernel::terminate($input, $status);
}
/**
* Register a Closure based command with the application.
*
* @param string $signature
* @param \Closure $callback
* @return \Illuminate\Foundation\Console\ClosureCommand
* @static
*/
public static function command($signature, $callback)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::command($signature, $callback);
}
/**
* Register the given command with the console application.
*
* @param \Symfony\Component\Console\Command\Command $command
* @return void
* @static
*/
public static function registerCommand($command)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
\App\Console\Kernel::registerCommand($command);
}
/**
* Run an Artisan console command by name.
*
* @param string $command
* @param array $parameters
* @param \Symfony\Component\Console\Output\OutputInterface $outputBuffer
* @return int
* @static
*/
public static function call($command, $parameters = array(), $outputBuffer = null)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::call($command, $parameters, $outputBuffer);
}
/**
* Queue the given console command.
*
* @param string $command
* @param array $parameters
* @return \Illuminate\Foundation\Bus\PendingDispatch
* @static
*/
public static function queue($command, $parameters = array())
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::queue($command, $parameters);
}
/**
* Get all of the commands registered with the console.
*
* @return array
* @static
*/
public static function all()
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::all();
}
/**
* Get the output for the last run command.
*
* @return string
* @static
*/
public static function output()
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
return \App\Console\Kernel::output();
}
/**
* Bootstrap the application for artisan commands.
*
* @return void
* @static
*/
public static function bootstrap()
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
\App\Console\Kernel::bootstrap();
}
/**
* Set the Artisan application instance.
*
* @param \Illuminate\Console\Application $artisan
* @return void
* @static
*/
public static function setArtisan($artisan)
{
//Method inherited from \Illuminate\Foundation\Console\Kernel
\App\Console\Kernel::setArtisan($artisan);
}
}
class Auth {
/**
* Attempt to get the guard from the local cache.
*
* @param string $name
* @return \Illuminate\Contracts\Auth\Guard|\Illuminate\Contracts\Auth\StatefulGuard
* @static
*/
public static function guard($name = null)
{
return \Illuminate\Auth\AuthManager::guard($name);
}
/**
* Create a session based authentication guard.
*
* @param string $name
* @param array $config
* @return \Illuminate\Auth\SessionGuard
* @static
*/
public static function createSessionDriver($name, $config)
{
return \Illuminate\Auth\AuthManager::createSessionDriver($name, $config);
}
/**
* Create a token based authentication guard.
*
* @param string $name
* @param array $config
* @return \Illuminate\Auth\TokenGuard
* @static
*/
public static function createTokenDriver($name, $config)
{
return \Illuminate\Auth\AuthManager::createTokenDriver($name, $config);
}
/**
* Get the default authentication driver name.
*
* @return string
* @static
*/
public static function getDefaultDriver()
{
return \Illuminate\Auth\AuthManager::getDefaultDriver();
}
/**
* Set the default guard driver the factory should serve.
*
* @param string $name
* @return void
* @static
*/
public static function shouldUse($name)
{
\Illuminate\Auth\AuthManager::shouldUse($name);
}
/**
* Set the default authentication driver name.
*
* @param string $name
* @return void
* @static
*/
public static function setDefaultDriver($name)
{
\Illuminate\Auth\AuthManager::setDefaultDriver($name);
}
/**
* Register a new callback based request guard.
*
* @param string $driver
* @param callable $callback
* @return $this
* @static
*/
public static function viaRequest($driver, $callback)
{
return \Illuminate\Auth\AuthManager::viaRequest($driver, $callback);
}
/**
* Get the user resolver callback.
*
* @return \Closure
* @static
*/
public static function userResolver()
{
return \Illuminate\Auth\AuthManager::userResolver();
}
/**
* Set the callback to be used to resolve users.
*
* @param \Closure $userResolver
* @return $this
* @static
*/
public static function resolveUsersUsing($userResolver)
{
return \Illuminate\Auth\AuthManager::resolveUsersUsing($userResolver);
}
/**
* Register a custom driver creator Closure.
*
* @param string $driver
* @param \Closure $callback
* @return $this
* @static
*/
public static function extend($driver, $callback)
{
return \Illuminate\Auth\AuthManager::extend($driver, $callback);
}
/**
* Register a custom provider creator Closure.
*
* @param string $name
* @param \Closure $callback
* @return $this
* @static
*/
public static function provider($name, $callback)
{
return \Illuminate\Auth\AuthManager::provider($name, $callback);
}
/**
* Create the user provider implementation for the driver.
*
* @param string|null $provider
* @return \Illuminate\Contracts\Auth\UserProvider|null
* @throws \InvalidArgumentException
* @static
*/
public static function createUserProvider($provider = null)
{
return \Illuminate\Auth\AuthManager::createUserProvider($provider);
}
/**
* Get the default user provider name.
*
* @return string
* @static
*/
public static function getDefaultUserProvider()
{
return \Illuminate\Auth\AuthManager::getDefaultUserProvider();
}
/**
* Get the currently authenticated user.
*
* @return \App\User|null
* @static
*/
public static function user()
{
return \Illuminate\Auth\SessionGuard::user();
}
/**
* Get the ID for the currently authenticated user.
*
* @return int|null
* @static
*/
public static function id()
{
return \Illuminate\Auth\SessionGuard::id();
}
/**
* Log a user into the application without sessions or cookies.
*
* @param array $credentials
* @return bool
* @static
*/
public static function once($credentials = array())
{
return \Illuminate\Auth\SessionGuard::once($credentials);
}
/**
* Log the given user ID into the application without sessions or cookies.
*
* @param mixed $id
* @return \App\User|false
* @static
*/
public static function onceUsingId($id)
{
return \Illuminate\Auth\SessionGuard::onceUsingId($id);
}
/**
* Validate a user's credentials.
*
* @param array $credentials
* @return bool
* @static
*/
public static function validate($credentials = array())
{
return \Illuminate\Auth\SessionGuard::validate($credentials);
}
/**
* Attempt to authenticate using HTTP Basic Auth.
*
* @param string $field
* @param array $extraConditions
* @return \Symfony\Component\HttpFoundation\Response|null
* @static
*/
public static function basic($field = 'email', $extraConditions = array())
{
return \Illuminate\Auth\SessionGuard::basic($field, $extraConditions);
}
/**
* Perform a stateless HTTP Basic login attempt.
*
* @param string $field
* @param array $extraConditions
* @return \Symfony\Component\HttpFoundation\Response|null
* @static
*/
public static function onceBasic($field = 'email', $extraConditions = array())
{
return \Illuminate\Auth\SessionGuard::onceBasic($field, $extraConditions);
}
/**
* Attempt to authenticate a user using the given credentials.
*
* @param array $credentials
* @param bool $remember
* @return bool
* @static
*/
public static function attempt($credentials = array(), $remember = false)
{
return \Illuminate\Auth\SessionGuard::attempt($credentials, $remember);
}
/**
* Log the given user ID into the application.
*
* @param mixed $id
* @param bool $remember
* @return \App\User|false
* @static
*/
public static function loginUsingId($id, $remember = false)
{
return \Illuminate\Auth\SessionGuard::loginUsingId($id, $remember);
}
/**
* Log a user into the application.
*
* @param \Illuminate\Contracts\Auth\Authenticatable $user
* @param bool $remember
* @return void
* @static
*/
public static function login($user, $remember = false)
{
\Illuminate\Auth\SessionGuard::login($user, $remember);
}
/**
* Log the user out of the application.
*
* @return void
* @static
*/
public static function logout()
{
\Illuminate\Auth\SessionGuard::logout();
}
/**
* Register an authentication attempt event listener.
*
* @param mixed $callback
* @return void
* @static
*/
public static function attempting($callback)
{
\Illuminate\Auth\SessionGuard::attempting($callback);
}
/**
* Get the last user we attempted to authenticate.
*
* @return \App\User
* @static
*/
public static function getLastAttempted()
{
return \Illuminate\Auth\SessionGuard::getLastAttempted();
}
/**
* Get a unique identifier for the auth session value.
*
* @return string
* @static
*/
public static function getName()
{
return \Illuminate\Auth\SessionGuard::getName();
}
/**
* Get the name of the cookie used to store the "recaller".
*
* @return string
* @static
*/
public static function getRecallerName()
{
return \Illuminate\Auth\SessionGuard::getRecallerName();
}
/**
* Determine if the user was authenticated via "remember me" cookie.
*
* @return bool
* @static
*/
public static function viaRemember()
{
return \Illuminate\Auth\SessionGuard::viaRemember();
}
/**
* Get the cookie creator instance used by the guard.
*
* @return \Illuminate\Contracts\Cookie\QueueingFactory
* @throws \RuntimeException
* @static
*/
public static function getCookieJar()
{
return \Illuminate\Auth\SessionGuard::getCookieJar();
}
/**
* Set the cookie creator instance used by the guard.
*
* @param \Illuminate\Contracts\Cookie\QueueingFactory $cookie
* @return void
* @static
*/
public static function setCookieJar($cookie)
{
\Illuminate\Auth\SessionGuard::setCookieJar($cookie);
}
/**
* Get the event dispatcher instance.
*
* @return \Illuminate\Contracts\Events\Dispatcher
* @static
*/
public static function getDispatcher()
{
return \Illuminate\Auth\SessionGuard::getDispatcher();
}
/**
* Set the event dispatcher instance.
*
* @param \Illuminate\Contracts\Events\Dispatcher $events
* @return void
* @static
*/
public static function setDispatcher($events)
{
\Illuminate\Auth\SessionGuard::setDispatcher($events);
}
/**
* Get the session store used by the guard.
*
* @return \Illuminate\Contracts\Session\Session.
* @static
*/
public static function getSession()
{
return \Illuminate\Auth\SessionGuard::getSession();
}
/**
* Return the currently cached user.
*
* @return \App\User|null
* @static
*/
public static function getUser()
{
return \Illuminate\Auth\SessionGuard::getUser();
}
/**
* Set the current user.
*
* @param \Illuminate\Contracts\Auth\Authenticatable $user
* @return $this
* @static
*/
public static function setUser($user)
{
return \Illuminate\Auth\SessionGuard::setUser($user);
}
/**
* Get the current request instance.
*
* @return \Symfony\Component\HttpFoundation\Request
* @static
*/
public static function getRequest()
{
return \Illuminate\Auth\SessionGuard::getRequest();
}
/**
* Set the current request instance.
*
* @param \Symfony\Component\HttpFoundation\Request $request
* @return $this
* @static
*/
public static function setRequest($request)
{
return \Illuminate\Auth\SessionGuard::setRequest($request);
}
/**
* Determine if the current user is authenticated.
*
* @return \App\User
* @throws \Illuminate\Auth\AuthenticationException
* @static
*/
public static function authenticate()
{
return \Illuminate\Auth\SessionGuard::authenticate();
}
/**
* Determine if the current user is authenticated.
*
* @return bool
* @static
*/
public static function check()
{
return \Illuminate\Auth\SessionGuard::check();
}
/**
* Determine if the current user is a guest.
*
* @return bool
* @static
*/
public static function guest()
{
return \Illuminate\Auth\SessionGuard::guest();
}
/**
* Get the user provider used by the guard.
*
* @return \Illuminate\Contracts\Auth\UserProvider
* @static
*/
public static function getProvider()
{
return \Illuminate\Auth\SessionGuard::getProvider();
}
/**
* Set the user provider used by the guard.
*
* @param \Illuminate\Contracts\Auth\UserProvider $provider
* @return void
* @static
*/
public static function setProvider($provider)
{
\Illuminate\Auth\SessionGuard::setProvider($provider);
}
/**
* Register a custom macro.
*
* @param string $name
* @param object|callable $macro
* @return void
* @static
*/
public static function macro($name, $macro)
{
\Illuminate\Auth\SessionGuard::macro($name, $macro);
}
/**
* Mix another object into the class.
*
* @param object $mixin
* @return void
* @static
*/
public static function mixin($mixin)
{
\Illuminate\Auth\SessionGuard::mixin($mixin);
}
/**
* Checks if macro is registered.
*
* @param string $name
* @return bool
* @static
*/
public static function hasMacro($name)
{
return \Illuminate\Auth\SessionGuard::hasMacro($name);
}
}
class Blade {
/**
* Compile the view at the given path.
*
* @param string $path
* @return void
* @static
*/
public static function compile($path = null)
{
\Illuminate\View\Compilers\BladeCompiler::compile($path);
}
/**
* Get the path currently being compiled.
*
* @return string
* @static
*/
public static function getPath()
{
return \Illuminate\View\Compilers\BladeCompiler::getPath();
}
/**
* Set the path currently being compiled.
*
* @param string $path
* @return void
* @static
*/
public static function setPath($path)
{
\Illuminate\View\Compilers\BladeCompiler::setPath($path);
}
/**
* Compile the given Blade template contents.
*
* @param string $value
* @return string
* @static
*/
public static function compileString($value)
{
return \Illuminate\View\Compilers\BladeCompiler::compileString($value);
}
/**
* Strip the parentheses from the given expression.
*
* @param string $expression
* @return string
* @static
*/
public static function stripParentheses($expression)
{
return \Illuminate\View\Compilers\BladeCompiler::stripParentheses($expression);
}
/**
* Register a custom Blade compiler.
*
* @param callable $compiler
* @return void
* @static
*/
public static function extend($compiler)
{
\Illuminate\View\Compilers\BladeCompiler::extend($compiler);
}
/**
* Get the extensions used by the compiler.
*
* @return array
* @static
*/
public static function getExtensions()
{
return \Illuminate\View\Compilers\BladeCompiler::getExtensions();
}
/**
* Register an "if" statement directive.
*
* @param string $name
* @param callable $callback
* @return void
* @static
*/
public static function if($name, $callback)
{
\Illuminate\View\Compilers\BladeCompiler::if($name, $callback);
}
/**
* Check the result of a condition.
*
* @param string $name
* @param array $parameters
* @return bool
* @static
*/
public static function check($name, $parameters = null)
{
return \Illuminate\View\Compilers\BladeCompiler::check($name, $parameters);
}
/**
* Register a handler for custom directives.
*
* @param string $name
* @param callable $handler
* @return void
* @static
*/
public static function directive($name, $handler)
{
\Illuminate\View\Compilers\BladeCompiler::directive($name, $handler);
}
/**
* Get the list of custom directives.
*
* @return array
* @static
*/
public static function getCustomDirectives()
{
return \Illuminate\View\Compilers\BladeCompiler::getCustomDirectives();
}
/**
* Set the echo format to be used by the compiler.
*
* @param string $format
* @return void
* @static
*/
public static function setEchoFormat($format)
{
\Illuminate\View\Compilers\BladeCompiler::setEchoFormat($format);
}
/**
* Get the path to the compiled version of a view.
*
* @param string $path
* @return string
* @static
*/
public static function getCompiledPath($path)
{
//Method inherited from \Illuminate\View\Compilers\Compiler
return \Illuminate\View\Compilers\BladeCompiler::getCompiledPath($path);
}
/**
* Determine if the view at the given path is expired.
*
* @param string $path
* @return bool
* @static
*/
public static function isExpired($path)
{
//Method inherited from \Illuminate\View\Compilers\Compiler
return \Illuminate\View\Compilers\BladeCompiler::isExpired($path);
}
/**
* Compile the default values for the echo statement.
*
* @param string $value
* @return string
* @static
*/
public static function compileEchoDefaults($value)
{
return \Illuminate\View\Compilers\BladeCompiler::compileEchoDefaults($value);
}
}
class Broadcast {
/**
* Register the routes for handling broadcast authentication and sockets.
*
* @param array|null $attributes
* @return void
* @static
*/
public static function routes($attributes = null)
{
\Illuminate\Broadcasting\BroadcastManager::routes($attributes);
}
/**
* Get the socket ID for the given request.
*
* @param \Illuminate\Http\Request|null $request
* @return string|null
* @static
*/
public static function socket($request = null)
{
return \Illuminate\Broadcasting\BroadcastManager::socket($request);
}
/**
* Begin broadcasting an event.
*
* @param mixed|null $event
* @return \Illuminate\Broadcasting\PendingBroadcast|void
* @static
*/
public static function event($event = null)
{
return \Illuminate\Broadcasting\BroadcastManager::event($event);
}
/**
* Queue the given event for broadcast.
*
* @param mixed $event
* @return void
* @static
*/
public static function queue($event)
{
\Illuminate\Broadcasting\BroadcastManager::queue($event);
}
/**
* Get a driver instance.
*
* @param string $driver
* @return mixed
* @static
*/
public static function connection($driver = null)
{
return \Illuminate\Broadcasting\BroadcastManager::connection($driver);
}
/**
* Get a driver instance.
*
* @param string $name
* @return mixed
* @static
*/
public static function driver($name = null)
{
return \Illuminate\Broadcasting\BroadcastManager::driver($name);
}
/**
* Get the default driver name.
*
* @return string
* @static
*/
public static function getDefaultDriver()
{
return \Illuminate\Broadcasting\BroadcastManager::getDefaultDriver();
}
/**
* Set the default driver name.
*
* @param string $name
* @return void
* @static
*/
public static function setDefaultDriver($name)
{
\Illuminate\Broadcasting\BroadcastManager::setDefaultDriver($name);
}
/**
* Register a custom driver creator Closure.
*
* @param string $driver
* @param \Closure $callback
* @return $this
* @static
*/
public static function extend($driver, $callback)
{
return \Illuminate\Broadcasting\BroadcastManager::extend($driver, $callback);
}
}
class Bus {
/**
* Dispatch a command to its appropriate handler.
*
* @param mixed $command
* @return mixed
* @static
*/
public static function dispatch($command)
{
return \Illuminate\Bus\Dispatcher::dispatch($command);
}
/**
* Dispatch a command to its appropriate handler in the current process.
*
* @param mixed $command
* @param mixed $handler
* @return mixed
* @static
*/
public static function dispatchNow($command, $handler = null)
{
return \Illuminate\Bus\Dispatcher::dispatchNow($command, $handler);
}
/**
* Determine if the given command has a handler.
*
* @param mixed $command
* @return bool
* @static
*/
public static function hasCommandHandler($command)
{
return \Illuminate\Bus\Dispatcher::hasCommandHandler($command);
}
/**
* Retrieve the handler for a command.
*
* @param mixed $command
* @return bool|mixed
* @static
*/
public static function getCommandHandler($command)
{
return \Illuminate\Bus\Dispatcher::getCommandHandler($command);
}
/**
* Dispatch a command to its appropriate handler behind a queue.
*
* @param mixed $command
* @return mixed
* @throws \RuntimeException
* @static
*/
public static function dispatchToQueue($command)
{
return \Illuminate\Bus\Dispatcher::dispatchToQueue($command);
}
/**
* Set the pipes through which commands should be piped before dispatching.
*
* @param array $pipes
* @return $this
* @static
*/
public static function pipeThrough($pipes)
{
return \Illuminate\Bus\Dispatcher::pipeThrough($pipes);
}
/**
* Map a command to a handler.
*
* @param array $map
* @return $this
* @static
*/
public static function map($map)
{
return \Illuminate\Bus\Dispatcher::map($map);
}
}
class Cache {
/**
* Get a cache store instance by name.
*
* @param string|null $name
* @return \Illuminate\Contracts\Cache\Repository
* @static
*/
public static function store($name = null)
{
return \Illuminate\Cache\CacheManager::store($name);
}
/**
* Get a cache driver instance.
*
* @param string $driver
* @return mixed
* @static
*/
public static function driver($driver = null)
{
return \Illuminate\Cache\CacheManager::driver($driver);
}
/**
* Create a new cache repository with the given implementation.
*
* @param \Illuminate\Contracts\Cache\Store $store
* @return \Illuminate\Cache\Repository
* @static
*/
public static function repository($store)
{
return \Illuminate\Cache\CacheManager::repository($store);
}
/**
* Get the default cache driver name.
*
* @return string
* @static
*/
public static function getDefaultDriver()
{
return \Illuminate\Cache\CacheManager::getDefaultDriver();
}
/**
* Set the default cache driver name.
*
* @param string $name
* @return void
* @static
*/
public static function setDefaultDriver($name)
{
\Illuminate\Cache\CacheManager::setDefaultDriver($name);
}
/**
* Register a custom driver creator Closure.
*
* @param string $driver
* @param \Closure $callback
* @return $this
* @static
*/
public static function extend($driver, $callback)
{
return \Illuminate\Cache\CacheManager::extend($driver, $callback);
}
/**
* Determine if an item exists in the cache.
*
* @param string $key
* @return bool
* @static
*/
public static function has($key)
{
return \Illuminate\Cache\Repository::has($key);
}
/**
* Retrieve an item from the cache by key.
*
* @param string $key
* @param mixed $default
* @return mixed
* @static
*/
public static function get($key, $default = null)
{
return \Illuminate\Cache\Repository::get($key, $default);
}
/**
* Retrieve multiple items from the cache by key.
*
* Items not found in the cache will have a null value.
*
* @param array $keys
* @return array
* @static
*/
public static function many($keys)
{
return \Illuminate\Cache\Repository::many($keys);
}
/**
* Obtains multiple cache items by their unique keys.
*
* @param \Psr\SimpleCache\iterable $keys A list of keys that can obtained in a single operation.
* @param mixed $default Default value to return for keys that do not exist.
* @return \Psr\SimpleCache\iterable A list of key => value pairs. Cache keys that do not exist or are stale will have $default as value.
* @throws \Psr\SimpleCache\InvalidArgumentException
* MUST be thrown if $keys is neither an array nor a Traversable,
* or if any of the $keys are not a legal value.
* @static
*/
public static function getMultiple($keys, $default = null)
{
return \Illuminate\Cache\Repository::getMultiple($keys, $default);
}
/**
* Retrieve an item from the cache and delete it.
*
* @param string $key
* @param mixed $default
* @return mixed
* @static
*/
public static function pull($key, $default = null)
{
return \Illuminate\Cache\Repository::pull($key, $default);
}
/**
* Store an item in the cache.
*
* @param string $key
* @param mixed $value
* @param \DateTimeInterface|\DateInterval|float|int $minutes
* @return void
* @static
*/
public static function put($key, $value, $minutes = null)
{
\Illuminate\Cache\Repository::put($key, $value, $minutes);
}
/**
* Persists data in the cache, uniquely referenced by a key with an optional expiration TTL time.
*
* @param string $key The key of the item to store.
* @param mixed $value The value of the item to store, must be serializable.
* @param null|int|\DateInterval $ttl Optional. The TTL value of this item. If no value is sent and
* the driver supports TTL then the library may set a default value
* for it or let the driver take care of that.
* @return bool True on success and false on failure.
* @throws \Psr\SimpleCache\InvalidArgumentException
* MUST be thrown if the $key string is not a legal value.
* @static
*/
public static function set($key, $value, $ttl = null)
{
return \Illuminate\Cache\Repository::set($key, $value, $ttl);
}
/**
* Store multiple items in the cache for a given number of minutes.
*
* @param array $values
* @param \DateTimeInterface|\DateInterval|float|int $minutes
* @return void
* @static
*/
public static function putMany($values, $minutes)
{
\Illuminate\Cache\Repository::putMany($values, $minutes);
}
/**
* Persists a set of key => value pairs in the cache, with an optional TTL.
*
* @param \Psr\SimpleCache\iterable $values A list of key => value pairs for a multiple-set operation.
* @param null|int|\DateInterval $ttl Optional. The TTL value of this item. If no value is sent and
* the driver supports TTL then the library may set a default value
* for it or let the driver take care of that.
* @return bool True on success and false on failure.
* @throws \Psr\SimpleCache\InvalidArgumentException
* MUST be thrown if $values is neither an array nor a Traversable,
* or if any of the $values are not a legal value.
* @static
*/
public static function setMultiple($values, $ttl = null)
{
return \Illuminate\Cache\Repository::setMultiple($values, $ttl);
}
/**
* Store an item in the cache if the key does not exist.
*
* @param string $key
* @param mixed $value
* @param \DateTimeInterface|\DateInterval|float|int $minutes
* @return bool
* @static
*/
public static function add($key, $value, $minutes)
{
return \Illuminate\Cache\Repository::add($key, $value, $minutes);
}
/**
* Increment the value of an item in the cache.
*
* @param string $key
* @param mixed $value
* @return int|bool
* @static
*/
public static function increment($key, $value = 1)
{
return \Illuminate\Cache\Repository::increment($key, $value);
}
/**
* Decrement the value of an item in the cache.
*
* @param string $key
* @param mixed $value
* @return int|bool
* @static
*/
public static function decrement($key, $value = 1)
{
return \Illuminate\Cache\Repository::decrement($key, $value);
}
/**
* Store an item in the cache indefinitely.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function forever($key, $value)
{
\Illuminate\Cache\Repository::forever($key, $value);
}
/**
* Get an item from the cache, or store the default value.
*
* @param string $key
* @param \DateTimeInterface|\DateInterval|float|int $minutes
* @param \Closure $callback
* @return mixed
* @static
*/
public static function remember($key, $minutes, $callback)
{
return \Illuminate\Cache\Repository::remember($key, $minutes, $callback);
}
/**
* Get an item from the cache, or store the default value forever.
*
* @param string $key
* @param \Closure $callback
* @return mixed
* @static
*/
public static function sear($key, $callback)
{
return \Illuminate\Cache\Repository::sear($key, $callback);
}
/**
* Get an item from the cache, or store the default value forever.
*
* @param string $key
* @param \Closure $callback
* @return mixed
* @static
*/
public static function rememberForever($key, $callback)
{
return \Illuminate\Cache\Repository::rememberForever($key, $callback);
}
/**
* Remove an item from the cache.
*
* @param string $key
* @return bool
* @static
*/
public static function forget($key)
{
return \Illuminate\Cache\Repository::forget($key);
}
/**
* Delete an item from the cache by its unique key.
*
* @param string $key The unique cache key of the item to delete.
* @return bool True if the item was successfully removed. False if there was an error.
* @throws \Psr\SimpleCache\InvalidArgumentException
* MUST be thrown if the $key string is not a legal value.
* @static
*/
public static function delete($key)
{
return \Illuminate\Cache\Repository::delete($key);
}
/**
* Deletes multiple cache items in a single operation.
*
* @param \Psr\SimpleCache\iterable $keys A list of string-based keys to be deleted.
* @return bool True if the items were successfully removed. False if there was an error.
* @throws \Psr\SimpleCache\InvalidArgumentException
* MUST be thrown if $keys is neither an array nor a Traversable,
* or if any of the $keys are not a legal value.
* @static
*/
public static function deleteMultiple($keys)
{
return \Illuminate\Cache\Repository::deleteMultiple($keys);
}
/**
* Wipes clean the entire cache's keys.
*
* @return bool True on success and false on failure.
* @static
*/
public static function clear()
{
return \Illuminate\Cache\Repository::clear();
}
/**
* Begin executing a new tags operation if the store supports it.
*
* @param array|mixed $names
* @return \Illuminate\Cache\TaggedCache
* @throws \BadMethodCallException
* @static
*/
public static function tags($names)
{
return \Illuminate\Cache\Repository::tags($names);
}
/**
* Get the default cache time.
*
* @return float|int
* @static
*/
public static function getDefaultCacheTime()
{
return \Illuminate\Cache\Repository::getDefaultCacheTime();
}
/**
* Set the default cache time in minutes.
*
* @param float|int $minutes
* @return $this
* @static
*/
public static function setDefaultCacheTime($minutes)
{
return \Illuminate\Cache\Repository::setDefaultCacheTime($minutes);
}
/**
* Get the cache store implementation.
*
* @return \Illuminate\Contracts\Cache\Store
* @static
*/
public static function getStore()
{
return \Illuminate\Cache\Repository::getStore();
}
/**
* Set the event dispatcher instance.
*
* @param \Illuminate\Contracts\Events\Dispatcher $events
* @return void
* @static
*/
public static function setEventDispatcher($events)
{
\Illuminate\Cache\Repository::setEventDispatcher($events);
}
/**
* Determine if a cached value exists.
*
* @param string $key
* @return bool
* @static
*/
public static function offsetExists($key)
{
return \Illuminate\Cache\Repository::offsetExists($key);
}
/**
* Retrieve an item from the cache by key.
*
* @param string $key
* @return mixed
* @static
*/
public static function offsetGet($key)
{
return \Illuminate\Cache\Repository::offsetGet($key);
}
/**
* Store an item in the cache for the default time.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function offsetSet($key, $value)
{
\Illuminate\Cache\Repository::offsetSet($key, $value);
}
/**
* Remove an item from the cache.
*
* @param string $key
* @return void
* @static
*/
public static function offsetUnset($key)
{
\Illuminate\Cache\Repository::offsetUnset($key);
}
/**
* Register a custom macro.
*
* @param string $name
* @param object|callable $macro
* @return void
* @static
*/
public static function macro($name, $macro)
{
\Illuminate\Cache\Repository::macro($name, $macro);
}
/**
* Mix another object into the class.
*
* @param object $mixin
* @return void
* @static
*/
public static function mixin($mixin)
{
\Illuminate\Cache\Repository::mixin($mixin);
}
/**
* Checks if macro is registered.
*
* @param string $name
* @return bool
* @static
*/
public static function hasMacro($name)
{
return \Illuminate\Cache\Repository::hasMacro($name);
}
/**
* Dynamically handle calls to the class.
*
* @param string $method
* @param array $parameters
* @return mixed
* @throws \BadMethodCallException
* @static
*/
public static function macroCall($method, $parameters)
{
return \Illuminate\Cache\Repository::macroCall($method, $parameters);
}
/**
* Remove all items from the cache.
*
* @return bool
* @static
*/
public static function flush()
{
return \Illuminate\Cache\FileStore::flush();
}
/**
* Get the Filesystem instance.
*
* @return \Illuminate\Filesystem\Filesystem
* @static
*/
public static function getFilesystem()
{
return \Illuminate\Cache\FileStore::getFilesystem();
}
/**
* Get the working directory of the cache.
*
* @return string
* @static
*/
public static function getDirectory()
{
return \Illuminate\Cache\FileStore::getDirectory();
}
/**
* Get the cache key prefix.
*
* @return string
* @static
*/
public static function getPrefix()
{
return \Illuminate\Cache\FileStore::getPrefix();
}
}
class Config {
/**
* Determine if the given configuration value exists.
*
* @param string $key
* @return bool
* @static
*/
public static function has($key)
{
return \Illuminate\Config\Repository::has($key);
}
/**
* Get the specified configuration value.
*
* @param array|string $key
* @param mixed $default
* @return mixed
* @static
*/
public static function get($key, $default = null)
{
return \Illuminate\Config\Repository::get($key, $default);
}
/**
* Get many configuration values.
*
* @param array $keys
* @return array
* @static
*/
public static function getMany($keys)
{
return \Illuminate\Config\Repository::getMany($keys);
}
/**
* Set a given configuration value.
*
* @param array|string $key
* @param mixed $value
* @return void
* @static
*/
public static function set($key, $value = null)
{
\Illuminate\Config\Repository::set($key, $value);
}
/**
* Prepend a value onto an array configuration value.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function prepend($key, $value)
{
\Illuminate\Config\Repository::prepend($key, $value);
}
/**
* Push a value onto an array configuration value.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function push($key, $value)
{
\Illuminate\Config\Repository::push($key, $value);
}
/**
* Get all of the configuration items for the application.
*
* @return array
* @static
*/
public static function all()
{
return \Illuminate\Config\Repository::all();
}
/**
* Determine if the given configuration option exists.
*
* @param string $key
* @return bool
* @static
*/
public static function offsetExists($key)
{
return \Illuminate\Config\Repository::offsetExists($key);
}
/**
* Get a configuration option.
*
* @param string $key
* @return mixed
* @static
*/
public static function offsetGet($key)
{
return \Illuminate\Config\Repository::offsetGet($key);
}
/**
* Set a configuration option.
*
* @param string $key
* @param mixed $value
* @return void
* @static
*/
public static function offsetSet($key, $value)
{
\Illuminate\Config\Repository::offsetSet($key, $value);
}
/**
* Unset a configuration option.
*
* @param string $key
* @return void
* @static
*/
public static function offsetUnset($key)
|
{
"url": "https://gist.github.com/barryvdh/5227822",
"source_domain": "gist.github.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "1050508",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6CNNNT5FRBQETEKXFMYWVBRBAOQPUIBQ",
"WARC-Concurrent-To": "<urn:uuid:9fe76b89-3e99-4f9c-aebe-e7ff2bf965db>",
"WARC-Date": "2018-06-20T02:16:52Z",
"WARC-IP-Address": "192.30.253.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QH2TPMUJMOMESBNPWRTWMCGY5ZFVAVCY",
"WARC-Record-ID": "<urn:uuid:ff7220a7-567e-49e9-89f0-f549222e0bf2>",
"WARC-Target-URI": "https://gist.github.com/barryvdh/5227822",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:342a4bb0-8fc8-4cdb-88df-ec0c4274e4d1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-136-156-31.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,
18,
19,
62,
63,
69,
203,
209,
213,
292,
338,
340,
388,
442,
445,
457,
526,
528,
567,
579,
583,
628,
630,
647,
657,
660,
693,
695,
749,
751,
755,
799,
801,
831,
846,
856,
859,
912,
914,
981,
983,
987,
1047,
1049,
1077,
1092,
1102,
1105,
1163,
1165,
1237,
1239,
1243,
1295,
1297,
1327,
1355,
1370,
1380,
1383,
1452,
1454,
1537,
1539,
1543,
1594,
1596,
1626,
1654,
1669,
1679,
1682,
1750,
1752,
1834,
1836,
1840,
1901,
1903,
1918,
1928,
1931,
1976,
1978,
2044,
2046,
2050,
2091,
2093,
2119,
2135,
2145,
2148,
2194,
2196,
2263,
2265,
2269,
2320,
2322,
2389,
2406,
2416,
2419,
2459,
2461,
2517,
2519,
2523,
2572,
2574,
2642,
2659,
2669,
2672,
2716,
2718,
2778,
2780,
2784,
2827,
2829,
2902,
2919,
2929,
2932,
2981,
2983,
3048,
3050,
3054,
3109,
3111,
3181,
3198,
3208,
3211,
3257,
3259,
3321,
3323,
3327,
3369,
3371,
3443,
3460,
3470,
3473,
3521,
3523,
3587,
3589,
3593,
3623,
3625,
3647,
3663,
3673,
3676,
3722,
3724,
3791,
3793,
3797,
3835,
3837,
3854,
3864,
3867,
3901,
3903,
3958,
3960,
3964,
4010,
4012,
4029,
4039,
4042,
4078,
4080,
4137,
4139,
4143,
4184,
4186,
4203,
4213,
4216,
4253,
4255,
4313,
4315,
4319,
4348,
4350,
4372,
4388,
4398,
4401,
4446,
4448,
4514,
4516,
4520,
4563,
4565,
4587,
4604,
4614,
4617,
4665,
4667,
4731,
4733,
4737,
4787,
4789,
4806,
4816,
4819,
4860,
4862,
4924,
4926,
4930,
4976,
4978,
5000,
5016,
5026,
5029,
5078,
5080,
5150,
5152,
5156,
5218,
5220,
5242,
5258,
5268,
5271,
5321,
5323,
5394,
5396,
5400,
5453,
5455,
5472,
5482,
5485,
5526,
5528,
5590,
5592,
5596,
5652,
5654,
5671,
5681,
5684,
5729,
5731,
5797,
5799,
5803,
5855,
5857,
5879,
5889,
5892,
5929,
5931,
5989,
5991,
5995,
6047,
6049,
6064,
6074,
6077,
6110,
6112,
6166,
6168,
6172,
6220,
6222,
6250,
6267,
6277,
6280,
6332,
6334,
6407,
6409,
6413,
6459,
6461,
6476,
6486,
6489,
6531,
6533,
6596,
6598,
6602,
6644,
6646,
6661,
6671,
6674,
6716,
6718,
6781,
6783,
6787,
6831,
6833,
6848,
6858,
6861,
6914,
6916,
6983,
6985,
6989,
7041,
7043,
7105,
7129,
7150,
7196,
7206,
7209,
7288,
7290,
7372,
7374,
7378,
7439,
7441,
7503,
7554,
7564,
7567,
7613,
7615,
7682,
7684,
7688,
7747,
7749,
7775,
7821,
7831,
7834,
7884,
7886,
7957,
7959,
7963,
8020,
8022,
8037,
8047,
8050,
8097,
8099,
8160,
8162,
8166,
8210,
8212,
8237,
8252,
8262,
8265,
8319,
8321,
8389,
8391,
8395,
8439,
8441,
8467,
8497,
8512,
8522,
8525,
8601,
8603,
8686,
8688,
8692,
8737,
8739,
8770,
8772,
8798,
8825,
8841,
8851,
8854,
8916,
8918,
8991,
8993,
8997,
9052,
9054,
9086,
9088,
9114,
9129,
9139,
9142,
9182,
9184,
9245,
9247,
9251,
9294,
9296,
9311,
9321,
9324,
9358,
9360,
9415,
9417,
9421,
9465,
9467,
9482,
9492,
9495,
9525,
9527,
9571,
9573,
9577,
9609,
9611,
9636,
9651,
9661,
9664,
9706,
9708,
9764,
9766,
9770,
9806,
9808,
9833,
9848,
9858,
9861,
9902,
9904,
9959,
9961,
9965,
9981,
9983,
9993,
9996,
10062,
10064,
10140,
10142,
10146,
10211,
10213,
10228,
10238,
10241,
10287,
10289,
10356,
10358,
10362,
10410,
10412,
10429,
10439,
10442,
10489,
10491,
10559,
10561,
10565,
10613,
10615,
10632,
10642,
10645,
10692,
10694,
10762,
10764,
10768,
10824,
10826,
10841,
10851,
10854,
10901,
10903,
10971,
10973,
10977,
11025,
11027,
11044,
11054,
11057,
11102,
11104,
11170,
11172,
11176,
11226,
11228,
11243,
11253,
11256,
11297,
11299,
11361,
11363,
11367,
11408,
11410,
11427,
11437,
11440,
11485,
11487,
11553,
11555,
11559,
11625,
11627,
11642,
11652,
11655,
11701,
11703,
11770,
11772,
11776,
11822,
11824,
11843,
11868,
11892,
11907,
11971,
11981,
11984,
12055,
12057,
12127,
12129,
12133,
12189,
12191,
12219,
12235,
12245,
12248,
12294,
12296,
12363,
12365,
12369,
12398,
12400,
12415,
12425,
12428,
12463,
12465,
12514,
12516,
12520,
12571,
12573,
12589,
12599,
12602,
12646,
12648,
12713,
12715,
12719,
12762,
12764,
12780,
12790,
12793,
12838,
12840,
12906,
12908,
12912,
12955,
12957,
12982,
12997,
13007,
13010,
13064,
13066,
13134,
13136,
13140,
13207,
13209,
13234,
13249,
13259,
13262,
13316,
13318,
13386,
13388,
13392,
13448,
13450,
13475,
13490,
13500,
13503,
13554,
13556,
13628,
13630,
13634,
13678,
13680,
13707,
13722,
13732,
13735,
13785,
13787,
13851,
13853,
13857,
13910,
13912,
13940,
13956,
13966,
13969,
14025,
14027,
14104,
14106,
14110,
14176,
14178,
14193,
14203,
14206,
14254,
14256,
14325,
14327,
14331,
14390,
14392,
14411,
14421,
14424,
14472,
14474,
14543,
14545,
14549,
14587,
14589,
14606,
14616,
14619,
14654,
14656,
14712,
14714,
14718,
14756,
14758,
14782,
14797,
14807,
14810,
14852,
14854,
14910,
14912,
14916,
14971,
14973,
14997,
15012,
15022,
15025,
15066,
15068,
15130,
15132,
15136,
15188,
15190,
15205,
15215,
15218,
15272,
15274,
15342,
15344,
15348,
15410,
15412,
15427,
15437,
15440,
15471,
15473,
15518,
15520,
15524,
15557,
15559,
15576,
15604,
15614,
15617,
15655,
15657,
15716,
15718,
15722,
15753,
15755,
15781,
15848,
15858,
15861,
15900,
15902,
15958,
16018,
16020,
16024,
16102,
16104,
16131,
16133,
16220,
16306,
16308,
16365,
16380,
16390,
16393,
16425,
16427,
16483,
16536,
16538,
16542,
16600,
16602,
16628,
16643,
16653,
16656,
16699,
16701,
16757,
16821,
16823,
16827,
16866,
16868,
16894,
16909,
16919,
16922,
16965,
16967,
17023,
17087,
17089,
17093,
17136,
17138,
17160,
17175,
17185,
17188,
17226,
17228,
17284,
17343,
17345,
17349,
17390,
17392,
17424,
17464,
17486,
17501,
17511,
17514,
17588,
17590,
17646,
17719,
17721,
17725,
17776,
17778,
17802,
17817,
17827,
17830,
17879,
17881,
17937,
18007,
18009,
18013,
18064,
18066,
18090,
18118,
18133,
18143,
18146,
18200,
18202,
18258,
18326,
18328,
18332,
18379,
18381,
18405,
18430,
18446,
18456,
18459,
18520,
18522,
18578,
18660,
18662,
18666,
18711,
18713,
18739,
18765,
18806,
18821,
18831,
18834,
18917,
18919,
18975,
19072,
19074,
19078,
19137,
19139,
19165,
19205,
19227,
19242,
19252,
19255,
19331,
19333,
19389,
19464,
19466,
19470,
19516,
19518,
19550,
19590,
19605,
19615,
19618,
19680,
19682,
19738,
19807,
19809,
19813,
19859,
19861,
19887,
19914,
19929,
19965,
19975,
19978,
20029,
20031,
20087,
20152,
20154,
20158,
20218,
20220,
20246,
20271,
20287,
20297,
20300,
20354,
20356,
20412,
20487,
20489,
20493,
20536,
20538,
20571,
20598,
20613,
20623,
20626,
20672,
20674,
20730,
20790,
20792,
20796,
20843,
20845,
20866,
20882,
20892,
20895,
20931,
20933,
20989,
21046,
21048,
21052,
21088,
21090,
21116,
21139,
21154,
21164,
21167,
21215,
21217,
21273,
21335,
21337,
21341,
21394,
21396,
21422,
21450,
21466,
21476,
21479,
21534,
21536,
21592,
21668,
21670,
21674,
21728,
21730,
21756,
21779,
21803,
21819,
21829,
21832,
21892,
21894,
21950,
22031,
22033,
22037,
22121,
22123,
22151,
22178,
22197,
22207,
22210,
22272,
22274,
22330,
22403,
22405,
22409,
22478,
22480,
22515,
22542,
22578,
22594,
22604,
22607,
22692,
22694,
22750,
22839,
22841,
22845,
22907,
22909,
22935,
22954,
22964,
22967,
23009,
23011,
23067,
23130,
23132,
23136,
23173,
23175,
23201,
23228,
23244,
23254,
23257,
23323,
23325,
23381,
23458,
23460,
23464,
23532,
23534,
23591,
23672,
23744,
23767,
23777,
23780,
23812,
23814,
23870,
23923,
23925,
23929,
23982,
23984,
24010,
24026,
24095,
24105,
24108,
24148,
24150,
24206,
24267,
24269,
24273,
24310,
24312,
24338,
24371,
24386,
24396,
24399,
24461,
24463,
24519,
24588,
24590,
24594,
24651,
24653,
24679,
24712,
24727,
24737,
24740,
24807,
24809,
24865,
24939,
24941,
24945,
24977,
24979,
24995,
25005,
25008,
25045,
25047,
25103,
25161,
25163,
25167,
25213,
25215,
25241,
25258,
25284,
25294,
25297,
25340,
25342,
25398,
25462,
25464,
25468,
25525,
25527,
25553,
25568,
25578,
25581,
25631,
25633,
25689,
25753,
25755,
25759,
25813,
25815,
25841,
25856,
25866,
25869,
25918,
25920,
25976,
26039,
26041,
26045,
26094,
26096,
26111,
26121,
26124,
26165,
26167,
26223,
26278,
26280,
26284,
26340,
26342,
26359,
26369,
26372,
26409,
26411,
26467,
26525,
26527,
26531,
26575,
26577,
26644,
26661,
26671,
26674,
26728,
26730,
26786,
26854,
26856,
26860,
26898,
26900,
26921,
26936,
26946,
26949,
26991,
26993,
27049,
27112,
27114,
27118,
27153,
27155,
27176,
27192,
27202,
27205,
27244,
27246,
27302,
27362,
27364,
27368,
27403,
27405,
27426,
27448,
27463,
27473,
27476,
27523,
27525,
27581,
27642,
27644,
27648,
27685,
27687,
27708,
27723,
27733,
27736,
27777,
27779,
27835,
27890,
27892,
27894,
27910,
27914,
27945,
27947,
28011,
28078,
28092,
28102,
28105,
28159,
28161,
28223,
28276,
28278,
28282,
28311,
28313,
28377,
28398,
28413,
28423,
28426,
28476,
28478,
28540,
28589,
28591,
28595,
28652,
28654,
28681,
28709,
28765,
28775,
28778,
28832,
28834,
28896,
28956,
28958,
28962,
29021,
29023,
29084,
29099,
29109,
29112,
29161,
29163,
29225,
29273,
29275,
29279,
29321,
29323,
29348,
29375,
29448,
29462,
29472,
29475,
29558,
29560,
29622,
29694,
29696,
29700,
29735,
29737,
29762,
29789,
29842,
29852,
29855,
29917,
29919,
29981,
30039,
30041,
30045,
30100,
30102,
30118,
30128,
30131,
30160,
30162,
30224,
30259,
30261,
30265,
30308,
30310,
30327,
30337,
30340,
30372,
30374,
30436,
30474,
30476,
30480,
30530,
30532,
30547,
30557,
30560,
30595,
30597,
30659,
30693,
30695,
30699,
30739,
30741,
30791,
30806,
30816,
30819,
30863,
30865,
30927,
30970,
30972,
30974,
30987,
30991,
31040,
31042,
31064,
31148,
31158,
31161,
31204,
31206,
31257,
31259,
31263,
31310,
31312,
31334,
31357,
31397,
31407,
31410,
31469,
31471,
31545,
31547,
31551,
31596,
31598,
31620,
31643,
31681,
31691,
31694,
31751,
31753,
31825,
31827,
31831,
31877,
31879,
31896,
31906,
31909,
31951,
31953,
32010,
32012,
32016,
32073,
32075,
32097,
32112,
32122,
32125,
32165,
32167,
32215,
32217,
32221,
32267,
32269,
32291,
32306,
32316,
32319,
32366,
32368,
32423,
32425,
32429,
32476,
32478,
32502,
32530,
32546,
32556,
32559,
32613,
32615,
32684,
32686,
32690,
32724,
32726,
32745,
32755,
32758,
32796,
32798,
32851,
32853,
32857,
32905,
32907,
32939,
32955,
32965,
32968,
33024,
33026,
33097,
33099,
33103,
33147,
33149,
33173,
33201,
33217,
33227,
33230,
33280,
33282,
33347,
33349,
33353,
33399,
33401,
33423,
33451,
33467,
33477,
33480,
33530,
33532,
33597,
33599,
33603,
33661,
33663,
33694,
33749,
33785,
33795,
33798,
33858,
33860,
33928,
33930,
33934,
33972,
33974,
33991,
34001,
34004,
34052,
34054,
34117,
34119,
34123,
34163,
34165,
34190,
34200,
34203,
34233,
34235,
34281,
34283,
34287,
34338,
34340,
34359,
34369,
34372,
34400,
34402,
34446,
34448,
34452,
34515,
34517,
34545,
34560,
34570,
34573,
34625,
34627,
34685,
34687,
34691,
34765,
34767,
34786,
34812,
34822,
34825,
34865,
34867,
34923,
34925,
34929,
34962,
34964,
34992,
35007,
35017,
35020,
35076,
35078,
35140,
35142,
35146,
35195,
35197,
35220,
35252,
35310,
35320,
35323,
35398,
35400,
35471,
35473,
35477,
35525,
35527,
35550,
35582,
35640,
35650,
35653,
35732,
35734,
35809,
35811,
35815,
35877,
35879,
35907,
35931,
35946,
35956,
35959,
36033,
36035,
36107,
36109,
36113,
36159,
36161,
36180,
36204,
36230,
36240,
36243,
36303,
36305,
36373,
36375,
36379,
36414,
36416,
36474,
36498,
36513,
36523,
36526,
36581,
36583,
36639,
36641,
36645,
36684,
36686,
36701,
36711,
36714,
36746,
36748,
36789,
36791,
36795,
36848,
36850,
36875,
36890,
36900,
36903,
36948,
36950,
37004,
37006,
37010,
37060,
37062,
37082,
37092,
37095,
37137,
37139,
37197,
37199,
37203,
37257,
37259,
37276,
37286,
37289,
37322,
37324,
37373,
37375,
37379,
37438,
37440,
37457,
37467,
37470,
37511,
37513,
37570,
37572,
37576,
37644,
37646,
37661,
37671,
37674,
37711,
37713,
37766,
37768,
37772,
37825,
37827,
37882,
37910,
37920,
37923,
37961,
37963,
38017,
38019,
38023,
38076,
38078,
38140,
38155,
38165,
38168,
38213,
38215,
38269,
38271,
38275,
38312,
38314,
38364,
38374,
38377,
38416,
38418,
38473,
38475,
38479,
38516,
38518,
38575,
38590,
38600,
38603,
38649,
38651,
38706,
38708,
38712,
38755,
38757,
38806,
38816,
38819,
38855,
38857,
38909,
38911,
38915,
38951,
38953,
38978,
38988,
38991,
39024,
39026,
39075,
39077,
39081,
39105,
39107,
39165,
39181,
39191,
39194,
39232,
39234,
39288,
39290,
39294,
39330,
39332,
39384,
39394,
39397,
39433,
39435,
39487,
39489,
39493,
39529,
39531,
39591,
39607,
39617,
39620,
39664,
39666,
39726,
39728,
39732,
39782,
39784,
39804,
39855,
39865,
39868,
39906,
39908,
39962,
39964,
39968,
40018,
40020,
40035,
40045,
40048,
40079,
40081,
40128,
40130,
40134,
40178,
40180,
40195,
40205,
40208,
40239,
40241,
40288,
40290,
40294,
40337,
40339,
40389,
40399,
40402,
40439,
40441,
40494,
40496,
40500,
40543,
40545,
40604,
40619,
40629,
40632,
40678,
40680,
40735,
40737,
40741,
40768,
40770,
40792,
40824,
40839,
40849,
40852,
40896,
40898,
40951,
40953,
40957,
40994,
40996,
41019,
41034,
41044,
41047,
41084,
41086,
41132,
41134,
41138,
41171,
41173,
41195,
41210,
41220,
41223,
41262,
41264,
41319,
41321,
41323,
41337,
41341,
41379,
41381,
41403,
41418,
41428,
41431,
41476,
41478,
41536,
41538,
41542,
41583,
41585,
41602,
41612,
41615,
41648,
41650,
41710,
41712,
41716,
41757,
41759,
41781,
41796,
41806,
41809,
41847,
41849,
41907,
41909,
41913,
41958,
41960,
41983,
42000,
42010,
42013,
42058,
42060,
42132,
42134,
42138,
42189,
42191,
42219,
42236,
42246,
42249,
42302,
42304,
42384,
42386,
42390,
42426,
42428,
42456,
42471,
42481,
42484,
42525,
42527,
42588,
42590,
42594,
42637,
42639,
42655,
42665,
42668,
42707,
42709,
42775,
42777,
42781,
42821,
42823,
42845,
42873,
42888,
42898,
42901,
42945,
42947,
43011,
43013,
43017,
43052,
43054,
43076,
43103,
43118,
43128,
43131,
43187,
43189,
43265,
43267,
43271,
43315,
43317,
43339,
43366,
43381,
43391,
43394,
43444,
43446,
43516,
43518,
43522,
43559,
43561,
43577,
43587,
43590,
43635,
43637,
43709,
43711,
43715,
43765,
43767,
43791,
43806,
43816,
43819,
43865,
43867,
43933,
43935,
43939,
43989,
43991,
44013,
44030,
44040,
44043,
44089,
44091,
44151,
44224,
44226,
44230,
44284,
44286,
44308,
44323,
44333,
44336,
44376,
44378,
44438,
44505,
44507,
44511,
44564,
44566,
44589,
44606,
44616,
44619,
44670,
44672,
44750,
44752,
44754,
44772,
44776,
44849,
44851,
44883,
44898,
44908,
44911,
44961,
44963,
45027,
45029,
45033,
45076,
45078,
45126,
45148,
45158,
45161,
45208,
45210,
45278,
45280,
45284,
45315,
45317,
45344,
45401,
45411,
45414,
45458,
45460,
45525,
45527,
45531,
45570,
45572,
45594,
45609,
45619,
45622,
45659,
45661,
45719,
45721,
45725,
45750,
45752,
45776,
45792,
45802,
45805,
45855,
45857,
45928,
45930,
45934,
45959,
45961,
45983,
45999,
46009,
46012,
46056,
46058,
46123,
46125,
46129,
46160,
46162,
46179,
46189,
46192,
46234,
46236,
46306,
46308,
46312,
46343,
46345,
46367,
46382,
46392,
46395,
46442,
46444,
46512,
46514,
46518,
46562,
46564,
46588,
46616,
46632,
46642,
46645,
46695,
46697,
46775,
46777,
46779,
46791,
46795,
46844,
46846,
46870,
46886,
46896,
46899,
46941,
46943,
46998,
47000,
47004,
47076,
47078,
47102,
47126,
47142,
47152,
47155,
47217,
47219,
47287,
47289,
47293,
47341,
47343,
47367,
47382,
47392,
47395,
47446,
47448,
47512,
47514,
47518,
47556,
47558,
47582,
47603,
47613,
47616,
47667,
47669,
47733,
47735,
47739,
47803,
47805,
47829,
47845,
47873,
47883,
47886,
47935,
47937,
47999,
48001,
48005,
48080,
48082,
48104,
48120,
48130,
48133,
48176,
48178,
48234,
48236,
48240,
48270,
48272,
48292,
48308,
48318,
48321,
48354,
48356,
48402,
48404,
48406,
48420,
48424,
48462,
48464,
48491,
48540,
48550,
48553,
48596,
48598,
48651,
48653,
48657,
48688,
48690,
48714,
48730,
48740,
48743,
48789,
48791,
48847,
48849,
48853,
48916,
48918,
48968,
49007,
49017,
49020,
49062,
49064,
49123,
49125,
49129,
49166,
49168,
49185,
49195,
49198,
49240,
49242,
49301,
49303,
49307,
49344,
49346,
49368,
49383,
49393,
49396,
49443,
49445,
49502,
49504,
49508,
49552,
49554,
49578,
49606,
49622,
49632,
49635,
49685,
49687,
49754,
49756,
49760,
49804,
49806,
49827,
49842,
49852,
49855,
49888,
49890,
49938,
49940,
49944,
49986,
49988,
50009,
50033,
50049,
50059,
50062,
50112,
50114,
50172,
50174,
50178,
50227,
50229,
50284,
50286,
50307,
50323,
50333,
50336,
50371,
50373,
50423,
50425,
50429,
50482,
50484,
50581,
50657,
50794,
50846,
50911,
50959,
50969,
50972,
51031,
51033,
51100,
51102,
51106,
51155,
51157,
51178,
51202,
51218,
51228,
51231,
51282,
51284,
51343,
51345,
51349,
51379,
51381,
51402,
51424,
51485,
51500,
51510,
51513,
51571,
51573,
51632,
51634,
51638,
51735,
51737,
51788,
51864,
51963,
52030,
52076,
52129,
52181,
52239,
52249,
52252,
52306,
52308,
52370,
52372,
52376,
52443,
52445,
52468,
52529,
52544,
52554,
52557,
52607,
52609,
52667,
52669,
52673,
52748,
52750,
52852,
52951,
53018,
53064,
53117,
53169,
53236,
53286,
53296,
53299,
53356,
53358,
53423,
53425,
53429,
53485,
53487,
53508,
53530,
53591,
53606,
53616,
53619,
53670,
53672,
53738,
53740,
53744,
53791,
53793,
53814,
53836,
53855,
53865,
53868,
53919,
53921,
53983,
53985,
53989,
54036,
54038,
54059,
54081,
54100,
54110,
54113,
54164,
54166,
54228,
54230,
54234,
54277,
54279,
54300,
54322,
54337,
54347,
54350,
54395,
54397,
54450,
54452,
54456,
54514,
54516,
54537,
54598,
54626,
54642,
54652,
54655,
54714,
54716,
54790,
54792,
54796,
54862,
54864,
54885,
54913,
54929,
54939,
54942,
54987,
54989,
55049,
55051,
55055,
55121,
55123,
55144,
55172,
55188,
55198,
55201,
55257,
55259,
55330,
55332,
55336,
55369,
55371,
55392,
55407,
55417,
55420,
55456,
55458,
55509,
55511,
55515,
55566,
55568,
55633,
55720,
55772,
55830,
55840,
55843,
55879,
55881,
55932,
55934,
55938,
55992,
55994,
56078,
56167,
56219,
56284,
56332,
56342,
56345,
56390,
56392,
56452,
56454,
56458,
56497,
56499,
56552,
56562,
56565,
56596,
56598,
56644,
56646,
56650,
56715,
56717,
56745,
56785,
56819,
56829,
56832,
56868,
56870,
56921,
56923,
56927,
56957,
56959,
56979,
56989,
56992,
57037,
57039,
57099,
57101,
57105,
57146,
57148,
57176,
57192,
57202,
57205,
57258,
57260,
57328,
57330,
57334,
57372,
57374,
57418,
57428,
57431,
57465,
57467,
57516,
57518,
57522,
57559,
57561,
57618,
57633,
57643,
57646,
57697,
57699,
57758,
57760,
57764,
57802,
57804,
57825,
57840,
57850,
57853,
57895,
57897,
57954,
57956,
57960,
58002,
58004,
58025,
58041,
58051,
58054,
58093,
58095,
58149,
58151,
58155,
58206,
58208,
58229,
58251,
58266,
58276,
58279,
58326,
58328,
58383,
58385,
58389,
58422,
58424,
58445,
58460,
58470,
58473,
58514,
58516,
58565,
58567,
58571,
58598,
58600,
58622,
58654,
58669,
58679,
58682,
58726,
58728,
58780,
58782,
58786,
58823,
58825,
58848,
58863,
58873,
58876,
58913,
58915,
58960,
58962,
58966,
58999,
59001,
59023,
59038,
59048,
59051,
59090,
59092,
59146,
59148,
59152,
59193,
59195,
59219,
59246,
59262,
59296,
59306,
59309,
59364,
59366,
59436,
59438,
59442,
59477,
59479,
59494,
59504,
59507,
59538,
59540,
59585,
59587,
59591,
59622,
59624,
59668,
59678,
59681,
59720,
59722,
59775,
59777,
59781,
59823,
59825,
59842,
59852,
59855,
59893,
59895,
59947,
59949,
59953,
59981,
59983,
60000,
60010,
60013,
60048,
60050,
60099,
60101,
60103,
60118,
60122,
60175,
60177,
60198,
60213,
60223,
60226,
60259,
60261,
60310,
60312,
60316,
60357,
60359,
60386,
60410,
60426,
60436,
60439,
60489,
60491,
60550,
60552,
60556,
60589,
60591,
60612,
60628,
60638,
60641,
60679,
60681,
60735,
60737,
60741,
60776,
60778,
60805,
60827,
60842,
60852,
60855,
60903,
60905,
60955,
60957,
60961,
61014,
61016,
61037,
61059,
61074,
61084,
61087,
61132,
61134,
61188,
61190,
61194,
61244,
61246,
61267,
61289,
61304,
61314,
61317,
61359,
61361,
61412,
61414,
61418,
61476,
61478,
61494,
61504,
61507,
61536,
61538,
61583,
61585,
61589,
61643,
61645,
61666,
61681,
61691,
61694,
61736,
61738,
61796,
61798,
61802,
61832,
61834,
61855,
61871,
61881,
61884,
61923,
61925,
61980,
61982,
61986,
62016,
62018,
62039,
62061,
62076,
62086,
62089,
62136,
62138,
62194,
62196,
62200,
62232,
62234,
62255,
62270,
62280,
62283
],
"line_end_idx": [
18,
19,
62,
63,
69,
203,
209,
213,
292,
338,
340,
388,
442,
445,
457,
526,
528,
567,
579,
583,
628,
630,
647,
657,
660,
693,
695,
749,
751,
755,
799,
801,
831,
846,
856,
859,
912,
914,
981,
983,
987,
1047,
1049,
1077,
1092,
1102,
1105,
1163,
1165,
1237,
1239,
1243,
1295,
1297,
1327,
1355,
1370,
1380,
1383,
1452,
1454,
1537,
1539,
1543,
1594,
1596,
1626,
1654,
1669,
1679,
1682,
1750,
1752,
1834,
1836,
1840,
1901,
1903,
1918,
1928,
1931,
1976,
1978,
2044,
2046,
2050,
2091,
2093,
2119,
2135,
2145,
2148,
2194,
2196,
2263,
2265,
2269,
2320,
2322,
2389,
2406,
2416,
2419,
2459,
2461,
2517,
2519,
2523,
2572,
2574,
2642,
2659,
2669,
2672,
2716,
2718,
2778,
2780,
2784,
2827,
2829,
2902,
2919,
2929,
2932,
2981,
2983,
3048,
3050,
3054,
3109,
3111,
3181,
3198,
3208,
3211,
3257,
3259,
3321,
3323,
3327,
3369,
3371,
3443,
3460,
3470,
3473,
3521,
3523,
3587,
3589,
3593,
3623,
3625,
3647,
3663,
3673,
3676,
3722,
3724,
3791,
3793,
3797,
3835,
3837,
3854,
3864,
3867,
3901,
3903,
3958,
3960,
3964,
4010,
4012,
4029,
4039,
4042,
4078,
4080,
4137,
4139,
4143,
4184,
4186,
4203,
4213,
4216,
4253,
4255,
4313,
4315,
4319,
4348,
4350,
4372,
4388,
4398,
4401,
4446,
4448,
4514,
4516,
4520,
4563,
4565,
4587,
4604,
4614,
4617,
4665,
4667,
4731,
4733,
4737,
4787,
4789,
4806,
4816,
4819,
4860,
4862,
4924,
4926,
4930,
4976,
4978,
5000,
5016,
5026,
5029,
5078,
5080,
5150,
5152,
5156,
5218,
5220,
5242,
5258,
5268,
5271,
5321,
5323,
5394,
5396,
5400,
5453,
5455,
5472,
5482,
5485,
5526,
5528,
5590,
5592,
5596,
5652,
5654,
5671,
5681,
5684,
5729,
5731,
5797,
5799,
5803,
5855,
5857,
5879,
5889,
5892,
5929,
5931,
5989,
5991,
5995,
6047,
6049,
6064,
6074,
6077,
6110,
6112,
6166,
6168,
6172,
6220,
6222,
6250,
6267,
6277,
6280,
6332,
6334,
6407,
6409,
6413,
6459,
6461,
6476,
6486,
6489,
6531,
6533,
6596,
6598,
6602,
6644,
6646,
6661,
6671,
6674,
6716,
6718,
6781,
6783,
6787,
6831,
6833,
6848,
6858,
6861,
6914,
6916,
6983,
6985,
6989,
7041,
7043,
7105,
7129,
7150,
7196,
7206,
7209,
7288,
7290,
7372,
7374,
7378,
7439,
7441,
7503,
7554,
7564,
7567,
7613,
7615,
7682,
7684,
7688,
7747,
7749,
7775,
7821,
7831,
7834,
7884,
7886,
7957,
7959,
7963,
8020,
8022,
8037,
8047,
8050,
8097,
8099,
8160,
8162,
8166,
8210,
8212,
8237,
8252,
8262,
8265,
8319,
8321,
8389,
8391,
8395,
8439,
8441,
8467,
8497,
8512,
8522,
8525,
8601,
8603,
8686,
8688,
8692,
8737,
8739,
8770,
8772,
8798,
8825,
8841,
8851,
8854,
8916,
8918,
8991,
8993,
8997,
9052,
9054,
9086,
9088,
9114,
9129,
9139,
9142,
9182,
9184,
9245,
9247,
9251,
9294,
9296,
9311,
9321,
9324,
9358,
9360,
9415,
9417,
9421,
9465,
9467,
9482,
9492,
9495,
9525,
9527,
9571,
9573,
9577,
9609,
9611,
9636,
9651,
9661,
9664,
9706,
9708,
9764,
9766,
9770,
9806,
9808,
9833,
9848,
9858,
9861,
9902,
9904,
9959,
9961,
9965,
9981,
9983,
9993,
9996,
10062,
10064,
10140,
10142,
10146,
10211,
10213,
10228,
10238,
10241,
10287,
10289,
10356,
10358,
10362,
10410,
10412,
10429,
10439,
10442,
10489,
10491,
10559,
10561,
10565,
10613,
10615,
10632,
10642,
10645,
10692,
10694,
10762,
10764,
10768,
10824,
10826,
10841,
10851,
10854,
10901,
10903,
10971,
10973,
10977,
11025,
11027,
11044,
11054,
11057,
11102,
11104,
11170,
11172,
11176,
11226,
11228,
11243,
11253,
11256,
11297,
11299,
11361,
11363,
11367,
11408,
11410,
11427,
11437,
11440,
11485,
11487,
11553,
11555,
11559,
11625,
11627,
11642,
11652,
11655,
11701,
11703,
11770,
11772,
11776,
11822,
11824,
11843,
11868,
11892,
11907,
11971,
11981,
11984,
12055,
12057,
12127,
12129,
12133,
12189,
12191,
12219,
12235,
12245,
12248,
12294,
12296,
12363,
12365,
12369,
12398,
12400,
12415,
12425,
12428,
12463,
12465,
12514,
12516,
12520,
12571,
12573,
12589,
12599,
12602,
12646,
12648,
12713,
12715,
12719,
12762,
12764,
12780,
12790,
12793,
12838,
12840,
12906,
12908,
12912,
12955,
12957,
12982,
12997,
13007,
13010,
13064,
13066,
13134,
13136,
13140,
13207,
13209,
13234,
13249,
13259,
13262,
13316,
13318,
13386,
13388,
13392,
13448,
13450,
13475,
13490,
13500,
13503,
13554,
13556,
13628,
13630,
13634,
13678,
13680,
13707,
13722,
13732,
13735,
13785,
13787,
13851,
13853,
13857,
13910,
13912,
13940,
13956,
13966,
13969,
14025,
14027,
14104,
14106,
14110,
14176,
14178,
14193,
14203,
14206,
14254,
14256,
14325,
14327,
14331,
14390,
14392,
14411,
14421,
14424,
14472,
14474,
14543,
14545,
14549,
14587,
14589,
14606,
14616,
14619,
14654,
14656,
14712,
14714,
14718,
14756,
14758,
14782,
14797,
14807,
14810,
14852,
14854,
14910,
14912,
14916,
14971,
14973,
14997,
15012,
15022,
15025,
15066,
15068,
15130,
15132,
15136,
15188,
15190,
15205,
15215,
15218,
15272,
15274,
15342,
15344,
15348,
15410,
15412,
15427,
15437,
15440,
15471,
15473,
15518,
15520,
15524,
15557,
15559,
15576,
15604,
15614,
15617,
15655,
15657,
15716,
15718,
15722,
15753,
15755,
15781,
15848,
15858,
15861,
15900,
15902,
15958,
16018,
16020,
16024,
16102,
16104,
16131,
16133,
16220,
16306,
16308,
16365,
16380,
16390,
16393,
16425,
16427,
16483,
16536,
16538,
16542,
16600,
16602,
16628,
16643,
16653,
16656,
16699,
16701,
16757,
16821,
16823,
16827,
16866,
16868,
16894,
16909,
16919,
16922,
16965,
16967,
17023,
17087,
17089,
17093,
17136,
17138,
17160,
17175,
17185,
17188,
17226,
17228,
17284,
17343,
17345,
17349,
17390,
17392,
17424,
17464,
17486,
17501,
17511,
17514,
17588,
17590,
17646,
17719,
17721,
17725,
17776,
17778,
17802,
17817,
17827,
17830,
17879,
17881,
17937,
18007,
18009,
18013,
18064,
18066,
18090,
18118,
18133,
18143,
18146,
18200,
18202,
18258,
18326,
18328,
18332,
18379,
18381,
18405,
18430,
18446,
18456,
18459,
18520,
18522,
18578,
18660,
18662,
18666,
18711,
18713,
18739,
18765,
18806,
18821,
18831,
18834,
18917,
18919,
18975,
19072,
19074,
19078,
19137,
19139,
19165,
19205,
19227,
19242,
19252,
19255,
19331,
19333,
19389,
19464,
19466,
19470,
19516,
19518,
19550,
19590,
19605,
19615,
19618,
19680,
19682,
19738,
19807,
19809,
19813,
19859,
19861,
19887,
19914,
19929,
19965,
19975,
19978,
20029,
20031,
20087,
20152,
20154,
20158,
20218,
20220,
20246,
20271,
20287,
20297,
20300,
20354,
20356,
20412,
20487,
20489,
20493,
20536,
20538,
20571,
20598,
20613,
20623,
20626,
20672,
20674,
20730,
20790,
20792,
20796,
20843,
20845,
20866,
20882,
20892,
20895,
20931,
20933,
20989,
21046,
21048,
21052,
21088,
21090,
21116,
21139,
21154,
21164,
21167,
21215,
21217,
21273,
21335,
21337,
21341,
21394,
21396,
21422,
21450,
21466,
21476,
21479,
21534,
21536,
21592,
21668,
21670,
21674,
21728,
21730,
21756,
21779,
21803,
21819,
21829,
21832,
21892,
21894,
21950,
22031,
22033,
22037,
22121,
22123,
22151,
22178,
22197,
22207,
22210,
22272,
22274,
22330,
22403,
22405,
22409,
22478,
22480,
22515,
22542,
22578,
22594,
22604,
22607,
22692,
22694,
22750,
22839,
22841,
22845,
22907,
22909,
22935,
22954,
22964,
22967,
23009,
23011,
23067,
23130,
23132,
23136,
23173,
23175,
23201,
23228,
23244,
23254,
23257,
23323,
23325,
23381,
23458,
23460,
23464,
23532,
23534,
23591,
23672,
23744,
23767,
23777,
23780,
23812,
23814,
23870,
23923,
23925,
23929,
23982,
23984,
24010,
24026,
24095,
24105,
24108,
24148,
24150,
24206,
24267,
24269,
24273,
24310,
24312,
24338,
24371,
24386,
24396,
24399,
24461,
24463,
24519,
24588,
24590,
24594,
24651,
24653,
24679,
24712,
24727,
24737,
24740,
24807,
24809,
24865,
24939,
24941,
24945,
24977,
24979,
24995,
25005,
25008,
25045,
25047,
25103,
25161,
25163,
25167,
25213,
25215,
25241,
25258,
25284,
25294,
25297,
25340,
25342,
25398,
25462,
25464,
25468,
25525,
25527,
25553,
25568,
25578,
25581,
25631,
25633,
25689,
25753,
25755,
25759,
25813,
25815,
25841,
25856,
25866,
25869,
25918,
25920,
25976,
26039,
26041,
26045,
26094,
26096,
26111,
26121,
26124,
26165,
26167,
26223,
26278,
26280,
26284,
26340,
26342,
26359,
26369,
26372,
26409,
26411,
26467,
26525,
26527,
26531,
26575,
26577,
26644,
26661,
26671,
26674,
26728,
26730,
26786,
26854,
26856,
26860,
26898,
26900,
26921,
26936,
26946,
26949,
26991,
26993,
27049,
27112,
27114,
27118,
27153,
27155,
27176,
27192,
27202,
27205,
27244,
27246,
27302,
27362,
27364,
27368,
27403,
27405,
27426,
27448,
27463,
27473,
27476,
27523,
27525,
27581,
27642,
27644,
27648,
27685,
27687,
27708,
27723,
27733,
27736,
27777,
27779,
27835,
27890,
27892,
27894,
27910,
27914,
27945,
27947,
28011,
28078,
28092,
28102,
28105,
28159,
28161,
28223,
28276,
28278,
28282,
28311,
28313,
28377,
28398,
28413,
28423,
28426,
28476,
28478,
28540,
28589,
28591,
28595,
28652,
28654,
28681,
28709,
28765,
28775,
28778,
28832,
28834,
28896,
28956,
28958,
28962,
29021,
29023,
29084,
29099,
29109,
29112,
29161,
29163,
29225,
29273,
29275,
29279,
29321,
29323,
29348,
29375,
29448,
29462,
29472,
29475,
29558,
29560,
29622,
29694,
29696,
29700,
29735,
29737,
29762,
29789,
29842,
29852,
29855,
29917,
29919,
29981,
30039,
30041,
30045,
30100,
30102,
30118,
30128,
30131,
30160,
30162,
30224,
30259,
30261,
30265,
30308,
30310,
30327,
30337,
30340,
30372,
30374,
30436,
30474,
30476,
30480,
30530,
30532,
30547,
30557,
30560,
30595,
30597,
30659,
30693,
30695,
30699,
30739,
30741,
30791,
30806,
30816,
30819,
30863,
30865,
30927,
30970,
30972,
30974,
30987,
30991,
31040,
31042,
31064,
31148,
31158,
31161,
31204,
31206,
31257,
31259,
31263,
31310,
31312,
31334,
31357,
31397,
31407,
31410,
31469,
31471,
31545,
31547,
31551,
31596,
31598,
31620,
31643,
31681,
31691,
31694,
31751,
31753,
31825,
31827,
31831,
31877,
31879,
31896,
31906,
31909,
31951,
31953,
32010,
32012,
32016,
32073,
32075,
32097,
32112,
32122,
32125,
32165,
32167,
32215,
32217,
32221,
32267,
32269,
32291,
32306,
32316,
32319,
32366,
32368,
32423,
32425,
32429,
32476,
32478,
32502,
32530,
32546,
32556,
32559,
32613,
32615,
32684,
32686,
32690,
32724,
32726,
32745,
32755,
32758,
32796,
32798,
32851,
32853,
32857,
32905,
32907,
32939,
32955,
32965,
32968,
33024,
33026,
33097,
33099,
33103,
33147,
33149,
33173,
33201,
33217,
33227,
33230,
33280,
33282,
33347,
33349,
33353,
33399,
33401,
33423,
33451,
33467,
33477,
33480,
33530,
33532,
33597,
33599,
33603,
33661,
33663,
33694,
33749,
33785,
33795,
33798,
33858,
33860,
33928,
33930,
33934,
33972,
33974,
33991,
34001,
34004,
34052,
34054,
34117,
34119,
34123,
34163,
34165,
34190,
34200,
34203,
34233,
34235,
34281,
34283,
34287,
34338,
34340,
34359,
34369,
34372,
34400,
34402,
34446,
34448,
34452,
34515,
34517,
34545,
34560,
34570,
34573,
34625,
34627,
34685,
34687,
34691,
34765,
34767,
34786,
34812,
34822,
34825,
34865,
34867,
34923,
34925,
34929,
34962,
34964,
34992,
35007,
35017,
35020,
35076,
35078,
35140,
35142,
35146,
35195,
35197,
35220,
35252,
35310,
35320,
35323,
35398,
35400,
35471,
35473,
35477,
35525,
35527,
35550,
35582,
35640,
35650,
35653,
35732,
35734,
35809,
35811,
35815,
35877,
35879,
35907,
35931,
35946,
35956,
35959,
36033,
36035,
36107,
36109,
36113,
36159,
36161,
36180,
36204,
36230,
36240,
36243,
36303,
36305,
36373,
36375,
36379,
36414,
36416,
36474,
36498,
36513,
36523,
36526,
36581,
36583,
36639,
36641,
36645,
36684,
36686,
36701,
36711,
36714,
36746,
36748,
36789,
36791,
36795,
36848,
36850,
36875,
36890,
36900,
36903,
36948,
36950,
37004,
37006,
37010,
37060,
37062,
37082,
37092,
37095,
37137,
37139,
37197,
37199,
37203,
37257,
37259,
37276,
37286,
37289,
37322,
37324,
37373,
37375,
37379,
37438,
37440,
37457,
37467,
37470,
37511,
37513,
37570,
37572,
37576,
37644,
37646,
37661,
37671,
37674,
37711,
37713,
37766,
37768,
37772,
37825,
37827,
37882,
37910,
37920,
37923,
37961,
37963,
38017,
38019,
38023,
38076,
38078,
38140,
38155,
38165,
38168,
38213,
38215,
38269,
38271,
38275,
38312,
38314,
38364,
38374,
38377,
38416,
38418,
38473,
38475,
38479,
38516,
38518,
38575,
38590,
38600,
38603,
38649,
38651,
38706,
38708,
38712,
38755,
38757,
38806,
38816,
38819,
38855,
38857,
38909,
38911,
38915,
38951,
38953,
38978,
38988,
38991,
39024,
39026,
39075,
39077,
39081,
39105,
39107,
39165,
39181,
39191,
39194,
39232,
39234,
39288,
39290,
39294,
39330,
39332,
39384,
39394,
39397,
39433,
39435,
39487,
39489,
39493,
39529,
39531,
39591,
39607,
39617,
39620,
39664,
39666,
39726,
39728,
39732,
39782,
39784,
39804,
39855,
39865,
39868,
39906,
39908,
39962,
39964,
39968,
40018,
40020,
40035,
40045,
40048,
40079,
40081,
40128,
40130,
40134,
40178,
40180,
40195,
40205,
40208,
40239,
40241,
40288,
40290,
40294,
40337,
40339,
40389,
40399,
40402,
40439,
40441,
40494,
40496,
40500,
40543,
40545,
40604,
40619,
40629,
40632,
40678,
40680,
40735,
40737,
40741,
40768,
40770,
40792,
40824,
40839,
40849,
40852,
40896,
40898,
40951,
40953,
40957,
40994,
40996,
41019,
41034,
41044,
41047,
41084,
41086,
41132,
41134,
41138,
41171,
41173,
41195,
41210,
41220,
41223,
41262,
41264,
41319,
41321,
41323,
41337,
41341,
41379,
41381,
41403,
41418,
41428,
41431,
41476,
41478,
41536,
41538,
41542,
41583,
41585,
41602,
41612,
41615,
41648,
41650,
41710,
41712,
41716,
41757,
41759,
41781,
41796,
41806,
41809,
41847,
41849,
41907,
41909,
41913,
41958,
41960,
41983,
42000,
42010,
42013,
42058,
42060,
42132,
42134,
42138,
42189,
42191,
42219,
42236,
42246,
42249,
42302,
42304,
42384,
42386,
42390,
42426,
42428,
42456,
42471,
42481,
42484,
42525,
42527,
42588,
42590,
42594,
42637,
42639,
42655,
42665,
42668,
42707,
42709,
42775,
42777,
42781,
42821,
42823,
42845,
42873,
42888,
42898,
42901,
42945,
42947,
43011,
43013,
43017,
43052,
43054,
43076,
43103,
43118,
43128,
43131,
43187,
43189,
43265,
43267,
43271,
43315,
43317,
43339,
43366,
43381,
43391,
43394,
43444,
43446,
43516,
43518,
43522,
43559,
43561,
43577,
43587,
43590,
43635,
43637,
43709,
43711,
43715,
43765,
43767,
43791,
43806,
43816,
43819,
43865,
43867,
43933,
43935,
43939,
43989,
43991,
44013,
44030,
44040,
44043,
44089,
44091,
44151,
44224,
44226,
44230,
44284,
44286,
44308,
44323,
44333,
44336,
44376,
44378,
44438,
44505,
44507,
44511,
44564,
44566,
44589,
44606,
44616,
44619,
44670,
44672,
44750,
44752,
44754,
44772,
44776,
44849,
44851,
44883,
44898,
44908,
44911,
44961,
44963,
45027,
45029,
45033,
45076,
45078,
45126,
45148,
45158,
45161,
45208,
45210,
45278,
45280,
45284,
45315,
45317,
45344,
45401,
45411,
45414,
45458,
45460,
45525,
45527,
45531,
45570,
45572,
45594,
45609,
45619,
45622,
45659,
45661,
45719,
45721,
45725,
45750,
45752,
45776,
45792,
45802,
45805,
45855,
45857,
45928,
45930,
45934,
45959,
45961,
45983,
45999,
46009,
46012,
46056,
46058,
46123,
46125,
46129,
46160,
46162,
46179,
46189,
46192,
46234,
46236,
46306,
46308,
46312,
46343,
46345,
46367,
46382,
46392,
46395,
46442,
46444,
46512,
46514,
46518,
46562,
46564,
46588,
46616,
46632,
46642,
46645,
46695,
46697,
46775,
46777,
46779,
46791,
46795,
46844,
46846,
46870,
46886,
46896,
46899,
46941,
46943,
46998,
47000,
47004,
47076,
47078,
47102,
47126,
47142,
47152,
47155,
47217,
47219,
47287,
47289,
47293,
47341,
47343,
47367,
47382,
47392,
47395,
47446,
47448,
47512,
47514,
47518,
47556,
47558,
47582,
47603,
47613,
47616,
47667,
47669,
47733,
47735,
47739,
47803,
47805,
47829,
47845,
47873,
47883,
47886,
47935,
47937,
47999,
48001,
48005,
48080,
48082,
48104,
48120,
48130,
48133,
48176,
48178,
48234,
48236,
48240,
48270,
48272,
48292,
48308,
48318,
48321,
48354,
48356,
48402,
48404,
48406,
48420,
48424,
48462,
48464,
48491,
48540,
48550,
48553,
48596,
48598,
48651,
48653,
48657,
48688,
48690,
48714,
48730,
48740,
48743,
48789,
48791,
48847,
48849,
48853,
48916,
48918,
48968,
49007,
49017,
49020,
49062,
49064,
49123,
49125,
49129,
49166,
49168,
49185,
49195,
49198,
49240,
49242,
49301,
49303,
49307,
49344,
49346,
49368,
49383,
49393,
49396,
49443,
49445,
49502,
49504,
49508,
49552,
49554,
49578,
49606,
49622,
49632,
49635,
49685,
49687,
49754,
49756,
49760,
49804,
49806,
49827,
49842,
49852,
49855,
49888,
49890,
49938,
49940,
49944,
49986,
49988,
50009,
50033,
50049,
50059,
50062,
50112,
50114,
50172,
50174,
50178,
50227,
50229,
50284,
50286,
50307,
50323,
50333,
50336,
50371,
50373,
50423,
50425,
50429,
50482,
50484,
50581,
50657,
50794,
50846,
50911,
50959,
50969,
50972,
51031,
51033,
51100,
51102,
51106,
51155,
51157,
51178,
51202,
51218,
51228,
51231,
51282,
51284,
51343,
51345,
51349,
51379,
51381,
51402,
51424,
51485,
51500,
51510,
51513,
51571,
51573,
51632,
51634,
51638,
51735,
51737,
51788,
51864,
51963,
52030,
52076,
52129,
52181,
52239,
52249,
52252,
52306,
52308,
52370,
52372,
52376,
52443,
52445,
52468,
52529,
52544,
52554,
52557,
52607,
52609,
52667,
52669,
52673,
52748,
52750,
52852,
52951,
53018,
53064,
53117,
53169,
53236,
53286,
53296,
53299,
53356,
53358,
53423,
53425,
53429,
53485,
53487,
53508,
53530,
53591,
53606,
53616,
53619,
53670,
53672,
53738,
53740,
53744,
53791,
53793,
53814,
53836,
53855,
53865,
53868,
53919,
53921,
53983,
53985,
53989,
54036,
54038,
54059,
54081,
54100,
54110,
54113,
54164,
54166,
54228,
54230,
54234,
54277,
54279,
54300,
54322,
54337,
54347,
54350,
54395,
54397,
54450,
54452,
54456,
54514,
54516,
54537,
54598,
54626,
54642,
54652,
54655,
54714,
54716,
54790,
54792,
54796,
54862,
54864,
54885,
54913,
54929,
54939,
54942,
54987,
54989,
55049,
55051,
55055,
55121,
55123,
55144,
55172,
55188,
55198,
55201,
55257,
55259,
55330,
55332,
55336,
55369,
55371,
55392,
55407,
55417,
55420,
55456,
55458,
55509,
55511,
55515,
55566,
55568,
55633,
55720,
55772,
55830,
55840,
55843,
55879,
55881,
55932,
55934,
55938,
55992,
55994,
56078,
56167,
56219,
56284,
56332,
56342,
56345,
56390,
56392,
56452,
56454,
56458,
56497,
56499,
56552,
56562,
56565,
56596,
56598,
56644,
56646,
56650,
56715,
56717,
56745,
56785,
56819,
56829,
56832,
56868,
56870,
56921,
56923,
56927,
56957,
56959,
56979,
56989,
56992,
57037,
57039,
57099,
57101,
57105,
57146,
57148,
57176,
57192,
57202,
57205,
57258,
57260,
57328,
57330,
57334,
57372,
57374,
57418,
57428,
57431,
57465,
57467,
57516,
57518,
57522,
57559,
57561,
57618,
57633,
57643,
57646,
57697,
57699,
57758,
57760,
57764,
57802,
57804,
57825,
57840,
57850,
57853,
57895,
57897,
57954,
57956,
57960,
58002,
58004,
58025,
58041,
58051,
58054,
58093,
58095,
58149,
58151,
58155,
58206,
58208,
58229,
58251,
58266,
58276,
58279,
58326,
58328,
58383,
58385,
58389,
58422,
58424,
58445,
58460,
58470,
58473,
58514,
58516,
58565,
58567,
58571,
58598,
58600,
58622,
58654,
58669,
58679,
58682,
58726,
58728,
58780,
58782,
58786,
58823,
58825,
58848,
58863,
58873,
58876,
58913,
58915,
58960,
58962,
58966,
58999,
59001,
59023,
59038,
59048,
59051,
59090,
59092,
59146,
59148,
59152,
59193,
59195,
59219,
59246,
59262,
59296,
59306,
59309,
59364,
59366,
59436,
59438,
59442,
59477,
59479,
59494,
59504,
59507,
59538,
59540,
59585,
59587,
59591,
59622,
59624,
59668,
59678,
59681,
59720,
59722,
59775,
59777,
59781,
59823,
59825,
59842,
59852,
59855,
59893,
59895,
59947,
59949,
59953,
59981,
59983,
60000,
60010,
60013,
60048,
60050,
60099,
60101,
60103,
60118,
60122,
60175,
60177,
60198,
60213,
60223,
60226,
60259,
60261,
60310,
60312,
60316,
60357,
60359,
60386,
60410,
60426,
60436,
60439,
60489,
60491,
60550,
60552,
60556,
60589,
60591,
60612,
60628,
60638,
60641,
60679,
60681,
60735,
60737,
60741,
60776,
60778,
60805,
60827,
60842,
60852,
60855,
60903,
60905,
60955,
60957,
60961,
61014,
61016,
61037,
61059,
61074,
61084,
61087,
61132,
61134,
61188,
61190,
61194,
61244,
61246,
61267,
61289,
61304,
61314,
61317,
61359,
61361,
61412,
61414,
61418,
61476,
61478,
61494,
61504,
61507,
61536,
61538,
61583,
61585,
61589,
61643,
61645,
61666,
61681,
61691,
61694,
61736,
61738,
61796,
61798,
61802,
61832,
61834,
61855,
61871,
61881,
61884,
61923,
61925,
61980,
61982,
61986,
62016,
62018,
62039,
62061,
62076,
62086,
62089,
62136,
62138,
62194,
62196,
62200,
62232,
62234,
62255,
62270,
62280,
62283,
62323
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 62323,
"ccnet_original_nlines": 2844,
"rps_doc_curly_bracket": 0.00821527000516653,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09183748066425323,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0018367499578744173,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4774814546108246,
"rps_doc_frac_unique_words": 0.1707964539527893,
"rps_doc_mean_word_length": 8.134336471557617,
"rps_doc_num_sentences": 295,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.982439994812012,
"rps_doc_word_count": 5650,
"rps_doc_frac_chars_dupe_10grams": 0.15650905668735504,
"rps_doc_frac_chars_dupe_5grams": 0.4115842282772064,
"rps_doc_frac_chars_dupe_6grams": 0.3518788516521454,
"rps_doc_frac_chars_dupe_7grams": 0.2534868121147156,
"rps_doc_frac_chars_dupe_8grams": 0.21419091522693634,
"rps_doc_frac_chars_dupe_9grams": 0.19441241025924683,
"rps_doc_frac_chars_top_2gram": 0.06449226289987564,
"rps_doc_frac_chars_top_3gram": 0.09673839807510376,
"rps_doc_frac_chars_top_4gram": 0.1397332400083542,
"rps_doc_books_importance": -4713.13525390625,
"rps_doc_books_importance_length_correction": -4713.13525390625,
"rps_doc_openwebtext_importance": -2997.695068359375,
"rps_doc_openwebtext_importance_length_correction": -2997.695068359375,
"rps_doc_wikipedia_importance": -2918.961181640625,
"rps_doc_wikipedia_importance_length_correction": -2918.961181640625
},
"fasttext": {
"dclm": 0.9997349381446838,
"english": 0.3252263367176056,
"fineweb_edu_approx": 1.2377902269363403,
"eai_general_math": 0.4140700697898865,
"eai_open_web_math": 0.6213032007217407,
"eai_web_code": 0.8659630417823792
}
}
|
{
"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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,532,154,278,524,324,000 |
4
We've got a table of approximately 300,000 points and would like to find the nearest neighbor (within 10km) to each point in the same table. The most efficient query we've found so far is below, but it's slow enough that it's basically unworkable ... hasn't run to completion after multiple hours. Geometry is EPSG 4326, PostGIS 2.1.8.
SELECT DISTINCT ON(p1.id) p1.id AS p1_id,
p2.id AS p2_id, ST_Distance_Sphere(p1.geom, p2.geom)
FROM points p1, points p2
WHERE p1.id <> p2.id AND ST_DWithin(p1.geom, p2.geom, 10000)
ORDER BY p1.id, ST_Distance_Sphere(p1.geom, p2.geom);
We've also tried a couple of other options including using the PostGIS KNN operator and looping through points individually using a cursor function.
Is there a more efficient query we can use, or maybe impoved nearest neighbor support in newer versions of PostGIS?
• 1
Do you want to find only closest point to each point (relation one to one) or find any point from given point within distance (one points to many points)? – Losbaltica Jun 28 '18 at 7:37
• In this case only the closest point. – cokrzys Jul 2 '18 at 9:48
• did you get this to work? did any answer here help? – geozelot Jul 30 '18 at 15:13
11
This is essentially a duplicate question of multiple others, with the sole difference being a table self-join.
However, all queries currently present in this post have delicate CRS misunderstandings, at least when it comes to distances:
• the main problem here is the threshold given to ST_DWithin; the units of that value are CRS dependent, thus, as the data is in EPSG:4236, you are searching in a radius of 10000 degrees!
• follow-up problem is the actual distance a degree represents in suface distance; one degree of Longitude does not represent the same suface distance over different Latitudes!
Arguably the best way to realize true KNN searches uses the LATERAL JOIN in conjunction with the <-> KNN operator, and, optionally but likely not required, a limiting radius filter (e.g. ST_DWithin or ST_Expand + && BBox comparator).
Concerning the units, one could choose a on-the-fly cast to geography type to tackle the CRS/distance issues and get the most precise distances in one go, using speroidal (or, quicker, spherical) algebra.
Runing
SELECT p1.id AS p1_id,
p2.id AS p2_id,
ST_Distance(p1.geom::geography, p2.geom::geography) AS dist
FROM points AS p1
CROSS JOIN LATERAL (
SELECT id,
geom
FROM points
WHERE p1.id <> id
-- AND ST_DWithin(p1.geom::geography, geom::geography, 10000)
ORDER BY
p1.geom::geography <-> geom::geography
LIMIT 1
) AS p2
;
will return dist in meter to the nearest neighbor p2.id for each p1.id.
Note: due to the cast to geography, units for any accepting function will be in meter as well, thus the 10000 again.
As already mentioned, it is essential that you have a proper index in place! Checking the EXPLAIN ANALYZE is crucial to find out if it is actually used (although you can tell it is if you get results within your lifetime I guess...), and running VACUUM ANALYZE <table_name> in advance can help to enforce its use.
Now, the liberal use of the on-the-fly cast to geography will take a heavy toll on execution speed. I´d recommend to either project the data to a suitable projection for distance measurements of your area, or, possibly better, change the geometry type to geography; both can be achieved by adding a new column, if you want your original geoms to stay untouched, and add an own index to it.
Using test data on 70.000 points with porperly indexed geography column (having added a second one) took about 1 min. to complete the initial, uncached run on a mid tech setup.
1
Try to use <-> function with 2D index on geometry.
CREATE INDEX points_geom ON points USING GIST(geom)
After that you can do it something like that if you want to find only the closest point to another point (one to one relation)
SELECT
first_point.*,
second_points.*,
st_distance(first_point.geom, second_points.geom) distance
FROM (SELECT
p1.id as p1_id,
(SELECT p2.id
FROM points p2
WHERE p1.id <> p2.id AND ST_DWithin(p1.geom, p2.geom, 10000)
ORDER BY p1.geom <-> p2.geom
LIMIT 1) AS p2_id
FROM points p1) knn
LEFT JOIN points first_point ON first_point.id = knn.p1_id
LEFT JOIN points second_points ON second_points.id = knn.p1_id;
If you are strugling with performance add EXPLAIN at the beginning to check if your indexes are in use.
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://gis.stackexchange.com/questions/287774/nearest-neighbor/287810",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "160648",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S7JNOB3BLAC4UJ3TLUOBCCSO4W5TMNYS",
"WARC-Concurrent-To": "<urn:uuid:6470c91c-30a6-4c60-8a8d-fb3a35d97934>",
"WARC-Date": "2021-01-17T06:59:17Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZBOZAY52CMTBCZRIJB4OUZWKENBW4HFQ",
"WARC-Record-ID": "<urn:uuid:fa0a0cb8-f1f0-460a-abda-e28fedfb12ca>",
"WARC-Target-URI": "https://gis.stackexchange.com/questions/287774/nearest-neighbor/287810",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6fc49c81-6d11-4907-8f8b-243f65cad592>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-98.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
339,
340,
382,
435,
464,
528,
582,
583,
732,
733,
849,
850,
856,
1047,
1116,
1203,
1206,
1207,
1318,
1319,
1445,
1446,
1636,
1815,
1816,
2050,
2255,
2256,
2263,
2264,
2287,
2310,
2377,
2397,
2418,
2431,
2445,
2461,
2482,
2546,
2557,
2605,
2616,
2624,
2626,
2627,
2699,
2816,
2817,
3131,
3132,
3522,
3523,
3700,
3701,
3703,
3704,
3755,
3756,
3808,
3809,
3936,
3937,
3944,
3961,
3980,
4041,
4054,
4082,
4104,
4128,
4198,
4236,
4263,
4289,
4350,
4416,
4417,
4521,
4522,
4534,
4535,
4635,
4636
],
"line_end_idx": [
2,
3,
339,
340,
382,
435,
464,
528,
582,
583,
732,
733,
849,
850,
856,
1047,
1116,
1203,
1206,
1207,
1318,
1319,
1445,
1446,
1636,
1815,
1816,
2050,
2255,
2256,
2263,
2264,
2287,
2310,
2377,
2397,
2418,
2431,
2445,
2461,
2482,
2546,
2557,
2605,
2616,
2624,
2626,
2627,
2699,
2816,
2817,
3131,
3132,
3522,
3523,
3700,
3701,
3703,
3704,
3755,
3756,
3808,
3809,
3936,
3937,
3944,
3961,
3980,
4041,
4054,
4082,
4104,
4128,
4198,
4236,
4263,
4289,
4350,
4416,
4417,
4521,
4522,
4534,
4535,
4635,
4636,
4726
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4726,
"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.32318270206451416,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.066797636449337,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24066798388957977,
"rps_doc_frac_unique_words": 0.46216216683387756,
"rps_doc_mean_word_length": 4.785135269165039,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.0019646401051431894,
"rps_doc_unigram_entropy": 5.353476047515869,
"rps_doc_word_count": 740,
"rps_doc_frac_chars_dupe_10grams": 0.03219430148601532,
"rps_doc_frac_chars_dupe_5grams": 0.0530923493206501,
"rps_doc_frac_chars_dupe_6grams": 0.043490540236234665,
"rps_doc_frac_chars_dupe_7grams": 0.03219430148601532,
"rps_doc_frac_chars_dupe_8grams": 0.03219430148601532,
"rps_doc_frac_chars_dupe_9grams": 0.03219430148601532,
"rps_doc_frac_chars_top_2gram": 0.01412030030041933,
"rps_doc_frac_chars_top_3gram": 0.008472179993987083,
"rps_doc_frac_chars_top_4gram": 0.00790737010538578,
"rps_doc_books_importance": -483.7666015625,
"rps_doc_books_importance_length_correction": -483.7666015625,
"rps_doc_openwebtext_importance": -217.14942932128906,
"rps_doc_openwebtext_importance_length_correction": -217.14942932128906,
"rps_doc_wikipedia_importance": -209.1956787109375,
"rps_doc_wikipedia_importance_length_correction": -209.1956787109375
},
"fasttext": {
"dclm": 0.2440064549446106,
"english": 0.8669114708900452,
"fineweb_edu_approx": 1.5356959104537964,
"eai_general_math": 0.3066644072532654,
"eai_open_web_math": 0.21788054704666138,
"eai_web_code": 0.07406889647245407
}
}
|
{
"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": "526.0285",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Astronomy",
"level_3": "Geodesy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,669,317,305,468,408,000 |
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
Results 1 to 2 of 2
Thread: Dice Program Help
1. #1
Junior Member
Join Date
Sep 2010
Posts
9
Thanks
4
Thanked 0 Times in 0 Posts
Default Dice Program Help
I have to roll a pair of dice and count the number of box cars (two sixes) that occur, here is what I have:
import java.util.*;
public class BoxCar{
public static void main (String [] args){
//Declare two dice, and a counter
PoD die1, die2;
int counter; // To tell how many times to roll the dice
int setNumDie1; //Set number to be used in die1.setFaceValue
int setNumDie2; //Set number to be used in die2.setFaceValue
int sum;
int totalBox;
Scanner scan = new Scanner (System.in);
//Declares di1 and die2 as dice
die1 = new PoD();
die2 = new PoD();
//Set the counter to 10, able to count down to 0
counter = 1000;
//This section of code demonstrates the setFaceValue mothod
//by asking the user to input of the each die they would
//like to start at.
System.out.println ("Please enter a number between 1 and 6:");
System.out.print ("Die 1: ");
setNumDie1 = scan.nextInt();
System.out.print ("Die 2: ");
setNumDie2 = scan.nextInt();
die1.setFaceValue(setNumDie1);
die2.setFaceValue(setNumDie2);
//This shows the dice are set at the user inputed number,
//and show the sum just becuase
System.out.println ("You set the value of Die #1 at: " +
die1.getFaceValue() + " and Die #2 at: " + die2.getFaceValue());
sum = die1.getFaceValue() + die2.getFaceValue();
System.out.println ("The sum of the two dice are: " + sum);
//The reason counter is there and not the number ten,
//is that a simple change in code by allowing the user to
//enter counter, it will count that many times.
System.out.println ("Now we will roll the dice " +
counter + " times.");
//This statement means that as long as counter is less than ten
//it will keep rolling, Once it reaches ten it will stop.
while (counter > 0){
die1.roll(); //Rolls die1
die2.roll(); //Rolls die2
if ((die1 == 6) && (die2 == 6)){
totalBox ++;
}
System.out.println ("Die one: " + die1 + ", Die two: " + die2);
counter-- ; //Adds 1 to the value to counter
}
}
}
__________________________________________________ __________________________________
public class PoD
{
private final int MAX = 6; // maximum face value
private int faceValue; // current value showing on the die
//-----------------------------------------------------------------
// Constructor: Sets the initial face value.
//-----------------------------------------------------------------
public PoD()
{
faceValue = 1;
}
//-----------------------------------------------------------------
// Rolls the die and returns the result.
//-----------------------------------------------------------------
public int roll()
{
faceValue = (int)(Math.random() * MAX) + 1;
return faceValue;
}
//-----------------------------------------------------------------
// Face value mutator.
//-----------------------------------------------------------------
public void setFaceValue (int value)
{
faceValue = value;
}
//-----------------------------------------------------------------
// Face value accessor.
//-----------------------------------------------------------------
public int getFaceValue()
{
return faceValue;
}
//-----------------------------------------------------------------
// Returns a string representation of this die.
//-----------------------------------------------------------------
public String toString()
{
String result = Integer.toString(faceValue);
return result;
}
}
Where i have the code line " if ((die1 == 6) && (die2 == 6)){
totalBox ++;"
all i get is that PoD and int are incomparable types. What am i doing wrong. I cant get the program to count the number of times the dice roll two sixes
2. #2
Super Moderator Norm's Avatar
Join Date
May 2010
Location
Eastern Florida
Posts
22,382
Thanks
53
Thanked 2,398 Times in 2,351 Posts
Default Re: Dice Program Help
PoD and int are incomparable types
The die variables are NOT int. You need to add a method to the PoD class that takes an int and tests the die's face value against it.
|
{
"url": "http://www.javaprogrammingforums.com/whats-wrong-my-code/5411-dice-program-help.html",
"source_domain": "www.javaprogrammingforums.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "62263",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6QEMAN67JKHPRKLB3OEUF7OINAQWHSPA",
"WARC-Concurrent-To": "<urn:uuid:222f9555-4c6a-4027-8700-2245564c618d>",
"WARC-Date": "2019-09-17T08:27:20Z",
"WARC-IP-Address": "198.57.177.180",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WCJPRDI3MEOENJXI75KYYJSDEJBJBNMD",
"WARC-Record-ID": "<urn:uuid:cc59f296-b2b5-417f-9708-a2123f6c07b5>",
"WARC-Target-URI": "http://www.javaprogrammingforums.com/whats-wrong-my-code/5411-dice-program-help.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db52ffed-9a51-43a5-8fe9-298f15538715>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-38.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
39,
40,
41,
112,
113,
114,
623,
624,
625,
658,
659,
660,
749,
750,
770,
771,
797,
798,
806,
824,
838,
851,
861,
867,
878,
884,
915,
916,
946,
947,
1059,
1060,
1085,
1091,
1117,
1123,
1174,
1180,
1227,
1256,
1325,
1399,
1473,
1495,
1522,
1528,
1581,
1587,
1632,
1663,
1694,
1700,
1762,
1791,
1797,
1803,
1877,
1948,
1981,
2057,
2100,
2142,
2185,
2227,
2271,
2315,
2321,
2392,
2437,
2507,
2588,
2650,
2723,
2729,
2796,
2868,
2929,
2994,
3032,
3038,
3115,
3186,
3220,
3263,
3306,
3357,
3390,
3408,
3490,
3552,
3566,
3572,
3578,
3592,
3598,
3599,
3600,
3690,
3691,
3712,
3718,
3775,
3781,
3848,
3854,
3929,
3982,
4057,
4077,
4086,
4111,
4120,
4126,
4201,
4250,
4325,
4350,
4359,
4413,
4419,
4447,
4456,
4462,
4537,
4568,
4643,
4687,
4696,
4725,
4734,
4740,
4815,
4847,
4922,
4955,
4964,
4992,
5001,
5007,
5082,
5138,
5213,
5245,
5254,
5309,
5315,
5340,
5349,
5355,
5356,
5422,
5440,
5441,
5598,
5599,
5600,
5608,
5642,
5656,
5669,
5682,
5702,
5712,
5723,
5734,
5741,
5780,
5781,
5815,
5816,
5855
],
"line_end_idx": [
39,
40,
41,
112,
113,
114,
623,
624,
625,
658,
659,
660,
749,
750,
770,
771,
797,
798,
806,
824,
838,
851,
861,
867,
878,
884,
915,
916,
946,
947,
1059,
1060,
1085,
1091,
1117,
1123,
1174,
1180,
1227,
1256,
1325,
1399,
1473,
1495,
1522,
1528,
1581,
1587,
1632,
1663,
1694,
1700,
1762,
1791,
1797,
1803,
1877,
1948,
1981,
2057,
2100,
2142,
2185,
2227,
2271,
2315,
2321,
2392,
2437,
2507,
2588,
2650,
2723,
2729,
2796,
2868,
2929,
2994,
3032,
3038,
3115,
3186,
3220,
3263,
3306,
3357,
3390,
3408,
3490,
3552,
3566,
3572,
3578,
3592,
3598,
3599,
3600,
3690,
3691,
3712,
3718,
3775,
3781,
3848,
3854,
3929,
3982,
4057,
4077,
4086,
4111,
4120,
4126,
4201,
4250,
4325,
4350,
4359,
4413,
4419,
4447,
4456,
4462,
4537,
4568,
4643,
4687,
4696,
4725,
4734,
4740,
4815,
4847,
4922,
4955,
4964,
4992,
5001,
5007,
5082,
5138,
5213,
5245,
5254,
5309,
5315,
5340,
5349,
5355,
5356,
5422,
5440,
5441,
5598,
5599,
5600,
5608,
5642,
5656,
5669,
5682,
5702,
5712,
5723,
5734,
5741,
5780,
5781,
5815,
5816,
5855,
5992
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5992,
"ccnet_original_nlines": 171,
"rps_doc_curly_bracket": 0.0035046699922531843,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24919094145298004,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012944979593157768,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3236246109008789,
"rps_doc_frac_unique_words": 0.4066985547542572,
"rps_doc_mean_word_length": 4.698564529418945,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.004314989782869816,
"rps_doc_unigram_entropy": 5.036828517913818,
"rps_doc_word_count": 627,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.046164289116859436,
"rps_doc_frac_chars_dupe_6grams": 0.046164289116859436,
"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.015274950303137302,
"rps_doc_frac_chars_top_3gram": 0.015274950303137302,
"rps_doc_frac_chars_top_4gram": 0.016293279826641083,
"rps_doc_books_importance": -448.0744323730469,
"rps_doc_books_importance_length_correction": -448.0744323730469,
"rps_doc_openwebtext_importance": -294.630615234375,
"rps_doc_openwebtext_importance_length_correction": -294.630615234375,
"rps_doc_wikipedia_importance": -220.9471435546875,
"rps_doc_wikipedia_importance_length_correction": -220.9471435546875
},
"fasttext": {
"dclm": 0.11392092704772949,
"english": 0.6845850348472595,
"fineweb_edu_approx": 1.917751431465149,
"eai_general_math": 0.014504849910736084,
"eai_open_web_math": 0.09129524230957031,
"eai_web_code": 0.00611252011731267
}
}
|
{
"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": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "1",
"label": "Technically Flawed"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,348,425,945,106,180,600 |
Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » Compare fractions
Compare 2/20 and 63/60
1st number: 2/20, 2nd number: 1 3/60
2/20 is smaller than 63/60
Steps for comparing fractions
1. Find the least common denominator or LCM of the two denominators:
LCM of 20 and 60 is 60
Next, find the equivalent fraction of both fractional numbers with denominator 60
2. For the 1st fraction, since 20 × 3 = 60,
2/20 = 2 × 3/20 × 3 = 6/60
3. Likewise, for the 2nd fraction, since 60 × 1 = 60,
63/60 = 63 × 1/60 × 1 = 63/60
4. Since the denominators are now the same, the fraction with the bigger numerator is the greater fraction
5. 6/60 < 63/60 or 2/20 < 63/60
MathStep (Works offline)
Download our mobile app and learn to work with fractions in your own time:
Android and iPhone/ iPad
Related:
© everydaycalculation.com
|
{
"url": "https://answers.everydaycalculation.com/compare-fractions/2-20-and-63-60",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "7436",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7R2NPD77TOMPZE2NCPVPPLOIMLWR5NFP",
"WARC-Concurrent-To": "<urn:uuid:bf40b68d-2265-492e-81a3-e5a85173e80f>",
"WARC-Date": "2023-09-21T12:40:59Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JWIWRAV2AAUVPCFEYFDADT4GS42MA3L5",
"WARC-Record-ID": "<urn:uuid:6110a7bf-3dff-43f4-90e2-cfa905b6ba77>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/compare-fractions/2-20-and-63-60",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d75ece6-3682-4af5-ae92-8cec246cd04a>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-30\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,
8,
9,
46,
47,
99,
100,
123,
124,
161,
162,
189,
190,
220,
221,
292,
319,
320,
406,
452,
483,
539,
573,
682,
716,
717,
742,
743,
818,
843,
844,
853,
854
],
"line_end_idx": [
8,
9,
46,
47,
99,
100,
123,
124,
161,
162,
189,
190,
220,
221,
292,
319,
320,
406,
452,
483,
539,
573,
682,
716,
717,
742,
743,
818,
843,
844,
853,
854,
879
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 879,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2132701426744461,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009478669613599777,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5165876746177673,
"rps_doc_frac_unique_words": 0.5422534942626953,
"rps_doc_mean_word_length": 4.52816915512085,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.085721969604492,
"rps_doc_word_count": 142,
"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.02177293971180916,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -123.65715026855469,
"rps_doc_books_importance_length_correction": -123.65715026855469,
"rps_doc_openwebtext_importance": -61.41230392456055,
"rps_doc_openwebtext_importance_length_correction": -54.543704986572266,
"rps_doc_wikipedia_importance": -30.320634841918945,
"rps_doc_wikipedia_importance_length_correction": -30.320634841918945
},
"fasttext": {
"dclm": 0.9941338896751404,
"english": 0.8795775771141052,
"fineweb_edu_approx": 2.2622122764587402,
"eai_general_math": 0.5438116788864136,
"eai_open_web_math": 0.3408808708190918,
"eai_web_code": 0.0004392300033941865
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,212,463,487,124,774,000 |
Log In
E-mail or User ID
Password
Keep me signed in
Recover Password
Create an Account
Cognos 8
Solve problems - It's Free
Create your account in seconds
Email address
Username
Between 5 and 30 characters. No spaces please
Password
Notify me of new activity in this group:
Keep me informed of the latest:
By clicking "Join Now", you agree to Toolbox for Technology terms of use, and have read and understand our privacy policy.
Master-Detail Relationship causing problem with MS excel rows
Hey Guys,
I've got a weird problem here. I have a list report with 5 columns. In the last (5th) column I have inserted another list and have created a master-detail relationship (Here the master is the query item of the 1st column). For Example - Here is a single record from my report (And also let us assume that my report contains only this record and absolutely nothing else) -
1st col - Incident Number - W87983
2nd Col - Start Date - 27-mar-2010
3rd Col - Start Time - 12:20
4th Col - End Date - 28-Mar-2010
5th Col - Approvals - Approved by XYZ
Approved by ABC
Approved by MNO
So from the above example you can see that for INcident number W87983, I've got multiple values in 5th Column. Now trouble is, when I run this with MS Excel 2007, I get the values in 5th column in separate rows which is fine but for the first 4 columns there are only single values and the 5 rows are merged !! I dont want the rows in the first four colums to be merged because I need to apply filter in excel and it would not work with 4 columns having merged cells and the 5th column having separate cells. This is how its looking in MS Excel at the time being (First 4 columns have merged the 3 cells per column into single cell per column) -
W87983 | 27-mar-2010 | 12:20 | 28-Mar-2010 | Approved by XYZ
| | | | Approved by ABC
| | | | Approved by MNO
Is there a way to un-merge the first 4 colums or the first 4 columns could show the same value for each row on the 5th column. So I am looking at something like this in excel -
W87983 | 27-mar-2010 | 12:20 | 28-Mar-2010 | Approved by XYZ
W87983 | 27-mar-2010 | 12:20 | 28-Mar-2010 | Approved by ABC
W87983 | 27-mar-2010 | 12:20 | 28-Mar-2010 | Approved by MNO
This might be confusing but any help would be extremely appreciated :)
Thanks
P S
This thread has been closed due to inactivity.
Start a new thread here
X
Get Answers - It's Free
If you're looking for Cognos 8 help, sign up and take advantage of 13,380 Business Intelligence professionals who are here to help you.
PCMag Digital Group TRUSTe European Safe Harbor certification
|
{
"url": "http://businessintelligence.ittoolbox.com/groups/technical-functional/cognos8-l/masterdetail-relationship-causing-problem-with-ms-excel-rows-3442715",
"source_domain": "businessintelligence.ittoolbox.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "100750",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6PBPC25545GHDMQMPYQDDZBA6ZNBEVC5",
"WARC-Concurrent-To": "<urn:uuid:aaf0efdf-0168-4af9-87f4-55871b10166b>",
"WARC-Date": "2015-08-03T08:34:13Z",
"WARC-IP-Address": "23.0.160.9",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4VDY6NMNKSXHKRY42XUUXPFXTGHXARM3",
"WARC-Record-ID": "<urn:uuid:13dd8b8b-cdee-4b67-b58a-d926c6dad766>",
"WARC-Target-URI": "http://businessintelligence.ittoolbox.com/groups/technical-functional/cognos8-l/masterdetail-relationship-causing-problem-with-ms-excel-rows-3442715",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:64b653aa-4119-488a-9075-adc9a35d57f7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\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,
7,
25,
34,
54,
71,
89,
98,
99,
126,
127,
158,
172,
181,
182,
228,
237,
278,
310,
433,
434,
496,
497,
507,
879,
914,
949,
978,
1011,
1049,
1065,
1081,
1082,
1728,
1729,
1790,
1814,
1838,
1839,
2016,
2017,
2078,
2139,
2200,
2201,
2272,
2273,
2280,
2284,
2331,
2355,
2357,
2381,
2517,
2518
],
"line_end_idx": [
7,
25,
34,
54,
71,
89,
98,
99,
126,
127,
158,
172,
181,
182,
228,
237,
278,
310,
433,
434,
496,
497,
507,
879,
914,
949,
978,
1011,
1049,
1065,
1081,
1082,
1728,
1729,
1790,
1814,
1838,
1839,
2016,
2017,
2078,
2139,
2200,
2201,
2272,
2273,
2280,
2284,
2331,
2355,
2357,
2381,
2517,
2518,
2579
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2579,
"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.3224699795246124,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05488850921392441,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25557461380958557,
"rps_doc_frac_unique_words": 0.4797297418117523,
"rps_doc_mean_word_length": 4.441441535949707,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.026907920837402,
"rps_doc_word_count": 444,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11308316141366959,
"rps_doc_frac_chars_dupe_6grams": 0.11308316141366959,
"rps_doc_frac_chars_dupe_7grams": 0.07454361021518707,
"rps_doc_frac_chars_dupe_8grams": 0.039553750306367874,
"rps_doc_frac_chars_dupe_9grams": 0.039553750306367874,
"rps_doc_frac_chars_top_2gram": 0.04563894867897034,
"rps_doc_frac_chars_top_3gram": 0.03853955119848251,
"rps_doc_frac_chars_top_4gram": 0.05679513141512871,
"rps_doc_books_importance": -255.17471313476562,
"rps_doc_books_importance_length_correction": -255.17471313476562,
"rps_doc_openwebtext_importance": -137.94432067871094,
"rps_doc_openwebtext_importance_length_correction": -137.94432067871094,
"rps_doc_wikipedia_importance": -110.55548095703125,
"rps_doc_wikipedia_importance_length_correction": -110.55548095703125
},
"fasttext": {
"dclm": 0.054346680641174316,
"english": 0.9294341206550598,
"fineweb_edu_approx": 1.14606511592865,
"eai_general_math": 0.0332217812538147,
"eai_open_web_math": 0.0907137393951416,
"eai_web_code": 0.1375800371170044
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.446",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,228,443,618,067,382,000 |
Xbar Chart Python
What is a chart? A chart is a visual representative of data in both columns and rows. Python language offers some special types of operators like the identity operator or the membership operator. Dependencies and Setup¶. Highlight the data and headings (here columns A1:B13) Select the Insert Tab and Charts group and click on Pie Chart; Select the second of the 2-D Pie Charts (an exploded pie chart). For the X = 3 bin, graph a bar of height binompdf ( 31,1/6,3). Select a subtype of bar graph from the display on the right, and click Next. xy sum - The sum of the products of the x n and y n that are recorded at the same time (vertical on this chart). Use the gallery interface to change the appearance with one click. Challenges faced in Decision Tree Decision tree can be implemented in all types of classification or regression problems but despite such flexibilities it works best only when the data contains categorical variables and only when they are mostly dependent on. Label the horizontal axes (Type of Pet). To convert each series to a line, click on one of the columns for the “Meanâ€?. But we can make it significantly better with just a few more tweaks. If you were starting with Python and bioinformatics, any operating system will work, but here, we are mostly concerned with the intermediate to advanced. stdev() function exists in Standard statistics Library of Python Programming Language. If any X-value has only one observation there will be a zero value shown for Sigma (or Range) at this X and the point value shown in the Xbar Chart. A bar chart is drawn between a set of categories and the frequencies of a variable for those categories. xbar – Where xbar is the mean of data. Simple linear regression is a way to describe a relationship between two variables through an equation of a straight line, called line of best fit, that most closely models this relationship. A bar graph or bar chart displays categorical data with parallel rectangular bars of equal width along an axis. Shewhart) or process-behavior charts, in statistical process control are tools used to determine if a manufacturing or business process is in a state of statistical control. Mathematical Annotation in R Description. Common variations arising due to material, machines, time, etc. Introductory college course, so I know some stuff, but I'm far from being an expert of any sorts. Matplotlib may be used to create bar charts. These pages outline the chart configuration options, and the methods and properties of Highcharts objects. However, several points in the range control chart lie outside the limits. Data are plotted in time order. Draw the vertical and horizontal axes. Graphics You can attach image files directly to a notebook in Markdown cells by dragging and dropping it into the cell. If you have discrete numeric data from which you can obtain every equally spaced. Version info: Code for this page was tested in R version 3. 2014年12月3日より2015年1月7日まで開催した、paizaオンラインハッカソンVol. Using Pandas, one simply needs to enter the following: df. This is a list of 10 working graphs (bar chart, pie chart, line chart, etc. Make bar charts, histograms, box plots, scatter plots, line graphs, dot plots, and more. The method bar() creates a bar chart. Learn to work on Office files without installing Office, create dynamic project plans and team calendars, auto-organize your inbox, and more. You might like the Matplotlib gallery. There are situations that demand multi-dimensional arrays or matrices. New to Plotly? Plotly is a free and open-source graphing library for Python. x-bar chart example using qcc R package. It displays grouped data by way of parallel rectangular bars of equal width but varying the length. From interaction graph, as lines do not cross each other, so interaction between factors is irrelevant. Rumus Median Data Kelompok. This is a scientific/graphing calculator, so I'm parsing a whole string of input. Interactive price chart provided by TradingView. The X-bar and Standard Deviation chart is the variable data control chart used when the subgroup is large. 1 Class 0 (Ord) symbols: Simple / ordinary ("noun") 1. Analytic pipelines extended by seamlessly integrating with Amazon, Azure, and Google ecosystems along with Python, R, Jupyter Notebooks, C#, and Scala. Limit chart pdf. Using Google products, like Google Docs, at work or school? Try powerful tips, tutorials, and templates. The '<=' is the important token in the statements above : it is read 'if'. grid extracted from open source projects. Charts are usually used to analyse trends and patterns in data sets. The X-bar chart shows how the mean or average changes over time and the R chart shows how the range of the. Although Pandas is not the only available package which will calculate the variance. ggplot ( data = datn , aes ( x = dose , y = length , group = supp , colour = supp )) + geom_line () + geom_point (). Mathematical Annotation in R Description. On the Insert tab, in the Charts group, click the Column symbol. A bar graph shows comparisons among discrete categories. Common variations arising due to material, machines, time, etc. If any X-value has only one observation there will be a zero value shown for Sigma (or Range) at this X and the point value shown in the Xbar Chart. One of the commonest ways of finding outliers in one-dimensional data is to mark as a potential outlier any point that is more than two standard deviations, say, from the mean (I am referring to sample means and standard deviations here and in what follows). But if one series type is horizontal bars, then combining this with another type can be tricky. Control Charts with qicharts for R; by Jacob Anhøj; Last updated about 5 years ago; Hide Comments (–) Share Hide Toolbars. Matplotlib may be used to create bar charts. # x-bar/R chart example from Foster Text: if False: r = import_time_value_arrays ( times = [], \ values = example_data_foster_18_11, sample_size = 4) r. Draw the vertical and horizontal axes. but, at least in Python 3, the output is not a well formed HTML and you’d need to manually strip some characters. The formula for the standard deviation of an entire population is: where N is the population size and μ is the population mean. For example, the median is the 50 th percentile, the first quartile is the 25 th percentile, and the third quartile is the 75 th percentile. The lesson describes how to create this control chart in both Microsoft Excel and using Minitab. Common variations arising due to material, machines, time, etc. 2 or later with Compat v1. Control charts, also known as Shewhart charts (after Walter A. Shewhart) or process-behavior charts, in statistical process control are tools used to determine if a manufacturing or business process is in a state of statistical control. Xbar Chart Python Basic Tutorial Basic Data Analysis through R/R Studio In this tutorial, I 'll design a basic data analysis program in R using R Studio by utilizing the features of R Studio to create some visual representation of that data. Founded in 1896, Strategic Materials is the largest recycler of glass in North America. Anyone who works with statistics needs a basic understanding of the differences between mean and median and mode. If you don't create a cumulative distribution, Prism gives you three choices illustrated below: XY graph with points, XY graph with spikes (bars). Once you create a control chart using QI Macros, you can easily update the control limits using the QI Macros Chart Tools menu. Under Place chart:, click on the radio button next to As new sheet:. i will upload two docs one in Microsoft word and other in PDF. Clicking this produces an integral sign with placeholders for the upper and lower limits, the function, and the integration variable. X-bar and Range or X-bar and S control chart with large subgroup increase sensitivity. EarthLink knows the internet. The graph shows a positive linear relationship between reading scores and socio economic status. In short, it’s a variation on a theme of the classical z-score from statistics. For example, this chart (taken from InfinityQS ® ProFicient ™ software) plots data for 20 subgroups. A bar graph shows comparisons among discrete categories. Data are plotted in time order. One type of statistical process control chart is the average and range chart. Start now with a free trial!. You learnt how to use Pygal to create a bar chart in a Python Flask application. 20-24; foreign 0. t = (xbar - μ) / [ s / n^(1/2) ] degrees of freedom The number of degrees of freedom for a collection of sample data is the number of sample values that can vary after certain restrictions have been imposed on all data values. Pill Identifier Results for "039 Yellow". Open your Character Map in Windows and select different fonts which gives you different symbols. 5 * width for p in pos]). Panel Chart works on. Because Δ 3 is a constant, the sum is a cubic of the form an 3 +bn 2 +cn+d, [1. data – Where data is array of valid Python numbers including Decimal and Fraction values. Then we count them using the table() command, and then we plot them. We can supply a vector or matrix to this function. The assignment is to plot X-bar Charts,& R Charts in excel that I will be able to download, the assignment information will be attached. Building a combination chart in Excel is usually pretty easy. Label the horizontal axes (Type of Pet). And more than anything, it can be confusing. This REPL workflow will greatly speed-up your prototyping. py is a Python script to read a crossbar Hjson configuration file and generate a crossbar package, crossbar RTL, and DV test collateral for checking the connectivity. A histogram is a type of bar plot that shows the frequency or number of values compared to a set of value ranges. In statistics, the 68–95–99. Use EXC w (i) Print the entire sheet with the actual data and the numerical data of the sampling. CuSum can propose control within 1-1. X BAR AND R VALUES FOR THE 10 SAMPLES OF TEA CONTAINING 30 PACKETS. Brainstorm parts of a bar graph with students. Related course The course below is all about data visualization: Data Visualization with Matplotlib and Python; Bar chart code The code below creates a bar chart:. Peter Bartlett 1. You can use the x-bar control chart when you want to analyze process stability of data containing multiple measurements per subgroup. For larger shifts, use Shewart style charts like the X Bar R and the X Bar S charts. Control charts, also known as Shewhart charts (after Walter A. Process shifts, out-of-control conditions, and corrective actions should be noted on the chart to help connect cause and effect in the minds of all who use the chart. A bar graph shows comparisons among discrete categories. Related course: Data Visualization with Matplotlib and Python. Shewhart) or process-behavior charts, in statistical process control are tools used to determine if a manufacturing or business process is in a state of statistical control. LinearRegression code in Java. If this parameter is not given (none) then the mean is automatically calculated. pretty_print (True, True) t = 'Figure 11-8 from Foster Text' cc. An Individual-X Moving Range Chart with process capability estimates from SPC IV Excel software. A control chart always has a central line for the average, an upper line for the upper control limit, and a lower line for the lower control limit. The --help flag is provided for details on how to run the tool. Income and Expense Select the data with headers and Press Ctrl + T. A bar chart uses the Bar mark type. The statistical power of a hypothesis test is the probability of detecting an effect, if there is a true effect present to detect. ListofDerivativeRules Belowisalistofallthederivativeruleswewentoverinclass. Find and compare top SPC software on Capterra, with our free and interactive tool. Change the parameters for a and b to graph normal distribution based on your calculation needs. stdev() function exists in Standard statistics Library of Python Programming Language. The highlighted section shows that the average value for subgroup 8 is well within control limits. p-Chart np-Chart u-Chart c-Chart Decide on type of data Continuo us (Variables) Data. bar(range(7), [1, 2, 3, 4, 3, 2, 1]) Note, however, that contrary to plt. Graphics You can attach image files directly to a notebook in Markdown cells by dragging and dropping it into the cell. X-bar control chart. Creating Pareto Charts to visualize the 80/20 principle 2. 12 TABLE OF THE EXPONENTIAL INTEGRAL El(s) Table 1—Continued-Ei(-s) -e'Ei(-x) 11. Panel Chart works on. Above X-bar is mean of the values, X is actual and n is number of values. Num Sigma is defined in the QC1. Useful to detect small and permanent variation on the mean of the process. In the second, simpler formula, SD 1 and SD 2 represent the standard deviations for samples 1 and 2, respectively. Hundreds of charts are present, always realised with the python programming language. The graph of the normal distribution is characterized by two parameters: the mean, or average, which is the maximum of the graph and about which the graph is always symmetric; and the standard deviation, which determines the amount of dispersion away from the mean. Use labelled bracket notation. ) with colors and data set up to render decent looking charts that you can copy and paste into your own projects, and quickly get going with customizing and fine-tuning to make them fit your style and purpose. X BAR AND R VALUES FOR THE 10 SAMPLES OF TEA CONTAINING 30 PACKETS. One of the commonest ways of finding outliers in one-dimensional data is to mark as a potential outlier any point that is more than two standard deviations, say, from the mean (I am referring to sample means and standard deviations here and in what follows). This is a good opportunity to get inspired with new dataviz techniques that you could apply on your data. These pages outline the chart configuration options, and the methods and properties of Highcharts objects. 102 How Important is Regular Exercise? In a recent poll of 1000 American adults, the. 20-24; foreign 0. We can supply a vector or matrix to this function. Statology is a site that makes learning statistics easy through explaining topics in simple, straightforward ways. This not exactly a normal probability density calculator, but it is a normal distribution (cumulative) calculator. Ask Question Asked 5 years, 10 months ago. data – Where data is array of valid Python numbers including Decimal and Fraction values. Next, simply right-click on any data point and select “add trend line” to bring up the regression equation dialogue box. The control limits on the X-bar chart are derived from the average range, so if the Range chart is out of control, then the control limits on the X-bar chart are meaningless. Version info: Code for this page was tested in R version 3. Linear model construction of a scalar dependent variable against another explanatory variable, calculate the Best Fit line of the two variables (X and Y) y = ax + b. with the Panel Chart add-in, you can separate lines by categories in different panels, so that you chart is much easier to read and understand. Chi-Square Distribution. Not all implementations of statistical tests return p-values. Common variations arising due to material, machines, time, etc. The preceding script will show three bar charts of four bars. The standard chart for variables data, X-bar and R charts help determine if a process is stable and predictable. In my recent post, we have implemented Real-Time Chart using HTML5 Push Notification (SSE) and ASP. Is the mathematical symbols keyboard working well on your computer? Leave me suggestions and feedbacks. Add2(Before:=BeforeSheet, After:=AfterSheet, NewLayout:=Boolean) With myChart. This chart type is used for sub-grouped data, where each subgroup is made up of two or more values. The vertical baseline is bottom (default 0). 7 (or newer if it has been released). 5 * width for p in pos]). Xbar-R Charts for a Single Characteristic. Please input numbers in the required fields and click CALCULATE. GitHub Gist: instantly share code, notes, and snippets. If you don’t know how to switch the axes, you would’ve deleted the chart and copy-pasted the contents of columns B and C to exchange the values. For practice, use the File>Open Samples>Line Graph sample image. Hypothesized mean (h): Sample mean (x): Sample size: Sample standard deviation: CALCULATE t-statistic : Degrees read more. x matplotlib bar-chart polar-coordinates or ask your own question. In many real–world situations, the response. No installation, real-time collaboration, version control, hundreds of LaTeX templates, and more. advanced Pharmacology. See full list on mode. # x-bar/R chart example from Foster Text: if False: r = import_time_value_arrays ( times = [], \ values = example_data_foster_18_11, sample_size = 4) r. Interactive, visual statistical data analysis from SAS. A variety of procedures and charts are available in NCSS for assessing quality control. Chebyshev's Theorem. The statistical power of a hypothesis test is the probability of detecting an effect, if there is a true effect present to detect. In probability and statistics, the variance of a random variable is the average value of the square distance from the mean value. Brief History of ASCII code: The American Standard Code for Information Interchange, or ASCII code, was created in 1963 by the "American Standards Association" Committee or "ASA", the agency changed its name in 1969 by "American National Standards Institute" or "ANSI" as it is known since. A bar graph or bar chart displays categorical data with parallel rectangular bars of equal width along an axis. Using the Median Absolute Deviation to Find Outliers. 061288 2nd directional derivative = 94. Not bad! It's a pretty nice default chart honestly. The pandas DataFrame class in Python has a member plot. But a Levey Jennings chart does not use the subgroup standard deviation to develop the appropriate point estimates of X-bar stdev, it uses the "long term"/global. In fact, some traders base their strategies almost entirely off charts (these are the "technicians", since trading strategies based off finding patterns in charts is a part of the trading doctrine known as technical analysis). Chi-Square The acronym CHAID stands for Chi-squared Automatic Interaction Detector. Required fields are marked *. The assignment is to plot X-bar Charts,& R Charts in excel that I will be able to download, the assignment information will be attached. Related course The course below is all about data visualization: Data Visualization with Matplotlib and Python; Bar chart code The code below creates a bar chart:. plot you must always specify x and y (which correspond, in bar chart terms to the left bin edges and the bar heights). $ nc -l 9001 Linux tomservo 2. The lesson describes how to create this control chart in both Microsoft Excel and using Minitab. Which is why you monitor X-bar and s. Linear model construction of a scalar dependent variable against another explanatory variable, calculate the Best Fit line of the two variables (X and Y) y = ax + b. All text (str) is Unicode by default. Artificial Intelligence is associated with a set of technologies impacting and guiding how users interact with and use internet. Scatter plots are used to observe relationships between variables. In some cases, you must use alternatives, such as critical values. Summary of Styles and Designs. The example Python code draws a variety of bar charts for various DataFrame instances. Use EXC w (i) Print the entire sheet with the actual data and the numerical data of the sampling. The standalone utility tlgen. Control charts monitor the quality of the elements. Control charts, also known as Shewhart charts (after Walter A. Explanation:. In the Julia, we assume you are using v1. Hypothesized mean (h): Sample mean (x): Sample size: Sample standard deviation: CALCULATE t-statistic : Degrees read more. The codes can also be used in some types of mathematical symbols, in the integral included in the example the _ is used to set the lower bound and the ^ for the upper bound. In a bar plot, the bar represents a bin of data. ggplot ( data = datn , aes ( x = dose , y = length , group = supp , colour = supp )) + geom_line () + geom_point (). They find Python in position 5, sandwiched between C# and C++. Choose from different chart types, like: line and bar charts, pie charts, scatter graphs, XY graph and pie charts. Extract data chart in tradingview to csv. or a bar graph. The Last 25 Subgroups plot indicates the data are randomly and symmetrically distributed around the process mean. ListofDerivativeRules Belowisalistofallthederivativeruleswewentoverinclass. The plot member of a DataFrame instance can be used to invoke the bar() and barh() methods to plot vertical and horizontal bar charts. Control charts, also known as Shewhart charts (after Walter A. The standard normal distribution can also be useful for computing percentiles. Although Pandas is not the only available package which will calculate the variance. To find the standard deviation of a set of numbers, first find the mean (average) of the set of numbers: Second, for each number in the set, subtract the mean and square the result:. This is a scientific/graphing calculator, so I'm parsing a whole string of input. The control chart is a graph used to study how a process changes over time. Let's say you have been recording the sales figures in Excel for the past three years. For example, to create a histogram of the depth of earthquakes in the […]. Lane Prerequisites. Also note that the derivatives used for calculating these equations are extraordinarily simple and are explained in this intro to Simple Linear Regression , if you. First import plt from the matplotlib module with the line import matplotlib. To open "Character Map", go to All Programs-Accesories-System Tools-Character Map. Panel Chart works on. The table() command creates a simple table of counts of the elements in a data set. By toggling the Title option from On to Off, you can disable the Bar Chart title. You might like the Matplotlib gallery. 9 Cumulative Sum and Exponentially Weighted Moving Average Control Charts 9. NET Web API. Found a bug? Created using Sphinx 2. Power BI Custom Visual – Horizontal Bar Chart; Dataset – Oklahoma Government Expenses. can be corrected and normal output can be resumed. If bars are horizontal, x and y axes are reversed. And more than anything, it can be confusing. A bar chart is drawn between a set of categories and the frequencies of a variable for those categories. mean Statistics noun The sum of the values of all observations or data points divided by the number of observations; an arithmetical average; the central tendency of a collection of numbers, which is a sum of the numbers divided by the amount of numbers the collection. cara ini Hampir sama dengan cara mencari median pada data tunggal, nilai median pada data kelompok juga merupakan nilai tengah dari suatu kumpulan data. There are two phases in statistical process control studies. See full list on pqsystems. Sum of combinations calculator. How to make Bar Charts in Python with Plotly. pie() to create a plot. Above X-bar is mean of the values, X is actual and n is number of values. with the Panel Chart add-in, you can separate lines by categories in different panels, so that you chart is much easier to read and understand. The interpretation is similar to that for the short-run Xbar chart. Open the thresolding tool (shift-t). The following tutorial will get you started using R’s ggplot2 package to make a simple line chart from a csv of data. Each example builds on the previous one. The Xbar and R charts indicate that the process is stable, with no points beyond the control limits. However, several points in the range control chart lie outside the limits. Get solutions tailored to your industry: Agriculture, Education, Distribution, Financial services, Government, Healthcare, Manufacturing, Professional services, Retail and consumer goods. Using the Median Absolute Deviation to Find Outliers. A bar chart represents data in rectangular bars with length of the bar proportional to the value of the variable. Brainstorm parts of a bar graph with students. Use large graph paper to create a bar graph, thinking aloud throughout the process. Each example builds on the previous one. The code below creates a pie chart:. Notice problems can occur with some date variables It is displayed together with either: Range chart which indicates. There are two types of bar charts: geom_bar() and geom_col(). (SPC) Statistical Process Control is the use of statistical techniques such as control charts to analyze a process or its output so as to take appropriate actions to achieve and maintain a state of statistical control and to improve the process capability. Process shifts, out-of-control conditions, and corrective actions should be noted on the chart to help connect cause and effect in the minds of all who use the chart. The charts succeed in the separation of variables in averages to that of the variations in standard deviation. Let's look at the number of people in each job, split out by gender. First import plt from the matplotlib module with the line import matplotlib. (That is the scaled value of the statistic that has an F distribution or a chisquare distribution depending on the value of test). xy sum - The sum of the products of the x n and y n that are recorded at the same time (vertical on this chart). The center line is the process mean. Related course: Matplotlib Examples and Video Course. These are the top rated real world Python examples of pandas. The most general definition of the function is given first. We observe the first terms of an IID sequence of random variables having an exponential distribution. A control chart always has a central line for the average, an upper line for the upper control limit, and a lower line for the lower control limit. Dendrograms from Hierarchical Clustering. The given data will always be in the form of sequence or iterator. Use EWMA Charts When: When you have continuous data from the entire life of a process. Median ialah data tengah setelah diurutkan. Plotting in Scilab www. If you look at the below two charts, in the first chart you have two different data column series but the axis is the same. Explanation:. Output Stair Graph Plot. By doing this, you get Python-like working environment – create a function, test it with several input parameters, go back to edit the function and test it again. The vertical baseline is bottom (default 0). (That is the scaled value of the statistic that has an F distribution or a chisquare distribution depending on the value of test). Hi Guys, in this post I would share how to show values on top of bars in Chart. _get_numeric_data extracted from open source projects. Python chr() Function Built-in Functions. Add2(Before:=BeforeSheet, After:=AfterSheet, NewLayout:=Boolean) With myChart. To make a bar chart with ggplot2 in R, you use the geom_bar() function. SetSourceData Source:=SourceDataRange. Cusum charts display how the group summary statistics deviate above or below the process center or target value, relative to the standard errors of the summary statistics. Browse other questions tagged python python-3. You can rate examples to help us improve the quality of examples. The following is an introduction for producing simple graphs with the R Programming Language. Open the thresolding tool (shift-t). Python Scrollbar. Rumus Median Data Kelompok. If you wish, you can complete Problems 1 and 3 on the Excel worksheet and Problem 2 on the Word document or you can complete all of them on the Excel or Word document. Python DataFrame. CUSUM Chart with V-Mask When the V-Mask is placed over the last data point, the mask clearly indicates an out of control situation. Use this free calculator to generate the t-statistic and degrees of freedom for a Student t-test. GIỚI THIỆU VỀ RATIONAL SUBGROUPING Rational subgrouping là một chủ đề quan trọng trong việc nghiên cứu các cách lấy mẫu dữ liệu. I have a set of data for Stature and Weight for 200 sample male and female. The given data will always be in the form of sequence or iterator. I've been looking at math notation and different packages but have yet to find anything that lets me print xbar (the average x). It is assumed that the data are sequential in nature, consisting either of individuals (one measurement taken at each time period) or subgroups (groups of measurements at each time period). UCL , LCL (Upper and Lower Control Limit) where x-double bar is the Grand Average and σx is Process Sigma, which is calculated using the Subgroup Range or Subgroup Sigma statistic. yaml is required to contain at least a runtime: python38 entry. Found a bug? Created using Sphinx 2. The variance of the population is assumed to be known. Useful to detect small and permanent variation on the mean of the process. pythonのBarChartを介し、グラフを昇順にて出力したいです。下記コードにてグラフ作成まではできるのですが、降順で表示されてしまいます。 昇順で出力する方法がお分かりになる方いらっしゃいましたら、ご教示をお願いいたします。 import pandas as pdfrom openpyxl. But if one series type is horizontal bars, then combining this with another type can be tricky. This means that you don’t need # -*- coding: UTF-8 -*-at the top of. Because Δ 3 is a constant, the sum is a cubic of the form an 3 +bn 2 +cn+d, [1. An Individual-X Moving Range Chart with process capability estimates from SPC IV Excel software. You might like the Matplotlib gallery. Group Bar Plot In MatPlotLib. Lean Six Sigma Black Belt. Change the parameters for a and b to graph normal distribution based on your calculation needs. The difference between the mean of Y and 136. Keywords: matplotlib code example, codex, python plot, pyplot Gallery generated by Sphinx-Gallery. After you have input your data into a table format, you can use the chart tool to make a scatter-plot of the points. Click the Chart Wizard toolbar button, or choose Chart from the Insert menu. But we can make it significantly better with just a few more tweaks. Tips and Tricks for Creating Charts and Graphs in Microsoft Excel – This collection of tutorials gives step by step instructions for creating a variety of different types of charts in Excel, including histograms, scatter plots, and thermometer charts. The following is an introduction for producing simple graphs with the R Programming Language. Westgard discusses the terms Mean, SD, CV, Control Limits, z-scores and SDI's, explaining what they. How to create a time series chart using R plotly? Im using superstore dataset. If you wish, you can complete Problems 1 and 3 on the Excel worksheet and Problem 2 on the Word document or you can complete all of them on the Excel or Word document. plot: >>> plt. Sample 2: { 2 5 8 } X-bar2 = 5 Sample 3: { 7 9 10 } X-bar3= 8. The plot member of a DataFrame instance can be used to invoke the bar() and barh() methods to plot vertical and horizontal bar charts. Limit chart pdf. Python Scrollbar. If you don’t specify, R will guess and use dots by default. It also produces the scatter plot with the line of best fit. This lesson explains how the data is recorded and interpreted on the pair of control charts. ; x is a value that X can take. As an example, I’ll use the air temperature and density data that I used to demonstrate linear interpolation. The Overflow Blog Podcast 261: Leveling up with Personal Development Nerds. Drag-and-drop the independent variable, group, from the Variables: box into the "X-Axis?" box in the main chart preview screen and do the same for the dependent variable, coping_stress, but into the "Y-Axis?" box. Chi-Square Distribution. Detail: xerr and yerr are passed directly to errorbar(), so they can also have shape 2xN for independent specification of lower and upper errors. This python Bar plot tutorial also includes the steps to create Horizontal Bar plot, Vertical Bar plot, Stacked Bar plot and Grouped Bar plot. If the text argument to one of the text-drawing functions (text, mtext, axis, legend) in R is an expression, the argument is interpreted as a mathematical expression and the output will be formatted according to TeX-like rules. Sampling Distributions for Sample Mean, x-bar Z- Scores Practical Examples Hypothesis Testing Type I and Type II Errors Decision Making Power Testing for mean, variance, proportion Practical Examples Association between Categorical Variables Contingency Tables Independent and Dependent. The same applies for Y. Not all implementations of statistical tests return p-values. You run exactly the same commands, assigning the data and layout to a Plot component in your Anvil app. Range Statistics and the d2 Constant Used in Statistical Process Control Charts Range statistics are often used in statistical process control charting. They are organized into seven classes based on their role in a mathematical expression. This enables you to use bar as the basis for stacked bar charts, or candlestick plots. If the process is generating the expected number of nonconformities (or nonconforming units), then the plot point is 0, and the point falls on the center line of the chart (Section A on Figure 13. But a Levey Jennings chart does not use the subgroup standard deviation to develop the appropriate point estimates of X-bar stdev, it uses the "long term"/global. Notice problems can occur with some date variables It is displayed together with either: Range chart which indicates. Use large graph paper to create a bar graph, thinking aloud throughout the process. Variance, or second moment about the mean, is a measure of the variability (spread or dispersion) of data. Please donate. Because sigma (standard deviation symbol) is a Greek letter, in the subset, check Greek and Coptic. Xbar Chart Python Basic Tutorial Basic Data Analysis through R/R Studio In this tutorial, I 'll design a basic data analysis program in R using R Studio by utilizing the features of R Studio to create some visual representation of that data. Where X bar is the mean of values, X is the actual mean and n is the number of values. Let’s switch to Python 3 for the remaining of the document. There’s a better way than that where you don’t need to change any values. This app will build the tree as you type and will attempt to close any brackets that you may be missing. Python Seaborn Stacked Bar Chart. Control charts, also known as Shewhart charts (after Walter A. Hundreds of charts are present, always realised with the python programming language. Control charts monitor the quality of the elements. CuSum can propose control within 1-1. Detail: xerr and yerr are passed directly to errorbar(), so they can also have shape 2xN for independent specification of lower and upper errors. ggplot ( data = datn , aes ( x = dose , y = length , group = supp , colour = supp )) + geom_line () + geom_point (). _get_numeric_data - 6 examples found. This chart type creates a vertical bar graph, which Excel refers to as a Column chart. Create a high-resolution chart. Median ialah data tengah setelah diurutkan. Xbar-chart is a process control type graph. For example, the plot() function has a type argument, which use to specify the type of chart you want. The assignment is to plot X-bar Charts,& R Charts in excel that I will be able to download, the assignment information will be attached. The first thing we'll change is the size and resolution of the chart to make sure it looks good on all screens and can be copy/pasted easily into a presentation or website. The most general definition of the function is given first. Use SignNow eSignature and document management solutions for your business workflow. This not exactly a normal probability density calculator, but it is a normal distribution (cumulative) calculator. A frequently asked question is how the control limits are calculated on an I-MR Chart or Individuals Chart. Put you curser in cell A1 and create a simple clustered column chart. This Excel tutorial explains how to create a basic line chart in Excel 2016 (with screenshots and step-by-step instructions). Example:-Let’s assign numerical value 1 for play cricket and 0 for not playing cricket. 5 * width for p in pos]). Please donate. For example, this chart (taken from InfinityQS ® ProFicient ™ software) plots data for 20 subgroups. Methodology ¶ To get the RFM score of a customer, we need to first calculate the R, F and M scores on a scale from 1 (worst) to 5 (best). Chapter 6 Sampling Distributions. Yet when it came to sharing quality data between their nearly 50 plants, the company faced a challenge: each. The query the function builds looks something like this:. If any X-value has only one observation there will be a zero value shown for Sigma (or Range) at this X and the point value shown in the Xbar Chart. Looking for a primer on how to find and sketch the domain of a function z = f(x, y) in calculus? Learn how with this free video calc lesson. Bài viết gốc thì rất hay trong việc giải thích cách hình thành của Biểu đồ Kiểm soát Xbar-s (tức Xbar-s control chart). The assignment is to plot X-bar Charts,& R Charts in excel that I will be able to download, the assignment information will be attached. Here's the multi-bar plot written in Anvil's client-side Python API:. 0 or later and have run using LinearAlgebra, Statistics, Compat. We then use ax. If you don't create a cumulative distribution, Prism gives you three choices illustrated below: XY graph with points, XY graph with spikes (bars). So In this tutorial, we are going to display real-time updates with SignalR and ASP. Bài viết này là bài lược dịch tiếng Việt của mình từ bài “Xbar-s Control Charts: Part 1“. (SPC) Statistical Process Control is the use of statistical techniques such as control charts to analyze a process or its output so as to take appropriate actions to achieve and maintain a state of statistical control and to improve the process capability. Covariance is the less understood sibling of correlation. y 2 sum - The total of each value in the y column squared and then added together. If this parameter is not given (none) then the mean is automatically calculated. Create these tables: just type x=, f (x)= To evaluate a numerical answer for a definite integral, open the calculus toolbar and click on the definite integral symbol. Data mining, or parsing the data to extract useful insights, is a niche skill that can transform your career as a data scientist Python is a flexible programming language that is equipped with a strong suite of libraries and toolkits, and gives you the perfect platform to sift through your data and mine the insights you seek. Get solutions tailored to your industry: Agriculture, Education, Distribution, Financial services, Government, Healthcare, Manufacturing, Professional services, Retail and consumer goods. 73% of the values lie within one, two and three standard deviations of the mean, respectively. This is hidden a little bit, but can be easily determined using the “polyfit” command. Use SignNow eSignature and document management solutions for your business workflow. Last revised 13 Jan 2013. Do it for both Income and Expense. Population and sample variance can help you describe and analyze data beyond the mean of the data set. 06 is the part of Y due to the linear function of X. If you want to use x bar as a label in matplotlib, you can. Grand Average. This unit covers methods for dealing with data that falls into categories. If you wish, you can complete Problems 1 and 3 on the Excel worksheet and Problem 2 on the Word document or you can complete all of them on the Excel or Word document. From Ramanujan to calculus co-creator Gottfried Leibniz, many of the world's best and brightest mathematical minds have belonged to autodidacts. You can rate examples to help us improve the quality of examples. Out of curiosity I downloaded the macro and ran it in my version of Excel (Microsoft Excel For Mac 2011, ver 14. x matplotlib bar-chart polar-coordinates or ask your own question. – Control charts (X-bar and R chart): All the points are within control limits in the X-bar chart. I've been looking at math notation and different packages but have yet to find anything that lets me print xbar (the average x). X-Bar, P-Hat and D-Bar. The standalone utility tlgen. Briefly discuss the data in the chart above. These are the top rated real world Python examples of pandas. Mean (XBAR) and Range (RBAR) chart with Alert image with Red for NG and green for OK result. INTERPRETATION OF SHORT-RUN ATTRIBUTE CHART. This python Bar plot tutorial also includes the steps to create Horizontal Bar plot, Vertical Bar plot, Stacked Bar plot and Grouped Bar plot. Output Stair Graph Plot. The x-bar chart generated by R provides significant information for its interpretation, including the samples (Number of groups), control limits, the overall mean (Center) the standard deviation (StdDev), and most importantly, the points beyond the control limits and the violating runs. I suggest you to refer Create a Column Chart, and Formatting Column Chart to understand the steps involved in changing the Chart types, and adding Data labels to charts. Let's say you have been recording the sales figures in Excel for the past three years. py files in Python 3. Scatter Plot Chart in Excel. Make sure that Column is selected under Chart type (it's the default setting). 6 Tables: Tables allow you to analyze your data in Excel quickly and. This is a list of 10 working graphs (bar chart, pie chart, line chart, etc. 7 rule, also known as the empirical rule, is a shorthand used to remember the percentage of values that lie within a band around the mean in a normal distribution with a width of two, four and six standard deviations, respectively; more precisely, 68. if the length of the vector is less than the number of points, the vector is repeated and concatenated to match the number required. Goals of this article : Calculate the sum and average of first n natural numbers using loop and range function. ALT codes without leading zeroes (ALT nnn) produce characters & symbols based on IBM Code Page 437 / DOS. plot: >>> plt. Control charts, also known as Shewhart charts (after Walter A. rumus mean. The control limits on both chats are used to monitor the mean and variation of the process going forward. To create a clustered or stacked bar chart in a chart sheet using VBA, use a macro with the following statement structure: Dim myChart As Chart Set myChart = Charts. The standard normal distribution can also be useful for computing percentiles. 25 units from the previous one. yaml file for a Python 3 application:. 6 Tables: Tables allow you to analyze your data in Excel quickly and. Graph Regression (10 functions) X Pie Chart X Bar Chart X e-ACTIVITY X FEATURE fx-CG50 PRIZM PROGRAM X LOGIC-BASE-N GEOMETRY Preloaded SCIENCE X Periodic Table Preloaded Scientific Constants Preloaded Metric Conversion Preloaded PICTUREPLOT Graphs on the Picture X TEXT EDITOR-SENSOR CONNECTION COMMUNICATION X USB X Mass Storage X 3pin Cable X. Matplotlib does not make this super easy, but with a bit of repetition, you'll be coding up grouped bar charts from scratch in no time. These are the top rated real world Python examples of Tkinter. Show more Show less. Despite the age of computers, we still have to crunch the numbers ourselves sometimes. Signals provide a method for notifying us of an out-of-control process or rule violation that may indicate an abnormal change in the process. pie() to create a plot. Bài viết này là bài lược dịch tiếng Việt của mình từ bài “Xbar-s Control Charts: Part 1“. Bar Chart Example. This Excel tutorial explains how to create a basic line chart in Excel 2016 (with screenshots and step-by-step instructions). Create these tables: just type x=, f (x)= To evaluate a numerical answer for a definite integral, open the calculus toolbar and click on the definite integral symbol. Highlight the data and headings (here columns A1:B13) Select the Insert Tab and Charts group and click on Pie Chart; Select the second of the 2-D Pie Charts (an exploded pie chart). In last post I covered line graph. An obvious example would be the number of sales made by a sales person, or their success as a percentage relative to goal. So in short, bar graphs are good if you to want to present the data of different groups…. This chart type creates a vertical bar graph, which Excel refers to as a Column chart. Building a combination chart in Excel is usually pretty easy. You can rate examples to help us improve the quality of examples. State the focus of statistical process control. The lesson describes how to create this control chart in both Microsoft Excel and using Minitab. x86_64 #1 SMP Tue Aug 16 04:10:59 UTC 2011 x86_64 x86_64 x86_64 GNU/Linux % ls. pretty_print (True, True) t = 'Figure 11-8 from Foster Text' cc. You might like the Matplotlib gallery. Find the right app for your business needs. The --help flag is provided for details on how to run the tool. Translingual: ·(mathematics) Σ. When searching for possible answers, pyDatalog begins with the last rule defined, i. with the Panel Chart add-in, you can separate lines by categories in different panels, so that you chart is much easier to read and understand. An X-bar and R (range) chart is a pair of control charts used with processes that have a subgroup size of two or more. Pill Identifier Results for "039 Yellow". Determine Σd i 2. You run exactly the same commands, assigning the data and layout to a Plot component in your Anvil app. Define both X-bar and R charts. Whatever is your choice, here, we will support both options unless clearly stated otherwise. … The sampling distribution of the mean is the probability distribution that describes. But a Levey Jennings chart does not use the subgroup standard deviation to develop the appropriate point estimates of X-bar stdev, it uses the "long term"/global. Income and Expense Select the data with headers and Press Ctrl + T. X Bar: 320 310 330 360 290 280 340 320 360 300 R : 12 16 14 18 22 23 10 13 27 25. Identity operators. Python Scrollbar. Access 2000 free online courses from 140 leading institutions worldwide. The charts succeed in the separation of variables in averages to that of the variations in standard deviation. For the X = 4 bin, graph a bar of height binompdf ( 31,1/6,4). where n is the sample size and x-bar is the sample mean. A bar graph or bar chart displays categorical data with parallel rectangular bars of equal width along an axis. To find the standard deviation of a set of numbers, first find the mean (average) of the set of numbers: Second, for each number in the set, subtract the mean and square the result:. The chart may look complete, but it isn’t in the proper format just yet. The highlighted section shows that the average value for subgroup 8 is well within control limits. Risk mitigation. Plotting in Scilab www. This REPL workflow will greatly speed-up your prototyping. Determine Σd i 2. Drawing a graph [Open in Overleaf] Drawing a graph using the PG 3. Please donate. The bars will have a thickness of 0. Example: import numpy as np import Ngl #-- function get_bar returns coordinates of a bar def get_bar(x,y,dx,ymin,bar_width_perc=0. So first up, why use FetchXML to get data into Power BI when there is already the OData connection available. The Pareto Chart or Pareto Diagram, named after the famous economist Vilfredo Pareto (1848-1923), is a common tool for quality control and is used as part of a Pareto Analysis to visually identify the most important factors, most occurring defects, or the most common problems, or in other words "the vital few". To ensure consistent quantity in each packet a sample of 30 packets were taken per hour in a day and its mean and range is recorded. Detail: xerr and yerr are passed directly to errorbar(), so they can also have shape 2xN for independent specification of lower and upper errors. 5 Pivot Tables: Pivot tables are one of Excel's most powerful features. In the future this association of the computers and technology is continue to increase as more and more areas of human computer interaction are going to be impacted by AI. 0] and we can find the coefficients using simultaneous equations, which we can make as we wish, as we know how to add squares to the table and to sum them, even if we don't know the formula. The standard chart for variables data, X-bar and R charts help determine if a process is stable and predictable. Find state-specific data on drunk driving below, download your state’s fact sheet, and identify strategies to help keep people safe on the road – every day. More often than not, it's more interesting to compare values across two dimensions and for that, a grouped bar chart is needed. Hundreds of charts are present, always realised with the python programming language. Keywords: matplotlib code example, codex, python plot, pyplot Gallery generated by Sphinx-Gallery. So what’s matplotlib? Matplotlib is a Python module that lets you plot all kinds of charts. In the R code above, we used the argument stat = “identity” to make barplots. An obvious example would be the number of sales made by a sales person, or their success as a percentage relative to goal. In this tutorial, we will learn how to plot a standard bar chart/graph and its other variations like double bar chart, stacked bar chart and horizontal bar chart using the Python library Matplotlib. The normal probability plot indicates that data are normally distributed. N - The total number of elements (or trials in your experiment). Cusum charts display how the group summary statistics deviate above or below the process center or target value, relative to the standard errors of the summary statistics. A statistic, such as the sample mean or the sample standard deviation, is a number computed from a sample. I've been looking at math notation and different packages but have yet to find anything that lets me print xbar (the average x). To calculate the mean of a data set, divide the sum of all values by the number of values. First, right-click on either of the axes in the chart and click ‘Select Data’ from the options. Signals provide a method for notifying us of an out-of-control process or rule violation that may indicate an abnormal change in the process. First, we set up a vector of numbers. Sum of combinations calculator. Add2(Before:=BeforeSheet, After:=AfterSheet, NewLayout:=Boolean) With myChart. No points are out of control, and all the points fall within the control limits in a random pattern. To make a bar chart with ggplot2 in R, you use the geom_bar() function. In the Python code we assume that you have already run import numpy as np. 2 Greek letters 1. When searching for possible answers, pyDatalog begins with the last rule defined, i. To create a bar chart, execute the following steps. We can supply a vector or matrix to this function. The assignment is to plot X-bar Charts,& R Charts in excel that I will be able to download, the assignment information will be attached. Generating random samples from a normal distribution. You can use this Probability Calculator to determine the probability of single and multiple events. If you have discrete numeric data from which you can obtain every equally spaced. A histogram is a type of bar plot that shows the frequency or number of values compared to a set of value ranges. Choose from different chart types, like: line and bar charts, pie charts, scatter graphs, XY graph and pie charts. The optional arguments color, edgecolor, linewidth, xerr, and yerr can be either scalars or sequences of length equal to the number of bars. Above X-bar is mean of the values, X is actual and n is number of values. A frequently asked question is how the control limits are calculated on an I-MR Chart or Individuals Chart. The usage of X-bar and R Charts has some advantages and disadvantages as well, they are, Advantages of using X-bar and R Charts are: The charts are easy to read and understand to analyze and optimize the process. Create these tables: just type x=, f (x)= To evaluate a numerical answer for a definite integral, open the calculus toolbar and click on the definite integral symbol. Calculate the value of xbar. Hotelling’s T-Squared Test. Viewed 5k times 3. That’s why we’re here to help. An equation of a straight line takes the form y = b*x + a (slope b and y-intercept a). Consider there are two tables i. bar, in a similar fashion to plt. Hypothesized mean (h): Sample mean (x): Sample size: Sample standard deviation: CALCULATE t-statistic : Degrees read more. Individual-X Moving Range Charts. Whatever is your choice, here, we will support both options unless clearly stated otherwise. We can supply a vector or matrix to this function. Updated May 13, 2020. With the grouped bar chart we need to use a numeric axis (you'll see why further below), so we create a simple range of numbers using np. An Individual-X Moving Range Chart with process capability estimates from SPC IV Excel software. if the length of the vector is less than the number of points, the vector is repeated and concatenated to match the number required. However, note that the default stat is stat_bin(), which is used to cut your data into bins. The correlation between the two variables is significant so we can conclude that there is a linear relationship between BY2XRSTD and BYSES, thus not violating the linearity assumption. Matplotlib pie chart. If a point is out of the control limits, it indicates that the mean or variation of the process is out-of-control; assignable causes may be suspected at this point. The usage of X-bar and R Charts has some advantages and disadvantages as well, they are, Advantages of using X-bar and R Charts are: The charts are easy to read and understand to analyze and optimize the process. Create charts and graphs online with Excel, CSV, or SQL data. Analytic pipelines extended by seamlessly integrating with Amazon, Azure, and Google ecosystems along with Python, R, Jupyter Notebooks, C#, and Scala. Cusum charts display how the group summary statistics deviate above or below the process center or target value, relative to the standard errors of the summary statistics. 0612882911 Hessian vector product = 94. You can calculate it as. Also note that you can only plot one chart per call. Standard Deviation versus Variance comparison chart; Standard Deviation Variance; Mathematical Formula: Square root of Variance: Average of the squares of deviations of each value from the mean in a sample. Control charts monitor the quality of the elements. A simple (but wrong) bar chart. _get_numeric_data extracted from open source projects. You can rate examples to help us improve the quality of examples. Plot symbols and colours can be specified as vectors, to allow individual specification for each point. This enables you to use bar as the basis for stacked bar charts, or candlestick plots. β0 is the value of y when x =0, and β1 is the change in y when x increases by 1 unit. n 1 and n 2 represent the sample sizes for the 1st and 2nd sample, respectively. A variety of procedures and charts are available in NCSS for assessing quality control. ACF and prediction. The Pareto Chart or Pareto Diagram, named after the famous economist Vilfredo Pareto (1848-1923), is a common tool for quality control and is used as part of a Pareto Analysis to visually identify the most important factors, most occurring defects, or the most common problems, or in other words "the vital few". Great value can be gained by using the X part of the XmR chart. xbar and sd.
he8gueavnuo 5n39o9nzh8 inpn197mbk rv6pcvpse46 mnuplfnc8gni 3ej4k7q0xg m66lhwa2v3 xsondyy4fqt0h9 q38o4kwvve5v1p ngj7gc9x93ljrn 5szk7o6vdt8u j52lywafhwlhj ma9dovzxzz92 tedvrabr4rdn3 v5zlnzkyu53th wnod4v1fs697 us90oa6r6p2vj moaum6vems bgl2elax3btfbw 2r9vcpa5op3qpt b0fx3p1bakj recs9bg1syii 40de9j87eh ijsbnxi3vvnb7l9 4puqponxvk 603fsilu1yk8b
|
{
"url": "http://e-c-o-l.it/xbar-chart-python.html",
"source_domain": "e-c-o-l.it",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "60529",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CF5QAX2MPUGVAU2OL6G33UFELA6DWTEO",
"WARC-Concurrent-To": "<urn:uuid:aa9c096f-7f80-4181-803d-eb0c02b3c71c>",
"WARC-Date": "2020-11-27T22:31:02Z",
"WARC-IP-Address": "104.18.45.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ULJC52QYZQMERFUUJAPO2ZEBG53YINHV",
"WARC-Record-ID": "<urn:uuid:485a988e-74c0-4514-9acf-5dd549033c45>",
"WARC-Target-URI": "http://e-c-o-l.it/xbar-chart-python.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0c53aef-c91b-44c7-afc1-d22c94c41c30>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-75.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,
18,
19,
55969
],
"line_end_idx": [
18,
19,
55969,
56307
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 56307,
"ccnet_original_nlines": 3,
"rps_doc_curly_bracket": 0.00007103999814717099,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35437917709350586,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030689410865306854,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1763102412223816,
"rps_doc_frac_unique_words": 0.20107008516788483,
"rps_doc_mean_word_length": 4.8156232833862305,
"rps_doc_num_sentences": 639,
"rps_doc_symbol_to_word_ratio": 0.0009672900196164846,
"rps_doc_unigram_entropy": 6.135140895843506,
"rps_doc_word_count": 9345,
"rps_doc_frac_chars_dupe_10grams": 0.445180207490921,
"rps_doc_frac_chars_dupe_5grams": 0.5069552659988403,
"rps_doc_frac_chars_dupe_6grams": 0.4938669502735138,
"rps_doc_frac_chars_dupe_7grams": 0.48026755452156067,
"rps_doc_frac_chars_dupe_8grams": 0.47262343764305115,
"rps_doc_frac_chars_dupe_9grams": 0.4521576762199402,
"rps_doc_frac_chars_top_2gram": 0.007666329853236675,
"rps_doc_frac_chars_top_3gram": 0.0021999001037329435,
"rps_doc_frac_chars_top_4gram": 0.002488780068233609,
"rps_doc_books_importance": -5264.29296875,
"rps_doc_books_importance_length_correction": -5264.29296875,
"rps_doc_openwebtext_importance": -3486.939697265625,
"rps_doc_openwebtext_importance_length_correction": -3486.939697265625,
"rps_doc_wikipedia_importance": -2420.175537109375,
"rps_doc_wikipedia_importance_length_correction": -2420.175537109375
},
"fasttext": {
"dclm": 0.27764374017715454,
"english": 0.8554012775421143,
"fineweb_edu_approx": 2.764536142349243,
"eai_general_math": 0.9648503065109253,
"eai_open_web_math": 0.42168116569519043,
"eai_web_code": 0.667573094367981
}
}
|
{
"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": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,995,949,817,322,531,000 |
Qubits
really brief, really basic primer on quantum computers: they use qubits instead of bits. Each qubit can represent a 0, a 1, or both. This last is what separates quantum computers from your average Dell or HP.
However errors can occur when a qubit holds both states: without warning they can flip to being just a regular 0 or 1, or the phase relationship can change sign (phase flip).
There are existent techniques to detect both errors, but until yesterday it was impossible to detect them both simultaneously.
Comes now some triumphant IBM researchers:
Errors are inevitable in any real information processor. Quantum computers are particularly susceptible to errors as quantum systems are highly sensitive to noise effects that can be exotic compared with the simple bit-flip errors of classical computation. As such, realizing a fault-tolerant quantum computer is a significant challenge that requires encoding the information into a quantum error-correcting code. To add to the difficulty, direct extraction of the information typically destroys the system, and ancillary syndrome systems must be employed to perform non-demolition measurements of the encoded state. Previous work in nuclei1, 2, 3, trapped ions4, 5, 6 and superconducting qubits7 has attempted to address similar problems; however, these implementations lack the ability to perform fault-tolerant syndrome extraction, which continues to be a challenge for all physical quantum computing systems.
The surface code (SC)8, 9 is a promising candidate to achieve scalable quantum computing due to its nearest-neighbour qubit layout and high fault-tolerant error thresholds10. The SC is an example of a stabilizer code12. Error detection on a lattice of code qubits is achieved through mapping stabilizer operators onto a complementary lattice of syndrome qubits, followed by classical correlation of measured outcomes. Among the syndrome qubits, a distinction is made between bit-flip syndromes (or Z-syndromes) and phase-flip syndromes (or X-syndromes). Each code qubit in the SC is coupled with two X-syndrome qubits and two Z-syndrome qubits, and, in turn, each syndrome qubit is coupled with four code qubits.
Superconducting qubits have become prime candidates for SC implementation13, 14, especially with continuing improvements to coherence times15, 16, 17 and quantum gates18. Furthermore, implementing superconducting resonators as quantum buses to realize the circuit quantum electrodynamics architecture permits a straightforward path for building connectivity into a lattice of superconducting qubits14. There are numerous ways of building the SC lattice with superconducting qubits and resonators. Here we employ an arrangement in which each qubit is coupled with two bus resonators and each bus couples with four qubits14. Although previously the engineered dissipation of a resonator has been used to stabilize the entanglement of two superconducting qubits to which it is coupled19, it is of note that here the stabilization is achieved via explicitly mapping code qubit stabilizers onto syndrome qubits.
Qubits
But of what use is a quantum computer? Well, it would be just the thing to control NASA’s new EM (electro magnetic) drive…on a ship headed to Mars:
A group at NASA’s Johnson Space Center has successfully tested an electromagnetic (EM) propulsion drive in a vacuum – a major breakthrough for a multi-year international effort comprising several competing research teams. Thrust measurements of the EM Drive defy classical physics’ expectations that such a closed (microwave) cavity should be unusable for space propulsion because of the law of conservation of momentum.[…]
The tests reported by Dr. White’s team in July 2014 were not conducted in a vacuum, and none of the tests reported by Prof. Yang in China or Mr. Shawyer in the UK were conducted in a vacuum either.
The scientific community met these NASA tests with skepticism and a number of physicists proposed that the measured thrust force in the US, UK, and China tests was more likely due to (external to the EM Drive cavity) natural thermal convection currents arising from microwave heating (internal to the EM Drive cavity).
However, Paul March, an engineer at NASA Eagleworks, recently reported in NASASpaceFlight.com’s forum (on a thread now over 500,000 views) that NASA has successfully tested their EM Drive in a hard vacuum – the first time any organization has reported such a successful test.
To this end, NASA Eagleworks has now nullified the prevailing hypothesis that thrust measurements were due to thermal convection.
NASA's EM Drive
And…speaking of Mars:
We recently updated the Mars One mission time line, with the first unmanned mission scheduled for 2020 and the first human landing on Mars in 2027. This mission is based on existing technology and the details have been well thought out with established aerospace companies. We are on our way to make the dreams of many around the world become reality. This mission to Mars will not only document the first landing on Mars but also the first settlement beyond Earth. The one-way aspect of Mars One’s mission reduces the needed infrastructure dramatically and thus makes it feasible. A return mission would require technology that is not currently available or tested and would greatly increase the cost of the mission.
Mission to Mars
One Reply to “Qubits”
Something to say...?
|
{
"url": "https://willnotbetelevised.com/2015/05/qubits/",
"source_domain": "willnotbetelevised.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "82854",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EQ6H3AKBFH4DK7IJTFANGFP4BE73K5ZI",
"WARC-Concurrent-To": "<urn:uuid:cf805d53-0d01-490b-b964-4214291a2473>",
"WARC-Date": "2017-12-11T07:25:12Z",
"WARC-IP-Address": "108.167.154.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2K572VVNOLV6KKMTBMQQVUO2A3ZAGGOO",
"WARC-Record-ID": "<urn:uuid:e597c30a-1207-4716-87ca-8377b0f6fbaa>",
"WARC-Target-URI": "https://willnotbetelevised.com/2015/05/qubits/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9a47b7e3-f090-48f9-97d9-bddb9ffcf696>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-156-45-70.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,
7,
8,
217,
218,
393,
394,
521,
522,
565,
566,
1479,
1480,
2193,
2194,
3101,
3102,
3109,
3110,
3258,
3259,
3683,
3684,
3882,
3883,
4202,
4203,
4479,
4480,
4610,
4611,
4627,
4649,
4650,
5368,
5369,
5385,
5386,
5408,
5409
],
"line_end_idx": [
7,
8,
217,
218,
393,
394,
521,
522,
565,
566,
1479,
1480,
2193,
2194,
3101,
3102,
3109,
3110,
3258,
3259,
3683,
3684,
3882,
3883,
4202,
4203,
4479,
4480,
4610,
4611,
4627,
4649,
4650,
5368,
5369,
5385,
5386,
5408,
5409,
5429
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5429,
"ccnet_original_nlines": 39,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36831483244895935,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030272450298070908,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1453077644109726,
"rps_doc_frac_unique_words": 0.4851367473602295,
"rps_doc_mean_word_length": 5.288941860198975,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.00403633015230298,
"rps_doc_unigram_entropy": 5.444975852966309,
"rps_doc_word_count": 841,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008093530312180519,
"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.006744599901139736,
"rps_doc_frac_chars_top_3gram": 0.00876799039542675,
"rps_doc_frac_chars_top_4gram": 0.007194240111857653,
"rps_doc_books_importance": -463.51214599609375,
"rps_doc_books_importance_length_correction": -463.51214599609375,
"rps_doc_openwebtext_importance": -275.3880920410156,
"rps_doc_openwebtext_importance_length_correction": -275.3880920410156,
"rps_doc_wikipedia_importance": -183.60470581054688,
"rps_doc_wikipedia_importance_length_correction": -183.60470581054688
},
"fasttext": {
"dclm": 0.1184009313583374,
"english": 0.9363219141960144,
"fineweb_edu_approx": 2.7416799068450928,
"eai_general_math": 0.8920732140541077,
"eai_open_web_math": 0.463203489780426,
"eai_web_code": 0.13056445121765137
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "629.43",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"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": "News/Editorial"
}
},
"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": "16",
"label": "Personal Blog"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,759,589,878,290,433,000 |
Tell me more ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
If I receive files over the FTP command line, where will they be saved?
share|improve this question
migrated from stackoverflow.com May 1 '10 at 18:12
2 Answers
up vote 5 down vote accepted
As Shevek noted, the files will go to the current directory when ftp was launched
-or-
the last specified directory from an lcd (local change dir) command within the ftp session.
share|improve this answer
+1 from me - I forgot about lcd! – Shevek Oct 19 '11 at 12:05
In whichever folder the command prompt was in when you launched the FTP command
share|improve this answer
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://superuser.com/questions/136749/if-i-receive-files-over-the-ftp-command-line-where-will-they-be-saved/136754",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "44961",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7ASUV4GDA2VNWQMUV3S6LRSOIEXF66N4",
"WARC-Concurrent-To": "<urn:uuid:427cfa1a-90f2-43e7-801b-860a36d02db6>",
"WARC-Date": "2013-05-25T21:19:34Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2EHRLQVMKRV4IG6ISJXNIUYWFC2NYKZP",
"WARC-Record-ID": "<urn:uuid:99e86eeb-ceea-4fc8-a7fa-208c91c6f2dd>",
"WARC-Target-URI": "http://superuser.com/questions/136749/if-i-receive-files-over-the-ftp-command-line-where-will-they-be-saved/136754",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef9d9e8b-7c78-4361-9cc8-70b5accb1cd3>"
},
"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,
15,
140,
141,
213,
214,
242,
243,
294,
295,
305,
306,
335,
336,
418,
419,
424,
425,
517,
518,
544,
606,
607,
687,
688,
714,
715,
727,
728,
730,
738,
739,
817,
818
],
"line_end_idx": [
15,
140,
141,
213,
214,
242,
243,
294,
295,
305,
306,
335,
336,
418,
419,
424,
425,
517,
518,
544,
606,
607,
687,
688,
714,
715,
727,
728,
730,
738,
739,
817,
818,
908
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 908,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33507853746414185,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020942410454154015,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22513088583946228,
"rps_doc_frac_unique_words": 0.6818181872367859,
"rps_doc_mean_word_length": 4.597402572631836,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.476275444030762,
"rps_doc_word_count": 154,
"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.025423729792237282,
"rps_doc_frac_chars_top_3gram": 0.03672315925359726,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -104.43254089355469,
"rps_doc_books_importance_length_correction": -104.43254089355469,
"rps_doc_openwebtext_importance": -57.08990478515625,
"rps_doc_openwebtext_importance_length_correction": -47.066429138183594,
"rps_doc_wikipedia_importance": -32.706851959228516,
"rps_doc_wikipedia_importance_length_correction": -32.706851959228516
},
"fasttext": {
"dclm": 0.21348756551742554,
"english": 0.904905378818512,
"fineweb_edu_approx": 1.5613727569580078,
"eai_general_math": -0.000009890000001178123,
"eai_open_web_math": 0.07196242362260818,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"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": "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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,609,720,072,325,009,000 |
Auto calculate the "rate" when we write "amount" in sales invoice (Paid Help)
I want someone who can do this paid task for me.
when we input “rate” the amount is auto calculated. now i want that when we write amount, the rate also calculated.
when there is change on field rate, it will auto calculate amount, if you implement the logic to trigger calculate rate when amount changed, this will cause endless update on rate, then amount, then rate …?
So what is the business background you need this feature?
1 Like
hi
you can use this custom script :
frappe.ui.form.on("Sales Invoice Item", "amount", function(frm, cdt, cdn) {
var item_row = locals[cdt][cdn];
item_row.rate = (item_row.amount/item_row.qty) ;
});
but you have first made “amount” filed writable.
@youssef How did you make amount field writable?
|
{
"url": "https://discuss.frappe.io/t/auto-calculate-the-rate-when-we-write-amount-in-sales-invoice-paid-help/54861",
"source_domain": "discuss.frappe.io",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "20322",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q4EL27ROSUMMYMN3KBEXSNG7O4S5BATM",
"WARC-Concurrent-To": "<urn:uuid:0821b955-524c-4385-8598-7e71cda6e4cd>",
"WARC-Date": "2024-02-22T12:10:14Z",
"WARC-IP-Address": "64.227.130.54",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OKOYECAHR2O4HLWAAN2HBTPCSM5TB2K7",
"WARC-Record-ID": "<urn:uuid:21f85ce3-e936-46c0-9ad3-4275de3de2d3>",
"WARC-Target-URI": "https://discuss.frappe.io/t/auto-calculate-the-rate-when-we-write-amount-in-sales-invoice-paid-help/54861",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:64bacd9d-c2ac-46b7-9173-1d31d912fe1c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\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,
78,
79,
128,
129,
245,
246,
453,
454,
512,
513,
520,
521,
524,
557,
558,
634,
635,
672,
673,
726,
727,
731,
732,
781,
782
],
"line_end_idx": [
78,
79,
128,
129,
245,
246,
453,
454,
512,
513,
520,
521,
524,
557,
558,
634,
635,
672,
673,
726,
727,
731,
732,
781,
782,
830
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 830,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0.0024096400011330843,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31382977962493896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005319150164723396,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.271276593208313,
"rps_doc_frac_unique_words": 0.6328125,
"rps_doc_mean_word_length": 4.84375,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.005319150164723396,
"rps_doc_unigram_entropy": 4.17318868637085,
"rps_doc_word_count": 128,
"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.029032260179519653,
"rps_doc_frac_chars_top_3gram": 0.03548387065529823,
"rps_doc_frac_chars_top_4gram": 0.05483870953321457,
"rps_doc_books_importance": -71.94617462158203,
"rps_doc_books_importance_length_correction": -71.94617462158203,
"rps_doc_openwebtext_importance": -55.14372253417969,
"rps_doc_openwebtext_importance_length_correction": -54.72536087036133,
"rps_doc_wikipedia_importance": -54.58970642089844,
"rps_doc_wikipedia_importance_length_correction": -54.58970642089844
},
"fasttext": {
"dclm": 0.8000010251998901,
"english": 0.8707729578018188,
"fineweb_edu_approx": 2.8814570903778076,
"eai_general_math": 0.9738994240760803,
"eai_open_web_math": 0.33017945289611816,
"eai_web_code": 0.5557279586791992
}
}
|
{
"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.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,709,975,974,837,284,400 |
Dismiss
Announcing Stack Overflow Documentation
We started with Q&A. Technical documentation is next, and we need your help.
Whether you're a beginner or an experienced developer, you can contribute.
Sign up and start helping → Learn more about Documentation →
If I include the if test in my code the error message is returned and I'm not sure why. and when it's not used, my program get's stuck in a loop where it never reaches the end of the file. I don't understand what's going wrong.
int countlines()
{
fstream myfile;
myfile.open("questions.txt", ios::in);
string contents;
int linenumber = 0;
//if (myfile.is_open())
// {
while (!myfile.eof())
{
getline( myfile, contents );
if (contents != "")
{
linenumber++;
}
}
cout << "there are " << linenumber << " lines.\n";
//}else {cout<<"Unable to get file.\n";}
myfile.close();
return(linenumber);
}
share|improve this question
5
while (!myfile.eof()) is almost always wrong. Where were you taught to do that? – Lightness Races in Orbit Jan 27 '12 at 22:01
@LightnessRacesinOrbit it was the only sample code that seemed to work. so I got it off a programming website I assume! – Bhuggy Jan 27 '12 at 22:06
1
@Bhuggy: you probably got it from a bad online tutorial like the "file handling" tutorial on cpluscplus.com. Be careful! cplusplus.com as it sometimes gives bad advice and/or facts. – André Caron Jan 27 '12 at 22:23
@Bhuggy: Reason I ask is so that I can contact the author. You should get yourself a proper C++ book which, when found on that list, are trustworthy; random tutorials on the internet are not trustworthy. – Lightness Races in Orbit Jan 27 '12 at 22:29
@AndréCaron yeah it probably was from there, most of my searches seem to end up on cplusplus forums or tutorial pages. – Bhuggy Jan 27 '12 at 23:20
What's going on is that your file is not being opened. That's why is_open fails.
Then, when you comment out the check, you're breaking your loop because you're iterating incorrectly (see my comment) and not detecting stream failures (.eof() will never be true on that stream).
Make sure that the file is in the right place, and that it is accessible.
share|improve this answer
How would I make my file accessible? It's in the right place (in the program file with all the other code files) so I can only assume something's stopping it from being accessed. – Bhuggy Jan 27 '12 at 22:11
Bhuggy, you're opening the file with a relative path. Are you sure your program's current working directory at the time you call countlines is really the one that contains your file? Use an absolute path, or call chdir to make sure the current directory is what you think it is. – Rob Kennedy Jan 27 '12 at 22:19
@Bhuggy: It doesn't really matter where the program file is. In fact, the process doesn't even know where the program file is! What matters is the current working directory of the environment that invoked the executable. – Lightness Races in Orbit Jan 27 '12 at 22:30
@RobKennedy is there any good tutorials on using paths? I only ask as I was looking for something to easily navigate files but i couldn't really find anything that was appropriate, but maybe that's because i was looking for an easy way to do things and ignored the good stuff. – Bhuggy Jan 27 '12 at 23:24
@Bhuggy: As I said before, you want a peer-reviewed book, not some "tut". – Lightness Races in Orbit Jan 28 '12 at 15:32
The correct idiom for reading a file line-by-line in C++ is using a loop like this:
for (std::string line; std::getline(file,line);)
{
// process line.
}
Inserting this in your example (+fixing indentation and variable names) gives something like this:
int countlines(const std::string& path)
{
// Open the file.
std::ifstream file(path.c_str());
if (!file.is_open()) {
return -1; // or better, throw exception.
}
// Count the lines.
int count = 0;
for (std::string line; std::getline(file,line);)
{
if (!line.empty()) {
++count;
}
}
return count;
}
Note that if you don't intend to process the line contents, you can actually skip processing them using std::streambuf_iterator, which can make your code look like:
int countlines(const std::string& path)
{
// Open the file.
std::ifstream file(path.c_str());
if (!file.is_open()) {
return -1; // or better, throw exception.
}
// Refer to the beginning and end of the file with
// iterators that process the file character by character.
std::istreambuf_iterator<char> current(file);
const std::istreambuf_iterator<char> end;
// Count the number of newline characters.
return std::count(current, end, '\n');
}
The second version will completely bypass copying the file contents and avoid allocating large chunks of memory for long lines.
share|improve this answer
When using std::istream and std::ostream (whose std::fstream implements), the recommended usage is to directly use the stream in a bool context instead of calling eof() function because it only return true when you managed to read until the last byte of the file. If there was any error before that, the function will still return true.
So, you should have written your code as:
int countlines() {
ifstream myfile;
int linenumber = 0;
string linecontent;
myfile.open("question.txt", ios::in);
while (getline(myfile, linecontent)) {
if (!linecontent.empty()) {
++linenumber;
}
}
return linenumber;
}
share|improve this answer
1
Actually it's mostly because it doesn't set eof until a read has already failed due to EOF. However, yes, you gain checks for the other flags too by testing the stream directly. – Lightness Races in Orbit Jan 27 '12 at 22:31
You're right, I've edited my response. – Sylvain Defresne Jan 27 '12 at 22:35
Alright, looks good :) +1 – Lightness Races in Orbit Jan 28 '12 at 15:33
Try the following code. It will also (hopefully) give you an idea why the file open is failing...
int countlines()
{
ifstream myfile;
myfile.open("questions.txt");
string contents;
int linenumber = 0;
if (myfile.is_open())
{
while (getline(myfile, contents))
{
if (contents != "")
linenumber++;
}
cout << "there are " << linenumber << " lines." << endl;
myfile.close();
}
else
cout << "Unable to get file (reason: " << strerror(errno) << ")." << endl;
return linenumber;
}
share|improve this answer
The iteration is still not right. And is fstream opening failure guaranteed to set errno? Good call if so; but I'm not sure. – Lightness Races in Orbit Jan 27 '12 at 22:35
Not sure if errno is guaranteed to be set but a quick test using g++ on OS X confirms it works here and I would imagine it works on Linux too. Fingers crossed for Windows. Thought it may help the OP figure out the reason for the open failure. – Nick Smith Jan 27 '12 at 22:54
Also, many thanks for your downvote. – Nick Smith Jan 27 '12 at 22:55
The iteration is wrong, so you get a downvote. No need to be snippy. – Lightness Races in Orbit Jan 28 '12 at 15:33
getline() call moved into the loop condition as others have pointed out is recommended practice. – Nick Smith Jan 29 '12 at 23:03
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/9040651/c-file-handling-is-open-returning-bad",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "108755",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3SHJRF6NQRZZD7RF4W4NG6BTJDLZ5U2V",
"WARC-Concurrent-To": "<urn:uuid:a69e2842-736d-47c9-a23c-28f8766dceb9>",
"WARC-Date": "2016-07-27T02:23:05Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YP56Y2NE5XIOUWLHOFRO7XS5ZBOUBDO4",
"WARC-Record-ID": "<urn:uuid:64b87fa4-ca91-475a-851a-6456e913795a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/9040651/c-file-handling-is-open-returning-bad",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c8d5e349-d31e-46f0-a767-e2a1d69082d4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 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,
8,
48,
49,
126,
127,
202,
203,
264,
265,
493,
494,
511,
513,
533,
576,
597,
621,
622,
652,
661,
689,
695,
732,
760,
770,
796,
806,
812,
867,
912,
913,
933,
957,
959,
987,
991,
1118,
1123,
1272,
1276,
1492,
1497,
1748,
1753,
1901,
1902,
1983,
1984,
2180,
2181,
2255,
2256,
2282,
2287,
2495,
2500,
2813,
2818,
3086,
3091,
3397,
3402,
3523,
3524,
3608,
3609,
3658,
3660,
3681,
3683,
3684,
3783,
3784,
3824,
3826,
3848,
3886,
3913,
3963,
3969,
3970,
3994,
4013,
4066,
4072,
4101,
4122,
4132,
4138,
4139,
4157,
4159,
4160,
4325,
4326,
4366,
4368,
4390,
4428,
4455,
4505,
4511,
4512,
4567,
4630,
4680,
4726,
4727,
4774,
4817,
4819,
4820,
4948,
4949,
4975,
4976,
5313,
5314,
5356,
5357,
5376,
5397,
5421,
5445,
5487,
5530,
5566,
5592,
5602,
5608,
5631,
5633,
5659,
5663,
5888,
5893,
5971,
5976,
6049,
6050,
6148,
6149,
6166,
6168,
6189,
6223,
6244,
6268,
6269,
6297,
6303,
6347,
6357,
6389,
6419,
6429,
6502,
6526,
6532,
6541,
6624,
6625,
6648,
6650,
6676,
6681,
6853,
6858,
7134,
7139,
7209,
7214,
7330,
7335,
7465,
7466,
7478,
7479,
7481,
7489,
7490,
7568,
7569
],
"line_end_idx": [
8,
48,
49,
126,
127,
202,
203,
264,
265,
493,
494,
511,
513,
533,
576,
597,
621,
622,
652,
661,
689,
695,
732,
760,
770,
796,
806,
812,
867,
912,
913,
933,
957,
959,
987,
991,
1118,
1123,
1272,
1276,
1492,
1497,
1748,
1753,
1901,
1902,
1983,
1984,
2180,
2181,
2255,
2256,
2282,
2287,
2495,
2500,
2813,
2818,
3086,
3091,
3397,
3402,
3523,
3524,
3608,
3609,
3658,
3660,
3681,
3683,
3684,
3783,
3784,
3824,
3826,
3848,
3886,
3913,
3963,
3969,
3970,
3994,
4013,
4066,
4072,
4101,
4122,
4132,
4138,
4139,
4157,
4159,
4160,
4325,
4326,
4366,
4368,
4390,
4428,
4455,
4505,
4511,
4512,
4567,
4630,
4680,
4726,
4727,
4774,
4817,
4819,
4820,
4948,
4949,
4975,
4976,
5313,
5314,
5356,
5357,
5376,
5397,
5421,
5445,
5487,
5530,
5566,
5592,
5602,
5608,
5631,
5633,
5659,
5663,
5888,
5893,
5971,
5976,
6049,
6050,
6148,
6149,
6166,
6168,
6189,
6223,
6244,
6268,
6269,
6297,
6303,
6347,
6357,
6389,
6419,
6429,
6502,
6526,
6532,
6541,
6624,
6625,
6648,
6650,
6676,
6681,
6853,
6858,
7134,
7139,
7209,
7214,
7330,
7335,
7465,
7466,
7478,
7479,
7481,
7489,
7490,
7568,
7569,
7659
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7659,
"ccnet_original_nlines": 183,
"rps_doc_curly_bracket": 0.004700350109487772,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.319352924823761,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01378071028739214,
"rps_doc_frac_lines_end_with_ellipsis": 0.005434779915958643,
"rps_doc_frac_no_alph_words": 0.31276214122772217,
"rps_doc_frac_unique_words": 0.38170623779296875,
"rps_doc_mean_word_length": 4.719437122344971,
"rps_doc_num_sentences": 93,
"rps_doc_symbol_to_word_ratio": 0.0005991599755361676,
"rps_doc_unigram_entropy": 5.500274181365967,
"rps_doc_word_count": 1137,
"rps_doc_frac_chars_dupe_10grams": 0.05255310982465744,
"rps_doc_frac_chars_dupe_5grams": 0.16753633320331573,
"rps_doc_frac_chars_dupe_6grams": 0.14237794280052185,
"rps_doc_frac_chars_dupe_7grams": 0.1304509937763214,
"rps_doc_frac_chars_dupe_8grams": 0.12336935847997665,
"rps_doc_frac_chars_dupe_9grams": 0.08721580356359482,
"rps_doc_frac_chars_top_2gram": 0.013417820446193218,
"rps_doc_frac_chars_top_3gram": 0.018263140693306923,
"rps_doc_frac_chars_top_4gram": 0.023481180891394615,
"rps_doc_books_importance": -705.9774780273438,
"rps_doc_books_importance_length_correction": -705.9774780273438,
"rps_doc_openwebtext_importance": -346.9672546386719,
"rps_doc_openwebtext_importance_length_correction": -346.9672546386719,
"rps_doc_wikipedia_importance": -276.82305908203125,
"rps_doc_wikipedia_importance_length_correction": -276.82305908203125
},
"fasttext": {
"dclm": 0.18624448776245117,
"english": 0.8575336337089539,
"fineweb_edu_approx": 1.7393293380737305,
"eai_general_math": 0.11888890713453293,
"eai_open_web_math": 0.2734982967376709,
"eai_web_code": 0.003636240027844906
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,569,818,671,167,317,500 |
Best Way to Iterate Over a Dictionary in C#
Puneet Dobhal Oct 12, 2023
1. Use the for Loop to Iterate Over a Dictionary in C#
2. Use foreach Loop to Iterate Over a Dictionary in C#
3. Use ParallelEnumerable.ForAll Method to Iterate a Dictionary in C#
Best Way to Iterate Over a Dictionary in C#
Dictionary in C# is a collection of key-value pairs. It is somewhat similar to the English dictionary where the key represents a word and value is its meaning. In this article, we will look at different ways of iterating a dictionary.
For representational purposes, we will consider the following definition of the Dictionary object throughout the article.
Dictionary<int, string> sample_Dict = new Dictionary<int, string>();
Now, Let’s look at some of the methods you can use to traverse this dictionary.
Use the for Loop to Iterate Over a Dictionary in C#
for loop method is easy and concise, where we sequentially iterate over the dictionary using an index.
using System;
using System.Collections.Generic;
public class Sample {
public static void Main() {
Dictionary<int, string> sample_Dict =
new Dictionary<int, string>() { { 0, "value_1" }, { 1, "value_2" }, { 2, "value_3" } };
for (int index = 0; index < sample_Dict.Count; index++)
System.Console.WriteLine(index + ":" + sample_Dict[index]);
}
}
Output:
0:value_1
1:value_2
2:value_3
As you will notice we have also specified the initializer list while defining the Dictionary object. While specifying the initializer list, make sure that each entry in the list has a unique key, otherwise, it will lead to Run-time exception.
Use foreach Loop to Iterate Over a Dictionary in C#
foreach looping is another alternative that you can opt for.
using System;
using System.Collections.Generic;
public class Sample {
public static void Main() {
Dictionary<int, string> sample_Dict =
new Dictionary<int, string>() { { 0, "value_1" }, { 1, "value_2" }, { 2, "value_3" } };
foreach (var entry in sample_Dict) System.Console.WriteLine(entry.Key + ":" + entry.Value);
}
}
Output:
0:value_1
1:value_2
2:value_3
The above method can be considered a lazy implementation of foreach loop. We can also implement foreach method using KeyValuePair<TKey,TValue> structure.
using System;
using System.Collections.Generic;
public class Sample {
public static void Main() {
Dictionary<int, string> sample_Dict =
new Dictionary<int, string>() { { 0, "value_1" }, { 1, "value_2" }, { 2, "value_3" } };
foreach (var entry in sample_Dict) System.Console.WriteLine(entry.Key + ":" + entry.Value);
}
}
Output:
0:value_1
1:value_2
2:value_3
Use ParallelEnumerable.ForAll Method to Iterate a Dictionary in C#
This method comes in handy when you are iterating over large dictionaries, as it incorporates multithreading processing for each key-value pair in the dictionary.
using System;
using System.Linq;
using System.Collections.Generic;
public class Sample {
public static void Main() {
/*User Code Here*/
Dictionary<int, string> sample_Dict =
new Dictionary<int, string>() { { 0, "value_1" }, { 1, "value_2" }, { 2, "value_3" } };
sample_Dict.AsParallel().ForAll(entry => Console.WriteLine(entry.Key + ":" + entry.Value));
}
}
Output:
0:value_1
1:value_2
2:value_3
When analyzing the best method out of the above mentioned, we need to consider certain parameters and the result would be circumstantial. Looping method is concise and effective but when iterating large dictionaries it becomes impractical in terms of run time complexity.
This is where ParallelEnumerable.ForAll method comes in as it allows concurrent execution saving crucial time, which may be an important factor while designing certain applications.
Related Article - Csharp Dictionary
|
{
"url": "https://www.delftstack.com/howto/csharp/how-to-iterate-over-a-dictionary/",
"source_domain": "www.delftstack.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "38824",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FKG6M6US75HPMCK37NLJEKRBXU3Y2IMA",
"WARC-Concurrent-To": "<urn:uuid:5522aca9-a970-40e5-b2bd-e4e32af21d1a>",
"WARC-Date": "2024-03-05T03:27:20Z",
"WARC-IP-Address": "18.213.222.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZOXBB5FX7CHGSGKTBXUSAVUT3SFLSQJC",
"WARC-Record-ID": "<urn:uuid:7d5bce45-1e00-4959-9403-fb00a4ed0c33>",
"WARC-Target-URI": "https://www.delftstack.com/howto/csharp/how-to-iterate-over-a-dictionary/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:02e55e33-bc04-48d3-90f6-86f868021313>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239\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,
44,
45,
72,
129,
186,
258,
302,
303,
538,
539,
661,
662,
731,
732,
812,
813,
865,
866,
969,
970,
984,
1018,
1019,
1041,
1071,
1113,
1209,
1269,
1335,
1339,
1341,
1342,
1350,
1351,
1361,
1371,
1381,
1382,
1625,
1626,
1678,
1679,
1740,
1741,
1755,
1789,
1790,
1812,
1842,
1884,
1980,
2076,
2080,
2082,
2083,
2091,
2092,
2102,
2112,
2122,
2123,
2277,
2278,
2292,
2326,
2327,
2349,
2379,
2421,
2517,
2613,
2617,
2619,
2620,
2628,
2629,
2639,
2649,
2659,
2660,
2727,
2728,
2891,
2892,
2906,
2925,
2959,
2960,
2982,
3012,
3035,
3077,
3173,
3269,
3273,
3275,
3276,
3284,
3285,
3295,
3305,
3315,
3316,
3588,
3589,
3771,
3772
],
"line_end_idx": [
44,
45,
72,
129,
186,
258,
302,
303,
538,
539,
661,
662,
731,
732,
812,
813,
865,
866,
969,
970,
984,
1018,
1019,
1041,
1071,
1113,
1209,
1269,
1335,
1339,
1341,
1342,
1350,
1351,
1361,
1371,
1381,
1382,
1625,
1626,
1678,
1679,
1740,
1741,
1755,
1789,
1790,
1812,
1842,
1884,
1980,
2076,
2080,
2082,
2083,
2091,
2092,
2102,
2112,
2122,
2123,
2277,
2278,
2292,
2326,
2327,
2349,
2379,
2421,
2517,
2613,
2617,
2619,
2620,
2628,
2629,
2639,
2649,
2659,
2660,
2727,
2728,
2891,
2892,
2906,
2925,
2959,
2960,
2982,
3012,
3035,
3077,
3173,
3269,
3273,
3275,
3276,
3284,
3285,
3295,
3305,
3315,
3316,
3588,
3589,
3771,
3772,
3807
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3807,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0.01260835025459528,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22732919454574585,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011180119588971138,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35652172565460205,
"rps_doc_frac_unique_words": 0.36213991045951843,
"rps_doc_mean_word_length": 5.734568119049072,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.011180119588971138,
"rps_doc_unigram_entropy": 4.74390172958374,
"rps_doc_word_count": 486,
"rps_doc_frac_chars_dupe_10grams": 0.31180480122566223,
"rps_doc_frac_chars_dupe_5grams": 0.4316469430923462,
"rps_doc_frac_chars_dupe_6grams": 0.4183710217475891,
"rps_doc_frac_chars_dupe_7grams": 0.40007176995277405,
"rps_doc_frac_chars_dupe_8grams": 0.40007176995277405,
"rps_doc_frac_chars_dupe_9grams": 0.40007176995277405,
"rps_doc_frac_chars_top_2gram": 0.06817366182804108,
"rps_doc_frac_chars_top_3gram": 0.041980620473623276,
"rps_doc_frac_chars_top_4gram": 0.04018658027052879,
"rps_doc_books_importance": -382.8770751953125,
"rps_doc_books_importance_length_correction": -382.8770751953125,
"rps_doc_openwebtext_importance": -211.47250366210938,
"rps_doc_openwebtext_importance_length_correction": -211.47250366210938,
"rps_doc_wikipedia_importance": -164.10855102539062,
"rps_doc_wikipedia_importance_length_correction": -164.10855102539062
},
"fasttext": {
"dclm": 0.8656859993934631,
"english": 0.6672413349151611,
"fineweb_edu_approx": 2.9526753425598145,
"eai_general_math": 0.4261676073074341,
"eai_open_web_math": 0.15893900394439697,
"eai_web_code": 0.8506456613540649
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-24,264,142,693,213,450 |
saffroncodejs
Package of optimised react components and javascript functions for developers ♫♪
Usage no npm install needed!
<script type="module">
import saffroncodejs from 'https://cdn.skypack.dev/saffroncodejs';
</script>
README
Saffron React
Package of graphical and non graphical libraries for React developers such as Canvas preloader and Regex functions.
(Support us with your stars on Github )
npm install saffroncodejs
ui
import {ui} from 'saffroncodejs'
Preloader
1- Set the Preloader color,size and animation speed once in index.js ui.Preloader.setUp("#777777ff",200,200,0.2)
2- and then use it every where like below: <ui.Preloader/> ☺
Input
This is just like html input tag but it has better control on patterns and it will correct the user's mismatches character
TagForInput
this component displayes a tag name on top corner of the input element passed to it (as a child component)
**the element can be an input, a textArea or a select input
**supports rtl and ltr direction
to use inside a react app:
<ui.TagForInput tagName="title">
<input />
</ui.TagForInput>
example
example
example
example
Properties:
rtl : boolean ---> whether the tagName should be on left corner or right -- default is false
tagName: string ---> the tag title
tagBackGround: string ---> the background color of the tag span -- default is white
tagColor: string ---> tagName color -- default is black
ItemSlider
this component is a slider for the cards (or divs with your own design) you pass to it.
DEMO
to use inside a react app:
<ui.ItemsSlider rtl id="slider1">
<div className="item"></div>
<div className="item"></div>
<div className="item"></div>
<div className="item"></div>
</ui.ItemsSlider>
***Notice that the divs you pass to this component, should have a class and the class can be named and styled as you wish***
Properties:
id : string ---> this is the identifier that enables navigation button scrolling
rtl : boolean ---> whether the tagName should be on left corner or right -- default is false
color : string ---> color for the navigation buttons -- default is black
fontSize: string ---> font size of the navigation buttons -- default is 20px
top: string ---> the position of the navigation buttons from top of the container
noNavButtons: boolean ---> display or don't display Navigation Buttons -- default is false(display)
libs
Pure JS functions and classes
import {libs} from 'saffroncodejs'
StringFunctions
Full list of libs.StringFunctions functions:
clearDoubleQuartmarksOnJSON(str:string=""):string
clearHTMLTags(ReferText:string=""):string
clearSpacesAndTabs(str:string=""):string
clearSpacesAndTabsAndArrows(str:string="")
compairFarsiString(str1:string="",str2:string=""):number
correctInputString(str:string=""):string
correctUTF(utfWord:string=""):string
currancyPrint(inputcurencynumber:string):string
fileSizeInString(fileSizeInByte:number=0):string
findMainDomain(url:string="",removeHTTPPart:boolean=true):string
findPortOfURL(url:string=""):number
generateLinks(str:string="",linkColors:number=-1):string
htmlCharacterEncoder(str:string=""):string
isArabic(str:string=""):boolean
isEmail(email:string=""):boolean
isLocation(str:string=""):boolean
isNullOrEmpty(value:string):boolean
isPersian(str:string="",stringLength:number=NaN):boolean
isURL(str:string=""):boolean
jsonCorrector(oldJson:string=""):string
KaafYe(str:string=""):string
makeHTMLWithSize(pureHML:string="", defaultFontSize:number=0):string
numCorrection(str:string=""):string
numToString(num:number,numberLenght:number=2):string
removeHTML(ReferText:string=""):string
removeNumberFromBegining(str:string=""):string
removeSpacesFromTwoSides(str:string=""):string
returnLasNumberPartInInteger(str:string=""):number
search(str:string="",searchedWord:string="",fineAll:boolean = true,arabic:boolean=false, arabic2:boolean=false)
short(str:string="",len:number=10,removeEntersWith:string='')
stringToColor(str:string=""):number
timeInString(seconds:number=0):string
utfToUnicode(utfString:string=""):string
framework
import {framework} from 'saffroncodejs'
EventDispatcher
var dispatcher = new EventDispatcher();
//How to add and remove an EventListner on an dispatcher
dispatcher.addEventListner(type:string,trigger:(eventType?:string,param?:any)=>any):void;
//sample : dispatcher.addEventListner("LOGGED_IN",this.userIsLoggedIn)
dispatcher.removeEventListner(type:string,trigger:(eventType?:string,param?:any)=>any):void;
//sample : dispatcher.removeEventListner("LOGGED_IN",this.userIsLoggedIn)
//How to dispatch an event on your dispatcher
dispatcher.dispatchEvent(type:string,param:any=null):void;
//sample : dispatcher.dispatchEvent("LOGGED_IN",userTocken)
PageManager(ReactRouter's Assist)
dispatcher:new EventDispatcher()
PAGE_CHANGED : "PAGE_CHANGED"
routerParamList:''
changePage:changePage
decodePageParams:decodePageParams
getCurrentPage:getCurrentPage
registerPage:registerPage
PageData
url:string;
pageName:string;
component?:React.ComponentClass;
pageData:any;
|
{
"url": "https://www.skypack.dev/view/saffroncodejs",
"source_domain": "www.skypack.dev",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "46859",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OLN4TBGP5FJORIL3R5BBSJCARSLZEM7A",
"WARC-Concurrent-To": "<urn:uuid:5a65823a-cf91-49e9-8d96-983740660b56>",
"WARC-Date": "2022-05-24T02:57:18Z",
"WARC-IP-Address": "76.76.21.241",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WHHS7M53ZX4ZOAREU2IQFZEDYSN6ATNC",
"WARC-Record-ID": "<urn:uuid:e4766952-a5f6-44a6-b0cf-60d2842eb9db>",
"WARC-Target-URI": "https://www.skypack.dev/view/saffroncodejs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:266a1515-7364-4ca4-b959-b1994a716fbe>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-36\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,
14,
15,
96,
97,
126,
127,
150,
219,
229,
230,
237,
238,
252,
253,
369,
370,
410,
411,
437,
438,
441,
442,
475,
476,
486,
487,
600,
661,
662,
663,
664,
670,
671,
794,
795,
796,
797,
809,
810,
917,
977,
1010,
1037,
1038,
1071,
1083,
1101,
1102,
1110,
1118,
1126,
1134,
1135,
1147,
1148,
1241,
1276,
1360,
1416,
1417,
1418,
1419,
1430,
1431,
1432,
1520,
1521,
1526,
1553,
1554,
1588,
1618,
1648,
1678,
1708,
1726,
1727,
1728,
1853,
1854,
1866,
1947,
2040,
2113,
2190,
2272,
2372,
2373,
2378,
2379,
2409,
2444,
2445,
2461,
2462,
2507,
2508,
2558,
2600,
2641,
2684,
2741,
2782,
2819,
2867,
2916,
2981,
3017,
3074,
3117,
3149,
3182,
3216,
3252,
3309,
3338,
3378,
3407,
3476,
3512,
3565,
3604,
3651,
3698,
3749,
3861,
3923,
3959,
3997,
4038,
4039,
4049,
4050,
4090,
4091,
4107,
4108,
4148,
4149,
4206,
4207,
4297,
4298,
4369,
4370,
4463,
4464,
4538,
4539,
4585,
4586,
4645,
4646,
4706,
4707,
4741,
4742,
4775,
4776,
4806,
4807,
4826,
4827,
4849,
4850,
4884,
4885,
4915,
4916,
4942,
4943,
4952,
4953,
4965,
4966,
4983,
4984,
5017,
5018
],
"line_end_idx": [
14,
15,
96,
97,
126,
127,
150,
219,
229,
230,
237,
238,
252,
253,
369,
370,
410,
411,
437,
438,
441,
442,
475,
476,
486,
487,
600,
661,
662,
663,
664,
670,
671,
794,
795,
796,
797,
809,
810,
917,
977,
1010,
1037,
1038,
1071,
1083,
1101,
1102,
1110,
1118,
1126,
1134,
1135,
1147,
1148,
1241,
1276,
1360,
1416,
1417,
1418,
1419,
1430,
1431,
1432,
1520,
1521,
1526,
1553,
1554,
1588,
1618,
1648,
1678,
1708,
1726,
1727,
1728,
1853,
1854,
1866,
1947,
2040,
2113,
2190,
2272,
2372,
2373,
2378,
2379,
2409,
2444,
2445,
2461,
2462,
2507,
2508,
2558,
2600,
2641,
2684,
2741,
2782,
2819,
2867,
2916,
2981,
3017,
3074,
3117,
3149,
3182,
3216,
3252,
3309,
3338,
3378,
3407,
3476,
3512,
3565,
3604,
3651,
3698,
3749,
3861,
3923,
3959,
3997,
4038,
4039,
4049,
4050,
4090,
4091,
4107,
4108,
4148,
4149,
4206,
4207,
4297,
4298,
4369,
4370,
4463,
4464,
4538,
4539,
4585,
4586,
4645,
4646,
4706,
4707,
4741,
4742,
4775,
4776,
4806,
4807,
4826,
4827,
4849,
4850,
4884,
4885,
4915,
4916,
4942,
4943,
4952,
4953,
4965,
4966,
4983,
4984,
5017,
5018,
5031
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5031,
"ccnet_original_nlines": 179,
"rps_doc_curly_bracket": 0.0011926100123673677,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16717635095119476,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008154939860105515,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.35372069478034973,
"rps_doc_frac_unique_words": 0.5331807732582092,
"rps_doc_mean_word_length": 8.98398208618164,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0010193700436502695,
"rps_doc_unigram_entropy": 5.124002933502197,
"rps_doc_word_count": 437,
"rps_doc_frac_chars_dupe_10grams": 0.03464085981249809,
"rps_doc_frac_chars_dupe_5grams": 0.07896076887845993,
"rps_doc_frac_chars_dupe_6grams": 0.06418746709823608,
"rps_doc_frac_chars_dupe_7grams": 0.03464085981249809,
"rps_doc_frac_chars_dupe_8grams": 0.03464085981249809,
"rps_doc_frac_chars_dupe_9grams": 0.03464085981249809,
"rps_doc_frac_chars_top_2gram": 0.01604687049984932,
"rps_doc_frac_chars_top_3gram": 0.016811000183224678,
"rps_doc_frac_chars_top_4gram": 0.029037190601229668,
"rps_doc_books_importance": -420.7763977050781,
"rps_doc_books_importance_length_correction": -420.7763977050781,
"rps_doc_openwebtext_importance": -246.97486877441406,
"rps_doc_openwebtext_importance_length_correction": -246.97486877441406,
"rps_doc_wikipedia_importance": -208.4237823486328,
"rps_doc_wikipedia_importance_length_correction": -208.4237823486328
},
"fasttext": {
"dclm": 0.07917820662260056,
"english": 0.3848021328449249,
"fineweb_edu_approx": 2.3424596786499023,
"eai_general_math": 0.23331838846206665,
"eai_open_web_math": 0.039875328540802,
"eai_web_code": 0.912608802318573
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,450,781,544,116,711,000 |
Τα καλύτερα παραδείγματα αντιδράσεων
Το React (επίσης γνωστό ως React.js) είναι μια από τις πιο δημοφιλείς βιβλιοθήκες ανάπτυξης διεπαφών JavaScript. Εδώ είναι μια συλλογή σύνταξης και χρήσης React που μπορείτε να χρησιμοποιήσετε ως εύχρηστος οδηγός ή αναφορά.
Παράδειγμα αντιδραστηρίου
Τα στοιχεία μπορούν να επαναχρησιμοποιηθούν στο React.js. Μπορείτε να εισάγετε τιμή σε στηρίγματα όπως δίνονται παρακάτω:
function Welcome(props) { return
Hello, {props.name}
; } const element = ; ReactDOM.render( element, document.getElementById('root') );
name="Faisal Arkan"θα δώσει αξία {props.name}από function Welcome(props)και επιστρέφει ένα στοιχείο που έχει δώσει τιμή από name="Faisal Arkan". Μετά από αυτό το React θα καταστήσει το στοιχείο σε html.
Άλλοι τρόποι δήλωσης στοιχείων
Υπάρχουν πολλοί τρόποι για να δηλώσετε στοιχεία κατά τη χρήση του React.js. Υπάρχουν δύο είδη συστατικών, ανιθαγενείς στοιχεία και stateful συστατικά.
Κρατική
Εξαρτήματα τύπου κλάσης
class Cat extends React.Component { constructor(props) { super(props); this.state = { humor: 'happy' } } render() { return(
{this.props.name}
{this.props.color}
); } }
Στοιχεία ανιθαγενών
Λειτουργικά συστατικά (Λειτουργία βέλους από ES6)
const Cat = props => { return (
{props.name}
{props.color}
; ); };
Σιωπηρά στοιχεία επιστροφής
const Cat = props =>
{props.name}
{props.color}
;
Παράδειγμα αντιδράσεων θραυσμάτων
Τα θραύσματα είναι τρόπος δημιουργίας πολλαπλών στοιχείων χωρίς τη χρήση στοιχείου περιτυλίγματος. Όταν προσπαθείτε να αποδώσετε στοιχεία χωρίς ετικέτα στο JSX, θα δείτε το μήνυμα σφάλματος Adjacent JSX elements must be wrapped in an enclosing tag. Αυτό συμβαίνει επειδή όταν το JSX μεταδίδει, δημιουργεί στοιχεία με τα αντίστοιχα ονόματα ετικετών τους και δεν ξέρει τι όνομα ετικέτας θα χρησιμοποιήσει εάν βρεθούν πολλά στοιχεία.
Στο παρελθόν, μια συχνή λύση σε αυτό ήταν να χρησιμοποιήσετε ένα wrapper div για να λύσετε αυτό το πρόβλημα. Ωστόσο, η έκδοση 16 του React έφερε την προσθήκη του Fragment, κάτι που το καθιστά πλέον απαραίτητο.
Fragmentενεργεί ένα περιτύλιγμα χωρίς να προσθέτει περιττά τμήματα στο DOM. Μπορείτε να το χρησιμοποιήσετε απευθείας από την εισαγωγή του React ή να το αποικοδομήσετε:
import React from 'react'; class MyComponent extends React.Component { render(){ return ( I am an element! I am another element ); } } export default MyComponent;
// Deconstructed import React, { Component, Fragment } from 'react'; class MyComponent extends Component { render(){ return ( I am an element! I am another element ); } } export default MyComponent;
Η έκδοση React 16.2 απλοποίησε αυτήν τη διαδικασία περαιτέρω, επιτρέποντας την άδεια ερμηνείας ετικετών JSX ως Fragments:
return ( I am an element! I am another element );
Παράδειγμα αντιδράσεων JSX
JSX
Το JSX είναι σύντομο για το JavaScript XML.
Το JSX είναι μια έκφραση που χρησιμοποιεί έγκυρες δηλώσεις HTML εντός JavaScript. Μπορείτε να αντιστοιχίσετε αυτήν την έκφραση σε μια μεταβλητή και να την χρησιμοποιήσετε αλλού. Μπορείτε να συνδυάσετε άλλες έγκυρες εκφράσεις JavaScript και JSX σε αυτές τις δηλώσεις HTML τοποθετώντας τις σε αγκύλες ( {}). Ο Babel μετατρέπει περαιτέρω το JSX σε ένα αντικείμενο τύπου React.createElement().
Εκφράσεις μίας γραμμής και πολλαπλών γραμμών
Η έκφραση μιας γραμμής είναι απλή στη χρήση.
const one =
Hello World!
;
Όταν πρέπει να χρησιμοποιήσετε πολλές γραμμές σε μία παράσταση JSX, γράψτε τον κώδικα σε μία παρένθεση.
const two = (
• Once
• Twice
);
Χρήση μόνο ετικετών HTML
const greet =
Hello World!
;
Συνδυασμός έκφρασης JavaScript με ετικέτες HTML
Μπορούμε να χρησιμοποιήσουμε μεταβλητές JavaScript μέσα σε αγκύλες.
const who = "Quincy Larson"; const greet =
Hello {who}!
;
Μπορούμε επίσης να καλέσουμε άλλες λειτουργίες JavaScript εντός αγκύλων
function who() { return "World"; } const greet =
Hello {who()}!
;
Επιτρέπεται μόνο μία γονική ετικέτα
A JSX expression must have only one parent tag. We can add multiple tags nested within the parent element only.
// This is valid. const tags = (
• Once
• Twice
); // This is not valid. const tags = (
Hello World!
This is my special list:
• Once
• Twice
);
React State Example
State is the place where the data comes from.
We should always try to make our state as simple as possible and minimize the number of stateful components. If we have, for example, ten components that need data from the state, we should create one container component that will keep the state for all of them.
State is basically like a global object that is available everywhere in a component.
Example of a Stateful Class Component:
import React from 'react'; class App extends React.Component { constructor(props) { super(props); // We declare the state as shown below this.state = { x: "This is x from state", y: "This is y from state" } } render() { return (
{this.state.x}
{this.state.y}
); } } export default App;
Another Example:
import React from 'react'; class App extends React.Component { constructor(props) { super(props); // We declare the state as shown below this.state = { x: "This is x from state", y: "This is y from state" } } render() { let x1 = this.state.x; let y1 = this.state.y; return (
{x1}
{y1}
); } } export default App;
Updating State
You can change the data stored in the state of your application using the setState method on your component.
this.setState({ value: 1 });
Keep in mind that setState is asynchronous so you should be careful when using the current state to set a new state. A good example of this would be if you want to increment a value in your state.
The Wrong Way
this.setState({ value: this.state.value + 1 });
This can lead to unexpected behavior in your app if the code above is called multiple times in the same update cycle. To avoid this you can pass an updater callback function to setState instead of an object.
The Right Way
this.setState(prevState => ({ value: prevState.value + 1 }));
Updating State
You can change the data stored in the state of your application using the setState method on your component.
this.setState({value: 1});
Keep in mind that setState may be asynchronous so you should be careful when using the current state to set a new state. A good example of this would be if you want to increment a value in your state.
The Wrong Way
this.setState({value: this.state.value + 1});
This can lead to unexpected behavior in your app if the code above is called multiple times in the same update cycle. To avoid this you can pass an updater callback function to setState instead of an object.
The Right Way
this.setState(prevState => ({value: prevState.value + 1}));
The Cleaner Way
this.setState(({ value }) => ({ value: value + 1 }));
When only a limited number of fields in the state object is required, object destructing can be used for cleaner code.
React State VS Props Example
When we start working with React components, we frequently hear two terms. They are state and props. So, in this article we will explore what are those and how they differ.
State:
• State is something that a component owns. It belongs to that particular component where it is defined. For example, a person’s age is a state of that person.
• State is mutable. But it can be changed only by that component that owns it. As I only can change my age, not anyone else.
• You can change a state by using this.setState()
See the below example to get an idea of state:
Person.js
import React from 'react'; class Person extends React.Component{ constructor(props) { super(props); this.state = { age:0 this.incrementAge = this.incrementAge.bind(this) } incrementAge(){ this.setState({ age:this.state.age + 1; }); } render(){ return( My age is: {this.state.age} Grow me older !! ); } } export default Person;
In the above example, age is the state of Person component.
Props:
• Props are similar to method arguments. They are passed to a component where that component is used.
• Props is immutable. They are read-only.
See the below example to get an idea of Props:
Person.js
import React from 'react'; class Person extends React.Component{ render(){ return( I am a {this.props.character} person. ); } } export default Person; const person =
In the above example, const person = we are passing character = "good" prop to Person component.
It gives output as “I am a good person”, in fact I am.
There is lot more to learn on State and Props. Many things can be learnt by actually diving into coding. So get your hands dirty by coding.
React Higher-Order Component Example
In React, a Higher-Order Component (HOC) is a function that takes a component and returns a new component. Programmers use HOCs to achieve component logic reuse.
If you’ve used Redux’s connect, you’ve already worked with Higher-Order Components.
The core idea is:
const EnhancedComponent = enhance(WrappedComponent);
Οπου:
• enhance είναι το στοιχείο υψηλότερης τάξης ·
• WrappedComponentείναι το στοιχείο που θέλετε να βελτιώσετε? και
• EnhancedComponent είναι το νέο συστατικό που δημιουργήθηκε.
Αυτό θα μπορούσε να είναι το σώμα του enhanceHOC:
function enhance(WrappedComponent) { return class extends React.Component { render() { const extraProp = 'This is an injected prop!'; return ( ); } } }
Σε αυτήν την περίπτωση, enhanceεπιστρέφει μια ανώνυμη κλάση που επεκτείνεται React.Component. Αυτό το νέο συστατικό κάνει τρία απλά πράγματα:
• Απόδοση WrappedComponentενός divστοιχείου.
• Περνώντας τα δικά του στηρίγματα WrappedComponent; και
• Ένεση ενός επιπλέον στηρίγματος στο WrappedComponent.
Τα HOC είναι απλώς ένα μοτίβο που χρησιμοποιεί τη δύναμη της συνθετικής φύσης του React. Προσθέτουν χαρακτηριστικά σε ένα στοιχείο . Υπάρχουν πολλά περισσότερα πράγματα που μπορείτε να κάνετε μαζί τους!
|
{
"url": "https://el.awaudrey.com/471-the-best-react-examples",
"source_domain": "el.awaudrey.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "43499",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FWEK6O3AGQAZ2SFLBQS4QUPQENSRDID6",
"WARC-Concurrent-To": "<urn:uuid:ea85d442-7667-4bfa-bd17-8e883ca4660e>",
"WARC-Date": "2022-07-02T14:49:45Z",
"WARC-IP-Address": "172.67.141.164",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HINII4EG7GZCPQICLMBYV2B36SGPVLUW",
"WARC-Record-ID": "<urn:uuid:d0c85de0-e3d3-42fd-a300-672630735409>",
"WARC-Target-URI": "https://el.awaudrey.com/471-the-best-react-examples",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8e01e232-3532-4235-aa1c-ca3aec0a91a8>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-223\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,
37,
38,
262,
263,
289,
290,
412,
413,
447,
448,
468,
469,
552,
553,
756,
757,
788,
789,
940,
941,
949,
950,
974,
975,
1100,
1101,
1119,
1120,
1139,
1140,
1147,
1148,
1168,
1169,
1219,
1220,
1253,
1254,
1267,
1268,
1282,
1283,
1291,
1292,
1320,
1321,
1342,
1343,
1356,
1357,
1371,
1372,
1374,
1375,
1409,
1410,
1841,
1842,
2052,
2053,
2221,
2222,
2386,
2586,
2587,
2709,
2710,
2761,
2762,
2789,
2790,
2794,
2795,
2839,
2840,
3230,
3231,
3276,
3277,
3322,
3323,
3336,
3337,
3350,
3351,
3353,
3354,
3458,
3459,
3474,
3479,
3488,
3498,
3501,
3502,
3527,
3528,
3543,
3544,
3557,
3558,
3560,
3561,
3609,
3610,
3678,
3679,
3723,
3724,
3737,
3738,
3740,
3741,
3813,
3814,
3864,
3865,
3880,
3881,
3883,
3884,
3920,
3921,
4033,
4034,
4068,
4073,
4082,
4092,
4132,
4133,
4146,
4147,
4172,
4173,
4182,
4192,
4195,
4196,
4216,
4217,
4263,
4264,
4527,
4528,
4613,
4614,
4653,
4654,
4884,
4885,
4900,
4901,
4916,
4917,
4944,
4945,
4962,
4963,
5239,
5240,
5245,
5246,
5251,
5252,
5279,
5280,
5295,
5296,
5405,
5406,
5435,
5436,
5633,
5634,
5648,
5649,
5697,
5698,
5906,
5907,
5921,
5922,
5984,
5985,
6000,
6001,
6110,
6111,
6138,
6139,
6340,
6341,
6355,
6401,
6402,
6610,
6611,
6625,
6685,
6701,
6755,
6756,
6875,
6876,
6905,
6906,
7079,
7080,
7087,
7088,
7250,
7377,
7429,
7430,
7477,
7478,
7488,
7489,
7817,
7818,
7878,
7879,
7886,
7887,
7991,
8035,
8036,
8083,
8084,
8094,
8095,
8263,
8264,
8361,
8362,
8417,
8418,
8558,
8559,
8596,
8597,
8759,
8760,
8844,
8845,
8863,
8864,
8917,
8918,
8924,
8925,
8974,
9042,
9106,
9107,
9157,
9158,
9311,
9312,
9454,
9455,
9502,
9561,
9619,
9620
],
"line_end_idx": [
37,
38,
262,
263,
289,
290,
412,
413,
447,
448,
468,
469,
552,
553,
756,
757,
788,
789,
940,
941,
949,
950,
974,
975,
1100,
1101,
1119,
1120,
1139,
1140,
1147,
1148,
1168,
1169,
1219,
1220,
1253,
1254,
1267,
1268,
1282,
1283,
1291,
1292,
1320,
1321,
1342,
1343,
1356,
1357,
1371,
1372,
1374,
1375,
1409,
1410,
1841,
1842,
2052,
2053,
2221,
2222,
2386,
2586,
2587,
2709,
2710,
2761,
2762,
2789,
2790,
2794,
2795,
2839,
2840,
3230,
3231,
3276,
3277,
3322,
3323,
3336,
3337,
3350,
3351,
3353,
3354,
3458,
3459,
3474,
3479,
3488,
3498,
3501,
3502,
3527,
3528,
3543,
3544,
3557,
3558,
3560,
3561,
3609,
3610,
3678,
3679,
3723,
3724,
3737,
3738,
3740,
3741,
3813,
3814,
3864,
3865,
3880,
3881,
3883,
3884,
3920,
3921,
4033,
4034,
4068,
4073,
4082,
4092,
4132,
4133,
4146,
4147,
4172,
4173,
4182,
4192,
4195,
4196,
4216,
4217,
4263,
4264,
4527,
4528,
4613,
4614,
4653,
4654,
4884,
4885,
4900,
4901,
4916,
4917,
4944,
4945,
4962,
4963,
5239,
5240,
5245,
5246,
5251,
5252,
5279,
5280,
5295,
5296,
5405,
5406,
5435,
5436,
5633,
5634,
5648,
5649,
5697,
5698,
5906,
5907,
5921,
5922,
5984,
5985,
6000,
6001,
6110,
6111,
6138,
6139,
6340,
6341,
6355,
6401,
6402,
6610,
6611,
6625,
6685,
6701,
6755,
6756,
6875,
6876,
6905,
6906,
7079,
7080,
7087,
7088,
7250,
7377,
7429,
7430,
7477,
7478,
7488,
7489,
7817,
7818,
7878,
7879,
7886,
7887,
7991,
8035,
8036,
8083,
8084,
8094,
8095,
8263,
8264,
8361,
8362,
8417,
8418,
8558,
8559,
8596,
8597,
8759,
8760,
8844,
8845,
8863,
8864,
8917,
8918,
8924,
8925,
8974,
9042,
9106,
9107,
9157,
9158,
9311,
9312,
9454,
9455,
9502,
9561,
9619,
9620,
9822
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9822,
"ccnet_original_nlines": 266,
"rps_doc_curly_bracket": 0.011301159858703613,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21010100841522217,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0191919207572937,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4676767587661743,
"rps_doc_frac_unique_words": 0.3690560758113861,
"rps_doc_mean_word_length": 5.547906398773193,
"rps_doc_num_sentences": 144,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.7059526443481445,
"rps_doc_word_count": 1409,
"rps_doc_frac_chars_dupe_10grams": 0.17858512699604034,
"rps_doc_frac_chars_dupe_5grams": 0.24305999279022217,
"rps_doc_frac_chars_dupe_6grams": 0.21683509647846222,
"rps_doc_frac_chars_dupe_7grams": 0.20634515583515167,
"rps_doc_frac_chars_dupe_8grams": 0.20634515583515167,
"rps_doc_frac_chars_dupe_9grams": 0.20634515583515167,
"rps_doc_frac_chars_top_2gram": 0.003070229897275567,
"rps_doc_frac_chars_top_3gram": 0.010745810344815254,
"rps_doc_frac_chars_top_4gram": 0.01279263012111187,
"rps_doc_books_importance": -820.850341796875,
"rps_doc_books_importance_length_correction": -820.850341796875,
"rps_doc_openwebtext_importance": -467.338134765625,
"rps_doc_openwebtext_importance_length_correction": -467.338134765625,
"rps_doc_wikipedia_importance": -331.9730529785156,
"rps_doc_wikipedia_importance_length_correction": -331.9730529785156
},
"fasttext": {
"dclm": 0.6703780293464661,
"english": 0.0980469286441803,
"fineweb_edu_approx": 2.9057374000549316,
"eai_general_math": 0.2558319568634033,
"eai_open_web_math": 0.21162158250808716,
"eai_web_code": 0.8862493634223938
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,918,821,754,314,262,500 |
slick-codegenの利用例と中身の説明
2017-12-16
Scala Advent Calendar 2017の17日目の記事です。
https://qiita.com/advent-calendar/2017/scala
前日は@yoshiyoshifujiiさんによる「インフラストラクチャ層からのエラーについて考える」でした。
https://qiita.com/yoshiyoshifujii/items/d63b0ca71c994f8c4ce1
背景
slick-codegenは、DBのスキーマから対応するコードを自動生成するプログラムです。 同じようなコードをひたすら書く作業を無くしてくれる、頼れるやつです。 Slickを使っている人であれば、一度は使ったことがあるかと思います。
そんな便利なslick-codegenは公式のドキュメントでも紹介されています（Schema Code Generation） が、あまり説明が無いため、実際どのようなカスタマイズができるのかが分かりにくかったりします。 また、サンプルのリポジトリが紹介されていますが、ここに無い使用方法も多く存在します。 APIドキュメントを読み解けば良いですが、もっと雑に何が出来るか知りたいところ。
ということで、いくつか使えそうなサンプルを掲載して、その中でカスタマイズ方法を説明しようと思います。 なお、本記事の末尾に全てのサンプルを組み合わせたコードを貼り付けますので、実際に使ってみたい方はそちらをご利用ください。
slick-codegeのコード
とは言え、結局コードを読んだ方がよく理解できることがしばしば。 slick-codegenは5つのScalaコードからなる小さなプログラムですので、分かりにくいところは直に読むと早いです。
https://github.com/slick/slick/tree/v3.2.1/slick-codegen/src/main/scala/slick/codegen
全体像
イメージを湧きやすくするため、少しだけ全体像の説明を。
自分で作るカスタムジェネレーターは、 SourceCodeGenerator を継承して作ります。
class CustomGenerator(model: m.Model) extends SourceCodeGenerator(model) {
...
}
SourceCodeGenerator は、 AbstractSourceCodeGeneratorOutputHelpers を実装しています。
https://github.com/slick/slick/blob/v3.2.1/slick-codegen/src/main/scala/slick/codegen/SourceCodeGenerator.scala
class SourceCodeGenerator(model: m.Model) extends AbstractSourceCodeGenerator(model) with OutputHelpers{
...
}
さらに、 AbstractSourceCodeGeneratorAbstractGenerator を使っています。 StringGeneratorHelpers は同じファイルで定義されており、本筋とは外れるので無視します。
https://github.com/slick/slick/blob/v3.2.1/slick-codegen/src/main/scala/slick/codegen/AbstractSourceCodeGenerator.scala
abstract class AbstractSourceCodeGenerator(model: m.Model) extends AbstractGenerator[String,String,String](model) with StringGeneratorHelpers{
...
}
AbstractGenerator はというと、 GeneratorHelpers というヘルパーを使っているだけです。
https://github.com/slick/slick/blob/v3.2.1/slick-codegen/src/main/scala/slick/codegen/AbstractGenerator.scala
abstract class AbstractGenerator[Code,TermName,TypeName](model: m.Model) extends GeneratorHelpers[Code,TermName,TypeName]{ codegen =>
...
}
ということで、 自分のクラス ← SourceCodeGeneratorAbstractSourceCodeGeneratorAbstractGenerator という関係になっています。 このそれぞれのクラスは同名の各ファイルで定義されていますので、順番に各コードを追ってゆくと分かりやすいかと思います。
下記サンプルでも、対応するコードを示しながら説明してゆきます。
サンプル集
サンプルとして使うスキーマですが、適当に以下のようなSQLを用意してMySQLに流しました。
create table user(
id INT NOT NULL AUTO_INCREMENT,
name VARCHAR(255) NOT NULL,
created_at datetime NOT NULL DEFAULT CURRENT_TIMESTAMP,
PRIMARY KEY ( id )
);
create table item(
id INT NOT NULL AUTO_INCREMENT,
name VARCHAR(255) NOT NULL,
user_id INT,
FOREIGN KEY (user_id) REFERENCES user(id) ON DELETE CASCADE,
PRIMARY KEY ( id )
);
java.sql.timeをorg.joda.time.DateTimeに変換する
いきなり自前のコードではなく恐縮ですが、最初のサンプルは参考文献から。
https://qiita.com/uedashuhei/items/25d5a6e786075729d3b3
こちらの例では、以下の処理が行われています。
• importを追加する (code)
• Auto Incrementの値をOption型にする （Table.autoIncLastAsOption。なお、後述のサンプルコードでは Table.autoIncLastColumn.asOption を使用。こちらの記事でdeprecatedなことを知りました
• カラムの型を変換する （Column.rawType）
• 特定のカラムを名前で判別し除外する （modelに対する処理）
java.sql.Timestamporg.joda.time.DateTime にしています。便利ですね。
デフォルト値を付ける
createdAtupdatedAt を作成時にいちいち入れるのはなかなか手間です。 先の例のようにまるまる消してしまう方法もありますが、それらの値を取得したい時に困ってしまいます。 そこで、下記のようなデフォルト値を付けることで便利に扱えるようにします。
case class UserRow(id: Int, name: String, createdAt: org.joda.time.DateTime = DateTime.now)
これにより、必要なパラメーターだけを指定して作成ができます。
UserRow(1, "name")
slick-codegenでは、 AbstractGenerator.ColumnDef.default をオーバーライドすることで実現できます。 デフォルト値がない場合はNone、ある場合はSomeで返します。
override def default = rawName match {
case "createdAt" | "updatedAt" => Some("DateTime.now")
case _ => super.default
}
JSONへの変換を自動で行う
テスト時や単純なAPIでは、下記のようにxxxRowをそのままJSONに変換して返したい時があります。
def someAction = Action { ...
// DBからユーザーを取り出し
val user: UserRow = ...
Ok(Json.toJson(user)) // これ
}
これには、UserRowのコンパニオンオブジェクトで下記のimplicitな変換を定義する必要があります。
object UserRow {
implicit val jsonWrites = Json.writes[Entity]
}
一つずつ作るのは大変なので、これも自動生成させます。 注意点として、Rowのコンパニオンオブジェクトを作ると UserRow.tupled がコンパイルエラーになり、 (UserRow.apply _).tupled にしないと動かなくなるので、その対策も必要です。
xxxRowはどうやって作られているのか
さて、slick-codegenでxxzRowの下に同名のコンパニオンオブジェクトを作るにはどうしたらよいでしょうか。 そのためにも、xxxRowが何かを知る必要があります。
まず、1つのテーブルに対応するコードは TableDef 型で表されます。 TableDef.code を見ると、完成したコードが入っているわけですね。
xxxRowはEntityと呼ばれ、 EntityTypeDef 型の情報により生成されます。 この EntityTypeDefTableDef.definitions で並べられ、 TableDef.code で実際にコードになります。
def definitions = Seq[Def]( EntityType, PlainSqlMapper, TableClass, TableValue )
def code: Seq[Code] = definitions.flatMap(_.getEnabled).map(_.docWithCode)
ちなみに、 EntityTypeEntityType 型のインスタンスを返す関数です。
Defを作る
上記から、 Def 型で作ってdefinitionsに並べてあげれば、コンパニオンオブジェクトを追記することができそうです。 クラス名はEntityと同じなので、 EntityTypeDef を流用してしまいましょう。 今回は中身が決まりきっているため、 code だけoverrideすれば目的を達成できます。
class EntityCompanionDef extends EntityTypeDef {
override def doc = ""
override def code =
s"""object ${rawName} {
| import play.api.libs.json._
| import play.api.libs.json.JodaWrites
| import play.api.libs.json.JodaReads
|
| val dateFormat = "yyyy-MM-dd'T'HH:mm:ss.SSSZ"
|
| implicit val dateTimeWriter = JodaWrites.jodaDateWrites(dateFormat)
| implicit val dateTimeJsReader = JodaReads.jodaDateReads(dateFormat)
| implicit val jsonWrites = Json.writes[${rawName}]
| implicit val jsonReads = Json.reads[${rawName}]
|}
""".stripMargin
}
override def definitions = {
val companion = new EntityCompanionDef
Seq[Def](EntityType, companion, PlainSqlMapper, TableClass, TableValue)
}
ついでにJodatimeの文字列変換も入れています。 なお、docは不要なので空文字にしています。
これを実行すると、コンパニオンオブジェクトが追記された定義が出力されます。
ただし、前述したとおり、このままではコンパイルが通らないので、 TableDef.code に置換処理を追記します。
override def code = {
super.code.toList.map(_.replaceAll(s"${EntityType.name}.tupled", s"(${EntityType.name}.apply _).tupled"))
}
独自のID型を利用する
さらに発展系として、各リソースのID型を区別し、取り違えないようにしたいと思います。 Entityはidの型が Option[Int] から Option[UserId] となります。
case class UserRow(name: String, createdAt: DateTime = DateTime.now, id: Option[UserId] = None)
こちらの記事で述べられている、各IDの型とPathBindableを自動生成してみます。
https://qiita.com/srd7/items/ee2098d7cebc50ae0e01
まずはID型の生成から始めます。
ID型のGenerator
わかりやすさのため、ID型はテーブル定義とは別ファイルにします。 クラス定義から始めたいので、自動で生成されているこれらが邪魔になります。
// AUTO-GENERATED Slick data model
/** Stand-alone Slick data model for immediate use */
object IDs extends {
val profile = slick.driver.MySQLDriver
} with IDs
/** Slick data model trait for extension, choice of backend or usage in the cake pattern. (Make sure to initialize this late.) */
trait IDs {
val profile: slick.jdbc.JdbcProfile
import profile.api._
import slick.model.ForeignKeyAction
// NOTE: GetResult mappers for plain SQL are only generated for tables where Slick knows how to map the types of all columns.
import slick.jdbc.{GetResult => GR}
/** DDL for all tables. Call .create to execute. */
lazy val schema: profile.SchemaDescription = Item.schema ++ User.schema
@deprecated("Use .schema instead of .ddl", "3.0")
def ddl = schema
...
}
まずはこれを消す所から。 コードを漁ると、 trait IDs の定型文は AbstractSourceCodeGenerator.code で処理されていることが分かります。
def code = {
"import slick.model.ForeignKeyAction\n" +
...
} else "") +
tables.map(_.code.mkString("\n")).mkString("\n\n")
}
さらに外側、 // AUTO-GENERATED Slick data model などは OutputHelper.packageCode で作られています。 これをオーバーライドし、テーブル定義だけを吐き出すようにすれば良いですね。
override def code = tables.map(_.code.mkString("\n")).mkString("\n\n")
override def packageCode(profile: String, pkg: String, container: String, parentType: Option[String]) : String =
s"""package models
|
|${code}
""".stripMargin
これで下記のような出力を得ることができます。
package models
class ItemId private (private[models] val value: Int) extends AnyVal {
override def toString = value.toString
}
object ItemId {
...
}
class UserId private (private[models] val value: Int) extends AnyVal {
override def toString = value.toString
}
object UserId {
...
}
TableのIDカラムを書き換える
（ここからはスキーマに大きく依存するので、実際に利用される際は調整をしてください。今回は、主キーのカラム名は id 、テーブルは単数形、外部キーのカラム名は (table)Id という名前になっているとします）
各テーブルの id カラム型を書き換えるのは簡単ですが、外部キー用のIDは少々厄介です。
override def Column = new Column(_) {
override def rawType = model.tpe match {
case _ if model.name == "id" => s"""${TableValue.name}Id""" // かんたん
case _ => super.rawType
}
}
今回は存在するテーブル名を列挙して、”(テーブル名)_id”に一致したら型を変更する、というゴリ押しで実装します。 まず、テーブル名と型名のマップを作ります。各種Generatorを呼び出す前に、DB情報から抜き出します。
val idColumnNameSet = (for {
t <- model.tables
} yield s"${t.name.table}_id").toSet
これで、以下のようなセットが得られます。
Set(item_id, user_id)
これをGeneratorに渡し
class CustomTableGenerator(model: m.Model, idColumnNameSet: Set[String]) extends SourceCodeGenerator(model) {
このように判定をすれば、 user_idUserId 型へ、 item_idItemId 型へと書き変わります。
override def rawType = model.tpe match {
case _ if idColumnNameSet.contains(model.name) => model.name.toCamelCase
case _ if model.name == "id" => s"""${TableValue.name}Id"""
case _ => super.rawType
}
ID用Mapperの追加
Slickが自動でIntやLongをID型にマッピング出来るよう、以下のようなimplicitを配置する必要があります。
implicit val userIdMapper = MappedColumnType.base[UserId, Long](_.value, UserId.apply)
https://qiita.com/srd7/items/ee2098d7cebc50ae0e01#slick-%E3%81%BE%E3%82%8F%E3%82%8A
これは、先程のSetを使うと簡単に実現できます。
def implicitIdMapper(name: String): String = {
val idName = s"${name.toCamelCase}"
val uncapitalizedIdName = idName.head.toLower + idName.tail
s"implicit val ${uncapitalizedIdName}Mapper = MappedColumnType.base[${idName}, Int](_.value, ${idName}.apply)"
}
このような関数を用意し、 SourceCodeGenerator.code の中で呼び出すことで、全ID型に対するimplicitな変換クラスの先頭に記述できます。
PathBindableのGenerator
最後に、 conf/routes で各ID型を使えるよう、PathBindableも定義します。 これはまた独立したファイルに書くこととします。
ID型の生成とほぼ同じなので、末尾のまとめコードを参照ください。
まとめ
slick-codegenのサンプルを通して、コードの中身と少し入り込んだカスタマイズ方法を記載してゆきました。
出力を簡単にカスタマイズできるので、Slick以外でも使えそうですね。 slick-codegenを活用し、面倒な記述はなるべく自動生成に任せてゆきましょう。
明日のScala Advent Calendar 2017は、@[email protected]さんによるsangriaの紹介です。 私はGraphQLに手を出そうとしつつ、未だできていません。記事が楽しみです！
今回作ったコード
最後に、今回説明に使ったサンプルを盛り込んだコードを掲載します。 自作ジェネレーターのテンプレートにご利用ください。
package main
import slick.driver.JdbcProfile
import scala.concurrent.ExecutionContext.Implicits.global
import slick.driver.MySQLDriver.api._
import slick.driver.MySQLDriver
import scala.collection.mutable
import slick.{model => m}
import slick.codegen.SourceCodeGenerator
import slick.model.Model
import scala.concurrent.duration.Duration
import scala.concurrent.{Await, ExecutionContext}
class CustomTableGenerator(model: m.Model, idColumnNameSet: Set[String]) extends SourceCodeGenerator(model) {
def implicitIdMapper(name: String): String = {
val idName = s"${name.toCamelCase}"
val uncapitalizedIdName = idName.head.toLower + idName.tail
s"implicit val ${uncapitalizedIdName}Mapper = MappedColumnType.base[${idName}, Int](_.value, ${idName}.apply)"
}
// add some custom imports
override def code =
s"""|import com.github.tototoshi.slick.MySQLJodaSupport._
|
|${(idColumnNameSet.map(implicitIdMapper)).mkString("\n")}
|
|""".stripMargin +
super.code
override def Table = new Table(_) {
override def autoIncLast = true
override def Column = new Column(_) {
override def asOption = autoInc
override def rawType = model.tpe match {
case "java.sql.Timestamp" => "DateTime"
case "java.sql.Date" => "DateTime"
case _ if idColumnNameSet.contains(model.name) => model.name.toCamelCase
case _ if model.name == "id" => s"""${TableValue.name}Id"""
case _ => super.rawType
}
override def default = rawName match {
case "createdAt" | "updatedAt" => Some("DateTime.now")
case _ => super.default
}
}
class EntityCompanionDef extends EntityTypeDef {
override def doc = ""
override def code =
s"""object ${rawName} {
| import play.api.libs.json._
| import play.api.libs.json.JodaWrites
| import play.api.libs.json.JodaReads
|
| val dateFormat = "yyyy-MM-dd'T'HH:mm:ss.SSSZ"
|
| implicit val dateTimeWriter = JodaWrites.jodaDateWrites(dateFormat)
| implicit val dateTimeJsReader = JodaReads.jodaDateReads(dateFormat)
| implicit val jsonWrites = Json.writes[${rawName}]
| implicit val jsonReads = Json.reads[${rawName}]
|}
|""".stripMargin
}
override def definitions = {
val companion = new EntityCompanionDef
Seq[Def](EntityType, companion, PlainSqlMapper, TableClass, TableValue)
}
override def code = {
super.code.toList.map(_.replaceAll(s"${EntityType.name}.tupled", s"(${EntityType.name}.apply _).tupled"))
}
}
}
class CustomIDGenerator(model: m.Model) extends SourceCodeGenerator(model) {
override def code = tables.map(_.code.mkString("\n")).mkString("\n\n")
override def packageCode(profile: String, pkg: String, container: String, parentType: Option[String]): String =
s"""package models
|
|import play.api.libs.json._
|
|${code}
|""".stripMargin
override def Table = new Table(_) {
class IDDef extends EntityTypeDef {
override def doc = ""
override def code = {
val name = TableValue.name
val idName = s"""${name}Id"""
val packageName = "models"
val idType = "Int"
s"""class ${idName} private (private[${packageName}] val value: ${idType}) extends AnyVal {
| override def toString = value.toString
|}
|object ${idName} {
| private[models] def apply(value: ${idType}) = new ${idName}(value)
| private[models] def unapply(id: ${idName}) = Some(id.value)
| implicit val jsonWrites = Json.writes[${idName}]
| implicit val jsonReads = Json.reads[${idName}]
| def fromString(str: String): Either[Throwable, ${idName}] = {
| try {
| Right(${idName}(str.to${idType}))
| } catch {
| case e: Throwable => Left(e)
| }
| }
|}
|""".stripMargin
}
}
override def definitions = {
Seq[Def](new IDDef)
}
}
}
class PathBindableGenerator(model: m.Model) extends SourceCodeGenerator(model) {
override def code = tables.map(_.code.mkString("\n")).mkString("\n\n")
override def packageCode(profile: String, pkg: String, container: String, parentType: Option[String]): String =
s"""package models
|
|import play.api.mvc.PathBindable
|
|object PathBindableImplicits {
| ${indent(code)}
|}
|""".stripMargin
override def Table = new Table(_) {
class PathBindamleDef extends EntityTypeDef {
override def doc = ""
override def code = {
val name = TableValue.name
val idName = s"""${name}Id"""
val uncapitalizedIdName = idName.head.toLower + idName.tail
val implicitName = s"""${uncapitalizedIdName}PathBindable"""
val packageName = "models"
s"""implicit def ${implicitName} = new PathBindable[${idName}] {
| override def bind(key: String, value: String): Either[String, ${idName}] = {
| ${idName}.fromString(value).left.map(_.getMessage)
| }
| override def unbind(key: String, ${uncapitalizedIdName}: ${idName}): String = {
| ${uncapitalizedIdName}.toString
| }
|}
|""".stripMargin
}
}
override def definitions = {
Seq[Def](new PathBindamleDef)
}
}
}
object SlickCodegen extends App {
val dbs = Setting.dev
val slickDriver = dbs.slickDriver
val profile = dbs.profile
val jdbcDriver = dbs.jdbcDriver
val url = dbs.url
val outputFolder = dbs.outputFolder
val schemas = dbs.schemas
val pkg = dbs.pkg
val user = dbs.user
val password = dbs.password
val driver: slick.jdbc.JdbcProfile = dbs.profile
val db = {
Database.forURL(url, driver = jdbcDriver, user = user, password = password)
}
import scala.concurrent.ExecutionContext.Implicits.global
val modelFuture = db.run(driver.createModel(None, false))
val f = modelFuture.map(model => {
val idColumnNameSet = (for {
t <- model.tables
} yield s"${t.name.table}_id").toSet
new CustomTableGenerator(model, idColumnNameSet).writeToFile(slickDriver, outputFolder, pkg, "Tables", "Tables.scala")
new CustomIDGenerator(model).writeToFile(slickDriver, outputFolder, pkg, "IDs", "IDs.scala")
new PathBindableGenerator(model).writeToFile(slickDriver, outputFolder, pkg, "PathBindableImplicits", "PathBindableImplicits.scala")
})
Await.result(f, Duration.Inf)
}
development
Getting Over It 攻略? vol.3
Getting Over It 攻略? vol.2
comments powered by Disqus
|
{
"url": "https://blog.esplo.net/entry/2017/12/slick-codegen/",
"source_domain": "blog.esplo.net",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "79603",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YFY2OOGDISSDYI526VU2QYXLKDHXCPQJ",
"WARC-Concurrent-To": "<urn:uuid:a5a13b95-5c49-423f-bca9-8e785bdffff0>",
"WARC-Date": "2021-01-25T23:28:00Z",
"WARC-IP-Address": "172.67.157.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3RMHW5GDPBNUPMXLRC76GGLH5YA4HUSA",
"WARC-Record-ID": "<urn:uuid:cbb6c368-ac16-452e-88ad-bc2d5b6397a1>",
"WARC-Target-URI": "https://blog.esplo.net/entry/2017/12/slick-codegen/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3ac6d3de-7767-4c6c-bd22-87ad72074632>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.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,
24,
25,
36,
37,
75,
76,
121,
122,
177,
178,
239,
240,
243,
244,
362,
363,
558,
559,
671,
672,
689,
690,
785,
786,
872,
873,
877,
878,
906,
907,
957,
958,
1033,
1039,
1041,
1042,
1116,
1117,
1229,
1230,
1335,
1341,
1343,
1344,
1458,
1459,
1579,
1580,
1723,
1729,
1731,
1732,
1793,
1794,
1904,
1905,
2039,
2045,
2047,
2048,
2202,
2203,
2235,
2236,
2242,
2243,
2290,
2291,
2310,
2345,
2376,
2435,
2457,
2460,
2461,
2480,
2515,
2546,
2562,
2626,
2648,
2651,
2652,
2694,
2695,
2731,
2732,
2788,
2789,
2812,
2813,
2836,
2975,
3007,
3043,
3044,
3099,
3100,
3111,
3112,
3241,
3242,
3334,
3335,
3366,
3367,
3386,
3387,
3494,
3495,
3534,
3591,
3617,
3619,
3620,
3635,
3636,
3688,
3689,
3719,
3739,
3766,
3797,
3799,
3800,
3854,
3855,
3872,
3920,
3922,
3923,
4057,
4058,
4079,
4080,
4168,
4169,
4246,
4247,
4367,
4368,
4449,
4524,
4525,
4569,
4570,
4577,
4578,
4735,
4736,
4785,
4809,
4831,
4859,
4897,
4944,
4990,
4999,
5055,
5064,
5142,
5220,
5280,
5338,
5348,
5369,
5371,
5372,
5401,
5442,
5516,
5518,
5519,
5569,
5570,
5608,
5609,
5668,
5669,
5691,
5799,
5801,
5802,
5814,
5815,
5908,
5909,
6005,
6006,
6051,
6052,
6102,
6103,
6120,
6121,
6135,
6136,
6206,
6207,
6242,
6296,
6317,
6358,
6369,
6370,
6500,
6512,
6550,
6573,
6611,
6739,
6777,
6778,
6832,
6906,
6958,
6977,
6978,
6984,
6986,
6987,
7076,
7077,
7090,
7134,
7140,
7155,
7208,
7210,
7211,
7330,
7331,
7402,
7515,
7536,
7543,
7557,
7576,
7577,
7600,
7601,
7616,
7617,
7688,
7729,
7731,
7747,
7753,
7755,
7756,
7757,
7828,
7869,
7871,
7887,
7893,
7895,
7896,
7914,
7915,
8021,
8022,
8067,
8068,
8106,
8149,
8221,
8249,
8253,
8255,
8256,
8368,
8369,
8398,
8418,
8455,
8456,
8477,
8478,
8500,
8501,
8517,
8518,
8628,
8629,
8686,
8687,
8728,
8803,
8865,
8891,
8893,
8894,
8907,
8908,
8969,
8970,
9057,
9058,
9142,
9143,
9168,
9169,
9216,
9254,
9316,
9429,
9431,
9432,
9515,
9516,
9539,
9540,
9613,
9614,
9647,
9648,
9652,
9653,
9710,
9711,
9791,
9792,
9900,
9901,
9910,
9911,
9970,
9971,
9984,
9985,
10017,
10018,
10076,
10114,
10146,
10147,
10179,
10205,
10246,
10271,
10313,
10363,
10364,
10474,
10475,
10524,
10564,
10628,
10743,
10747,
10748,
10777,
10799,
10861,
10870,
10936,
10945,
10971,
10988,
10989,
11027,
11063,
11064,
11106,
11144,
11191,
11239,
11282,
11363,
11431,
11463,
11471,
11472,
11517,
11580,
11612,
11620,
11626,
11627,
11680,
11708,
11709,
11735,
11767,
11809,
11860,
11910,
11923,
11983,
11996,
12078,
12160,
12224,
12286,
12300,
12328,
12334,
12335,
12368,
12413,
12491,
12497,
12498,
12524,
12636,
12642,
12646,
12648,
12649,
12650,
12727,
12728,
12801,
12802,
12916,
12939,
12948,
12984,
12993,
13009,
13033,
13034,
13072,
13073,
13113,
13141,
13142,
13170,
13205,
13243,
13278,
13305,
13306,
13406,
13459,
13473,
13504,
13585,
13659,
13722,
13783,
13859,
13881,
13933,
13959,
14006,
14024,
14040,
14054,
14082,
14090,
14096,
14097,
14130,
14156,
14162,
14166,
14168,
14169,
14250,
14251,
14324,
14325,
14439,
14462,
14471,
14512,
14521,
14560,
14586,
14596,
14620,
14621,
14659,
14660,
14710,
14738,
14739,
14767,
14802,
14840,
14908,
14977,
14978,
15013,
15014,
15087,
15178,
15245,
15261,
15355,
15403,
15419,
15433,
15461,
15469,
15475,
15476,
15509,
15545,
15551,
15555,
15557,
15558,
15592,
15616,
15617,
15653,
15681,
15715,
15735,
15773,
15801,
15821,
15843,
15873,
15924,
15937,
16017,
16021,
16022,
16082,
16083,
16143,
16180,
16213,
16237,
16278,
16279,
16402,
16499,
16636,
16641,
16642,
16674,
16676,
16677,
16689,
16690,
16716,
16717,
16743,
16744
],
"line_end_idx": [
24,
25,
36,
37,
75,
76,
121,
122,
177,
178,
239,
240,
243,
244,
362,
363,
558,
559,
671,
672,
689,
690,
785,
786,
872,
873,
877,
878,
906,
907,
957,
958,
1033,
1039,
1041,
1042,
1116,
1117,
1229,
1230,
1335,
1341,
1343,
1344,
1458,
1459,
1579,
1580,
1723,
1729,
1731,
1732,
1793,
1794,
1904,
1905,
2039,
2045,
2047,
2048,
2202,
2203,
2235,
2236,
2242,
2243,
2290,
2291,
2310,
2345,
2376,
2435,
2457,
2460,
2461,
2480,
2515,
2546,
2562,
2626,
2648,
2651,
2652,
2694,
2695,
2731,
2732,
2788,
2789,
2812,
2813,
2836,
2975,
3007,
3043,
3044,
3099,
3100,
3111,
3112,
3241,
3242,
3334,
3335,
3366,
3367,
3386,
3387,
3494,
3495,
3534,
3591,
3617,
3619,
3620,
3635,
3636,
3688,
3689,
3719,
3739,
3766,
3797,
3799,
3800,
3854,
3855,
3872,
3920,
3922,
3923,
4057,
4058,
4079,
4080,
4168,
4169,
4246,
4247,
4367,
4368,
4449,
4524,
4525,
4569,
4570,
4577,
4578,
4735,
4736,
4785,
4809,
4831,
4859,
4897,
4944,
4990,
4999,
5055,
5064,
5142,
5220,
5280,
5338,
5348,
5369,
5371,
5372,
5401,
5442,
5516,
5518,
5519,
5569,
5570,
5608,
5609,
5668,
5669,
5691,
5799,
5801,
5802,
5814,
5815,
5908,
5909,
6005,
6006,
6051,
6052,
6102,
6103,
6120,
6121,
6135,
6136,
6206,
6207,
6242,
6296,
6317,
6358,
6369,
6370,
6500,
6512,
6550,
6573,
6611,
6739,
6777,
6778,
6832,
6906,
6958,
6977,
6978,
6984,
6986,
6987,
7076,
7077,
7090,
7134,
7140,
7155,
7208,
7210,
7211,
7330,
7331,
7402,
7515,
7536,
7543,
7557,
7576,
7577,
7600,
7601,
7616,
7617,
7688,
7729,
7731,
7747,
7753,
7755,
7756,
7757,
7828,
7869,
7871,
7887,
7893,
7895,
7896,
7914,
7915,
8021,
8022,
8067,
8068,
8106,
8149,
8221,
8249,
8253,
8255,
8256,
8368,
8369,
8398,
8418,
8455,
8456,
8477,
8478,
8500,
8501,
8517,
8518,
8628,
8629,
8686,
8687,
8728,
8803,
8865,
8891,
8893,
8894,
8907,
8908,
8969,
8970,
9057,
9058,
9142,
9143,
9168,
9169,
9216,
9254,
9316,
9429,
9431,
9432,
9515,
9516,
9539,
9540,
9613,
9614,
9647,
9648,
9652,
9653,
9710,
9711,
9791,
9792,
9900,
9901,
9910,
9911,
9970,
9971,
9984,
9985,
10017,
10018,
10076,
10114,
10146,
10147,
10179,
10205,
10246,
10271,
10313,
10363,
10364,
10474,
10475,
10524,
10564,
10628,
10743,
10747,
10748,
10777,
10799,
10861,
10870,
10936,
10945,
10971,
10988,
10989,
11027,
11063,
11064,
11106,
11144,
11191,
11239,
11282,
11363,
11431,
11463,
11471,
11472,
11517,
11580,
11612,
11620,
11626,
11627,
11680,
11708,
11709,
11735,
11767,
11809,
11860,
11910,
11923,
11983,
11996,
12078,
12160,
12224,
12286,
12300,
12328,
12334,
12335,
12368,
12413,
12491,
12497,
12498,
12524,
12636,
12642,
12646,
12648,
12649,
12650,
12727,
12728,
12801,
12802,
12916,
12939,
12948,
12984,
12993,
13009,
13033,
13034,
13072,
13073,
13113,
13141,
13142,
13170,
13205,
13243,
13278,
13305,
13306,
13406,
13459,
13473,
13504,
13585,
13659,
13722,
13783,
13859,
13881,
13933,
13959,
14006,
14024,
14040,
14054,
14082,
14090,
14096,
14097,
14130,
14156,
14162,
14166,
14168,
14169,
14250,
14251,
14324,
14325,
14439,
14462,
14471,
14512,
14521,
14560,
14586,
14596,
14620,
14621,
14659,
14660,
14710,
14738,
14739,
14767,
14802,
14840,
14908,
14977,
14978,
15013,
15014,
15087,
15178,
15245,
15261,
15355,
15403,
15419,
15433,
15461,
15469,
15475,
15476,
15509,
15545,
15551,
15555,
15557,
15558,
15592,
15616,
15617,
15653,
15681,
15715,
15735,
15773,
15801,
15821,
15843,
15873,
15924,
15937,
16017,
16021,
16022,
16082,
16083,
16143,
16180,
16213,
16237,
16278,
16279,
16402,
16499,
16636,
16641,
16642,
16674,
16676,
16677,
16689,
16690,
16716,
16717,
16743,
16744,
16770
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16770,
"ccnet_original_nlines": 544,
"rps_doc_curly_bracket": 0.012999399565160275,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05464307963848114,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020214779302477837,
"rps_doc_frac_lines_end_with_ellipsis": 0.01834861934185028,
"rps_doc_frac_no_alph_words": 0.5195830464363098,
"rps_doc_frac_unique_words": 0.4605385363101959,
"rps_doc_mean_word_length": 11.637883186340332,
"rps_doc_num_sentences": 318,
"rps_doc_symbol_to_word_ratio": 0.0034744199365377426,
"rps_doc_unigram_entropy": 5.568141460418701,
"rps_doc_word_count": 1077,
"rps_doc_frac_chars_dupe_10grams": 0.21302057802677155,
"rps_doc_frac_chars_dupe_5grams": 0.29272380471229553,
"rps_doc_frac_chars_dupe_6grams": 0.28187328577041626,
"rps_doc_frac_chars_dupe_7grams": 0.26471996307373047,
"rps_doc_frac_chars_dupe_8grams": 0.2203606218099594,
"rps_doc_frac_chars_dupe_9grams": 0.2203606218099594,
"rps_doc_frac_chars_top_2gram": 0.03334929049015045,
"rps_doc_frac_chars_top_3gram": 0.011967450380325317,
"rps_doc_frac_chars_top_4gram": 0.009893090464174747,
"rps_doc_books_importance": -1509.882568359375,
"rps_doc_books_importance_length_correction": -1509.882568359375,
"rps_doc_openwebtext_importance": -730.5653076171875,
"rps_doc_openwebtext_importance_length_correction": -730.5653076171875,
"rps_doc_wikipedia_importance": -529.7473754882812,
"rps_doc_wikipedia_importance_length_correction": -529.7473754882812
},
"fasttext": {
"dclm": 0.9995533227920532,
"english": 0.039317891001701355,
"fineweb_edu_approx": 3.116605043411255,
"eai_general_math": 0.45775383710861206,
"eai_open_web_math": 0.030929090455174446,
"eai_web_code": 0.954035758972168
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,596,744,985,571,514,400 |
With high probability
From Algorithmist
Jump to: navigation, search
Definition
An event occurs with high probability if, for any \alpha \geq 1, the event occurs with probability at least 1-{\frac {c_{\alpha }}{n^{\alpha }}}, where c_{\alpha } depends only on \alpha .
Since we can choose \alpha , we can make the probability arbitrarily low, at a cost of time and/or space.
Example
With high probability, a set of N random numbers will contain at least \Omega (N) evens.
What it means is: For any \alpha , there exists a k (that doesn't depend on N), such that a set of N random numbers will contain at least k*N evens with probability 1-{\frac {c_{\alpha }}{n^{\alpha }}}, where c_{\alpha } depends only on \alpha .
|
{
"url": "http://www.algorithmist.com/index.php?title=With_high_probability&printable=yes",
"source_domain": "www.algorithmist.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "16872",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JINZQYH7JLBGLVP2BQK3S6ZQQLP3Z75B",
"WARC-Concurrent-To": "<urn:uuid:813f659b-16f8-4d31-9d04-dd9646308f96>",
"WARC-Date": "2018-05-24T17:30:33Z",
"WARC-IP-Address": "209.216.230.114",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RMNAGONPFQJI2ZF2NRHCRMEABKXTS3YM",
"WARC-Record-ID": "<urn:uuid:ab59a665-b9bd-4a78-853d-9a1ab38e1d84>",
"WARC-Target-URI": "http://www.algorithmist.com/index.php?title=With_high_probability&printable=yes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:98b0becb-8503-4ccb-9e4b-028a10d37615>"
},
"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,
22,
23,
41,
69,
70,
81,
82,
272,
273,
379,
380,
388,
389,
478,
479
],
"line_end_idx": [
22,
23,
41,
69,
70,
81,
82,
272,
273,
379,
380,
388,
389,
478,
479,
725
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 725,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0.03310345113277435,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3076923191547394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02958579920232296,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27218934893608093,
"rps_doc_frac_unique_words": 0.5478261113166809,
"rps_doc_mean_word_length": 4.556521892547607,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9749443531036377,
"rps_doc_word_count": 115,
"rps_doc_frac_chars_dupe_10grams": 0.1450381726026535,
"rps_doc_frac_chars_dupe_5grams": 0.3206107020378113,
"rps_doc_frac_chars_dupe_6grams": 0.3206107020378113,
"rps_doc_frac_chars_dupe_7grams": 0.3206107020378113,
"rps_doc_frac_chars_dupe_8grams": 0.3206107020378113,
"rps_doc_frac_chars_dupe_9grams": 0.3206107020378113,
"rps_doc_frac_chars_top_2gram": 0.04580153152346611,
"rps_doc_frac_chars_top_3gram": 0.10877863317728043,
"rps_doc_frac_chars_top_4gram": 0.08396946638822556,
"rps_doc_books_importance": -76.11664581298828,
"rps_doc_books_importance_length_correction": -76.13715362548828,
"rps_doc_openwebtext_importance": -41.419288635253906,
"rps_doc_openwebtext_importance_length_correction": -41.43979263305664,
"rps_doc_wikipedia_importance": -21.84140968322754,
"rps_doc_wikipedia_importance_length_correction": -21.86191177368164
},
"fasttext": {
"dclm": 0.9894202947616577,
"english": 0.8730563521385193,
"fineweb_edu_approx": 2.3536155223846436,
"eai_general_math": 0.9999536275863647,
"eai_open_web_math": 0.9989227056503296,
"eai_web_code": 0.3182159662246704
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"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": "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": "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": "10",
"label": "Knowledge Article"
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,036,932,851,266,955,300 |
Cisco Blogs
Cisco Blog > The Platform
PC World’s 50 Most Important People on the Web
Many of you have likely already seen PC World’s 50 Most Important People on the Web” article that came out this Monday. I just came across it thanks to the Fake Steve Jobs blog, which is back online after a brief hiatus. Lists always leave someone out who think they should be on it. “Am I on the list?” “Did I make the list?” “Who’s on the list?” My comment on the PC World list is this: (And, yes, this is Sour Grapes 101)…Cisco is not on the list that is self-entitled, “Here’s who’s shaping what you read, watch, hear, write, buy, sell, befriend, flame, and otherwise do online.” To be sure, this list is focused on social media and web policy, etc. However, the list says it includes what you “otherwise do online”…i.e. what enables your online experience.IMHO, I would argue that it is Cisco gear that is enabling all of this interaction and social media to take place. (Of course, we are not service providers, but our gear enables service providers (cable, telecom, etc.) to give the world “dial-tone” to the internet.) Fake Steve Jobs blogs sub-head says, “Dude, I invented the frigging iPod. Have you heard of it?” I think the sub-head of this blog should be “We invented the friggin network router. Have you heard of it?”In bandwidth (i.e. enabling ALL of this social media and activity to take place), Cisco has the CRS-1 Carrier Routing System, the world’s highest capacity Internet router, as certified by the Guinness Book of World Records. The CRS-1 can carry up to 92 terabits per second. That’s enough bandwidth to support the world population of 6.4 billion people on a simultaneous IP phone call; or a billion people playing an online game using real-time voice and chat features, among many other “otherwise online” things.Please disagree with me if you must, but the network is the platform for all of “what you read, watch, hear, write, buy, sell, befriend, flame, and otherwise do online.” And, I’m not even mentioning the business processes that get streamlined that make us all more efficient and productive…or the IP technology that enables IM’s, IP calling, video and data transfer at all levels, etc. Are we enablers? Yes we are. And proud of it.So, all due respect to Perez Hilton and the other distinguished “most important” ladies and gentleman on the web on this list, but to suggest that he or they are more important than any engineer (or executive or employee) at Cisco is missing the mark. Again, sour grapes, but someone has to say it.
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.
3 Comments.
1. I don't disagree, entirely. I just think Cisco has competitors that offer similar network features today. Cisco may have created the first routers, but now anyone with a PC can build a router. Does anyone who builds a router out of a PC and route network traffic deserve the respect we demand? I mean, today I can build just about anything with common free open source technologies, just add hardware.IMO, Cisco is like IBM. IBM brought us the PC, but today they promote collaboration and open technologies to help us build a better cheaper PC than IBM could have ever built for us on their own. If Cisco could promote wider adoption of faster broadband and wireless technologies, if Cisco could lean on the governments, schools and businesses to help Cisco help them build a solid network that truely reaches everyone everywhere, then on top of that network they could build open source services that maximize the potential of our hardware while providing something more noticable to the end user than the fact that their calls always get through, such as 802.11 cell phones that automatically switch between any cell carrier and VOIP dhcp wireless without call interruption, have local channels for messaging, local shopping services, etc.Its hard to have an internet economy when only a few people get access. Free wireless broadband for everyone would go a long way. Reliable and open services would go a long way. Access is important. Google is already working to build it in places, but I think Cisco has the tech to do it right, if only they want to nearly give it away now, before some Linux hackers with cheap mesh tech and their PCs beat you to it..In the end, who wins? The guy with the most money? Or the guy who brought you free wireless broadband and improved your whole economy? I don't know, I just want more bandwidth. 10Mb is barely enough. 100Mb was designed for video. Who deserves the thanks for the current state of internet video today? Back in '98 I remember watching multicast video streaming over 100Mb corporate nets in mpeg-2 at DVD resolutions. Today, instead of bringing that technology to the masses, they get 10Mb lines capped at 6.4Mb down, 256Kb up, and they manage to get around this bandwidth starvation scheme by developing better compression and peer to peer apps that frighten anyone concerned about their data. These technologies would probably have existed anyway, but their adoption might have been prolonged by less bandwidth starvation, IMO. The next wave of open source tech might prevent lawful enforcement without banning all use. I am concerned that the internet will become more hostile over time if the current trends of business first, consumer second don't ackowledge the fact that we are all just people dealing with obsolete technology on a daily basis. Nothing is perfect, and the only way to remedy the situation is to just do it. Money, politics, and law are just standing in the way of real progress, the type I believe Cisco wants to make, progress in human interaction.I believe its important for business to be paid for the services they provide, and its important for artists to be paid for their creations. But is it so important to make everyone pay that we forget about the additional costs we impose on them? Imagine a service that required you to enter your credit card info for each song you wanted to hear, and then interrupted you every minute in a stream to request payment for bandwidth usage? I can, because I know how much people want to get paid. But I also know how much each and every person's time is worth. The best thing to do is make payment as efficient and simple as possible for the end user, while offering the most open and compatible service everywhere, again, IMO.Business is good for business, but being open is so much better for the consumer. That's why we see a lot of those people on the list, its not that they offer the best products, they offer the best ideas. If Cisco can offer this idea to the world and help it share and cooperate its way to universal access, Cisco would deserve more than just recognition for their technology, they would deserve recognition for their humanity. And I just think that would be hard to compete with.
2. I think most people can tell you who invented the telephone. Does anyone remember who invented the dial tone?
3. Cisco didnt invent the router per say. Bill Yeager invented the first router, we just paid him royalties and improved what he did. So we kind of invented"" it."
|
{
"url": "http://blogs.cisco.com/news/pc_worlds_50_most_important_people_on_the_web",
"source_domain": "blogs.cisco.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "67869",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5SZ5VJGV72HNZMBUH56WLZWSP4Q337VZ",
"WARC-Concurrent-To": "<urn:uuid:5f1bd9a9-7135-482e-a9a3-42df356d4885>",
"WARC-Date": "2016-02-10T04:47:02Z",
"WARC-IP-Address": "67.192.93.178",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:V6P766IVDF7WENS57HAV2M7EMQSUEM4T",
"WARC-Record-ID": "<urn:uuid:64343154-c832-473d-bfbb-7d5f20f9ca50>",
"WARC-Target-URI": "http://blogs.cisco.com/news/pc_worlds_50_most_important_people_on_the_web",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3ec56636-c029-4b10-a17e-979550dedebb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
12,
13,
14,
40,
41,
88,
89,
2563,
2564,
2711,
2712,
2724,
2725,
2726,
6964,
7079
],
"line_end_idx": [
12,
13,
14,
40,
41,
88,
89,
2563,
2564,
2711,
2712,
2724,
2725,
2726,
6964,
7079,
7244
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7244,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4390243887901306,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030323009938001633,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15557019412517548,
"rps_doc_frac_unique_words": 0.4047619104385376,
"rps_doc_mean_word_length": 4.580952167510986,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.001977589912712574,
"rps_doc_unigram_entropy": 5.617177963256836,
"rps_doc_word_count": 1260,
"rps_doc_frac_chars_dupe_10grams": 0.02148302085697651,
"rps_doc_frac_chars_dupe_5grams": 0.03880804032087326,
"rps_doc_frac_chars_dupe_6grams": 0.03361053019762039,
"rps_doc_frac_chars_dupe_7grams": 0.03361053019762039,
"rps_doc_frac_chars_dupe_8grams": 0.03361053019762039,
"rps_doc_frac_chars_dupe_9grams": 0.02148302085697651,
"rps_doc_frac_chars_top_2gram": 0.007796260062605143,
"rps_doc_frac_chars_top_3gram": 0.005717259831726551,
"rps_doc_frac_chars_top_4gram": 0.005197510123252869,
"rps_doc_books_importance": -707.464111328125,
"rps_doc_books_importance_length_correction": -707.464111328125,
"rps_doc_openwebtext_importance": -462.9473876953125,
"rps_doc_openwebtext_importance_length_correction": -462.9473876953125,
"rps_doc_wikipedia_importance": -316.7680969238281,
"rps_doc_wikipedia_importance_length_correction": -316.7680969238281
},
"fasttext": {
"dclm": 0.11605525016784668,
"english": 0.958107590675354,
"fineweb_edu_approx": 1.414770245552063,
"eai_general_math": 0.10041248798370361,
"eai_open_web_math": 0.17122185230255127,
"eai_web_code": 0.030466079711914062
}
}
|
{
"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": "384.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,478,262,627,117,300,000 |
Wednesday, 1 January 2014
Understanding 'INODES' in Linux/Unix Filesystems
The inode ( also known as Index Node) is a very basic concept related to Linux and UNIX filesystem. Each and every object/element in the filesystem is associated with an inode.
You must be aware of the fact that, most of the countries have given a unique identity to their citizens in the form of a unique identification number ('Aadhar Card' in India and 'SSN' in the USA) to identify an individual easily and uniquely. This also leads to make all the paper work corresponding to any citizen easier to be handled.
Just like these identification numbers for people, there is a unique identity of every member of a Linux filesystem which is known as Inode number and it uniquely exists for each and every individual file on Linux or Unix filesystems.
In any Linux/Unix filesystem, inodes occupy only up to 1% of the available disk space, whether it is the hard disk itself or a partition present on it. The inode space is helpful to "track" the files saved in the hard disk memory. Size of each inode entry is 128 bytes. The inode entries store metadata about each object of the filesystem (file or directory) that just points to these structures and does not store any kind of data. The metadata, stored by each inode entry, may have the following information about each structure:
• Inode number
• Access Control List (ACL)
• Extended attribute
• Direct/indirect disk blocks
• Number of blocks
• File access, change and modification time
• File deletion time
• File generation number
• File size
• File type
• Group
• Number of links
• Owner
• Permissions
• Status flags
Whenever a new file is created within a directory, two things are assigned to it : a Name and an Inode number. Some people may think that any parent directory contains the entire file and all the information relevant to it which might not be always true. So we see that a directory associates a file name with its Inode number.
When a user wants to access the contents of a file or any information related to a file then he makes use of its file name in order to do that, but internally the file name is first linked with its Inode number. Then with that Inode number, the associated Inode is retrieved. There exists a table known as Inode table, which maintains the mapping information of Inode numbers with their corresponding Inodes.
Defining an Inode
An inode is a data structure on a traditional Unix-style filesystem such as UFS or ext3. An inode stores basic information about a regular file, directory, or other filesystem object.
How to access Inode Numbers?
1) Ls -i Command
As we all know, ls is used for listing all the files within a directory. ls command when used with option -i, will display the list of files along with their inode numbers.
Syntax:
ls -i
Output:
2) Df -i Command
The df command when used with option -i, will display Inode information.
Syntax:
df -i
Output:
3) Stat Command
Stat command is very useful in displaying the file statistics. This command also shows inode number of a file.
Syntax:
stat [file-name]
Output:
Another Use of Inode Numbers
If you have a file with a name 1/1/2014 then you cannot delete such file by its name using any Unix/Linux command. The only way with which you can achieve this is to delete it using it’s inode number. Linux or UNIX doesn’t allow the users to create a file with a name like 1/1/2014, but if you are using NFS from MAC OS or Windows then it is possible to create such a file.
Find command:
You can make use of find command to remove a file as follows:
Syntax:
find . -inum [inode-number] -exec rm -i {} \;
You will be prompted for confirmation, press Y to remove the file.
Let’s try to verify everything.
Create a hard to delete file name.
$ cd ~/Desktop
$ touch 1/1/2014
$ ls
Try to delete this file using rm command.
$ rm 1/1/2014
Find out the inode number of that file.
$ ls –i
Now delete the file using it’s inode number and find command.
$ find . -inum [inode-number] -exec rm -i {} \;
Share This Post:
0 comments:
Post a Comment
Total Pageviews
|
{
"url": "http://www.yourownlinux.com/2014/01/inodes-in-linux-unix-filesystems.html",
"source_domain": "www.yourownlinux.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "111239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SZPCAUKOBPFNZ2UZ3P66W7IJNVZZDPGG",
"WARC-Concurrent-To": "<urn:uuid:c117484f-5ad8-4b63-8dd2-626d0a5eec84>",
"WARC-Date": "2014-04-24T15:45:12Z",
"WARC-IP-Address": "74.125.29.121",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:US44MISFI4R3ADTP4Y6KKBELSJKLVAF7",
"WARC-Record-ID": "<urn:uuid:630897d2-d313-472f-801d-1af9e7c81f85>",
"WARC-Target-URI": "http://www.yourownlinux.com/2014/01/inodes-in-linux-unix-filesystems.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6dd1112-29b1-430f-9be3-735ac8c4ac68>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 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,
26,
27,
76,
77,
78,
259,
260,
603,
604,
843,
844,
1379,
1380,
1397,
1427,
1450,
1482,
1503,
1549,
1572,
1599,
1613,
1627,
1637,
1657,
1667,
1683,
1700,
2031,
2032,
2445,
2446,
2464,
2465,
2649,
2650,
2651,
2680,
2681,
2698,
2871,
2872,
2880,
2887,
2888,
2896,
2897,
2898,
2915,
2988,
2989,
2997,
3003,
3004,
3012,
3013,
3014,
3015,
3031,
3142,
3143,
3151,
3168,
3169,
3177,
3178,
3179,
3180,
3209,
3210,
3588,
3589,
3603,
3604,
3666,
3667,
3675,
3722,
3723,
3790,
3791,
3823,
3824,
3859,
3860,
3875,
3876,
3893,
3894,
3900,
3901,
3943,
3944,
3959,
3960,
4000,
4001,
4010,
4011,
4073,
4074,
4122,
4123,
4140,
4141,
4153,
4154,
4169,
4170
],
"line_end_idx": [
26,
27,
76,
77,
78,
259,
260,
603,
604,
843,
844,
1379,
1380,
1397,
1427,
1450,
1482,
1503,
1549,
1572,
1599,
1613,
1627,
1637,
1657,
1667,
1683,
1700,
2031,
2032,
2445,
2446,
2464,
2465,
2649,
2650,
2651,
2680,
2681,
2698,
2871,
2872,
2880,
2887,
2888,
2896,
2897,
2898,
2915,
2988,
2989,
2997,
3003,
3004,
3012,
3013,
3014,
3015,
3031,
3142,
3143,
3151,
3168,
3169,
3177,
3178,
3179,
3180,
3209,
3210,
3588,
3589,
3603,
3604,
3666,
3667,
3675,
3722,
3723,
3790,
3791,
3823,
3824,
3859,
3860,
3875,
3876,
3893,
3894,
3900,
3901,
3943,
3944,
3959,
3960,
4000,
4001,
4010,
4011,
4073,
4074,
4122,
4123,
4140,
4141,
4153,
4154,
4169,
4170,
4189
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4189,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0.0009548799716867507,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38295453786849976,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012500000186264515,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19431817531585693,
"rps_doc_frac_unique_words": 0.36652836203575134,
"rps_doc_mean_word_length": 4.43015193939209,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.990581512451172,
"rps_doc_word_count": 723,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04807993024587631,
"rps_doc_frac_chars_dupe_6grams": 0.039338119328022,
"rps_doc_frac_chars_dupe_7grams": 0.023103339597582817,
"rps_doc_frac_chars_dupe_8grams": 0.023103339597582817,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.034342799335718155,
"rps_doc_frac_chars_top_3gram": 0.007492979988455772,
"rps_doc_frac_chars_top_4gram": 0.011239459738135338,
"rps_doc_books_importance": -418.5297546386719,
"rps_doc_books_importance_length_correction": -418.5297546386719,
"rps_doc_openwebtext_importance": -185.4080047607422,
"rps_doc_openwebtext_importance_length_correction": -185.4080047607422,
"rps_doc_wikipedia_importance": -126.99903106689453,
"rps_doc_wikipedia_importance_length_correction": -126.99903106689453
},
"fasttext": {
"dclm": 0.08668596297502518,
"english": 0.8834791779518127,
"fineweb_edu_approx": 2.8084089756011963,
"eai_general_math": 0.6824159026145935,
"eai_open_web_math": 0.4588409662246704,
"eai_web_code": 0.39572787284851074
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,657,454,512,421,782,000 |
Last reviewed on December 30, 2013 — 2 Comments
There are two ways to convert a contact group to individual contacts: Create a list of the Contact Group members and import them into Contacts or use a macro to create the contacts.
Use this method to save the names and addresses of contact group (distribution list) members in a text file to use in other programs or to import into Outlook Contacts.
1. Open the DL
2. Go to the File, Save as menu. (This is the Office icon menu in Outlook 2007)
3. Choose to save as a *.txt file.
This saves the DL as a text file. You can edit it in Notepad or Excel and import it, or forward it to other users.
In this tutorial, I’m extracting the names from a DL so I can import them into Outlook as individual Contacts.
Create Contacts from Contact Groups using VBA
See How to use Outlook’s VBA Editor
You need the GetCurrentItem function from Outlook VBA: work with open item or selected item. This allows you to run the macro either by selecting the Contact Group or from an open Contact Group.
' Based on a macro by Valk Beekman.
Sub CreateContactsfromDL()
Dim o_list As Object
Dim objContact As Outlook.ContactItem
' set your category here.
t_cat = "From DL"
' Current object and should be the distributionlist
Set o_list = GetCurrentItem()
For i = 1 To o_list.MemberCount
' Create separate contacts
Set objContact = Application.CreateItem(olContactItem)
With objContact
.Email1Address = o_list.GetMember(i).Address
.FullName = o_list.GetMember(i)
.Categories = t_cat
.Save
End With
Next
Set objContact = Nothing
Set o_list = Nothing
End Sub
More Information
Create a Distribution List from a list of addresses – Recipients can use this method to convert the list to a new DL or to add the members to an existing DL.
Create a text file containing the names and email addresses in a DL – This tutorial uses the Forward as Internet format (vCard) method.
Create a list of Contact Group members and their phone numbers VBA Sample
Add a Category to Contacts in a Contact Group (DL) VBA sample
Comments
1. Robyn says
This is too messy when all a user is likely to want is a quick export of names and email addresses from a contact group. Why are the contact group details saved as PDLs instead of in the same way as other contacts? Why not have this conversion to individual contacts as an option just as Export is an option?
• Diane Poremsky says
if you just want a quick list of names and addresses, use Forward as > Internet format then open the text file that is created on the Forward. You can edit the list (remove the non-contact stuff and add field names) then import.
I don't know why they went with this method of doing DL's, but it's been like this for 15 yrs or more and I don't expect it to change. I don't know why they never created an export option for this, probably because way back when, members of a DL were already contacts, so it wasn't necessary. Now they are removing export filters, not adding new ones.
Leave a Reply
Please post long or more complicated questions at OutlookForums by Slipstick.com.
If the Post Comment button disappears, press your Tab key.
|
{
"url": "http://www.slipstick.com/tutorial/create-individual-contacts-from-a-distribution-list/",
"source_domain": "www.slipstick.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "89112",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XGT45KBLYOLJLT5ZUCAN32IOUUF3X2CF",
"WARC-Concurrent-To": "<urn:uuid:6f361203-fbc5-4134-8842-a31f576da896>",
"WARC-Date": "2015-05-22T14:31:39Z",
"WARC-IP-Address": "74.219.125.142",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VWOS5AQXES7X6BISQ2HD73NP45PWDEAB",
"WARC-Record-ID": "<urn:uuid:6515819d-26fa-4b6c-a1cc-9e40c107af09>",
"WARC-Target-URI": "http://www.slipstick.com/tutorial/create-individual-contacts-from-a-distribution-list/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9e6dc8fd-cfb7-4677-b701-93181c93f22c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 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,
51,
52,
234,
235,
404,
405,
422,
504,
541,
542,
657,
658,
769,
770,
816,
817,
853,
854,
1049,
1050,
1086,
1113,
1134,
1135,
1173,
1174,
1200,
1218,
1219,
1271,
1301,
1302,
1334,
1337,
1365,
1420,
1436,
1489,
1529,
1557,
1571,
1580,
1581,
1586,
1587,
1612,
1633,
1641,
1642,
1659,
1660,
1818,
1954,
2028,
2090,
2091,
2100,
2101,
2117,
2118,
2431,
2432,
2458,
2459,
2694,
2695,
3053,
3054,
3068,
3069,
3151,
3152
],
"line_end_idx": [
51,
52,
234,
235,
404,
405,
422,
504,
541,
542,
657,
658,
769,
770,
816,
817,
853,
854,
1049,
1050,
1086,
1113,
1134,
1135,
1173,
1174,
1200,
1218,
1219,
1271,
1301,
1302,
1334,
1337,
1365,
1420,
1436,
1489,
1529,
1557,
1571,
1580,
1581,
1586,
1587,
1612,
1633,
1641,
1642,
1659,
1660,
1818,
1954,
2028,
2090,
2091,
2100,
2101,
2117,
2118,
2431,
2432,
2458,
2459,
2694,
2695,
3053,
3054,
3068,
3069,
3151,
3152,
3210
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3210,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3734756112098694,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030487800016999245,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16463415324687958,
"rps_doc_frac_unique_words": 0.39963167905807495,
"rps_doc_mean_word_length": 4.524861812591553,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.917977809906006,
"rps_doc_word_count": 543,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.013024009764194489,
"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.04395604133605957,
"rps_doc_frac_chars_top_3gram": 0.015873020514845848,
"rps_doc_frac_chars_top_4gram": 0.010582010261714458,
"rps_doc_books_importance": -292.24700927734375,
"rps_doc_books_importance_length_correction": -292.24700927734375,
"rps_doc_openwebtext_importance": -174.41671752929688,
"rps_doc_openwebtext_importance_length_correction": -174.41671752929688,
"rps_doc_wikipedia_importance": -146.0872802734375,
"rps_doc_wikipedia_importance_length_correction": -146.0872802734375
},
"fasttext": {
"dclm": 0.10570753365755081,
"english": 0.8891151547431946,
"fineweb_edu_approx": 1.8124749660491943,
"eai_general_math": 0.17515945434570312,
"eai_open_web_math": 0.09128248691558838,
"eai_web_code": 0.016077939420938492
}
}
|
{
"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.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,674,374,973,396,782,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
PerlMonks
Find perl module version from command-line
by lachoy (Parson)
on Oct 18, 2000 at 01:15 UTC ( #37237=snippet: print w/ replies, xml ) Need Help??
Description:
How many times have you wondered what version of a module you had installed, just to check it using perl -e. Why bother? Just put this little snippet in '/usr/local/bin' or some other accessible place. (Win32 users can wrap it in a batch file.)
perlmodver Template DBI File::Spec
Results in:
Template : 2.00-beta5 DBI : 1.13 File::Spec : 0.6
#!/usr/bin/perl
use strict;
foreach my $module ( @ARGV ) {
eval "require $module";
printf( "%-20s: %s\n", $module, $module->VERSION ) unless ( $@ );
}
Comment on Find perl module version from command-line
Download Code
Replies are listed 'Best First'.
RE: Find perl module version from command-line
by Fastolfe (Vicar) on Oct 18, 2000 at 02:27 UTC
Things like this are frequently done in conjunction with CPAN lookups. Many people don't realize that the CPAN module itself can be used in your own scripts. You can extend lachoy's example a lot further by using CPAN, at the expense of a lot of time:
#!/usr/bin/perl use CPAN; printf("%-20s %10s %10s\n", "Module", "Installed", "CPAN"); foreach $a (@ARGV) { foreach $mod (CPAN::Shell->expand("Module", $a)){ printf("%-20s %10s %10s %s\n", $mod->id, $mod->inst_version eq "undef" || !defined($mod->inst_version) ? "-" : $mod->inst_version, $mod->cpan_version eq "undef" || !defined($mod->cpan_version) ? "-" : $mod->cpan_version, $mod->uptodate ? "" : "*" ); } }
Running with arguments: DBI /DBD::/
Module Installed CPAN DBI 1.13 1.14 * DBD::ADO 0.14 1.17 * DBD::ASAny - 1.09 * DBD::Adabas - 0.2003 * DBD::Altera - - * DBD::CSV - 0.1024 *
...etc. Though if all you're interested in is the installed version of modules, you're FAR better off going with lachoy's script, since the code above will rely upon CPAN data, which will require time to fetch, extract and browse.
RE: Find perl module version from command-line
by KM (Priest) on Oct 18, 2000 at 16:53 UTC
This is how I do it for checking one module.. I use CPAN to check multiple:
perl -MMODULE -e 'print $MODULE::VERSION';
Of course, if the module author doesn't put the suggested $VERSION variable in, this won't work :)
Cheers,
KM
Right! This is what I meant by perl -e in my writeup. but I thought it was getting kind of tedious to type this in every time... TMTOWDI.
A nice shortcut is
perl -e 'use Some::Module 9e9'
It is worth noting that perl -MSome::Module=9e9 -e1 works only if that module is Exporter-based, because -M passes that number as an import argument instead of a version number, but then Exporter interprets it as a version number.
Re: Find perl module version from command-line
by jmcnamara (Monsignor) on May 01, 2001 at 16:20 UTC
I was going to post the following to the Snippets section when I came across your nicer version:
perl -le 'eval "require $ARGV[0]" and print ${"$ARGV[0]::VERSION"} +' Module
Your method of printing the version number is cleaner as well:
perl -le 'eval "require $ARGV[0]" and print $ARGV[0]->VERSION' Mod +ule
I'm glad that I searched before posting. ;-)
John.
--
When I run the perl script provided by Fastolfe I get some extra output in the results:
dal1:/home/user1 % perlmodver.pl CPAN Module Installed CPAN CPAN: Storable loaded ok (v2.13) Going to read /home/user1/.cpan/Metadata Database was generated on Thu, 03 Jan 2008 05:38:06 GMT CPAN 1.9205 1.9205 dal1:/home/user1 %
Is there a simple way to discard this additional text?
The extra output is being generated by the CPAN module itself. I checked out the code on mine and I don't see any conditionals or anything that could be passed to supress that output. So, the simple answer is to grep for what you want or use perlmodver.pl CPAN | tail +5 because I don't think there's much you can do from the perl side that doesn't require putting more effort into it than it's worth.
--
naChoZ
Therapy is expensive. Popping bubble wrap is cheap. You choose.
Re: Find perl module version from command-line
by xorl (Deacon) on Apr 11, 2013 at 17:24 UTC
Yet another way this can be done.
#!/usr/bin/perl use strict; use ExtUtils::Installed; my @modules; my $installed = ExtUtils::Installed->new(); if (scalar(@ARGV) > 0) { @modules = @ARGV; } else { @modules = $installed->modules(); } print "Module\tVersion\n"; foreach (@modules) { print $_ . "\t" . $installed->version($_) . "\n"; }
Back to Snippets Section
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: snippet [id://37237]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (4)
As of 2015-11-29 19:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?
Results (752 votes), past polls
|
{
"url": "http://www.perlmonks.org/?node_id=37237",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "31993",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JXKINLZYIFUM2AM5TYRQ6IKDSK53EACK",
"WARC-Concurrent-To": "<urn:uuid:0ab09480-8322-44a4-b406-f749507807a2>",
"WARC-Date": "2015-11-29T19:25:54Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RVU75ZA7J4NQQE6CLAYQJZZHQKRQ5D2V",
"WARC-Record-ID": "<urn:uuid:47d64b3c-77c1-4476-a3fa-f7dcfd5742ae>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=37237",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37b3c0b8-90bb-4196-9ae8-f57d76dc972e>"
},
"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,
63,
90,
92,
104,
105,
148,
149,
168,
251,
252,
265,
266,
511,
512,
547,
548,
560,
561,
611,
627,
639,
670,
696,
764,
766,
820,
834,
867,
914,
963,
1219,
1634,
1674,
1818,
2053,
2100,
2144,
2224,
2225,
2272,
2273,
2376,
2377,
2389,
2396,
2397,
2541,
2542,
2567,
2568,
2605,
2842,
2889,
2943,
2944,
3045,
3126,
3127,
3194,
3270,
3271,
3320,
3321,
3331,
3338,
3339,
3433,
3667,
3728,
3729,
4139,
4140,
4151,
4166,
4167,
4239,
4240,
4287,
4333,
4371,
4673,
4674,
4699,
4700,
4708,
4718,
4728,
4729,
4749,
4767,
4780,
4793,
4825,
4830,
4842,
4879,
4880,
4918,
4931,
4967,
4994,
5004,
5017,
5029,
5040,
5058,
5059,
5172,
5173,
5174,
5175,
5176,
5177,
5178,
5179,
5180,
5181,
5182,
5183,
5184,
5185,
5186
],
"line_end_idx": [
63,
90,
92,
104,
105,
148,
149,
168,
251,
252,
265,
266,
511,
512,
547,
548,
560,
561,
611,
627,
639,
670,
696,
764,
766,
820,
834,
867,
914,
963,
1219,
1634,
1674,
1818,
2053,
2100,
2144,
2224,
2225,
2272,
2273,
2376,
2377,
2389,
2396,
2397,
2541,
2542,
2567,
2568,
2605,
2842,
2889,
2943,
2944,
3045,
3126,
3127,
3194,
3270,
3271,
3320,
3321,
3331,
3338,
3339,
3433,
3667,
3728,
3729,
4139,
4140,
4151,
4166,
4167,
4239,
4240,
4287,
4333,
4371,
4673,
4674,
4699,
4700,
4708,
4718,
4728,
4729,
4749,
4767,
4780,
4793,
4825,
4830,
4842,
4879,
4880,
4918,
4931,
4967,
4994,
5004,
5017,
5029,
5040,
5058,
5059,
5172,
5173,
5174,
5175,
5176,
5177,
5178,
5179,
5180,
5181,
5182,
5183,
5184,
5185,
5186,
5221
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5221,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0.002681480022147298,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23314830660820007,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05789056047797203,
"rps_doc_frac_lines_end_with_ellipsis": 0.008130080066621304,
"rps_doc_frac_no_alph_words": 0.3624107837677002,
"rps_doc_frac_unique_words": 0.505913257598877,
"rps_doc_mean_word_length": 4.829172134399414,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.005551150068640709,
"rps_doc_unigram_entropy": 5.515414237976074,
"rps_doc_word_count": 761,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09714286029338837,
"rps_doc_frac_chars_dupe_6grams": 0.08653061091899872,
"rps_doc_frac_chars_dupe_7grams": 0.07673469185829163,
"rps_doc_frac_chars_dupe_8grams": 0.06639456003904343,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013061219826340675,
"rps_doc_frac_chars_top_3gram": 0.022857140749692917,
"rps_doc_frac_chars_top_4gram": 0.034285709261894226,
"rps_doc_books_importance": -569.0150756835938,
"rps_doc_books_importance_length_correction": -569.0150756835938,
"rps_doc_openwebtext_importance": -336.67529296875,
"rps_doc_openwebtext_importance_length_correction": -336.67529296875,
"rps_doc_wikipedia_importance": -227.71038818359375,
"rps_doc_wikipedia_importance_length_correction": -227.71038818359375
},
"fasttext": {
"dclm": 0.02199513092637062,
"english": 0.7946605682373047,
"fineweb_edu_approx": 1.933097004890442,
"eai_general_math": 0.12850433588027954,
"eai_open_web_math": 0.3282651901245117,
"eai_web_code": 0.08380944281816483
}
}
|
{
"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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,577,641,959,564,148,000 |
package de.espend.idea.shopware.util;
import com.intellij.lang.javascript.JavaScriptSupportLoader;
import com.intellij.openapi.fileTypes.LanguageFileType;
import com.intellij.openapi.project.Project;
import com.intellij.openapi.util.Condition;
import com.intellij.openapi.vfs.VfsUtil;
import com.intellij.openapi.vfs.VirtualFile;
import com.intellij.openapi.vfs.VirtualFileVisitor;
import com.intellij.psi.PsiDirectory;
import com.intellij.psi.PsiElement;
import com.intellij.psi.PsiFile;
import com.intellij.psi.PsiWhiteSpace;
import com.intellij.psi.search.FileTypeIndex;
import com.intellij.psi.search.GlobalSearchScope;
import com.intellij.psi.tree.IElementType;
import com.intellij.psi.util.PsiTreeUtil;
import com.intellij.util.containers.ContainerUtil;
import com.intellij.util.indexing.FileBasedIndex;
import com.jetbrains.php.PhpIndex;
import com.jetbrains.php.lang.psi.PhpPsiUtil;
import com.jetbrains.php.lang.psi.elements.PhpClass;
import com.jetbrains.smarty.SmartyFile;
import com.jetbrains.smarty.SmartyFileType;
import com.jetbrains.smarty.lang.SmartyTokenTypes;
import com.jetbrains.smarty.lang.psi.SmartyTag;
import fr.adrienbrault.idea.symfony2plugin.util.yaml.YamlHelper;
import org.apache.commons.lang.StringUtils;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import java.util.*;
/**
* @author Daniel Espendiller <[email protected]>
*/
public class TemplateUtil {
public static void collectFiles(Project project, SmartyTemplateVisitor smartyTemplateVisitor) {
collectFiles(project, smartyTemplateVisitor, "tpl");
}
public static void collectFiles(Project project, final SmartyTemplateVisitor smartyTemplateVisitor, String... extensions) {
final List<String> exts = Arrays.asList(extensions);
final List<VirtualFile> uniqueVirtualFiles = new ArrayList<>();
collectPluginTemplates(project, smartyTemplateVisitor, exts);
// search for index files; think of lib and include path
List<LanguageFileType> languageFileTypes = new ArrayList<>();
if(exts.contains("tpl")) {
languageFileTypes.add(SmartyFileType.INSTANCE);
}
if(exts.contains("js")) {
languageFileTypes.add(JavaScriptSupportLoader.JAVASCRIPT);
}
// sw5: provides parent class for themes
Set<VirtualFile> themes = new HashSet<>();
for(PhpClass phpClass: PhpIndex.getInstance(project).getAllSubclasses("\\Shopware\\Components\\Theme")) {
PsiDirectory parent = phpClass.getContainingFile().getParent();
if(parent != null) {
themes.add(parent.getVirtualFile());
}
}
for(LanguageFileType fileType: languageFileTypes) {
for(VirtualFile virtualFile : FileBasedIndex.getInstance().getContainingFiles(FileTypeIndex.NAME, fileType, GlobalSearchScope.allScope(project))) {
if(!uniqueVirtualFiles.contains(virtualFile)) {
uniqueVirtualFiles.add(virtualFile);
// try to get /templates/frontend/...
String path = virtualFile.toString();
int i = path.lastIndexOf("/templates/");
if(i > 0) {
String frontendName = path.substring(i + "/templates/".length());
attachTemplates(virtualFile, frontendName, smartyTemplateVisitor);
} else if (themes.size() > 0) {
// sw5: check if file is somewhere inside a theme folder
for(VirtualFile themeDir: themes) {
if(VfsUtil.isAncestor(themeDir, virtualFile, false)) {
String relativePath = VfsUtil.getRelativePath(virtualFile, themeDir, '/');
if(relativePath != null) {
// we are too lazy prepend path name to simulate old behavior:
// "Bare/frontend/campaign"
attachTemplates(virtualFile, themeDir.getName() + "/" + relativePath, smartyTemplateVisitor);
}
}
}
}
}
}
}
// wooh... not a full project, so skip it
// shopware is in lib only condition
final VirtualFile templateDir = VfsUtil.findRelativeFile("templates", project.getBaseDir());
if(templateDir == null) {
return;
}
// collect on project template dir
VfsUtil.visitChildrenRecursively(templateDir, new VirtualFileVisitor() {
@Override
public boolean visitFile(@NotNull VirtualFile virtualFile) {
if(uniqueVirtualFiles.contains(virtualFile)) {
return true;
}
uniqueVirtualFiles.add(virtualFile);
if(!isValidTemplateFile(virtualFile, exts)) {
return true;
}
String frontendName = VfsUtil.getRelativePath(virtualFile, templateDir, '/');
if(frontendName == null) {
return true;
}
attachTemplates(virtualFile, frontendName, smartyTemplateVisitor);
return true;
}
});
}
private static boolean attachTemplates(VirtualFile virtualFile, String frontendName, SmartyTemplateVisitor smartyTemplateVisitor) {
String[] pathSplits = StringUtils.split(frontendName, "/");
if(pathSplits.length < 2 || (!"frontend".equals(pathSplits[1]) && !"backend".equals(pathSplits[1])) && !"widgets".equals(pathSplits[1])) {
return true;
}
int i = frontendName.indexOf("/");
if(i == -1) {
return true;
}
int n = pathSplits.length-1;
String[] newArray = new String[n];
System.arraycopy(pathSplits, 1, newArray, 0, n);
String fileName = StringUtils.join(newArray, "/");
smartyTemplateVisitor.visitFile(virtualFile, fileName);
return false;
}
private static void collectPluginTemplates(Project project, final SmartyTemplateVisitor smartyTemplateVisitor, final List<String> exts) {
Collection<PhpClass> phpClasses = PhpIndex.getInstance(project).getAllSubclasses("\\Shopware_Components_Plugin_Bootstrap");
for(PhpClass phpClass: phpClasses) {
PsiDirectory psiDirectory = phpClass.getContainingFile().getContainingDirectory();
final VirtualFile virtualViewDir = VfsUtil.findRelativeFile("Views", psiDirectory.getVirtualFile());
if(virtualViewDir != null) {
VfsUtil.visitChildrenRecursively(virtualViewDir, new VirtualFileVisitor() {
@Override
public boolean visitFile(@NotNull VirtualFile file) {
if(!isValidTemplateFile(file, exts)) {
return true;
}
String frontendName = VfsUtil.getRelativePath(file, virtualViewDir, '/');
if(frontendName == null) {
return true;
}
smartyTemplateVisitor.visitFile(file, frontendName);
return true;
}
});
}
}
Collection<PhpClass> newPluginPhpClasses = PhpIndex.getInstance(project).getAllSubclasses("\\Shopware\\Components\\Plugin");
for(PhpClass phpClass: newPluginPhpClasses) {
PsiDirectory psiDirectory = phpClass.getContainingFile().getContainingDirectory();
final VirtualFile virtualViewDir = VfsUtil.findRelativeFile("Resources/views", psiDirectory.getVirtualFile());
if(virtualViewDir != null) {
VfsUtil.visitChildrenRecursively(virtualViewDir, new VirtualFileVisitor() {
@Override
public boolean visitFile(@NotNull VirtualFile file) {
if(!isValidTemplateFile(file, exts)) {
return true;
}
String frontendName = VfsUtil.getRelativePath(file, virtualViewDir, '/');
if(frontendName == null) {
return true;
}
smartyTemplateVisitor.visitFile(file, frontendName);
return true;
}
});
}
}
}
private static boolean isValidTemplateFile(VirtualFile virtualFile, List<String> extensions) {
if(virtualFile.isDirectory()) {
return false;
}
String filename = virtualFile.getName();
for(String ext: extensions) {
if(filename.toLowerCase().endsWith(ext.toLowerCase())) {
return true;
}
}
return false;
}
public interface SmartyTemplateVisitor {
void visitFile(VirtualFile virtualFile, String fileName);
}
public static abstract class SmartyTemplatePreventSelfVisitor implements SmartyTemplateVisitor {
final VirtualFile virtualFile;
public SmartyTemplatePreventSelfVisitor(VirtualFile virtualFile) {
this.virtualFile = virtualFile;
}
public void visitFile(VirtualFile virtualFile, String fileName) {
if(!this.virtualFile.equals(virtualFile)) {
visitNonSelfFile(virtualFile, fileName);
}
}
abstract public void visitNonSelfFile(VirtualFile virtualFile, String fileName);
}
public static boolean isExtendsTemplate(PsiFile psiFile) {
for(SmartyTag smartyTag: PsiTreeUtil.getChildrenOfTypeAsList(psiFile, SmartyTag.class)) {
if("extends".equals(smartyTag.getName())) {
return true;
}
}
return false;
}
@Nullable
public static String getTemplateName(@NotNull Project project, @NotNull VirtualFile virtualFile) {
return getTemplateName(project, virtualFile, "frontend", "backend", "widgets");
}
/**
* Find on Theme.php scope: "foo/Theme.php" => "frontend/plugins/payment/sepa"
* Find on Plugin.php scope: "foo/Plugin.php" => "Resources/views/frontend/plugins/payment/sepa"
*/
@Nullable
public static String getTemplateNameViaPath(@NotNull Project project, @NotNull VirtualFile virtualFile) {
String fileNamespaceViaPath = SnippetUtil.getFileNamespaceViaPath(project, virtualFile);
return fileNamespaceViaPath != null
? fileNamespaceViaPath + "." + virtualFile.getExtension()
: null;
}
@Nullable
public static String getTemplateName(@NotNull Project project, @NotNull VirtualFile virtualFile, @NotNull String... modules) {
String templateNameViaPath = getTemplateNameViaPath(project, virtualFile);
if (templateNameViaPath != null) {
return templateNameViaPath;
}
// Shopware <= 5.1 "/templates/[emotion_black]/frontend"
VirtualFile baseDir = project.getBaseDir();
if (baseDir == null) {
return null;
}
String frontendName = VfsUtil.getRelativePath(virtualFile, baseDir, '/');
if(frontendName == null) {
// search for possible indexed files
String path = virtualFile.toString();
int i = path.lastIndexOf("/templates/");
if(i == -1) {
return null;
}
frontendName = path.substring(i + "/templates/".length());
}
// find "frontend" or any other given module inside the path
for(String module: modules) {
int i = frontendName.indexOf(module);
if(i > 0) {
return frontendName.substring(i);
}
}
return null;
}
public static String cleanTemplateName(String templateName) {
if(templateName.startsWith("parent:")) {
templateName = templateName.substring("parent:".length());
}
if(templateName.startsWith("./")) {
templateName = templateName.substring("./".length());
}
return templateName;
}
/**
* {tag attribute="foobar"}{/s}
*/
@Nullable
public static PsiElement getTagAttributeByName(@NotNull SmartyTag tag, @NotNull String attribute) {
return ContainerUtil.find(YamlHelper.getChildrenFix(tag), psiElement ->
SmartyPattern.getAttributeKeyPattern().accepts(psiElement) && attribute.equals(psiElement.getText())
);
}
/**
* {tag attribute="foobar"}{/s}
*/
@Nullable
public static String getTagAttributeValueByName(@NotNull SmartyTag tag, @NotNull String attribute) {
PsiElement psiAttribute = getTagAttributeByName(tag, attribute);
if(psiAttribute == null) {
return null;
}
PsiElement nextSibling = PhpPsiUtil.getNextSibling(psiAttribute, (Condition<PsiElement>) psiElement -> {
IElementType elementType = psiElement.getNode().getElementType();
return psiElement instanceof PsiWhiteSpace ||
elementType == SmartyTokenTypes.EQ ||
elementType == SmartyTokenTypes.DOUBLE_QUOTE ||
elementType == SmartyTokenTypes.SINGLE_QUOTE;
});
if(nextSibling == null) {
return null;
}
String text = nextSibling.getText();
if(StringUtils.isNotBlank(text)) {
return text;
}
return null;
}
/**
* Find snippet namespace by tag scope and with file scope fallback
*
* {s namespace="foobar"}
* {namespace="foobar"}
*/
@Nullable
public static String getSnippetNamespaceByScope(@NotNull SmartyTag smartyTag) {
String namespace = TemplateUtil.getTagAttributeValueByName(smartyTag, "namespace");
if(namespace != null) {
return namespace;
}
PsiFile containingFile = smartyTag.getContainingFile();
if(containingFile instanceof SmartyFile) {
return SnippetUtil.getFileNamespace((SmartyFile) containingFile);
}
return null;
}
public static String findControllerModuleFromTagContext(@NotNull PsiElement psiElement) {
String module = null;
PsiElement smartyTag = psiElement.getParent();
if (smartyTag instanceof SmartyTag) {
String moduleValue = TemplateUtil.getTagAttributeValueByName((SmartyTag) smartyTag, "module");
if (StringUtils.isNotBlank(moduleValue)) {
module = moduleValue;
}
}
return module != null ? module : "Widgets";
}
}
|
{
"url": "https://www.programcreek.com/java-api-examples/?code=Haehnchen%2Fidea-php-shopware-plugin%2Fidea-php-shopware-plugin-master%2Fsrc%2Fmain%2Fjava%2Fde%2Fespend%2Fidea%2Fshopware%2Futil%2FTemplateUtil.java",
"source_domain": "www.programcreek.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "116865",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNQNEXZ3323WU6KWL3YTWRFOFNSWSGZI",
"WARC-Concurrent-To": "<urn:uuid:e90eb46f-b2ee-4bcf-a5c7-1a1821ce542a>",
"WARC-Date": "2022-07-04T16:03:52Z",
"WARC-IP-Address": "104.26.6.70",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KLV52E5DZLDWS2VNSXQIGU3GQVHC5CVF",
"WARC-Record-ID": "<urn:uuid:3ce226d8-fabe-4a7c-bff5-21f97f7dad75>",
"WARC-Target-URI": "https://www.programcreek.com/java-api-examples/?code=Haehnchen%2Fidea-php-shopware-plugin%2Fidea-php-shopware-plugin-master%2Fsrc%2Fmain%2Fjava%2Fde%2Fespend%2Fidea%2Fshopware%2Futil%2FTemplateUtil.java",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:344891f7-e288-4332-acee-a3105735bbfc>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\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,
100,
156,
201,
245,
286,
331,
383,
421,
457,
490,
529,
575,
625,
668,
710,
761,
811,
846,
892,
945,
985,
1029,
1080,
1128,
1193,
1237,
1279,
1322,
1323,
1343,
1344,
1348,
1398,
1402,
1430,
1431,
1531,
1592,
1598,
1599,
1727,
1728,
1789,
1861,
1862,
1932,
1933,
1998,
2068,
2069,
2104,
2164,
2174,
2175,
2209,
2280,
2290,
2291,
2340,
2391,
2505,
2581,
2614,
2667,
2681,
2691,
2692,
2752,
2912,
2976,
3033,
3034,
3092,
3150,
3211,
3243,
3333,
3424,
3476,
3477,
3558,
3618,
3701,
3808,
3867,
3966,
4030,
4160,
4194,
4195,
4225,
4251,
4252,
4274,
4292,
4306,
4316,
4317,
4367,
4412,
4513,
4547,
4567,
4577,
4578,
4621,
4702,
4724,
4797,
4798,
4861,
4894,
4912,
4913,
4966,
4967,
5029,
5062,
5080,
5081,
5175,
5218,
5251,
5269,
5270,
5353,
5354,
5383,
5397,
5409,
5415,
5416,
5552,
5553,
5621,
5768,
5793,
5803,
5804,
5847,
5869,
5894,
5904,
5905,
5942,
5985,
6042,
6043,
6102,
6166,
6167,
6189,
6195,
6196,
6338,
6470,
6515,
6516,
6611,
6724,
6765,
6857,
6887,
6961,
6962,
7025,
7066,
7092,
7093,
7191,
7242,
7283,
7309,
7310,
7387,
7388,
7425,
7447,
7467,
7481,
7491,
7492,
7625,
7679,
7680,
7775,
7898,
7939,
8031,
8061,
8135,
8136,
8199,
8240,
8266,
8267,
8365,
8416,
8457,
8483,
8484,
8561,
8562,
8599,
8621,
8641,
8655,
8665,
8671,
8672,
8771,
8772,
8812,
8838,
8848,
8897,
8935,
9004,
9033,
9047,
9057,
9058,
9080,
9086,
9087,
9132,
9198,
9204,
9205,
9306,
9307,
9346,
9347,
9422,
9466,
9476,
9477,
9551,
9607,
9664,
9678,
9688,
9689,
9778,
9784,
9785,
9848,
9849,
9947,
10003,
10032,
10046,
10056,
10057,
10079,
10085,
10086,
10100,
10203,
10291,
10297,
10298,
10306,
10389,
10490,
10498,
10512,
10622,
10719,
10720,
10764,
10834,
10854,
10860,
10861,
10875,
11006,
11089,
11132,
11172,
11182,
11183,
11248,
11300,
11331,
11356,
11366,
11367,
11449,
11484,
11533,
11583,
11636,
11662,
11691,
11705,
11706,
11777,
11787,
11788,
11857,
11895,
11945,
11969,
12019,
12033,
12043,
12044,
12065,
12071,
12072,
12138,
12139,
12188,
12259,
12269,
12270,
12314,
12380,
12390,
12391,
12420,
12426,
12427,
12435,
12471,
12479,
12493,
12597,
12677,
12790,
12801,
12807,
12808,
12816,
12852,
12860,
12874,
12979,
13052,
13087,
13112,
13122,
13123,
13236,
13314,
13315,
13373,
13427,
13491,
13553,
13565,
13566,
13600,
13625,
13635,
13636,
13681,
13724,
13749,
13759,
13760,
13781,
13787,
13788,
13796,
13868,
13875,
13905,
13933,
13941,
13955,
14039,
14131,
14163,
14193,
14203,
14204,
14268,
14319,
14397,
14407,
14408,
14429,
14435,
14436,
14530,
14560,
14615,
14661,
14768,
14823,
14861,
14875,
14885,
14886,
14938,
14944
],
"line_end_idx": [
38,
39,
100,
156,
201,
245,
286,
331,
383,
421,
457,
490,
529,
575,
625,
668,
710,
761,
811,
846,
892,
945,
985,
1029,
1080,
1128,
1193,
1237,
1279,
1322,
1323,
1343,
1344,
1348,
1398,
1402,
1430,
1431,
1531,
1592,
1598,
1599,
1727,
1728,
1789,
1861,
1862,
1932,
1933,
1998,
2068,
2069,
2104,
2164,
2174,
2175,
2209,
2280,
2290,
2291,
2340,
2391,
2505,
2581,
2614,
2667,
2681,
2691,
2692,
2752,
2912,
2976,
3033,
3034,
3092,
3150,
3211,
3243,
3333,
3424,
3476,
3477,
3558,
3618,
3701,
3808,
3867,
3966,
4030,
4160,
4194,
4195,
4225,
4251,
4252,
4274,
4292,
4306,
4316,
4317,
4367,
4412,
4513,
4547,
4567,
4577,
4578,
4621,
4702,
4724,
4797,
4798,
4861,
4894,
4912,
4913,
4966,
4967,
5029,
5062,
5080,
5081,
5175,
5218,
5251,
5269,
5270,
5353,
5354,
5383,
5397,
5409,
5415,
5416,
5552,
5553,
5621,
5768,
5793,
5803,
5804,
5847,
5869,
5894,
5904,
5905,
5942,
5985,
6042,
6043,
6102,
6166,
6167,
6189,
6195,
6196,
6338,
6470,
6515,
6516,
6611,
6724,
6765,
6857,
6887,
6961,
6962,
7025,
7066,
7092,
7093,
7191,
7242,
7283,
7309,
7310,
7387,
7388,
7425,
7447,
7467,
7481,
7491,
7492,
7625,
7679,
7680,
7775,
7898,
7939,
8031,
8061,
8135,
8136,
8199,
8240,
8266,
8267,
8365,
8416,
8457,
8483,
8484,
8561,
8562,
8599,
8621,
8641,
8655,
8665,
8671,
8672,
8771,
8772,
8812,
8838,
8848,
8897,
8935,
9004,
9033,
9047,
9057,
9058,
9080,
9086,
9087,
9132,
9198,
9204,
9205,
9306,
9307,
9346,
9347,
9422,
9466,
9476,
9477,
9551,
9607,
9664,
9678,
9688,
9689,
9778,
9784,
9785,
9848,
9849,
9947,
10003,
10032,
10046,
10056,
10057,
10079,
10085,
10086,
10100,
10203,
10291,
10297,
10298,
10306,
10389,
10490,
10498,
10512,
10622,
10719,
10720,
10764,
10834,
10854,
10860,
10861,
10875,
11006,
11089,
11132,
11172,
11182,
11183,
11248,
11300,
11331,
11356,
11366,
11367,
11449,
11484,
11533,
11583,
11636,
11662,
11691,
11705,
11706,
11777,
11787,
11788,
11857,
11895,
11945,
11969,
12019,
12033,
12043,
12044,
12065,
12071,
12072,
12138,
12139,
12188,
12259,
12269,
12270,
12314,
12380,
12390,
12391,
12420,
12426,
12427,
12435,
12471,
12479,
12493,
12597,
12677,
12790,
12801,
12807,
12808,
12816,
12852,
12860,
12874,
12979,
13052,
13087,
13112,
13122,
13123,
13236,
13314,
13315,
13373,
13427,
13491,
13553,
13565,
13566,
13600,
13625,
13635,
13636,
13681,
13724,
13749,
13759,
13760,
13781,
13787,
13788,
13796,
13868,
13875,
13905,
13933,
13941,
13955,
14039,
14131,
14163,
14193,
14203,
14204,
14268,
14319,
14397,
14407,
14408,
14429,
14435,
14436,
14530,
14560,
14615,
14661,
14768,
14823,
14861,
14875,
14885,
14886,
14938,
14944,
14945
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14945,
"ccnet_original_nlines": 400,
"rps_doc_curly_bracket": 0.010572100058197975,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06385870277881622,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0027173899579793215,
"rps_doc_frac_lines_end_with_ellipsis": 0.002493770094588399,
"rps_doc_frac_no_alph_words": 0.48143115639686584,
"rps_doc_frac_unique_words": 0.4058355391025543,
"rps_doc_mean_word_length": 12.084880828857422,
"rps_doc_num_sentences": 254,
"rps_doc_symbol_to_word_ratio": 0.0018115900456905365,
"rps_doc_unigram_entropy": 5.084104061126709,
"rps_doc_word_count": 754,
"rps_doc_frac_chars_dupe_10grams": 0.09569797664880753,
"rps_doc_frac_chars_dupe_5grams": 0.19984635710716248,
"rps_doc_frac_chars_dupe_6grams": 0.1386084258556366,
"rps_doc_frac_chars_dupe_7grams": 0.11643985658884048,
"rps_doc_frac_chars_dupe_8grams": 0.09569797664880753,
"rps_doc_frac_chars_dupe_9grams": 0.09569797664880753,
"rps_doc_frac_chars_top_2gram": 0.015364349819719791,
"rps_doc_frac_chars_top_3gram": 0.013827919960021973,
"rps_doc_frac_chars_top_4gram": 0.014266899786889553,
"rps_doc_books_importance": -660.7701416015625,
"rps_doc_books_importance_length_correction": -660.7701416015625,
"rps_doc_openwebtext_importance": -438.63067626953125,
"rps_doc_openwebtext_importance_length_correction": -438.63067626953125,
"rps_doc_wikipedia_importance": -342.49688720703125,
"rps_doc_wikipedia_importance_length_correction": -342.49688720703125
},
"fasttext": {
"dclm": 0.9996299743652344,
"english": 0.18747594952583313,
"fineweb_edu_approx": 2.739896535873413,
"eai_general_math": 0.8104615807533264,
"eai_open_web_math": 0.018342019990086555,
"eai_web_code": 0.9195101261138916
}
}
|
{
"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": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-35,283,097,968,273,516 |
LinuxQuestions.org
Help answer threads with 0 replies.
Go Back LinuxQuestions.org > Blogs > replica9000
User Name
Password
Notices
Rate this Entry
Windows VS Linux
Posted 06-09-2009 at 11:49 PM by replica9000
Why is it so many people still use Windows? Why not linux?
Linux is free! Plus it's nice that I can have a nicely featured, not bloated, up-to-date system installed in ten minutes with Linux.
Or, I can run to the store, shell out too much cash for a Windows OS, hope I bought the right version that suits my needs, wait almost an hour for it to install, then have to install all of the drivers, reboot the computer countless times. Then buy a bunch more software to make Windows useful.
Is it just because people fear change? Or are they just too lazy to try something new?
Posted in Uncategorized
Views 1370 Comments 2
« Prev Main Next »
Total Comments 2
Comments
1. Old Comment
Quote:
Why is it so many people still use Windows? Why not linux?
Probably because they're not aware of any alternative, or even interested. It's a question that's been asked many times on these forums. The "average user" buys a computer just for surfing, emails, etc - and there's an over 90% chance Windows is preinstalled.
Posted 06-10-2009 at 11:40 AM by brianL brianL is offline
2. Old Comment
why do people watch soap operas?
or fight wars over religion?
Posted 06-10-2009 at 06:16 PM by bigearsbilly bigearsbilly is offline
All times are GMT -5. The time now is 11:54 AM.
Main Menu
Advertisement
Advertisement
My LQ
Write for LQ
LinuxQuestions.org is looking for people interested in writing Editorials, Articles, Reviews, and more. If you'd like to contribute content, let us know.
Main Menu
Syndicate
RSS1 Latest Threads
RSS1 LQ News
Twitter: @linuxquestions
Facebook: linuxquestions Google+: linuxquestions
Open Source Consulting | Domain Registration
|
{
"url": "http://www.linuxquestions.org/questions/blog/replica9000-280570/windows-vs-linux-2027/",
"source_domain": "www.linuxquestions.org",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "52434",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QF2W53RH66CDFV6FEQWDOABDL4MFWZ42",
"WARC-Concurrent-To": "<urn:uuid:f140db04-d403-43a4-a479-6dfa7031afa9>",
"WARC-Date": "2016-07-28T16:54:28Z",
"WARC-IP-Address": "75.126.162.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OHSFDZDWXQXRRBIP7OOKSC7LZZ4FEFVT",
"WARC-Record-ID": "<urn:uuid:3f419127-0c9d-4339-8fe9-26594b3db221>",
"WARC-Target-URI": "http://www.linuxquestions.org/questions/blog/replica9000-280570/windows-vs-linux-2027/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:757a5630-1262-454e-9e98-f95ae5106fe0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 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,
19,
55,
106,
116,
125,
126,
134,
135,
136,
152,
153,
170,
171,
216,
217,
276,
277,
410,
411,
706,
707,
794,
818,
840,
867,
884,
885,
894,
895,
912,
923,
986,
1250,
1312,
1329,
1366,
1399,
1473,
1475,
1476,
1479,
1480,
1481,
1482,
1530,
1531,
1541,
1555,
1569,
1575,
1588,
1742,
1752,
1762,
1783,
1797,
1822,
1871
],
"line_end_idx": [
19,
55,
106,
116,
125,
126,
134,
135,
136,
152,
153,
170,
171,
216,
217,
276,
277,
410,
411,
706,
707,
794,
818,
840,
867,
884,
885,
894,
895,
912,
923,
986,
1250,
1312,
1329,
1366,
1399,
1473,
1475,
1476,
1479,
1480,
1481,
1482,
1530,
1531,
1541,
1555,
1569,
1575,
1588,
1742,
1752,
1762,
1783,
1797,
1822,
1871,
1915
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1915,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3100000023841858,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03750000149011612,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24500000476837158,
"rps_doc_frac_unique_words": 0.6201298832893372,
"rps_doc_mean_word_length": 4.76298713684082,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0573859214782715,
"rps_doc_word_count": 308,
"rps_doc_frac_chars_dupe_10grams": 0.061349689960479736,
"rps_doc_frac_chars_dupe_5grams": 0.061349689960479736,
"rps_doc_frac_chars_dupe_6grams": 0.061349689960479736,
"rps_doc_frac_chars_dupe_7grams": 0.061349689960479736,
"rps_doc_frac_chars_dupe_8grams": 0.061349689960479736,
"rps_doc_frac_chars_dupe_9grams": 0.061349689960479736,
"rps_doc_frac_chars_top_2gram": 0.00817995984107256,
"rps_doc_frac_chars_top_3gram": 0.009543290361762047,
"rps_doc_frac_chars_top_4gram": 0.012269940227270126,
"rps_doc_books_importance": -204.3160400390625,
"rps_doc_books_importance_length_correction": -204.31600952148438,
"rps_doc_openwebtext_importance": -126.56067657470703,
"rps_doc_openwebtext_importance_length_correction": -126.56067657470703,
"rps_doc_wikipedia_importance": -112.10974884033203,
"rps_doc_wikipedia_importance_length_correction": -112.10974884033203
},
"fasttext": {
"dclm": 0.34845203161239624,
"english": 0.8916530609130859,
"fineweb_edu_approx": 1.395281195640564,
"eai_general_math": 0.00032568001188337803,
"eai_open_web_math": 0.13808363676071167,
"eai_web_code": -0.000008820000402920414
}
}
|
{
"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.02",
"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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,002,459,331,460,240,400 |
This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
5.004_56: Patch to Tie::Hash and docs
[perl5.git] / t / op / misc.t
1 #!./perl
2
3 # NOTE: Please don't add tests to this file unless they *need* to be run in
4 # separate executable and can't simply use eval.
5
6 chdir 't' if -d 't';
7 @INC = "../lib";
8 $ENV{PERL5LIB} = "../lib";
9
10 $|=1;
11
12 undef $/;
13 @prgs = split "\n########\n", <DATA>;
14 print "1..", scalar @prgs, "\n";
15
16 $tmpfile = "misctmp000";
17 1 while -f ++$tmpfile;
18 END { unlink $tmpfile if $tmpfile; }
19
20 $CAT = (($^O eq 'MSWin32') ? '.\perl -e "print <>"' : 'cat');
21
22 for (@prgs){
23 my $switch;
24 if (s/^\s*(-\w.*)//){
25 $switch = $1;
26 }
27 my($prog,$expected) = split(/\nEXPECT\n/, $_);
28 if ($^O eq 'MSWin32') {
29 open TEST, "| .\\perl -I../lib $switch >$tmpfile 2>&1";
30 }
31 else {
32 open TEST, "| sh -c './perl $switch' >$tmpfile 2>&1";
33 }
34 print TEST $prog, "\n";
35 close TEST;
36 $status = $?;
37 $results = `$CAT $tmpfile`;
38 $results =~ s/\n+$//;
39 $expected =~ s/\n+$//;
40 if ( $results ne $expected){
41 print STDERR "PROG: $switch\n$prog\n";
42 print STDERR "EXPECTED:\n$expected\n";
43 print STDERR "GOT:\n$results\n";
44 print "not ";
45 }
46 print "ok ", ++$i, "\n";
47 }
48
49 __END__
50 ()=()
51 ########
52 $a = ":="; split /($a)/o, "a:=b:=c"; print "@_"
53 EXPECT
54 a := b := c
55 ########
56 $cusp = ~0 ^ (~0 >> 1);
57 $, = " ";
58 print +($cusp - 1) % 8, $cusp % 8, -$cusp % 8, ($cusp + 1) % 8, "!\n";
59 EXPECT
60 7 0 0 1 !
61 ########
62 $foo=undef; $foo->go;
63 EXPECT
64 Can't call method "go" without a package or object reference at - line 1.
65 ########
66 BEGIN
67 {
68 "foo";
69 }
70 ########
71 $array[128]=1
72 ########
73 $x=0x0eabcd; print $x->ref;
74 EXPECT
75 Can't call method "ref" without a package or object reference at - line 1.
76 ########
77 chop ($str .= <STDIN>);
78 ########
79 close ($banana);
80 ########
81 $x=2;$y=3;$x<$y ? $x : $y += 23;print $x;
82 EXPECT
83 25
84 ########
85 eval {sub bar {print "In bar";}}
86 ########
87 system './perl -ne "print if eof" /dev/null'
88 ########
89 chop($file = <>);
90 ########
91 package N;
92 sub new {my ($obj,$n)=@_; bless \$n}
93 $aa=new N 1;
94 $aa=12345;
95 print $aa;
96 EXPECT
97 12345
98 ########
99 %@x=0;
100 EXPECT
101 Can't modify hash deref in repeat at - line 1, near "0;"
102 Execution of - aborted due to compilation errors.
103 ########
104 $_="foo";
105 printf(STDOUT "%s\n", $_);
106 EXPECT
107 foo
108 ########
109 push(@a, 1, 2, 3,)
110 ########
111 quotemeta ""
112 ########
113 for ("ABCDE") {
114 ⊂
115 s/./&sub($&)/eg;
116 print;}
117 sub sub {local($_) = @_;
118 $_ x 4;}
119 EXPECT
120 Modification of a read-only value attempted at - line 3.
121 ########
122 package FOO;sub new {bless {FOO => BAR}};
123 package main;
124 use strict vars;
125 my $self = new FOO;
126 print $$self{FOO};
127 EXPECT
128 BAR
129 ########
130 $_="foo";
131 s/.{1}//s;
132 print;
133 EXPECT
134 oo
135 ########
136 print scalar ("foo","bar")
137 EXPECT
138 bar
139 ########
140 sub by_number { $a <=> $b; };# inline function for sort below
141 $as_ary{0}="a0";
142 @ordered_array=sort by_number keys(%as_ary);
143 ########
144 sub NewShell
145 {
146 local($Host) = @_;
147 my($m2) = $#Shells++;
148 $Shells[$m2]{HOST} = $Host;
149 return $m2;
150 }
151
152 sub ShowShell
153 {
154 local($i) = @_;
155 }
156
157 &ShowShell(&NewShell(beach,Work,"+0+0"));
158 &ShowShell(&NewShell(beach,Work,"+0+0"));
159 &ShowShell(&NewShell(beach,Work,"+0+0"));
160 ########
161 {
162 package FAKEARRAY;
163
164 sub TIEARRAY
165 { print "TIEARRAY @_\n";
166 die "bomb out\n" unless $count ++ ;
167 bless ['foo']
168 }
169 sub FETCH { print "fetch @_\n"; $_[0]->[$_[1]] }
170 sub STORE { print "store @_\n"; $_[0]->[$_[1]] = $_[2] }
171 sub DESTROY { print "DESTROY \n"; undef @{$_[0]}; }
172 }
173
174 eval 'tie @h, FAKEARRAY, fred' ;
175 tie @h, FAKEARRAY, fred ;
176 EXPECT
177 TIEARRAY FAKEARRAY fred
178 TIEARRAY FAKEARRAY fred
179 DESTROY
180 ########
181 BEGIN { die "phooey\n" }
182 EXPECT
183 phooey
184 BEGIN failed--compilation aborted at - line 1.
185 ########
186 BEGIN { 1/$zero }
187 EXPECT
188 Illegal division by zero at - line 1.
189 BEGIN failed--compilation aborted at - line 1.
190 ########
191 BEGIN { undef = 0 }
192 EXPECT
193 Modification of a read-only value attempted at - line 1.
194 BEGIN failed--compilation aborted at - line 1.
195 ########
196 {
197 package foo;
198 sub PRINT {
199 shift;
200 print join(' ', reverse @_)."\n";
201 }
202 sub PRINTF {
203 shift;
204 my $fmt = shift;
205 print sprintf($fmt, @_)."\n";
206 }
207 sub TIEHANDLE {
208 bless {}, shift;
209 }
210 sub READLINE {
211 "Out of inspiration";
212 }
213 sub DESTROY {
214 print "and destroyed as well\n";
215 }
216 sub READ {
217 shift;
218 print STDOUT "foo->can(READ)(@_)\n";
219 return 100;
220 }
221 sub GETC {
222 shift;
223 print STDOUT "Don't GETC, Get Perl\n";
224 return "a";
225 }
226 }
227 {
228 local(*FOO);
229 tie(*FOO,'foo');
230 print FOO "sentence.", "reversed", "a", "is", "This";
231 print "-- ", <FOO>, " --\n";
232 my($buf,$len,$offset);
233 $buf = "string";
234 $len = 10; $offset = 1;
235 read(FOO, $buf, $len, $offset) == 100 or die "foo->READ failed";
236 getc(FOO) eq "a" or die "foo->GETC failed";
237 printf "%s is number %d\n", "Perl", 1;
238 }
239 EXPECT
240 This is a reversed sentence.
241 -- Out of inspiration --
242 foo->can(READ)(string 10 1)
243 Don't GETC, Get Perl
244 Perl is number 1
245 and destroyed as well
246 ########
247 my @a; $a[2] = 1; for (@a) { $_ = 2 } print "@a\n"
248 EXPECT
249 2 2 2
250 ########
251 @a = ($a, $b, $c, $d) = (5, 6);
252 print "ok\n"
253 if ($a[0] == 5 and $a[1] == 6 and !defined $a[2] and !defined $a[3]);
254 EXPECT
255 ok
256 ########
257 print "ok\n" if (1E2<<1 == 200 and 3E4<<3 == 240000);
258 EXPECT
259 ok
260 ########
261 print "ok\n" if ("\0" lt "\xFF");
262 EXPECT
263 ok
264 ########
265 open(H,'op/misc.t'); # must be in the 't' directory
266 stat(H);
267 print "ok\n" if (-e _ and -f _ and -r _);
268 EXPECT
269 ok
270 ########
271 sub thing { 0 || return qw(now is the time) }
272 print thing(), "\n";
273 EXPECT
274 nowisthetime
275 ########
276 $ren = 'joy';
277 $stimpy = 'happy';
278 { local $main::{ren} = *stimpy; print $ren, ' ' }
279 print $ren, "\n";
280 EXPECT
281 happy joy
282 ########
283 $stimpy = 'happy';
284 { local $main::{ren} = *stimpy; print ${'ren'}, ' ' }
285 print +(defined(${'ren'}) ? 'oops' : 'joy'), "\n";
286 EXPECT
287 happy joy
288 ########
289 package p;
290 sub func { print 'really ' unless wantarray; 'p' }
291 sub groovy { 'groovy' }
292 package main;
293 print p::func()->groovy(), "\n"
294 EXPECT
295 really groovy
296 ########
297 @list = ([ 'one', 1 ], [ 'two', 2 ]);
298 sub func { $num = shift; (grep $_->[1] == $num, @list)[0] }
299 print scalar(map &func($_), 1 .. 3), " ",
300 scalar(map scalar &func($_), 1 .. 3), "\n";
301 EXPECT
302 2 3
303 ########
304 ($k, $s) = qw(x 0);
305 @{$h{$k}} = qw(1 2 4);
306 for (@{$h{$k}}) { $s += $_; delete $h{$k} if ($_ == 2) }
307 print "bogus\n" unless $s == 7;
308 ########
309 my $a = 'outer';
310 eval q[ my $a = 'inner'; eval q[ print "$a " ] ];
311 eval { my $x = 'peace'; eval q[ print "$x\n" ] }
312 EXPECT
313 inner peace
314 ########
315 -w
316 $| = 1;
317 sub foo {
318 print "In foo1\n";
319 eval 'sub foo { print "In foo2\n" }';
320 print "Exiting foo1\n";
321 }
322 foo;
323 foo;
324 EXPECT
325 In foo1
326 Subroutine foo redefined at (eval 1) line 1.
327 Exiting foo1
328 In foo2
329 ########
330 $s = 0;
331 map {#this newline here tickles the bug
332 $s += $_} (1,2,4);
333 print "eat flaming death\n" unless ($s == 7);
334 ########
335 sub foo { local $_ = shift; split; @_ }
336 @x = foo(' x y z ');
337 print "you die joe!\n" unless "@x" eq 'x y z';
338 ########
339 /(?{"{"})/ # Check it outside of eval too
340 EXPECT
341 Sequence (?{...}) not terminated or not {}-balanced at - line 1, within pattern
342 /(?{"{"})/: Sequence (?{...}) not terminated or not {}-balanced at - line 1.
343 ########
344 /(?{"{"}})/ # Check it outside of eval too
345 EXPECT
346 Unmatched right bracket at (re_eval 1) line 1, at end of line
347 syntax error at (re_eval 1) line 1, near ""{"}"
348 Compilation failed in regexp at - line 1.
349 ########
350 BEGIN { @ARGV = qw(a b c) }
351 BEGIN { print "argv <@ARGV>\nbegin <",shift,">\n" }
352 END { print "end <",shift,">\nargv <@ARGV>\n" }
353 INIT { print "init <",shift,">\n" }
354 EXPECT
355 argv <a b c>
356 begin <a>
357 init <b>
358 end <c>
359 argv <>
|
{
"url": "https://perl5.git.perl.org/perl5.git/blob/cc6b73957505a73b130c87add7bf3d534f129041:/t/op/misc.t",
"source_domain": "perl5.git.perl.org",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "71132",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UTUTEHFYORVKMK3ETMCIAET46FLPHG2T",
"WARC-Concurrent-To": "<urn:uuid:c921ff07-c63e-4b2b-80b7-e97c31966e6a>",
"WARC-Date": "2021-06-16T02:36:05Z",
"WARC-IP-Address": "188.166.18.220",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:W5CXETCV5BO4SHWL7NHAHUH2AC26D3F5",
"WARC-Record-ID": "<urn:uuid:8ce04855-86fa-490a-903d-09db15c007d2>",
"WARC-Target-URI": "https://perl5.git.perl.org/perl5.git/blob/cc6b73957505a73b130c87add7bf3d534f129041:/t/op/misc.t",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc0471b9-d8b6-44d5-8825-a84d6c479b9c>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-242.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,
98,
136,
166,
177,
179,
257,
308,
310,
333,
352,
381,
383,
392,
395,
408,
449,
485,
488,
516,
542,
582,
585,
650,
653,
669,
688,
717,
742,
751,
805,
836,
901,
910,
924,
987,
996,
1027,
1046,
1067,
1102,
1131,
1161,
1197,
1247,
1297,
1341,
1366,
1375,
1407,
1412,
1415,
1426,
1435,
1447,
1498,
1508,
1523,
1535,
1562,
1575,
1649,
1659,
1672,
1684,
1709,
1719,
1796,
1808,
1817,
1830,
1852,
1865,
1877,
1894,
1906,
1937,
1947,
2025,
2037,
2064,
2076,
2096,
2108,
2153,
2163,
2169,
2181,
2217,
2229,
2277,
2289,
2310,
2322,
2336,
2378,
2394,
2408,
2422,
2432,
2441,
2453,
2463,
2474,
2535,
2589,
2602,
2616,
2647,
2658,
2666,
2679,
2702,
2715,
2732,
2745,
2765,
2776,
2797,
2809,
2838,
2851,
2862,
2923,
2936,
2982,
3000,
3024,
3048,
3071,
3082,
3090,
3103,
3117,
3132,
3143,
3154,
3161,
3174,
3205,
3216,
3224,
3237,
3303,
3324,
3373,
3386,
3403,
3409,
3434,
3462,
3496,
3514,
3520,
3526,
3544,
3550,
3572,
3578,
3584,
3630,
3676,
3722,
3735,
3744,
3774,
3782,
3806,
3843,
3892,
3920,
3933,
3993,
4061,
4124,
4133,
4141,
4178,
4208,
4219,
4247,
4275,
4288,
4301,
4330,
4341,
4352,
4403,
4416,
4438,
4449,
4491,
4542,
4555,
4579,
4590,
4651,
4702,
4715,
4721,
4742,
4762,
4781,
4827,
4837,
4858,
4877,
4908,
4950,
4960,
4984,
5013,
5023,
5046,
5080,
5090,
5112,
5157,
5165,
5182,
5199,
5246,
5269,
5277,
5294,
5311,
5360,
5383,
5395,
5401,
5407,
5428,
5453,
5515,
5552,
5583,
5608,
5640,
5713,
5765,
5812,
5818,
5829,
5862,
5891,
5923,
5948,
5969,
5995,
6008,
6063,
6074,
6084,
6097,
6133,
6150,
6226,
6237,
6244,
6257,
6315,
6326,
6333,
6346,
6384,
6395,
6402,
6415,
6471,
6484,
6530,
6541,
6548,
6561,
6611,
6636,
6647,
6664,
6677,
6695,
6718,
6772,
6794,
6805,
6819,
6832,
6855,
6913,
6968,
6979,
6993,
7006,
7021,
7076,
7104,
7122,
7158,
7169,
7187,
7200,
7242,
7306,
7352,
7406,
7417,
7425,
7438,
7463,
7490,
7551,
7587,
7600,
7621,
7675,
7728,
7739,
7755,
7768,
7775,
7787,
7801,
7828,
7874,
7906,
7912,
7921,
7930,
7941,
7953,
8002,
8019,
8031,
8044,
8056,
8100,
8123,
8173,
8186,
8230,
8257,
8308,
8321,
8372,
8383,
8467,
8548,
8561,
8612,
8623,
8689,
8741,
8787,
8800,
8832,
8888,
8940,
8980,
8991,
9008,
9022,
9035,
9047
],
"line_end_idx": [
98,
136,
166,
177,
179,
257,
308,
310,
333,
352,
381,
383,
392,
395,
408,
449,
485,
488,
516,
542,
582,
585,
650,
653,
669,
688,
717,
742,
751,
805,
836,
901,
910,
924,
987,
996,
1027,
1046,
1067,
1102,
1131,
1161,
1197,
1247,
1297,
1341,
1366,
1375,
1407,
1412,
1415,
1426,
1435,
1447,
1498,
1508,
1523,
1535,
1562,
1575,
1649,
1659,
1672,
1684,
1709,
1719,
1796,
1808,
1817,
1830,
1852,
1865,
1877,
1894,
1906,
1937,
1947,
2025,
2037,
2064,
2076,
2096,
2108,
2153,
2163,
2169,
2181,
2217,
2229,
2277,
2289,
2310,
2322,
2336,
2378,
2394,
2408,
2422,
2432,
2441,
2453,
2463,
2474,
2535,
2589,
2602,
2616,
2647,
2658,
2666,
2679,
2702,
2715,
2732,
2745,
2765,
2776,
2797,
2809,
2838,
2851,
2862,
2923,
2936,
2982,
3000,
3024,
3048,
3071,
3082,
3090,
3103,
3117,
3132,
3143,
3154,
3161,
3174,
3205,
3216,
3224,
3237,
3303,
3324,
3373,
3386,
3403,
3409,
3434,
3462,
3496,
3514,
3520,
3526,
3544,
3550,
3572,
3578,
3584,
3630,
3676,
3722,
3735,
3744,
3774,
3782,
3806,
3843,
3892,
3920,
3933,
3993,
4061,
4124,
4133,
4141,
4178,
4208,
4219,
4247,
4275,
4288,
4301,
4330,
4341,
4352,
4403,
4416,
4438,
4449,
4491,
4542,
4555,
4579,
4590,
4651,
4702,
4715,
4721,
4742,
4762,
4781,
4827,
4837,
4858,
4877,
4908,
4950,
4960,
4984,
5013,
5023,
5046,
5080,
5090,
5112,
5157,
5165,
5182,
5199,
5246,
5269,
5277,
5294,
5311,
5360,
5383,
5395,
5401,
5407,
5428,
5453,
5515,
5552,
5583,
5608,
5640,
5713,
5765,
5812,
5818,
5829,
5862,
5891,
5923,
5948,
5969,
5995,
6008,
6063,
6074,
6084,
6097,
6133,
6150,
6226,
6237,
6244,
6257,
6315,
6326,
6333,
6346,
6384,
6395,
6402,
6415,
6471,
6484,
6530,
6541,
6548,
6561,
6611,
6636,
6647,
6664,
6677,
6695,
6718,
6772,
6794,
6805,
6819,
6832,
6855,
6913,
6968,
6979,
6993,
7006,
7021,
7076,
7104,
7122,
7158,
7169,
7187,
7200,
7242,
7306,
7352,
7406,
7417,
7425,
7438,
7463,
7490,
7551,
7587,
7600,
7621,
7675,
7728,
7739,
7755,
7768,
7775,
7787,
7801,
7828,
7874,
7906,
7912,
7921,
7930,
7941,
7953,
8002,
8019,
8031,
8044,
8056,
8100,
8123,
8173,
8186,
8230,
8257,
8308,
8321,
8372,
8383,
8467,
8548,
8561,
8612,
8623,
8689,
8741,
8787,
8800,
8832,
8888,
8940,
8980,
8991,
9008,
9022,
9035,
9047,
9058
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9058,
"ccnet_original_nlines": 361,
"rps_doc_curly_bracket": 0.017001550644636154,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14252516627311707,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04608830064535141,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6146398186683655,
"rps_doc_frac_unique_words": 0.5324675440788269,
"rps_doc_mean_word_length": 3.8258211612701416,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0.14988380670547485,
"rps_doc_unigram_entropy": 5.978405952453613,
"rps_doc_word_count": 1309,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09584665298461914,
"rps_doc_frac_chars_dupe_6grams": 0.07987219840288162,
"rps_doc_frac_chars_dupe_7grams": 0.04912140965461731,
"rps_doc_frac_chars_dupe_8grams": 0.04912140965461731,
"rps_doc_frac_chars_dupe_9grams": 0.03194887936115265,
"rps_doc_frac_chars_top_2gram": 0.013977640308439732,
"rps_doc_frac_chars_top_3gram": 0.015375399962067604,
"rps_doc_frac_chars_top_4gram": 0.018570290878415108,
"rps_doc_books_importance": -1040.1104736328125,
"rps_doc_books_importance_length_correction": -1040.1104736328125,
"rps_doc_openwebtext_importance": -661.4286499023438,
"rps_doc_openwebtext_importance_length_correction": -661.4286499023438,
"rps_doc_wikipedia_importance": -447.06915283203125,
"rps_doc_wikipedia_importance_length_correction": -447.06915283203125
},
"fasttext": {
"dclm": 0.15431219339370728,
"english": 0.02050020918250084,
"fineweb_edu_approx": 1.395655870437622,
"eai_general_math": 0.08394306898117065,
"eai_open_web_math": 0.17790675163269043,
"eai_web_code": 0.4668251872062683
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,213,934,480,208,398,300 |
What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 149 Stack Exchange communities.
Note: I know about the other bug marked duplicate, but this one is different.
I was about to edit an answer to fix url syntax, but noticed that it was correct. Preview thinks it is correct, but there's no ref in the answer. The answer I was going to edit is http://stackoverflow.com/a/4262450/1045994
share|improve this question
1 Answer 1
up vote 6 down vote accepted
That's because this answer was posted before I made this change, and so its HTML was still created under the old rules, where a URL directly following an opening parenthesis would not be auto-linked. I have made a non-edit to the answer (just added a newline) to force re-rendering the answer with the new rules, and now the URLs are links.
share|improve this answer
Ahh ok, cool thanks for answering. – mmlb Feb 3 '13 at 4:08
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "http://meta.stackexchange.com/questions/165998/link-in-answer-editor-appears-correctly-in-preview-but-not-in-the-answer/166000",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "61813",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WQVHPCH22CVNQDZ7N6Q7SBVKXFOYKMLN",
"WARC-Concurrent-To": "<urn:uuid:63b82efc-ebeb-4cd7-b6a1-fb98ccab5f3f>",
"WARC-Date": "2015-08-04T08:03:08Z",
"WARC-IP-Address": "104.16.16.128",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7S2TV4TX5JGXGMXGHPUNNW3TNLLO74PN",
"WARC-Record-ID": "<urn:uuid:6b088ffd-94c3-4911-a2fa-019375419012>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/165998/link-in-answer-editor-appears-correctly-in-preview-but-not-in-the-answer/166000",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:02139c9f-bc3e-464a-8b1f-a800810ea641>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\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,
16,
173,
174,
252,
253,
476,
477,
505,
506,
517,
518,
547,
548,
889,
890,
916,
921,
982,
983,
1024,
1025
],
"line_end_idx": [
16,
173,
174,
252,
253,
476,
477,
505,
506,
517,
518,
547,
548,
889,
890,
916,
921,
982,
983,
1024,
1025,
1091
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1091,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40585774183273315,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029288699850440025,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2092050164937973,
"rps_doc_frac_unique_words": 0.6363636255264282,
"rps_doc_mean_word_length": 4.540106773376465,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.524796485900879,
"rps_doc_word_count": 187,
"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.05300353094935417,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -82.2221450805664,
"rps_doc_books_importance_length_correction": -82.2221450805664,
"rps_doc_openwebtext_importance": -51.37881851196289,
"rps_doc_openwebtext_importance_length_correction": -41.697757720947266,
"rps_doc_wikipedia_importance": -39.664466857910156,
"rps_doc_wikipedia_importance_length_correction": -39.664466857910156
},
"fasttext": {
"dclm": 0.9715122580528259,
"english": 0.960294246673584,
"fineweb_edu_approx": 1.437670111656189,
"eai_general_math": 0.008451280184090137,
"eai_open_web_math": 0.36642205715179443,
"eai_web_code": 1.199999957179898e-7
}
}
|
{
"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": "025.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,411,801,109,873,886,000 |
0
\$\begingroup\$
I am trying to implement Sweeping SAT like described here http://realtimecollisiondetection.net/files/levine_swept_sat.txt and I have already seen the answer to this question Finding the contact point with SAT which seems to have a sudo implementation to this very article.
The problem is I can't seem to fully understand how it works. Specifically if you have two 2D squares A and B. A has vertices {1,1 3,1 1,2 2,3} and B has vertices {4,1 5,2 4,4 5,4}.A's velocity is 2,0 and B is stationary. Clearly they should intersect in the future, however; If you use this algorithm then the maximum earliest future overlap seems to be 0 and the minimum latest overlap is -2 assuming the two axis you project onto are 1,0 and 0,1 which means no overlap?
Am I missing something fundamental here or does this just not work ? I have both tried it in code and via just pencil and paper as well. Both of which had the same result.
Here is my current implementation of it.
double minLatestFututreOverlapTime = std::numeric_limits<double>::infinity();
double maxEarliestFutureOverlapTime = -std::numeric_limits<double>::infinity();
Vec2D rV = other->GetPhysicsObject()->GetVelocity() - GetPhysicsObject()->GetVelocity();
for (int axes_index = 0; axes_index < 4; axes_index++)
{
double mina = std::numeric_limits<double>::infinity();
double maxa = -std::numeric_limits<double>::infinity();
double minb = std::numeric_limits<double>::infinity();
double maxb = -std::numeric_limits<double>::infinity();
for (int point_index = 0; point_index < 4; point_index++)
{
double currenta = derivedPoints[point_index].dot(axis[axes_index]);
double currentb = otherPoints[point_index].dot(axis[axes_index]);
mina = min(currenta, mina);
maxa = max(currenta, maxa);
minb = min(currentb, minb);
maxb = max(currentb, maxb);
}
double V = rV.dot(axis[axes_index]);
if(V > 0)
{
if (maxa < minb)return false;
else if (((mina <= minb) && (minb <= maxa)) || ((minb <= mina) && (mina <= maxb)))
{
minLatestFututreOverlapTime = min(minLatestFututreOverlapTime, (maxa - minb) / V);
maxEarliestFutureOverlapTime = max(maxEarliestFutureOverlapTime, 0);
}
else if(maxb < mina)
{
minLatestFututreOverlapTime = min(minLatestFututreOverlapTime, (maxa - minb) / V);
maxEarliestFutureOverlapTime = max(maxEarliestFutureOverlapTime, (mina - maxb) / V);
}
}
else if (V < 0)
{
if (maxb < mina)return false;
else if (((minb <= mina) && (mina <= maxb)) || ((mina <= minb) && (minb <= maxa)))
{
minLatestFututreOverlapTime = min(minLatestFututreOverlapTime, ((maxb - mina) / V));
maxEarliestFutureOverlapTime = max(maxEarliestFutureOverlapTime, 0);
}
else if(maxa < minb)
{
minLatestFututreOverlapTime = min(minLatestFututreOverlapTime, ((maxb - mina) / V));
maxEarliestFutureOverlapTime = max(maxEarliestFutureOverlapTime, ((minb - maxa) / V));
}
}
else
{
if (minb < maxa && mina < maxb)
{
minLatestFututreOverlapTime = min(minLatestFututreOverlapTime, 0);
maxEarliestFutureOverlapTime = max(maxEarliestFutureOverlapTime, 0);
}
else return false;
}
}
if (maxEarliestFutureOverlapTime < minLatestFututreOverlapTime)
{
response.CollisionResponse2D.collided = true;
// not implemented yet
//response.CollisionResponse2D.normal = axis[normal_index];
response.CollisionResponse2D.objectBounds[0] = this;
response.CollisionResponse2D.objectBounds[1] = other;
response.CollisionResponse2D.collidedObjects[0] = GetPhysicsObject();
response.CollisionResponse2D.collidedObjects[1] = other->GetPhysicsObject();
response.timeHit = maxEarliestFutureOverlapTime / GetPhysicsObject()->GetCurrentDeltaTime();
return true;
}
else return false;
Any help is greatly appreciated !
\$\endgroup\$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Browse other questions tagged or ask your own question.
|
{
"url": "https://gamedev.stackexchange.com/questions/160500/what-is-the-correct-way-to-implement-sweeping-sat",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "131690",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZWEFUO4QVLPVJHHTVXC5ANOY6KWAVELM",
"WARC-Concurrent-To": "<urn:uuid:fc9cb64e-8f41-4dc8-859d-528fea0da60f>",
"WARC-Date": "2019-04-23T09:59:35Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IGLJQ2423EK4O4WR2OWLYJ674LWQCBCO",
"WARC-Record-ID": "<urn:uuid:f6600d2a-ab2e-414a-aff5-18d01253a0ae>",
"WARC-Target-URI": "https://gamedev.stackexchange.com/questions/160500/what-is-the-correct-way-to-implement-sweeping-sat",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f2a7eb9-9ba1-45aa-88e1-2b6abcba74ef>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-143-100-67.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
293,
294,
767,
768,
940,
941,
982,
983,
1061,
1141,
1142,
1231,
1232,
1233,
1288,
1290,
1349,
1409,
1410,
1469,
1529,
1530,
1592,
1598,
1674,
1748,
1749,
1785,
1821,
1822,
1858,
1894,
1895,
1901,
1902,
1943,
1944,
1958,
1964,
2002,
2093,
2103,
2198,
2279,
2280,
2281,
2291,
2320,
2330,
2425,
2522,
2523,
2524,
2534,
2535,
2541,
2561,
2567,
2605,
2696,
2706,
2803,
2884,
2885,
2886,
2896,
2925,
2935,
3032,
3131,
3132,
3133,
3143,
3149,
3158,
3164,
3204,
3214,
3293,
3374,
3384,
3411,
3417,
3418,
3420,
3421,
3485,
3487,
3537,
3564,
3628,
3685,
3743,
3817,
3898,
3899,
3996,
3997,
4014,
4016,
4035,
4036,
4070,
4071,
4085,
4086,
4098,
4099,
4199,
4200
],
"line_end_idx": [
2,
18,
19,
293,
294,
767,
768,
940,
941,
982,
983,
1061,
1141,
1142,
1231,
1232,
1233,
1288,
1290,
1349,
1409,
1410,
1469,
1529,
1530,
1592,
1598,
1674,
1748,
1749,
1785,
1821,
1822,
1858,
1894,
1895,
1901,
1902,
1943,
1944,
1958,
1964,
2002,
2093,
2103,
2198,
2279,
2280,
2281,
2291,
2320,
2330,
2425,
2522,
2523,
2524,
2534,
2535,
2541,
2561,
2567,
2605,
2696,
2706,
2803,
2884,
2885,
2886,
2896,
2925,
2935,
3032,
3131,
3132,
3133,
3143,
3149,
3158,
3164,
3204,
3214,
3293,
3374,
3384,
3411,
3417,
3418,
3420,
3421,
3485,
3487,
3537,
3564,
3628,
3685,
3743,
3817,
3898,
3899,
3996,
3997,
4014,
4016,
4035,
4036,
4070,
4071,
4085,
4086,
4098,
4099,
4199,
4200,
4255
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4255,
"ccnet_original_nlines": 113,
"rps_doc_curly_bracket": 0.00611046003177762,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16709184646606445,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029336730018258095,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45280611515045166,
"rps_doc_frac_unique_words": 0.4841269850730896,
"rps_doc_mean_word_length": 7.605820178985596,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.792637825012207,
"rps_doc_word_count": 378,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17739130556583405,
"rps_doc_frac_chars_dupe_6grams": 0.17391304671764374,
"rps_doc_frac_chars_dupe_7grams": 0.17391304671764374,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.09913042932748795,
"rps_doc_frac_chars_top_3gram": 0.08347825706005096,
"rps_doc_frac_chars_top_4gram": 0.06678260862827301,
"rps_doc_books_importance": -196.1328125,
"rps_doc_books_importance_length_correction": -196.1328125,
"rps_doc_openwebtext_importance": -129.7782440185547,
"rps_doc_openwebtext_importance_length_correction": -129.7782440185547,
"rps_doc_wikipedia_importance": -96.9932861328125,
"rps_doc_wikipedia_importance_length_correction": -96.9932861328125
},
"fasttext": {
"dclm": 0.9865299463272095,
"english": 0.7361737489700317,
"fineweb_edu_approx": 2.6093873977661133,
"eai_general_math": 0.6501026153564453,
"eai_open_web_math": 0.09398406744003296,
"eai_web_code": 0.22688060998916626
}
}
|
{
"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": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,974,163,340,615,968,000 |
Tracking Lead Sources
Document created by b314881cf2c6f34ff6c1ea07c3f07a199f877a57 Employee on Aug 5, 2015
Version 1Show Document
• View in full screen mode
Want to gauge how many leads clicked through a link you have in your social media or other outlets? This can be done using URL Parameters at the end of the URLs you use. Basically, you just add a little bit of code to the end of the hyperlinked URL. When leads click through and arrive at your Landing Page, that code can be captured into a hidden Form field. Here’s how to do it.
Quick Overview of URL Parameters
In the structure of a URL, there are two main parts. The first part is used for navigation, and the second part is used to pass data along. The two parts are separated by a question mark. For example, let’s look at this URL:
www.myawesomewebsite.com?URLParameter=ThisIsAParameter
The first part of the URL, “www.myawesomewebsite.com” is the main part of the URL used for navigation. The whole rest of the URL from the question mark on, “?URLParameter=ThisIsAParameter” is referred to as a querystring. It isn’t needed for navigation to the page specified, but can be used to pass the extra data you want to include.
URL illustration.PNG
The querystring contains the URL Parameters, which are used to push data into the hidden Form fields. In the querystring “?URLParameter=ThisIsAParameter” used here, “URLParameter” corresponds to the name of the parameter you use when designating the value for the hidden Form field, and “ThisIsAParameter” will be the value that is actually entered into that field. You can add additional values into additional other fields by adding those into the format of the URL separated by an ampersand like this:
www.myawesomewebsite.com?URLParameter=ThisIsAParameter&URLParameter2=ThisIsValue2&URLParameter3=ThisIsValue3
In this example, you’ve got the same initial value being pushed into the first hidden field, but now two more hidden fields will store the next two values as well. The name of the parameter for the second hidden field would be “URLParameter2” and the value put into it would be “ThisIsValue2”. The third hidden field parameter name would be “URLParameter3” and the value put into this field would be “ThisIsValue3”.
URL illustration 2.PNG
Applying This to Social Media Use
So, how does this let you track leads coming from each of your social media sources? Well, in setting up your different promotional channels, when adding the hyperlink, you can customize the URL parameter for each channel so that the values passed will input the information specific to where they came from. The parameter values will change from one social media outlet to the next, but the structure and format will stay the same.
Let’s use the social media sources of Twitter, LinkedIn and Facebook as examples. Since you’re looking to identify the source of these leads, you’d likely want to name your parameter as “Source” so that it’s easily identifiable. Using the same base URL, let’s see how you’d structure the URLs.
For hyperlinks placed on Twitter: www.myawesomewebsite.com?Source=twitter
For hyperlinks placed on LinkedIn: www.myawesomewebsite.com?Source=linkedin
For hyperlinks placed on Facebook: www.myawesomewebsite.com?Source=facebook
When leads fill out the form on your landing page, the Source field will then tell you exactly where they came from! The best part, this is completely customizable and scalable. You can add more parameters and hidden fields to capture additional information like what campaign it is for.
Documentation
How to make form fields hidden:
https://docs.marketo.com/display/public/DOCS/Set+a+Form+Field+as+Hidden
How to define hidden form field value:
https://docs.marketo.com/display/public/DOCS/Set+a+Hidden+Form+Field+Value
(Look for the section on URL Parameters in particular)
Using the URL builder to generate the URLs you’ll be using:
https://docs.marketo.com/display/public/DOCS/Using+the+URL+Builder
Attachments
Outcomes
|
{
"url": "https://marketo-ext.jiveon.com/docs/DOC-2584",
"source_domain": "marketo-ext.jiveon.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "89881",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V7YR7YAY35QWZZXNQEEAXTTM3GHGZBNB",
"WARC-Concurrent-To": "<urn:uuid:1aeb25ce-44ac-479c-abbb-fad614fdbaf7>",
"WARC-Date": "2020-01-22T06:48:31Z",
"WARC-IP-Address": "104.119.25.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DDEPHCD3YKNXN2Z7CEKD5UQJBT5FHCGG",
"WARC-Record-ID": "<urn:uuid:816ed51f-f229-469e-9211-22795e8023be>",
"WARC-Target-URI": "https://marketo-ext.jiveon.com/docs/DOC-2584",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8d975ba1-8a35-4b1a-b993-b4d95dbb8f60>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-154.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,
22,
23,
108,
131,
160,
161,
542,
543,
545,
546,
579,
580,
805,
806,
808,
809,
864,
865,
867,
868,
1204,
1205,
1207,
1208,
1229,
1230,
1232,
1233,
1738,
1739,
1741,
1742,
1851,
1852,
1854,
1855,
2271,
2272,
2274,
2275,
2298,
2299,
2333,
2334,
2767,
2768,
2770,
2771,
3065,
3066,
3140,
3141,
3217,
3293,
3294,
3296,
3297,
3585,
3586,
3588,
3589,
3603,
3635,
3636,
3708,
3709,
3748,
3823,
3878,
3879,
3939,
3940,
4007,
4008,
4020,
4021
],
"line_end_idx": [
22,
23,
108,
131,
160,
161,
542,
543,
545,
546,
579,
580,
805,
806,
808,
809,
864,
865,
867,
868,
1204,
1205,
1207,
1208,
1229,
1230,
1232,
1233,
1738,
1739,
1741,
1742,
1851,
1852,
1854,
1855,
2271,
2272,
2274,
2275,
2298,
2299,
2333,
2334,
2767,
2768,
2770,
2771,
3065,
3066,
3140,
3141,
3217,
3293,
3294,
3296,
3297,
3585,
3586,
3588,
3589,
3603,
3635,
3636,
3708,
3709,
3748,
3823,
3878,
3879,
3939,
3940,
4007,
4008,
4020,
4021,
4033
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4033,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4116930663585663,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02679659053683281,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19001218676567078,
"rps_doc_frac_unique_words": 0.3888888955116272,
"rps_doc_mean_word_length": 5.464646339416504,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8852972984313965,
"rps_doc_word_count": 594,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.036352429538965225,
"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.012322859838604927,
"rps_doc_frac_chars_top_3gram": 0.009858289733529091,
"rps_doc_frac_chars_top_4gram": 0.01940849982202053,
"rps_doc_books_importance": -409.7288818359375,
"rps_doc_books_importance_length_correction": -409.7288818359375,
"rps_doc_openwebtext_importance": -237.81845092773438,
"rps_doc_openwebtext_importance_length_correction": -237.81845092773438,
"rps_doc_wikipedia_importance": -183.56497192382812,
"rps_doc_wikipedia_importance_length_correction": -183.56497192382812
},
"fasttext": {
"dclm": 0.18848687410354614,
"english": 0.7828047871589661,
"fineweb_edu_approx": 2.707504987716675,
"eai_general_math": 0.6858577728271484,
"eai_open_web_math": 0.40619945526123047,
"eai_web_code": 0.28912466764450073
}
}
|
{
"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": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,560,393,070,421,564,000 |
/[pcre]/code/trunk/ChangeLog
ViewVC logotype
Contents of /code/trunk/ChangeLog
Parent Directory Parent Directory | Revision Log Revision Log
Revision 152 - (show annotations) (download)
Tue Apr 17 15:55:53 2007 UTC (7 years, 3 months ago) by ph10
File size: 126792 byte(s)
Typos in the docs, missing casts and #ifdefs in the code.
1 ChangeLog for PCRE
2 ------------------
3
4 Version 7.1 12-Mar-07
5 ---------------------
6
7 1. Applied Bob Rossi and Daniel G's patches to convert the build system to one
8 that is more "standard", making use of automake and other Autotools. There
9 is some re-arrangement of the files and adjustment of comments consequent
10 on this.
11
12 2. Part of the patch fixed a problem with the pcregrep tests. The test of -r
13 for recursive directory scanning broke on some systems because the files
14 are not scanned in any specific order and on different systems the order
15 was different. A call to "sort" has been inserted into RunGrepTest for the
16 approprate test as a short-term fix. In the longer term there may be an
17 alternative.
18
19 3. I had an email from Eric Raymond about problems translating some of PCRE's
20 man pages to HTML (despite the fact that I distribute HTML pages, some
21 people do their own conversions for various reasons). The problems
22 concerned the use of low-level troff macros .br and .in. I have therefore
23 removed all such uses from the man pages (some were redundant, some could
24 be replaced by .nf/.fi pairs). The 132html script that I use to generate
25 HTML has been updated to handle .nf/.fi and to complain if it encounters
26 .br or .in.
27
28 4. Updated comments in configure.ac that get placed in config.h.in and also
29 arranged for config.h to be included in the distribution, with the name
30 config.h.generic, for the benefit of those who have to compile without
31 Autotools (compare pcre.h, which is now distributed as pcre.h.generic).
32
33 5. Updated the support (such as it is) for Virtual Pascal, thanks to Stefan
34 Weber: (1) pcre_internal.h was missing some function renames; (2) updated
35 makevp.bat for the current PCRE, using the additional files
36 makevp_c.txt, makevp_l.txt, and pcregexp.pas.
37
38 6. A Windows user reported a minor discrepancy with test 2, which turned out
39 to be caused by a trailing space on an input line that had got lost in his
40 copy. The trailing space was an accident, so I've just removed it.
41
42 7. Add -Wl,-R... flags in pcre-config.in for *BSD* systems, as I'm told
43 that is needed.
44
45 8. Mark ucp_table (in ucptable.h) and ucp_gentype (in pcre_ucp_searchfuncs.c)
46 as "const" (a) because they are and (b) because it helps the PHP
47 maintainers who have recently made a script to detect big data structures
48 in the php code that should be moved to the .rodata section. I remembered
49 to update Builducptable as well, so it won't revert if ucptable.h is ever
50 re-created.
51
52 9. Added some extra #ifdef SUPPORT_UTF8 conditionals into pcretest.c,
53 pcre_printint.src, pcre_compile.c, pcre_study.c, and pcre_tables.c, in
54 order to be able to cut out the UTF-8 tables in the latter when UTF-8
55 support is not required. This saves 1.5-2K of code, which is important in
56 some applications.
57
58 Later: more #ifdefs are needed in pcre_ord2utf8.c and pcre_valid_utf8.c
59 so as not to refer to the tables, even though these functions will never be
60 called when UTF-8 support is disabled. Otherwise there are problems with a
61 shared library.
62
63 10. Fixed two bugs in the emulated memmove() function in pcre_internal.h:
64
65 (a) It was defining its arguments as char * instead of void *.
66
67 (b) It was assuming that all moves were upwards in memory; this was true
68 a long time ago when I wrote it, but is no longer the case.
69
70 The emulated memove() is provided for those environments that have neither
71 memmove() nor bcopy(). I didn't think anyone used it these days, but that
72 is clearly not the case, as these two bugs were recently reported.
73
74 11. The script PrepareRelease is now distributed: it calls 132html, CleanTxt,
75 and Detrail to create the HTML documentation, the .txt form of the man
76 pages, and it removes trailing spaces from listed files. It also creates
77 pcre.h.generic and config.h.generic from pcre.h and config.h. In the latter
78 case, it wraps all the #defines with #ifndefs. This script should be run
79 before "make dist".
80
81 12. Fixed two fairly obscure bugs concerned with quantified caseless matching
82 with Unicode property support.
83
84 (a) For a maximizing quantifier, if the two different cases of the
85 character were of different lengths in their UTF-8 codings (there are
86 some cases like this - I found 11), and the matching function had to
87 back up over a mixture of the two cases, it incorrectly assumed they
88 were both the same length.
89
90 (b) When PCRE was configured to use the heap rather than the stack for
91 recursion during matching, it was not correctly preserving the data for
92 the other case of a UTF-8 character when checking ahead for a match
93 while processing a minimizing repeat. If the check also involved
94 matching a wide character, but failed, corruption could cause an
95 erroneous result when trying to check for a repeat of the original
96 character.
97
98 13. Some tidying changes to the testing mechanism:
99
100 (a) The RunTest script now detects the internal link size and whether there
101 is UTF-8 and UCP support by running ./pcretest -C instead of relying on
102 values substituted by "configure". (The RunGrepTest script already did
103 this for UTF-8.) The configure.ac script no longer substitutes the
104 relevant variables.
105
106 (b) The debugging options /B and /D in pcretest show the compiled bytecode
107 with length and offset values. This means that the output is different
108 for different internal link sizes. Test 2 is skipped for link sizes
109 other than 2 because of this, bypassing the problem. Unfortunately,
110 there was also a test in test 3 (the locale tests) that used /B and
111 failed for link sizes other than 2. Rather than cut the whole test out,
112 I have added a new /Z option to pcretest that replaces the length and
113 offset values with spaces. This is now used to make test 3 independent
114 of link size. (Test 2 will be tidied up later.)
115
116 14. If erroroffset was passed as NULL to pcre_compile, it provoked a
117 segmentation fault instead of returning the appropriate error message.
118
119 15. In multiline mode when the newline sequence was set to "any", the pattern
120 ^$ would give a match between the \r and \n of a subject such as "A\r\nB".
121 This doesn't seem right; it now treats the CRLF combination as the line
122 ending, and so does not match in that case. It's only a pattern such as ^$
123 that would hit this one: something like ^ABC$ would have failed after \r
124 and then tried again after \r\n.
125
126 16. Changed the comparison command for RunGrepTest from "diff -u" to "diff -ub"
127 in an attempt to make files that differ only in their line terminators
128 compare equal. This works on Linux.
129
130 17. Under certain error circumstances pcregrep might try to free random memory
131 as it exited. This is now fixed, thanks to valgrind.
132
133 19. In pcretest, if the pattern /(?m)^$/g<any> was matched against the string
134 "abc\r\n\r\n", it found an unwanted second match after the second \r. This
135 was because its rules for how to advance for /g after matching an empty
136 string at the end of a line did not allow for this case. They now check for
137 it specially.
138
139 20. pcretest is supposed to handle patterns and data of any length, by
140 extending its buffers when necessary. It was getting this wrong when the
141 buffer for a data line had to be extended.
142
143 21. Added PCRE_NEWLINE_ANYCRLF which is like ANY, but matches only CR, LF, or
144 CRLF as a newline sequence.
145
146 22. Code for handling Unicode properties in pcre_dfa_exec() wasn't being cut
147 out by #ifdef SUPPORT_UCP. This did no harm, as it could never be used, but
148 I have nevertheless tidied it up.
149
150 23. Added some casts to kill warnings from HP-UX ia64 compiler.
151
152
153 Version 7.0 19-Dec-06
154 ---------------------
155
156 1. Fixed a signed/unsigned compiler warning in pcre_compile.c, shown up by
157 moving to gcc 4.1.1.
158
159 2. The -S option for pcretest uses setrlimit(); I had omitted to #include
160 sys/time.h, which is documented as needed for this function. It doesn't
161 seem to matter on Linux, but it showed up on some releases of OS X.
162
163 3. It seems that there are systems where bytes whose values are greater than
164 127 match isprint() in the "C" locale. The "C" locale should be the
165 default when a C program starts up. In most systems, only ASCII printing
166 characters match isprint(). This difference caused the output from pcretest
167 to vary, making some of the tests fail. I have changed pcretest so that:
168
169 (a) When it is outputting text in the compiled version of a pattern, bytes
170 other than 32-126 are always shown as hex escapes.
171
172 (b) When it is outputting text that is a matched part of a subject string,
173 it does the same, unless a different locale has been set for the match
174 (using the /L modifier). In this case, it uses isprint() to decide.
175
176 4. Fixed a major bug that caused incorrect computation of the amount of memory
177 required for a compiled pattern when options that changed within the
178 pattern affected the logic of the preliminary scan that determines the
179 length. The relevant options are -x, and -i in UTF-8 mode. The result was
180 that the computed length was too small. The symptoms of this bug were
181 either the PCRE error "internal error: code overflow" from pcre_compile(),
182 or a glibc crash with a message such as "pcretest: free(): invalid next
183 size (fast)". Examples of patterns that provoked this bug (shown in
184 pcretest format) are:
185
186 /(?-x: )/x
187 /(?x)(?-x: \s*#\s*)/
188 /((?i)[\x{c0}])/8
189 /(?i:[\x{c0}])/8
190
191 HOWEVER: Change 17 below makes this fix obsolete as the memory computation
192 is now done differently.
193
194 5. Applied patches from Google to: (a) add a QuoteMeta function to the C++
195 wrapper classes; (b) implement a new function in the C++ scanner that is
196 more efficient than the old way of doing things because it avoids levels of
197 recursion in the regex matching; (c) add a paragraph to the documentation
198 for the FullMatch() function.
199
200 6. The escape sequence \n was being treated as whatever was defined as
201 "newline". Not only was this contrary to the documentation, which states
202 that \n is character 10 (hex 0A), but it also went horribly wrong when
203 "newline" was defined as CRLF. This has been fixed.
204
205 7. In pcre_dfa_exec.c the value of an unsigned integer (the variable called c)
206 was being set to -1 for the "end of line" case (supposedly a value that no
207 character can have). Though this value is never used (the check for end of
208 line is "zero bytes in current character"), it caused compiler complaints.
209 I've changed it to 0xffffffff.
210
211 8. In pcre_version.c, the version string was being built by a sequence of
212 C macros that, in the event of PCRE_PRERELEASE being defined as an empty
213 string (as it is for production releases) called a macro with an empty
214 argument. The C standard says the result of this is undefined. The gcc
215 compiler treats it as an empty string (which was what was wanted) but it is
216 reported that Visual C gives an error. The source has been hacked around to
217 avoid this problem.
218
219 9. On the advice of a Windows user, included <io.h> and <fcntl.h> in Windows
220 builds of pcretest, and changed the call to _setmode() to use _O_BINARY
221 instead of 0x8000. Made all the #ifdefs test both _WIN32 and WIN32 (not all
222 of them did).
223
224 10. Originally, pcretest opened its input and output without "b"; then I was
225 told that "b" was needed in some environments, so it was added for release
226 5.0 to both the input and output. (It makes no difference on Unix-like
227 systems.) Later I was told that it is wrong for the input on Windows. I've
228 now abstracted the modes into two macros, to make it easier to fiddle with
229 them, and removed "b" from the input mode under Windows.
230
231 11. Added pkgconfig support for the C++ wrapper library, libpcrecpp.
232
233 12. Added -help and --help to pcretest as an official way of being reminded
234 of the options.
235
236 13. Removed some redundant semicolons after macro calls in pcrecpparg.h.in
237 and pcrecpp.cc because they annoy compilers at high warning levels.
238
239 14. A bit of tidying/refactoring in pcre_exec.c in the main bumpalong loop.
240
241 15. Fixed an occurrence of == in configure.ac that should have been = (shell
242 scripts are not C programs :-) and which was not noticed because it works
243 on Linux.
244
245 16. pcretest is supposed to handle any length of pattern and data line (as one
246 line or as a continued sequence of lines) by extending its input buffer if
247 necessary. This feature was broken for very long pattern lines, leading to
248 a string of junk being passed to pcre_compile() if the pattern was longer
249 than about 50K.
250
251 17. I have done a major re-factoring of the way pcre_compile() computes the
252 amount of memory needed for a compiled pattern. Previously, there was code
253 that made a preliminary scan of the pattern in order to do this. That was
254 OK when PCRE was new, but as the facilities have expanded, it has become
255 harder and harder to keep it in step with the real compile phase, and there
256 have been a number of bugs (see for example, 4 above). I have now found a
257 cunning way of running the real compile function in a "fake" mode that
258 enables it to compute how much memory it would need, while actually only
259 ever using a few hundred bytes of working memory and without too many
260 tests of the mode. This should make future maintenance and development
261 easier. A side effect of this work is that the limit of 200 on the nesting
262 depth of parentheses has been removed (though this was never a serious
263 limitation, I suspect). However, there is a downside: pcre_compile() now
264 runs more slowly than before (30% or more, depending on the pattern). I
265 hope this isn't a big issue. There is no effect on runtime performance.
266
267 18. Fixed a minor bug in pcretest: if a pattern line was not terminated by a
268 newline (only possible for the last line of a file) and it was a
269 pattern that set a locale (followed by /Lsomething), pcretest crashed.
270
271 19. Added additional timing features to pcretest. (1) The -tm option now times
272 matching only, not compiling. (2) Both -t and -tm can be followed, as a
273 separate command line item, by a number that specifies the number of
274 repeats to use when timing. The default is 50000; this gives better
275 precision, but takes uncomfortably long for very large patterns.
276
277 20. Extended pcre_study() to be more clever in cases where a branch of a
278 subpattern has no definite first character. For example, (a*|b*)[cd] would
279 previously give no result from pcre_study(). Now it recognizes that the
280 first character must be a, b, c, or d.
281
282 21. There was an incorrect error "recursive call could loop indefinitely" if
283 a subpattern (or the entire pattern) that was being tested for matching an
284 empty string contained only one non-empty item after a nested subpattern.
285 For example, the pattern (?>\x{100}*)\d(?R) provoked this error
286 incorrectly, because the \d was being skipped in the check.
287
288 22. The pcretest program now has a new pattern option /B and a command line
289 option -b, which is equivalent to adding /B to every pattern. This causes
290 it to show the compiled bytecode, without the additional information that
291 -d shows. The effect of -d is now the same as -b with -i (and similarly, /D
292 is the same as /B/I).
293
294 23. A new optimization is now able automatically to treat some sequences such
295 as a*b as a*+b. More specifically, if something simple (such as a character
296 or a simple class like \d) has an unlimited quantifier, and is followed by
297 something that cannot possibly match the quantified thing, the quantifier
298 is automatically "possessified".
299
300 24. A recursive reference to a subpattern whose number was greater than 39
301 went wrong under certain circumstances in UTF-8 mode. This bug could also
302 have affected the operation of pcre_study().
303
304 25. Realized that a little bit of performance could be had by replacing
305 (c & 0xc0) == 0xc0 with c >= 0xc0 when processing UTF-8 characters.
306
307 26. Timing data from pcretest is now shown to 4 decimal places instead of 3.
308
309 27. Possessive quantifiers such as a++ were previously implemented by turning
310 them into atomic groups such as ($>a+). Now they have their own opcodes,
311 which improves performance. This includes the automatically created ones
312 from 23 above.
313
314 28. A pattern such as (?=(\w+))\1: which simulates an atomic group using a
315 lookahead was broken if it was not anchored. PCRE was mistakenly expecting
316 the first matched character to be a colon. This applied both to named and
317 numbered groups.
318
319 29. The ucpinternal.h header file was missing its idempotency #ifdef.
320
321 30. I was sent a "project" file called libpcre.a.dev which I understand makes
322 building PCRE on Windows easier, so I have included it in the distribution.
323
324 31. There is now a check in pcretest against a ridiculously large number being
325 returned by pcre_exec() or pcre_dfa_exec(). If this happens in a /g or /G
326 loop, the loop is abandoned.
327
328 32. Forward references to subpatterns in conditions such as (?(2)...) where
329 subpattern 2 is defined later cause pcre_compile() to search forwards in
330 the pattern for the relevant set of parentheses. This search went wrong
331 when there were unescaped parentheses in a character class, parentheses
332 escaped with \Q...\E, or parentheses in a #-comment in /x mode.
333
334 33. "Subroutine" calls and backreferences were previously restricted to
335 referencing subpatterns earlier in the regex. This restriction has now
336 been removed.
337
338 34. Added a number of extra features that are going to be in Perl 5.10. On the
339 whole, these are just syntactic alternatives for features that PCRE had
340 previously implemented using the Python syntax or my own invention. The
341 other formats are all retained for compatibility.
342
343 (a) Named groups can now be defined as (?<name>...) or (?'name'...) as well
344 as (?P<name>...). The new forms, as well as being in Perl 5.10, are
345 also .NET compatible.
346
347 (b) A recursion or subroutine call to a named group can now be defined as
348 (?&name) as well as (?P>name).
349
350 (c) A backreference to a named group can now be defined as \k<name> or
351 \k'name' as well as (?P=name). The new forms, as well as being in Perl
352 5.10, are also .NET compatible.
353
354 (d) A conditional reference to a named group can now use the syntax
355 (?(<name>) or (?('name') as well as (?(name).
356
357 (e) A "conditional group" of the form (?(DEFINE)...) can be used to define
358 groups (named and numbered) that are never evaluated inline, but can be
359 called as "subroutines" from elsewhere. In effect, the DEFINE condition
360 is always false. There may be only one alternative in such a group.
361
362 (f) A test for recursion can be given as (?(R1).. or (?(R&name)... as well
363 as the simple (?(R). The condition is true only if the most recent
364 recursion is that of the given number or name. It does not search out
365 through the entire recursion stack.
366
367 (g) The escape \gN or \g{N} has been added, where N is a positive or
368 negative number, specifying an absolute or relative reference.
369
370 35. Tidied to get rid of some further signed/unsigned compiler warnings and
371 some "unreachable code" warnings.
372
373 36. Updated the Unicode property tables to Unicode version 5.0.0. Amongst other
374 things, this adds five new scripts.
375
376 37. Perl ignores orphaned \E escapes completely. PCRE now does the same.
377 There were also incompatibilities regarding the handling of \Q..\E inside
378 character classes, for example with patterns like [\Qa\E-\Qz\E] where the
379 hyphen was adjacent to \Q or \E. I hope I've cleared all this up now.
380
381 38. Like Perl, PCRE detects when an indefinitely repeated parenthesized group
382 matches an empty string, and forcibly breaks the loop. There were bugs in
383 this code in non-simple cases. For a pattern such as ^(a()*)* matched
384 against aaaa the result was just "a" rather than "aaaa", for example. Two
385 separate and independent bugs (that affected different cases) have been
386 fixed.
387
388 39. Refactored the code to abolish the use of different opcodes for small
389 capturing bracket numbers. This is a tidy that I avoided doing when I
390 removed the limit on the number of capturing brackets for 3.5 back in 2001.
391 The new approach is not only tidier, it makes it possible to reduce the
392 memory needed to fix the previous bug (38).
393
394 40. Implemented PCRE_NEWLINE_ANY to recognize any of the Unicode newline
395 sequences (http://unicode.org/unicode/reports/tr18/) as "newline" when
396 processing dot, circumflex, or dollar metacharacters, or #-comments in /x
397 mode.
398
399 41. Add \R to match any Unicode newline sequence, as suggested in the Unicode
400 report.
401
402 42. Applied patch, originally from Ari Pollak, modified by Google, to allow
403 copy construction and assignment in the C++ wrapper.
404
405 43. Updated pcregrep to support "--newline=any". In the process, I fixed a
406 couple of bugs that could have given wrong results in the "--newline=crlf"
407 case.
408
409 44. Added a number of casts and did some reorganization of signed/unsigned int
410 variables following suggestions from Dair Grant. Also renamed the variable
411 "this" as "item" because it is a C++ keyword.
412
413 45. Arranged for dftables to add
414
415 #include "pcre_internal.h"
416
417 to pcre_chartables.c because without it, gcc 4.x may remove the array
418 definition from the final binary if PCRE is built into a static library and
419 dead code stripping is activated.
420
421 46. For an unanchored pattern, if a match attempt fails at the start of a
422 newline sequence, and the newline setting is CRLF or ANY, and the next two
423 characters are CRLF, advance by two characters instead of one.
424
425
426 Version 6.7 04-Jul-06
427 ---------------------
428
429 1. In order to handle tests when input lines are enormously long, pcretest has
430 been re-factored so that it automatically extends its buffers when
431 necessary. The code is crude, but this _is_ just a test program. The
432 default size has been increased from 32K to 50K.
433
434 2. The code in pcre_study() was using the value of the re argument before
435 testing it for NULL. (Of course, in any sensible call of the function, it
436 won't be NULL.)
437
438 3. The memmove() emulation function in pcre_internal.h, which is used on
439 systems that lack both memmove() and bcopy() - that is, hardly ever -
440 was missing a "static" storage class specifier.
441
442 4. When UTF-8 mode was not set, PCRE looped when compiling certain patterns
443 containing an extended class (one that cannot be represented by a bitmap
444 because it contains high-valued characters or Unicode property items, e.g.
445 [\pZ]). Almost always one would set UTF-8 mode when processing such a
446 pattern, but PCRE should not loop if you do not (it no longer does).
447 [Detail: two cases were found: (a) a repeated subpattern containing an
448 extended class; (b) a recursive reference to a subpattern that followed a
449 previous extended class. It wasn't skipping over the extended class
450 correctly when UTF-8 mode was not set.]
451
452 5. A negated single-character class was not being recognized as fixed-length
453 in lookbehind assertions such as (?<=[^f]), leading to an incorrect
454 compile error "lookbehind assertion is not fixed length".
455
456 6. The RunPerlTest auxiliary script was showing an unexpected difference
457 between PCRE and Perl for UTF-8 tests. It turns out that it is hard to
458 write a Perl script that can interpret lines of an input file either as
459 byte characters or as UTF-8, which is what "perltest" was being required to
460 do for the non-UTF-8 and UTF-8 tests, respectively. Essentially what you
461 can't do is switch easily at run time between having the "use utf8;" pragma
462 or not. In the end, I fudged it by using the RunPerlTest script to insert
463 "use utf8;" explicitly for the UTF-8 tests.
464
465 7. In multiline (/m) mode, PCRE was matching ^ after a terminating newline at
466 the end of the subject string, contrary to the documentation and to what
467 Perl does. This was true of both matching functions. Now it matches only at
468 the start of the subject and immediately after *internal* newlines.
469
470 8. A call of pcre_fullinfo() from pcretest to get the option bits was passing
471 a pointer to an int instead of a pointer to an unsigned long int. This
472 caused problems on 64-bit systems.
473
474 9. Applied a patch from the folks at Google to pcrecpp.cc, to fix "another
475 instance of the 'standard' template library not being so standard".
476
477 10. There was no check on the number of named subpatterns nor the maximum
478 length of a subpattern name. The product of these values is used to compute
479 the size of the memory block for a compiled pattern. By supplying a very
480 long subpattern name and a large number of named subpatterns, the size
481 computation could be caused to overflow. This is now prevented by limiting
482 the length of names to 32 characters, and the number of named subpatterns
483 to 10,000.
484
485 11. Subpatterns that are repeated with specific counts have to be replicated in
486 the compiled pattern. The size of memory for this was computed from the
487 length of the subpattern and the repeat count. The latter is limited to
488 65535, but there was no limit on the former, meaning that integer overflow
489 could in principle occur. The compiled length of a repeated subpattern is
490 now limited to 30,000 bytes in order to prevent this.
491
492 12. Added the optional facility to have named substrings with the same name.
493
494 13. Added the ability to use a named substring as a condition, using the
495 Python syntax: (?(name)yes|no). This overloads (?(R)... and names that
496 are numbers (not recommended). Forward references are permitted.
497
498 14. Added forward references in named backreferences (if you see what I mean).
499
500 15. In UTF-8 mode, with the PCRE_DOTALL option set, a quantified dot in the
501 pattern could run off the end of the subject. For example, the pattern
502 "(?s)(.{1,5})"8 did this with the subject "ab".
503
504 16. If PCRE_DOTALL or PCRE_MULTILINE were set, pcre_dfa_exec() behaved as if
505 PCRE_CASELESS was set when matching characters that were quantified with ?
506 or *.
507
508 17. A character class other than a single negated character that had a minimum
509 but no maximum quantifier - for example [ab]{6,} - was not handled
510 correctly by pce_dfa_exec(). It would match only one character.
511
512 18. A valid (though odd) pattern that looked like a POSIX character
513 class but used an invalid character after [ (for example [[,abc,]]) caused
514 pcre_compile() to give the error "Failed: internal error: code overflow" or
515 in some cases to crash with a glibc free() error. This could even happen if
516 the pattern terminated after [[ but there just happened to be a sequence of
517 letters, a binary zero, and a closing ] in the memory that followed.
518
519 19. Perl's treatment of octal escapes in the range \400 to \777 has changed
520 over the years. Originally (before any Unicode support), just the bottom 8
521 bits were taken. Thus, for example, \500 really meant \100. Nowadays the
522 output from "man perlunicode" includes this:
523
524 The regular expression compiler produces polymorphic opcodes. That
525 is, the pattern adapts to the data and automatically switches to
526 the Unicode character scheme when presented with Unicode data--or
527 instead uses a traditional byte scheme when presented with byte
528 data.
529
530 Sadly, a wide octal escape does not cause a switch, and in a string with
531 no other multibyte characters, these octal escapes are treated as before.
532 Thus, in Perl, the pattern /\500/ actually matches \100 but the pattern
533 /\500|\x{1ff}/ matches \500 or \777 because the whole thing is treated as a
534 Unicode string.
535
536 I have not perpetrated such confusion in PCRE. Up till now, it took just
537 the bottom 8 bits, as in old Perl. I have now made octal escapes with
538 values greater than \377 illegal in non-UTF-8 mode. In UTF-8 mode they
539 translate to the appropriate multibyte character.
540
541 29. Applied some refactoring to reduce the number of warnings from Microsoft
542 and Borland compilers. This has included removing the fudge introduced
543 seven years ago for the OS/2 compiler (see 2.02/2 below) because it caused
544 a warning about an unused variable.
545
546 21. PCRE has not included VT (character 0x0b) in the set of whitespace
547 characters since release 4.0, because Perl (from release 5.004) does not.
548 [Or at least, is documented not to: some releases seem to be in conflict
549 with the documentation.] However, when a pattern was studied with
550 pcre_study() and all its branches started with \s, PCRE still included VT
551 as a possible starting character. Of course, this did no harm; it just
552 caused an unnecessary match attempt.
553
554 22. Removed a now-redundant internal flag bit that recorded the fact that case
555 dependency changed within the pattern. This was once needed for "required
556 byte" processing, but is no longer used. This recovers a now-scarce options
557 bit. Also moved the least significant internal flag bit to the most-
558 significant bit of the word, which was not previously used (hangover from
559 the days when it was an int rather than a uint) to free up another bit for
560 the future.
561
562 23. Added support for CRLF line endings as well as CR and LF. As well as the
563 default being selectable at build time, it can now be changed at runtime
564 via the PCRE_NEWLINE_xxx flags. There are now options for pcregrep to
565 specify that it is scanning data with non-default line endings.
566
567 24. Changed the definition of CXXLINK to make it agree with the definition of
568 LINK in the Makefile, by replacing LDFLAGS to CXXFLAGS.
569
570 25. Applied Ian Taylor's patches to avoid using another stack frame for tail
571 recursions. This makes a big different to stack usage for some patterns.
572
573 26. If a subpattern containing a named recursion or subroutine reference such
574 as (?P>B) was quantified, for example (xxx(?P>B)){3}, the calculation of
575 the space required for the compiled pattern went wrong and gave too small a
576 value. Depending on the environment, this could lead to "Failed: internal
577 error: code overflow at offset 49" or "glibc detected double free or
578 corruption" errors.
579
580 27. Applied patches from Google (a) to support the new newline modes and (b) to
581 advance over multibyte UTF-8 characters in GlobalReplace.
582
583 28. Change free() to pcre_free() in pcredemo.c. Apparently this makes a
584 difference for some implementation of PCRE in some Windows version.
585
586 29. Added some extra testing facilities to pcretest:
587
588 \q<number> in a data line sets the "match limit" value
589 \Q<number> in a data line sets the "match recursion limt" value
590 -S <number> sets the stack size, where <number> is in megabytes
591
592 The -S option isn't available for Windows.
593
594
595 Version 6.6 06-Feb-06
596 ---------------------
597
598 1. Change 16(a) for 6.5 broke things, because PCRE_DATA_SCOPE was not defined
599 in pcreposix.h. I have copied the definition from pcre.h.
600
601 2. Change 25 for 6.5 broke compilation in a build directory out-of-tree
602 because pcre.h is no longer a built file.
603
604 3. Added Jeff Friedl's additional debugging patches to pcregrep. These are
605 not normally included in the compiled code.
606
607
608 Version 6.5 01-Feb-06
609 ---------------------
610
611 1. When using the partial match feature with pcre_dfa_exec(), it was not
612 anchoring the second and subsequent partial matches at the new starting
613 point. This could lead to incorrect results. For example, with the pattern
614 /1234/, partially matching against "123" and then "a4" gave a match.
615
616 2. Changes to pcregrep:
617
618 (a) All non-match returns from pcre_exec() were being treated as failures
619 to match the line. Now, unless the error is PCRE_ERROR_NOMATCH, an
620 error message is output. Some extra information is given for the
621 PCRE_ERROR_MATCHLIMIT and PCRE_ERROR_RECURSIONLIMIT errors, which are
622 probably the only errors that are likely to be caused by users (by
623 specifying a regex that has nested indefinite repeats, for instance).
624 If there are more than 20 of these errors, pcregrep is abandoned.
625
626 (b) A binary zero was treated as data while matching, but terminated the
627 output line if it was written out. This has been fixed: binary zeroes
628 are now no different to any other data bytes.
629
630 (c) Whichever of the LC_ALL or LC_CTYPE environment variables is set is
631 used to set a locale for matching. The --locale=xxxx long option has
632 been added (no short equivalent) to specify a locale explicitly on the
633 pcregrep command, overriding the environment variables.
634
635 (d) When -B was used with -n, some line numbers in the output were one less
636 than they should have been.
637
638 (e) Added the -o (--only-matching) option.
639
640 (f) If -A or -C was used with -c (count only), some lines of context were
641 accidentally printed for the final match.
642
643 (g) Added the -H (--with-filename) option.
644
645 (h) The combination of options -rh failed to suppress file names for files
646 that were found from directory arguments.
647
648 (i) Added the -D (--devices) and -d (--directories) options.
649
650 (j) Added the -F (--fixed-strings) option.
651
652 (k) Allow "-" to be used as a file name for -f as well as for a data file.
653
654 (l) Added the --colo(u)r option.
655
656 (m) Added Jeffrey Friedl's -S testing option, but within #ifdefs so that it
657 is not present by default.
658
659 3. A nasty bug was discovered in the handling of recursive patterns, that is,
660 items such as (?R) or (?1), when the recursion could match a number of
661 alternatives. If it matched one of the alternatives, but subsequently,
662 outside the recursion, there was a failure, the code tried to back up into
663 the recursion. However, because of the way PCRE is implemented, this is not
664 possible, and the result was an incorrect result from the match.
665
666 In order to prevent this happening, the specification of recursion has
667 been changed so that all such subpatterns are automatically treated as
668 atomic groups. Thus, for example, (?R) is treated as if it were (?>(?R)).
669
670 4. I had overlooked the fact that, in some locales, there are characters for
671 which isalpha() is true but neither isupper() nor islower() are true. In
672 the fr_FR locale, for instance, the \xAA and \xBA characters (ordmasculine
673 and ordfeminine) are like this. This affected the treatment of \w and \W
674 when they appeared in character classes, but not when they appeared outside
675 a character class. The bit map for "word" characters is now created
676 separately from the results of isalnum() instead of just taking it from the
677 upper, lower, and digit maps. (Plus the underscore character, of course.)
678
679 5. The above bug also affected the handling of POSIX character classes such as
680 [[:alpha:]] and [[:alnum:]]. These do not have their own bit maps in PCRE's
681 permanent tables. Instead, the bit maps for such a class were previously
682 created as the appropriate unions of the upper, lower, and digit bitmaps.
683 Now they are created by subtraction from the [[:word:]] class, which has
684 its own bitmap.
685
686 6. The [[:blank:]] character class matches horizontal, but not vertical space.
687 It is created by subtracting the vertical space characters (\x09, \x0a,
688 \x0b, \x0c) from the [[:space:]] bitmap. Previously, however, the
689 subtraction was done in the overall bitmap for a character class, meaning
690 that a class such as [\x0c[:blank:]] was incorrect because \x0c would not
691 be recognized. This bug has been fixed.
692
693 7. Patches from the folks at Google:
694
695 (a) pcrecpp.cc: "to handle a corner case that may or may not happen in
696 real life, but is still worth protecting against".
697
698 (b) pcrecpp.cc: "corrects a bug when negative radixes are used with
699 regular expressions".
700
701 (c) pcre_scanner.cc: avoid use of std::count() because not all systems
702 have it.
703
704 (d) Split off pcrecpparg.h from pcrecpp.h and had the former built by
705 "configure" and the latter not, in order to fix a problem somebody had
706 with compiling the Arg class on HP-UX.
707
708 (e) Improve the error-handling of the C++ wrapper a little bit.
709
710 (f) New tests for checking recursion limiting.
711
712 8. The pcre_memmove() function, which is used only if the environment does not
713 have a standard memmove() function (and is therefore rarely compiled),
714 contained two bugs: (a) use of int instead of size_t, and (b) it was not
715 returning a result (though PCRE never actually uses the result).
716
717 9. In the POSIX regexec() interface, if nmatch is specified as a ridiculously
718 large number - greater than INT_MAX/(3*sizeof(int)) - REG_ESPACE is
719 returned instead of calling malloc() with an overflowing number that would
720 most likely cause subsequent chaos.
721
722 10. The debugging option of pcretest was not showing the NO_AUTO_CAPTURE flag.
723
724 11. The POSIX flag REG_NOSUB is now supported. When a pattern that was compiled
725 with this option is matched, the nmatch and pmatch options of regexec() are
726 ignored.
727
728 12. Added REG_UTF8 to the POSIX interface. This is not defined by POSIX, but is
729 provided in case anyone wants to the the POSIX interface with UTF-8
730 strings.
731
732 13. Added CXXLDFLAGS to the Makefile parameters to provide settings only on the
733 C++ linking (needed for some HP-UX environments).
734
735 14. Avoid compiler warnings in get_ucpname() when compiled without UCP support
736 (unused parameter) and in the pcre_printint() function (omitted "default"
737 switch label when the default is to do nothing).
738
739 15. Added some code to make it possible, when PCRE is compiled as a C++
740 library, to replace subject pointers for pcre_exec() with a smart pointer
741 class, thus making it possible to process discontinuous strings.
742
743 16. The two macros PCRE_EXPORT and PCRE_DATA_SCOPE are confusing, and perform
744 much the same function. They were added by different people who were trying
745 to make PCRE easy to compile on non-Unix systems. It has been suggested
746 that PCRE_EXPORT be abolished now that there is more automatic apparatus
747 for compiling on Windows systems. I have therefore replaced it with
748 PCRE_DATA_SCOPE. This is set automatically for Windows; if not set it
749 defaults to "extern" for C or "extern C" for C++, which works fine on
750 Unix-like systems. It is now possible to override the value of PCRE_DATA_
751 SCOPE with something explicit in config.h. In addition:
752
753 (a) pcreposix.h still had just "extern" instead of either of these macros;
754 I have replaced it with PCRE_DATA_SCOPE.
755
756 (b) Functions such as _pcre_xclass(), which are internal to the library,
757 but external in the C sense, all had PCRE_EXPORT in their definitions.
758 This is apparently wrong for the Windows case, so I have removed it.
759 (It makes no difference on Unix-like systems.)
760
761 17. Added a new limit, MATCH_LIMIT_RECURSION, which limits the depth of nesting
762 of recursive calls to match(). This is different to MATCH_LIMIT because
763 that limits the total number of calls to match(), not all of which increase
764 the depth of recursion. Limiting the recursion depth limits the amount of
765 stack (or heap if NO_RECURSE is set) that is used. The default can be set
766 when PCRE is compiled, and changed at run time. A patch from Google adds
767 this functionality to the C++ interface.
768
769 18. Changes to the handling of Unicode character properties:
770
771 (a) Updated the table to Unicode 4.1.0.
772
773 (b) Recognize characters that are not in the table as "Cn" (undefined).
774
775 (c) I revised the way the table is implemented to a much improved format
776 which includes recognition of ranges. It now supports the ranges that
777 are defined in UnicodeData.txt, and it also amalgamates other
778 characters into ranges. This has reduced the number of entries in the
779 table from around 16,000 to around 3,000, thus reducing its size
780 considerably. I realized I did not need to use a tree structure after
781 all - a binary chop search is just as efficient. Having reduced the
782 number of entries, I extended their size from 6 bytes to 8 bytes to
783 allow for more data.
784
785 (d) Added support for Unicode script names via properties such as \p{Han}.
786
787 19. In UTF-8 mode, a backslash followed by a non-Ascii character was not
788 matching that character.
789
790 20. When matching a repeated Unicode property with a minimum greater than zero,
791 (for example \pL{2,}), PCRE could look past the end of the subject if it
792 reached it while seeking the minimum number of characters. This could
793 happen only if some of the characters were more than one byte long, because
794 there is a check for at least the minimum number of bytes.
795
796 21. Refactored the implementation of \p and \P so as to be more general, to
797 allow for more different types of property in future. This has changed the
798 compiled form incompatibly. Anybody with saved compiled patterns that use
799 \p or \P will have to recompile them.
800
801 22. Added "Any" and "L&" to the supported property types.
802
803 23. Recognize \x{...} as a code point specifier, even when not in UTF-8 mode,
804 but give a compile time error if the value is greater than 0xff.
805
806 24. The man pages for pcrepartial, pcreprecompile, and pcre_compile2 were
807 accidentally not being installed or uninstalled.
808
809 25. The pcre.h file was built from pcre.h.in, but the only changes that were
810 made were to insert the current release number. This seemed silly, because
811 it made things harder for people building PCRE on systems that don't run
812 "configure". I have turned pcre.h into a distributed file, no longer built
813 by "configure", with the version identification directly included. There is
814 no longer a pcre.h.in file.
815
816 However, this change necessitated a change to the pcre-config script as
817 well. It is built from pcre-config.in, and one of the substitutions was the
818 release number. I have updated configure.ac so that ./configure now finds
819 the release number by grepping pcre.h.
820
821 26. Added the ability to run the tests under valgrind.
822
823
824 Version 6.4 05-Sep-05
825 ---------------------
826
827 1. Change 6.0/10/(l) to pcregrep introduced a bug that caused separator lines
828 "--" to be printed when multiple files were scanned, even when none of the
829 -A, -B, or -C options were used. This is not compatible with Gnu grep, so I
830 consider it to be a bug, and have restored the previous behaviour.
831
832 2. A couple of code tidies to get rid of compiler warnings.
833
834 3. The pcretest program used to cheat by referring to symbols in the library
835 whose names begin with _pcre_. These are internal symbols that are not
836 really supposed to be visible externally, and in some environments it is
837 possible to suppress them. The cheating is now confined to including
838 certain files from the library's source, which is a bit cleaner.
839
840 4. Renamed pcre.in as pcre.h.in to go with pcrecpp.h.in; it also makes the
841 file's purpose clearer.
842
843 5. Reorganized pcre_ucp_findchar().
844
845
846 Version 6.3 15-Aug-05
847 ---------------------
848
849 1. The file libpcre.pc.in did not have general read permission in the tarball.
850
851 2. There were some problems when building without C++ support:
852
853 (a) If C++ support was not built, "make install" and "make test" still
854 tried to test it.
855
856 (b) There were problems when the value of CXX was explicitly set. Some
857 changes have been made to try to fix these, and ...
858
859 (c) --disable-cpp can now be used to explicitly disable C++ support.
860
861 (d) The use of @CPP_OBJ@ directly caused a blank line preceded by a
862 backslash in a target when C++ was disabled. This confuses some
863 versions of "make", apparently. Using an intermediate variable solves
864 this. (Same for CPP_LOBJ.)
865
866 3. $(LINK_FOR_BUILD) now includes $(CFLAGS_FOR_BUILD) and $(LINK)
867 (non-Windows) now includes $(CFLAGS) because these flags are sometimes
868 necessary on certain architectures.
869
870 4. Added a setting of -export-symbols-regex to the link command to remove
871 those symbols that are exported in the C sense, but actually are local
872 within the library, and not documented. Their names all begin with
873 "_pcre_". This is not a perfect job, because (a) we have to except some
874 symbols that pcretest ("illegally") uses, and (b) the facility isn't always
875 available (and never for static libraries). I have made a note to try to
876 find a way round (a) in the future.
877
878
879 Version 6.2 01-Aug-05
880 ---------------------
881
882 1. There was no test for integer overflow of quantifier values. A construction
883 such as {1111111111111111} would give undefined results. What is worse, if
884 a minimum quantifier for a parenthesized subpattern overflowed and became
885 negative, the calculation of the memory size went wrong. This could have
886 led to memory overwriting.
887
888 2. Building PCRE using VPATH was broken. Hopefully it is now fixed.
889
890 3. Added "b" to the 2nd argument of fopen() in dftables.c, for non-Unix-like
891 operating environments where this matters.
892
893 4. Applied Giuseppe Maxia's patch to add additional features for controlling
894 PCRE options from within the C++ wrapper.
895
896 5. Named capturing subpatterns were not being correctly counted when a pattern
897 was compiled. This caused two problems: (a) If there were more than 100
898 such subpatterns, the calculation of the memory needed for the whole
899 compiled pattern went wrong, leading to an overflow error. (b) Numerical
900 back references of the form \12, where the number was greater than 9, were
901 not recognized as back references, even though there were sufficient
902 previous subpatterns.
903
904 6. Two minor patches to pcrecpp.cc in order to allow it to compile on older
905 versions of gcc, e.g. 2.95.4.
906
907
908 Version 6.1 21-Jun-05
909 ---------------------
910
911 1. There was one reference to the variable "posix" in pcretest.c that was not
912 surrounded by "#if !defined NOPOSIX".
913
914 2. Make it possible to compile pcretest without DFA support, UTF8 support, or
915 the cross-check on the old pcre_info() function, for the benefit of the
916 cut-down version of PCRE that is currently imported into Exim.
917
918 3. A (silly) pattern starting with (?i)(?-i) caused an internal space
919 allocation error. I've done the easy fix, which wastes 2 bytes for sensible
920 patterns that start (?i) but I don't think that matters. The use of (?i) is
921 just an example; this all applies to the other options as well.
922
923 4. Since libtool seems to echo the compile commands it is issuing, the output
924 from "make" can be reduced a bit by putting "@" in front of each libtool
925 compile command.
926
927 5. Patch from the folks at Google for configure.in to be a bit more thorough
928 in checking for a suitable C++ installation before trying to compile the
929 C++ stuff. This should fix a reported problem when a compiler was present,
930 but no suitable headers.
931
932 6. The man pages all had just "PCRE" as their title. I have changed them to
933 be the relevant file name. I have also arranged that these names are
934 retained in the file doc/pcre.txt, which is a concatenation in text format
935 of all the man pages except the little individual ones for each function.
936
937 7. The NON-UNIX-USE file had not been updated for the different set of source
938 files that come with release 6. I also added a few comments about the C++
939 wrapper.
940
941
942 Version 6.0 07-Jun-05
943 ---------------------
944
945 1. Some minor internal re-organization to help with my DFA experiments.
946
947 2. Some missing #ifdef SUPPORT_UCP conditionals in pcretest and printint that
948 didn't matter for the library itself when fully configured, but did matter
949 when compiling without UCP support, or within Exim, where the ucp files are
950 not imported.
951
952 3. Refactoring of the library code to split up the various functions into
953 different source modules. The addition of the new DFA matching code (see
954 below) to a single monolithic source would have made it really too
955 unwieldy, quite apart from causing all the code to be include in a
956 statically linked application, when only some functions are used. This is
957 relevant even without the DFA addition now that patterns can be compiled in
958 one application and matched in another.
959
960 The downside of splitting up is that there have to be some external
961 functions and data tables that are used internally in different modules of
962 the library but which are not part of the API. These have all had their
963 names changed to start with "_pcre_" so that they are unlikely to clash
964 with other external names.
965
966 4. Added an alternate matching function, pcre_dfa_exec(), which matches using
967 a different (DFA) algorithm. Although it is slower than the original
968 function, it does have some advantages for certain types of matching
969 problem.
970
971 5. Upgrades to pcretest in order to test the features of pcre_dfa_exec(),
972 including restarting after a partial match.
973
974 6. A patch for pcregrep that defines INVALID_FILE_ATTRIBUTES if it is not
975 defined when compiling for Windows was sent to me. I have put it into the
976 code, though I have no means of testing or verifying it.
977
978 7. Added the pcre_refcount() auxiliary function.
979
980 8. Added the PCRE_FIRSTLINE option. This constrains an unanchored pattern to
981 match before or at the first newline in the subject string. In pcretest,
982 the /f option on a pattern can be used to set this.
983
984 9. A repeated \w when used in UTF-8 mode with characters greater than 256
985 would behave wrongly. This has been present in PCRE since release 4.0.
986
987 10. A number of changes to the pcregrep command:
988
989 (a) Refactored how -x works; insert ^(...)$ instead of setting
990 PCRE_ANCHORED and checking the length, in preparation for adding
991 something similar for -w.
992
993 (b) Added the -w (match as a word) option.
994
995 (c) Refactored the way lines are read and buffered so as to have more
996 than one at a time available.
997
998 (d) Implemented a pcregrep test script.
999
1000 (e) Added the -M (multiline match) option. This allows patterns to match
1001 over several lines of the subject. The buffering ensures that at least
1002 8K, or the rest of the document (whichever is the shorter) is available
1003 for matching (and similarly the previous 8K for lookbehind assertions).
1004
1005 (f) Changed the --help output so that it now says
1006
1007 -w, --word-regex(p)
1008
1009 instead of two lines, one with "regex" and the other with "regexp"
1010 because that confused at least one person since the short forms are the
1011 same. (This required a bit of code, as the output is generated
1012 automatically from a table. It wasn't just a text change.)
1013
1014 (g) -- can be used to terminate pcregrep options if the next thing isn't an
1015 option but starts with a hyphen. Could be a pattern or a path name
1016 starting with a hyphen, for instance.
1017
1018 (h) "-" can be given as a file name to represent stdin.
1019
1020 (i) When file names are being printed, "(standard input)" is used for
1021 the standard input, for compatibility with GNU grep. Previously
1022 "<stdin>" was used.
1023
1024 (j) The option --label=xxx can be used to supply a name to be used for
1025 stdin when file names are being printed. There is no short form.
1026
1027 (k) Re-factored the options decoding logic because we are going to add
1028 two more options that take data. Such options can now be given in four
1029 different ways, e.g. "-fname", "-f name", "--file=name", "--file name".
1030
1031 (l) Added the -A, -B, and -C options for requesting that lines of context
1032 around matches be printed.
1033
1034 (m) Added the -L option to print the names of files that do not contain
1035 any matching lines, that is, the complement of -l.
1036
1037 (n) The return code is 2 if any file cannot be opened, but pcregrep does
1038 continue to scan other files.
1039
1040 (o) The -s option was incorrectly implemented. For compatibility with other
1041 greps, it now suppresses the error message for a non-existent or non-
1042 accessible file (but not the return code). There is a new option called
1043 -q that suppresses the output of matching lines, which was what -s was
1044 previously doing.
1045
1046 (p) Added --include and --exclude options to specify files for inclusion
1047 and exclusion when recursing.
1048
1049 11. The Makefile was not using the Autoconf-supported LDFLAGS macro properly.
1050 Hopefully, it now does.
1051
1052 12. Missing cast in pcre_study().
1053
1054 13. Added an "uninstall" target to the makefile.
1055
1056 14. Replaced "extern" in the function prototypes in Makefile.in with
1057 "PCRE_DATA_SCOPE", which defaults to 'extern' or 'extern "C"' in the Unix
1058 world, but is set differently for Windows.
1059
1060 15. Added a second compiling function called pcre_compile2(). The only
1061 difference is that it has an extra argument, which is a pointer to an
1062 integer error code. When there is a compile-time failure, this is set
1063 non-zero, in addition to the error test pointer being set to point to an
1064 error message. The new argument may be NULL if no error number is required
1065 (but then you may as well call pcre_compile(), which is now just a
1066 wrapper). This facility is provided because some applications need a
1067 numeric error indication, but it has also enabled me to tidy up the way
1068 compile-time errors are handled in the POSIX wrapper.
1069
1070 16. Added VPATH=.libs to the makefile; this should help when building with one
1071 prefix path and installing with another. (Or so I'm told by someone who
1072 knows more about this stuff than I do.)
1073
1074 17. Added a new option, REG_DOTALL, to the POSIX function regcomp(). This
1075 passes PCRE_DOTALL to the pcre_compile() function, making the "." character
1076 match everything, including newlines. This is not POSIX-compatible, but
1077 somebody wanted the feature. From pcretest it can be activated by using
1078 both the P and the s flags.
1079
1080 18. AC_PROG_LIBTOOL appeared twice in Makefile.in. Removed one.
1081
1082 19. libpcre.pc was being incorrectly installed as executable.
1083
1084 20. A couple of places in pcretest check for end-of-line by looking for '\n';
1085 it now also looks for '\r' so that it will work unmodified on Windows.
1086
1087 21. Added Google's contributed C++ wrapper to the distribution.
1088
1089 22. Added some untidy missing memory free() calls in pcretest, to keep
1090 Electric Fence happy when testing.
1091
1092
1093
1094 Version 5.0 13-Sep-04
1095 ---------------------
1096
1097 1. Internal change: literal characters are no longer packed up into items
1098 containing multiple characters in a single byte-string. Each character
1099 is now matched using a separate opcode. However, there may be more than one
1100 byte in the character in UTF-8 mode.
1101
1102 2. The pcre_callout_block structure has two new fields: pattern_position and
1103 next_item_length. These contain the offset in the pattern to the next match
1104 item, and its length, respectively.
1105
1106 3. The PCRE_AUTO_CALLOUT option for pcre_compile() requests the automatic
1107 insertion of callouts before each pattern item. Added the /C option to
1108 pcretest to make use of this.
1109
1110 4. On the advice of a Windows user, the lines
1111
1112 #if defined(_WIN32) || defined(WIN32)
1113 _setmode( _fileno( stdout ), 0x8000 );
1114 #endif /* defined(_WIN32) || defined(WIN32) */
1115
1116 have been added to the source of pcretest. This apparently does useful
1117 magic in relation to line terminators.
1118
1119 5. Changed "r" and "w" in the calls to fopen() in pcretest to "rb" and "wb"
1120 for the benefit of those environments where the "b" makes a difference.
1121
1122 6. The icc compiler has the same options as gcc, but "configure" doesn't seem
1123 to know about it. I have put a hack into configure.in that adds in code
1124 to set GCC=yes if CC=icc. This seems to end up at a point in the
1125 generated configure script that is early enough to affect the setting of
1126 compiler options, which is what is needed, but I have no means of testing
1127 whether it really works. (The user who reported this had patched the
1128 generated configure script, which of course I cannot do.)
1129
1130 LATER: After change 22 below (new libtool files), the configure script
1131 seems to know about icc (and also ecc). Therefore, I have commented out
1132 this hack in configure.in.
1133
1134 7. Added support for pkg-config (2 patches were sent in).
1135
1136 8. Negated POSIX character classes that used a combination of internal tables
1137 were completely broken. These were [[:^alpha:]], [[:^alnum:]], and
1138 [[:^ascii]]. Typically, they would match almost any characters. The other
1139 POSIX classes were not broken in this way.
1140
1141 9. Matching the pattern "\b.*?" against "ab cd", starting at offset 1, failed
1142 to find the match, as PCRE was deluded into thinking that the match had to
1143 start at the start point or following a newline. The same bug applied to
1144 patterns with negative forward assertions or any backward assertions
1145 preceding ".*" at the start, unless the pattern required a fixed first
1146 character. This was a failing pattern: "(?!.bcd).*". The bug is now fixed.
1147
1148 10. In UTF-8 mode, when moving forwards in the subject after a failed match
1149 starting at the last subject character, bytes beyond the end of the subject
1150 string were read.
1151
1152 11. Renamed the variable "class" as "classbits" to make life easier for C++
1153 users. (Previously there was a macro definition, but it apparently wasn't
1154 enough.)
1155
1156 12. Added the new field "tables" to the extra data so that tables can be passed
1157 in at exec time, or the internal tables can be re-selected. This allows
1158 a compiled regex to be saved and re-used at a later time by a different
1159 program that might have everything at different addresses.
1160
1161 13. Modified the pcre-config script so that, when run on Solaris, it shows a
1162 -R library as well as a -L library.
1163
1164 14. The debugging options of pcretest (-d on the command line or D on a
1165 pattern) showed incorrect output for anything following an extended class
1166 that contained multibyte characters and which was followed by a quantifier.
1167
1168 15. Added optional support for general category Unicode character properties
1169 via the \p, \P, and \X escapes. Unicode property support implies UTF-8
1170 support. It adds about 90K to the size of the library. The meanings of the
1171 inbuilt class escapes such as \d and \s have NOT been changed.
1172
1173 16. Updated pcredemo.c to include calls to free() to release the memory for the
1174 compiled pattern.
1175
1176 17. The generated file chartables.c was being created in the source directory
1177 instead of in the building directory. This caused the build to fail if the
1178 source directory was different from the building directory, and was
1179 read-only.
1180
1181 18. Added some sample Win commands from Mark Tetrode into the NON-UNIX-USE
1182 file. No doubt somebody will tell me if they don't make sense... Also added
1183 Dan Mooney's comments about building on OpenVMS.
1184
1185 19. Added support for partial matching via the PCRE_PARTIAL option for
1186 pcre_exec() and the \P data escape in pcretest.
1187
1188 20. Extended pcretest with 3 new pattern features:
1189
1190 (i) A pattern option of the form ">rest-of-line" causes pcretest to
1191 write the compiled pattern to the file whose name is "rest-of-line".
1192 This is a straight binary dump of the data, with the saved pointer to
1193 the character tables forced to be NULL. The study data, if any, is
1194 written too. After writing, pcretest reads a new pattern.
1195
1196 (ii) If, instead of a pattern, "<rest-of-line" is given, pcretest reads a
1197 compiled pattern from the given file. There must not be any
1198 occurrences of "<" in the file name (pretty unlikely); if there are,
1199 pcretest will instead treat the initial "<" as a pattern delimiter.
1200 After reading in the pattern, pcretest goes on to read data lines as
1201 usual.
1202
1203 (iii) The F pattern option causes pcretest to flip the bytes in the 32-bit
1204 and 16-bit fields in a compiled pattern, to simulate a pattern that
1205 was compiled on a host of opposite endianness.
1206
1207 21. The pcre-exec() function can now cope with patterns that were compiled on
1208 hosts of opposite endianness, with this restriction:
1209
1210 As for any compiled expression that is saved and used later, the tables
1211 pointer field cannot be preserved; the extra_data field in the arguments
1212 to pcre_exec() should be used to pass in a tables address if a value
1213 other than the default internal tables were used at compile time.
1214
1215 22. Calling pcre_exec() with a negative value of the "ovecsize" parameter is
1216 now diagnosed as an error. Previously, most of the time, a negative number
1217 would have been treated as zero, but if in addition "ovector" was passed as
1218 NULL, a crash could occur.
1219
1220 23. Updated the files ltmain.sh, config.sub, config.guess, and aclocal.m4 with
1221 new versions from the libtool 1.5 distribution (the last one is a copy of
1222 a file called libtool.m4). This seems to have fixed the need to patch
1223 "configure" to support Darwin 1.3 (which I used to do). However, I still
1224 had to patch ltmain.sh to ensure that ${SED} is set (it isn't on my
1225 workstation).
1226
1227 24. Changed the PCRE licence to be the more standard "BSD" licence.
1228
1229
1230 Version 4.5 01-Dec-03
1231 ---------------------
1232
1233 1. There has been some re-arrangement of the code for the match() function so
1234 that it can be compiled in a version that does not call itself recursively.
1235 Instead, it keeps those local variables that need separate instances for
1236 each "recursion" in a frame on the heap, and gets/frees frames whenever it
1237 needs to "recurse". Keeping track of where control must go is done by means
1238 of setjmp/longjmp. The whole thing is implemented by a set of macros that
1239 hide most of the details from the main code, and operates only if
1240 NO_RECURSE is defined while compiling pcre.c. If PCRE is built using the
1241 "configure" mechanism, "--disable-stack-for-recursion" turns on this way of
1242 operating.
1243
1244 To make it easier for callers to provide specially tailored get/free
1245 functions for this usage, two new functions, pcre_stack_malloc, and
1246 pcre_stack_free, are used. They are always called in strict stacking order,
1247 and the size of block requested is always the same.
1248
1249 The PCRE_CONFIG_STACKRECURSE info parameter can be used to find out whether
1250 PCRE has been compiled to use the stack or the heap for recursion. The
1251 -C option of pcretest uses this to show which version is compiled.
1252
1253 A new data escape \S, is added to pcretest; it causes the amounts of store
1254 obtained and freed by both kinds of malloc/free at match time to be added
1255 to the output.
1256
1257 2. Changed the locale test to use "fr_FR" instead of "fr" because that's
1258 what's available on my current Linux desktop machine.
1259
1260 3. When matching a UTF-8 string, the test for a valid string at the start has
1261 been extended. If start_offset is not zero, PCRE now checks that it points
1262 to a byte that is the start of a UTF-8 character. If not, it returns
1263 PCRE_ERROR_BADUTF8_OFFSET (-11). Note: the whole string is still checked;
1264 this is necessary because there may be backward assertions in the pattern.
1265 When matching the same subject several times, it may save resources to use
1266 PCRE_NO_UTF8_CHECK on all but the first call if the string is long.
1267
1268 4. The code for checking the validity of UTF-8 strings has been tightened so
1269 that it rejects (a) strings containing 0xfe or 0xff bytes and (b) strings
1270 containing "overlong sequences".
1271
1272 5. Fixed a bug (appearing twice) that I could not find any way of exploiting!
1273 I had written "if ((digitab[*p++] && chtab_digit) == 0)" where the "&&"
1274 should have been "&", but it just so happened that all the cases this let
1275 through by mistake were picked up later in the function.
1276
1277 6. I had used a variable called "isblank" - this is a C99 function, causing
1278 some compilers to warn. To avoid this, I renamed it (as "blankclass").
1279
1280 7. Cosmetic: (a) only output another newline at the end of pcretest if it is
1281 prompting; (b) run "./pcretest /dev/null" at the start of the test script
1282 so the version is shown; (c) stop "make test" echoing "./RunTest".
1283
1284 8. Added patches from David Burgess to enable PCRE to run on EBCDIC systems.
1285
1286 9. The prototype for memmove() for systems that don't have it was using
1287 size_t, but the inclusion of the header that defines size_t was later. I've
1288 moved the #includes for the C headers earlier to avoid this.
1289
1290 10. Added some adjustments to the code to make it easier to compiler on certain
1291 special systems:
1292
1293 (a) Some "const" qualifiers were missing.
1294 (b) Added the macro EXPORT before all exported functions; by default this
1295 is defined to be empty.
1296 (c) Changed the dftables auxiliary program (that builds chartables.c) so
1297 that it reads its output file name as an argument instead of writing
1298 to the standard output and assuming this can be redirected.
1299
1300 11. In UTF-8 mode, if a recursive reference (e.g. (?1)) followed a character
1301 class containing characters with values greater than 255, PCRE compilation
1302 went into a loop.
1303
1304 12. A recursive reference to a subpattern that was within another subpattern
1305 that had a minimum quantifier of zero caused PCRE to crash. For example,
1306 (x(y(?2))z)? provoked this bug with a subject that got as far as the
1307 recursion. If the recursively-called subpattern itself had a zero repeat,
1308 that was OK.
1309
1310 13. In pcretest, the buffer for reading a data line was set at 30K, but the
1311 buffer into which it was copied (for escape processing) was still set at
1312 1024, so long lines caused crashes.
1313
1314 14. A pattern such as /[ab]{1,3}+/ failed to compile, giving the error
1315 "internal error: code overflow...". This applied to any character class
1316 that was followed by a possessive quantifier.
1317
1318 15. Modified the Makefile to add libpcre.la as a prerequisite for
1319 libpcreposix.la because I was told this is needed for a parallel build to
1320 work.
1321
1322 16. If a pattern that contained .* following optional items at the start was
1323 studied, the wrong optimizing data was generated, leading to matching
1324 errors. For example, studying /[ab]*.*c/ concluded, erroneously, that any
1325 matching string must start with a or b or c. The correct conclusion for
1326 this pattern is that a match can start with any character.
1327
1328
1329 Version 4.4 13-Aug-03
1330 ---------------------
1331
1332 1. In UTF-8 mode, a character class containing characters with values between
1333 127 and 255 was not handled correctly if the compiled pattern was studied.
1334 In fixing this, I have also improved the studying algorithm for such
1335 classes (slightly).
1336
1337 2. Three internal functions had redundant arguments passed to them. Removal
1338 might give a very teeny performance improvement.
1339
1340 3. Documentation bug: the value of the capture_top field in a callout is *one
1341 more than* the number of the hightest numbered captured substring.
1342
1343 4. The Makefile linked pcretest and pcregrep with -lpcre, which could result
1344 in incorrectly linking with a previously installed version. They now link
1345 explicitly with libpcre.la.
1346
1347 5. configure.in no longer needs to recognize Cygwin specially.
1348
1349 6. A problem in pcre.in for Windows platforms is fixed.
1350
1351 7. If a pattern was successfully studied, and the -d (or /D) flag was given to
1352 pcretest, it used to include the size of the study block as part of its
1353 output. Unfortunately, the structure contains a field that has a different
1354 size on different hardware architectures. This meant that the tests that
1355 showed this size failed. As the block is currently always of a fixed size,
1356 this information isn't actually particularly useful in pcretest output, so
1357 I have just removed it.
1358
1359 8. Three pre-processor statements accidentally did not start in column 1.
1360 Sadly, there are *still* compilers around that complain, even though
1361 standard C has not required this for well over a decade. Sigh.
1362
1363 9. In pcretest, the code for checking callouts passed small integers in the
1364 callout_data field, which is a void * field. However, some picky compilers
1365 complained about the casts involved for this on 64-bit systems. Now
1366 pcretest passes the address of the small integer instead, which should get
1367 rid of the warnings.
1368
1369 10. By default, when in UTF-8 mode, PCRE now checks for valid UTF-8 strings at
1370 both compile and run time, and gives an error if an invalid UTF-8 sequence
1371 is found. There is a option for disabling this check in cases where the
1372 string is known to be correct and/or the maximum performance is wanted.
1373
1374 11. In response to a bug report, I changed one line in Makefile.in from
1375
1376 -Wl,--out-implib,.libs/lib@[email protected] \
1377 to
1378 -Wl,--out-implib,.libs/@[email protected] \
1379
1380 to look similar to other lines, but I have no way of telling whether this
1381 is the right thing to do, as I do not use Windows. No doubt I'll get told
1382 if it's wrong...
1383
1384
1385 Version 4.3 21-May-03
1386 ---------------------
1387
1388 1. Two instances of @WIN_PREFIX@ omitted from the Windows targets in the
1389 Makefile.
1390
1391 2. Some refactoring to improve the quality of the code:
1392
1393 (i) The utf8_table... variables are now declared "const".
1394
1395 (ii) The code for \cx, which used the "case flipping" table to upper case
1396 lower case letters, now just substracts 32. This is ASCII-specific,
1397 but the whole concept of \cx is ASCII-specific, so it seems
1398 reasonable.
1399
1400 (iii) PCRE was using its character types table to recognize decimal and
1401 hexadecimal digits in the pattern. This is silly, because it handles
1402 only 0-9, a-f, and A-F, but the character types table is locale-
1403 specific, which means strange things might happen. A private
1404 table is now used for this - though it costs 256 bytes, a table is
1405 much faster than multiple explicit tests. Of course, the standard
1406 character types table is still used for matching digits in subject
1407 strings against \d.
1408
1409 (iv) Strictly, the identifier ESC_t is reserved by POSIX (all identifiers
1410 ending in _t are). So I've renamed it as ESC_tee.
1411
1412 3. The first argument for regexec() in the POSIX wrapper should have been
1413 defined as "const".
1414
1415 4. Changed pcretest to use malloc() for its buffers so that they can be
1416 Electric Fenced for debugging.
1417
1418 5. There were several places in the code where, in UTF-8 mode, PCRE would try
1419 to read one or more bytes before the start of the subject string. Often this
1420 had no effect on PCRE's behaviour, but in some circumstances it could
1421 provoke a segmentation fault.
1422
1423 6. A lookbehind at the start of a pattern in UTF-8 mode could also cause PCRE
1424 to try to read one or more bytes before the start of the subject string.
1425
1426 7. A lookbehind in a pattern matched in non-UTF-8 mode on a PCRE compiled with
1427 UTF-8 support could misbehave in various ways if the subject string
1428 contained bytes with the 0x80 bit set and the 0x40 bit unset in a lookbehind
1429 area. (PCRE was not checking for the UTF-8 mode flag, and trying to move
1430 back over UTF-8 characters.)
1431
1432
1433 Version 4.2 14-Apr-03
1434 ---------------------
1435
1436 1. Typo "#if SUPPORT_UTF8" instead of "#ifdef SUPPORT_UTF8" fixed.
1437
1438 2. Changes to the building process, supplied by Ronald Landheer-Cieslak
1439 [ON_WINDOWS]: new variable, "#" on non-Windows platforms
1440 [NOT_ON_WINDOWS]: new variable, "#" on Windows platforms
1441 [WIN_PREFIX]: new variable, "cyg" for Cygwin
1442 * Makefile.in: use autoconf substitution for OBJEXT, EXEEXT, BUILD_OBJEXT
1443 and BUILD_EXEEXT
1444 Note: automatic setting of the BUILD variables is not yet working
1445 set CPPFLAGS and BUILD_CPPFLAGS (but don't use yet) - should be used at
1446 compile-time but not at link-time
1447 [LINK]: use for linking executables only
1448 make different versions for Windows and non-Windows
1449 [LINKLIB]: new variable, copy of UNIX-style LINK, used for linking
1450 libraries
1451 [LINK_FOR_BUILD]: new variable
1452 [OBJEXT]: use throughout
1453 [EXEEXT]: use throughout
1454 <winshared>: new target
1455 <wininstall>: new target
1456 <dftables.o>: use native compiler
1457 <dftables>: use native linker
1458 <install>: handle Windows platform correctly
1459 <clean>: ditto
1460 <check>: ditto
1461 copy DLL to top builddir before testing
1462
1463 As part of these changes, -no-undefined was removed again. This was reported
1464 to give trouble on HP-UX 11.0, so getting rid of it seems like a good idea
1465 in any case.
1466
1467 3. Some tidies to get rid of compiler warnings:
1468
1469 . In the match_data structure, match_limit was an unsigned long int, whereas
1470 match_call_count was an int. I've made them both unsigned long ints.
1471
1472 . In pcretest the fact that a const uschar * doesn't automatically cast to
1473 a void * provoked a warning.
1474
1475 . Turning on some more compiler warnings threw up some "shadow" variables
1476 and a few more missing casts.
1477
1478 4. If PCRE was complied with UTF-8 support, but called without the PCRE_UTF8
1479 option, a class that contained a single character with a value between 128
1480 and 255 (e.g. /[\xFF]/) caused PCRE to crash.
1481
1482 5. If PCRE was compiled with UTF-8 support, but called without the PCRE_UTF8
1483 option, a class that contained several characters, but with at least one
1484 whose value was between 128 and 255 caused PCRE to crash.
1485
1486
1487 Version 4.1 12-Mar-03
1488 ---------------------
1489
1490 1. Compiling with gcc -pedantic found a couple of places where casts were
1491 needed, and a string in dftables.c that was longer than standard compilers are
1492 required to support.
1493
1494 2. Compiling with Sun's compiler found a few more places where the code could
1495 be tidied up in order to avoid warnings.
1496
1497 3. The variables for cross-compiling were called HOST_CC and HOST_CFLAGS; the
1498 first of these names is deprecated in the latest Autoconf in favour of the name
1499 CC_FOR_BUILD, because "host" is typically used to mean the system on which the
1500 compiled code will be run. I can't find a reference for HOST_CFLAGS, but by
1501 analogy I have changed it to CFLAGS_FOR_BUILD.
1502
1503 4. Added -no-undefined to the linking command in the Makefile, because this is
1504 apparently helpful for Windows. To make it work, also added "-L. -lpcre" to the
1505 linking step for the pcreposix library.
1506
1507 5. PCRE was failing to diagnose the case of two named groups with the same
1508 name.
1509
1510 6. A problem with one of PCRE's optimizations was discovered. PCRE remembers a
1511 literal character that is needed in the subject for a match, and scans along to
1512 ensure that it is present before embarking on the full matching process. This
1513 saves time in cases of nested unlimited repeats that are never going to match.
1514 Problem: the scan can take a lot of time if the subject is very long (e.g.
1515 megabytes), thus penalizing straightforward matches. It is now done only if the
1516 amount of subject to be scanned is less than 1000 bytes.
1517
1518 7. A lesser problem with the same optimization is that it was recording the
1519 first character of an anchored pattern as "needed", thus provoking a search
1520 right along the subject, even when the first match of the pattern was going to
1521 fail. The "needed" character is now not set for anchored patterns, unless it
1522 follows something in the pattern that is of non-fixed length. Thus, it still
1523 fulfils its original purpose of finding quick non-matches in cases of nested
1524 unlimited repeats, but isn't used for simple anchored patterns such as /^abc/.
1525
1526
1527 Version 4.0 17-Feb-03
1528 ---------------------
1529
1530 1. If a comment in an extended regex that started immediately after a meta-item
1531 extended to the end of string, PCRE compiled incorrect data. This could lead to
1532 all kinds of weird effects. Example: /#/ was bad; /()#/ was bad; /a#/ was not.
1533
1534 2. Moved to autoconf 2.53 and libtool 1.4.2.
1535
1536 3. Perl 5.8 no longer needs "use utf8" for doing UTF-8 things. Consequently,
1537 the special perltest8 script is no longer needed - all the tests can be run
1538 from a single perltest script.
1539
1540 4. From 5.004, Perl has not included the VT character (0x0b) in the set defined
1541 by \s. It has now been removed in PCRE. This means it isn't recognized as
1542 whitespace in /x regexes too, which is the same as Perl. Note that the POSIX
1543 class [:space:] *does* include VT, thereby creating a mess.
1544
1545 5. Added the class [:blank:] (a GNU extension from Perl 5.8) to match only
1546 space and tab.
1547
1548 6. Perl 5.005 was a long time ago. It's time to amalgamate the tests that use
1549 its new features into the main test script, reducing the number of scripts.
1550
1551 7. Perl 5.8 has changed the meaning of patterns like /a(?i)b/. Earlier versions
1552 were backward compatible, and made the (?i) apply to the whole pattern, as if
1553 /i were given. Now it behaves more logically, and applies the option setting
1554 only to what follows. PCRE has been changed to follow suit. However, if it
1555 finds options settings right at the start of the pattern, it extracts them into
1556 the global options, as before. Thus, they show up in the info data.
1557
1558 8. Added support for the \Q...\E escape sequence. Characters in between are
1559 treated as literals. This is slightly different from Perl in that $ and @ are
1560 also handled as literals inside the quotes. In Perl, they will cause variable
1561 interpolation. Note the following examples:
1562
1563 Pattern PCRE matches Perl matches
1564
1565 \Qabc$xyz\E abc$xyz abc followed by the contents of $xyz
1566 \Qabc\$xyz\E abc\$xyz abc\$xyz
1567 \Qabc\E\$\Qxyz\E abc$xyz abc$xyz
1568
1569 For compatibility with Perl, \Q...\E sequences are recognized inside character
1570 classes as well as outside them.
1571
1572 9. Re-organized 3 code statements in pcretest to avoid "overflow in
1573 floating-point constant arithmetic" warnings from a Microsoft compiler. Added a
1574 (size_t) cast to one statement in pcretest and one in pcreposix to avoid
1575 signed/unsigned warnings.
1576
1577 10. SunOS4 doesn't have strtoul(). This was used only for unpicking the -o
1578 option for pcretest, so I've replaced it by a simple function that does just
1579 that job.
1580
1581 11. pcregrep was ending with code 0 instead of 2 for the commands "pcregrep" or
1582 "pcregrep -".
1583
1584 12. Added "possessive quantifiers" ?+, *+, ++, and {,}+ which come from Sun's
1585 Java package. This provides some syntactic sugar for simple cases of what my
1586 documentation calls "once-only subpatterns". A pattern such as x*+ is the same
1587 as (?>x*). In other words, if what is inside (?>...) is just a single repeated
1588 item, you can use this simplified notation. Note that only makes sense with
1589 greedy quantifiers. Consequently, the use of the possessive quantifier forces
1590 greediness, whatever the setting of the PCRE_UNGREEDY option.
1591
1592 13. A change of greediness default within a pattern was not taking effect at
1593 the current level for patterns like /(b+(?U)a+)/. It did apply to parenthesized
1594 subpatterns that followed. Patterns like /b+(?U)a+/ worked because the option
1595 was abstracted outside.
1596
1597 14. PCRE now supports the \G assertion. It is true when the current matching
1598 position is at the start point of the match. This differs from \A when the
1599 starting offset is non-zero. Used with the /g option of pcretest (or similar
1600 code), it works in the same way as it does for Perl's /g option. If all
1601 alternatives of a regex begin with \G, the expression is anchored to the start
1602 match position, and the "anchored" flag is set in the compiled expression.
1603
1604 15. Some bugs concerning the handling of certain option changes within patterns
1605 have been fixed. These applied to options other than (?ims). For example,
1606 "a(?x: b c )d" did not match "XabcdY" but did match "Xa b c dY". It should have
1607 been the other way round. Some of this was related to change 7 above.
1608
1609 16. PCRE now gives errors for /[.x.]/ and /[=x=]/ as unsupported POSIX
1610 features, as Perl does. Previously, PCRE gave the warnings only for /[[.x.]]/
1611 and /[[=x=]]/. PCRE now also gives an error for /[:name:]/ because it supports
1612 POSIX classes only within a class (e.g. /[[:alpha:]]/).
1613
1614 17. Added support for Perl's \C escape. This matches one byte, even in UTF8
1615 mode. Unlike ".", it always matches newline, whatever the setting of
1616 PCRE_DOTALL. However, PCRE does not permit \C to appear in lookbehind
1617 assertions. Perl allows it, but it doesn't (in general) work because it can't
1618 calculate the length of the lookbehind. At least, that's the case for Perl
1619 5.8.0 - I've been told they are going to document that it doesn't work in
1620 future.
1621
1622 18. Added an error diagnosis for escapes that PCRE does not support: these are
1623 \L, \l, \N, \P, \p, \U, \u, and \X.
1624
1625 19. Although correctly diagnosing a missing ']' in a character class, PCRE was
1626 reading past the end of the pattern in cases such as /[abcd/.
1627
1628 20. PCRE was getting more memory than necessary for patterns with classes that
1629 contained both POSIX named classes and other characters, e.g. /[[:space:]abc/.
1630
1631 21. Added some code, conditional on #ifdef VPCOMPAT, to make life easier for
1632 compiling PCRE for use with Virtual Pascal.
1633
1634 22. Small fix to the Makefile to make it work properly if the build is done
1635 outside the source tree.
1636
1637 23. Added a new extension: a condition to go with recursion. If a conditional
1638 subpattern starts with (?(R) the "true" branch is used if recursion has
1639 happened, whereas the "false" branch is used only at the top level.
1640
1641 24. When there was a very long string of literal characters (over 255 bytes
1642 without UTF support, over 250 bytes with UTF support), the computation of how
1643 much memory was required could be incorrect, leading to segfaults or other
1644 strange effects.
1645
1646 25. PCRE was incorrectly assuming anchoring (either to start of subject or to
1647 start of line for a non-DOTALL pattern) when a pattern started with (.*) and
1648 there was a subsequent back reference to those brackets. This meant that, for
1649 example, /(.*)\d+\1/ failed to match "abc123bc". Unfortunately, it isn't
1650 possible to check for precisely this case. All we can do is abandon the
1651 optimization if .* occurs inside capturing brackets when there are any back
1652 references whatsoever. (See below for a better fix that came later.)
1653
1654 26. The handling of the optimization for finding the first character of a
1655 non-anchored pattern, and for finding a character that is required later in the
1656 match were failing in some cases. This didn't break the matching; it just
1657 failed to optimize when it could. The way this is done has been re-implemented.
1658
1659 27. Fixed typo in error message for invalid (?R item (it said "(?p").
1660
1661 28. Added a new feature that provides some of the functionality that Perl
1662 provides with (?{...}). The facility is termed a "callout". The way it is done
1663 in PCRE is for the caller to provide an optional function, by setting
1664 pcre_callout to its entry point. Like pcre_malloc and pcre_free, this is a
1665 global variable. By default it is unset, which disables all calling out. To get
1666 the function called, the regex must include (?C) at appropriate points. This
1667 is, in fact, equivalent to (?C0), and any number <= 255 may be given with (?C).
1668 This provides a means of identifying different callout points. When PCRE
1669 reaches such a point in the regex, if pcre_callout has been set, the external
1670 function is called. It is provided with data in a structure called
1671 pcre_callout_block, which is defined in pcre.h. If the function returns 0,
1672 matching continues; if it returns a non-zero value, the match at the current
1673 point fails. However, backtracking will occur if possible. [This was changed
1674 later and other features added - see item 49 below.]
1675
1676 29. pcretest is upgraded to test the callout functionality. It provides a
1677 callout function that displays information. By default, it shows the start of
1678 the match and the current position in the text. There are some new data escapes
1679 to vary what happens:
1680
1681 \C+ in addition, show current contents of captured substrings
1682 \C- do not supply a callout function
1683 \C!n return 1 when callout number n is reached
1684 \C!n!m return 1 when callout number n is reached for the mth time
1685
1686 30. If pcregrep was called with the -l option and just a single file name, it
1687 output "<stdin>" if a match was found, instead of the file name.
1688
1689 31. Improve the efficiency of the POSIX API to PCRE. If the number of capturing
1690 slots is less than POSIX_MALLOC_THRESHOLD, use a block on the stack to pass to
1691 pcre_exec(). This saves a malloc/free per call. The default value of
1692 POSIX_MALLOC_THRESHOLD is 10; it can be changed by --with-posix-malloc-threshold
1693 when configuring.
1694
1695 32. The default maximum size of a compiled pattern is 64K. There have been a
1696 few cases of people hitting this limit. The code now uses macros to handle the
1697 storing of links as offsets within the compiled pattern. It defaults to 2-byte
1698 links, but this can be changed to 3 or 4 bytes by --with-link-size when
1699 configuring. Tests 2 and 5 work only with 2-byte links because they output
1700 debugging information about compiled patterns.
1701
1702 33. Internal code re-arrangements:
1703
1704 (a) Moved the debugging function for printing out a compiled regex into
1705 its own source file (printint.c) and used #include to pull it into
1706 pcretest.c and, when DEBUG is defined, into pcre.c, instead of having two
1707 separate copies.
1708
1709 (b) Defined the list of op-code names for debugging as a macro in
1710 internal.h so that it is next to the definition of the opcodes.
1711
1712 (c) Defined a table of op-code lengths for simpler skipping along compiled
1713 code. This is again a macro in internal.h so that it is next to the
1714 definition of the opcodes.
1715
1716 34. Added support for recursive calls to individual subpatterns, along the
1717 lines of Robin Houston's patch (but implemented somewhat differently).
1718
1719 35. Further mods to the Makefile to help Win32. Also, added code to pcregrep to
1720 allow it to read and process whole directories in Win32. This code was
1721 contributed by Lionel Fourquaux; it has not been tested by me.
1722
1723 36. Added support for named subpatterns. The Python syntax (?P<name>...) is
1724 used to name a group. Names consist of alphanumerics and underscores, and must
1725 be unique. Back references use the syntax (?P=name) and recursive calls use
1726 (?P>name) which is a PCRE extension to the Python extension. Groups still have
1727 numbers. The function pcre_fullinfo() can be used after compilation to extract
1728 a name/number map. There are three relevant calls:
1729
1730 PCRE_INFO_NAMEENTRYSIZE yields the size of each entry in the map
1731 PCRE_INFO_NAMECOUNT yields the number of entries
1732 PCRE_INFO_NAMETABLE yields a pointer to the map.
1733
1734 The map is a vector of fixed-size entries. The size of each entry depends on
1735 the length of the longest name used. The first two bytes of each entry are the
1736 group number, most significant byte first. There follows the corresponding
1737 name, zero terminated. The names are in alphabetical order.
1738
1739 37. Make the maximum literal string in the compiled code 250 for the non-UTF-8
1740 case instead of 255. Making it the same both with and without UTF-8 support
1741 means that the same test output works with both.
1742
1743 38. There was a case of malloc(0) in the POSIX testing code in pcretest. Avoid
1744 calling malloc() with a zero argument.
1745
1746 39. Change 25 above had to resort to a heavy-handed test for the .* anchoring
1747 optimization. I've improved things by keeping a bitmap of backreferences with
1748 numbers 1-31 so that if .* occurs inside capturing brackets that are not in
1749 fact referenced, the optimization can be applied. It is unlikely that a
1750 relevant occurrence of .* (i.e. one which might indicate anchoring or forcing
1751 the match to follow \n) will appear inside brackets with a number greater than
1752 31, but if it does, any back reference > 31 suppresses the optimization.
1753
1754 40. Added a new compile-time option PCRE_NO_AUTO_CAPTURE. This has the effect
1755 of disabling numbered capturing parentheses. Any opening parenthesis that is
1756 not followed by ? behaves as if it were followed by ?: but named parentheses
1757 can still be used for capturing (and they will acquire numbers in the usual
1758 way).
1759
1760 41. Redesigned the return codes from the match() function into yes/no/error so
1761 that errors can be passed back from deep inside the nested calls. A malloc
1762 failure while inside a recursive subpattern call now causes the
1763 PCRE_ERROR_NOMEMORY return instead of quietly going wrong.
1764
1765 42. It is now possible to set a limit on the number of times the match()
1766 function is called in a call to pcre_exec(). This facility makes it possible to
1767 limit the amount of recursion and backtracking, though not in a directly
1768 obvious way, because the match() function is used in a number of different
1769 circumstances. The count starts from zero for each position in the subject
1770 string (for non-anchored patterns). The default limit is, for compatibility, a
1771 large number, namely 10 000 000. You can change this in two ways:
1772
1773 (a) When configuring PCRE before making, you can use --with-match-limit=n
1774 to set a default value for the compiled library.
1775
1776 (b) For each call to pcre_exec(), you can pass a pcre_extra block in which
1777 a different value is set. See 45 below.
1778
1779 If the limit is exceeded, pcre_exec() returns PCRE_ERROR_MATCHLIMIT.
1780
1781 43. Added a new function pcre_config(int, void *) to enable run-time extraction
1782 of things that can be changed at compile time. The first argument specifies
1783 what is wanted and the second points to where the information is to be placed.
1784 The current list of available information is:
1785
1786 PCRE_CONFIG_UTF8
1787
1788 The output is an integer that is set to one if UTF-8 support is available;
1789 otherwise it is set to zero.
1790
1791 PCRE_CONFIG_NEWLINE
1792
1793 The output is an integer that it set to the value of the code that is used for
1794 newline. It is either LF (10) or CR (13).
1795
1796 PCRE_CONFIG_LINK_SIZE
1797
1798 The output is an integer that contains the number of bytes used for internal
1799 linkage in compiled expressions. The value is 2, 3, or 4. See item 32 above.
1800
1801 PCRE_CONFIG_POSIX_MALLOC_THRESHOLD
1802
1803 The output is an integer that contains the threshold above which the POSIX
1804 interface uses malloc() for output vectors. See item 31 above.
1805
1806 PCRE_CONFIG_MATCH_LIMIT
1807
1808 The output is an unsigned integer that contains the default limit of the number
1809 of match() calls in a pcre_exec() execution. See 42 above.
1810
1811 44. pcretest has been upgraded by the addition of the -C option. This causes it
1812 to extract all the available output from the new pcre_config() function, and to
1813 output it. The program then exits immediately.
1814
1815 45. A need has arisen to pass over additional data with calls to pcre_exec() in
1816 order to support additional features. One way would have been to define
1817 pcre_exec2() (for example) with extra arguments, but this would not have been
1818 extensible, and would also have required all calls to the original function to
1819 be mapped to the new one. Instead, I have chosen to extend the mechanism that
1820 is used for passing in "extra" data from pcre_study().
1821
1822 The pcre_extra structure is now exposed and defined in pcre.h. It currently
1823 contains the following fields:
1824
1825 flags a bitmap indicating which of the following fields are set
1826 study_data opaque data from pcre_study()
1827 match_limit a way of specifying a limit on match() calls for a specific
1828 call to pcre_exec()
1829 callout_data data for callouts (see 49 below)
1830
1831 The flag bits are also defined in pcre.h, and are
1832
1833 PCRE_EXTRA_STUDY_DATA
1834 PCRE_EXTRA_MATCH_LIMIT
1835 PCRE_EXTRA_CALLOUT_DATA
1836
1837 The pcre_study() function now returns one of these new pcre_extra blocks, with
1838 the actual study data pointed to by the study_data field, and the
1839 PCRE_EXTRA_STUDY_DATA flag set. This can be passed directly to pcre_exec() as
1840 before. That is, this change is entirely upwards-compatible and requires no
1841 change to existing code.
1842
1843 If you want to pass in additional data to pcre_exec(), you can either place it
1844 in a pcre_extra block provided by pcre_study(), or create your own pcre_extra
1845 block.
1846
1847 46. pcretest has been extended to test the PCRE_EXTRA_MATCH_LIMIT feature. If a
1848 data string contains the escape sequence \M, pcretest calls pcre_exec() several
1849 times with different match limits, until it finds the minimum value needed for
1850 pcre_exec() to complete. The value is then output. This can be instructive; for
1851 most simple matches the number is quite small, but for pathological cases it
1852 gets very large very quickly.
1853
1854 47. There's a new option for pcre_fullinfo() called PCRE_INFO_STUDYSIZE. It
1855 returns the size of the data block pointed to by the study_data field in a
1856 pcre_extra block, that is, the value that was passed as the argument to
1857 pcre_malloc() when PCRE was getting memory in which to place the information
1858 created by pcre_study(). The fourth argument should point to a size_t variable.
1859 pcretest has been extended so that this information is shown after a successful
1860 pcre_study() call when information about the compiled regex is being displayed.
1861
1862 48. Cosmetic change to Makefile: there's no need to have / after $(DESTDIR)
1863 because what follows is always an absolute path. (Later: it turns out that this
1864 is more than cosmetic for MinGW, because it doesn't like empty path
1865 components.)
1866
1867 49. Some changes have been made to the callout feature (see 28 above):
1868
1869 (i) A callout function now has three choices for what it returns:
1870
1871 0 => success, carry on matching
1872 > 0 => failure at this point, but backtrack if possible
1873 < 0 => serious error, return this value from pcre_exec()
1874
1875 Negative values should normally be chosen from the set of PCRE_ERROR_xxx
1876 values. In particular, returning PCRE_ERROR_NOMATCH forces a standard
1877 "match failed" error. The error number PCRE_ERROR_CALLOUT is reserved for
1878 use by callout functions. It will never be used by PCRE itself.
1879
1880 (ii) The pcre_extra structure (see 45 above) has a void * field called
1881 callout_data, with corresponding flag bit PCRE_EXTRA_CALLOUT_DATA. The
1882 pcre_callout_block structure has a field of the same name. The contents of
1883 the field passed in the pcre_extra structure are passed to the callout
1884 function in the corresponding field in the callout block. This makes it
1885 easier to use the same callout-containing regex from multiple threads. For
1886 testing, the pcretest program has a new data escape
1887
1888 \C*n pass the number n (may be negative) as callout_data
1889
1890 If the callout function in pcretest receives a non-zero value as
1891 callout_data, it returns that value.
1892
1893 50. Makefile wasn't handling CFLAGS properly when compiling dftables. Also,
1894 there were some redundant $(CFLAGS) in commands that are now specified as
1895 $(LINK), which already includes $(CFLAGS).
1896
1897 51. Extensions to UTF-8 support are listed below. These all apply when (a) PCRE
1898 has been compiled with UTF-8 support *and* pcre_compile() has been compiled
1899 with the PCRE_UTF8 flag. Patterns that are compiled without that flag assume
1900 one-byte characters throughout. Note that case-insensitive matching applies
1901 only to characters whose values are less than 256. PCRE doesn't support the
1902 notion of cases for higher-valued characters.
1903
1904 (i) A character class whose characters are all within 0-255 is handled as
1905 a bit map, and the map is inverted for negative classes. Previously, a
1906 character > 255 always failed to match such a class; however it should
1907 match if the class was a negative one (e.g. [^ab]). This has been fixed.
1908
1909 (ii) A negated character class with a single character < 255 is coded as
1910 "not this character" (OP_NOT). This wasn't working properly when the test
1911 character was multibyte, either singly or repeated.
1912
1913 (iii) Repeats of multibyte characters are now handled correctly in UTF-8
1914 mode, for example: \x{100}{2,3}.
1915
1916 (iv) The character escapes \b, \B, \d, \D, \s, \S, \w, and \W (either
1917 singly or repeated) now correctly test multibyte characters. However,
1918 PCRE doesn't recognize any characters with values greater than 255 as
1919 digits, spaces, or word characters. Such characters always match \D, \S,
1920 and \W, and never match \d, \s, or \w.
1921
1922 (v) Classes may now contain characters and character ranges with values
1923 greater than 255. For example: [ab\x{100}-\x{400}].
1924
1925 (vi) pcregrep now has a --utf-8 option (synonym -u) which makes it call
1926 PCRE in UTF-8 mode.
1927
1928 52. The info request value PCRE_INFO_FIRSTCHAR has been renamed
1929 PCRE_INFO_FIRSTBYTE because it is a byte value. However, the old name is
1930 retained for backwards compatibility. (Note that LASTLITERAL is also a byte
1931 value.)
1932
1933 53. The single man page has become too large. I have therefore split it up into
1934 a number of separate man pages. These also give rise to individual HTML pages;
1935 these are now put in a separate directory, and there is an index.html page that
1936 lists them all. Some hyperlinking between the pages has been installed.
1937
1938 54. Added convenience functions for handling named capturing parentheses.
1939
1940 55. Unknown escapes inside character classes (e.g. [\M]) and escapes that
1941 aren't interpreted therein (e.g. [\C]) are literals in Perl. This is now also
1942 true in PCRE, except when the PCRE_EXTENDED option is set, in which case they
1943 are faulted.
1944
1945 56. Introduced HOST_CC and HOST_CFLAGS which can be set in the environment when
1946 calling configure. These values are used when compiling the dftables.c program
1947 which is run to generate the source of the default character tables. They
1948 default to the values of CC and CFLAGS. If you are cross-compiling PCRE,
1949 you will need to set these values.
1950
1951 57. Updated the building process for Windows DLL, as provided by Fred Cox.
1952
1953
1954 Version 3.9 02-Jan-02
1955 ---------------------
1956
1957 1. A bit of extraneous text had somehow crept into the pcregrep documentation.
1958
1959 2. If --disable-static was given, the building process failed when trying to
1960 build pcretest and pcregrep. (For some reason it was using libtool to compile
1961 them, which is not right, as they aren't part of the library.)
1962
1963
1964 Version 3.8 18-Dec-01
1965 ---------------------
1966
1967 1. The experimental UTF-8 code was completely screwed up. It was packing the
1968 bytes in the wrong order. How dumb can you get?
1969
1970
1971 Version 3.7 29-Oct-01
1972 ---------------------
1973
1974 1. In updating pcretest to check change 1 of version 3.6, I screwed up.
1975 This caused pcretest, when used on the test data, to segfault. Unfortunately,
1976 this didn't happen under Solaris 8, where I normally test things.
1977
1978 2. The Makefile had to be changed to make it work on BSD systems, where 'make'
1979 doesn't seem to recognize that ./xxx and xxx are the same file. (This entry
1980 isn't in ChangeLog distributed with 3.7 because I forgot when I hastily made
1981 this fix an hour or so after the initial 3.7 release.)
1982
1983
1984 Version 3.6 23-Oct-01
1985 ---------------------
1986
1987 1. Crashed with /(sens|respons)e and \1ibility/ and "sense and sensibility" if
1988 offsets passed as NULL with zero offset count.
1989
1990 2. The config.guess and config.sub files had not been updated when I moved to
1991 the latest autoconf.
1992
1993
1994 Version 3.5 15-Aug-01
1995 ---------------------
1996
1997 1. Added some missing #if !defined NOPOSIX conditionals in pcretest.c that
1998 had been forgotten.
1999
2000 2. By using declared but undefined structures, we can avoid using "void"
2001 definitions in pcre.h while keeping the internal definitions of the structures
2002 private.
2003
2004 3. The distribution is now built using autoconf 2.50 and libtool 1.4. From a
2005 user point of view, this means that both static and shared libraries are built
2006 by default, but this can be individually controlled. More of the work of
2007 handling this static/shared cases is now inside libtool instead of PCRE's make
2008 file.
2009
2010 4. The pcretest utility is now installed along with pcregrep because it is
2011 useful for users (to test regexs) and by doing this, it automatically gets
2012 relinked by libtool. The documentation has been turned into a man page, so
2013 there are now .1, .txt, and .html versions in /doc.
2014
2015 5. Upgrades to pcregrep:
2016 (i) Added long-form option names like gnu grep.
2017 (ii) Added --help to list all options with an explanatory phrase.
2018 (iii) Added -r, --recursive to recurse into sub-directories.
2019 (iv) Added -f, --file to read patterns from a file.
2020
2021 6. pcre_exec() was referring to its "code" argument before testing that
2022 argument for NULL (and giving an error if it was NULL).
2023
2024 7. Upgraded Makefile.in to allow for compiling in a different directory from
2025 the source directory.
2026
2027 8. Tiny buglet in pcretest: when pcre_fullinfo() was called to retrieve the
2028 options bits, the pointer it was passed was to an int instead of to an unsigned
2029 long int. This mattered only on 64-bit systems.
2030
2031 9. Fixed typo (3.4/1) in pcre.h again. Sigh. I had changed pcre.h (which is
2032 generated) instead of pcre.in, which it its source. Also made the same change
2033 in several of the .c files.
2034
2035 10. A new release of gcc defines printf() as a macro, which broke pcretest
2036 because it had an ifdef in the middle of a string argument for printf(). Fixed
2037 by using separate calls to printf().
2038
2039 11. Added --enable-newline-is-cr and --enable-newline-is-lf to the configure
2040 script, to force use of CR or LF instead of \n in the source. On non-Unix
2041 systems, the value can be set in config.h.
2042
2043 12. The limit of 200 on non-capturing parentheses is a _nesting_ limit, not an
2044 absolute limit. Changed the text of the error message to make this clear, and
2045 likewise updated the man page.
2046
2047 13. The limit of 99 on the number of capturing subpatterns has been removed.
2048 The new limit is 65535, which I hope will not be a "real" limit.
2049
2050
2051 Version 3.4 22-Aug-00
2052 ---------------------
2053
2054 1. Fixed typo in pcre.h: unsigned const char * changed to const unsigned char *.
2055
2056 2. Diagnose condition (?(0) as an error instead of crashing on matching.
2057
2058
2059 Version 3.3 01-Aug-00
2060 ---------------------
2061
2062 1. If an octal character was given, but the value was greater than \377, it
2063 was not getting masked to the least significant bits, as documented. This could
2064 lead to crashes in some systems.
2065
2066 2. Perl 5.6 (if not earlier versions) accepts classes like [a-\d] and treats
2067 the hyphen as a literal. PCRE used to give an error; it now behaves like Perl.
2068
2069 3. Added the functions pcre_free_substring() and pcre_free_substring_list().
2070 These just pass their arguments on to (pcre_free)(), but they are provided
2071 because some uses of PCRE bind it to non-C systems that can call its functions,
2072 but cannot call free() or pcre_free() directly.
2073
2074 4. Add "make test" as a synonym for "make check". Corrected some comments in
2075 the Makefile.
2076
2077 5. Add $(DESTDIR)/ in front of all the paths in the "install" target in the
2078 Makefile.
2079
2080 6. Changed the name of pgrep to pcregrep, because Solaris has introduced a
2081 command called pgrep for grepping around the active processes.
2082
2083 7. Added the beginnings of support for UTF-8 character strings.
2084
2085 8. Arranged for the Makefile to pass over the settings of CC, CFLAGS, and
2086 RANLIB to ./ltconfig so that they are used by libtool. I think these are all
2087 the relevant ones. (AR is not passed because ./ltconfig does its own figuring
2088 out for the ar command.)
2089
2090
2091 Version 3.2 12-May-00
2092 ---------------------
2093
2094 This is purely a bug fixing release.
2095
2096 1. If the pattern /((Z)+|A)*/ was matched agained ZABCDEFG it matched Z instead
2097 of ZA. This was just one example of several cases that could provoke this bug,
2098 which was introduced by change 9 of version 2.00. The code for breaking
2099 infinite loops after an iteration that matches an empty string was't working
2100 correctly.
2101
2102 2. The pcretest program was not imitating Perl correctly for the pattern /a*/g
2103 when matched against abbab (for example). After matching an empty string, it
2104 wasn't forcing anchoring when setting PCRE_NOTEMPTY for the next attempt; this
2105 caused it to match further down the string than it should.
2106
2107 3. The code contained an inclusion of sys/types.h. It isn't clear why this
2108 was there because it doesn't seem to be needed, and it causes trouble on some
2109 systems, as it is not a Standard C header. It has been removed.
2110
2111 4. Made 4 silly changes to the source to avoid stupid compiler warnings that
2112 were reported on the Macintosh. The changes were from
2113
2114 while ((c = *(++ptr)) != 0 && c != '\n');
2115 to
2116 while ((c = *(++ptr)) != 0 && c != '\n') ;
2117
2118 Totally extraordinary, but if that's what it takes...
2119
2120 5. PCRE is being used in one environment where neither memmove() nor bcopy() is
2121 available. Added HAVE_BCOPY and an autoconf test for it; if neither
2122 HAVE_MEMMOVE nor HAVE_BCOPY is set, use a built-in emulation function which
2123 assumes the way PCRE uses memmove() (always moving upwards).
2124
2125 6. PCRE is being used in one environment where strchr() is not available. There
2126 was only one use in pcre.c, and writing it out to avoid strchr() probably gives
2127 faster code anyway.
2128
2129
2130 Version 3.1 09-Feb-00
2131 ---------------------
2132
2133 The only change in this release is the fixing of some bugs in Makefile.in for
2134 the "install" target:
2135
2136 (1) It was failing to install pcreposix.h.
2137
2138 (2) It was overwriting the pcre.3 man page with the pcreposix.3 man page.
2139
2140
2141 Version 3.0 01-Feb-00
2142 ---------------------
2143
2144 1. Add support for the /+ modifier to perltest (to output $` like it does in
2145 pcretest).
2146
2147 2. Add support for the /g modifier to perltest.
2148
2149 3. Fix pcretest so that it behaves even more like Perl for /g when the pattern
2150 matches null strings.
2151
2152 4. Fix perltest so that it doesn't do unwanted things when fed an empty
2153 pattern. Perl treats empty patterns specially - it reuses the most recent
2154 pattern, which is not what we want. Replace // by /(?#)/ in order to avoid this
2155 effect.
2156
2157 5. The POSIX interface was broken in that it was just handing over the POSIX
2158 captured string vector to pcre_exec(), but (since release 2.00) PCRE has
2159 required a bigger vector, with some working space on the end. This means that
2160 the POSIX wrapper now has to get and free some memory, and copy the results.
2161
2162 6. Added some simple autoconf support, placing the test data and the
2163 documentation in separate directories, re-organizing some of the
2164 information files, and making it build pcre-config (a GNU standard). Also added
2165 libtool support for building PCRE as a shared library, which is now the
2166 default.
2167
2168 7. Got rid of the leading zero in the definition of PCRE_MINOR because 08 and
2169 09 are not valid octal constants. Single digits will be used for minor values
2170 less than 10.
2171
2172 8. Defined REG_EXTENDED and REG_NOSUB as zero in the POSIX header, so that
2173 existing programs that set these in the POSIX interface can use PCRE without
2174 modification.
2175
2176 9. Added a new function, pcre_fullinfo() with an extensible interface. It can
2177 return all that pcre_info() returns, plus additional data. The pcre_info()
2178 function is retained for compatibility, but is considered to be obsolete.
2179
2180 10. Added experimental recursion feature (?R) to handle one common case that
2181 Perl 5.6 will be able to do with (?p{...}).
2182
2183 11. Added support for POSIX character classes like [:alpha:], which Perl is
2184 adopting.
2185
2186
2187 Version 2.08 31-Aug-99
2188 ----------------------
2189
2190 1. When startoffset was not zero and the pattern began with ".*", PCRE was not
2191 trying to match at the startoffset position, but instead was moving forward to
2192 the next newline as if a previous match had failed.
2193
2194 2. pcretest was not making use of PCRE_NOTEMPTY when repeating for /g and /G,
2195 and could get into a loop if a null string was matched other than at the start
2196 of the subject.
2197
2198 3. Added definitions of PCRE_MAJOR and PCRE_MINOR to pcre.h so the version can
2199 be distinguished at compile time, and for completeness also added PCRE_DATE.
2200
2201 5. Added Paul Sokolovsky's minor changes to make it easy to compile a Win32 DLL
2202 in GnuWin32 environments.
2203
2204
2205 Version 2.07 29-Jul-99
2206 ----------------------
2207
2208 1. The documentation is now supplied in plain text form and HTML as well as in
2209 the form of man page sources.
2210
2211 2. C++ compilers don't like assigning (void *) values to other pointer types.
2212 In particular this affects malloc(). Although there is no problem in Standard
2213 C, I've put in casts to keep C++ compilers happy.
2214
2215 3. Typo on pcretest.c; a cast of (unsigned char *) in the POSIX regexec() call
2216 should be (const char *).
2217
2218 4. If NOPOSIX is defined, pcretest.c compiles without POSIX support. This may
2219 be useful for non-Unix systems who don't want to bother with the POSIX stuff.
2220 However, I haven't made this a standard facility. The documentation doesn't
2221 mention it, and the Makefile doesn't support it.
2222
2223 5. The Makefile now contains an "install" target, with editable destinations at
2224 the top of the file. The pcretest program is not installed.
2225
2226 6. pgrep -V now gives the PCRE version number and date.
2227
2228 7. Fixed bug: a zero repetition after a literal string (e.g. /abcde{0}/) was
2229 causing the entire string to be ignored, instead of just the last character.
2230
2231 8. If a pattern like /"([^\\"]+|\\.)*"/ is applied in the normal way to a
2232 non-matching string, it can take a very, very long time, even for strings of
2233 quite modest length, because of the nested recursion. PCRE now does better in
2234 some of these cases. It does this by remembering the last required literal
2235 character in the pattern, and pre-searching the subject to ensure it is present
2236 before running the real match. In other words, it applies a heuristic to detect
2237 some types of certain failure quickly, and in the above example, if presented
2238 with a string that has no trailing " it gives "no match" very quickly.
2239
2240 9. A new runtime option PCRE_NOTEMPTY causes null string matches to be ignored;
2241 other alternatives are tried instead.
2242
2243
2244 Version 2.06 09-Jun-99
2245 ----------------------
2246
2247 1. Change pcretest's output for amount of store used to show just the code
2248 space, because the remainder (the data block) varies in size between 32-bit and
2249 64-bit systems.
2250
2251 2. Added an extra argument to pcre_exec() to supply an offset in the subject to
2252 start matching at. This allows lookbehinds to work when searching for multiple
2253 occurrences in a string.
2254
2255 3. Added additional options to pcretest for testing multiple occurrences:
2256
2257 /+ outputs the rest of the string that follows a match
2258 /g loops for multiple occurrences, using the new startoffset argument
2259 /G loops for multiple occurrences by passing an incremented pointer
2260
2261 4. PCRE wasn't doing the "first character" optimization for patterns starting
2262 with \b or \B, though it was doing it for other lookbehind assertions. That is,
2263 it wasn't noticing that a match for a pattern such as /\bxyz/ has to start with
2264 the letter 'x'. On long subject strings, this gives a significant speed-up.
2265
2266
2267 Version 2.05 21-Apr-99
2268 ----------------------
2269
2270 1. Changed the type of magic_number from int to long int so that it works
2271 properly on 16-bit systems.
2272
2273 2. Fixed a bug which caused patterns starting with .* not to work correctly
2274 when the subject string contained newline characters. PCRE was assuming
2275 anchoring for such patterns in all cases, which is not correct because .* will
2276 not pass a newline unless PCRE_DOTALL is set. It now assumes anchoring only if
2277 DOTALL is set at top level; otherwise it knows that patterns starting with .*
2278 must be retried after every newline in the subject.
2279
2280
2281 Version 2.04 18-Feb-99
2282 ----------------------
2283
2284 1. For parenthesized subpatterns with repeats whose minimum was zero, the
2285 computation of the store needed to hold the pattern was incorrect (too large).
2286 If such patterns were nested a few deep, this could multiply and become a real
2287 problem.
2288
2289 2. Added /M option to pcretest to show the memory requirement of a specific
2290 pattern. Made -m a synonym of -s (which does this globally) for compatibility.
2291
2292 3. Subpatterns of the form (regex){n,m} (i.e. limited maximum) were being
2293 compiled in such a way that the backtracking after subsequent failure was
2294 pessimal. Something like (a){0,3} was compiled as (a)?(a)?(a)? instead of
2295 ((a)((a)(a)?)?)? with disastrous performance if the maximum was of any size.
2296
2297
2298 Version 2.03 02-Feb-99
2299 ----------------------
2300
2301 1. Fixed typo and small mistake in man page.
2302
2303 2. Added 4th condition (GPL supersedes if conflict) and created separate
2304 LICENCE file containing the conditions.
2305
2306 3. Updated pcretest so that patterns such as /abc\/def/ work like they do in
2307 Perl, that is the internal \ allows the delimiter to be included in the
2308 pattern. Locked out the use of \ as a delimiter. If \ immediately follows
2309 the final delimiter, add \ to the end of the pattern (to test the error).
2310
2311 4. Added the convenience functions for extracting substrings after a successful
2312 match. Updated pcretest to make it able to test these functions.
2313
2314
2315 Version 2.02 14-Jan-99
2316 ----------------------
2317
2318 1. Initialized the working variables associated with each extraction so that
2319 their saving and restoring doesn't refer to uninitialized store.
2320
2321 2. Put dummy code into study.c in order to trick the optimizer of the IBM C
2322 compiler for OS/2 into generating correct code. Apparently IBM isn't going to
2323 fix the problem.
2324
2325 3. Pcretest: the timing code wasn't using LOOPREPEAT for timing execution
2326 calls, and wasn't printing the correct value for compiling calls. Increased the
2327 default value of LOOPREPEAT, and the number of significant figures in the
2328 times.
2329
2330 4. Changed "/bin/rm" in the Makefile to "-rm" so it works on Windows NT.
2331
2332 5. Renamed "deftables" as "dftables" to get it down to 8 characters, to avoid
2333 a building problem on Windows NT with a FAT file system.
2334
2335
2336 Version 2.01 21-Oct-98
2337 ----------------------
2338
2339 1. Changed the API for pcre_compile() to allow for the provision of a pointer
2340 to character tables built by pcre_maketables() in the current locale. If NULL
2341 is passed, the default tables are used.
2342
2343
2344 Version 2.00 24-Sep-98
2345 ----------------------
2346
2347 1. Since the (>?) facility is in Perl 5.005, don't require PCRE_EXTRA to enable
2348 it any more.
2349
2350 2. Allow quantification of (?>) groups, and make it work correctly.
2351
2352 3. The first character computation wasn't working for (?>) groups.
2353
2354 4. Correct the implementation of \Z (it is permitted to match on the \n at the
2355 end of the subject) and add 5.005's \z, which really does match only at the
2356 very end of the subject.
2357
2358 5. Remove the \X "cut" facility; Perl doesn't have it, and (?> is neater.
2359
2360 6. Remove the ability to specify CASELESS, MULTILINE, DOTALL, and
2361 DOLLAR_END_ONLY at runtime, to make it possible to implement the Perl 5.005
2362 localized options. All options to pcre_study() were also removed.
2363
2364 7. Add other new features from 5.005:
2365
2366 $(?<= positive lookbehind
2367 $(?<! negative lookbehind
2368 (?imsx-imsx) added the unsetting capability
2369 such a setting is global if at outer level; local otherwise
2370 (?imsx-imsx:) non-capturing groups with option setting
2371 (?(cond)re|re) conditional pattern matching
2372
2373 A backreference to itself in a repeated group matches the previous
2374 captured string.
2375
2376 8. General tidying up of studying (both automatic and via "study")
2377 consequential on the addition of new assertions.
2378
2379 9. As in 5.005, unlimited repeated groups that could match an empty substring
2380 are no longer faulted at compile time. Instead, the loop is forcibly broken at
2381 runtime if any iteration does actually match an empty substring.
2382
2383 10. Include the RunTest script in the distribution.
2384
2385 11. Added tests from the Perl 5.005_02 distribution. This showed up a few
2386 discrepancies, some of which were old and were also with respect to 5.004. They
2387 have now been fixed.
2388
2389
2390 Version 1.09 28-Apr-98
2391 ----------------------
2392
2393 1. A negated single character class followed by a quantifier with a minimum
2394 value of one (e.g. [^x]{1,6} ) was not compiled correctly. This could lead to
2395 program crashes, or just wrong answers. This did not apply to negated classes
2396 containing more than one character, or to minima other than one.
2397
2398
2399 Version 1.08 27-Mar-98
2400 ----------------------
2401
2402 1. Add PCRE_UNGREEDY to invert the greediness of quantifiers.
2403
2404 2. Add (?U) and (?X) to set PCRE_UNGREEDY and PCRE_EXTRA respectively. The
2405 latter must appear before anything that relies on it in the pattern.
2406
2407
2408 Version 1.07 16-Feb-98
2409 ----------------------
2410
2411 1. A pattern such as /((a)*)*/ was not being diagnosed as in error (unlimited
2412 repeat of a potentially empty string).
2413
2414
2415 Version 1.06 23-Jan-98
2416 ----------------------
2417
2418 1. Added Markus Oberhumer's little patches for C++.
2419
2420 2. Literal strings longer than 255 characters were broken.
2421
2422
2423 Version 1.05 23-Dec-97
2424 ----------------------
2425
2426 1. Negated character classes containing more than one character were failing if
2427 PCRE_CASELESS was set at run time.
2428
2429
2430 Version 1.04 19-Dec-97
2431 ----------------------
2432
2433 1. Corrected the man page, where some "const" qualifiers had been omitted.
2434
2435 2. Made debugging output print "{0,xxx}" instead of just "{,xxx}" to agree with
2436 input syntax.
2437
2438 3. Fixed memory leak which occurred when a regex with back references was
2439 matched with an offsets vector that wasn't big enough. The temporary memory
2440 that is used in this case wasn't being freed if the match failed.
2441
2442 4. Tidied pcretest to ensure it frees memory that it gets.
2443
2444 5. Temporary memory was being obtained in the case where the passed offsets
2445 vector was exactly big enough.
2446
2447 6. Corrected definition of offsetof() from change 5 below.
2448
2449 7. I had screwed up change 6 below and broken the rules for the use of
2450 setjmp(). Now fixed.
2451
2452
2453 Version 1.03 18-Dec-97
2454 ----------------------
2455
2456 1. A erroneous regex with a missing opening parenthesis was correctly
2457 diagnosed, but PCRE attempted to access brastack[-1], which could cause crashes
2458 on some systems.
2459
2460 2. Replaced offsetof(real_pcre, code) by offsetof(real_pcre, code[0]) because
2461 it was reported that one broken compiler failed on the former because "code" is
2462 also an independent variable.
2463
2464 3. The erroneous regex a[]b caused an array overrun reference.
2465
2466 4. A regex ending with a one-character negative class (e.g. /[^k]$/) did not
2467 fail on data ending with that character. (It was going on too far, and checking
2468 the next character, typically a binary zero.) This was specific to the
2469 optimized code for single-character negative classes.
2470
2471 5. Added a contributed patch from the TIN world which does the following:
2472
2473 + Add an undef for memmove, in case the the system defines a macro for it.
2474
2475 + Add a definition of offsetof(), in case there isn't one. (I don't know
2476 the reason behind this - offsetof() is part of the ANSI standard - but
2477 it does no harm).
2478
2479 + Reduce the ifdef's in pcre.c using macro DPRINTF, thereby eliminating
2480 most of the places where whitespace preceded '#'. I have given up and
2481 allowed the remaining 2 cases to be at the margin.
2482
2483 + Rename some variables in pcre to eliminate shadowing. This seems very
2484 pedantic, but does no harm, of course.
2485
2486 6. Moved the call to setjmp() into its own function, to get rid of warnings
2487 from gcc -Wall, and avoided calling it at all unless PCRE_EXTRA is used.
2488
2489 7. Constructs such as \d{8,} were compiling into the equivalent of
2490 \d{8}\d{0,65527} instead of \d{8}\d* which didn't make much difference to the
2491 outcome, but in this particular case used more store than had been allocated,
2492 which caused the bug to be discovered because it threw up an internal error.
2493
2494 8. The debugging code in both pcre and pcretest for outputting the compiled
2495 form of a regex was going wrong in the case of back references followed by
2496 curly-bracketed repeats.
2497
2498
2499 Version 1.02 12-Dec-97
2500 ----------------------
2501
2502 1. Typos in pcre.3 and comments in the source fixed.
2503
2504 2. Applied a contributed patch to get rid of places where it used to remove
2505 'const' from variables, and fixed some signed/unsigned and uninitialized
2506 variable warnings.
2507
2508 3. Added the "runtest" target to Makefile.
2509
2510 4. Set default compiler flag to -O2 rather than just -O.
2511
2512
2513 Version 1.01 19-Nov-97
2514 ----------------------
2515
2516 1. PCRE was failing to diagnose unlimited repeat of empty string for patterns
2517 like /([ab]*)*/, that is, for classes with more than one character in them.
2518
2519 2. Likewise, it wasn't diagnosing patterns with "once-only" subpatterns, such
2520 as /((?>a*))*/ (a PCRE_EXTRA facility).
2521
2522
2523 Version 1.00 18-Nov-97
2524 ----------------------
2525
2526 1. Added compile-time macros to support systems such as SunOS4 which don't have
2527 memmove() or strerror() but have other things that can be used instead.
2528
2529 2. Arranged that "make clean" removes the executables.
2530
2531
2532 Version 0.99 27-Oct-97
2533 ----------------------
2534
2535 1. Fixed bug in code for optimizing classes with only one character. It was
2536 initializing a 32-byte map regardless, which could cause it to run off the end
2537 of the memory it had got.
2538
2539 2. Added, conditional on PCRE_EXTRA, the proposed (?>REGEX) construction.
2540
2541
2542 Version 0.98 22-Oct-97
2543 ----------------------
2544
2545 1. Fixed bug in code for handling temporary memory usage when there are more
2546 back references than supplied space in the ovector. This could cause segfaults.
2547
2548
2549 Version 0.97 21-Oct-97
2550 ----------------------
2551
2552 1. Added the \X "cut" facility, conditional on PCRE_EXTRA.
2553
2554 2. Optimized negated single characters not to use a bit map.
2555
2556 3. Brought error texts together as macro definitions; clarified some of them;
2557 fixed one that was wrong - it said "range out of order" when it meant "invalid
2558 escape sequence".
2559
2560 4. Changed some char * arguments to const char *.
2561
2562 5. Added PCRE_NOTBOL and PCRE_NOTEOL (from POSIX).
2563
2564 6. Added the POSIX-style API wrapper in pcreposix.a and testing facilities in
2565 pcretest.
2566
2567
2568 Version 0.96 16-Oct-97
2569 ----------------------
2570
2571 1. Added a simple "pgrep" utility to the distribution.
2572
2573 2. Fixed an incompatibility with Perl: "{" is now treated as a normal character
2574 unless it appears in one of the precise forms "{ddd}", "{ddd,}", or "{ddd,ddd}"
2575 where "ddd" means "one or more decimal digits".
2576
2577 3. Fixed serious bug. If a pattern had a back reference, but the call to
2578 pcre_exec() didn't supply a large enough ovector to record the related
2579 identifying subpattern, the match always failed. PCRE now remembers the number
2580 of the largest back reference, and gets some temporary memory in which to save
2581 the offsets during matching if necessary, in order to ensure that
2582 backreferences always work.
2583
2584 4. Increased the compatibility with Perl in a number of ways:
2585
2586 (a) . no longer matches \n by default; an option PCRE_DOTALL is provided
2587 to request this handling. The option can be set at compile or exec time.
2588
2589 (b) $ matches before a terminating newline by default; an option
2590 PCRE_DOLLAR_ENDONLY is provided to override this (but not in multiline
2591 mode). The option can be set at compile or exec time.
2592
2593 (c) The handling of \ followed by a digit other than 0 is now supposed to be
2594 the same as Perl's. If the decimal number it represents is less than 10
2595 or there aren't that many previous left capturing parentheses, an octal
2596 escape is read. Inside a character class, it's always an octal escape,
2597 even if it is a single digit.
2598
2599 (d) An escaped but undefined alphabetic character is taken as a literal,
2600 unless PCRE_EXTRA is set. Currently this just reserves the remaining
2601 escapes.
2602
2603 (e) {0} is now permitted. (The previous item is removed from the compiled
2604 pattern).
2605
2606 5. Changed all the names of code files so that the basic parts are no longer
2607 than 10 characters, and abolished the teeny "globals.c" file.
2608
2609 6. Changed the handling of character classes; they are now done with a 32-byte
2610 bit map always.
2611
2612 7. Added the -d and /D options to pcretest to make it possible to look at the
2613 internals of compilation without having to recompile pcre.
2614
2615
2616 Version 0.95 23-Sep-97
2617 ----------------------
2618
2619 1. Fixed bug in pre-pass concerning escaped "normal" characters such as \x5c or
2620 \x20 at the start of a run of normal characters. These were being treated as
2621 real characters, instead of the source characters being re-checked.
2622
2623
2624 Version 0.94 18-Sep-97
2625 ----------------------
2626
2627 1. The functions are now thread-safe, with the caveat that the global variables
2628 containing pointers to malloc() and free() or alternative functions are the
2629 same for all threads.
2630
2631 2. Get pcre_study() to generate a bitmap of initial characters for non-
2632 anchored patterns when this is possible, and use it if passed to pcre_exec().
2633
2634
2635 Version 0.93 15-Sep-97
2636 ----------------------
2637
2638 1. /(b)|(:+)/ was computing an incorrect first character.
2639
2640 2. Add pcre_study() to the API and the passing of pcre_extra to pcre_exec(),
2641 but not actually doing anything yet.
2642
2643 3. Treat "-" characters in classes that cannot be part of ranges as literals,
2644 as Perl does (e.g. [-az] or [az-]).
2645
2646 4. Set the anchored flag if a branch starts with .* or .*? because that tests
2647 all possible positions.
2648
2649 5. Split up into different modules to avoid including unneeded functions in a
2650 compiled binary. However, compile and exec are still in one module. The "study"
2651 function is split off.
2652
2653 6. The character tables are now in a separate module whose source is generated
2654 by an auxiliary program - but can then be edited by hand if required. There are
2655 now no calls to isalnum(), isspace(), isdigit(), isxdigit(), tolower() or
2656 toupper() in the code.
2657
2658 7. Turn the malloc/free funtions variables into pcre_malloc and pcre_free and
2659 make them global. Abolish the function for setting them, as the caller can now
2660 set them directly.
2661
2662
2663 Version 0.92 11-Sep-97
2664 ----------------------
2665
2666 1. A repeat with a fixed maximum and a minimum of 1 for an ordinary character
2667 (e.g. /a{1,3}/) was broken (I mis-optimized it).
2668
2669 2. Caseless matching was not working in character classes if the characters in
2670 the pattern were in upper case.
2671
2672 3. Make ranges like [W-c] work in the same way as Perl for caseless matching.
2673
2674 4. Make PCRE_ANCHORED public and accept as a compile option.
2675
2676 5. Add an options word to pcre_exec() and accept PCRE_ANCHORED and
2677 PCRE_CASELESS at run time. Add escapes \A and \I to pcretest to cause it to
2678 pass them.
2679
2680 6. Give an error if bad option bits passed at compile or run time.
2681
2682 7. Add PCRE_MULTILINE at compile and exec time, and (?m) as well. Add \M to
2683 pcretest to cause it to pass that flag.
2684
2685 8. Add pcre_info(), to get the number of identifying subpatterns, the stored
2686 options, and the first character, if set.
2687
2688 9. Recognize C+ or C{n,m} where n >= 1 as providing a fixed starting character.
2689
2690
2691 Version 0.91 10-Sep-97
2692 ----------------------
2693
2694 1. PCRE was failing to diagnose unlimited repeats of subpatterns that could
2695 match the empty string as in /(a*)*/. It was looping and ultimately crashing.
2696
2697 2. PCRE was looping on encountering an indefinitely repeated back reference to
2698 a subpattern that had matched an empty string, e.g. /(a|)\1*/. It now does what
2699 Perl does - treats the match as successful.
2700
2701 ****
Properties
Name Value
svn:eol-style native
svn:keywords "Author Date Id Revision Url"
[email protected]
ViewVC Help
Powered by ViewVC 1.1.12
|
{
"url": "http://www.exim.org/viewvc/pcre/code/trunk/ChangeLog?revision=152&view=markup&pathrev=371",
"source_domain": "www.exim.org",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "465329",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QIAOZGOBLESPL7N4HQH7ILDFXTNCRYFV",
"WARC-Concurrent-To": "<urn:uuid:3a02177d-92f2-4b31-b9ca-6e771bd10c10>",
"WARC-Date": "2014-07-30T17:14:54Z",
"WARC-IP-Address": "131.111.8.192",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3HQLSZJRBGAIEQEUGTZASZ6H6W7LZPLG",
"WARC-Record-ID": "<urn:uuid:a4464ea2-e916-4eeb-9aac-043e7a8b9f30>",
"WARC-Target-URI": "http://www.exim.org/viewvc/pcre/code/trunk/ChangeLog?revision=152&view=markup&pathrev=371",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d176f3d-bff1-4ae5-aa3d-97cd1af89c2c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-146-231-18.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,
29,
45,
46,
80,
81,
143,
144,
145,
190,
251,
277,
335,
336,
357,
378,
380,
404,
428,
430,
511,
588,
664,
676,
679,
759,
835,
911,
989,
1064,
1080,
1083,
1164,
1238,
1308,
1385,
1462,
1538,
1614,
1629,
1632,
1711,
1786,
1860,
1935,
1938,
2017,
2094,
2157,
2206,
2209,
2289,
2367,
2437,
2440,
2515,
2534,
2537,
2618,
2686,
2763,
2840,
2917,
2932,
2935,
3008,
3082,
3155,
3232,
3254,
3257,
3332,
3411,
3489,
3508,
3511,
3588,
3591,
3657,
3660,
3736,
3799,
3802,
3880,
3957,
4027,
4030,
4111,
4185,
4261,
4340,
4416,
4439,
4442,
4523,
4557,
4560,
4630,
4703,
4775,
4847,
4877,
4880,
4954,
5029,
5100,
5168,
5236,
5306,
5320,
5323,
5377,
5380,
5460,
5536,
5611,
5682,
5706,
5710,
5789,
5864,
5936,
6008,
6080,
6156,
6230,
6305,
6357,
6361,
6434,
6509,
6513,
6595,
6674,
6750,
6829,
6906,
6943,
6947,
7031,
7106,
7146,
7150,
7233,
7290,
7294,
7376,
7455,
7531,
7611,
7629,
7633,
7708,
7785,
7832,
7836,
7918,
7950,
7954,
8035,
8115,
8153,
8157,
8225,
8229,
8233,
8259,
8285,
8289,
8368,
8393,
8397,
8475,
8551,
8623,
8627,
8708,
8780,
8857,
8937,
9014,
9018,
9097,
9152,
9156,
9235,
9310,
9382,
9386,
9469,
9542,
9617,
9695,
9769,
9848,
9924,
9996,
10022,
10026,
10041,
10066,
10088,
10109,
10113,
10192,
10221,
10225,
10304,
10381,
10461,
10539,
10573,
10577,
10652,
10729,
10804,
10860,
10864,
10947,
11026,
11105,
11184,
11219,
11223,
11301,
11378,
11453,
11528,
11608,
11688,
11712,
11716,
11797,
11873,
11953,
11971,
11975,
12056,
12135,
12210,
12289,
12368,
12429,
12433,
12506,
12510,
12590,
12610,
12614,
12693,
12765,
12769,
12849,
12853,
12934,
13012,
13026,
13030,
13113,
13192,
13271,
13349,
13369,
13373,
13453,
13532,
13610,
13687,
13767,
13845,
13920,
13997,
14071,
14146,
14225,
14300,
14377,
14453,
14529,
14533,
14614,
14683,
14758,
14762,
14845,
14921,
14994,
15066,
15135,
15139,
15216,
15295,
15371,
15414,
15418,
15499,
15578,
15656,
15724,
15788,
15792,
15872,
15950,
16028,
16108,
16134,
16138,
16220,
16300,
16379,
16457,
16494,
16498,
16577,
16655,
16704,
16708,
16784,
16856,
16860,
16941,
16945,
17027,
17104,
17181,
17200,
17204,
17283,
17362,
17440,
17461,
17465,
17539,
17543,
17625,
17705,
17709,
17792,
17870,
17903,
17907,
17987,
18064,
18140,
18216,
18284,
18288,
18364,
18439,
18457,
18461,
18544,
18620,
18696,
18750,
18754,
18834,
18906,
18932,
18936,
19014,
19049,
19053,
19128,
19203,
19239,
19243,
19315,
19365,
19369,
19448,
19524,
19600,
19672,
19676,
19755,
19826,
19900,
19940,
19944,
20017,
20084,
20088,
20168,
20206,
20210,
20294,
20334,
20338,
20415,
20493,
20571,
20645,
20649,
20731,
20809,
20883,
20961,
21037,
21048,
21052,
21130,
21204,
21284,
21360,
21408,
21412,
21489,
21564,
21642,
21652,
21656,
21738,
21750,
21754,
21834,
21891,
21895,
21974,
22053,
22063,
22067,
22150,
22229,
22279,
22283,
22320,
22324,
22355,
22359,
22433,
22513,
22551,
22555,
22633,
22712,
22779,
22783,
22787,
22813,
22839,
22843,
22926,
22997,
23070,
23123,
23127,
23205,
23283,
23303,
23307,
23384,
23458,
23510,
23514,
23594,
23671,
23750,
23824,
23897,
23972,
24050,
24122,
24166,
24170,
24251,
24323,
24385,
24389,
24466,
24541,
24617,
24697,
24774,
24854,
24932,
24980,
24984,
25066,
25143,
25223,
25295,
25299,
25381,
25456,
25495,
25499,
25578,
25650,
25654,
25732,
25812,
25889,
25964,
26043,
26121,
26136,
26140,
26224,
26300,
26376,
26455,
26533,
26591,
26595,
26676,
26680,
26757,
26832,
26901,
26905,
26988,
26992,
27072,
27147,
27199,
27203,
27284,
27363,
27373,
27377,
27460,
27531,
27599,
27603,
27675,
27754,
27834,
27914,
27994,
28067,
28071,
28151,
28230,
28307,
28356,
28360,
28431,
28500,
28570,
28638,
28648,
28652,
28729,
28807,
28883,
28963,
28983,
28987,
29064,
29138,
29213,
29267,
29271,
29352,
29427,
29506,
29546,
29550,
29625,
29703,
29780,
29850,
29928,
30003,
30044,
30048,
30131,
30209,
30289,
30362,
30440,
30519,
30535,
30539,
30620,
30697,
30771,
30839,
30843,
30925,
30985,
30989,
31070,
31147,
31151,
31233,
31310,
31390,
31468,
31541,
31565,
31569,
31653,
31715,
31719,
31795,
31867,
31871,
31928,
31932,
31991,
32059,
32127,
32131,
32178,
32182,
32186,
32212,
32238,
32242,
32324,
32386,
32390,
32466,
32512,
32516,
32595,
32643,
32647,
32651,
32677,
32703,
32707,
32784,
32860,
32939,
33012,
33016,
33044,
33048,
33126,
33197,
33266,
33340,
33411,
33485,
33555,
33559,
33636,
33710,
33760,
33764,
33840,
33913,
33988,
34048,
34052,
34132,
34164,
34168,
34215,
34219,
34297,
34343,
34347,
34394,
34398,
34477,
34523,
34527,
34592,
34596,
34643,
34647,
34726,
34730,
34767,
34771,
34851,
34882,
34886,
34968,
35043,
35118,
35197,
35277,
35346,
35350,
35425,
35500,
35578,
35582,
35663,
35740,
35819,
35896,
35976,
36048,
36128,
36206,
36210,
36293,
36373,
36450,
36528,
36605,
36625,
36629,
36712,
36788,
36858,
36936,
37014,
37058,
37062,
37103,
37107,
37182,
37237,
37241,
37313,
37339,
37343,
37418,
37431,
37435,
37509,
37584,
37627,
37631,
37699,
37703,
37754,
37758,
37841,
37916,
37993,
38062,
38066,
38148,
38220,
38299,
38339,
38343,
38426,
38430,
38514,
38594,
38607,
38611,
38695,
38767,
38780,
38784,
38868,
38922,
38926,
39009,
39087,
39140,
39144,
39220,
39298,
39367,
39371,
39453,
39533,
39609,
39686,
39758,
39832,
39906,
39984,
40044,
40048,
40127,
40172,
40176,
40253,
40328,
40401,
40452,
40456,
40540,
40616,
40696,
40774,
40852,
40929,
40974,
40978,
41043,
41047,
41091,
41095,
41171,
41175,
41252,
41326,
41392,
41466,
41535,
41609,
41681,
41753,
41778,
41782,
41861,
41865,
41942,
41971,
41975,
42059,
42136,
42210,
42290,
42353,
42357,
42437,
42516,
42594,
42636,
42640,
42702,
42706,
42788,
42857,
42861,
42939,
42992,
42996,
43077,
43156,
43233,
43312,
43392,
43424,
43428,
43504,
43584,
43662,
43705,
43709,
43768,
43772,
43776,
43802,
43828,
43832,
43914,
43993,
44073,
44144,
44148,
44212,
44216,
44297,
44372,
44449,
44522,
44591,
44595,
44674,
44702,
44706,
44746,
44750,
44754,
44780,
44806,
44810,
44893,
44897,
44964,
44968,
45043,
45065,
45069,
45144,
45200,
45204,
45277,
45281,
45353,
45421,
45495,
45526,
45530,
45600,
45675,
45715,
45719,
45797,
45872,
45943,
46019,
46099,
46176,
46216,
46220,
46224,
46250,
46276,
46280,
46363,
46442,
46520,
46597,
46628,
46632,
46704,
46708,
46789,
46836,
46840,
46921,
46967,
46971,
47054,
47130,
47203,
47280,
47359,
47432,
47458,
47462,
47542,
47576,
47580,
47584,
47610,
47636,
47640,
47722,
47764,
47768,
47850,
47926,
47993,
47997,
48071,
48151,
48231,
48299,
48303,
48385,
48462,
48483,
48487,
48568,
48645,
48724,
48753,
48757,
48837,
48910,
48989,
49067,
49071,
49153,
49231,
49244,
49248,
49252,
49278,
49304,
49308,
49384,
49388,
49470,
49549,
49629,
49647,
49651,
49729,
49806,
49877,
49948,
50026,
50106,
50150,
50154,
50226,
50305,
50381,
50457,
50488,
50492,
50574,
50647,
50720,
50733,
50737,
50815,
50863,
50867,
50945,
51023,
51084,
51088,
51141,
51145,
51226,
51303,
51359,
51363,
51441,
51516,
51520,
51573,
51577,
51644,
51713,
51743,
51747,
51794,
51798,
51872,
51906,
51910,
51954,
51958,
52036,
52112,
52189,
52266,
52271,
52326,
52331,
52356,
52361,
52433,
52510,
52578,
52642,
52647,
52728,
52800,
52843,
52848,
52909,
52914,
52989,
53058,
53083,
53088,
53164,
53234,
53239,
53315,
53391,
53468,
53473,
53552,
53584,
53589,
53666,
53722,
53727,
53805,
53840,
53845,
53926,
54001,
54078,
54154,
54177,
54182,
54260,
54295,
54300,
54383,
54412,
54417,
54456,
54461,
54515,
54520,
54594,
54673,
54721,
54726,
54802,
54877,
54952,
55030,
55110,
55182,
55256,
55333,
55392,
55397,
55481,
55558,
55603,
55608,
55687,
55768,
55845,
55922,
55955,
55960,
56029,
56034,
56101,
56106,
56189,
56265,
56270,
56339,
56344,
56420,
56460,
56465,
56470,
56475,
56502,
56529,
56534,
56613,
56689,
56770,
56812,
56817,
56899,
56980,
57021,
57026,
57105,
57181,
57216,
57221,
57272,
57277,
57320,
57364,
57416,
57421,
57497,
57541,
57546,
57627,
57704,
57709,
57792,
57869,
57939,
58017,
58096,
58170,
58233,
58238,
58314,
58391,
58423,
58428,
58491,
58496,
58579,
58651,
58730,
58778,
58783,
58866,
58946,
59024,
59098,
59174,
59254,
59259,
59340,
59421,
59444,
59449,
59530,
59609,
59623,
59628,
59713,
59790,
59867,
59931,
59936,
60018,
60059,
60064,
60141,
60220,
60301,
60306,
60388,
60464,
60544,
60612,
60617,
60702,
60725,
60730,
60813,
60893,
60966,
60982,
60987,
61067,
61148,
61202,
61207,
61283,
61336,
61341,
61397,
61402,
61475,
61549,
61624,
61696,
61759,
61764,
61843,
61908,
61982,
62055,
62129,
62141,
62146,
62226,
62299,
62351,
62356,
62439,
62497,
62502,
62579,
62657,
62731,
62802,
62807,
62889,
62969,
63050,
63082,
63087,
63171,
63250,
63325,
63403,
63476,
63495,
63500,
63573,
63578,
63583,
63610,
63637,
63642,
63725,
63806,
63884,
63964,
64045,
64124,
64195,
64273,
64354,
64370,
64375,
64449,
64522,
64603,
64660,
64665,
64746,
64822,
64894,
64899,
64979,
65058,
65078,
65083,
65161,
65220,
65225,
65308,
65388,
65462,
65541,
65621,
65701,
65774,
65779,
65861,
65940,
65978,
65983,
66066,
66143,
66222,
66284,
66289,
66370,
66446,
66451,
66533,
66612,
66684,
66689,
66771,
66776,
66853,
66934,
67000,
67005,
67090,
67112,
67117,
67164,
67243,
67272,
67350,
67424,
67489,
67494,
67576,
67656,
67679,
67684,
67766,
67844,
67918,
67997,
68015,
68020,
68101,
68179,
68220,
68225,
68301,
68378,
68429,
68434,
68505,
68584,
68595,
68600,
68682,
68757,
68836,
68913,
68977,
68982,
68987,
69014,
69041,
69046,
69129,
69209,
69283,
69308,
69313,
69394,
69448,
69453,
69536,
69608,
69613,
69695,
69774,
69807,
69812,
69880,
69885,
69946,
69951,
70035,
70112,
70192,
70270,
70350,
70430,
70459,
70464,
70543,
70617,
70685,
70690,
70771,
70851,
70924,
71004,
71030,
71035,
71119,
71199,
71276,
71353,
71358,
71435,
71440,
71501,
71509,
71570,
71575,
71654,
71733,
71755,
71760,
71765,
71792,
71819,
71824,
71902,
71917,
71922,
71983,
71988,
72051,
72056,
72135,
72208,
72273,
72290,
72295,
72372,
72446,
72516,
72582,
72654,
72725,
72797,
72822,
72827,
72906,
72961,
72966,
73045,
73070,
73075,
73152,
73188,
73193,
73276,
73358,
73433,
73468,
73473,
73556,
73634,
73639,
73723,
73796,
73878,
73956,
73990,
73995,
74000,
74027,
74054,
74059,
74131,
74136,
74213,
74275,
74337,
74387,
74466,
74488,
74559,
74636,
74675,
74721,
74778,
74850,
74865,
74901,
74931,
74961,
74990,
75020,
75059,
75094,
75144,
75164,
75184,
75229,
75234,
75316,
75396,
75414,
75419,
75472,
75477,
75559,
75633,
75638,
75718,
75752,
75757,
75836,
75871,
75876,
75958,
76038,
76089,
76094,
76176,
76254,
76317,
76322,
76327,
76354,
76381,
76386,
76465,
76549,
76575,
76580,
76663,
76709,
76714,
76797,
76882,
76966,
77047,
77099,
77104,
77188,
77273,
77318,
77323,
77403,
77414,
77419,
77503,
77588,
77671,
77755,
77835,
77920,
77982,
77987,
78068,
78149,
78233,
78315,
78397,
78479,
78563,
78568,
78573,
78600,
78627,
78632,
78717,
78802,
78886,
78891,
78941,
78946,
79028,
79109,
79145,
79150,
79235,
79314,
79396,
79461,
79466,
79546,
79566,
79571,
79654,
79735,
79740,
79825,
79908,
79990,
80070,
80155,
80228,
80233,
80314,
80397,
80480,
80529,
80534,
80573,
80578,
80640,
80676,
80714,
80719,
80803,
80841,
80846,
80919,
81004,
81082,
81113,
81118,
81198,
81280,
81295,
81300,
81385,
81404,
81409,
81492,
81574,
81658,
81742,
81823,
81906,
81973,
81978,
82060,
82145,
82228,
82257,
82262,
82344,
82424,
82506,
82583,
82667,
82747,
82752,
82837,
82916,
83001,
83076,
83081,
83157,
83240,
83324,
83385,
83390,
83471,
83545,
83620,
83703,
83783,
83862,
83875,
83880,
83964,
84005,
84010,
84094,
84161,
84166,
84250,
84334,
84339,
84421,
84470,
84475,
84556,
84586,
84591,
84674,
84751,
84824,
84829,
84910,
84993,
85073,
85095,
85100,
85183,
85265,
85348,
85426,
85503,
85584,
85658,
85663,
85742,
85827,
85906,
85991,
85996,
86071,
86076,
86155,
86239,
86314,
86394,
86479,
86561,
86646,
86724,
86807,
86879,
86959,
87041,
87123,
87181,
87186,
87265,
87348,
87433,
87460,
87465,
87532,
87574,
87626,
87697,
87702,
87785,
87855,
87860,
87945,
88029,
88103,
88189,
88212,
88217,
88299,
88383,
88467,
88544,
88624,
88676,
88681,
88721,
88726,
88803,
88875,
88954,
88976,
88981,
89052,
89121,
89126,
89206,
89279,
89311,
89316,
89396,
89472,
89477,
89562,
89638,
89706,
89711,
89792,
89876,
89957,
90041,
90125,
90181,
90186,
90256,
90310,
90364,
90369,
90451,
90535,
90615,
90680,
90685,
90769,
90850,
90904,
90909,
90993,
91037,
91042,
91125,
91208,
91289,
91366,
91449,
91533,
91611,
91616,
91699,
91781,
91863,
91944,
91955,
91960,
92044,
92124,
92193,
92257,
92262,
92340,
92425,
92503,
92583,
92663,
92747,
92818,
92823,
92902,
92956,
92961,
93041,
93086,
93091,
93165,
93170,
93255,
93336,
93420,
93471,
93476,
93498,
93503,
93583,
93617,
93622,
93647,
93652,
93736,
93783,
93788,
93815,
93820,
93902,
93984,
93989,
94029,
94034,
94114,
94182,
94187,
94216,
94221,
94306,
94370,
94375,
94460,
94545,
94597,
94602,
94687,
94764,
94847,
94931,
95014,
95074,
95079,
95160,
95196,
95201,
95270,
95316,
95393,
95418,
95469,
95474,
95529,
95534,
95561,
95589,
95618,
95623,
95707,
95778,
95861,
95942,
95972,
95977,
96061,
96144,
96156,
96161,
96246,
96331,
96415,
96500,
96582,
96617,
96622,
96703,
96783,
96860,
96942,
97027,
97112,
97197,
97202,
97283,
97368,
97441,
97459,
97464,
97540,
97545,
97616,
97621,
97658,
97719,
97781,
97786,
97864,
97939,
98018,
98087,
98092,
98168,
98244,
98324,
98400,
98477,
98557,
98614,
98619,
98681,
98686,
98756,
98798,
98803,
98884,
98963,
99011,
99016,
99101,
99182,
99264,
99345,
99426,
99477,
99482,
99561,
99637,
99713,
99791,
99796,
99874,
99953,
100010,
100015,
100093,
100131,
100136,
100211,
100286,
100361,
100439,
100483,
100488,
100565,
100622,
100627,
100704,
100729,
100734,
100803,
100881,
100962,
100975,
100980,
101065,
101149,
101234,
101311,
101316,
101395,
101400,
101479,
101562,
101645,
101663,
101668,
101753,
101837,
101916,
101994,
102034,
102039,
102119,
102124,
102129,
102156,
102183,
102188,
102272,
102277,
102359,
102442,
102510,
102515,
102520,
102547,
102574,
102579,
102661,
102714,
102719,
102724,
102751,
102778,
102783,
102860,
102943,
103014,
103019,
103103,
103184,
103266,
103326,
103331,
103336,
103363,
103390,
103395,
103479,
103531,
103536,
103619,
103645,
103650,
103655,
103682,
103709,
103714,
103794,
103819,
103824,
103902,
103986,
104000,
104005,
104087,
104171,
104249,
104333,
104344,
104349,
104429,
104509,
104589,
104646,
104651,
104681,
104734,
104805,
104871,
104928,
104933,
105010,
105071,
105076,
105158,
105185,
105190,
105271,
105356,
105409,
105414,
105495,
105578,
105611,
105616,
105696,
105780,
105822,
105827,
105909,
105988,
106036,
106041,
106125,
106208,
106244,
106249,
106331,
106401,
106406,
106411,
106438,
106465,
106470,
106556,
106561,
106639,
106644,
106649,
106676,
106703,
106708,
106789,
106874,
106912,
106917,
106999,
107083,
107088,
107170,
107250,
107335,
107388,
107393,
107475,
107494,
107499,
107580,
107595,
107600,
107680,
107748,
107753,
107822,
107827,
107906,
107988,
108071,
108101,
108106,
108111,
108138,
108165,
108170,
108212,
108217,
108302,
108386,
108463,
108545,
108561,
108566,
108650,
108732,
108816,
108880,
108885,
108965,
109048,
109117,
109122,
109204,
109263,
109268,
109315,
109323,
109371,
109376,
109435,
109440,
109525,
109598,
109679,
109745,
109750,
109835,
109920,
109945,
109950,
109955,
109982,
110009,
110014,
110097,
110124,
110129,
110177,
110182,
110261,
110266,
110271,
110298,
110325,
110330,
110412,
110428,
110433,
110486,
110491,
110575,
110602,
110607,
110684,
110763,
110848,
110861,
110866,
110948,
111026,
111109,
111191,
111196,
111270,
111340,
111425,
111502,
111516,
111521,
111604,
111687,
111706,
111711,
111791,
111873,
111892,
111897,
111980,
112060,
112139,
112144,
112226,
112275,
112280,
112361,
112376,
112381,
112386,
112414,
112442,
112447,
112531,
112615,
112672,
112677,
112760,
112844,
112865,
112870,
112954,
113036,
113041,
113126,
113157,
113162,
113167,
113195,
113223,
113228,
113312,
113347,
113352,
113435,
113518,
113573,
113578,
113662,
113693,
113698,
113781,
113864,
113945,
113999,
114004,
114089,
114154,
114159,
114220,
114225,
114307,
114389,
114394,
114473,
114555,
114638,
114718,
114803,
114888,
114971,
115047,
115052,
115137,
115180,
115185,
115190,
115218,
115246,
115251,
115331,
115416,
115437,
115442,
115527,
115611,
115641,
115646,
115725,
115730,
115790,
115865,
115938,
115943,
116026,
116111,
116196,
116277,
116282,
116287,
116315,
116343,
116348,
116427,
116460,
116465,
116546,
116623,
116707,
116791,
116874,
116931,
116936,
116941,
116969,
116997,
117002,
117081,
117165,
117249,
117263,
117268,
117349,
117433,
117438,
117517,
117596,
117675,
117757,
117762,
117767,
117795,
117823,
117828,
117878,
117883,
117961,
118006,
118011,
118093,
118170,
118249,
118328,
118333,
118418,
118488,
118493,
118498,
118526,
118554,
118559,
118641,
118711,
118716,
118797,
118880,
118902,
118907,
118986,
119071,
119150,
119162,
119167,
119245,
119250,
119333,
119395,
119400,
119405,
119433,
119461,
119466,
119549,
119632,
119677,
119682,
119687,
119715,
119743,
119748,
119833,
119851,
119856,
119929,
119934,
120006,
120011,
120095,
120176,
120206,
120211,
120290,
120295,
120366,
120447,
120518,
120523,
120566,
120571,
120602,
120633,
120682,
120747,
120807,
120856,
120861,
120933,
120955,
120960,
121032,
121086,
121091,
121174,
121258,
121328,
121333,
121390,
121395,
121474,
121559,
121585,
121590,
121595,
121623,
121651,
121656,
121737,
121820,
121903,
121973,
121978,
121983,
122011,
122039,
122044,
122111,
122116,
122196,
122270,
122275,
122280,
122308,
122336,
122341,
122424,
122468,
122473,
122478,
122506,
122534,
122539,
122596,
122601,
122665,
122670,
122675,
122703,
122731,
122736,
122821,
122861,
122866,
122871,
122899,
122927,
122932,
123012,
123017,
123102,
123121,
123126,
123205,
123286,
123357,
123362,
123426,
123431,
123512,
123548,
123553,
123617,
123622,
123698,
123724,
123729,
123734,
123762,
123790,
123795,
123870,
123955,
123977,
123982,
124065,
124150,
124185,
124190,
124258,
124263,
124345,
124430,
124506,
124565,
124570,
124649,
124654,
124734,
124739,
124817,
124893,
124916,
124921,
124998,
125073,
125129,
125134,
125211,
125255,
125260,
125341,
125419,
125424,
125496,
125579,
125662,
125744,
125749,
125830,
125910,
125940,
125945,
125950,
125978,
126006,
126011,
126069,
126074,
126155,
126233,
126257,
126262,
126310,
126315,
126377,
126382,
126387,
126415,
126443,
126448,
126531,
126612,
126617,
126700,
126745,
126750,
126755,
126783,
126811,
126816,
126901,
126978,
126983,
127043,
127048,
127053,
127081,
127109,
127114,
127195,
127279,
127310,
127315,
127394,
127399,
127404,
127432,
127460,
127465,
127547,
127632,
127637,
127642,
127670,
127698,
127703,
127767,
127772,
127838,
127843,
127926,
128010,
128033,
128038,
128093,
128098,
128154,
128159,
128242,
128257,
128262,
128267,
128295,
128323,
128328,
128388,
128393,
128478,
128563,
128616,
128621,
128699,
128775,
128859,
128943,
129014,
129047,
129052,
129119,
129124,
129202,
129280,
129285,
129355,
129431,
129490,
129495,
129577,
129654,
129731,
129807,
129842,
129847,
129925,
129999,
130013,
130018,
130097,
130112,
130117,
130199,
130266,
130271,
130355,
130376,
130381,
130464,
130528,
130533,
130538,
130566,
130594,
130599,
130684,
130766,
130839,
130844,
130849,
130877,
130905,
130910,
130995,
131076,
131103,
131108,
131185,
131268,
131273,
131278,
131306,
131334,
131339,
131402,
131407,
131489,
131531,
131536,
131619,
131660,
131665,
131748,
131777,
131782,
131865,
131950,
131978,
131983,
132067,
132152,
132231,
132259,
132264,
132347,
132431,
132455,
132460,
132465,
132493,
132521,
132526,
132609,
132663,
132668,
132752,
132789,
132794,
132877,
132882,
132948,
132953,
133025,
133106,
133122,
133127,
133199,
133204,
133285,
133330,
133335,
133417,
133464,
133469,
133554,
133559,
133564,
133592,
133620,
133625,
133706,
133789,
133794,
133878,
133963,
134012,
134017,
134027,
134028,
134039,
134040,
134051,
134072,
134115,
134116,
134135,
134147
],
"line_end_idx": [
29,
45,
46,
80,
81,
143,
144,
145,
190,
251,
277,
335,
336,
357,
378,
380,
404,
428,
430,
511,
588,
664,
676,
679,
759,
835,
911,
989,
1064,
1080,
1083,
1164,
1238,
1308,
1385,
1462,
1538,
1614,
1629,
1632,
1711,
1786,
1860,
1935,
1938,
2017,
2094,
2157,
2206,
2209,
2289,
2367,
2437,
2440,
2515,
2534,
2537,
2618,
2686,
2763,
2840,
2917,
2932,
2935,
3008,
3082,
3155,
3232,
3254,
3257,
3332,
3411,
3489,
3508,
3511,
3588,
3591,
3657,
3660,
3736,
3799,
3802,
3880,
3957,
4027,
4030,
4111,
4185,
4261,
4340,
4416,
4439,
4442,
4523,
4557,
4560,
4630,
4703,
4775,
4847,
4877,
4880,
4954,
5029,
5100,
5168,
5236,
5306,
5320,
5323,
5377,
5380,
5460,
5536,
5611,
5682,
5706,
5710,
5789,
5864,
5936,
6008,
6080,
6156,
6230,
6305,
6357,
6361,
6434,
6509,
6513,
6595,
6674,
6750,
6829,
6906,
6943,
6947,
7031,
7106,
7146,
7150,
7233,
7290,
7294,
7376,
7455,
7531,
7611,
7629,
7633,
7708,
7785,
7832,
7836,
7918,
7950,
7954,
8035,
8115,
8153,
8157,
8225,
8229,
8233,
8259,
8285,
8289,
8368,
8393,
8397,
8475,
8551,
8623,
8627,
8708,
8780,
8857,
8937,
9014,
9018,
9097,
9152,
9156,
9235,
9310,
9382,
9386,
9469,
9542,
9617,
9695,
9769,
9848,
9924,
9996,
10022,
10026,
10041,
10066,
10088,
10109,
10113,
10192,
10221,
10225,
10304,
10381,
10461,
10539,
10573,
10577,
10652,
10729,
10804,
10860,
10864,
10947,
11026,
11105,
11184,
11219,
11223,
11301,
11378,
11453,
11528,
11608,
11688,
11712,
11716,
11797,
11873,
11953,
11971,
11975,
12056,
12135,
12210,
12289,
12368,
12429,
12433,
12506,
12510,
12590,
12610,
12614,
12693,
12765,
12769,
12849,
12853,
12934,
13012,
13026,
13030,
13113,
13192,
13271,
13349,
13369,
13373,
13453,
13532,
13610,
13687,
13767,
13845,
13920,
13997,
14071,
14146,
14225,
14300,
14377,
14453,
14529,
14533,
14614,
14683,
14758,
14762,
14845,
14921,
14994,
15066,
15135,
15139,
15216,
15295,
15371,
15414,
15418,
15499,
15578,
15656,
15724,
15788,
15792,
15872,
15950,
16028,
16108,
16134,
16138,
16220,
16300,
16379,
16457,
16494,
16498,
16577,
16655,
16704,
16708,
16784,
16856,
16860,
16941,
16945,
17027,
17104,
17181,
17200,
17204,
17283,
17362,
17440,
17461,
17465,
17539,
17543,
17625,
17705,
17709,
17792,
17870,
17903,
17907,
17987,
18064,
18140,
18216,
18284,
18288,
18364,
18439,
18457,
18461,
18544,
18620,
18696,
18750,
18754,
18834,
18906,
18932,
18936,
19014,
19049,
19053,
19128,
19203,
19239,
19243,
19315,
19365,
19369,
19448,
19524,
19600,
19672,
19676,
19755,
19826,
19900,
19940,
19944,
20017,
20084,
20088,
20168,
20206,
20210,
20294,
20334,
20338,
20415,
20493,
20571,
20645,
20649,
20731,
20809,
20883,
20961,
21037,
21048,
21052,
21130,
21204,
21284,
21360,
21408,
21412,
21489,
21564,
21642,
21652,
21656,
21738,
21750,
21754,
21834,
21891,
21895,
21974,
22053,
22063,
22067,
22150,
22229,
22279,
22283,
22320,
22324,
22355,
22359,
22433,
22513,
22551,
22555,
22633,
22712,
22779,
22783,
22787,
22813,
22839,
22843,
22926,
22997,
23070,
23123,
23127,
23205,
23283,
23303,
23307,
23384,
23458,
23510,
23514,
23594,
23671,
23750,
23824,
23897,
23972,
24050,
24122,
24166,
24170,
24251,
24323,
24385,
24389,
24466,
24541,
24617,
24697,
24774,
24854,
24932,
24980,
24984,
25066,
25143,
25223,
25295,
25299,
25381,
25456,
25495,
25499,
25578,
25650,
25654,
25732,
25812,
25889,
25964,
26043,
26121,
26136,
26140,
26224,
26300,
26376,
26455,
26533,
26591,
26595,
26676,
26680,
26757,
26832,
26901,
26905,
26988,
26992,
27072,
27147,
27199,
27203,
27284,
27363,
27373,
27377,
27460,
27531,
27599,
27603,
27675,
27754,
27834,
27914,
27994,
28067,
28071,
28151,
28230,
28307,
28356,
28360,
28431,
28500,
28570,
28638,
28648,
28652,
28729,
28807,
28883,
28963,
28983,
28987,
29064,
29138,
29213,
29267,
29271,
29352,
29427,
29506,
29546,
29550,
29625,
29703,
29780,
29850,
29928,
30003,
30044,
30048,
30131,
30209,
30289,
30362,
30440,
30519,
30535,
30539,
30620,
30697,
30771,
30839,
30843,
30925,
30985,
30989,
31070,
31147,
31151,
31233,
31310,
31390,
31468,
31541,
31565,
31569,
31653,
31715,
31719,
31795,
31867,
31871,
31928,
31932,
31991,
32059,
32127,
32131,
32178,
32182,
32186,
32212,
32238,
32242,
32324,
32386,
32390,
32466,
32512,
32516,
32595,
32643,
32647,
32651,
32677,
32703,
32707,
32784,
32860,
32939,
33012,
33016,
33044,
33048,
33126,
33197,
33266,
33340,
33411,
33485,
33555,
33559,
33636,
33710,
33760,
33764,
33840,
33913,
33988,
34048,
34052,
34132,
34164,
34168,
34215,
34219,
34297,
34343,
34347,
34394,
34398,
34477,
34523,
34527,
34592,
34596,
34643,
34647,
34726,
34730,
34767,
34771,
34851,
34882,
34886,
34968,
35043,
35118,
35197,
35277,
35346,
35350,
35425,
35500,
35578,
35582,
35663,
35740,
35819,
35896,
35976,
36048,
36128,
36206,
36210,
36293,
36373,
36450,
36528,
36605,
36625,
36629,
36712,
36788,
36858,
36936,
37014,
37058,
37062,
37103,
37107,
37182,
37237,
37241,
37313,
37339,
37343,
37418,
37431,
37435,
37509,
37584,
37627,
37631,
37699,
37703,
37754,
37758,
37841,
37916,
37993,
38062,
38066,
38148,
38220,
38299,
38339,
38343,
38426,
38430,
38514,
38594,
38607,
38611,
38695,
38767,
38780,
38784,
38868,
38922,
38926,
39009,
39087,
39140,
39144,
39220,
39298,
39367,
39371,
39453,
39533,
39609,
39686,
39758,
39832,
39906,
39984,
40044,
40048,
40127,
40172,
40176,
40253,
40328,
40401,
40452,
40456,
40540,
40616,
40696,
40774,
40852,
40929,
40974,
40978,
41043,
41047,
41091,
41095,
41171,
41175,
41252,
41326,
41392,
41466,
41535,
41609,
41681,
41753,
41778,
41782,
41861,
41865,
41942,
41971,
41975,
42059,
42136,
42210,
42290,
42353,
42357,
42437,
42516,
42594,
42636,
42640,
42702,
42706,
42788,
42857,
42861,
42939,
42992,
42996,
43077,
43156,
43233,
43312,
43392,
43424,
43428,
43504,
43584,
43662,
43705,
43709,
43768,
43772,
43776,
43802,
43828,
43832,
43914,
43993,
44073,
44144,
44148,
44212,
44216,
44297,
44372,
44449,
44522,
44591,
44595,
44674,
44702,
44706,
44746,
44750,
44754,
44780,
44806,
44810,
44893,
44897,
44964,
44968,
45043,
45065,
45069,
45144,
45200,
45204,
45277,
45281,
45353,
45421,
45495,
45526,
45530,
45600,
45675,
45715,
45719,
45797,
45872,
45943,
46019,
46099,
46176,
46216,
46220,
46224,
46250,
46276,
46280,
46363,
46442,
46520,
46597,
46628,
46632,
46704,
46708,
46789,
46836,
46840,
46921,
46967,
46971,
47054,
47130,
47203,
47280,
47359,
47432,
47458,
47462,
47542,
47576,
47580,
47584,
47610,
47636,
47640,
47722,
47764,
47768,
47850,
47926,
47993,
47997,
48071,
48151,
48231,
48299,
48303,
48385,
48462,
48483,
48487,
48568,
48645,
48724,
48753,
48757,
48837,
48910,
48989,
49067,
49071,
49153,
49231,
49244,
49248,
49252,
49278,
49304,
49308,
49384,
49388,
49470,
49549,
49629,
49647,
49651,
49729,
49806,
49877,
49948,
50026,
50106,
50150,
50154,
50226,
50305,
50381,
50457,
50488,
50492,
50574,
50647,
50720,
50733,
50737,
50815,
50863,
50867,
50945,
51023,
51084,
51088,
51141,
51145,
51226,
51303,
51359,
51363,
51441,
51516,
51520,
51573,
51577,
51644,
51713,
51743,
51747,
51794,
51798,
51872,
51906,
51910,
51954,
51958,
52036,
52112,
52189,
52266,
52271,
52326,
52331,
52356,
52361,
52433,
52510,
52578,
52642,
52647,
52728,
52800,
52843,
52848,
52909,
52914,
52989,
53058,
53083,
53088,
53164,
53234,
53239,
53315,
53391,
53468,
53473,
53552,
53584,
53589,
53666,
53722,
53727,
53805,
53840,
53845,
53926,
54001,
54078,
54154,
54177,
54182,
54260,
54295,
54300,
54383,
54412,
54417,
54456,
54461,
54515,
54520,
54594,
54673,
54721,
54726,
54802,
54877,
54952,
55030,
55110,
55182,
55256,
55333,
55392,
55397,
55481,
55558,
55603,
55608,
55687,
55768,
55845,
55922,
55955,
55960,
56029,
56034,
56101,
56106,
56189,
56265,
56270,
56339,
56344,
56420,
56460,
56465,
56470,
56475,
56502,
56529,
56534,
56613,
56689,
56770,
56812,
56817,
56899,
56980,
57021,
57026,
57105,
57181,
57216,
57221,
57272,
57277,
57320,
57364,
57416,
57421,
57497,
57541,
57546,
57627,
57704,
57709,
57792,
57869,
57939,
58017,
58096,
58170,
58233,
58238,
58314,
58391,
58423,
58428,
58491,
58496,
58579,
58651,
58730,
58778,
58783,
58866,
58946,
59024,
59098,
59174,
59254,
59259,
59340,
59421,
59444,
59449,
59530,
59609,
59623,
59628,
59713,
59790,
59867,
59931,
59936,
60018,
60059,
60064,
60141,
60220,
60301,
60306,
60388,
60464,
60544,
60612,
60617,
60702,
60725,
60730,
60813,
60893,
60966,
60982,
60987,
61067,
61148,
61202,
61207,
61283,
61336,
61341,
61397,
61402,
61475,
61549,
61624,
61696,
61759,
61764,
61843,
61908,
61982,
62055,
62129,
62141,
62146,
62226,
62299,
62351,
62356,
62439,
62497,
62502,
62579,
62657,
62731,
62802,
62807,
62889,
62969,
63050,
63082,
63087,
63171,
63250,
63325,
63403,
63476,
63495,
63500,
63573,
63578,
63583,
63610,
63637,
63642,
63725,
63806,
63884,
63964,
64045,
64124,
64195,
64273,
64354,
64370,
64375,
64449,
64522,
64603,
64660,
64665,
64746,
64822,
64894,
64899,
64979,
65058,
65078,
65083,
65161,
65220,
65225,
65308,
65388,
65462,
65541,
65621,
65701,
65774,
65779,
65861,
65940,
65978,
65983,
66066,
66143,
66222,
66284,
66289,
66370,
66446,
66451,
66533,
66612,
66684,
66689,
66771,
66776,
66853,
66934,
67000,
67005,
67090,
67112,
67117,
67164,
67243,
67272,
67350,
67424,
67489,
67494,
67576,
67656,
67679,
67684,
67766,
67844,
67918,
67997,
68015,
68020,
68101,
68179,
68220,
68225,
68301,
68378,
68429,
68434,
68505,
68584,
68595,
68600,
68682,
68757,
68836,
68913,
68977,
68982,
68987,
69014,
69041,
69046,
69129,
69209,
69283,
69308,
69313,
69394,
69448,
69453,
69536,
69608,
69613,
69695,
69774,
69807,
69812,
69880,
69885,
69946,
69951,
70035,
70112,
70192,
70270,
70350,
70430,
70459,
70464,
70543,
70617,
70685,
70690,
70771,
70851,
70924,
71004,
71030,
71035,
71119,
71199,
71276,
71353,
71358,
71435,
71440,
71501,
71509,
71570,
71575,
71654,
71733,
71755,
71760,
71765,
71792,
71819,
71824,
71902,
71917,
71922,
71983,
71988,
72051,
72056,
72135,
72208,
72273,
72290,
72295,
72372,
72446,
72516,
72582,
72654,
72725,
72797,
72822,
72827,
72906,
72961,
72966,
73045,
73070,
73075,
73152,
73188,
73193,
73276,
73358,
73433,
73468,
73473,
73556,
73634,
73639,
73723,
73796,
73878,
73956,
73990,
73995,
74000,
74027,
74054,
74059,
74131,
74136,
74213,
74275,
74337,
74387,
74466,
74488,
74559,
74636,
74675,
74721,
74778,
74850,
74865,
74901,
74931,
74961,
74990,
75020,
75059,
75094,
75144,
75164,
75184,
75229,
75234,
75316,
75396,
75414,
75419,
75472,
75477,
75559,
75633,
75638,
75718,
75752,
75757,
75836,
75871,
75876,
75958,
76038,
76089,
76094,
76176,
76254,
76317,
76322,
76327,
76354,
76381,
76386,
76465,
76549,
76575,
76580,
76663,
76709,
76714,
76797,
76882,
76966,
77047,
77099,
77104,
77188,
77273,
77318,
77323,
77403,
77414,
77419,
77503,
77588,
77671,
77755,
77835,
77920,
77982,
77987,
78068,
78149,
78233,
78315,
78397,
78479,
78563,
78568,
78573,
78600,
78627,
78632,
78717,
78802,
78886,
78891,
78941,
78946,
79028,
79109,
79145,
79150,
79235,
79314,
79396,
79461,
79466,
79546,
79566,
79571,
79654,
79735,
79740,
79825,
79908,
79990,
80070,
80155,
80228,
80233,
80314,
80397,
80480,
80529,
80534,
80573,
80578,
80640,
80676,
80714,
80719,
80803,
80841,
80846,
80919,
81004,
81082,
81113,
81118,
81198,
81280,
81295,
81300,
81385,
81404,
81409,
81492,
81574,
81658,
81742,
81823,
81906,
81973,
81978,
82060,
82145,
82228,
82257,
82262,
82344,
82424,
82506,
82583,
82667,
82747,
82752,
82837,
82916,
83001,
83076,
83081,
83157,
83240,
83324,
83385,
83390,
83471,
83545,
83620,
83703,
83783,
83862,
83875,
83880,
83964,
84005,
84010,
84094,
84161,
84166,
84250,
84334,
84339,
84421,
84470,
84475,
84556,
84586,
84591,
84674,
84751,
84824,
84829,
84910,
84993,
85073,
85095,
85100,
85183,
85265,
85348,
85426,
85503,
85584,
85658,
85663,
85742,
85827,
85906,
85991,
85996,
86071,
86076,
86155,
86239,
86314,
86394,
86479,
86561,
86646,
86724,
86807,
86879,
86959,
87041,
87123,
87181,
87186,
87265,
87348,
87433,
87460,
87465,
87532,
87574,
87626,
87697,
87702,
87785,
87855,
87860,
87945,
88029,
88103,
88189,
88212,
88217,
88299,
88383,
88467,
88544,
88624,
88676,
88681,
88721,
88726,
88803,
88875,
88954,
88976,
88981,
89052,
89121,
89126,
89206,
89279,
89311,
89316,
89396,
89472,
89477,
89562,
89638,
89706,
89711,
89792,
89876,
89957,
90041,
90125,
90181,
90186,
90256,
90310,
90364,
90369,
90451,
90535,
90615,
90680,
90685,
90769,
90850,
90904,
90909,
90993,
91037,
91042,
91125,
91208,
91289,
91366,
91449,
91533,
91611,
91616,
91699,
91781,
91863,
91944,
91955,
91960,
92044,
92124,
92193,
92257,
92262,
92340,
92425,
92503,
92583,
92663,
92747,
92818,
92823,
92902,
92956,
92961,
93041,
93086,
93091,
93165,
93170,
93255,
93336,
93420,
93471,
93476,
93498,
93503,
93583,
93617,
93622,
93647,
93652,
93736,
93783,
93788,
93815,
93820,
93902,
93984,
93989,
94029,
94034,
94114,
94182,
94187,
94216,
94221,
94306,
94370,
94375,
94460,
94545,
94597,
94602,
94687,
94764,
94847,
94931,
95014,
95074,
95079,
95160,
95196,
95201,
95270,
95316,
95393,
95418,
95469,
95474,
95529,
95534,
95561,
95589,
95618,
95623,
95707,
95778,
95861,
95942,
95972,
95977,
96061,
96144,
96156,
96161,
96246,
96331,
96415,
96500,
96582,
96617,
96622,
96703,
96783,
96860,
96942,
97027,
97112,
97197,
97202,
97283,
97368,
97441,
97459,
97464,
97540,
97545,
97616,
97621,
97658,
97719,
97781,
97786,
97864,
97939,
98018,
98087,
98092,
98168,
98244,
98324,
98400,
98477,
98557,
98614,
98619,
98681,
98686,
98756,
98798,
98803,
98884,
98963,
99011,
99016,
99101,
99182,
99264,
99345,
99426,
99477,
99482,
99561,
99637,
99713,
99791,
99796,
99874,
99953,
100010,
100015,
100093,
100131,
100136,
100211,
100286,
100361,
100439,
100483,
100488,
100565,
100622,
100627,
100704,
100729,
100734,
100803,
100881,
100962,
100975,
100980,
101065,
101149,
101234,
101311,
101316,
101395,
101400,
101479,
101562,
101645,
101663,
101668,
101753,
101837,
101916,
101994,
102034,
102039,
102119,
102124,
102129,
102156,
102183,
102188,
102272,
102277,
102359,
102442,
102510,
102515,
102520,
102547,
102574,
102579,
102661,
102714,
102719,
102724,
102751,
102778,
102783,
102860,
102943,
103014,
103019,
103103,
103184,
103266,
103326,
103331,
103336,
103363,
103390,
103395,
103479,
103531,
103536,
103619,
103645,
103650,
103655,
103682,
103709,
103714,
103794,
103819,
103824,
103902,
103986,
104000,
104005,
104087,
104171,
104249,
104333,
104344,
104349,
104429,
104509,
104589,
104646,
104651,
104681,
104734,
104805,
104871,
104928,
104933,
105010,
105071,
105076,
105158,
105185,
105190,
105271,
105356,
105409,
105414,
105495,
105578,
105611,
105616,
105696,
105780,
105822,
105827,
105909,
105988,
106036,
106041,
106125,
106208,
106244,
106249,
106331,
106401,
106406,
106411,
106438,
106465,
106470,
106556,
106561,
106639,
106644,
106649,
106676,
106703,
106708,
106789,
106874,
106912,
106917,
106999,
107083,
107088,
107170,
107250,
107335,
107388,
107393,
107475,
107494,
107499,
107580,
107595,
107600,
107680,
107748,
107753,
107822,
107827,
107906,
107988,
108071,
108101,
108106,
108111,
108138,
108165,
108170,
108212,
108217,
108302,
108386,
108463,
108545,
108561,
108566,
108650,
108732,
108816,
108880,
108885,
108965,
109048,
109117,
109122,
109204,
109263,
109268,
109315,
109323,
109371,
109376,
109435,
109440,
109525,
109598,
109679,
109745,
109750,
109835,
109920,
109945,
109950,
109955,
109982,
110009,
110014,
110097,
110124,
110129,
110177,
110182,
110261,
110266,
110271,
110298,
110325,
110330,
110412,
110428,
110433,
110486,
110491,
110575,
110602,
110607,
110684,
110763,
110848,
110861,
110866,
110948,
111026,
111109,
111191,
111196,
111270,
111340,
111425,
111502,
111516,
111521,
111604,
111687,
111706,
111711,
111791,
111873,
111892,
111897,
111980,
112060,
112139,
112144,
112226,
112275,
112280,
112361,
112376,
112381,
112386,
112414,
112442,
112447,
112531,
112615,
112672,
112677,
112760,
112844,
112865,
112870,
112954,
113036,
113041,
113126,
113157,
113162,
113167,
113195,
113223,
113228,
113312,
113347,
113352,
113435,
113518,
113573,
113578,
113662,
113693,
113698,
113781,
113864,
113945,
113999,
114004,
114089,
114154,
114159,
114220,
114225,
114307,
114389,
114394,
114473,
114555,
114638,
114718,
114803,
114888,
114971,
115047,
115052,
115137,
115180,
115185,
115190,
115218,
115246,
115251,
115331,
115416,
115437,
115442,
115527,
115611,
115641,
115646,
115725,
115730,
115790,
115865,
115938,
115943,
116026,
116111,
116196,
116277,
116282,
116287,
116315,
116343,
116348,
116427,
116460,
116465,
116546,
116623,
116707,
116791,
116874,
116931,
116936,
116941,
116969,
116997,
117002,
117081,
117165,
117249,
117263,
117268,
117349,
117433,
117438,
117517,
117596,
117675,
117757,
117762,
117767,
117795,
117823,
117828,
117878,
117883,
117961,
118006,
118011,
118093,
118170,
118249,
118328,
118333,
118418,
118488,
118493,
118498,
118526,
118554,
118559,
118641,
118711,
118716,
118797,
118880,
118902,
118907,
118986,
119071,
119150,
119162,
119167,
119245,
119250,
119333,
119395,
119400,
119405,
119433,
119461,
119466,
119549,
119632,
119677,
119682,
119687,
119715,
119743,
119748,
119833,
119851,
119856,
119929,
119934,
120006,
120011,
120095,
120176,
120206,
120211,
120290,
120295,
120366,
120447,
120518,
120523,
120566,
120571,
120602,
120633,
120682,
120747,
120807,
120856,
120861,
120933,
120955,
120960,
121032,
121086,
121091,
121174,
121258,
121328,
121333,
121390,
121395,
121474,
121559,
121585,
121590,
121595,
121623,
121651,
121656,
121737,
121820,
121903,
121973,
121978,
121983,
122011,
122039,
122044,
122111,
122116,
122196,
122270,
122275,
122280,
122308,
122336,
122341,
122424,
122468,
122473,
122478,
122506,
122534,
122539,
122596,
122601,
122665,
122670,
122675,
122703,
122731,
122736,
122821,
122861,
122866,
122871,
122899,
122927,
122932,
123012,
123017,
123102,
123121,
123126,
123205,
123286,
123357,
123362,
123426,
123431,
123512,
123548,
123553,
123617,
123622,
123698,
123724,
123729,
123734,
123762,
123790,
123795,
123870,
123955,
123977,
123982,
124065,
124150,
124185,
124190,
124258,
124263,
124345,
124430,
124506,
124565,
124570,
124649,
124654,
124734,
124739,
124817,
124893,
124916,
124921,
124998,
125073,
125129,
125134,
125211,
125255,
125260,
125341,
125419,
125424,
125496,
125579,
125662,
125744,
125749,
125830,
125910,
125940,
125945,
125950,
125978,
126006,
126011,
126069,
126074,
126155,
126233,
126257,
126262,
126310,
126315,
126377,
126382,
126387,
126415,
126443,
126448,
126531,
126612,
126617,
126700,
126745,
126750,
126755,
126783,
126811,
126816,
126901,
126978,
126983,
127043,
127048,
127053,
127081,
127109,
127114,
127195,
127279,
127310,
127315,
127394,
127399,
127404,
127432,
127460,
127465,
127547,
127632,
127637,
127642,
127670,
127698,
127703,
127767,
127772,
127838,
127843,
127926,
128010,
128033,
128038,
128093,
128098,
128154,
128159,
128242,
128257,
128262,
128267,
128295,
128323,
128328,
128388,
128393,
128478,
128563,
128616,
128621,
128699,
128775,
128859,
128943,
129014,
129047,
129052,
129119,
129124,
129202,
129280,
129285,
129355,
129431,
129490,
129495,
129577,
129654,
129731,
129807,
129842,
129847,
129925,
129999,
130013,
130018,
130097,
130112,
130117,
130199,
130266,
130271,
130355,
130376,
130381,
130464,
130528,
130533,
130538,
130566,
130594,
130599,
130684,
130766,
130839,
130844,
130849,
130877,
130905,
130910,
130995,
131076,
131103,
131108,
131185,
131268,
131273,
131278,
131306,
131334,
131339,
131402,
131407,
131489,
131531,
131536,
131619,
131660,
131665,
131748,
131777,
131782,
131865,
131950,
131978,
131983,
132067,
132152,
132231,
132259,
132264,
132347,
132431,
132455,
132460,
132465,
132493,
132521,
132526,
132609,
132663,
132668,
132752,
132789,
132794,
132877,
132882,
132948,
132953,
133025,
133106,
133122,
133127,
133199,
133204,
133285,
133330,
133335,
133417,
133464,
133469,
133554,
133559,
133564,
133592,
133620,
133625,
133706,
133789,
133794,
133878,
133963,
134012,
134017,
134027,
134028,
134039,
134040,
134051,
134072,
134115,
134116,
134135,
134147,
134173
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 134173,
"ccnet_original_nlines": 2723,
"rps_doc_curly_bracket": 0.0005589799839071929,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3517184257507324,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028715230524539948,
"rps_doc_frac_lines_end_with_ellipsis": 0.0011013200273737311,
"rps_doc_frac_no_alph_words": 0.31048986315727234,
"rps_doc_frac_unique_words": 0.23423384130001068,
"rps_doc_mean_word_length": 4.524120807647705,
"rps_doc_num_sentences": 2021,
"rps_doc_symbol_to_word_ratio": 0.0018614899599924684,
"rps_doc_unigram_entropy": 6.813736438751221,
"rps_doc_word_count": 22802,
"rps_doc_frac_chars_dupe_10grams": 0.002423440106213093,
"rps_doc_frac_chars_dupe_5grams": 0.02815072052180767,
"rps_doc_frac_chars_dupe_6grams": 0.015035039745271206,
"rps_doc_frac_chars_dupe_7grams": 0.00944173987954855,
"rps_doc_frac_chars_dupe_8grams": 0.006979519966989756,
"rps_doc_frac_chars_dupe_9grams": 0.003005069913342595,
"rps_doc_frac_chars_top_2gram": 0.005331580061465502,
"rps_doc_frac_chars_top_3gram": 0.0014540699776262045,
"rps_doc_frac_chars_top_4gram": 0.0009499900043010712,
"rps_doc_books_importance": -12726.6845703125,
"rps_doc_books_importance_length_correction": -12726.6845703125,
"rps_doc_openwebtext_importance": -7634.26806640625,
"rps_doc_openwebtext_importance_length_correction": -7634.26806640625,
"rps_doc_wikipedia_importance": -5322.19677734375,
"rps_doc_wikipedia_importance_length_correction": -5322.19677734375
},
"fasttext": {
"dclm": 0.36754482984542847,
"english": 0.8950091600418091,
"fineweb_edu_approx": 2.180987596511841,
"eai_general_math": 0.8452534079551697,
"eai_open_web_math": 0.42021238803863525,
"eai_web_code": 0.9077886343002319
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,654,604,793,242,569,700 |
The last time I looked at random walks, I used them to calculate the value of Pi for Pi Day. But what is a random walk, really? A mathematician will tell you that it's a stochastic process—a path defined by a series of random steps. It's a pretty abstract concept, but I want to show you how it can reveal something fundamental about life itself—the proteins that make up you and me and everything around us.
So let's start with the simplest random walk, in one dimension.
One Dimensional Random Walk
Suppose I have an object. This object can either move one space to the left or one space to the right. Suppose I let it make 100 steps. Here's what that might look like. (click the "play" to run it)
That's at least marginally interesting, right? But the cool part is that if you run it a bunch of times, it will (on average) end up farther away from the starting point depending on the number of steps. Oh sure—it's possible that it could take 1,000 steps and end up where it started, but that probably won't happen.
But wait. There is another kind of random walk—there is the Self Avoiding Walk (SAW). This is just like a random walk except that the object can't cross over its own path. In one dimension this would just be an object that continues to move to the left or continues to move to the right. After it makes its first move, there is only one way it can go. This is a boring simulation, so I won't show it—but you can change line 37 in the code above so that it reads saw=True (case matters) and then it will be a self avoiding walk.
Now for a plot. Suppose I run the random walk (the normal one, not the self avoiding one) such that it goes 10 steps. If I repeat these 10 steps 500 times, I will get an average final distance. Then I can repeat this for 20 steps, then 30 steps and so on. After that (which takes a while to run), I get the following plot of average distance vs. number of steps. If you want to see the code to produce this plot, here it is (no warranty included).
Advertisement
What is important about this plot? Really, the only thing to notice is that this is different than a plot of a one dimensional random self avoiding walk. That plot would be boring as it would show the distance as equal to the number of steps (since it can't go back on itself).
Two Dimensional Random Walk
If we go in two dimensions, it gets a little more interesting. Check this out—it's a 2-D random self avoiding walk. I have it set for 100 steps, but it doesn't usually make it that far before it gets stuck. Yes, if the object avoids its own path it can get into a situation where it can not make a move. Check it out. Again, click the "play" to run it (it's fun).
Again, let's see what happens when I run it a bunch of times at 10 steps up to 500 steps. Note: I just have the program quit when it gets stuck for a SAW.
The curve that fits the data isn't important. The thing you should focus on is the difference between SAW and non-SAW data. Since the SAW can't cross its own path, it is forced to expand outward giving it (on average) a greater distance from the starting point. However, the SAW also gets stuck at some point such that it doesn't really get farther than 10 units away (that's why it levels off). I think that's pretty cool.
Three Dimensional Random Walk
When will it end? Will I just keep moving into more and more dimensions (spoiler alert: No, I am going to stop at 4-D). Here is a 3-D random SAW.
Note: I turned off "user zoom" so that you won't accidentally zoom to nothing. However, you can still rotate the scene since it's 3-D. Just right-click-drag or ctrl-click-drag to move the camera view of the 3-D path. It's pretty. Oh, also notice that this is rarely going to get "stuck." With six options for movement, there is probably going to be at least one of those directions that is open (and not already traveled).
Advertisement
What about average distance traveled for SAW vs. non-SAW? Here you go (note, this is the same program for all of these graphs).
Again, the SAW version ends up at a greater distance because the object can't cross its path and gets "pushed" out more. But both types of walks have nice curve fits with the increasing distance with step size to the power of 0.4975 and the SAW increasing at a power of 0.4688. So, they are close to being the same but still different.
Four Dimensional Random Walk
How do you make a random walk in four dimensions? Mathematically, it's pretty easy—you just need an extra variable to represent that fourth dimension (and no, you can't use time as a fourth dimension here). For my python code, I am just going use a vector for position along with an extra variable (that I call "w"). If you still want a visual animation, the code still works. It just displays motion in the fourth dimension as a change in color. That means that in a SAW, it's possible that the object appears to cross its own path—but it doesn't. Actually, it just moved in the fourth dimension (which you can't really see) and avoided the path. Here is the 4-D walk (notice that I didn't tell you to click "play").
Now for the important part. Here is a plot of final distance vs. step number for both the normal and the SAW.
Advertisement
Notice that there is still a difference between SAW and normal walks—but the difference is very small. Basically in 4-D the object doesn't really run into its own path so that it doesn't have to avoid itself. Oh, and I have never seen it get stuck (but it's still technically possible).
Random Walks in Real Life
You might be thinking that I'm just some crazy old man that's obsessed with random walks. OK, that's mostly true. But still—there are real world applications of random walks. In particular, proteins can be modeled as a random walk. I won't go into all the details of proteins except to say two things. First, these are long molecular chains. Second, proteins are important for living things like you and me. If a protein is like a random walk, then maybe this model shows why life is in three dimensions instead of one, two, or four. Hear me out. (Yes, I know I'm crazy.)
Life can't be in one dimension. Sure you could make a 1-D protein, but it would never do anything useful. It wouldn't interact with other things (except on the ends) and more importantly, it wouldn't interact with itself. If the protein chain can't fold over and connect back to itself, it can't make useful molecules (you know, for life and stuff).
What about two-dimensional life? The big problem here is that you can't make long proteins. Yeast proteins are over 400 units long. Good luck getting a random SAW that is over 50 units long without it getting stuck. You just can't get long proteins in two dimensions and you can't have yeast in 2-D. Without yeast, you can't have two-dimensional beer—so we know life can't exist in 2-D.
If more dimensions allows for longer proteins, then why isn't life in 4-D? Oh, don't worry about space being 3-D—that's a whole other debate we can save for another time. More importantly, there is a problem with 4-D random walks. Since there are so many options for each step, a random walk is unlikely to cross over its own path—which is bad for proteins. You want them to be able to get long but also to have the opportunity to connect to itself. In four dimensions, random walks do that rarely, which would make it difficult (unlikely) to get more complex molecules that are probably important for life.
Advertisement
Or maybe I'm still just a crazy dude that likes random walks.
Homework
How about some homework questions for you? Yes, that's a good idea.
• In all of my examples, I have a random walks (and SAW) as a lattice walk. This means that the vector location of the object always consists of components that are integers. This makes it much easier to program, but maybe it's not realistic. See if the same conclusions about random walks in different dimensions holds true for a random walk that takes a step size of 1 unit, but at a random angle. This is pretty easy in 2-D since you just need one random angle. In 3-D you need two angles (the angles from spherical coordinates). Not sure how do to this in 4-D. Oh, seeing if it crosses its own path is more difficult too. Good luck.
• What if you don't have a step size of 1 but instead each step has its own distance? Pick something like a normal distribution for step sizes and see if this same stuff works.
• What does the average distance vs. step number look like for a five-dimensional SAW and a 5-D random walk?
• What is the average number of steps before a random walk has a path conflict (such that it would have to either avoid its path or connect to make some type of molecule)? Yes, do this for two, three, and four dimensions.
|
{
"url": "https://www.wired.com/story/what-random-walks-in-multiple-dimensions-teach-you-about-life/",
"source_domain": "www.wired.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "363788",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MJTQHGLEKKUEKF3RDDMOJFG342DHTJNU",
"WARC-Concurrent-To": "<urn:uuid:8d177dfb-b555-43ba-b48c-4d56c46ed01f>",
"WARC-Date": "2019-10-23T00:25:09Z",
"WARC-IP-Address": "151.101.250.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O7ZH7X6XK2DYBRKOKWAEZIHB4BLX7XX7",
"WARC-Record-ID": "<urn:uuid:0f23f768-ec9c-43c9-a0b4-c9fe02a9c93d>",
"WARC-Target-URI": "https://www.wired.com/story/what-random-walks-in-multiple-dimensions-teach-you-about-life/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a28fba4a-95b6-4864-ae13-6213ba9818fe>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
409,
410,
474,
475,
503,
504,
703,
704,
1022,
1023,
1551,
1552,
2000,
2001,
2015,
2016,
2294,
2295,
2323,
2324,
2688,
2689,
2844,
2845,
3269,
3270,
3300,
3301,
3447,
3448,
3871,
3872,
3886,
3887,
4015,
4016,
4352,
4353,
4382,
4383,
5101,
5102,
5212,
5213,
5227,
5228,
5515,
5516,
5542,
5543,
6115,
6116,
6466,
6467,
6854,
6855,
7463,
7464,
7478,
7479,
7541,
7542,
7551,
7552,
7620,
7621,
8260,
8439,
8550
],
"line_end_idx": [
409,
410,
474,
475,
503,
504,
703,
704,
1022,
1023,
1551,
1552,
2000,
2001,
2015,
2016,
2294,
2295,
2323,
2324,
2688,
2689,
2844,
2845,
3269,
3270,
3300,
3301,
3447,
3448,
3871,
3872,
3886,
3887,
4015,
4016,
4352,
4353,
4382,
4383,
5101,
5102,
5212,
5213,
5227,
5228,
5515,
5516,
5542,
5543,
6115,
6116,
6466,
6467,
6854,
6855,
7463,
7464,
7478,
7479,
7541,
7542,
7551,
7552,
7620,
7621,
8260,
8439,
8550,
8773
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8773,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4688572883605957,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03138794004917145,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1790093183517456,
"rps_doc_frac_unique_words": 0.2705373764038086,
"rps_doc_mean_word_length": 4.190240859985352,
"rps_doc_num_sentences": 116,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.369208812713623,
"rps_doc_word_count": 1619,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02034197933971882,
"rps_doc_frac_chars_dupe_6grams": 0.010908019728958607,
"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.022110849618911743,
"rps_doc_frac_chars_top_3gram": 0.012971700169146061,
"rps_doc_frac_chars_top_4gram": 0.0038325500208884478,
"rps_doc_books_importance": -757.1715698242188,
"rps_doc_books_importance_length_correction": -757.1715698242188,
"rps_doc_openwebtext_importance": -483.9607238769531,
"rps_doc_openwebtext_importance_length_correction": -483.9607238769531,
"rps_doc_wikipedia_importance": -371.6584777832031,
"rps_doc_wikipedia_importance_length_correction": -371.6584777832031
},
"fasttext": {
"dclm": 0.9883490800857544,
"english": 0.9668456315994263,
"fineweb_edu_approx": 2.2665326595306396,
"eai_general_math": 0.982653796672821,
"eai_open_web_math": 0.4562087059020996,
"eai_web_code": 0.8186156153678894
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "572.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
}
},
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,447,350,372,561,050,000 |
Java method overloading tutorial with example
Method Overloading in java
The Java programming language supports overloading methods, and Java can distinguish between methods with different method signatures
Overloading is also known as Compile time polymorphism
Example
public class Student {
String name;
int age;
String email;
public void setData(String name,int age)
{
this.name=name;
this.age=age;
}
public void setData(String name,int age, String email)
{
this.name=name;
this.age=age;
this.email=email;
}
public void display()
{
System.out.println(name);
System.out.println(age);
System.out.println(email);
}
public static void main(String[] args) {
Student s1=new Student();
s1.setData("Shanthi", 20);
Student s2=new Student();
s1.setData("Veera", 25,"[email protected]");
}
}
Rules for overloading
1. Overloading can appear in the same class or a subclass
2. Overloaded methods MUST change its number of argument or its type.
When declaring two or more methods in same name complier differentiate them by its arguments, so you cannot declare two methods with the same signature
3. Overloaded methods CAN have different return type.
The compiler does not consider return type when differentiating methods, so it?s legal to change return type of overloaded method
4. Overloaded methods CAN change the access modifier.
Similarly overloaded method can have different access modifiers also.
5. Overloaded methods CAN declare new or broader checked exceptions.
Legal overloading
Overloaded method should have different argument
public class Student {
public void add(int i, int j)
{
}
public void add(int i)
{
}
}
It's legal for Overloaded method to change only its type
public class Student {
public void add(int i)
{
}
public void add(float i)
{
}
}
Overloaded method can change its return type
public class Student {
public void add(float i)
{
}
public int add(long i)
{
return 0;
}
}
Overloaded method can have different access modifiers
public class Student {
public int add(long i)
{
return 0;
}
private void add(char c)
{
}
}
Overloaded method can declare new or checked exception
public class Student {
public void add(int i)
{
}
public void add(short s)throws Exception
{
}
}
Illegal overloading
You cannot overload a method by changing only its return type
public class Student {
public void add(int i, int j)
{
}
public int add(int i, int j) // Compilation error - method already defined
{
}
}
Comments
©candidjava.com
|
{
"url": "http://java.candidjava.com/tutorial/Java-method-overloading-tutorial-with-example.htm",
"source_domain": "java.candidjava.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "18390",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BEJKXBGT2YSZ324U5VW6LA3B442UKEM7",
"WARC-Concurrent-To": "<urn:uuid:0ffdcc60-bdce-4450-af01-9f92dc699878>",
"WARC-Date": "2017-02-20T15:21:52Z",
"WARC-IP-Address": "54.173.231.138",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZKNCYR3VZZURMWYM5JKVJGRLVJOHA2ZJ",
"WARC-Record-ID": "<urn:uuid:f1292784-11aa-4bb7-a838-82e016f8b0ee>",
"WARC-Target-URI": "http://java.candidjava.com/tutorial/Java-method-overloading-tutorial-with-example.htm",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c7cd471a-cf0f-4d8b-aebb-d3da817a83a3>"
},
"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,
2,
3,
49,
50,
51,
78,
79,
213,
268,
269,
277,
300,
302,
316,
326,
341,
343,
385,
388,
406,
422,
425,
427,
483,
486,
504,
520,
540,
543,
545,
568,
571,
599,
626,
655,
658,
660,
702,
730,
759,
787,
837,
840,
843,
845,
846,
847,
869,
870,
928,
929,
1000,
1152,
1153,
1207,
1337,
1338,
1392,
1462,
1463,
1532,
1533,
1551,
1600,
1623,
1625,
1656,
1659,
1662,
1665,
1667,
1691,
1694,
1697,
1700,
1702,
1704,
1705,
1762,
1785,
1787,
1811,
1814,
1817,
1820,
1822,
1848,
1851,
1854,
1858,
1860,
1861,
1906,
1929,
1931,
1957,
1960,
1963,
1966,
1968,
1992,
1995,
2007,
2010,
2013,
2015,
2016,
2017,
2071,
2094,
2096,
2098,
2122,
2125,
2137,
2140,
2143,
2145,
2171,
2174,
2177,
2180,
2182,
2183,
2238,
2261,
2263,
2287,
2290,
2293,
2296,
2297,
2339,
2342,
2345,
2348,
2350,
2351,
2352,
2353,
2373,
2374,
2436,
2459,
2461,
2492,
2495,
2498,
2501,
2503,
2579,
2582,
2585,
2588,
2590,
2591,
2592,
2593,
2602,
2603,
2604
],
"line_end_idx": [
2,
3,
49,
50,
51,
78,
79,
213,
268,
269,
277,
300,
302,
316,
326,
341,
343,
385,
388,
406,
422,
425,
427,
483,
486,
504,
520,
540,
543,
545,
568,
571,
599,
626,
655,
658,
660,
702,
730,
759,
787,
837,
840,
843,
845,
846,
847,
869,
870,
928,
929,
1000,
1152,
1153,
1207,
1337,
1338,
1392,
1462,
1463,
1532,
1533,
1551,
1600,
1623,
1625,
1656,
1659,
1662,
1665,
1667,
1691,
1694,
1697,
1700,
1702,
1704,
1705,
1762,
1785,
1787,
1811,
1814,
1817,
1820,
1822,
1848,
1851,
1854,
1858,
1860,
1861,
1906,
1929,
1931,
1957,
1960,
1963,
1966,
1968,
1992,
1995,
2007,
2010,
2013,
2015,
2016,
2017,
2071,
2094,
2096,
2098,
2122,
2125,
2137,
2140,
2143,
2145,
2171,
2174,
2177,
2180,
2182,
2183,
2238,
2261,
2263,
2287,
2290,
2293,
2296,
2297,
2339,
2342,
2345,
2348,
2350,
2351,
2352,
2353,
2373,
2374,
2436,
2459,
2461,
2492,
2495,
2498,
2501,
2503,
2579,
2582,
2585,
2588,
2590,
2591,
2592,
2593,
2602,
2603,
2604,
2619
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2619,
"ccnet_original_nlines": 161,
"rps_doc_curly_bracket": 0.0175639595836401,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21904762089252472,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007619049865752459,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3028571307659149,
"rps_doc_frac_unique_words": 0.38650307059288025,
"rps_doc_mean_word_length": 5.809815883636475,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.380797386169434,
"rps_doc_word_count": 326,
"rps_doc_frac_chars_dupe_10grams": 0.04751848056912422,
"rps_doc_frac_chars_dupe_5grams": 0.23548045754432678,
"rps_doc_frac_chars_dupe_6grams": 0.20063358545303345,
"rps_doc_frac_chars_dupe_7grams": 0.17529039084911346,
"rps_doc_frac_chars_dupe_8grams": 0.1256599873304367,
"rps_doc_frac_chars_dupe_9grams": 0.09503696113824844,
"rps_doc_frac_chars_top_2gram": 0.05807814002037048,
"rps_doc_frac_chars_top_3gram": 0.06652586907148361,
"rps_doc_frac_chars_top_4gram": 0.07602956891059875,
"rps_doc_books_importance": -205.7591552734375,
"rps_doc_books_importance_length_correction": -205.7591552734375,
"rps_doc_openwebtext_importance": -146.1492462158203,
"rps_doc_openwebtext_importance_length_correction": -146.1492462158203,
"rps_doc_wikipedia_importance": -80.94525909423828,
"rps_doc_wikipedia_importance_length_correction": -80.94525909423828
},
"fasttext": {
"dclm": 0.966080904006958,
"english": 0.678609311580658,
"fineweb_edu_approx": 3.282353639602661,
"eai_general_math": 0.5264869332313538,
"eai_open_web_math": 0.04140627011656761,
"eai_web_code": 0.9775828123092651
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,579,966,264,681,285,600 |
Is Firefox Safe? Firefox is considered to be the safest of all the major browsers. One of the main reasons Firefox has remained safe is its reliably short market history....
As most of you probably know there are a lot of website owners making enormous quantities of money by running a blog, which has grown remarkably in recognition over the previous two-three several years. Some...
Cost-free iphone unlock - The Safest Software Reviewed Unlocking your Apple iphone can be a frustrating matter. There are lots of diverse softwares remaining marketed, and fact is several operate. Right here are some guidelines...
Blogging is escalating speedy as many individuals these times pick blogs as the medium to express and share their sights with individuals who share the very same interest. It is a terrific way to share...
Instead of telling you just how easy it is to install WordPress into your internet site, I'll go above the methods to install it and enable you come to a decision for you....
Joomla is a written content management system (CMS) like none other I have researched to date. There are a dozen or so CMS competitors. Some are commercial and demand for their software program. A number...
WordPress is a excellent platform when it arrives to make modifications to your internet site. Appearances of entire web pages can be improved just by uploading a new concept to your listing....
WordPress is simply the most popular running a blog platform close to proper now, but it is not specifically effectively regarded for remaining simple to add kinds to. In reality, there several...
In this posting I'm going to help you get started on your initial WordPress Web-site. In advance of we do that, permit me demonstrate what WordPress can do for you...
In this post are Wordpress tutorials made use of to troubleshoot a variety of bugs and or troubles just one may well encounter when working with Wordpress particularly when working with the Wordpress...
#wordpress #tutorial Any summary of the novel "The Green Mile" by Stephen King has to include a bit about the famous horror novelist, himself. He published this novel in 1996 as a serial...
If you're intrigued in earning a tiny extra revenue with your WP web site you should really commence by picking out the ideal WordPress concept. And, if you've been running a blog...
The sports ad states "Just Do It". That is accurately the mind-set you have to have to triumph at garden coming up with. Recall, these ideas or types you occur up with are not...
|
{
"url": "https://brannon.info/category/blog/page/9/",
"source_domain": "brannon.info",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "84428",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DFHI5E6Y2PPOZ3OXM3DWGCXC5KYYXLOQ",
"WARC-Concurrent-To": "<urn:uuid:ac46d4e8-d0e3-440f-9dce-ffe226af374d>",
"WARC-Date": "2019-02-24T05:18:44Z",
"WARC-IP-Address": "5.101.141.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IWIYXMLFCDE6VZODNG4EJBPUMZW3AWYA",
"WARC-Record-ID": "<urn:uuid:fe586877-7b52-44a4-a013-15a56c3606ab>",
"WARC-Target-URI": "https://brannon.info/category/blog/page/9/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d3a8f5ee-dfa2-4bea-b7d9-cd67a9586207>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-30-205-180.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,
174,
175,
386,
387,
618,
619,
824,
825,
1003,
1004,
1211,
1212,
1407,
1408,
1605,
1606,
1773,
1774,
1977,
1978,
2168,
2169,
2358,
2359
],
"line_end_idx": [
174,
175,
386,
387,
618,
619,
824,
825,
1003,
1004,
1211,
1212,
1407,
1408,
1605,
1606,
1773,
1774,
1977,
1978,
2168,
2169,
2358,
2359,
2537
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2537,
"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.436734676361084,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014285709708929062,
"rps_doc_frac_lines_end_with_ellipsis": 0.5199999809265137,
"rps_doc_frac_no_alph_words": 0.11224489659070969,
"rps_doc_frac_unique_words": 0.5654205679893494,
"rps_doc_mean_word_length": 4.696261882781982,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.036734689027071,
"rps_doc_unigram_entropy": 5.072017192840576,
"rps_doc_word_count": 428,
"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.011940300464630127,
"rps_doc_frac_chars_top_3gram": 0.01791045069694519,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -211.72935485839844,
"rps_doc_books_importance_length_correction": -211.72935485839844,
"rps_doc_openwebtext_importance": -127.61198425292969,
"rps_doc_openwebtext_importance_length_correction": -127.61198425292969,
"rps_doc_wikipedia_importance": -89.34333801269531,
"rps_doc_wikipedia_importance_length_correction": -89.34333801269531
},
"fasttext": {
"dclm": 0.042816758155822754,
"english": 0.9509508013725281,
"fineweb_edu_approx": 1.857965111732483,
"eai_general_math": 0.082203209400177,
"eai_open_web_math": 0.21048909425735474,
"eai_web_code": 0.016938980668783188
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,459,817,795,655,664,600 |
• Chennai, Bangalore & Online: 93450 45466Coimbatore: 95978 88270Madurai: 97900 94102
• Java Strings: String Functions In Java With Example Program
In this blog, we will cover in depth knowledge of strings in java using this table of content…
What is a string?
How strings are stored in java?
Ways to define strings in java
String as an array.
So let us jump in to understanding String functions in java, starting with the strings in java…
Strings In Java
A string is a sequence of characters or sentences or words, enclosed between double-quotes. To define a string, use a variable with String data type. String in java is present at java.lang.String class and hence it is an object.
There are two ways to create a string in java
With string literal
A string can be created by enclosing the characters in double-quotes which creates only one object as follows:
String str = “Hi there, how is it going?”;
With new keyword
A string can be created by prefixing the string with new keywords. This will create two objects, in the string pool and in the heap memory. Let me show you an example,
String str = new String(“Hi there, how is it going?”);
You might get a question, What is String Pool and Heap Memory? well, the string pool is a collection of all the defined strings, and heap memory has all the unique values of those strings. Whenever you define a new string with a previously saved value, the string pool will address the previously stored same value instead of creating a new one or allocating memory in the heap for the new string.
Hope you understood, what are strings in java, let us now learn about strings as an array in java.
String as an Array
Strings in java are immutable and shareable, that is they cannot be changed because a string is the same as an array of characters and as the size of the array cannot be changed after definition, the strings cannot be changed as well.
Here is an example
String data = ‘Helloo’; // is as same as char string[] = {‘H’,’e’,’l’,’l’,’o’,’o’}; String str = new String(string);
The java.lang.String class applies the three interfaces, Serializable interface, Comparable interface, and CharSequence interface.
If you want to create mutable strings, StringBuilder and StringBuilder classes and a StringTokenizer class can be used to divide the string into tokens.
Check out this Complete Online Java Course by FITA. FITA provides a complete Java course where you will be building real-time applications using Servlets, Hibernate Framework, and Spring with Aspect Oriented Programming (AOP) architecture,Struts through JDBC bundled with, placement support, and certification at an affordable price with an active placement cell, to make you an industry-certified java developer.
Methods for Strings In Java
There are many built-in methods for strings in java for calculating the length, removing spaces for replacing characters from the string, converting to lower or upper case, etc, so let’s discuss a few of them, starting with the length() method in java.
length() method in java
This function or method returns the size of a string. You might get confused with the length variable. The length variable works on arrays to return size such as array.length whereas the length() method works with strings to return the size of the string. Let me clear with an example
// Example program for demonstrating length() method import java.util.*; public class Main { // driver method public static void main(String args[]) { char string[] = {‘H’,’e’,’l’,’l’,’o’,’o’}; System.out.println(string.length); String str = “Hi there everybody”; System.out.println(str.length()); } }
Output for the above program
6 18
Hope you understood the length method of strings in java for finding the length of the string, let us now learn the compareTo() method of string in java.
compareTo() method in java
This method compares the two strings with case sensitivity and returns 0 if both are equal, -n for the number of additional characters and n (positive) for the number of missing characters.Here is an example
// Example program for demonstrating compareTo() method import java.util.*; public class Main{ public static void main(String args[]){ String s_1=”hi there”; String s_2=”HiThere”; String s_3 = “hi there everybody”; String s_4=”hola”; System.out.println(s1.compareTo(s_2)); System.out.println(s1.compareTo(s_3)); System.out.println(s4.compareTo(s_3)); }}
Output for the above program
-32 -10 6
You can also find the length of the string by comparing it with an empty string.
String str_1 = “FITA”; String str_2 = “”; //empty string //Returns the length of str_1 in positive str_1.compareTo(str_2); // outputs 4 // Returns the length of str_1 in negative str2.compareTo(str1); // outputs -4
Hope you understood the compareTo() method of strings in java for comparing two strings, let us now learn the concat() method of string in java.
concat() method in java
The concat() method concatenates or joins two strings, and returns a single string. Here is an example
// Example program for demonstrating concat() method import java.util.*; public class Main { public static void main(String args[]) { String s_1 = “Hi there, “; s_1 = s_1.concat(“how is it going?”); System.out.println(s_1); } }
Output for the above program
Hi there, how is it going?
Hope you understood the concat() method of strings in java for comparing two strings, let us now learn theisEmpty() method of string in java.
IsEmpty() method in java
This method will return true if the parameter passed contains character(s) or is not empty, else returns false.
// Example program for demonstrating isEmpty() method import java.util.*; public class Main { public static void main(String args[]) { String s_1 = “”; String s_2 = “following?”; System.out.println(s_1.isEmpty()); // true System.out.println(s_2.isEmpty()); // false } }
Output for the above program
true false
Hope you understood the isEmpty() method of strings in java to check if the string is empty, let us now learn the trim() method of string in java.
trim() method in java
The trim method removes the trailing and leading spaces from the string.
// Example program for demonstrating trim() method import java.util.*; public class Main { public static void main(String args[]) { String s1 = ” hola “; // without the trim method System.out.println(s1 + “where have you been”); // with the trim method System.out.println(s1.trim() + “where have you been”); } }
Output for the above program
hola where have you been holawhere have you been
Hope you understood the trim() method of strings in java to remove spaces from the string, let us now learn the toLowerCase() method of string in java.
toLowerCase() method in java
This method converts all the characters to lower case characters.
// Example program for demonstrating toLowerCase() method import java.util.*; public class Main { public static void main(String args[]) { String s1 = “It’s been raining since morning”; String low_s1 = s1.toLowerCase(); System.out.println(low_s1); } }
Output for the above program
it’s been raining since morning
Hope you understood the toLowerCase() method of strings in java to change the string to lower case, let us now learn the toUpperCase() method of string in java.
toUpperCase() method in java
This method will convert all the characters to uppercase and returns the new string.
// Example program for demonstrating toUpperCase() method import java.util.*; public class Main { public static void main(String args[]) { String s1 = “It’s been raining since morning”; String low_s1 = s1.toUpperCase(); System.out.println(low_s1); } }
Output for the above program
IT’S BEEN RAINING SINCE MORNING
Hope you understood the toUpperCase() method of strings in java to change the string to uppercase, let us now learn the ValueOf() method of string in java.
The ValueOf() method in java
This static method converts the passed parameter, a boolean, an integer, character, float or double, char array, or an object to a string. Here is the syntax for the various data type
String.valueOf(boolean b)
String.valueOf(char c)
String.valueOf(char[] data)
String.valueOf(double d)
String.valueOf(float f)
String.valueOf(int b)
String.valueOf(long l)
String.valueOf(Object o)
Here is an example program
// Example program for demonstrating ValueOf() method import java.util.*; public class Main { public static void main(String[] args) { int i = 4; long lng = -2363861L; float flt = 613.2f; double dbl = 713.433d; char chrs[] = { ‘J’, ‘a’, ‘v’, ‘a’,’,’, ‘J’, ‘a’, ‘v’, ‘a’ }; // convert values to strings System.out.println(String.valueOf(i)); System.out.println(String.valueOf(lng)); System.out.println(String.valueOf(flt)); System.out.println(String.valueOf(dbl)); // convert character array to string System.out.println(String.valueOf(chrs)); } }
Output for the above program
4 -2363861 613.2 713.433 Java, Java
Hope you understood the ValueOf() method of strings in java to get the value of a variable, let us now learn the replace() method of string in java.
replace() method in java
This method takes two arguments, one for the character of the string to be replaced and another one for replacing the character of the string with. Example program
// Example program for demonstrating replace() method import java.util.*; public class Main { public static void main(String args[]) { String str = “How is your day going?”; String rep_str = str.replace(‘H’, ‘W’); System.out.println(rep_str); } }
Output for the above program
Wow is your day going?
The replace() method can also take strings as the parameters, as follows
// Example program for demonstrating replace() method import java.util.*; public class Main { public static void main(String args[]) { String str = “How is your day going?”; String rep_str = str.replace(“is”, “was”); System.out.println(rep_str); } }
Output for the above program
How was your day going?
Hope you understood the replace() method of strings in java to replace one string with the other, let us now learn the contains() method of string in java.
contains() method in java
This method takes an argument of string or sequence of characters and will return true if the passed argument or string is found in the original string else returns false.
// Example program for demonstrating contains() method import java.util.*; public class Main { public static void main(String args[]) { String name = “Get the best of trainings at FITA Academy”; System.out.println(name.contains(“training”)); System.out.println(name.contains(“expensive”)); System.out.println(name.contains(“FITA Academy”)); } }
Output for the above program
true false true
Hope you understood the contains() method of strings in java to check if the given string is present in the other string, let us now learn the equals() and equalsIgnoreCase() method of string in java.
equals() and equalsIgnoreCase() method in java
The equals() method returns true if the given two arguments or strings are equal, else false with case sensitivity whereas equalsIgnoreCase() method will true without case sensitivity for the matched strings.
// Example program for demonstrating equals() and equalsIgnoreCase() method import java.util.*; public class Main { public static void main(String args[]) { String str_1 = “Best JAVA Training at FITA”; String str_2 = “best java training at fita”; System.out.println(s1.equals(str_2)); System.out.println(s1.equalsIgnoreCase(str_2)); } }
Output for the above program
true false
Hope you understood the equals() method and equalsIgnoreCase() method of strings in java to check if the two strings are equal with and without case sensitivity, let us now learn the toCharArray() method of string in java.
toCharArray() method in java
This method will convert the passed argument or string, to a character array as follows;
// Example program for demonstrating toCharArray() method import java.util.*; public class Main { public static void main(String args[]) { String s1 = “Best Java Training at FITA”; char[] ch = s1.toCharArray(); System.out.print(ch); } }
Output for the above program
Best Java Training at FITA
Hope you understood the toCharArray() method of strings in java to convert string to an array, let us now learn the endWith() method of string in java.
endsWith() method in java
This method returns true if the passed character or sequence of characters matches the sequence from the end, else returns false. Example Program
// Example program for demonstrating endWith() method import java.util.*; public class Main{ public static void main(String args[]) { String str=”On Campus Java Training in Chennai and Bangalore”; System.out.println(str.endsWith(“e”)); System.out.println(str.endsWith(“Chennai”)); System.out.println(str.endsWith(“Bangalore”)); } }
Output for the above program
true false true
Hope you understood the endWith() method of strings in java to check if the string ends with the given string, let us now learn the split() method of string in java.
split() method in java
This method can take upto two arguments a regex and an optional limit, and will return an array of substrings of the given string, divided at the specified regex, with size of limit (if specified).
// Example program for demonstrating split() method import java.util.*; import java.util.Arrays; class Main { public static void main(String[] args) { String str = “a,e,i,o,u,1,2,3,3”; String[] ch = str.split(“,”); System.out.println(“result = ” + Arrays.toString(ch)); } }
Output for the above program
result = [a, e, i, o, u, 1, 2, 3, 3]
Hope you understood the split() method of strings in java to divide the string on the input, let us now learn the charAt() method of string in java.
charAt() method in java
The charAt() method takes an index argument, and returns the value at the specified index.
// Example program for demonstrating charAt() method import java.util.*; class Main { public static void main(String[] args) { String str_1 = “Learn Java With FITA”; for (int i = 0; i < str_1.length(); i++) { System.out.println(str_1.charAt(i)); } } }
Output for the above program
L e a r n J a v a W i t h F I T A
There are many more string methods available, and I would recommend you to practice these problems on strings in java.
This was all about strings and methods in java with example programs. To get in-depth knowledge of core Java and advanced java, J2EE along with its various applications and real-time projects using Servlets, Spring with Aspect-Oriented Programming (AOP) architecture, Hibernate Framework,and Struts through JDBC you can enroll in Java Training in Chennai or Java Training in Bangalore by FITA at an affordable price, bundled with real-time projects, certification, support, and career guidance assistance with an active placement cell, to make you an industry required certified java developer.
FITA’s courses training is delivered by professional experts who have worked in the software development and testing industry for a minimum of 10+ years, and have experience of working with different software frameworks and software testing designs.
Quick Enquiry
Contact Us
Chennai
93450 45466
Bangalore
93450 45466
Coimbatore
95978 88270
For Hiring
93840 47472
[email protected]
Corporate Training
90036 23340
FITA Academy Branches
Chennai
Bangalore
Coimbatore
Other Locations
FITA Academy - Velachery
Plot No 7, 2nd floor,
Vadivelan Nagar,
Velachery Main Road,
Velachery, Chennai - 600042
Tamil Nadu
: 93450 45466
FITA Academy - Anna Nagar
No 14, Block No, 338, 2nd Ave,
Anna Nagar,
Chennai 600 040, Tamil Nadu
Next to Santhosh Super Market
: 93450 45466
FITA Academy - T Nagar
05, 5th Floor, Challa Mall,
T Nagar,
Chennai 600 017, Tamil Nadu
Opposite to Pondy Bazaar Globus
: 93450 45466
FITA Academy - Tambaram
Nehru Nagar, Kadaperi,
GST Road, West Tambaram,
Chennai 600 045, Tamil Nadu
Opposite to Saravana Jewellers Near MEPZ
: 93450 45466
FITA Academy - Thoraipakkam
5/350, Old Mahabalipuram Road,
Okkiyam Thoraipakkam,
Chennai 600 097, Tamil Nadu
Next to Cognizant Thoraipakkam Office and Opposite to Nilgris Supermarket
: 93450 45466
FITA Academy Marathahalli
No 7, J J Complex,
ITPB Road, Aswath Nagar,
Marathahalli Post,
Bengaluru 560037
: 93450 45466
FITA Academy - Saravanampatty
First Floor, Promenade Tower,
171/2A, Sathy Road, Saravanampatty,
Coimbatore - 641035
Tamil Nadu
: 95978 88270
FITA Academy - Singanallur
348/1, Kamaraj Road,
Varadharajapuram, Singanallur,
Coimbatore - 641015
Tamil Nadu
: 95978 88270
FITA Academy - Madurai
No.2A, Sivanandha salai,
Arapalayam Cross Road,
Ponnagaram Colony,
Madurai - 625016, Tamil Nadu
: 97900 94102
• Trending Courses
JAVA Training In Chennai Dot Net Training In Chennai Software Testing Training In Chennai Cloud Computing Training In Chennai AngularJS Training in Chennai Big Data Hadoop Training In Chennai Android Training In Chennai iOS Training In Chennai Web Designing Course In Chennai PHP Training In Chennai Digital Marketing Course In Chennai SEO Training In Chennai
Oracle Training In Chennai Selenium Training In Chennai Data Science Course In Chennai RPA Training In Chennai DevOps Training In Chennai C / C++ Training In Chennai UNIX Training In Chennai Placement Training In Chennai German Classes In Chennai Python Training in Chennai Artificial Intelligence Course in Chennai AWS Training in Chennai Core Java Training in Chennai Javascript Training in ChennaiHibernate Training in ChennaiHTML5 Training in ChennaiPhotoshop Classes in ChennaiMobile Testing Training in ChennaiQTP Training in ChennaiLoadRunner Training in ChennaiDrupal Training in ChennaiManual Testing Training in ChennaiSpring Training in ChennaiStruts Training in ChennaiWordPress Training in ChennaiSAS Training in ChennaiClinical SAS Training in ChennaiBlue Prism Training in ChennaiMachine Learning course in ChennaiMicrosoft Azure Training in ChennaiUiPath Training in ChennaiMicrosoft Dynamics CRM Training in ChennaiUI UX Design course in ChennaiSalesforce Training in ChennaiVMware Training in ChennaiR Training in ChennaiAutomation Anywhere Training in ChennaiTally course in ChennaiReactJS Training in ChennaiCCNA course in ChennaiEthical Hacking course in ChennaiGST Training in ChennaiIELTS Coaching in ChennaiSpoken English Classes in ChennaiSpanish Classes in ChennaiJapanese Classes in ChennaiTOEFL Coaching in ChennaiFrench Classes in ChennaiInformatica Training in ChennaiInformatica MDM Training in ChennaiBig Data Analytics courses in ChennaiHadoop Admin Training in ChennaiBlockchain Training in ChennaiIonic Training in ChennaiIoT Training in ChennaiXamarin Training In ChennaiNode JS Training In ChennaiContent Writing Course in ChennaiAdvanced Excel Training In ChennaiCorporate Training in ChennaiEmbedded Training In ChennaiLinux Training In ChennaiOracle DBA Training In ChennaiPEGA Training In ChennaiPrimavera Training In ChennaiTableau Training In ChennaiSpark Training In ChennaiGraphic Design Courses in ChennaiAppium Training In ChennaiSoft Skills Training In ChennaiJMeter Training In ChennaiPower BI Training In ChennaiSocial Media Marketing Courses In ChennaiTalend Training in ChennaiHR Courses in ChennaiGoogle Cloud Training in ChennaiSQL Training In ChennaiCCNP Training in Chennai
• Are You Located in Any of these Areas
Adyar, Adambakkam, Anna Salai, Ambattur, Ashok Nagar, Aminjikarai, Anna Nagar, Besant Nagar, Chromepet, Choolaimedu, Guindy, Egmore, K.K. Nagar, Kodambakkam, Koyambedu, Ekkattuthangal, Kilpauk, Meenambakkam, Medavakkam, Nandanam, Nungambakkam, Madipakkam, Teynampet, Nanganallur, Navalur, Mylapore, Pallavaram, Purasaiwakkam, OMR, Porur, Pallikaranai, Poonamallee, Perambur, Saidapet, Siruseri, St.Thomas Mount, Perungudi, T.Nagar, Sholinganallur, Triplicane, Thoraipakkam, Tambaram, Vadapalani, Valasaravakkam, Villivakkam, Thiruvanmiyur, West Mambalam, Velachery and Virugambakkam.
FITA Velachery or T Nagar or Thoraipakkam OMR or Anna Nagar or Tambaram branch is just few kilometre away from your location. If you need the best training in Chennai, driving a couple of extra kilometres is worth it!
|
{
"url": "https://www.fita.in/string-functions-in-java/",
"source_domain": "www.fita.in",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "201003",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TXESRBP6AKA2CJW34YN3RLXOXLTX5F6P",
"WARC-Concurrent-To": "<urn:uuid:f5db995a-7196-4aba-9963-35324f2b0153>",
"WARC-Date": "2022-10-02T22:33:46Z",
"WARC-IP-Address": "3.108.12.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6VPKBU7CLIRD4JLZR62GLHZU2AFJKGZF",
"WARC-Record-ID": "<urn:uuid:8e8ecbe9-9748-49f4-a1de-e34faed802ef>",
"WARC-Target-URI": "https://www.fita.in/string-functions-in-java/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6e01406-76dd-4f00-b016-3b74d5ffd018>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-45\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,
88,
89,
153,
154,
155,
156,
255,
256,
278,
314,
349,
373,
473,
474,
494,
495,
728,
729,
779,
803,
918,
965,
986,
1158,
1217,
1218,
1620,
1621,
1724,
1725,
1748,
1749,
1988,
1989,
2013,
2138,
2139,
2274,
2275,
2432,
2433,
2851,
2852,
2884,
2885,
3142,
3143,
3171,
3172,
3461,
3462,
3768,
3801,
3810,
3968,
3999,
4000,
4212,
4213,
4575,
4608,
4622,
4707,
4931,
4932,
5081,
5082,
5110,
5217,
5449,
5482,
5513,
5660,
5689,
5805,
6079,
6112,
6127,
6278,
6304,
6381,
6704,
6737,
6794,
6950,
6983,
7053,
7309,
7344,
7380,
7545,
7578,
7667,
7923,
7956,
7992,
8152,
8185,
8373,
8403,
8430,
8462,
8491,
8519,
8545,
8572,
8601,
8632,
9187,
9220,
9260,
9413,
9442,
9610,
9861,
9894,
9921,
9998,
10252,
10285,
10313,
10473,
10503,
10679,
11028,
11061,
11081,
11082,
11287,
11288,
11339,
11340,
11553,
11554,
11895,
11928,
11943,
11944,
12171,
12172,
12205,
12298,
12539,
12572,
12603,
12759,
12789,
12939,
13275,
13308,
13328,
13329,
13499,
13500,
13527,
13528,
13730,
13731,
14009,
14042,
14083,
14236,
14264,
14359,
14615,
14648,
14692,
14693,
14816,
14817,
15416,
15417,
15672,
15673,
15674,
15675,
15676,
15677,
15678,
15696,
15697,
15712,
15713,
15725,
15726,
15744,
15745,
15759,
15760,
15777,
15778,
15793,
15794,
15811,
15812,
15827,
15828,
15845,
15861,
15862,
15885,
15886,
15903,
15904,
15905,
15931,
15932,
15944,
15958,
15973,
15993,
16022,
16048,
16069,
16094,
16126,
16141,
16142,
16166,
16167,
16197,
16232,
16248,
16280,
16314,
16315,
16339,
16340,
16367,
16399,
16412,
16444,
16480,
16481,
16505,
16506,
16534,
16561,
16590,
16622,
16667,
16668,
16692,
16693,
16725,
16760,
16786,
16818,
16896,
16897,
16921,
16922,
16952,
16975,
17004,
17027,
17048,
17049,
17073,
17074,
17108,
17142,
17182,
17206,
17221,
17222,
17246,
17247,
17278,
17303,
17338,
17362,
17377,
17378,
17402,
17403,
17430,
17459,
17486,
17509,
17542,
17543,
17567,
17568,
17589,
17590,
17954,
17955,
20189,
20190,
20232,
20233,
20821,
20822
],
"line_end_idx": [
88,
89,
153,
154,
155,
156,
255,
256,
278,
314,
349,
373,
473,
474,
494,
495,
728,
729,
779,
803,
918,
965,
986,
1158,
1217,
1218,
1620,
1621,
1724,
1725,
1748,
1749,
1988,
1989,
2013,
2138,
2139,
2274,
2275,
2432,
2433,
2851,
2852,
2884,
2885,
3142,
3143,
3171,
3172,
3461,
3462,
3768,
3801,
3810,
3968,
3999,
4000,
4212,
4213,
4575,
4608,
4622,
4707,
4931,
4932,
5081,
5082,
5110,
5217,
5449,
5482,
5513,
5660,
5689,
5805,
6079,
6112,
6127,
6278,
6304,
6381,
6704,
6737,
6794,
6950,
6983,
7053,
7309,
7344,
7380,
7545,
7578,
7667,
7923,
7956,
7992,
8152,
8185,
8373,
8403,
8430,
8462,
8491,
8519,
8545,
8572,
8601,
8632,
9187,
9220,
9260,
9413,
9442,
9610,
9861,
9894,
9921,
9998,
10252,
10285,
10313,
10473,
10503,
10679,
11028,
11061,
11081,
11082,
11287,
11288,
11339,
11340,
11553,
11554,
11895,
11928,
11943,
11944,
12171,
12172,
12205,
12298,
12539,
12572,
12603,
12759,
12789,
12939,
13275,
13308,
13328,
13329,
13499,
13500,
13527,
13528,
13730,
13731,
14009,
14042,
14083,
14236,
14264,
14359,
14615,
14648,
14692,
14693,
14816,
14817,
15416,
15417,
15672,
15673,
15674,
15675,
15676,
15677,
15678,
15696,
15697,
15712,
15713,
15725,
15726,
15744,
15745,
15759,
15760,
15777,
15778,
15793,
15794,
15811,
15812,
15827,
15828,
15845,
15861,
15862,
15885,
15886,
15903,
15904,
15905,
15931,
15932,
15944,
15958,
15973,
15993,
16022,
16048,
16069,
16094,
16126,
16141,
16142,
16166,
16167,
16197,
16232,
16248,
16280,
16314,
16315,
16339,
16340,
16367,
16399,
16412,
16444,
16480,
16481,
16505,
16506,
16534,
16561,
16590,
16622,
16667,
16668,
16692,
16693,
16725,
16760,
16786,
16818,
16896,
16897,
16921,
16922,
16952,
16975,
17004,
17027,
17048,
17049,
17073,
17074,
17108,
17142,
17182,
17206,
17221,
17222,
17246,
17247,
17278,
17303,
17338,
17362,
17377,
17378,
17402,
17403,
17430,
17459,
17486,
17509,
17542,
17543,
17567,
17568,
17589,
17590,
17954,
17955,
20189,
20190,
20232,
20233,
20821,
20822,
21043
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21043,
"ccnet_original_nlines": 294,
"rps_doc_curly_bracket": 0.0034215699415653944,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2570151388645172,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020362550392746925,
"rps_doc_frac_lines_end_with_ellipsis": 0.006779660005122423,
"rps_doc_frac_no_alph_words": 0.24906879663467407,
"rps_doc_frac_unique_words": 0.2665267586708069,
"rps_doc_mean_word_length": 5.537250995635986,
"rps_doc_num_sentences": 215,
"rps_doc_symbol_to_word_ratio": 0.0004966499982401729,
"rps_doc_unigram_entropy": 5.475992202758789,
"rps_doc_word_count": 2859,
"rps_doc_frac_chars_dupe_10grams": 0.1152801513671875,
"rps_doc_frac_chars_dupe_5grams": 0.2737666666507721,
"rps_doc_frac_chars_dupe_6grams": 0.19739751517772675,
"rps_doc_frac_chars_dupe_7grams": 0.14869560301303864,
"rps_doc_frac_chars_dupe_8grams": 0.13037711381912231,
"rps_doc_frac_chars_dupe_9grams": 0.13037711381912231,
"rps_doc_frac_chars_top_2gram": 0.0454803891479969,
"rps_doc_frac_chars_top_3gram": 0.0257722195237875,
"rps_doc_frac_chars_top_4gram": 0.030320260673761368,
"rps_doc_books_importance": -1755.627685546875,
"rps_doc_books_importance_length_correction": -1755.627685546875,
"rps_doc_openwebtext_importance": -923.6223754882812,
"rps_doc_openwebtext_importance_length_correction": -923.6223754882812,
"rps_doc_wikipedia_importance": -671.9071655273438,
"rps_doc_wikipedia_importance_length_correction": -671.9071655273438
},
"fasttext": {
"dclm": 0.05185287818312645,
"english": 0.7407242059707642,
"fineweb_edu_approx": 2.66941499710083,
"eai_general_math": 0.04353398084640503,
"eai_open_web_math": 0.03029816970229149,
"eai_web_code": 0.026491520926356316
}
}
|
{
"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": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,534,829,369,391,542,300 |
Commit ce364d12 authored by Yushin Cho's avatar Yushin Cho Committed by Thomas Daede
[OBU] Start enabing OBU
Enable OBU Headers, also use the most recent code of libaom,
so that rav1e generated bitstream can be decodable by current version of
aomdec.
- Add OBU_Type enum
- write_obu_header() funcion
- Copy reference av1_pack_bitstream() C code fro libaom, where sequence
and frame level OBUs are written.
[OBU] Add Sequence Header and revise its functions
[OBU] More on sequence header functions and types
- Revise the type of Sequence struct members.
- Add write_sequence_header2(), which is modified version of
write_sequence_header() for OBU.
- Add new color_config(), i.e. updated color info.
TODO:
- The structure of OBU is three parts:
1) OBU header
2) Size of OBU (written in leb128() format of AV1)
3) OBU (with specific obu_type signlaed in OBU header)
So, need to figure out how to post-write the size of obu (i.e, payload size) after
writing obu. In libaom, this is implemented by calling obu_memmove() on byte buffer,
which moves the obu data by payload size in bytes to create a gap between obu header
and obu then write a obu size.
parent 920a6bd0
......@@ -42,7 +42,7 @@ fn main() {
.define("CONFIG_UNIT_TESTS", "0")
.define("CONFIG_EXT_PARTITION", "0")
.define("CONFIG_EXT_PARTITION_TYPES", "0")
.define("CONFIG_OBU", "0")
.define("CONFIG_OBU", "1")
.define("CONFIG_FILTER_INTRA", "0")
.define("CONFIG_EXT_SKIP", "0")
.define("CONFIG_LV_MAP", "1")
......
......@@ -27,7 +27,7 @@ fn main() {
let mut fi =
FrameInvariants::new(width, height, files.quantizer, files.speed);
let sequence = Sequence::new();
let mut sequence = Sequence::new(width, height);
write_ivf_header(
&mut files.output_file,
width,
......
......@@ -30,7 +30,7 @@ fn main() {
};
let mut fi =
FrameInvariants::new(width, height, files.quantizer, files.speed);
let sequence = Sequence::new();
let mut sequence = Sequence::new(width, height);
write_ivf_header(
&mut files.output_file,
fi.padded_w,
......
This diff is collapsed.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
{
"url": "https://gitlab.xiph.org/ePirat/rav1e-import-test/-/commit/ce364d12f820a8c70900f7d58fb075d1e803abe3",
"source_domain": "gitlab.xiph.org",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "93972",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KAXKLAJBTAP2U7FXKR6W2WP2CB7GSE7Z",
"WARC-Concurrent-To": "<urn:uuid:e1d6be93-6d13-41b3-8629-f24c712b5ad9>",
"WARC-Date": "2020-08-06T21:58:20Z",
"WARC-IP-Address": "140.211.166.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D7XFHJ2O5S3RFUR2NB2VAKX3MOVCSOG7",
"WARC-Record-ID": "<urn:uuid:8470fa7f-e1bb-4c55-91af-e4b0583e5f73>",
"WARC-Target-URI": "https://gitlab.xiph.org/ePirat/rav1e-import-test/-/commit/ce364d12f820a8c70900f7d58fb075d1e803abe3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3f4bc75f-f742-4201-b4b0-2eeaa7d1148d>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-28.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,
85,
86,
110,
111,
172,
245,
253,
254,
274,
303,
375,
411,
412,
463,
464,
514,
515,
561,
622,
657,
708,
709,
715,
754,
768,
819,
874,
875,
958,
1043,
1128,
1159,
1175,
1211,
1245,
1282,
1325,
1352,
1379,
1415,
1447,
1477,
1484,
1520,
1533,
1600,
1632,
1681,
1699,
1723,
1730,
1737,
1773,
1776,
1789,
1856,
1888,
1937,
1955,
1979,
1992,
1999,
2023,
2045,
2051,
2122,
2157
],
"line_end_idx": [
85,
86,
110,
111,
172,
245,
253,
254,
274,
303,
375,
411,
412,
463,
464,
514,
515,
561,
622,
657,
708,
709,
715,
754,
768,
819,
874,
875,
958,
1043,
1128,
1159,
1175,
1211,
1245,
1282,
1325,
1352,
1379,
1415,
1447,
1477,
1484,
1520,
1533,
1600,
1632,
1681,
1699,
1723,
1730,
1737,
1773,
1776,
1789,
1856,
1888,
1937,
1955,
1979,
1992,
1999,
2023,
2045,
2051,
2122,
2157,
2186
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2186,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0.0018298299983143806,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17864476144313812,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04517453908920288,
"rps_doc_frac_lines_end_with_ellipsis": 0.04411764815449715,
"rps_doc_frac_no_alph_words": 0.3963038921356201,
"rps_doc_frac_unique_words": 0.5633803009986877,
"rps_doc_mean_word_length": 5.538732528686523,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.024640660732984543,
"rps_doc_unigram_entropy": 4.757282733917236,
"rps_doc_word_count": 284,
"rps_doc_frac_chars_dupe_10grams": 0.19961856305599213,
"rps_doc_frac_chars_dupe_5grams": 0.19961856305599213,
"rps_doc_frac_chars_dupe_6grams": 0.19961856305599213,
"rps_doc_frac_chars_dupe_7grams": 0.19961856305599213,
"rps_doc_frac_chars_dupe_8grams": 0.19961856305599213,
"rps_doc_frac_chars_dupe_9grams": 0.19961856305599213,
"rps_doc_frac_chars_top_2gram": 0.015257470309734344,
"rps_doc_frac_chars_top_3gram": 0.011443099938333035,
"rps_doc_frac_chars_top_4gram": 0.015257470309734344,
"rps_doc_books_importance": -161.54014587402344,
"rps_doc_books_importance_length_correction": -161.54014587402344,
"rps_doc_openwebtext_importance": -88.30069732666016,
"rps_doc_openwebtext_importance_length_correction": -88.30069732666016,
"rps_doc_wikipedia_importance": -89.2275161743164,
"rps_doc_wikipedia_importance_length_correction": -89.2275161743164
},
"fasttext": {
"dclm": 0.09009277820587158,
"english": 0.6664754152297974,
"fineweb_edu_approx": 2.7560973167419434,
"eai_general_math": 0.013750020414590836,
"eai_open_web_math": 0.4060444235801697,
"eai_web_code": 0.012221629731357098
}
}
|
{
"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.3922",
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,275,008,483,508,004,000 |
Study Guide
Area - The Basics of Area
The Basics of Area
There are a whole bunch of different shapes in geometry. At this point, that should be fairly obvious. If there weren't different shapes, you wouldn't be reading this right now.
But the sad truth is that you are, and you have circles, triangles, and quadrilaterals to thank for that. Euclid, Pythagoras, and the rest of those ancient Greeks aren't exactly innocent, either, but they did give us democracy and theatre and yogurt, so they can't be that bad.
As you've learned, each shape has its own particular properties. Each one is special and unique, like a snowflake or a flu virus. Luckily, all 2D shapes share one unifying characteristic: area. Granted, calculating the area is different for each shape, but it doesn't change the fact that every two-dimensional shape has an area.
So what is area and why do we care about it? Area is the amount of space within the boundaries of a two-dimensional shape. You can think of area as the amount of paint needed to cover a particular 2D space.
Let's say Vincent Van Gogh is willing to pay you $100 to paint his wall. With all the paintings he's working on, he can't be bothered with trivial wall painting. It's beneath him. Anyway, the $100 offer may or may not be a good one, depending on how big that wall is.
How much room is there between the boundaries of the ceiling, floor, and the two edges of the wall? How much wall do you actually need to paint? What is the wall's area? All three questions ask the same thing. And you may or may not take Van Gogh up on his offer, depending on the answer.
Imagine you're trying to explain the game of football to your friend from Spain, and she asks, "Football? Do you mean fútbol? Oh wait, that's soccer. So how big is a football field compared to a fútbol field?" In mathematical terms, your friend is asking you to compare the areas of the two fields. You can do it. ¡Sí, se puede!
Sample Problem
Is it possible to calculate the area of a line?
Nope. Like we said before, area is two-dimensional, which means we need a closed 2D shape. A line is neither a shape nor two-dimensional. We can calculate the length of a line (though a true line is infinitely long), but not area.
For you visual learners out there, fear not. Here's a visual example.
This is a rectangle. Say hello.
Let's say the rectangle has an area of 24 inches2. That means that the shaded area within the border totals 24 inches2.
Hold up. Inches2? Does the 2 mean a footnote or something?
No, no. Let's be real. We know that the chances of anyone reading a footnote are slim to none. The "2" represents "squared." (Yes, we know the shape is a rectangle and not a square. Don't get your panties in a bunch.) By "squared," we mean, "raised to the power of two."
Why? We're glad we asked. Area is a two-dimensional unit of measure. When calculating area, make sure the units of the shape are consistent. If we measure one side of the rectangle in inches and the other side in feet, we'll end up with some funky-looking units. It's best to make them either inches or feet so that our units will ultimately be either in2 or ft2.
Sample Problem
A triangle's measurements are in units of meters. What units will its area be in?
Remember, area is a two-dimensional unit, which means that our final answer will be in square units. In this case, since the triangle's measurements are in meters, its area will be in units of square meters, or m2.
Also consider that units of area have to be squared units of distance. Gram (mass) and liters (volume), even if they're squared, aren't units for area.
But what about the numbers? What does area actually mean for any given shape? And how do we go about finding it?
Don't worry your pretty little head. We'll discuss ways to calculate area for triangles, quadrilaterals, and circles. In the end, you'll know whether Van Gogh is trying to rip you off with that wall-painting offer. Though you could just follow in the footsteps of Tom Sawyer and get others to do it for you. Van Gogh will never see (or, unfortunately, hear) it coming.
This is a premium product
Tired of ads?
Join today and never see them again.
Please Wait...
|
{
"url": "https://www.shmoop.com/study-guides/math/area/area-basics",
"source_domain": "www.shmoop.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "79959",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T4P5C3Y3TVG55OBHVLK2VCEIDSIZ5H2S",
"WARC-Concurrent-To": "<urn:uuid:7de463c0-4d67-4ec9-971d-775268aeb26c>",
"WARC-Date": "2021-09-28T23:13:51Z",
"WARC-IP-Address": "52.45.97.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GKERX4OH24A6RS7ZY373A3KCQWF36IYG",
"WARC-Record-ID": "<urn:uuid:83b37b70-7354-42f1-93ac-7ed8c704187c>",
"WARC-Target-URI": "https://www.shmoop.com/study-guides/math/area/area-basics",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aaee14ac-db56-41ba-bc1b-9f25baf5b918>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-43\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,
12,
13,
39,
40,
59,
60,
238,
239,
517,
518,
848,
849,
1056,
1057,
1325,
1326,
1615,
1616,
1945,
1946,
1961,
1962,
2010,
2011,
2242,
2243,
2313,
2314,
2346,
2347,
2467,
2468,
2527,
2528,
2799,
2800,
3164,
3165,
3180,
3181,
3263,
3264,
3479,
3480,
3632,
3633,
3746,
3747,
4116,
4117,
4143,
4144,
4158,
4159,
4196,
4197
],
"line_end_idx": [
12,
13,
39,
40,
59,
60,
238,
239,
517,
518,
848,
849,
1056,
1057,
1325,
1326,
1615,
1616,
1945,
1946,
1961,
1962,
2010,
2011,
2242,
2243,
2313,
2314,
2346,
2347,
2467,
2468,
2527,
2528,
2799,
2800,
3164,
3165,
3180,
3181,
3263,
3264,
3479,
3480,
3632,
3633,
3746,
3747,
4116,
4117,
4143,
4144,
4158,
4159,
4196,
4197,
4211
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4211,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44742268323898315,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005154639948159456,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.18453608453273773,
"rps_doc_frac_unique_words": 0.41469815373420715,
"rps_doc_mean_word_length": 4.255905628204346,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0.0010309299686923623,
"rps_doc_unigram_entropy": 5.174790382385254,
"rps_doc_word_count": 762,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02590193971991539,
"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.00555041991174221,
"rps_doc_frac_chars_top_3gram": 0.008017269894480705,
"rps_doc_frac_chars_top_4gram": 0.00925069022923708,
"rps_doc_books_importance": -408.5479431152344,
"rps_doc_books_importance_length_correction": -408.5479431152344,
"rps_doc_openwebtext_importance": -254.2970733642578,
"rps_doc_openwebtext_importance_length_correction": -254.2970733642578,
"rps_doc_wikipedia_importance": -199.99037170410156,
"rps_doc_wikipedia_importance_length_correction": -199.99037170410156
},
"fasttext": {
"dclm": 0.9768253564834595,
"english": 0.9643577337265015,
"fineweb_edu_approx": 2.3948757648468018,
"eai_general_math": 0.8434969782829285,
"eai_open_web_math": 0.3040165305137634,
"eai_web_code": 0.1129922866821289
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,330,122,863,412,237,000 |
r3834 HNDP_RUNNERS_LISTSRC: new option
[racktables] / inc / config.php
CommitLineData
b325120a 1<?php
e673ee24 2/*
9c0b0016
DO
3 *
4 * This file used to hold a collection of constants, variables and arrays,
5 * which drived the way misc RackTables functions performed. Now most of
201056a2 6 * them have gone into the database, and there is a user interface
9c0b0016
DO
7 * for changing them. This file now provides a couple of functions to
8 * access the new config storage.
9 *
8d07e3e0
DO
10 */
11
8d07e3e0 12
9c0b0016 13// Current code version is subject to change with each new release.
98cc6bd8 14define ('CODE_VERSION', '0.18.2');
7fa7047a
DO
15define ('CHAP_OBJTYPE', 1);
16define ('CHAP_PORTTYPE', 2);
e673ee24 17
ca3d68bd
DO
18$max_dict_key = array
19(
20 '0.17.0' => 988,
21 '0.17.1' => 988,
22 '0.17.2' => 1150,
70992855 23 '0.17.3' => 1150,
681f2138 24 '0.17.4' => 1150,
2803fbe6 25 '0.17.5' => 1322,
63811a09 26 '0.17.6' => 1326,
026a79ee 27 '0.17.7' => 1326,
ad9da675 28 '0.17.8' => 1334,
0e87ece7 29 '0.17.9' => 1334,
4b43f713 30 '0.17.10' => 1349,
4a4a5440
DO
31 '0.17.11' => 1349,
32 '0.18.0' => 1349,
4eeadb79 33 '0.18.1' => 1352,
98cc6bd8 34 '0.18.2' => 1352,
0891c041 35 '0.18.3' => 1356,
ca3d68bd
DO
36);
37
b7b4b225
DO
38define ('TAGNAME_REGEXP', '/^[\p{L}0-9]([. _~-]?[\p{L}0-9])*$/u');
39define ('AUTOTAGNAME_REGEXP', '/^\$[\p{L}0-9]([. _~-]?[\p{L}0-9])*$/u');
05771508 40// The latter matches both SunOS and Linux-styled formats.
b7b4b225
DO
41define ('RE_L2_IFCFG', '/^[0-9a-f]{1,2}(:[0-9a-f]{1,2}){5}$/i');
42define ('RE_L2_CISCO', '/^[0-9a-f]{4}(\.[0-9a-f]{4}){2}$/i');
43define ('RE_L2_SOLID', '/^[0-9a-f]{12}$/i');
44define ('RE_L2_IPCFG', '/^[0-9a-f]{2}(-[0-9a-f]{2}){5}$/i');
45define ('RE_L2_WWN_COLON', '/^[0-9a-f]{1,2}(:[0-9a-f]{1,2}){7}$/i');
46define ('RE_L2_WWN_HYPHEN', '/^[0-9a-f]{2}(-[0-9a-f]{2}){7}$/i');
47define ('RE_L2_WWN_SOLID', '/^[0-9a-f]{16}$/i');
aeaf5779
DO
48define ('RE_IP4_ADDR', '#^[0-9]{1,3}(\.[0-9]{1,3}){3}$#');
49define ('RE_IP4_NET', '#^[0-9]{1,3}(\.[0-9]{1,3}){3}/[0-9]{1,2}$#');
52ce8bd7 50define ('E_8021Q_NOERROR', 0);
d973196a
DO
51define ('E_8021Q_VERSION_CONFLICT', 101);
52define ('E_8021Q_PULL_REMOTE_ERROR', 102);
53define ('E_8021Q_PUSH_REMOTE_ERROR', 103);
5701baec 54define ('E_8021Q_SYNC_DISABLED', 104);
65bff861 55define ('E_BAD_RACKCODE', 1);
e8900a2b 56define ('E_INTERNAL', 2);
39326d1a 57define ('E_DB_WRITE_FAILED', 3);
3a27b9a6
DO
58define ('E_NOT_AUTHENTICATED', 4);
59define ('E_NOT_AUTHORIZED', 5);
561a9321
DO
60define ('E_MISCONFIGURED', 6);
61define ('E_GW_FAILURE', 7);
5f054512 62define ('E_DB_CONSTRAINT', 8);
bc90c415
DO
63define ('VLAN_MIN_ID', 1);
64define ('VLAN_MAX_ID', 4094);
65define ('VLAN_DFL_ID', 1);
26131670 66
3540d15c
DY
67function loadConfigDefaults() {
68 global $configCache;
69 $configCache = loadConfigCache();
d108b098
DO
70 if (!count ($configCache))
71 throw new Exception ('Failed to load configuration from the database.', E_INTERNAL);
3540d15c
DY
72 foreach ($configCache as $varname => &$row) {
73 $row['is_altered'] = 'no';
74 if ($row['vartype'] == 'uint') $row['varvalue'] = 0 + $row['varvalue'];
75 $row['defaultvalue'] = $row['varvalue'];
76 }
77}
78
79function alterConfigWithUserPreferences() {
80 global $configCache;
81 global $userConfigCache;
82 global $remote_username;
83 $userConfigCache = loadUserConfigCache($remote_username);
84 foreach($userConfigCache as $key => $row) {
85 if ($configCache[$key]['is_userdefined'] == 'yes') {
86 $configCache[$key]['varvalue'] = $row['varvalue'];
87 $configCache[$key]['is_altered'] = 'yes';
88 }
89 }
90}
91
92// Returns true if varname has a different value or varname is new
93function isConfigVarChanged($varname, $varvalue) {
94 global $configCache;
95 if (!isset ($configCache))
d108b098 96 throw new Exception ('configuration cache is unavailable', E_INTERNAL);
3540d15c
DY
97 if ($varname == '')
98 throw new InvalidArgException('$varname', $varname, 'Empty variable name');
99 if (!isset ($configCache[$varname])) return true;
100 if ($configCache[$varname]['vartype'] == 'uint')
ed941e67 101 return $configCache[$varname]['varvalue'] !== 0 + $varvalue;
3540d15c 102 else
ed941e67 103 return $configCache[$varname]['varvalue'] !== $varvalue;
3540d15c
DY
104}
105
9c0b0016
DO
106function getConfigVar ($varname = '')
107{
108 global $configCache;
109 // We assume the only point of cache init, and it is init.php. If it
110 // has failed, we don't retry loading.
111 if (!isset ($configCache))
d108b098 112 throw new Exception ('configuration cache is unavailable', E_INTERNAL);
9c0b0016 113 if ($varname == '')
0cc24e9a 114 throw new InvalidArgException('$varname', $varname, 'Empty variable name');
9c0b0016 115 if (isset ($configCache[$varname]))
3540d15c 116 return $configCache[$varname]['varvalue'];
9c0b0016
DO
117 return NULL;
118}
119
c461c579
DO
120// In softfail mode die only on fatal errors, letting the user check
121// and resubmit his input.
122function setConfigVar ($varname = '', $varvalue = '', $softfail = FALSE)
9c0b0016
DO
123{
124 global $configCache;
125 if (!isset ($configCache))
d108b098 126 throw new Exception ('configuration cache is unavailable', E_INTERNAL);
59a83bd8 127 if (!strlen ($varname))
0cc24e9a 128 throw new InvalidArgException('$varname', $varname, 'Empty variable name');
9c0b0016
DO
129 // We don't operate on unknown data.
130 if (!isset ($configCache[$varname]))
0cc24e9a 131 throw new InvalidArgException('$varname', $varname, "Don't know how to handle '${varname}'");
dc2f1801 132 if ($configCache[$varname]['is_hidden'] != 'no')
3540d15c 133 throw new InvalidArgException('$varname', $varname, "'${varname}' is a system variable and cannot be changed by user.");
59a83bd8 134 if (!strlen ($varvalue) && $configCache[$varname]['emptyok'] != 'yes')
3540d15c 135 throw new InvalidArgException('$varname', $varname, "'${varname}' is configured to take non-empty value. Perhaps there was a reason to do so.");
59a83bd8 136 if (strlen ($varvalue) && $configCache[$varname]['vartype'] == 'uint' && (!is_numeric ($varvalue) or $varvalue < 0 ))
3540d15c 137 throw new InvalidArgException('$varname', $varname, "'${varname}' can accept UINT values only");
9c0b0016 138 // Update cache only if the changes went into DB.
3540d15c
DY
139 storeConfigVar ($varname, $varvalue);
140 $configCache[$varname]['varvalue'] = $varvalue;
141}
142
143function setUserConfigVar ($varname = '', $varvalue = '')
144{
145 global $configCache;
146 global $remote_username;
147 if (!isset ($configCache))
d108b098 148 throw new Exception ('configuration cache is unavailable', E_INTERNAL);
3540d15c
DY
149 if (!strlen ($varname))
150 throw new InvalidArgException('$varname', $varname, 'Empty variable name');
151 // We don't operate on unknown data.
152 if (!isset ($configCache[$varname]))
153 throw new InvalidArgException('$varname', $varname, "Don't know how to handle '${varname}'");
154 if ($configCache[$varname]['is_userdefined'] != 'yes')
155 throw new InvalidArgException('$varname', $varname, "'${varname}' cannot be changed by user.");
156 if ($configCache[$varname]['is_hidden'] != 'no')
157 throw new InvalidArgException('$varname', $varname, "'${varname}' is a system variable and cannot be changed by user.");
158 if (!strlen ($varvalue) && $configCache[$varname]['emptyok'] != 'yes')
159 throw new InvalidArgException('$varname', $varname, "'${varname}' is configured to take non-empty value. Perhaps there was a reason to do so.");
160 if (strlen ($varvalue) && $configCache[$varname]['vartype'] == 'uint' && (!is_numeric ($varvalue) or $varvalue < 0 ))
161 throw new InvalidArgException('$varname', $varname, "'${varname}' can accept UINT values only");
162 // Update cache only if the changes went into DB.
163 storeUserConfigVar ($remote_username, $varname, $varvalue);
164 $configCache[$varname]['varvalue'] = $varvalue;
3540d15c
DY
165}
166
167function resetUserConfigVar ($varname = '')
168{
169 global $configCache;
170 global $remote_username;
171 if (!isset ($configCache))
d108b098 172 throw new Exception ('configuration cache is unavailable', E_INTERNAL);
3540d15c
DY
173 if (!strlen ($varname))
174 throw new InvalidArgException('$varname', $varname, 'Empty variable name');
175 // We don't operate on unknown data.
176 if (!isset ($configCache[$varname]))
177 throw new InvalidArgException('$varname', $varname, "Don't know how to handle '${varname}'");
178 if ($configCache[$varname]['is_userdefined'] != 'yes')
179 throw new InvalidArgException('$varname', $varname, "'${varname}' cannot be changed by user.");
180 if ($configCache[$varname]['is_hidden'] != 'no')
181 throw new InvalidArgException('$varname', $varname, "'${varname}' is a system variable and cannot be changed by user.");
182 // Update cache only if the changes went into DB.
183 deleteUserConfigVar ($remote_username, $varname);
9c0b0016 184}
8d07e3e0 185
e673ee24 186?>
|
{
"url": "https://code.racktables.org/racktables/blame/0328f6d667ee450dcc28bd2fa7e04781e1d5ec74:/inc/config.php",
"source_domain": "code.racktables.org",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "63254",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WWPRWZYZAJKG4GG2QNL6LOVL4V4DXM2T",
"WARC-Concurrent-To": "<urn:uuid:4db07627-7e50-454f-af94-f8594e98902f>",
"WARC-Date": "2020-06-04T10:48:33Z",
"WARC-IP-Address": "88.99.189.59",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:B3SPO5SMHONM7RLNPDEZ7FCZ7ARXKV72",
"WARC-Record-ID": "<urn:uuid:b522a339-1c62-4e68-9db1-2489d256cd0d>",
"WARC-Target-URI": "https://code.racktables.org/racktables/blame/0328f6d667ee450dcc28bd2fa7e04781e1d5ec74:/inc/config.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a51c4bee-b3df-48cf-bde9-26c2bbbcd99a>"
},
"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 ([email protected])\r\nhostname: ip-10-67-67-60.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
39,
71,
86,
102,
115,
124,
127,
131,
207,
281,
358,
367,
370,
441,
476,
480,
489,
492,
498,
501,
513,
592,
638,
647,
650,
680,
711,
723,
732,
735,
759,
763,
783,
803,
824,
854,
884,
914,
944,
974,
1004,
1034,
1065,
1074,
1077,
1099,
1120,
1150,
1180,
1210,
1219,
1222,
1227,
1230,
1239,
1242,
1311,
1386,
1456,
1465,
1468,
1535,
1599,
1646,
1709,
1780,
1848,
1899,
1908,
1911,
1972,
2043,
2085,
2094,
2097,
2141,
2186,
2231,
2281,
2322,
2359,
2403,
2412,
2415,
2452,
2486,
2495,
2498,
2531,
2561,
2603,
2612,
2615,
2644,
2676,
2705,
2717,
2726,
2729,
2763,
2787,
2824,
2833,
2836,
2866,
2954,
2963,
2966,
3015,
3045,
3120,
3164,
3169,
3173,
3176,
3222,
3246,
3274,
3302,
3363,
3410,
3466,
3520,
3565,
3570,
3575,
3579,
3582,
3651,
3704,
3728,
3758,
3842,
3851,
3854,
3877,
3956,
4009,
4062,
4136,
4154,
4224,
4233,
4236,
4241,
4245,
4254,
4257,
4298,
4303,
4328,
4401,
4444,
4475,
4560,
4593,
4682,
4731,
4787,
4796,
4799,
4816,
4821,
4825,
4834,
4837,
4909,
4939,
5015,
5024,
5027,
5032,
5057,
5088,
5173,
5210,
5299,
5308,
5311,
5352,
5393,
5500,
5562,
5696,
5780,
5938,
6069,
6179,
6242,
6251,
6254,
6296,
6348,
6353,
6357,
6418,
6423,
6448,
6477,
6508,
6593,
6602,
6605,
6633,
6713,
6754,
6795,
6893,
6952,
7052,
7105,
7230,
7305,
7454,
7576,
7677,
7731,
7795,
7847,
7856,
7859,
7864,
7868,
7915,
7920,
7945,
7974,
8005,
8090,
8099,
8102,
8130,
8210,
8251,
8292,
8390,
8449,
8549,
8602,
8727,
8781,
8835,
8849,
8862
],
"line_end_idx": [
39,
71,
86,
102,
115,
124,
127,
131,
207,
281,
358,
367,
370,
441,
476,
480,
489,
492,
498,
501,
513,
592,
638,
647,
650,
680,
711,
723,
732,
735,
759,
763,
783,
803,
824,
854,
884,
914,
944,
974,
1004,
1034,
1065,
1074,
1077,
1099,
1120,
1150,
1180,
1210,
1219,
1222,
1227,
1230,
1239,
1242,
1311,
1386,
1456,
1465,
1468,
1535,
1599,
1646,
1709,
1780,
1848,
1899,
1908,
1911,
1972,
2043,
2085,
2094,
2097,
2141,
2186,
2231,
2281,
2322,
2359,
2403,
2412,
2415,
2452,
2486,
2495,
2498,
2531,
2561,
2603,
2612,
2615,
2644,
2676,
2705,
2717,
2726,
2729,
2763,
2787,
2824,
2833,
2836,
2866,
2954,
2963,
2966,
3015,
3045,
3120,
3164,
3169,
3173,
3176,
3222,
3246,
3274,
3302,
3363,
3410,
3466,
3520,
3565,
3570,
3575,
3579,
3582,
3651,
3704,
3728,
3758,
3842,
3851,
3854,
3877,
3956,
4009,
4062,
4136,
4154,
4224,
4233,
4236,
4241,
4245,
4254,
4257,
4298,
4303,
4328,
4401,
4444,
4475,
4560,
4593,
4682,
4731,
4787,
4796,
4799,
4816,
4821,
4825,
4834,
4837,
4909,
4939,
5015,
5024,
5027,
5032,
5057,
5088,
5173,
5210,
5299,
5308,
5311,
5352,
5393,
5500,
5562,
5696,
5780,
5938,
6069,
6179,
6242,
6251,
6254,
6296,
6348,
6353,
6357,
6418,
6423,
6448,
6477,
6508,
6593,
6602,
6605,
6633,
6713,
6754,
6795,
6893,
6952,
7052,
7105,
7230,
7305,
7454,
7576,
7677,
7731,
7795,
7847,
7856,
7859,
7864,
7868,
7915,
7920,
7945,
7974,
8005,
8090,
8099,
8102,
8130,
8210,
8251,
8292,
8390,
8449,
8549,
8602,
8727,
8781,
8835,
8849,
8862,
8876
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8876,
"ccnet_original_nlines": 244,
"rps_doc_curly_bracket": 0.01126633957028389,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12370625883340836,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03745688125491142,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5603745579719543,
"rps_doc_frac_unique_words": 0.47421637177467346,
"rps_doc_mean_word_length": 6.266936302185059,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0.0019714098889380693,
"rps_doc_unigram_entropy": 5.545477867126465,
"rps_doc_word_count": 989,
"rps_doc_frac_chars_dupe_10grams": 0.2111971527338028,
"rps_doc_frac_chars_dupe_5grams": 0.32365280389785767,
"rps_doc_frac_chars_dupe_6grams": 0.30945464968681335,
"rps_doc_frac_chars_dupe_7grams": 0.2968699634075165,
"rps_doc_frac_chars_dupe_8grams": 0.2687963843345642,
"rps_doc_frac_chars_dupe_9grams": 0.22910615801811218,
"rps_doc_frac_chars_top_2gram": 0.029687000438570976,
"rps_doc_frac_chars_top_3gram": 0.0932558923959732,
"rps_doc_frac_chars_top_4gram": 0.11245562881231308,
"rps_doc_books_importance": -960.7667236328125,
"rps_doc_books_importance_length_correction": -960.7667236328125,
"rps_doc_openwebtext_importance": -497.3784484863281,
"rps_doc_openwebtext_importance_length_correction": -497.3784484863281,
"rps_doc_wikipedia_importance": -407.026123046875,
"rps_doc_wikipedia_importance_length_correction": -407.026123046875
},
"fasttext": {
"dclm": 0.2391306757926941,
"english": 0.33729591965675354,
"fineweb_edu_approx": 1.7154316902160645,
"eai_general_math": 0.32654863595962524,
"eai_open_web_math": 0.01851499080657959,
"eai_web_code": 0.49001920223236084
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,096,798,869,302,812,000 |
[MUD-Dev] META: Web site backgrounds and readability
Caliban Tiresias Darklock caliban at darklock.com
Wed Apr 15 21:10:47 New Zealand Standard Time 1998
On 10:18 AM 4/15/98 +0000, I personally witnessed Jon A. Lambert jumping up
to say:
>
>But then you'll be hard coding for the lowest common denominator 640x480,
>leaving a great deal of blank space on the right for anyone who exceeds
>that resolution.
I've found that the best compromise appears to be a centered 600 pixel
width table which contains the entire page. Since it's centered, you have
the appearance of margins rather than 'lots of blank space', and it's more
than adequate for text-based informational pages. Since you've coded
specific dimensions, it works well.
Another thought for the right hand side of the table (omitting brokets so
people using HTML mail won't look at nothing at all and go 'Huh?')...
TABLE WIDTH=100%
TR
TD
...Put your content in here...
/TD
TD WIDTH=100
...Put your navbar in here...
/TD
/TR
/TABLE
Given a situation like this, everything works out pretty well. And I'm
immediately thinking "hey, I could write a CGI script that did this
automatically with the path info". That would also give you a pretty decent
way to do two versions; you could have a base script that had the table,
and one without. You sort of lose the title thing, though, unless you do
something complicated with it. Background images get a little complex like
this...
More information about the MUD-Dev mailing list
|
{
"url": "http://disinterest.org/resource/MUD-Dev/1998q2/005583.html",
"source_domain": "disinterest.org",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "4656",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D4RZT4IDFJVM3UUSLZVZX6VRZ56ASN6D",
"WARC-Concurrent-To": "<urn:uuid:8d81699f-0855-4abb-8b43-373299756b76>",
"WARC-Date": "2017-09-24T03:17:40Z",
"WARC-IP-Address": "74.220.215.229",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TQLKMMAA7CDWWABSVXWS6QA6FRD6E4XH",
"WARC-Record-ID": "<urn:uuid:9eb797a1-f172-430c-8fd5-713068af2bf3>",
"WARC-Target-URI": "http://disinterest.org/resource/MUD-Dev/1998q2/005583.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2c9b32c5-7a97-4f20-aba8-2685c1725dae>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-97-134-90.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,
53,
54,
104,
155,
156,
157,
233,
241,
243,
319,
392,
412,
413,
484,
558,
633,
702,
738,
739,
813,
883,
884,
901,
904,
907,
938,
942,
955,
985,
989,
993,
1000,
1001,
1072,
1140,
1216,
1289,
1362,
1437,
1445,
1446,
1447,
1448,
1449
],
"line_end_idx": [
53,
54,
104,
155,
156,
157,
233,
241,
243,
319,
392,
412,
413,
484,
558,
633,
702,
738,
739,
813,
883,
884,
901,
904,
907,
938,
942,
955,
985,
989,
993,
1000,
1001,
1072,
1140,
1216,
1289,
1362,
1437,
1445,
1446,
1447,
1448,
1449,
1496
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1496,
"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.353658527135849,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06402438879013062,
"rps_doc_frac_lines_end_with_ellipsis": 0.08888889104127884,
"rps_doc_frac_no_alph_words": 0.23170731961727142,
"rps_doc_frac_unique_words": 0.6854838728904724,
"rps_doc_mean_word_length": 4.657258033752441,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.018292680382728577,
"rps_doc_unigram_entropy": 4.931054592132568,
"rps_doc_word_count": 248,
"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.010389610193669796,
"rps_doc_frac_chars_top_3gram": 0.020779220387339592,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -140.03341674804688,
"rps_doc_books_importance_length_correction": -131.4166717529297,
"rps_doc_openwebtext_importance": -60.56775665283203,
"rps_doc_openwebtext_importance_length_correction": -60.56775665283203,
"rps_doc_wikipedia_importance": -23.95896339416504,
"rps_doc_wikipedia_importance_length_correction": -12.305023193359375
},
"fasttext": {
"dclm": 0.08617585897445679,
"english": 0.9131780862808228,
"fineweb_edu_approx": 1.0558006763458252,
"eai_general_math": 0.30603456497192383,
"eai_open_web_math": 0.42596811056137085,
"eai_web_code": 0.09522902965545654
}
}
|
{
"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.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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,106,074,373,487,724,000 |
MRPT 1.9.9
CPosePDFGaussianInf.h
Go to the documentation of this file.
1 /* +------------------------------------------------------------------------+
2 | Mobile Robot Programming Toolkit (MRPT) |
3 | https://www.mrpt.org/ |
4 | |
5 | Copyright (c) 2005-2019, Individual contributors, see AUTHORS file |
6 | See: https://www.mrpt.org/Authors - All rights reserved. |
7 | Released under BSD License. See: https://www.mrpt.org/License |
8 +------------------------------------------------------------------------+ */
9 #pragma once
10
11 #include <mrpt/math/CMatrixFixed.h>
12 #include <mrpt/poses/CPosePDF.h>
13
14 namespace mrpt::poses
15 {
16 class CPose3DPDF;
17
18 // This must be added to any CSerializable derived class:
19
20 /** A Probability Density function (PDF) of a 2D pose \f$ p(\mathbf{x}) = [x ~
21 * y ~ \phi ]^t \f$ as a Gaussian with a mean and the inverse of the covariance.
22 *
23 * This class implements a PDF as a mono-modal Gaussian distribution in its
24 * <b>information form</b>, that is,
25 * keeping the inverse of the covariance matrix instead of the covariance
26 * matrix itself.
27 *
28 * This class is the dual of CPosePDFGaussian.
29 *
30 * \sa CPose2D, CPosePDF, CPosePDFParticles
31 * \ingroup poses_pdf_grp
32 */
34 {
35 // This must be added to any CSerializable derived class:
39
40 protected:
41 /** Assures the symmetry of the covariance matrix (eventually certain
42 * operations in the math-coprocessor lead to non-symmetric matrixes!)
43 */
44 void enforceCovSymmetry();
45
46 public:
47 /** @name Data fields
48 @{ */
49
50 /** The mean value */
52 /** The inverse of the 3x3 covariance matrix (the "information" matrix) */
54
55 /** @} */
56
57 inline const CPose2D& getPoseMean() const { return mean; }
58 inline CPose2D& getPoseMean() { return mean; }
59 /** Default constructor (mean=all zeros, inverse covariance=all zeros -> so
60 * be careful!) */
62
63 /** Constructor with a mean value (inverse covariance=all zeros -> so be
64 * careful!) */
65 explicit CPosePDFGaussianInf(const CPose2D& init_Mean);
66
67 /** Constructor */
69 const CPose2D& init_Mean,
70 const mrpt::math::CMatrixDouble33& init_CovInv);
71
72 /** Copy constructor, including transformations between other PDFs */
73 explicit CPosePDFGaussianInf(const CPosePDF& o) { copyFrom(o); }
74 /** Copy constructor, including transformations between other PDFs */
75 explicit CPosePDFGaussianInf(const CPose3DPDF& o) { copyFrom(o); }
76 /** Returns an estimate of the pose, (the mean, or mathematical expectation
77 * of the PDF).
78 * \sa getCovariance */
79 void getMean(CPose2D& mean_pose) const override { mean_pose = mean; }
80 bool isInfType() const override { return true; }
81
82 std::tuple<cov_mat_t, type_value> getCovarianceAndMean() const override
83 {
84 return {cov_inv.inverse_LLt(), mean};
85 }
86
87 /** Returns the information (inverse covariance) matrix (a STATE_LEN x
88 * STATE_LEN matrix) \sa getMean, getCovarianceAndMean */
90 {
91 inf = cov_inv;
92 }
93
94 /** Copy operator, translating if necesary (for example, between particles
95 * and gaussian representations) */
96 void copyFrom(const CPosePDF& o) override;
97
98 /** Copy operator, translating if necesary (for example, between particles
99 * and gaussian representations) */
100 void copyFrom(const CPose3DPDF& o);
101
102 /** Save PDF's particles to a text file, containing the 2D pose in the first
103 * line, then the covariance matrix in next 3 lines. */
104 bool saveToTextFile(const std::string& file) const override;
105
106 /** this = p (+) this. This can be used to convert a PDF from local
107 * coordinates to global, providing the point (newReferenceBase) from which
108 * "to project" the current pdf. Result PDF substituted the currently
109 * stored one in the object */
110 void changeCoordinatesReference(const CPose3D& newReferenceBase) override;
111
112 /** this = p (+) this. This can be used to convert a PDF from local
113 * coordinates to global, providing the point (newReferenceBase) from which
114 * "to project" the current pdf. Result PDF substituted the currently
115 * stored one in the object. */
116 void changeCoordinatesReference(const CPose2D& newReferenceBase);
117
118 /** Rotate the covariance matrix by replacing it by \f$
119 * \mathbf{R}~\mathbf{COV}~\mathbf{R}^t \f$, where \f$ \mathbf{R} = \left[
120 * \begin{array}{ccc} \cos\alpha & -\sin\alpha & 0 \\ \sin\alpha &
121 * \cos\alpha & 0 \\ 0 & 0 & 1 \end{array}\right] \f$. */
122 void rotateCov(const double ang);
123
124 /** Set \f$ this = x1 \ominus x0 \f$ , computing the mean using the "-"
125 * operator and the covariances through the corresponding Jacobians (For
126 * 'x0' and 'x1' being independent variables!). */
127 void inverseComposition(
128 const CPosePDFGaussianInf& x, const CPosePDFGaussianInf& ref);
129
130 /** Set \f$ this = x1 \ominus x0 \f$ , computing the mean using the "-"
131 * operator and the covariances through the corresponding Jacobians (Given
132 * the 3x3 cross-covariance matrix of variables x0 and x1). */
133 void inverseComposition(
134 const CPosePDFGaussianInf& x1, const CPosePDFGaussianInf& x0,
135 const mrpt::math::CMatrixDouble33& COV_01);
136
137 /** Draws a single sample from the distribution */
138 void drawSingleSample(CPose2D& outPart) const override;
139
140 /** Draws a number of samples from the distribution, and saves as a list of
141 * 1x3 vectors, where each row contains a (x,y,phi) datum. */
142 void drawManySamples(
143 size_t N,
144 std::vector<mrpt::math::CVectorDouble>& outSamples) const override;
145
146 /** Bayesian fusion of two points gauss. distributions, then save the result
147 *in this object.
148 * The process is as follows:<br>
149 * - (x1,S1): Mean and variance of the p1 distribution.
150 * - (x2,S2): Mean and variance of the p2 distribution.
151 * - (x,S): Mean and variance of the resulting distribution.
152 *
153 * S = (S1<sup>-1</sup> + S2<sup>-1</sup>)<sup>-1</sup>;
154 * x = S * ( S1<sup>-1</sup>*x1 + S2<sup>-1</sup>*x2 );
155 */
156 void bayesianFusion(
157 const CPosePDF& p1, const CPosePDF& p2,
158 const double minMahalanobisDistToDrop = 0) override;
159
160 /** Returns a new PDF such as: NEW_PDF = (0,0,0) - THIS_PDF */
161 void inverse(CPosePDF& o) const override;
162
163 /** Makes: thisPDF = thisPDF + Ap, where "+" is pose composition (both the
164 * mean, and the covariance matrix are updated). */
165 void operator+=(const CPose2D& Ap);
166
167 /** Evaluates the PDF at a given point */
168 double evaluatePDF(const CPose2D& x) const;
169
170 /** Evaluates the ratio PDF(x) / PDF(MEAN), that is, the normalized PDF in
171 * the range [0,1]. */
172 double evaluateNormalizedPDF(const CPose2D& x) const;
173
174 /** Computes the Mahalanobis distance between the centers of two Gaussians.
175 */
176 double mahalanobisDistanceTo(const CPosePDFGaussianInf& theOther);
177
178 /** Makes: thisPDF = thisPDF + Ap, where "+" is pose composition (both the
179 * mean, and the covariance matrix are updated) (see formulas in
180 * jacobiansPoseComposition ). */
181 void operator+=(const CPosePDFGaussianInf& Ap);
182
183 /** Makes: thisPDF = thisPDF - Ap, where "-" is pose inverse composition
184 * (both the mean, and the covariance matrix are updated) */
185 inline void operator-=(const CPosePDFGaussianInf& ref)
186 {
187 this->inverseComposition(*this, ref);
188 }
189
190 }; // End of class def.
191
192 bool operator==(const CPosePDFGaussianInf& p1, const CPosePDFGaussianInf& p2);
193 /** Pose compose operator: RES = A (+) B , computing both the mean and the
194 * covariance */
195 CPosePDFGaussianInf operator+(
196 const CPosePDFGaussianInf& a, const CPosePDFGaussianInf& b);
197 /** Pose inverse compose operator: RES = A (-) B , computing both the mean and
198 * the covariance */
199 CPosePDFGaussianInf operator-(
200 const CPosePDFGaussianInf& a, const CPosePDFGaussianInf& b);
201 /** Returns the Gaussian distribution of \f$ \mathbf{C} \f$, for \f$ \mathbf{C}
202 * = \mathbf{A} \oplus \mathbf{B} \f$. */
205
206 /** Dumps the mean and covariance matrix to a text stream. */
207 std::ostream& operator<<(std::ostream& out, const CPosePDFGaussianInf& obj);
208
209 } // namespace mrpt::poses
void bayesianFusion(const CPosePDF &p1, const CPosePDF &p2, const double minMahalanobisDistToDrop=0) override
Bayesian fusion of two points gauss.
void operator+=(const CPose2D &Ap)
Makes: thisPDF = thisPDF + Ap, where "+" is pose composition (both the mean, and the covariance matri...
CPosePDFGaussianInf(const CPose3DPDF &o)
Copy constructor, including transformations between other PDFs.
mrpt::math::TPoint2D operator+(const CPose2D &pose, const mrpt::math::TPoint2D &pnt)
Compose a 2D point from a new coordinate base given by a 2D pose.
Definition: CPose2D.cpp:394
std::ostream & operator<<(std::ostream &o, const CPoint2D &p)
Dumps a point as a string (x,y)
Definition: CPoint2D.cpp:102
bool saveToTextFile(const std::string &file) const override
Save PDF's particles to a text file, containing the 2D pose in the first line, then the covariance ma...
void enforceCovSymmetry()
Assures the symmetry of the covariance matrix (eventually certain operations in the math-coprocessor ...
void drawManySamples(size_t N, std::vector< mrpt::math::CVectorDouble > &outSamples) const override
Draws a number of samples from the distribution, and saves as a list of 1x3 vectors, where each row contains a (x,y,phi) datum.
#define DEFINE_SCHEMA_SERIALIZABLE()
This declaration must be inserted in all CSerializable classes definition, within the class declarati...
std::tuple< cov_mat_t, type_value > getCovarianceAndMean() const override
Returns an estimate of the pose covariance matrix (STATE_LENxSTATE_LEN cov matrix) and the mean...
void operator-=(const CPosePDFGaussianInf &ref)
Makes: thisPDF = thisPDF - Ap, where "-" is pose inverse composition (both the mean, and the covariance matrix are updated)
CMatrixFixed< double, 3, 3 > CMatrixDouble33
Definition: CMatrixFixed.h:367
double evaluateNormalizedPDF(const CPose2D &x) const
Evaluates the ratio PDF(x) / PDF(MEAN), that is, the normalized PDF in the range [0,1].
void copyFrom(const CPosePDF &o) override
Copy operator, translating if necesary (for example, between particles and gaussian representations) ...
void inverse(CPosePDF &o) const override
Returns a new PDF such as: NEW_PDF = (0,0,0) - THIS_PDF.
CPosePDFGaussianInf(const CPosePDF &o)
Copy constructor, including transformations between other PDFs.
double evaluatePDF(const CPose2D &x) const
Evaluates the PDF at a given point.
const CPose2D & getPoseMean() const
CPose2D operator-(const CPose2D &p)
Unary - operator: return the inverse pose "-p" (Note that is NOT the same than a pose with negative x...
Definition: CPose2D.cpp:356
Derived inverse_LLt() const
Returns the inverse of a symmetric matrix using LLt.
Declares a class that represents a probability density function (pdf) of a 2D pose (x...
Definition: CPosePDF.h:38
Classes for 2D/3D geometry representation, both of single values and probability density distribution...
void getInformationMatrix(mrpt::math::CMatrixDouble33 &inf) const override
Returns the information (inverse covariance) matrix (a STATE_LEN x STATE_LEN matrix) ...
void rotateCov(const double ang)
Rotate the covariance matrix by replacing it by , where .
CPosePDFGaussianInf()
Default constructor (mean=all zeros, inverse covariance=all zeros -> so be careful!) ...
This is the global namespace for all Mobile Robot Programming Toolkit (MRPT) libraries.
A Probability Density function (PDF) of a 2D pose as a Gaussian with a mean and the inverse of the c...
bool operator==(const CPoint< DERIVEDCLASS, DIM > &p1, const CPoint< DERIVEDCLASS, DIM > &p2)
Definition: CPoint.h:119
A class used to store a 2D pose, including the 2D coordinate point and a heading (phi) angle...
Definition: CPose2D.h:39
A class used to store a 3D pose (a 3D translation + a rotation in 3D).
Definition: CPose3D.h:85
mrpt::vision::TStereoCalibResults out
void drawSingleSample(CPose2D &outPart) const override
Draws a single sample from the distribution.
#define DEFINE_SERIALIZABLE(class_name, NS)
This declaration must be inserted in all CSerializable classes definition, within the class declarati...
void inverseComposition(const CPosePDFGaussianInf &x, const CPosePDFGaussianInf &ref)
Set , computing the mean using the "-" operator and the covariances through the corresponding Jacobi...
bool isInfType() const override
Returns whether the class instance holds the uncertainty in covariance or information form...
Declares a class that represents a Probability Density Function (PDF) of a 3D pose (6D actually)...
Definition: CPose3DPDF.h:39
void changeCoordinatesReference(const CPose3D &newReferenceBase) override
this = p (+) this.
mrpt::math::CMatrixDouble33 cov_inv
The inverse of the 3x3 covariance matrix (the "information" matrix)
void getMean(CPose2D &mean_pose) const override
Returns an estimate of the pose, (the mean, or mathematical expectation of the PDF).
double mahalanobisDistanceTo(const CPosePDFGaussianInf &theOther)
Computes the Mahalanobis distance between the centers of two Gaussians.
Page generated by Doxygen 1.8.14 for MRPT 1.9.9 Git: 24b95e159 Thu Jan 23 01:15:46 2020 +0100 at jue ene 23 01:30:10 CET 2020
|
{
"url": "https://docs.mrpt.org/reference/devel/_c_pose_p_d_f_gaussian_inf_8h_source.html",
"source_domain": "docs.mrpt.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "71195",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RZBO6SKRNWUDWDU2KU4UQBZEOIPEBGQ2",
"WARC-Concurrent-To": "<urn:uuid:cdc4daf4-60f1-4bce-80d0-28ba17a7aa03>",
"WARC-Date": "2020-01-28T08:07:31Z",
"WARC-IP-Address": "150.214.150.101",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:MVP2MPKQTJ2YRV3TBLWZ43OYLO63UH32",
"WARC-Record-ID": "<urn:uuid:1874043b-746f-41d1-b573-4ea260df4c17>",
"WARC-Target-URI": "https://docs.mrpt.org/reference/devel/_c_pose_p_d_f_gaussian_inf_8h_source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d553eed5-cde9-4519-bee7-f32296fb2594>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
34,
72,
152,
199,
228,
235,
309,
373,
442,
523,
538,
542,
581,
617,
621,
646,
651,
672,
676,
737,
741,
823,
907,
913,
992,
1032,
1109,
1130,
1136,
1186,
1192,
1239,
1268,
1275,
1280,
1342,
1346,
1361,
1435,
1509,
1516,
1547,
1551,
1563,
1589,
1599,
1603,
1629,
1708,
1712,
1726,
1730,
1793,
1844,
1924,
1946,
1950,
2027,
2046,
2106,
2110,
2133,
2163,
2216,
2220,
2294,
2363,
2437,
2508,
2588,
2607,
2634,
2708,
2761,
2765,
2841,
2847,
2889,
2895,
2899,
2974,
3035,
3041,
3060,
3066,
3070,
3149,
3188,
3235,
3239,
3318,
3357,
3398,
3403,
3485,
3545,
3611,
3616,
3689,
3769,
3843,
3878,
3958,
3963,
4036,
4116,
4190,
4226,
4297,
4302,
4363,
4442,
4513,
4575,
4614,
4619,
4696,
4773,
4828,
4858,
4926,
4931,
5008,
5087,
5154,
5184,
5251,
5300,
5305,
5361,
5422,
5427,
5508,
5574,
5601,
5616,
5689,
5694,
5776,
5798,
5836,
5896,
5956,
6021,
6028,
6089,
6149,
6157,
6183,
6228,
6286,
6291,
6359,
6406,
6411,
6491,
6547,
6588,
6593,
6640,
6689,
6694,
6774,
6801,
6860,
6865,
6946,
6954,
7026,
7031,
7111,
7180,
7218,
7271,
7276,
7354,
7419,
7479,
7486,
7529,
7536,
7541,
7569,
7574,
7657,
7736,
7757,
7792,
7858,
7941,
7966,
8001,
8067,
8151,
8197,
8202,
8268,
8349,
8354,
8385,
8495,
8532,
8567,
8672,
8713,
8777,
8862,
8928,
8956,
9018,
9050,
9079,
9139,
9248,
9274,
9379,
9479,
9607,
9644,
9749,
9823,
9922,
9970,
10094,
10139,
10170,
10223,
10311,
10353,
10458,
10499,
10556,
10595,
10659,
10702,
10738,
10774,
10810,
10915,
10943,
10971,
11024,
11113,
11139,
11244,
11319,
11408,
11441,
11499,
11521,
11610,
11698,
11802,
11896,
11921,
12017,
12042,
12113,
12138,
12176,
12231,
12276,
12320,
12425,
12511,
12615,
12647,
12741,
12841,
12869,
12943,
12962,
12998,
13066,
13114,
13199,
13265,
13337,
13338,
13339,
13340
],
"line_end_idx": [
12,
34,
72,
152,
199,
228,
235,
309,
373,
442,
523,
538,
542,
581,
617,
621,
646,
651,
672,
676,
737,
741,
823,
907,
913,
992,
1032,
1109,
1130,
1136,
1186,
1192,
1239,
1268,
1275,
1280,
1342,
1346,
1361,
1435,
1509,
1516,
1547,
1551,
1563,
1589,
1599,
1603,
1629,
1708,
1712,
1726,
1730,
1793,
1844,
1924,
1946,
1950,
2027,
2046,
2106,
2110,
2133,
2163,
2216,
2220,
2294,
2363,
2437,
2508,
2588,
2607,
2634,
2708,
2761,
2765,
2841,
2847,
2889,
2895,
2899,
2974,
3035,
3041,
3060,
3066,
3070,
3149,
3188,
3235,
3239,
3318,
3357,
3398,
3403,
3485,
3545,
3611,
3616,
3689,
3769,
3843,
3878,
3958,
3963,
4036,
4116,
4190,
4226,
4297,
4302,
4363,
4442,
4513,
4575,
4614,
4619,
4696,
4773,
4828,
4858,
4926,
4931,
5008,
5087,
5154,
5184,
5251,
5300,
5305,
5361,
5422,
5427,
5508,
5574,
5601,
5616,
5689,
5694,
5776,
5798,
5836,
5896,
5956,
6021,
6028,
6089,
6149,
6157,
6183,
6228,
6286,
6291,
6359,
6406,
6411,
6491,
6547,
6588,
6593,
6640,
6689,
6694,
6774,
6801,
6860,
6865,
6946,
6954,
7026,
7031,
7111,
7180,
7218,
7271,
7276,
7354,
7419,
7479,
7486,
7529,
7536,
7541,
7569,
7574,
7657,
7736,
7757,
7792,
7858,
7941,
7966,
8001,
8067,
8151,
8197,
8202,
8268,
8349,
8354,
8385,
8495,
8532,
8567,
8672,
8713,
8777,
8862,
8928,
8956,
9018,
9050,
9079,
9139,
9248,
9274,
9379,
9479,
9607,
9644,
9749,
9823,
9922,
9970,
10094,
10139,
10170,
10223,
10311,
10353,
10458,
10499,
10556,
10595,
10659,
10702,
10738,
10774,
10810,
10915,
10943,
10971,
11024,
11113,
11139,
11244,
11319,
11408,
11441,
11499,
11521,
11610,
11698,
11802,
11896,
11921,
12017,
12042,
12113,
12138,
12176,
12231,
12276,
12320,
12425,
12511,
12615,
12647,
12741,
12841,
12869,
12943,
12962,
12998,
13066,
13114,
13199,
13265,
13337,
13338,
13339,
13340,
13465
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13465,
"ccnet_original_nlines": 282,
"rps_doc_curly_bracket": 0.0037133300211280584,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.197133868932724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03250611945986748,
"rps_doc_frac_lines_end_with_ellipsis": 0.060070671141147614,
"rps_doc_frac_no_alph_words": 0.4197832942008972,
"rps_doc_frac_unique_words": 0.3535589277744293,
"rps_doc_mean_word_length": 5.75437593460083,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0.008039150387048721,
"rps_doc_unigram_entropy": 5.633746147155762,
"rps_doc_word_count": 1714,
"rps_doc_frac_chars_dupe_10grams": 0.15735577046871185,
"rps_doc_frac_chars_dupe_5grams": 0.4784548282623291,
"rps_doc_frac_chars_dupe_6grams": 0.37828245759010315,
"rps_doc_frac_chars_dupe_7grams": 0.34847408533096313,
"rps_doc_frac_chars_dupe_8grams": 0.3099462687969208,
"rps_doc_frac_chars_dupe_9grams": 0.26209065318107605,
"rps_doc_frac_chars_top_2gram": 0.008111120201647282,
"rps_doc_frac_chars_top_3gram": 0.019263919442892075,
"rps_doc_frac_chars_top_4gram": 0.0076041799038648605,
"rps_doc_books_importance": -1437.412841796875,
"rps_doc_books_importance_length_correction": -1437.412841796875,
"rps_doc_openwebtext_importance": -822.8204956054688,
"rps_doc_openwebtext_importance_length_correction": -822.8204956054688,
"rps_doc_wikipedia_importance": -466.0136413574219,
"rps_doc_wikipedia_importance_length_correction": -466.0136413574219
},
"fasttext": {
"dclm": 0.6572000980377197,
"english": 0.44307929277420044,
"fineweb_edu_approx": 2.654926300048828,
"eai_general_math": 0.9915793538093567,
"eai_open_web_math": 0.8316659331321716,
"eai_web_code": 0.9647964835166931
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,105,946,897,325,786,000 |
彻底讲明白Java中眼花缭乱的各种并发锁
原创
2022/11/14 20:47
阅读数 1.5K
在互联网公司面试中，很多小伙伴都被问到过关于锁的问题。 今天，我给大家一次性把Java并发锁的全家桶彻底讲明白。包括互斥锁、读写锁、重入锁、公平锁、悲观锁、自旋锁、偏向锁等等等等。视频有点长，大家一定要全部看完，保证你会醍醐灌顶。
1、锁的由来
在并发编程中，经常会遇到两个以上的线程访问同一个共享变量，当同时对共享变量进行读写操作时，就会产生数据不一致的情况。
在这里插入图片描述
随着线程并发技术的发展，在多线程环境中，对线程访问资源的限制也越来越多。为了保证资源获取的有序性和占用性，都是通过并发锁来控制的。
2、锁的应用场景
下面，我根据个人经验以及并发场景下线程的处理逻辑，总结为以下7个场景，不同场景使用不同的锁。
1）某个线程是否锁住同步资源的情况
如果要锁住同步资源则使用悲观锁，不锁住同步资源使用乐观锁。 所谓悲观锁，就是每次拿数据的时候都认为会有别人修改，所以在读数据的时候都会上锁，其他线程数据就会阻塞，直到拿到锁。
在这里插入图片描述
举个例子，假设厕所只有一个坑位，悲观锁就是上厕所会第一时间把门反锁上，这样其他人上厕所只能在门外等候，这就是阻塞。
在这里插入图片描述
而乐观锁就是开着门，当然在这个场景下一般也不会这么做。所以，乐观锁，就是每次拿数据的时候都假设为别人不会修改，所以不会上锁；只是在更新数据的时候去判断之前有没有别的线程更新了这个数据。如果这个数据没有被更新，当前线程将自己修改的数据成功写入。如果数据已经被其他线程更新了，要么报错，要么自动重试。
在这里插入图片描述
乐观锁与悲观锁是一种广义上的概念，没有谁优谁劣。乐观锁适用于写少读多的场景，因为不用上锁、释放锁，省去了锁的开销，从而提升了吞吐量。 而悲观锁适用于写多读少的场景，因为线程间竞争激励，如果使用乐观锁会导致线程不断进行重试，这样反而还降低了性能。
2）多个线程是否共享一把锁的情况
如果在并发情况下，多个线程共享一把锁就是使用共享锁，如果不能共享一把锁就是排它锁或者叫独占锁、独享锁。 共享锁是指锁可被多个线程所持有。如果一个线程对数据加上共享锁后，那么其他线程只能对数据再加共享锁，不能加独占锁。获得共享锁的线程只能读数据，不能修改数据。
在这里插入图片描述
在 JDK 中 ReentrantReadWriteLock 就是一种共享锁。 而独占锁是指锁一次只能被一个线程所持有。如果一个线程对数据加上排他锁后，那么其他线程不能再对该数据加任何类型的锁。获得独占锁的线程即能读数据又能修改数据。
在这里插入图片描述
JDK中的synchronized和J.U.C(java.util.concurrent)包中Lock的实现类都是独占锁。 另外，互斥锁是独占锁的一种常规实现，是指某一资源同时只允许一个访问者对其进行访问，具有唯一性和排它性。
在这里插入图片描述
互斥锁一次只能一个线程拥有互斥锁，其他线程只有等待。 而读写锁是共享锁的一种具体实现。读写锁管理一组锁，一个是只读的锁，一个是写锁。 读锁可以在没有写锁的时候被多个线程同时持有，而写锁是独占的。写锁的优先级要高于读锁，一个获得了读锁的线程必须能看到前一个释放的写锁所更新的内容。 读写锁相比于互斥锁并发程度更高，每次只有一个写线程，但是同时可以有多个线程并发读。
在这里插入图片描述
在 JDK 中定义了一个读写锁的接口ReadWriteLock，如源码所示：
public interface ReadWriteLock {
/* 获取读锁 */
Lock readLock();
/* 获取写锁 */
Lock writeLock();
}
ReentrantReadWriteLock 实现了ReadWriteLock接口，ReentrantReadWriteLock 支持锁降级不支持锁升级，可以由写锁降为读锁。
3）多个线程竞争时是否要排队的情况
多个线程竞争排队获取锁的情况，使用公平锁，如果，使用非公平锁。 所谓公平锁是指多个线程按照申请锁的顺序来获取锁，这里类似排队买票，先来的人先买，后来的人在队尾排着，这是公平的。
在 Java 中可以通过构造函数初始化公平锁，如代码所示：
/**
* 创建一个可重入锁，
* true 表示公平锁，
* false 表示非公平锁。
* 默认非公平锁
*/
Lock lock = new ReentrantLock(true);
非公平锁是指多个线程获取锁的顺序并不是按照申请锁的顺序，有可能后申请的线程比先申请的线程优先获取锁，在高并发环境下，有可能造成优先级翻转，或者某个线程一直得不到锁的饥饿状态。
在这里插入图片描述
在 Java 中 synchronized 关键字是非公平锁，ReentrantLock默认也是非公平锁，如代码所示：
/*** 创建一个可重入锁，true 表示公平锁，false 表示非公平锁。默认非公平锁*/
Lock lock = new ReentrantLock(false);
4）一个线程中的多个流程，是否获取同一把锁的情况
如果一个线程中的多个流程能获取同一把锁，就使用可重入锁，如果线程的多个流程不能获取通一把锁，就是用不可重入锁。 可重入锁又称为递归锁，是指同一个线程在外层方法获取了锁，在进入内层方法会自动获取锁。
对于Java ReentrantLock而言, 他的名字就可以看出是一个可重入锁。对于synchronized而言，也是一个可重入锁。可重入锁的一个好处是可一定程度避免死锁。以 synchronized 为例，来看这样一段代码：
public synchronized void mehtodA() throws Exception{
// Do some magic tings
mehtodB();
}
public synchronized void mehtodB() throws Exception{
// Do some magic tings
}
在这段代码中 methodA() 调用 methodB()，如果一个线程调用methodA() 已经获取了锁再去调用 methodB() 就不需要再次获取锁了，这就是可重入锁的特性。如果是不可重入锁的话，mehtodB() 可能不会被当前线程执行，可能造成死锁。
5）某个线程锁住同步资源失败，是否不阻塞的情况
如果某个线程锁住同步资源失败，但是希望这个线程不阻塞，就可以使用自旋锁或者自适应自旋锁。 自旋锁是指线程在没有获得锁时不是被直接挂起，而是执行一个忙循环，这个忙循环就是所谓的自旋。
在这里插入图片描述
自旋锁的目的是为了减少线程被挂起的几率，因为线程的挂起和唤醒也都是耗资源的操作。 如果锁被另一个线程占用的时间比较长，即使自旋了之后当前线程还是会被挂起，忙循环就会变成浪费系统资源的操作，反而降低了整体性能。因此自旋锁是不适应锁占用时间长的并发情况的。 在 Java 中，AtomicInteger 类就有自旋的操作，来看这样一段代码：
public final int getAndAddInt(Object o, long offset, int delta) {
int v;
do {
v = getIntVolatile(o, offset);
} while (!compareAndSwapInt(o, offset, v, v + delta));
return v;
}
循环条件调用compareAndSwapInt()方法，被称为CAS操作，如果失败就会一直循环获取当前 value 值然后重试，这个过程叫自旋。 在JDK1.6引入了自适应自旋，这个就比较智能了，自旋时间不再固定，由前一次在同一个锁上的自旋时间以及锁的拥有者的状态来决定。如果虚拟机认为这次自旋也很有可能再次成功那就会次序较多的时间，如果自旋很少成功，那以后可能就直接省略掉自旋过程，避免浪费处理器资源。
6）线程竞争同步资源时，细节流程是否发生变化的情况
JDK1.6 为了提升性能减少获得锁和释放锁所带来的消耗，引入了4种锁的状态：无锁、偏向锁、轻量级锁和重量级锁，它会随着多线程的竞争情况逐渐升级，但不能降级。
在这里插入图片描述
如果多个线程中，只有一个线程能修改资源成功，其他资源只是重试，不锁住资源，称为无锁状态，其实就是乐观锁。 第一个线程访问加锁的资源自动获取锁，不存在多线程竞争的情况，资源偏向于第一个访问锁的线程，每次访问线程不需要重复获取锁，这种状态称为偏向锁。偏向锁的实现是通过控制对象Mark Word的标志位来实现的，如果当前是可偏向状态，需要进一步判断对象头存储的线程 ID 是否与当前线程 ID 一致，如果一致直接进入。 当线程竞争变得比较激烈时，偏向锁就会升级为轻量级锁，轻量级锁认为虽然竞争是存在的，但是理想情况下竞争的程度很低，通过自旋方式等待上一个线程释放锁。 但如果线程并发进一步加剧，线程的自旋超过了一定次数，或者一个线程持有锁，一个线程在自旋，又来了第三个线程访问的时候，轻量级锁就会膨胀为重量级锁，重量级锁会使除了当时拥有锁的线程以外的所有线程都阻塞。 升级到重量级锁其实就是互斥锁了，一个线程拿到锁，其余线程都会处于阻塞等待状态。 在 Java 中，synchronized 关键字内部实现原理就是这样一个锁升级的过程。
7）最后，就是锁再设计和锁优化的一些情况
先来看分段锁，它是一种锁的再次设计，并不是具体的一种锁。 分段锁设计目的是将锁的粒度进一步细化，当操作不需要更新整个数组的时候，就仅仅针对数组中的一项进行加锁操作。
在这里插入图片描述
在 Java 语言中 CurrentHashMap 底层使用分段锁Segment，来支持多线程并发操作。 另外，就是锁优化，包括锁消除、锁粗化。 锁粗化就是将多个同步块的数量减少，并将单个同步块的作用范围扩大，本质上就是将多次上锁、解锁的请求合并为一次同步请求。 举个例子，一个循环体中有一个代码同步块，每次循环都会执行加锁解锁操作。如代码所示：
private static final Object LOCK = new Object();
for(int i = 0;i < 100; i++) {
synchronized(LOCK){
// do some magic things
}
}
经过锁粗化后，就变成下面这个样子：
synchronized(LOCK){
for(int i = 0;i < 100; i++) {
// do some magic things
}
}
锁消除是指虚拟机编译器在运行时检测到了共享数据没有竞争的锁，从而将这些锁进行消除。举个例子让大家更好理解，来看这样一段代码：
public String test(String s1, String s2){
StringBuffer stringBuffer = new StringBuffer();
stringBuffer.append(s1);
stringBuffer.append(s2);
return stringBuffer.toString();
}
上面代码中的test() 方法，主要作用是将字符串 s1 和字符串 s2 串联起来。 test() 方法中的三个变量s1, s2,和StringBuffer都是局部变量，局部变量是存储在栈上的，而栈又是线程私有的，所以就算有多个线程访问 test() 方法也是线程安全的。 我们都知道 StringBuffer 是线程安全的类，因为append()方法是同步方法，如源码所示：
// append 是同步方法
public synchronized StringBuffer append(String str) {
toStringCache = null;
super.append(str);
return this;
}
但是 test() 方法本来就是线程安全的，为了提升效率，虚拟机自动帮我们消除了这些同步锁，这个过程就被称为锁消除。
3、总结
好了，前面讲了这么多，相信大家已经理解了各种眼花缭乱的锁。最后，我用一张脑图完整地总结了各种锁的应用场景。大家可以在面试前拿出来看看，只要是被问到锁相关的问题，相信你一定能够吊打面试官了。
在这里插入图片描述 脑图分享链接：https://www.processon.com/view/link/633412ea07912955b20d7938
最后，分享几个关于锁的高频面试题，看看大家能不能回答出来
1、ReentrantLock与synchronized 的区别
2、synchronized和volatile的区别
3、synchronized和lock的区别
4、什么是死锁以及如何避免死锁问题
如果你回答不出来，可以去我的主页看看，这些面试题在往期的视频中都有分享过。
我是被编程耽误的文艺Tom，如果我的分享对你有帮助，请动动手指一键三连分享给更多的人。关注我，面试不再难！
展开阅读全文
加载中
作者的其它热门文章
打赏
0
10 收藏
分享
打赏
0 评论
10 收藏
0
分享
返回顶部
顶部
|
{
"url": "https://my.oschina.net/gupaoedutom/blog/5592886",
"source_domain": "my.oschina.net",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "93117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2DSNDVPO2ZTABLFNQV6WWP2QUSNWHENG",
"WARC-Concurrent-To": "<urn:uuid:dff814c3-c47c-484b-a056-5f0ff04a5f44>",
"WARC-Date": "2023-06-03T17:27:11Z",
"WARC-IP-Address": "212.64.63.215",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QZAHAAKZ4Q4XKZB3FVMO43MIZQU6CMUM",
"WARC-Record-ID": "<urn:uuid:9b6eab2a-ec82-4cbf-8c79-1fcffb257846>",
"WARC-Target-URI": "https://my.oschina.net/gupaoedutom/blog/5592886",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c4c92791-9b32-4846-b4c7-794da029ade1>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-118\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,
21,
22,
25,
42,
51,
52,
168,
169,
176,
177,
236,
237,
247,
248,
314,
315,
324,
325,
372,
373,
391,
392,
480,
481,
491,
492,
550,
551,
561,
562,
711,
712,
722,
723,
846,
847,
864,
865,
995,
996,
1006,
1007,
1125,
1126,
1136,
1137,
1251,
1252,
1262,
1263,
1445,
1446,
1456,
1457,
1496,
1497,
1534,
1550,
1574,
1591,
1611,
1614,
1615,
1703,
1704,
1722,
1723,
1812,
1813,
1843,
1844,
1848,
1862,
1878,
1896,
1907,
1911,
1949,
1950,
2038,
2039,
2049,
2050,
2110,
2111,
2158,
2196,
2197,
2222,
2223,
2322,
2323,
2438,
2439,
2493,
2519,
2532,
2535,
2589,
2614,
2617,
2618,
2750,
2751,
2775,
2776,
2867,
2868,
2878,
2879,
3048,
3049,
3119,
3132,
3147,
3186,
3247,
3259,
3262,
3263,
3466,
3467,
3493,
3494,
3574,
3575,
3585,
3586,
4053,
4054,
4075,
4076,
4159,
4160,
4170,
4171,
4345,
4346,
4396,
4430,
4460,
4492,
4496,
4499,
4500,
4518,
4519,
4545,
4585,
4618,
4623,
4627,
4628,
4691,
4692,
4738,
4792,
4823,
4854,
4888,
4891,
4892,
5081,
5082,
5099,
5158,
5186,
5211,
5226,
5229,
5230,
5289,
5290,
5295,
5296,
5391,
5392,
5470,
5471,
5500,
5501,
5534,
5535,
5562,
5563,
5586,
5587,
5605,
5606,
5644,
5645,
5699,
5700,
5707,
5711,
5712,
5722,
5723,
5726,
5728,
5734,
5737,
5740,
5745,
5751,
5753,
5756,
5761
],
"line_end_idx": [
21,
22,
25,
42,
51,
52,
168,
169,
176,
177,
236,
237,
247,
248,
314,
315,
324,
325,
372,
373,
391,
392,
480,
481,
491,
492,
550,
551,
561,
562,
711,
712,
722,
723,
846,
847,
864,
865,
995,
996,
1006,
1007,
1125,
1126,
1136,
1137,
1251,
1252,
1262,
1263,
1445,
1446,
1456,
1457,
1496,
1497,
1534,
1550,
1574,
1591,
1611,
1614,
1615,
1703,
1704,
1722,
1723,
1812,
1813,
1843,
1844,
1848,
1862,
1878,
1896,
1907,
1911,
1949,
1950,
2038,
2039,
2049,
2050,
2110,
2111,
2158,
2196,
2197,
2222,
2223,
2322,
2323,
2438,
2439,
2493,
2519,
2532,
2535,
2589,
2614,
2617,
2618,
2750,
2751,
2775,
2776,
2867,
2868,
2878,
2879,
3048,
3049,
3119,
3132,
3147,
3186,
3247,
3259,
3262,
3263,
3466,
3467,
3493,
3494,
3574,
3575,
3585,
3586,
4053,
4054,
4075,
4076,
4159,
4160,
4170,
4171,
4345,
4346,
4396,
4430,
4460,
4492,
4496,
4499,
4500,
4518,
4519,
4545,
4585,
4618,
4623,
4627,
4628,
4691,
4692,
4738,
4792,
4823,
4854,
4888,
4891,
4892,
5081,
5082,
5099,
5158,
5186,
5211,
5226,
5229,
5230,
5289,
5290,
5295,
5296,
5391,
5392,
5470,
5471,
5500,
5501,
5534,
5535,
5562,
5563,
5586,
5587,
5605,
5606,
5644,
5645,
5699,
5700,
5707,
5711,
5712,
5722,
5723,
5726,
5728,
5734,
5737,
5740,
5745,
5751,
5753,
5756,
5761,
5763
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5763,
"ccnet_original_nlines": 208,
"rps_doc_curly_bracket": 0.003817460034042597,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.031697340309619904,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013292429968714714,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7965235114097595,
"rps_doc_frac_unique_words": 0.6757678985595703,
"rps_doc_mean_word_length": 16.969284057617188,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.053877353668213,
"rps_doc_word_count": 293,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.017699120566248894,
"rps_doc_frac_chars_dupe_6grams": 0.012469829991459846,
"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.005028159823268652,
"rps_doc_frac_chars_top_3gram": 0.008849560283124447,
"rps_doc_frac_chars_top_4gram": 0.008447299711406231,
"rps_doc_books_importance": -445.28582763671875,
"rps_doc_books_importance_length_correction": -445.28582763671875,
"rps_doc_openwebtext_importance": -179.42425537109375,
"rps_doc_openwebtext_importance_length_correction": -179.42425537109375,
"rps_doc_wikipedia_importance": -281.7275085449219,
"rps_doc_wikipedia_importance_length_correction": -281.7275085449219
},
"fasttext": {
"dclm": 0.9536398649215698,
"english": 0.002370550064370036,
"fineweb_edu_approx": 2.3804423809051514,
"eai_general_math": 0.026118459179997444,
"eai_open_web_math": 0.12547558546066284,
"eai_web_code": 0.6091222167015076
}
}
|
{
"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": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,106,693,837,603,869,000 |
Is temporarily switching a sim card a bad idea?
Discussion in 'iPhone' started by jeditor, Jun 21, 2016.
1. jeditor macrumors newbie
jeditor
Joined:
Jun 18, 2016
#1
I have an iPhone 4 with no sim card (it is arriving in a few days) the 4 is completely wiped. I want to be able to put some music and movies on it but it won't allow me to set it up without a sim card. I have an iPhone 6+ WITH a SIM card that is full of all sorts of important things. My question is, if I remove the sim from the 6 and put it in the 4, would I be able to add new music/movies/ content to 4 without damaging/deleting/upsetting the iPhone 6 once I return the sim card to it? Thank you in advance.
2. timeconsumer macrumors 65816
timeconsumer
Joined:
Aug 1, 2008
Location:
Portland
#2
The 6 uses a Nano-SIM and the 4 uses a Micro-SIM. Aside from that I don't think it matters if you use a random SIM just to activate it.
https://support.apple.com/en-us/HT202645
3. joeblow7777 macrumors 601
Joined:
Sep 7, 2010
#3
4. lordofthereef macrumors G5
lordofthereef
Joined:
Nov 29, 2011
Location:
Boston, MA
#4
No issues. Buy a sin adapter tray. It will set you back a buck or two.
5. M. Gustave macrumors 68000
M. Gustave
Joined:
Jun 6, 2015
Location:
Grand Budapest Hotel
#5
What? I bought two iPhone 4s, used, for my daughters to play with (not as phones). I've never put a SIM card in either one, and they're both setup fine. They're using iCloud with their own accounts I created. They also share my Apple Music subscription.
6. aKansasKid macrumors regular
Joined:
Apr 27, 2015
#6
I don't play with iOS often, but my last two iPhones, a 6s and a 5s, both on iOS 9.x, required a SIM to activate. My Verizon 4s didn't, but it doesn't take a SIM.
7. aneftp macrumors 601
Joined:
Jul 28, 2007
#7
I wouldn't buy a sim adapter. Many are flimsy. If it gets stuck (which has happened to many people) you risk ruining the phone. If ruin he sim slots you will ruin the phone.
8. lordofthereef macrumors G5
lordofthereef
Joined:
Nov 29, 2011
Location:
Boston, MA
#8
To each his own I guess. I used one for about a year when I was switching between android phones and didn't have an issue, though I purchased one with good reviews in it (not always a fool proof indicator, I know).
OP just wants to use this as a one time activstiOn method so the risk is relatively low, from my perspective anyway.
9. timeconsumer macrumors 65816
timeconsumer
Joined:
Aug 1, 2008
Location:
Portland
#9
After you restore your iPhone, you need a SIM card to activate it. Once it's activated you can remove the SIM card. It's likely that when you bought the used iPhone 4s' somebody had already inserted a temporary SIM to pass the activation step.
Here are some threads on Apple's website regarding this: https://discussions.apple.com/article/HT3406
10. RedOrchestra Suspended
Joined:
Aug 13, 2012
#10
This is the CORRECT answer.
11. SuperKerem macrumors 6502a
SuperKerem
Joined:
Oct 29, 2012
Location:
London, England
#11
Unless the iPhone is a Verizon/CDMA model. In which case it is the wrong answer.
12. RedOrchestra Suspended
Joined:
Aug 13, 2012
#12
Ah yeah, there's the rest of the world, then there's Verizon.
13. SuperKerem macrumors 6502a
SuperKerem
Joined:
Oct 29, 2012
Location:
London, England
#13
Well the demand for Verizon phones was big enough for Apple to release an entirely new model for it. So there's that.
Share This Page
|
{
"url": "https://forums.macrumors.com/threads/is-temporarily-switching-a-sim-card-a-bad-idea.1979109/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "197527",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TATPRQM6ZUSRJWALMDHZAN4NKAKXOMUL",
"WARC-Concurrent-To": "<urn:uuid:33d62f9a-aee1-4e16-96fd-800e7c6d8318>",
"WARC-Date": "2018-03-24T12:25:37Z",
"WARC-IP-Address": "162.254.116.214",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YXOYPKHYAVDAOKVQSHFFJV74RUWHMD2G",
"WARC-Record-ID": "<urn:uuid:36ce6c56-1977-4393-b2c2-215d87053b7f>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/is-temporarily-switching-a-sim-card-a-bad-idea.1979109/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:29a0bb21-c099-4147-8999-ce2a12cfb4e8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-151-161-17.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
48,
49,
106,
107,
137,
138,
150,
151,
163,
180,
187,
703,
709,
743,
744,
761,
762,
774,
790,
804,
817,
824,
964,
965,
1010,
1016,
1047,
1048,
1060,
1076,
1083,
1115,
1116,
1134,
1135,
1147,
1164,
1178,
1193,
1200,
1275,
1281,
1313,
1314,
1329,
1330,
1342,
1358,
1372,
1397,
1404,
1662,
1668,
1702,
1703,
1715,
1732,
1739,
1906,
1912,
1938,
1939,
1951,
1968,
1975,
2153,
2159,
2191,
2192,
2210,
2211,
2223,
2240,
2254,
2269,
2276,
2495,
2496,
2617,
2623,
2657,
2658,
2675,
2676,
2688,
2704,
2718,
2731,
2738,
2986,
2987,
3093,
3099,
3128,
3129,
3141,
3158,
3166,
3167,
3199,
3205,
3238,
3239,
3254,
3255,
3267,
3284,
3298,
3318,
3326,
3411,
3417,
3446,
3447,
3459,
3476,
3484,
3485,
3551,
3557,
3590,
3591,
3606,
3607,
3619,
3636,
3650,
3670,
3678,
3800,
3806,
3807
],
"line_end_idx": [
48,
49,
106,
107,
137,
138,
150,
151,
163,
180,
187,
703,
709,
743,
744,
761,
762,
774,
790,
804,
817,
824,
964,
965,
1010,
1016,
1047,
1048,
1060,
1076,
1083,
1115,
1116,
1134,
1135,
1147,
1164,
1178,
1193,
1200,
1275,
1281,
1313,
1314,
1329,
1330,
1342,
1358,
1372,
1397,
1404,
1662,
1668,
1702,
1703,
1715,
1732,
1739,
1906,
1912,
1938,
1939,
1951,
1968,
1975,
2153,
2159,
2191,
2192,
2210,
2211,
2223,
2240,
2254,
2269,
2276,
2495,
2496,
2617,
2623,
2657,
2658,
2675,
2676,
2688,
2704,
2718,
2731,
2738,
2986,
2987,
3093,
3099,
3128,
3129,
3141,
3158,
3166,
3167,
3199,
3205,
3238,
3239,
3254,
3255,
3267,
3284,
3298,
3318,
3326,
3411,
3417,
3446,
3447,
3459,
3476,
3484,
3485,
3551,
3557,
3590,
3591,
3606,
3607,
3619,
3636,
3650,
3670,
3678,
3800,
3806,
3807,
3822
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3822,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3138957917690277,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04838709905743599,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2890819013118744,
"rps_doc_frac_unique_words": 0.4555920958518982,
"rps_doc_mean_word_length": 4.299342155456543,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.016129029914736748,
"rps_doc_unigram_entropy": 5.1921539306640625,
"rps_doc_word_count": 608,
"rps_doc_frac_chars_dupe_10grams": 0.1576128453016281,
"rps_doc_frac_chars_dupe_5grams": 0.18515685200691223,
"rps_doc_frac_chars_dupe_6grams": 0.18515685200691223,
"rps_doc_frac_chars_dupe_7grams": 0.1576128453016281,
"rps_doc_frac_chars_dupe_8grams": 0.1576128453016281,
"rps_doc_frac_chars_dupe_9grams": 0.1576128453016281,
"rps_doc_frac_chars_top_2gram": 0.012241779826581478,
"rps_doc_frac_chars_top_3gram": 0.015302220359444618,
"rps_doc_frac_chars_top_4gram": 0.00994644034653902,
"rps_doc_books_importance": -370.452880859375,
"rps_doc_books_importance_length_correction": -370.452880859375,
"rps_doc_openwebtext_importance": -228.28834533691406,
"rps_doc_openwebtext_importance_length_correction": -228.28834533691406,
"rps_doc_wikipedia_importance": -156.25344848632812,
"rps_doc_wikipedia_importance_length_correction": -156.25344848632812
},
"fasttext": {
"dclm": 0.04839671030640602,
"english": 0.9356063008308411,
"fineweb_edu_approx": 1.0826345682144165,
"eai_general_math": 0.007447239942848682,
"eai_open_web_math": 0.15471529960632324,
"eai_web_code": 0.00007093000021995977
}
}
|
{
"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": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,775,993,250,783,274,000 |
How to fix the sound of your computer without going to maintenance
The problem of a computer sound that has some kind of noise, annoying or cracking is one of the problems that many Windows users face and often do not know how to deal with it, but this article will answer your questions and if you are unable to repair your computer, you can contact us on our official page. So how can we solve the problem of sound in the computer?
1- Check the volume:
We will guide you in order to check the volume level through the following procedures. First, you must make sure that you have not muted the computer, by pressing the volume up button and dragging it to the maximum level. This method is effective if you have reduced the volume of your computer.
2 – Check the connections and wires of the speakers and headphones:
You must first check the connections and wires of the speakers, as well as the headphones, and make sure that you have correctly connected them to the correct ports.
3- Turn off your computer and restart it:
Also, while your computer has a sound problem, you can turn it off and then you can restart it, and the purpose of this process is to reset the sound.
4- Change the audio format:
This method is also effective in the event that the type of audio format does not match or is compatible with your device, so it is possible that the cause of noise and disturbance in the sound on your device is this reason, and you can solve this problem by changing the audio format and choosing a good audio format and This is clear by clicking on the sound box in the taskbar next to the clock, then opening the sound tab and pressing Play devices to show you the sound properties window, and then click on the advanced word and open it and from it you can choose a good sound format that matches your device, and then press on the word save.
5- Run the debugger:
The way to run the debugger can be one of the ways that can help solve the sound problem in the computer, and we will guide if you do not know how to run the debugger. All you have to do is follow the following steps, first open the start menu and then write a sentence Audio debugger in the search box (you can translate it according to your computer language settings) and then choose the option to search for audio playback problems and fix them from the list that will appear in front of you from the results, then press the Uninstall audio driver button, and then you can restart Install it again.
6- Set the default settings:
Adjust the settings for audio devices through the following procedures. First, you must open the Start menu, then type the word “sound” in the search box and choose it, then choose the desired device from the Playback tab, and then set it to a default option.
Thus, we have helped you solve most of the reasons that are the result of poor sound or that the sound is present, but unfortunately it is annoying or weak, so sound problems in general, but there are other procedures that can solve the problem, for example, adjusting the default settings for audio devices or also turning off sound improvements.
But in the event that all of these methods are not successful, you can contact us personally through our official page and we will, in turn, assist you.
About medapk
Check Also
What does 165 Hz mean
Often after you have seen our home page or heard from someone about the 165hz …
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://medapk.com/2022/12/05/how-to-fix-the-sound-of-your-computer-without-going-to-maintenance/",
"source_domain": "medapk.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "163358",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7BQINKLO45MQU55O5MHMTMKZYI6SG32V",
"WARC-Concurrent-To": "<urn:uuid:a04fe6ed-d76c-40cd-9385-c1860e0073b8>",
"WARC-Date": "2023-01-31T17:54:09Z",
"WARC-IP-Address": "198.54.120.135",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RGZNVS5WBZL6MQT3T65CKEJHPZZQOXEL",
"WARC-Record-ID": "<urn:uuid:6a921af8-974b-498b-9e96-9592c67c1e3b>",
"WARC-Target-URI": "https://medapk.com/2022/12/05/how-to-fix-the-sound-of-your-computer-without-going-to-maintenance/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23c301ea-6660-4c76-821d-c54db9689c1c>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-108\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,
67,
68,
435,
436,
457,
458,
754,
755,
823,
824,
990,
991,
1033,
1034,
1185,
1186,
1214,
1215,
1862,
1863,
1884,
1885,
2488,
2489,
2518,
2519,
2779,
2780,
3128,
3129,
3282,
3283,
3296,
3297,
3308,
3309,
3331,
3332,
3412,
3413,
3427,
3428
],
"line_end_idx": [
67,
68,
435,
436,
457,
458,
754,
755,
823,
824,
990,
991,
1033,
1034,
1185,
1186,
1214,
1215,
1862,
1863,
1884,
1885,
2488,
2489,
2518,
2519,
2779,
2780,
3128,
3129,
3282,
3283,
3296,
3297,
3308,
3309,
3331,
3332,
3412,
3413,
3427,
3428,
3498
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3498,
"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.5162659287452698,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.023255810141563416,
"rps_doc_frac_no_alph_words": 0.10183876007795334,
"rps_doc_frac_unique_words": 0.3447205126285553,
"rps_doc_mean_word_length": 4.304347991943359,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.001414429978467524,
"rps_doc_unigram_entropy": 4.743097305297852,
"rps_doc_word_count": 644,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09668110311031342,
"rps_doc_frac_chars_dupe_6grams": 0.058441560715436935,
"rps_doc_frac_chars_dupe_7grams": 0.058441560715436935,
"rps_doc_frac_chars_dupe_8grams": 0.028860030695796013,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.023088019341230392,
"rps_doc_frac_chars_top_3gram": 0.015151520259678364,
"rps_doc_frac_chars_top_4gram": 0.008658009581267834,
"rps_doc_books_importance": -304.82232666015625,
"rps_doc_books_importance_length_correction": -304.82232666015625,
"rps_doc_openwebtext_importance": -157.17071533203125,
"rps_doc_openwebtext_importance_length_correction": -157.17071533203125,
"rps_doc_wikipedia_importance": -84.44414520263672,
"rps_doc_wikipedia_importance_length_correction": -84.44414520263672
},
"fasttext": {
"dclm": 0.13996607065200806,
"english": 0.9366983771324158,
"fineweb_edu_approx": 2.1774849891662598,
"eai_general_math": 0.05731511116027832,
"eai_open_web_math": 0.1373252272605896,
"eai_web_code": 0.005851979833096266
}
}
|
{
"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.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": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
58,124,033,377,933,700 |
Announcements
(Mobile) Return repeat and queue buttons to Now Playing screen
Status: Implemented
The new UI for the Now Playing screen on mobile (iOS and Android) doesn't seem space-efficient. I understand that inevitably the design will be refreshed and changed, but, given the amount of unused screen space, I don't think it was necessary to move the view queue and repeat buttons into a separate menu. It seems like it shouldn't be too difficult to find space to these on the main screen, espcially considering how often many users make use of these features.
Note: Attached images show the Spotify iOS app version 8.4.91 on an iPhone SE compared to a previous iOS app version 8.4.81, I believe.
iOS Now playing menu.PNG
iOS Now playing Old.PNG
iOS Now playing.PNG
Updated on 2019-05-23
Hey folks,
Just a heads up, that the Repeat and Queue buttons have returned to the Now Playing View on the mobile app.
Screenshot_20190523-101212_2__01.jpg
The repeat button has moved to the left and you Queue can be found just below.
Thanks!
Comments
nfx
They really need to GET RID OF THAT SHARE BUTTON on the bottom right and make that the repeat button. I find that to be the most useless button and espcially because when you take a screenshot in the spotify app it allows you to share it. Glad someone else posted as i think i'm not allowed to post new ideas yet, really hope they change it soon. I did figure out one thing when you already have a queue playing you can touch the word queue and it brings you to it, otherwise yeah having to press two things where before it was only one is inconvenient in my opinion. Lastly, which is why i disliked the full screen ui because instead of having the queue box thing they made it a share button *sigh* but i do love the new ui besides those two little inconveniences
MattSuda
Really upset about this! I would like the option to repeat and button to view the queue put back on the now playing screen for easy access. I worked hard on my posted idea years ago to rally support to get Spotify to add a repeat option and now they are hiding it away. A huge step backwards. 75% of the time I am using the app, I have the repeat one option turned on. I like to listen to a song over and over agian and this makes it harder to do that.
Now to repeat, queue, or add a song to a playlist, or select any of the other options you have to reach your hand to the very top right of the screen. This can be hard especially on large screens (Plus, Max iPhones). Before that "..." button was easy to access at the bottom of the screen. Easy access options should be easy to reach at the bottom of the screen, not the top.
This will also make using Spotify in the car harder. Especially when the car mode isn't available on iOS only Android.
Terrible! I've been searching "@SpotifyCares repeat" on Twitter and there's lot of people who think the same. I miss the Spotify designs of the past. It seems the design team has lost touch with what the users actually want.
The only good thing about the new design is that the time stamps on the left and right side of the bar aren't hidden anymore with auto hide.
MattSuda
Status changed to: New Idea
Marked as new idea
nolaurious
I support this change-back. Having a mini-Now Playing screen within and behind the real Now Playing screen is bad and confusing design
Gracereborn
Agreed! The repeat button is better where it was, I hardly ever ‘heart’ music so there’s no need for that button to have replaced the repeat button. Since this is a premium feature I don’t understand why they’ve made it harder to get to 😠
nfx
@Gracereborn wrote:
Agreed! The repeat button is better where it was, I hardly ever ‘heart’ music so there’s no need for that button to have replaced the repeat button. Since this is a premium feature I don’t understand why they’ve made it harder to get to 😠
i don't mind the heart just wish it was a confirm to delete if we ever accidently pressesed it but that share button is the one THAT HAS TO GET OUT because that's more useless than the save to library button
Pokahydee
I really don't like the change to remove the loop button. I can no longer quickly hit the loop (for one song) when I pull up to a stop sign or red light anymore. It's frustrating to have it on a completely separate screen.
opentage
Completly agree - this refresh of the iOS app unnecessarily hides commonly used funcitons under a sub-menu
aduric
Please listen to this Spotify! I used those "Queue" and "Repeat" buttons multiple times throughout the day. Now it's been hidden behind a menu and replaced with the heart button.
I never use the "Like" function, and I don't want to. This new update is so poorly designed - the amount of wasted space is ridiculous.
I love Spotify and have been a premium customer for years, but recent updates and performance issues are making me think about switching to Apple Music for the first time.
I'm not the only one who thinks there have been issues; just take a look at some of the posts on the Spotify subreddit:
https://old.reddit.com/r/spotify/comments/ae4gbh/why_spotify_sucks_in_2019_on_android/ 597 upvotes
https://old.reddit.com/r/spotify/comments/an47mr/does_spotify_suck_especially_hard_for_anybody/ 135 upvotes
https://old.reddit.com/r/spotify/comments/aku6tb/spotify_has_been_hot_garbage_for_the_past_month/ 462 upvotes
Edit:
More complaints
https://old.reddit.com/r/spotify/comments/alrryg/what_even_is_this_update/ 80 upvotes
https://old.reddit.com/r/spotify/comments/almfcn/new_mobile_update_gets_rid_of_a_bunch_of_useful/ 238 upvotes
Quote from /u/IlSoleNuovo:
They hid the repeat settings in the ellipsis menu. Such a bizarre design choice if you actually want to listen to complete albums. However, if you want to force listeners to discover whatever musicians you're being pushed to promote then it makes perfect sense.
It's easy to see what's influencing their choices.
jaredjeya
I totally agree. It’s the first thing I noticed when I booted up the app with the new UI - I use the queue constantly (I always start listening by queuing up half a dozen songs or so, and I also like to look at what’s coming up next and remove songs I don’t want to listen to/move forward ones I do) and having to tap multiple times and scroll to get to the queue is really infuriating and slow.
And on top of that, they still haven’t fixed the bug where having a non-standard dynamic text size makes the last song in the queue invisible!
|
{
"url": "https://community.spotify.com/t5/Implemented-Ideas/Mobile-Return-repeat-and-queue-buttons-to-Now-Playing-screen/idi-p/4670123/highlight/true",
"source_domain": "community.spotify.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "273069",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I4DTIW4XOY4VXV36FD4JU2XVPNYGGNML",
"WARC-Concurrent-To": "<urn:uuid:3c31910b-a04b-4b30-ac9b-059a2788c751>",
"WARC-Date": "2022-11-28T08:44:23Z",
"WARC-IP-Address": "18.160.18.29",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U6ZONERKPZGE55KSSDCX7W7YTEJYHKEI",
"WARC-Record-ID": "<urn:uuid:253c4dd3-f04c-47f5-8c1f-3b470ec6db3d>",
"WARC-Target-URI": "https://community.spotify.com/t5/Implemented-Ideas/Mobile-Return-repeat-and-queue-buttons-to-Now-Playing-screen/idi-p/4670123/highlight/true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ceab5a6-974f-48a4-bbf9-9146ed77f879>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\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,
14,
15,
78,
79,
99,
100,
566,
567,
703,
704,
729,
753,
773,
774,
796,
797,
809,
810,
812,
813,
922,
923,
925,
926,
963,
964,
966,
967,
1047,
1048,
1050,
1051,
1059,
1060,
1069,
1073,
1074,
1840,
1841,
1850,
1851,
2304,
2305,
2307,
2308,
2684,
2685,
2687,
2688,
2807,
2808,
2809,
3034,
3035,
3037,
3038,
3180,
3181,
3190,
3218,
3219,
3238,
3239,
3250,
3251,
3387,
3388,
3400,
3401,
3641,
3642,
3646,
3647,
3667,
3668,
3908,
3909,
3911,
3912,
4121,
4122,
4123,
4133,
4134,
4357,
4358,
4367,
4368,
4476,
4477,
4484,
4485,
4664,
4665,
4801,
4802,
4804,
4805,
4977,
4978,
4980,
4981,
5101,
5102,
5202,
5311,
5312,
5423,
5424,
5426,
5427,
5433,
5434,
5450,
5451,
5538,
5539,
5650,
5651,
5653,
5654,
5681,
5682,
5944,
5945,
5996,
5997,
6007,
6008,
6404,
6405,
6407,
6408
],
"line_end_idx": [
14,
15,
78,
79,
99,
100,
566,
567,
703,
704,
729,
753,
773,
774,
796,
797,
809,
810,
812,
813,
922,
923,
925,
926,
963,
964,
966,
967,
1047,
1048,
1050,
1051,
1059,
1060,
1069,
1073,
1074,
1840,
1841,
1850,
1851,
2304,
2305,
2307,
2308,
2684,
2685,
2687,
2688,
2807,
2808,
2809,
3034,
3035,
3037,
3038,
3180,
3181,
3190,
3218,
3219,
3238,
3239,
3250,
3251,
3387,
3388,
3400,
3401,
3641,
3642,
3646,
3647,
3667,
3668,
3908,
3909,
3911,
3912,
4121,
4122,
4123,
4133,
4134,
4357,
4358,
4367,
4368,
4476,
4477,
4484,
4485,
4664,
4665,
4801,
4802,
4804,
4805,
4977,
4978,
4980,
4981,
5101,
5102,
5202,
5311,
5312,
5423,
5424,
5426,
5427,
5433,
5434,
5450,
5451,
5538,
5539,
5650,
5651,
5653,
5654,
5681,
5682,
5944,
5945,
5996,
5997,
6007,
6008,
6404,
6405,
6407,
6408,
6550
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6550,
"ccnet_original_nlines": 133,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4231047034263611,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036823101341724396,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1581227332353592,
"rps_doc_frac_unique_words": 0.3925318717956543,
"rps_doc_mean_word_length": 4.647541046142578,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.0007220199913717806,
"rps_doc_unigram_entropy": 5.331592082977295,
"rps_doc_word_count": 1098,
"rps_doc_frac_chars_dupe_10grams": 0.0748579278588295,
"rps_doc_frac_chars_dupe_5grams": 0.08348031342029572,
"rps_doc_frac_chars_dupe_6grams": 0.08348031342029572,
"rps_doc_frac_chars_dupe_7grams": 0.0748579278588295,
"rps_doc_frac_chars_dupe_8grams": 0.0748579278588295,
"rps_doc_frac_chars_dupe_9grams": 0.0748579278588295,
"rps_doc_frac_chars_top_2gram": 0.015873020514845848,
"rps_doc_frac_chars_top_3gram": 0.017636679112911224,
"rps_doc_frac_chars_top_4gram": 0.008230449631810188,
"rps_doc_books_importance": -521.3848266601562,
"rps_doc_books_importance_length_correction": -521.3848266601562,
"rps_doc_openwebtext_importance": -378.41485595703125,
"rps_doc_openwebtext_importance_length_correction": -378.41485595703125,
"rps_doc_wikipedia_importance": -255.67897033691406,
"rps_doc_wikipedia_importance_length_correction": -255.67897033691406
},
"fasttext": {
"dclm": 0.042758941650390625,
"english": 0.9263361692428589,
"fineweb_edu_approx": 0.919063150882721,
"eai_general_math": 0.021372439339756966,
"eai_open_web_math": 0.06982535123825073,
"eai_web_code": 0.02489119954407215
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"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": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,853,066,963,912,045,000 |
python中的tuple不是immutable (tuple in python is n - 公司荣誉 - 南充市顺庆区小房子和树婚礼策划部
当前位置：首页 > 公司荣誉 >
python中的tuple不是immutable (tuple in python is n
编辑：南充市顺庆区小房子和树婚礼策划部时间：2017-09-15 10:40:58阅读次数：2
python中的tuple不是immutable (tuple in python is not immutable)
There are lots of article to say that tuple in pyton in immutable, but after my test, this is not true.
Please see the example:
Python 2.7.2 (default, Jun 12 2011, 15:08:59) [MSC v.1500 32 bit (Intel)] on win32
>>> L = [1,2,3]
# define a typle
>>> dd = tuple(L)
# print all methods of tuple
>>> print dir(dd)
['__add__', '__class__', '__contains__', '__delattr__', '__doc__', '__eq__', '__
format__', '__ge__', '__getattribute__', '__getitem__', '__getnewargs__', '__get
slice__', '__gt__', '__hash__', '__init__', '__iter__', '__le__', '__len__', '__
lt__', '__mul__', '__ne__', '__new__', '__reduce__', '__reduce_ex__', '__repr__'
, '__rmul__', '__setattr__', '__sizeof__', '__str__', '__subclasshook__', 'count
', 'index']
>>> print dd
(1, 2, 3)
>>> dd.__add__("a")
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
TypeError: can only concatenate tuple (not "str") to tuple
# Note, tuple is changed.
>>> dd.__add__(dd)
(1, 2, 3, 1, 2, 3)
>>>
，专题，站群系统
企业建站2800元起，携手武汉肥猫科技，做一个有见地的颜值派！更多优惠请戳：襄阳SEO http://xiangyang.raoyu.net
上一篇：387. First Unique Character in a String [easy] (Py 下一篇：最后一页
相关阅读
|
{
"url": "http://innmarry.com/gsry_2017_0915_1826.html",
"source_domain": "innmarry.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "10729",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WV7EYHC5HURQ4G5QQI7EVQC2ZVYGMZWT",
"WARC-Concurrent-To": "<urn:uuid:d0188a57-de41-4b89-a892-020581db2eda>",
"WARC-Date": "2018-03-17T20:27:14Z",
"WARC-IP-Address": "192.238.182.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:POAQ7WUSG5NVR4HQIPKWUBTCS6YAKHUK",
"WARC-Record-ID": "<urn:uuid:c98e7ba5-93d9-43de-b0fe-98171784b295>",
"WARC-Target-URI": "http://innmarry.com/gsry_2017_0915_1826.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bb0c7ce-87b7-471c-8579-9ca2ec8079fb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-253-143.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
76,
93,
94,
141,
142,
190,
250,
251,
355,
356,
357,
381,
382,
465,
481,
482,
499,
517,
518,
547,
565,
646,
727,
808,
889,
970,
982,
995,
1005,
1025,
1060,
1096,
1155,
1156,
1182,
1201,
1220,
1224,
1225,
1226,
1235,
1236,
1307,
1308,
1372,
1373,
1378,
1379
],
"line_end_idx": [
76,
93,
94,
141,
142,
190,
250,
251,
355,
356,
357,
381,
382,
465,
481,
482,
499,
517,
518,
547,
565,
646,
727,
808,
889,
970,
982,
995,
1005,
1025,
1060,
1096,
1155,
1156,
1182,
1201,
1220,
1224,
1225,
1226,
1235,
1236,
1307,
1308,
1372,
1373,
1378,
1379,
1380
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1380,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11420612782239914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011142060160636902,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5961002707481384,
"rps_doc_frac_unique_words": 0.75,
"rps_doc_mean_word_length": 5.1646342277526855,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.00835654977709055,
"rps_doc_unigram_entropy": 4.630573749542236,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14049586653709412,
"rps_doc_frac_chars_dupe_6grams": 0.09445100277662277,
"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.03305784985423088,
"rps_doc_frac_chars_top_3gram": 0.10979928821325302,
"rps_doc_frac_chars_top_4gram": 0.13105076551437378,
"rps_doc_books_importance": -139.07252502441406,
"rps_doc_books_importance_length_correction": -139.0685577392578,
"rps_doc_openwebtext_importance": -80.17105865478516,
"rps_doc_openwebtext_importance_length_correction": -80.17105865478516,
"rps_doc_wikipedia_importance": -46.31107711791992,
"rps_doc_wikipedia_importance_length_correction": -45.10386276245117
},
"fasttext": {
"dclm": 0.12081921100616455,
"english": 0.3392724096775055,
"fineweb_edu_approx": 1.6033515930175781,
"eai_general_math": 0.44607043266296387,
"eai_open_web_math": 0.06181604042649269,
"eai_web_code": 0.8370679616928101
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,634,339,332,770,546,700 |
Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium
x
• Status: Solved
• Priority: Medium
• Security: Public
• Views: 710
• Last Modified:
FREE Centralized task planner
Hi,
I'm looking some free centralized task planner application. It would be great to be accessible via browser.
I would like to be able to manage fields like:
* Name
* Task Name
* Inserted date
* Priority
Or something equivalent.
Do you know one?
Thanks!
0
g0all
Asked:
g0all
• 4
• 3
• 3
• +3
5 Solutions
Levi GwynCommented:
SharePoint 2010 Foundation has a built-in project task template that does just what you're asking. We use it quite a bit. Foundations is free - does need a server to run on though.
0
g0allAuthor Commented:
Thank you, robcambra. For this solution I guess I would have to have at least one Microsoft Windows licence.
Do I have some other options, like something Linux based, maybe open source?
0
Levi GwynCommented:
There are a lot of open source project management apps but not too sure if there are any free ones that are worth much. Google "open source project management apps" and you get tons of results - most are paid though.
0
Fill in the form and get your FREE NFR key NOW!
Veeam is happy to provide a FREE NFR server license to certified engineers, trainers, and bloggers. It allows for the non‑production use of Veeam Agent for Microsoft Windows. This license is valid for five workstations and two servers.
Michael WorshamInfrastructure / Solutions ArchitectCommented:
Nice little site with a gathering of Open Source PM applications...
http://www.opensourceprojectmanagement.org/
0
Aaron TomoskyTechnology ConsultantCommented:
For a simple task list, google tasks is great. Haven't tried in in a multi user environment, but I found this:
http://code.google.com/p/share-tasks/
0
Ryan McCauleyDatabase and Reporting ManagerCommented:
It doesn't look like you need anything complex - PM software is probably going to be overkill in your case. I'd recommend something as simple as a centralized spreadsheet where you keeps tasks lists, and have people update things in one place (Google docs or Dropbox would make it easily accessible for anywhere, via a web link).
0
g0allAuthor Commented:
What I need is something centralized, free, that can be installed on LINUX, and accessible via HTTP, using a browser.
I'd like to be able to assign tasks to different persons, check status for that tasks, and so on. Eventually generate reports if it's possible, check tasks on a calendar.
I'd like to have my own server, don't like to use Google or Dropbox or anything hosted on third party server.
@robcambra - you pointed me right, I've found RedMine that seems to be somehow what I need.
@aarontomosky - Thank you, but I would like to have my own hosted server.
@mwecomputers - Thank you, something to consider.
@ ryanmccauley - Thank you, however spreadsheet is out of the question in this situation. I would need a dedicated app for tasks management.
0
Ryan McCauleyDatabase and Reporting ManagerCommented:
I know I might be diverging a bit from your requirements, but why not use a hosted third-party solution, even if you have to pay a little bit for it? Maybe you're opposed to a hosted solution and that's non-negotiable, but I'd encourage you to be flexible.
You're talking about something you could host internally, on your own server, and deploy and manage with a resource you already have, but for the kinds of solutions you're talking about (hosted elsewhere), you're looking at $250-$300/year in costs (for Basecamp, for example). For that price, which is less than a server admin makes in a single day, you could have something hosted, managed, and automatically upgraded for you, without any effort from your IT resources (who have lots to do already, I'm sure). If they're going to spend even a significant portion of a single day deploying this task manager you're looking for (which, for free, will come with community help they'll have to sort through themselves), not to mention the ongoing maintenance, you're better off with a commercial product. Also, the network of the hosted provider is bound to be more reliable than your own - nothing personal there, but they focus on that all day long and you've got other things to do.
Just my perspective - a free, local solution may fit your needs for some reason (maybe you're a one-person shop and have no money - that's fine - but even so, $300 isn't much), but given the price ranges at play here, I'd encourage you to reconsider the type of solution you're looking for and make sure you're working to address your actual business/project requirements as well.
0
Levi GwynCommented:
Keep us posted on RedMine or any other app you try out. I'm very interested in this.
0
g0allAuthor Commented:
@ryanmccauley I appreciate your advice - however I don't have to pay anyone as I can handle that on Linux and I have resources to host it on my own cloud.
0
Ryan McCauleyDatabase and Reporting ManagerCommented:
Fair enough - just wanted to put it out there. RedMine looks pretty promising - I'm interested to hear how it goes as well. Good luck with whatever solution you decide meets your needs.
0
Aaron TomoskyTechnology ConsultantCommented:
I've used eventum and it was nice. Super easy to setup and manage
0
ZberteocCommented:
I thonk this might help:
http://www.turnkeylinux.org/business-management
or even better:
http://www.turnkeylinux.org/issue-tracking
There are few that you could use. The nice thing is that everything free and is prepared for you, including the operating system, you only need to follow the instructions.
0
g0allAuthor Commented:
Thank you guys!
0
Featured Post
Industry Leaders: We Want Your Opinion!
We value your feedback.
Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!
• 4
• 3
• 3
• +3
Tackle projects and never again get stuck behind a technical roadblock.
Join Now
|
{
"url": "https://www.experts-exchange.com/questions/27997961/FREE-Centralized-task-planner.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "176526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3W3STQ7VSEYBEIC6247HQOX5FC5V4X25",
"WARC-Concurrent-To": "<urn:uuid:32d96afb-a02b-45a1-a1a2-edd0681495c0>",
"WARC-Date": "2018-01-16T10:15:12Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WFLMUMVWVIBFVNNY7LQJA5PM6RXM2TXU",
"WARC-Record-ID": "<urn:uuid:74b7b289-c730-4f30-8c87-d3bc0dd2510d>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/27997961/FREE-Centralized-task-planner.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e320d5a0-87ba-418b-ab1b-84893bf26c44>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-6-16.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 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,
105,
106,
108,
127,
148,
169,
184,
203,
204,
234,
235,
239,
240,
348,
349,
396,
397,
404,
416,
432,
443,
444,
469,
470,
487,
488,
496,
498,
504,
511,
517,
523,
529,
535,
542,
554,
556,
576,
759,
761,
763,
786,
895,
896,
973,
975,
977,
997,
1215,
1217,
1265,
1266,
1503,
1504,
1506,
1568,
1636,
1680,
1682,
1684,
1729,
1840,
1878,
1880,
1882,
1936,
2266,
2268,
2270,
2293,
2411,
2412,
2583,
2584,
2694,
2695,
2787,
2788,
2862,
2863,
2913,
2914,
3055,
3057,
3059,
3113,
3370,
3371,
4354,
4355,
4736,
4738,
4740,
4760,
4846,
4848,
4850,
4873,
5029,
5031,
5033,
5087,
5273,
5275,
5277,
5322,
5388,
5390,
5392,
5411,
5436,
5437,
5485,
5486,
5502,
5503,
5546,
5547,
5719,
5721,
5723,
5746,
5762,
5764,
5765,
5779,
5780,
5820,
5821,
5845,
5846,
5921,
5975,
5976,
5982,
5988,
5994,
6001,
6073
],
"line_end_idx": [
105,
106,
108,
127,
148,
169,
184,
203,
204,
234,
235,
239,
240,
348,
349,
396,
397,
404,
416,
432,
443,
444,
469,
470,
487,
488,
496,
498,
504,
511,
517,
523,
529,
535,
542,
554,
556,
576,
759,
761,
763,
786,
895,
896,
973,
975,
977,
997,
1215,
1217,
1265,
1266,
1503,
1504,
1506,
1568,
1636,
1680,
1682,
1684,
1729,
1840,
1878,
1880,
1882,
1936,
2266,
2268,
2270,
2293,
2411,
2412,
2583,
2584,
2694,
2695,
2787,
2788,
2862,
2863,
2913,
2914,
3055,
3057,
3059,
3113,
3370,
3371,
4354,
4355,
4736,
4738,
4740,
4760,
4846,
4848,
4850,
4873,
5029,
5031,
5033,
5087,
5273,
5275,
5277,
5322,
5388,
5390,
5392,
5411,
5436,
5437,
5485,
5486,
5502,
5503,
5546,
5547,
5719,
5721,
5723,
5746,
5762,
5764,
5765,
5779,
5780,
5820,
5821,
5845,
5846,
5921,
5975,
5976,
5982,
5988,
5994,
6001,
6073,
6081
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6081,
"ccnet_original_nlines": 139,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4125984311103821,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029921259731054306,
"rps_doc_frac_lines_end_with_ellipsis": 0.007142859976738691,
"rps_doc_frac_no_alph_words": 0.21102361381053925,
"rps_doc_frac_unique_words": 0.43191057443618774,
"rps_doc_mean_word_length": 4.8241868019104,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.0007874000002630055,
"rps_doc_unigram_entropy": 5.516387939453125,
"rps_doc_word_count": 984,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07183483988046646,
"rps_doc_frac_chars_dupe_6grams": 0.03433747962117195,
"rps_doc_frac_chars_dupe_7grams": 0.0033705499954521656,
"rps_doc_frac_chars_dupe_8grams": 0.0033705499954521656,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.005898459814488888,
"rps_doc_frac_chars_top_3gram": 0.002527910051867366,
"rps_doc_frac_chars_top_4gram": 0.0033705499954521656,
"rps_doc_books_importance": -488.0961608886719,
"rps_doc_books_importance_length_correction": -488.0961608886719,
"rps_doc_openwebtext_importance": -325.7132568359375,
"rps_doc_openwebtext_importance_length_correction": -325.7132568359375,
"rps_doc_wikipedia_importance": -217.88211059570312,
"rps_doc_wikipedia_importance_length_correction": -217.88211059570312
},
"fasttext": {
"dclm": 0.18367326259613037,
"english": 0.9477977752685547,
"fineweb_edu_approx": 1.1073992252349854,
"eai_general_math": 0.030881399288773537,
"eai_open_web_math": 0.12199568748474121,
"eai_web_code": 0.015018640086054802
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"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": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,672,654,739,420,011,000 |
Articles of rsa
Cómo averiguar el módulo y el exponente de RSA Public Key en iPhone / Objective C
¿Hay alguna manera posible de descubrir el módulo y el exponente de la Clave Pública, creada con SecKeyGeneratePair (el Marco de Seguridad en general)?
Generación de claves RSA en formato PKCS # 1 en Java
Cuando genero un par de claves RSA utilizando la API de Java, la clave pública está codificada en el formato X.509 y la clave privada está codificada en el formato PKCS # 8. Estoy buscando codificar ambos como PKCS # 1. es posible? Pasé una cantidad considerable de tiempo revisando los documentos de Java pero […]
RSA: Obtener exponente y módulo dado una clave pública
Necesito encriptar algunos datos usando RSA en JavaScript. Todas las bibliotecas de todo el mundo piden un exponente y un módulo, pero recibo un solo archivo public.key de mi oponente. ¿Cómo recuperas el exponent público y la parte del modulus de un archivo RSA?
Cómo generar clave pública y privada única a través de RSA
Estoy construyendo un carrito de compras personalizado donde los números de CC y la fecha de Exp. Se almacenarán en una base de datos hasta que se procesen (luego se eliminarán). Necesito cifrar esta información (obviamente). Quiero usar la clase RSACryptoServiceProvider. Aquí está mi código para crear mis llaves. public static void AssignNewKey(){ const int […]
Cifrado / descifrado de archivos de gran tamaño (.NET)
Tengo que encriptar, almacenar y luego descifrar archivos de gran tamaño. ¿Cuál es la mejor manera de hacer eso? Escuché que el cifrado de RSA es caro y se me recomendó usar RSA para encriptar una clave AES y luego usar la clave AES para encriptar los archivos grandes. Cualquier sugerencia con el ejemplo será […]
Encriptación RSA, obteniendo mala longitud
Al llamar a la siguiente función: byte[] bytes = rsa.Encrypt(System.Text.UTF8Encoding.UTF8.GetBytes(stringToEncrypt), true); Ahora estoy obteniendo el error: mala duración. Con una cuerda más pequeña funciona, cualquier idea de lo que podría ser el problema es que la cuerda que estoy pasando tiene menos de 200 caracteres.
Cómo almacenar / recuperar la clave pública / privada de RSA
Quiero usar el cifrado de clave pública RSA. ¿Cuál es la mejor manera de almacenar o recuperar claves privadas y públicas? ¿Es XML una buena idea aquí? ¿Cómo obtener las llaves? RSAParameters privateKey = RSA.ExportParameters(true); RSAParameters publicKey = RSA.ExportParameters(false); Porque los RSAParameters tienen los siguientes miembros: D, DP, DQ, Exponent, InverseQ, Modulus, P, Q ¿Cuál […]
C # RSA Public Key Output no es correcto
Actualmente estoy intentando generar y enviar una clave RSA pública usando C #. Debería ser una clave larga de 2048 bits en formato PEM. Lo he hecho con éxito utilizando el comando OpenSSL con lo siguiente (algunos resultados se acortan): $ openssl genrsa 2048 Generating RSA private key, 2048 bit long modulus ……………………………………………………+++ ……………………………………………………+++ e […]
convertir la clave OpenSSH rsa al formato compatible javax.crypto.Cipher
¿Hay alguna manera de convertir programáticamente las claves RSA RSH generadas por Jsch a un formato que javax.crypto.Cipher puede usar para el cifrado? En su mayoría he visto respuestas similares a esto : openssl pkcs8 -topk8 -inform PEM -outform DER -in private_key_file -nocrypt > pkcs8_key Pero no tengo acceso a los comandos de shell o […]
Cómo cargar la clave pública RSA desde el archivo en C #
Necesito cargar la siguiente clave pública RSA de un archivo para usar con la clase RSACryptoServiceProvider. ¿Cómo puedo hacer esto? —–BEGIN PUBLIC KEY—– XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX/syEKqEkMtQL0+d XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX+izR KbGMRtur2TYklnyVkjeeHfAggo8vWQmWesnOG55vQYHbOOFoJbk0EkwEr5R/PbKm byXPPN8zwnS5/XXXXXXXXXXXX —–END PUBLIC KEY—– Este código funciona con la clave de mi pub: http://www.jensign.com/opensslkey/ Aquí está el código que estoy usando static string RSA(string input) { RSACryptoServiceProvider rsa = […]
|
{
"url": "https://www.dokry.com/do/rsa",
"source_domain": "www.dokry.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "14338",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RUX6GYRSMEO5OKVAQHVKREECQATL6ZEO",
"WARC-Concurrent-To": "<urn:uuid:0e9a7973-79d4-40ab-a851-41f7e9e49cb6>",
"WARC-Date": "2021-10-23T15:17:06Z",
"WARC-IP-Address": "69.163.34.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZALS67OYMJYAVJ6IJKTSCTSWGMM63N6H",
"WARC-Record-ID": "<urn:uuid:422c5dad-538f-42a3-bd7d-94f6f54d3342>",
"WARC-Target-URI": "https://www.dokry.com/do/rsa",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:00402340-b1ce-4153-8365-1a6df3ccda08>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190\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,
16,
17,
99,
100,
252,
253,
306,
307,
622,
623,
678,
679,
942,
943,
1002,
1003,
1368,
1369,
1424,
1425,
1740,
1741,
1784,
1785,
2109,
2110,
2171,
2172,
2572,
2573,
2614,
2615,
2980,
2981,
3054,
3055,
3400,
3401,
3458,
3459
],
"line_end_idx": [
16,
17,
99,
100,
252,
253,
306,
307,
622,
623,
678,
679,
942,
943,
1002,
1003,
1368,
1369,
1424,
1425,
1740,
1741,
1784,
1785,
2109,
2110,
2171,
2172,
2572,
2573,
2614,
2615,
2980,
2981,
3054,
3055,
3400,
3401,
3458,
3459,
4039
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4039,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.000495170010253787,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06207827106118202,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07287448644638062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18758435547351837,
"rps_doc_frac_unique_words": 0.45945945382118225,
"rps_doc_mean_word_length": 5.609797477722168,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.0715249702334404,
"rps_doc_unigram_entropy": 5.1162872314453125,
"rps_doc_word_count": 592,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.043360430747270584,
"rps_doc_frac_chars_dupe_6grams": 0.02770249918103218,
"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.01686239056289196,
"rps_doc_frac_chars_top_3gram": 0.018066849559545517,
"rps_doc_frac_chars_top_4gram": 0.007226740010082722,
"rps_doc_books_importance": -330.0065612792969,
"rps_doc_books_importance_length_correction": -330.0065612792969,
"rps_doc_openwebtext_importance": -220.0048370361328,
"rps_doc_openwebtext_importance_length_correction": -220.0048370361328,
"rps_doc_wikipedia_importance": -158.9281463623047,
"rps_doc_wikipedia_importance_length_correction": -158.9281463623047
},
"fasttext": {
"dclm": 0.6482632160186768,
"english": 0.0037924000062048435,
"fineweb_edu_approx": 1.2474966049194336,
"eai_general_math": 0.0006286500138230622,
"eai_open_web_math": 0.23332124948501587,
"eai_web_code": 0.5818905830383301
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,041,876,913,767,118,000 |
Ask Ubuntu is a question and answer site for Ubuntu users and developers. It's 100% free.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
What does "Ubuntu" mean, and why did they choose that particular name?
share|improve this question
up vote 31 down vote accepted
The word of Ubuntu is very difficult to explain in one word in English. Some people say it means "humaness, to be human", some describe it as "Humanity in humility".
See the discussion in the ubuntu forum
Bishop Tutu has describe Ubuntu as:
A person with Ubuntu is open and available to others, affirming of others, does not feel threatened that others are able and good, for he or she has a proper self-assurance that comes from knowing that he or she belongs in a greater whole and is diminished when others are humiliated or diminished, when others are tortured or oppressed.
and
One of the sayings in our country is Ubuntu - the essence of being human. Ubuntu speaks particularly about the fact that you can't exist as a human being in isolation. It speaks about our interconnectedness. You can't be human all by yourself, and when you have this quality - Ubuntu - you are known for your generosity. We think of ourselves far too frequently as just individuals, separated from one another, whereas you are connected and what you do affects the whole world. When you do well, it spreads out; it is for the whole of humanity.
Nelson Mandela describes it as
A traveler through a country would stop at a village and he didn't have to ask for food or for water. Once he stops, the people give him food, entertain him. That is one aspect of Ubuntu but it will have various aspects. Ubuntu does not mean that people should not enrich themselves. The question therefore is: Are you going to do so in order to enable the community around you to be able to improve?
found in wikipedia
share|improve this answer
To quote the About Ubuntu page on the website:
ubuntu |oǒ'boǒntoō|
Ubuntu is an ancient African word meaning 'humanity to others'. It also means 'I am what I am because of who we all are'. The Ubuntu operating system brings the spirit of Ubuntu to the world of computers.
To quote Benjamin Mako Hill:
Ubuntu's original name was, and I'm serious, "no-name-yet.com"
Finally, Mark settled on the name Ubuntu which he though represented the spirit of sharing and cooperation that he found appealing in Free Software.
And finally, to quote Mark Shuttleworth himself in the Ubuntu 4.10 Warty Warthog announcement:
"Ubuntu" is an ancient African word for "humanity towards others", and we think it's a perfect name for an open source community project.
Hopefully, these quotes help clear up any confusion about the name, 'Ubuntu', that you might have had.
share|improve this answer
1
We called it $DISTRO for quite a while too ... I wonder if anyone has a picture of the whiteboard at the original London meeting that we covered with possible distribution and company names. – Colin Watson Apr 11 '11 at 9:49
When I started using Ubuntu I have also found this definition:
I am who I am, because of who we all are.
Slightly shorter than the previous answer ;-)
And the name was chosen by SABDFL.
share|improve this answer
Don't forget the humorous definition! :)
Ubuntu is an ancient African word that means "I can't configure Slackware"
share|improve this answer
9
No, "cannot configure Debian" is the generally-accepted humorous answer. – Dirk Eddelbuettel Aug 30 '10 at 2:18
1
Personally, I've heard vh1's version more. – ryanpcmcquen Jul 26 '13 at 23:11
The most awful answer on the Askubuntu. – ZDroid Feb 23 '14 at 11:34
This is funny, but not an answer. – Braiam Feb 28 '14 at 22:04
Ubuntu means: "A man can't be a man without the help of other men"
share|improve this answer
Our work is driven by a belief that software should be free and accessible to all.
We believe that every computer user:
Should have the freedom to download, run, copy, distribute, study, share, change and improve their software for any purpose, without paying licensing fees. Should be able to use their software in the language of their choice. Should be able to use all software regardless of disability. Our philosophy is reflected in the software we produce, the way we distribute it and our licensing terms, too - Ubuntu Licence Policy.
Install Ubuntu and you can rest assured that all our software meets these ideals. Plus, we are continually working to ensure that every piece of software you could possibly need is available under a licence that gives you those freedoms.
Free software
Ubuntu software is free. Always was, always will be. Free software gives everyone the freedom to use it however they want and share with whoever they like. This freedom has huge benefits. At one end of the spectrum it enables the Ubuntu community to grow and share its collective experience and expertise to continually improve all things Ubuntu. At the other, we are able to give access to essential software for those who couldn’t otherwise afford it – an advantage that’s keenly felt by individuals and organisations all over the world.
Quoting the Free Software Foundation's, 'What is Free Software,' the freedoms at the core of free software are defined as:
The freedom to run the program, for any purpose.
The freedom to study how the program works and adapt it to your needs. The freedom to redistribute copies so you can help others. The freedom to improve the program and release your improvements to the public, so that everyone benefits.
Open source
Open source is collective power in action. The power of a worldwide community of highly skilled experts that build, share and improve the very latest software together - then make it available to everyone.
The term open source was coined in 1998 to remove the ambiguity in the English word 'free' and it continues to enjoy growing success and wide recognition. Although some people regard ‘free’ and ‘open source' as competing movements with different ends, we do not. Ubuntu proudly includes members who identify with both.
http://www.ubuntu.com/project/about-ubuntu/our-philosophy
share|improve this answer
Ubuntu:
"I am Because we Are"
i also find it a great slogan for Ubuntu.
share|improve this answer
9gag
Source: A post from 9gag.com.
share|improve this answer
protected by Braiam Feb 28 '14 at 22:02
Thank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site.
Would you like to answer one of these unanswered questions instead?
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://askubuntu.com/questions/424/what-does-ubuntu-mean/425",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "99283",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6HBMS7K25L6IEVMLC2BYJYR5W6JFLZI",
"WARC-Concurrent-To": "<urn:uuid:6c5596b0-65aa-4f95-8012-3e92ba91bc6c>",
"WARC-Date": "2016-02-08T22:55:49Z",
"WARC-IP-Address": "104.16.111.188",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JGRZ5ODQ7QKZARZQPBNAO3JJBWO2LURZ",
"WARC-Record-ID": "<urn:uuid:6ad6c725-acee-44e3-a8d0-3af577461b32>",
"WARC-Target-URI": "http://askubuntu.com/questions/424/what-does-ubuntu-mean/425",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48a3135a-9875-4155-a353-5b3474e4d51a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
90,
91,
99,
120,
152,
176,
231,
232,
303,
304,
332,
337,
367,
368,
534,
535,
574,
575,
611,
612,
950,
951,
955,
956,
1501,
1502,
1533,
1534,
1935,
1936,
1955,
1956,
1982,
1983,
2030,
2031,
2051,
2052,
2257,
2258,
2287,
2288,
2351,
2352,
2501,
2502,
2597,
2598,
2736,
2737,
2840,
2841,
2867,
2871,
3096,
3097,
3160,
3161,
3203,
3204,
3250,
3251,
3286,
3287,
3313,
3314,
3355,
3356,
3431,
3432,
3458,
3462,
3574,
3578,
3656,
3661,
3730,
3735,
3798,
3799,
3866,
3867,
3893,
3894,
3977,
3978,
4015,
4016,
4438,
4439,
4677,
4678,
4692,
4693,
5233,
5234,
5357,
5358,
5407,
5408,
5645,
5646,
5658,
5659,
5865,
5866,
6185,
6186,
6244,
6245,
6271,
6272,
6280,
6281,
6303,
6304,
6346,
6347,
6373,
6374,
6379,
6380,
6410,
6411,
6437,
6438,
6478,
6479,
6661,
6662,
6730,
6731
],
"line_end_idx": [
90,
91,
99,
120,
152,
176,
231,
232,
303,
304,
332,
337,
367,
368,
534,
535,
574,
575,
611,
612,
950,
951,
955,
956,
1501,
1502,
1533,
1534,
1935,
1936,
1955,
1956,
1982,
1983,
2030,
2031,
2051,
2052,
2257,
2258,
2287,
2288,
2351,
2352,
2501,
2502,
2597,
2598,
2736,
2737,
2840,
2841,
2867,
2871,
3096,
3097,
3160,
3161,
3203,
3204,
3250,
3251,
3286,
3287,
3313,
3314,
3355,
3356,
3431,
3432,
3458,
3462,
3574,
3578,
3656,
3661,
3730,
3735,
3798,
3799,
3866,
3867,
3893,
3894,
3977,
3978,
4015,
4016,
4438,
4439,
4677,
4678,
4692,
4693,
5233,
5234,
5357,
5358,
5407,
5408,
5645,
5646,
5658,
5659,
5865,
5866,
6185,
6186,
6244,
6245,
6271,
6272,
6280,
6281,
6303,
6304,
6346,
6347,
6373,
6374,
6379,
6380,
6410,
6411,
6437,
6438,
6478,
6479,
6661,
6662,
6730,
6731,
6821
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6821,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43293115496635437,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012065289542078972,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18168914318084717,
"rps_doc_frac_unique_words": 0.3996509611606598,
"rps_doc_mean_word_length": 4.679755687713623,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.000709720014128834,
"rps_doc_unigram_entropy": 5.436663627624512,
"rps_doc_word_count": 1146,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.036173779517412186,
"rps_doc_frac_chars_dupe_6grams": 0.02424016036093235,
"rps_doc_frac_chars_dupe_7grams": 0.008577289991080761,
"rps_doc_frac_chars_dupe_8grams": 0.008577289991080761,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.026850640773773193,
"rps_doc_frac_chars_top_3gram": 0.032817449420690536,
"rps_doc_frac_chars_top_4gram": 0.009509599767625332,
"rps_doc_books_importance": -601.211181640625,
"rps_doc_books_importance_length_correction": -601.211181640625,
"rps_doc_openwebtext_importance": -380.9012451171875,
"rps_doc_openwebtext_importance_length_correction": -380.9012451171875,
"rps_doc_wikipedia_importance": -276.3412170410156,
"rps_doc_wikipedia_importance_length_correction": -276.3412170410156
},
"fasttext": {
"dclm": 0.1716296672821045,
"english": 0.9475589394569397,
"fineweb_edu_approx": 2.1884965896606445,
"eai_general_math": 0.014915590174496174,
"eai_open_web_math": 0.19884032011032104,
"eai_web_code": 0.0023418099153786898
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.092",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "306.3",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Culture"
}
}
},
"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": "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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.