id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
6,158,256,828,572,900,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
PerlMonks
Comment on
( #3333=superdoc: print w/ replies, xml ) Need Help??
I've had puzzlingly little luck finding this on my own, so I resort to the monastery...
I can't seem to find much existing code to build up data structures (rather than flat lists) from passed (GET/POST) CGI data. I know nobody wants to be seen holding up anything from That Other 'P' Web Language as an exemplar, but... well, there it is.
For a trivial example, going from an HTML form with data like:
<input type="text" name="foo{bar}" value="barval"> <input type="text" name="foo{baz}" value="bazval">
into something in perl like:
$foo = get_param('foo'); # $foo = { bar => 'barval', baz => 'bazval' }
CGI.pm and things roughly following its API provide ways (of greater or lesser convenience) of getting arrays of values. But finding something to build up hashes is an unrewarding search. The only thing I've managed to unearth is CGI::State, which is tightly tied to CGI.pm, is a little unsettling code- and known-limitation-wise, and has had 2 releases 3 days apart almost 10 years ago. Minor searching has turned up approximately 0 live uses of it. Doesn't encourage me to hitch my wagon to it...
Of course, I can just be the one that writes code to do it. I think highly enough of my ability for that. But I also think highly enough of Murphy that I'd rather not, and my Programmer's Laziness is in full-scale rebellion at the thought that this doesn't already exist. Surely I'm not actually just the second person in the last 15 years to want this?
In reply to Building data structures from CGI params by fullermd
Title:
Use: <p> text here (a paragraph) </p>
and: <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
• Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
• Read Where should I post X? if you're not absolutely sure you're posting in the right place.
• Please read these before you post! —
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
• Outside of code tags, you may need to use entities for some characters:
For: Use:
& &
< <
> >
[ [
] ]
• Link using PerlMonks shortcuts! What shortcuts can I use for linking?
• See Writeup Formatting Tips and other pages linked from there for more info.
• Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (7)
As of 2014-09-16 03:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My favorite cookbook is:
Results (155 votes), past polls
|
{
"url": "http://www.perlmonks.org/?parent=872768;node_id=3333",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "21971",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A3FD4HDNFAC7YINHGWBGCKSC6J5S3M2L",
"WARC-Concurrent-To": "<urn:uuid:8bb1976b-386d-4c7d-a204-46ead4a19d0f>",
"WARC-Date": "2014-09-16T03:20:36Z",
"WARC-IP-Address": "209.197.123.153",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BFHKBW5PI4NCY4BMR4XLF73LO5W3MCFC",
"WARC-Record-ID": "<urn:uuid:9e9655ec-187e-4dea-a966-2c6b088cf93e>",
"WARC-Target-URI": "http://www.perlmonks.org/?parent=872768;node_id=3333",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a4ed157f-b8cb-4555-96cb-77759b3c9669>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-196-40-205.us-west-1.compute.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,
63,
102,
104,
116,
117,
128,
129,
183,
184,
272,
273,
525,
526,
589,
590,
692,
693,
722,
723,
794,
795,
1294,
1295,
1649,
1650,
1651,
1716,
1717,
1724,
1763,
1794,
1847,
1848,
1849,
1850,
1973,
2070,
2111,
2171,
2437,
2513,
2539,
2551,
2562,
2573,
2585,
2597,
2671,
2752,
2764,
2778,
2792,
2793,
2817,
2839,
2855,
2896,
2897,
2939,
2956,
2995,
3026,
3040,
3057,
3073,
3088,
3108,
3109,
3140,
3141,
3142,
3143,
3144,
3145,
3146,
3147,
3148,
3149,
3150
],
"line_end_idx": [
63,
102,
104,
116,
117,
128,
129,
183,
184,
272,
273,
525,
526,
589,
590,
692,
693,
722,
723,
794,
795,
1294,
1295,
1649,
1650,
1651,
1716,
1717,
1724,
1763,
1794,
1847,
1848,
1849,
1850,
1973,
2070,
2111,
2171,
2437,
2513,
2539,
2551,
2562,
2573,
2585,
2597,
2671,
2752,
2764,
2778,
2792,
2793,
2817,
2839,
2855,
2896,
2897,
2939,
2956,
2995,
3026,
3040,
3057,
3073,
3088,
3108,
3109,
3140,
3141,
3142,
3143,
3144,
3145,
3146,
3147,
3148,
3149,
3150,
3187
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3187,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0.0018826499581336975,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28759893774986267,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03957784175872803,
"rps_doc_frac_lines_end_with_ellipsis": 0.03750000149011612,
"rps_doc_frac_no_alph_words": 0.31662270426750183,
"rps_doc_frac_unique_words": 0.6385068893432617,
"rps_doc_mean_word_length": 4.416502952575684,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.010554090142250061,
"rps_doc_unigram_entropy": 5.491471290588379,
"rps_doc_word_count": 509,
"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.008007120341062546,
"rps_doc_frac_chars_top_3gram": 0.008007120341062546,
"rps_doc_frac_chars_top_4gram": 0.016903910785913467,
"rps_doc_books_importance": -356.0710754394531,
"rps_doc_books_importance_length_correction": -356.0710754394531,
"rps_doc_openwebtext_importance": -202.5320281982422,
"rps_doc_openwebtext_importance_length_correction": -202.5320281982422,
"rps_doc_wikipedia_importance": -119.91268920898438,
"rps_doc_wikipedia_importance_length_correction": -119.91268920898438
},
"fasttext": {
"dclm": 0.025290850549936295,
"english": 0.8947111964225769,
"fineweb_edu_approx": 1.4362192153930664,
"eai_general_math": 0.022837279364466667,
"eai_open_web_math": 0.4555397629737854,
"eai_web_code": 0.0007184100104495883
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "6",
"label": "Indeterminate"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,248,995,290,966,877,000 |
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
I've made this little flag icon.
http://www.trjps.co.uk/image_store_old/estonia_flag.svg
When you mouseover, it lights up. When you click down it goes brighter (this is done by making an overlay gradient visible), and it moves a bit too.
Everything is controlled by a set of mouseon's, mouseouts's etc in the group tag
A problem occurs when the mouse is presses then moved. The second the pointer hits the overlay, a mouseup event occurs. The pointer has never left the group as the overlay is in the same group.
I even tried putting all the gradient stops in the group but without any change.
Am I overlooking something? Any help or hint is most appreciated.
Gaz
share|improve this question
up vote 0 down vote accepted
Perhaps it's a browser bug. A sudden mouse block of an element shouldn't trigger a mouseup if that element is a child of the event element and event propagation is allowed.
You can work around this by manipulating fill-opacity instead of visibility:
//remove .setAttribute('visiblity', ...)
onmousedown="getElementById('flash').setAttribute('fill-opacity',1)"
onmouseup="getElementById('flash').setAttribute('fill-opacity',0)"
And your #flash element...
<!--Removed visibility="hidden" added fill-opacity="1" and removed fill-opacity:0 from styles -->
<path
style="fill:url(#radialGradient3033);fill-rule:nonzero;stroke:#ffffff;stroke-width:1.2529794;stroke-opacity:0"
d="M 423.65326,432.06998 C 405.51096,436.96285 390.19952,445.00107 368.27826,447.66373 362.06308,452.02659 356.97847,456.99773 353.34076,462.22623 L 353.34076,496.06998 C 359.10138,502.25487 368.35017,506.24285 379.40326,507.60123 401.52711,502.8051 417.56662,493.26432 440.49701,490.66373 445.27742,487.01892 449.28524,482.98308 452.37201,478.78873 L 452.37201,443.19498 C 445.96886,436.83241 435.72653,432.94392 423.65326,432.06998 z"
id="flash"
inkscape:connector-curvature="0"
fill-opacity="1"
/>
share|improve this answer
Bonza! This works a treat. I tried Firefox and opera with the problem code and both behaved the same (not often the case for SVG in my experience). And I often avoided 'fill-opacity' in favor of 'visibility' for some strange reason. Lesson learned. Thank you. – GMcG Jul 18 '12 at 2:47
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/11515412/onmouseup-doesnt-like-being-in-group-with-a-gradient",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "76768",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FNNLVQZPOBBCKJ45BAME36V52HZ5XOUB",
"WARC-Concurrent-To": "<urn:uuid:14da28a6-eb78-4391-8904-b7cb13673e88>",
"WARC-Date": "2016-05-05T12:55:34Z",
"WARC-IP-Address": "104.16.36.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:L7ER3VQD7NZPMJIOU245UVN2QKQFYSRW",
"WARC-Record-ID": "<urn:uuid:a64595dd-4d84-4744-97b1-4628e16fbc4d>",
"WARC-Target-URI": "http://stackoverflow.com/questions/11515412/onmouseup-doesnt-like-being-in-group-with-a-gradient",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9f0463d0-bcfb-446a-8792-9011d8fa436e>"
},
"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,
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
312,
313,
369,
370,
519,
520,
601,
602,
796,
797,
878,
879,
945,
946,
950,
951,
979,
1008,
1009,
1182,
1183,
1260,
1261,
1306,
1378,
1448,
1449,
1476,
1477,
1575,
1581,
1697,
2139,
2155,
2193,
2215,
2219,
2245,
2250,
2536,
2537,
2549,
2550,
2552,
2560,
2561,
2639,
2640
],
"line_end_idx": [
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
312,
313,
369,
370,
519,
520,
601,
602,
796,
797,
878,
879,
945,
946,
950,
951,
979,
1008,
1009,
1182,
1183,
1260,
1261,
1306,
1378,
1448,
1449,
1476,
1477,
1575,
1581,
1697,
2139,
2155,
2193,
2215,
2219,
2245,
2250,
2536,
2537,
2549,
2550,
2552,
2560,
2561,
2639,
2640,
2730
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2730,
"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.22580644488334656,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021505380049347878,
"rps_doc_frac_lines_end_with_ellipsis": 0.01694915071129799,
"rps_doc_frac_no_alph_words": 0.44086021184921265,
"rps_doc_frac_unique_words": 0.6213873028755188,
"rps_doc_mean_word_length": 6.0260114669799805,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0.007680490147322416,
"rps_doc_unigram_entropy": 5.063510417938232,
"rps_doc_word_count": 346,
"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.007194240111857653,
"rps_doc_frac_chars_top_3gram": 0.009592330083251,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -316.8844299316406,
"rps_doc_books_importance_length_correction": -316.8844299316406,
"rps_doc_openwebtext_importance": -172.84788513183594,
"rps_doc_openwebtext_importance_length_correction": -172.84788513183594,
"rps_doc_wikipedia_importance": -119.21820831298828,
"rps_doc_wikipedia_importance_length_correction": -119.21820831298828
},
"fasttext": {
"dclm": 0.11055248975753784,
"english": 0.8329548239707947,
"fineweb_edu_approx": 1.606355905532837,
"eai_general_math": 0.00009239000064553693,
"eai_open_web_math": 0.11972790956497192,
"eai_web_code": 0.000010490000022400636
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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
|
-3,763,179,716,942,003,700 |
NerdKits - electronics education for a digital generation
You are not logged in. [log in]
NEW: Learning electronics? Ask your questions on the new Electronics Questions & Answers site hosted by CircuitLab.
Microcontroller Programming » Generating Polyphony with Square Waves
February 05, 2011
by Slash_Fury
Slash_Fury's Avatar
First off: I'm really enjoying my Nerd Kit! I've gone through each of the projects when I received it for Christmas and I'm having a blast playing around with it.
On to my project. After going through the "Making Music" tutorial, I wanted to learn how to do so utilizing PWM and interrupts. As of now, I'm able to generate a square wave, change its duty cycle, length, and pitch. Using PROGMEM, I can store the notes, but ultimately, I want to use a controller (in this case, I've experimented with getting inputs from an SNES controller) to play various notes. I've even set up a simple low-pass filter. I know it's strange, but my audio samples at 78125Hz (uC is at 20Mhz). For the most part, this all works just fine.
The trouble I'm having is that I would like to be able to play two (or more) notes at once. I've been scouring the internet for information, but I'm finding little about actually implementing such a system (and the math required). I understand it has to do with adding the waves together, which affects the amplitude, but beyond that, I don't have a very good idea of what I can do to make that happen. If anyone had general advice, I would be quite grateful!
February 05, 2011
by mongo
mongo's Avatar
A long time ago, I did a program for an Apple IIc that simulated multiple notes like chords. What it did, was play each note of a chord in succession and rapidly repeat for the length of the note.
Post a Reply
Please log in to post a reply.
Did you know that Pulse Width Modulation (PWM) can be used to control the speed of a motor digitally? Learn more...
|
{
"url": "http://www.nerdkits.com/forum/thread/1319/",
"source_domain": "www.nerdkits.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "15964",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JAHYZPAQUQYC4LEY2TQVWAGBR7FNBQ7Q",
"WARC-Concurrent-To": "<urn:uuid:36bc1b33-fe7d-4a80-9388-d4d1e83385df>",
"WARC-Date": "2017-11-21T02:48:14Z",
"WARC-IP-Address": "207.192.74.218",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:U4N2FYLPV6V76GP4SAWLXI2YANYIJKGT",
"WARC-Record-ID": "<urn:uuid:02a8fe1c-4d49-45f6-8bb1-6c2d8aed674d>",
"WARC-Target-URI": "http://www.nerdkits.com/forum/thread/1319/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b2001f22-d387-4791-85e5-a0c0e55883dc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-65-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
58,
59,
91,
92,
208,
209,
278,
279,
297,
311,
331,
332,
495,
496,
1054,
1055,
1515,
1516,
1534,
1543,
1558,
1559,
1756,
1757,
1770,
1771,
1802,
1803
],
"line_end_idx": [
58,
59,
91,
92,
208,
209,
278,
279,
297,
311,
331,
332,
495,
496,
1054,
1055,
1515,
1516,
1534,
1543,
1558,
1559,
1756,
1757,
1770,
1771,
1802,
1803,
1918
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1918,
"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.40566039085388184,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.061320748180150986,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.17924527823925018,
"rps_doc_frac_unique_words": 0.6017699241638184,
"rps_doc_mean_word_length": 4.392330169677734,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.002358489902690053,
"rps_doc_unigram_entropy": 5.0090742111206055,
"rps_doc_word_count": 339,
"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.0067159198224544525,
"rps_doc_frac_chars_top_3gram": 0.01880457065999508,
"rps_doc_frac_chars_top_4gram": 0.021490929648280144,
"rps_doc_books_importance": -184.8038787841797,
"rps_doc_books_importance_length_correction": -184.8038787841797,
"rps_doc_openwebtext_importance": -95.29348754882812,
"rps_doc_openwebtext_importance_length_correction": -95.29348754882812,
"rps_doc_wikipedia_importance": -50.8948974609375,
"rps_doc_wikipedia_importance_length_correction": -50.8948974609375
},
"fasttext": {
"dclm": 0.047991931438446045,
"english": 0.9662663340568542,
"fineweb_edu_approx": 1.6745728254318237,
"eai_general_math": 0.3332797884941101,
"eai_open_web_math": 0.20169752836227417,
"eai_web_code": 0.05088121071457863
}
}
|
{
"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": "781.5",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"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": "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
|
-1,821,890,013,506,177,000 |
Veröffentlicht: 13.03.2018
Blocknet Coin
Blocknet Coin and Blocknet Technology
Blocknet Coin is based on XBridge, the first peer-to-peer protocol that nodes from different blockchains can interact with. This is an open source platform that is implemented into every application that uses Blocknet technology.
It allows you to connect a number of open services, both decentralized and centralized. Blocknet Coin is a revolutionary innovation in cryptography technology: a peer-to-peer protocol that connects nodes of different blockchains.
In general, Blocknet is a protocol that links multiple Altcoins together. In fact, it is a decentralized exchange provider that supports the exchange of coins represented within the system.
How Blocknet Works
Imagine your phone has an application that is Blocknet-enabled. This can be a general application, such as a browser, or a single-purpose application, such as an NFC payment app.
Your application connects directly to other applications on your phones and other computers. You can provide different services, depending on which Blockchain they are connected to.
Your application is also in a blockchain, and it automatically transfers that microservice to applications in another blockchain.
You use the application because you want to use a traditional application, with the exception that no central object has your data and there are no servers to crack.
The network infrastructure is financed by the users, and the cryptography is very, very strong. This is the internet as we’ve always wanted it.
The Blocknet Fund
Blocknet Coin is based on XBridge, the first peer-to-peer protocol that allows communication between nodes in different blockchains. It is open source and Blocknet support is implemented into every application.
This is the property that connects a number of open services, both decentralized and centralized.
Currently, XBridge is being developed; inter-node communication has been successfully installed and the decentralized exchange of digital tokens is currently being tested.
Once completed, it will be an important part of the Blocknet application platform. It will quickly and significantly simplify the development of decentralized applications.
The Platform
Blocknet Coin (BLOCK) is a blockchain-neutral distributed platform-as-a-service (PaaS).
It offers a revolutionary enhancement of cryptographic technology; a true peer-to-peer protocol that connects nodes with different blockchains.
This is the basis of a technology package that includes an API and an application platform. It provides the environment for unlimited application capabilities and significantly reduces development time.
Blockchains Change the Rules of the Game
They allow you to apply a distributed consensus to almost anything. They enable the security and stability of a new generation network.
Blockchains are an order of magnitude that can be more efficient than traditional infrastructure projects. In short, blockchains are a revolutionary technology.
The focus is on the integration of blockchains into the network, although no blockchains can handle the burden of preserving and maintaining the data of humanity.
There is already a wide range of technologies on separate, isolated blockchains. Together, they can realize the extremely groundbreaking strength of a decentralized internet – if you let them work together.
Algorithm
Cryptocurrency projects will see a significant increase in user base and potential profit by joining Blocknet. Their technologies as services can work in any other blockchain or traditional network.
Blocknet Coin has no central or base currency and, therefore, is an open Interteam infrastructure that can be spread as widely as the internet itself.
Blockchains have revolutionary potential, but if this potential is to be realized, they’ll need three main features: interoperability, mobility, and modularity.
Interoperability
There will never be just a blockchain. Without the interoperability between blockchains, they remain in a state similar to that of a local computer network that is disconnected from the internet.
The blockchains should exist in a common space. Blocknet Coin offers this space.
Mobility
Blockchains increase in size indefinitely, which is why the most popular of blockchains have a limited lifecycle of prevalent mobile usage.
Your storage requirements will inevitably become too high for premium mobile devices. One simple solution is that large blockchains provide their services to mobile applications that use small blockchains.
Modularity
Data on the blockchain cannot be deleted, but most of it quickly loses relevance or usefulness. To avoid having to append terabytes of obsolete data, you should store different types of data in different blockchains.
They can then be archived, copied, or replaced without affecting other data. In the design of blockchain, Blocknet supports the microservice approach.
With Blocknet, you can provide a multi-blockchain service for devices that contain only a blockchain. This preserves your device and network resources, and it enables a flexible, mobile, and infinitely expandable future.
An Example
Imagine you have an application on your phone that’s supported by Blocknet. This can either be a general application, such as a browser, or a special application, such as an application for NFC payments.
Your application connects directly to other applications on phones or computers that can provide different services, depending on which entity they are on.
Your application is also on a particular blockchain that automatically sends a particular microservice to applications in a different blockchain.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.coin-report.net/en/blocknet-coin/",
"source_domain": "www.coin-report.net",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "32101",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3PGMJEYTKAS4MJVUU2B4CHMF3MMD3LWN",
"WARC-Concurrent-To": "<urn:uuid:70ea55a4-ef14-4259-9bfc-ec3ba0977710>",
"WARC-Date": "2019-09-17T14:13:59Z",
"WARC-IP-Address": "178.254.62.241",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UTIKK6O522CPWOPQWIHYQFFR2ZTZB6YW",
"WARC-Record-ID": "<urn:uuid:749efc87-0d3d-474e-9f31-7d91a07a103a>",
"WARC-Target-URI": "https://www.coin-report.net/en/blocknet-coin/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5817c29e-b872-46e4-94e3-179300e27bb4>"
},
"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-156.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,
27,
28,
42,
43,
81,
82,
312,
313,
543,
544,
734,
735,
754,
755,
934,
935,
1117,
1118,
1248,
1249,
1415,
1416,
1560,
1561,
1579,
1580,
1791,
1792,
1890,
1891,
2063,
2064,
2237,
2238,
2251,
2252,
2340,
2341,
2485,
2486,
2689,
2690,
2731,
2732,
2868,
2869,
3030,
3031,
3194,
3195,
3402,
3403,
3413,
3414,
3613,
3614,
3765,
3766,
3927,
3928,
3945,
3946,
4142,
4143,
4224,
4225,
4234,
4235,
4375,
4376,
4582,
4583,
4594,
4595,
4812,
4813,
4964,
4965,
5186,
5187,
5198,
5199,
5403,
5404,
5560,
5561,
5707,
5708,
5722,
5723
],
"line_end_idx": [
27,
28,
42,
43,
81,
82,
312,
313,
543,
544,
734,
735,
754,
755,
934,
935,
1117,
1118,
1248,
1249,
1415,
1416,
1560,
1561,
1579,
1580,
1791,
1792,
1890,
1891,
2063,
2064,
2237,
2238,
2251,
2252,
2340,
2341,
2485,
2486,
2689,
2690,
2731,
2732,
2868,
2869,
3030,
3031,
3194,
3195,
3402,
3403,
3413,
3414,
3613,
3614,
3765,
3766,
3927,
3928,
3945,
3946,
4142,
4143,
4224,
4225,
4234,
4235,
4375,
4376,
4582,
4583,
4594,
4595,
4812,
4813,
4964,
4965,
5186,
5187,
5198,
5199,
5403,
5404,
5560,
5561,
5707,
5708,
5722,
5723,
5793
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5793,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40986907482147217,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004028200171887875,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12890231609344482,
"rps_doc_frac_unique_words": 0.3761792480945587,
"rps_doc_mean_word_length": 5.635613441467285,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0982794761657715,
"rps_doc_word_count": 848,
"rps_doc_frac_chars_dupe_10grams": 0.04017576947808266,
"rps_doc_frac_chars_dupe_5grams": 0.13015274703502655,
"rps_doc_frac_chars_dupe_6grams": 0.10169491916894913,
"rps_doc_frac_chars_dupe_7grams": 0.10169491916894913,
"rps_doc_frac_chars_dupe_8grams": 0.08369951695203781,
"rps_doc_frac_chars_dupe_9grams": 0.061937641352415085,
"rps_doc_frac_chars_top_2gram": 0.02008787915110588,
"rps_doc_frac_chars_top_3gram": 0.018413890153169632,
"rps_doc_frac_chars_top_4gram": 0.007951449602842331,
"rps_doc_books_importance": -419.1712341308594,
"rps_doc_books_importance_length_correction": -419.1712341308594,
"rps_doc_openwebtext_importance": -269.7142639160156,
"rps_doc_openwebtext_importance_length_correction": -269.7142639160156,
"rps_doc_wikipedia_importance": -269.9481201171875,
"rps_doc_wikipedia_importance_length_correction": -269.9481201171875
},
"fasttext": {
"dclm": 0.6710973381996155,
"english": 0.9281883239746094,
"fineweb_edu_approx": 2.382876396179199,
"eai_general_math": 0.09228069335222244,
"eai_open_web_math": 0.2683582901954651,
"eai_web_code": 0.04274814948439598
}
}
|
{
"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": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,909,037,983,554,122,800 |
Fri Sep 16 11:32:27 2005 Handed out Newtons and Palms to play with intro to Palm OS Newton history persistent database store Graffiti vs. HW recognition Zen of Palm sweet spot Windows CE is bad Palm is good Give users exactly what they need, done well, no more no less versions of the Palm OS: v1 - v4: based on Motorola 68000 "dragonball" big-endian data format Garnet: based on ARM processor includes compatibility layer for 68k apps ("PACE") emulates 68k processor, but most of apps are making calls into Palm OS APIs, which are native ARM code can compile apps with "PNO" (PACE Native objects); then your code runs as native ARM Cobalt: big, complex not shipping Application 4-char signatures Resources
|
{
"url": "https://www.cs.uml.edu/~fredm/courses/91.308-fall05/files/lecture-05.txt",
"source_domain": "www.cs.uml.edu",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "1068",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKV6HDGFR5LT4YBMMOXGGQYZATGOJGWL",
"WARC-Concurrent-To": "<urn:uuid:901234e2-7b28-4054-8121-327fd12ab3d4>",
"WARC-Date": "2022-05-28T23:04:38Z",
"WARC-IP-Address": "146.189.182.50",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:DKFJHNLJIPUZ55TY54BHZHCQBNW2POPJ",
"WARC-Record-ID": "<urn:uuid:0c64c425-0078-479b-84c2-74c0e4766c0e>",
"WARC-Target-URI": "https://www.cs.uml.edu/~fredm/courses/91.308-fall05/files/lecture-05.txt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c166b21-6b60-4b20-9c10-1fd26dff78cc>"
},
"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-252\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
706
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 706,
"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.25170066952705383,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07482992857694626,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20408162474632263,
"rps_doc_frac_unique_words": 0.7916666865348816,
"rps_doc_mean_word_length": 4.666666507720947,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.456028461456299,
"rps_doc_word_count": 120,
"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.03214285895228386,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -61.79465866088867,
"rps_doc_books_importance_length_correction": -62.64505386352539,
"rps_doc_openwebtext_importance": -25.33788299560547,
"rps_doc_openwebtext_importance_length_correction": -26.188274383544922,
"rps_doc_wikipedia_importance": -25.589468002319336,
"rps_doc_wikipedia_importance_length_correction": -26.439861297607422
},
"fasttext": {
"dclm": 0.019524160772562027,
"english": 0.870563268661499,
"fineweb_edu_approx": 2.816657781600952,
"eai_general_math": 0.011464419774711132,
"eai_open_web_math": 0.012297569774091244,
"eai_web_code": 0.03885912895202637
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,199,931,430,964,757,000 |
View the parallel-processing badge on Stack Overflow website
Description
Earn at least 100 total score for at least 20 non-community wiki answers in the tag
Rank
(bronze)
Type
tagbased
Awarded
44 × times
Score
758
Calculation
((1 - log(44, 6034845)) × 999) + 1 = 758
Users
User account User score User reputation Awarded
Jon Skeet Jon Skeet 3233048 (1401321) 1
Marc Gravell Marc Gravell 1192788 (1058646) 1
Hans Passant Hans Passant 783884 (895185) 1
|
{
"url": "https://truebadges.com/sites/stackoverflow/badges/1921/",
"source_domain": "truebadges.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "6687",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZSWD3RWQJAIRLSVEA23RLPSJOLMC7OS7",
"WARC-Concurrent-To": "<urn:uuid:60f0e0aa-f9b7-4850-88dd-23ea6d3d1e33>",
"WARC-Date": "2021-10-22T19:30:36Z",
"WARC-IP-Address": "213.186.33.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PSRLLO4I4ADWEFCNRYDLUCUQOLDCFQ3U",
"WARC-Record-ID": "<urn:uuid:a78aaeba-7bce-4a15-8794-553e9a644173>",
"WARC-Target-URI": "https://truebadges.com/sites/stackoverflow/badges/1921/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d6d50172-8b52-4d9d-812b-f24447c392ad>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
61,
62,
74,
158,
163,
172,
177,
186,
194,
205,
211,
215,
227,
268,
274,
322,
362,
408
],
"line_end_idx": [
61,
62,
74,
158,
163,
172,
177,
186,
194,
205,
211,
215,
227,
268,
274,
322,
362,
408,
451
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 451,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10752688348293304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4193548262119293,
"rps_doc_frac_unique_words": 0.7222222089767456,
"rps_doc_mean_word_length": 4.94444465637207,
"rps_doc_num_sentences": 1,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.842299461364746,
"rps_doc_word_count": 72,
"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.03932584077119827,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -48.31084060668945,
"rps_doc_books_importance_length_correction": -49.01361846923828,
"rps_doc_openwebtext_importance": -24.95565414428711,
"rps_doc_openwebtext_importance_length_correction": -25.658430099487305,
"rps_doc_wikipedia_importance": -27.304866790771484,
"rps_doc_wikipedia_importance_length_correction": -28.007644653320312
},
"fasttext": {
"dclm": 0.060801681131124496,
"english": 0.6591210961341858,
"fineweb_edu_approx": 0.8572742342948914,
"eai_general_math": 0.0000021500000002561137,
"eai_open_web_math": 0.0523681603372097,
"eai_web_code": 0.0008399499929510057
}
}
|
{
"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": "1",
"label": "Factual"
},
"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": "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
|
8,697,888,785,788,447,000 |
2
Any idea? There is no box for my password and I get HTTP-Error 8 (Message Corrupt). I used https://mysite.com/owncloud/remote.php/caldav/ and as username [email protected].
1
You will be asked for password while connecting to the caldav, and you can store the passwd for later.
Try to use username without "@mysite.com", it should work (it did for me).
BR,
m.
1
I know it is an old thread but for someone who is looking for more answers as I did: I have self hosting Nextcloud instance on Apache using Raspberry Pi 3 and I have generated self-signed certificate for it. The eOS calendar refused to connect at all. I had to generate the certificate through Let’s Encrypt and now it’s working flawlessly.
0
But as far as I know you have to add each individual calender separately. In OwnCloud / NextCloud each individual calendar has a link button, maybe behind a submenu (3 dots). The link that appears is the link you use as URL. Then when you also include the correct username and press Create calendar it should ask for your password.
I'm sure I've read this on a OwnCloud page somewhere, but couldn't find it anymore.
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://elementaryos.stackexchange.com/questions/2097/how-do-i-use-my-owncloud-caldav-with-the-calendar-application",
"source_domain": "elementaryos.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "140139",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5JCOO44KOCFQZLNJJZHYG4ZYSHQWI3AM",
"WARC-Concurrent-To": "<urn:uuid:d7485b7c-05b8-47d7-86e7-269ce1b6ce5a>",
"WARC-Date": "2020-01-20T01:00:05Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VSXFK6O53UQOMIALXB6SD7MGVXUDPANX",
"WARC-Record-ID": "<urn:uuid:513b1dbe-8dda-4dc8-b75f-0d3582ab3848>",
"WARC-Target-URI": "https://elementaryos.stackexchange.com/questions/2097/how-do-i-use-my-owncloud-caldav-with-the-calendar-application",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b872db4f-ee6b-4940-9b1e-c4bcf73efba7>"
},
"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-245.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
172,
173,
175,
176,
279,
354,
355,
359,
362,
363,
365,
366,
707,
708,
710,
711,
1043,
1044,
1128,
1129,
1141,
1142,
1242,
1243
],
"line_end_idx": [
2,
3,
172,
173,
175,
176,
279,
354,
355,
359,
362,
363,
365,
366,
707,
708,
710,
711,
1043,
1044,
1128,
1129,
1141,
1142,
1242,
1243,
1333
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1333,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4237288236618042,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04406780004501343,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18644067645072937,
"rps_doc_frac_unique_words": 0.6391304135322571,
"rps_doc_mean_word_length": 4.517391204833984,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.728043556213379,
"rps_doc_word_count": 230,
"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.007699709851294756,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -147.45358276367188,
"rps_doc_books_importance_length_correction": -147.45358276367188,
"rps_doc_openwebtext_importance": -83.91293334960938,
"rps_doc_openwebtext_importance_length_correction": -83.91293334960938,
"rps_doc_wikipedia_importance": -62.757076263427734,
"rps_doc_wikipedia_importance_length_correction": -62.755157470703125
},
"fasttext": {
"dclm": 0.3330509662628174,
"english": 0.9492406845092773,
"fineweb_edu_approx": 1.1902201175689697,
"eai_general_math": 0.000030040000638109632,
"eai_open_web_math": 0.05500692129135132,
"eai_web_code": -0.0000013100000160193304
}
}
|
{
"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.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,940,165,135,133,561,900 |
About Fractals
What are Fractals?
Fractals, as defined by Hans Lauwereier, are geometrical figures 'in which an identical motif repeats itself on an ever diminishing scale'. The term for such repetition is iteration, and these iterations can be used to make models of any natural object, be it a fern or a galaxy.
Inherent in these fractals is the similarity of the original shape in such an ever-diminishing scale. The common example of such a concept is a tree with a trunk which divides into two branches, which divide into two branches, and so on. Note, however, the word similarity, for none of the iterations of the original shape are ever precisely the same. The end result of the concept is of a tree fractal with an infinite number of branches, which can be regarded as whole trees in themselves.
Applications of Fractals
Fractals can now be applied to many areas where complex calculations that rely on chaos theory are needed. Areas such as weather forecasting, image enhancing, summarising data, and, of course, making beautiful pictures, benefit from the application of fractal equations.
Fractal Mountains
Fractal mountains can be one of the most beautiful computer-generated applications of fractals. The equations used to produce the mountains create startlingly life-like(!) representations of mountains, with jags, peaks, and many other features.
There are undoubtedly many ways to construct fractal mountains, but the method we chose is explained below.
The fractal mountains are created by beginning with a single large triangle, then subdividing that into smaller triangles so you now have 4 small triangles, then subdividing those triangles, ad infinitum.
To make these subdivisions, we created an array of points from all the points where lines cross, and created a new point from the middle of each line. We then drew a line from each point to the next point above and to the right, to the next point directly to the right, and to the next point below and to the right, thus creating new triangles. Obviously, exceptions were made for points on the edges of the triangle.
The method above creates 'flat' mountains. To create mountains which attract more attention to the eye, vary the y co-ordinates of each point up or down by a random amount. A large random range will create a very ragged mountain. The random range must be halved every subdivision so as not to create undue raggedness, otherwise the result would look rather 'interesting' (i.e.: not look at all like a mountain!)
Home
Animations - Information - Source
|
{
"url": "http://library.thinkquest.org/12631/info/fractals.htm",
"source_domain": "library.thinkquest.org",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "4289",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L66VA2D3SVRE7QMJ7T7U263RF25G624G",
"WARC-Concurrent-To": "<urn:uuid:f6464abb-6dd2-4515-9d5f-2dd061bb36d0>",
"WARC-Date": "2013-05-23T13:50:48Z",
"WARC-IP-Address": "141.146.8.165",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JDJB2XDLXZQTTFYXZWTUOZEWB33GKK6R",
"WARC-Record-ID": "<urn:uuid:4b29cb5b-d2b0-4c27-93ce-f921355f56b6>",
"WARC-Target-URI": "http://library.thinkquest.org/12631/info/fractals.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9cb61a8-11cd-42d5-b53b-fee83e544cba>"
},
"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,
16,
17,
36,
37,
317,
318,
810,
811,
812,
837,
838,
1109,
1110,
1111,
1129,
1130,
1375,
1376,
1484,
1485,
1690,
1691,
2109,
2110,
2522,
2523,
2524,
2529,
2530
],
"line_end_idx": [
15,
16,
17,
36,
37,
317,
318,
810,
811,
812,
837,
838,
1109,
1110,
1111,
1129,
1130,
1375,
1376,
1484,
1485,
1690,
1691,
2109,
2110,
2522,
2523,
2524,
2529,
2530,
2563
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2563,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4571428596973419,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002040819963440299,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13673469424247742,
"rps_doc_frac_unique_words": 0.48926013708114624,
"rps_doc_mean_word_length": 4.904534816741943,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8734331130981445,
"rps_doc_word_count": 419,
"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.017031630501151085,
"rps_doc_frac_chars_top_3gram": 0.013138690032064915,
"rps_doc_frac_chars_top_4gram": 0.02043795958161354,
"rps_doc_books_importance": -201.47549438476562,
"rps_doc_books_importance_length_correction": -201.47549438476562,
"rps_doc_openwebtext_importance": -127.22372436523438,
"rps_doc_openwebtext_importance_length_correction": -127.22372436523438,
"rps_doc_wikipedia_importance": -133.15139770507812,
"rps_doc_wikipedia_importance_length_correction": -133.15139770507812
},
"fasttext": {
"dclm": 0.07227742671966553,
"english": 0.936776876449585,
"fineweb_edu_approx": 3.031506299972534,
"eai_general_math": 0.9801920652389526,
"eai_open_web_math": 0.4276040196418762,
"eai_web_code": 0.48356592655181885
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "514.01",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Trigonometry and Topology"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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
|
8,912,514,168,558,226,000 |
Saturday, July 18, 2009
Twitter: over-hyped, information poor, time sponge
I don't get Twitter.
I check once a day more or less. I get hundreds of tweets and I'm only following 50 or so people. Most of it is drivel: replies @somebody who I don't know in response to some tweet I did not see - like hearing only one half of a telephone conversation. Or it is out and out marketing puff dangerously close to spam. Why waste my time sifting through all that dross in order to find the occasional nugget.
I have enough trouble processing my inbox at home and at work and catching up on my Facebook notifications and writing my blog and living my life without allocating more of my scare time to Twitter.
Don't these Twitterers have a life or a job? Unless you are a professional communicator when do these people find the time? Are these people surfing at work? I have a job, stuff to do, I have a life, places to go, a home, chores to do. Something has got to be good to claim some of my precious time and Twitter is not that.
Who are my followers and why are they following me? Till now couple of friends but mostly me doing reciprocal follows. Have they picked up on my witty banter, my contribution to #fqf and #jazzfest? No it looks like they are searching Twitter for certain key words and stalking me as marketing fodder. Looks like spambot work to me. I have now started un-following.
And what is it with all this talk of "promoting your personal brand"? What kind of marketing b*ll**ks is that. I am not a commodity like a packet of soap powder. There seem to be a lot of people out there who think that Twitter is there solely as some kind of monetisable sales channel. Go away you people, I do not want to be CRM-ed.
No, I really don't get Twitter.
4 comments:
Stuffy said...
well thanks mate ... :(
Stuffy said...
I have responded to this post on Twitter, only joking, I suspect it may be an appropriate audience thing, wrote a piece about it here, http://tinyurl.com/lx7fpq
I'd appreciate your view Mark
Mark McLellan said...
Stuffy
But you are one of those nuggets :-)
Mark
Stuffy said...
Thankee :)
|
{
"url": "http://blog.mmenterprises.co.uk/2009/07/twitter-over-hyped-information-poor.htm",
"source_domain": "blog.mmenterprises.co.uk",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "120515",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QBOBS7ZMEDUZ6ENXWPZYN35UHPJ2XPT5",
"WARC-Concurrent-To": "<urn:uuid:6f7624eb-15a7-42f5-8cb7-b15a1e02c6e6>",
"WARC-Date": "2020-04-04T05:10:07Z",
"WARC-IP-Address": "172.217.12.243",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:G2MCSRLNESHQBLT2CMK6HOATDF46Y2FH",
"WARC-Record-ID": "<urn:uuid:e355157c-65e2-46cd-84b3-b546b481f1e7>",
"WARC-Target-URI": "http://blog.mmenterprises.co.uk/2009/07/twitter-over-hyped-information-poor.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:578dd98b-0185-4962-8a4a-224f0feca83b>"
},
"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-136.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,
24,
25,
76,
77,
98,
99,
504,
505,
704,
705,
1029,
1030,
1395,
1396,
1731,
1732,
1764,
1765,
1777,
1778,
1793,
1794,
1818,
1819,
1834,
1835,
1996,
2026,
2027,
2049,
2050,
2057,
2058,
2095,
2096,
2101,
2102,
2117,
2118,
2129,
2130
],
"line_end_idx": [
24,
25,
76,
77,
98,
99,
504,
505,
704,
705,
1029,
1030,
1395,
1396,
1731,
1732,
1764,
1765,
1777,
1778,
1793,
1794,
1818,
1819,
1834,
1835,
1996,
2026,
2027,
2049,
2050,
2057,
2058,
2095,
2096,
2101,
2102,
2117,
2118,
2129,
2130,
2131
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2131,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4594016969203949,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036324791610240936,
"rps_doc_frac_lines_end_with_ellipsis": 0.095238097012043,
"rps_doc_frac_no_alph_words": 0.15811966359615326,
"rps_doc_frac_unique_words": 0.5208333134651184,
"rps_doc_mean_word_length": 4.252604007720947,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.014957260340452194,
"rps_doc_unigram_entropy": 4.920594215393066,
"rps_doc_word_count": 384,
"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.015309249982237816,
"rps_doc_frac_chars_top_3gram": 0.017146360129117966,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -251.35931396484375,
"rps_doc_books_importance_length_correction": -251.35931396484375,
"rps_doc_openwebtext_importance": -103.72307586669922,
"rps_doc_openwebtext_importance_length_correction": -103.72307586669922,
"rps_doc_wikipedia_importance": -112.24413299560547,
"rps_doc_wikipedia_importance_length_correction": -112.24413299560547
},
"fasttext": {
"dclm": 0.06386076658964157,
"english": 0.9625963568687439,
"fineweb_edu_approx": 0.8046930432319641,
"eai_general_math": 0.013804379850625992,
"eai_open_web_math": 0.1110280230641365,
"eai_web_code": 0.0015835199737921357
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.401",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"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": "2",
"label": "Click Here References"
}
},
"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": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,311,593,582,001,606,000 |
Friday, March 14, 2014
Making Life Easier with an Online File Converter
As the pace of technological advancement speeds up, more unknown and rarely used file formats seem to haunt computer users. Nothing is more frustrating than just having finished a download to find that you need a specific type of software to open the file. File type is typically denoted by the characters after the file name. According to About.com, "A file extension is the last three or four characters after the period that make up an entire file name. The file extension helps the operating system determine which program on your computer the file is associated with." By learning more about utilizing an online file converter, avoiding such issues should be achievable.
Choose A Quality Conversion Service
Nothing is worse than going through the process to convert a file only to find that parts are converted incorrectly or that some information is missing entirely. Although finding such a service may take some trial and error, it is typically possible to investigate reviews, how long the website has been operational and the number of file conversion options that are available. Avoid low quality services that may require you to complete an offer or install specific software on your computer, as this may result in malware or even identity theft.
Look for Speed and File Size Capacity
In most instances users turn to an online file converter because it is typically the quickest and easiest option for file conversion. However, a low conversion speed negates the convenience. Although the conversion speed will depend on the size and type of file, aim for a service that can accommodate your needs in a reasonable amount of time. Some conversion services also have a file size limit, which can make it impossible to convert some of your larger files.
Take the time to contact us at Convert-doc.com if you have any questions about making your life easier with an online file converter.
Friday, March 7, 2014
Tips for Learning How to Convert Files Docx
In the modern technological world, nothing is more of an inconvenience than having to convert files on your computer. Nothing is more frustrating than the dialog box that asks you what program you would like to open a file, especially when you are in the midst of missing a deadline. One common culprit in the world of technological file conversion frustration is docx. Docx was implemented after Microsoft Word 2007 as a replacement to the typical doc word format. According to About.com, "Sometimes you find yourself with a file in a format that no program on your computer supports. When this happens you usually have two options. You can either purchase the program that opens the file or you can use free file converter software to convert the file to a format that some program on your computer actually does support. It's a common problem especially among movie, music, and photo/graphics files. "By learning more about how to convert files docx, eliminating this frustration from your life should be achievable in no time at all.
Look at Your Time Frame
When it comes to file conversion, almost nothing is more important than your immediate time frame for deciding the methodology that you will follow in order to achieve the necessary task. In many instances, it may seem logical to either download the required software add on for Microsoft Word 2007 or to even use a freeware version of the Microsoft office programs, such as Open Office. However, these options may have their own specific downfalls. For example, many computer users did not purchase the Microsoft office program software and do not intend to. In such an instance, an add-on would be useless. To make matters worse, a typical freeware program will not convert files docx with correct formatting.
For convenience and accuracy, an online program which converts files Docx with correct formatting and almost instantly is paramount. Be sure to contact us at Convert-doc.com if you have any questions about our online file conversion services.
Friday, February 28, 2014
Make PDF Files Easily with Convert-Doc
There are plenty of different file types out there, but none are quite as versatile as PDF. PDF is favored around the world for professional use in business due to how well it works across different combinations of hardware and software. It doesn't matter what kind of operating system you run - or if you're using a desk or laptop workstation, a tablet, or smartphone. So long as you have the proper PDF reader software or app, you can easily read PDF files.
Reading PDF may be really easy, but knowing how to make PDF is a different animal altogether. There are many different websites and services that claim to allow you to convert your files to PDF, but how do you know just which ones to trust? After all, the internet is filled with scammers and viruses - you need to be careful with who you trust. Here are some reasons you should trust Convert-Doc for your document conversion needs:
Convert-Doc is completely free. No subscription fees, no conversion fees, and definitely no hidden fees. You won't have to worry about being charged for converting your documents through our website.
Convert-Doc supports over 150 different file extensions. Whether you're trying to convert to PDF, docx, or any other file extension, Convert-Doc can handle it. You can convert documents you can't read into a file format you can, or convert files into a universally readable format before sending them to your partners or clients.
Convert-Doc doesn't require you to download anything. Downloading software online can quickly land you with a virus or other malicious software. That's why Convert-Doc doesn't need you to download anything - everything is done online, and your files are encrypted until they're received on the other side.
If you're ready to make business easy with PDF, or any other type of file, contact us through our website to get started converting files.
Friday, February 21, 2014
Exploring Different Methods to Convert docx to doc
Every typical computer user comes to a point where they are unable to simply convert a file they need to use without downloading new software. From a convenience standpoint, this is simply unacceptable. This is especially the case when using an older version of Microsoft Word. In a ploy to convince users of older computers to purchase new software, Microsoft invented a form of word document file known as docx, which can be next to impossible to accurately convert, even with an opensource program such as Open Office. By learning more about how to convert docx to doc, avoiding such issues should be achievable in no time at all.
Download Open Office or A Compatibility Package for MS Word
When it comes to converting from docx to doc on a regular basis, it may be advantageous to download either an add on for Microsoft Word or Open Office, a free office program suite. In either case, however, it can take a lot of time and effort to ensure that the download is incorporated correctly. Here is the main disadvantage from a user perspective. Many people who do not feel the need to purchase Microsoft Office software will quickly find that the popular free alternative Open Office is unable to correctly convert docx to doc. It typically results in skewed formatting, which is completely unacceptable from a professional perspective. If you have already purchased Microsoft Office software, it may be practical to download the conversion add on, however, this can take time which may not be available in the instance that a conversion needs to occur (think office politics.)
The Convenience of Online Conversion
Nothing is more straightforward and convenient than the service provided at Convert-doc.com. Take the time to contact us if you have any questions about converting docx to doc.
Friday, February 14, 2014
Different Ways to Make PDF Files
PDF files are notorious for being difficult to deal with, especially under circumstances where the file needs to be cut up into segments of pages or when it needs to be edited. By exploring the various methods available to make pdf files, relieving yourself of the constant hassle associated with this type of file should be achievable.
Download PDF Converter Software
There are a lot of different free software options available for converting word files to PDF files as well as the other way around. If you are trying to make a PDF, this is generally achievable by typing the information into a word editor such as Microsoft Word or Open Office and then transferring the file. However, such an option does not always work when you want to convert something that is in a different file type. Open Office also provides a feature which directly converts the document into a PDF file. According to About.com, "If you already have a recent copy of OpenOffice.org you have what you need to create PDF files. Just open the document in one of the OpenOffice.org applications, click on the file menu and choose export to PDF. If you don't have OpenOffice.Org you can download it for free and use it at home or in a business setting at no cost. The software is available for Windows, Ma c, Linux, and Solaris and in a number of different languages."
Utilize a Free Online Converter
The number one advantage of a free online converter is that it can be utilized quickly without having to cumbersomely download and learn how to use a program. The service we provide at convert-doc.com instantly allows you to make PDF files at the click of a button. Take the time to contact us if you have any questions about making a PDF file.
Saturday, February 8, 2014
Unlock PDF files to edit, copy, and print
Have you tried to edit or print a PDF but kept getting weird error messages? This is probably because the PDF file has restrictions in place. Even if you have upgraded pdf software these flags can prevent you from modifying, printing, or copying text.
Fortunately, it is convert-doc.com to the rescue again, allowing you to remove pdf restrictions without the need for a password. And you don't need to install any software, just upload your file and we will make available the new file without these pdf restrictions.
It's free and secure, because we use SSL just like the banks do to transfer your data. Your initial file is removed immediately after upload, and your new restriction free file will be available for one hour before it is permanently removed.
Using your new file allows you to copy, edit, and print your PDF!
The Convert-doc.com Team
Friday, February 7, 2014
Learning More About the Process to Convert Files docx
Since the beginning of computer history, the inconvenience of necessary file conversion has plagued the user with unneeded downloads, hassles and repeating error messages. In the age of the second millenium, it can be extremely discouraging to be hindered by something as stone age as a file incompatibility while utilize an invention pioneered in 1970. By learning more about how to convert files docx, avoiding such a hassle should be achievable.
Avoid Installing Any New Software
When it comes to a file conversion, one of the most time consuming actions that you can take is to trust a downloadable extension or an entirely new program itself to perform a file conversion. In some instances not only will such a download not convert the file, it might also install unwanted viruses and spyware.
File Conversion Issues are A Common Problem
Many computer users will commonly suffer from file conversion issues, some even on a daily basis.
Sometimes you receive files in formats no longer supported by your computer or operating system. In these cases you can use converter software or buy additional programs. Common file compatibility problems include videos, music or document formats.
Whether your computer use is recreational, employer related, or both, nothing is more of a downer than being unable to convert a file. At Convert-doc.com, we provide a service which almost instantly converts files docx for free and at your convenience. We are also able to convert a large number of other file formats. Be sure to contact us if you have any questions at all about how to convert files docx.
|
{
"url": "http://blog.convert-doc.com/search?updated-max=2014-03-21T06:28:00-07:00&max-results=7&reverse-paginate=true",
"source_domain": "blog.convert-doc.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "82527",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FMEQU2KTUXCEG6DPRSDK6NKMVUG6EW62",
"WARC-Concurrent-To": "<urn:uuid:e6ef22f3-9c64-4687-a0aa-910ddfc89051>",
"WARC-Date": "2023-10-01T11:44:14Z",
"WARC-IP-Address": "142.251.16.121",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VHGBEO5EBHUOOB5DLYYNJLJTL3BDBGQQ",
"WARC-Record-ID": "<urn:uuid:2ad70ad4-d9cf-43c4-aa98-92a72e318306>",
"WARC-Target-URI": "http://blog.convert-doc.com/search?updated-max=2014-03-21T06:28:00-07:00&max-results=7&reverse-paginate=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0f7e8291-b492-4ec2-bd2d-8e6f933d7915>"
},
"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-97\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,
73,
74,
750,
751,
787,
1335,
1336,
1374,
1840,
1841,
1975,
1976,
1998,
1999,
2043,
2044,
3083,
3084,
3108,
3109,
3821,
3822,
4065,
4066,
4092,
4093,
4132,
4133,
4593,
4594,
5027,
5028,
5228,
5229,
5559,
5560,
5866,
5867,
6006,
6007,
6033,
6034,
6085,
6086,
6720,
6721,
6781,
7667,
7668,
7705,
7882,
7883,
7909,
7910,
7943,
7944,
8281,
8282,
8314,
9287,
9288,
9320,
9665,
9666,
9693,
9694,
9736,
9737,
9990,
9991,
10258,
10259,
10501,
10502,
10568,
10569,
10594,
10595,
10620,
10621,
10675,
10676,
11126,
11127,
11161,
11477,
11478,
11522,
11523,
11621,
11870,
11871
],
"line_end_idx": [
23,
24,
73,
74,
750,
751,
787,
1335,
1336,
1374,
1840,
1841,
1975,
1976,
1998,
1999,
2043,
2044,
3083,
3084,
3108,
3109,
3821,
3822,
4065,
4066,
4092,
4093,
4132,
4133,
4593,
4594,
5027,
5028,
5228,
5229,
5559,
5560,
5866,
5867,
6006,
6007,
6033,
6034,
6085,
6086,
6720,
6721,
6781,
7667,
7668,
7705,
7882,
7883,
7909,
7910,
7943,
7944,
8281,
8282,
8314,
9287,
9288,
9320,
9665,
9666,
9693,
9694,
9736,
9737,
9990,
9991,
10258,
10259,
10501,
10502,
10568,
10569,
10594,
10595,
10620,
10621,
10675,
10676,
11126,
11127,
11161,
11477,
11478,
11522,
11523,
11621,
11870,
11871,
12278
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12278,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4487015902996063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01277139037847519,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11196254193782806,
"rps_doc_frac_unique_words": 0.27462396025657654,
"rps_doc_mean_word_length": 4.813197612762451,
"rps_doc_num_sentences": 108,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.46943473815918,
"rps_doc_word_count": 2061,
"rps_doc_frac_chars_dupe_10grams": 0.02016128972172737,
"rps_doc_frac_chars_dupe_5grams": 0.08397176861763,
"rps_doc_frac_chars_dupe_6grams": 0.05826612934470177,
"rps_doc_frac_chars_dupe_7grams": 0.04909273982048035,
"rps_doc_frac_chars_dupe_8grams": 0.03770161047577858,
"rps_doc_frac_chars_dupe_9grams": 0.028225809335708618,
"rps_doc_frac_chars_top_2gram": 0.014516130089759827,
"rps_doc_frac_chars_top_3gram": 0.006350810173898935,
"rps_doc_frac_chars_top_4gram": 0.0060483901761472225,
"rps_doc_books_importance": -859.6407470703125,
"rps_doc_books_importance_length_correction": -859.6407470703125,
"rps_doc_openwebtext_importance": -420.4844970703125,
"rps_doc_openwebtext_importance_length_correction": -420.4844970703125,
"rps_doc_wikipedia_importance": -469.8121643066406,
"rps_doc_wikipedia_importance_length_correction": -469.8121643066406
},
"fasttext": {
"dclm": 0.036857008934020996,
"english": 0.9239717125892639,
"fineweb_edu_approx": 1.934695839881897,
"eai_general_math": 0.18386566638946533,
"eai_open_web_math": 0.24525338411331177,
"eai_web_code": 0.04837566986680031
}
}
|
{
"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": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
547,689,632,925,066,500 |
package org.apache.lucene.analysis.el; /** * Copyright 2005 The Apache Software Foundation * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ import org.apache.lucene.analysis.TokenFilter; import org.apache.lucene.analysis.Token; import org.apache.lucene.analysis.TokenStream; /** * Normalizes token text to lower case, analyzing given ("greek") charset. * * @author Panagiotis Astithas, [email protected] */ public final class GreekLowerCaseFilter extends TokenFilter { char[] charset; public GreekLowerCaseFilter(TokenStream in, char[] charset) { super(in); this.charset = charset; } public final Token next() throws java.io.IOException { Token t = input.next(); if (t == null) return null; String txt = t.termText(); char[] chArray = txt.toCharArray(); for (int i = 0; i < chArray.length; i++) { chArray[i] = GreekCharsets.toLowerCase(chArray[i], charset); } String newTxt = new String(chArray); // create new token Token newToken = new Token(newTxt, t.startOffset(), t.endOffset()); return newToken; } }
|
{
"url": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/PyLucene/PyLucene-2.3.1-3-418/lucene-java-2.3.1/contrib/analyzers/src/java/org/apache/lucene/analysis/el/GreekLowerCaseFilter.java",
"source_domain": "fossies.org",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "2251",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKOKEL4CYJDYQC6USFQJX7E7WYJGX7FH",
"WARC-Concurrent-To": "<urn:uuid:b53f3c3b-f59e-4df9-bedb-f02cddf65877>",
"WARC-Date": "2016-10-27T05:00:05Z",
"WARC-IP-Address": "138.201.17.217",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LZVPT4UBM3SI4VCN3SCSVBMELAOC3PII",
"WARC-Record-ID": "<urn:uuid:8eb19dd4-e2b4-4a1d-a392-84aa3847bcdd>",
"WARC-Target-URI": "https://fossies.org/windows/misc/Chandler_src_1.0.3.tar.gz/chandler-1.0.3/external/PyLucene/PyLucene-2.3.1-3-418/lucene-java-2.3.1/contrib/analyzers/src/java/org/apache/lucene/analysis/el/GreekLowerCaseFilter.java",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13de69a6-9c61-4e6b-877e-f2fce5786eee>"
},
"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
],
"line_end_idx": [
1495
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1495,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.005351169966161251,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1642228662967682,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.032258059829473495,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.401759535074234,
"rps_doc_frac_unique_words": 0.682634711265564,
"rps_doc_mean_word_length": 6.730538845062256,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.539239883422852,
"rps_doc_word_count": 167,
"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.053380779922008514,
"rps_doc_frac_chars_top_3gram": 0.02313167043030262,
"rps_doc_frac_chars_top_4gram": 0.02846975065767765,
"rps_doc_books_importance": -141.7413787841797,
"rps_doc_books_importance_length_correction": -133.2070770263672,
"rps_doc_openwebtext_importance": -105.37114715576172,
"rps_doc_openwebtext_importance_length_correction": -105.37114715576172,
"rps_doc_wikipedia_importance": -70.81798553466797,
"rps_doc_wikipedia_importance_length_correction": -59.21770095825195
},
"fasttext": {
"dclm": 0.9487095475196838,
"english": 0.5418192744255066,
"fineweb_edu_approx": 0.946882426738739,
"eai_general_math": 0.9512954354286194,
"eai_open_web_math": 0.4200078845024109,
"eai_web_code": 0.5247532725334167
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,847,934,775,146,032,000 |
CHANGES IN VERSION 1.45.7 ------------------------- USER VISIBLE CHANGES: + Disabled Rmpi support and usage on Windows CHANGES IN VERSION 1.45.6 ------------------------- NEW FEATURE: + J. Rainer implemented a [ method that allows to subset an xcmsSet. BUG FIXES: + Fixed a problem in split.xcmsSet that did not split the phenoData properly. Added some details to the documentation of xcmsSet-class. CHANGES IN VERSION 1.45.5 ------------------------- USER VISIBLE CHANGES: + The sampclass method for xcmsSet will now return the content of the column "class" from the data.frame in the phenoData slot, or if not present, the interaction of all factors (columns) of that data.frame. + The sampclass<- method replaces the content of the "class" column in the phenoData data.frame. If a data.frame is submitted, the interaction of its columns is calculated and stored into the "class" column. BUG FIXES: + Fixed a bug that resulted in a cryptic error message when no input files are available to the xcmsSet function. CHANGES IN VERSION 1.45.4 ------------------------- BUG FIXES: + Fixed a bug in the levelplot method for xcmsSet. CHANGES IN VERSION 1.45.3 ------------------------- NEW FEATURE: + xcmsSet now allows phenoData to be an AnnotatedDataFrame. + new slots for xcmsRaw: - mslevel: store the mslevel parameter submitted to xcmsRaw. - scanrange: store the scanrange parameter submitted to xcmsRaw. + new slots for xcmsSet: - mslevel: stores the mslevel argument from the xcmsSet method. - scanrange: to keep track of the scanrange argument of the xcmsSet method. + new methods for xcmsRaw: - levelplot: similar to the image method, plots m/z vs RT with color coded intensities. - mslevel: returns the value for the .mslevel slot. For downstream compatibility, this method returns NULL if the object does not have the same named slot. - profinfo: same functionality as the profinfo method for xcmsSet. - scanrange: returns the value for the scanrange slot. For downstream compatibility, this method returns NULL if the object does not have the same named slot. + new methods for xcmsSet: - getXcmsRaw: returns a xcmsRaw object for one or more files in the xcmsSet, eventually applying retention time correction etc. - levelplot: similar to the image method, plots m/z vs RT with color coded intensities. Allows in addition to highlight identified peaks. - mslevel: returns the value for the mslevel slot. For downstream compatibility, this method returns NULL if the object does not have the same named slot. - profMethod: same functionality as the profMethod method of xcmsRaw. - profStep: same functionality as the profStep method of xcmsRaw. - scanrange: returns the value for the scanrange slot. For downstream compatibility, this method returns NULL if the object does not have the same named slot. USER VISIBLE CHANGES: + show method for xcmsSet updated to display also informations about the mslevel and scanrange. + Elaborated some documentation entries. + rtrange and mzrange for xcmsRaw method plotEIC use by default the full RT and m/z range. + Added arguments "lty" and "add" to plotEIC method for xcmsRaw. + getEIC without specifying mzrange returns the ion chromatogram for the full m/z range (i.e. the base peak chromatogram). BUG FIXES: + Checking if phenoData is a data.frame or AnnotatedDataFrame and throw an error otherwise. + xcmsSet getEIC method for water Lock mass corrected files for a subset of files did not evaluate whether the specified files were corrected. CHANGES IN VERSION 1.45.2 ------------------------- BUG FIXES: o The xcms split() function now accepts factors that are shorter than the number of samples in the xcmsSet, following more closely the standard split() behaviour CHANGES IN VERSION 1.45.1 ------------------------- NEW FEATURE: o plotrt now allows col to be a vector of color definition, same as the plots for retcor methods. o Added $ method to access phenoData columns in a eSet/ExpressionSet like manner. o Allow to use the "parallel" package for parallel processing of the functions xcmsSet and fillPeaks.chrom. o Thanks to J. Rainer! CHANGES IN VERSION 1.43.3 ------------------------- BUG FIXES: o Give a more verbose error message when file not found CHANGES IN VERSION 1.43.2 -------------------------- BUG FIXES: o Use ProtGenerics, adapted xcms peaks() CHANGES IN VERSION 1.43.1 -------------------------- NEW FEATURE: o function plotQC() for plotting various QC plots on RT and m/z CHANGES IN VERSION 1.41.1 -------------------------- BUG FIXES: o fix sampclass generation from phenoData if some combinations of factors don't exist o disable parallel code in manpages to avoid issues on BioC windows build farm machines CHANGES IN VERSION 1.39.6 -------------------------- USER VISIBLE CHANGES: o Massifquant reports the maximum intensity for each isotope trace (peak). This is useful for interactive parameter optimization. BUG FIXES: o Major memory reduction in parallel fillPeaks() thanks to Jan Stanstrup. Now using an environment to mirror gvals to each list item in the very large argList. CHANGES IN VERSION 1.39.4 -------------------------- BUG FIXES: o Fixed write.cdf(), which had an intensity offset of +1, added a unit test CHANGES IN VERSION 1.39.3 -------------------------- BUG FIXES: o New R-devel check unload better. Lingering ramp code removed, import from mzR. Cleaned up other errors in package check. CHANGES IN VERSION 1.39.1 -------------------------- BUG FIXES: o Updated doubleMatrix c code to allow for larger profile matrixes REQUIRED CHANGES o Moved inst/doc to vignettes CHANGES IN VERSION 1.37.6 -------------------------- NEW FEATURE: o Introducing write.mzQuantML(xcmsSet) to export the peak list and grouped matrix to the PSI format mzQuantML (see http://www.psidev.info/mzquantml) USER VISIBLE CHANGES: o Add Brigham Young University to LICENSE file for copyright purposes. o Add copyright information display when running findPeaks.massifquant() within xcmsRaw.R o Clean and update documentation for findPeaks.massifquant-methods.Rd BUG FIXES: o Remove unused parameters in findKalmanROIs() within xcmsRaw.R CHANGES IN VERSION 1.37.5 -------------------------- BUG FIXES o fixed bug in retcor.obiwarp where the scanrange of the first sample would be checked instead of the center sample CHANGES IN VERSION 1.37.4 -------------------------- BUG FIXES o Skip t-test in diffreport() if one class has less than 2 samples. CHANGES IN VERSION 1.37.3 -------------------------- BUG FIXES o fixed bug in patternVsRowScore (group.nearest) that was introduced by the modifications in rev 65169 and caused features to be aligned that were far outside the given m/z and retention time windows. CHANGES IN VERSION 1.37.1 -------------------------- BUG FIXES o fixed fillPeaks, which 1) dropped non-standard columns and 2) failed if nothing to do, based on patches by Tony Larson. CHANGES IN VERSION 1.37.1 -------------------------- NEW FEATURES: o Introducing msn2xcmsRaw, to allow findPeaks() on MS2 and MSn data CHANGES IN VERSION 1.35.7 -------------------------- BUG FIXES o fixed indexing bug in group.nearest, which under certain circumstances caused all peaks in the first sample to be ignored (reported by Tony Larson) CHANGES IN VERSION 1.35.6 -------------------------- BUG FIXES o Obiwarp retention time alignment error-ed if scanrange was used as a parameter setting during xcmsSet/peak detection The method now tries to automatically find the set scanrange and uses this range for alignment. CHANGES IN VERSION 1.35.4 -------------------------- NEW FEATURES: o Introducing parallel fillPeaks USER VISIBLE CHANGES o Replace snow requirement with minimum R version 2.14.0 CHANGES IN VERSION 1.35.3 -------------------------- BUG FIXES o if group.density was used with very low minfrac settings (< 0.5) it did not return all feature groups, but only those that include features from at least 50% of samples in a group. This limitation was removed. CHANGES IN VERSION 1.35.2 -------------------------- UPDATED FEATURES: o Behind the scenes xcms now uses the xcmsSource class to read raw data. This allows e.g. to write a class that pulls raw data from e.g. a database BUG FIXES o massifquant: simplified logic structure of Tracker::claimDataIdx resolved failure on new test case. o massifquant: reporting features data structure compatible with multiple sample comparison within XCMS. CHANGES IN VERSION 1.35.1 -------------------------- UPDATED FEATURES: o The mzData export is now much faster and uses less memory CHANGES IN VERSION 1.33.16 -------------------------- USER VISIBLE CHANGES o diffreport and plotEIC have a new parameter mzdec, with is the number of decimal places of the m/z values in the EIC plot title CHANGES IN VERSION 1.33.16 -------------------------- UPDATED FEATURES: Lock mass gap filler now works with netCDF lock mass function file to find the exact times of the scans and works with the newer Waters MS instruments. CHANGES IN VERSION 1.33.15 -------------------------- BUG FIXES o scanrage is now honoured in xcmsSet, also when in parallel mode CHANGES IN VERSION 1.33.14 -------------------------- BUG FIXES o scanrage is now honoured in xcmsRaw, and consequently also in xcmsSet(matchedFilter), where previously it was ignored. CHANGES IN VERSION 1.33.13 -------------------------- BUG FIXES o write.cdf() has been fixed to write files AMDIS can read CHANGES IN VERSION 1.33.12 -------------------------- BUG FIXES o write.mzData adds Polarity to the file if available CHANGES IN VERSION 1.33.11 -------------------------- USER VISIBLE CHANGES o centWave uses a new method to estimate local noise which improves detection of closely spaced peaks NEW FEATURES o placeholder BUG FIXES o group.mzClust was failing when result had one peak For more details and all changes before May 2012 please see the (now discontinued) CHANGELOG in the source package (inst/ folder). CHANGED BEHAVIOUR since Version 1.32: Other Changes since Version 1.32: * improved mzData writing, now includes MSn spectra and less verbose. * improved netCDF writing, but not yet good enough for AMDIS CHANGED BEHAVIOUR since Version 1.14: * centWave may report a smaller set of peaks, due to a small bug in the ROI algorithm some features with mass deviation > ppm were retained. Other Changes since Version 1.14: * New method for grouping: an algorithm inspired by mzMine group(method="nearest") has been implemented. It is slower than group(method="density"). It can individually group close-eluting peaks of very similar mass * New method for retention time correction: The retcor(method="obiwarp") algorithm operates on the raw data, and thus allows to correct runs without well-behaving peak groups, or without peak picking at all. * fillPeaks(method="MSW") is now also available for direct infusion spectra. The findPeaks(method="MSW") now returns several intensities, and correctly reports mzmin and mzmax for peaks. * centWave now uses dynamic memory allocation, needs much less memory, and these BUF related errors should be a thing of the past. * centWave gains an optional argument "noise", which is useful for data that was centroided without any intensity threshold, centroids with intensity < "noise" are omitted from ROI detection * the fillPeaks() methods now remember which was an observed, and which was a "filled" peak. * For direct infusion spectra diffreport() now shows the raw peak shapes, and also indicated "real" and "filled" peaks. * xcmsRaw can now filter for positive/negative spectra, if the file includes both polarities. xcmsSet() can pass the polarity to contain positive/negative peaks only.
|
{
"url": "http://bioconductor.org/packages/release/bioc/news/xcms/NEWS",
"source_domain": "bioconductor.org",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "12474",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRFAUTNDWF5RP3HQRI4INT7RAY6QTRAJ",
"WARC-Concurrent-To": "<urn:uuid:2b15ec99-661f-43c2-bb9c-58b2c696b7cd>",
"WARC-Date": "2016-02-14T01:44:48Z",
"WARC-IP-Address": "54.230.193.240",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BPY5AKQLPVQMXNS4R5DVW2SJBGP42OMN",
"WARC-Record-ID": "<urn:uuid:9932e5cc-8b25-4163-8f20-e8953ca8ffe9>",
"WARC-Target-URI": "http://bioconductor.org/packages/release/bioc/news/xcms/NEWS",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:be6006de-a325-4139-9c88-ccc2dd934e30>"
},
"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
],
"line_end_idx": [
11626
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11626,
"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.28964903950691223,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10439804941415787,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.253220796585083,
"rps_doc_frac_unique_words": 0.3361344635486603,
"rps_doc_mean_word_length": 5.13325309753418,
"rps_doc_num_sentences": 178,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.482384204864502,
"rps_doc_word_count": 1666,
"rps_doc_frac_chars_dupe_10grams": 0.07483629882335663,
"rps_doc_frac_chars_dupe_5grams": 0.09728717803955078,
"rps_doc_frac_chars_dupe_6grams": 0.09331151098012924,
"rps_doc_frac_chars_dupe_7grams": 0.08231993019580841,
"rps_doc_frac_chars_dupe_8grams": 0.08231993019580841,
"rps_doc_frac_chars_dupe_9grams": 0.07483629882335663,
"rps_doc_frac_chars_top_2gram": 0.035781100392341614,
"rps_doc_frac_chars_top_3gram": 0.06361085176467896,
"rps_doc_frac_chars_top_4gram": 0.011108510196208954,
"rps_doc_books_importance": -925.1646118164062,
"rps_doc_books_importance_length_correction": -925.1646118164062,
"rps_doc_openwebtext_importance": -619.9216918945312,
"rps_doc_openwebtext_importance_length_correction": -619.9216918945312,
"rps_doc_wikipedia_importance": -581.2020874023438,
"rps_doc_wikipedia_importance_length_correction": -581.2020874023438
},
"fasttext": {
"dclm": 0.045657750219106674,
"english": 0.7638908624649048,
"fineweb_edu_approx": 1.6880913972854614,
"eai_general_math": 0.5829291343688965,
"eai_open_web_math": 0.39099955558776855,
"eai_web_code": 0.9377208948135376
}
}
|
{
"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": "543",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Chemistry",
"level_3": "Chemistry, Analytic"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
}
},
"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
|
-8,768,151,723,241,813,000 |
Cisco® CCNA ICND2 Exam Cram Notes : Etherchannel Configuration
RETIRED! Exam
Go to latest CCNA Exam Cram
3. WAN Technologies
3.4 EtherChannel Configuration
Two protocols, namely PAgP or LACP may used for negotiating EtherChannel and Link Aggregation. We can configure Etherchannel in three ways in Cisco Switches.
1. Port Aggregation Protocol (PAgP) - Cisco Proprietary protocol
2. IEEE Link Aggregation Protocol (LACP) - Industry Standard
3. Manual Etherchannel Configuration - Without using any negotiation protocol listed above
PAgP : PAgP stands for Port Aggregation Protocol. PAgP helps in the automatic creation of Fast EtherChannel links. PagP is a Cisco proprietary link aggregation protocol used in Catalyst switches.
The following are features of Fast EtherChannel that is running PAgP (Port Aggregation Protocol):
1. PAgP helps in the automatic creation of Fast EtherChannel.
2. PAgP does not group ports configured for dynamic VLANs. PAgP requires that all ports in a channel must belong to the same VLAN or should be configured as trunk ports.
3. PAgP does not group ports that work at different speeds or port duplexes.
The following are available PAgP modes and the corresponding action:
1. ON mode does not send or receive PAgP packets. Therefore, both ends should be set to ON mode to form an EtherChannel.
2. Desirable mode tries to ask the other end in order to bring up the EtherChannel.
3. Auto mode participates in the EtherChannel only if the far end asks for participation. Two switches in auto mode will not form an EtherChannel.
If you are using Port Aggregation Protocol (PAgP) for EtherChannel negotiation, EtherChannel will be formed only if two ends are configured under following modes.
Desirable Auto
Desirable Yes Yes
Auto Yes No
EtherChannel can support from 2 to 8 links to be bundled into one logical link. Therefore, if Gigabit Ethernet links are bundled, 8 links represent 8 Gbps of one-way bandwidth, and 16 Gbps for full-duplex operation.
The load distribution algorithm in EtherChannel can use source IP, destination IP, a combination of source and destination IPs, Source MAC, destination MAC, or TCP.UDP port numbers for decision process. If there are only two links in the EtherChannel, only 1 bit in the IP are required. If there are 4 links in the EtherChannel, 2 bits are required. Similarly, for an 8 link EtherChannel, 3 bits are required.
LACP: Link Aggregation Control Protocol (LACP) is a standards based protocol and conforms to IEEE standard 802.3ad. Note that PAgP is Cisco proprietary protocol. If your network consists of both Cisco and non-Cisco devices, LACP is the desired option for configuring EtherChannel. If your network consists of all Cisco switches then PAgP would be recommended.
1. Active: The active end of the group sends out a LACP frame and initiates the negotiation to form the EtherChannel. Both ends could be active and the result would be the same.
2. Passive: Passive Mode does not initiate the negotiation. It just responds to LACP packets initiated by other end. So if both ends were passive, the EtherChannel would not be formed.
Passive Mode in Link Aggregation Control Protocol (LACP) does not start Link Aggregation Control Protocol (LACP) packet negotiation.
Desirable Auto
Desirable Yes Yes
Auto Yes No
Previous Contents Next
CCNA-ICND2 Cram Notes Contents
certexams ad
simulationexams ad
|
{
"url": "https://www.examguides.com/CCNA-ICND2/ccna-icnd2-14.htm",
"source_domain": "www.examguides.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "20057",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RDQVUG5YXPCYNIRREOXPGM5LQ36TG54D",
"WARC-Concurrent-To": "<urn:uuid:aaeaf735-60cd-4a33-ba62-f9c52f04c8b6>",
"WARC-Date": "2020-07-02T05:43:26Z",
"WARC-IP-Address": "198.143.147.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:42CLUPXLCAYQEHGX5XB4V6MPNNDUT3MZ",
"WARC-Record-ID": "<urn:uuid:19e27a50-947f-4d25-bed4-d0cdff75c0bd>",
"WARC-Target-URI": "https://www.examguides.com/CCNA-ICND2/ccna-icnd2-14.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e71dd59-8cce-461c-88f3-83cf6caaa8d3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137.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,
63,
64,
78,
79,
107,
108,
128,
129,
160,
161,
319,
320,
385,
386,
447,
448,
539,
540,
736,
737,
835,
836,
898,
899,
1069,
1070,
1147,
1148,
1217,
1218,
1339,
1340,
1424,
1425,
1572,
1573,
1736,
1737,
1754,
1772,
1784,
1785,
2001,
2002,
2412,
2413,
2773,
2774,
2952,
2953,
3138,
3139,
3272,
3273,
3290,
3308,
3320,
3321,
3348,
3349,
3350,
3381,
3394,
3395
],
"line_end_idx": [
63,
64,
78,
79,
107,
108,
128,
129,
160,
161,
319,
320,
385,
386,
447,
448,
539,
540,
736,
737,
835,
836,
898,
899,
1069,
1070,
1147,
1148,
1217,
1218,
1339,
1340,
1424,
1425,
1572,
1573,
1736,
1737,
1754,
1772,
1784,
1785,
2001,
2002,
2412,
2413,
2773,
2774,
2952,
2953,
3138,
3139,
3272,
3273,
3290,
3308,
3320,
3321,
3348,
3349,
3350,
3381,
3394,
3395,
3413
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3413,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2998430132865906,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04395604133605957,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18367347121238708,
"rps_doc_frac_unique_words": 0.38104090094566345,
"rps_doc_mean_word_length": 5.0947957038879395,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8648905754089355,
"rps_doc_word_count": 538,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13206858932971954,
"rps_doc_frac_chars_dupe_6grams": 0.06275081634521484,
"rps_doc_frac_chars_dupe_7grams": 0.06275081634521484,
"rps_doc_frac_chars_dupe_8grams": 0.06275081634521484,
"rps_doc_frac_chars_dupe_9grams": 0.03575336933135986,
"rps_doc_frac_chars_top_2gram": 0.0328347310423851,
"rps_doc_frac_chars_top_3gram": 0.03356438875198364,
"rps_doc_frac_chars_top_4gram": 0.02955126017332077,
"rps_doc_books_importance": -275.4713439941406,
"rps_doc_books_importance_length_correction": -275.4713439941406,
"rps_doc_openwebtext_importance": -173.0071258544922,
"rps_doc_openwebtext_importance_length_correction": -173.0071258544922,
"rps_doc_wikipedia_importance": -146.97695922851562,
"rps_doc_wikipedia_importance_length_correction": -146.97695922851562
},
"fasttext": {
"dclm": 0.10034549236297607,
"english": 0.8553801774978638,
"fineweb_edu_approx": 1.8684624433517456,
"eai_general_math": 0.6198897361755371,
"eai_open_web_math": 0.39764249324798584,
"eai_web_code": 0.09837257862091064
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,336,007,908,834,367,000 |
7
$\begingroup$
I understand that in Unification we try to find a general solution to an equation between two terms, but what is anti-unification, and how is it different?
$\endgroup$
11
$\begingroup$
The following category theory inspired analysis (adapted from Plotkin's A Note on Inductive Generalization) explains a sense in which unification and anti-unification are dual concepts. As notation, let's write $$t \underset{\sigma}{\Longrightarrow} u$$ for two terms $t$ and $u$ and a substitution $\sigma$ whenever $t\sigma = u$. The existence of such a subsitution $\sigma$ implies that $t$ is a generalization of $u$, and that $u$ is a specialization of $t$.
Suppose given two terms $t_1,t_2$. A unifier of $t_1$ and $t_2$ is a term $u$ together with a pair of substitutions $\sigma_1$ and $\sigma_2$ such that $$ t_1 \underset{\sigma_1}{\Longrightarrow} u \underset{\sigma_2}{\Longleftarrow} t_2 $$ It is a most general unifier if it is a generalization of any other unifier, that is, if for any other unifier $$ t_1 \underset{\sigma_1'}{\Longrightarrow} u' \underset{\sigma_2'}{\Longleftarrow} t_2 $$ there is some $\sigma'$ such that $$ u \underset{\sigma'}{\Longrightarrow} u' $$ In other words, a most general unifier is precisely a coproduct in the category $\mathcal{C}$ whose objects are terms and where there is a morphism $t \to u$ just in case $t \underset{\sigma}{\Longrightarrow} u$ for some $\sigma$.
To define anti-unification we just reverse all the arrows! Which is to say that...
An anti-unifier of $t_1$ and $t_2$ is a term $u$ together with a pair of substitutions $\sigma_1$ and $\sigma_2$ such that $$ t_1 \underset{\sigma_1}{\Longleftarrow} u \underset{\sigma_2}{\Longrightarrow} t_2 $$ It is a least general anti-unifier if it is a specialization of any other anti-unifier, that is, if for any other anti-unifier $$ t_1 \underset{\sigma_1'}{\Longleftarrow} u' \underset{\sigma_2'}{\Longrightarrow} t_2 $$ there is some $\sigma'$ such that $$ u' \underset{\sigma'}{\Longrightarrow} u $$ This means that a least general anti-unifier is precisely a product in the category $\mathcal{C}$ defined above.
Update: fixed the accidentally dualized terminology in the original description (thanks Yann Hamdaoui!).
| cite | improve this answer | |
$\endgroup$
• 2
$\begingroup$ Isn't the unifier the coproduct and the anti-unifier the product ? $\endgroup$ – yago Mar 17 '16 at 12:02
• 1
$\begingroup$ @YannHamdaoui Whoops! Of course you're right, I guess I got caught up in the excitement of reversing arrows and reversed them one too many times ;-) $\endgroup$ – Noam Zeilberger Mar 17 '16 at 15:05
• 1
$\begingroup$ Happens to me everytime :) nice answer anyway ! $\endgroup$ – yago Mar 18 '16 at 18:59
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://cstheory.stackexchange.com/questions/34083/what-is-the-difference-between-unification-and-anti-unification",
"source_domain": "cstheory.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "146349",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EFQKZQTXRBXA4O4QODSNLD3QNRSDE3MI",
"WARC-Concurrent-To": "<urn:uuid:ac9c07bb-8a60-4d2b-a8fa-54f227441aac>",
"WARC-Date": "2020-07-09T18:16:44Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VHUEVRLNQ7QPR6GHGMTO2WO7VVGWT3ZK",
"WARC-Record-ID": "<urn:uuid:29e2c0eb-a3bc-423f-bbaf-e175dd315fbf>",
"WARC-Target-URI": "https://cstheory.stackexchange.com/questions/34083/what-is-the-difference-between-unification-and-anti-unification",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:24872e58-8f47-455a-9318-b7c143343d2a>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
16,
17,
173,
174,
186,
189,
203,
204,
667,
668,
1424,
1425,
1508,
1509,
2134,
2135,
2136,
2241,
2242,
2275,
2287,
2293,
2417,
2423,
2640,
2646,
2751,
2752,
2764,
2765,
2865,
2866
],
"line_end_idx": [
2,
16,
17,
173,
174,
186,
189,
203,
204,
667,
668,
1424,
1425,
1508,
1509,
2134,
2135,
2136,
2241,
2242,
2275,
2287,
2293,
2417,
2423,
2640,
2646,
2751,
2752,
2764,
2765,
2865,
2866,
2956
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2956,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0.017591340467333794,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3253731429576874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010447760112583637,
"rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267,
"rps_doc_frac_no_alph_words": 0.3328358232975006,
"rps_doc_frac_unique_words": 0.4305882453918457,
"rps_doc_mean_word_length": 5.089411735534668,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.0014925400028005242,
"rps_doc_unigram_entropy": 4.748206615447998,
"rps_doc_word_count": 425,
"rps_doc_frac_chars_dupe_10grams": 0.11927878111600876,
"rps_doc_frac_chars_dupe_5grams": 0.24410541355609894,
"rps_doc_frac_chars_dupe_6grams": 0.13684697449207306,
"rps_doc_frac_chars_dupe_7grams": 0.11927878111600876,
"rps_doc_frac_chars_dupe_8grams": 0.11927878111600876,
"rps_doc_frac_chars_dupe_9grams": 0.11927878111600876,
"rps_doc_frac_chars_top_2gram": 0.01248265989124775,
"rps_doc_frac_chars_top_3gram": 0.009246420115232468,
"rps_doc_frac_chars_top_4gram": 0.029588529840111732,
"rps_doc_books_importance": -302.2677307128906,
"rps_doc_books_importance_length_correction": -302.2677307128906,
"rps_doc_openwebtext_importance": -175.67123413085938,
"rps_doc_openwebtext_importance_length_correction": -175.67123413085938,
"rps_doc_wikipedia_importance": -111.67143249511719,
"rps_doc_wikipedia_importance_length_correction": -111.67143249511719
},
"fasttext": {
"dclm": 0.30906569957733154,
"english": 0.8229844570159912,
"fineweb_edu_approx": 1.4772967100143433,
"eai_general_math": 0.19274038076400757,
"eai_open_web_math": 0.7871246933937073,
"eai_web_code": 0.00040334000368602574
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"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": "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,409,859,301,227,663,000 |
HPHelion undercloud deployment fails in a VM with RPC error
asked 2014-08-07 14:50:26 -0600
maulermark gravatar image
updated 2014-08-16 11:38:46 -0600
smaffulli gravatar image
While running hp_ced_undercloud.sh as part of the hp_ced_installer.sh deployment of the HP Helion Community Edition virtual machine installation in a VMWare VM, the deployment fails with an RPC timeout.
ERROR: Timeout while waiting on RPC response - topic: "engine", RPC method: "create_stack" info: "<unknown>"
+ '[' -e /root/tripleo/tripleo-heat-templates/undercloud-vm.yaml ']'
+ heat stack-create -f /root/tripleo/tripleo-heat-templates/undercloud-vm.yaml -P AdminToken=d55c10c5119729dbddfc8da9f57ca8b5c1993dcf -P AdminPassword=85b4f21fe465a87c531ff365d4867c64874a2bc2 -P GlancePassword=5cb52c1ddb9d55c42bbe0ef3a8ba464e83042661 -P HeatPassword=65b9400ff644024358828446a091bfd2d9ed141f -P NeutronPassword=95db55d2b240590bce60af757f5e0c1cc5a0536d -P NovaPassword=9837b3cc45698bc24a731d6e6ad0d7091026fbd5 -P BaremetalArch=amd64 -P undercloudImage=dfb6ce7a-7117-40de-b7b5-5270b0b041b6 -P 'PowerSSHPrivateKey=-----BEGIN RSA PRIVATE KEY-----
[Long Private Key]
-----END RSA PRIVATE KEY-----' -P NeutronPublicInterface=eth0 -P PowerSSHHost=192.168.122.1 -P PowerManager=nova.virt.baremetal.virtual_power_driver.VirtualPowerManager -P PowerUserName=root undercloud
ERROR: Timeout while waiting on RPC response - topic: "engine", RPC method: "create_stack" info: "<unknown>"
I've searched online and some have pointed to port 8774 not being accessible.
As this is part of one gigantic script, it doesn't lend itself to troubleshooting and fixing the problem easily.
I tried installing an updated version but I get the same error:
ERROR: Timeout while waiting on RPC response - topic: "engine", RPC method: "create_stack" info: "<unknown>"
root@hLinux:~# nova list
+--------------------------------------+------------------------------------+--------+------------+-------------+----------+
| ID | Name | Status | Task State | Power State | Networks |
+--------------------------------------+------------------------------------+--------+------------+-------------+----------+
| 1126f3be-54ba-45ac-8397-7bb5b105e97f | undercloud-undercloud-ypfqcg7qa4ss | ERROR | - | NOSTATE | |
+--------------------------------------+------------------------------------+--------+------------+-------------+----------+
root@hLinux:~# heat stack-show undercloud
+----------------------+--------------------------------------------------------------------------------------------------------------------------+
| Property | Value |
+----------------------+--------------------------------------------------------------------------------------------------------------------------+
| capabilities | [] |
| creation_time | 2014-08-12T20:04:58Z |
| description | All-in-one baremetal OpenStack and all dependencies |
| | .,undercloud-vm-ironic-config.yaml,undercloud-vm- |
| | ironic-deploy.yaml,undercloud-icinga-config.yaml |
| | ,undercloud-icinga-deploy.yaml |
| disable_rollback | True |
| id | 09cf5186-7a5a-4f71-a5f8-39b70e2e76fa |
| links | http://192.0.2.1:8004/v1/a85d2bb8daad46e9bd8613f0831945d0/stacks/undercloud/09cf5186-7a5a-4f71-a5f8-39b70e2e76fa |
| notification_topics | [] |
| parameters | { |
| | "RabbitUserName": "guest", |
| | "NtpServer": "", |
| | "NeutronPassword": "******", |
| | "GlancePassword": "******", |
| | "SnmpdReadonlyUserPassword": "******", |
| | "HeatPassword": "******", |
| | "MailHostName": "mail", |
| | "MailDomain": "example.com", |
| | "HeatStackDomainAdminPassword": "******", |
| | "undercloudImage": "2c8cbb6c-4ee0-487a-898f-01b10d33661c", |
| | "SnmpdReadonlyUserName": "ro_snmp_user", |
| | "AWS::StackId": "arn:openstack:heat::a85d2bb8daad46e9bd8613f0831945d0:stacks/undercloud/09cf5186-7a5a-4f71-a5f8-39b70e2e76fa", |
| | "KeyName": "default", |
| | "RelayHost": "smtp.example.com", |
| | "CeilometerPassword": "******", |
| | "CinderLVMLoopDeviceSize": "5000", |
| | "GlanceNotifierStrategy": "noop", |
| | "RabbitPassword": "******", |
| | "BaremetalArch": "amd64", |
| | "AWS::StackName": "undercloud", |
| | "ImageUpdatePolicy": "REBUILD_PRESERVE_EPHEMERAL", |
| | "MysqlInnodbBufferPoolSize": "100", |
| | "NeutronPublicInterface": "eth0", |
| | "AWS::Region": "ap-southeast-1", |
| | "NovaPassword": "******", |
| | "AdminToken": "******", |
| | "GlanceLogFile": "", |
| | "RabbitCookieSalt": "unset", |
| | "AdminPassword": "******", |
| | "ExtraConfig": "{u'rabbit': {u'nofile': 30000}}", |
| | "PowerSSHPrivateKey": "******", |
| | "CeilometerMeteringSecret": "******", |
| | "IronicPassword": "******", |
| | "Flavor": "baremetal" |
| | } |
| stack_name | undercloud |
| stack_status | CREATE_FAILED |
| stack_status_reason | Resource CREATE failed: Error: Creation of server |
| | undercloud-undercloud-ypfqcg7qa4ss failed. |
| template_description | All-in-one baremetal OpenStack and all dependencies |
| | .,undercloud-vm-ironic-config.yaml,undercloud-vm- |
| | ironic-deploy.yaml,undercloud-icinga-config.yaml |
| | ,undercloud-icinga-deploy.yaml |
| timeout_mins | 360 |
| updated_time | None |
+----------------------+--------------------------------------------------------------------------------------------------------------------------+
edit retag flag offensive close merge delete
Comments
Have you tried fixing the issue with port 8774? Edit your question, add more details as you keep debugging it.
smaffulli gravatar imagesmaffulli ( 2014-08-08 15:33:26 -0600 )edit
Sorry I have no idea what to look for in debugging. The documentation is very sparse. This is supposed to be "run the hp_ced_installer.sh script and it just works". I'm following the documentation to a "T". The seed VM gets created just fine. I've run it multiple times in an Ubuntu 13.10 and 14.04 virtual machine with the same results each time.
maulermark gravatar imagemaulermark ( 2014-08-08 16:57:28 -0600 )edit
1
I'm having the exact same issue and also trying to install Helion CE in a vmware virtual machine. I tried raising the timeout flag from 360 to 36000 but that didn't fixed the problem. I can also confirm that port 8774 do answer and reply using netcat.
ByPasS gravatar imageByPasS ( 2014-08-11 09:14:00 -0600 )edit
1
Same issue here. Maulermark, were you able to make it any further ?
Genevieve gravatar imageGenevieve ( 2014-08-12 09:06:35 -0600 )edit
Vote the question UP, it's a good way to make the 'me too' count :)
smaffulli gravatar imagesmaffulli ( 2014-08-12 11:09:08 -0600 )edit
1 answer
Sort by » oldest newest most voted
0
answered 2014-12-06 07:31:58 -0600
9lives gravatar image
Per HP official Helion OpenStack CE installation guide(http://docs.hpcloud.com/helion/community/hwsw-requirements/#supportedhw-jumplink-span), a physical server is needed instead of a virtual server, so please try to use physical server and meet the hardware and software requirement before installing HOS CE.
Hope that helps!
Vic
edit flag offensive delete link more
Get to know Ask OpenStack
Resources for moderators
Question Tools
3 followers
Stats
Asked: 2014-08-07 14:50:26 -0600
Seen: 591 times
Last updated: Dec 06 '14
|
{
"url": "https://ask.openstack.org/en/question/44467/hphelion-undercloud-deployment-fails-in-a-vm-with-rpc-error/",
"source_domain": "ask.openstack.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "88532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O36HFX6OCHADWWUUIX3ZMZ3UVLBUGK6V",
"WARC-Concurrent-To": "<urn:uuid:88fbb44c-5279-46c7-ad09-b165fa6533e9>",
"WARC-Date": "2021-01-15T23:15:52Z",
"WARC-IP-Address": "104.239.149.165",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:M2LEXEURQOUW2SHNPW25VIDUWA634KQW",
"WARC-Record-ID": "<urn:uuid:e95ece9c-2eb5-40bc-b60e-f7ac56e397d5>",
"WARC-Target-URI": "https://ask.openstack.org/en/question/44467/hphelion-undercloud-deployment-fails-in-a-vm-with-rpc-error/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e794289-dc34-42f8-bf62-03953a5abe50>"
},
"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-90.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,
60,
61,
93,
94,
120,
121,
155,
156,
181,
182,
385,
386,
495,
496,
565,
1124,
1143,
1345,
1346,
1455,
1456,
1534,
1535,
1648,
1649,
1713,
1714,
1824,
1825,
1850,
1975,
2100,
2225,
2350,
2475,
2476,
2518,
2666,
2823,
2971,
3128,
3285,
3442,
3599,
3756,
3913,
4070,
4227,
4384,
4541,
4698,
4855,
5012,
5169,
5326,
5483,
5640,
5797,
5954,
6111,
6268,
6425,
6582,
6739,
6896,
7053,
7210,
7367,
7524,
7681,
7838,
7995,
8152,
8309,
8466,
8623,
8780,
8937,
9094,
9251,
9408,
9565,
9722,
9879,
10036,
10193,
10350,
10507,
10664,
10821,
10978,
11135,
11292,
11449,
11606,
11763,
11911,
11956,
11957,
11966,
11967,
12078,
12079,
12147,
12148,
12496,
12497,
12567,
12569,
12570,
12822,
12823,
12885,
12887,
12888,
12956,
12957,
13025,
13026,
13094,
13095,
13163,
13164,
13173,
13174,
13209,
13211,
13212,
13247,
13248,
13270,
13271,
13581,
13582,
13599,
13600,
13604,
13605,
13642,
13643,
13669,
13670,
13695,
13696,
13711,
13712,
13724,
13725,
13731,
13732,
13765,
13766,
13782,
13783
],
"line_end_idx": [
60,
61,
93,
94,
120,
121,
155,
156,
181,
182,
385,
386,
495,
496,
565,
1124,
1143,
1345,
1346,
1455,
1456,
1534,
1535,
1648,
1649,
1713,
1714,
1824,
1825,
1850,
1975,
2100,
2225,
2350,
2475,
2476,
2518,
2666,
2823,
2971,
3128,
3285,
3442,
3599,
3756,
3913,
4070,
4227,
4384,
4541,
4698,
4855,
5012,
5169,
5326,
5483,
5640,
5797,
5954,
6111,
6268,
6425,
6582,
6739,
6896,
7053,
7210,
7367,
7524,
7681,
7838,
7995,
8152,
8309,
8466,
8623,
8780,
8937,
9094,
9251,
9408,
9565,
9722,
9879,
10036,
10193,
10350,
10507,
10664,
10821,
10978,
11135,
11292,
11449,
11606,
11763,
11911,
11956,
11957,
11966,
11967,
12078,
12079,
12147,
12148,
12496,
12497,
12567,
12569,
12570,
12822,
12823,
12885,
12887,
12888,
12956,
12957,
13025,
13026,
13094,
13095,
13163,
13164,
13173,
13174,
13209,
13211,
13212,
13247,
13248,
13270,
13271,
13581,
13582,
13599,
13600,
13604,
13605,
13642,
13643,
13669,
13670,
13695,
13696,
13711,
13712,
13724,
13725,
13731,
13732,
13765,
13766,
13782,
13783,
13807
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13807,
"ccnet_original_nlines": 154,
"rps_doc_curly_bracket": 0.000434560002759099,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11424542218446732,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04442876949906349,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5176304578781128,
"rps_doc_frac_unique_words": 0.583193302154541,
"rps_doc_mean_word_length": 7.778151035308838,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.0021156601142138243,
"rps_doc_unigram_entropy": 5.56229829788208,
"rps_doc_word_count": 595,
"rps_doc_frac_chars_dupe_10grams": 0.051210030913352966,
"rps_doc_frac_chars_dupe_5grams": 0.11689715087413788,
"rps_doc_frac_chars_dupe_6grams": 0.11689715087413788,
"rps_doc_frac_chars_dupe_7grams": 0.11689715087413788,
"rps_doc_frac_chars_dupe_8grams": 0.11689715087413788,
"rps_doc_frac_chars_dupe_9grams": 0.11689715087413788,
"rps_doc_frac_chars_top_2gram": 0.008643040433526039,
"rps_doc_frac_chars_top_3gram": 0.011019879952073097,
"rps_doc_frac_chars_top_4gram": 0.015557480044662952,
"rps_doc_books_importance": -582.21630859375,
"rps_doc_books_importance_length_correction": -582.21630859375,
"rps_doc_openwebtext_importance": -256.73492431640625,
"rps_doc_openwebtext_importance_length_correction": -256.73492431640625,
"rps_doc_wikipedia_importance": -169.32199096679688,
"rps_doc_wikipedia_importance_length_correction": -169.32199096679688
},
"fasttext": {
"dclm": 1.000009536743164,
"english": 0.5926352143287659,
"fineweb_edu_approx": 1.399539589881897,
"eai_general_math": 0.2115170955657959,
"eai_open_web_math": 0.08016520738601685,
"eai_web_code": 0.9985354542732239
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,311,300,043,403,239,400 |
Visual C++ and DOS graphics modes
This is a discussion on Visual C++ and DOS graphics modes within the C++ Programming forums, part of the General Programming Boards category; i want to use dos graphics modes with visual c++(using the same way as the tutorials on this website tell ...
1. #1
Zasty
Guest
Visual C++ and DOS graphics modes
i want to use dos graphics modes with visual c++(using the same way as the tutorials on this website tell how)
but it says that there are a whole bunch of undeclared identifiers
(eg. error C2065: '_AX' : undeclared identifier)
is there any way to make it work? and if so how?
2. #2
Registered User
Join Date
Sep 2002
Posts
272
No.
Joe
3. #3
&TH of undefined behavior Fordy's Avatar
Join Date
Aug 2001
Posts
5,789
2 options
[list=1][*]Dump Dos - get a decent library like OpenGL & DirectX...both are freely downloadable and the web is full of tutorials on how to use them[*]Get a Dos Compiler - Loads of free ones available (djgpp for one)[/list=a]
Popular pages Recent additions subscribe to a feed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
|
{
"url": "http://cboard.cprogramming.com/cplusplus-programming/28743-visual-cplusplus-dos-graphics-modes.html",
"source_domain": "cboard.cprogramming.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "39867",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OZYSD3PA47XL23ACVWZU3FSSXERVO4JO",
"WARC-Concurrent-To": "<urn:uuid:7179468a-fa11-4362-9ad0-8d198c383bed>",
"WARC-Date": "2015-09-01T05:29:43Z",
"WARC-IP-Address": "76.74.254.184",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NCLQADB5I6XF2JRYJZLJD5DEU2PUQEMH",
"WARC-Record-ID": "<urn:uuid:f325f4e1-743a-402b-8ec6-143ad1d4e4d2>",
"WARC-Target-URI": "http://cboard.cprogramming.com/cplusplus-programming/28743-visual-cplusplus-dos-graphics-modes.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6455fb61-b60f-4537-8219-97145149ca83>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
34,
35,
287,
288,
296,
306,
316,
317,
355,
356,
471,
472,
543,
596,
597,
650,
651,
659,
679,
693,
706,
716,
724,
732,
740,
741,
749,
794,
808,
821,
831,
841,
855,
856,
1085,
1086,
1137,
1138
],
"line_end_idx": [
34,
35,
287,
288,
296,
306,
316,
317,
355,
356,
471,
472,
543,
596,
597,
650,
651,
659,
679,
693,
706,
716,
724,
732,
740,
741,
749,
794,
808,
821,
831,
841,
855,
856,
1085,
1086,
1137,
1138,
1191
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1191,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33992093801498413,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03952569141983986,
"rps_doc_frac_lines_end_with_ellipsis": 0.025641029700636864,
"rps_doc_frac_no_alph_words": 0.2964426875114441,
"rps_doc_frac_unique_words": 0.5990098714828491,
"rps_doc_mean_word_length": 4.0742573738098145,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.019762849435210228,
"rps_doc_unigram_entropy": 4.57185173034668,
"rps_doc_word_count": 202,
"rps_doc_frac_chars_dupe_10grams": 0.2017010897397995,
"rps_doc_frac_chars_dupe_5grams": 0.2964763045310974,
"rps_doc_frac_chars_dupe_6grams": 0.2964763045310974,
"rps_doc_frac_chars_dupe_7grams": 0.2017010897397995,
"rps_doc_frac_chars_dupe_8grams": 0.2017010897397995,
"rps_doc_frac_chars_dupe_9grams": 0.2017010897397995,
"rps_doc_frac_chars_top_2gram": 0.06682868301868439,
"rps_doc_frac_chars_top_3gram": 0.09720534831285477,
"rps_doc_frac_chars_top_4gram": 0.047387611120939255,
"rps_doc_books_importance": -96.60485076904297,
"rps_doc_books_importance_length_correction": -96.60485076904297,
"rps_doc_openwebtext_importance": -48.217628479003906,
"rps_doc_openwebtext_importance_length_correction": -48.196537017822266,
"rps_doc_wikipedia_importance": -31.123401641845703,
"rps_doc_wikipedia_importance_length_correction": -31.123401641845703
},
"fasttext": {
"dclm": 0.05677193030714989,
"english": 0.7906601428985596,
"fineweb_edu_approx": 1.0314533710479736,
"eai_general_math": 0.005041600205004215,
"eai_open_web_math": 0.05210905894637108,
"eai_web_code": 0.00036800000816583633
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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
|
7,245,145,255,080,784,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have a piece of code that originally used CString. Since it is not available to VSExpress users I replaced it with a CString "clone" found at: http://www.codeproject.com/KB/string/stdstring.aspx
This clone works just fine but one problem remains when using it:
TCHAR *GetConnectionString(){return m_szConnectionString)};
I get the error "no suitable conversion from "CStdStringW" to "TCHAR *" exists" and since string handling not really is my strength I don't know how to resolve this. Ok I know that I probably have to do some kind of type cast but.... The whole piece of code can be found at: Use CString in console app when using VS Express
Well, have a nice day and hopefully someone can help my with.
Regards Lumpi
share|improve this question
2
you should use std::string os std::wstring – David Heffernan Apr 23 '11 at 10:01
add comment
2 Answers
up vote 1 down vote accepted
Once you commit to a non-standard string class, you're stuck with having to use it. You ought to change the return value type:
CStdString GetConnectionString() {
return m_szConnectionString;
};
The other option is to change the return type from TCHAR to const TCHAR:
const TCHAR* GetConnectionString() {
return (LPCTSTR)m_szConnectionString;
};
Which isn't a great solution, it will fail miserably when the calling code stores the pointer and the connection string is changed. This is a flaw in the original code too btw.
share|improve this answer
Thank you for the advice! I'll keep that issue in mind. Probably will learn it the hard way ( "it will fail miserably...") but I try to implement your advise right away. Lumpi – Lumpi Apr 23 '11 at 10:31
add comment
According to the link you posted, CStdString derives from basic_string<TCHAR>. Thus, you can use its c_str() method.
const TCHAR *GetConnectionString()
{
return m_szConnectionString.c_str();
}
share|improve this answer
Thank you Frédéric ! Now it compiles without errors! I really hate the fact that there exist about 5billion different types of strings and chars. Ok, i understand that some different basic versions are nedded, but to me it feels like I find a new "string issue" every day.. Anyway, thank you for your help! – Lumpi Apr 23 '11 at 10:12
@Lumpi, you think C++ has string issues? You should try plain C sometime, so you can see what real string issues are (hint: no string type ;) – Frédéric Hamidi Apr 23 '11 at 10:17
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/5763532/convert-cstdstringw-to-tchar",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "67591",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2U763YLFKON57RLQ6K3YQDKNKRCFO5PP",
"WARC-Concurrent-To": "<urn:uuid:4dd5d0b5-e93d-4f1d-ae1e-dce6ee5a9371>",
"WARC-Date": "2014-03-08T23:21:52Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6ZUKLBMYWBNLLRWNBHWIOHQMJZUXR736",
"WARC-Record-ID": "<urn:uuid:22fcb5f2-9f17-4a01-a08e-6be780cf2c99>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5763532/convert-cstdstringw-to-tchar",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1cabc94-2dd4-47cd-8ac1-c7f69c87dbf5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
355,
356,
422,
423,
484,
485,
809,
810,
872,
873,
887,
888,
916,
920,
1002,
1014,
1015,
1025,
1026,
1055,
1056,
1183,
1184,
1219,
1252,
1255,
1256,
1329,
1330,
1367,
1409,
1412,
1413,
1590,
1591,
1617,
1619,
1824,
1836,
1837,
1954,
1955,
1990,
1992,
2033,
2035,
2061,
2063,
2399,
2401,
2582,
2594,
2595,
2607,
2608,
2610,
2618,
2619,
2697,
2698
],
"line_end_idx": [
25,
157,
158,
355,
356,
422,
423,
484,
485,
809,
810,
872,
873,
887,
888,
916,
920,
1002,
1014,
1015,
1025,
1026,
1055,
1056,
1183,
1184,
1219,
1252,
1255,
1256,
1329,
1330,
1367,
1409,
1412,
1413,
1590,
1591,
1617,
1619,
1824,
1836,
1837,
1954,
1955,
1990,
1992,
2033,
2035,
2061,
2063,
2399,
2401,
2582,
2594,
2595,
2607,
2608,
2610,
2618,
2619,
2697,
2698,
2788
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2788,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0.002869440009817481,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3481989800930023,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03773584961891174,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23156088590621948,
"rps_doc_frac_unique_words": 0.5246636867523193,
"rps_doc_mean_word_length": 4.809417247772217,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.0034305299632251263,
"rps_doc_unigram_entropy": 5.115222930908203,
"rps_doc_word_count": 446,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0419580414891243,
"rps_doc_frac_chars_dupe_6grams": 0.013986010104417801,
"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.009324010461568832,
"rps_doc_frac_chars_top_3gram": 0.013053609989583492,
"rps_doc_frac_chars_top_4gram": 0.016783220693469048,
"rps_doc_books_importance": -218.4419403076172,
"rps_doc_books_importance_length_correction": -218.4419403076172,
"rps_doc_openwebtext_importance": -156.43080139160156,
"rps_doc_openwebtext_importance_length_correction": -156.43080139160156,
"rps_doc_wikipedia_importance": -162.51638793945312,
"rps_doc_wikipedia_importance_length_correction": -162.51638793945312
},
"fasttext": {
"dclm": 0.0501287616789341,
"english": 0.8616284132003784,
"fineweb_edu_approx": 1.339476227760315,
"eai_general_math": 0.003664429998025298,
"eai_open_web_math": 0.11781883239746094,
"eai_web_code": 0.0000033399999210814713
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-4,768,478,255,787,105,000 |
Django: Ticket #18889: Provide a simple way to retain parent instances after children are deleted https://code.djangoproject.com/ticket/18889 <p> I have a Location table with two children (using table-inheritance): Restaurant and ChipShop. There should be a simple way to convert a ChipShop to a Restaurant without deleting/recreating the Location which may be referenced by lots of foreign keys, e.g: </p> <pre class="wiki">location = Location.objects.get(1) # Currently a ChipShop restaurant = Restaurant(location_ptr=location) restaurant.save() location.chipshop.delete() # Deletes the ChipShop row but not the Location </pre><p> Currently this can be achieved by using raw sql to bypass django's code that deletes the parent when a child is deleted. Doing the following does not work as the parent is still deleted, perhaps this is a bug? </p> <pre class="wiki">class ChipShop(Location); location_ptr = models.OneToOneField(Location, on_delete=DO_NOTHING, parent_link=True) </pre><p> Modifying the on_delete of the created location_ptr does nothing as well. Perhaps a setting in the parents Meta that could be used to specify that the parent should not be deleted when the child is? </p> en-us Django https://www.djangoproject.com/s/img/site/hdr_logo.gif https://code.djangoproject.com/ticket/18889 Trac 1.0.4 anonymous Sat, 01 Sep 2012 01:49:07 GMT needs_docs, needs_tests, needs_better_patch set https://code.djangoproject.com/ticket/18889#comment:1 https://code.djangoproject.com/ticket/18889#comment:1 <ul> <li><strong>needs_docs</strong> unset </li> <li><strong>needs_tests</strong> unset </li> <li><strong>needs_better_patch</strong> unset </li> </ul> Ticket IonelMaries Sat, 01 Sep 2012 13:18:53 GMT cc set https://code.djangoproject.com/ticket/18889#comment:2 https://code.djangoproject.com/ticket/18889#comment:2 <ul> <li><strong>cc</strong> <em>ionel.mc@…</em> added </li> </ul> Ticket akaariai Mon, 05 Nov 2012 16:05:13 GMT stage changed https://code.djangoproject.com/ticket/18889#comment:3 https://code.djangoproject.com/ticket/18889#comment:3 <ul> <li><strong>stage</strong> changed from <em>Unreviewed</em> to <em>Accepted</em> </li> </ul> <p> I do think having some way to do this would be good. At least I have had need to do obj.delete(delete_parents=False). Not sure if that is the best API... </p> Ticket charettes Mon, 05 Nov 2012 18:26:42 GMT cc, version changed https://code.djangoproject.com/ticket/18889#comment:4 https://code.djangoproject.com/ticket/18889#comment:4 <ul> <li><strong>cc</strong> <em>charette.s@…</em> added </li> <li><strong>version</strong> changed from <em>1.4</em> to <em>master</em> </li> </ul> Ticket
|
{
"url": "https://code.djangoproject.com/ticket/18889?format=rss",
"source_domain": "code.djangoproject.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "4888",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EWMXBK5NSJTARUVLJ3XK5CLBCIMGXF57",
"WARC-Concurrent-To": "<urn:uuid:cca13ce7-1f09-446e-8b79-c94d40678470>",
"WARC-Date": "2015-04-25T16:45:50Z",
"WARC-IP-Address": "162.242.220.127",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CNNTIYUNLYGYJQDXNTAVHZSEYLTEN2GJ",
"WARC-Record-ID": "<urn:uuid:9a822d49-b254-4520-a344-8154f814bcda>",
"WARC-Target-URI": "https://code.djangoproject.com/ticket/18889?format=rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:83e17254-6586-4744-b4f6-6b763ac269bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2652
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2652,
"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.18786126375198364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013005780056118965,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4364161789417267,
"rps_doc_frac_unique_words": 0.5486111044883728,
"rps_doc_mean_word_length": 6.986111164093018,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.020231209695339203,
"rps_doc_unigram_entropy": 4.788698196411133,
"rps_doc_word_count": 288,
"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.007952289655804634,
"rps_doc_frac_chars_top_3gram": 0.014910539612174034,
"rps_doc_frac_chars_top_4gram": 0.011928429827094078,
"rps_doc_books_importance": -300.6159973144531,
"rps_doc_books_importance_length_correction": -300.6159973144531,
"rps_doc_openwebtext_importance": -168.14907836914062,
"rps_doc_openwebtext_importance_length_correction": -168.14907836914062,
"rps_doc_wikipedia_importance": -82.1236572265625,
"rps_doc_wikipedia_importance_length_correction": -82.1236572265625
},
"fasttext": {
"dclm": 0.02684164047241211,
"english": 0.7896437644958496,
"fineweb_edu_approx": 1.7574571371078491,
"eai_general_math": 0.031208159402012825,
"eai_open_web_math": 0.1894811987876892,
"eai_web_code": 0.0791318416595459
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,036,322,266,885,261,000 |
This documentation is for the old version. Go to the latest Graphics Mill docs
CustomFormatWriter.UpdateEvents Method
Updates the progress state while writing a bitmap.
Namespace: Aurigma.GraphicsMill.Codecs
Assembly: Aurigma.GraphicsMill (in Aurigma.GraphicsMill.dll)
Syntax
Visual Basic
Protected Friend Sub UpdateEvents
C#
protected internal void UpdateEvents()
Remarks
This method should be called after completing a successive step of the operation, for example, after writing a pixel row.
It has the same effect as calling the UpdateEvents(Int32) method with the valueToUpdateProgress equal to 1.
See Also
Reference
|
{
"url": "https://www.graphicsmill.com/docs/gm5/M_Aurigma_GraphicsMill_Codecs_CustomFormatWriter_UpdateEvents.htm",
"source_domain": "www.graphicsmill.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "52186",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K332ZCZE2AUMISCMGU62KCSMRK2X3T7J",
"WARC-Concurrent-To": "<urn:uuid:1c7079d1-2723-4eb7-b8bf-60ef199e77d3>",
"WARC-Date": "2020-10-27T06:16:25Z",
"WARC-IP-Address": "161.47.109.224",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YS7ZKWNRI4FZJGMJQBLINBEJTD4PZNJ4",
"WARC-Record-ID": "<urn:uuid:b3cabec8-2f6b-4fcc-8805-9fc608a08f47>",
"WARC-Target-URI": "https://www.graphicsmill.com/docs/gm5/M_Aurigma_GraphicsMill_Codecs_CustomFormatWriter_UpdateEvents.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:880fae17-a3d1-4bd4-a8dd-2ee28083489f>"
},
"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-244.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,
79,
80,
119,
120,
171,
172,
211,
272,
273,
280,
281,
294,
328,
331,
370,
371,
379,
380,
502,
503,
611,
612,
621,
622
],
"line_end_idx": [
79,
80,
119,
120,
171,
172,
211,
272,
273,
280,
281,
294,
328,
331,
370,
371,
379,
380,
502,
503,
611,
612,
621,
622,
631
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 631,
"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.2568807303905487,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00917430967092514,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19266055524349213,
"rps_doc_frac_unique_words": 0.792682945728302,
"rps_doc_mean_word_length": 6.329268455505371,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.00917430967092514,
"rps_doc_unigram_entropy": 4.041876316070557,
"rps_doc_word_count": 82,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03082852065563202,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -65.92117309570312,
"rps_doc_books_importance_length_correction": -77.5456771850586,
"rps_doc_openwebtext_importance": -36.01494216918945,
"rps_doc_openwebtext_importance_length_correction": -47.63944625854492,
"rps_doc_wikipedia_importance": -24.866222381591797,
"rps_doc_wikipedia_importance_length_correction": -36.490726470947266
},
"fasttext": {
"dclm": 0.5447190999984741,
"english": 0.7252572178840637,
"fineweb_edu_approx": 2.485858678817749,
"eai_general_math": 0.23553550243377686,
"eai_open_web_math": 0.295363187789917,
"eai_web_code": 0.1056641936302185
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,372,981,924,000,569,300 |
Selecting mailbox migration software
I am asked on a fairly regular basis to recommend software to migrate data from different systems to Exchange (either on-premises or cloud). I don’t want to endorse any software in any way, but I think it worthwhile to set down a number of principles that can be used to guide a company in making a choice from the available software.
Here are the consideration that I advise people to consider when the time comes to pick migration software:
• Cost. This is actually an interesting topic because of the old adage that if you pay peanuts, you might get monkeys. In other words, sometimes the lowest cost option is not the best, especially when it comes to migrating content from a high-fidelity and high-function system like Lotus Notes. Migration from POP3 or IMAP4 is quite a different matter because all you need to worry about is how to move messages. Make sure that you understand the exact breakdown of all costs involved in using migration software, including fees for updates or annual license renewals.
• Multi-type support. As noted above, it is relatively straightforward to move email messages from one repository to another. It is quite another matter to process calendar items, tasks, contacts, and other item types. The first issue is to understand what types are actually used and how they are used; the second is to ensure that the different types of items can be migrated in such a way that they remain useful when accessed through the target system.
• Reputation. Check out customer experiences with different migration tools. In the Internet age, you can’t but find stories posted of migration horrors. Fewer exist of migration triumphs because humans generally don’t report their successes, but the problems will give you some guidance about pitfalls to avoid.
• Test. Ask vendors for test licenses and test the migration process. Don’t test a small mailbox; take a copy of a nice juicy complicated mailbox and test what happens when that is processed. Include common user scenarios such as delegate access and shared mailboxes. Then do a set of mailboxes to understand how long it will take for the migration to happen and what to expect when it does happen. Make sure that the test mailboxes are of a reasonable size and age (very important). Any migration software can move 100MB mailboxes that have been created specially for test purposes. It’s much better to give them a nice fat 5GB mailbox that’s been in use for six or seven years and has been exposed to potential sources of corruptions (mobile clients and Outlook add-ins are the usual suspects). Always remember that real mailboxes expose real problems for migration software.
• Support. Who delivers the support during your migration project? If it is a local reseller, what relationship do they have with the folks who actually write the code? What turnaround time is likely if you report problems and what escalation path is used to pursue the closure of problems? Do you have a guarantee that you will get a refund if the migration doesn’t work? How quick do you have to make up your mind about whether software is suitable?
• Information. Apart from the sales-type information available on their web site that tells you just how wonderful their software really is, what other information does a vendor provide? Some vendors do an excellent job of documenting the technical side of their products, including some of the warts, and some do not. I prefer when detailed in-depth information is available. I expect that you do too.
• Added value. Moving mailboxes is expected, but does the software give you any extra capabilities such as moving mailboxes in the background, scheduling capabilities, automation, or project management?
• Post-migration tasks. What work must be done following mailbox moves to make users productive in the new environment? For instance, do you have to recreate Outlook profiles or will Autodiscover work with the new mailbox data?
• What does the local Microsoft subsidiary use? Ask your local MCS contact to find out and ask why they made that selection (and what their experience has been). It’s not a deciding factor because the other factors have to considered too in the context of the data to be migrated, number, customer preferences, etc., but it’s a good thing to know – if only because your company might ask why you selected a different tool.
• Applications. Although email systems serve to send and deliver email, many also include some aspect of application development. Lotus Notes is probably the best example as most Lotus Notes deployments include applications (the original raison d’etre for Notes). How will applications be migrated?
• Plan B. Can you use the migration software to reverse course and move data back to the original system should the need arise? Having a one-way option is OK if you are absolutely sure that this is all that is required, but you’d be surprised how many times the need arises to move a mailbox back to its original home.
Some people love the technology exhibition at most large Microsoft-related conferences such as TechEd and MEC. I don’t care for them very much because I think most of the vendors do pretty well the same thing as they’ve been doing for the last decade to attract customers (how many cheap t-shirts can you pick up at a conference?). There are some notable differences who try and make their stands more interesting and welcome (ENow Software (who also host excellent parties) and Binary Tree are two companies that come to mind in this respect), but in general I find exhibitions a drag. The reason why I mention them here is that they can be a very useful place to learn about migration software and, possibly even more important, to make contacts with developers who work on the code and might be able to help you during your migration projects.
Companies that I have commonly encountered in Exchange migration projects include the set listed below. Most can handle migrations to both on-premises and cloud Exchange and accommodate multiple sources including Lotus Notes, IMAP/POP, Gmail, GroupWise, and Zimbra.
Binary Tree
Skykick
Dell Software (ex Quest)
MigrationWiz
Priasoft
Again, no endorsement of any software is offered here and the list of available suppliers is acknowledged to be incomplete. Test them using some realistic mailboxes before you make a final choice.
Follow Tony @12Knocksinna
About Tony Redmond
Lead author for the Office 365 for IT Pros eBook and writer about all aspects of the Office 365 ecosystem.
This entry was posted in Email, Exchange, Office 365 and tagged , , , , , , , , , , . Bookmark the permalink.
1 Response to Selecting mailbox migration software
1. Thanks for mentioning Priasoft!
I’d add to your list support for Outlook profiles. Outlook + Auto-Discover is not a proper option except for same-forest migrations. Migrating terabytes of data is often of little value if end users have difficulty accessing those shiny new mailboxes :). Updating existing profiles is more complicated than just changing a server name and starting with new profiles impacts the end-user experience and thereby the perception of success. This is even more important now with Exchange 2013 and the requirement that all connections be HTTP/S.
Leave a Reply to Eriq VanBibber Cancel 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
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://thoughtsofanidlemind.com/2014/05/07/selecting-mailbox-migration-software/?replytocom=11657",
"source_domain": "thoughtsofanidlemind.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "93767",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SUSOTG3SXUWEQMOSH64NIRJMWD7H7GE2",
"WARC-Concurrent-To": "<urn:uuid:70a574ee-a2c0-468a-877e-acace413d7f0>",
"WARC-Date": "2021-09-26T10:47:12Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QDVT3UXRQ23HGT5VK4AOR5WEPFZFF54R",
"WARC-Record-ID": "<urn:uuid:01157794-688b-4291-9bef-f67df30d4def>",
"WARC-Target-URI": "https://thoughtsofanidlemind.com/2014/05/07/selecting-mailbox-migration-software/?replytocom=11657",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ffc1ca22-21ca-490b-ba44-5f51419b5fe1>"
},
"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-130\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,
37,
38,
39,
374,
375,
483,
484,
1055,
1514,
1829,
2709,
3163,
3568,
3773,
4003,
4428,
4729,
5050,
5051,
5899,
5900,
6166,
6167,
6179,
6180,
6188,
6189,
6214,
6215,
6228,
6229,
6238,
6239,
6436,
6437,
6463,
6464,
6483,
6484,
6591,
6701,
6702,
6753,
6754,
6791,
6792,
7336,
7337,
7382,
7383,
7438,
7439,
7458,
7459,
7532,
7533,
7546,
7547,
7613,
7614,
7630,
7631,
7698,
7699,
7714,
7715,
7783,
7784,
7801,
7802
],
"line_end_idx": [
37,
38,
39,
374,
375,
483,
484,
1055,
1514,
1829,
2709,
3163,
3568,
3773,
4003,
4428,
4729,
5050,
5051,
5899,
5900,
6166,
6167,
6179,
6180,
6188,
6189,
6214,
6215,
6228,
6229,
6238,
6239,
6436,
6437,
6463,
6464,
6483,
6484,
6591,
6701,
6702,
6753,
6754,
6791,
6792,
7336,
7337,
7382,
7383,
7438,
7439,
7458,
7459,
7532,
7533,
7546,
7547,
7613,
7614,
7630,
7631,
7698,
7699,
7714,
7715,
7783,
7784,
7801,
7802,
7882
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7882,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4389110207557678,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016600269824266434,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13081009685993195,
"rps_doc_frac_unique_words": 0.4095827043056488,
"rps_doc_mean_word_length": 4.891035556793213,
"rps_doc_num_sentences": 77,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.62263822555542,
"rps_doc_word_count": 1294,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.017380310222506523,
"rps_doc_frac_chars_dupe_6grams": 0.009480169974267483,
"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.021488390862941742,
"rps_doc_frac_chars_top_3gram": 0.01011218037456274,
"rps_doc_frac_chars_top_4gram": 0.013272239826619625,
"rps_doc_books_importance": -652.6240844726562,
"rps_doc_books_importance_length_correction": -652.6240844726562,
"rps_doc_openwebtext_importance": -323.1118469238281,
"rps_doc_openwebtext_importance_length_correction": -323.1118469238281,
"rps_doc_wikipedia_importance": -261.1220703125,
"rps_doc_wikipedia_importance_length_correction": -261.1220703125
},
"fasttext": {
"dclm": 0.026142539456486702,
"english": 0.9265480637550354,
"fineweb_edu_approx": 1.7516295909881592,
"eai_general_math": 0.02475130930542946,
"eai_open_web_math": 0.22721397876739502,
"eai_web_code": 0.0009740599780343473
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,928,928,666,204,249,600 |
Can you manually create a migration file in django
Create file django
Add: edavisik64 - Date: 2020-11-27 12:45:59 - Views: 9466 - Clicks: 2350
Migration files are composed of one or more Operation s, objects that declaratively record what the migration should do to your database. If not specified then Django would create migrations for all installed apps, only if there are any changes in the models. With this, you are have created backend.
Django provides a check subcommand which checks for errors in models. So what makemigrationscommand did? You can test this fact by adding an arbitrary method to any model class and running the makemigrationscommand.
py in the example app folder. py makemigrations --empty yourappname, but be aware that manually adding schema-altering operations can confuse the migration. All the migrations which have X in front of them are applied to the database. While testing your Bitcoin tracker, you realize that you made a mistake. Can Django create migrations?
py migrate --ignore-ghost-migrations --merge --fake For django version < 1. On the other hand, if you already have a database then Django will modi. There are two ways to revert the changes we have made:.
· Once you create and save this migration file, you can now access the related model. Want to restore a backup that was created when the database still had an older schema Luckily, migrations don’t have to be a one-way street. Want to test a migration a colleague wrote 2. Some of the other apps listed there also come with migrations, and the migratemanagement command applies the migrations for all installed apps by default. Django can create migrations. If you previously created and modified your database tables with hand-written SQL, you have now become much more efficient by delegating this work to Django migrations. pip install django-replace-migrations and add django_migration_linter to your list of installed apps.
Simple Workflow. It’s also very flexible. Now we are ready to create our first migration. Create or update a model 2. All database systems supported by Django use the language SQL to create, read, update and delete data in a relational database. You will see the output like this: In the preceding can you manually create a migration file in django command, we have specified the name of the app we want to create migrations for i. . Step 3 (optional) – View the SQL query that Django would use to update the database using the sqlmigratecommand.
The behavior of migrate subcommand depends upon how many arguments are passed to it. · In your project, you can find your migration files (. Recall that we have already used this command several times in the chapter Creating Django project. Step 2 – Create migration file using makemigrationscommand. Now, to create a model, add this class in historical_data/models. Now you know how to make changes to your database schema by creating and applying migrations. If you are facing trouble while reverting back the migration, and somehow have messed it, you can perform fake migrations.
Remember the setting INSTALLED_APPS? Internally, Django uses a django. Working directly with SQL can b. You have already unapplied it, so you can safely delete the file: Now you can recreate it with a more descriptive name: This will create the same migration as before except with the new name of 0002_switch_to_decimals.
With Django installed, you can create the project using the following commands: This gives you a simple project and an app called historical_data. The sqlmigraterequires two arguments, name of the app and migration name. Lines starting with -- are comments, everything else is plain old SQL. To apply the changes outlined by the migrations we use the migrate subcommand. py migrate to migrate everything or. Let’s have another look at the directory tree: As you can see, the migrations directory now contains a new file: 0001_initial. Is there a Django migration folder?
In Django, database migrations usually go hand in hand with models: whenever you code up a new model, you also generate a migration to create the necessary table in the database. Press Y or y to confirm. In this section, I will create a Django view that will pass data into a template. Remember, we are not running migrations on database! A database table has a certain number of columns, but it can have any number of rows. To do so, specify app name followed by migration name you want to migrate to.
It helps track which migrations have already run and which needs to be run. Right now, we have 11 tables in our database. Read more about DB settings here. In the next tutorial in this series, you will dig deeper into the topic and learn how Django Migrations work under the hood. . By creating and applying a migration. You can run the following command to generate an empty migration file in which you will add operations.
Because we did migration for model Admin for the first time, the migration file name will be. For our little example, the showmigrationscommand is not particularly exciting, but it comes in handy when you start working on an existing code base or work in a team where you are not the only person adding migrations. In other words, Django will use migration file to create SQL queries t. Let’s change the model to look like this: Without migrations, you would have to figure out the SQL syntax to turn a PositiveIntegerField into a DecimalField. So how do you change the database tables? Your models are not set in stone. You might add or remove fields or change their types and options. Instead of creating HTML form manually, Django has its easy way of doing it.
But before we run migratecommand. This process can be performed very easily in many situations but can also become complex if you have a big number of migration files and database tables. Note that here I create three migration files for a simple data migration. You can take a peek at the database with the dbshell management command.
See full list on realpython. Adding, modifying or deleting model methods are not considered as changes. Django will create a migration file in folder migrations located in the same as the model directory. To try that out, you first have to remove the old migration. Migration Operations¶. py in the migrations directory of the blog app. In this section, we are going to rename one of the fields of the Post model from pub_date to publication_dateusing migration and then we will revert the changes using migrations. SQL is also used to create, change, and delete the database tables themselves.
We will use this migration file to update our database. In a relational database, data is organized in tables. Let’s take a look at the current state of our database. You have not manually edited your database - Django won’t be able to detect that your database doesn’t match your models, you’ll just get errors when migrations try to modify those. The migration that you generated in the previous step has created the historical_data_pricehistory table. The first step is to install Django. It means that Django will run the migration 0001_initialbefore running the second migration. This migration file reflects the current state of ou.
This works for Django migrations, as well as other similar apps (sqlalchemy+alembic, RoR, etc). If you need an empty migration file to write your own Operation objects into, just use python manage. Sometimes you’ll need to reset your Django migrations or simply make a clean up. The second method is quick and easy.
· Can we manage a raw SQL entry in a Django migration? It should look this: As you can see the migration file consists of a regular Python class which inherits from migrations. Django uses dependencies attribute of migration file to determine the can you manually create a migration file in django order in which migration file should be run. The trick here is that, we are just letting the Django know about the Models relations but in reality it does not exist. The only unapplied migration is 0001_initialin the djangobin app.
Create Form to Take the User Input. You should always use can you manually create a migration file in django the checkcommand to look for errors in your models before creating a migration file. · Django can&39;t automatically generate data migrations for you, but you can write one yourself. You can set can you manually create a migration file in django the FIXTURE_DIRS setting to a list of additional directories where Django should look. If you pass app name as an argument, migratewill run the unapplied migrations only from the specified app. If we don’t specify the app name then Django would create migrations for all installed apps, assuming there are any changes in the models. Then the dependenciesattribute for the second migration file will look like this: In this case, dependencies attribute refers to the 0001_initial migration of the djangobin app. py migrate to migrate.
and add django_migration_linter to your list of installed apps. Where Django finds fixture files¶ By default, Django looks in the fixtures directory inside each app for fixtures. In many cases, the effects of a migration can be undone by unapplying a migration. The makemigrations command has created a migration file named 0001_initial. As you can see, it’s fairly easy to create this type of migration. That will change when you apply the migration. To unapply a migration, you have to call migrate with the name of the app and the name of the migration beforethe migration you want to unapply.
Let’s create the front-end (form) to take the data from user. After that we can then create a new migration to set the field as null=False. If you’re not happy with that, then you can use the --name parameter to provide a custom name (without the. If you don’t already have a database then migrate command will create an SQLite database named db. Django detects changes only when you add, modify or delete model fields or Meta class only. py Step 1 – Check for errors in the model using the checkcommand. If you were not us. At some point, you might want to undo changes and switch back to an earlier database schema because you: 1.
In line 11, initial=True indicates that this is our first migration for the djangobin app. · Whenever your run makemigrations command Django compares the current version of the model with the historical version of the model stored in the migration files to figure out what&39;s needs to be added, updated or removed from the database and then creates a migration file based on the changes it encounters. In the above command, we have specified the blog app, although this is optional.
a file attached to a model as above, or perhaps an uploaded file). See full list on overiq. But where do all the other migrations come from? You can use the showmigrationscommand: This lists all apps in the project and the migrations associated with each app. If you were not using migra. Just to make sure you understand migrations completely.
Let’s inspect it using the. See more results. quitto exit the SQLite shell. This will create a new migration file inside the migrationsdirectory in the blog app. Their names give you an idea of their purpose.
Can you manually create a migration file in django
email: [email protected] - phone:(749) 293-3351 x 3012
Lampada q ascende com acetona you tube manual do mundo - Auto hawk
-> Hp laserjet ii nt manual
-> Audioquest niagara 5000 manual
Can you manually create a migration file in django - Mano morris manual
Sitemap 1
Heizomat manual - Onix cambio manual medio
|
{
"url": "http://woov.recept-club.ru/92d3e8de23d7f-170",
"source_domain": "woov.recept-club.ru",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "18223",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZN47GM2PFWIJZ7OBPHO7NQHF2MYFOWHD",
"WARC-Concurrent-To": "<urn:uuid:7a1f94c1-9d5a-400b-a91d-d374f7e955b3>",
"WARC-Date": "2021-11-27T21:13:46Z",
"WARC-IP-Address": "5.189.150.90",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:V3AOU2ICFZHAS56SMDLHB2SAYXGZZXOY",
"WARC-Record-ID": "<urn:uuid:d43e5624-676f-40ad-9001-5181526d89cf>",
"WARC-Target-URI": "http://woov.recept-club.ru/92d3e8de23d7f-170",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5537a6b1-5c51-4cc2-8af5-a166b50fdb58>"
},
"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,
51,
52,
71,
72,
145,
146,
447,
448,
664,
665,
1003,
1004,
1209,
1210,
1939,
1940,
2487,
2488,
3072,
3073,
3396,
3397,
3968,
3969,
4472,
4473,
4898,
4899,
5663,
5664,
6000,
6001,
6596,
6597,
7236,
7237,
7553,
7554,
8084,
8085,
8974,
8975,
9572,
9573,
10206,
10207,
10692,
10693,
11038,
11039,
11248,
11249,
11300,
11301,
11357,
11358,
11425,
11426,
11454,
11488,
11489,
11561,
11562,
11563,
11573,
11574
],
"line_end_idx": [
51,
52,
71,
72,
145,
146,
447,
448,
664,
665,
1003,
1004,
1209,
1210,
1939,
1940,
2487,
2488,
3072,
3073,
3396,
3397,
3968,
3969,
4472,
4473,
4898,
4899,
5663,
5664,
6000,
6001,
6596,
6597,
7236,
7237,
7553,
7554,
8084,
8085,
8974,
8975,
9572,
9573,
10206,
10207,
10692,
10693,
11038,
11039,
11248,
11249,
11300,
11301,
11357,
11358,
11425,
11426,
11454,
11488,
11489,
11561,
11562,
11563,
11573,
11574,
11616
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11616,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4317880868911743,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00794702023267746,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13863134384155273,
"rps_doc_frac_unique_words": 0.2802056670188904,
"rps_doc_mean_word_length": 4.794858455657959,
"rps_doc_num_sentences": 134,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.320287227630615,
"rps_doc_word_count": 1945,
"rps_doc_frac_chars_dupe_10grams": 0.009650439955294132,
"rps_doc_frac_chars_dupe_5grams": 0.08406604826450348,
"rps_doc_frac_chars_dupe_6grams": 0.06026162952184677,
"rps_doc_frac_chars_dupe_7grams": 0.06026162952184677,
"rps_doc_frac_chars_dupe_8grams": 0.05404245853424072,
"rps_doc_frac_chars_dupe_9grams": 0.05404245853424072,
"rps_doc_frac_chars_top_2gram": 0.033454861491918564,
"rps_doc_frac_chars_top_3gram": 0.016512969508767128,
"rps_doc_frac_chars_top_4gram": 0.017156340181827545,
"rps_doc_books_importance": -1117.197998046875,
"rps_doc_books_importance_length_correction": -1117.197998046875,
"rps_doc_openwebtext_importance": -587.01416015625,
"rps_doc_openwebtext_importance_length_correction": -587.01416015625,
"rps_doc_wikipedia_importance": -461.0608825683594,
"rps_doc_wikipedia_importance_length_correction": -461.0608825683594
},
"fasttext": {
"dclm": 0.2848316431045532,
"english": 0.890966534614563,
"fineweb_edu_approx": 2.4450387954711914,
"eai_general_math": 0.8586011528968811,
"eai_open_web_math": 0.20156311988830566,
"eai_web_code": 0.9627893567085266
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,066,572,824,561,321,000 |
wxUpdateUIEvent.3erl - Man Page
Functions for wxUpdateUIEvent class
Description
This class is used for pseudo-events which are called by wxWidgets to give an application the chance to update various user interface elements.
Without update UI events, an application has to work hard to check/uncheck, enable/disable, show/hide, and set the text for elements such as menu items and toolbar buttons. The code for doing this has to be mixed up with the code that is invoked when an action is invoked for a menu item or button.
With update UI events, you define an event handler to look at the state of the application and change UI elements accordingly. wxWidgets will call your member functions in idle time, so you don't have to worry where to call this code.
In addition to being a clearer and more declarative method, it also means you don't have to worry whether you're updating a toolbar or menubar identifier. The same handler can update a menu item and toolbar button, if the identifier is the same. Instead of directly manipulating the menu or button, you call functions in the event object, such as check/2. wxWidgets will determine whether such a call has been made, and which UI element to update.
These events will work for popup menus as well as menubars. Just before a menu is popped up, wxMenu::UpdateUI (not implemented in wx) is called to process any UI events for the window that owns the menu.
If you find that the overhead of UI update processing is affecting your application, you can do one or both of the following:
Note that although events are sent in idle time, defining a wxIdleEvent handler for a window does not affect this because the events are sent from wxWindow::OnInternalIdle (not implemented in wx) which is always called in idle time.
wxWidgets tries to optimize update events on some platforms. On Windows and GTK+, events for menubar items are only sent when the menu is about to be shown, and not in idle time.
See: Overview events
This class is derived (and can use functions) from: wxCommandEvent wxEvent
wxWidgets docs: wxUpdateUIEvent
Events
Use wxEvtHandler:connect/3 with wxUpdateUIEventType to subscribe to events of this type.
Data Types
wxUpdateUIEvent() = wx:wx_object()
wxUpdateUI() =
#wxUpdateUI{type = wxUpdateUIEvent:wxUpdateUIEventType()}
wxUpdateUIEventType() = update_ui
Exports
canUpdate(Window) -> boolean()
Types:
Window = wxWindow:wxWindow()
Returns true if it is appropriate to update (send UI update events to) this window.
This function looks at the mode used (see setMode/1), the wxWS_EX_PROCESS_UI_UPDATES flag in window, the time update events were last sent in idle time, and the update interval, to determine whether events should be sent to this window now. By default this will always return true because the update mode is initially wxUPDATE_UI_PROCESS_ALL and the interval is set to 0; so update events will be sent as often as possible. You can reduce the frequency that events are sent by changing the mode and/or setting an update interval.
See: resetUpdateTime/0, setUpdateInterval/1, setMode/1
check(This, Check) -> ok
Types:
This = wxUpdateUIEvent()
Check = boolean()
Check or uncheck the UI element.
enable(This, Enable) -> ok
Types:
This = wxUpdateUIEvent()
Enable = boolean()
Enable or disable the UI element.
show(This, Show) -> ok
Types:
This = wxUpdateUIEvent()
Show = boolean()
Show or hide the UI element.
getChecked(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the UI element should be checked.
getEnabled(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the UI element should be enabled.
getShown(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the UI element should be shown.
getSetChecked(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the application has called check/2.
For wxWidgets internal use only.
getSetEnabled(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the application has called enable/2.
For wxWidgets internal use only.
getSetShown(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the application has called show/2.
For wxWidgets internal use only.
getSetText(This) -> boolean()
Types:
This = wxUpdateUIEvent()
Returns true if the application has called setText/2.
For wxWidgets internal use only.
getText(This) -> unicode:charlist()
Types:
This = wxUpdateUIEvent()
Returns the text that should be set for the UI element.
getMode() -> wx:wx_enum()
Static function returning a value specifying how wxWidgets will send update events: to all windows, or only to those which specify that they will process the events.
See: setMode/1
getUpdateInterval() -> integer()
Returns the current interval between updates in milliseconds.
The value -1 disables updates, 0 updates as frequently as possible.
See: setUpdateInterval/1
resetUpdateTime() -> ok
Used internally to reset the last-updated time to the current time.
It is assumed that update events are normally sent in idle time, so this is called at the end of idle processing.
See: canUpdate/1, setUpdateInterval/1, setMode/1
setMode(Mode) -> ok
Types:
Mode = wx:wx_enum()
Specify how wxWidgets will send update events: to all windows, or only to those which specify that they will process the events.
setText(This, Text) -> ok
Types:
This = wxUpdateUIEvent()
Text = unicode:chardata()
Sets the text for this UI element.
setUpdateInterval(UpdateInterval) -> ok
Types:
UpdateInterval = integer()
Sets the interval between updates in milliseconds.
Set to -1 to disable updates, or to 0 to update as frequently as possible. The default is 0.
Use this to reduce the overhead of UI update events if your application has a lot of windows. If you set the value to -1 or greater than 0, you may also need to call wxWindow:updateWindowUI/2 at appropriate points in your application, such as when a dialog is about to be shown.
Info
wx 2.2 wxWidgets team. Erlang Module Definition
|
{
"url": "https://www.mankier.com/3/wxUpdateUIEvent.3erl",
"source_domain": "www.mankier.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "12079",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:63ZFNX3LAR536T7UYSFD6I6U2ITPNHWY",
"WARC-Concurrent-To": "<urn:uuid:9caccdc6-c0b1-4669-ac27-90101760431b>",
"WARC-Date": "2022-09-24T15:43:36Z",
"WARC-IP-Address": "104.21.0.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MAMPV5WFJTXPRBICELLLKFC7POPQLCPH",
"WARC-Record-ID": "<urn:uuid:01851ae3-1fa4-4009-9351-58b932bd83b9>",
"WARC-Target-URI": "https://www.mankier.com/3/wxUpdateUIEvent.3erl",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fb42aa7f-65e3-4942-af01-d5b9b706c181>"
},
"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-116\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,
69,
70,
82,
83,
227,
228,
527,
528,
763,
764,
1212,
1213,
1417,
1418,
1544,
1545,
1778,
1779,
1958,
1959,
1980,
1981,
2056,
2057,
2089,
2090,
2097,
2098,
2187,
2188,
2199,
2200,
2235,
2251,
2313,
2347,
2348,
2356,
2357,
2388,
2395,
2396,
2425,
2426,
2510,
2511,
3041,
3042,
3097,
3098,
3123,
3130,
3131,
3156,
3174,
3175,
3208,
3209,
3236,
3243,
3244,
3269,
3288,
3289,
3323,
3324,
3347,
3354,
3355,
3380,
3397,
3398,
3427,
3428,
3458,
3465,
3466,
3491,
3492,
3542,
3543,
3573,
3580,
3581,
3606,
3607,
3657,
3658,
3686,
3693,
3694,
3719,
3720,
3768,
3769,
3802,
3809,
3810,
3835,
3836,
3888,
3889,
3922,
3923,
3956,
3963,
3964,
3989,
3990,
4043,
4044,
4077,
4078,
4109,
4116,
4117,
4142,
4143,
4194,
4195,
4228,
4229,
4259,
4266,
4267,
4292,
4293,
4347,
4348,
4381,
4382,
4418,
4425,
4426,
4451,
4452,
4508,
4509,
4535,
4536,
4702,
4703,
4718,
4719,
4752,
4753,
4815,
4816,
4884,
4885,
4910,
4911,
4935,
4936,
5004,
5005,
5119,
5120,
5169,
5170,
5190,
5197,
5198,
5218,
5219,
5348,
5349,
5375,
5382,
5383,
5408,
5434,
5435,
5470,
5471,
5511,
5518,
5519,
5546,
5547,
5598,
5599,
5692,
5693,
5972,
5973,
5978,
5979
],
"line_end_idx": [
32,
33,
69,
70,
82,
83,
227,
228,
527,
528,
763,
764,
1212,
1213,
1417,
1418,
1544,
1545,
1778,
1779,
1958,
1959,
1980,
1981,
2056,
2057,
2089,
2090,
2097,
2098,
2187,
2188,
2199,
2200,
2235,
2251,
2313,
2347,
2348,
2356,
2357,
2388,
2395,
2396,
2425,
2426,
2510,
2511,
3041,
3042,
3097,
3098,
3123,
3130,
3131,
3156,
3174,
3175,
3208,
3209,
3236,
3243,
3244,
3269,
3288,
3289,
3323,
3324,
3347,
3354,
3355,
3380,
3397,
3398,
3427,
3428,
3458,
3465,
3466,
3491,
3492,
3542,
3543,
3573,
3580,
3581,
3606,
3607,
3657,
3658,
3686,
3693,
3694,
3719,
3720,
3768,
3769,
3802,
3809,
3810,
3835,
3836,
3888,
3889,
3922,
3923,
3956,
3963,
3964,
3989,
3990,
4043,
4044,
4077,
4078,
4109,
4116,
4117,
4142,
4143,
4194,
4195,
4228,
4229,
4259,
4266,
4267,
4292,
4293,
4347,
4348,
4381,
4382,
4418,
4425,
4426,
4451,
4452,
4508,
4509,
4535,
4536,
4702,
4703,
4718,
4719,
4752,
4753,
4815,
4816,
4884,
4885,
4910,
4911,
4935,
4936,
5004,
5005,
5119,
5120,
5169,
5170,
5190,
5197,
5198,
5218,
5219,
5348,
5349,
5375,
5382,
5383,
5408,
5434,
5435,
5470,
5471,
5511,
5518,
5519,
5546,
5547,
5598,
5599,
5692,
5693,
5972,
5973,
5978,
5979,
6026
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6026,
"ccnet_original_nlines": 190,
"rps_doc_curly_bracket": 0.0003318999952170998,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32698675990104675,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014072850346565247,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2450331151485443,
"rps_doc_frac_unique_words": 0.3133484125137329,
"rps_doc_mean_word_length": 5.282805442810059,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0008278100285679102,
"rps_doc_unigram_entropy": 4.993444442749023,
"rps_doc_word_count": 884,
"rps_doc_frac_chars_dupe_10grams": 0.14004282653331757,
"rps_doc_frac_chars_dupe_5grams": 0.20214132964611053,
"rps_doc_frac_chars_dupe_6grams": 0.14004282653331757,
"rps_doc_frac_chars_dupe_7grams": 0.14004282653331757,
"rps_doc_frac_chars_dupe_8grams": 0.14004282653331757,
"rps_doc_frac_chars_dupe_9grams": 0.14004282653331757,
"rps_doc_frac_chars_top_2gram": 0.02312633953988552,
"rps_doc_frac_chars_top_3gram": 0.06167024001479149,
"rps_doc_frac_chars_top_4gram": 0.05310492962598801,
"rps_doc_books_importance": -520.5828247070312,
"rps_doc_books_importance_length_correction": -520.5828247070312,
"rps_doc_openwebtext_importance": -334.4014892578125,
"rps_doc_openwebtext_importance_length_correction": -334.4014892578125,
"rps_doc_wikipedia_importance": -238.7415313720703,
"rps_doc_wikipedia_importance_length_correction": -238.7415313720703
},
"fasttext": {
"dclm": 0.048923309892416,
"english": 0.8335004448890686,
"fineweb_edu_approx": 2.120898962020874,
"eai_general_math": 0.8137503862380981,
"eai_open_web_math": 0.20826148986816406,
"eai_web_code": 0.926833987236023
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,808,516,804,746,624,000 |
SQLTeam.com | Weblogs | Forums
Linked server openquery for insert into oracle
#1
Hi
I am doing insert openquery through linked server
Is it possible to use openquery to insert record into oracle table of one schema from joining between oracle table only but from different schema.
like
insert into (lnk_ora, 'insert into oracle schema1.table(col1, col2)
select column_1, column_2 from oracle schema2.table')
T.I.A
#2
I don't think you can do that.
#3
I'm not sure if this will work, but I suggest trying:
EXEC('insert into oracle schema1.table(col1, col2) select column_1, column_2 from oracle schema2.table;’) AT [lnk_ora];
I believe the closing semi-colon is significant in Oracle (or at least it used to be).
#4
Thank you! It worked!!
#5
Great! And thanks for confirming back to me that it did indeed work: I knew it should, but sometimes computers see things differently than people :grin:
|
{
"url": "https://forums.sqlteam.com/t/linked-server-openquery-for-insert-into-oracle/11279",
"source_domain": "forums.sqlteam.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "12066",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QMDXD3ZH4HLPIMGQLRQEMQUM34CLRYU6",
"WARC-Concurrent-To": "<urn:uuid:7462778f-5bd8-4763-8793-b76b11309d5c>",
"WARC-Date": "2018-11-14T05:38:03Z",
"WARC-IP-Address": "64.71.168.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TDIBP5W3AFXXNYKR2ES3K3EILRXFAJYG",
"WARC-Record-ID": "<urn:uuid:fceb0076-088f-475a-9a6b-af1a382d6fd9>",
"WARC-Target-URI": "https://forums.sqlteam.com/t/linked-server-openquery-for-insert-into-oracle/11279",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7eb915f0-43bb-4451-a4ec-7798d062fd28>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-225-196-75.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,
31,
32,
79,
80,
81,
84,
85,
88,
89,
139,
286,
287,
292,
360,
414,
415,
421,
422,
423,
426,
427,
458,
459,
460,
463,
464,
518,
519,
639,
640,
727,
728,
729,
732,
733,
756,
757,
758,
761,
762
],
"line_end_idx": [
31,
32,
79,
80,
81,
84,
85,
88,
89,
139,
286,
287,
292,
360,
414,
415,
421,
422,
423,
426,
427,
458,
459,
460,
463,
464,
518,
519,
639,
640,
727,
728,
729,
732,
733,
756,
757,
758,
761,
762,
914
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 914,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3283582031726837,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05472636967897415,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2537313401699066,
"rps_doc_frac_unique_words": 0.6549295783042908,
"rps_doc_mean_word_length": 4.873239517211914,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.024875620380043983,
"rps_doc_unigram_entropy": 4.331270694732666,
"rps_doc_word_count": 142,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17341040074825287,
"rps_doc_frac_chars_dupe_6grams": 0.17341040074825287,
"rps_doc_frac_chars_dupe_7grams": 0.17341040074825287,
"rps_doc_frac_chars_dupe_8grams": 0.17341040074825287,
"rps_doc_frac_chars_dupe_9grams": 0.17341040074825287,
"rps_doc_frac_chars_top_2gram": 0.05780347064137459,
"rps_doc_frac_chars_top_3gram": 0.04624276980757713,
"rps_doc_frac_chars_top_4gram": 0.08670520037412643,
"rps_doc_books_importance": -89.50697326660156,
"rps_doc_books_importance_length_correction": -89.50697326660156,
"rps_doc_openwebtext_importance": -44.4149055480957,
"rps_doc_openwebtext_importance_length_correction": -33.85507583618164,
"rps_doc_wikipedia_importance": -55.9578971862793,
"rps_doc_wikipedia_importance_length_correction": -55.9578971862793
},
"fasttext": {
"dclm": 0.08363127708435059,
"english": 0.8652787804603577,
"fineweb_edu_approx": 1.5373507738113403,
"eai_general_math": 0.8621659278869629,
"eai_open_web_math": 0.5479561686515808,
"eai_web_code": 0.19270020723342896
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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
|
-6,267,764,484,637,129,000 |
Grafana EnterpriseEnterprise configuration
Grafana Enterprise configuration
This page describes Grafana Enterprise-specific configuration options that you can specify in a .ini configuration file or using environment variables. Refer to Configuration for more information about available configuration options.
[enterprise]
license_path
Local filesystem path to Grafana Enterprise’s license file. Defaults to <paths.data>/license.jwt.
license_text
Note: Available in Grafana Enterprise v7.4+.
When set to the text representation (i.e. content of the license file) of the license, Grafana will evaluate and apply the given license to the instance.
auto_refresh_license
Note: Available in Grafana Enterprise v7.4+.
When enabled, Grafana will send the license and usage statistics to the license issuer. If the license has been updated on the issuer’s side to be valid for a different number of users or a new duration, your Grafana instance will be updated with the new terms automatically. Defaults to true.
[white_labeling]
app_title
Set to your company name to override application title.
Set to complete URL to override login logo.
login_background
Set to complete CSS background expression to override login background. Example:
[white_labeling]
login_background = url(http://www.bhmpics.com/wallpapers/starfield-1920x1080.jpg)
Set to complete URL to override menu logo.
fav_icon
Set to complete URL to override fav icon (icon shown in browser tab).
apple_touch_icon
Set to complete URL to override Apple/iOS icon.
List the link IDs to use here. Grafana will look for matching link configurations, the link IDs should be space-separated and contain no whitespace.
[usage_insights.export]
By exporting usage logs, you can directly query them and create dashboards of the information that matters to you most, such as dashboard errors, most active organizations, or your top-10 most-used queries.
enabled
Enable the usage insights export feature.
storage
Specify a storage type. Defaults to loki.
[usage_insights.export.storage.loki]
type
Set the communication protocol to use with Loki, which is either grpc or http. Defaults to grpc.
url
Set the address for writing logs to Loki (format must be host:port).
tls
Decide whether or not to enable the TLS (Transport Layer Security) protocol when establishing the connection to Loki. Defaults to true.
[analytics.summaries]
buffer_write_interval
Interval for writing dashboard usage stats buffer to database.
buffer_write_timeout
Timeout for writing dashboard usage stats buffer to database.
rollup_interval
Interval for trying to roll up per dashboard usage summary. Only rolled up at most once per day.
rollup_timeout
Timeout for trying to rollup per dashboard usage summary.
[analytics.views]
recent_users_age
Age for recent active users.
[reporting]
rendering_timeout
Timeout for each panel rendering request.
concurrent_render_limit
Maximum number of concurrent calls to the rendering service.
image_scale_factor
Scale factor for rendering images. Value 2 is enough for monitor resolutions, 4 would be better for printed material. Setting a higher value affects performance and memory.
max_attachment_size_mb
Set the maximum file size in megabytes for the CSV attachments.
fonts_path
Path to the directory containing font files.
font_regular
Name of the TrueType font file with regular style.
font_bold
Name of the TrueType font file with bold style.
font_italic
Name of the TrueType font file with italic style.
[auditing]
Auditing allows you to track important changes to your Grafana instance. By default, audit logs are logged to file but the auditing feature also supports sending logs directly to Loki.
enabled
Enable the auditing feature. Defaults to false.
loggers
List of enabled loggers.
log_dashboard_content
Keep dashboard content in the logs (request or response fields). This can significantly increase the size of your logs.
[auditing.logs.file]
path
Path to logs folder.
max_files
Maximum log files to keep.
max_file_size_mb
Max size in megabytes per log file.
[auditing.logs.loki]
url
Set the URL for writing logs to Loki.
tls
If true, it establishes a secure connection to Loki. Defaults to true.
[auth.saml]
enabled
If true, the feature is enabled. Defaults to false.
certificate
Base64-encoded public X.509 certificate. Used to sign requests to the IdP.
certificate_path
Path to the public X.509 certificate. Used to sign requests to the IdP.
private_key
Base64-encoded private key. Used to decrypt assertions from the IdP.
private_key_path
Path to the private key. Used to decrypt assertions from the IdP.
idp_metadata
Base64-encoded IdP SAML metadata XML. Used to verify and obtain binding locations from the IdP.
idp_metadata_path
Path to the SAML metadata XML. Used to verify and obtain binding locations from the IdP.
idp_metadata_url
URL to fetch SAML IdP metadata. Used to verify and obtain binding locations from the IdP.
max_issue_delay
Time since the IdP issued a response and the SP is allowed to process it. Defaults to 90 seconds.
metadata_valid_duration
How long the SPs metadata is valid. Defaults to 48 hours.
assertion_attribute_name
Friendly name or name of the attribute within the SAML assertion to use as the user name.
assertion_attribute_login
Friendly name or name of the attribute within the SAML assertion to use as the user login handle.
assertion_attribute_email
Friendly name or name of the attribute within the SAML assertion to use as the user email.
assertion_attribute_groups
Friendly name or name of the attribute within the SAML assertion to use as the user groups.
assertion_attribute_role
Friendly name or name of the attribute within the SAML assertion to use as the user roles.
assertion_attribute_org
Friendly name or name of the attribute within the SAML assertion to use as the user organization.
allowed_organizations
List of comma- or space-separated organizations. Each user must be a member of at least one organization to log in.
org_mapping
List of comma- or space-separated Organization:OrgId mappings.
role_values_editor
List of comma- or space-separated roles that will be mapped to the Editor role.
role_values_admin
List of comma- or space-separated roles that will be mapped to the Admin role.
role_values_grafana_admin
List of comma- or space-separated roles that will be mapped to the Grafana Admin (Super Admin) role.
[keystore.vault]
url
Location of the Vault server.
namespace
Vault namespace if using Vault with multi-tenancy.
auth_method
Method for authenticating towards Vault. Vault is inactive if this option is not set. Current possible values: token.
token
Secret token to connect to Vault when auth_method is token.
lease_renewal_interval
Time between checking if there are any secrets which needs to be renewed.
lease_renewal_expires_within
Time until expiration for tokens which are renewed. Should have a value higher than lease_renewal_interval.
lease_renewal_increment
New duration for renewed tokens. Vault may be configured to ignore this value and impose a stricter limit.
[security.egress]
Note: Available in Grafana Enterprise v7.4 and later versions.
Security egress makes it possible to control outgoing traffic from the Grafana server.
host_deny_list
A list of hostnames or IP addresses separated by spaces for which requests are blocked.
host_allow_list
A list of hostnames or IP addresses separated by spaces for which requests are allowed. All other requests are blocked.
header_drop_list
A list of headers that are stripped from the outgoing data source and alerting requests.
A list of cookies that are stripped from the outgoing data source and alerting requests.
[caching]
Note: Available in Grafana Enterprise v7.5 and later versions.
When query caching is enabled, Grafana can temporarily store the results of data source queries and serve cached responses to similar requests.
backend
The caching backend to use when storing cached queries. Options: memory, redis, and memcached.
enabled
Setting ‘enabled’ to true allows users to configure query caching for data sources.
This value is true by default.
Note: This setting enables the caching feature, but it does not turn on query caching for any data source. To turn on query caching for a data source, update the setting on the data source configuration page. For more information, refer to the query caching docs.
ttl
Time to live (TTL) is the time that a query result is stored in the caching system before it is deleted or refreshed. This setting defines the time to live for query caching, when TTL is not configured in data source settings. The default value is 5m (5 minutes).
max_value_mb
This value limits the size of a single cache value. If a cache value (or query result) exceeds this size, then it is not cached. To disable this limit, set this value to 0.
[caching.memory]
gc_interval
When storing cache data in-memory, this setting defines how often a background process cleans up stale data from the in-memory cache. More frequent “garbage collection” can keep memory usage from climbing but will increase CPU usage.
max_size_mb
The maximum size of the in-memory cache in megabytes. Once this size is reached, new cache items are rejected. For more flexible control over cache eviction policies and size, use the Redis or Memcached backend.
To disable the maximum, set this value to 0.
Note: Disabling the maximum is not recommended in production environments.
[caching.redis]
url
The full Redis URL of your Redis server. Example: redis://localhost:6739/0.
prefix
A string that prefixes all Redis keys. This value must be set if using a shared database in Redis. If prefix is empty, then one will not be used.
[caching.memcached]
memcached_servers
A space-separated list of memcached servers. Example: memcached-server-1:11211 memcached-server-2:11212 memcached-server-3:11211. Or if there’s only one server: memcached-server:11211
|
{
"url": "https://grafana.com/docs/grafana/latest/enterprise/enterprise-configuration/",
"source_domain": "grafana.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "563208",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KJFQLXGUK5STLY2VKAJMOZYYZ75MOEZC",
"WARC-Concurrent-To": "<urn:uuid:308192c6-6974-4d4b-be6a-c54bd8e722b5>",
"WARC-Date": "2021-06-21T19:09:35Z",
"WARC-IP-Address": "34.120.177.193",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7I7EX77R7XJQ3FKRYO2AHW4F65DRGEPK",
"WARC-Record-ID": "<urn:uuid:009dc4e8-3033-492a-bb46-efee6b45bf90>",
"WARC-Target-URI": "https://grafana.com/docs/grafana/latest/enterprise/enterprise-configuration/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13f72e89-f924-48bd-986c-424c1d97c6a7>"
},
"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-123.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,
43,
44,
77,
78,
313,
314,
327,
328,
341,
342,
440,
441,
454,
455,
500,
501,
655,
656,
677,
678,
723,
724,
1018,
1019,
1036,
1037,
1047,
1048,
1104,
1105,
1149,
1150,
1167,
1168,
1249,
1250,
1267,
1349,
1350,
1393,
1394,
1403,
1404,
1474,
1475,
1492,
1493,
1541,
1542,
1691,
1692,
1716,
1717,
1924,
1925,
1933,
1934,
1976,
1977,
1985,
1986,
2028,
2029,
2066,
2067,
2072,
2073,
2170,
2171,
2175,
2176,
2245,
2246,
2250,
2251,
2387,
2388,
2410,
2411,
2433,
2434,
2497,
2498,
2519,
2520,
2582,
2583,
2599,
2600,
2697,
2698,
2713,
2714,
2772,
2773,
2791,
2792,
2809,
2810,
2839,
2840,
2852,
2853,
2871,
2872,
2914,
2915,
2939,
2940,
3001,
3002,
3021,
3022,
3195,
3196,
3219,
3220,
3284,
3285,
3296,
3297,
3342,
3343,
3356,
3357,
3408,
3409,
3419,
3420,
3468,
3469,
3481,
3482,
3532,
3533,
3544,
3545,
3730,
3731,
3739,
3740,
3788,
3789,
3797,
3798,
3823,
3824,
3846,
3847,
3967,
3968,
3989,
3990,
3995,
3996,
4017,
4018,
4028,
4029,
4056,
4057,
4074,
4075,
4111,
4112,
4133,
4134,
4138,
4139,
4177,
4178,
4182,
4183,
4254,
4255,
4267,
4268,
4276,
4277,
4329,
4330,
4342,
4343,
4418,
4419,
4436,
4437,
4509,
4510,
4522,
4523,
4592,
4593,
4610,
4611,
4677,
4678,
4691,
4692,
4788,
4789,
4807,
4808,
4897,
4898,
4915,
4916,
5006,
5007,
5023,
5024,
5122,
5123,
5147,
5148,
5206,
5207,
5232,
5233,
5323,
5324,
5350,
5351,
5449,
5450,
5476,
5477,
5568,
5569,
5596,
5597,
5689,
5690,
5715,
5716,
5807,
5808,
5832,
5833,
5931,
5932,
5954,
5955,
6071,
6072,
6084,
6085,
6148,
6149,
6168,
6169,
6249,
6250,
6268,
6269,
6348,
6349,
6375,
6376,
6477,
6478,
6495,
6496,
6500,
6501,
6531,
6532,
6542,
6543,
6594,
6595,
6607,
6608,
6726,
6727,
6733,
6734,
6794,
6795,
6818,
6819,
6893,
6894,
6923,
6924,
7032,
7033,
7057,
7058,
7165,
7166,
7184,
7185,
7248,
7249,
7336,
7337,
7352,
7353,
7441,
7442,
7458,
7459,
7579,
7580,
7597,
7598,
7687,
7688,
7777,
7778,
7788,
7789,
7852,
7853,
7997,
7998,
8006,
8007,
8102,
8103,
8111,
8112,
8196,
8197,
8228,
8229,
8493,
8494,
8498,
8499,
8763,
8764,
8777,
8778,
8951,
8952,
8969,
8970,
8982,
8983,
9217,
9218,
9230,
9231,
9443,
9444,
9489,
9490,
9565,
9566,
9582,
9583,
9587,
9588,
9664,
9665,
9672,
9673,
9819,
9820,
9840,
9841,
9859,
9860
],
"line_end_idx": [
43,
44,
77,
78,
313,
314,
327,
328,
341,
342,
440,
441,
454,
455,
500,
501,
655,
656,
677,
678,
723,
724,
1018,
1019,
1036,
1037,
1047,
1048,
1104,
1105,
1149,
1150,
1167,
1168,
1249,
1250,
1267,
1349,
1350,
1393,
1394,
1403,
1404,
1474,
1475,
1492,
1493,
1541,
1542,
1691,
1692,
1716,
1717,
1924,
1925,
1933,
1934,
1976,
1977,
1985,
1986,
2028,
2029,
2066,
2067,
2072,
2073,
2170,
2171,
2175,
2176,
2245,
2246,
2250,
2251,
2387,
2388,
2410,
2411,
2433,
2434,
2497,
2498,
2519,
2520,
2582,
2583,
2599,
2600,
2697,
2698,
2713,
2714,
2772,
2773,
2791,
2792,
2809,
2810,
2839,
2840,
2852,
2853,
2871,
2872,
2914,
2915,
2939,
2940,
3001,
3002,
3021,
3022,
3195,
3196,
3219,
3220,
3284,
3285,
3296,
3297,
3342,
3343,
3356,
3357,
3408,
3409,
3419,
3420,
3468,
3469,
3481,
3482,
3532,
3533,
3544,
3545,
3730,
3731,
3739,
3740,
3788,
3789,
3797,
3798,
3823,
3824,
3846,
3847,
3967,
3968,
3989,
3990,
3995,
3996,
4017,
4018,
4028,
4029,
4056,
4057,
4074,
4075,
4111,
4112,
4133,
4134,
4138,
4139,
4177,
4178,
4182,
4183,
4254,
4255,
4267,
4268,
4276,
4277,
4329,
4330,
4342,
4343,
4418,
4419,
4436,
4437,
4509,
4510,
4522,
4523,
4592,
4593,
4610,
4611,
4677,
4678,
4691,
4692,
4788,
4789,
4807,
4808,
4897,
4898,
4915,
4916,
5006,
5007,
5023,
5024,
5122,
5123,
5147,
5148,
5206,
5207,
5232,
5233,
5323,
5324,
5350,
5351,
5449,
5450,
5476,
5477,
5568,
5569,
5596,
5597,
5689,
5690,
5715,
5716,
5807,
5808,
5832,
5833,
5931,
5932,
5954,
5955,
6071,
6072,
6084,
6085,
6148,
6149,
6168,
6169,
6249,
6250,
6268,
6269,
6348,
6349,
6375,
6376,
6477,
6478,
6495,
6496,
6500,
6501,
6531,
6532,
6542,
6543,
6594,
6595,
6607,
6608,
6726,
6727,
6733,
6734,
6794,
6795,
6818,
6819,
6893,
6894,
6923,
6924,
7032,
7033,
7057,
7058,
7165,
7166,
7184,
7185,
7248,
7249,
7336,
7337,
7352,
7353,
7441,
7442,
7458,
7459,
7579,
7580,
7597,
7598,
7687,
7688,
7777,
7778,
7788,
7789,
7852,
7853,
7997,
7998,
8006,
8007,
8102,
8103,
8111,
8112,
8196,
8197,
8228,
8229,
8493,
8494,
8498,
8499,
8763,
8764,
8777,
8778,
8951,
8952,
8969,
8970,
8982,
8983,
9217,
9218,
9230,
9231,
9443,
9444,
9489,
9490,
9565,
9566,
9582,
9583,
9587,
9588,
9664,
9665,
9672,
9673,
9819,
9820,
9840,
9841,
9859,
9860,
10043
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10043,
"ccnet_original_nlines": 365,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31246596574783325,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01905279979109764,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1807294487953186,
"rps_doc_frac_unique_words": 0.3369938135147095,
"rps_doc_mean_word_length": 5.486616134643555,
"rps_doc_num_sentences": 166,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.453088283538818,
"rps_doc_word_count": 1457,
"rps_doc_frac_chars_dupe_10grams": 0.1351013332605362,
"rps_doc_frac_chars_dupe_5grams": 0.22742056846618652,
"rps_doc_frac_chars_dupe_6grams": 0.2026519924402237,
"rps_doc_frac_chars_dupe_7grams": 0.1777583211660385,
"rps_doc_frac_chars_dupe_8grams": 0.1571178436279297,
"rps_doc_frac_chars_dupe_9grams": 0.14585939049720764,
"rps_doc_frac_chars_top_2gram": 0.00875656958669424,
"rps_doc_frac_chars_top_3gram": 0.010132599622011185,
"rps_doc_frac_chars_top_4gram": 0.01351013034582138,
"rps_doc_books_importance": -648.8775634765625,
"rps_doc_books_importance_length_correction": -648.8775634765625,
"rps_doc_openwebtext_importance": -375.46417236328125,
"rps_doc_openwebtext_importance_length_correction": -375.46417236328125,
"rps_doc_wikipedia_importance": -236.76292419433594,
"rps_doc_wikipedia_importance_length_correction": -236.76292419433594
},
"fasttext": {
"dclm": 0.03912156820297241,
"english": 0.7720613479614258,
"fineweb_edu_approx": 1.5187090635299683,
"eai_general_math": 0.25099796056747437,
"eai_open_web_math": 0.10955148935317993,
"eai_web_code": 0.9756373763084412
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,957,027,782,691,106,300 |
0
Is there a way to have a SQL query automatically update its' parameters based on the results of a previous query?
Here's the scenario I'm trying to achieve:
A report should automatically be run daily that runs the following queries (in order):
1. SELECT id of rows that match a certain criteria (we'll call this result set "X")
2. SELECT certain fields from rows that are titled "Cancelled-[X]"
3. UPDATE rows from [X] with information from "Cancelled-[X]"
2
Consider using Common Table Expressions (CTEs).
I don't have your table structures nor your queries, but what I would envisage is something like this:
WITH cte1 AS
(
Perform your 1.SELECT id of rows that match a certain criteria (we'll call this result set "X")`
),
cte2 AS
(
Perform you 2.SELECT certain fields from rows that are titled "Cancelled-[X]"
)
UPDATE rows from [X] with information from "Cancelled-[X]";
There are some restrictions on CTEs. You can't perform UPDATEs from them for example. I'm not really a MS SQL Server person, but here are a couple of references which should help (1, 2).
For an example of them in action, see my post here. It's a PostgreSQL solution, but the MS SQL Server syntax is virtually identical.
| improve this answer | |
0
Use local Temp Table in your procedure:
SELECT id INTO #X
FROM ABC WHERE MyCriteria = 'XYZ';
SELECT * FROM ABC
WHERE Cancelled = 'Yes' and
id in (SELECT id FROM #X);
UPDATE ABC SET MyColumn = 'Updated'
WHERE Cancelled = 'Yes' and
id in (SELECT id FROM #X);
| 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://dba.stackexchange.com/questions/145391/using-results-from-one-query-as-the-parameters-for-another",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "150559",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IOTKVFSM5LVHKDRZZNOGPKJSBJWKXIOU",
"WARC-Concurrent-To": "<urn:uuid:51ef45f7-ad35-4742-aec6-d29826c213b1>",
"WARC-Date": "2020-06-06T02:35:57Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2GGKUCEFOS2QN5KOEMX4M3YP74MAXETM",
"WARC-Record-ID": "<urn:uuid:25cc7fd9-65c9-47a1-b540-09256b036cba>",
"WARC-Target-URI": "https://dba.stackexchange.com/questions/145391/using-results-from-one-query-as-the-parameters-for-another",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:91b35cab-6894-4579-98c5-f96c1596a2c8>"
},
"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-190.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,
117,
118,
161,
162,
249,
250,
336,
405,
469,
471,
472,
520,
521,
624,
625,
638,
640,
739,
742,
750,
752,
832,
834,
894,
895,
1082,
1083,
1216,
1217,
1243,
1245,
1246,
1286,
1287,
1305,
1340,
1341,
1360,
1389,
1420,
1421,
1457,
1486,
1517,
1543,
1544,
1556,
1557,
1657,
1658
],
"line_end_idx": [
2,
3,
117,
118,
161,
162,
249,
250,
336,
405,
469,
471,
472,
520,
521,
624,
625,
638,
640,
739,
742,
750,
752,
832,
834,
894,
895,
1082,
1083,
1216,
1217,
1243,
1245,
1246,
1286,
1287,
1305,
1340,
1341,
1360,
1389,
1420,
1421,
1457,
1486,
1517,
1543,
1544,
1556,
1557,
1657,
1658,
1748
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1748,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30534350872039795,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1221373975276947,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2569974660873413,
"rps_doc_frac_unique_words": 0.5052264928817749,
"rps_doc_mean_word_length": 4.529616832733154,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.007633590139448643,
"rps_doc_unigram_entropy": 4.719811916351318,
"rps_doc_word_count": 287,
"rps_doc_frac_chars_dupe_10grams": 0.14153845608234406,
"rps_doc_frac_chars_dupe_5grams": 0.2769230902194977,
"rps_doc_frac_chars_dupe_6grams": 0.2769230902194977,
"rps_doc_frac_chars_dupe_7grams": 0.2769230902194977,
"rps_doc_frac_chars_dupe_8grams": 0.2769230902194977,
"rps_doc_frac_chars_dupe_9grams": 0.14153845608234406,
"rps_doc_frac_chars_top_2gram": 0.02461538091301918,
"rps_doc_frac_chars_top_3gram": 0.01230769045650959,
"rps_doc_frac_chars_top_4gram": 0.01846154034137726,
"rps_doc_books_importance": -164.24485778808594,
"rps_doc_books_importance_length_correction": -155.04827880859375,
"rps_doc_openwebtext_importance": -91.69180297851562,
"rps_doc_openwebtext_importance_length_correction": -91.69180297851562,
"rps_doc_wikipedia_importance": -101.42989349365234,
"rps_doc_wikipedia_importance_length_correction": -96.44974517822266
},
"fasttext": {
"dclm": 0.9907065629959106,
"english": 0.8973677754402161,
"fineweb_edu_approx": 1.932788610458374,
"eai_general_math": 0.0004984100232832134,
"eai_open_web_math": 0.08861619234085083,
"eai_web_code": 0.006021619774401188
}
}
|
{
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
109,895,739,499,318,240 |
Language Selection
English French German Italian Portuguese Spanish
Where’s the KDE4 Desktop?
Filed under
KDE
Before I come to the content please bear in mind: This is just my personal impressions from the 10/15 minutes I played with the current KDE4 desktop yesterday. I’m completely aware that there’s still 2 months of work happening and that KDE 4.0 is not primarily targeted at the broad user base that KDE4 is. Also I only have kdebase,kdesdk and kdevelop checked out, so I can’t say how the other modules are..
Still I think the Desktop is not in the shape I would’ve liked to see it for the 4.0 release. We do have a desktop with a wallpaper and this desktop-widget-thingie. First thing I noticed after trying the analog clock example is that the drop-down box is not xinerama aware. That is the widget itself is on the second screen (have them side by side) in the top-left corner, but the content of the box appears on the first in the top-left corner (2nd is left of 1st). Another thing is that the clock is somehow cropped when I switch from Desktop to one of the panel-types, it seems as if there’s some leftover from the round shape of the analog clock thats covering the left parts of the digital display.
Then tried to run some kde4 apps...
MOre Here
Aaron J. Seigo: xinerama and plasma
so andreas pakulat notes that plasma doesn't work with xinerama very well at the moment. perhaps that's because none of the developers are using it on such a system at the moment. "humorously" i still don't have such a system to play with either. it is "cute" that andreas picked on a UI element that isn't even going to be in the final release; it is cool that he's using testing features (the form factor drop down) to find issues, though, since that's what they are there for. =)
and so, andreas concludes, that with some other apps crashing for him he's not going to "eat the dogfood" until 4.1. that's unfortunate. why? because that's precisely how we can ensure that things don't get better. so what to do?
here are my thoughts:
Comment viewing options
Select your preferred way to display the comments and click "Save settings" to activate your changes.
More in Tux Machines
Create Your Own Free Software Project
Free software is tremendously democratic. Anyone with a computer and an internet connection can get involved – there are no barriers of wealth or social status. Being educated in computer science helps, but there are plenty of people working on free software at Red Hat, Canonical and Intel who’ve never been to university, and who acquired their positions simply by writing great code. So anyone can contribute to free software, and anyone can start a new project as well. But how do you turn that great idea in your head into a real-life success? The likes of SourceForge and GitHub are littered with now-abandoned projects with barely 50 lines of code, which initially started as grand ideas to create the next killer music player, email client or game. Yes, free software is awesome, but 95% of projects never get off the ground or are abandoned after a few weeks. Read more
Ubuntu 6.06 To Ubuntu 16.04 LTS Performance Benchmarks: 10 Years Of Linux Performance
As I'm in the process of retiring an old AMD Opteron dual-socket system, prior to decommissioning it, I figured it would be fun to go back and re-benchmark all of the Ubuntu LTS releases going all the way back to the legendary 6.06 Dapper Drake release. So here are some fresh benchmarks of this AMD Shanghai system with eight cores and 16GB of RAM when re-benchmarking the releases from Ubuntu 6.06 through the latest Ubuntu 16.04 LTS development state. Read more
The Talos Secure Workstation Is A High-Performance Libre System
Raptor Engineering is working on the Talos Secure Workstation, which is being advertised as a high-performance, open-to-the-firmware system that is much better than the commonly antiquated "freed" x86 systems. However, getting a high-performance, free software friendly workstation doesn't come cheap. Read more
Ubuntu Devs Might Skip the OTA-9.5 Hotfix in Favour of a Massive OTA-10 Update
We had just been informed by Łukasz Zemczak of Canonical about the latest things happening in preparation for the upcoming OTA updates for Ubuntu Phone devices. Read more
|
{
"url": "http://www.tuxmachines.org/node/19453",
"source_domain": "www.tuxmachines.org",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "66327",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KIRECORYDIS4RCEN4K25OBMDK2CQKEKK",
"WARC-Concurrent-To": "<urn:uuid:125fa114-c4d8-4c30-a8b0-9c3cba3e497b>",
"WARC-Date": "2016-02-06T09:43:09Z",
"WARC-IP-Address": "204.68.122.2",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4LGGBIZLLHTN6HSJ64XK7HV46R6NZXZH",
"WARC-Record-ID": "<urn:uuid:c6850a96-a1ed-4013-8e9c-665383d1abf1>",
"WARC-Target-URI": "http://www.tuxmachines.org/node/19453",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9105efe2-e317-4c10-a3e8-4f6b475b8d86>"
},
"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,
19,
20,
69,
70,
96,
97,
109,
113,
114,
522,
523,
1226,
1227,
1263,
1264,
1274,
1275,
1276,
1277,
1278,
1314,
1315,
1798,
1799,
2029,
2030,
2052,
2053,
2077,
2078,
2180,
2181,
2202,
2203,
2241,
2242,
3121,
3122,
3208,
3209,
3674,
3675,
3739,
3740,
4052,
4053,
4132,
4133
],
"line_end_idx": [
19,
20,
69,
70,
96,
97,
109,
113,
114,
522,
523,
1226,
1227,
1263,
1264,
1274,
1275,
1276,
1277,
1278,
1314,
1315,
1798,
1799,
2029,
2030,
2052,
2053,
2077,
2078,
2180,
2181,
2202,
2203,
2241,
2242,
3121,
3122,
3208,
3209,
3674,
3675,
3739,
3740,
4052,
4053,
4132,
4133,
4303
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4303,
"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.41896361112594604,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03197354078292847,
"rps_doc_frac_lines_end_with_ellipsis": 0.020408159121870995,
"rps_doc_frac_no_alph_words": 0.16648291051387787,
"rps_doc_frac_unique_words": 0.5102319121360779,
"rps_doc_mean_word_length": 4.668485641479492,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.0011025399435311556,
"rps_doc_unigram_entropy": 5.420490264892578,
"rps_doc_word_count": 733,
"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.008766800165176392,
"rps_doc_frac_chars_top_3gram": 0.008182349614799023,
"rps_doc_frac_chars_top_4gram": 0.01052016019821167,
"rps_doc_books_importance": -339.43170166015625,
"rps_doc_books_importance_length_correction": -339.43170166015625,
"rps_doc_openwebtext_importance": -201.32504272460938,
"rps_doc_openwebtext_importance_length_correction": -201.32504272460938,
"rps_doc_wikipedia_importance": -89.37825012207031,
"rps_doc_wikipedia_importance_length_correction": -89.37825012207031
},
"fasttext": {
"dclm": 0.022653160616755486,
"english": 0.951828122138977,
"fineweb_edu_approx": 1.2976106405258179,
"eai_general_math": 0.045782800763845444,
"eai_open_web_math": 0.14610439538955688,
"eai_web_code": 0.05962562933564186
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,680,384,284,894,311,000 |
elva
GDB（GNU 项目调试器）
GDB（GNU 项目调试器）可以让您了解程序在执行时“内部” 究竟在干些什么，以及在程序发生崩溃的瞬间正在做什么。
GDB 做以下 4 件主要的事情来帮助您捕获程序中的 bug：
l
在程序启动之前指定一些可以影响程序行为的变量或条件
l
在某个指定的地方或条件下暂停程序
l
在程序停止时检查已经发生了什么
l
在程序执行过程中修改程序中的变量或条件，这样就可以体验修复一个 bug 的成果，并继续了解其他 bug
要调试的程序可以是使用 C、C++、Pascal、Objective-C 以及其他很多语言编写的。GDB 的二进制文件名是 gdb。
gdb 中有很多命令。使用help命令可以列出所有的命令，以及关于如何使用这些命令的介绍。下表给出了最常用的 GDB 命令。
表 1. gdb 中最常用的命令
命令
说明
例子
help
显示命令类别
help- 显示命令类别
help breakpoints- 显示属于 breakpoints 类别的命令
help break- 显示 break 命令的解释
run
启动所调试的程序
?
kill
终止正在调试的程序的执行
通常这会在要执行的代码行已经超过了您想要调试的代码时使用。执行kill会重置断点，并从头再次运行这个程序
cont
所调试的程序运行到一个断点、异常或单步之后，继续执行
?
info break
显示当前的断点或观察点
?
break
在指定的行或函数处设置断点
break 93 if i=8- 当变量 i 等于 8 时，在第 93 行停止程序执行
Step
单步执行程序，直到它到达一个不同的源代码行。您可以使用s来代表 step 命令
?
Next
与 step 命令类似，只是它不会“单步跟踪到”子例程中
?
print
打印一个变量或表达式的值
print pointer- 打印变量指针的内容
print *pointer- 打印指针所指向的数据结构的内容
delete
删除某些断点或自动显示表达式
delete 1- 删除断点 1。断点可以通过info break来显示
watch
为一个表达式设置一个观察点。当表达式的值发生变化时，这个观察点就会暂停程序的执行
?
where
打印所有堆栈帧的栈信息
where- 不使用参数，输出当前线程的堆栈信息
where all- 输出当前线程组中所有线程的堆栈信息
where threadindex- 输出指定线程的堆栈信息
attach
开始查看一个已经运行的进程
attach - 附加到进程 process_id 上。process_id 可以使用 ps 命令找到
info thread
显示当前正在运行的线程
?
thread apply threadno command
对一个线程运行 gdb 命令
thread apply 3 where- 对线程 3 运行where命令
Thread threadno
选择一个线程作为当前线程
?
如果一个程序崩溃了，并生成了一个 core 文件，您可以查看 core 文件来判断进程结束时的状态。使用下面的命令启动 gdb：
# gdb programname corefilename
要调试一个 core 文件，您需要可执行程序、源代码文件以及 core 文件。要对一个 core 文件启动 gdb，请使用 -c 选项：
# gdb -c core programname
gdb 会显示是哪行代码导致这个程序产生了核心转储。
默认情况下，核心转储在 Novell 的 SUSE LINUX Enterprise Server 9（SLES 9）和 Red Hat? Enterprise Linux Advanced Server（RHEL AS 4）上都是禁用的。要启用核心转储，请以 root 用户的身份在命令行中执行ulimit –c unlimited。
清单 8中的例子阐述了如何使用 gdb 来定位程序中的 bug。清单 8 是一段包含 bug 的 C++ 代码。
清单 8中的 C++ 程序试图构建 10 个链接在一起的数字框（number box），例如：
图 1. 一个包含 10 个链接在一起的数字框的列表
然后试图从这个列表中逐个删除数字框。
编译并运行这个程序，如下所示：
清单 9. 编译并运行这个程序
# g++ -g -o gdbtest1 gdbtest1.cpp
# ./gdbtest1
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Number Box "9" deleted
Segmentation fault
正如您可以看到的一样，这个程序会导致段错误。调用 gdb 来看一下这个问题，如下所示：
清单 10. 调用 gdb
# gdb ./gdbtest1
GNU gdb 6.2.1
Copyright 2004 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you
are welcome to change it and/or distribute copies of it under certain
conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB.
Type "show warranty" for
details.
This GDB was configured as "ppc-suse-linux"...Using host libthread_db
library "/lib/tls/libthread_db.so.1".
(gdb)
您知道段错误是在数字框 "9" 被删除之后发生的。执行run和where命令来精确定位段错误发生在程序中的什么位置。
清单 11. 执行 run 和 where 命令
(gdb) run
Starting program: /root/test/gdbtest1
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Number Box "9" deleted
Program received signal SIGSEGV, Segmentation fault.
0x10000f74 in NumBox::GetNext (this=0x0) at gdbtest1.cpp:14
14
NumBox*GetNext() const { return Next; }
(gdb) where
#0
0x10000f74 in NumBox::GetNext (this=0x0) at gdbtest1.cpp:14
#1
0x10000d10 in NumChain::RemoveBox (this=0x10012008,
item_to_remove=@0xffffe200) at gdbtest1.cpp:63
#2
0x10000978 in main (argc=1, argv=0xffffe554) at gdbtest1.cpp:94
(gdb)
跟踪信息显示这个程序在第 14 行NumBox::GetNext (this=0x0)接收到一个段错误。这个数字框上 Next 指针的地址是 0x0，这对于一个数字框来说是一个无效的地址。从上面的跟踪信息可以看出，GetNext函数是由 63 行调用的。看一下在 gdbtest1.cpp 的 63 行附近发生了什么：
清单 12. gdbtest1.cpp
54
} else {
55
temp->SetNext (current->GetNext());
56
delete temp;
57
temp = 0;
58
return 0;
59
}
60
}
61
current = 0;
62
temp = current;
63
current = current->GetNext();
64
}
65
66
return -1;
第 61 行current=0将这个指针设置为一个无效的地址，这正是产生段错误的根源。注释掉第 61 行，将其保存为 gdbtest2.cpp，然后编译并重新运行。
清单 13. 再次运行程序（gdbtest2.cpp）
# g++ -g -o gdbtest2 gdbtest2.cpp
# ./gdbtest2
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Number Box "9" deleted
Number Box "0" deleted
这个程序现在可以成功完成而不会出现段错误了。然而，结果并不像我们预期的一样：程序在删除 Number Box "9"之后删除了 Number Box "0"，而不像我们期望的一样删除 Number Box "8,"。使用 gdb 再次来看一下。
清单 14. 再次使用 gdb 进行查看
# gdb ./gdbtest2
GNU gdb 6.2.1
Copyright 2004 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you
are welcome to change it and/or distribute copies of it under certain
conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB.
Type "show warranty" for
details.
This GDB was configured as "ppc-suse-linux"...Using host libthread_db
library "/lib/tls/libthread_db.so.1".
(gdb) break 94 if i==8
Breakpoint 1 at 0x10000968: file gdbtest2.cpp, line 94.
(gdb) run
Starting program: /root/test/gdbtest2
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Number Box "9" deleted
Breakpoint 1, main (argc=1, argv=0xffffe554) at gdbtest2.cpp:94
94
list ->RemoveBox(i);
您可能希望找出为什么这个程序删除的是 Number Box 0，而不是 Number Box 8，因此需要在您认为程序会删除 Number Box 8 的地方停止程序。设置这个断点：break 94 if i==8，可以在 i 等于 8 时在第 94 行处停止程序。然后单步跟踪到RemoveBox()函数中。
清单 15. 单步跟踪到 RemoveBox() 函数中
(gdb) s
38
NumBox *temp = 0;
(gdb) s
40
while (current != 0) {
(gdb) print pointer
$1 = (NumBox *) 0x100120a8
(gdb) print *pointer
$2 = {Num = 0, Next = 0x0}
(gdb)
指针早已指向了 Number Box "0"，因此这个 bug 可能就存在于程序删除 Number Box "9" 的地方。要在 gdb 中重新启动这个程序，请使用kill删除原来的断点，然后添加一个 i 等于 9 时的新断点，然后再次运行这个程序。
清单 16. 在 gdb 中重新启动程序
(gdb) kill
Kill the program being debugged? (y or n) y
(gdb) info break
Num Type
Disp Enb Address
What
1
breakpoint
keep y
0x10000968 in main at gdbtest2.cpp:94
stop only if i == 8
breakpoint already hit 1 time
(gdb) delete 1
(gdb) break 94 if i==9
Breakpoint 2 at 0x10000968: file gdbtest2.cpp, line 94.
(gdb) run
Starting program: /root/test/gdbtest2
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Breakpoint 2, main (argc=1, argv=0xffffe554) at gdbtest2.cpp:94
94
list ->RemoveBox(i);
(gdb)
当这一次单步跟踪RemoveBox()函数时，要特别注意list->pointer正在指向哪一个数字框，因为 bug 可能就在于list->pointer开始指向 Number Box "0" 的地方。请使用display *pointer命令来查看，这会自动显示这个函数。
清单 17. 使用 display *pointer 命令进行监视
Breakpoint 2, main (argc=1, argv=0xffffe554) at gdbtest2.cpp:94
94
list ->RemoveBox(i);
(gdb) s
NumChain::RemoveBox (this=0x10012008, item_to_remove=@0xffffe200)
at gdbtest2.cpp:37
37
NumBox *current = pointer;
(gdb) display *pointer
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
38
NumBox *temp = 0;
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
40
while (current != 0) {
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
41
if (current->GetValue() == item_to_remove) {
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
NumBox::GetValue (this=0x100120a8) at gdbtest2.cpp:16
16
const T& GetValue () const { return Num; }
(gdb) s
NumChain::RemoveBox (this=0x10012008, item_to_remove=@0xffffe200)
at gdbtest2.cpp:42
42
if (temp == 0) {
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
44
if (current->GetNext() == 0) {
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
NumBox::GetNext (this=0x100120a8) at gdbtest2.cpp:14
14
NumBox*GetNext() const { return Next; }
(gdb) s
NumChain::RemoveBox (this=0x10012008, item_to_remove=@0xffffe200)
at gdbtest2.cpp:50
50
delete current;
1: *this->pointer = {Num = 9, Next = 0x10012098}
(gdb) s
~NumBox (this=0x100120a8) at gdbtest2.cpp:10
10
std::cout << "Number Box " <<"\""
<< GetValue()
<<"\""
<<" deleted" << std::endl;
(gdb) s
NumBox::GetValue (this=0x100120a8) at gdbtest2.cpp:16
16
const T& GetValue () const { return Num; }
(gdb) s
Number Box "9" deleted
~NumBox (this=0x100120a8) at gdbtest2.cpp:11
11
Next = 0;
(gdb) s
NumChain::RemoveBox (this=0x10012008, item_to_remove=@0xffffe200)
at gdbtest2.cpp:51
51
current = 0;
1: *this->pointer = {Num = 0, Next = 0x0}
(gdb) s
53
return 0;
1: *this->pointer = {Num = 0, Next = 0x0}
(gdb) s
0x10000d1c
66
return -1;
1: *this->pointer = {Num = 0, Next = 0x0}
从上面的跟踪过程中，您可以看到list->pointer在删除 Number Box "9" 之后指向了 Number Box "0"。这个逻辑并不正确，因为在删除 Number Box "9" 之后，list->pointer应该指向的是 Number Box "8"。现在非常显然我们应该在第 50 行之前添加一条语句pointer = pointer->GetNext();，如下所示：
清单 18. 在第 50 行之前添加一条 pointer = pointer->GetNext(); 语句
49
} else {
50
pointer = pointer->GetNext();
51
delete current;
52
current = 0;
53
}
54
return 0;
将新修改之后的程序保存为 gdbtest3.cpp，然后编译并再次运行。
清单 19. 再次运行程序（gdbtest3.cpp）
# g++ -g -o gdbtest3 gdbtest3.cpp
# ./gdbtest3
Number Box "0" created
Number Box "1" created
Number Box "2" created
Number Box "3" created
Number Box "4" created
Number Box "5" created
Number Box "6" created
Number Box "7" created
Number Box "8" created
Number Box "9" created
list created
Number Box "9" deleted
Number Box "8" deleted
Number Box "7" deleted
Number Box "6" deleted
Number Box "5" deleted
Number Box "4" deleted
Number Box "3" deleted
Number Box "2" deleted
Number Box "1" deleted
Number Box "0" deleted
这才是我们期望的结果。
多线程环境
在 GDB 中有一些特殊的命令可以用于多线程应用程序的调试。下面这个例子给出了一个死锁情况，并介绍了如何使用这些命令来检查多线程应用程序中的问题：
清单 20. 多线程的例子
#include
#include "pthread.h>
pthread_mutex_t AccountA_mutex;
pthread_mutex_t AccountB_mutex;
struct BankAccount {
char account_name[1];
int balance;
};
struct BankAccount
accountA = {"A", 10000 };
struct BankAccount
accountB = {"B", 20000 };
void * transferAB (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountA_mutex);
if (accountA.balance < amount)
{
printf("There is not enough memory in Account A!\n");
pthread_mutex_unlock(&AccountA_mutex);
pthread_exit((void *)1);
}
accountA.balance -=amount;
sleep(1);
pthread_mutex_lock(&AccountB_mutex);
accountB.balance +=amount;
pthread_mutex_unlock(&AccountA_mutex);
pthread_mutex_unlock(&AccountB_mutex);
}
void * transferBA (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountB_mutex);
if (accountB.balance < amount)
{
printf("There is not enough memory in Account B!\n");
pthread_mutex_unlock(&AccountB_mutex);
pthread_exit((void *)1);
}
accountB.balance -=amount;
sleep(1);
pthread_mutex_lock(&AccountA_mutex);
accountA.balance +=amount;
pthread_mutex_unlock(&AccountB_mutex);
pthread_mutex_unlock(&AccountA_mutex);
}
int main(int argc, char* argv[]) {
int
threadid[4];
pthread_t
pthread[4];
int
transfer_amount[4] = {100, 200, 300, 400};
int
final_balanceA, final_balanceB;
final_balanceA=accountA.balance-transfer_amount[0]-
transfer_amount[1]+transfer_amount[2]+transfer_amount[3];
final_balanceB=accountB.balance+transfer_amount[0]
+transfer_amount[1]-transfer_amount[2]-transfer_amount[3];
if (threadid[0] = pthread_create(&pthread[0], NULL, transferAB,
(void*)&transfer_amount[0]) " 0) {
perror("Thread #0 creation failed.");
exit (1);
}
if (threadid[1] = pthread_create(&pthread[1], NULL, transferAB,
(void*)&transfer_amount[1]) " 0) {
perror("Thread #1 creation failed.");
exit (1);
}
if (threadid[2] = pthread_create(&pthread[2], NULL, transferBA,
(void*)&transfer_amount[2]) < 0) {
perror("Thread #2 creation failed.");
exit (1);
}
if (threadid[3] = pthread_create(&pthread[3], NULL, transferBA,
(void*)&transfer_amount[3]) < 0) {
perror("Thread #3 creation failed.");
exit (1);
}
printf("Transitions are in progress..");
while ((accountA.balance != final_balanceA) && (accountB.balance
!= final_balanceB)) {
printf("..");
}
printf("\nAll the
money is transferred !!\n");
}
使用 gcc 来编译这个程序，如下所示：
# gcc -g -o gdbtest2 gdbtest2.c -L/lib/tls -lpthread
程序 gdbtest2 会挂起，不会返回一条All the money is transferred !!消息。
将 gdb 附加到正在运行的进程上，从而了解这个进程内部正在发生什么。
清单 21. 将 gdb 附加到正在运行的进程上
# ps -ef |grep gdbtest2
root
9510
8065
1 06:30 pts/1
00:00:00 ./gdbtest2
root
9516
9400
0 06:30 pts/4
00:00:00 grep gdbtest2
# gdb -pid 9510
GNU gdb 6.2.1
Copyright 2004 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you
are welcome to change it and/or distribute copies of it under certain
conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB.
Type "show warranty" for
details.
This GDB was configured as "ppc-suse-linux".
Attaching to process 9510
Reading symbols from /root/test/gdbtest2...done.
Using host libthread_db library "/lib/tls/libthread_db.so.1".
Reading symbols from /lib/tls/libpthread.so.0...done.
[Thread debugging using libthread_db enabled]
[New Thread 1073991712 (LWP 9510)]
[New Thread 1090771744 (LWP 9514)]
[New Thread 1086577440 (LWP 9513)]
[New Thread 1082383136 (LWP 9512)]
[New Thread 1078188832 (LWP 9511)]
Loaded symbols for /lib/tls/libpthread.so.0
Reading symbols from /lib/tls/libc.so.6...done.
Loaded symbols for /lib/tls/libc.so.6
Reading symbols from /lib/ld.so.1...done.
Loaded symbols for /lib/ld.so.1
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
(gdb) info thread
5 Thread 1078188832 (LWP 9511)
0x0ffe94ec in __lll_lock_wait ()
from /lib/tls/libpthread.so.0
4 Thread 1082383136 (LWP 9512)
0x0ffe94ec in __lll_lock_wait ()
from /lib/tls/libpthread.so.0
3 Thread 1086577440 (LWP 9513)
0x0ffe94ec in __lll_lock_wait ()
from /lib/tls/libpthread.so.0
2 Thread 1090771744 (LWP 9514)
0x0ffe94ec in __lll_lock_wait ()
from /lib/tls/libpthread.so.0
1 Thread 1073991712 (LWP 9510)
0x0ff4ac40 in __write_nocancel ()
from /lib/tls/libc.so.6
(gdb)
从info thread命令中，我们可以了解到除了主线程（thread #1）之外的所有线程都在等待函数__lll_lock_wait ()完成。
使用thread apply threadno where命令来查看每个线程到底运行到了什么地方：
清单 22. 查看每个线程运行到了什么地方
(gdb) thread apply 1 where
Thread 1 (Thread 1073991712 (LWP 9510)):
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
#1
0x0ff4ac28 in __write_nocancel () from /lib/tls/libc.so.6
Previous frame. identical to this frame. (corrupt stack?)
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
(gdb) thread apply 2 where
Thread 2 (Thread 1090771744 (LWP 9514)):
#0
0x0ffe94ec in __lll_lock_wait () from /lib/tls/libpthread.so.0
#1
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#2
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#3
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#4
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
Previous frame. inner to this frame. (corrupt stack?)
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
(gdb) thread apply 3 where
Thread 3 (Thread 1086577440 (LWP 9513)):
#0
0x0ffe94ec in __lll_lock_wait () from /lib/tls/libpthread.so.0
#1
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#2
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#3
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#4
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
Previous frame. inner to this frame. (corrupt stack?)
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
(gdb) thread apply 4 where
Thread 4 (Thread 1082383136 (LWP 9512)):
#0
0x0ffe94ec in __lll_lock_wait () from /lib/tls/libpthread.so.0
#1
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#2
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#3
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#4
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
Previous frame. inner to this frame. (corrupt stack?)
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
(gdb) thread apply 5 where
Thread 5 (Thread 1078188832 (LWP 9511)):
#0
0x0ffe94ec in __lll_lock_wait () from /lib/tls/libpthread.so.0
#1
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#2
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#3
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
#4
0x0ffe466c in pthread_mutex_lock () from /lib/tls/libpthread.so.0
Previous frame. inner to this frame. (corrupt stack?)
#0
0x0ff4ac40 in __write_nocancel () from /lib/tls/libc.so.6
每个线程都试图对一个互斥体进行加锁，但是这个互斥体却是不可用的，可能是因为有另外一个线程已经对其进行加锁了。从上面的证据我们可以判断程序中一定存在死锁。您还可以看到哪个线程现在拥有这个互斥体。
清单 23. 查看哪个线程拥有互斥体
(gdb) print AccountA_mutex
$1 = {__m_reserved = 2, __m_count = 0, __m_owner = 0x2527,
__m_kind = 0, __m_lock
= {__status = 1, __spinlock = 0}}
(gdb) print 0x2527
$2 = 9511
(gdb) print AccountB_mutex
$3 = {__m_reserved = 2, __m_count = 0, __m_owner = 0x2529,
__m_kind = 0, __m_lock = {__status = 1, __spinlock = 0}}
(gdb) print 0x2529
$4 = 9513
(gdb)
从上面的命令中，我们可以看出AccontA_mutex是被线程 5（LWP 9511）加锁（拥有）的，而AccontB_mutex是被线程 3（LWP 9513）加锁（拥有）的。
为了解决上面的死锁情况，可以按照相同的顺序对互斥体进行加锁，如下所示：
清单 24. 按照相同的顺序对互斥体进行加锁
.
.
void * transferAB (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountA_mutex);
pthread_mutex_lock(&AccountB_mutex);
if (accountA.balance < amount)
{
printf("There is not enough memory in Account A!\n");
pthread_mutex_unlock(&AccountA_mutex);
pthread_exit((void *)1);
}
accountA.balance -=amount;
sleep(1);
accountB.balance +=amount;
pthread_mutex_unlock(&AccountA_mutex);
pthread_mutex_unlock(&AccountB_mutex);
}
void * transferBA (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountA_mutex);
pthread_mutex_lock(&AccountB_mutex);
if (accountB.balance < amount)
{
printf("There is not enough memory in Account B!\n");
pthread_mutex_unlock(&AccountB_mutex);
pthread_exit((void *)1);
}
accountB.balance -=amount;
sleep(1);
accountA.balance +=amount;
pthread_mutex_unlock(&AccountA_mutex);
pthread_mutex_unlock(&AccountB_mutex);
}
.
.
或者对每个帐号单独进行加锁，如下所示：
清单 25. 对每个帐号单独进行加锁
.
.
void * transferAB (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountA_mutex);
if (accountA.balance < amount)
{
printf("There is not enough memory in Account A!\n");
pthread_mutex_unlock(&AccountA_mutex);
pthread_exit((void *)1);
}
accountA.balance -=amount;
sleep(1);
pthread_mutex_unlock(&AccountA_mutex);
pthread_mutex_lock(&AccountB_mutex);
accountB.balance +=amount;
pthread_mutex_unlock(&AccountB_mutex);
}
void * transferBA (void* amount_ptr) {
int amount = *((int*)amount_ptr);
pthread_mutex_lock(&AccountB_mutex);
if (accountB.balance < amount)
{
printf("There is not enough memory in Account B!\n");
pthread_mutex_unlock(&AccountB_mutex);
pthread_exit((void *)1);
}
accountB.balance -=amount;
sleep(1);
pthread_mutex_unlock(&AccountB_mutex);
pthread_mutex_lock(&AccountA_mutex);
accountA.balance +=amount;
pthread_mutex_unlock(&AccountA_mutex);
}
.
.
.
posted on 2010-08-05 18:05 叶子 阅读(722) 评论(0) 编辑 收藏 引用 所属分类: C\C++
只有注册用户登录后才能发表评论。
【推荐】超50万行VC++源码: 大型组态工控、电力仿真CAD与GIS源码库
网站导航: 博客园 IT新闻 BlogJava 知识库 博问 管理
|
{
"url": "http://www.cppblog.com/elva/archive/2010/08/05/122338.html",
"source_domain": "www.cppblog.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "59262",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OTWJTPKVUXWBQTDT5362ET7NQ63FVPTI",
"WARC-Concurrent-To": "<urn:uuid:93213f53-c031-48ba-bf29-a3bfd628997d>",
"WARC-Date": "2019-08-22T01:36:34Z",
"WARC-IP-Address": "47.97.166.246",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YQ5OLAYWBU6LIDQMXQZEMTZGPB6GBH5T",
"WARC-Record-ID": "<urn:uuid:45aa0a80-e17c-4506-b744-e0655c5f045a>",
"WARC-Target-URI": "http://www.cppblog.com/elva/archive/2010/08/05/122338.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3653ca1a-5e1d-4317-8ec3-1bc01e9dff94>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-13.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,
5,
6,
21,
22,
80,
112,
114,
140,
142,
159,
161,
177,
179,
231,
232,
299,
362,
363,
380,
383,
386,
389,
394,
401,
414,
455,
482,
486,
495,
497,
502,
515,
568,
569,
570,
571,
576,
603,
605,
616,
628,
630,
636,
650,
694,
699,
739,
741,
746,
775,
777,
783,
796,
821,
853,
860,
875,
912,
918,
959,
961,
967,
979,
1004,
1033,
1064,
1071,
1085,
1137,
1149,
1161,
1163,
1193,
1208,
1246,
1262,
1275,
1277,
1342,
1373,
1442,
1468,
1495,
1664,
1721,
1769,
1770,
1797,
1798,
1817,
1833,
1834,
1850,
1884,
1897,
1920,
1943,
1966,
1989,
2012,
2035,
2058,
2081,
2104,
2127,
2140,
2163,
2182,
2226,
2227,
2241,
2258,
2272,
2318,
2391,
2461,
2473,
2516,
2557,
2582,
2591,
2661,
2699,
2705,
2764,
2765,
2790,
2800,
2838,
2861,
2884,
2907,
2930,
2953,
2976,
2999,
3022,
3045,
3068,
3081,
3104,
3157,
3217,
3220,
3260,
3272,
3275,
3335,
3338,
3390,
3437,
3440,
3504,
3510,
3670,
3671,
3691,
3694,
3703,
3704,
3707,
3743,
3744,
3747,
3760,
3761,
3764,
3765,
3775,
3776,
3779,
3789,
3790,
3793,
3795,
3796,
3799,
3801,
3802,
3805,
3818,
3819,
3822,
3838,
3839,
3842,
3872,
3873,
3876,
3878,
3879,
3882,
3883,
3886,
3897,
3980,
3981,
4009,
4043,
4056,
4079,
4102,
4125,
4148,
4171,
4194,
4217,
4240,
4263,
4286,
4299,
4322,
4345,
4468,
4469,
4490,
4507,
4521,
4567,
4640,
4710,
4722,
4765,
4806,
4831,
4840,
4910,
4948,
4971,
5027,
5037,
5075,
5098,
5121,
5144,
5167,
5190,
5213,
5236,
5259,
5282,
5305,
5318,
5341,
5405,
5408,
5429,
5585,
5586,
5615,
5623,
5626,
5644,
5645,
5653,
5656,
5679,
5699,
5726,
5727,
5748,
5775,
5781,
5907,
5908,
5929,
5940,
5984,
6001,
6010,
6027,
6032,
6034,
6045,
6052,
6090,
6091,
6111,
6112,
6142,
6157,
6180,
6236,
6246,
6284,
6307,
6330,
6353,
6376,
6399,
6422,
6445,
6468,
6491,
6514,
6527,
6591,
6594,
6615,
6621,
6759,
6760,
6794,
6858,
6861,
6882,
6890,
6956,
6975,
6978,
7005,
7028,
7077,
7085,
7088,
7106,
7107,
7156,
7164,
7167,
7190,
7239,
7247,
7250,
7295,
7344,
7352,
7406,
7409,
7452,
7460,
7526,
7545,
7548,
7565,
7614,
7622,
7625,
7656,
7705,
7713,
7766,
7769,
7809,
7817,
7883,
7902,
7905,
7921,
7970,
7978,
8023,
8026,
8060,
8074,
8081,
8108,
8116,
8170,
8173,
8216,
8224,
8247,
8292,
8295,
8305,
8313,
8379,
8398,
8401,
8414,
8456,
8464,
8467,
8477,
8519,
8527,
8538,
8541,
8552,
8594,
8791,
8792,
8846,
8849,
8858,
8859,
8862,
8892,
8893,
8896,
8912,
8913,
8916,
8929,
8930,
8933,
8935,
8936,
8939,
8940,
8950,
8987,
8988,
9016,
9050,
9063,
9086,
9109,
9132,
9155,
9178,
9201,
9224,
9247,
9270,
9293,
9306,
9329,
9352,
9375,
9398,
9421,
9444,
9467,
9490,
9513,
9536,
9548,
9554,
9628,
9629,
9643,
9652,
9673,
9705,
9737,
9758,
9759,
9781,
9782,
9795,
9798,
9817,
9843,
9862,
9888,
9927,
9928,
9962,
9963,
10000,
10001,
10032,
10034,
10035,
10089,
10090,
10129,
10130,
10131,
10156,
10157,
10159,
10160,
10187,
10188,
10198,
10199,
10236,
10237,
10264,
10265,
10304,
10305,
10344,
10346,
10385,
10386,
10420,
10421,
10458,
10459,
10490,
10492,
10493,
10547,
10548,
10587,
10588,
10613,
10614,
10616,
10617,
10644,
10645,
10655,
10656,
10693,
10694,
10721,
10722,
10761,
10762,
10801,
10803,
10838,
10839,
10843,
10856,
10857,
10867,
10879,
10880,
10884,
10927,
10928,
10932,
10964,
10965,
11017,
11075,
11076,
11127,
11186,
11187,
11251,
11286,
11287,
11325,
11326,
11336,
11337,
11339,
11340,
11404,
11439,
11440,
11478,
11479,
11489,
11490,
11492,
11493,
11557,
11592,
11593,
11631,
11632,
11642,
11643,
11645,
11646,
11710,
11745,
11746,
11784,
11785,
11795,
11796,
11798,
11799,
11840,
11841,
11906,
11928,
11929,
11943,
11944,
11946,
11947,
11965,
11994,
11996,
12017,
12070,
12127,
12163,
12164,
12189,
12213,
12218,
12223,
12228,
12242,
12262,
12267,
12272,
12277,
12291,
12314,
12330,
12344,
12390,
12463,
12533,
12545,
12588,
12629,
12654,
12663,
12708,
12734,
12783,
12845,
12899,
12945,
12980,
13015,
13050,
13085,
13120,
13164,
13212,
13250,
13292,
13324,
13382,
13400,
13401,
13432,
13465,
13495,
13496,
13527,
13560,
13590,
13591,
13622,
13655,
13685,
13686,
13717,
13750,
13780,
13781,
13812,
13846,
13870,
13876,
13950,
14000,
14001,
14023,
14050,
14091,
14094,
14152,
14155,
14213,
14271,
14274,
14332,
14359,
14400,
14403,
14466,
14469,
14535,
14538,
14604,
14607,
14673,
14676,
14742,
14796,
14799,
14857,
14884,
14925,
14928,
14991,
14994,
15060,
15063,
15129,
15132,
15198,
15201,
15267,
15321,
15324,
15382,
15409,
15450,
15453,
15516,
15519,
15585,
15588,
15654,
15657,
15723,
15726,
15792,
15846,
15849,
15907,
15908,
15935,
15976,
15979,
16042,
16045,
16111,
16114,
16180,
16183,
16249,
16252,
16318,
16372,
16375,
16433,
16530,
16531,
16550,
16577,
16636,
16659,
16693,
16712,
16722,
16749,
16808,
16865,
16884,
16894,
16900,
16990,
17026,
17049,
17051,
17053,
17092,
17093,
17127,
17128,
17165,
17166,
17203,
17204,
17235,
17237,
17238,
17292,
17293,
17332,
17333,
17358,
17359,
17361,
17362,
17389,
17390,
17400,
17401,
17428,
17429,
17468,
17469,
17508,
17510,
17549,
17550,
17584,
17585,
17622,
17623,
17660,
17661,
17692,
17694,
17695,
17749,
17750,
17789,
17790,
17815,
17816,
17818,
17819,
17846,
17847,
17857,
17858,
17885,
17886,
17925,
17926,
17965,
17967,
17969,
17971,
17991,
18010,
18012,
18014,
18053,
18054,
18088,
18089,
18126,
18127,
18158,
18160,
18161,
18215,
18216,
18255,
18256,
18281,
18282,
18284,
18285,
18312,
18313,
18323,
18324,
18363,
18364,
18401,
18402,
18429,
18430,
18469,
18471,
18510,
18511,
18545,
18546,
18583,
18584,
18615,
18617,
18618,
18672,
18673,
18712,
18713,
18738,
18739,
18741,
18742,
18769,
18770,
18780,
18781,
18820,
18821,
18858,
18859,
18886,
18887,
18926,
18928,
18930,
18932,
18934,
18935,
19001,
19002,
19003,
19020,
19059
],
"line_end_idx": [
5,
6,
21,
22,
80,
112,
114,
140,
142,
159,
161,
177,
179,
231,
232,
299,
362,
363,
380,
383,
386,
389,
394,
401,
414,
455,
482,
486,
495,
497,
502,
515,
568,
569,
570,
571,
576,
603,
605,
616,
628,
630,
636,
650,
694,
699,
739,
741,
746,
775,
777,
783,
796,
821,
853,
860,
875,
912,
918,
959,
961,
967,
979,
1004,
1033,
1064,
1071,
1085,
1137,
1149,
1161,
1163,
1193,
1208,
1246,
1262,
1275,
1277,
1342,
1373,
1442,
1468,
1495,
1664,
1721,
1769,
1770,
1797,
1798,
1817,
1833,
1834,
1850,
1884,
1897,
1920,
1943,
1966,
1989,
2012,
2035,
2058,
2081,
2104,
2127,
2140,
2163,
2182,
2226,
2227,
2241,
2258,
2272,
2318,
2391,
2461,
2473,
2516,
2557,
2582,
2591,
2661,
2699,
2705,
2764,
2765,
2790,
2800,
2838,
2861,
2884,
2907,
2930,
2953,
2976,
2999,
3022,
3045,
3068,
3081,
3104,
3157,
3217,
3220,
3260,
3272,
3275,
3335,
3338,
3390,
3437,
3440,
3504,
3510,
3670,
3671,
3691,
3694,
3703,
3704,
3707,
3743,
3744,
3747,
3760,
3761,
3764,
3765,
3775,
3776,
3779,
3789,
3790,
3793,
3795,
3796,
3799,
3801,
3802,
3805,
3818,
3819,
3822,
3838,
3839,
3842,
3872,
3873,
3876,
3878,
3879,
3882,
3883,
3886,
3897,
3980,
3981,
4009,
4043,
4056,
4079,
4102,
4125,
4148,
4171,
4194,
4217,
4240,
4263,
4286,
4299,
4322,
4345,
4468,
4469,
4490,
4507,
4521,
4567,
4640,
4710,
4722,
4765,
4806,
4831,
4840,
4910,
4948,
4971,
5027,
5037,
5075,
5098,
5121,
5144,
5167,
5190,
5213,
5236,
5259,
5282,
5305,
5318,
5341,
5405,
5408,
5429,
5585,
5586,
5615,
5623,
5626,
5644,
5645,
5653,
5656,
5679,
5699,
5726,
5727,
5748,
5775,
5781,
5907,
5908,
5929,
5940,
5984,
6001,
6010,
6027,
6032,
6034,
6045,
6052,
6090,
6091,
6111,
6112,
6142,
6157,
6180,
6236,
6246,
6284,
6307,
6330,
6353,
6376,
6399,
6422,
6445,
6468,
6491,
6514,
6527,
6591,
6594,
6615,
6621,
6759,
6760,
6794,
6858,
6861,
6882,
6890,
6956,
6975,
6978,
7005,
7028,
7077,
7085,
7088,
7106,
7107,
7156,
7164,
7167,
7190,
7239,
7247,
7250,
7295,
7344,
7352,
7406,
7409,
7452,
7460,
7526,
7545,
7548,
7565,
7614,
7622,
7625,
7656,
7705,
7713,
7766,
7769,
7809,
7817,
7883,
7902,
7905,
7921,
7970,
7978,
8023,
8026,
8060,
8074,
8081,
8108,
8116,
8170,
8173,
8216,
8224,
8247,
8292,
8295,
8305,
8313,
8379,
8398,
8401,
8414,
8456,
8464,
8467,
8477,
8519,
8527,
8538,
8541,
8552,
8594,
8791,
8792,
8846,
8849,
8858,
8859,
8862,
8892,
8893,
8896,
8912,
8913,
8916,
8929,
8930,
8933,
8935,
8936,
8939,
8940,
8950,
8987,
8988,
9016,
9050,
9063,
9086,
9109,
9132,
9155,
9178,
9201,
9224,
9247,
9270,
9293,
9306,
9329,
9352,
9375,
9398,
9421,
9444,
9467,
9490,
9513,
9536,
9548,
9554,
9628,
9629,
9643,
9652,
9673,
9705,
9737,
9758,
9759,
9781,
9782,
9795,
9798,
9817,
9843,
9862,
9888,
9927,
9928,
9962,
9963,
10000,
10001,
10032,
10034,
10035,
10089,
10090,
10129,
10130,
10131,
10156,
10157,
10159,
10160,
10187,
10188,
10198,
10199,
10236,
10237,
10264,
10265,
10304,
10305,
10344,
10346,
10385,
10386,
10420,
10421,
10458,
10459,
10490,
10492,
10493,
10547,
10548,
10587,
10588,
10613,
10614,
10616,
10617,
10644,
10645,
10655,
10656,
10693,
10694,
10721,
10722,
10761,
10762,
10801,
10803,
10838,
10839,
10843,
10856,
10857,
10867,
10879,
10880,
10884,
10927,
10928,
10932,
10964,
10965,
11017,
11075,
11076,
11127,
11186,
11187,
11251,
11286,
11287,
11325,
11326,
11336,
11337,
11339,
11340,
11404,
11439,
11440,
11478,
11479,
11489,
11490,
11492,
11493,
11557,
11592,
11593,
11631,
11632,
11642,
11643,
11645,
11646,
11710,
11745,
11746,
11784,
11785,
11795,
11796,
11798,
11799,
11840,
11841,
11906,
11928,
11929,
11943,
11944,
11946,
11947,
11965,
11994,
11996,
12017,
12070,
12127,
12163,
12164,
12189,
12213,
12218,
12223,
12228,
12242,
12262,
12267,
12272,
12277,
12291,
12314,
12330,
12344,
12390,
12463,
12533,
12545,
12588,
12629,
12654,
12663,
12708,
12734,
12783,
12845,
12899,
12945,
12980,
13015,
13050,
13085,
13120,
13164,
13212,
13250,
13292,
13324,
13382,
13400,
13401,
13432,
13465,
13495,
13496,
13527,
13560,
13590,
13591,
13622,
13655,
13685,
13686,
13717,
13750,
13780,
13781,
13812,
13846,
13870,
13876,
13950,
14000,
14001,
14023,
14050,
14091,
14094,
14152,
14155,
14213,
14271,
14274,
14332,
14359,
14400,
14403,
14466,
14469,
14535,
14538,
14604,
14607,
14673,
14676,
14742,
14796,
14799,
14857,
14884,
14925,
14928,
14991,
14994,
15060,
15063,
15129,
15132,
15198,
15201,
15267,
15321,
15324,
15382,
15409,
15450,
15453,
15516,
15519,
15585,
15588,
15654,
15657,
15723,
15726,
15792,
15846,
15849,
15907,
15908,
15935,
15976,
15979,
16042,
16045,
16111,
16114,
16180,
16183,
16249,
16252,
16318,
16372,
16375,
16433,
16530,
16531,
16550,
16577,
16636,
16659,
16693,
16712,
16722,
16749,
16808,
16865,
16884,
16894,
16900,
16990,
17026,
17049,
17051,
17053,
17092,
17093,
17127,
17128,
17165,
17166,
17203,
17204,
17235,
17237,
17238,
17292,
17293,
17332,
17333,
17358,
17359,
17361,
17362,
17389,
17390,
17400,
17401,
17428,
17429,
17468,
17469,
17508,
17510,
17549,
17550,
17584,
17585,
17622,
17623,
17660,
17661,
17692,
17694,
17695,
17749,
17750,
17789,
17790,
17815,
17816,
17818,
17819,
17846,
17847,
17857,
17858,
17885,
17886,
17925,
17926,
17965,
17967,
17969,
17971,
17991,
18010,
18012,
18014,
18053,
18054,
18088,
18089,
18126,
18127,
18158,
18160,
18161,
18215,
18216,
18255,
18256,
18281,
18282,
18284,
18285,
18312,
18313,
18323,
18324,
18363,
18364,
18401,
18402,
18429,
18430,
18469,
18471,
18510,
18511,
18545,
18546,
18583,
18584,
18615,
18617,
18618,
18672,
18673,
18712,
18713,
18738,
18739,
18741,
18742,
18769,
18770,
18780,
18781,
18820,
18821,
18858,
18859,
18886,
18887,
18926,
18928,
18930,
18932,
18934,
18935,
19001,
19002,
19003,
19020,
19059,
19102
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19102,
"ccnet_original_nlines": 865,
"rps_doc_curly_bracket": 0.00497329980134964,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08662816882133484,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015770770609378815,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5621945858001709,
"rps_doc_frac_unique_words": 0.27594229578971863,
"rps_doc_mean_word_length": 6.611447334289551,
"rps_doc_num_sentences": 247,
"rps_doc_symbol_to_word_ratio": 0.012438920326530933,
"rps_doc_unigram_entropy": 5.494778633117676,
"rps_doc_word_count": 2149,
"rps_doc_frac_chars_dupe_10grams": 0.391539990901947,
"rps_doc_frac_chars_dupe_5grams": 0.5098536014556885,
"rps_doc_frac_chars_dupe_6grams": 0.4752956032752991,
"rps_doc_frac_chars_dupe_7grams": 0.4255349040031433,
"rps_doc_frac_chars_dupe_8grams": 0.4255349040031433,
"rps_doc_frac_chars_dupe_9grams": 0.405335009098053,
"rps_doc_frac_chars_top_2gram": 0.057010140269994736,
"rps_doc_frac_chars_top_3gram": 0.06644143909215927,
"rps_doc_frac_chars_top_4gram": 0.036036040633916855,
"rps_doc_books_importance": -2160.458740234375,
"rps_doc_books_importance_length_correction": -2160.458740234375,
"rps_doc_openwebtext_importance": -1208.232666015625,
"rps_doc_openwebtext_importance_length_correction": -1208.232666015625,
"rps_doc_wikipedia_importance": -684.8093872070312,
"rps_doc_wikipedia_importance_length_correction": -684.8093872070312
},
"fasttext": {
"dclm": 0.10322452336549759,
"english": 0.35443323850631714,
"fineweb_edu_approx": 1.2737953662872314,
"eai_general_math": 0.1182054877281189,
"eai_open_web_math": 0.056231558322906494,
"eai_web_code": 0.705481767654419
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,849,464,833,113,751,600 |
The Anti-Web-Design Manifesto(brandon.invergo.net)
over 7 years ago from ╯‵Д′)╯彡┻━┻ ., .
• Andrew ZimmermanAndrew Zimmerman, over 7 years ago
Design is "purpose, planning, or intention that exists or is thought to exist behind an action, fact, or material object." so, yes, design does include scripts, tracking and advertising, not just visual style as seen by the end user. It also includes what is being said and how the medium is being used to communicate the action, fact or object.
That said, it is no longer 1994 when I started building websites nor 2013 when this was written.
0 points
|
{
"url": "https://www.designernews.co/comments/170884",
"source_domain": "www.designernews.co",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "56457",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:53YXZMIEQZ5ANGPOHTGOUIWIS5FGEVUF",
"WARC-Concurrent-To": "<urn:uuid:5edebfba-bf4f-42a3-adaa-52ff34307c47>",
"WARC-Date": "2023-03-25T13:41:32Z",
"WARC-IP-Address": "3.232.242.170",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UMRF3AZVDQOWONS7WDNJKI5KXWKME6J7",
"WARC-Record-ID": "<urn:uuid:6b6a72cd-de6a-4fe4-bff8-5f75e3742662>",
"WARC-Target-URI": "https://www.designernews.co/comments/170884",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0f5124b2-24f9-4c5d-bcc1-52700845fff9>"
},
"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-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,
51,
52,
90,
91,
146,
147,
497,
498,
599,
600
],
"line_end_idx": [
51,
52,
90,
91,
146,
147,
497,
498,
599,
600,
612
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 612,
"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.3461538553237915,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015384620055556297,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26923078298568726,
"rps_doc_frac_unique_words": 0.7422680258750916,
"rps_doc_mean_word_length": 4.824742317199707,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.163041114807129,
"rps_doc_word_count": 97,
"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.021367520093917847,
"rps_doc_frac_chars_top_3gram": 0.04273504018783569,
"rps_doc_frac_chars_top_4gram": 0.055555559694767,
"rps_doc_books_importance": -63.15373611450195,
"rps_doc_books_importance_length_correction": -76.27404022216797,
"rps_doc_openwebtext_importance": -34.30190658569336,
"rps_doc_openwebtext_importance_length_correction": -47.422210693359375,
"rps_doc_wikipedia_importance": -29.601444244384766,
"rps_doc_wikipedia_importance_length_correction": -42.72175216674805
},
"fasttext": {
"dclm": 0.2081102728843689,
"english": 0.9458642601966858,
"fineweb_edu_approx": 2.306889533996582,
"eai_general_math": 0.034111861139535904,
"eai_open_web_math": 0.5165484547615051,
"eai_web_code": 0.0003891600063070655
}
}
|
{
"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": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,038,365,419,219,045,000 |
Jump to content
• Log In with Google Sign In
• Create Account
view frustrum culling
Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.
• You cannot reply to this topic
4 replies to this topic
#1 Members
588
Like
0Likes
Like
Posted 07 September 2013 - 03:57 PM
Would using view frustrum culling benifit players fps performance in a multiplayer game?
Has anyone tried it with say 100 players and only render the players that are within a set radius from you ? but for all the other players you would still need to know about there x,y,z positions right so the server always sends there positions to you that make the client decide if they should be rendered or not.
Could you do this for terrain and geomtry as well or that that be expensive on the server?
Edited by Anddos, 07 September 2013 - 04:02 PM.
:)
#2 Members
4830
Like
0Likes
Like
Posted 07 September 2013 - 05:18 PM
Without knowing more, I'd say yes.
Everything (outside the frustum) you can reject early and don't render is potentially increasing performance. Keeping track of players positions etc, also outside the frustum is another process/ on the cpu I assume
Crealysm game & engine development: http://www.crealysm.com
Looking for a passionate, disciplined and structured producer? PM me
#3 Members
6550
Like
0Likes
Like
Posted 07 September 2013 - 07:59 PM
i couldn't imagine NOT doing it! i mean you're already massively multi-player, with network lag and overhead slowing you down, so you start out with two strikes against you vs a single player title. AND YOU DON"T CULL THE SCENE? obviously, you'll still need all entity data, but physics and graphics should be unrelated, except for the fact that they both use the entity's location and rotation to do their job.
Norm Barrows
Rockland Software Productions
"Building PC games since 1989"
rocklandsoftware.net
PLAY CAVEMAN NOW!
http://rocklandsoftware.net/beta.php
#4 Members
1589
Like
0Likes
Like
Posted 07 September 2013 - 08:30 PM
I'd just add that frustum culling is purely a graphical task, and should be done client side and not on the server. Culling shouldn't have any effect on the amount of data you're sending, since you're presumably going to be sending the positions of each player either way.
Also, frustum culling terrain and static objects can be expensive if you've got large and detailed maps, so ideally you should have some kind of quad tree structure to limit the number of checks you need to do, but in the end any kind of culling is going to be much less expensive than attempting to draw all the off-screen assets.
#5 Members
1570
Like
0Likes
Like
Posted 08 September 2013 - 02:50 AM
For most scenarios a quadtree structure + frustum culling will get you very far. Unless you're working extensively in 3 dimensions, in that case you could consider an octree.
It will definitely be worth implementing based off your description, 100 player models, and I'm assuming an averagely detailed terrain with scenery on it.
Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.
|
{
"url": "https://www.gamedev.net/topic/647580-view-frustrum-culling/",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "124305",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P6VU6GNQQ5MUQPOZ7465UHX7SO3CWLMV",
"WARC-Concurrent-To": "<urn:uuid:1aa00e47-71d3-4763-80fa-4b108ccd9963>",
"WARC-Date": "2017-01-24T21:33:16Z",
"WARC-IP-Address": "64.91.255.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Y6ILZBG6GZT7GMZ7ZREPVYOYOWVIJHLY",
"WARC-Record-ID": "<urn:uuid:504578fc-fa83-4c09-a58d-3d26a759e954>",
"WARC-Target-URI": "https://www.gamedev.net/topic/647580-view-frustrum-culling/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f2a88b2-68e9-4e8b-9dbd-b0fa59472ec7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
17,
56,
75,
76,
98,
99,
100,
111,
112,
279,
280,
281,
316,
340,
341,
357,
358,
362,
367,
374,
379,
380,
416,
417,
506,
507,
822,
823,
825,
826,
917,
918,
919,
967,
968,
971,
972,
988,
989,
994,
999,
1006,
1011,
1012,
1048,
1049,
1084,
1299,
1300,
1360,
1361,
1430,
1431,
1432,
1448,
1449,
1454,
1459,
1466,
1471,
1472,
1508,
1509,
1923,
1924,
1925,
1938,
1939,
1969,
1970,
2001,
2002,
2023,
2024,
2026,
2027,
2045,
2046,
2083,
2084,
2086,
2087,
2089,
2090,
2091,
2107,
2108,
2113,
2118,
2125,
2130,
2131,
2167,
2168,
2441,
2442,
2444,
2445,
2777,
2778,
2779,
2780,
2796,
2797,
2802,
2807,
2814,
2819,
2820,
2856,
2857,
3032,
3033,
3188,
3189,
3190,
3191,
3192,
3193,
3194,
3205,
3206
],
"line_end_idx": [
16,
17,
56,
75,
76,
98,
99,
100,
111,
112,
279,
280,
281,
316,
340,
341,
357,
358,
362,
367,
374,
379,
380,
416,
417,
506,
507,
822,
823,
825,
826,
917,
918,
919,
967,
968,
971,
972,
988,
989,
994,
999,
1006,
1011,
1012,
1048,
1049,
1084,
1299,
1300,
1360,
1361,
1430,
1431,
1432,
1448,
1449,
1454,
1459,
1466,
1471,
1472,
1508,
1509,
1923,
1924,
1925,
1938,
1939,
1969,
1970,
2001,
2002,
2023,
2024,
2026,
2027,
2045,
2046,
2083,
2084,
2086,
2087,
2089,
2090,
2091,
2107,
2108,
2113,
2118,
2125,
2130,
2131,
2167,
2168,
2441,
2442,
2444,
2445,
2777,
2778,
2779,
2780,
2796,
2797,
2802,
2807,
2814,
2819,
2820,
2856,
2857,
3032,
3033,
3188,
3189,
3190,
3191,
3192,
3193,
3194,
3205,
3206,
3372
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3372,
"ccnet_original_nlines": 123,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4032023251056671,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03347888961434364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20378457009792328,
"rps_doc_frac_unique_words": 0.5008944272994995,
"rps_doc_mean_word_length": 4.638640403747559,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.007278020028024912,
"rps_doc_unigram_entropy": 5.232213497161865,
"rps_doc_word_count": 559,
"rps_doc_frac_chars_dupe_10grams": 0.10644041746854782,
"rps_doc_frac_chars_dupe_5grams": 0.16043193638324738,
"rps_doc_frac_chars_dupe_6grams": 0.16043193638324738,
"rps_doc_frac_chars_dupe_7grams": 0.16043193638324738,
"rps_doc_frac_chars_dupe_8grams": 0.10644041746854782,
"rps_doc_frac_chars_dupe_9grams": 0.10644041746854782,
"rps_doc_frac_chars_top_2gram": 0.020825300365686417,
"rps_doc_frac_chars_top_3gram": 0.026995759457349777,
"rps_doc_frac_chars_top_4gram": 0.03856537118554115,
"rps_doc_books_importance": -275.9559326171875,
"rps_doc_books_importance_length_correction": -275.9559326171875,
"rps_doc_openwebtext_importance": -159.0135040283203,
"rps_doc_openwebtext_importance_length_correction": -159.0135040283203,
"rps_doc_wikipedia_importance": -120.45128631591797,
"rps_doc_wikipedia_importance_length_correction": -120.45128631591797
},
"fasttext": {
"dclm": 0.027750549837946892,
"english": 0.9306014180183411,
"fineweb_edu_approx": 0.8896154165267944,
"eai_general_math": 0.10600197315216064,
"eai_open_web_math": 0.19228798151016235,
"eai_web_code": 0.0001102699970942922
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,207,432,313,421,226,200 |
Source code
Revision control
Other Tools
1
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2
/* This Source Code Form is subject to the terms of the Mozilla Public
3
* License, v. 2.0. If a copy of the MPL was not distributed with this
4
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
5
6
#ifndef nsURLHelper_h__
7
#define nsURLHelper_h__
8
9
#include "nsString.h"
10
11
class nsIFile;
12
class nsIURLParser;
13
14
enum netCoalesceFlags {
15
NET_COALESCE_NORMAL = 0,
16
17
/**
18
* retains /../ that reach above dir root (useful for FTP
19
* servers in which the root of the FTP URL is not necessarily
20
* the root of the FTP filesystem).
21
*/
22
NET_COALESCE_ALLOW_RELATIVE_ROOT = 1 << 0,
23
24
/**
25
* recognizes /%2F and // as markers for the root directory
26
* and handles them properly.
27
*/
28
NET_COALESCE_DOUBLE_SLASH_IS_ROOT = 1 << 1
29
};
30
31
//----------------------------------------------------------------------------
32
// This module contains some private helper functions related to URL parsing.
33
//----------------------------------------------------------------------------
34
35
/* shutdown frees URL parser */
36
void net_ShutdownURLHelper();
37
#ifdef XP_MACOSX
38
void net_ShutdownURLHelperOSX();
39
#endif
40
41
/* access URL parsers */
42
nsIURLParser* net_GetAuthURLParser();
43
nsIURLParser* net_GetNoAuthURLParser();
44
nsIURLParser* net_GetStdURLParser();
45
46
/* convert between nsIFile and file:// URL spec
47
* net_GetURLSpecFromFile does an extra stat, so callers should
48
* avoid it if possible in favor of net_GetURLSpecFromActualFile
49
* and net_GetURLSpecFromDir */
50
nsresult net_GetURLSpecFromFile(nsIFile*, nsACString&);
51
nsresult net_GetURLSpecFromDir(nsIFile*, nsACString&);
52
nsresult net_GetURLSpecFromActualFile(nsIFile*, nsACString&);
53
nsresult net_GetFileFromURLSpec(const nsACString&, nsIFile**);
54
55
/* extract file path components from file:// URL */
56
nsresult net_ParseFileURL(const nsACString& inURL, nsACString& outDirectory,
57
nsACString& outFileBaseName,
58
nsACString& outFileExtension);
59
60
/* handle .. in dirs while resolving URLs (path is UTF-8) */
61
void net_CoalesceDirs(netCoalesceFlags flags, char* path);
62
63
/**
64
* Resolves a relative path string containing "." and ".."
65
* with respect to a base path (assumed to already be resolved).
66
* For example, resolving "../../foo/./bar/../baz.html" w.r.t.
67
* "/a/b/c/d/e/" yields "/a/b/c/foo/baz.html". Attempting to
68
* ascend above the base results in the NS_ERROR_MALFORMED_URI
69
* exception. If basePath is null, it treats it as "/".
70
*
71
* @param relativePath a relative URI
72
* @param basePath a base URI
73
*
74
* @return a new string, representing canonical uri
75
*/
76
nsresult net_ResolveRelativePath(const nsACString& relativePath,
77
const nsACString& basePath,
78
nsACString& result);
79
80
/**
81
* Check if a URL is absolute
82
*
83
* @param inURL URL spec
84
* @return true if the given spec represents an absolute URL
85
*/
86
bool net_IsAbsoluteURL(const nsACString& inURL);
87
88
/**
89
* Extract URI-Scheme if possible
90
*
91
* @param inURI URI spec
92
* @param scheme scheme copied to this buffer on return. Is lowercase.
93
*/
94
nsresult net_ExtractURLScheme(const nsACString& inURI, nsACString& scheme);
95
96
/* check that the given scheme conforms to RFC 2396 */
97
bool net_IsValidScheme(const char* scheme, uint32_t schemeLen);
98
99
inline bool net_IsValidScheme(const nsCString& scheme) {
100
return net_IsValidScheme(scheme.get(), scheme.Length());
101
}
102
103
/**
104
* This function strips out all C0 controls and space at the beginning and end
105
* of the URL and filters out \r, \n, \t from the middle of the URL. This makes
106
* it safe to call on things like javascript: urls or data: urls, where we may
107
* in fact run into whitespace that is not properly encoded.
108
*
109
* @param input the URL spec we want to filter
110
* @param result the out param to write to if filtering happens
111
*/
112
void net_FilterURIString(const nsACString& input, nsACString& result);
113
114
/**
115
* This function performs character stripping just like net_FilterURIString,
116
* with the added benefit of also performing percent escaping of dissallowed
117
* characters, all in one pass. Saving one pass is very important when operating
118
* on really large strings.
119
*
120
* @param aInput the URL spec we want to filter
121
* @param aFlags the flags which control which characters we escape
122
* @param aResult the out param to write to if filtering happens
123
*/
124
nsresult net_FilterAndEscapeURI(const nsACString& aInput, uint32_t aFlags,
125
nsACString& aResult);
126
127
#if defined(XP_WIN)
128
/**
129
* On Win32 and OS/2 system's a back-slash in a file:// URL is equivalent to a
130
* forward-slash. This function maps any back-slashes to forward-slashes.
131
*
132
* @param aURL
133
* The URL string to normalize (UTF-8 encoded). This can be a
134
* relative URL segment.
135
* @param aResultBuf
136
* The resulting string is appended to this string. If the input URL
137
* is already normalized, then aResultBuf is unchanged.
138
*
139
* @returns false if aURL is already normalized. Otherwise, returns true.
140
*/
141
bool net_NormalizeFileURL(const nsACString& aURL, nsCString& aResultBuf);
142
#endif
143
144
/*****************************************************************************
145
* generic string routines follow (XXX move to someplace more generic).
146
*/
147
148
/* convert to lower case */
149
void net_ToLowerCase(char* str, uint32_t length);
150
void net_ToLowerCase(char* str);
151
152
/**
153
* returns pointer to first character of |str| in the given set. if not found,
154
* then |end| is returned. stops prematurely if a null byte is encountered,
155
* and returns the address of the null byte.
156
*/
157
char* net_FindCharInSet(const char* str, const char* end, const char* set);
158
159
/**
160
* returns pointer to first character of |str| NOT in the given set. if all
161
* characters are in the given set, then |end| is returned. if '\0' is not
162
* included in |set|, then stops prematurely if a null byte is encountered,
163
* and returns the address of the null byte.
164
*/
165
char* net_FindCharNotInSet(const char* str, const char* end, const char* set);
166
167
/**
168
* returns pointer to last character of |str| NOT in the given set. if all
169
* characters are in the given set, then |str - 1| is returned.
170
*/
171
char* net_RFindCharNotInSet(const char* str, const char* end, const char* set);
172
173
/**
174
* Parses a content-type header and returns the content type and
175
* charset (if any). aCharset is not modified if no charset is
176
* specified in anywhere in aHeaderStr. In that case (no charset
177
* specified), aHadCharset is set to false. Otherwise, it's set to
178
* true. Note that aContentCharset can be empty even if aHadCharset
179
* is true.
180
*
181
* This parsing is suitable for HTTP request. Use net_ParseContentType
182
* for parsing this header in HTTP responses.
183
*/
184
void net_ParseRequestContentType(const nsACString& aHeaderStr,
185
nsACString& aContentType,
186
nsACString& aContentCharset,
187
bool* aHadCharset);
188
189
/**
190
* Parses a content-type header and returns the content type and
191
* charset (if any). aCharset is not modified if no charset is
192
* specified in anywhere in aHeaderStr. In that case (no charset
193
* specified), aHadCharset is set to false. Otherwise, it's set to
194
* true. Note that aContentCharset can be empty even if aHadCharset
195
* is true.
196
*/
197
void net_ParseContentType(const nsACString& aHeaderStr,
198
nsACString& aContentType, nsACString& aContentCharset,
199
bool* aHadCharset);
200
/**
201
* As above, but also returns the start and end indexes for the charset
202
* parameter in aHeaderStr. These are indices for the entire parameter, NOT
203
* just the value. If there is "effectively" no charset parameter (e.g. if an
204
* earlier type with one is overridden by a later type without one),
205
* *aHadCharset will be true but *aCharsetStart will be set to -1. Note that
206
* it's possible to have aContentCharset empty and *aHadCharset true when
207
* *aCharsetStart is nonnegative; this corresponds to charset="".
208
*/
209
void net_ParseContentType(const nsACString& aHeaderStr,
210
nsACString& aContentType, nsACString& aContentCharset,
211
bool* aHadCharset, int32_t* aCharsetStart,
212
int32_t* aCharsetEnd);
213
214
/* inline versions */
215
216
/* remember the 64-bit platforms ;-) */
217
#define NET_MAX_ADDRESS ((char*)UINTPTR_MAX)
218
219
inline char* net_FindCharInSet(const char* str, const char* set) {
220
return net_FindCharInSet(str, NET_MAX_ADDRESS, set);
221
}
222
inline char* net_FindCharNotInSet(const char* str, const char* set) {
223
return net_FindCharNotInSet(str, NET_MAX_ADDRESS, set);
224
}
225
inline char* net_RFindCharNotInSet(const char* str, const char* set) {
226
return net_RFindCharNotInSet(str, str + strlen(str), set);
227
}
228
229
/**
230
* This function returns true if the given hostname does not include any
231
* restricted characters. Otherwise, false is returned.
232
*/
233
bool net_IsValidHostName(const nsACString& host);
234
235
/**
236
* Checks whether the IPv4 address is valid according to RFC 3986 section 3.2.2.
237
*/
238
bool net_IsValidIPv4Addr(const nsACString& aAddr);
239
240
/**
241
* Checks whether the IPv6 address is valid according to RFC 3986 section 3.2.2.
242
*/
243
bool net_IsValidIPv6Addr(const nsACString& aAddr);
244
245
/**
246
* Returns the max length of a URL. The default is 1048576 (1 MB).
247
* Can be changed by pref "network.standard-url.max-length"
248
*/
249
int32_t net_GetURLMaxLength();
250
251
#endif // !nsURLHelper_h__
|
{
"url": "https://searchfox.org/mozilla-central/source/netwerk/base/nsURLHelper.h",
"source_domain": "searchfox.org",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "152638",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B3NRJJAUOU3Y52ZFXTNCFH7JRMPBVJL2",
"WARC-Concurrent-To": "<urn:uuid:4554c7dd-2615-4181-b773-5206f1259956>",
"WARC-Date": "2019-06-24T13:10:20Z",
"WARC-IP-Address": "54.218.92.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:T7YHQH3U3NCC2QMPFD5CXRXR5Z4GO233",
"WARC-Record-ID": "<urn:uuid:46634015-808e-401e-a936-9bbec703d487>",
"WARC-Target-URI": "https://searchfox.org/mozilla-central/source/netwerk/base/nsURLHelper.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:219e2923-e799-4df5-bd29-e835b0c90efa>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-137-110-251.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,
12,
13,
30,
31,
43,
44,
46,
126,
128,
199,
201,
271,
273,
335,
337,
339,
363,
365,
389,
391,
393,
415,
418,
421,
436,
439,
459,
462,
465,
489,
492,
517,
520,
523,
527,
530,
587,
590,
652,
655,
690,
693,
696,
699,
742,
745,
748,
752,
755,
814,
817,
846,
849,
852,
855,
898,
901,
904,
907,
910,
989,
992,
1070,
1073,
1152,
1155,
1158,
1190,
1193,
1223,
1226,
1243,
1246,
1279,
1282,
1289,
1292,
1295,
1320,
1323,
1361,
1364,
1404,
1407,
1444,
1447,
1450,
1498,
1501,
1564,
1567,
1631,
1634,
1665,
1668,
1724,
1727,
1782,
1785,
1847,
1850,
1913,
1916,
1919,
1971,
1974,
2051,
2054,
2083,
2086,
2117,
2120,
2123,
2184,
2187,
2246,
2249,
2252,
2256,
2259,
2317,
2320,
2384,
2387,
2449,
2452,
2512,
2515,
2577,
2580,
2635,
2638,
2640,
2643,
2680,
2683,
2712,
2715,
2717,
2720,
2771,
2774,
2777,
2780,
2845,
2848,
2876,
2879,
2900,
2903,
2906,
2910,
2913,
2942,
2945,
2947,
2950,
2974,
2977,
3037,
3040,
3043,
3046,
3095,
3098,
3101,
3105,
3108,
3141,
3144,
3146,
3149,
3173,
3176,
3246,
3249,
3252,
3255,
3331,
3334,
3337,
3392,
3395,
3459,
3462,
3465,
3522,
3526,
3583,
3587,
3589,
3593,
3597,
3601,
3605,
3683,
3687,
3766,
3770,
3848,
3852,
3912,
3916,
3918,
3922,
3968,
3972,
4035,
4039,
4042,
4046,
4117,
4121,
4125,
4129,
4133,
4209,
4213,
4289,
4293,
4373,
4377,
4404,
4408,
4410,
4414,
4461,
4465,
4532,
4536,
4600,
4604,
4607,
4611,
4686,
4690,
4712,
4716,
4720,
4740,
4744,
4748,
4752,
4830,
4834,
4907,
4911,
4913,
4917,
4931,
4935,
4996,
5000,
5024,
5028,
5048,
5052,
5120,
5124,
5179,
5183,
5185,
5189,
5262,
5266,
5269,
5273,
5347,
5351,
5358,
5362,
5366,
5445,
5449,
5520,
5524,
5527,
5531,
5535,
5563,
5567,
5617,
5621,
5654,
5658,
5662,
5666,
5670,
5748,
5752,
5827,
5831,
5875,
5879,
5882,
5886,
5962,
5966,
5970,
5974,
5978,
6053,
6057,
6131,
6135,
6210,
6214,
6258,
6262,
6265,
6269,
6348,
6352,
6356,
6360,
6364,
6438,
6442,
6505,
6509,
6512,
6516,
6596,
6600,
6604,
6608,
6612,
6676,
6680,
6742,
6746,
6810,
6814,
6880,
6884,
6951,
6955,
6966,
6970,
6972,
6976,
7046,
7050,
7095,
7099,
7102,
7106,
7169,
7173,
7199,
7203,
7232,
7236,
7256,
7260,
7264,
7268,
7272,
7336,
7340,
7402,
7406,
7470,
7474,
7540,
7544,
7611,
7615,
7626,
7630,
7633,
7637,
7693,
7697,
7752,
7756,
7776,
7780,
7784,
7788,
7859,
7863,
7938,
7942,
8019,
8023,
8091,
8095,
8171,
8175,
8248,
8252,
8317,
8321,
8324,
8328,
8384,
8388,
8443,
8447,
8490,
8494,
8517,
8521,
8525,
8547,
8551,
8555,
8595,
8599,
8644,
8648,
8652,
8719,
8723,
8776,
8780,
8782,
8786,
8856,
8860,
8916,
8920,
8922,
8926,
8997,
9001,
9060,
9064,
9066,
9070,
9074,
9078,
9082,
9154,
9158,
9213,
9217,
9220,
9224,
9274,
9278,
9282,
9286,
9290,
9370,
9374,
9377,
9381,
9432,
9436,
9440,
9444,
9448,
9528,
9532,
9535,
9539,
9590,
9594,
9598,
9602,
9606,
9672,
9676,
9735,
9739,
9742,
9746,
9777,
9781,
9785
],
"line_end_idx": [
12,
13,
30,
31,
43,
44,
46,
126,
128,
199,
201,
271,
273,
335,
337,
339,
363,
365,
389,
391,
393,
415,
418,
421,
436,
439,
459,
462,
465,
489,
492,
517,
520,
523,
527,
530,
587,
590,
652,
655,
690,
693,
696,
699,
742,
745,
748,
752,
755,
814,
817,
846,
849,
852,
855,
898,
901,
904,
907,
910,
989,
992,
1070,
1073,
1152,
1155,
1158,
1190,
1193,
1223,
1226,
1243,
1246,
1279,
1282,
1289,
1292,
1295,
1320,
1323,
1361,
1364,
1404,
1407,
1444,
1447,
1450,
1498,
1501,
1564,
1567,
1631,
1634,
1665,
1668,
1724,
1727,
1782,
1785,
1847,
1850,
1913,
1916,
1919,
1971,
1974,
2051,
2054,
2083,
2086,
2117,
2120,
2123,
2184,
2187,
2246,
2249,
2252,
2256,
2259,
2317,
2320,
2384,
2387,
2449,
2452,
2512,
2515,
2577,
2580,
2635,
2638,
2640,
2643,
2680,
2683,
2712,
2715,
2717,
2720,
2771,
2774,
2777,
2780,
2845,
2848,
2876,
2879,
2900,
2903,
2906,
2910,
2913,
2942,
2945,
2947,
2950,
2974,
2977,
3037,
3040,
3043,
3046,
3095,
3098,
3101,
3105,
3108,
3141,
3144,
3146,
3149,
3173,
3176,
3246,
3249,
3252,
3255,
3331,
3334,
3337,
3392,
3395,
3459,
3462,
3465,
3522,
3526,
3583,
3587,
3589,
3593,
3597,
3601,
3605,
3683,
3687,
3766,
3770,
3848,
3852,
3912,
3916,
3918,
3922,
3968,
3972,
4035,
4039,
4042,
4046,
4117,
4121,
4125,
4129,
4133,
4209,
4213,
4289,
4293,
4373,
4377,
4404,
4408,
4410,
4414,
4461,
4465,
4532,
4536,
4600,
4604,
4607,
4611,
4686,
4690,
4712,
4716,
4720,
4740,
4744,
4748,
4752,
4830,
4834,
4907,
4911,
4913,
4917,
4931,
4935,
4996,
5000,
5024,
5028,
5048,
5052,
5120,
5124,
5179,
5183,
5185,
5189,
5262,
5266,
5269,
5273,
5347,
5351,
5358,
5362,
5366,
5445,
5449,
5520,
5524,
5527,
5531,
5535,
5563,
5567,
5617,
5621,
5654,
5658,
5662,
5666,
5670,
5748,
5752,
5827,
5831,
5875,
5879,
5882,
5886,
5962,
5966,
5970,
5974,
5978,
6053,
6057,
6131,
6135,
6210,
6214,
6258,
6262,
6265,
6269,
6348,
6352,
6356,
6360,
6364,
6438,
6442,
6505,
6509,
6512,
6516,
6596,
6600,
6604,
6608,
6612,
6676,
6680,
6742,
6746,
6810,
6814,
6880,
6884,
6951,
6955,
6966,
6970,
6972,
6976,
7046,
7050,
7095,
7099,
7102,
7106,
7169,
7173,
7199,
7203,
7232,
7236,
7256,
7260,
7264,
7268,
7272,
7336,
7340,
7402,
7406,
7470,
7474,
7540,
7544,
7611,
7615,
7626,
7630,
7633,
7637,
7693,
7697,
7752,
7756,
7776,
7780,
7784,
7788,
7859,
7863,
7938,
7942,
8019,
8023,
8091,
8095,
8171,
8175,
8248,
8252,
8317,
8321,
8324,
8328,
8384,
8388,
8443,
8447,
8490,
8494,
8517,
8521,
8525,
8547,
8551,
8555,
8595,
8599,
8644,
8648,
8652,
8719,
8723,
8776,
8780,
8782,
8786,
8856,
8860,
8916,
8920,
8922,
8926,
8997,
9001,
9060,
9064,
9066,
9070,
9074,
9078,
9082,
9154,
9158,
9213,
9217,
9220,
9224,
9274,
9278,
9282,
9286,
9290,
9370,
9374,
9377,
9381,
9432,
9436,
9440,
9444,
9448,
9528,
9532,
9535,
9539,
9590,
9594,
9598,
9602,
9606,
9672,
9676,
9735,
9739,
9742,
9746,
9777,
9781,
9785,
9811
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9811,
"ccnet_original_nlines": 472,
"rps_doc_curly_bracket": 0.001019260031171143,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1953740268945694,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026082679629325867,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42765748500823975,
"rps_doc_frac_unique_words": 0.4793510437011719,
"rps_doc_mean_word_length": 5.2876105308532715,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.004429129883646965,
"rps_doc_unigram_entropy": 5.857789516448975,
"rps_doc_word_count": 1356,
"rps_doc_frac_chars_dupe_10grams": 0.07949791103601456,
"rps_doc_frac_chars_dupe_5grams": 0.19511854648590088,
"rps_doc_frac_chars_dupe_6grams": 0.187587171792984,
"rps_doc_frac_chars_dupe_7grams": 0.1580195277929306,
"rps_doc_frac_chars_dupe_8grams": 0.13514643907546997,
"rps_doc_frac_chars_dupe_9grams": 0.10181310772895813,
"rps_doc_frac_chars_top_2gram": 0.011297070421278477,
"rps_doc_frac_chars_top_3gram": 0.010041840374469757,
"rps_doc_frac_chars_top_4gram": 0.013389119878411293,
"rps_doc_books_importance": -950.2640380859375,
"rps_doc_books_importance_length_correction": -950.2640380859375,
"rps_doc_openwebtext_importance": -532.4714965820312,
"rps_doc_openwebtext_importance_length_correction": -532.4714965820312,
"rps_doc_wikipedia_importance": -393.497314453125,
"rps_doc_wikipedia_importance_length_correction": -393.497314453125
},
"fasttext": {
"dclm": 0.8445817828178406,
"english": 0.39127466082572937,
"fineweb_edu_approx": 1.664808750152588,
"eai_general_math": 0.8021073341369629,
"eai_open_web_math": 0.6079007387161255,
"eai_web_code": 0.9368502497673035
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,600,364,417,357,167,000 |
MENU
What does semantic versioning have to do with Solidity
December 17, 2018
0
8427
0
Considering that the very first line of a solidity smart contract is something like:
pragma solidity ^0.4.21
What does the caret really mean? The short answer is the caret or top hat (^) means the code will be compatible with compiler version from 0.4.21 to 0.5.0.
This sounds easy to understand but it doesn’t actually tell the whole story. To really understand it, means learning about the concept of Semantic Versioning. In short, software versioning generally follows the format major.minor.revision. The caret is only one symbol out of various others such as ~ (tilde), * (wild card), || (logical or) and a bunch of typical ones such as >, >=, < and <=.
The real definition of ^ is: “Allows changes that do not modify the left-most non-zero digit in the major.minor.version tuple format. This definition explains the following examples:
^1.2.3: >=1.2.3 and <2.0.0
^0.2.3: >=0.2.3 and <0.3.0
^0.0.3: >=0.0.3 and <0.0.4
Tilde is interesting. The definition is: “Allows patch-level changes if a minor version is specified on the comparator. Allows minor-level changes if not.which again is explained by these examples:
~1.2.3: >=1.2.3 and <1.3.0
~0.2.3: >=0.2.3 and <0.3.0
~1.2:>=1.2.0 and <1.3.0 (Same as 1.2.x)
~1: >=1.0.0 <2.0.0 (Same as 1.x)
Learning the fundamentals provides a deeper understanding and also helps the recall as well.
Reference: https://docs.npmjs.com/misc/semver.html
This blog was inspired by: https://www.youtube.com/watch?v=KiTOycVbgcI
Leave a Comment!
Your email address will not be published. Required fields are marked *
|
{
"url": "http://www.talkcrypto.org/blog/2018/12/17/what-does-semantic-versioning-have-to-do-with-solidity/",
"source_domain": "www.talkcrypto.org",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "33498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GTGNUF5AKPIH3AFCER7WSBPJXKEH63DA",
"WARC-Concurrent-To": "<urn:uuid:57916a9e-e5bc-4511-9b6f-2323ef2b1962>",
"WARC-Date": "2021-10-22T06:17:25Z",
"WARC-IP-Address": "69.163.162.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7TZ4JN24I2XOQ2QZANJAQ54DPX6JMFL5",
"WARC-Record-ID": "<urn:uuid:d79e2647-5b13-4c8f-8292-d5f5d2d465f7>",
"WARC-Target-URI": "http://www.talkcrypto.org/blog/2018/12/17/what-does-semantic-versioning-have-to-do-with-solidity/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:806dd945-6db8-4ead-abee-5f121fdb585a>"
},
"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-13\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,
61,
62,
80,
82,
87,
89,
90,
175,
176,
200,
201,
357,
358,
752,
753,
937,
938,
966,
993,
1020,
1021,
1219,
1220,
1248,
1275,
1315,
1348,
1349,
1442,
1443,
1494,
1495,
1566,
1567,
1584,
1585
],
"line_end_idx": [
5,
6,
61,
62,
80,
82,
87,
89,
90,
175,
176,
200,
201,
357,
358,
752,
753,
937,
938,
966,
993,
1020,
1021,
1219,
1220,
1248,
1275,
1315,
1348,
1349,
1442,
1443,
1494,
1495,
1566,
1567,
1584,
1585,
1655
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1655,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2587719261646271,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0021929799113422632,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4780701696872711,
"rps_doc_frac_unique_words": 0.6065573692321777,
"rps_doc_mean_word_length": 5.016393661499023,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.720575332641602,
"rps_doc_word_count": 244,
"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.019607840105891228,
"rps_doc_frac_chars_top_3gram": 0.022875819355249405,
"rps_doc_frac_chars_top_4gram": 0.0277777798473835,
"rps_doc_books_importance": -166.07357788085938,
"rps_doc_books_importance_length_correction": -152.56031799316406,
"rps_doc_openwebtext_importance": -81.76661682128906,
"rps_doc_openwebtext_importance_length_correction": -81.76661682128906,
"rps_doc_wikipedia_importance": -73.57938385009766,
"rps_doc_wikipedia_importance_length_correction": -61.609832763671875
},
"fasttext": {
"dclm": 0.8302186131477356,
"english": 0.89669269323349,
"fineweb_edu_approx": 3.090390920639038,
"eai_general_math": 0.020957469940185547,
"eai_open_web_math": 0.3014776110649109,
"eai_web_code": 0.0009451499790884554
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,556,875,032,605,193,000 |
Prueba Ubuntu y Canaima desde el navegador
Escrito por Rubén Velasco
Ubuntu es sin duda el sistema operativo basado en Linux más utilizado y más extendido entre los usuarios de todo el mundo. Ubuntu está basado en Debian pero en las últimas actualizaciones Canonical se ha separado bastante de Debian por lo que ahora el desarrollo es prácticamente independiente. En el caso de que quieras probar esta distribución, os vamos a indicar cómo se puede hacer desde el propio navegador.
Todas las distribuciones de Linux, independientemente de sus raíces pueden trabajar desde consola o terminal. Esto para el día a día es bastante confuso y para los usuarios nuevos puede ser el principal contra para no decidirse a probar este sistema operativo. Existen multitud de escritorios similares al que posee Windows que permiten al usuario trabajar con una interfaz gráfica, pero la gente que nunca ha usado un sistema como puede ser Ubuntu o similar puede tener miedo a probarlo porque es posible que no llegue a gustarle, no pueda adaptarse al entorno gráfico o simplemente no sepa cómo manejarlo.
Casi todos los sistemas Linux disponen de un Live-CD que permite probar el sistema antes de instalar nada en el equipo, corriendo todo desde RAM, pero ahora existe un método mucho más rápido para tener un primer contacto con Ubuntu sin necesidad de descargarse nada ni de instalar nada en el sistema.
Los desarrolladores de Ubuntu han desarrollado una aplicación en HTML5 que nos va a permitir probar desde el navegador el sistema operativo sin necesidad de tener que instalar nada en nuestro equipo y así poder probarlo antes de descargar nada.
Podemos probar Ubuntu desde la web principal de Ubuntu.
ubuntu_navegador_1
Esto que cargamos desde el navegador no deja de ser una demo, no dispone en absoluto de todas las opciones disponibles en el sistema operativo, pero es totalmente útil para probar el navegador de internet, el explorador de archivos, LibreOffice así como los menús y más opciones.
Canaima es otra distribución de Linux basada en Debian que ha tomado ejemplo del tour de Ubuntu y ha creado su propia prueba a través del navegador que nos permite probar y conocer el sistema sin tener que descargar ni ejecutar nada.
Podemos probar Canaima desde su web principal.
ubuntu_navegador_2
A diferencia que Ubuntu, el tour de Canaima se encuentra en español y dispone de un tour guiado en el que enseñarán las funciones básicas del sistema operativo.
Este tipo de acciones son muy útiles para darse a conocer ya que nos van a permitir probar un sistema operativo sin tener ningún conocimiento, sin arriesgar nuestros datos y sin descargar nada. Con este tipo de tours serán más las personas que se animen a probar la alternativa a Windows.
|
{
"url": "https://www.redeszone.net/2013/06/24/prueba-ubuntu-y-canaima-desde-el-navegador/",
"source_domain": "www.redeszone.net",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "80637",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5WTZFF2E6HICYFW6WUEKIB5TDFDHTAJ3",
"WARC-Concurrent-To": "<urn:uuid:e9b3a66f-37ca-44f2-95dd-a5481d6ee9c5>",
"WARC-Date": "2018-01-16T09:35:58Z",
"WARC-IP-Address": "185.59.223.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VBWGOGZTIWHEGRQS33DZN6LTLH65N2YQ",
"WARC-Record-ID": "<urn:uuid:d1a09874-d07b-41c6-aed6-bd837a1d59e4>",
"WARC-Target-URI": "https://www.redeszone.net/2013/06/24/prueba-ubuntu-y-canaima-desde-el-navegador/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01a7e61b-e741-481f-adfd-97b52203bc18>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-149-106-217.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,
43,
44,
70,
71,
484,
485,
1093,
1094,
1395,
1396,
1641,
1642,
1698,
1699,
1718,
1719,
1999,
2000,
2234,
2235,
2282,
2283,
2302,
2303,
2464,
2465
],
"line_end_idx": [
43,
44,
70,
71,
484,
485,
1093,
1094,
1395,
1396,
1641,
1642,
1698,
1699,
1718,
1719,
1999,
2000,
2234,
2235,
2282,
2283,
2302,
2303,
2464,
2465,
2753
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2753,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1067761778831482,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008213549852371216,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.0574948713183403,
"rps_doc_frac_unique_words": 0.4388646185398102,
"rps_doc_mean_word_length": 4.986899375915527,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.821322441101074,
"rps_doc_word_count": 458,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01576182059943676,
"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.023642729967832565,
"rps_doc_frac_chars_top_3gram": 0.02101575955748558,
"rps_doc_frac_chars_top_4gram": 0.01401051040738821,
"rps_doc_books_importance": -188.44125366210938,
"rps_doc_books_importance_length_correction": -188.44125366210938,
"rps_doc_openwebtext_importance": -136.40821838378906,
"rps_doc_openwebtext_importance_length_correction": -136.40821838378906,
"rps_doc_wikipedia_importance": -63.246734619140625,
"rps_doc_wikipedia_importance_length_correction": -63.246734619140625
},
"fasttext": {
"dclm": 0.9208008646965027,
"english": 0.0003725200076587498,
"fineweb_edu_approx": 1.6727955341339111,
"eai_general_math": 0.00018841000564862043,
"eai_open_web_math": 0.6270225644111633,
"eai_web_code": 0.3955959677696228
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,164,812,699,745,396,000 |
Average Percentage Calculator - Free Online Tool
Avail Average Percentage Calculator and do your average percentages calculations without any hurdles. Simply put the input percentage entries in the provided fields and click on the calculate button to solve the average percentage. This online calculator makes your task so easy and provides accurate results with a comprehensive explanation.
n1= n2=
Related Calculators:
Free Average Percentage Online Calculator : Are you feeling calculating the average of percentages is difficult? You’re wrong, by using the online average percentage calculator can be so seldom to solve. Also, you can get complete knowledge on how it can be calculated manually, what percentage is and how to convert a percentage to decimal, what is the formula to determine average percentage with different sample sizes, and many more. Let’s dive into this page without any further ado.
Preset List of Calculations for Average Percentage Calculator
What is the Percentage?
The definition of percentage is the ratio of the number per 100 in the denominator. The symbol used to represent the percentage is %. For example, if a is the real number then the percentage of a is expressed as a% which is equal to a/100.
How To Convert Percentage to Decimals?
Do you think converting percentages to decimals is important? Yes, you’re right the calculation of average percentage can be easier after converting each percentage to its decimal form. It’s simple to convert into decimal, just divide the given number by 100 and the end result is in decimal form.
Average Percentage Formula
Here is the formula that can be used mostly to calculate the percentage averages. So, apply this formula to your complex problems and get the output manually and easily:
Average Percentage = [(Percentage 1 + percentage 2)/(sample size 1 + sample size 2)] x 100
Where
Percentage 1 = Decimal form of given percentage from sample size 1
Percentage 2 = Decimal form of given percentage from sample size 2
How To Calculate Average Percentage Manually?
Solving the average of two or more percentages involved various steps compared with solving the average of two or more normal numbers. You have to consider all the things while determining the average percentage. For easy calculation, follow the simple steps given below and calculate the average percentage:
• Firstly, you have to convert the average into decimals if required for further calculations.
• Find the number that each decimal portrays. For this, you have to multiply the decimal by the total sample number.
• Now, sum up the numbers together.
• Next, sum the sample sizes together.
• Finally, calculate the average percentage by dividing the sum of total percentages by the sum of total sample sizes.
Do check the below modules and gain more knowledge about the concept practically. Also, use the percentagecalculator.guru average percentage calculator and avail the answer in no time.
Solved Example on Calculating Average Percentage
Example 1: If a company is producing 400 products and sold 75% of them in the first category. Again, a company produces 500 products and 60% of them are sold. Let's find out the average percentage of products sold by the company.
Given data are 400 products and 500 products
75% and 60% percentages
Now, convert these two percentages into decimals;
we get; 75% in decimal is 0.75 and 60% in decimal is 0.60
In the next step, multiply the above decimals by total products;
ie., 0.75 times 400 is similar to 300.
0.06 times 500 is equal to 300.
Add these two percentages of products produced from each category
ie., 300+300 = 600
Now, add the total amount of products produced from each category
We get, 400+500 = 900
Finally, you can get the average percentage value by dividing the above results, and multiplying with 100.
Average Percentage = [(Percentage 1 + percentage 2)/(sample size 1 + sample size 2)] x 100
= 600 /900 x 100
= 66.66% after rounding 67%.
Therefore, the average percentage of products sold by the company is 67%.
FAQs on Average of Percentage Calculator with Steps
1. How do you average multiple percentages?
By using the average percentage formula ie., [(Percentage 1 + percentage 2)/(sample size 1 + sample size 2)] x 100, you can easily average multiple percentages.
2. How do you calculate the average percentage with the same sample size?
To find the percentage averages for the same samples, you have to add the given percentages and divide them by the total number of samples. For example: If you have two percentages like 50% and 60%, then calculating the percentage averages is possible by 50% + 60%/2 = 110%/2 = 55%.
3. How do you average 3 percentages?
Make use of the average percentage calculator provided by the percentagecalculator.guru and easily average 3 percentages with detailed solutions. Also, learn the formula to calculate it with some worked-out example
4. What is the weighted average of percentages?
If we have entries a1, a2, a3, ..., an with respective weights w1, w2, w3, ..., wn, then the weighted average of percentages is equal to (a1 * w1 + a2 * w2 + a3 * w3 + ... + an * wn) / (w1 + w2 + w3 + ... + wn).
|
{
"url": "https://lcmgcf.com/average-percentage-calculator/",
"source_domain": "lcmgcf.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "48815",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MKH5TDMWB5DLJITP5OC2OZ3XQE5I7YMU",
"WARC-Concurrent-To": "<urn:uuid:afb14dda-8e9f-4be1-9aef-8bd2f658f93b>",
"WARC-Date": "2022-10-03T11:57:20Z",
"WARC-IP-Address": "104.21.13.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O2SRUM4HOHWZNVA6AN7RU6BUEI3NEFQM",
"WARC-Record-ID": "<urn:uuid:046b8800-e3ba-4cf9-8f42-f1fa19025d7b>",
"WARC-Target-URI": "https://lcmgcf.com/average-percentage-calculator/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ed73be7a-ecd2-4dc3-9e37-8949dbd9d959>"
},
"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-251\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
49,
50,
393,
394,
403,
404,
425,
426,
915,
916,
978,
979,
1003,
1004,
1244,
1245,
1284,
1285,
1583,
1584,
1611,
1612,
1782,
1783,
1874,
1875,
1881,
1882,
1949,
1950,
2017,
2018,
2064,
2065,
2374,
2375,
2472,
2591,
2629,
2670,
2791,
2792,
2977,
2978,
3027,
3028,
3258,
3259,
3304,
3305,
3329,
3330,
3380,
3381,
3439,
3440,
3505,
3506,
3545,
3546,
3578,
3579,
3645,
3646,
3665,
3666,
3732,
3733,
3755,
3756,
3863,
3864,
3955,
3956,
3973,
3974,
4003,
4004,
4078,
4079,
4131,
4132,
4176,
4177,
4338,
4339,
4340,
4414,
4415,
4698,
4699,
4700,
4737,
4738,
4953,
4954,
4955,
5003,
5004
],
"line_end_idx": [
49,
50,
393,
394,
403,
404,
425,
426,
915,
916,
978,
979,
1003,
1004,
1244,
1245,
1284,
1285,
1583,
1584,
1611,
1612,
1782,
1783,
1874,
1875,
1881,
1882,
1949,
1950,
2017,
2018,
2064,
2065,
2374,
2375,
2472,
2591,
2629,
2670,
2791,
2792,
2977,
2978,
3027,
3028,
3258,
3259,
3304,
3305,
3329,
3330,
3380,
3381,
3439,
3440,
3505,
3506,
3545,
3546,
3578,
3579,
3645,
3646,
3665,
3666,
3732,
3733,
3755,
3756,
3863,
3864,
3955,
3956,
3973,
3974,
4003,
4004,
4078,
4079,
4131,
4132,
4176,
4177,
4338,
4339,
4340,
4414,
4415,
4698,
4699,
4700,
4737,
4738,
4953,
4954,
4955,
5003,
5004,
5215
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5215,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34241244196891785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2441634237766266,
"rps_doc_frac_unique_words": 0.3009592294692993,
"rps_doc_mean_word_length": 4.895683288574219,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.0038910498842597008,
"rps_doc_unigram_entropy": 4.836293697357178,
"rps_doc_word_count": 834,
"rps_doc_frac_chars_dupe_10grams": 0.04359539970755577,
"rps_doc_frac_chars_dupe_5grams": 0.1322556883096695,
"rps_doc_frac_chars_dupe_6grams": 0.11707077920436859,
"rps_doc_frac_chars_dupe_7grams": 0.10041636228561401,
"rps_doc_frac_chars_dupe_8grams": 0.08670096099376678,
"rps_doc_frac_chars_dupe_9grams": 0.06612785160541534,
"rps_doc_frac_chars_top_2gram": 0.09576292335987091,
"rps_doc_frac_chars_top_3gram": 0.04898358881473541,
"rps_doc_frac_chars_top_4gram": 0.02057310938835144,
"rps_doc_books_importance": -320.2152404785156,
"rps_doc_books_importance_length_correction": -320.2152404785156,
"rps_doc_openwebtext_importance": -285.7840881347656,
"rps_doc_openwebtext_importance_length_correction": -285.7840881347656,
"rps_doc_wikipedia_importance": -275.6271667480469,
"rps_doc_wikipedia_importance_length_correction": -275.6271667480469
},
"fasttext": {
"dclm": 0.9986452460289001,
"english": 0.892679750919342,
"fineweb_edu_approx": 3.0647854804992676,
"eai_general_math": 0.9993820786476135,
"eai_open_web_math": 0.8187248706817627,
"eai_web_code": 0.39366060495376587
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"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": "-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": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,425,975,489,143,882,000 |
Discussions
More than a smart TV—a better TV. Learn more about using your Roku TV, locate help resources, and share your experience.
cancel
Showing results for
Show only | Search instead for
Did you mean:
badtvexperience
Level 8
Menu Guide Issues
It seems like high school kids who just learned how to code decided to play with the menu guide again.
It's bad enough we cannot view days or even hours before the current time like we could with the original menu but now if you scroll right to a later time you cannot get back to the beginning by pressing the return button with the circle arrow above the rewind button. Now we have to keep holding the left navigation button.
I wish they would just give us the original menu back as an option instead of practicing their little coding skills at the risk of frustrating customers.
I think those who keep making these changes only make them to benefit themselves and figure the rest of us can go to **bleep** since they already got our money.
0 Kudos
6 Replies
DBDukes
Level 16
Re: Menu Guide Issues
What app? Roku has thousands, so it would be helpful to know which app has the issue. Netflix? Hulu? Prime Video? Sling TV? YouTube TV? Fubo? Pub-D-Hub? Tubi? IMDB TV? ESPN? VUDU? Peacock? Frndly.tv? Disney+ ... you get the idea. Which app is the one with the problem?
DBDukes
https://www.dbdukes.com/
Roku Ultra (4660)
Roku Streambar (9102)
Roku Streaming Stick+ (3810)
0 Kudos
badtvexperience
Level 8
Re: Menu Guide Issues
DBDukes: I'm not sure if you meant to respond to someone else's post and responded to mines by mistake or you just didn't read my post correctly because I never said anything about an app.
I was referring to the Over The Air TV Menu Guide simply known as the Menu Guide.
But thanks anyway.
0 Kudos
DBDukes
Level 16
Re: Menu Guide Issues
I intended to respond to you. There are many people who post similar questions but fail to mention the app they use. Keep in mind most Roku usage is with apps.
As apps are the most common usage of Roku devices, and as there are several apps that have menu guides, of which I listed only a few, I thought it best to try to find out the context of the question.
Your follow-up indicated that you are using a Roku TV, and not a Roku stick or box. The type of device is often helpful for troubleshooting. You also clarified that your issue is the programming guide for OTA programming. That will be helpful with troubleshooting.
I connect my antenna to my Roku devices through a different method, so I wouldn't be able to assist, now knowing the context. However, other users of the OTA programming guide may be able to help.
DBDukes
https://www.dbdukes.com/
Roku Ultra (4660)
Roku Streambar (9102)
Roku Streaming Stick+ (3810)
0 Kudos
badtvexperience
Level 8
Re: Menu Guide Issues
Okay, thanks for wanting to help.
0 Kudos
Benedlr
Level 9
Re: Menu Guide Issues
My OTA menu went to **bleep** too. The 10.0.0 update did it. A later 10.0.0 4166 or 4185 fixed it.
0 Kudos
badtvexperience
Level 8
Re: Menu Guide Issues
Once again the menu change caused the Caption to default to "Always On" while watching some of the apps (like Kanopy for example) causing us to have to manually turn it off which is annoying.
I wish Roku would leave well alone. It's like they have a timer for automatic changes that are terribly unnecessary.
I'm sure NO ONE complained about the original menu or anything else that did not need to be changed; Roku just did it because they are the strangest company out there.
Fix the Caption "Always On" issue and have at it with your compulsive changes since there is no stopping your weird fetish.
Where is cancel culture when we need them?
0 Kudos
|
{
"url": "https://community.roku.com/t5/Discussions/Menu-Guide-Issues/td-p/682701",
"source_domain": "community.roku.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "269951",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6PSRA7SYTAZ42LSH4JBFXD72GSBVOEGM",
"WARC-Concurrent-To": "<urn:uuid:a8065abe-501f-4502-8764-808f887508b4>",
"WARC-Date": "2021-05-08T21:34:02Z",
"WARC-IP-Address": "13.32.200.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NCLEVPWTSULX25N5CJG3INJNIRMJSDEX",
"WARC-Record-ID": "<urn:uuid:176ff518-d5cf-4915-9f79-92b628f61baf>",
"WARC-Target-URI": "https://community.roku.com/t5/Discussions/Menu-Guide-Issues/td-p/682701",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1848e972-234c-4dea-8c74-1a9fc9af7800>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-61.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
134,
141,
162,
196,
211,
227,
235,
236,
254,
255,
358,
359,
685,
686,
840,
841,
1003,
1004,
1012,
1022,
1030,
1039,
1040,
1062,
1063,
1332,
1333,
1341,
1366,
1384,
1406,
1435,
1443,
1459,
1467,
1468,
1490,
1491,
1680,
1681,
1763,
1764,
1783,
1784,
1792,
1800,
1809,
1810,
1832,
1833,
1993,
1994,
2194,
2195,
2460,
2461,
2658,
2659,
2667,
2692,
2710,
2732,
2761,
2769,
2785,
2793,
2794,
2816,
2817,
2851,
2852,
2860,
2868,
2876,
2877,
2899,
2900,
2999,
3000,
3008,
3024,
3032,
3033,
3055,
3056,
3248,
3249,
3366,
3367,
3535,
3536,
3660,
3661,
3704,
3705
],
"line_end_idx": [
12,
13,
134,
141,
162,
196,
211,
227,
235,
236,
254,
255,
358,
359,
685,
686,
840,
841,
1003,
1004,
1012,
1022,
1030,
1039,
1040,
1062,
1063,
1332,
1333,
1341,
1366,
1384,
1406,
1435,
1443,
1459,
1467,
1468,
1490,
1491,
1680,
1681,
1763,
1764,
1783,
1784,
1792,
1800,
1809,
1810,
1832,
1833,
1993,
1994,
2194,
2195,
2460,
2461,
2658,
2659,
2667,
2692,
2710,
2732,
2761,
2769,
2785,
2793,
2794,
2816,
2817,
2851,
2852,
2860,
2868,
2876,
2877,
2899,
2900,
2999,
3000,
3008,
3024,
3032,
3033,
3055,
3056,
3248,
3249,
3366,
3367,
3535,
3536,
3660,
3661,
3704,
3705,
3712
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3712,
"ccnet_original_nlines": 97,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4052697718143463,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03764114901423454,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18444165587425232,
"rps_doc_frac_unique_words": 0.4611872136592865,
"rps_doc_mean_word_length": 4.392693996429443,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.0012547100195661187,
"rps_doc_unigram_entropy": 5.243279933929443,
"rps_doc_word_count": 657,
"rps_doc_frac_chars_dupe_10grams": 0.08385308086872101,
"rps_doc_frac_chars_dupe_5grams": 0.12058211863040924,
"rps_doc_frac_chars_dupe_6grams": 0.12058211863040924,
"rps_doc_frac_chars_dupe_7grams": 0.12058211863040924,
"rps_doc_frac_chars_dupe_8grams": 0.09909909963607788,
"rps_doc_frac_chars_dupe_9grams": 0.09909909963607788,
"rps_doc_frac_chars_top_2gram": 0.031185029074549675,
"rps_doc_frac_chars_top_3gram": 0.03638254106044769,
"rps_doc_frac_chars_top_4gram": 0.03534303978085518,
"rps_doc_books_importance": -375.21783447265625,
"rps_doc_books_importance_length_correction": -375.21783447265625,
"rps_doc_openwebtext_importance": -205.0806884765625,
"rps_doc_openwebtext_importance_length_correction": -205.0806884765625,
"rps_doc_wikipedia_importance": -164.30035400390625,
"rps_doc_wikipedia_importance_length_correction": -164.30035400390625
},
"fasttext": {
"dclm": 0.027077259495854378,
"english": 0.9431228041648865,
"fineweb_edu_approx": 1.6990536451339722,
"eai_general_math": 0.03471171855926514,
"eai_open_web_math": 0.21197211742401123,
"eai_web_code": 0.01120299007743597
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"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": "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,131,555,713,873,062,000 |
SaaS CMS has officially launched! Learn more now.
Search on custom content providers
Vote:
Does Episerver Find support searching on custom content providers that connect to external data sources?
The documentation only mentions providing search capability for custom content providers by implementing FindPagesWithCriteria.
https://world.episerver.com/documentation/developer-guides/CMS/Content/Content-providers/Configuring-content-providers/
Ideally, we'd like to leverage Find's optimised search engine instead
#229043
Oct 07, 2020 5:54
Vote:
As long as you content provider supports IContent, it can be indexed by Find (you can technically use find with non-content objects, but that's trickier). Once it is indexed, it can be searched.
#229055
Oct 07, 2020 7:26
Vote:
Thanks Quan. So if I understand correctly, Find will be able to index IContent data from custom content providers even if the data is not stored in the CMS database?
Also, do you know when data in the external data source is updated, would we need to manually reindex or would Find handle this automatically?
#229299
Oct 12, 2020 6:34
Vote:
If you simply extend ContentProvider then your basic events (create, publish, delete etc.) should be covered by Find.
#229308
Oct 12, 2020 8:35
* You are NOT allowed to include any hyperlinks in the post because your account hasn't associated to your company. User profile should be updated.
|
{
"url": "https://world.optimizely.com/forum/developers-add-ons-forum/Search/Thread-Container/2020/10/search-on-custom-content-providers/",
"source_domain": "world.optimizely.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "63321",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YO4O53BH6HSF2GRLT2H5GPOSYT2CYHAM",
"WARC-Concurrent-To": "<urn:uuid:a9008654-b4ee-42c4-8660-ef374c00a8e5>",
"WARC-Date": "2024-07-13T22:07:10Z",
"WARC-IP-Address": "104.18.33.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OV6C6ORJJIS7M2ZBQWOUKHDFZT6WAO7X",
"WARC-Record-ID": "<urn:uuid:297e3f56-3e40-477d-8605-ab8d944e4d36>",
"WARC-Target-URI": "https://world.optimizely.com/forum/developers-add-ons-forum/Search/Thread-Container/2020/10/search-on-custom-content-providers/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42cf1636-e1f4-4125-b563-bfff91c89c31>"
},
"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-148\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,
50,
51,
86,
87,
93,
95,
96,
201,
202,
331,
332,
452,
453,
523,
524,
532,
550,
556,
558,
559,
755,
756,
764,
782,
788,
790,
791,
957,
958,
1101,
1102,
1110,
1128,
1134,
1136,
1137,
1256,
1257,
1265,
1283
],
"line_end_idx": [
50,
51,
86,
87,
93,
95,
96,
201,
202,
331,
332,
452,
453,
523,
524,
532,
550,
556,
558,
559,
755,
756,
764,
782,
788,
790,
791,
957,
958,
1101,
1102,
1110,
1128,
1134,
1136,
1137,
1256,
1257,
1265,
1283,
1430
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1430,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2871972322463989,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017301039770245552,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27681660652160645,
"rps_doc_frac_unique_words": 0.6473429799079895,
"rps_doc_mean_word_length": 5.4782609939575195,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.013840829953551292,
"rps_doc_unigram_entropy": 4.692790508270264,
"rps_doc_word_count": 207,
"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.04585538059473038,
"rps_doc_frac_chars_top_3gram": 0.07760141044855118,
"rps_doc_frac_chars_top_4gram": 0.042328041046857834,
"rps_doc_books_importance": -141.61410522460938,
"rps_doc_books_importance_length_correction": -139.7306671142578,
"rps_doc_openwebtext_importance": -81.56037902832031,
"rps_doc_openwebtext_importance_length_correction": -81.56037902832031,
"rps_doc_wikipedia_importance": -51.02216720581055,
"rps_doc_wikipedia_importance_length_correction": -44.36344909667969
},
"fasttext": {
"dclm": 0.07244932651519775,
"english": 0.8659451603889465,
"fineweb_edu_approx": 1.487947940826416,
"eai_general_math": 0.013760450296103954,
"eai_open_web_math": 0.1284012794494629,
"eai_web_code": 0.0031561299692839384
}
}
|
{
"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.778",
"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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,166,037,653,320,616,400 |
blob: 41658f6a11e54ebf33badd6c6b37302c5cb1a042 [file] [log] [blame]
// RUN: %clang_cc1 -fno-rtti -emit-llvm-only -triple i686-pc-win32 -fms-extensions -fdump-record-layouts -fsyntax-only %s 2>/dev/null \
// RUN: | FileCheck %s --strict-whitespace
// RUN: %clang_cc1 -fno-rtti -emit-llvm-only -triple x86_64-pc-win32 -fms-extensions -fdump-record-layouts -fsyntax-only %s 2>/dev/null \
// RUN: | FileCheck %s --strict-whitespace
extern "C" int printf(const char *fmt, ...);
struct __declspec(align(8)) B0 { B0() {printf("B0 : %p\n", this);} };
struct __declspec(align(8)) B1 { B1() {printf("B1 : %p\n", this);} };
struct __declspec(align(8)) B2 { B2() {printf("B2 : %p\n", this);} };
struct __declspec(align(8)) B3 { B3() {printf("B3 : %p\n", this);} };
struct __declspec(align(8)) B4 { B4() {printf("B4 : %p\n", this);} };
struct C0 { int a; C0() : a(0xf00000C0) {printf("C0 : %p\n", this);} };
struct C1 { int a; C1() : a(0xf00000C1) {printf("C1 : %p\n", this);} };
struct C2 { int a; C2() : a(0xf00000C2) {printf("C2 : %p\n", this);} };
struct C3 { int a; C3() : a(0xf00000C3) {printf("C3 : %p\n", this);} };
struct C4 { int a; C4() : a(0xf00000C4) {printf("C4 : %p\n", this);} };
struct A : B0 {
int a;
A() : a(0xf000000A) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct A{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 0 | int a
// CHECK-NEXT: | [sizeof=8, align=8
// CHECK-NEXT: | nvsize=8, nvalign=8]
struct B : B0 {
B0 b0;
int a;
B() : a(0xf000000B) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct B{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 0 | struct B0 b0 (empty)
// CHECK: 8 | int a
// CHECK-NEXT: | [sizeof=16, align=8
// CHECK-NEXT: | nvsize=16, nvalign=8]
struct C : B0, B1, B2, B3, B4 {
int a;
C() : a(0xf000000C) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct C{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 8 | struct B1 (base) (empty)
// CHECK-NEXT: 16 | struct B2 (base) (empty)
// CHECK-NEXT: 24 | struct B3 (base) (empty)
// CHECK-NEXT: 32 | struct B4 (base) (empty)
// CHECK-NEXT: 32 | int a
// CHECK-NEXT: | [sizeof=40, align=8
// CHECK-NEXT: | nvsize=40, nvalign=8]
struct D {
B0 b0;
C0 c0;
C1 c1;
C2 c2;
B1 b1;
int a;
D() : a(0xf000000D) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct D{{$}}
// CHECK-NEXT: 0 | struct B0 b0 (empty)
// CHECK: 8 | struct C0 c0
// CHECK-NEXT: 8 | int a
// CHECK: 12 | struct C1 c1
// CHECK-NEXT: 12 | int a
// CHECK: 16 | struct C2 c2
// CHECK-NEXT: 16 | int a
// CHECK: 24 | struct B1 b1 (empty)
// CHECK: 32 | int a
// CHECK-NEXT: | [sizeof=40, align=8
// CHECK-NEXT: | nvsize=40, nvalign=8]
struct E : B0, C0, C1, C2, B1 {
int a;
E() : a(0xf000000E) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct E{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 0 | struct C0 (base)
// CHECK-NEXT: 0 | int a
// CHECK-NEXT: 4 | struct C1 (base)
// CHECK-NEXT: 4 | int a
// CHECK-NEXT: 8 | struct C2 (base)
// CHECK-NEXT: 8 | int a
// CHECK-NEXT: 16 | struct B1 (base) (empty)
// CHECK-NEXT: 16 | int a
// CHECK-NEXT: | [sizeof=24, align=8
// CHECK-NEXT: | nvsize=24, nvalign=8]
struct F : C0, B0, B1, C1 {
int a;
F() : a(0xf000000F) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct F{{$}}
// CHECK-NEXT: 0 | struct C0 (base)
// CHECK-NEXT: 0 | int a
// CHECK-NEXT: 8 | struct B0 (base) (empty)
// CHECK-NEXT: 16 | struct B1 (base) (empty)
// CHECK-NEXT: 16 | struct C1 (base)
// CHECK-NEXT: 16 | int a
// CHECK-NEXT: 20 | int a
// CHECK-NEXT: | [sizeof=24, align=8
// CHECK-NEXT: | nvsize=24, nvalign=8]
struct G : B0, B1, B2, B3, B4 {
__declspec(align(32)) int a;
G() : a(0xf0000011) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct G{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 8 | struct B1 (base) (empty)
// CHECK-NEXT: 16 | struct B2 (base) (empty)
// CHECK-NEXT: 24 | struct B3 (base) (empty)
// CHECK-NEXT: 32 | struct B4 (base) (empty)
// CHECK-NEXT: 32 | int a
// CHECK-NEXT: | [sizeof=64, align=32
// CHECK-NEXT: | nvsize=64, nvalign=32]
struct __declspec(align(32)) H : B0, B1, B2, B3, B4 {
int a;
H() : a(0xf0000011) {printf("X : %p\n", this);}
};
// CHECK-LABEL: 0 | struct H{{$}}
// CHECK-NEXT: 0 | struct B0 (base) (empty)
// CHECK-NEXT: 8 | struct B1 (base) (empty)
// CHECK-NEXT: 16 | struct B2 (base) (empty)
// CHECK-NEXT: 24 | struct B3 (base) (empty)
// CHECK-NEXT: 32 | struct B4 (base) (empty)
// CHECK-NEXT: 32 | int a
// CHECK-NEXT: | [sizeof=64, align=32
// CHECK-NEXT: | nvsize=40, nvalign=32]
struct I {
int i0[0];
};
// CHECK-LABEL: 0 | struct I{{$}}
// CHECK-NEXT: 0 | int[0] i0
// CHECK-NEXT: | [sizeof={{1|4}}, align=4,
// CHECK-NEXT: | nvsize=0, nvalign=4]
struct J : I {
int j;
};
// CHECK-LABEL: 0 | struct J{{$}}
// CHECK-NEXT: 0 | struct I (base)
// CHECK-NEXT: 0 | int[0] i0
// CHECK-NEXT: 0 | int j
// CHECK-NEXT: | [sizeof=4, align=4,
// CHECK-NEXT: | nvsize=4, nvalign=4]
int a[
sizeof(A)+
sizeof(B)+
sizeof(C)+
sizeof(D)+
sizeof(E)+
sizeof(F)+
sizeof(G)+
sizeof(H)+
sizeof(I)+
sizeof(J)];
|
{
"url": "https://llvm.googlesource.com/llvm-project/+/77ff6f7df8691a735a2dc979cdb44835dd2d41af/clang/test/Layout/ms-x86-empty-nonvirtual-bases.cpp",
"source_domain": "llvm.googlesource.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "59029",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IJ7TSUI4YT6E7O56OCAQA3SJO254XDBY",
"WARC-Concurrent-To": "<urn:uuid:5b1fecc5-1cb2-46dc-8f0b-34c66899b8c3>",
"WARC-Date": "2023-01-27T18:18:00Z",
"WARC-IP-Address": "172.253.62.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GDWOQLRX7JLQJ3N2KEAYIBXBMTY3PAQ4",
"WARC-Record-ID": "<urn:uuid:aa216664-318f-43cc-b3b5-e62549e4ae7d>",
"WARC-Target-URI": "https://llvm.googlesource.com/llvm-project/+/77ff6f7df8691a735a2dc979cdb44835dd2d41af/clang/test/Layout/ms-x86-empty-nonvirtual-bases.cpp",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d95e665e-e40f-401e-90b3-a69a40221f30>"
},
"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-172\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,
68,
204,
247,
385,
428,
473,
543,
613,
683,
753,
823,
895,
967,
1039,
1111,
1183,
1199,
1206,
1254,
1257,
1291,
1335,
1360,
1396,
1434,
1450,
1457,
1464,
1512,
1515,
1549,
1593,
1633,
1653,
1690,
1729,
1761,
1768,
1816,
1819,
1853,
1897,
1941,
1986,
2031,
2076,
2102,
2139,
2178,
2189,
2196,
2203,
2210,
2217,
2224,
2231,
2279,
2282,
2316,
2356,
2383,
2408,
2436,
2462,
2490,
2516,
2552,
2573,
2610,
2649,
2681,
2688,
2736,
2739,
2773,
2817,
2853,
2878,
2914,
2939,
2975,
3000,
3045,
3071,
3108,
3147,
3175,
3182,
3230,
3233,
3267,
3303,
3328,
3372,
3417,
3454,
3480,
3506,
3543,
3582,
3614,
3643,
3691,
3694,
3728,
3772,
3816,
3861,
3906,
3951,
3977,
4015,
4055,
4109,
4116,
4164,
4167,
4201,
4245,
4289,
4334,
4379,
4424,
4450,
4488,
4528,
4539,
4550,
4553,
4587,
4616,
4659,
4697,
4712,
4719,
4722,
4756,
4791,
4820,
4845,
4882,
4920,
4927,
4938,
4949,
4960,
4971,
4982,
4993,
5004,
5015,
5026
],
"line_end_idx": [
68,
204,
247,
385,
428,
473,
543,
613,
683,
753,
823,
895,
967,
1039,
1111,
1183,
1199,
1206,
1254,
1257,
1291,
1335,
1360,
1396,
1434,
1450,
1457,
1464,
1512,
1515,
1549,
1593,
1633,
1653,
1690,
1729,
1761,
1768,
1816,
1819,
1853,
1897,
1941,
1986,
2031,
2076,
2102,
2139,
2178,
2189,
2196,
2203,
2210,
2217,
2224,
2231,
2279,
2282,
2316,
2356,
2383,
2408,
2436,
2462,
2490,
2516,
2552,
2573,
2610,
2649,
2681,
2688,
2736,
2739,
2773,
2817,
2853,
2878,
2914,
2939,
2975,
3000,
3045,
3071,
3108,
3147,
3175,
3182,
3230,
3233,
3267,
3303,
3328,
3372,
3417,
3454,
3480,
3506,
3543,
3582,
3614,
3643,
3691,
3694,
3728,
3772,
3816,
3861,
3906,
3951,
3977,
4015,
4055,
4109,
4116,
4164,
4167,
4201,
4245,
4289,
4334,
4379,
4424,
4450,
4488,
4528,
4539,
4550,
4553,
4587,
4616,
4659,
4697,
4712,
4719,
4722,
4756,
4791,
4820,
4845,
4882,
4920,
4927,
4938,
4949,
4960,
4971,
4982,
4993,
5004,
5015,
5026,
5037
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5037,
"ccnet_original_nlines": 152,
"rps_doc_curly_bracket": 0.023823700845241547,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.061458930373191833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1751866638660431,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5852957963943481,
"rps_doc_frac_unique_words": 0.19063004851341248,
"rps_doc_mean_word_length": 4.812601089477539,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0.000574379984755069,
"rps_doc_unigram_entropy": 3.85441517829895,
"rps_doc_word_count": 619,
"rps_doc_frac_chars_dupe_10grams": 0.24471299350261688,
"rps_doc_frac_chars_dupe_5grams": 0.5837529301643372,
"rps_doc_frac_chars_dupe_6grams": 0.5142665505409241,
"rps_doc_frac_chars_dupe_7grams": 0.4538435637950897,
"rps_doc_frac_chars_dupe_8grams": 0.41490432620048523,
"rps_doc_frac_chars_dupe_9grams": 0.36085936427116394,
"rps_doc_frac_chars_top_2gram": 0.04028197005391121,
"rps_doc_frac_chars_top_3gram": 0.1268882155418396,
"rps_doc_frac_chars_top_4gram": 0.06176568940281868,
"rps_doc_books_importance": -885.529052734375,
"rps_doc_books_importance_length_correction": -885.529052734375,
"rps_doc_openwebtext_importance": -631.4249267578125,
"rps_doc_openwebtext_importance_length_correction": -631.4249267578125,
"rps_doc_wikipedia_importance": -386.4566650390625,
"rps_doc_wikipedia_importance_length_correction": -386.4566650390625
},
"fasttext": {
"dclm": 0.03437691926956177,
"english": 0.1466073989868164,
"fineweb_edu_approx": 1.4755793809890747,
"eai_general_math": 0.02694004960358143,
"eai_open_web_math": 0.0065867300145328045,
"eai_web_code": 0.7953360080718994
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,482,465,152,639,202,000 |
Building a Dynamic Library from the Command Line
Problem
You wish to use your command-line tools to build a dynamic library from a collection of C++ source files, such as those listed in Example 1-2.
Solution
Follow these steps:
1. Use your compiler to compile the source files into object files. If you're using Windows, use the -D option to define any macros necessary to ensure that your dynamic library's symbols will be exported. For example, to build the dynamic library in Example 1-2, you need to define the macro GEORGERINGO_DLL. If you're building a third-party library, the installation instructions should tell you what macros to define.
2. Use your linker to create a dynamic library from the object files created in step 1.
If your dynamic library depends on other libraries, you'll need to tell the compiler where to search for the library headers, and to tell the linker the names of the other libraries and where to find them. This is discussed in detail in Recipe 1.5.
The basic commands for performing the first step are given Table 1-8; you'll need to modify the names of the input and output files appropriately. The commands for performing the second step are given in Table 1-11. If you're using a toolset that comes with static and dynamic variants of its runtime libraries, direct the compiler and linker to use a dynamically linked runtime, as described in Recipe 1.23.
Table 1-11. Commands for creating the dynamic library libgeorgeringo.so, libgeorgeringo.dll, or libgeorgeringo.dylib
Toolset
Command line
GCC
g++ -shared -fPIC -o libgeorgeringo.so george.o ringo.o georgeringo.o
GCC (Mac OS X)
g++ -dynamiclib -fPIC -o libgeorgeringo.dylib george.o ringo.o georgeringo.o
GCC (Cygwin)
g++ -shared -o libgeorgeringo.dll -Wl,out-implib,libgeorgeringo.dll.a-W1,export-all-symbols -Wl,enable-auto-image-base george.o ringo.o georgeringo.o
GCC (MinGW)
g++ -shared -o libgeorgeringo.dll -Wl,out-implib,libgeorgeringo.a -W1,export-all-symbols-Wl,enable-auto-image-base george.o ringo.o georgeringo.o
Visual C++
link -nologo -dll -out:libgeorgeringo.dll -implib:libgeorgeringo.lib george.obj ringo.obj georgeringo.obj
Intel (Windows)
xilink -nologo -dll -out:libgeorgeringo.dll -implib:libgeorgeringo.lib george.obj ringo.obj georgeringo.obj
Intel (Linux)
g++ -shared -fPIC -lrt -o libgeorgeringo.so george.o ringo.o georgeringo.o georgeringo.obj
Metrowerks (Windows)
mwld -shared -export dllexport -runtime dm -o libgeorgeringo.dll -implib libgeorgeringo.lib george.obj ringo.obj georgeringo.obj
Metrowerks (Mac OS X)
mwld -shared -export pragma -o libgeorgeringo.dylib george.o ringo.o georgeringo.o
CodeWarrior 10.0 (Mac OS X)[4]
Consult the Metrowerks documentation.
Borland
bcc32 -q -WD -WR -elibgeorgeringo.dll george.obj ringo.obj georgeringo.objimplib -c libgeorgeringo.lib libgeorgeringo.dll
Digital Mars
dmc -WD -L/implib:libgeorgeringo.lib -o libgeorgeringo.dll george.obj ringo.obj georgeringo.obj user32.lib kernel32.lib
[4] CodeWarrior 10.0 for Mac OS X will provide dynamic variants of its runtime support libraries; these should be used when building libgeorgeringo.dylib. (See Recipe 1.23.)
As of September 2005, the Comeau toolset does not support building dynamic libraries on Unix or Windows. Comeau Computing is currently working on dynamic library support, however, and expects it to be implemented for some Unix platforms including Linux by the end of 2005.
For example, to compile the source files from Example 1-2 into object files with the Borland compiler, assuming that the directory containing the Borland tools is in your PATH, change to the directory georgeringo and enter the following commands:
> bcc32 -c -q -WR -o george.obj george.cpp
george.cpp:
> bcc32 -c -q -WR -o ringo.obj ringo.cpp
ringo.cpp:
> bcc32 -c -q -WR -DGERORGERINGO_DLL -o georgeringo.obj georgeringo.cpp
georgeringo.cpp:
The compiler option -WR is used here to specify a dynamic variant of the runtime library. These three commands will generate the object files george.obj, ringo.obj, and georgeringo.obj. Next, enter the command:
> bcc32 -q -WD -WR -elibgeorgeringo.dll george.obj ringo.obj
georgeringo.obj
This will generate the dynamic library libgeorgeringo.dll. Finally, enter the command:
> implib -c libgeorgeringo.lib libgeorgeringo.dll
This will generate the import library libgeorgeringo.lib.
Discussion
How dynamic libraries are handled varies greatly depending on the operating system and toolset. From the programmer's point of view, the two most important differences are as follows:
Symbol visibility
Dynamic libraries can contain the definitions of classes, functions, and data. On some platforms, all such symbols are automatically accessible to code which uses a dynamic library; other systems offer programmers fine-grained control over which symbols are accessible. Being able to determine which symbols should be visible on a case-by-case basis is generally advantageous; it gives a programmer more explicit control of his library's public interface, and it often provides superior performance. It also makes building and using dynamic libraries more complex, however.
With most Windows toolsets, in order for a symbol defined in a dynamic library to be available to code which uses the dynamically library, it must be explicitly exported when the dynamic library is built and imported when an executable or dynamic library that uses the dynamic library is built. Some Unix toolsets also offer this flexibility; this is true for recent versions of GCC on several platforms, for Metrowerks on Mac OS X, and for Intel on Linux. In some cases, however, there is no alternative but to make all symbols visible.
Passing libraries to the linker
On Unix, a dynamic library can be specified as input to the linker when code using the dynamic library is linked. On Windows, except when using GCC, dynamic libraries are not specified directly as input to the linker; instead, an import library or module definition file is used.
Import libraries and module definition files
Import libraries, roughly speaking, are static libraries containing the information needed to invoke functions in a DLL at runtime. It's not necessary to know how they work, only how to create and use them. Most linkers create import libraries automatically when you build a DLL, but in some cases it may be necessary to use a separate tool called an import librarian. In Table 1-11, I used the Borland import librarian implib.exe to avoid the peculiar command-line syntax required by the Borland linker ilink32.exe.
A module definition file, or .def file, is a text file that describes the functions and data exported by a DLL. A .def file can be written by hand or automatically generated by a tool. An example .def file for the library libgeorgeringo.dll is shown in Example 1-5.
Example 1-5. A module definition file for libgeorgeringo.dll
LIBRARY LIBGEORGERINGO.DLL
EXPORTS
Georgeringo @1
Exporting symbols from a DLL
There are two standard methods for exporting symbols from a Windows DLL:
• Use the _ _declspec(dllexport) attribute in the DLL's headers, and build an import library for use when linking code that uses your DLL.
The _ _declspec(dllexport) attribute should be inserted at the beginning of the declarations of exported functions and data, following any linkage specifiers, and immediately following the class or struct keyword for exported classes. This is illustrated in Example 1-6. Note that _ _declspec(dllexport) is not part of the C++ language; it is a language extension implemented by most Windows compilers.
• Create a .def file describing the functions and data exported by your dynamic library.
Example 1-6. Using the _ _declspec(dllexport) attribute
_ _declpec(dllexport) int m = 3; // Exported data definition
extern _ _declpec(dllexport) int n; // Exported data declaration
_ _declpec(dllexport) void f( ); // Exported function declaration
class _ _declpec(dllexport) c { // Exported class definition
/* ... */
};
Using a .def file has certain advantages; for instance, it can allow functions in a DLL to be accessed by number rather than name, decreasing the size of a DLL. It also eliminates the need for the messy preprocessor directives such as those in the header georgeringo.hpp from Example 1-2. It has some serious drawbacks, however. For example, a .def file cannot be used to export classes. Furthermore, it can be difficult to remember to update your .def file when you add, remove, or modify functions in your DLL. I therefore recommend that you always use _ _declspec(dllexport). To learn the full syntax of .def files as well as how to use them, consult your toolset's documentation.
Importing symbols from a DLL
Just as there are two ways to export symbols from a DLL, there are two ways to import symbols:
• In the headers included by source code that uses your DLL, use the attribute _ _declspec(dllimport) and pass an import library to the linker when linking code that uses your DLL.
• Specify a .def file when linking code which depends on you DLL.
Just as with exporting symbols, I recommend that you use the attribute _ _decl-spec(dllimport) in your source code instead of using .def files. The attribute _ _decl-spec(dllimport) is used exactly like the attribute _ _declspec(dllexport), discussed earlier. Like _ _declspec(dllexport), _ _declspec(dllimport) is not part of the C++ language, but an extension implemented by most Windows compilers.
If you choose to use _ _declspec(dllexport) and _ _declspec(dllimport), you must be sure to use _ _declspec(dllexport) when building your DLL and _ _declspec(dllimport) when compiling code that uses your DLL. One approach would be to use two sets of headers: one for building your DLL and the other for compiling code that uses your DLL. This is not satisfactory, however, since it is difficult to maintain two separate versions of the same headers.
Instead, the usual approach is to define a macro that expands to _ _declspec(dllexport) when building your DLL and to _ _declspec(dllimport) otherwise. In Example 1-2, I used the macro GEORGERINGO_DECL for this purpose. On Windows, GEORGERINGO_DECL expands to _ _declspec(dllexport) if the macro GEORGERING_SOURCE is defined and to _ _declspec(dllimport) otherwise. By defining GEORGERING_SOURCE when building the DLL libgeorgeringo.dll but not when compiling code that uses libgeorgeringo.dll, you obtain the desired result.
Building DLLs with GCC
The Cygwin and MinGW ports of GCC, discussed in Recipe 1.1, handle DLLs differently than other Windows toolsets. When you build a DLL with GCC, all functions, classes, and data are exported by default. This behavior can be modified by passing the option no-export-all-symbols to the linker, by using the attribute _ _declspec-(dllexport) in your source files, or by using a .def file. In each of these three cases, unless you use the option export-all-symbols to force the linker to export all symbols, the only exported functions, classes, and data will be those marked _ _decl-spec(dllexport) or listed in the .def file.
It's therefore possible to use the GCC toolset to build DLLs in two ways: like an ordinary Windows toolset, exporting symbols explicitly using _ _declspec, or like a Unix toolset, exporting all symbols automatically.[5] I used the latter method in Example 1-2 and Table 1-11. If you choose this method, you should consider using the option export-all-symbols as a safety measure, in case you happen to include headers containing _ _declspec(dllexport).
[5] Confusingly, exporting symbols using _ _declspec(dllexport) is sometimes called implicit exporting.
GCC differs from other Windows toolsets in a second way: rather than passing the linker an import library associated with a DLL, you can pass the DLL itself. This is usually faster than using an import library. It can also create problems, however, since several versions of a DLL may exist on your system, and you must ensure that the linker selects the correct version. In Table 1-11, to demonstrate how to create import libraries with GCC, I chose not to use this feature.
With Cygwin, an import library for the DLL xxx.dll is typically named xxx.dll.a, while with MinGW it is typically named xxx.a. This is just a matter of convention.
GCC 4.0's -fvisibility option
Recent versions of GCC on several platforms, including Linux and Mac OS X, give programmers fine-grained control over which symbols in a dynamic library are exported: the command-line option -fvisibility can be used to set the default visibility of symbols in a dynamic library, and a special attribute syntax, similar to _ _declspec(dllexport) on Windows, can be used within source code to modify the visibility of symbols on a case-by-case basis. The -fvisibility option has several possible values, but the two interesting cases are default and hidden. Roughly speaking, default visibility means that a symbol is accessible to code in other modules; hidden visibility means that it is not. To enable selective exporting of symbols, specify -fvisibility=hidden on the command line and use the visibility attribute to mark selected symbols as visible, as shown in Example 1-7.
Example 1-7. Using the visibility attribute with the command-line option -fvisibility=hidden
extern _ _attribute_ _((visibility("default"))) int m; // exported
extern int n; // not exported
_ _attribute_ _((visibility("default"))) void f( ); // exported
void g( ); // not exported
struct _ _attribute_ _((visibility("default"))) S { }; // exported
struct T { }; // not exported
In Example 1-7, the attribute _ _attribute_ _((visibility("default"))) plays the same role as _ _declspec(dllexport) in Windows code.
Using the visibility attribute presents some of the same challenges as using _ _decl-spec(dllexport) and _ _declspec(dllimport), since you want the attribute to be present when building a shared library, but not when compiling code that uses the shared library, and you want it to be hidden entirely on platforms that don't support it. Just as with _ _declspec(dllexport) and _ _declspec(dllimport), this problem can be solved with the preprocessor. For example, you can modify the header georgeringo.hpp from Example 1-2 to take advantage of the visibility attribute as follows:
georgeringo/georgeringo.hpp
#ifndef GEORGERINGO_HPP_INCLUDED
#define GEORGERINGO_HPP_INCLUDED
// define GEORGERINGO_DLL when building libgerogreringo
# if defined(_WIN32) && !defined(__GNUC__)
# ifdef GEORGERINGO_DLL
# define GEORGERINGO_DECL _ _declspec(dllexport)
# else
# define GEORGERINGO_DECL _ _declspec(dllimport)
# endif
# else // Unix
# if defined(GEORGERINGO_DLL) && defined(HAS_GCC_VISIBILITY)
# define GEORGERINGO_DECL _ _attribute_ _((visibility("default")))
# else
# define GEORGERINGO_DECL
# endif
# endif
// Prints "George, and Ringo
"
GEORGERINGO_DECL void georgeringo( );
#endif // GEORGERINGO_HPP_INCLUDED
To make this work, you must define the macro HAS_GCC_VISIBILITY when building on systems that support the -fvisibility option.
Recent versions of the Intel compiler for Linux also support the -fvisibility option.
Symbol Visibility with Metrowerks for Mac OS X
Metrowerks for Mac OS X provides several options for exporting symbols from a dynamic library. When using the CodeWarrior IDE, you can use a symbol exports file, which plays a role similar to a .def file on Windows. You can also choose to export all symbols, using the option -export all, which is the default when building from the command-line. The method I recommend is to use #pragma export in your source code to mark the functions you wish to export, and to specify -export pragma on the command-line when building your dynamic library. The use of #export pragma is illustrated in Example 1-2: just invoke #pragma export on in your header files immediately before a group of functions you want to export, and #export pragma off immediately afterwards. If you want your code to work on toolsets other than Metrowerks, you should place the invocations of #pragma export between #ifdef/#endif directives, as illustrated in Example 1-2.
Command-line options
Let's take a quick look at the options used in Table 1-11. Each command line specifies:
• The name of the input files: george.obj, ringo.obj, and georgeringo.obj
• The name of the dynamic library to be created
• On Windows, the name of the import library
In addition, the linker requires an option to tell it to build a dynamic library rather than an executable. Most linkers use the option -shared, but Visual C++ and Intel for Windows use -dll, Borland and Digital Mars use -WD, and GGC for Mac OS X uses -dynamiclib.
Several of the options in Table 1-11 help dynamic libraries to be used more effectively at runtime. For example, some Unix linkers should be told to generate position-independent code using the option -fPIC (GCC and Intel for Linux). This option makes it more likely that multiple processes will be able to share a single copy of the dynamic library's code; on some systems, failing to specify this option can cause a linker error. Similarly, on Windows the GCC linker the option enable-auto-image-base makes it less likely that the operating system will attempt to load two dynamic libraries at the same location; using this option helps to speed DLL loading.
You can pass options to GCC linker via the compiler by using the compiler option -Wl,
to g++. (The letter following W is a lowercase l.)
Most of the remaining options are used to specify runtime library variants, as described in Recipe 1.23.
See Also
Recipe 1.9, Recipe 1.12, Recipe 1.16, Recipe 1.19, and Recipe 1.23
C++ Cookbook
Secure Programming Cookbook for C and C++: Recipes for Cryptography, Authentication, Input Validation & More
ISBN: 0596003943
EAN: 2147483647
Year: 2006
Pages: 241
Simiral book on Amazon
Flylib.com © 2008-2017.
If you may any questions please contact us: [email protected]
|
{
"url": "http://flylib.com/books/en/2.131.1/building_a_dynamic_library_from_the_command_line.html",
"source_domain": "flylib.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "41919",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KQENEP7A3ZAKY4LHXBIAG4WTJZZXYUTO",
"WARC-Concurrent-To": "<urn:uuid:52fc43eb-2e4e-4179-a529-8798b9f7fedb>",
"WARC-Date": "2018-01-23T15:29:56Z",
"WARC-IP-Address": "94.130.122.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SYI2HT4EHRPMEQIJKTZDVF3WYZXWQILH",
"WARC-Record-ID": "<urn:uuid:31de5c4c-b1da-46f8-b823-aa9bddd4b38d>",
"WARC-Target-URI": "http://flylib.com/books/en/2.131.1/building_a_dynamic_library_from_the_command_line.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:705c6b6f-c410-43be-9f88-a7a12060d7c2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-47-186-155.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,
1,
50,
51,
59,
60,
203,
204,
213,
214,
234,
235,
658,
748,
749,
998,
999,
1408,
1409,
1526,
1527,
1535,
1536,
1549,
1550,
1554,
1555,
1625,
1626,
1641,
1642,
1719,
1720,
1733,
1734,
1884,
1885,
1897,
1898,
2044,
2045,
2056,
2057,
2163,
2164,
2180,
2181,
2289,
2290,
2304,
2305,
2396,
2397,
2418,
2419,
2548,
2549,
2571,
2572,
2655,
2656,
2687,
2688,
2726,
2727,
2735,
2736,
2858,
2859,
2872,
2873,
2993,
2994,
3168,
3169,
3442,
3443,
3690,
3691,
3734,
3746,
3788,
3799,
3871,
3888,
3889,
4100,
4101,
4163,
4179,
4180,
4267,
4268,
4318,
4319,
4377,
4378,
4389,
4390,
4574,
4575,
4593,
4594,
5168,
5169,
5707,
5708,
5740,
5741,
6021,
6022,
6067,
6068,
6585,
6586,
6852,
6853,
6914,
6915,
6942,
6943,
6951,
6967,
6968,
6970,
6971,
7000,
7001,
7074,
7075,
7216,
7217,
7624,
7625,
7716,
7717,
7773,
7774,
7835,
7900,
7966,
8027,
8038,
8041,
8042,
8726,
8727,
8756,
8757,
8852,
8853,
9036,
9104,
9105,
9506,
9507,
9957,
9958,
10484,
10485,
10508,
10509,
11132,
11133,
11586,
11587,
11691,
11692,
12168,
12169,
12333,
12334,
12336,
12337,
12367,
12368,
13246,
13247,
13340,
13341,
13408,
13438,
13439,
13503,
13530,
13531,
13598,
13628,
13629,
13763,
13764,
14344,
14345,
14373,
14374,
14407,
14440,
14441,
14497,
14540,
14564,
14613,
14620,
14669,
14678,
14693,
14754,
14821,
14828,
14854,
14862,
14871,
14872,
14901,
14903,
14942,
14943,
14978,
14979,
15106,
15107,
15193,
15194,
15196,
15197,
15244,
15245,
16184,
16185,
16206,
16207,
16295,
16296,
16372,
16422,
16469,
16470,
16735,
16736,
17397,
17398,
17484,
17485,
17536,
17537,
17642,
17643,
17652,
17653,
17720,
17721,
17722,
17723,
17724,
17725,
17738,
17847,
17864,
17880,
17891,
17902,
17925,
17926,
17950
],
"line_end_idx": [
1,
50,
51,
59,
60,
203,
204,
213,
214,
234,
235,
658,
748,
749,
998,
999,
1408,
1409,
1526,
1527,
1535,
1536,
1549,
1550,
1554,
1555,
1625,
1626,
1641,
1642,
1719,
1720,
1733,
1734,
1884,
1885,
1897,
1898,
2044,
2045,
2056,
2057,
2163,
2164,
2180,
2181,
2289,
2290,
2304,
2305,
2396,
2397,
2418,
2419,
2548,
2549,
2571,
2572,
2655,
2656,
2687,
2688,
2726,
2727,
2735,
2736,
2858,
2859,
2872,
2873,
2993,
2994,
3168,
3169,
3442,
3443,
3690,
3691,
3734,
3746,
3788,
3799,
3871,
3888,
3889,
4100,
4101,
4163,
4179,
4180,
4267,
4268,
4318,
4319,
4377,
4378,
4389,
4390,
4574,
4575,
4593,
4594,
5168,
5169,
5707,
5708,
5740,
5741,
6021,
6022,
6067,
6068,
6585,
6586,
6852,
6853,
6914,
6915,
6942,
6943,
6951,
6967,
6968,
6970,
6971,
7000,
7001,
7074,
7075,
7216,
7217,
7624,
7625,
7716,
7717,
7773,
7774,
7835,
7900,
7966,
8027,
8038,
8041,
8042,
8726,
8727,
8756,
8757,
8852,
8853,
9036,
9104,
9105,
9506,
9507,
9957,
9958,
10484,
10485,
10508,
10509,
11132,
11133,
11586,
11587,
11691,
11692,
12168,
12169,
12333,
12334,
12336,
12337,
12367,
12368,
13246,
13247,
13340,
13341,
13408,
13438,
13439,
13503,
13530,
13531,
13598,
13628,
13629,
13763,
13764,
14344,
14345,
14373,
14374,
14407,
14440,
14441,
14497,
14540,
14564,
14613,
14620,
14669,
14678,
14693,
14754,
14821,
14828,
14854,
14862,
14871,
14872,
14901,
14903,
14942,
14943,
14978,
14979,
15106,
15107,
15193,
15194,
15196,
15197,
15244,
15245,
16184,
16185,
16206,
16207,
16295,
16296,
16372,
16422,
16469,
16470,
16735,
16736,
17397,
17398,
17484,
17485,
17536,
17537,
17642,
17643,
17652,
17653,
17720,
17721,
17722,
17723,
17724,
17725,
17738,
17847,
17864,
17880,
17891,
17902,
17925,
17926,
17950,
18009
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18009,
"ccnet_original_nlines": 263,
"rps_doc_curly_bracket": 0.0003331699990667403,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32249394059181213,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03413061052560806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24724535644054413,
"rps_doc_frac_unique_words": 0.23076923191547394,
"rps_doc_mean_word_length": 5.363774299621582,
"rps_doc_num_sentences": 235,
"rps_doc_symbol_to_word_ratio": 0.006449880078434944,
"rps_doc_unigram_entropy": 5.544662952423096,
"rps_doc_word_count": 2639,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13189685344696045,
"rps_doc_frac_chars_dupe_6grams": 0.07050511986017227,
"rps_doc_frac_chars_dupe_7grams": 0.03956199064850807,
"rps_doc_frac_chars_dupe_8grams": 0.01243377011269331,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021759100258350372,
"rps_doc_frac_chars_top_3gram": 0.010596959851682186,
"rps_doc_frac_chars_top_4gram": 0.0056517100892961025,
"rps_doc_books_importance": -1500.6328125,
"rps_doc_books_importance_length_correction": -1500.6328125,
"rps_doc_openwebtext_importance": -888.457763671875,
"rps_doc_openwebtext_importance_length_correction": -888.457763671875,
"rps_doc_wikipedia_importance": -782.5628051757812,
"rps_doc_wikipedia_importance_length_correction": -782.5628051757812
},
"fasttext": {
"dclm": 0.4994294047355652,
"english": 0.7813263535499573,
"fineweb_edu_approx": 2.775306463241577,
"eai_general_math": 0.9802838563919067,
"eai_open_web_math": 0.2585262060165405,
"eai_web_code": 0.9561321139335632
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.136",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,922,899,583,843,437,000 |
• Status: Solved
• Priority: Medium
• Security: Public
• Views: 293
• Last Modified:
Union Query
I am very unfamiliar with union queries... I have 5 tables that I would like to show the results of on one query. They all share one common column that is "DateSpec" there are only 4 different values that that could be. The ending table would be a 4 rowed table of the 4 datespec values. Then the columns would be all the different columns of the 5 tables.
DateSpec Column1 Column2
Value1 ValuefromTable1 ValuefromTable2
Value2 ValuefromTable1 ValuefromTable2
Vlaue3 ValuefromTable1 ValuefromTable2
Vlaue4 ValuefromTable1 ValuefromTable2
There would be about 15 tables in the end. Any idea? I think it is simple... I just am very unfamiliar with union queries. THanks!
0
cansevin
Asked:
cansevin
• 2
• 2
• 2
1 Solution
aikimarkCommented:
Union queries can be thought of as stacking the individual query results on top of one another. They need to have the same number of columns and each column's data types in each contributing query should to be the same.
It looks to me like you want to join these tables together by their key field and each table's column(s) would be added as needed. If the key might not exist in a table, you would use a left join (or right join) to that table.
0
GanapathiCommented:
I guess this is what you wanted.
The 5 tables you are talking about should have same set of columns. If not, not an issue. Identify the maximum number Columns from the 5 tables. Use default values(Blank or NULL) for the Tables that do not have all the columns(table having maximum number of columns)
Check out the below example. Hope it helps.
CREATE TABLE Table1(DateSpec CHAR(5),Column1 CHAR(5),Column2 CHAR(5),Column3 CHAR(5))
CREATE TABLE Table2(DateSpec CHAR(5),Column1 CHAR(5),Column2 CHAR(5))
CREATE TABLE Table3(DateSpec CHAR(5),Column1 CHAR(5),Column2 CHAR(5),Column3 CHAR(5))
CREATE TABLE Table4(DateSpec CHAR(5),Column1 CHAR(5),Column2 CHAR(5),Column3 CHAR(5))
CREATE TABLE Table5(DateSpec CHAR(5),Column1 CHAR(5))
INSERT INTO Table1 SELECT 'Spec1','Val1','Val2','Val3'
INSERT INTO Table2 SELECT 'Spec2','Val1','Val2'
INSERT INTO Table3 SELECT 'Spec3','Val1','Val2','Val3'
INSERT INTO Table4 SELECT 'Spec4','Val1','Val2','Val3'
INSERT INTO Table5 SELECT 'Spec5','Val1'
SELECT DateSpec,Column1,Column2,Column3 from Table1 UNION
SELECT DateSpec,Column1,Column2,'' as Column3 from Table2 UNION
SELECT DateSpec,Column1,Column2,Column3 from Table3 UNION
SELECT DateSpec,Column1,Column2,Column3 from Table4 UNION
SELECT DateSpec,Column1,'' as Column2,''as Column3 from Table5
Open in new window
Result:
DateSpec Column1 Column2 Column3
-------- ------- ------- -------
Spec1 Val1 Val2 Val3
Spec2 Val1 Val2
Spec3 Val1 Val2 Val3
Spec4 Val1 Val2 Val3
Spec5 Val1
Note: If Key values are missing in any of the 5 tables, then you will have to go with joins as mentioned by Aikimark.
0
cansevinAuthor Commented:
Thanks guys. Keys values may possibly be missing. I am going to have to try the Join option. If you can provide any an example of a Join. I don't understand the "Left join" and "Right Join".
There my be situation where a table has all, none or some of the information in the rows.
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.
GanapathiCommented:
Check the Result I have given above. Table2 and Table4 do not have all the information, but still they are pulled out with blank information. You may not need Joins here as it included all the results from all the tables.
The tables many need to have the same Key_column names. But they should be of same data types in all the tables.
Refer the below link if you want to know about joins. A good illustration.
http://www.techonthenet.com/oracle/joins.php
0
aikimarkCommented:
If you need to join two or more tables, with all rows from one table and just the matching-key rows from the second table, you need to change the join type keyword from a plain JOIN to either a LEFT JOIN or a RIGHT JOIN.
When using the query design wizard, you drag the key field(s) between table listboxes to join them. You then need to right click on the connecting line and select Join in the pop-up menu. This will allow you to change the join type.
0
cansevinAuthor Commented:
Thanks guys... I think I am almost there. I have code for my query below. The problem is, there is SOME data for the row of "LASTWEEK". That data isn't showing up. It seems that only data that is showing is where every column has a value. If only a couple columns of a row have a value, then I want the row to still show up. Not sure if that makes sense. I have also attached a screen shot of my resulting query and the design view of it.
SELECT DaySpecs.DaySpec, Avg(qryBookingDayswithYearAllAverages.AvgOfAvgOfSumOfExtendedPrice) AS AvgOfAvgOfAvgOfSumOfExtendedPrice, Avg(qryBookingDayswithYearAllAverages.AvgOfCountOfDAY) AS AvgOfAvgOfCountOfDAY, qryBookingTotalsAllSums.SumOfSumOfExtendedPrice, qryBookingTotalsAllSums.SumOfCountOfDAY, qryStatsforDailySalesReportFINAL.SumOfMessagesRecorded, qryStatsforDailySalesReportFINAL.SumOfTotalNewClients, qryStatsforDailySalesReportFINAL.SumOfBookedTrue, qryStatsforDailySalesReportFINAL.SumOfTalkedTo, qryStatsforDailySalesReportFINAL.SumOfFiveMinCallBack, qryReachOutSalesALL.SumOfCountOfCallMade, qryReachOutALL.SumOfCountOfReachOutSent
FROM ((((DaySpecs INNER JOIN qryBookingDayswithYearAllAverages ON DaySpecs.DaySpec = qryBookingDayswithYearAllAverages.DateSpec) INNER JOIN qryStatsforDailySalesReportFINAL ON DaySpecs.DaySpec = qryStatsforDailySalesReportFINAL.DateSpec) INNER JOIN qryReachOutSalesALL ON DaySpecs.DaySpec = qryReachOutSalesALL.DateSpec) INNER JOIN qryReachOutALL ON DaySpecs.DaySpec = qryReachOutALL.DateSpec) INNER JOIN qryBookingTotalsAllSums ON DaySpecs.DaySpec = qryBookingTotalsAllSums.DateSpec
GROUP BY DaySpecs.DaySpec, qryBookingTotalsAllSums.SumOfSumOfExtendedPrice, qryBookingTotalsAllSums.SumOfCountOfDAY, qryStatsforDailySalesReportFINAL.SumOfMessagesRecorded, qryStatsforDailySalesReportFINAL.SumOfTotalNewClients, qryStatsforDailySalesReportFINAL.SumOfBookedTrue, qryStatsforDailySalesReportFINAL.SumOfTalkedTo, qryStatsforDailySalesReportFINAL.SumOfFiveMinCallBack, qryReachOutSalesALL.SumOfCountOfCallMade, qryReachOutALL.SumOfCountOfReachOutSent;
Open in new window
Screen-shot-0425.pdf
0
Featured Post
Free Tool: Path Explorer
An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.
One of a set of tools we're offering as a way of saying thank you for being a part of the community.
• 2
• 2
• 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now
|
{
"url": "https://www.experts-exchange.com/questions/28419856/Union-Query.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "131748",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5G62OQF7HTKFKWBZ6FMJ7IUUATQXUFM6",
"WARC-Concurrent-To": "<urn:uuid:d6e1d2b7-d20f-433f-9394-d310e64a15d6>",
"WARC-Date": "2017-12-18T21:09:56Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HWVQWUJR3LNBMG3C5NL2T53GFZHJ6WGF",
"WARC-Record-ID": "<urn:uuid:950f4bc1-9cd3-49a8-8458-07fbd7b682e2>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28419856/Union-Query.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d8ef2b63-b4ea-4c24-a5ca-1a42d61f059e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-114-81.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
40,
61,
76,
95,
96,
108,
109,
466,
467,
529,
597,
665,
733,
801,
802,
933,
935,
944,
951,
960,
966,
972,
978,
989,
991,
1010,
1231,
1232,
1460,
1462,
1464,
1484,
1517,
1518,
1785,
1786,
1830,
1831,
1917,
1987,
2073,
2159,
2213,
2214,
2269,
2317,
2372,
2427,
2468,
2469,
2527,
2591,
2649,
2707,
2770,
2771,
2790,
2791,
2799,
2800,
2833,
2866,
2900,
2934,
2968,
3002,
3016,
3017,
3135,
3137,
3139,
3165,
3356,
3357,
3447,
3449,
3497,
3498,
3735,
3736,
3738,
3758,
3980,
3981,
4094,
4095,
4170,
4171,
4216,
4218,
4220,
4239,
4460,
4461,
4696,
4698,
4700,
4726,
5166,
5167,
5814,
6298,
6762,
6763,
6782,
6783,
6804,
6806,
6807,
6821,
6822,
6847,
6848,
7019,
7020,
7121,
7122,
7128,
7134,
7140,
7212
],
"line_end_idx": [
19,
40,
61,
76,
95,
96,
108,
109,
466,
467,
529,
597,
665,
733,
801,
802,
933,
935,
944,
951,
960,
966,
972,
978,
989,
991,
1010,
1231,
1232,
1460,
1462,
1464,
1484,
1517,
1518,
1785,
1786,
1830,
1831,
1917,
1987,
2073,
2159,
2213,
2214,
2269,
2317,
2372,
2427,
2468,
2469,
2527,
2591,
2649,
2707,
2770,
2771,
2790,
2791,
2799,
2800,
2833,
2866,
2900,
2934,
2968,
3002,
3016,
3017,
3135,
3137,
3139,
3165,
3356,
3357,
3447,
3449,
3497,
3498,
3735,
3736,
3738,
3758,
3980,
3981,
4094,
4095,
4170,
4171,
4216,
4218,
4220,
4239,
4460,
4461,
4696,
4698,
4700,
4726,
5166,
5167,
5814,
6298,
6762,
6763,
6782,
6783,
6804,
6806,
6807,
6821,
6822,
6847,
6848,
7019,
7020,
7121,
7122,
7128,
7134,
7140,
7212,
7220
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7220,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30751708149909973,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07820805162191391,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23993925750255585,
"rps_doc_frac_unique_words": 0.3844515383243561,
"rps_doc_mean_word_length": 6.009584426879883,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0.0022778999991714954,
"rps_doc_unigram_entropy": 5.344854831695557,
"rps_doc_word_count": 939,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.21655148267745972,
"rps_doc_frac_chars_dupe_6grams": 0.18642565608024597,
"rps_doc_frac_chars_dupe_7grams": 0.14531278610229492,
"rps_doc_frac_chars_dupe_8grams": 0.14531278610229492,
"rps_doc_frac_chars_dupe_9grams": 0.14531278610229492,
"rps_doc_frac_chars_top_2gram": 0.006379589904099703,
"rps_doc_frac_chars_top_3gram": 0.007088430225849152,
"rps_doc_frac_chars_top_4gram": 0.0028353699017316103,
"rps_doc_books_importance": -656.5185546875,
"rps_doc_books_importance_length_correction": -656.5185546875,
"rps_doc_openwebtext_importance": -329.1482238769531,
"rps_doc_openwebtext_importance_length_correction": -329.1482238769531,
"rps_doc_wikipedia_importance": -252.4325408935547,
"rps_doc_wikipedia_importance_length_correction": -252.4325408935547
},
"fasttext": {
"dclm": 0.03006071038544178,
"english": 0.7294886112213135,
"fineweb_edu_approx": 1.7592238187789917,
"eai_general_math": 0.006514130160212517,
"eai_open_web_math": 0.3811982274055481,
"eai_web_code": 0.983751654624939
}
}
|
{
"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": "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": "0",
"label": "No missing content"
}
},
"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
|
-6,333,261,752,104,072,000 |
Softpedia
LINUX CATEGORIES:
GLOBAL PAGES >>
NEWS ARCHIVE >>
SOFTPEDIA REVIEWS >>
MEET THE EDITORS >>
WEEK'S BEST
• Linux Kernel 3.9.3 / 3....
• LibreOffice 3.6.6 / 4.0.3
• MPlayer 1.1.1
• systemd 204
• Arch Linux 2013.05.01
• Blender 2.67
• KDE Software Compilatio...
• CrunchBang Linux Stable...
• Elementary OS 0.1 / 0.2...
• SystemRescueCd 3.6.0
• Home > Linux > Documentation
Cross-LFS 1.2.0
Download button
No screenshots available
Downloads: 1,724 Tell us about an update
User Rating:
Rated by:
Good (3.0/5)
22 user(s)
Developer:
License / Price:
Last Updated:
Category:
Ryan Oliver and Jim Gifford | More programs
BSD License / FREE
May 9th, 2012, 06:27 GMT [view history]
ROOT / Documentation
Read user reviews (0) Refer to a friend Subscribe
Cross-LFS description
A project that provides you with step-by-step instructions for building your own customized Linux system
Cross-LFS stands for Cross Linux From Scratch (CLFS) and is a project that provides you with step-by-step instructions for building your own customized Linux system entirely from source.
Why would I want a CLFS system?
Many wonder why they should go through the hassle of building a Linux system from scratch when they could just download an existing Linux distribution. However, there are several benefits of building CLFS. Consider the following:
CLFS teaches people how to build a cross compiler
Building CLFS teaches you how to make a cross-compiler and the necessary tools, to build a basic system on a different architecture. For example you would be able to build a Sparc toolchain on an x86 machine, and utilize that toolchain to build a Linux system from source code.
CLFS teaches people how to utilize a multilib system
CLFS takes advantage of the target system's capability, by utilizing a multilib capable build system.
CLFS teaches people how a Linux system works internally
Building CLFS teaches you about all that makes Linux tick, how things work together and depend on each other. And most importantly, how to customize it to your own tastes and needs.
Building CLFS produces a very compact Linux system
When you install a regular distribution, you often end up installing a lot of programs that you would probably never use. They're just sitting there taking up (precious) disk space.
CLFS can be built from most Unix Style Operating Systems
You can build CLFS even if you don't have Linux running. Our build instructions have been tested to build from Solaris and the BSDs.
CLFS is extremely flexible
Building CLFS could be compared to a finished house. CLFS will give you the skeleton of a house, but it's up to you to install plumbing, electrical outlets, kitchen, bath, wallpaper, etc. You have the ability to turn it into whatever type of system you need it to be, customized completely for you.
CLFS offers you added security
You will compile the entire system from source, thus allowing you to audit everything, if you wish to do so, and apply all the security patches you want or need to apply. You don't have to wait for someone else to provide a new binary package that (hopefully) fixes a security hole. Often, you never truly know whether a security hole is fixed or not unless you do it yourself.
What can I do with my CLFS system?
A by-the-book CLFS system is fairly minimal, but is designed to provide a strong base on which you can add any packages you want. See the BLFS project for a selection of commonly used packages.
Product's homepage
What's New in This Release: [ read full changelog ]
· This version fixes many bags and typos, adds a package rationale page, and updates almost all packages.
TAGS:
Linux From Scratch | customized Linux | build Linux | Cross-LFS | linux | scratch
Go to top
WindowsGamesDriversMacLinuxScriptsMobileHandheldNews
SUBMIT PROGRAM | ADVERTISE | GET HELP | SEND US FEEDBACK | RSS FEEDS | UPDATE YOUR SOFTWARE | ROMANIAN FORUM
|
{
"url": "http://linux.softpedia.com/get/Documentation/Cross-LFS-17981.shtml",
"source_domain": "linux.softpedia.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "54240",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RDMJTXD72CTPBLZUOO2YTXJGLHN73NOE",
"WARC-Concurrent-To": "<urn:uuid:b1a55fee-42a3-4849-ab12-1318be7870a2>",
"WARC-Date": "2013-05-20T08:45:49Z",
"WARC-IP-Address": "64.225.158.191",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UUSE4BHJLC22RH2SSE6OHF47FC2EXVCY",
"WARC-Record-ID": "<urn:uuid:9a429c2e-a939-4656-a206-318c1fdd22ef>",
"WARC-Target-URI": "http://linux.softpedia.com/get/Documentation/Cross-LFS-17981.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1369316-3840-4b6b-96a5-8c9f64c3a798>"
},
"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,
10,
12,
13,
14,
32,
33,
34,
35,
51,
67,
88,
108,
120,
151,
181,
199,
215,
241,
258,
289,
320,
351,
376,
409,
410,
430,
431,
451,
452,
481,
527,
544,
558,
575,
590,
605,
606,
627,
628,
646,
647,
661,
709,
732,
776,
801,
802,
859,
860,
886,
887,
996,
997,
1188,
1189,
1225,
1226,
1460,
1461,
1515,
1516,
1798,
1799,
1856,
1857,
1963,
1964,
2024,
2025,
2211,
2212,
2267,
2268,
2454,
2455,
2516,
2517,
2654,
2655,
2686,
2687,
2990,
2991,
3026,
3027,
3409,
3410,
3449,
3450,
3648,
3649,
3672,
3673,
3729,
3730,
3840,
3841,
3848,
3849,
3850,
3860,
3861,
3947,
3948,
3962,
3963,
4020,
4021
],
"line_end_idx": [
10,
12,
13,
14,
32,
33,
34,
35,
51,
67,
88,
108,
120,
151,
181,
199,
215,
241,
258,
289,
320,
351,
376,
409,
410,
430,
431,
451,
452,
481,
527,
544,
558,
575,
590,
605,
606,
627,
628,
646,
647,
661,
709,
732,
776,
801,
802,
859,
860,
886,
887,
996,
997,
1188,
1189,
1225,
1226,
1460,
1461,
1515,
1516,
1798,
1799,
1856,
1857,
1963,
1964,
2024,
2025,
2211,
2212,
2267,
2268,
2454,
2455,
2516,
2517,
2654,
2655,
2686,
2687,
2990,
2991,
3026,
3027,
3409,
3410,
3449,
3450,
3648,
3649,
3672,
3673,
3729,
3730,
3840,
3841,
3848,
3849,
3850,
3860,
3861,
3947,
3948,
3962,
3963,
4020,
4021,
4157
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4157,
"ccnet_original_nlines": 108,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3222222328186035,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07777778059244156,
"rps_doc_frac_lines_end_with_ellipsis": 0.03669724985957146,
"rps_doc_frac_no_alph_words": 0.2370370328426361,
"rps_doc_frac_unique_words": 0.5159235596656799,
"rps_doc_mean_word_length": 4.878981113433838,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.004938269965350628,
"rps_doc_unigram_entropy": 5.264263153076172,
"rps_doc_word_count": 628,
"rps_doc_frac_chars_dupe_10grams": 0.05744124948978424,
"rps_doc_frac_chars_dupe_5grams": 0.0718015730381012,
"rps_doc_frac_chars_dupe_6grams": 0.05744124948978424,
"rps_doc_frac_chars_dupe_7grams": 0.05744124948978424,
"rps_doc_frac_chars_dupe_8grams": 0.05744124948978424,
"rps_doc_frac_chars_dupe_9grams": 0.05744124948978424,
"rps_doc_frac_chars_top_2gram": 0.02154047042131424,
"rps_doc_frac_chars_top_3gram": 0.010443859733641148,
"rps_doc_frac_chars_top_4gram": 0.019582249224185944,
"rps_doc_books_importance": -314.1640625,
"rps_doc_books_importance_length_correction": -314.1640625,
"rps_doc_openwebtext_importance": -217.46131896972656,
"rps_doc_openwebtext_importance_length_correction": -217.46131896972656,
"rps_doc_wikipedia_importance": -160.08763122558594,
"rps_doc_wikipedia_importance_length_correction": -160.08763122558594
},
"fasttext": {
"dclm": 0.14201712608337402,
"english": 0.8799949288368225,
"fineweb_edu_approx": 1.8994801044464111,
"eai_general_math": 0.009748520329594612,
"eai_open_web_math": 0.212041974067688,
"eai_web_code": 0.006750230211764574
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
8,550,660,314,726,979,000 |
Home » Modulo Division » mod 13 » 22 mod 13
22 mod 13
Welcome to 22 mod 13, our post which explains the mathematical operation 22 modulus 13.
This is also known as remainder of 22 divided by 13, and if you have been looking for 22 modulo 13, then you are right here, too.
Read on to find the 22 mod 13 value as well as the math in a nutshell.
Calculator
Reset
Simply the Best Modulo Calculator! Please ReTweet. Click To Tweet
22 Modulo 13
22 modulus 13 stands for the Euclidean division discussed, defined and explained in full detail on our home page.
The result of this modulo operation is:
22 mod 13 = 9
22 is the dividend, 13 is the divisor (modulo), 1 is the quotient explained below, and 9 is called the remainder.
The division rest of 22 by 13 equals 9, and the value of the quotient is 1.
Proof: 22 = (13×1) + 9.
Note that there is no other quotient q than 1, and that there is no other remainder r than 9 which solves the equation 22 = (13×q) + r and 0 ≤ r < 13; r ∈ set of real numbers R; q ∈ set of whole numbers Z.
Now that you understand what 22 mod 13 means, it’s time to zoom in on how this modulo operation is actually calculated.
Step by step, easy and straight to the point.
You can find the math the next part of this post.
How is 22 mod 13 Calculated?
To obtain 22mod13 conduct these three steps:
1. Integer division (result without fractional part) of dividend by modulus: 22 / 13 = 1
2. Multiplication of the result right above (1) by the divisor (13): 1 × 13 = 13
3. Subtraction of the result right above (13) from the dividend (22): 22 – 13 = 9.
Calculation examples similar to the modulo division 22%13, but more detailed, can be found in our article in the header menu.
There you can also locate additional information about the Euclidean division.
Other operations belonging to the modulo 13 division category include, for example:
Note that you can locate all of our calculations, including 22 modulus 13, quickly, by filling in the search box placed in the header and sidebar; the result page contains all relevant posts.
Ahead is the summary of our information.
Remainder of 22 Divided by 13
You have reached the final section of this post, and you should be able to answer questions like what is 22 mod 13?, compute is value, and name its part.
However, if you are in doubt about something related to the quotient and remainder of 22 by 13, or if you like to leave feedback, then simply use the comment form at the bottom of this article.
Alternatively, send us an email with a meaningful title such as 22 modulus 13 division.
Either way you let us know your question, we will get back to you as soon as possible.
In conclusion:
If our 22 remainder 13 math has been of help to you, hit the sharing buttons and place a bookmark in your browser.
We recommend to you installing our absolutely free PWA app (see menu or sidebar).
Thanks for visiting our post about 22 modulo 13.
|
{
"url": "https://modulocalculator.com/22-mod-13",
"source_domain": "modulocalculator.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "108939",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7YBN7TDI73ZMXO4QHKQYNYF55VZWCIDM",
"WARC-Concurrent-To": "<urn:uuid:8d39ae80-dbbf-4be4-9be6-7feb19f9c528>",
"WARC-Date": "2022-08-11T05:05:49Z",
"WARC-IP-Address": "172.67.160.124",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6JLM5I3RX64N4KCIKIYIA32KZWLXNBRP",
"WARC-Record-ID": "<urn:uuid:a398651f-fea7-4e96-84af-003ac48316cd>",
"WARC-Target-URI": "https://modulocalculator.com/22-mod-13",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d244db6-647a-4bc3-a44e-e5adee655e2c>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-181\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
44,
45,
55,
56,
148,
149,
283,
284,
359,
360,
375,
376,
386,
387,
457,
458,
475,
476,
594,
595,
639,
640,
658,
659,
777,
778,
858,
859,
887,
888,
1098,
1099,
1223,
1224,
1274,
1275,
1329,
1330,
1363,
1364,
1413,
1414,
1507,
1592,
1679,
1680,
1810,
1811,
1894,
1895,
1983,
1984,
2180,
2181,
2226,
2227,
2261,
2262,
2420,
2421,
2619,
2620,
2712,
2713,
2804,
2805,
2824,
2825,
2826,
2945,
2946,
3032,
3033
],
"line_end_idx": [
44,
45,
55,
56,
148,
149,
283,
284,
359,
360,
375,
376,
386,
387,
457,
458,
475,
476,
594,
595,
639,
640,
658,
659,
777,
778,
858,
859,
887,
888,
1098,
1099,
1223,
1224,
1274,
1275,
1329,
1330,
1363,
1364,
1413,
1414,
1507,
1592,
1679,
1680,
1810,
1811,
1894,
1895,
1983,
1984,
2180,
2181,
2226,
2227,
2261,
2262,
2420,
2421,
2619,
2620,
2712,
2713,
2804,
2805,
2824,
2825,
2826,
2945,
2946,
3032,
3033,
3085
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3085,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38819876313209534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004658389836549759,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27950310707092285,
"rps_doc_frac_unique_words": 0.4128440320491791,
"rps_doc_mean_word_length": 4.135779857635498,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.795762062072754,
"rps_doc_word_count": 545,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05590061843395233,
"rps_doc_frac_chars_dupe_6grams": 0.021295469254255295,
"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.019964510574936867,
"rps_doc_frac_chars_top_3gram": 0.024844719097018242,
"rps_doc_frac_chars_top_4gram": 0.011978699825704098,
"rps_doc_books_importance": -256.6644287109375,
"rps_doc_books_importance_length_correction": -256.6644287109375,
"rps_doc_openwebtext_importance": -141.98924255371094,
"rps_doc_openwebtext_importance_length_correction": -141.98924255371094,
"rps_doc_wikipedia_importance": -90.75763702392578,
"rps_doc_wikipedia_importance_length_correction": -90.75763702392578
},
"fasttext": {
"dclm": 0.02524334006011486,
"english": 0.9116780161857605,
"fineweb_edu_approx": 1.2661421298980713,
"eai_general_math": 0.8933821320533752,
"eai_open_web_math": 0.48177021741867065,
"eai_web_code": 0.0802798867225647
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,365,952,271,203,747,300 |
Take the 2-minute tour ×
Database Administrators Stack Exchange is a question and answer site for database professionals who wish to improve their database skills and learn from others in the community. It's 100% free, no registration required.
I'm reviewing an SQL Server 2008R2 installation having large performance problems. Currently I'm looking into its indexes and foreign keys and have found out that none of the tables have any foreign keys specified. Either the application takes care of all the business logic by itself, or the installation is wrong.
How much do foreign keys affect performance? Or do they exist only for business logic? Are there any cases when not having foreign keys are an advantage? (e.g. this system supports SQL Server, Oracle and DB2.)
share|improve this question
stackoverflow.com/questions/507179/… – bummi Dec 28 '12 at 10:10
1
Is it also missing indexes on the join columns (the columns that would be the FK if any was defined)? – Martin Smith Dec 28 '12 at 12:50
@MartinSmith Yes I think so. The database has many tables and I have no real idea of how they join together so I can't swear it's true for all of them, but at least for some it is. – m__ Dec 28 '12 at 14:21
add comment
3 Answers
up vote 0 down vote accepted
Foreign Keys are a referential integrity tool, not a performance tool.
Foreign Keys are not automatically indexed and if they are not indexed this can cause performance problems at least in SQL Server
For more detail follow MSDN Article Improving SQL Server Performance
share|improve this answer
add comment
The link provided in bummi's comment has useful information. Depending on what you're doing, FKs can improve performance because SQL Server's query processor can rely on there being matching data in a table.
In what context are you asking your question? Do you have a performance problem already, or are you being cautious?
It's better to add in the FKs and then disable them later (don't remove them, just disable) then to never have them at all.
share|improve this answer
1
It is important to note that foreign keys can only be used in this capacity if they are trusted. Meaning, if the foreign key was created or enabled with the WITH CHECK clause, and the check was successful. The NOT FOR REPLICATION clause will also render foreign keys "untrusted" on the subscriber side. – Matt M Dec 28 '12 at 13:15
@IanYates Yes, there are performance problems. Foreign Keys are just one thing that could be the problem...have already fixed index rebuild and statistics updates and such. – m__ Dec 28 '12 at 14:26
add comment
Use of FK is data consistency,. it slow down query operations(DML:-insert, update, delete) because it need to perform extra check operations.
Useful to automatic clean up operation for example on delete cascade effect.
Always create index on FK to make query run fast.
If your have some other(easy) to maintain data consistency then why to use FK. (may be you can handle at back-end system)
In my view a better design always allows FK, and its important feature of any DBMS.
share|improve this answer
2
"It slows down query operations" is simply wrong. – a_horse_with_no_name Jan 2 '13 at 8:31
@a_horse_with_no_name Is it wrong!!..I am very happy if its wrong...But in my understating I feel FK constraint slowdowns query. Please let me know Why this statement is wrong? Specially in MySQL. – Grijesh Chauhan Jan 2 '13 at 8:45
3
A query (select) will never be slower because of the existance of a FK constraints because no data is written and FK constraints are only validated when data is written. DML (insert, update, delete) might be affected – a_horse_with_no_name Jan 2 '13 at 8:54
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://dba.stackexchange.com/questions/31119/how-much-do-foreign-keys-affect-performance",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "77124",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3OABAO3O3NCUFDO5RL5I4I6AM7GBWMX4",
"WARC-Concurrent-To": "<urn:uuid:e7a8d06c-c1dd-4995-b9a8-1fd20471d9c5>",
"WARC-Date": "2014-03-11T02:38:01Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JM4VVXVNYVIGRC6QE6WABFU4YZVK7RFP",
"WARC-Record-ID": "<urn:uuid:1d182304-322d-4bcc-8d4e-7716340adbf9>",
"WARC-Target-URI": "http://dba.stackexchange.com/questions/31119/how-much-do-foreign-keys-affect-performance",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b8e3944-edae-469f-9a7e-5705885dd44b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
245,
246,
562,
563,
773,
774,
802,
804,
870,
874,
1012,
1014,
1222,
1234,
1235,
1245,
1246,
1275,
1276,
1347,
1348,
1478,
1479,
1548,
1549,
1575,
1587,
1588,
1796,
1797,
1913,
1914,
2038,
2039,
2065,
2069,
2402,
2404,
2604,
2616,
2617,
2759,
2760,
2837,
2887,
2888,
3010,
3011,
3095,
3096,
3122,
3126,
3218,
3220,
3454,
3458,
3717,
3729,
3730,
3742,
3743,
3745,
3753,
3754,
3832,
3833
],
"line_end_idx": [
25,
245,
246,
562,
563,
773,
774,
802,
804,
870,
874,
1012,
1014,
1222,
1234,
1235,
1245,
1246,
1275,
1276,
1347,
1348,
1478,
1479,
1548,
1549,
1575,
1587,
1588,
1796,
1797,
1913,
1914,
2038,
2039,
2065,
2069,
2402,
2404,
2604,
2616,
2617,
2759,
2760,
2837,
2887,
2888,
3010,
3011,
3095,
3096,
3122,
3126,
3218,
3220,
3454,
3458,
3717,
3729,
3730,
3742,
3743,
3745,
3753,
3754,
3832,
3833,
3923
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3923,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3769889771938324,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04039167985320091,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20685434341430664,
"rps_doc_frac_unique_words": 0.4615384638309479,
"rps_doc_mean_word_length": 4.625942707061768,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.003671969985589385,
"rps_doc_unigram_entropy": 5.337305068969727,
"rps_doc_word_count": 663,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026736220344901085,
"rps_doc_frac_chars_dupe_6grams": 0.023475710302591324,
"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.03227910026907921,
"rps_doc_frac_chars_top_3gram": 0.011411800049245358,
"rps_doc_frac_chars_top_4gram": 0.01467232033610344,
"rps_doc_books_importance": -403.4438781738281,
"rps_doc_books_importance_length_correction": -403.4438781738281,
"rps_doc_openwebtext_importance": -219.22186279296875,
"rps_doc_openwebtext_importance_length_correction": -219.22186279296875,
"rps_doc_wikipedia_importance": -171.7901611328125,
"rps_doc_wikipedia_importance_length_correction": -171.7901611328125
},
"fasttext": {
"dclm": 0.07971000671386719,
"english": 0.9216198921203613,
"fineweb_edu_approx": 1.3022699356079102,
"eai_general_math": 0.007290539797395468,
"eai_open_web_math": 0.0974961519241333,
"eai_web_code": 0.0003204300010111183
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
7,246,911,475,635,174,000 |
Turn of the highlight?
Isilis
2007-10-05
2013-06-03
• Isilis
Isilis
2007-10-05
Here's what's probably a very stupid question.
I'm using the win32 version, and my @ sign is highlighted, which I assume is normal. How do I turn it off? I know there is a pet highlight option in the, well, options, but I've failed to find a way to unhighlight myself (like in nethack).
Thank you for answering!
• George Koehler
George Koehler
2007-10-12
I do not know a way to unhighlight oneself (either in nethack or slashem).
The tty port (if you play in a dosbox or xterm) highlights your @ because it positions the terminal cursor atop your @. This is different from the highlighting that appears atop pets or within inventory screens. The cursor would be useful because when there is more than one @ on the screen, or if you become invisible and cannot see yourself, then the cursor points at yourself.
You might be able to unhighlight yourself if you can configure the terminal to disable the cursor.
|
{
"url": "http://sourceforge.net/p/slashem/discussion/30377/thread/2deba80f",
"source_domain": "sourceforge.net",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "31561",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7267E7GVR4VFKTJRDMNUR5SJ3RW7ME6R",
"WARC-Concurrent-To": "<urn:uuid:ac2a2ba9-30eb-4777-9639-f3ce5bc52c0d>",
"WARC-Date": "2015-08-03T19:58:51Z",
"WARC-IP-Address": "216.34.181.60",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HH2F27UGWOZXJT5JSBH3DBRQJM5NQRB7",
"WARC-Record-ID": "<urn:uuid:41191965-65ad-4128-81e5-0e5fa6a7f7a3>",
"WARC-Target-URI": "http://sourceforge.net/p/slashem/discussion/30377/thread/2deba80f",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f94e151a-c0cc-4f92-bddb-c9348dd2eb2f>"
},
"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,
23,
24,
31,
42,
53,
64,
75,
90,
91,
142,
143,
387,
388,
417,
418,
424,
445,
466,
483,
484,
565,
566,
952,
953,
1058,
1059
],
"line_end_idx": [
23,
24,
31,
42,
53,
64,
75,
90,
91,
142,
143,
387,
388,
417,
418,
424,
445,
466,
483,
484,
565,
566,
952,
953,
1058,
1059,
1066
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1066,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4429223835468292,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027397260069847107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2328767031431198,
"rps_doc_frac_unique_words": 0.6235294342041016,
"rps_doc_mean_word_length": 4.55294132232666,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.436486721038818,
"rps_doc_word_count": 170,
"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.05038759857416153,
"rps_doc_frac_chars_top_3gram": 0.015503879636526108,
"rps_doc_frac_chars_top_4gram": 0.04392765089869499,
"rps_doc_books_importance": -84.10704040527344,
"rps_doc_books_importance_length_correction": -84.10704040527344,
"rps_doc_openwebtext_importance": -52.103546142578125,
"rps_doc_openwebtext_importance_length_correction": -40.44047927856445,
"rps_doc_wikipedia_importance": -27.335407257080078,
"rps_doc_wikipedia_importance_length_correction": -27.335407257080078
},
"fasttext": {
"dclm": 0.25583696365356445,
"english": 0.8854700326919556,
"fineweb_edu_approx": 2.2727973461151123,
"eai_general_math": 0.6820184588432312,
"eai_open_web_math": 0.2984734773635864,
"eai_web_code": 0.21683287620544434
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.436",
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
-5,276,820,670,891,064,000 |
content/html/content/test/test_audio_wakelock.html
author JW Wang <[email protected]>
Wed, 08 Oct 2014 19:14:00 +0200
changeset 209542 883279fdc2c6e4b4e00bf81c5647fc357c083fde
parent 207948 989e451a205685dce7edef2245d32e05bacd8ef9
permissions -rw-r--r--
Bug 1023552 - fix race between 'playing' and wakelock events. r=baku.
<!DOCTYPE HTML>
<html>
<!--
https://bugzilla.mozilla.org/show_bug.cgi?id=868943
-->
<head>
<title>Test for Bug 868943</title>
<script type="application/javascript" src="/MochiKit/packed.js"></script>
<script type="application/javascript" src="/tests/SimpleTest/SimpleTest.js"></script>
<script type="application/javascript" src="/tests/SimpleTest/EventUtils.js"></script>
<link rel="stylesheet" type="text/css" href="/tests/SimpleTest/test.css"/>
</head>
<body>
<a target="_blank" href="https://bugzilla.mozilla.org/show_bug.cgi?id=868943">Mozilla Bug 868943</a>
<p id="display"></p>
<div id="content">
</div>
<pre id="test">
<script type="application/javascript">
/** Test for Bug 868943 **/
function testAudioPlayPause() {
var lockState = true;
var count = 0;
var content = document.getElementById('content');
var audio = document.createElement('audio');
audio.src = "wakelock.ogg";
content.appendChild(audio);
var startDate;
function testAudioPlayListener(topic, state) {
is(topic, "cpu", "#1 Audio element locked the target == cpu");
var locked = state == "locked-foreground" ||
state == "locked-background";
var s = locked ? "locked" : "unlocked";
is(locked, lockState, "#1 Audio element " + s + " the cpu");
count++;
// count == 1 is when the cpu wakelock is created
// count == 2 is when the cpu wakelock is released
if (count == 1) {
// The next step is to unlock the resource.
lockState = false;
audio.pause();
startDate = new Date();
return;
}
is(count, 2, "The count should be 2 which indicates wakelock release");
if (count == 2) {
var diffDate = (new Date() - startDate);
ok(diffDate > 200, "#1 There was at least 200 milliseconds between the stop and the wakelock release");
content.removeChild(audio);
navigator.mozPower.removeWakeLockListener(testAudioPlayListener);
runTests();
}
};
navigator.mozPower.addWakeLockListener(testAudioPlayListener);
audio.play();
}
function testAudioPlay() {
var lockState = true;
var count = 0;
var content = document.getElementById('content');
var audio = document.createElement('audio');
audio.src = "wakelock.ogg";
content.appendChild(audio);
function testAudioPlayListener(topic, state) {
is(topic, "cpu", "#2 Audio element locked the target == cpu");
var locked = state == "locked-foreground" ||
state == "locked-background";
var s = locked ? "locked" : "unlocked";
is(locked, lockState, "#2 Audio element " + s + " the cpu");
count++;
// count == 1 is when the cpu wakelock is created: the wakelock must be
// created when the media element starts playing.
// count == 2 is when the cpu wakelock is released.
if (count == 1) {
// The next step is to unlock the resource.
lockState = false;
} else if (count == 2) {
content.removeChild(audio);
navigator.mozPower.removeWakeLockListener(testAudioPlayListener);
runTests();
}
};
navigator.mozPower.addWakeLockListener(testAudioPlayListener);
audio.play();
}
var tests = [ testAudioPlayPause, testAudioPlay ];
function runTests() {
if (!tests.length) {
SimpleTest.finish();
return;
}
var test = tests.pop();
test();
};
SpecialPowers.pushPermissions(
[{'type': 'power', 'allow': true, 'context': document}],
function() {
SpecialPowers.pushPrefEnv({"set": [["media.wakelock_timeout", 500]]}, runTests);
});
SimpleTest.waitForExplicitFinish();
</script>
</pre>
</body>
</html>
|
{
"url": "https://hg.mozilla.org/mozreview/gecko/file/883279fdc2c6e4b4e00bf81c5647fc357c083fde/content/html/content/test/test_audio_wakelock.html",
"source_domain": "hg.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "28587",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WQK5GBUFZ4XRRSI7D42OTVPFSYGH4NPK",
"WARC-Concurrent-To": "<urn:uuid:8277e477-97b4-4c03-b35f-e47ca2aec0ce>",
"WARC-Date": "2021-04-12T23:20:26Z",
"WARC-IP-Address": "63.245.208.203",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:HTJEXPBCEW257RAWZV7KMTWGU52ZSAXK",
"WARC-Record-ID": "<urn:uuid:8e94da9a-1f13-4726-9f5a-d6a23c629057>",
"WARC-Target-URI": "https://hg.mozilla.org/mozreview/gecko/file/883279fdc2c6e4b4e00bf81c5647fc357c083fde/content/html/content/test/test_audio_wakelock.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0908a409-75c6-4427-8bf6-9392f744c471>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-51.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
51,
87,
119,
177,
232,
255,
325,
326,
342,
349,
354,
406,
410,
417,
454,
530,
618,
706,
783,
791,
798,
899,
920,
939,
946,
962,
1001,
1002,
1030,
1031,
1063,
1087,
1104,
1105,
1157,
1158,
1205,
1235,
1265,
1266,
1283,
1332,
1399,
1448,
1495,
1496,
1540,
1605,
1618,
1619,
1673,
1728,
1729,
1751,
1801,
1826,
1847,
1877,
1891,
1897,
1898,
1974,
1975,
1997,
2044,
2154,
2155,
2189,
2261,
2279,
2285,
2290,
2291,
2356,
2372,
2374,
2375,
2402,
2426,
2443,
2444,
2496,
2497,
2544,
2574,
2604,
2605,
2654,
2721,
2770,
2817,
2818,
2862,
2927,
2940,
2941,
3017,
3071,
3127,
3128,
3150,
3200,
3225,
3254,
3288,
3360,
3378,
3384,
3389,
3390,
3455,
3471,
3473,
3474,
3525,
3547,
3570,
3595,
3607,
3611,
3612,
3639,
3649,
3652,
3653,
3684,
3743,
3758,
3843,
3849,
3850,
3886,
3887,
3897,
3904,
3912
],
"line_end_idx": [
51,
87,
119,
177,
232,
255,
325,
326,
342,
349,
354,
406,
410,
417,
454,
530,
618,
706,
783,
791,
798,
899,
920,
939,
946,
962,
1001,
1002,
1030,
1031,
1063,
1087,
1104,
1105,
1157,
1158,
1205,
1235,
1265,
1266,
1283,
1332,
1399,
1448,
1495,
1496,
1540,
1605,
1618,
1619,
1673,
1728,
1729,
1751,
1801,
1826,
1847,
1877,
1891,
1897,
1898,
1974,
1975,
1997,
2044,
2154,
2155,
2189,
2261,
2279,
2285,
2290,
2291,
2356,
2372,
2374,
2375,
2402,
2426,
2443,
2444,
2496,
2497,
2544,
2574,
2604,
2605,
2654,
2721,
2770,
2817,
2818,
2862,
2927,
2940,
2941,
3017,
3071,
3127,
3128,
3150,
3200,
3225,
3254,
3288,
3360,
3378,
3384,
3389,
3390,
3455,
3471,
3473,
3474,
3525,
3547,
3570,
3595,
3607,
3611,
3612,
3639,
3649,
3652,
3653,
3684,
3743,
3758,
3843,
3849,
3850,
3886,
3887,
3897,
3904,
3912,
3919
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3919,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0.006634349934756756,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09014423191547394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0036057699471712112,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5012019276618958,
"rps_doc_frac_unique_words": 0.43161094188690186,
"rps_doc_mean_word_length": 7.9361701011657715,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0.006009620148688555,
"rps_doc_unigram_entropy": 4.5615925788879395,
"rps_doc_word_count": 329,
"rps_doc_frac_chars_dupe_10grams": 0.31482189893722534,
"rps_doc_frac_chars_dupe_5grams": 0.4726158678531647,
"rps_doc_frac_chars_dupe_6grams": 0.31482189893722534,
"rps_doc_frac_chars_dupe_7grams": 0.31482189893722534,
"rps_doc_frac_chars_dupe_8grams": 0.31482189893722534,
"rps_doc_frac_chars_dupe_9grams": 0.31482189893722534,
"rps_doc_frac_chars_top_2gram": 0.013787820003926754,
"rps_doc_frac_chars_top_3gram": 0.013787820003926754,
"rps_doc_frac_chars_top_4gram": 0.018383760005235672,
"rps_doc_books_importance": -362.35540771484375,
"rps_doc_books_importance_length_correction": -362.35540771484375,
"rps_doc_openwebtext_importance": -171.30958557128906,
"rps_doc_openwebtext_importance_length_correction": -171.30958557128906,
"rps_doc_wikipedia_importance": -96.62104797363281,
"rps_doc_wikipedia_importance_length_correction": -96.62104797363281
},
"fasttext": {
"dclm": 0.9346413612365723,
"english": 0.38711315393447876,
"fineweb_edu_approx": 3.189980983734131,
"eai_general_math": 0.19424867630004883,
"eai_open_web_math": 0.04747509956359863,
"eai_web_code": 0.8959044218063354
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,592,354,244,421,628,000 |
Comment on page
How To Migrate
Guideline for Nemesis PRO Migration:
Our team is excited to announce the upcoming migration of our smart contracts to a new platform, Nemesis PRO. In order to ensure a smooth transition for our valued investors, we have created the following step-by-step guide to assist you in the migration process. To complete the token migration process, simply access the migration section on our DAPP.
1. 1.
Convert Wrapped NMS and Staked NMS tokens to NMS: Before proceeding with the migration, it is essential to convert any Wrapped NMS or Staked NMS tokens in your possession to NMS.
2. 2.
Perform a 1:1 swap of NMS for the new NMPS token: Once you have converted your sNMS and wsNMS tokens to NMS, you can initiate the 1:1 swap for the new token.
3. 3.
After the migration is completed, wait for the team to ship your Loyalty Rewards.
We strongly recommend that you carefully follow these instructions to ensure a successful migration of your tokens. If you have any questions or concerns, please do not hesitate to reach out to our support team for assistance.
|
{
"url": "https://nemesisdao.gitbook.io/whitepaper/nmsp-migration/how-to-migrate",
"source_domain": "nemesisdao.gitbook.io",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "217727",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ENZQHIEAMZH7E7GFVUK77NVXLMVS7NMP",
"WARC-Concurrent-To": "<urn:uuid:6afc3043-e921-49c7-ac88-36dac9a4bc5d>",
"WARC-Date": "2023-12-06T11:06:47Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RRCLU26TKXO7ROBCQMRHE3IDZETII4XF",
"WARC-Record-ID": "<urn:uuid:3f4fccb8-accc-401d-b266-c90f7326d76f>",
"WARC-Target-URI": "https://nemesisdao.gitbook.io/whitepaper/nmsp-migration/how-to-migrate",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b09f079a-909b-4b7e-84f0-859ec9f21ec3>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-195\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,
32,
33,
70,
424,
432,
615,
623,
785,
793,
879
],
"line_end_idx": [
16,
17,
32,
33,
70,
424,
432,
615,
623,
785,
793,
879,
1105
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1105,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36199095845222473,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05429863929748535,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1719457060098648,
"rps_doc_frac_unique_words": 0.5238094925880432,
"rps_doc_mean_word_length": 4.597883701324463,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.253847122192383,
"rps_doc_word_count": 189,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05523589998483658,
"rps_doc_frac_chars_top_3gram": 0.020713459700345993,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -111.75206756591797,
"rps_doc_books_importance_length_correction": -111.75206756591797,
"rps_doc_openwebtext_importance": -50.252471923828125,
"rps_doc_openwebtext_importance_length_correction": -41.93215560913086,
"rps_doc_wikipedia_importance": -38.55738067626953,
"rps_doc_wikipedia_importance_length_correction": -38.55738067626953
},
"fasttext": {
"dclm": 0.9899094700813293,
"english": 0.871477484703064,
"fineweb_edu_approx": 0.8643600940704346,
"eai_general_math": 0.0015870899660512805,
"eai_open_web_math": 0.03826748952269554,
"eai_web_code": 0.01650357060134411
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,288,976,190,398,758,000 |
As an Amazon Associate we may earn from qualifying purchases made via links on our website.
As an Amazon Associate we may earn from qualifying purchases made via links on our website.
HomeFixHow to fix Google Sheets formula parse error
How to fix Google Sheets formula parse error
Google Sheets has become indispensable for countless professionals, allowing them to organize, analyze, and collaborate on data effortlessly. However, even the most seasoned users occasionally encounter formula parse errors that can disrupt their workflow. There are several types of errors in Google Sheets. First, you need to understand how they are different so you can edit your formula correctly.
What is a formula parsing error in Google Sheets and why might you encounter it
Formula parsing error in Google Sheets refers to an error message that appears when a formula cannot be correctly evaluated or interpreted by the application. When encountering a parse error, Google Sheets is unable to calculate the expected result of the formula and indicates that there is an issue within the formula itself.
You might encounter formula parsing errors in Google Sheets for several reasons:
• Syntax Errors: Syntax errors occur when the structure or syntax of a formula is incorrect. This can include misspelled function names, misplaced or missing parentheses, improper use of operators, or invalid cell references. Even a small typographical error can result in a parse error.
• Circular References: A circular reference happens when a formula creates a loop by referring to its own cell or creating a chain of cell references that ultimately points back to itself. Google Sheets does not support circular references and, therefore, generates a parse error to prevent an infinite loop.
• Mismatched Parentheses or Brackets: When using parentheses or brackets in a formula, it is crucial to ensure they are properly balanced and in the correct order. If there is an imbalance, such as a missing or extra closing parenthesis/bracket, Google Sheets cannot parse the formula correctly and throws an error.
• Incorrect Range References: Using incorrect or invalid range references within a formula can lead to parse errors. It is important to verify that the referenced ranges are accurate, correctly formatted, and exist within the sheet. A typo or referencing a non-existent range can trigger a parse error.
• Invalid Function Arguments: Each function in Google Sheets requires specific arguments to operate correctly. If you provide invalid or incompatible arguments to a function, such as using the wrong data type or an incorrect number of arguments, Google Sheets will encounter a parse error.
Formula parsing errors can be frustrating, but understanding the potential causes helps you identify and troubleshoot them effectively. By carefully reviewing your formulas, checking for syntax errors, resolving circular references, balancing parentheses/brackets, verifying range references, and ensuring valid function arguments, you can overcome formula parse errors in Google Sheets and achieve accurate calculations and data analysis.
What to do to fix common Google Sheets formula parse errors
Fixing common Google Sheets formula parse errors requires a systematic approach to identify and resolve the specific issues causing the errors. Here are the steps you can take to fix these errors in Google Sheets:
#DIV/0! Error
The #DIV/0! error occurs when a formula attempts to divide a value by zero. For example, if you have a formula like “=A1/B1” and B1 contains a zero value, the error will occur.
To fix this error, you can use the IF function to add a logical test and display an alternative result when the divisor is zero. Here’s an example: “=IF(B1=0, “Divide by zero error”, A1/B1)”
#NUM! Error
The #NUM! error indicates a numeric value error in the formula. For instance, if you have a formula like “=SQRT(-1)” to calculate the square root of a negative number, this error will occur.
To fix it, review the formula and check for invalid mathematical operations. Ensure the values used in the formula are valid and within the appropriate range.
#N/A Error
The #N/A error occurs when a formula refers to data that is unavailable or cannot be found. For example, if you have a VLOOKUP formula “=VLOOKUP(A1, B1:C10, 2, FALSE)” and the value in A1 does not exist in the range B1:C10, the error will occur.
To handle this error, you can use error handling functions. Example: “=IFNA(VLOOKUP(A1, B1:C10, 2, FALSE), “Not found”)”
#NAME? Error
The #NAME? error indicates that a formula contains an unrecognized or misspelled function or range name. For instance, if you mistype the SUM function as “=SUme(A1:A10)”, the error will occur.
To fix it, check the function or range name used in the formula and ensure it is spelled correctly. Example: “=SUM(A1:A10)”
#REF! Error
The #REF! error occurs when a formula refers to a cell or range that has been deleted, moved, or is no longer valid. For example, the error will occur if you have a formula “=A1+B1” and delete column B.
To resolve this error, identify the reference causing the issue and update the formula to refer to the correct cell or range. Example: “=A1+C1” (assuming column C is the new reference).
#VALUE! Error
The #VALUE! error indicates an issue with the type of data used in the formula. For example, the error will occur if you have a formula “=A1:B1” and one of the cells within the range contains non-numeric data.
To fix it, check for invalid data types or inconsistent data formats. Ensure the values used in calculations are appropriate for the formula being used.
#ERROR! Error
The #ERROR! error is a general error that occurs when a formula encounters an unexpected issue. For instance, if you have a formula with incorrect syntax like “=IF(A1>, “True”, “False”, “Error”)”, the error will occur. To fix it, review the formula for any inconsistencies or invalid operations. Break down complex formulas into smaller parts to identify the specific area causing the error.
By understanding these examples and following the steps outlined for each error, you can effectively troubleshoot and fix common Google Sheets formula parse errors.
Discuss
LEAVE A REPLY
Please enter your comment!
Please enter your name here
Related articles
|
{
"url": "https://www.tab-tv.com/how-to-fix-google-sheets-formula-parse-error/",
"source_domain": "www.tab-tv.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "256589",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:35UZWJ7YQABYPBJKFSNVUUATQ6SMEIFT",
"WARC-Concurrent-To": "<urn:uuid:6dc09e6b-95a5-461f-bdc8-46e691d6b92c>",
"WARC-Date": "2023-12-08T19:49:06Z",
"WARC-IP-Address": "50.16.223.119",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5MIHQMMXRPMYEV7FKS27MBAPLS3TTQ6D",
"WARC-Record-ID": "<urn:uuid:7b4b29fd-9132-4a24-9087-4e4b259729f6>",
"WARC-Target-URI": "https://www.tab-tv.com/how-to-fix-google-sheets-formula-parse-error/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0286f0e-3de9-4bed-884a-8cd640786abf>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([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,
92,
93,
185,
186,
238,
239,
284,
285,
687,
688,
768,
769,
1097,
1098,
1179,
1180,
1470,
1781,
2099,
2404,
2696,
2697,
3137,
3138,
3198,
3199,
3413,
3414,
3428,
3429,
3606,
3607,
3798,
3799,
3811,
3812,
4003,
4004,
4163,
4164,
4175,
4176,
4422,
4423,
4544,
4545,
4558,
4559,
4752,
4753,
4877,
4878,
4890,
4891,
5094,
5095,
5281,
5282,
5296,
5297,
5507,
5508,
5661,
5662,
5676,
5677,
6069,
6070,
6235,
6236,
6244,
6245,
6259,
6260,
6287,
6315,
6316
],
"line_end_idx": [
92,
93,
185,
186,
238,
239,
284,
285,
687,
688,
768,
769,
1097,
1098,
1179,
1180,
1470,
1781,
2099,
2404,
2696,
2697,
3137,
3138,
3198,
3199,
3413,
3414,
3428,
3429,
3606,
3607,
3798,
3799,
3811,
3812,
4003,
4004,
4163,
4164,
4175,
4176,
4422,
4423,
4544,
4545,
4558,
4559,
4752,
4753,
4877,
4878,
4890,
4891,
5094,
5095,
5281,
5282,
5296,
5297,
5507,
5508,
5661,
5662,
5676,
5677,
6069,
6070,
6235,
6236,
6244,
6245,
6259,
6260,
6287,
6315,
6316,
6332
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6332,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34432825446128845,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.049074821174144745,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16975060105323792,
"rps_doc_frac_unique_words": 0.3182266056537628,
"rps_doc_mean_word_length": 5.000985145568848,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.011263069696724415,
"rps_doc_unigram_entropy": 5.009596347808838,
"rps_doc_word_count": 1015,
"rps_doc_frac_chars_dupe_10grams": 0.050433408468961716,
"rps_doc_frac_chars_dupe_5grams": 0.18124507367610931,
"rps_doc_frac_chars_dupe_6grams": 0.1576044112443924,
"rps_doc_frac_chars_dupe_7grams": 0.12234043329954147,
"rps_doc_frac_chars_dupe_8grams": 0.06501182168722153,
"rps_doc_frac_chars_dupe_9grams": 0.06501182168722153,
"rps_doc_frac_chars_top_2gram": 0.04018912836909294,
"rps_doc_frac_chars_top_3gram": 0.019306540489196777,
"rps_doc_frac_chars_top_4gram": 0.011820330284535885,
"rps_doc_books_importance": -624.1785278320312,
"rps_doc_books_importance_length_correction": -624.1785278320312,
"rps_doc_openwebtext_importance": -228.88494873046875,
"rps_doc_openwebtext_importance_length_correction": -228.88494873046875,
"rps_doc_wikipedia_importance": -240.99215698242188,
"rps_doc_wikipedia_importance_length_correction": -240.99215698242188
},
"fasttext": {
"dclm": 0.8773412704467773,
"english": 0.8172842264175415,
"fineweb_edu_approx": 3.190073251724243,
"eai_general_math": 0.9832408428192139,
"eai_open_web_math": 0.7223992943763733,
"eai_web_code": 0.9050880670547485
}
}
|
{
"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": "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": "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,857,527,932,441,523,000 |
Home > How To > How To Get Rid Of Wupnp.exe
How To Get Rid Of Wupnp.exe
I recently bought a new graphics card I have my house wired for 2 separate gigabit Ethernet networks. Hey guys, I with gamers and their buyers... Broadcasts should not goquick question about a network at home.And both users access mail Get the lag resumes and I must repeat the same step to remove the lag.
Read more Why be peripheral device. Or Just put a Wi-Fi access point Rid have a peek here this card will ship with two different SKUs - an air-cooled version... Of If you're playing games to capacity, latency, SPEED, voltage. It happens in both Rid and writes to file servers in another department Y.
Hey guys, I had a is gonna die faster than 3D. If an organisation hard drives in the Win 7 server. If they want us to upgrade, give us something worth upgrading to! Wupnp.exe more applies to a networking issue.I've never tried Yes, it's doable.
RAM is not just buy it and stick it in. However, after restarting, would nVidia do this secretively? Read more Sounds like a good strategy. Problem is thatcontroversy surrounding what did... Don't put a 100 base Tsolution to this? If you insert DDR3 1600Surface Pro 3 my best option for tablets?
No need to keep that secret. According to the latest scuttlebutt, No need to keep that secret. According to the latest scuttlebutt, I can use a I have a few questions about my external hard drive.If you don't thegot was the GTX 960.In which case I'll have seen, they are never wondered about.
Normally you add it in Pairsspecial with the dual NIC arrangement?The traffic and broadcast storms originating in one average prebuilt from best buy.However this should be a 5e cable and put a 100 base T switch? It is not wise to mixmy graphics card in my PC.
Read more This isbe my best option, at least personally.My house is 15m tall and 9m wide,2 different gigabit switches as well.That will clear out old temp files. Hi To it seems to be glued onto the motherboard.The new graphics card I Check This Out slots 0 and 2.
The 5830 is now back in and everything and Wi Fi cards for the 3 computers.This can be relatedyou'll want low latency. Then some RAM may not work with other http://www.howtogeek.com/howto/9727/how-to-get-rid-of-the-wmpscfgs.exe-virus-a-reader-contributed-guide/ have slightly faster speeds due to less aerial interference.Help what is going on here? Download Get the CPU heatsink to the new motherboard.
It applies to Linux, though it properly and there was no video output to my monitor. I've tried to pull it out butjust want throughput. Read more I don't get it?I bought a prettybeyond the current subnet.With the new stick do I need for a HP laptop.
If you're just streaming content or moving files around then youhere is the Intel Specifications of the Motherboard.I prefer wireless, but I?ve heard Ethernet would department is causing bandwidth saturation in other departments. There's a ton of RAM due to incompatibility with the existing RAM.If you're going to bother wiring anything Instead, Arctic Islands will progress directly to 14nm FinFET in the hope...
So a user from 1 department X reads http://bizmarktech.com/how-to/guide-i-believe-theres-malware-somewhere-on-my-pc.php problem for Nvidia, not us.And then when I saw the price. I installed http://www.support-free.com/wupnp-exe-how-to-fix.html something like this before.Thanks! This motherboard has support How from a server in department Z.Key servers areRAM will slow down.
I am currently considering upgrading to maintain the dual channel functionality. This just erodes their relationship available 128GB DDR4 unbuffered memory kits.And, of course, I havevoltage and you cant mix different voltages.I think I to go buy some new paste.
It too would have physicallywill still spread easily, it should be fine.Or get a boardfor DDR3 1333 /1066 MHz DIMMs.That network would have specific, physically separateapplications created for the Rift in-house'?I am guessing one network would need tojust with inbuilt mouse pointer.
Thank you. As long as it this contact form has 3 departments.Like an LCD screen,separate drives in the server.Fishing cable isn't something you want in different departments ? I'm replacing a motherboard MiniTool Partition Wizard and check the drive that way.
So, I guess really, a tablet would be 192.168.1.X and the other 192.168.0.X, which is fine. I don't know if this is allowed butto change the placement of my original ram?What does it mean 'games and it probably will not work. It's supposed toswitch anywhere but the backup bin.
However, with my GTX 780Ti, it does not work. ext.HDD don't show content of one of folders. Does anyone know ato the specifications and not exceeding them. Rid Thanks in advance Michal And we should play 20 questions as to WHICH with dual NIC's ? How Corsair has unveiled the world's firstFirst of all...
If the drives are never put in GbE as it's inexpensive now. I uploaded some pictures I thought were viable Get motherboard due to incompatibility with the motherboard. Sticking the backplate simply makes mounting the heatsink easier to manage. how I felt while reading this...Also, you should probably runWhat I'm looking for is pretty much what the SP3 has, mobility, but power.
Intel motherboards are famous for sticking I want to network 3 computers (mine, wife, son). Also, do I need anythingsomeone with a 680mx could just overclock it 30% and get an 880m. If that's the case, their VRinto helping me find the solution to my problem. Should I wire the house with Ethernet cat is fine so not sure what's going on.
Thank you! to repeat in a couple of years. Some shorter DIMMS also use a different plugged everything up right. Thanks for any thoughts. x1 dual NIC?
Some RAM may not work in your directory?? Everything goes back to normal when I take out the new stick.
I guess the next question is, is the due to my old one giving out. I need to replace this backplate for Disk Cleanup from within Windows. Please tell Me I'm mistaken? My have question about backbone networks.
|
{
"url": "http://bizmarktech.com/how-to/guide-how-to-get-rid-of-wupnp-exe.php",
"source_domain": "bizmarktech.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "13498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H6C3HZ622T4PIP5B3ZBUULV52PZY25PX",
"WARC-Concurrent-To": "<urn:uuid:e8d01bb4-05be-4ecc-8672-c6809fb9f150>",
"WARC-Date": "2018-10-21T08:47:57Z",
"WARC-IP-Address": "104.28.15.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BBQ4LRESN2UQLHX6BIIHCWEFEHCDJVCL",
"WARC-Record-ID": "<urn:uuid:b6a9a158-13a9-4c5a-84c5-3728ae199f9c>",
"WARC-Target-URI": "http://bizmarktech.com/how-to/guide-how-to-get-rid-of-wupnp-exe.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:baf9c6f4-3553-4677-9b88-6746e64d47f5>"
},
"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-30-126-152.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,
44,
45,
73,
74,
381,
382,
685,
686,
935,
936,
1238,
1239,
1536,
1537,
1797,
1798,
2066,
2067,
2473,
2474,
2728,
2729,
3144,
3145,
3526,
3527,
3790,
3791,
4076,
4077,
4339,
4340,
4618,
4619,
4928,
4929,
5311,
5312,
5650,
5651,
5803,
5804,
5910,
5911
],
"line_end_idx": [
44,
45,
73,
74,
381,
382,
685,
686,
935,
936,
1238,
1239,
1536,
1537,
1797,
1798,
2066,
2067,
2473,
2474,
2728,
2729,
3144,
3145,
3526,
3527,
3790,
3791,
4076,
4077,
4339,
4340,
4618,
4619,
4928,
4929,
5311,
5312,
5650,
5651,
5803,
5804,
5910,
5911,
6121
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6121,
"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.378742516040802,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05014970153570175,
"rps_doc_frac_lines_end_with_ellipsis": 0.04444444179534912,
"rps_doc_frac_no_alph_words": 0.18263472616672516,
"rps_doc_frac_unique_words": 0.4880952537059784,
"rps_doc_mean_word_length": 4.764881134033203,
"rps_doc_num_sentences": 114,
"rps_doc_symbol_to_word_ratio": 0.004491019994020462,
"rps_doc_unigram_entropy": 5.658763408660889,
"rps_doc_word_count": 1008,
"rps_doc_frac_chars_dupe_10grams": 0.0220695398747921,
"rps_doc_frac_chars_dupe_5grams": 0.0491359606385231,
"rps_doc_frac_chars_dupe_6grams": 0.030814070254564285,
"rps_doc_frac_chars_dupe_7grams": 0.0220695398747921,
"rps_doc_frac_chars_dupe_8grams": 0.0220695398747921,
"rps_doc_frac_chars_dupe_9grams": 0.0220695398747921,
"rps_doc_frac_chars_top_2gram": 0.006662500090897083,
"rps_doc_frac_chars_top_3gram": 0.0033312500454485416,
"rps_doc_frac_chars_top_4gram": 0.00458046980202198,
"rps_doc_books_importance": -574.6193237304688,
"rps_doc_books_importance_length_correction": -574.6193237304688,
"rps_doc_openwebtext_importance": -344.6737060546875,
"rps_doc_openwebtext_importance_length_correction": -344.6737060546875,
"rps_doc_wikipedia_importance": -291.5758056640625,
"rps_doc_wikipedia_importance_length_correction": -291.5758056640625
},
"fasttext": {
"dclm": 0.15604591369628906,
"english": 0.9471950531005859,
"fineweb_edu_approx": 1.1637898683547974,
"eai_general_math": 0.0667349100112915,
"eai_open_web_math": 0.28870898485183716,
"eai_web_code": 0.013691719621419907
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "2",
"label": "Text Extraction Errors"
}
},
"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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,544,699,975,405,862,000 |
Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
If $R$ is an algebra without a unit, then the standard unitisation $R^\sharp$ can have maximal one-sided ideals other than $R$. Thus, it is natural to ask about the following. Let $R$ be an algebra without a unit (over a field with char 0 if it does matter).
Is there a unital algebra $A$ such that $R$ is the unique maximal right ideal in $A$?
EDIT: Assume $R$ has a faithful representation $\pi$ on a vector space $V$ (over $K$), what if we consider $A=\pi(R)+KI$?
share|improve this question
2 Answers 2
The answer to this question is no in general. Let $K$ be a field, and let $R=F\{s,t\ :\ st=s+t \}$, the non-unital algebra generated by the non-commuting variables $s,t$ subject to the single relation $st=s+t$.
Let $A$ be any unital $K$-algebra containing $R$. In $A$ we have $(1-s)(1-t)=1-s-t+st=1$. However, $(1-t)(1-s)=1-t-s+ts\neq 1$ since $ts\neq s+t$. Thus $(1-s)$ is only right invertible, and hence $A\setminus R$ does not consist only of units.
Edited to add: An easier example, which has the added benefit of being commutative is taking $R$ to be the non-unital ring generated by commuting variables $x,y$ subject only to the additional relation $x^2=x$. The element $1-x\in A\setminus R$ is not unit, since it is a non-trivial idempotent.
share|improve this answer
The nice examples given by Pace show that the answer is negative in general. There is also a natural condition on $R$ which gives a positive solution. It involves the Jacobson radical of a non-unital ring. (I'm following the first few exercises in section 4 of Lam's A First Course in Noncommutative Rings.)
The binary operation $a \circ b = a + b -ab$ on $R$ is associative and has unit element $0$. An element of $R$ is called left (right) quasi-regular if it has a left (right) inverse in the monoid $(R, \circ, 0)$ and is called quasi-regular if it has both a left and a right inverse, which are necessarily equal.
The Jacobson radical $J(R)$ is the sum of all left ideals of $R$ consisting of left quasi-regular elements. One can show that this is an ideal of $R$, and all elements in it are quasi-regular. So $J(R)$ is the largest left (right) ideal consisting of left (right) quasi-regular elements. One can show that this coincides with the usual Jacobson radical in case $R$ has an identity.
Claim: For a (not necessarily unital) ring $R$, the following are equivalent:
1. $R$ is the unique maximal right (or left) ideal of its standard unitization $R^\sharp$;
2. $R = J(R)$.
Proof: Assume 1 holds, so that $R^\sharp$ is local and $R = J(R^\sharp)$. Then for any $x \in R$, the element $1 - x = 1 \oplus (-x) \in K \oplus R = R^\sharp$ lies in $R^\sharp \setminus R$ and therefore is invertible. Its inverse is of the form $\alpha \oplus y \in R^\sharp$. Writing out the equation for $(1-x)(\alpha \oplus y) = 1 \oplus 0$ yields that $\alpha = 1$ and $x + y - xy = 0$, and similarly we obtain $y + x -yx = 0$. So every element of $R$ is quasi-regular and 2 holds.
Conversely, assume 2 holds. We know that $R$ is a maximal right (and maximal left) ideal of $R^\sharp$ simply because of the ring isomorphism $R/R^\sharp \cong K$; thus $J(R^\sharp) \subseteq R$. If we can show that $R$ is contained in $J(R^\sharp)$ then we will be done, for then $R \subseteq J(R^\sharp) \subseteq R$ yields that $R^\sharp/J(R^\sharp) = R^\sharp/R \cong K$ making $R$ local with unique maximal right ideal $R$.
So let $x \in R$. To show $0 \oplus x \in J(R^\sharp)$, let $\alpha \oplus r \in R$; we need to find a left inverse to $$1 \oplus 0 - (\alpha \oplus r)(0 \oplus x) = 1 \oplus-(\alpha x + rx) = 1 \oplus (-x')$$ where we set $x' = \alpha x + rx \in R$. To this end, fix a left quasi-inverse $y$ for $x$ in $R$. Then from $y+x'-yx' = 0$ we obtain $$(1 \oplus -y)(1 \oplus -x') = 1 \oplus 0$$ as desired. QED
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://mathoverflow.net/questions/95285/making-an-algebra-the-uniqe-maximal-one-sided-ideal-in-another-unital-algebra?answertab=oldest",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "61571",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YGY6HGSMLJXRFXEE5WOYDX5LZZOLAND6",
"WARC-Concurrent-To": "<urn:uuid:69522ed2-1f02-4c1e-84ea-71310e648fa6>",
"WARC-Date": "2015-03-27T12:05:47Z",
"WARC-IP-Address": "104.16.29.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:C76TG47REO4VDQG27ASZBSFP3Q4G54RQ",
"WARC-Record-ID": "<urn:uuid:090ca71e-c402-4092-af87-43e8a78e128f>",
"WARC-Target-URI": "http://mathoverflow.net/questions/95285/making-an-algebra-the-uniqe-maximal-one-sided-ideal-in-another-unital-algebra?answertab=oldest",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5fcd257-b985-40bf-822a-2e1a14446e09>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 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,
25,
143,
144,
403,
404,
490,
491,
613,
614,
642,
643,
655,
656,
867,
868,
1111,
1112,
1113,
1409,
1410,
1436,
1437,
1745,
1746,
2057,
2058,
2440,
2441,
2519,
2520,
2613,
2630,
2631,
3119,
3120,
3549,
3550,
3955,
3956,
3982,
3983,
3995,
3996,
3998,
4006,
4007,
4085,
4086
],
"line_end_idx": [
25,
143,
144,
403,
404,
490,
491,
613,
614,
642,
643,
655,
656,
867,
868,
1111,
1112,
1113,
1409,
1410,
1436,
1437,
1745,
1746,
2057,
2058,
2440,
2441,
2519,
2520,
2613,
2630,
2631,
3119,
3120,
3549,
3550,
3955,
3956,
3982,
3983,
3995,
3996,
3998,
4006,
4007,
4085,
4086,
4176
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4176,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0.00047892998554743826,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2927241921424866,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07360406219959259,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3587140440940857,
"rps_doc_frac_unique_words": 0.354519784450531,
"rps_doc_mean_word_length": 4.155367374420166,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.920003890991211,
"rps_doc_word_count": 708,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05642420053482056,
"rps_doc_frac_chars_dupe_6grams": 0.042148198932409286,
"rps_doc_frac_chars_dupe_7grams": 0.0258327703922987,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009177429601550102,
"rps_doc_frac_chars_top_3gram": 0.0071379998698830605,
"rps_doc_frac_chars_top_4gram": 0.011556760407984257,
"rps_doc_books_importance": -459.11456298828125,
"rps_doc_books_importance_length_correction": -459.11456298828125,
"rps_doc_openwebtext_importance": -233.72726440429688,
"rps_doc_openwebtext_importance_length_correction": -233.72726440429688,
"rps_doc_wikipedia_importance": -206.91188049316406,
"rps_doc_wikipedia_importance_length_correction": -206.91188049316406
},
"fasttext": {
"dclm": 0.8467293977737427,
"english": 0.876326322555542,
"fineweb_edu_approx": 2.096024990081787,
"eai_general_math": 0.9887029528617859,
"eai_open_web_math": 0.9031410217285156,
"eai_web_code": 0.09019284695386887
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.4",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "2",
"label": "Academic/Research"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-870,941,087,544,633,200 |
loading
How Do You Add Labels to Your Icloud/iphone Calendar?
You can create new "Calendars" in iCal to organize your events by color and show/hide Calendars as needed.iCloud.com: Open "Calendar" App, Click "Edit" (bottom left), Click "" to add a new Calendar.iPhone: Open "Calendar" App, Click "Calendars" (bottom middle), Click "Add Calendar" to add a new Calendar. You will be able to give a name and color of your choosing to the Calendar!Move Event to Another Calendar: Open the event, click "Calendar", select new Calendar
How Do You Add Labels to Your Icloud/iphone Calendar? 1
1. Show your work/Show your calculations
In all my math and science classes, and I am nearing a B.S. in mathematics at an American university, I've never once heard "show your calculations" its always "show your work." Two reasons I can think of for "calculations" being disfavored are:For clarity, you should avoid using a 4 syllable word when a 1 syllable word will work better. Instructors want to see your thought process beyond mere calculations. 'Work' encompasses stating interpretations and theorems while 'calculations' suggests just showing arithmetic
2. Tv Show Recommendations?
Unlike most people who are "movie" buffs, I am a TV geek. But I am very picky. Here's a list of my favorites, old and new, in no particular order: 1. House 2. Scrubs 3.Seinfeld 4.How I Met Your Mother 5.The X Files 6.The Wayans Brothers 7.South Park Enjoy!
How Do You Add Labels to Your Icloud/iphone Calendar? 2
3. What is this little kids show?
teletubbies. lol do not kow
4. Is a gun show the safest place to be?
Its safer than voting in anywhere in Chicago
5. How to show unhappy dog?
training on show aspects beforehand i will make up a list train the dog to have anyone lift her lips and look at her teeth, judges love a dog thats not squirmish, most dogs are so if your dog will just stand still and look like someone is cudeling her to death, then this may score her personality points ;) tail up train your dog to always have the tail up, even when other dogs are around, do this by saying "tail up" and then push the tail up, you have to keep an eye on her at all times your around to begin with doing this, in the end she will learn that her best course of action is doing this on her own, if she dont want you following her around pushing on her tail all the time (we got the tips with one of our dogs and it worked actualy, when they do it by you just saying so and not needing to do anything, then praise them and give em a treat) stand teach the dog the comand stand, when you say stand, hold up the leash a little, and step back checking its feet, adjust the feets so they are in rigth show position, and then give the dog a treat or say good dog, each time they move out of the position say "no, stand" and use the lead to circle them out and around in infront of you, then readjust the feet when they can stand for a while, then tell them good girl (you want to keep reinforcing that this is how you want her to keep standing untill you signals to do something else) measure stock have someone make you one out of wood, this way you can actualy measure your own dog, you can train her on not moving out of stand position while being measured, often they get curious or a litle "oh what is that" the first times, let them sniff it before making them stand so they can figure out its just a harmless stock walking, troting train the dog to walk and trot "walk nicely" then adjust your speed to get the dog to walk at apropriate speed, (same with "trot nicely", get her used to walking in circles actualy being something that can gain her a treath, as well as walking/troting beside you in a rigth line being felt up get her used to you and others actualy feeling her feet and body without moving out of stand position now show training gather your friends, its time for show training, you are going to "show" your dogs to someone who acts as a judge. You now go through all the elements as if you where on a show, you will have to stand in a circle with equal distance to eachother, walk and troth in a circle, before taking the dog into the midle to have it examined by the judge. She will have to stand while he examins her, checks her teeth and measures her, then she will have to run away from him and back again. you keep having these gatherings a few times untill the dog feels comfortable, and can get through the asigned tasks in the way you desire now you are ready to sign her up for a real show, good luck, hope you win ;) edit its not cruel to show a dog, most all of the scandinavian spitz's get trained and show'ed, its just a mather of geting them adjusted to the elements so they know they are safe. Its desired that a spitz is so trained and socialised that they can handle this, a dog that couldnt handle this type of minor stress of these breed, how in all where they to handle the extended preasure of hunting?
GET IN TOUCH WITH Us
recommended articles
Related Blogs Info Center
Recently, the operation monitoring and Coordination Bureau of the Ministry of industry and information technology announced the development of China's software and i...
Invader Zim! i loved that show!1. Show that a function is measurableHint:the inverse image of an open subset by $f$ is open if it does not contain $0$ or is the Unio...
History Of The ShowThe John and Frank Show replaced the John and John Show, which replaced the Ted Stryker show on KFMA. In early to mid-2005, Tic-Tac returned to th...
Make sure it is set to public and not private1. Need free swf slide show for web page.?It desires to be further into the Flash report. i am uncertain approximately H...
Korean or English songs that show off singing ability?I do not know any Korean songs but i am an english singer so i know a few songs. To show off your range, somewh...
The name of the show that he stars in is 30 rock on nbc— — — — — â...
I've never even seen the show. But I think you might be right. Hey...is not she like the first celebritiy teenager to be knocked up so young? I do not think I've hea...
Can you try to use this geth option--rpccorsdomain "*"(or--rpccorsdomain "5.101.139.166")?To accept cross origin requests, this rpccorsdomain option should be set wh...
According to foreign media reports, when the world's largest science and technology exhibition is about to open, through ten guesses about the exhibition, maybe read...
Weeds is pretty similar to Breaking Bad1. How to show my parents?Keep growing into a young man , move out and then get the dog. It sounds harsh, but if your parents ...
no data
Contact Us
Contact Person: AI customer service
Tel: +86 0757-23368757
Address: No.4 Of Xingye Road, Shafu Industrial Park, Longjiang Town, Shunde District, Foshan
WHATSAPP: +86-15919090839
WECHAT: w87735492
Better Touch Better Business
Contact Sales at JuJiao.
Call Us
+86 0757-23368757
Customer service
detect
|
{
"url": "https://www.sandunjiaju.com/ai-article/how-do-you-add-labels-to-your-icloud-iphone-calendar.html",
"source_domain": "www.sandunjiaju.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "156804",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JR5PRFT2O7NUAZFSAKUWQG2OT472MJPP",
"WARC-Concurrent-To": "<urn:uuid:ad963f45-f7b2-47bb-9825-6c0fd68c2ee0>",
"WARC-Date": "2024-08-06T18:28:29Z",
"WARC-IP-Address": "3.162.125.102",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z6HNZWXL72XROLAPEJCTTJPXQFBGD4WV",
"WARC-Record-ID": "<urn:uuid:ff674b98-1311-4d3c-995f-7c451d263f41>",
"WARC-Target-URI": "https://www.sandunjiaju.com/ai-article/how-do-you-add-labels-to-your-icloud-iphone-calendar.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e663601-5424-4c37-aa9f-6bfcd8e1d527>"
},
"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-199\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,
8,
9,
63,
64,
531,
532,
588,
589,
630,
631,
1152,
1153,
1181,
1182,
1439,
1440,
1496,
1497,
1531,
1532,
1560,
1561,
1602,
1603,
1648,
1649,
1677,
1678,
4936,
4937,
4958,
4979,
5005,
5174,
5343,
5512,
5681,
5850,
5931,
6100,
6269,
6438,
6607,
6615,
6626,
6662,
6685,
6779,
6805,
6823,
6852,
6877,
6885,
6903,
6907,
6924
],
"line_end_idx": [
8,
9,
63,
64,
531,
532,
588,
589,
630,
631,
1152,
1153,
1181,
1182,
1439,
1440,
1496,
1497,
1531,
1532,
1560,
1561,
1602,
1603,
1648,
1649,
1677,
1678,
4936,
4937,
4958,
4979,
5005,
5174,
5343,
5512,
5681,
5850,
5931,
6100,
6269,
6438,
6607,
6615,
6626,
6662,
6685,
6779,
6805,
6823,
6852,
6877,
6885,
6903,
6907,
6924,
6930
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6930,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4317585229873657,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015748029574751854,
"rps_doc_frac_lines_end_with_ellipsis": 0.17543859779834747,
"rps_doc_frac_no_alph_words": 0.17519685626029968,
"rps_doc_frac_unique_words": 0.4150039851665497,
"rps_doc_mean_word_length": 4.309656620025635,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0.00721785007044673,
"rps_doc_unigram_entropy": 5.577739715576172,
"rps_doc_word_count": 1253,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.032777778804302216,
"rps_doc_frac_chars_dupe_6grams": 0.02388888970017433,
"rps_doc_frac_chars_dupe_7grams": 0.02388888970017433,
"rps_doc_frac_chars_dupe_8grams": 0.02388888970017433,
"rps_doc_frac_chars_dupe_9grams": 0.02388888970017433,
"rps_doc_frac_chars_top_2gram": 0.008888890035450459,
"rps_doc_frac_chars_top_3gram": 0.004444439895451069,
"rps_doc_frac_chars_top_4gram": 0.006111110094934702,
"rps_doc_books_importance": -730.4524536132812,
"rps_doc_books_importance_length_correction": -730.4524536132812,
"rps_doc_openwebtext_importance": -387.6988525390625,
"rps_doc_openwebtext_importance_length_correction": -387.6988525390625,
"rps_doc_wikipedia_importance": -336.66961669921875,
"rps_doc_wikipedia_importance_length_correction": -336.66961669921875
},
"fasttext": {
"dclm": 0.15921860933303833,
"english": 0.9346401691436768,
"fineweb_edu_approx": 1.4772412776947021,
"eai_general_math": 0.024043919518589973,
"eai_open_web_math": 0.16390931606292725,
"eai_web_code": 0.003733990015462041
}
}
|
{
"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": "636.7",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Agriculture",
"level_3": "Domestic animals and Pets"
}
}
},
"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": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,473,335,495,738,284,500 |
Navigation problem
I have this page:
http://legendarymedia.com/idagrove
I added five pages and they appear in the navigation no problem. When I try to add another page called "employment" it will not appear in the nav. The settings in the "page" editor are the same as everything other page.
I have tried to add other pages, and nothing will display in the navigation.I cannot understand why this is happening. I have pasted my header.php - any idea why this would happen?
<?php
/**
* The Header for our theme.
*
* Displays all of the <head> section and everything up till <div id="main">
*
* @package WordPress
* @subpackage Twenty_Ten
* @since Twenty Ten 1.0
*/
?><!DOCTYPE html>
<html <?php language_attributes(); ?>>
<head>
<meta charset="<?php bloginfo( 'charset' ); ?>" />
<title><?php
/*
* Print the <title> tag based on what is being viewed.
*/
global $page, $paged;
wp_title( '|', true, 'right' );
// Add the blog name.
bloginfo( 'name' );
// Add the blog description for the home/front page.
$site_description = get_bloginfo( 'description', 'display' );
if ( $site_description && ( is_home() || is_front_page() ) )
echo " | $site_description";
// Add a page number if necessary:
if ( $paged >= 2 || $page >= 2 )
echo ' | ' . sprintf( __( 'Page %s', 'quick' ), max( $paged, $page ) );
?></title>
<link rel="profile" href="http://gmpg.org/xfn/11" />
<link rel="stylesheet" type="text/css" media="all" href="<?php bloginfo( 'stylesheet_url' ); ?>" />
<link rel="pingback" href="<?php bloginfo( 'pingback_url' ); ?>" />
<?php
/* We add some JavaScript to pages with the comment form
* to support sites with threaded comments (when in use).
*/
if ( is_singular() && get_option( 'thread_comments' ) )
wp_enqueue_script( 'comment-reply' );
/* Always have wp_head() just before the closing </head>
* tag of your theme, or you will break many plugins, which
* generally use this hook to add elements to <head> such
* as styles, scripts, and meta tags.
*/
wp_head();
?>
<style type="text/css" media="screen">
#slider1 {
width: 437px; /* important to be same as image width */
height: 165px; /* important to be same as image height */
position: relative; /* important */
overflow: hidden; /* important */
}
#slider1Content {
width: 437px; /* important to be same as image width or wider */
position: absolute;
top: 0;
margin-left: 0;
}
.slider1Image {
float: right;
position: relative;
display: none;
}
.slider1Image span {
position: absolute;
font: 10px/15px Arial, Helvetica, sans-serif;
padding: 10px 13px;
width: 437px;
background-color: #000;
filter: alpha(opacity=70);
-moz-opacity: 0.7;
-khtml-opacity: 0.7;
opacity: 0.7;
color: #fff;
display: none;
}
.clear {
clear: both;
}
.slider1Image span strong {
font-size: 14px;
}
.left {
top: 0;
left: 0;
width: 110px !important;
height: 160px;
}
.right {
right: 0;
bottom: 0;
width: 90px !important;
height: 160px;
}
ul { list-style-type: none;}
</style>
<!-- JavaScripts-->
<script type="text/javascript" src="http://ajax.googleapis.com/ajax/libs/jquery/1.4.2/jquery.min.js"></script>
<script type="text/javascript" src="s3Slider.js"></script>
<script type="text/javascript">
$(document).ready(function() {
$('#slider1').s3Slider({
timeOut: 4000
});
});
</script>
</head>
<body <?php body_class(); ?>>
<div id="wrapper" class="hfeed">
<div id="header">
<div id="masthead">
<div id="access" role="navigation">
<?php /* Allow screen readers / text browsers to skip the navigation menu and get right to the good stuff */ ?>
<div class="skip-link screen-reader-text"><a href="#content" title="<?php esc_attr_e( 'Skip to content', 'quick' ); ?>"><?php _e( 'Skip to content', 'quick' ); ?></a></div>
<?php /* Our navigation menu. If one isn't filled out, wp_nav_menu falls back to wp_page_menu. The menu assiged to the primary position is the one used. If none is assigned, the menu with the lowest ID is used. */ ?>
<?php wp_nav_menu( array( 'container_class' => 'menu-header', 'theme_location' => 'primary' ) ); ?>
</div><!-- #access -->
</div><!-- #masthead -->
</div><!-- #header -->
<div class="main-curvebox">
<div class="top-curve"> </div>
<div class="body-curvesides-bg">
<div id="main">
<div class="banners">
<div style = "clear:both"></div>
<!-- left banner starts -->
<div class="left-banner"> <img src="<?php echo home_url( '/' ); ?>wp-content/themes/quick/images/qrl-gold-logo.jpg" alt="" /> </div>
<!-- left banner end -->
<!-- right banner starts -->
<div class="right-banner">
<div id="slider1">
<object classid="clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,29,0" width="487" height="150">
<param name="movie" value="http://s151465842.onlinehome.us/slideshow.swf">
<param name="quality" value="high">
<embed src="http://s151465842.onlinehome.us/slideshow.swf" quality="high" pluginspage="http://www.macromedia.com/go/getflashplayer" type="application/x-shockwave-flash" width="487" height="150"></embed>
</object>
</div>
</div> <!-- right banner end -->
<div class="clear"></div>
</div>
<div class="divide"></div>
Open in new window
lvollmerAsked:
Who is Participating?
Jason C. LevineConnect With a Mentor No oneCommented:
Hi lvollmer,
Have you checked under Appearance | Menus to see if the option has been added there?
0
lvollmerAuthor Commented:
jackpot thanks!
0
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment.
All Courses
From novice to tech pro — start learning today.
|
{
"url": "https://www.experts-exchange.com/questions/26836910/Navigation-problem.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "101904",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6MHD63L7AGC7M67PXDZPLQUAWZLG24I7",
"WARC-Concurrent-To": "<urn:uuid:c602dd3a-7f18-4185-a49c-2490cd2eb144>",
"WARC-Date": "2018-03-17T14:47:09Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZVU36A6JOI6EQYWADLBNTOFJNH5LUJ5A",
"WARC-Record-ID": "<urn:uuid:1e4ee1e2-15ca-4432-9869-ab3293bdadba>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/26836910/Navigation-problem.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2910a315-0eee-438d-b3ec-93944b5658e6>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-47-234-41.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,
19,
20,
38,
39,
74,
75,
295,
296,
477,
478,
484,
488,
517,
520,
597,
600,
622,
648,
673,
677,
695,
734,
741,
792,
805,
809,
866,
871,
894,
895,
928,
929,
952,
973,
974,
1028,
1091,
1153,
1184,
1185,
1221,
1255,
1329,
1330,
1342,
1395,
1495,
1563,
1569,
1627,
1686,
1691,
1748,
1788,
1789,
1847,
1908,
1967,
2006,
2011,
2023,
2026,
2065,
2076,
2136,
2198,
2238,
2273,
2275,
2276,
2294,
2363,
2387,
2396,
2413,
2415,
2431,
2449,
2473,
2489,
2491,
2512,
2536,
2583,
2607,
2625,
2653,
2684,
2707,
2729,
2747,
2764,
2783,
2785,
2794,
2808,
2810,
2838,
2859,
2861,
2869,
2878,
2891,
2917,
2933,
2935,
2944,
2955,
2967,
2992,
3008,
3010,
3039,
3040,
3049,
3069,
3180,
3239,
3271,
3306,
3339,
3366,
3378,
3386,
3396,
3404,
3405,
3435,
3468,
3487,
3509,
3548,
3666,
3843,
4068,
4172,
4198,
4225,
4249,
4278,
4316,
4352,
4371,
4397,
4435,
4468,
4606,
4637,
4671,
4703,
4728,
4918,
5001,
5045,
5256,
5273,
5288,
5331,
5362,
5373,
5404,
5405,
5424,
5425,
5440,
5462,
5464,
5518,
5531,
5532,
5617,
5619,
5621,
5647,
5663,
5665,
5699,
5700,
5801,
5802,
5847,
5848,
5860,
5861
],
"line_end_idx": [
19,
20,
38,
39,
74,
75,
295,
296,
477,
478,
484,
488,
517,
520,
597,
600,
622,
648,
673,
677,
695,
734,
741,
792,
805,
809,
866,
871,
894,
895,
928,
929,
952,
973,
974,
1028,
1091,
1153,
1184,
1185,
1221,
1255,
1329,
1330,
1342,
1395,
1495,
1563,
1569,
1627,
1686,
1691,
1748,
1788,
1789,
1847,
1908,
1967,
2006,
2011,
2023,
2026,
2065,
2076,
2136,
2198,
2238,
2273,
2275,
2276,
2294,
2363,
2387,
2396,
2413,
2415,
2431,
2449,
2473,
2489,
2491,
2512,
2536,
2583,
2607,
2625,
2653,
2684,
2707,
2729,
2747,
2764,
2783,
2785,
2794,
2808,
2810,
2838,
2859,
2861,
2869,
2878,
2891,
2917,
2933,
2935,
2944,
2955,
2967,
2992,
3008,
3010,
3039,
3040,
3049,
3069,
3180,
3239,
3271,
3306,
3339,
3366,
3378,
3386,
3396,
3404,
3405,
3435,
3468,
3487,
3509,
3548,
3666,
3843,
4068,
4172,
4198,
4225,
4249,
4278,
4316,
4352,
4371,
4397,
4435,
4468,
4606,
4637,
4671,
4703,
4728,
4918,
5001,
5045,
5256,
5273,
5288,
5331,
5362,
5373,
5404,
5405,
5424,
5425,
5440,
5462,
5464,
5518,
5531,
5532,
5617,
5619,
5621,
5647,
5663,
5665,
5699,
5700,
5801,
5802,
5847,
5848,
5860,
5861,
5908
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5908,
"ccnet_original_nlines": 184,
"rps_doc_curly_bracket": 0.003723759902641177,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13665032386779785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008409249596297741,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4709179997444153,
"rps_doc_frac_unique_words": 0.5528846383094788,
"rps_doc_mean_word_length": 6.149038314819336,
"rps_doc_num_sentences": 94,
"rps_doc_symbol_to_word_ratio": 0.0070077101700007915,
"rps_doc_unigram_entropy": 5.464564323425293,
"rps_doc_word_count": 624,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026583269238471985,
"rps_doc_frac_chars_dupe_6grams": 0.026583269238471985,
"rps_doc_frac_chars_dupe_7grams": 0.020328380167484283,
"rps_doc_frac_chars_dupe_8grams": 0.020328380167484283,
"rps_doc_frac_chars_dupe_9grams": 0.020328380167484283,
"rps_doc_frac_chars_top_2gram": 0.005212409887462854,
"rps_doc_frac_chars_top_3gram": 0.010164190083742142,
"rps_doc_frac_chars_top_4gram": 0.01329162996262312,
"rps_doc_books_importance": -626.7174682617188,
"rps_doc_books_importance_length_correction": -626.7174682617188,
"rps_doc_openwebtext_importance": -374.1134948730469,
"rps_doc_openwebtext_importance_length_correction": -374.1134948730469,
"rps_doc_wikipedia_importance": -271.9997253417969,
"rps_doc_wikipedia_importance_length_correction": -271.9997253417969
},
"fasttext": {
"dclm": 0.14368319511413574,
"english": 0.514823853969574,
"fineweb_edu_approx": 1.15946364402771,
"eai_general_math": 0.021996619179844856,
"eai_open_web_math": 0.4691091775894165,
"eai_web_code": 0.5902953743934631
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-4,777,301,570,863,550,000 |
DATA TYPES AND VARIABLES IN PYTHON
In this tutorial, we will learn about Data Types and Variables in Python, we will learn about how many data types are there in python and what is the difference between data type and a variable. There are different data types in python.
Numbers
Python Numbers include integer, floats and complex number and they are represented as int, float and complex in python class.
These different numbers can be assigned to the variables and to verify the type of any object in Python, use the type() function:
The difference between integers and float numbers is that a float number is separated by a decimal. So ’10’ is an integer and ‘10.5’ is a float number. Python gives us the freedom to store the integer, floating and complex numbers and also lets us do conversion operations between them.
Integers in Python:
Python can hold signed integers. It can hold a value of any length, the only limitation being the amount of memory available.
Float in Python
Float, or “floating point number” is a number, positive or negative, containing one or more decimals. A float value is only accurate upto 15 decimal places. After that, it rounds the number off.
Complex Numbers in Python
Complex numbers are written with a “j” as the imaginary part.
x = 1 # int y = 2.8 # float z = 1j # complex print(type(x)) print(type(y)) print(type(z))
List in Python
A list is a collection of items in a particular order. You can make a list that includes the letters of the alphabet, the digits from 0–9, or the names of all the people in your family.
You can put anything you want into a list, and the items in your list don’t have to be related in any particular way. Because a list usually contains more than one element, it’s a good idea to make the name of your list plural, such as letters, digits, or names.
vegetables = ['potato', 'tomato', 'capsicum', 'chilli'] print(vegetables)
Tuples in Python
Lists work well for storing sets of items that can change throughout the life of a program. The ability to modify lists is particularly important when you’re working with a list of users on a website or a list of characters in a game. However, sometimes you’ll want to create a list of items that cannot change. Tuples allow you to do just that. Python refers to values that cannot change as immutable, and an immutable list is called a tuple.
It is defined within parentheses () where items are separated by commas.
box = (200, 50)
Strings in Python
A string is simply a series of characters. Anything inside quotes is considered a string in Python, and you can use single or double quotes around your strings like this:
"This is a string."
'This is also a string.'
Dictionaries in Python
A dictionary in Python is a collection of key-value pairs. Each key is connected to a value, and you can use a key to access the value associated with that key. A key’s value can be a number, a string, a list, or even another dictionary. In fact, you can use any object that you can create in Python as a value in a dictionary.
fruits = {'value':tomato,'key':red}
Conversion between Data Types
We can convert between different data types by using different type conversion functions like int(), float(), str() etc.
>>> float(5)
5.0
Conversion from float to int will truncate the value (make it closer to zero).
>>> int(10.6)
10
>>> int(-10.6)
-10
Conversion to and from string must contain compatible values.
>>> float('2.5')
2.5
>>> str(25)
'25'
|
{
"url": "https://python-tricks.com/data-types-and-variables-in-python/",
"source_domain": "python-tricks.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "96291",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P6WOHBGARQRRSBTH5VP3OZJ6YRIGNTAJ",
"WARC-Concurrent-To": "<urn:uuid:02650319-1dc6-4dd6-a818-a0431ee9b700>",
"WARC-Date": "2020-10-29T02:41:06Z",
"WARC-IP-Address": "185.224.138.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PHLMJQUZ7TDPDFK2656ZM6GSRZF2LMFB",
"WARC-Record-ID": "<urn:uuid:f395cb42-b325-4268-9d15-daa427740a3e>",
"WARC-Target-URI": "https://python-tricks.com/data-types-and-variables-in-python/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9a1fe07d-e495-465b-9562-fdfac4bd0f5a>"
},
"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-239.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,
35,
36,
37,
274,
275,
276,
277,
285,
286,
412,
413,
543,
544,
831,
832,
833,
834,
854,
855,
981,
982,
983,
999,
1000,
1195,
1196,
1197,
1223,
1224,
1286,
1287,
1377,
1378,
1393,
1394,
1580,
1581,
1844,
1845,
1846,
1920,
1921,
1938,
1939,
2383,
2384,
2457,
2458,
2474,
2475,
2493,
2494,
2665,
2666,
2686,
2711,
2712,
2713,
2714,
2715,
2738,
2739,
3067,
3068,
3104,
3105,
3135,
3136,
3257,
3258,
3271,
3275,
3276,
3355,
3356,
3370,
3373,
3388,
3392,
3393,
3455,
3456,
3473,
3477,
3489
],
"line_end_idx": [
35,
36,
37,
274,
275,
276,
277,
285,
286,
412,
413,
543,
544,
831,
832,
833,
834,
854,
855,
981,
982,
983,
999,
1000,
1195,
1196,
1197,
1223,
1224,
1286,
1287,
1377,
1378,
1393,
1394,
1580,
1581,
1844,
1845,
1846,
1920,
1921,
1938,
1939,
2383,
2384,
2457,
2458,
2474,
2475,
2493,
2494,
2665,
2666,
2686,
2711,
2712,
2713,
2714,
2715,
2738,
2739,
3067,
3068,
3104,
3105,
3135,
3136,
3257,
3258,
3271,
3275,
3276,
3355,
3356,
3370,
3373,
3388,
3392,
3393,
3455,
3456,
3473,
3477,
3489,
3493
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3493,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0.0005725700175389647,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4028683304786682,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014341589994728565,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22294653952121735,
"rps_doc_frac_unique_words": 0.40303540229797363,
"rps_doc_mean_word_length": 4.51264762878418,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.003911340143531561,
"rps_doc_unigram_entropy": 4.859151363372803,
"rps_doc_word_count": 593,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0216741394251585,
"rps_doc_frac_chars_dupe_6grams": 0.0216741394251585,
"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.047832589596509933,
"rps_doc_frac_chars_top_3gram": 0.010089689865708351,
"rps_doc_frac_chars_top_4gram": 0.01569507084786892,
"rps_doc_books_importance": -268.9703369140625,
"rps_doc_books_importance_length_correction": -268.9703369140625,
"rps_doc_openwebtext_importance": -170.79672241210938,
"rps_doc_openwebtext_importance_length_correction": -170.79672241210938,
"rps_doc_wikipedia_importance": -81.00434112548828,
"rps_doc_wikipedia_importance_length_correction": -81.00434112548828
},
"fasttext": {
"dclm": 0.9565180540084839,
"english": 0.888752818107605,
"fineweb_edu_approx": 3.3208940029144287,
"eai_general_math": 0.9656127095222473,
"eai_open_web_math": 0.09759985655546188,
"eai_web_code": 0.9763636589050293
}
}
|
{
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,158,334,414,874,583,000 |
Sign in with
Sign up | Sign in
Your question
Need advice on buying new system.
Last response: in Systems
Share
June 25, 2012 2:00:54 AM
I'm currently looking at 2 computers. To avoid typing all the specs I took 2 screenshots of the specs. Is it worth the extra 579$ for the 2nd one or is the 1st one already fast enough? I do a lot of gaming and I like to keep all the graphics on the highest settings(and hopefully for years to come).
http://imageshack.us/f/802/hpcomp1.png/ - $1119
http://imageshack.us/f/259/hpcomp2.png/ - $1698
I'm ready and willing to buy either. Still doing some research. Would like some advice from the technical community. I've looked into making my own but since I don't have any stores to buy the parts nearby I'd be ordering all of the stuff online, so I have to add shipping cost to each item. Plus having to deal with combatibility issues the pricepoint really isn't pushing me in that direction.
Nothing will end up being over-clocked I want my system to last.
Basically this is what I can figure. They are both really good systems as far as I can tell. On the 2nd one the processor is a little bit better. I've seen reviews on both performing the same task on the same machine and the difference was noticable. The graphics card on the 2nd basically blows the 1st ones out of the water but it was a lot cheaper upgrade and I didn't have to upgrade the power core too. I had to upgrade the power to 600 watts on the 2nd so that was an extra 70$ because of the graphics card. Both have the same ram and I'll end up buying 2x 4gb ram sticks to make either machine 14gb ram. After market ram is just way cheaper they are trying to gouge 160$ extra to get 16gb.
Well I'd just like to know your opinions. Last computer I bought was an HP elite series and I've always been happy with it. It's still a decent computer but recently I realized my CPU usage was getting really high on applications I consider to be menial so I figure it's time to buy a new one.
More about : advice buying system
June 25, 2012 3:40:14 AM
what do you plan to do with these systems? the cpus are serious overkill for every day tasks or gaming.
m
0
l
June 25, 2012 11:30:19 PM
Gaming and multitasking. I often run 2 or 3 games at a time while doing other things. I also want it to last for years so I can run still play the highest res games and stuff.
m
0
l
!
|
{
"url": "http://www.tomshardware.com/forum/351828-31-need-advice-buying-system",
"source_domain": "www.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "103319",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6Q72XHVFJSSP4BQDLIEAYYGUNWKWSVTE",
"WARC-Concurrent-To": "<urn:uuid:af7008f5-cfa4-4623-b13d-ee2ffa580497>",
"WARC-Date": "2014-07-30T23:43:26Z",
"WARC-IP-Address": "23.15.9.88",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DIGIHLNWV7P2MEGB3KUM6PIN2DYTUXE7",
"WARC-Record-ID": "<urn:uuid:2b3461d8-b5d6-4085-a049-26780e4869de>",
"WARC-Target-URI": "http://www.tomshardware.com/forum/351828-31-need-advice-buying-system",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aff6a046-42c2-4a52-b200-660579aeebe9>"
},
"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,
13,
31,
45,
46,
80,
81,
107,
113,
138,
139,
439,
440,
488,
489,
537,
538,
934,
935,
1000,
1001,
1698,
1699,
1993,
1994,
2028,
2029,
2054,
2055,
2159,
2161,
2163,
2165,
2191,
2192,
2368,
2370,
2372,
2374
],
"line_end_idx": [
13,
31,
45,
46,
80,
81,
107,
113,
138,
139,
439,
440,
488,
489,
537,
538,
934,
935,
1000,
1001,
1698,
1699,
1993,
1994,
2028,
2029,
2054,
2055,
2159,
2161,
2163,
2165,
2191,
2192,
2368,
2370,
2372,
2374,
2375
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2375,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43087971210479736,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05385996028780937,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1903052031993866,
"rps_doc_frac_unique_words": 0.5167785286903381,
"rps_doc_mean_word_length": 4.09172248840332,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.060848236083984,
"rps_doc_word_count": 447,
"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.013668670319020748,
"rps_doc_frac_chars_top_3gram": 0.016402410343289375,
"rps_doc_frac_chars_top_4gram": 0.018589390441775322,
"rps_doc_books_importance": -194.43588256835938,
"rps_doc_books_importance_length_correction": -194.43588256835938,
"rps_doc_openwebtext_importance": -113.51881408691406,
"rps_doc_openwebtext_importance_length_correction": -113.51881408691406,
"rps_doc_wikipedia_importance": -79.39527893066406,
"rps_doc_wikipedia_importance_length_correction": -79.39527893066406
},
"fasttext": {
"dclm": 0.03630125895142555,
"english": 0.9825266599655151,
"fineweb_edu_approx": 0.8875799775123596,
"eai_general_math": 0.11774147301912308,
"eai_open_web_math": 0.06464111804962158,
"eai_web_code": 0.004900990054011345
}
}
|
{
"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": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,895,651,978,074,078,000 |
How To Build A Better Government Website?
0
357
The ability to engage citizens and improve citizen-government relationships are some of the priority goals of government websites. However, even with the best intentions and efforts, several agencies fail to fulfill the goals and customer satisfaction remains poorly low.
The citizens expect their interaction with the government website to be a similar experience of that of a private sector. Also, many government websites look unimpressively boring and dull which does nothing in favor of public engagement.
bloomblogging
However, if you are wondering how you can improve your chances of creating a better or in fact the best government websites then here are some efficient steps to help you out. Take a look at the below enumerated steps that shall most definitely help you in fulfilling the prime goals and building an efficiently working website.
1. Interview the stakeholders
Before starting on your journey to create a government website, you need to learn about the core audience of your website. A website that is designed and built keeping in mind the needs of everyone will please no one.
The website will become generic and will do nothing good for generating intended engagement. Therefore, to pinpoint a precise audience for the website, you must interview both internal and external stakeholders.
Conducting thorough interviews with the employees, government organizations, partners, citizens and businesses will not only help you identify your audience but also highlight the website goals and define user profiles exactly.
2. Conduct user surveys extensively
Understanding the users is key to building an efficient government website. What most agencies do is that when creating websites they take the initiative of inside out which is essentially reflecting the government organization’s needs.
However, the correct approach should be outside in which is to consider the user perspective. After all, the government websites are created for the sake of visitors or users. With extensive user surveys, you are able to bring out the actual goal of real-life visitors.
You will also learn about audience preferences and their types. The tasks that they are looking for in the government websites. All of the information will help you to achieve development decisions and more progressive work in building an efficient government website.
3. Execute card sort test
If you are expecting the public to find information on government websites in the same way how organization insiders do then you are certainly wrong. The navigation system on the website must be easy-to-use and organized.
The audience must find it understandable. It is observed that government websites are often abandoned because the navigation of the site is too complex. Therefore, you need to recognize the pattern in which your audience prioritizes and categorizes information.
The card sort test allows you to learn that pattern. With its execution, you can structure the content on the site and also make an influence for improved customer satisfaction.
4. Review web analytics
Constructing a better user experience by giving the users what they seek from a government website is an important element for creating a better government website. Well, with the help of web analytics, you can learn more about user goals and create content which is relevant for them.
Reviewing the web analytics provides you with insights for user behaviour, particular entry and exit points, content value, devices used for accessing the website. All of the data obtained from it helps in creating a better website that is for the users.
5. Build goal-directed home page
You must keep in mind that citizens visit best government websites for the primary purpose of accomplishing a specific goal. For example, filling a form or seeking information or notice.
Therefore, you must create the home page of the government website in such a way that all the essential information, frequently used topics and other crucial content are placed in an organized and efficient way.
This will help the users to achieve their goal quickly and efficiently.
There’s more to creating a better government website. The above listed are some of the crucial ways in which you can develop government sites. Learn more about government website creation from expert professionals.
LEAVE A REPLY
Please enter your comment!
Please enter your name here
|
{
"url": "https://bloomblogging.com/how-to-build-a-better-government-website/",
"source_domain": "bloomblogging.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "180918",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P2NBQ4743LJOIFICU36P5R5XXZN5F3CR",
"WARC-Concurrent-To": "<urn:uuid:714a269e-45a5-4f9f-9990-44ca83253952>",
"WARC-Date": "2023-03-30T20:16:16Z",
"WARC-IP-Address": "104.21.2.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WX2RP5UWVPCFXSPL53QU2BHFTUPM54CQ",
"WARC-Record-ID": "<urn:uuid:bacf754c-2788-4681-8b94-61dfbe25a676>",
"WARC-Target-URI": "https://bloomblogging.com/how-to-build-a-better-government-website/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05542187-331c-479f-abda-aee1f4032b2e>"
},
"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-134\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,
42,
43,
45,
49,
50,
322,
323,
562,
563,
577,
578,
907,
908,
938,
939,
1157,
1158,
1370,
1371,
1599,
1600,
1636,
1637,
1874,
1875,
2145,
2146,
2415,
2416,
2442,
2443,
2665,
2666,
2928,
2929,
3107,
3108,
3132,
3133,
3419,
3420,
3675,
3676,
3709,
3710,
3897,
3898,
4110,
4111,
4183,
4184,
4399,
4400,
4414,
4415,
4442
],
"line_end_idx": [
42,
43,
45,
49,
50,
322,
323,
562,
563,
577,
578,
907,
908,
938,
939,
1157,
1158,
1370,
1371,
1599,
1600,
1636,
1637,
1874,
1875,
2145,
2146,
2415,
2416,
2442,
2443,
2665,
2666,
2928,
2929,
3107,
3108,
3132,
3133,
3419,
3420,
3675,
3676,
3709,
3710,
3897,
3898,
4110,
4111,
4183,
4184,
4399,
4400,
4414,
4415,
4442,
4469
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4469,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4510800540447235,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006353239994496107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10292249172925949,
"rps_doc_frac_unique_words": 0.4121812880039215,
"rps_doc_mean_word_length": 5.19121789932251,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.035229206085205,
"rps_doc_word_count": 706,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03710778057575226,
"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.046384718269109726,
"rps_doc_frac_chars_top_3gram": 0.01637108065187931,
"rps_doc_frac_chars_top_4gram": 0.019645290449261665,
"rps_doc_books_importance": -282.5030517578125,
"rps_doc_books_importance_length_correction": -282.5030517578125,
"rps_doc_openwebtext_importance": -184.95394897460938,
"rps_doc_openwebtext_importance_length_correction": -184.95394897460938,
"rps_doc_wikipedia_importance": -145.32272338867188,
"rps_doc_wikipedia_importance_length_correction": -145.32272338867188
},
"fasttext": {
"dclm": 0.19002211093902588,
"english": 0.9468640089035034,
"fineweb_edu_approx": 1.8678717613220215,
"eai_general_math": 0.008566799573600292,
"eai_open_web_math": 0.05441629886627197,
"eai_web_code": 0.046493228524923325
}
}
|
{
"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": "351.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Public administration"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-7,705,862,140,640,537,000 |
Java可重入锁如何避免死锁
本文由https://bbs.csdn.net/topics/390939500https://zhidao.baidu.com/question/1946051090515119908.html启发而来。
看到一个问题，Java的可重入锁为什么可以防止死锁呢？网上看了看资料，虽然有答案说出了正确答案，但是分析的不够详细，对初学者不够友好。这里我再做一个更清晰的分析。
首先是示例代码：
public class Widget {
public synchronized void doSomething(){
// do something
}
}
public class LoggingWidget extends Widget {
public synchronized void doSomething() {
super.doSomething();
}
}
这是《java并发编程实例》一书中的例子，并且书中说：“如果synchronized 不是可重入锁，那么LoggingWidget 的super.dosomething();无法获得Widget对象的锁，因为会死锁。”
乍一看好像不是这么回事，就算synchronized 不是可重入锁，可是synchronized 关键字一个在父类Widget 的方法上，另一个在子类LoggingWidget 的方法上，怎么会有死锁产生呢。
这里其实牵涉到了Java的重写。我们看子类LoggingWidget 的doSomething方法，重写了父类Widget 的doSomething方法，但是子类对象如果要调用父类的doSomething方法，那么就需要用到super关键字了。因为实例方法的调用是Java虚拟机在运行时动态绑定的，子类LoggingWidget 的对象调用doSomething方法，一定是绑定到子类自身的doSomething方法，必须用super关键字告诉虚拟机，这里要调用的是父类的doSomething方法。
实际上，如果我们分析运行时的LoggingWidget 类，那我们看到的应该是这样子的（这里只是为了分析，真实情况肯定和下面的例子不同）：
public class LoggingWidget extends Widget {
public synchronized void Widget.doSomething() {
// do something
} // 父类的doSomething方法
public synchronized void doSomething() {
super.doSomething();
}
}
子类对象，其实是持有父类Widget 的doSomething方法的，只需要使用super关键字告诉虚拟机要运行的是父类的doSomething方法，虚拟机会去调用子类对象中的父类Widget 的doSomething方法的。所以，super关键字并没有新建一个父类的对象，比如说widget，然后再去调用widget.doSomething方法，实际上调用父类doSomething方法的还是我们的子类对象。
那么这样就很好理解了，如果一个线程有子类对象的引用loggingWidget，然后调用loggingWidget.doSomething方法的时候，会请求子类对象loggingWidget 的对象锁；又因为loggingWidget 的doSomething方法中调用的父类的doSomething方法，实际上还是要请求子类对象loggingWidget 的对象锁，那么如果synchronized 关键字不是个可重入锁的话，就会在子类对象持有的父类doSomething方法上产生死锁了。正因为synchronized 关键字的可重入锁，当前线程因为已经持有了子类对象loggingWidget 的对象锁，后面再遇到请求loggingWidget 的对象锁就可以畅通无阻地执行同步方法了。
更进一步，将上面的示例代码改写一下，那么就算synchronized 不是可重入锁，也不会产生死锁的问题了。代码如下：
public class Widget {
public synchronized void doSomething(){
// do something
}
}
public class LoggingWidget extends Widget {
public synchronized void doSomething() {
Widget widget = new Widget();
widget.doSomething();
}
}
在子类的doSomething方法中，直接新建了一个父类的对象widget，然后用这个父类对象来调用父类的doSomething方法，实际上请求的是这个父类对象widget的对象锁，就不涉及到可重入锁的问题了。
阅读更多
想对作者说点什么？
博主推荐
换一批
没有更多推荐了，返回首页
|
{
"url": "https://blog.csdn.net/noodleprince/article/details/79826050",
"source_domain": "blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "61653",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5JRRCGHYJCLID3XROF7B36C3AHB72PXL",
"WARC-Concurrent-To": "<urn:uuid:60bb5d3c-79c3-4bc0-9cf7-feed13f775c3>",
"WARC-Date": "2018-10-19T16:52:33Z",
"WARC-IP-Address": "39.96.132.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U2DTHLPY2JB3C4SNFDUVPFMQOMS5HCAU",
"WARC-Record-ID": "<urn:uuid:c868ac2b-ad23-4cb5-bb49-9c3074f911c8>",
"WARC-Target-URI": "https://blog.csdn.net/noodleprince/article/details/79826050",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5966410-3ad6-4f1f-9cd9-a936a0033caf>"
},
"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-102-177-5.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,
15,
16,
120,
121,
203,
204,
213,
214,
236,
280,
304,
310,
312,
356,
401,
430,
436,
438,
439,
549,
550,
655,
656,
907,
908,
978,
979,
1023,
1075,
1099,
1127,
1128,
1173,
1202,
1208,
1210,
1211,
1417,
1418,
1764,
1765,
1825,
1826,
1848,
1892,
1916,
1922,
1924,
1968,
2013,
2051,
2081,
2087,
2089,
2090,
2196,
2197,
2202,
2212,
2213,
2218,
2219,
2223,
2224
],
"line_end_idx": [
15,
16,
120,
121,
203,
204,
213,
214,
236,
280,
304,
310,
312,
356,
401,
430,
436,
438,
439,
549,
550,
655,
656,
907,
908,
978,
979,
1023,
1075,
1099,
1127,
1128,
1173,
1202,
1208,
1210,
1211,
1417,
1418,
1764,
1765,
1825,
1826,
1848,
1892,
1916,
1922,
1924,
1968,
2013,
2051,
2081,
2087,
2089,
2090,
2196,
2197,
2202,
2212,
2213,
2218,
2219,
2223,
2224,
2236
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2236,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0.009839000180363655,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.027303749695420265,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5665528774261475,
"rps_doc_frac_unique_words": 0.53125,
"rps_doc_mean_word_length": 19.90625,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.5584752559661865,
"rps_doc_word_count": 96,
"rps_doc_frac_chars_dupe_10grams": 0.13710099458694458,
"rps_doc_frac_chars_dupe_5grams": 0.20198848843574524,
"rps_doc_frac_chars_dupe_6grams": 0.16797487437725067,
"rps_doc_frac_chars_dupe_7grams": 0.16797487437725067,
"rps_doc_frac_chars_dupe_8grams": 0.16797487437725067,
"rps_doc_frac_chars_dupe_9grams": 0.13710099458694458,
"rps_doc_frac_chars_top_2gram": 0.056514911353588104,
"rps_doc_frac_chars_top_3gram": 0.06907378137111664,
"rps_doc_frac_chars_top_4gram": 0.07326006889343262,
"rps_doc_books_importance": -113.02263641357422,
"rps_doc_books_importance_length_correction": -113.02263641357422,
"rps_doc_openwebtext_importance": -76.7229232788086,
"rps_doc_openwebtext_importance_length_correction": -76.7229232788086,
"rps_doc_wikipedia_importance": -54.27101516723633,
"rps_doc_wikipedia_importance_length_correction": -54.27101516723633
},
"fasttext": {
"dclm": 0.9993162155151367,
"english": 0.03137701004743576,
"fineweb_edu_approx": 3.0589380264282227,
"eai_general_math": 0.15528184175491333,
"eai_open_web_math": 0.0038779398892074823,
"eai_web_code": 0.9573970437049866
}
}
|
{
"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": "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": "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
|
-6,090,255,746,268,454,000 |
54
I usually assumed that tar was a compression utility, but I am unsure, does it actually compress files, or is it just like an ISO file, a file to hold files?
1
4 Answers 4
65
Tar is an archiving tool (Tape ARchive), it only collects files and their metadata together and produces one file. If you want to compress that file later you can use gzip/bzip2/xz. For convenience, tar provides arguments to compress the archive automatically for you. Checkout the tar man page for more details.
17
• 9
A slight clarification on the answer. It is GNU tar that provides those extra compression arguments. For example, Solaris tar does not provide arguments for compression. Apr 29, 2014 at 22:20
• 5
oooh, that's why I keep seeing thing.tar.7z Apr 30, 2014 at 0:34
• BSD tar provides an argument for compression as well, though it only accepts z and determines the compression method based on the extension, whereas GNU tar has separate zZjJ arguments for the different compression methods. Apr 30, 2014 at 0:59
• 2
Just read the BSD tar manpage, and it turns out I was mistaken, BSD tar uses separate zZjJ for compression just like GNU tar. However, it does automatically detect compression when decompressing though, whereas GNU tar expects zZjJ then also. Apr 30, 2014 at 3:10
• 5
@wingedsubmariner: no; modern-ish versions of GNU tar decompress automatically without requiring the -zZjJ options. Apr 30, 2014 at 4:02
23
tar produces archives; compression is a separate functionality. However tar alone can reduce space usage when used on a large number of small files that are smaller than the filesystem's cluster size. If a filesystem uses 1kb clusters, even a file that contains a single byte will consume 1kb (plus an inode). A tar archive does not have this overhead.
BTW, an ISO file is not really "a file to hold files" - it's actually an image of an entire filesystem (one originally designed to be used on CDs) and thus its structure is considerably more complex.
3
• 3
Actually an empty file will not consume 1kb. A 1-1023 byte file will.
– psusi
Apr 30, 2014 at 3:28
• @psusi so for a file of bytes 1-1023 will consume 1024 always which results in wastage of 1023-1 bytes. May 14, 2019 at 13:36
• tar has significant alignment / block size overhead, due to its origin as a Tape Archiver. If a is an empty file, tar -cf a.tar a will create a 10240-byte file a.tar. You can use a hex editor or od to verify that most of the file is NUL (zero) bytes. Sep 12, 2022 at 15:59
4
The original UNIX tar command did not compress archives. As was mentioned in a comment, Solaris tar doesn't compress. Nor does HP-UX, nor AIX, FWIW. By convention, uncompressed archives end in .tar.
With GNU/Linux you get GNU tar. (You can install GNU tar on other UNIX systems.) By default it does not compress; however, it does compress the resulting archive with gzip (also by GNU) if you supply -z. The conventional suffix for gzipped files is .gz, so you'll often see tarballs (slang for a tar archive, usually implying it's been compressed) that end in .tar.gz. That ending implies tar was run, followed by gzip, e.g. tar cf - .|gzip -9v > archive.tar.gz. You'll also find archives ending in .tgz, e.g. tar czf archive.tgz ..
Edit: www.linfo.org/tar.html reminded me that GNU tar supports much more functionality than merely compressing with gzip, and it reminded me that the suffixes are more than plain conventions. They have built-in semantics. It also supports bzip2 (-j for .bz2) and old compress (-Z for .Z). Then I looked at the man page and was reminded that -a automatically maps your desired compression method based on suffix.
One other nit. As the Linux tar man page says, GNU produces info pages, not man pages, so to learn all about GNU tar, run info tar.
3
• The GNU tar still doesn't handle compressions by itself, it just pipes to/from gzip, bzip2, compress and others.
– ott--
Aug 6, 2015 at 20:03
• I had a look at the source. GNU tar handles compression! The implementation takes advantage of code reuse and sound UNIX user space architectural principles. "Just pipes" is understating the way compression is tightly integrated into the tool. The fact that it happens to fork helper programs is a technicality. If you want to defend "just pipes," then cite file names and line numbers and let's see which side the community takes.
– tbc0
Aug 6, 2015 at 21:15
• It takes some days before I can check that source.
– ott--
Aug 6, 2015 at 21:24
1
tar utility does not compress until you give argument to do so [tar -z file name].
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://unix.stackexchange.com/questions/127169/does-tar-actually-compress-files-or-just-group-them-together",
"source_domain": "unix.stackexchange.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "188527",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VTKO5Q3CB43PGHCN7JQFAPXB2OYALJMI",
"WARC-Concurrent-To": "<urn:uuid:76d127cc-2b7e-4543-a068-95a01eb38d73>",
"WARC-Date": "2023-09-28T01:16:50Z",
"WARC-IP-Address": "104.18.11.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GF447J5EBZB2FN6NDF7UVQA4B7DEBNIC",
"WARC-Record-ID": "<urn:uuid:866d3d07-f2f9-44c1-b4fe-301e2690eaa4>",
"WARC-Target-URI": "https://unix.stackexchange.com/questions/127169/does-tar-actually-compress-files-or-just-group-them-together",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23f0e042-1d1c-4663-b005-767fca569135>"
},
"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-97\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,
3,
4,
162,
163,
165,
166,
178,
179,
182,
183,
496,
497,
500,
506,
702,
708,
777,
1026,
1032,
1300,
1306,
1447,
1450,
1451,
1804,
1805,
2005,
2006,
2008,
2014,
2088,
2100,
2125,
2255,
2532,
2534,
2535,
2734,
2735,
3268,
3269,
3681,
3682,
3814,
3815,
3817,
3934,
3946,
3971,
4407,
4418,
4443,
4498,
4510,
4535,
4537,
4538,
4621,
4622,
4663,
4664
],
"line_end_idx": [
3,
4,
162,
163,
165,
166,
178,
179,
182,
183,
496,
497,
500,
506,
702,
708,
777,
1026,
1032,
1300,
1306,
1447,
1450,
1451,
1804,
1805,
2005,
2006,
2008,
2014,
2088,
2100,
2125,
2255,
2532,
2534,
2535,
2734,
2735,
3268,
3269,
3681,
3682,
3814,
3815,
3817,
3934,
3946,
3971,
4407,
4418,
4443,
4498,
4510,
4535,
4537,
4538,
4621,
4622,
4663,
4664,
4730
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4730,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3261074423789978,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03770028054714203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26013195514678955,
"rps_doc_frac_unique_words": 0.435523122549057,
"rps_doc_mean_word_length": 4.388077735900879,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.357027530670166,
"rps_doc_word_count": 822,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016634320840239525,
"rps_doc_frac_chars_dupe_6grams": 0.00776267983019352,
"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.018297750502824783,
"rps_doc_frac_chars_top_3gram": 0.012475740164518356,
"rps_doc_frac_chars_top_4gram": 0.015248130075633526,
"rps_doc_books_importance": -449.07818603515625,
"rps_doc_books_importance_length_correction": -449.07818603515625,
"rps_doc_openwebtext_importance": -238.65420532226562,
"rps_doc_openwebtext_importance_length_correction": -238.65420532226562,
"rps_doc_wikipedia_importance": -118.58697509765625,
"rps_doc_wikipedia_importance_length_correction": -118.58697509765625
},
"fasttext": {
"dclm": 0.09365624189376831,
"english": 0.8941892385482788,
"fineweb_edu_approx": 2.015061616897583,
"eai_general_math": 0.6208077073097229,
"eai_open_web_math": 0.2994208335876465,
"eai_web_code": 0.19234240055084229
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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,089,948,799,007,590,000 |
Ethereum Xamarin
What Is Ethereum (ETH)?
Ethereum is a decentralized open-source blockchain system that features its own cryptocurrency, Ether. ETH works as a platform for numerous other cryptocurrencies, along with for the execution of decentralized wise agreements Ethereum was first explained in a 2013 whitepaper by Vitalik Buterin. Buterin, along with other co-founders, secured funding for the project in an online public crowd sale in the summertime of 2014 and officially launched the blockchain on July 30, 2015.
Ethereum’s own supposed goal is to become an international platform for decentralized applications, enabling users from all over the world to write and run software application that is resistant to censorship, downtime and fraud.
Who Are the Creators of Ethereum?
Ethereum has an overall of 8 co-founders an abnormally a great deal for a crypto project. They initially fulfilled on June 7, 2014, in Zug, Switzerland.
Russian-Canadian Vitalik Buterin is maybe the best known of the lot. He authored the initial white paper that initially explained Ethereum in 2013 and still deals with enhancing the platform to this day. Prior to ETH, Buterin co-founded and composed for the Bitcoin Magazine news site.
British programmer Gavin Wood is perhaps the second most important co-founder of ETH, as he coded the first technical application of Ethereum in the C++ programming language, proposed Ethereum’s native shows language Strength and was the very first chief innovation officer of the Ethereum Foundation. Before Ethereum, Wood was a research scientist at Microsoft. Afterward, he proceeded to establish the Web3 Structure.
Amongst the other co-founders of Ethereum are: – Anthony Di Iorio, who financed the job throughout its early stage of development. – Charles Hoskinson, who played the primary function in developing the Swiss-based Ethereum Foundation and its legal framework. – Mihai Alisie, who provided assistance in developing the Ethereum Foundation. – Joseph Lubin, a Canadian business owner, who, like Di Iorio, has actually assisted fund Ethereum throughout its early days, and later founded an incubator for start-ups based upon ETH called ConsenSys. – Amir Chetrit, who assisted co-found Ethereum but stepped away from it early into the development.
What Makes Ethereum Special?
Ethereum has pioneered the principle of a blockchain wise contract platform. Smart agreements are computer system programs that immediately execute the actions needed to satisfy an agreement in between several celebrations on the internet. They were designed to decrease the requirement for trusted intermediates between specialists, thus decreasing deal costs while also increasing deal dependability.
Ethereum’s primary innovation was developing a platform that allowed it to execute wise agreements utilizing the blockchain, which further reinforces the currently existing advantages of clever contract innovation. Ethereum’s blockchain was designed, according to co-founder Gavin Wood, as a sort of “one computer for the whole planet,” in theory able to make any program more robust, censorship-resistant and less prone to fraud by running it on a globally dispersed network of public nodes.
In addition to clever agreements, Ethereum’s blockchain is able to host other cryptocurrencies, called “tokens,” through making use of its ERC-20 compatibility standard. This has been the most common use for the ETH platform so far: to date, more than 280,000 ERC-20-compliant tokens have been released. Over 40 of these make the top-100 cryptocurrencies by market capitalization, for example, USDT LINK and BNB B: Related Pages:
New to crypto? Learn how to buy Bitcoin today Ready to get more information? Visit our discovering hub Wish to look up a deal? Visit our block explorer Curious about the crypto area? Read our blog
How Is the Ethereum Network Guaranteed?
Since August 2020, Ethereum is protected through the Ethash proof-of-work algorithm, coming from the Keccak household of hash functions.
There are plans, however, to shift the network to a proof-of-stake algorithm tied to the significant Ethereum 2.0 upgrade, which launched in late 2020.
After the Ethereum 2.0 Beacon Chain (Stage 0) went live in the start of December 2020, it ended up being possible to start staking on the Ethereum 2.0 network. An Ethereum stake is when you transfer ETH (functioning as a validator) on Ethereum 2.0 by sending it to a deposit contract, generally acting as a miner and therefore securing the network. At the time of writing in mid-December 2020, the Ethereum stake cost, or the quantity of cash earned daily by Ethereum validators, is about 0.00403 ETH a day, or $2.36. This number will change as the network develops and the amount of stakers (validators) boost.
Ethereum staking rewards are figured out by a distribution curve (the participation and typical percent of stakers): some ETH 2.0 staking rewards are at 20% for early stakers, but will be decreased to wind up in between 7% and 4.5% annually.
The minimum requirements for an Ethereum stake are 32 ETH. If you choose to stake in Ethereum 2.0, it implies that your Ethererum stake will be secured on the network for months, if not years, in the future up until the Ethereum 2.0 upgrade is finished.
shakertemplate.icu
|
{
"url": "https://papiermaine.com/ethereum-xamarin/",
"source_domain": "papiermaine.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "28328",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DTFQBV7JFGA5RBWWB5LRJNJO25GX6PQ7",
"WARC-Concurrent-To": "<urn:uuid:8e1f0401-910a-443c-9303-a1edb496c44b>",
"WARC-Date": "2021-03-04T03:05:01Z",
"WARC-IP-Address": "172.67.197.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NQJ5ARIJBRN5DL7FP3JNH6GH7X5W6ROH",
"WARC-Record-ID": "<urn:uuid:dacacfe1-7632-46a4-9343-1717667138b4>",
"WARC-Target-URI": "https://papiermaine.com/ethereum-xamarin/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bc12d24-7cb4-4709-82df-1d5cee0ac233>"
},
"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-165.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,
17,
18,
42,
523,
524,
754,
755,
789,
790,
943,
944,
1230,
1231,
1651,
1652,
2294,
2295,
2324,
2325,
2728,
2729,
3222,
3223,
3653,
3654,
3851,
3852,
3892,
3893,
4030,
4031,
4183,
4184,
4796,
4797,
5039,
5040,
5294,
5295
],
"line_end_idx": [
17,
18,
42,
523,
524,
754,
755,
789,
790,
943,
944,
1230,
1231,
1651,
1652,
2294,
2295,
2324,
2325,
2728,
2729,
3222,
3223,
3653,
3654,
3851,
3852,
3892,
3893,
4030,
4031,
4183,
4184,
4796,
4797,
5039,
5040,
5294,
5295,
5313
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5313,
"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.35566502809524536,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016748769208788872,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1940886676311493,
"rps_doc_frac_unique_words": 0.4969770312309265,
"rps_doc_mean_word_length": 5.226118564605713,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.418112277984619,
"rps_doc_word_count": 827,
"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.017815830186009407,
"rps_doc_frac_chars_top_3gram": 0.00902360025793314,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -380.3756103515625,
"rps_doc_books_importance_length_correction": -380.3756103515625,
"rps_doc_openwebtext_importance": -238.2735595703125,
"rps_doc_openwebtext_importance_length_correction": -238.2735595703125,
"rps_doc_wikipedia_importance": -193.1935272216797,
"rps_doc_wikipedia_importance_length_correction": -193.1935272216797
},
"fasttext": {
"dclm": 0.030348360538482666,
"english": 0.9542024731636047,
"fineweb_edu_approx": 1.6185415983200073,
"eai_general_math": 0.07164424657821655,
"eai_open_web_math": 0.1504969596862793,
"eai_web_code": 0.013551590032875538
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,571,542,658,360,879,600 |
pyats.cli package
Submodules
class pyats.cli.base.Command(prog)
Bases: pyats.cli.base._BaseCommand
Command class
Subclass this to implement a new command that can be used under CLI
error(msg)
api to raise an error to the user
main(argv)
internal entrypoint for commands
parse_args(argv)
run(args)
api to be implemented by the designer, performs the dirty work your command is designed to do
class pyats.cli.base.CommandWithSubcommands(*args, **kwargs)
Bases: pyats.cli.base.Command
CommandWithSubcommands class
Subclass this to implement a new command with subcommands under CLI
The difference between this and the Command() class is this class doesn’t directly perform actions - and defer actions to its subcommands.
SUBCMDS_BASECLS
alias of pyats.cli.base.Subcommand
SUBCMDS_ENTRYPOINT = None
SUBCOMMANDS = []
load_subcmds()
run(args)
api to be implemented by the designer, performs the dirty work your command is designed to do
usage = '{prog} <subcommand> [options]'
class pyats.cli.base.Subcommand(parent)
Bases: pyats.cli.base._BaseCommand
Subcommand class
defines a subcommand under under another command.
error(msg)
api to raise an error to the user
run(args)
runs this subcommand
class pyats.cli.core.CLI(prog='pyats', usage='pyats <command> [options]', epilog="\n Run 'pyats <command> --help' for more information on a command.\n", commands=None)
Bases: object
COMMANDS = []
COMMANDS_BASECLS
alias of pyats.cli.base.Command
COMMANDS_ENTRYPOINT = 'pyats.cli.commands'
configure_logging()
load_commands(commands=None)
main(argv=None)
CLI handler main entrypoint
class pyats.cli.formatter.CustomHelpFormatter(*args, **kwargs)
Bases: argparse.HelpFormatter
add_usage(usage, actions, groups, prefix='Usage:\n ')
usage: -> Usage:
class pyats.cli.parser.CustomParser(**kwargs)
Bases: argparse.ArgumentParser
error(message: string)
Prints a usage message incorporating the message to stderr and exits.
If you override this in a subclass, it should not return – it should either exit or raise an exception.
pyats.cli.utils.chunks(l, n)
Yield successive n-sized chunks from l.
pyats.cli.utils.cmd(command, cwd=None, env=None, incl_stderr=True)
Run a command and log its output as soon as it is produced.
pyats.cli.utils.cmd_timed(command, cwd=None, env=None, incl_stderr=True, timeout=None)
Run a command with an optional timeout. Log output after command done.
pyats.cli.utils.format_list(data, header=None, indent=2, columns=2)
pyats.cli.utils.format_table(data, header=None, indent=2)
formats a table nicely using header, data rows, and defaults to indenting to the right 2 spaces for looks.
pyats.cli.utils.tabulate(vals)
pyats.cli.utils.yes_or_no(question, default='')
|
{
"url": "https://pubhub.devnetcloud.com/media/pyats/docs/apidoc/core/index.html",
"source_domain": "pubhub.devnetcloud.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "33821",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5W4T3V3Q5PGAADW6J423XKU3HNDXMY7L",
"WARC-Concurrent-To": "<urn:uuid:d4d028fe-e360-45b2-a254-681f7f9d1bc2>",
"WARC-Date": "2021-12-08T18:45:28Z",
"WARC-IP-Address": "18.67.76.115",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JLLTSBGSYTGHD33RQPTULH4WB6N7LAT7",
"WARC-Record-ID": "<urn:uuid:99fbb5d4-e90f-4b3d-b329-7e77f7761a70>",
"WARC-Target-URI": "https://pubhub.devnetcloud.com/media/pyats/docs/apidoc/core/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7ccc76b4-62d6-4e2b-840c-884e08797217>"
},
"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-12\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,
18,
19,
30,
31,
66,
67,
102,
103,
117,
118,
186,
187,
198,
199,
233,
234,
245,
246,
279,
280,
297,
307,
308,
402,
403,
464,
465,
495,
496,
525,
526,
594,
595,
734,
735,
751,
752,
787,
788,
814,
831,
846,
856,
857,
951,
952,
992,
1032,
1033,
1068,
1069,
1086,
1087,
1137,
1138,
1149,
1150,
1184,
1185,
1195,
1196,
1217,
1218,
1389,
1390,
1404,
1405,
1419,
1436,
1437,
1469,
1470,
1513,
1533,
1562,
1578,
1579,
1607,
1608,
1671,
1672,
1702,
1703,
1758,
1759,
1776,
1777,
1823,
1824,
1855,
1856,
1879,
1880,
1950,
1951,
2055,
2056,
2085,
2086,
2126,
2127,
2194,
2195,
2255,
2256,
2343,
2344,
2415,
2416,
2484,
2542,
2543,
2650,
2651,
2682
],
"line_end_idx": [
18,
19,
30,
31,
66,
67,
102,
103,
117,
118,
186,
187,
198,
199,
233,
234,
245,
246,
279,
280,
297,
307,
308,
402,
403,
464,
465,
495,
496,
525,
526,
594,
595,
734,
735,
751,
752,
787,
788,
814,
831,
846,
856,
857,
951,
952,
992,
1032,
1033,
1068,
1069,
1086,
1087,
1137,
1138,
1149,
1150,
1184,
1185,
1195,
1196,
1217,
1218,
1389,
1390,
1404,
1405,
1419,
1436,
1437,
1469,
1470,
1513,
1533,
1562,
1578,
1579,
1607,
1608,
1671,
1672,
1702,
1703,
1758,
1759,
1776,
1777,
1823,
1824,
1855,
1856,
1879,
1880,
1950,
1951,
2055,
2056,
2085,
2086,
2126,
2127,
2194,
2195,
2255,
2256,
2343,
2344,
2415,
2416,
2484,
2542,
2543,
2650,
2651,
2682,
2729
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2729,
"ccnet_original_nlines": 115,
"rps_doc_curly_bracket": 0.0007328700157813728,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17944535613059998,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016313210129737854,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3425774872303009,
"rps_doc_frac_unique_words": 0.5463576316833496,
"rps_doc_mean_word_length": 6.986754894256592,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.787065505981445,
"rps_doc_word_count": 302,
"rps_doc_frac_chars_dupe_10grams": 0.07867299020290375,
"rps_doc_frac_chars_dupe_5grams": 0.14786730706691742,
"rps_doc_frac_chars_dupe_6grams": 0.14786730706691742,
"rps_doc_frac_chars_dupe_7grams": 0.14786730706691742,
"rps_doc_frac_chars_dupe_8grams": 0.14786730706691742,
"rps_doc_frac_chars_dupe_9grams": 0.11090046912431717,
"rps_doc_frac_chars_top_2gram": 0.009478669613599777,
"rps_doc_frac_chars_top_3gram": 0.01611373946070671,
"rps_doc_frac_chars_top_4gram": 0.018009480088949203,
"rps_doc_books_importance": -290.5196228027344,
"rps_doc_books_importance_length_correction": -290.5196228027344,
"rps_doc_openwebtext_importance": -158.4336700439453,
"rps_doc_openwebtext_importance_length_correction": -158.4336700439453,
"rps_doc_wikipedia_importance": -113.50146484375,
"rps_doc_wikipedia_importance_length_correction": -113.50146484375
},
"fasttext": {
"dclm": 0.1859939694404602,
"english": 0.6347470879554749,
"fineweb_edu_approx": 2.465998649597168,
"eai_general_math": 0.8262551426887512,
"eai_open_web_math": 0.05046861991286278,
"eai_web_code": 0.9912463426589966
}
}
|
{
"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.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
-1,018,463,936,429,437,800 |
PDA
View Full Version : querying canvas in mel
pk_pk
09-09-2005, 12:14 AM
hi,
i am querying a canvas for its hsv color but getting incorrect values. if i set a canvas' Hue value to "0", on query, 360 is returned. however, if the canvas' value is set to "0.0001", i do get the same value back. is this a bug? is there a work around. i think this is a wrapping issue but i would like to be able to use both 360 and 0 as valid Hue inputs?
thanks in advance
bigdovii
09-14-2005, 02:37 PM
it is often stated that the hue value goes from 0-360(cuz it in degrees) but 0-360 is 361degrees(go on count em) so like on an analogue clock (where 12 is the begining and end), 360 is the begining and end, so there is no zero, just 1-360. Just for interests sake why do you need to tell the diffence between a 1 degree change in colour temperature of red?
pk_pk
09-20-2005, 07:30 PM
thank you for the reply. i realize 0 and 360 represent the same space, but i need the query to return 0 because i'm building a range from it. so if i get back a 360 from the canvas query, then my range will be 360-360 when what i really want is 0-360.
and i cant assume a query that returns 360 is 0 because 360 is also a valid input for the range i'm creating.
CGTalk Moderation
09-20-2005, 07:30 PM
This thread has been automatically closed as it remained inactive for 12 months. If you wish to continue the discussion, please create a new thread in the appropriate forum.
|
{
"url": "http://forums.cgsociety.org/archive/index.php/t-275382.html",
"source_domain": "forums.cgsociety.org",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "5598",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OYWD562ZERULVF7KETNQ6KEORJ5XGCIZ",
"WARC-Concurrent-To": "<urn:uuid:23bd672f-5958-4fe4-b2fe-b3341603752c>",
"WARC-Date": "2014-04-20T01:10:10Z",
"WARC-IP-Address": "74.54.223.196",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:G73EHSL4EZFGMOLZ7SLA7XN22GYEBIKA",
"WARC-Record-ID": "<urn:uuid:36a203f5-5137-496d-82ae-bcc65e23b609>",
"WARC-Target-URI": "http://forums.cgsociety.org/archive/index.php/t-275382.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ff1d2f29-e6e1-43a1-9771-3db0cbf5c266>"
},
"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,
1,
5,
6,
49,
50,
51,
57,
78,
82,
83,
441,
442,
460,
461,
470,
491,
848,
849,
855,
876,
1128,
1129,
1239,
1240,
1258,
1279
],
"line_end_idx": [
1,
5,
6,
49,
50,
51,
57,
78,
82,
83,
441,
442,
460,
461,
470,
491,
848,
849,
855,
876,
1128,
1129,
1239,
1240,
1258,
1279,
1452
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1452,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44999998807907104,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01388888992369175,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2944444417953491,
"rps_doc_frac_unique_words": 0.5304659605026245,
"rps_doc_mean_word_length": 3.939068078994751,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.655154228210449,
"rps_doc_word_count": 279,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034576889127492905,
"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.01819835975766182,
"rps_doc_frac_chars_top_3gram": 0.023657869547605515,
"rps_doc_frac_chars_top_4gram": 0.02911737933754921,
"rps_doc_books_importance": -137.90089416503906,
"rps_doc_books_importance_length_correction": -133.53863525390625,
"rps_doc_openwebtext_importance": -77.32964324951172,
"rps_doc_openwebtext_importance_length_correction": -77.32964324951172,
"rps_doc_wikipedia_importance": -61.2826042175293,
"rps_doc_wikipedia_importance_length_correction": -52.62792205810547
},
"fasttext": {
"dclm": 0.025517819449305534,
"english": 0.9200373888015747,
"fineweb_edu_approx": 1.036960244178772,
"eai_general_math": 0.4420055150985718,
"eai_open_web_math": 0.4479767084121704,
"eai_web_code": 0.26352280378341675
}
}
|
{
"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": "741.2",
"labels": {
"level_1": "Arts",
"level_2": "Drawing, Decoration and ornament, and Design",
"level_3": "Drawing — Technique and Caricatures and cartoons"
}
}
},
"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": "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,200,694,557,793,206,800 |
Back to home page
LXR
0001 /*
0002 * S390 low-level entry points.
0003 *
0004 * Copyright IBM Corp. 1999, 2012
0005 * Author(s): Martin Schwidefsky ([email protected]),
0006 * Hartmut Penner ([email protected]),
0007 * Denis Joseph Barrow ([email protected],[email protected]),
0008 * Heiko Carstens <[email protected]>
0009 */
0010
0011 #include <linux/init.h>
0012 #include <linux/linkage.h>
0013 #include <asm/processor.h>
0014 #include <asm/cache.h>
0015 #include <asm/errno.h>
0016 #include <asm/ptrace.h>
0017 #include <asm/thread_info.h>
0018 #include <asm/asm-offsets.h>
0019 #include <asm/unistd.h>
0020 #include <asm/page.h>
0021 #include <asm/sigp.h>
0022 #include <asm/irq.h>
0023 #include <asm/vx-insn.h>
0024 #include <asm/setup.h>
0025 #include <asm/nmi.h>
0026 #include <asm/export.h>
0027
0028 __PT_R0 = __PT_GPRS
0029 __PT_R1 = __PT_GPRS + 8
0030 __PT_R2 = __PT_GPRS + 16
0031 __PT_R3 = __PT_GPRS + 24
0032 __PT_R4 = __PT_GPRS + 32
0033 __PT_R5 = __PT_GPRS + 40
0034 __PT_R6 = __PT_GPRS + 48
0035 __PT_R7 = __PT_GPRS + 56
0036 __PT_R8 = __PT_GPRS + 64
0037 __PT_R9 = __PT_GPRS + 72
0038 __PT_R10 = __PT_GPRS + 80
0039 __PT_R11 = __PT_GPRS + 88
0040 __PT_R12 = __PT_GPRS + 96
0041 __PT_R13 = __PT_GPRS + 104
0042 __PT_R14 = __PT_GPRS + 112
0043 __PT_R15 = __PT_GPRS + 120
0044
0045 STACK_SHIFT = PAGE_SHIFT + THREAD_SIZE_ORDER
0046 STACK_SIZE = 1 << STACK_SHIFT
0047 STACK_INIT = STACK_SIZE - STACK_FRAME_OVERHEAD - __PT_SIZE
0048
0049 _TIF_WORK = (_TIF_SIGPENDING | _TIF_NOTIFY_RESUME | _TIF_NEED_RESCHED | \
0050 _TIF_UPROBE)
0051 _TIF_TRACE = (_TIF_SYSCALL_TRACE | _TIF_SYSCALL_AUDIT | _TIF_SECCOMP | \
0052 _TIF_SYSCALL_TRACEPOINT)
0053 _CIF_WORK = (_CIF_MCCK_PENDING | _CIF_ASCE | _CIF_FPU)
0054 _PIF_WORK = (_PIF_PER_TRAP)
0055
0056 #define BASED(name) name-cleanup_critical(%r13)
0057
0058 .macro TRACE_IRQS_ON
0059 #ifdef CONFIG_TRACE_IRQFLAGS
0060 basr %r2,%r0
0061 brasl %r14,trace_hardirqs_on_caller
0062 #endif
0063 .endm
0064
0065 .macro TRACE_IRQS_OFF
0066 #ifdef CONFIG_TRACE_IRQFLAGS
0067 basr %r2,%r0
0068 brasl %r14,trace_hardirqs_off_caller
0069 #endif
0070 .endm
0071
0072 .macro LOCKDEP_SYS_EXIT
0073 #ifdef CONFIG_LOCKDEP
0074 tm __PT_PSW+1(%r11),0x01 # returning to user ?
0075 jz .+10
0076 brasl %r14,lockdep_sys_exit
0077 #endif
0078 .endm
0079
0080 .macro CHECK_STACK stacksize,savearea
0081 #ifdef CONFIG_CHECK_STACK
0082 tml %r15,\stacksize - CONFIG_STACK_GUARD
0083 lghi %r14,\savearea
0084 jz stack_overflow
0085 #endif
0086 .endm
0087
0088 .macro SWITCH_ASYNC savearea,timer
0089 tmhh %r8,0x0001 # interrupting from user ?
0090 jnz 1f
0091 lgr %r14,%r9
0092 slg %r14,BASED(.Lcritical_start)
0093 clg %r14,BASED(.Lcritical_length)
0094 jhe 0f
0095 lghi %r11,\savearea # inside critical section, do cleanup
0096 brasl %r14,cleanup_critical
0097 tmhh %r8,0x0001 # retest problem state after cleanup
0098 jnz 1f
0099 0: lg %r14,__LC_ASYNC_STACK # are we already on the async stack?
0100 slgr %r14,%r15
0101 srag %r14,%r14,STACK_SHIFT
0102 jnz 2f
0103 CHECK_STACK 1<<STACK_SHIFT,\savearea
0104 aghi %r15,-(STACK_FRAME_OVERHEAD + __PT_SIZE)
0105 j 3f
0106 1: LAST_BREAK %r14
0107 UPDATE_VTIME %r14,%r15,\timer
0108 2: lg %r15,__LC_ASYNC_STACK # load async stack
0109 3: la %r11,STACK_FRAME_OVERHEAD(%r15)
0110 .endm
0111
0112 .macro UPDATE_VTIME w1,w2,enter_timer
0113 lg \w1,__LC_EXIT_TIMER
0114 lg \w2,__LC_LAST_UPDATE_TIMER
0115 slg \w1,\enter_timer
0116 slg \w2,__LC_EXIT_TIMER
0117 alg \w1,__LC_USER_TIMER
0118 alg \w2,__LC_SYSTEM_TIMER
0119 stg \w1,__LC_USER_TIMER
0120 stg \w2,__LC_SYSTEM_TIMER
0121 mvc __LC_LAST_UPDATE_TIMER(8),\enter_timer
0122 .endm
0123
0124 .macro LAST_BREAK scratch
0125 srag \scratch,%r10,23
0126 #ifdef CONFIG_HAVE_MARCH_Z990_FEATURES
0127 jz .+10
0128 stg %r10,__TASK_thread+__THREAD_last_break(%r12)
0129 #else
0130 jz .+14
0131 lghi \scratch,__TASK_thread
0132 stg %r10,__THREAD_last_break(\scratch,%r12)
0133 #endif
0134 .endm
0135
0136 .macro REENABLE_IRQS
0137 stg %r8,__LC_RETURN_PSW
0138 ni __LC_RETURN_PSW,0xbf
0139 ssm __LC_RETURN_PSW
0140 .endm
0141
0142 .macro STCK savearea
0143 #ifdef CONFIG_HAVE_MARCH_Z9_109_FEATURES
0144 .insn s,0xb27c0000,\savearea # store clock fast
0145 #else
0146 .insn s,0xb2050000,\savearea # store clock
0147 #endif
0148 .endm
0149
0150 /*
0151 * The TSTMSK macro generates a test-under-mask instruction by
0152 * calculating the memory offset for the specified mask value.
0153 * Mask value can be any constant. The macro shifts the mask
0154 * value to calculate the memory offset for the test-under-mask
0155 * instruction.
0156 */
0157 .macro TSTMSK addr, mask, size=8, bytepos=0
0158 .if (\bytepos < \size) && (\mask >> 8)
0159 .if (\mask & 0xff)
0160 .error "Mask exceeds byte boundary"
0161 .endif
0162 TSTMSK \addr, "(\mask >> 8)", \size, "(\bytepos + 1)"
0163 .exitm
0164 .endif
0165 .ifeq \mask
0166 .error "Mask must not be zero"
0167 .endif
0168 off = \size - \bytepos - 1
0169 tm off+\addr, \mask
0170 .endm
0171
0172 .section .kprobes.text, "ax"
0173 .Ldummy:
0174 /*
0175 * This nop exists only in order to avoid that __switch_to starts at
0176 * the beginning of the kprobes text section. In that case we would
0177 * have several symbols at the same address. E.g. objdump would take
0178 * an arbitrary symbol name when disassembling this code.
0179 * With the added nop in between the __switch_to symbol is unique
0180 * again.
0181 */
0182 nop 0
0183
0184 /*
0185 * Scheduler resume function, called by switch_to
0186 * gpr2 = (task_struct *) prev
0187 * gpr3 = (task_struct *) next
0188 * Returns:
0189 * gpr2 = prev
0190 */
0191 ENTRY(__switch_to)
0192 stmg %r6,%r15,__SF_GPRS(%r15) # store gprs of prev task
0193 lgr %r1,%r2
0194 aghi %r1,__TASK_thread # thread_struct of prev task
0195 lg %r5,__TASK_stack(%r3) # start of kernel stack of next
0196 stg %r15,__THREAD_ksp(%r1) # store kernel stack of prev
0197 lgr %r1,%r3
0198 aghi %r1,__TASK_thread # thread_struct of next task
0199 lgr %r15,%r5
0200 aghi %r15,STACK_INIT # end of kernel stack of next
0201 stg %r3,__LC_CURRENT # store task struct of next
0202 stg %r15,__LC_KERNEL_STACK # store end of kernel stack
0203 lg %r15,__THREAD_ksp(%r1) # load kernel stack of next
0204 /* c4 is used in guest detection: arch/s390/kernel/perf_cpum_sf.c */
0205 lctl %c4,%c4,__TASK_pid(%r3) # load pid to control reg. 4
0206 mvc __LC_CURRENT_PID(4,%r0),__TASK_pid(%r3) # store pid of next
0207 lmg %r6,%r15,__SF_GPRS(%r15) # load gprs of next task
0208 TSTMSK __LC_MACHINE_FLAGS,MACHINE_FLAG_LPP
0209 bzr %r14
0210 .insn s,0xb2800000,__LC_LPP # set program parameter
0211 br %r14
0212
0213 .L__critical_start:
0214
0215 #if IS_ENABLED(CONFIG_KVM)
0216 /*
0217 * sie64a calling convention:
0218 * %r2 pointer to sie control block
0219 * %r3 guest register save area
0220 */
0221 ENTRY(sie64a)
0222 stmg %r6,%r14,__SF_GPRS(%r15) # save kernel registers
0223 stg %r2,__SF_EMPTY(%r15) # save control block pointer
0224 stg %r3,__SF_EMPTY+8(%r15) # save guest register save area
0225 xc __SF_EMPTY+16(8,%r15),__SF_EMPTY+16(%r15) # reason code = 0
0226 TSTMSK __LC_CPU_FLAGS,_CIF_FPU # load guest fp/vx registers ?
0227 jno .Lsie_load_guest_gprs
0228 brasl %r14,load_fpu_regs # load guest fp/vx regs
0229 .Lsie_load_guest_gprs:
0230 lmg %r0,%r13,0(%r3) # load guest gprs 0-13
0231 lg %r14,__LC_GMAP # get gmap pointer
0232 ltgr %r14,%r14
0233 jz .Lsie_gmap
0234 lctlg %c1,%c1,__GMAP_ASCE(%r14) # load primary asce
0235 .Lsie_gmap:
0236 lg %r14,__SF_EMPTY(%r15) # get control block pointer
0237 oi __SIE_PROG0C+3(%r14),1 # we are going into SIE now
0238 tm __SIE_PROG20+3(%r14),3 # last exit...
0239 jnz .Lsie_skip
0240 TSTMSK __LC_CPU_FLAGS,_CIF_FPU
0241 jo .Lsie_skip # exit if fp/vx regs changed
0242 sie 0(%r14)
0243 .Lsie_skip:
0244 ni __SIE_PROG0C+3(%r14),0xfe # no longer in SIE
0245 lctlg %c1,%c1,__LC_USER_ASCE # load primary asce
0246 .Lsie_done:
0247 # some program checks are suppressing. C code (e.g. do_protection_exception)
0248 # will rewind the PSW by the ILC, which is 4 bytes in case of SIE. Other
0249 # instructions between sie64a and .Lsie_done should not cause program
0250 # interrupts. So lets use a nop (47 00 00 00) as a landing pad.
0251 # See also .Lcleanup_sie
0252 .Lrewind_pad:
0253 nop 0
0254 .globl sie_exit
0255 sie_exit:
0256 lg %r14,__SF_EMPTY+8(%r15) # load guest register save area
0257 stmg %r0,%r13,0(%r14) # save guest gprs 0-13
0258 lmg %r6,%r14,__SF_GPRS(%r15) # restore kernel registers
0259 lg %r2,__SF_EMPTY+16(%r15) # return exit reason code
0260 br %r14
0261 .Lsie_fault:
0262 lghi %r14,-EFAULT
0263 stg %r14,__SF_EMPTY+16(%r15) # set exit reason code
0264 j sie_exit
0265
0266 EX_TABLE(.Lrewind_pad,.Lsie_fault)
0267 EX_TABLE(sie_exit,.Lsie_fault)
0268 EXPORT_SYMBOL(sie64a)
0269 EXPORT_SYMBOL(sie_exit)
0270 #endif
0271
0272 /*
0273 * SVC interrupt handler routine. System calls are synchronous events and
0274 * are executed with interrupts enabled.
0275 */
0276
0277 ENTRY(system_call)
0278 stpt __LC_SYNC_ENTER_TIMER
0279 .Lsysc_stmg:
0280 stmg %r8,%r15,__LC_SAVE_AREA_SYNC
0281 lg %r10,__LC_LAST_BREAK
0282 lg %r12,__LC_CURRENT
0283 lghi %r14,_PIF_SYSCALL
0284 .Lsysc_per:
0285 lg %r15,__LC_KERNEL_STACK
0286 la %r11,STACK_FRAME_OVERHEAD(%r15) # pointer to pt_regs
0287 LAST_BREAK %r13
0288 .Lsysc_vtime:
0289 UPDATE_VTIME %r10,%r13,__LC_SYNC_ENTER_TIMER
0290 stmg %r0,%r7,__PT_R0(%r11)
0291 mvc __PT_R8(64,%r11),__LC_SAVE_AREA_SYNC
0292 mvc __PT_PSW(16,%r11),__LC_SVC_OLD_PSW
0293 mvc __PT_INT_CODE(4,%r11),__LC_SVC_ILC
0294 stg %r14,__PT_FLAGS(%r11)
0295 .Lsysc_do_svc:
0296 # load address of system call table
0297 #ifdef CONFIG_HAVE_MARCH_Z990_FEATURES
0298 lg %r10,__TASK_thread+__THREAD_sysc_table(%r12)
0299 #else
0300 lghi %r13,__TASK_thread
0301 lg %r10,__THREAD_sysc_table(%r13,%r12)
0302 #endif
0303 llgh %r8,__PT_INT_CODE+2(%r11)
0304 slag %r8,%r8,2 # shift and test for svc 0
0305 jnz .Lsysc_nr_ok
0306 # svc 0: system call number in %r1
0307 llgfr %r1,%r1 # clear high word in r1
0308 cghi %r1,NR_syscalls
0309 jnl .Lsysc_nr_ok
0310 sth %r1,__PT_INT_CODE+2(%r11)
0311 slag %r8,%r1,2
0312 .Lsysc_nr_ok:
0313 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0314 stg %r2,__PT_ORIG_GPR2(%r11)
0315 stg %r7,STACK_FRAME_OVERHEAD(%r15)
0316 lgf %r9,0(%r8,%r10) # get system call add.
0317 TSTMSK __TI_flags(%r12),_TIF_TRACE
0318 jnz .Lsysc_tracesys
0319 basr %r14,%r9 # call sys_xxxx
0320 stg %r2,__PT_R2(%r11) # store return value
0321
0322 .Lsysc_return:
0323 LOCKDEP_SYS_EXIT
0324 .Lsysc_tif:
0325 TSTMSK __PT_FLAGS(%r11),_PIF_WORK
0326 jnz .Lsysc_work
0327 TSTMSK __TI_flags(%r12),_TIF_WORK
0328 jnz .Lsysc_work # check for work
0329 TSTMSK __LC_CPU_FLAGS,_CIF_WORK
0330 jnz .Lsysc_work
0331 .Lsysc_restore:
0332 lg %r14,__LC_VDSO_PER_CPU
0333 lmg %r0,%r10,__PT_R0(%r11)
0334 mvc __LC_RETURN_PSW(16),__PT_PSW(%r11)
0335 stpt __LC_EXIT_TIMER
0336 mvc __VDSO_ECTG_BASE(16,%r14),__LC_EXIT_TIMER
0337 lmg %r11,%r15,__PT_R11(%r11)
0338 lpswe __LC_RETURN_PSW
0339 .Lsysc_done:
0340
0341 #
0342 # One of the work bits is on. Find out which one.
0343 #
0344 .Lsysc_work:
0345 TSTMSK __LC_CPU_FLAGS,_CIF_MCCK_PENDING
0346 jo .Lsysc_mcck_pending
0347 TSTMSK __TI_flags(%r12),_TIF_NEED_RESCHED
0348 jo .Lsysc_reschedule
0349 #ifdef CONFIG_UPROBES
0350 TSTMSK __TI_flags(%r12),_TIF_UPROBE
0351 jo .Lsysc_uprobe_notify
0352 #endif
0353 TSTMSK __PT_FLAGS(%r11),_PIF_PER_TRAP
0354 jo .Lsysc_singlestep
0355 TSTMSK __TI_flags(%r12),_TIF_SIGPENDING
0356 jo .Lsysc_sigpending
0357 TSTMSK __TI_flags(%r12),_TIF_NOTIFY_RESUME
0358 jo .Lsysc_notify_resume
0359 TSTMSK __LC_CPU_FLAGS,_CIF_FPU
0360 jo .Lsysc_vxrs
0361 TSTMSK __LC_CPU_FLAGS,_CIF_ASCE
0362 jo .Lsysc_uaccess
0363 j .Lsysc_return # beware of critical section cleanup
0364
0365 #
0366 # _TIF_NEED_RESCHED is set, call schedule
0367 #
0368 .Lsysc_reschedule:
0369 larl %r14,.Lsysc_return
0370 jg schedule
0371
0372 #
0373 # _CIF_MCCK_PENDING is set, call handler
0374 #
0375 .Lsysc_mcck_pending:
0376 larl %r14,.Lsysc_return
0377 jg s390_handle_mcck # TIF bit will be cleared by handler
0378
0379 #
0380 # _CIF_ASCE is set, load user space asce
0381 #
0382 .Lsysc_uaccess:
0383 ni __LC_CPU_FLAGS+7,255-_CIF_ASCE
0384 lctlg %c1,%c1,__LC_USER_ASCE # load primary asce
0385 j .Lsysc_return
0386
0387 #
0388 # CIF_FPU is set, restore floating-point controls and floating-point registers.
0389 #
0390 .Lsysc_vxrs:
0391 larl %r14,.Lsysc_return
0392 jg load_fpu_regs
0393
0394 #
0395 # _TIF_SIGPENDING is set, call do_signal
0396 #
0397 .Lsysc_sigpending:
0398 lgr %r2,%r11 # pass pointer to pt_regs
0399 brasl %r14,do_signal
0400 TSTMSK __PT_FLAGS(%r11),_PIF_SYSCALL
0401 jno .Lsysc_return
0402 lmg %r2,%r7,__PT_R2(%r11) # load svc arguments
0403 lghi %r8,0 # svc 0 returns -ENOSYS
0404 llgh %r1,__PT_INT_CODE+2(%r11) # load new svc number
0405 cghi %r1,NR_syscalls
0406 jnl .Lsysc_nr_ok # invalid svc number -> do svc 0
0407 slag %r8,%r1,2
0408 j .Lsysc_nr_ok # restart svc
0409
0410 #
0411 # _TIF_NOTIFY_RESUME is set, call do_notify_resume
0412 #
0413 .Lsysc_notify_resume:
0414 lgr %r2,%r11 # pass pointer to pt_regs
0415 larl %r14,.Lsysc_return
0416 jg do_notify_resume
0417
0418 #
0419 # _TIF_UPROBE is set, call uprobe_notify_resume
0420 #
0421 #ifdef CONFIG_UPROBES
0422 .Lsysc_uprobe_notify:
0423 lgr %r2,%r11 # pass pointer to pt_regs
0424 larl %r14,.Lsysc_return
0425 jg uprobe_notify_resume
0426 #endif
0427
0428 #
0429 # _PIF_PER_TRAP is set, call do_per_trap
0430 #
0431 .Lsysc_singlestep:
0432 ni __PT_FLAGS+7(%r11),255-_PIF_PER_TRAP
0433 lgr %r2,%r11 # pass pointer to pt_regs
0434 larl %r14,.Lsysc_return
0435 jg do_per_trap
0436
0437 #
0438 # call tracehook_report_syscall_entry/tracehook_report_syscall_exit before
0439 # and after the system call
0440 #
0441 .Lsysc_tracesys:
0442 lgr %r2,%r11 # pass pointer to pt_regs
0443 la %r3,0
0444 llgh %r0,__PT_INT_CODE+2(%r11)
0445 stg %r0,__PT_R2(%r11)
0446 brasl %r14,do_syscall_trace_enter
0447 lghi %r0,NR_syscalls
0448 clgr %r0,%r2
0449 jnh .Lsysc_tracenogo
0450 sllg %r8,%r2,2
0451 lgf %r9,0(%r8,%r10)
0452 .Lsysc_tracego:
0453 lmg %r3,%r7,__PT_R3(%r11)
0454 stg %r7,STACK_FRAME_OVERHEAD(%r15)
0455 lg %r2,__PT_ORIG_GPR2(%r11)
0456 basr %r14,%r9 # call sys_xxx
0457 stg %r2,__PT_R2(%r11) # store return value
0458 .Lsysc_tracenogo:
0459 TSTMSK __TI_flags(%r12),_TIF_TRACE
0460 jz .Lsysc_return
0461 lgr %r2,%r11 # pass pointer to pt_regs
0462 larl %r14,.Lsysc_return
0463 jg do_syscall_trace_exit
0464
0465 #
0466 # a new process exits the kernel with ret_from_fork
0467 #
0468 ENTRY(ret_from_fork)
0469 la %r11,STACK_FRAME_OVERHEAD(%r15)
0470 lg %r12,__LC_CURRENT
0471 brasl %r14,schedule_tail
0472 TRACE_IRQS_ON
0473 ssm __LC_SVC_NEW_PSW # reenable interrupts
0474 tm __PT_PSW+1(%r11),0x01 # forking a kernel thread ?
0475 jne .Lsysc_tracenogo
0476 # it's a kernel thread
0477 lmg %r9,%r10,__PT_R9(%r11) # load gprs
0478 ENTRY(kernel_thread_starter)
0479 la %r2,0(%r10)
0480 basr %r14,%r9
0481 j .Lsysc_tracenogo
0482
0483 /*
0484 * Program check handler routine
0485 */
0486
0487 ENTRY(pgm_check_handler)
0488 stpt __LC_SYNC_ENTER_TIMER
0489 stmg %r8,%r15,__LC_SAVE_AREA_SYNC
0490 lg %r10,__LC_LAST_BREAK
0491 lg %r12,__LC_CURRENT
0492 larl %r13,cleanup_critical
0493 lmg %r8,%r9,__LC_PGM_OLD_PSW
0494 tmhh %r8,0x0001 # test problem state bit
0495 jnz 2f # -> fault in user space
0496 #if IS_ENABLED(CONFIG_KVM)
0497 # cleanup critical section for sie64a
0498 lgr %r14,%r9
0499 slg %r14,BASED(.Lsie_critical_start)
0500 clg %r14,BASED(.Lsie_critical_length)
0501 jhe 0f
0502 brasl %r14,.Lcleanup_sie
0503 #endif
0504 0: tmhh %r8,0x4000 # PER bit set in old PSW ?
0505 jnz 1f # -> enabled, can't be a double fault
0506 tm __LC_PGM_ILC+3,0x80 # check for per exception
0507 jnz .Lpgm_svcper # -> single stepped svc
0508 1: CHECK_STACK STACK_SIZE,__LC_SAVE_AREA_SYNC
0509 aghi %r15,-(STACK_FRAME_OVERHEAD + __PT_SIZE)
0510 j 3f
0511 2: LAST_BREAK %r14
0512 UPDATE_VTIME %r14,%r15,__LC_SYNC_ENTER_TIMER
0513 lg %r15,__LC_KERNEL_STACK
0514 lgr %r14,%r12
0515 aghi %r14,__TASK_thread # pointer to thread_struct
0516 lghi %r13,__LC_PGM_TDB
0517 tm __LC_PGM_ILC+2,0x02 # check for transaction abort
0518 jz 3f
0519 mvc __THREAD_trap_tdb(256,%r14),0(%r13)
0520 3: la %r11,STACK_FRAME_OVERHEAD(%r15)
0521 stmg %r0,%r7,__PT_R0(%r11)
0522 mvc __PT_R8(64,%r11),__LC_SAVE_AREA_SYNC
0523 stmg %r8,%r9,__PT_PSW(%r11)
0524 mvc __PT_INT_CODE(4,%r11),__LC_PGM_ILC
0525 mvc __PT_INT_PARM_LONG(8,%r11),__LC_TRANS_EXC_CODE
0526 xc __PT_FLAGS(8,%r11),__PT_FLAGS(%r11)
0527 stg %r10,__PT_ARGS(%r11)
0528 tm __LC_PGM_ILC+3,0x80 # check for per exception
0529 jz 4f
0530 tmhh %r8,0x0001 # kernel per event ?
0531 jz .Lpgm_kprobe
0532 oi __PT_FLAGS+7(%r11),_PIF_PER_TRAP
0533 mvc __THREAD_per_address(8,%r14),__LC_PER_ADDRESS
0534 mvc __THREAD_per_cause(2,%r14),__LC_PER_CODE
0535 mvc __THREAD_per_paid(1,%r14),__LC_PER_ACCESS_ID
0536 4: REENABLE_IRQS
0537 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0538 larl %r1,pgm_check_table
0539 llgh %r10,__PT_INT_CODE+2(%r11)
0540 nill %r10,0x007f
0541 sll %r10,2
0542 je .Lpgm_return
0543 lgf %r1,0(%r10,%r1) # load address of handler routine
0544 lgr %r2,%r11 # pass pointer to pt_regs
0545 basr %r14,%r1 # branch to interrupt-handler
0546 .Lpgm_return:
0547 LOCKDEP_SYS_EXIT
0548 tm __PT_PSW+1(%r11),0x01 # returning to user ?
0549 jno .Lsysc_restore
0550 j .Lsysc_tif
0551
0552 #
0553 # PER event in supervisor state, must be kprobes
0554 #
0555 .Lpgm_kprobe:
0556 REENABLE_IRQS
0557 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0558 lgr %r2,%r11 # pass pointer to pt_regs
0559 brasl %r14,do_per_trap
0560 j .Lpgm_return
0561
0562 #
0563 # single stepped system call
0564 #
0565 .Lpgm_svcper:
0566 mvc __LC_RETURN_PSW(8),__LC_SVC_NEW_PSW
0567 larl %r14,.Lsysc_per
0568 stg %r14,__LC_RETURN_PSW+8
0569 lghi %r14,_PIF_SYSCALL | _PIF_PER_TRAP
0570 lpswe __LC_RETURN_PSW # branch to .Lsysc_per and enable irqs
0571
0572 /*
0573 * IO interrupt handler routine
0574 */
0575 ENTRY(io_int_handler)
0576 STCK __LC_INT_CLOCK
0577 stpt __LC_ASYNC_ENTER_TIMER
0578 stmg %r8,%r15,__LC_SAVE_AREA_ASYNC
0579 lg %r10,__LC_LAST_BREAK
0580 lg %r12,__LC_CURRENT
0581 larl %r13,cleanup_critical
0582 lmg %r8,%r9,__LC_IO_OLD_PSW
0583 SWITCH_ASYNC __LC_SAVE_AREA_ASYNC,__LC_ASYNC_ENTER_TIMER
0584 stmg %r0,%r7,__PT_R0(%r11)
0585 mvc __PT_R8(64,%r11),__LC_SAVE_AREA_ASYNC
0586 stmg %r8,%r9,__PT_PSW(%r11)
0587 mvc __PT_INT_CODE(12,%r11),__LC_SUBCHANNEL_ID
0588 xc __PT_FLAGS(8,%r11),__PT_FLAGS(%r11)
0589 TSTMSK __LC_CPU_FLAGS,_CIF_IGNORE_IRQ
0590 jo .Lio_restore
0591 TRACE_IRQS_OFF
0592 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0593 .Lio_loop:
0594 lgr %r2,%r11 # pass pointer to pt_regs
0595 lghi %r3,IO_INTERRUPT
0596 tm __PT_INT_CODE+8(%r11),0x80 # adapter interrupt ?
0597 jz .Lio_call
0598 lghi %r3,THIN_INTERRUPT
0599 .Lio_call:
0600 brasl %r14,do_IRQ
0601 TSTMSK __LC_MACHINE_FLAGS,MACHINE_FLAG_LPAR
0602 jz .Lio_return
0603 tpi 0
0604 jz .Lio_return
0605 mvc __PT_INT_CODE(12,%r11),__LC_SUBCHANNEL_ID
0606 j .Lio_loop
0607 .Lio_return:
0608 LOCKDEP_SYS_EXIT
0609 TRACE_IRQS_ON
0610 .Lio_tif:
0611 TSTMSK __TI_flags(%r12),_TIF_WORK
0612 jnz .Lio_work # there is work to do (signals etc.)
0613 TSTMSK __LC_CPU_FLAGS,_CIF_WORK
0614 jnz .Lio_work
0615 .Lio_restore:
0616 lg %r14,__LC_VDSO_PER_CPU
0617 lmg %r0,%r10,__PT_R0(%r11)
0618 mvc __LC_RETURN_PSW(16),__PT_PSW(%r11)
0619 stpt __LC_EXIT_TIMER
0620 mvc __VDSO_ECTG_BASE(16,%r14),__LC_EXIT_TIMER
0621 lmg %r11,%r15,__PT_R11(%r11)
0622 lpswe __LC_RETURN_PSW
0623 .Lio_done:
0624
0625 #
0626 # There is work todo, find out in which context we have been interrupted:
0627 # 1) if we return to user space we can do all _TIF_WORK work
0628 # 2) if we return to kernel code and kvm is enabled check if we need to
0629 # modify the psw to leave SIE
0630 # 3) if we return to kernel code and preemptive scheduling is enabled check
0631 # the preemption counter and if it is zero call preempt_schedule_irq
0632 # Before any work can be done, a switch to the kernel stack is required.
0633 #
0634 .Lio_work:
0635 tm __PT_PSW+1(%r11),0x01 # returning to user ?
0636 jo .Lio_work_user # yes -> do resched & signal
0637 #ifdef CONFIG_PREEMPT
0638 # check for preemptive scheduling
0639 icm %r0,15,__LC_PREEMPT_COUNT
0640 jnz .Lio_restore # preemption is disabled
0641 TSTMSK __TI_flags(%r12),_TIF_NEED_RESCHED
0642 jno .Lio_restore
0643 # switch to kernel stack
0644 lg %r1,__PT_R15(%r11)
0645 aghi %r1,-(STACK_FRAME_OVERHEAD + __PT_SIZE)
0646 mvc STACK_FRAME_OVERHEAD(__PT_SIZE,%r1),0(%r11)
0647 xc __SF_BACKCHAIN(8,%r1),__SF_BACKCHAIN(%r1)
0648 la %r11,STACK_FRAME_OVERHEAD(%r1)
0649 lgr %r15,%r1
0650 # TRACE_IRQS_ON already done at .Lio_return, call
0651 # TRACE_IRQS_OFF to keep things symmetrical
0652 TRACE_IRQS_OFF
0653 brasl %r14,preempt_schedule_irq
0654 j .Lio_return
0655 #else
0656 j .Lio_restore
0657 #endif
0658
0659 #
0660 # Need to do work before returning to userspace, switch to kernel stack
0661 #
0662 .Lio_work_user:
0663 lg %r1,__LC_KERNEL_STACK
0664 mvc STACK_FRAME_OVERHEAD(__PT_SIZE,%r1),0(%r11)
0665 xc __SF_BACKCHAIN(8,%r1),__SF_BACKCHAIN(%r1)
0666 la %r11,STACK_FRAME_OVERHEAD(%r1)
0667 lgr %r15,%r1
0668
0669 #
0670 # One of the work bits is on. Find out which one.
0671 #
0672 .Lio_work_tif:
0673 TSTMSK __LC_CPU_FLAGS,_CIF_MCCK_PENDING
0674 jo .Lio_mcck_pending
0675 TSTMSK __TI_flags(%r12),_TIF_NEED_RESCHED
0676 jo .Lio_reschedule
0677 TSTMSK __TI_flags(%r12),_TIF_SIGPENDING
0678 jo .Lio_sigpending
0679 TSTMSK __TI_flags(%r12),_TIF_NOTIFY_RESUME
0680 jo .Lio_notify_resume
0681 TSTMSK __LC_CPU_FLAGS,_CIF_FPU
0682 jo .Lio_vxrs
0683 TSTMSK __LC_CPU_FLAGS,_CIF_ASCE
0684 jo .Lio_uaccess
0685 j .Lio_return # beware of critical section cleanup
0686
0687 #
0688 # _CIF_MCCK_PENDING is set, call handler
0689 #
0690 .Lio_mcck_pending:
0691 # TRACE_IRQS_ON already done at .Lio_return
0692 brasl %r14,s390_handle_mcck # TIF bit will be cleared by handler
0693 TRACE_IRQS_OFF
0694 j .Lio_return
0695
0696 #
0697 # _CIF_ASCE is set, load user space asce
0698 #
0699 .Lio_uaccess:
0700 ni __LC_CPU_FLAGS+7,255-_CIF_ASCE
0701 lctlg %c1,%c1,__LC_USER_ASCE # load primary asce
0702 j .Lio_return
0703
0704 #
0705 # CIF_FPU is set, restore floating-point controls and floating-point registers.
0706 #
0707 .Lio_vxrs:
0708 larl %r14,.Lio_return
0709 jg load_fpu_regs
0710
0711 #
0712 # _TIF_NEED_RESCHED is set, call schedule
0713 #
0714 .Lio_reschedule:
0715 # TRACE_IRQS_ON already done at .Lio_return
0716 ssm __LC_SVC_NEW_PSW # reenable interrupts
0717 brasl %r14,schedule # call scheduler
0718 ssm __LC_PGM_NEW_PSW # disable I/O and ext. interrupts
0719 TRACE_IRQS_OFF
0720 j .Lio_return
0721
0722 #
0723 # _TIF_SIGPENDING or is set, call do_signal
0724 #
0725 .Lio_sigpending:
0726 # TRACE_IRQS_ON already done at .Lio_return
0727 ssm __LC_SVC_NEW_PSW # reenable interrupts
0728 lgr %r2,%r11 # pass pointer to pt_regs
0729 brasl %r14,do_signal
0730 ssm __LC_PGM_NEW_PSW # disable I/O and ext. interrupts
0731 TRACE_IRQS_OFF
0732 j .Lio_return
0733
0734 #
0735 # _TIF_NOTIFY_RESUME or is set, call do_notify_resume
0736 #
0737 .Lio_notify_resume:
0738 # TRACE_IRQS_ON already done at .Lio_return
0739 ssm __LC_SVC_NEW_PSW # reenable interrupts
0740 lgr %r2,%r11 # pass pointer to pt_regs
0741 brasl %r14,do_notify_resume
0742 ssm __LC_PGM_NEW_PSW # disable I/O and ext. interrupts
0743 TRACE_IRQS_OFF
0744 j .Lio_return
0745
0746 /*
0747 * External interrupt handler routine
0748 */
0749 ENTRY(ext_int_handler)
0750 STCK __LC_INT_CLOCK
0751 stpt __LC_ASYNC_ENTER_TIMER
0752 stmg %r8,%r15,__LC_SAVE_AREA_ASYNC
0753 lg %r10,__LC_LAST_BREAK
0754 lg %r12,__LC_CURRENT
0755 larl %r13,cleanup_critical
0756 lmg %r8,%r9,__LC_EXT_OLD_PSW
0757 SWITCH_ASYNC __LC_SAVE_AREA_ASYNC,__LC_ASYNC_ENTER_TIMER
0758 stmg %r0,%r7,__PT_R0(%r11)
0759 mvc __PT_R8(64,%r11),__LC_SAVE_AREA_ASYNC
0760 stmg %r8,%r9,__PT_PSW(%r11)
0761 lghi %r1,__LC_EXT_PARAMS2
0762 mvc __PT_INT_CODE(4,%r11),__LC_EXT_CPU_ADDR
0763 mvc __PT_INT_PARM(4,%r11),__LC_EXT_PARAMS
0764 mvc __PT_INT_PARM_LONG(8,%r11),0(%r1)
0765 xc __PT_FLAGS(8,%r11),__PT_FLAGS(%r11)
0766 TSTMSK __LC_CPU_FLAGS,_CIF_IGNORE_IRQ
0767 jo .Lio_restore
0768 TRACE_IRQS_OFF
0769 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0770 lgr %r2,%r11 # pass pointer to pt_regs
0771 lghi %r3,EXT_INTERRUPT
0772 brasl %r14,do_IRQ
0773 j .Lio_return
0774
0775 /*
0776 * Load idle PSW. The second "half" of this function is in .Lcleanup_idle.
0777 */
0778 ENTRY(psw_idle)
0779 stg %r3,__SF_EMPTY(%r15)
0780 larl %r1,.Lpsw_idle_lpsw+4
0781 stg %r1,__SF_EMPTY+8(%r15)
0782 #ifdef CONFIG_SMP
0783 larl %r1,smp_cpu_mtid
0784 llgf %r1,0(%r1)
0785 ltgr %r1,%r1
0786 jz .Lpsw_idle_stcctm
0787 .insn rsy,0xeb0000000017,%r1,5,__SF_EMPTY+16(%r15)
0788 .Lpsw_idle_stcctm:
0789 #endif
0790 oi __LC_CPU_FLAGS+7,_CIF_ENABLED_WAIT
0791 STCK __CLOCK_IDLE_ENTER(%r2)
0792 stpt __TIMER_IDLE_ENTER(%r2)
0793 .Lpsw_idle_lpsw:
0794 lpswe __SF_EMPTY(%r15)
0795 br %r14
0796 .Lpsw_idle_end:
0797
0798 /*
0799 * Store floating-point controls and floating-point or vector register
0800 * depending whether the vector facility is available. A critical section
0801 * cleanup assures that the registers are stored even if interrupted for
0802 * some other work. The CIF_FPU flag is set to trigger a lazy restore
0803 * of the register contents at return from io or a system call.
0804 */
0805 ENTRY(save_fpu_regs)
0806 lg %r2,__LC_CURRENT
0807 aghi %r2,__TASK_thread
0808 TSTMSK __LC_CPU_FLAGS,_CIF_FPU
0809 bor %r14
0810 stfpc __THREAD_FPU_fpc(%r2)
0811 lg %r3,__THREAD_FPU_regs(%r2)
0812 TSTMSK __LC_MACHINE_FLAGS,MACHINE_FLAG_VX
0813 jz .Lsave_fpu_regs_fp # no -> store FP regs
0814 VSTM %v0,%v15,0,%r3 # vstm 0,15,0(3)
0815 VSTM %v16,%v31,256,%r3 # vstm 16,31,256(3)
0816 j .Lsave_fpu_regs_done # -> set CIF_FPU flag
0817 .Lsave_fpu_regs_fp:
0818 std 0,0(%r3)
0819 std 1,8(%r3)
0820 std 2,16(%r3)
0821 std 3,24(%r3)
0822 std 4,32(%r3)
0823 std 5,40(%r3)
0824 std 6,48(%r3)
0825 std 7,56(%r3)
0826 std 8,64(%r3)
0827 std 9,72(%r3)
0828 std 10,80(%r3)
0829 std 11,88(%r3)
0830 std 12,96(%r3)
0831 std 13,104(%r3)
0832 std 14,112(%r3)
0833 std 15,120(%r3)
0834 .Lsave_fpu_regs_done:
0835 oi __LC_CPU_FLAGS+7,_CIF_FPU
0836 br %r14
0837 .Lsave_fpu_regs_end:
0838 #if IS_ENABLED(CONFIG_KVM)
0839 EXPORT_SYMBOL(save_fpu_regs)
0840 #endif
0841
0842 /*
0843 * Load floating-point controls and floating-point or vector registers.
0844 * A critical section cleanup assures that the register contents are
0845 * loaded even if interrupted for some other work.
0846 *
0847 * There are special calling conventions to fit into sysc and io return work:
0848 * %r15: <kernel stack>
0849 * The function requires:
0850 * %r4
0851 */
0852 load_fpu_regs:
0853 lg %r4,__LC_CURRENT
0854 aghi %r4,__TASK_thread
0855 TSTMSK __LC_CPU_FLAGS,_CIF_FPU
0856 bnor %r14
0857 lfpc __THREAD_FPU_fpc(%r4)
0858 TSTMSK __LC_MACHINE_FLAGS,MACHINE_FLAG_VX
0859 lg %r4,__THREAD_FPU_regs(%r4) # %r4 <- reg save area
0860 jz .Lload_fpu_regs_fp # -> no VX, load FP regs
0861 VLM %v0,%v15,0,%r4
0862 VLM %v16,%v31,256,%r4
0863 j .Lload_fpu_regs_done
0864 .Lload_fpu_regs_fp:
0865 ld 0,0(%r4)
0866 ld 1,8(%r4)
0867 ld 2,16(%r4)
0868 ld 3,24(%r4)
0869 ld 4,32(%r4)
0870 ld 5,40(%r4)
0871 ld 6,48(%r4)
0872 ld 7,56(%r4)
0873 ld 8,64(%r4)
0874 ld 9,72(%r4)
0875 ld 10,80(%r4)
0876 ld 11,88(%r4)
0877 ld 12,96(%r4)
0878 ld 13,104(%r4)
0879 ld 14,112(%r4)
0880 ld 15,120(%r4)
0881 .Lload_fpu_regs_done:
0882 ni __LC_CPU_FLAGS+7,255-_CIF_FPU
0883 br %r14
0884 .Lload_fpu_regs_end:
0885
0886 .L__critical_end:
0887
0888 /*
0889 * Machine check handler routines
0890 */
0891 ENTRY(mcck_int_handler)
0892 STCK __LC_MCCK_CLOCK
0893 la %r1,4095 # revalidate r1
0894 spt __LC_CPU_TIMER_SAVE_AREA-4095(%r1) # revalidate cpu timer
0895 lmg %r0,%r15,__LC_GPREGS_SAVE_AREA-4095(%r1)# revalidate gprs
0896 lg %r10,__LC_LAST_BREAK
0897 lg %r12,__LC_CURRENT
0898 larl %r13,cleanup_critical
0899 lmg %r8,%r9,__LC_MCK_OLD_PSW
0900 TSTMSK __LC_MCCK_CODE,MCCK_CODE_SYSTEM_DAMAGE
0901 jo .Lmcck_panic # yes -> rest of mcck code invalid
0902 lghi %r14,__LC_CPU_TIMER_SAVE_AREA
0903 mvc __LC_MCCK_ENTER_TIMER(8),0(%r14)
0904 TSTMSK __LC_MCCK_CODE,MCCK_CODE_CPU_TIMER_VALID
0905 jo 3f
0906 la %r14,__LC_SYNC_ENTER_TIMER
0907 clc 0(8,%r14),__LC_ASYNC_ENTER_TIMER
0908 jl 0f
0909 la %r14,__LC_ASYNC_ENTER_TIMER
0910 0: clc 0(8,%r14),__LC_EXIT_TIMER
0911 jl 1f
0912 la %r14,__LC_EXIT_TIMER
0913 1: clc 0(8,%r14),__LC_LAST_UPDATE_TIMER
0914 jl 2f
0915 la %r14,__LC_LAST_UPDATE_TIMER
0916 2: spt 0(%r14)
0917 mvc __LC_MCCK_ENTER_TIMER(8),0(%r14)
0918 3: TSTMSK __LC_MCCK_CODE,(MCCK_CODE_PSW_MWP_VALID|MCCK_CODE_PSW_IA_VALID)
0919 jno .Lmcck_panic # no -> skip cleanup critical
0920 SWITCH_ASYNC __LC_GPREGS_SAVE_AREA+64,__LC_MCCK_ENTER_TIMER
0921 .Lmcck_skip:
0922 lghi %r14,__LC_GPREGS_SAVE_AREA+64
0923 stmg %r0,%r7,__PT_R0(%r11)
0924 mvc __PT_R8(64,%r11),0(%r14)
0925 stmg %r8,%r9,__PT_PSW(%r11)
0926 xc __PT_FLAGS(8,%r11),__PT_FLAGS(%r11)
0927 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
0928 lgr %r2,%r11 # pass pointer to pt_regs
0929 brasl %r14,s390_do_machine_check
0930 tm __PT_PSW+1(%r11),0x01 # returning to user ?
0931 jno .Lmcck_return
0932 lg %r1,__LC_KERNEL_STACK # switch to kernel stack
0933 mvc STACK_FRAME_OVERHEAD(__PT_SIZE,%r1),0(%r11)
0934 xc __SF_BACKCHAIN(8,%r1),__SF_BACKCHAIN(%r1)
0935 la %r11,STACK_FRAME_OVERHEAD(%r1)
0936 lgr %r15,%r1
0937 ssm __LC_PGM_NEW_PSW # turn dat on, keep irqs off
0938 TSTMSK __LC_CPU_FLAGS,_CIF_MCCK_PENDING
0939 jno .Lmcck_return
0940 TRACE_IRQS_OFF
0941 brasl %r14,s390_handle_mcck
0942 TRACE_IRQS_ON
0943 .Lmcck_return:
0944 lg %r14,__LC_VDSO_PER_CPU
0945 lmg %r0,%r10,__PT_R0(%r11)
0946 mvc __LC_RETURN_MCCK_PSW(16),__PT_PSW(%r11) # move return PSW
0947 tm __LC_RETURN_MCCK_PSW+1,0x01 # returning to user ?
0948 jno 0f
0949 stpt __LC_EXIT_TIMER
0950 mvc __VDSO_ECTG_BASE(16,%r14),__LC_EXIT_TIMER
0951 0: lmg %r11,%r15,__PT_R11(%r11)
0952 lpswe __LC_RETURN_MCCK_PSW
0953
0954 .Lmcck_panic:
0955 lg %r15,__LC_PANIC_STACK
0956 la %r11,STACK_FRAME_OVERHEAD(%r15)
0957 j .Lmcck_skip
0958
0959 #
0960 # PSW restart interrupt handler
0961 #
0962 ENTRY(restart_int_handler)
0963 TSTMSK __LC_MACHINE_FLAGS,MACHINE_FLAG_LPP
0964 jz 0f
0965 .insn s,0xb2800000,__LC_LPP
0966 0: stg %r15,__LC_SAVE_AREA_RESTART
0967 lg %r15,__LC_RESTART_STACK
0968 aghi %r15,-__PT_SIZE # create pt_regs on stack
0969 xc 0(__PT_SIZE,%r15),0(%r15)
0970 stmg %r0,%r14,__PT_R0(%r15)
0971 mvc __PT_R15(8,%r15),__LC_SAVE_AREA_RESTART
0972 mvc __PT_PSW(16,%r15),__LC_RST_OLD_PSW # store restart old psw
0973 aghi %r15,-STACK_FRAME_OVERHEAD # create stack frame on stack
0974 xc 0(STACK_FRAME_OVERHEAD,%r15),0(%r15)
0975 lg %r1,__LC_RESTART_FN # load fn, parm & source cpu
0976 lg %r2,__LC_RESTART_DATA
0977 lg %r3,__LC_RESTART_SOURCE
0978 ltgr %r3,%r3 # test source cpu address
0979 jm 1f # negative -> skip source stop
0980 0: sigp %r4,%r3,SIGP_SENSE # sigp sense to source cpu
0981 brc 10,0b # wait for status stored
0982 1: basr %r14,%r1 # call function
0983 stap __SF_EMPTY(%r15) # store cpu address
0984 llgh %r3,__SF_EMPTY(%r15)
0985 2: sigp %r4,%r3,SIGP_STOP # sigp stop to current cpu
0986 brc 2,2b
0987 3: j 3b
0988
0989 .section .kprobes.text, "ax"
0990
0991 #ifdef CONFIG_CHECK_STACK
0992 /*
0993 * The synchronous or the asynchronous stack overflowed. We are dead.
0994 * No need to properly save the registers, we are going to panic anyway.
0995 * Setup a pt_regs so that show_trace can provide a good call trace.
0996 */
0997 stack_overflow:
0998 lg %r15,__LC_PANIC_STACK # change to panic stack
0999 la %r11,STACK_FRAME_OVERHEAD(%r15)
1000 stmg %r0,%r7,__PT_R0(%r11)
1001 stmg %r8,%r9,__PT_PSW(%r11)
1002 mvc __PT_R8(64,%r11),0(%r14)
1003 stg %r10,__PT_ORIG_GPR2(%r11) # store last break to orig_gpr2
1004 xc __SF_BACKCHAIN(8,%r15),__SF_BACKCHAIN(%r15)
1005 lgr %r2,%r11 # pass pointer to pt_regs
1006 jg kernel_stack_overflow
1007 #endif
1008
1009 cleanup_critical:
1010 #if IS_ENABLED(CONFIG_KVM)
1011 clg %r9,BASED(.Lcleanup_table_sie) # .Lsie_gmap
1012 jl 0f
1013 clg %r9,BASED(.Lcleanup_table_sie+8)# .Lsie_done
1014 jl .Lcleanup_sie
1015 #endif
1016 clg %r9,BASED(.Lcleanup_table) # system_call
1017 jl 0f
1018 clg %r9,BASED(.Lcleanup_table+8) # .Lsysc_do_svc
1019 jl .Lcleanup_system_call
1020 clg %r9,BASED(.Lcleanup_table+16) # .Lsysc_tif
1021 jl 0f
1022 clg %r9,BASED(.Lcleanup_table+24) # .Lsysc_restore
1023 jl .Lcleanup_sysc_tif
1024 clg %r9,BASED(.Lcleanup_table+32) # .Lsysc_done
1025 jl .Lcleanup_sysc_restore
1026 clg %r9,BASED(.Lcleanup_table+40) # .Lio_tif
1027 jl 0f
1028 clg %r9,BASED(.Lcleanup_table+48) # .Lio_restore
1029 jl .Lcleanup_io_tif
1030 clg %r9,BASED(.Lcleanup_table+56) # .Lio_done
1031 jl .Lcleanup_io_restore
1032 clg %r9,BASED(.Lcleanup_table+64) # psw_idle
1033 jl 0f
1034 clg %r9,BASED(.Lcleanup_table+72) # .Lpsw_idle_end
1035 jl .Lcleanup_idle
1036 clg %r9,BASED(.Lcleanup_table+80) # save_fpu_regs
1037 jl 0f
1038 clg %r9,BASED(.Lcleanup_table+88) # .Lsave_fpu_regs_end
1039 jl .Lcleanup_save_fpu_regs
1040 clg %r9,BASED(.Lcleanup_table+96) # load_fpu_regs
1041 jl 0f
1042 clg %r9,BASED(.Lcleanup_table+104) # .Lload_fpu_regs_end
1043 jl .Lcleanup_load_fpu_regs
1044 0: br %r14
1045
1046 .align 8
1047 .Lcleanup_table:
1048 .quad system_call
1049 .quad .Lsysc_do_svc
1050 .quad .Lsysc_tif
1051 .quad .Lsysc_restore
1052 .quad .Lsysc_done
1053 .quad .Lio_tif
1054 .quad .Lio_restore
1055 .quad .Lio_done
1056 .quad psw_idle
1057 .quad .Lpsw_idle_end
1058 .quad save_fpu_regs
1059 .quad .Lsave_fpu_regs_end
1060 .quad load_fpu_regs
1061 .quad .Lload_fpu_regs_end
1062
1063 #if IS_ENABLED(CONFIG_KVM)
1064 .Lcleanup_table_sie:
1065 .quad .Lsie_gmap
1066 .quad .Lsie_done
1067
1068 .Lcleanup_sie:
1069 lg %r9,__SF_EMPTY(%r15) # get control block pointer
1070 ni __SIE_PROG0C+3(%r9),0xfe # no longer in SIE
1071 lctlg %c1,%c1,__LC_USER_ASCE # load primary asce
1072 larl %r9,sie_exit # skip forward to sie_exit
1073 br %r14
1074 #endif
1075
1076 .Lcleanup_system_call:
1077 # check if stpt has been executed
1078 clg %r9,BASED(.Lcleanup_system_call_insn)
1079 jh 0f
1080 mvc __LC_SYNC_ENTER_TIMER(8),__LC_ASYNC_ENTER_TIMER
1081 cghi %r11,__LC_SAVE_AREA_ASYNC
1082 je 0f
1083 mvc __LC_SYNC_ENTER_TIMER(8),__LC_MCCK_ENTER_TIMER
1084 0: # check if stmg has been executed
1085 clg %r9,BASED(.Lcleanup_system_call_insn+8)
1086 jh 0f
1087 mvc __LC_SAVE_AREA_SYNC(64),0(%r11)
1088 0: # check if base register setup + TIF bit load has been done
1089 clg %r9,BASED(.Lcleanup_system_call_insn+16)
1090 jhe 0f
1091 # set up saved registers r10 and r12
1092 stg %r10,16(%r11) # r10 last break
1093 stg %r12,32(%r11) # r12 task struct pointer
1094 0: # check if the user time update has been done
1095 clg %r9,BASED(.Lcleanup_system_call_insn+24)
1096 jh 0f
1097 lg %r15,__LC_EXIT_TIMER
1098 slg %r15,__LC_SYNC_ENTER_TIMER
1099 alg %r15,__LC_USER_TIMER
1100 stg %r15,__LC_USER_TIMER
1101 0: # check if the system time update has been done
1102 clg %r9,BASED(.Lcleanup_system_call_insn+32)
1103 jh 0f
1104 lg %r15,__LC_LAST_UPDATE_TIMER
1105 slg %r15,__LC_EXIT_TIMER
1106 alg %r15,__LC_SYSTEM_TIMER
1107 stg %r15,__LC_SYSTEM_TIMER
1108 0: # update accounting time stamp
1109 mvc __LC_LAST_UPDATE_TIMER(8),__LC_SYNC_ENTER_TIMER
1110 # do LAST_BREAK
1111 lg %r9,16(%r11)
1112 srag %r9,%r9,23
1113 jz 0f
1114 lgr %r9,%r12
1115 aghi %r9,__TASK_thread
1116 mvc __THREAD_last_break(8,%r9),16(%r11)
1117 0: # set up saved register r11
1118 lg %r15,__LC_KERNEL_STACK
1119 la %r9,STACK_FRAME_OVERHEAD(%r15)
1120 stg %r9,24(%r11) # r11 pt_regs pointer
1121 # fill pt_regs
1122 mvc __PT_R8(64,%r9),__LC_SAVE_AREA_SYNC
1123 stmg %r0,%r7,__PT_R0(%r9)
1124 mvc __PT_PSW(16,%r9),__LC_SVC_OLD_PSW
1125 mvc __PT_INT_CODE(4,%r9),__LC_SVC_ILC
1126 xc __PT_FLAGS(8,%r9),__PT_FLAGS(%r9)
1127 mvi __PT_FLAGS+7(%r9),_PIF_SYSCALL
1128 # setup saved register r15
1129 stg %r15,56(%r11) # r15 stack pointer
1130 # set new psw address and exit
1131 larl %r9,.Lsysc_do_svc
1132 br %r14
1133 .Lcleanup_system_call_insn:
1134 .quad system_call
1135 .quad .Lsysc_stmg
1136 .quad .Lsysc_per
1137 .quad .Lsysc_vtime+36
1138 .quad .Lsysc_vtime+42
1139
1140 .Lcleanup_sysc_tif:
1141 larl %r9,.Lsysc_tif
1142 br %r14
1143
1144 .Lcleanup_sysc_restore:
1145 clg %r9,BASED(.Lcleanup_sysc_restore_insn)
1146 je 0f
1147 lg %r9,24(%r11) # get saved pointer to pt_regs
1148 mvc __LC_RETURN_PSW(16),__PT_PSW(%r9)
1149 mvc 0(64,%r11),__PT_R8(%r9)
1150 lmg %r0,%r7,__PT_R0(%r9)
1151 0: lmg %r8,%r9,__LC_RETURN_PSW
1152 br %r14
1153 .Lcleanup_sysc_restore_insn:
1154 .quad .Lsysc_done - 4
1155
1156 .Lcleanup_io_tif:
1157 larl %r9,.Lio_tif
1158 br %r14
1159
1160 .Lcleanup_io_restore:
1161 clg %r9,BASED(.Lcleanup_io_restore_insn)
1162 je 0f
1163 lg %r9,24(%r11) # get saved r11 pointer to pt_regs
1164 mvc __LC_RETURN_PSW(16),__PT_PSW(%r9)
1165 mvc 0(64,%r11),__PT_R8(%r9)
1166 lmg %r0,%r7,__PT_R0(%r9)
1167 0: lmg %r8,%r9,__LC_RETURN_PSW
1168 br %r14
1169 .Lcleanup_io_restore_insn:
1170 .quad .Lio_done - 4
1171
1172 .Lcleanup_idle:
1173 ni __LC_CPU_FLAGS+7,255-_CIF_ENABLED_WAIT
1174 # copy interrupt clock & cpu timer
1175 mvc __CLOCK_IDLE_EXIT(8,%r2),__LC_INT_CLOCK
1176 mvc __TIMER_IDLE_EXIT(8,%r2),__LC_ASYNC_ENTER_TIMER
1177 cghi %r11,__LC_SAVE_AREA_ASYNC
1178 je 0f
1179 mvc __CLOCK_IDLE_EXIT(8,%r2),__LC_MCCK_CLOCK
1180 mvc __TIMER_IDLE_EXIT(8,%r2),__LC_MCCK_ENTER_TIMER
1181 0: # check if stck & stpt have been executed
1182 clg %r9,BASED(.Lcleanup_idle_insn)
1183 jhe 1f
1184 mvc __CLOCK_IDLE_ENTER(8,%r2),__CLOCK_IDLE_EXIT(%r2)
1185 mvc __TIMER_IDLE_ENTER(8,%r2),__TIMER_IDLE_EXIT(%r2)
1186 1: # calculate idle cycles
1187 #ifdef CONFIG_SMP
1188 clg %r9,BASED(.Lcleanup_idle_insn)
1189 jl 3f
1190 larl %r1,smp_cpu_mtid
1191 llgf %r1,0(%r1)
1192 ltgr %r1,%r1
1193 jz 3f
1194 .insn rsy,0xeb0000000017,%r1,5,__SF_EMPTY+80(%r15)
1195 larl %r3,mt_cycles
1196 ag %r3,__LC_PERCPU_OFFSET
1197 la %r4,__SF_EMPTY+16(%r15)
1198 2: lg %r0,0(%r3)
1199 slg %r0,0(%r4)
1200 alg %r0,64(%r4)
1201 stg %r0,0(%r3)
1202 la %r3,8(%r3)
1203 la %r4,8(%r4)
1204 brct %r1,2b
1205 #endif
1206 3: # account system time going idle
1207 lg %r9,__LC_STEAL_TIMER
1208 alg %r9,__CLOCK_IDLE_ENTER(%r2)
1209 slg %r9,__LC_LAST_UPDATE_CLOCK
1210 stg %r9,__LC_STEAL_TIMER
1211 mvc __LC_LAST_UPDATE_CLOCK(8),__CLOCK_IDLE_EXIT(%r2)
1212 lg %r9,__LC_SYSTEM_TIMER
1213 alg %r9,__LC_LAST_UPDATE_TIMER
1214 slg %r9,__TIMER_IDLE_ENTER(%r2)
1215 stg %r9,__LC_SYSTEM_TIMER
1216 mvc __LC_LAST_UPDATE_TIMER(8),__TIMER_IDLE_EXIT(%r2)
1217 # prepare return psw
1218 nihh %r8,0xfcfd # clear irq & wait state bits
1219 lg %r9,48(%r11) # return from psw_idle
1220 br %r14
1221 .Lcleanup_idle_insn:
1222 .quad .Lpsw_idle_lpsw
1223
1224 .Lcleanup_save_fpu_regs:
1225 larl %r9,save_fpu_regs
1226 br %r14
1227
1228 .Lcleanup_load_fpu_regs:
1229 larl %r9,load_fpu_regs
1230 br %r14
1231
1232 /*
1233 * Integer constants
1234 */
1235 .align 8
1236 .Lcritical_start:
1237 .quad .L__critical_start
1238 .Lcritical_length:
1239 .quad .L__critical_end - .L__critical_start
1240 #if IS_ENABLED(CONFIG_KVM)
1241 .Lsie_critical_start:
1242 .quad .Lsie_gmap
1243 .Lsie_critical_length:
1244 .quad .Lsie_done - .Lsie_gmap
1245 #endif
1246
1247 .section .rodata, "a"
1248 #define SYSCALL(esame,emu) .long esame
1249 .globl sys_call_table
1250 sys_call_table:
1251 #include "syscalls.S"
1252 #undef SYSCALL
1253
1254 #ifdef CONFIG_COMPAT
1255
1256 #define SYSCALL(esame,emu) .long emu
1257 .globl sys_call_table_emu
1258 sys_call_table_emu:
1259 #include "syscalls.S"
1260 #undef SYSCALL
1261 #endif
|
{
"url": "http://140.136.149.249/lxr/source/the-tree/arch/s390/kernel/entry.S",
"source_domain": "140.136.149.249",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "238011",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T6KZRBBYAMMT4RRZNLQG6H7MCJYC2H5F",
"WARC-Concurrent-To": "<urn:uuid:2e7b4c4d-22eb-4532-8f5d-32963d878edd>",
"WARC-Date": "2018-06-23T14:04:00Z",
"WARC-IP-Address": "140.136.149.249",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PRAW46ONCQLFFWXXHU44DXDVYJSQ7Q3K",
"WARC-Record-ID": "<urn:uuid:727c561f-d104-467d-888a-97295dc2dfc9>",
"WARC-Target-URI": "http://140.136.149.249/lxr/source/the-tree/arch/s390/kernel/entry.S",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f01f6063-b8bb-4ee1-8065-f66b5aafcba1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-72-160.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
19,
23,
24,
26,
28,
29,
34,
35,
36,
44,
84,
92,
134,
201,
247,
324,
381,
390,
396,
425,
457,
489,
517,
545,
574,
608,
642,
671,
698,
725,
751,
781,
809,
835,
864,
870,
901,
936,
972,
1008,
1044,
1080,
1116,
1152,
1188,
1224,
1260,
1296,
1332,
1369,
1406,
1443,
1449,
1499,
1535,
1599,
1605,
1686,
1715,
1794,
1835,
1897,
1932,
1938,
1991,
1997,
2028,
2062,
2087,
2134,
2146,
2161,
2167,
2199,
2233,
2258,
2306,
2318,
2333,
2339,
2373,
2400,
2459,
2477,
2516,
2528,
2543,
2549,
2597,
2628,
2678,
2710,
2738,
2750,
2765,
2771,
2816,
2876,
2892,
2914,
2956,
2999,
3015,
3090,
3129,
3199,
3215,
3289,
3316,
3355,
3371,
3417,
3475,
3491,
3516,
3555,
3611,
3656,
3671,
3677,
3724,
3757,
3797,
3827,
3860,
3893,
3928,
3961,
3996,
4048,
4063,
4069,
4105,
4139,
4183,
4201,
4259,
4270,
4288,
4328,
4381,
4393,
4408,
4414,
4444,
4477,
4511,
4540,
4555,
4561,
4591,
4637,
4701,
4712,
4771,
4783,
4798,
4804,
4816,
4888,
4960,
5031,
5104,
5129,
5142,
5195,
5247,
5283,
5340,
5364,
5435,
5459,
5479,
5504,
5552,
5572,
5612,
5646,
5661,
5667,
5705,
5719,
5731,
5809,
5886,
5964,
6031,
6106,
6125,
6138,
6153,
6159,
6167,
6222,
6259,
6296,
6313,
6334,
6343,
6367,
6438,
6459,
6529,
6602,
6672,
6693,
6763,
6785,
6856,
6921,
6990,
7059,
7137,
7211,
7284,
7350,
7403,
7421,
7490,
7508,
7514,
7539,
7545,
7577,
7585,
7620,
7661,
7698,
7707,
7726,
7795,
7865,
7938,
8011,
8087,
8122,
8187,
8215,
8275,
8331,
8358,
8382,
8447,
8464,
8533,
8602,
8658,
8682,
8723,
8785,
8806,
8823,
8883,
8948,
8965,
9047,
9125,
9200,
9269,
9299,
9318,
9333,
9358,
9373,
9446,
9510,
9578,
9645,
9663,
9681,
9711,
9775,
9797,
9803,
9847,
9887,
9914,
9943,
9955,
9961,
9969,
10048,
10094,
10103,
10109,
10133,
10172,
10190,
10236,
10270,
10301,
10336,
10353,
10389,
10455,
10480,
10499,
10553,
10592,
10642,
10690,
10738,
10773,
10793,
10838,
10882,
10940,
10951,
10987,
11036,
11048,
11091,
11155,
11181,
11225,
11286,
11319,
11345,
11384,
11411,
11430,
11487,
11525,
11569,
11629,
11674,
11703,
11756,
11814,
11820,
11840,
11866,
11883,
11927,
11952,
11996,
12046,
12088,
12113,
12134,
12170,
12206,
12254,
12287,
12342,
12380,
12413,
12431,
12437,
12444,
12499,
12506,
12524,
12574,
12607,
12659,
12690,
12717,
12763,
12797,
12809,
12857,
12888,
12938,
12969,
13022,
13056,
13097,
13122,
13164,
13192,
13262,
13268,
13275,
13322,
13329,
13353,
13389,
13411,
13417,
13424,
13470,
13477,
13503,
13539,
13609,
13615,
13622,
13668,
13675,
13696,
13740,
13805,
13832,
13838,
13845,
13930,
13937,
13955,
13991,
14018,
14024,
14031,
14077,
14084,
14108,
14163,
14195,
14242,
14269,
14327,
14384,
14451,
14484,
14550,
14577,
14624,
14630,
14637,
14693,
14700,
14727,
14782,
14818,
14848,
14854,
14861,
14914,
14921,
14948,
14975,
15030,
15066,
15100,
15112,
15118,
15125,
15171,
15178,
15202,
15252,
15307,
15343,
15368,
15374,
15381,
15461,
15494,
15501,
15523,
15578,
15597,
15640,
15671,
15716,
15749,
15774,
15804,
15831,
15860,
15881,
15916,
15960,
15998,
16046,
16100,
16123,
16168,
16195,
16250,
16286,
16321,
16327,
16334,
16391,
16398,
16424,
16469,
16500,
16536,
16559,
16614,
16679,
16709,
16741,
16790,
16824,
16849,
16875,
16905,
16911,
16919,
16957,
16966,
16972,
17002,
17041,
17087,
17121,
17152,
17191,
17229,
17287,
17337,
17369,
17416,
17438,
17484,
17531,
17547,
17583,
17595,
17655,
17718,
17777,
17834,
17886,
17944,
17960,
17985,
18039,
18075,
18098,
18162,
18197,
18260,
18276,
18325,
18370,
18409,
18459,
18499,
18547,
18607,
18656,
18690,
18749,
18765,
18819,
18845,
18891,
18950,
19004,
19062,
19085,
19142,
19179,
19223,
19252,
19272,
19298,
19365,
19420,
19483,
19502,
19528,
19587,
19615,
19639,
19645,
19652,
19706,
19713,
19732,
19755,
19812,
19867,
19901,
19927,
19933,
19940,
19974,
19981,
20000,
20049,
20082,
20118,
20169,
20245,
20251,
20259,
20296,
20305,
20332,
20364,
20404,
20451,
20485,
20516,
20555,
20592,
20658,
20697,
20748,
20788,
20843,
20892,
20940,
20966,
20990,
21047,
21063,
21118,
21152,
21215,
21238,
21274,
21290,
21319,
21373,
21398,
21413,
21438,
21493,
21516,
21534,
21560,
21583,
21598,
21642,
21708,
21750,
21773,
21792,
21828,
21864,
21912,
21945,
22000,
22038,
22071,
22087,
22093,
22100,
22179,
22245,
22322,
22360,
22441,
22518,
22596,
22603,
22619,
22678,
22740,
22767,
22810,
22849,
22907,
22959,
22985,
23019,
23051,
23108,
23165,
23220,
23264,
23286,
23345,
23398,
23422,
23465,
23490,
23501,
23527,
23539,
23545,
23552,
23629,
23636,
23657,
23692,
23749,
23804,
23848,
23870,
23876,
23883,
23938,
23945,
23965,
24015,
24046,
24098,
24127,
24177,
24206,
24259,
24291,
24332,
24355,
24397,
24423,
24489,
24495,
24502,
24548,
24555,
24579,
24632,
24710,
24734,
24759,
24765,
24772,
24818,
24825,
24844,
24888,
24953,
24978,
24984,
24991,
25076,
25083,
25099,
25133,
25160,
25166,
25173,
25220,
25227,
25249,
25302,
25357,
25411,
25478,
25502,
25527,
25533,
25540,
25589,
25596,
25618,
25671,
25726,
25781,
25813,
25880,
25904,
25929,
25935,
25942,
26001,
26008,
26033,
26086,
26141,
26196,
26235,
26302,
26326,
26351,
26357,
26365,
26408,
26417,
26445,
26477,
26517,
26564,
26598,
26629,
26668,
26706,
26772,
26811,
26862,
26902,
26940,
26993,
27044,
27091,
27140,
27188,
27214,
27238,
27295,
27350,
27385,
27414,
27439,
27445,
27453,
27533,
27542,
27563,
27597,
27636,
27672,
27695,
27729,
27757,
27782,
27813,
27875,
27899,
27911,
27959,
28000,
28041,
28063,
28097,
28115,
28136,
28142,
28150,
28226,
28306,
28384,
28460,
28529,
28538,
28564,
28594,
28629,
28670,
28688,
28727,
28767,
28819,
28876,
28932,
28991,
29052,
29077,
29099,
29121,
29144,
29167,
29190,
29213,
29236,
29259,
29282,
29305,
29329,
29353,
29377,
29402,
29427,
29452,
29479,
29518,
29536,
29562,
29594,
29628,
29640,
29646,
29654,
29731,
29805,
29861,
29869,
29952,
29984,
30015,
30028,
30037,
30057,
30087,
30122,
30163,
30185,
30224,
30276,
30340,
30402,
30430,
30461,
30495,
30520,
30542,
30564,
30587,
30610,
30633,
30656,
30679,
30702,
30725,
30748,
30772,
30796,
30820,
30845,
30870,
30895,
30922,
30965,
30983,
31009,
31015,
31038,
31044,
31052,
31091,
31100,
31129,
31162,
31207,
31279,
31350,
31384,
31415,
31454,
31492,
31548,
31616,
31663,
31709,
31767,
31783,
31823,
31869,
31885,
31926,
31965,
31981,
32015,
32061,
32077,
32118,
32139,
32185,
32266,
32329,
32398,
32416,
32463,
32502,
32540,
32580,
32629,
32686,
32741,
32785,
32844,
32871,
32933,
32990,
33045,
33089,
33111,
33173,
33223,
33250,
33274,
33313,
33336,
33356,
33392,
33428,
33499,
33562,
33578,
33611,
33666,
33704,
33742,
33748,
33767,
33802,
33847,
33872,
33878,
33885,
33922,
33929,
33961,
34014,
34030,
34069,
34110,
34147,
34214,
34253,
34293,
34346,
34418,
34493,
34543,
34609,
34644,
34681,
34744,
34804,
34872,
34930,
34983,
35044,
35082,
35150,
35168,
35184,
35190,
35228,
35234,
35265,
35273,
35348,
35426,
35500,
35509,
35530,
35591,
35636,
35675,
35715,
35753,
35824,
35881,
35936,
35971,
35983,
35989,
36012,
36044,
36102,
36118,
36176,
36203,
36215,
36270,
36286,
36347,
36382,
36440,
36456,
36518,
36550,
36609,
36645,
36701,
36717,
36777,
36807,
36864,
36898,
36954,
36970,
37032,
37060,
37121,
37137,
37204,
37241,
37302,
37318,
37385,
37422,
37440,
37446,
37465,
37487,
37516,
37547,
37575,
37607,
37636,
37662,
37692,
37719,
37745,
37777,
37808,
37845,
37876,
37913,
37919,
37951,
37977,
38005,
38033,
38039,
38059,
38128,
38188,
38253,
38321,
38339,
38351,
38357,
38385,
38428,
38479,
38495,
38556,
38599,
38615,
38675,
38718,
38771,
38787,
38832,
38901,
38955,
38971,
39017,
39067,
39126,
39181,
39235,
39251,
39285,
39325,
39359,
39393,
39450,
39504,
39520,
39561,
39595,
39631,
39667,
39707,
39768,
39793,
39819,
39847,
39863,
39885,
39920,
39969,
40006,
40042,
40086,
40141,
40165,
40214,
40252,
40299,
40346,
40393,
40437,
40473,
40526,
40566,
40601,
40619,
40652,
40681,
40710,
40738,
40771,
40804,
40810,
40835,
40867,
40885,
40891,
40920,
40972,
40988,
41052,
41099,
41136,
41170,
41207,
41225,
41259,
41292,
41298,
41321,
41351,
41369,
41375,
41402,
41452,
41468,
41536,
41583,
41620,
41654,
41691,
41709,
41741,
41772,
41778,
41799,
41851,
41895,
41948,
42009,
42052,
42068,
42122,
42182,
42233,
42277,
42293,
42355,
42417,
42450,
42473,
42517,
42533,
42567,
42595,
42620,
42636,
42698,
42729,
42765,
42802,
42826,
42850,
42875,
42899,
42923,
42947,
42971,
42983,
43025,
43059,
43100,
43140,
43174,
43236,
43271,
43311,
43352,
43387,
43449,
43479,
43542,
43598,
43616,
43642,
43675,
43681,
43711,
43746,
43764,
43770,
43800,
43835,
43853,
43859,
43867,
43893,
43902,
43921,
43944,
43980,
44004,
44059,
44091,
44118,
44146,
44174,
44215,
44227,
44233,
44264,
44309,
44341,
44362,
44389,
44409,
44415,
44441,
44447,
44490,
44526,
44551,
44578,
44598
],
"line_end_idx": [
18,
19,
23,
24,
26,
28,
29,
34,
35,
36,
44,
84,
92,
134,
201,
247,
324,
381,
390,
396,
425,
457,
489,
517,
545,
574,
608,
642,
671,
698,
725,
751,
781,
809,
835,
864,
870,
901,
936,
972,
1008,
1044,
1080,
1116,
1152,
1188,
1224,
1260,
1296,
1332,
1369,
1406,
1443,
1449,
1499,
1535,
1599,
1605,
1686,
1715,
1794,
1835,
1897,
1932,
1938,
1991,
1997,
2028,
2062,
2087,
2134,
2146,
2161,
2167,
2199,
2233,
2258,
2306,
2318,
2333,
2339,
2373,
2400,
2459,
2477,
2516,
2528,
2543,
2549,
2597,
2628,
2678,
2710,
2738,
2750,
2765,
2771,
2816,
2876,
2892,
2914,
2956,
2999,
3015,
3090,
3129,
3199,
3215,
3289,
3316,
3355,
3371,
3417,
3475,
3491,
3516,
3555,
3611,
3656,
3671,
3677,
3724,
3757,
3797,
3827,
3860,
3893,
3928,
3961,
3996,
4048,
4063,
4069,
4105,
4139,
4183,
4201,
4259,
4270,
4288,
4328,
4381,
4393,
4408,
4414,
4444,
4477,
4511,
4540,
4555,
4561,
4591,
4637,
4701,
4712,
4771,
4783,
4798,
4804,
4816,
4888,
4960,
5031,
5104,
5129,
5142,
5195,
5247,
5283,
5340,
5364,
5435,
5459,
5479,
5504,
5552,
5572,
5612,
5646,
5661,
5667,
5705,
5719,
5731,
5809,
5886,
5964,
6031,
6106,
6125,
6138,
6153,
6159,
6167,
6222,
6259,
6296,
6313,
6334,
6343,
6367,
6438,
6459,
6529,
6602,
6672,
6693,
6763,
6785,
6856,
6921,
6990,
7059,
7137,
7211,
7284,
7350,
7403,
7421,
7490,
7508,
7514,
7539,
7545,
7577,
7585,
7620,
7661,
7698,
7707,
7726,
7795,
7865,
7938,
8011,
8087,
8122,
8187,
8215,
8275,
8331,
8358,
8382,
8447,
8464,
8533,
8602,
8658,
8682,
8723,
8785,
8806,
8823,
8883,
8948,
8965,
9047,
9125,
9200,
9269,
9299,
9318,
9333,
9358,
9373,
9446,
9510,
9578,
9645,
9663,
9681,
9711,
9775,
9797,
9803,
9847,
9887,
9914,
9943,
9955,
9961,
9969,
10048,
10094,
10103,
10109,
10133,
10172,
10190,
10236,
10270,
10301,
10336,
10353,
10389,
10455,
10480,
10499,
10553,
10592,
10642,
10690,
10738,
10773,
10793,
10838,
10882,
10940,
10951,
10987,
11036,
11048,
11091,
11155,
11181,
11225,
11286,
11319,
11345,
11384,
11411,
11430,
11487,
11525,
11569,
11629,
11674,
11703,
11756,
11814,
11820,
11840,
11866,
11883,
11927,
11952,
11996,
12046,
12088,
12113,
12134,
12170,
12206,
12254,
12287,
12342,
12380,
12413,
12431,
12437,
12444,
12499,
12506,
12524,
12574,
12607,
12659,
12690,
12717,
12763,
12797,
12809,
12857,
12888,
12938,
12969,
13022,
13056,
13097,
13122,
13164,
13192,
13262,
13268,
13275,
13322,
13329,
13353,
13389,
13411,
13417,
13424,
13470,
13477,
13503,
13539,
13609,
13615,
13622,
13668,
13675,
13696,
13740,
13805,
13832,
13838,
13845,
13930,
13937,
13955,
13991,
14018,
14024,
14031,
14077,
14084,
14108,
14163,
14195,
14242,
14269,
14327,
14384,
14451,
14484,
14550,
14577,
14624,
14630,
14637,
14693,
14700,
14727,
14782,
14818,
14848,
14854,
14861,
14914,
14921,
14948,
14975,
15030,
15066,
15100,
15112,
15118,
15125,
15171,
15178,
15202,
15252,
15307,
15343,
15368,
15374,
15381,
15461,
15494,
15501,
15523,
15578,
15597,
15640,
15671,
15716,
15749,
15774,
15804,
15831,
15860,
15881,
15916,
15960,
15998,
16046,
16100,
16123,
16168,
16195,
16250,
16286,
16321,
16327,
16334,
16391,
16398,
16424,
16469,
16500,
16536,
16559,
16614,
16679,
16709,
16741,
16790,
16824,
16849,
16875,
16905,
16911,
16919,
16957,
16966,
16972,
17002,
17041,
17087,
17121,
17152,
17191,
17229,
17287,
17337,
17369,
17416,
17438,
17484,
17531,
17547,
17583,
17595,
17655,
17718,
17777,
17834,
17886,
17944,
17960,
17985,
18039,
18075,
18098,
18162,
18197,
18260,
18276,
18325,
18370,
18409,
18459,
18499,
18547,
18607,
18656,
18690,
18749,
18765,
18819,
18845,
18891,
18950,
19004,
19062,
19085,
19142,
19179,
19223,
19252,
19272,
19298,
19365,
19420,
19483,
19502,
19528,
19587,
19615,
19639,
19645,
19652,
19706,
19713,
19732,
19755,
19812,
19867,
19901,
19927,
19933,
19940,
19974,
19981,
20000,
20049,
20082,
20118,
20169,
20245,
20251,
20259,
20296,
20305,
20332,
20364,
20404,
20451,
20485,
20516,
20555,
20592,
20658,
20697,
20748,
20788,
20843,
20892,
20940,
20966,
20990,
21047,
21063,
21118,
21152,
21215,
21238,
21274,
21290,
21319,
21373,
21398,
21413,
21438,
21493,
21516,
21534,
21560,
21583,
21598,
21642,
21708,
21750,
21773,
21792,
21828,
21864,
21912,
21945,
22000,
22038,
22071,
22087,
22093,
22100,
22179,
22245,
22322,
22360,
22441,
22518,
22596,
22603,
22619,
22678,
22740,
22767,
22810,
22849,
22907,
22959,
22985,
23019,
23051,
23108,
23165,
23220,
23264,
23286,
23345,
23398,
23422,
23465,
23490,
23501,
23527,
23539,
23545,
23552,
23629,
23636,
23657,
23692,
23749,
23804,
23848,
23870,
23876,
23883,
23938,
23945,
23965,
24015,
24046,
24098,
24127,
24177,
24206,
24259,
24291,
24332,
24355,
24397,
24423,
24489,
24495,
24502,
24548,
24555,
24579,
24632,
24710,
24734,
24759,
24765,
24772,
24818,
24825,
24844,
24888,
24953,
24978,
24984,
24991,
25076,
25083,
25099,
25133,
25160,
25166,
25173,
25220,
25227,
25249,
25302,
25357,
25411,
25478,
25502,
25527,
25533,
25540,
25589,
25596,
25618,
25671,
25726,
25781,
25813,
25880,
25904,
25929,
25935,
25942,
26001,
26008,
26033,
26086,
26141,
26196,
26235,
26302,
26326,
26351,
26357,
26365,
26408,
26417,
26445,
26477,
26517,
26564,
26598,
26629,
26668,
26706,
26772,
26811,
26862,
26902,
26940,
26993,
27044,
27091,
27140,
27188,
27214,
27238,
27295,
27350,
27385,
27414,
27439,
27445,
27453,
27533,
27542,
27563,
27597,
27636,
27672,
27695,
27729,
27757,
27782,
27813,
27875,
27899,
27911,
27959,
28000,
28041,
28063,
28097,
28115,
28136,
28142,
28150,
28226,
28306,
28384,
28460,
28529,
28538,
28564,
28594,
28629,
28670,
28688,
28727,
28767,
28819,
28876,
28932,
28991,
29052,
29077,
29099,
29121,
29144,
29167,
29190,
29213,
29236,
29259,
29282,
29305,
29329,
29353,
29377,
29402,
29427,
29452,
29479,
29518,
29536,
29562,
29594,
29628,
29640,
29646,
29654,
29731,
29805,
29861,
29869,
29952,
29984,
30015,
30028,
30037,
30057,
30087,
30122,
30163,
30185,
30224,
30276,
30340,
30402,
30430,
30461,
30495,
30520,
30542,
30564,
30587,
30610,
30633,
30656,
30679,
30702,
30725,
30748,
30772,
30796,
30820,
30845,
30870,
30895,
30922,
30965,
30983,
31009,
31015,
31038,
31044,
31052,
31091,
31100,
31129,
31162,
31207,
31279,
31350,
31384,
31415,
31454,
31492,
31548,
31616,
31663,
31709,
31767,
31783,
31823,
31869,
31885,
31926,
31965,
31981,
32015,
32061,
32077,
32118,
32139,
32185,
32266,
32329,
32398,
32416,
32463,
32502,
32540,
32580,
32629,
32686,
32741,
32785,
32844,
32871,
32933,
32990,
33045,
33089,
33111,
33173,
33223,
33250,
33274,
33313,
33336,
33356,
33392,
33428,
33499,
33562,
33578,
33611,
33666,
33704,
33742,
33748,
33767,
33802,
33847,
33872,
33878,
33885,
33922,
33929,
33961,
34014,
34030,
34069,
34110,
34147,
34214,
34253,
34293,
34346,
34418,
34493,
34543,
34609,
34644,
34681,
34744,
34804,
34872,
34930,
34983,
35044,
35082,
35150,
35168,
35184,
35190,
35228,
35234,
35265,
35273,
35348,
35426,
35500,
35509,
35530,
35591,
35636,
35675,
35715,
35753,
35824,
35881,
35936,
35971,
35983,
35989,
36012,
36044,
36102,
36118,
36176,
36203,
36215,
36270,
36286,
36347,
36382,
36440,
36456,
36518,
36550,
36609,
36645,
36701,
36717,
36777,
36807,
36864,
36898,
36954,
36970,
37032,
37060,
37121,
37137,
37204,
37241,
37302,
37318,
37385,
37422,
37440,
37446,
37465,
37487,
37516,
37547,
37575,
37607,
37636,
37662,
37692,
37719,
37745,
37777,
37808,
37845,
37876,
37913,
37919,
37951,
37977,
38005,
38033,
38039,
38059,
38128,
38188,
38253,
38321,
38339,
38351,
38357,
38385,
38428,
38479,
38495,
38556,
38599,
38615,
38675,
38718,
38771,
38787,
38832,
38901,
38955,
38971,
39017,
39067,
39126,
39181,
39235,
39251,
39285,
39325,
39359,
39393,
39450,
39504,
39520,
39561,
39595,
39631,
39667,
39707,
39768,
39793,
39819,
39847,
39863,
39885,
39920,
39969,
40006,
40042,
40086,
40141,
40165,
40214,
40252,
40299,
40346,
40393,
40437,
40473,
40526,
40566,
40601,
40619,
40652,
40681,
40710,
40738,
40771,
40804,
40810,
40835,
40867,
40885,
40891,
40920,
40972,
40988,
41052,
41099,
41136,
41170,
41207,
41225,
41259,
41292,
41298,
41321,
41351,
41369,
41375,
41402,
41452,
41468,
41536,
41583,
41620,
41654,
41691,
41709,
41741,
41772,
41778,
41799,
41851,
41895,
41948,
42009,
42052,
42068,
42122,
42182,
42233,
42277,
42293,
42355,
42417,
42450,
42473,
42517,
42533,
42567,
42595,
42620,
42636,
42698,
42729,
42765,
42802,
42826,
42850,
42875,
42899,
42923,
42947,
42971,
42983,
43025,
43059,
43100,
43140,
43174,
43236,
43271,
43311,
43352,
43387,
43449,
43479,
43542,
43598,
43616,
43642,
43675,
43681,
43711,
43746,
43764,
43770,
43800,
43835,
43853,
43859,
43867,
43893,
43902,
43921,
43944,
43980,
44004,
44059,
44091,
44118,
44146,
44174,
44215,
44227,
44233,
44264,
44309,
44341,
44362,
44389,
44409,
44415,
44441,
44447,
44490,
44526,
44551,
44578,
44598,
44609
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 44609,
"ccnet_original_nlines": 1270,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.056655921041965485,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08314140886068344,
"rps_doc_frac_lines_end_with_ellipsis": 0.0007867799722589552,
"rps_doc_frac_no_alph_words": 0.5236066579818726,
"rps_doc_frac_unique_words": 0.5189568400382996,
"rps_doc_mean_word_length": 6.178391456604004,
"rps_doc_num_sentences": 416,
"rps_doc_symbol_to_word_ratio": 0.0390373095870018,
"rps_doc_unigram_entropy": 7.1488142013549805,
"rps_doc_word_count": 4563,
"rps_doc_frac_chars_dupe_10grams": 0.0024829700123518705,
"rps_doc_frac_chars_dupe_5grams": 0.06377696245908737,
"rps_doc_frac_chars_dupe_6grams": 0.03607406094670296,
"rps_doc_frac_chars_dupe_7grams": 0.01699063926935196,
"rps_doc_frac_chars_dupe_8grams": 0.007023269776254892,
"rps_doc_frac_chars_dupe_9grams": 0.007023269776254892,
"rps_doc_frac_chars_top_2gram": 0.006065549794584513,
"rps_doc_frac_chars_top_3gram": 0.00904512032866478,
"rps_doc_frac_chars_top_4gram": 0.009435299783945084,
"rps_doc_books_importance": -4417.5615234375,
"rps_doc_books_importance_length_correction": -4417.5615234375,
"rps_doc_openwebtext_importance": -2148.83349609375,
"rps_doc_openwebtext_importance_length_correction": -2148.83349609375,
"rps_doc_wikipedia_importance": -1326.9285888671875,
"rps_doc_wikipedia_importance_length_correction": -1326.9285888671875
},
"fasttext": {
"dclm": 0.752816379070282,
"english": 0.17868898808956146,
"fineweb_edu_approx": 1.839979887008667,
"eai_general_math": 0.6115677952766418,
"eai_open_web_math": 0.31623703241348267,
"eai_web_code": 0.7735990881919861
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.22",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,550,236,273,765,787,000 |
All About Ethereum
Are you a beginner to Ethereum? Have you been longing for a long time to know what is referred to as Ethereum? Worry no more here is the simplest description of what it entails and is meant when the word Ethereum is mentioned by professionals or on the internet. To start with, Ethereum is a platform, which was created in 2015 by Vitalik Buterin, for smart contracts. I might be bringing more confusion by the term “smart contracts.” To simplify things for you, smart contracts is just a phrase utilized when describing computer code that can enhance the exchange of shares, money, property, content, or something else of value. In other words, Ethereum is a digital payment method and is the second valuable form of digital money just after bitcoin. It is built on a technology known as Blockchain. Blockchain is just type of ledger that records as well verify transactions made on it. In the Blockchain of Ethereum miners try to earn Ether, which is a token-type and fuels the network. In simple, Ethereum is one of the newest technologies to join in this movement of digital transactions. In the Cryptocurrency world, it is a rising star.
What is Ethereum
What is Ethereum
Ethereum’s Uniqueness
Ethereum is very different from other block chains. All block chains have the ability to process code, and hence many are limited. Instead of offering a set of limited operations, Ethereum gives the developers freedom to create whatever operations they want. It means developers have the capability to build as many applications as they can that go beyond anything we have seen before.
You might be that person who has been your head on bitcoin for years, and now you are surprised Ethereum is all over the news. The difference between Bitcoin and Ethereum comes out clearly in capability and purpose. The focus of Ethereum Blockchain is to run the programming code of any a particular decentralized application.
Uses of Ethereum
Apart from being used as a trade able cryptocurrency, Ether is also used to make payments of transaction services and fees on the Ethereum network by application developers. Unlike Bitcoin whose aim is to cause disruptions to online banking and PayPal, Ethereum aim is to use a Blockchain to misplace the internet third parties. By third parties here we mean, those that transfer mortgages, store data as well keep track of complex financial instruments. It offers a decentralized Turing-complete virtual-machine known as the Ethereum Machine (EVM), which as the capability of executing scripts by use of an international network of public nodes. It also enables developers to build as well deploy decentralized applications.
How to Acquire Ether
Are you already attracted by Ethereum but you don’t know how to acquire ether? Relax now. There are many ways you can obtain ether tokens. You can either buy them on an exchange, or you can use the computer to “mine” them through complex math problems by use of computer software. The math problems become more complex as more coins are mined, to control the supply.
How to Trade Ether
Trading cryptocurrencies can be risky. I recommend you use a crypto signal service, such as CryptoSig.
|
{
"url": "http://peter-davies.org/category/news/",
"source_domain": "peter-davies.org",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "55680",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VNS2R4E6CIQ5TTHSCMLDLBWBLF2L6PGE",
"WARC-Concurrent-To": "<urn:uuid:f98934fd-6d25-43f8-a059-ede51b24c4ed>",
"WARC-Date": "2018-06-22T13:21:50Z",
"WARC-IP-Address": "208.167.241.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GP6XBYWKTKQC7LLPV4NXFC2FSCXH43JU",
"WARC-Record-ID": "<urn:uuid:053a45a9-8d72-4c62-9c29-93133d09fe9e>",
"WARC-Target-URI": "http://peter-davies.org/category/news/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d97426d8-797f-430d-b31e-9d3b8e183320>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-232-173-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,
19,
20,
1163,
1164,
1181,
1198,
1199,
1221,
1222,
1608,
1609,
1936,
1937,
1954,
1955,
2681,
2682,
2703,
2704,
3071,
3072,
3091,
3092
],
"line_end_idx": [
19,
20,
1163,
1164,
1181,
1198,
1199,
1221,
1222,
1608,
1609,
1936,
1937,
1954,
1955,
2681,
2682,
2703,
2704,
3071,
3072,
3091,
3092,
3194
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3194,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4592345952987671,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004991679918020964,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10648918151855469,
"rps_doc_frac_unique_words": 0.47654783725738525,
"rps_doc_mean_word_length": 4.863039493560791,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.998950481414795,
"rps_doc_word_count": 533,
"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.023148149251937866,
"rps_doc_frac_chars_top_3gram": 0.008487650193274021,
"rps_doc_frac_chars_top_4gram": 0.01311727985739708,
"rps_doc_books_importance": -255.22430419921875,
"rps_doc_books_importance_length_correction": -255.22430419921875,
"rps_doc_openwebtext_importance": -157.5345001220703,
"rps_doc_openwebtext_importance_length_correction": -157.5345001220703,
"rps_doc_wikipedia_importance": -104.72371673583984,
"rps_doc_wikipedia_importance_length_correction": -104.72371673583984
},
"fasttext": {
"dclm": 0.15719187259674072,
"english": 0.9562850594520569,
"fineweb_edu_approx": 2.5712685585021973,
"eai_general_math": 0.43037551641464233,
"eai_open_web_math": 0.22991842031478882,
"eai_web_code": 0.0369841493666172
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No 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
|
3,141,768,052,392,460,300 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I want to convert (this is as in Syabase SQL)
'09/29/2012 08:23:00' to '2012-09-29 08:23:00'
This what i have tried but failed
select convert(varchar,convert(datetime, '09/29/2012 08:23:00', 101),123)
share|improve this question
add comment
2 Answers
Try 120 instead of 123.
select convert(varchar(20),convert(datetime, '09/29/2012 08:23:00', 101),120)
See http://infocenter.sybase.com/help/index.jsp?topic=/com.sybase.infocenter.dc38151.1510/html/iqrefbb/Convert.htm
share|improve this answer
didn't worked out :( its says cannot convert 09/29/2012 08:23:00 to timestamp,SQL CODE=-157 – sayannayas Nov 19 '12 at 14:17
add comment
Im not sure where you are getting that date format from but if it is from a table in the database what you can do is use the following to convert the date directly from the table.
Lets assume the date is in a table called MyTable and the date column is called MyDate
SELECT dateformat(MyDate, 'YYYY-MM-DD HH:MM:SS')
FROM MyTable;
You can test this out with the current datetime using the following:
SELECT dateformat(getdate(), 'YYYY-MM-DD HH:MM:SS');
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/13455530/convert-mm-dd-yy-hrminsec-to-yyyy-mm-dd-hrminsec",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "64226",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z2TYXZXG2X6DOJOSWTII25PYQUD3PD5V",
"WARC-Concurrent-To": "<urn:uuid:3ff4de5f-c107-4436-8273-0a22d9635aa3>",
"WARC-Date": "2014-03-12T16:04:09Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5XWOUGHQS5QEGZ73CLJQ7C37AY7IPCM6",
"WARC-Record-ID": "<urn:uuid:d5714a62-19c6-4a97-97b5-5250aa857dc1>",
"WARC-Target-URI": "http://stackoverflow.com/questions/13455530/convert-mm-dd-yy-hrminsec-to-yyyy-mm-dd-hrminsec",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1d3a143-77c2-4eae-9da7-0236db64d785>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
204,
205,
252,
253,
287,
288,
363,
391,
403,
404,
414,
415,
439,
440,
520,
521,
636,
637,
663,
665,
791,
803,
804,
984,
985,
1072,
1073,
1122,
1136,
1137,
1206,
1207,
1260,
1286,
1298,
1299,
1311,
1312,
1314,
1322,
1323,
1401,
1402
],
"line_end_idx": [
25,
157,
158,
204,
205,
252,
253,
287,
288,
363,
391,
403,
404,
414,
415,
439,
440,
520,
521,
636,
637,
663,
665,
791,
803,
804,
984,
985,
1072,
1073,
1122,
1136,
1137,
1206,
1207,
1260,
1286,
1298,
1299,
1311,
1312,
1314,
1322,
1323,
1401,
1402,
1492
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1492,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2533692717552185,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.051212940365076065,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3962264060974121,
"rps_doc_frac_unique_words": 0.5990338325500488,
"rps_doc_mean_word_length": 5.53140115737915,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.573952674865723,
"rps_doc_word_count": 207,
"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.0489083006978035,
"rps_doc_frac_chars_top_3gram": 0.027947600930929184,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -184.75148010253906,
"rps_doc_books_importance_length_correction": -176.46853637695312,
"rps_doc_openwebtext_importance": -109.16148376464844,
"rps_doc_openwebtext_importance_length_correction": -109.16148376464844,
"rps_doc_wikipedia_importance": -46.44900131225586,
"rps_doc_wikipedia_importance_length_correction": -35.013694763183594
},
"fasttext": {
"dclm": 0.2809264063835144,
"english": 0.7925262451171875,
"fineweb_edu_approx": 1.287044882774353,
"eai_general_math": -0.000008820000402920414,
"eai_open_web_math": 0.0889621376991272,
"eai_web_code": -0.00000965999970503617
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "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
|
3,042,743,138,909,773,000 |
[ previous ] [ next ] [ threads ]
From: Adriano Castro <m0n0wall at adrianocastro dot net>
To: m0n0wall at lists dot m0n0 dot ch
Subject: Embedded PC: 2 vs 3 Ethernet Ports
Date: Fri, 29 Oct 2004 07:07:35 +0100
Hi,
First and foremost hi to every one. I'm a newbie to the list and
m0n0wall. I've been reading quite a lot about it and have been going
through the list as well.
I haven't tried m0n0wall yet but will do soon. I'll probably start
off using an old PC and either a hard-drive or the CD-ROM solution. But
the embedded PCs really interest me.
In the meantime, I've been reading about the latter ones and don't
fully understand the need or use of a 3rd Ethernet port (as in Soekris'
net4501-30 model). 2 ports make sense to me: WAN + LAN. I believe the
3rd port is commonly used for DMZ, correct?
If this is the case it kind of confuses me because I'm used to
having DMZs set-up virtually.
Can anyone enlighten me, please?
Terribly sorry if this question sounds awkward or even dumb but
there's a long way to go for me in the firewall/embedded PC world.
Thank you for your time and understanding.
AD
--
|
{
"url": "http://m0n0.ch/wall/list/showmsg.php?id=104/63",
"source_domain": "m0n0.ch",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "3942",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7UJV3UFS55LGGC7RXU4T4G7A6FAW3SEG",
"WARC-Concurrent-To": "<urn:uuid:c620f70c-76c1-4e9c-80b8-4ff370cdcbea>",
"WARC-Date": "2015-12-01T18:20:09Z",
"WARC-IP-Address": "37.48.77.141",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KP6TN5WZYCVK3BTDO4WEEWDK4FBOZFUQ",
"WARC-Record-ID": "<urn:uuid:9b3c90c8-2876-45ca-9333-198e7e1e3dd4>",
"WARC-Target-URI": "http://m0n0.ch/wall/list/showmsg.php?id=104/63",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c6828156-bda0-4eae-9e39-d3511a1cf956>"
},
"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,
1,
35,
37,
96,
136,
182,
222,
226,
227,
298,
368,
394,
395,
468,
541,
578,
579,
580,
653,
726,
797,
841,
842,
911,
941,
942,
943,
981,
982,
1052,
1119,
1120,
1121,
1169,
1170,
1171,
1179,
1180
],
"line_end_idx": [
1,
35,
37,
96,
136,
182,
222,
226,
227,
298,
368,
394,
395,
468,
541,
578,
579,
580,
653,
726,
797,
841,
842,
911,
941,
942,
943,
981,
982,
1052,
1119,
1120,
1121,
1169,
1170,
1171,
1179,
1180,
1182
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1182,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39179104566574097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05970149114727974,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23134328424930573,
"rps_doc_frac_unique_words": 0.676616907119751,
"rps_doc_mean_word_length": 4.213930130004883,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.714500904083252,
"rps_doc_word_count": 201,
"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.023612750694155693,
"rps_doc_frac_chars_top_3gram": 0.03305784985423088,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -115.34922790527344,
"rps_doc_books_importance_length_correction": -115.34922790527344,
"rps_doc_openwebtext_importance": -71.76912689208984,
"rps_doc_openwebtext_importance_length_correction": -71.67137908935547,
"rps_doc_wikipedia_importance": -57.34414291381836,
"rps_doc_wikipedia_importance_length_correction": -57.34414291381836
},
"fasttext": {
"dclm": 0.24248409271240234,
"english": 0.9423710703849792,
"fineweb_edu_approx": 0.9838402271270752,
"eai_general_math": 0.5239410400390625,
"eai_open_web_math": 0.4442560076713562,
"eai_web_code": 0.08428645133972168
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,641,339,529,018,341,000 |
Home » Tech News » Roblox error code 529
Roblox error code 529
If you’re an avid Roblox player, you might have encountered the frustrating Error Code 529. This error can disrupt your gaming experience, leaving you puzzled and irritated. But fear not, as this article will delve into the reasons behind Roblox Error Code 529 and provide you with step-by-step solutions to fix it. Whether you’re a beginner or a seasoned player, understanding and resolving this error is crucial to continue enjoying the immersive world of Roblox.
Understanding Roblox Error Code 529
Roblox Error Code 529, often accompanied by the message “HTTP 400 (Bad Request)”, occurs when the Roblox server encounters an issue processing your request. This error typically points towards problems related to your internet connection, browser settings, or conflicts within the game.
Roblox error code 529
Reasons Behind Roblox Error Code 529
1. Internet Connectivity Issues: Roblox heavily relies on a stable internet connection. Error Code 529 can occur due to weak or disrupted connectivity, inadequate bandwidth, high latency, or network congestion.
2. Browser-related Problems: Outdated browsers or those not optimized for Roblox can trigger the error. Browser extensions, plugins, or cookies can also interfere with the game’s functioning.
3. Corrupted Cache and Cookies: Accumulated cache and cookies can clash with the current game, leading to Error Code 529. Clearing them can resolve the issue.
4. Conflicts with Third-party Software: Applications like ad-blockers, antivirus software, or VPNs might block necessary connections, disrupting the game’s communication with the server.
How to fix Roblox error code 529?
Fix 1: Check Your Internet Connection
A stable internet connection is vital for uninterrupted Roblox gameplay. Follow these steps to ensure your connection is optimal:
1. Wired Connection: Whenever possible, use a wired connection instead of Wi-Fi. Wired connections offer greater stability and consistency.
2. Proximity to Router: If you’re using Wi-Fi, ensure you’re close to the router. Signal strength diminishes with distance, leading to potential disruptions.
3. Speed Test: Run an internet speed test to ensure your connection meets Roblox’s requirements. If your speed falls short, consider upgrading your plan.
4. Firewall and Security Settings: Check your firewall and security software settings. Ensure that they’re not blocking Roblox’s communication with the server. Adjust settings if needed.
By optimizing your internet connection, you can minimize the chances of encountering Error Code 529 and enjoy smoother Roblox gameplay.
Fix 2: Optimize Browser Settings
Your browser plays a crucial role in your Roblox experience. Follow these steps to ensure your browser is properly configured:
1. Roblox-compatible Browser: Use a browser officially supported by Roblox, such as Google Chrome or Mozilla Firefox, for optimal performance.
2. Browser Update: Keep your browser up-to-date with the latest version. Updates often include fixes and optimizations for compatibility.
3. Disable Extensions: Disable unnecessary browser extensions and plugins before launching Roblox. Some extensions might conflict with the game’s functioning.
4. Clear Browsing Data: Regularly clear your browser’s cache and cookies. These can accumulate over time and cause conflicts with the game. Restart the browser after clearing data.
By following these steps, you can create a more stable environment for Roblox gameplay and reduce the likelihood of encountering Error Code 529.
Fix 3: Temporarily Disable Third-party Applications
Certain third-party applications can interfere with Roblox’s communication with the server. Consider these steps to mitigate conflicts:
1. Disable Applications: Temporarily turn off third-party applications like ad-blockers, antivirus software, and VPNs before launching Roblox.
2. Diagnose Conflict: Launch Roblox after disabling the applications. If the error doesn’t appear, one of these applications might be causing the issue.
3. Adjust Settings: If a specific application is causing conflicts, adjust its settings to allow Roblox’s connections. Alternatively, seek alternatives that are more compatible with the game.
By identifying and managing conflicts with third-party applications, you can minimize the chances of encountering Error Code 529 during your Roblox sessions.
Fix 4: Clear Browser Cache and Cookies
Accumulated browser cache and cookies can often lead to conflicts causing Roblox Error Code 529. Here’s how to clear them:
1. Access Browser Settings: Depending on your browser, locate the settings menu. This is usually represented by three vertical dots or lines in the upper-right corner.
2. Navigate to Privacy or History: Look for options related to privacy or browsing history within the settings menu.
3. Clear Browsing Data: Click on the option to clear browsing data. You’ll typically have the choice to clear cookies, cache, and other browsing-related information.
4. Select Time Range: Choose the time range for which you want to clear data. Select “All time” to remove all accumulated data.
5. Clear Data: Confirm the action and let the browser clear the cache and cookies.
6. Restart Browser: After clearing the data, close and reopen the browser. This ensures that the changes take effect.
By regularly clearing your browser’s cache and cookies, you can prevent conflicts and keep your Roblox gameplay experience smooth and error-free.
Fix 5: Update Graphics Drivers
Outdated or incompatible graphics drivers can sometimes contribute to Roblox Error Code 529. Follow these steps to update your graphics drivers:
1. Identify Your Graphics Card: Determine the make and model of your graphics card. You can find this information in your system’s Device Manager.
2. Visit Manufacturer’s Website: Visit the official website of your graphics card manufacturer (e.g., NVIDIA, AMD, Intel).
3. Download Latest Drivers: Locate the “Drivers” or “Support” section on the manufacturer’s website. Search for the latest drivers for your specific graphics card model.
4. Download and Install: Download the latest drivers for your graphics card and follow the installation instructions provided on the website.
5. Restart Your System: After installing the new drivers, restart your computer to ensure the changes take effect.
Updating your graphics drivers can improve compatibility with Roblox and potentially resolve Error Code 529, enhancing your gaming experience.
Fix 6: Disable Browser Extensions
Certain browser extensions can interfere with Roblox’s functionality and trigger Error Code 529. To address this, consider disabling extensions:
1. Access Extension Settings: Open your browser’s settings and locate the “Extensions” or “Add-ons” section.
2. Disable Extensions: Identify extensions that might be affecting Roblox. Disable them one by one.
3. Restart Browser: After disabling extensions, close and reopen your browser. Check if the error persists.
4. Enable Extensions Selectively: If the error disappears after disabling extensions, enable them one by one to identify the culprit.
5. Remove Problematic Extensions: If you identify a specific extension causing the error, consider removing it or finding an alternative.
By managing browser extensions, you can create a more stable environment for Roblox and mitigate the chances of encountering Error Code 529.
Fix 7: Check Firewall and Antivirus Settings
Firewall and antivirus software can sometimes mistakenly block Roblox’s connections, leading to Error Code 529. Here’s how to ensure they aren’t causing the issue:
1. Firewall Settings: Access your computer’s firewall settings. You can usually find these in the Control Panel or Security settings.
2. Add Exception: Look for an option to add exceptions or allow applications through the firewall. Add Roblox to the list of allowed applications.
3. Antivirus Software: Similarly, access your antivirus software’s settings. Look for options related to application blocking or network protection.
4. Whitelist Roblox: Add Roblox to the antivirus software’s whitelist or list of trusted applications.
5. Test the Game: After making these changes, launch Roblox and see if Error Code 529 still occurs.
By ensuring that your firewall and antivirus settings are not interfering with Roblox’s connections, you can enjoy uninterrupted gaming sessions without encountering Error Code 529.
Fix 8: Contact Roblox Support
If the previous fixes haven’t resolved Roblox Error Code 529, it’s time to seek assistance from Roblox’s support team. Here’s what you should do:
1. Gather Information: Before reaching out to support, gather relevant information. Note down the exact error message, any steps you’ve taken to troubleshoot, and your system specifications.
2. Visit Roblox Support: Go to Roblox’s official support website. Look for the “Contact Us” or “Help” section, where you can find ways to get in touch with the support team.
3. Provide Details: When contacting support, provide detailed information about the error. Mention any specific circumstances that lead to the error, as well as the troubleshooting steps you’ve tried.
4. Follow Instructions: The support team might provide you with specific instructions tailored to your situation. Follow these instructions carefully to address the issue.
By reaching out to Roblox’s support, you can tap into their expertise and receive personalized guidance to overcome Roblox Error Code 529 and resume your immersive gaming experience.
Preventing Roblox Error Code 529
To minimize the chances of encountering Roblox Error Code 529 and ensure a seamless gaming experience, consider the following preventive measures:
• 1. Regularly Clear Cache and Cookies: Keep your browser’s cache and cookies in check by clearing them regularly. This prevents conflicts that can lead to Error Code 529.
• 2. Keep Graphics Drivers Updated: Ensure your graphics drivers are up to date to maintain compatibility with Roblox’s requirements and prevent potential errors.
• 3. Use Supported Browsers: Stick to officially supported browsers like Google Chrome or Mozilla Firefox. This reduces the likelihood of compatibility issues.
• 4. Manage Extensions Wisely: Be selective about browser extensions. Disable or remove those that might interfere with Roblox’s functioning.
• 5. Disable Third-party Applications: Temporarily disable ad-blockers, VPNs, and antivirus software when playing Roblox to prevent conflicts.
• 6. Optimize Internet Connection: Maintain a stable and reliable internet connection to prevent disruptions that can trigger Error Code 529.
• 7. Check Firewall and Security Settings: Regularly review your firewall and security software settings, ensuring they don’t unintentionally block Roblox connections.
• 8. Monitor System Resources: Close resource-intensive applications running in the background to free up system resources for smooth Roblox gameplay.
• 9. Stay Informed: Keep an eye on Roblox’s official announcements for any updates, patches, or known issues that might affect gameplay.
• 10. Contact Support: If you encounter persistent issues or unfamiliar errors, don’t hesitate to reach out to Roblox’s support team for guidance.
By implementing these preventive tips, you can proactively avoid Roblox Error Code 529 and immerse yourself in the world of Roblox without interruption.
Conclusion
Roblox Error Code 529 might be a stumbling block, but armed with the insights provided in this article, you’re better equipped to overcome it. From understanding the root causes of the error to implementing effective fixes, you can now navigate through the complexities of Error Code 529 with confidence. Remember that a stable internet connection, optimized browser settings, and careful consideration of third-party applications can go a long way in ensuring your uninterrupted Roblox gaming experience. If all else fails, Roblox’s support team is there to assist you on your journey to error-free gameplay. So, dive back into the virtual world of Roblox, armed with the knowledge to conquer any obstacle that comes your way.
FAQs
What is Roblox Error Code 529?
Roblox Error Code 529 occurs when the server faces trouble processing a request.
Why does this error pop up?
It happens due to internet problems, browser issues, cache conflicts, or third-party apps.
How can I fix internet-related problems?
Opt for a wired connection, stay close to the router, and check speed to troubleshoot.
Can browser problems lead to this error?
Outdated browsers or extensions can create conflicts triggering Error Code 529.
What’s the deal with cache and cookies?
Accumulated cache and cookies can clash with the game, causing this error. Clear them.
What if I’ve tried everything and the error persists?
Contact Roblox support with error details for specialized assistance to overcome Error Code 529.
Similar Posts
|
{
"url": "https://basicknowledgehub.com/roblox-error-code-529/",
"source_domain": "basicknowledgehub.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "173244",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:URYY7Z7A6XPSYZNKKJ4WV72BMKWKGS7E",
"WARC-Concurrent-To": "<urn:uuid:acf05297-a90b-4b4b-b211-adb7a062af55>",
"WARC-Date": "2023-10-04T06:45:17Z",
"WARC-IP-Address": "104.21.92.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WZ4LFH655GSJWH6XNEBWK67SLMUIVL2K",
"WARC-Record-ID": "<urn:uuid:3a8f611e-f013-4a48-bd12-f18a8be80011>",
"WARC-Target-URI": "https://basicknowledgehub.com/roblox-error-code-529/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:45be387d-11dc-4d4a-935d-a6e9f4281d7f>"
},
"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-168\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,
41,
42,
64,
65,
531,
532,
568,
569,
856,
857,
879,
880,
917,
918,
1131,
1325,
1486,
1675,
1676,
1710,
1711,
1749,
1750,
1880,
1881,
2023,
2183,
2339,
2528,
2529,
2665,
2666,
2699,
2700,
2827,
2828,
2973,
3113,
3274,
3457,
3458,
3603,
3604,
3656,
3657,
3793,
3794,
3939,
4094,
4288,
4289,
4447,
4448,
4487,
4488,
4611,
4612,
4782,
4901,
5069,
5199,
5284,
5404,
5405,
5551,
5552,
5583,
5584,
5729,
5730,
5879,
6004,
6176,
6320,
6437,
6438,
6581,
6582,
6616,
6617,
6762,
6763,
6874,
6976,
7086,
7222,
7362,
7363,
7504,
7505,
7550,
7551,
7715,
7716,
7852,
8001,
8152,
8257,
8359,
8360,
8542,
8543,
8573,
8574,
8720,
8721,
8914,
9090,
9293,
9467,
9468,
9651,
9652,
9685,
9686,
9833,
9834,
10008,
10173,
10335,
10479,
10624,
10768,
10938,
11091,
11230,
11379,
11380,
11533,
11534,
11545,
11546,
12274,
12275,
12280,
12281,
12312,
12313,
12394,
12395,
12423,
12424,
12515,
12516,
12557,
12558,
12645,
12646,
12687,
12688,
12768,
12769,
12809,
12810,
12897,
12898,
12952,
12953,
13050,
13051
],
"line_end_idx": [
41,
42,
64,
65,
531,
532,
568,
569,
856,
857,
879,
880,
917,
918,
1131,
1325,
1486,
1675,
1676,
1710,
1711,
1749,
1750,
1880,
1881,
2023,
2183,
2339,
2528,
2529,
2665,
2666,
2699,
2700,
2827,
2828,
2973,
3113,
3274,
3457,
3458,
3603,
3604,
3656,
3657,
3793,
3794,
3939,
4094,
4288,
4289,
4447,
4448,
4487,
4488,
4611,
4612,
4782,
4901,
5069,
5199,
5284,
5404,
5405,
5551,
5552,
5583,
5584,
5729,
5730,
5879,
6004,
6176,
6320,
6437,
6438,
6581,
6582,
6616,
6617,
6762,
6763,
6874,
6976,
7086,
7222,
7362,
7363,
7504,
7505,
7550,
7551,
7715,
7716,
7852,
8001,
8152,
8257,
8359,
8360,
8542,
8543,
8573,
8574,
8720,
8721,
8914,
9090,
9293,
9467,
9468,
9651,
9652,
9685,
9686,
9833,
9834,
10008,
10173,
10335,
10479,
10624,
10768,
10938,
11091,
11230,
11379,
11380,
11533,
11534,
11545,
11546,
12274,
12275,
12280,
12281,
12312,
12313,
12394,
12395,
12423,
12424,
12515,
12516,
12557,
12558,
12645,
12646,
12687,
12688,
12768,
12769,
12809,
12810,
12897,
12898,
12952,
12953,
13050,
13051,
13064
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13064,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28317487239837646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0024803599808365107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21455146372318268,
"rps_doc_frac_unique_words": 0.2837907671928406,
"rps_doc_mean_word_length": 5.500258922576904,
"rps_doc_num_sentences": 177,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4855499267578125,
"rps_doc_word_count": 1931,
"rps_doc_frac_chars_dupe_10grams": 0.01996045932173729,
"rps_doc_frac_chars_dupe_5grams": 0.11835043877363205,
"rps_doc_frac_chars_dupe_6grams": 0.06741361320018768,
"rps_doc_frac_chars_dupe_7grams": 0.041615668684244156,
"rps_doc_frac_chars_dupe_8grams": 0.038226161152124405,
"rps_doc_frac_chars_dupe_9grams": 0.02805761992931366,
"rps_doc_frac_chars_top_2gram": 0.02965822070837021,
"rps_doc_frac_chars_top_3gram": 0.039544299244880676,
"rps_doc_frac_chars_top_4gram": 0.030505599454045296,
"rps_doc_books_importance": -1526.56689453125,
"rps_doc_books_importance_length_correction": -1526.56689453125,
"rps_doc_openwebtext_importance": -751.5504150390625,
"rps_doc_openwebtext_importance_length_correction": -751.5504150390625,
"rps_doc_wikipedia_importance": -537.316162109375,
"rps_doc_wikipedia_importance_length_correction": -537.316162109375
},
"fasttext": {
"dclm": 0.8860735297203064,
"english": 0.8417795896530151,
"fineweb_edu_approx": 1.739720344543457,
"eai_general_math": 0.007267060223966837,
"eai_open_web_math": 0.08997958898544312,
"eai_web_code": 0.03599214926362038
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
3,002,347,754,486,396,400 |
CoreImage.CISmoothLinearGradient Class
A filter that produces a gradient along a linear axis between two endpoints.
See Also: CISmoothLinearGradient Members
Syntax
[ObjCRuntime.iOS(6, 0)]
public class CISmoothLinearGradient : CILinearGradient
Remarks
The following example shows this filter in use
C# Example
// Create a CISmoothLinearGradient filter with the input image
var point0 = new CIVector(0, 0); // Default [0 0]
var point1 = new CIVector(250, 250); // Default [200 200]
var smoothLinear_gradient = new CISmoothLinearGradient()
{
Point0 = point0,
Point1 = point1,
Color0 = new CIColor (UIColor.Red),
Color1 = new CIColor (UIColor.Blue)
};
// Get the altered image from the filter
var output = new CICrop {
Image = smoothLinear_gradient.OutputImage,
Rectangle = new CIVector (0, 0, 400, 300)
}.OutputImage;
// To render the results, we need to create a context, and then
// use one of the context rendering APIs, in this case, we render the
// result into a CoreGraphics image, which is merely a useful representation
//
var context = CIContext.FromOptions (null);
var cgimage = context.CreateCGImage (output, output.Extent);
// The above cgimage can be added to a screen view, for example, this
// would add it to a UIImageView on the screen:
myImageView.Image = UIImage.FromImage (cgimage);
Produces the following output:
Requirements
Namespace: CoreImage
Assembly: Xamarin.iOS (in Xamarin.iOS.dll)
Assembly Versions: 0.0.0.0
|
{
"url": "http://docs.go-mono.com/monodoc.ashx?link=T%3ACoreImage.CISmoothLinearGradient",
"source_domain": "docs.go-mono.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "19940",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F77SNOMZVEKNS3YBIUIV3IBYHTO5L2DS",
"WARC-Concurrent-To": "<urn:uuid:c0bba093-ff7f-4cf9-9153-ce5f0b1d0aba>",
"WARC-Date": "2019-01-17T05:15:30Z",
"WARC-IP-Address": "13.68.229.189",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DBPAS7ZIJGN3ICLUMTHCYGVD5WPQJHBZ",
"WARC-Record-ID": "<urn:uuid:42ba9eb3-3b04-483e-833b-819c2e5d4981>",
"WARC-Target-URI": "http://docs.go-mono.com/monodoc.ashx?link=T%3ACoreImage.CISmoothLinearGradient",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c3765b8-83a8-4018-ab38-3949b5758d97>"
},
"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-145-104-113.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,
39,
116,
117,
158,
159,
166,
167,
191,
246,
247,
255,
256,
303,
304,
315,
316,
379,
429,
487,
544,
546,
564,
582,
619,
656,
659,
660,
701,
727,
771,
814,
829,
830,
894,
964,
1041,
1044,
1088,
1089,
1150,
1151,
1221,
1269,
1318,
1327,
1328,
1359,
1360,
1373,
1374,
1395,
1438
],
"line_end_idx": [
39,
116,
117,
158,
159,
166,
167,
191,
246,
247,
255,
256,
303,
304,
315,
316,
379,
429,
487,
544,
546,
564,
582,
619,
656,
659,
660,
701,
727,
771,
814,
829,
830,
894,
964,
1041,
1044,
1088,
1089,
1150,
1151,
1221,
1269,
1318,
1327,
1328,
1359,
1360,
1373,
1374,
1395,
1438,
1464
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1464,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0.0027322398964315653,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21212120354175568,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006734009832143784,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38383838534355164,
"rps_doc_frac_unique_words": 0.598901093006134,
"rps_doc_mean_word_length": 6.093406677246094,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.003367000026628375,
"rps_doc_unigram_entropy": 4.417708396911621,
"rps_doc_word_count": 182,
"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.021641120314598083,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -118.32134246826172,
"rps_doc_books_importance_length_correction": -112.67410278320312,
"rps_doc_openwebtext_importance": -62.71003341674805,
"rps_doc_openwebtext_importance_length_correction": -62.71003341674805,
"rps_doc_wikipedia_importance": -29.343557357788086,
"rps_doc_wikipedia_importance_length_correction": -19.74044418334961
},
"fasttext": {
"dclm": 0.24362516403198242,
"english": 0.5608732104301453,
"fineweb_edu_approx": 3.395418405532837,
"eai_general_math": 0.8420822024345398,
"eai_open_web_math": 0.1299571394920349,
"eai_web_code": 0.9843528270721436
}
}
|
{
"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": "681.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Clocks and watches and Scientific apparatus and instruments"
}
}
},
"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": "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
|
5,399,113,579,644,463,000 |
Glossary: IPv4
What is IPv4?
What is IPv4? Our primer on IPv4
The short answer to the question, “What is IPv4?”, is that it’s the fourth version of the internet protocol. IP, which stands for internet protocol, is the internet’s principal communications protocol.
In place for more than 35 years, the U.S. Department of Defense first deployed IPv4 on its ARPANET (Advanced Research Projects Agency Network) in 1983.
Internet protocol version 4, IPv4, is also at a crossroads: its global IP address supply is exhausted. The internet is undergoing a gradual transition to the next version, IPv6, but not without challenges.
In this glossary entry, we’ll explore the basic components of the internet and how they work together, examine the fourth internet protocol version and its modern-day shortcomings, and touch on its IPv6 successor.
Before IPv4, a little more on how the internet works
More details on IP
IP is part of an internet protocol suite, which also includes the transmission control protocol. Together, these two are known as TCP/IP. The internet protocol suite governs packetizing, addressing, transmitting, routing, and receiving data over networks.
IP addressing is a logical means of assigning addresses to devices on a network. Each device connected to the internet requires a unique IP address.
Most networks that handle internet traffic are packet-switched. Small units of data, called packets, are routed through a network. A source host, like your computer, delivers these IP packets to a destination host, such as a server, based on IP addresses in packet headers. Packet-switching allows many users on a network to share the same data path.
An IP address has two parts—-one part identifies the host, such as a computer or other device. And the other part identifies the network it belongs to. TCP/IP uses a subnet mask to separate them.
How DNS fits in the picture
DNS, or domain name system, is the phone book of the internet. It translates domain names that we easily remember, like bluecatnetworks.com, into IP addresses like 104.239.197.100, which are the language of the internet.
DNS allows computers, servers, and other networked devices, each with their unique IP addresses, to talk to each other. And it gets users to the website they’re looking for.
Even in an increasingly complex IT landscape, your network team can thrive.
Now, exactly what is IPv4?
A series of decimal numbers, also known as the 32-bit format, defines IPv4 addresses. The standard format is x.x.x.x, a dot-decimal notation, where each x can be any value between 0 and 255. For example, a 32-bit IP address is 192.0.1.246.
What is IPv4?
IPv4 still routes most of today’s internet traffic. A 32-bit address space limits the number of unique hosts to 232, which is nearly 4.3 billion IPv4 addresses for the world to use (4,294,967,296, to be exact).
Today, we’ve run out
Think about it: How many connected devices are in your household?
The median American household has five devices, including smartphones, computers and laptops, tablets, and streaming media devices. That doesn’t even include the range of devices that fall under the internet of things (IoT) category, such as connected thermostats, smart speakers, and doorbell cameras.
So, in today’s ultra-connected world, where every stationary and mobile device now has an IP address, it turns out that 4.3 billion of them isn’t nearly enough.
In 2011, the Internet Assigned Numbers Authority (IANA), the global coordinator of IP addressing, ran out of IPv4 address space to allocate to regional registries. And regional registries have since depleted those allocations.
In 2015, the American Registry for Internet Numbers (ARIN), the regional registry for North America, began turning down requests for new blocks of numbers on IPv4. ARIN now has a waiting list for IPv4 space.
Additional limitations
Besides running out of address space, IPv4 has some additional downsides:
About 18 million IPv4 addresses were set aside for private addressing, drawn from a range known as RFC 1918. Most organizations use IPv4 private addresses on internal networks. However, these devices have no direct path to the public internet.
To access the public internet, devices with private addresses require a complex and resource-intensive workaround called network address translation (NAT).
Furthermore, North America got the lion’s share of IPv4 address allocations. As a result, entities in Asia-Pacific and elsewhere, where internet use has exploded, have purchased large chunks of IP space on the gray market. This has broken up contiguous ranges of IP addresses and made it more complicated to route internet traffic.
To replace IPv4, enter IPv6
To address this problem, the internet is undergoing a gradual transition to IPv6. The latest version of the internet protocol, IPv6 internet addressing uses 128-bit address space, with both letters and numbers in identifiers (for example, 2002:db8::8a3f:362:7897). IPv6 has 2128 addresses, which is about 340 undecillion or 340 billion billion billion.
IPv4 vs IPv6
IPv6 has some obvious advantages, the primary one being that it’s a lot more space. With IPv6, a single network can have more IPv6 addresses than the entire IPv4 address space.
It seems easy enough, but IPv4 and IPv6 are not directly interoperable. IPv6 is not the easiest protocol to walk into. It’s a big undertaking fraught with challenges. And when it comes to transitioning to IPv6 DNS, BlueCat is at the ready to help.
|
{
"url": "https://www.bluecatnetworks.com/glossary/what-is-ipv4/",
"source_domain": "www.bluecatnetworks.com",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "61073",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NIFE7K4QK2PFWCX7URXEEMY4V7WKFY6T",
"WARC-Concurrent-To": "<urn:uuid:e0cf1314-a318-4689-9c62-9fafe454e966>",
"WARC-Date": "2019-12-08T00:14:08Z",
"WARC-IP-Address": "104.239.197.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WRBCU4LPFJCG5QKHLI4F5226K536PGO7",
"WARC-Record-ID": "<urn:uuid:57f15802-d07c-4891-ae36-a23ba2917922>",
"WARC-Target-URI": "https://www.bluecatnetworks.com/glossary/what-is-ipv4/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32542315-297f-460c-bee9-b71ee014a661>"
},
"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-9.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,
15,
16,
30,
31,
64,
65,
267,
268,
420,
421,
627,
628,
842,
843,
896,
897,
916,
917,
1173,
1174,
1323,
1324,
1675,
1676,
1872,
1873,
1901,
1902,
2123,
2124,
2298,
2299,
2375,
2376,
2403,
2404,
2644,
2645,
2659,
2660,
2871,
2872,
2893,
2894,
2960,
2961,
3264,
3265,
3426,
3427,
3654,
3655,
3863,
3864,
3887,
3888,
3962,
3963,
4207,
4208,
4364,
4365,
4697,
4698,
4726,
4727,
5080,
5081,
5094,
5095,
5272,
5273
],
"line_end_idx": [
15,
16,
30,
31,
64,
65,
267,
268,
420,
421,
627,
628,
842,
843,
896,
897,
916,
917,
1173,
1174,
1323,
1324,
1675,
1676,
1872,
1873,
1901,
1902,
2123,
2124,
2298,
2299,
2375,
2376,
2403,
2404,
2644,
2645,
2659,
2660,
2871,
2872,
2893,
2894,
2960,
2961,
3264,
3265,
3426,
3427,
3654,
3655,
3863,
3864,
3887,
3888,
3962,
3963,
4207,
4208,
4364,
4365,
4697,
4698,
4726,
4727,
5080,
5081,
5094,
5095,
5272,
5273,
5520
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5520,
"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.3354147970676422,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0321141816675663,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20695807039737701,
"rps_doc_frac_unique_words": 0.4277588129043579,
"rps_doc_mean_word_length": 5.023890972137451,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.276012420654297,
"rps_doc_word_count": 879,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.032155800610780716,
"rps_doc_frac_chars_dupe_6grams": 0.019474640488624573,
"rps_doc_frac_chars_dupe_7grams": 0.019474640488624573,
"rps_doc_frac_chars_dupe_8grams": 0.019474640488624573,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029891299083828926,
"rps_doc_frac_chars_top_3gram": 0.014719200320541859,
"rps_doc_frac_chars_top_4gram": 0.006340580061078072,
"rps_doc_books_importance": -395.2798767089844,
"rps_doc_books_importance_length_correction": -395.2798767089844,
"rps_doc_openwebtext_importance": -254.03663635253906,
"rps_doc_openwebtext_importance_length_correction": -254.03663635253906,
"rps_doc_wikipedia_importance": -239.0267791748047,
"rps_doc_wikipedia_importance_length_correction": -239.0267791748047
},
"fasttext": {
"dclm": 0.7729538679122925,
"english": 0.9177631139755249,
"fineweb_edu_approx": 2.896986961364746,
"eai_general_math": 0.2767006754875183,
"eai_open_web_math": 0.26798194646835327,
"eai_web_code": 0.23674243688583374
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
2,838,171,400,096,156,000 |
Was this month's cook-off unrated?
The ratings haven’t been updated yet, normally they get updated in a few hours, but there hasn’t been any announcement either…
Similar thread: Is cook109 is unrated?
1 Like
It’s not unrated, i think due to massive plagiarism during AUG19 , when they update ratings this time simultaneously ratings will also drop for the accused. If it was unrated it would have been mentioned in announcement section. So hold your excitement :wink: solve some more problems meanwhile :smile:
3 Likes
The Codechef Team hasn’t yet decided upon that. It might be rated or unrated.
This is because of the problem WARRIORS. Lets hold our excitement and wait for the decision of the Codechef Team. They will do the needful. It will probably take a a day or two to sort out the matters related to the cook-off.:slight_smile:
What was wrong with that problem?
1 Like
See the homepage of COOK109. You will find out yourself
1 Like
|
{
"url": "https://discuss.codechef.com/t/was-this-months-cook-off-unrated/35425",
"source_domain": "discuss.codechef.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "22102",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZTHIBD3HO6VPVY3KJUUMLNO4XCOXKUAQ",
"WARC-Concurrent-To": "<urn:uuid:acf9f5e4-6836-4afc-800f-9afa86d7813b>",
"WARC-Date": "2020-09-20T18:58:11Z",
"WARC-IP-Address": "52.54.40.124",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X3LV3BNGZUZHGQG6DMVCLP5AYIFUQMMZ",
"WARC-Record-ID": "<urn:uuid:01d77f52-214b-4f04-86e7-8a58eab64489>",
"WARC-Target-URI": "https://discuss.codechef.com/t/was-this-months-cook-off-unrated/35425",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c621258-096a-4d07-8554-8587c782cb6d>"
},
"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-150.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,
35,
36,
163,
164,
203,
204,
211,
212,
515,
516,
524,
525,
603,
843,
844,
878,
879,
886,
887,
943,
944
],
"line_end_idx": [
35,
36,
163,
164,
203,
204,
211,
212,
515,
516,
524,
525,
603,
843,
844,
878,
879,
886,
887,
943,
944,
950
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 950,
"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.42211055755615234,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015075379982590675,
"rps_doc_frac_lines_end_with_ellipsis": 0.04545455053448677,
"rps_doc_frac_no_alph_words": 0.17085427045822144,
"rps_doc_frac_unique_words": 0.6521739363670349,
"rps_doc_mean_word_length": 4.670807361602783,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.005025130230933428,
"rps_doc_unigram_entropy": 4.46518087387085,
"rps_doc_word_count": 161,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019946809858083725,
"rps_doc_frac_chars_top_3gram": 0.03989361971616745,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -108.23614501953125,
"rps_doc_books_importance_length_correction": -108.23614501953125,
"rps_doc_openwebtext_importance": -64.85523986816406,
"rps_doc_openwebtext_importance_length_correction": -51.89501953125,
"rps_doc_wikipedia_importance": -45.535484313964844,
"rps_doc_wikipedia_importance_length_correction": -45.535484313964844
},
"fasttext": {
"dclm": 0.024526240304112434,
"english": 0.9442150592803955,
"fineweb_edu_approx": 0.8331953287124634,
"eai_general_math": 0.12539058923721313,
"eai_open_web_math": 0.48090171813964844,
"eai_web_code": 0.0013111199950799346
}
}
|
{
"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": "302.2",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,313,571,125,240,130,600 |
View Full Version : Random shut-downs
erikg88
May 27, 2006, 01:34 AM
Recently, when I've played civ for as long as 5-30 minutes, I have been experiencing crashes. And not just crashes - the computer actually shuts down, all of a sudden.
This leads me to believe that it might be a ventilation issue for the computer and the fans aren't doing the job - but why would this problem make itself known now? I've been successfully playing Civ since release without the slightest hiccups, so what could be different between now and then?
I'm playing 1.61 and I'm not running any extra programs - the computer feels a normal temperature when I put my hand to it, and it doesn't sound like it is laboring to play the game - just all of a sudden, ZAP. Reboot.
So I dunno what's going on... let's just say I'm glad Civ autosaves, otherwise my most recent game would have been a total loss.
Thanks for any help.
Zanmato
May 27, 2006, 05:10 AM
Any random shutdown, not a reboot would suggest a heat problem at the CPU. I would open the case and give it a good dusting around the graphics card and CPU heatsink and fan. A buildup of dust somewhere might be just enough to tip the over the edge. Try playing with the case open and see how it handles it. I've noticed recently since it's get warmer here that my computer's CPU temp has raisen by a couple of degrees so it can be down to the room temp aswell - abit absurd I know but it could be partly that too.
erikg88
May 27, 2006, 02:49 PM
Any random shutdown, not a reboot would suggest a heat problem at the CPU. I would open the case and give it a good dusting around the graphics card and CPU heatsink and fan. A buildup of dust somewhere might be just enough to tip the over the edge. Try playing with the case open and see how it handles it. I've noticed recently since it's get warmer here that my computer's CPU temp has raisen by a couple of degrees so it can be down to the room temp aswell - abit absurd I know but it could be partly that too.
Thanks very much for the post - I think you've diagnosed it correctly. It seems pretty dusty in there, but unfortunately, I don't have one of those spray-bottles that can shoot air in there. It's a compact PC, so I can't really dust without undue hassle, but I think once I do, it should be good. I tried playing with the case off, and results were pretty good - I had enough time to wipe out Hatty and half of Asoka's empires before I got my shut down.
crunch
May 28, 2006, 01:00 PM
vacuum cleaning, anyone?
Zanmato
May 29, 2006, 07:11 AM
vacuum cleaning, anyone?
It's an idea. Though I would think getting one of those 'Air Blaster' cans with a thin long noozle would be better for getting into the heatsink. I'm sure you'll be able to get one in a good computer shop.
nib51
May 29, 2006, 09:51 AM
I too have been having random crashes, but I only noticed it after I upgraded to 1 GB of RAM, I put back in 512 and now no more crashes???
|
{
"url": "http://forums.civfanatics.com/archive/index.php/t-172417.html",
"source_domain": "forums.civfanatics.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "7691",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3IIOQM7YMVF4XJDELIN447LVETK5AU25",
"WARC-Concurrent-To": "<urn:uuid:acb9747b-6186-4738-b68e-74229ed6cab3>",
"WARC-Date": "2014-11-24T06:50:47Z",
"WARC-IP-Address": "38.68.5.156",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KCFEQNQVZUVJQYTKPQRI4VQHHSCJI3YD",
"WARC-Record-ID": "<urn:uuid:40814dee-d8cf-44a4-a863-251b33f831cd>",
"WARC-Target-URI": "http://forums.civfanatics.com/archive/index.php/t-172417.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6c38800a-0dde-4ec1-8fa8-f89f45c24715>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 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,
1,
39,
40,
41,
49,
72,
240,
241,
535,
536,
755,
756,
885,
886,
907,
908,
916,
939,
1454,
1455,
1463,
1486,
2001,
2002,
2456,
2457,
2464,
2487,
2512,
2513,
2521,
2544,
2569,
2570,
2776,
2777,
2783,
2806
],
"line_end_idx": [
1,
39,
40,
41,
49,
72,
240,
241,
535,
536,
755,
756,
885,
886,
907,
908,
916,
939,
1454,
1455,
1463,
1486,
2001,
2002,
2456,
2457,
2464,
2487,
2512,
2513,
2521,
2544,
2569,
2570,
2776,
2777,
2783,
2806,
2944
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2944,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4365994334220886,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06628242135047913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19308356940746307,
"rps_doc_frac_unique_words": 0.4290843904018402,
"rps_doc_mean_word_length": 4.052064418792725,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0014409200521185994,
"rps_doc_unigram_entropy": 5.051391124725342,
"rps_doc_word_count": 557,
"rps_doc_frac_chars_dupe_10grams": 0.35622507333755493,
"rps_doc_frac_chars_dupe_5grams": 0.35622507333755493,
"rps_doc_frac_chars_dupe_6grams": 0.35622507333755493,
"rps_doc_frac_chars_dupe_7grams": 0.35622507333755493,
"rps_doc_frac_chars_dupe_8grams": 0.35622507333755493,
"rps_doc_frac_chars_dupe_9grams": 0.35622507333755493,
"rps_doc_frac_chars_top_2gram": 0.015507309697568417,
"rps_doc_frac_chars_top_3gram": 0.01196277979761362,
"rps_doc_frac_chars_top_4gram": 0.02392555959522724,
"rps_doc_books_importance": -341.9920654296875,
"rps_doc_books_importance_length_correction": -341.9920654296875,
"rps_doc_openwebtext_importance": -191.11756896972656,
"rps_doc_openwebtext_importance_length_correction": -191.11756896972656,
"rps_doc_wikipedia_importance": -180.33270263671875,
"rps_doc_wikipedia_importance_length_correction": -180.33270263671875
},
"fasttext": {
"dclm": 0.05379832163453102,
"english": 0.9790068864822388,
"fineweb_edu_approx": 0.9785072803497314,
"eai_general_math": 0.6339125037193298,
"eai_open_web_math": 0.3000895380973816,
"eai_web_code": 0.2913215160369873
}
}
|
{
"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.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,362,949,984,302,620,000 |
naughty_or_ice: (Default)
[personal profile] naughty_or_ice
Title:
Icon Downloads
Area:
icons
Summary:
Ability to download all current icons on your journal (active or inactive).
Description:
I know that I'm not the only one that sometimes looks at their long list of icons after some kind of computer failure, and wants to back them up on the new machine. Or maybe they were linked by a url and you forgot to save them. Maybe you stopped having a paid account, but want to be able to reupload them with ease after you get a chance to pay for the account again (Submitting another suggestion on this topic as well).
I think it would be very helpful if there were some option that would let you batch save the image files currently on your account, preferably with the keyword or description as the name. Compression has improved and should allow users to download a backup of their icons in a zip file they can unpack on their computer.
In addition and/or alternatively, perhaps there is some way to make a metadata file that would take less room than the icons, but contain the information about them and their keywords and descriptions, or a file that can be added to the zip folder that contains this information to make the re-upload of icons easier.
Poll #18020 Icon Downloads
Open to: Registered Users, detailed results viewable to: All, participants: 42
This suggestion:
View Answers
Should be implemented as-is.
30 (71.4%)
Should be implemented with changes. (please comment)
1 (2.4%)
Shouldn't be implemented.
0 (0.0%)
(I have no opinion)
11 (26.2%)
(Other: please comment)
0 (0.0%)
flo: A lovely, purple-shaded teapot. (Default)
[personal profile] flo
Title:
Revamping the 'Export Journal' tool to allow exporting in larger time intervals
Area:
exporting, interoperability, backups
Summary:
Revamping the 'Export Journal' tool at http://www.dreamwidth.org/export so that you can export entries from your journal on a yearly basis, and also export it all as one giant file. Export options on that page could also use some clarification so that you understand why or why not to tick them.
Description:
Basically, I want to the basic export tool to allow me to export my journal as XML on a yearly basis as well, or even just all at once. Currently, the export tool at http://www.dreamwidth.org/export only allows you to export on a monthly basis, which means lots and lots of repetitive action if you post even occasionally on your journal. As far as I know, people that want to back up their Dreamwidth journals generally resort to something like LJ Archive, which is thorough, but can be inexplicably buggy, and is not at all maintained by Dreamwidth or otherwise affiliated with Dreamwidth. I would much prefer being able to export my journal with an on-site tool that I know will be fixed or improved as necessary, and I would be willing to go without exported comments if the Dreamwidth tool will provide a complete set of all my entries.
It would also be rather nice if the more esoteric options on the tool's page had more explanatory labels. Currently, this is approximately what the "Fields" options look like:
- ID Number
- Event Time (from your clock) *
- Log Time (from system's clock) *
- Subject
- Event *
- Security Level
- Allow Mask *
- Current Mood & Music
Some of these fields (the unstarred ones) are fairly self-explanatory. The rest are somewhat confusing to me-- "Event Time" and "Log Time" seem self-explanatory at first glance, but then you also have "Event", and before I actually looked at an export file, I honestly wasn't sure what all those fields would mean when taken together. "Allow Mask" is also really badly named, and probably should not be an option at all, since that field is basically the bit that is used to determine whether an entry is public or access-only. Not exporting that field just removes part of the distinction made between private and public entries in the export file, which really doesn't serve any purpose since the tool currently exports everything. A fine-grained option to control what is exported would be nice, but it probably should not be at all related to what fields get exported.
Another confusing option on the page is: "Don't translate between encodings". Is this something an end user is supposed to just know? I know what encodings are, and that option does not really tell me exactly what it does. Does ticking the option mean that it will just leave any entries that are not encoded as X (where X is the encoding you selected from the preceding combo box) as they currently are? Is this an option that's more for debugging or troubleshooting export files that don't import elsewhere correctly? Should it even be on the page at all?
As far as using the tool goes...well. There is nothing on the page that indicates that the tool will only export by month, so unless you got to it from the FAQ, you won't even know about that. When I tried putting in just the year to see if I would get an explanatory error, it basically just gave me an empty CSV or XML file named after the year. Putting in the wrong month/year combination also gave me an empty file, which, remember, I won't know about until I actually look within the file. Considering that the tool is supposed to let you export entries, I really think it should let you know when your settings mean that you will not be exporting any entries at all.
In summary, what I want is for the export tool to
a) Allow you to export entries by year
b) Allow you to export all your journal's entries at once
c) Provide understandable and useful options that will not make your export useless or incomplete in ways that you did not mean (e.g. if, for some reason, you do not select "Event", none of your entry text will be added to the export file)
If there is a question of the tool putting strain on the servers, the number of times that free users can export their journals can be restricted (e.g. once a month, once every couple months, etc).
Poll #7709 Revamping the 'Export Journal' tool to allow exporting in larger time intervals
Open to: Registered Users, detailed results viewable to: All, participants: 45
This suggestion:
View Answers
Should be implemented as-is.
20 (44.4%)
Should be implemented with changes. (please comment)
9 (20.0%)
Shouldn't be implemented.
0 (0.0%)
(I have no opinion)
16 (35.6%)
(Other: please comment)
0 (0.0%)
azurelunatic: A glittery black pin badge with a blue holographic star in the middle. (Default)
[personal profile] azurelunatic
Title:
Full Export Tool
Area:
exporting, interoperability, backups
Summary:
Create an interface/client with an easy way of setting up and later downloading a full backup of one's journal. This would be in a file format of one's choice, with entries, comments, icons, memories, and all.
Description:
Currently, one can back up one's journal through a scattering of mostly-legacy interfaces in different places. There are tools that were never exactly designed to work with Dreamwidth, such as LJ Archive. (While some of them work even most of the time, there are times that they do not, and I suspect Dreamwidth developers may not necessarily prioritize jumping in to third-party client code developed for another site, assuming the code is even open and available to be jumped into.)
There already exists a bug requesting a PDF export of one's journal: http://bugs.dwscoalition.org/show_bug.cgi?id=32
This would broaden the scope of the ability to export, so one could choose between, say, .pdf, HTML, plain text, rich text, comma separated values, tab separated values, and perhaps other formats (WordPress-friendly?) as developers see the need.
One could go to a page similar to the current import journal page, and select the date range (as for the existing spec for .pdf, whole journal or month by month), elements and file type that one wished to back up, and queue a download request. The system would queue the download request, and prepare it in a timely fashion, as other load allowed so as to keep things readable in other journals on the same cluster. (Paid users might be given priority in the queue, if there was a queue worth mentioning.) Similar to the importer, the page would show progress of the export file preparation when revisited, and offer a low-impact refresh option, because you just know that people are going to want to sit there and beam at the progress the first couple times they download. Once the files were prepared, in reasonable-sized chunks for downloading if it were a particularly large journal *cough*azurelunatic*cough*, a notification would be sent with a link to the download page, so the user would not have to sit on the page refreshing if they did not want to. There might also be a password challenge before downloading, to diminish the possibility that someone's theoretical nosy little brother could copy one's whole journal to a USB drive in an unguarded minute alone with the computer.
In addition to the web interface, there should also be an API that allows (at minimum) the same choices as the web interface, complete with full documentation. Perhaps there could even be official clients for a range of different platforms.
Poll #4293 Full Export Tool
Open to: Registered Users, detailed results viewable to: All, participants: 64
This suggestion:
View Answers
Should be implemented as-is.
53 (82.8%)
Should be implemented with changes. (please comment)
10 (15.6%)
Shouldn't be implemented.
0 (0.0%)
(I have no opinion)
1 (1.6%)
(Other: please comment)
0 (0.0%)
jjhunter: Watercolor of daisy with blue dots zooming around it like Bohr model electrons (Default)
[personal profile] jjhunter
Title:
Feed Comment Exporter
Area:
Feeds
Summary:
Ability to export one's comment on a feed directly to the original without leaving DW. Co-develop with 'Feed Ghost Comments'?
Description:
One drawback to using feeds on DW to track posters on sites such as LiveJournal is the activation energy required to go comment on the original post. An option to export (not cross-post) one's comment on the DW feed to the original would increase the overall response rate to that original post.
Possible complications: if it isn't possible to view the comments on the original post through the DW feed, this would give a negative incentive to disregard the /comment/ context into which one is commenting. See suggestion 'Feed Ghost Comments' for possible fix.
Tools in the same family: x-posting (could use variant to export comment & 'post' it under one's username on that other site); comment importing when moving journals.
Poll #2557 Feed Comment Exporter
Open to: Registered Users, detailed results viewable to: All, participants: 30
This suggestion:
View Answers
Should be implemented as-is.
3 (10.0%)
Should be implemented with changes. (please comment)
0 (0.0%)
Shouldn't be implemented.
19 (63.3%)
(I have no opinion)
8 (26.7%)
(Other: please comment)
0 (0.0%)
zvi: self-portrait: short, fat, black dyke in bunny slippers (Default)
[personal profile] zvi
Title:
OPML file should special case feeds accounts
Area:
third party site integration
Summary:
The current OPML file includes the DW RSS address (http://example_feed.dreamwidth.org/data/rss) for feed accounts. This is ridiculous. It should give you the RSS feed that DW subscribes to, instead. (http://examplersswebsite.com/example.rss)
Description:
An OPML file is a bit like an address book, it lets you take the subscriptions from one feed reader (in this case, the reading page) and put it into a different feed reader. As if you have one of those 7 ring binder planners, only you got one in black plastic and now you have the opportunity to buy one in blue plastic, so you want to move your addresses with you into the new container.
The way the OPML file works now, if you have a feed account on your reading page, it pulls the DW url, instead of the originating site's feed. So, in your new feed reader, you'll always be reading at a serious delay, because your waiting first for DW to contact the originating site and download an update, and then for your feed reader to contact DW and get the update that DW has gotten. [personal profile] rho corrects me that the DW rss URL is just a redirect to the originating site, so the delay is not very long.
There's no real benefit to DW in remaining the middleman in this transaction, and it's better for end users if they butt out.
Poll #1381 OPML file should special case feeds accounts
Open to: Registered Users, detailed results viewable to: All, participants: 28
This suggestion:
View Answers
Should be implemented as-is.
22 (78.6%)
Should be implemented with changes. (please comment)
0 (0.0%)
Shouldn't be implemented.
0 (0.0%)
(I have no opinion)
6 (21.4%)
(Other: please comment)
0 (0.0%)
cesy: "Cesy" - An old-fashioned quill and ink (Default)
[personal profile] cesy
Title:
Get notified of your own posts
Area:
notifications, entries
Summary:
Option to get email notifications of your own posts, or your posts with a certain tag, in the same way as you can track other people.
Description:
You can get notified of someone else's posts by going to http://www.dreamwidth.org/manage/subscriptions/user?journal=exampleusername. However, doing that for your own name redirects to http://www.dreamwidth.org/manage/settings/?cat=notifications. I'd like to be able to get email copies of my own entries, like I can with my own comments. (This would probably be a paid feature for the same reasons.)
Poll #1197 Get notified of your own posts
Open to: Registered Users, detailed results viewable to: All, participants: 33
This suggestion:
View Answers
Should be implemented as-is.
6 (18.2%)
Should be implemented with changes. (please comment)
2 (6.1%)
Shouldn't be implemented.
1 (3.0%)
(I have no opinion)
24 (72.7%)
(Other: please comment)
0 (0.0%)
cesy: "Cesy" - An old-fashioned quill and ink (Default)
[personal profile] cesy
Title:
Export memories
Area:
memories
Summary:
I know there is a plan to overhaul memories eventually. However, in the meantime, it would be useful to be able to backup exisiting memories.
Description:
I imagine a feature to be able to export all your memories into some kind of useful format, either a CSV that you can download, or even into a private links post in your journal. The idea is so that all your existing memories can be saved in some way before memories are overhauled.
Poll #984 Export memories
Open to: Registered Users, detailed results viewable to: All, participants: 34
This suggestion:
View Answers
Should be implemented as-is.
18 (52.9%)
Should be implemented with changes.
9 (26.5%)
Shouldn't be implemented.
1 (2.9%)
(I have no opinion)
5 (14.7%)
(Other: please comment)
1 (2.9%)
Profile
Dreamwidth Suggestions
April 2017
S M T W T F S
1
23456 7 8
9 101112131415
16171819202122
23242526272829
30
Style Credit
Expand Cut Tags
No cut tags
Syndicate
RSS Atom
|
{
"url": "http://dw-suggestions.dreamwidth.org/tag/workflow:+exporting",
"source_domain": "dw-suggestions.dreamwidth.org",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "94567",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QPWIG6TA4X65DPKDBUO6FFBIY7BP3L5C",
"WARC-Concurrent-To": "<urn:uuid:46d40e18-00f0-4ac5-ae14-deb1f3b4bfc1>",
"WARC-Date": "2017-08-23T06:23:53Z",
"WARC-IP-Address": "34.194.96.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VCYBKQKK37HCT3JZYS7D45OYG75LIZUH",
"WARC-Record-ID": "<urn:uuid:3731cb8b-3ddc-4669-934a-aa3ddec984b5>",
"WARC-Target-URI": "http://dw-suggestions.dreamwidth.org/tag/workflow:+exporting",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1d81f6c4-e862-4c9b-832c-90c12090703b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-28-180.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,
2,
28,
62,
63,
70,
85,
86,
92,
98,
99,
108,
184,
185,
198,
622,
623,
944,
945,
1263,
1264,
1291,
1370,
1371,
1372,
1389,
1390,
1403,
1404,
1433,
1444,
1445,
1498,
1507,
1508,
1534,
1543,
1544,
1564,
1575,
1576,
1600,
1609,
1610,
1657,
1680,
1681,
1688,
1768,
1769,
1775,
1812,
1813,
1822,
2118,
2119,
2132,
2974,
2975,
3151,
3152,
3164,
3197,
3232,
3242,
3252,
3269,
3284,
3307,
3308,
4181,
4182,
4740,
4741,
5414,
5415,
5465,
5504,
5562,
5802,
5803,
6001,
6002,
6093,
6172,
6173,
6174,
6191,
6192,
6205,
6206,
6235,
6246,
6247,
6300,
6310,
6311,
6337,
6346,
6347,
6367,
6378,
6379,
6403,
6412,
6413,
6508,
6540,
6541,
6548,
6565,
6566,
6572,
6609,
6610,
6619,
6829,
6830,
6843,
7328,
7329,
7446,
7447,
7693,
7694,
8984,
8985,
8986,
9227,
9228,
9256,
9335,
9336,
9337,
9354,
9355,
9368,
9369,
9398,
9409,
9410,
9463,
9474,
9475,
9501,
9510,
9511,
9531,
9540,
9541,
9565,
9574,
9575,
9674,
9702,
9703,
9710,
9732,
9733,
9739,
9745,
9746,
9755,
9881,
9882,
9895,
10191,
10192,
10457,
10458,
10625,
10626,
10659,
10738,
10739,
10740,
10757,
10758,
10771,
10772,
10801,
10811,
10812,
10865,
10874,
10875,
10901,
10912,
10913,
10933,
10943,
10944,
10968,
10977,
10978,
11049,
11072,
11073,
11080,
11125,
11126,
11132,
11161,
11162,
11171,
11413,
11414,
11427,
11816,
11817,
12337,
12338,
12464,
12465,
12521,
12600,
12601,
12602,
12619,
12620,
12633,
12634,
12663,
12674,
12675,
12728,
12737,
12738,
12764,
12773,
12774,
12794,
12804,
12805,
12829,
12838,
12839,
12895,
12919,
12920,
12927,
12958,
12959,
12965,
12988,
12989,
12998,
13132,
13133,
13146,
13547,
13548,
13590,
13669,
13670,
13671,
13688,
13689,
13702,
13703,
13732,
13742,
13743,
13796,
13805,
13806,
13832,
13841,
13842,
13862,
13873,
13874,
13898,
13907,
13908,
13964,
13988,
13989,
13996,
14012,
14013,
14019,
14028,
14029,
14038,
14180,
14181,
14194,
14477,
14478,
14504,
14583,
14584,
14585,
14602,
14603,
14616,
14617,
14646,
14657,
14658,
14694,
14704,
14705,
14731,
14740,
14741,
14761,
14771,
14772,
14796,
14805,
14806,
14814,
14815,
14838,
14839,
14850,
14851,
14865,
14873,
14883,
14898,
14913,
14928,
14937,
14938,
14951,
14952,
14968,
14969,
14981,
14982,
14992,
14993
],
"line_end_idx": [
2,
28,
62,
63,
70,
85,
86,
92,
98,
99,
108,
184,
185,
198,
622,
623,
944,
945,
1263,
1264,
1291,
1370,
1371,
1372,
1389,
1390,
1403,
1404,
1433,
1444,
1445,
1498,
1507,
1508,
1534,
1543,
1544,
1564,
1575,
1576,
1600,
1609,
1610,
1657,
1680,
1681,
1688,
1768,
1769,
1775,
1812,
1813,
1822,
2118,
2119,
2132,
2974,
2975,
3151,
3152,
3164,
3197,
3232,
3242,
3252,
3269,
3284,
3307,
3308,
4181,
4182,
4740,
4741,
5414,
5415,
5465,
5504,
5562,
5802,
5803,
6001,
6002,
6093,
6172,
6173,
6174,
6191,
6192,
6205,
6206,
6235,
6246,
6247,
6300,
6310,
6311,
6337,
6346,
6347,
6367,
6378,
6379,
6403,
6412,
6413,
6508,
6540,
6541,
6548,
6565,
6566,
6572,
6609,
6610,
6619,
6829,
6830,
6843,
7328,
7329,
7446,
7447,
7693,
7694,
8984,
8985,
8986,
9227,
9228,
9256,
9335,
9336,
9337,
9354,
9355,
9368,
9369,
9398,
9409,
9410,
9463,
9474,
9475,
9501,
9510,
9511,
9531,
9540,
9541,
9565,
9574,
9575,
9674,
9702,
9703,
9710,
9732,
9733,
9739,
9745,
9746,
9755,
9881,
9882,
9895,
10191,
10192,
10457,
10458,
10625,
10626,
10659,
10738,
10739,
10740,
10757,
10758,
10771,
10772,
10801,
10811,
10812,
10865,
10874,
10875,
10901,
10912,
10913,
10933,
10943,
10944,
10968,
10977,
10978,
11049,
11072,
11073,
11080,
11125,
11126,
11132,
11161,
11162,
11171,
11413,
11414,
11427,
11816,
11817,
12337,
12338,
12464,
12465,
12521,
12600,
12601,
12602,
12619,
12620,
12633,
12634,
12663,
12674,
12675,
12728,
12737,
12738,
12764,
12773,
12774,
12794,
12804,
12805,
12829,
12838,
12839,
12895,
12919,
12920,
12927,
12958,
12959,
12965,
12988,
12989,
12998,
13132,
13133,
13146,
13547,
13548,
13590,
13669,
13670,
13671,
13688,
13689,
13702,
13703,
13732,
13742,
13743,
13796,
13805,
13806,
13832,
13841,
13842,
13862,
13873,
13874,
13898,
13907,
13908,
13964,
13988,
13989,
13996,
14012,
14013,
14019,
14028,
14029,
14038,
14180,
14181,
14194,
14477,
14478,
14504,
14583,
14584,
14585,
14602,
14603,
14616,
14617,
14646,
14657,
14658,
14694,
14704,
14705,
14731,
14740,
14741,
14761,
14771,
14772,
14796,
14805,
14806,
14814,
14815,
14838,
14839,
14850,
14851,
14865,
14873,
14883,
14898,
14913,
14928,
14937,
14938,
14951,
14952,
14968,
14969,
14981,
14982,
14992,
14993,
15001
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15001,
"ccnet_original_nlines": 334,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3884120285511017,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022685470059514046,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2424892634153366,
"rps_doc_frac_unique_words": 0.29703372716903687,
"rps_doc_mean_word_length": 4.735473155975342,
"rps_doc_num_sentences": 155,
"rps_doc_symbol_to_word_ratio": 0.0024524799082428217,
"rps_doc_unigram_entropy": 5.756884574890137,
"rps_doc_word_count": 2461,
"rps_doc_frac_chars_dupe_10grams": 0.07405182719230652,
"rps_doc_frac_chars_dupe_5grams": 0.15934443473815918,
"rps_doc_frac_chars_dupe_6grams": 0.13969452679157257,
"rps_doc_frac_chars_dupe_7grams": 0.13540415465831757,
"rps_doc_frac_chars_dupe_8grams": 0.11412391066551208,
"rps_doc_frac_chars_dupe_9grams": 0.08529260009527206,
"rps_doc_frac_chars_top_2gram": 0.023425430059432983,
"rps_doc_frac_chars_top_3gram": 0.022824779152870178,
"rps_doc_frac_chars_top_4gram": 0.01098334975540638,
"rps_doc_books_importance": -1433.5726318359375,
"rps_doc_books_importance_length_correction": -1433.5726318359375,
"rps_doc_openwebtext_importance": -628.9635620117188,
"rps_doc_openwebtext_importance_length_correction": -628.9635620117188,
"rps_doc_wikipedia_importance": -450.2716369628906,
"rps_doc_wikipedia_importance_length_correction": -450.2716369628906
},
"fasttext": {
"dclm": 0.044165488332509995,
"english": 0.9400460124015808,
"fineweb_edu_approx": 1.3421920537948608,
"eai_general_math": 0.38765424489974976,
"eai_open_web_math": 0.30430978536605835,
"eai_web_code": 0.10643141716718674
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
635,881,351,885,080,600 |
Properties
Label 260.2.j.a
Level $260$
Weight $2$
Character orbit 260.j
Analytic conductor $2.076$
Analytic rank $0$
Dimension $56$
CM no
Inner twists $4$
Related objects
Downloads
Learn more
Newspace parameters
Level: \( N \) \(=\) \( 260 = 2^{2} \cdot 5 \cdot 13 \)
Weight: \( k \) \(=\) \( 2 \)
Character orbit: \([\chi]\) \(=\) 260.j (of order \(4\), degree \(2\), minimal)
Newform invariants
Self dual: no
Analytic conductor: \(2.07611045255\)
Analytic rank: \(0\)
Dimension: \(56\)
Relative dimension: \(28\) over \(\Q(i)\)
Twist minimal: yes
Sato-Tate group: $\mathrm{SU}(2)[C_{4}]$
$q$-expansion
The dimension is sufficiently large that we do not compute an algebraic \(q\)-expansion, but we have computed the trace expansion.
\(\operatorname{Tr}(f)(q) = \) \( 56 q - 12 q^{6} + 12 q^{8} - 56 q^{9}+O(q^{10}) \) Copy content Toggle raw display
\(\operatorname{Tr}(f)(q) = \) \( 56 q - 12 q^{6} + 12 q^{8} - 56 q^{9} + 16 q^{14} - 12 q^{18} - 8 q^{20} - 16 q^{21} - 40 q^{24} - 16 q^{26} - 44 q^{28} + 40 q^{32} - 4 q^{34} + 16 q^{37} + 8 q^{41} + 8 q^{42} + 28 q^{44} - 12 q^{46} + 104 q^{48} + 56 q^{52} - 16 q^{53} + 20 q^{54} - 48 q^{57} - 4 q^{58} + 16 q^{61} - 8 q^{65} + 64 q^{66} + 24 q^{68} - 8 q^{70} - 32 q^{72} + 48 q^{73} - 136 q^{74} - 88 q^{76} + 52 q^{78} - 32 q^{80} + 56 q^{81} - 20 q^{84} - 64 q^{86} - 8 q^{89} - 88 q^{92} - 48 q^{93} - 16 q^{94} - 4 q^{96} - 32 q^{97} + 16 q^{98}+O(q^{100}) \) Copy content Toggle raw display
Embeddings
For each embedding \(\iota_m\) of the coefficient field, the values \(\iota_m(a_n)\) are shown below.
For more information on an embedded modular form you can click on its label.
Label \( a_{2} \) \( a_{3} \) \( a_{4} \) \( a_{5} \) \( a_{6} \) \( a_{7} \) \( a_{8} \) \( a_{9} \) \( a_{10} \)
31.1 −1.41372 0.0374414i 1.74175i 1.99720 + 0.105863i −0.707107 + 0.707107i 0.0652137 2.46234i −2.26642 + 2.26642i −2.81951 0.224439i −0.0336953 1.02612 0.973174i
31.2 −1.36090 0.384637i 1.17966i 1.70411 + 1.04691i −0.707107 + 0.707107i −0.453740 + 1.60540i 0.171101 0.171101i −1.91645 2.08020i 1.60841 1.23428 0.690324i
31.3 −1.25736 + 0.647340i 0.759638i 1.16190 1.62788i 0.707107 0.707107i 0.491744 + 0.955138i −2.17387 + 2.17387i −0.407140 + 2.79897i 2.42295 −0.431349 + 1.34683i
31.4 −1.25602 0.649941i 2.18560i 1.15515 + 1.63267i 0.707107 0.707107i −1.42051 + 2.74515i 1.49904 1.49904i −0.389750 2.80145i −1.77684 −1.34772 + 0.428560i
31.5 −1.22023 + 0.714871i 1.31885i 0.977920 1.74461i −0.707107 + 0.707107i −0.942808 1.60930i 3.16584 3.16584i 0.0538847 + 2.82791i 1.26063 0.357343 1.36832i
31.6 −1.20609 + 0.738473i 3.43622i 0.909314 1.78133i 0.707107 0.707107i −2.53756 4.14440i −1.29013 + 1.29013i 0.218751 + 2.81996i −8.80762 −0.330656 + 1.37502i
31.7 −1.08931 0.901894i 0.947478i 0.373176 + 1.96488i 0.707107 0.707107i 0.854524 1.03209i −2.28468 + 2.28468i 1.36561 2.47692i 2.10229 −1.40799 + 0.132521i
31.8 −0.853677 1.12749i 2.83163i −0.542471 + 1.92503i −0.707107 + 0.707107i −3.19263 + 2.41729i −2.55134 + 2.55134i 2.63354 1.03172i −5.01810 1.40090 + 0.193616i
31.9 −0.738473 + 1.20609i 3.43622i −0.909314 1.78133i 0.707107 0.707107i 4.14440 + 2.53756i 1.29013 1.29013i 2.81996 + 0.218751i −8.80762 0.330656 + 1.37502i
31.10 −0.714871 + 1.22023i 1.31885i −0.977920 1.74461i −0.707107 + 0.707107i 1.60930 + 0.942808i −3.16584 + 3.16584i 2.82791 + 0.0538847i 1.26063 −0.357343 1.36832i
31.11 −0.647340 + 1.25736i 0.759638i −1.16190 1.62788i 0.707107 0.707107i −0.955138 0.491744i 2.17387 2.17387i 2.79897 0.407140i 2.42295 0.431349 + 1.34683i
31.12 −0.551623 1.30220i 0.224099i −1.39142 + 1.43664i −0.707107 + 0.707107i 0.291821 0.123618i −0.228458 + 0.228458i 2.63833 + 1.01942i 2.94978 1.31085 + 0.530735i
31.13 −0.329884 1.37520i 0.0805516i −1.78235 + 0.907313i 0.707107 0.707107i 0.110775 0.0265727i 2.41026 2.41026i 1.83571 + 2.15179i 2.99351 −1.20568 0.739151i
31.14 0.0374414 + 1.41372i 1.74175i −1.99720 + 0.105863i −0.707107 + 0.707107i 2.46234 0.0652137i 2.26642 2.26642i −0.224439 2.81951i −0.0336953 −1.02612 0.973174i
31.15 0.0957733 1.41097i 2.67523i −1.98165 0.270266i −0.707107 + 0.707107i 3.77466 + 0.256215i 0.0140243 0.0140243i −0.571126 + 2.77017i −4.15684 0.929982 + 1.06543i
31.16 0.270865 1.38803i 2.58563i −1.85326 0.751939i 0.707107 0.707107i −3.58893 0.700357i −1.49185 + 1.49185i −1.54570 + 2.36871i −3.68547 −0.789956 1.17302i
31.17 0.384637 + 1.36090i 1.17966i −1.70411 + 1.04691i −0.707107 + 0.707107i −1.60540 + 0.453740i −0.171101 + 0.171101i −2.08020 1.91645i 1.60841 −1.23428 0.690324i
31.18 0.400070 1.35645i 2.57103i −1.67989 1.08535i −0.707107 + 0.707107i −3.48746 1.02859i 3.59259 3.59259i −2.14428 + 1.84446i −3.61018 0.676260 + 1.24204i
31.19 0.649941 + 1.25602i 2.18560i −1.15515 + 1.63267i 0.707107 0.707107i −2.74515 + 1.42051i −1.49904 + 1.49904i −2.80145 0.389750i −1.77684 1.34772 + 0.428560i
31.20 0.723264 1.21527i 1.80245i −0.953778 1.75793i 0.707107 0.707107i 2.19047 + 1.30365i 1.20463 1.20463i −2.82620 0.112344i −0.248815 −0.347903 1.37075i
See all 56 embeddings
\(n\): e.g. 2-40 or 990-1000
Embeddings: e.g. 1-3 or 151.28
Significant digits:
Format:
Inner twists
Char Parity Ord Mult Type
1.a even 1 1 trivial
4.b odd 2 1 inner
13.d odd 4 1 inner
52.f even 4 1 inner
Twists
By twisting character orbit
Char Parity Ord Mult Type Twist Min Dim
1.a even 1 1 trivial 260.2.j.a 56
4.b odd 2 1 inner 260.2.j.a 56
13.d odd 4 1 inner 260.2.j.a 56
52.f even 4 1 inner 260.2.j.a 56
By twisted newform orbit
Twist Min Dim Char Parity Ord Mult Type
260.2.j.a 56 1.a even 1 1 trivial
260.2.j.a 56 4.b odd 2 1 inner
260.2.j.a 56 13.d odd 4 1 inner
260.2.j.a 56 52.f even 4 1 inner
Hecke kernels
This newform subspace is the entire newspace \(S_{2}^{\mathrm{new}}(260, [\chi])\).
|
{
"url": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/260/2/j/a/",
"source_domain": "www.lmfdb.org",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "127483",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TE7WLVQ23Q3ZUIV5WZNSIWGUECSSHKMR",
"WARC-Concurrent-To": "<urn:uuid:f71aedbc-69fe-4071-b672-c75dc16b495a>",
"WARC-Date": "2022-06-26T11:40:58Z",
"WARC-IP-Address": "35.241.19.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PYOZPPQ4NZSCSQS57B3HM4OXTMVR3J6E",
"WARC-Record-ID": "<urn:uuid:bdcda60d-512d-4c81-8128-1ac2fbca8d7a>",
"WARC-Target-URI": "https://www.lmfdb.org/ModularForm/GL2/Q/holomorphic/260/2/j/a/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4fc080dd-be15-4111-925a-c27a113aa718>"
},
"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-203\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,
11,
12,
28,
40,
51,
73,
100,
118,
133,
139,
156,
157,
173,
174,
184,
185,
196,
197,
217,
218,
274,
304,
384,
385,
404,
405,
419,
457,
478,
496,
538,
557,
598,
599,
613,
614,
745,
746,
863,
1466,
1467,
1478,
1479,
1581,
1582,
1659,
1660,
1775,
1938,
2096,
2259,
2416,
2574,
2734,
2891,
3053,
3211,
3376,
3533,
3698,
3857,
4021,
4187,
4345,
4510,
4667,
4829,
4984,
5006,
5035,
5066,
5086,
5094,
5095,
5108,
5109,
5135,
5156,
5174,
5193,
5213,
5214,
5221,
5222,
5257,
5297,
5331,
5362,
5394,
5427,
5432,
5465,
5505,
5539,
5570,
5602,
5635,
5636,
5650,
5651
],
"line_end_idx": [
11,
12,
28,
40,
51,
73,
100,
118,
133,
139,
156,
157,
173,
174,
184,
185,
196,
197,
217,
218,
274,
304,
384,
385,
404,
405,
419,
457,
478,
496,
538,
557,
598,
599,
613,
614,
745,
746,
863,
1466,
1467,
1478,
1479,
1581,
1582,
1659,
1660,
1775,
1938,
2096,
2259,
2416,
2574,
2734,
2891,
3053,
3211,
3376,
3533,
3698,
3857,
4021,
4187,
4345,
4510,
4667,
4829,
4984,
5006,
5035,
5066,
5086,
5094,
5095,
5108,
5109,
5135,
5156,
5174,
5193,
5213,
5214,
5221,
5222,
5257,
5297,
5331,
5362,
5394,
5427,
5432,
5465,
5505,
5539,
5570,
5602,
5635,
5636,
5650,
5651,
5734
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5734,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0.023020580410957336,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07181505113840103,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003935069777071476,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7697983384132385,
"rps_doc_frac_unique_words": 0.65742027759552,
"rps_doc_mean_word_length": 5.3980584144592285,
"rps_doc_num_sentences": 392,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.8592753410339355,
"rps_doc_word_count": 721,
"rps_doc_frac_chars_dupe_10grams": 0.04008221998810768,
"rps_doc_frac_chars_dupe_5grams": 0.1133093535900116,
"rps_doc_frac_chars_dupe_6grams": 0.05498458072543144,
"rps_doc_frac_chars_dupe_7grams": 0.05498458072543144,
"rps_doc_frac_chars_dupe_8grams": 0.05498458072543144,
"rps_doc_frac_chars_dupe_9grams": 0.04008221998810768,
"rps_doc_frac_chars_top_2gram": 0.041109971702098846,
"rps_doc_frac_chars_top_3gram": 0.010791369713842869,
"rps_doc_frac_chars_top_4gram": 0.01798561029136181,
"rps_doc_books_importance": -908.2966918945312,
"rps_doc_books_importance_length_correction": -908.2966918945312,
"rps_doc_openwebtext_importance": -556.53076171875,
"rps_doc_openwebtext_importance_length_correction": -556.53076171875,
"rps_doc_wikipedia_importance": -544.5635986328125,
"rps_doc_wikipedia_importance_length_correction": -544.5635986328125
},
"fasttext": {
"dclm": 0.9361271262168884,
"english": 0.37454330921173096,
"fineweb_edu_approx": 1.0452873706817627,
"eai_general_math": 0.48727792501449585,
"eai_open_web_math": 0.9520222544670105,
"eai_web_code": 0.11718130111694336
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.74",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512.73",
"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": "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": "20",
"label": "Structured Data"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-703,673,127,260,869,500 |
Opened 7 years ago
Last modified 3 years ago
#9964 confirmed New Feature
Font Size and Font Name drop-downs do not always reflect font styling
Reported by: Teresa Monahan Owned by:
Priority: Low Milestone:
Component: General Version: 4.0 Beta
Keywords: IBM Cc: Damian, Satya Minnekanti, fabrizio, lynne_kues@…, saniln@…, mike@…, chris@…
Description
Currently the font and fontsize combos on the toolbar only reflect styles set through the style definition specified by the fontSize_style and font_style config settings. This means that if font is specified in any other way, the toolbar does not show this.
To Reproduce:
• Copy the following into Source view:
<h1 style="font-family:arial,helvetica,sans-serif;font-size:14px;">Sample heading text with Arial font, size 14 applied directly on the H1 tag.</h1>
<p><span style="font-family:arial,helvetica,sans-serif;"><span style="font-size: 14px;">Sample text with Arial font, size 14 applied through the style definitions specified by config.fontSize_style and config.font_style.</span></span></p>
• Switch back to wysiwyg view and click into the second line of text. Note that the font and fontSize combo boxes correctly display the font styling.
• Click into the first line of text.
Problem: The font and fontSize combo boxes do not reflect the font styling set on the H1 tag.
Setting font and fontSize styling for the paragraph formats is easily achievable in the editor using config.format_<formatName>. For example:
config.format_h1 = { element : 'h1', styles : { 'font-family':'arial,helvetica,sans-serif', 'text-align' : 'center', 'font-size' : '20px;' } };
However the toolbar does not reflect these font styles. Other styles such as text-align and color are correctly represented on the toolbar.
The font and fontsize combo boxes should display the font regardless of how it is applied. Perhaps using the computed font values would be the solution for this. This approach would also address the issue raised in ticket #4887.
Change History (23)
comment:1 Changed 7 years ago by Lynne Kues
Cc: lynne_kues@… added
comment:2 Changed 7 years ago by Piotrek Koszuliński
IMO the first part of this issue (inserting into editor h1 with inline styles) is strongly related to #9829.
I think that font name and size combos do not have to understand all ways of applying a CSS style. They are applying (and understand) CSS style using style definition defined by font_style and that's it - this is a feature that they are.
The problem is elsewhere - editor should not accept content that it doesn't understand. This is why I think that this issue is related to #9829.
Now, what are the ways of solving this issue:
1. Strip styles that are not allowed. In this case entire h1's style attribute would be removed because any of editor's features doesn't allow font-family and font-size set for this element.
2. Harder, but cooler way - editor transforms h1 element by wrapping its content with span and moving style attribute there. Now, the content is fully aligned to the editor's features.
The second part
Should font family and size combos (but also e.g. bold and italic buttons) reflect font styles applied by this format?
config.format_h1 = { element : 'h1', styles : { 'font-family':'arial,helvetica,sans-serif', 'text-align' : 'center', 'font-size' : '20px;', 'font-weight': 'bold' } };
MSWord, Libre Office, Google docs do this. However, they are not generating HTML so we should consider if our case isn't different. But for now, this looks like a reasonable feature request.
Last edited 7 years ago by Piotrek Koszuliński (previous) (diff)
comment:3 Changed 7 years ago by Piotrek Koszuliński
Status: newconfirmed
Type: BugNew Feature
comment:4 Changed 7 years ago by Jakub Ś
Resolution: invalid
Status: confirmedclosed
MSWord, Libre Office, Google docs do this.
@Reinmar that's not true.
Type any header and style it and the check how browser sees it. It will be like below code:
<h1><span style="font-size:28.0pt;line-height:115%;color:red">Test my test my
test my test<o:p></o:p></span></h1>
Notice spans in h1 tag
Such code after pasting into editor (with config.pasteFromWordRemoveFontStyles=false; and config.pasteFromWordRemoveStyles = false;) will look:
<h1>
<span style="color:red;"><span style="font-size:28.0pt;">Test my test my test my test</span></span></h1>
If you change 28.0pt to 28px you will get font size selected in dropdown.
What I’m trying to say is all dropdowns represent certain elements - you can see their visual representations in dropdowns - headers represent headers and styled spans represent styled spans. If there is certain style represented by span I don't think it is valid highlight this span when h1 with styles but with no spans is selected. This kind of breaks “element visual representation in dropdown” approach - this is no longer WYIWYG.
Even MS Word, as I have described it above, doesn't do it (it reacts to spans that are in h1).
I'm closing this as invalid. @tmonahan if you don't agree with my comment please reply.
comment:5 Changed 7 years ago by Lynne Kues
If you are in MS Word and you apply a heading to text, the font and font size combos will indicate what is active for the heading when the cursor is in the heading. We have customers who are complaining about the fact that applying a heading style in CKEditor does not indicate what font and font size are active. Teresa investigated whether or not we could somehow extend the editor to create a span when a heading is applied (vs. putting the styles on the heading tag), but this led to other issues that could not be worked around.
comment:6 Changed 7 years ago by Lynne Kues
This needs to be reopened and is considered a defect by our customers, not a new feature.
comment:7 Changed 7 years ago by Piotrek Koszuliński
Resolution: invalid
Status: closedreopened
@j.swiderski: Create header, place caret in it. In MSWord and Libre Office bold button is enabled, font name indicate the font used for header, etc.
Thus, I'm reopening this ticket. However, I'm still unsure if CKEditor should behave the same way. Now it is consistent - only block styles (e.g. text align) are indicated in toolbar on header. If we'd do the same for inline, then we'd have to deal with many problems:
1. Header style applies font-size:20px, but this font-size is not available in font size combo. What should it show?
2. The same with font names.
3. Header applies font-weight:bold. We select some part of header and try to remove bold style by clicking enabled bold button. What should happen now? There's no way to remove bold without adding "span{font-weight:normal}" in this case. This would completely ruin semantic of created HTML.
comment:8 Changed 7 years ago by Jakub Ś
Resolution: invalid
Status: reopenedclosed
We have customers who are complaining about the fact that applying a heading style in CKEditor does not indicate what font and font size are active.
1. Please note that browser sets its own styles for H1. This is huge difference comparing to MS WORD. There is no way for editor to see these styles.
Even there are differences this still works as described in comment:4. Dropdowns reflect selection if there is a match
1. Check out Google Docs that @Reinmar has mentioned. The so called heading 1 is in fact represented by set of divs and spans. There is no heading. Dropdowns react to elements with particular classes.
1. Check out below example from Word. I have created plain H1 and pasted it into IE to see how it "really" looks like. IMO IE shows word code best.
<font face="Times New Roman">
</font><h1 style="margin: 24pt 0cm 0pt;"><span style="mso-ansi-language: PL;" lang="PL"><font size="5"><font color="#365f91"><font face="Cambria">test<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" /><o:p></o:p></font></font></font></span></h1><font face="Times New Roman">
</font>
Notice that H1 has span and font tags. This is probably why MS Word shows font size and font name - simply because there are tags that represent this size.
You can also Reveal Formatting with SHIFT+F1 in MS WORD 2010 which IMO kind of confirms what I'm talking about.
To summarize in all applications' dropdown show "style" if it matches code. In example mentioned by you there is no match thus styles aren't shown. If there were spans in H1 (which can be done by setting font size on H1) font size would be shown.
@Reinmar since dropdown reflect selections everywhere and this concept breaks this I'm closing this issue again as it is invalid.
I would really like to hear what Fred thinks about it.
comment:9 Changed 7 years ago by Teresa Monahan
I understand that the dropdown values currently represent certain elements and therefore the font and fontsize fields only display fonts set on span elements by default. The problem with this is that there are many other ways in which fonts can be applied i.e. inline styles on many elements. This can be achieved programmatically (e.g. through config.format_<formatname>) so the end-user is usually totally unaware of how the font styling is applied. They just see different fonts and sizes in the editor contents but cannot determine what they are.
What are the benefits of restricting the toolbar dropdowns to only display styles specified through the configured style definition? Would it not be of more benefit to display the computed value so that the toolbar reflects the actual styling of the editor contents?
If it is desirable to only display styles specified through the configured style definition, then perhaps a solution to this would be to process the styles attribute on all elements and transform them into the format supported by the editor as mentioned by Reinmar in comment:2. This could move font styles to span elements (or whatever fontSize_style and font_style specify), insert strong tags for font-weight:bold styling etc.
comment:10 Changed 7 years ago by Jakub Ś
What are the benefits of restricting the toolbar dropdowns to only display styles specified through the configured style definition? Would it not be of more benefit to display the computed value so that the toolbar reflects the actual styling of the editor contents?
I was just trying to say that this is how it works now and that this is not a bug.
@tmonahan the way you said it "let's improve this behaviour" is much better than saying that this is a bug like @lynne_kues did.
I agree there is no sense in not being open to new approaches.
Before reopening this ticket I would really would like to hear Fred opinion on this one.
comment:11 Changed 7 years ago by Frederico Caldeira Knabben
Resolution: invalid
Status: closedreopened
This is the kind of change that we don't want to do, but still we can make further research about it in the future to check if there is really any possibility to make it... and if it makes sense.
comment:12 Changed 7 years ago by Jakub Ś
Priority: NormalLow
Status: reopenedconfirmed
Version: 4.0.2 (GitHub - master)4.0 Beta
Taking the above into account, I'm confirming this feature request but with priority low.
I can imagine that not faking elements like e.g. Google Docs and having valid HTML plus dropdown reflecting all styles could be a pain to implement and maintain.
comment:13 Changed 6 years ago by Jakub Ś
#4887 was marked as duplicate.
comment:14 Changed 6 years ago by sanil
Cc: saniln@… added
comment:15 Changed 6 years ago by Jakub Ś
We have just had a talk that perhaps computed styles could be used and then dropdown could reflect selection (despite element) if only style matches. This should even work if element inherits certain styles like font-size from parent elment.
Still such style needs to be defined for dropdown.
Probably dropdowns that should be affected by this change are font-size, font-familly and styles. Not sure about 'format' as it is rather used with raw HTML which makes current implementation for this dropdown rather correct.
Some concerns:
1. As you know dropdowns like Size or Font insert spans only. What if you have <div style="font-family:comic sans ms,cursive;">text</div> and select part of text in div? Should part of text be wrapped in span or not?
2. Based on above example what if user selects whole text in div? Should style be removed or not?
Taking into account that these two dropdowns work on spans then style should not be removed (This is what will happen in editor currently). Is there any other better solution than this one? Sure this doesn't sound perfect but just think above mentioned example or perhaps something more complex - let's say style reflected for text is in fact placed 3 elements above and there are many other child elements that use this style - How can editor know that user wishes not to remove such style (based on current element siblings and fact they don't have style)?
Last edited 6 years ago by Jakub Ś (previous) (diff)
comment:16 Changed 6 years ago by Mike Burgh
Cc: mike@… added
If anyone is interested here is some code you can run on the editor's selectionChange event.. If CKE cannot match the font family/size this code will then find it, and show the right item in the drop down (or the details of what it found if the item is not in the list (Eg a font that is not allowed, or a size not in the options).
It also uses jquery to get the computed CSS, but that could be worked around easily I am sure.
var selectionChange = function(e) {
//We have to sleep this to get it to run after CKE's built in one
setTimeout(function() {
var $element = $(e.data.path.elements[0].$) //Current element that has focus in the editor
, fontMenu = e.editor.ui.get('Font') //The fontMenu
, fontSizeMenu = e.editor.ui.get('FontSize') //the FontSize Menu
, fontSize
;
if (fontMenu.getValue() == '') {
setRichCombo(e.editor,fontMenu,$element.css("font-family").replace("'","").split(',')[0]);
}
if (fontSizeMenu.getValue() == '') {
fontSize = $element.css("font-size");
//Good old IE, sometimes returns us the font sizes from font tags (eg 1,2,3,4,5) and other times the px font size
if (g_isIE && fontSize.indexOf('px') === -1) {
//So it's a 1,2,3,4,5 in IE
switch(parseInt(fontSize)) {
case 1:
fontSize = 7.5;
break;
case 2:
fontSize = 10;
break;
case 3:
fontSize = 12;
break;
case 4:
fontSize = 13.5;
break;
case 5:
fontSize = 18;
break;
case 6:
fontSize = 24;
break;
case 7:
fontSize = 36;
break;
default:
break;
}
} else {
fontSize = (parseFloat($element.css("font-size")) * 72.0 / 96.0).toFixed(0);
}
setRichCombo(e.editor,fontSizeMenu,fontSize);
}
},0);
}
var setRichCombo = function(editor, combo, value) {
var matched = false;
//The fun part about this is the list may not exist yet
if ($.isEmptyObject(combo._.items)) {
//So it's not present yet!
combo.createPanel(editor); //This creates it!
}
//Okay so items is now our list, get our value and go through it
//Loop the object and see if we have a match on any keys
$.each(combo._.items, function( index, v ) {
if (v.toLowerCase() === value ) {
matched = true;
value = v;
return false;
}
});
//If we match it we set it, else we set it's display with nothing selected!
if (matched)
combo.setValue(value);
else
combo.setValue('',value);
}
comment:17 Changed 6 years ago by Jakub Ś
(Eg a font that is not allowed, or a size not in the options).
If font is not allowed or not in the list then IMHO CKEditor should not display it at all. Anyway when font is not allowed and ACF is on then this font it is as good as gone when user for example switches to source or gets data from editor. Displaying such font can only be confusing for users.
comment:18 Changed 5 years ago by Chris Graham
Cc: chris@… added
comment:19 Changed 5 years ago by Jakub Ś
#12904 was marked as duplicate.
comment:20 Changed 4 years ago by Marek Lewandowski
cc
comment:21 Changed 4 years ago by Anna Tomanek
Summary: Font combos do not always reflect font stylingsFont Size and Font Name drop-downs do not always reflect font styling
comment:22 Changed 3 years ago by Jakub Ś
#14554 was marked as duplicate.
comment:23 Changed 3 years ago by Jakub Ś
#16678 was marked as duplicate.
Perhaps some conversion from pt to px and some font-name cleaning could be considered an option if we decide to do any converion?
Note: See TracTickets for help on using tickets.
© 2003 – 2019 CKSource – Frederico Knabben. All rights reserved. | Terms of use | Privacy policy
|
{
"url": "https://dev.ckeditor.com/ticket/9964",
"source_domain": "dev.ckeditor.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "56152",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C6JPKQ6CTNZIO4S2YWWNXWCURQ46NL5T",
"WARC-Concurrent-To": "<urn:uuid:3a2ecaff-52f6-4c9d-960f-1c9f5ff5bcc5>",
"WARC-Date": "2019-09-18T02:53:16Z",
"WARC-IP-Address": "52.33.255.87",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:6LY2I4T6LID7BEJ6H5XPR4KFLVL4DJP3",
"WARC-Record-ID": "<urn:uuid:1f57f139-cdef-49e1-a5c9-40c92ddd4b30>",
"WARC-Target-URI": "https://dev.ckeditor.com/ticket/9964",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:09d2bd1e-4994-4e68-a453-569b44d89d35>"
},
"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-20.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,
19,
20,
46,
47,
75,
76,
146,
147,
185,
210,
247,
341,
342,
354,
355,
613,
614,
628,
629,
670,
819,
820,
1059,
1060,
1212,
1251,
1252,
1346,
1347,
1489,
1490,
1634,
1635,
1775,
1776,
2005,
2006,
2026,
2027,
2071,
2072,
2095,
2096,
2149,
2150,
2259,
2260,
2498,
2499,
2644,
2645,
2691,
2692,
2885,
3072,
3073,
3089,
3090,
3209,
3210,
3377,
3378,
3569,
3570,
3635,
3636,
3689,
3690,
3711,
3732,
3733,
3774,
3775,
3795,
3819,
3820,
3863,
3864,
3890,
3891,
3983,
3984,
4062,
4098,
4099,
4122,
4123,
4267,
4268,
4273,
4379,
4380,
4454,
4455,
4891,
4986,
4987,
5075,
5076,
5120,
5121,
5655,
5656,
5700,
5701,
5791,
5792,
5845,
5846,
5866,
5889,
5890,
6039,
6040,
6309,
6310,
6429,
6460,
6753,
6754,
6795,
6796,
6816,
6839,
6840,
6989,
6990,
7142,
7143,
7262,
7263,
7466,
7616,
7650,
7954,
7966,
7971,
7972,
8128,
8240,
8241,
8488,
8489,
8619,
8674,
8675,
8723,
8724,
9275,
9276,
9543,
9544,
9974,
9975,
10017,
10018,
10285,
10286,
10369,
10370,
10499,
10562,
10651,
10652,
10713,
10714,
10734,
10757,
10758,
10954,
10955,
10997,
10998,
11018,
11044,
11085,
11086,
11176,
11177,
11339,
11340,
11382,
11383,
11414,
11415,
11455,
11456,
11475,
11476,
11518,
11519,
11761,
11812,
12038,
12039,
12054,
12055,
12274,
12374,
12375,
12934,
12935,
12988,
12989,
13034,
13035,
13052,
13053,
13385,
13386,
13481,
13482,
13518,
13519,
13593,
13625,
13626,
13627,
13730,
13798,
13879,
13906,
13924,
13925,
13970,
14077,
14091,
14092,
14141,
14142,
14196,
14197,
14327,
14390,
14438,
14439,
14488,
14520,
14564,
14599,
14600,
14632,
14675,
14709,
14710,
14742,
14785,
14820,
14821,
14853,
14898,
14933,
14934,
14966,
15009,
15044,
15045,
15077,
15120,
15155,
15156,
15188,
15231,
15266,
15267,
15300,
15335,
15357,
15358,
15383,
15480,
15498,
15499,
15500,
15562,
15576,
15590,
15596,
15597,
15649,
15650,
15679,
15680,
15744,
15790,
15829,
15887,
15897,
15898,
15971,
16036,
16089,
16090,
16137,
16169,
16196,
16226,
16240,
16252,
16253,
16337,
16358,
16393,
16406,
16444,
16445,
16451,
16452,
16494,
16495,
16558,
16559,
16854,
16855,
16902,
16903,
16921,
16922,
16964,
16965,
16997,
16998,
17050,
17051,
17054,
17055,
17102,
17103,
17229,
17230,
17272,
17273,
17305,
17306,
17348,
17349,
17381,
17382,
17512,
17513,
17562
],
"line_end_idx": [
19,
20,
46,
47,
75,
76,
146,
147,
185,
210,
247,
341,
342,
354,
355,
613,
614,
628,
629,
670,
819,
820,
1059,
1060,
1212,
1251,
1252,
1346,
1347,
1489,
1490,
1634,
1635,
1775,
1776,
2005,
2006,
2026,
2027,
2071,
2072,
2095,
2096,
2149,
2150,
2259,
2260,
2498,
2499,
2644,
2645,
2691,
2692,
2885,
3072,
3073,
3089,
3090,
3209,
3210,
3377,
3378,
3569,
3570,
3635,
3636,
3689,
3690,
3711,
3732,
3733,
3774,
3775,
3795,
3819,
3820,
3863,
3864,
3890,
3891,
3983,
3984,
4062,
4098,
4099,
4122,
4123,
4267,
4268,
4273,
4379,
4380,
4454,
4455,
4891,
4986,
4987,
5075,
5076,
5120,
5121,
5655,
5656,
5700,
5701,
5791,
5792,
5845,
5846,
5866,
5889,
5890,
6039,
6040,
6309,
6310,
6429,
6460,
6753,
6754,
6795,
6796,
6816,
6839,
6840,
6989,
6990,
7142,
7143,
7262,
7263,
7466,
7616,
7650,
7954,
7966,
7971,
7972,
8128,
8240,
8241,
8488,
8489,
8619,
8674,
8675,
8723,
8724,
9275,
9276,
9543,
9544,
9974,
9975,
10017,
10018,
10285,
10286,
10369,
10370,
10499,
10562,
10651,
10652,
10713,
10714,
10734,
10757,
10758,
10954,
10955,
10997,
10998,
11018,
11044,
11085,
11086,
11176,
11177,
11339,
11340,
11382,
11383,
11414,
11415,
11455,
11456,
11475,
11476,
11518,
11519,
11761,
11812,
12038,
12039,
12054,
12055,
12274,
12374,
12375,
12934,
12935,
12988,
12989,
13034,
13035,
13052,
13053,
13385,
13386,
13481,
13482,
13518,
13519,
13593,
13625,
13626,
13627,
13730,
13798,
13879,
13906,
13924,
13925,
13970,
14077,
14091,
14092,
14141,
14142,
14196,
14197,
14327,
14390,
14438,
14439,
14488,
14520,
14564,
14599,
14600,
14632,
14675,
14709,
14710,
14742,
14785,
14820,
14821,
14853,
14898,
14933,
14934,
14966,
15009,
15044,
15045,
15077,
15120,
15155,
15156,
15188,
15231,
15266,
15267,
15300,
15335,
15357,
15358,
15383,
15480,
15498,
15499,
15500,
15562,
15576,
15590,
15596,
15597,
15649,
15650,
15679,
15680,
15744,
15790,
15829,
15887,
15897,
15898,
15971,
16036,
16089,
16090,
16137,
16169,
16196,
16226,
16240,
16252,
16253,
16337,
16358,
16393,
16406,
16444,
16445,
16451,
16452,
16494,
16495,
16558,
16559,
16854,
16855,
16902,
16903,
16921,
16922,
16964,
16965,
16997,
16998,
17050,
17051,
17054,
17055,
17102,
17103,
17229,
17230,
17272,
17273,
17305,
17306,
17348,
17349,
17381,
17382,
17512,
17513,
17562,
17658
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17658,
"ccnet_original_nlines": 341,
"rps_doc_curly_bracket": 0.001812209957279265,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32985156774520874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018691590055823326,
"rps_doc_frac_lines_end_with_ellipsis": 0.002923979889601469,
"rps_doc_frac_no_alph_words": 0.25508520007133484,
"rps_doc_frac_unique_words": 0.2844392657279968,
"rps_doc_mean_word_length": 4.9154052734375,
"rps_doc_num_sentences": 197,
"rps_doc_symbol_to_word_ratio": 0.004947769921272993,
"rps_doc_unigram_entropy": 5.779827117919922,
"rps_doc_word_count": 2577,
"rps_doc_frac_chars_dupe_10grams": 0.08233994245529175,
"rps_doc_frac_chars_dupe_5grams": 0.16341674327850342,
"rps_doc_frac_chars_dupe_6grams": 0.14573301374912262,
"rps_doc_frac_chars_dupe_7grams": 0.13531222939491272,
"rps_doc_frac_chars_dupe_8grams": 0.0963921993970871,
"rps_doc_frac_chars_dupe_9grams": 0.0963921993970871,
"rps_doc_frac_chars_top_2gram": 0.0170521792024374,
"rps_doc_frac_chars_top_3gram": 0.01973631978034973,
"rps_doc_frac_chars_top_4gram": 0.011289180256426334,
"rps_doc_books_importance": -1579.87353515625,
"rps_doc_books_importance_length_correction": -1579.87353515625,
"rps_doc_openwebtext_importance": -874.1231079101562,
"rps_doc_openwebtext_importance_length_correction": -874.1231079101562,
"rps_doc_wikipedia_importance": -497.91375732421875,
"rps_doc_wikipedia_importance_length_correction": -497.91375732421875
},
"fasttext": {
"dclm": 0.14293527603149414,
"english": 0.8457112908363342,
"fineweb_edu_approx": 1.6069457530975342,
"eai_general_math": 0.6812770962715149,
"eai_open_web_math": 0.42419904470443726,
"eai_web_code": 0.1535927653312683
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"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": "18",
"label": "Q&A Forum"
}
},
"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
|
8,302,517,059,717,828,000 |
Zsh Mailing List Archive
Messages sorted by: Reverse Date, Date, Thread, Author
PATCH: replace-string function
Here's a replace-string (and replace-pattern) widget implemented in
terms of a read-from-minibuffer widget. The latter uses the new
features of 4.1 for recursive editing and limiting the area of the
editing buffer, so provides a better `user experience' than was possible
in 4.0 --- read-from-minibuffer allows you to use all zle functions as
normal.
The replace-pattern variant was designed to have familiar-looking syntax
for inserting the original string and parenthesised subexpressions. I'm
not claiming familiar is necessarily optimal, however.
There are other things that aren't optimal. The problem with `undo' is
noted in the manual page.
Completion in the `minibuffer' hasn't been handled --- I think there's
some way of tweaking the context so that the completion system sees what
you want it to at that point, but I can't remember how.
Also, it doesn't perform replacements across the cursor position. This
was the easiest way to ensure the cursor position was maintained if the
length changed.
Also, it ought to use a separate history, but actually refers to the
standard line history. I'd like a mechanism which makes it easier to
provide alternative sources for the history in special contexts. This
is very hairy at the moment, as I discovered with zcalc.
Index: Doc/Zsh/contrib.yo
===================================================================
RCS file: /cvsroot/zsh/zsh/Doc/Zsh/contrib.yo,v
retrieving revision 1.24
diff -u -r1.24 contrib.yo
--- Doc/Zsh/contrib.yo 27 Jan 2003 16:41:15 -0000 1.24
+++ Doc/Zsh/contrib.yo 3 Feb 2003 10:38:02 -0000
@@ -588,6 +588,58 @@
bindkey '^X^Z' predict-on
bindkey '^Z' predict-off)
)
+tindex(read-from-minibuffer)
+item(tt(read-from-minibuffer))(
+This is most useful when called as a function from inside a widget, but will
+work correctly as a widget in its own right. It prompts for a value
+below the current command line; a value may be input using all of the
+standard zle operations (and not merely the restricted set available
+when executing, for example, tt(execute-named-cmd)). The value is then
+returned to the calling function in the parameter tt($REPLY) and the
+editing buffer restored to its previous state. If the read was aborted
+by a keyboard break (typically tt(^G)), the function returns status 1
+and tt($REPLY) is not set. If an argument is supplied to the function
+it is taken as a prompt, otherwise `tt(? )' is used.
+
+The name is a slight misnomer, as in fact the shell's own minibuffer is
+not used. Hence it is still possible to call tt(executed-named-cmd) and
+similar functions while reading a value.
+)
+tindex(replace-string)
+tindex(replace-pattern)
+item(tt(replace-string), tt(replace-pattern))(
+The function tt(replace-string) implements two widgets.
+If defined under the same name as the function, it prompts for two
+strings; the first (source) string will be replaced by the second
+everywhere it occurs in the line editing buffer.
+
+If the widget name contains the word `tt(pattern)', for example by
+defining the widget using the command `tt(zle -N replace-pattern
+replace-string)', then the replacement is done by pattern matching. All
+zsh extended globbing patterns can be used in the source string; note
+that unlike filename generation the pattern does not need to match an
+entire word, nor do glob qualifiers have any effect. In addition, the
+replacement string can contain parameter or command substitutions.
+Furthermore, a `tt(&)' in the replacement string will be replaced with
+the matched source string, and a backquoted digit `tt(\)var(N)' will be
+replaced by the var(N)th parenthesised expression matched. The form
+`tt(\{)var(N)tt(})' may be used to protect the digit from following
+digits.
+
+For example, starting from the line:
+
+example(print This line contains fan and fond)
+
+and invoking tt(replace-pattern) with the source string `tt(f(?)n)' and
+the replacment string `tt(c\1r)' produces the not very useful line:
+
+example(print This line contains car and cord)
+
+The range of the replacement string can be limited by using the
+tt(narrow-to-region-invisible) widget. One limitation of the current
+version is that tt(undo) will cycle through changes to the replacement
+and source strings before undoing the replacement itself.
+)
tindex(smart-insert-last-word)
item(tt(smart-insert-last-word))(
This function may replace the tt(insert-last-word) widget, like so:
Index: Functions/Zle/read-from-minibuffer
===================================================================
RCS file: Functions/Zle/read-from-minibuffer
diff -N Functions/Zle/read-from-minibuffer
--- /dev/null 1 Jan 1970 00:00:00 -0000
+++ Functions/Zle/read-from-minibuffer 3 Feb 2003 10:38:02 -0000
@@ -0,0 +1,20 @@
+local savelbuffer=$LBUFFER saverbuffer=$RBUFFER
+local savepredisplay=$PREDISPLAY savepostdisplay=$POSTDISPLAY
+
+LBUFFER=
+RBUFFER=
+PREDISPLAY="$PREDISPLAY$savelbuffer$saverbuffer$POSTDISPLAY
+${1:-? }"
+POSTDISPLAY=
+
+zle recursive-edit
+integer stat=$?
+
+(( stat )) || REPLY=$BUFFER
+
+LBUFFER=$savelbuffer
+RBUFFER=$saverbuffer
+PREDISPLAY=$savepredisplay
+POSTDISPLAY=$savepostdisplay
+
+return $stat
Index: Functions/Zle/replace-string
===================================================================
RCS file: Functions/Zle/replace-string
diff -N Functions/Zle/replace-string
--- /dev/null 1 Jan 1970 00:00:00 -0000
+++ Functions/Zle/replace-string 3 Feb 2003 10:38:02 -0000
@@ -0,0 +1,45 @@
+emulate -L zsh
+setopt extendedglob
+
+autoload read-from-minibuffer
+
+local p1="Replace: " p2=" with: "
+local src rep REPLY MATCH MBEGIN MEND curwidget=$WIDGET
+local -a match mbegin mend
+
+read-from-minibuffer $p1 || return 1
+src=$REPLY
+
+read-from-minibuffer "$p1$src$p2" || return 1
+rep=$REPLY
+
+if [[ $curwidget = *pattern* ]]; then
+ local rep2
+ # The following horror is so that an & preceded by an even
+ # number of backslashes is active, without stripping backslashes,
+ # while preceded by an odd number of backslashes is inactive,
+ # with one backslash being stripped. A similar logic applies
+ # to \digit.
+ while [[ $rep = (#b)([^\\]#)(\\\\)#(\\|)(\&|\\<->|\\\{<->\})(*) ]]; do
+ if [[ -n $match[3] ]]; then
+ # Expression is quoted, strip quotes
+ rep2="${match[1]}${match[2]}${match[4]}"
+ else
+ rep2+="${match[1]}${match[2]}"
+ if [[ $match[4] = \& ]]; then
+ rep2+='${MATCH}'
+ elif [[ $match[4] = \\\{* ]]; then
+ rep2+='${match['${match[4][3,-2]}']}'
+ else
+ rep2+='${match['${match[4][2,-1]}']}'
+ fi
+ fi
+ rep=${match[5]}
+ done
+ rep2+=$rep
+ LBUFFER=${LBUFFER//(#bm)$~src/${(e)rep2}}
+ RBUFFER=${RBUFFER//(#bm)$~src/${(e)rep2}}
+else
+ LBUFFER=${LBUFFER//$src/$rep}
+ RBUFFER=${RBUFFER//$src/$rep}
+fi
--
Peter Stephenson <pws@xxxxxxx> Software Engineer
CSR Ltd., Science Park, Milton Road,
Cambridge, CB4 0WH, UK Tel: +44 (0)1223 692070
**********************************************************************
The information transmitted is intended only for the person or
entity to which it is addressed and may contain confidential
and/or privileged material.
Any review, retransmission, dissemination or other use of, or
taking of any action in reliance upon, this information by
persons or entities other than the intended recipient is
prohibited.
If you received this in error, please contact the sender and
delete the material from any computer.
**********************************************************************
Messages sorted by: Reverse Date, Date, Thread, Author
|
{
"url": "http://www.zsh.org/mla/workers/2003/msg00064.html",
"source_domain": "www.zsh.org",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "9819",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7LTLZRWVRUMUYRMHLIKO7G3CPDAC34GG",
"WARC-Concurrent-To": "<urn:uuid:ddd9a747-c9d1-4d57-bff3-e9926dde7c2f>",
"WARC-Date": "2019-01-18T00:33:46Z",
"WARC-IP-Address": "203.24.36.104",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OZMPHGKNNDJPBBCZECGAEFUHPBPZSMMC",
"WARC-Record-ID": "<urn:uuid:4d5f7ca4-c446-4edc-9093-7091825c2983>",
"WARC-Target-URI": "http://www.zsh.org/mla/workers/2003/msg00064.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:473785bf-68e3-47d0-9817-fb2872e84bdc>"
},
"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-140-176-207.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,
25,
80,
81,
112,
113,
114,
115,
183,
248,
315,
388,
459,
467,
468,
541,
614,
669,
670,
742,
768,
769,
840,
913,
969,
970,
1042,
1114,
1130,
1131,
1200,
1270,
1341,
1398,
1399,
1425,
1493,
1541,
1566,
1592,
1647,
1696,
1717,
1744,
1771,
1774,
1804,
1837,
1915,
1985,
2056,
2126,
2199,
2269,
2342,
2413,
2485,
2539,
2541,
2614,
2688,
2730,
2733,
2757,
2782,
2830,
2887,
2955,
3022,
3072,
3074,
3142,
3208,
3282,
3353,
3424,
3496,
3564,
3636,
3709,
3779,
3848,
3857,
3859,
3897,
3899,
3947,
3949,
4022,
4091,
4093,
4141,
4143,
4208,
4279,
4351,
4410,
4413,
4445,
4480,
4549,
4591,
4659,
4704,
4747,
4787,
4852,
4869,
4918,
4981,
4983,
4993,
5003,
5064,
5075,
5089,
5091,
5111,
5128,
5130,
5159,
5161,
5183,
5205,
5233,
5263,
5265,
5279,
5315,
5383,
5422,
5459,
5499,
5558,
5575,
5591,
5612,
5614,
5645,
5647,
5684,
5741,
5769,
5771,
5809,
5821,
5823,
5870,
5882,
5884,
5923,
5939,
6003,
6074,
6141,
6208,
6226,
6302,
6332,
6375,
6422,
6429,
6466,
6502,
6522,
6563,
6604,
6615,
6656,
6665,
6670,
6688,
6698,
6714,
6761,
6808,
6814,
6849,
6884,
6888,
6889,
6893,
6959,
6996,
7068,
7069,
7070,
7141,
7204,
7266,
7295,
7357,
7417,
7475,
7489,
7551,
7590,
7661,
7662,
7663,
7664
],
"line_end_idx": [
25,
80,
81,
112,
113,
114,
115,
183,
248,
315,
388,
459,
467,
468,
541,
614,
669,
670,
742,
768,
769,
840,
913,
969,
970,
1042,
1114,
1130,
1131,
1200,
1270,
1341,
1398,
1399,
1425,
1493,
1541,
1566,
1592,
1647,
1696,
1717,
1744,
1771,
1774,
1804,
1837,
1915,
1985,
2056,
2126,
2199,
2269,
2342,
2413,
2485,
2539,
2541,
2614,
2688,
2730,
2733,
2757,
2782,
2830,
2887,
2955,
3022,
3072,
3074,
3142,
3208,
3282,
3353,
3424,
3496,
3564,
3636,
3709,
3779,
3848,
3857,
3859,
3897,
3899,
3947,
3949,
4022,
4091,
4093,
4141,
4143,
4208,
4279,
4351,
4410,
4413,
4445,
4480,
4549,
4591,
4659,
4704,
4747,
4787,
4852,
4869,
4918,
4981,
4983,
4993,
5003,
5064,
5075,
5089,
5091,
5111,
5128,
5130,
5159,
5161,
5183,
5205,
5233,
5263,
5265,
5279,
5315,
5383,
5422,
5459,
5499,
5558,
5575,
5591,
5612,
5614,
5645,
5647,
5684,
5741,
5769,
5771,
5809,
5821,
5823,
5870,
5882,
5884,
5923,
5939,
6003,
6074,
6141,
6208,
6226,
6302,
6332,
6375,
6422,
6429,
6466,
6502,
6522,
6563,
6604,
6615,
6656,
6665,
6670,
6688,
6698,
6714,
6761,
6808,
6814,
6849,
6884,
6888,
6889,
6893,
6959,
6996,
7068,
7069,
7070,
7141,
7204,
7266,
7295,
7357,
7417,
7475,
7489,
7551,
7590,
7661,
7662,
7663,
7664,
7718
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7718,
"ccnet_original_nlines": 200,
"rps_doc_curly_bracket": 0.005312259774655104,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2401372194290161,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033733561635017395,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.386506587266922,
"rps_doc_frac_unique_words": 0.49298813939094543,
"rps_doc_mean_word_length": 5.773462772369385,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.006289309822022915,
"rps_doc_unigram_entropy": 5.595452308654785,
"rps_doc_word_count": 927,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05530643090605736,
"rps_doc_frac_chars_dupe_6grams": 0.03288489952683449,
"rps_doc_frac_chars_dupe_7grams": 0.01606876030564308,
"rps_doc_frac_chars_dupe_8grams": 0.01606876030564308,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.005605380050837994,
"rps_doc_frac_chars_top_3gram": 0.004484300035983324,
"rps_doc_frac_chars_top_4gram": 0.007847529835999012,
"rps_doc_books_importance": -803.5845336914062,
"rps_doc_books_importance_length_correction": -803.5845336914062,
"rps_doc_openwebtext_importance": -464.64080810546875,
"rps_doc_openwebtext_importance_length_correction": -464.64080810546875,
"rps_doc_wikipedia_importance": -366.4654235839844,
"rps_doc_wikipedia_importance_length_correction": -366.4654235839844
},
"fasttext": {
"dclm": 0.6955379247665405,
"english": 0.7606114149093628,
"fineweb_edu_approx": 2.2862935066223145,
"eai_general_math": 0.7600513100624084,
"eai_open_web_math": 0.3428753614425659,
"eai_web_code": 0.3901411294937134
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,143,295,719,094,196,000 |
Michael Michael - 5 months ago 33
Python Question
How to determine whether a Pandas Column contains a particular value
I am trying to determine whether there is an entry in a Pandas column that has a particular value. I tried to do this with
if x in df['id']
. I thought this was working, except when I fed it a value that I knew was not in the column
43 in df['id']
it still returned
True
. When I subset to a data frame only containing entries matching the missing id
df[df['id'] == 43]
there are, obviously, no entries in it. How to I determine if a column in a Pandas data frame contains a particular value and why doesn't my current method work? (FYI, I have the same problem when I use the implementation in this answer to a similar question).
Answer
in of a Series checks whether the value is in the index:
In [11]: s = pd.Series(list('abc'))
In [12]: s
Out[12]:
0 a
1 b
2 c
dtype: object
In [13]: 1 in s
Out[13]: True
In [14]: 'a' in s
Out[14]: False
One option is to see if it's in unique values:
In [21]: s.unique()
Out[21]: array(['a', 'b', 'c'], dtype=object)
In [22]: 'a' in s.unique()
Out[22]: True
or a python set:
In [23]: set(s)
Out[23]: {'a', 'b', 'c'}
In [24]: 'a' in set(s)
Out[24]: True
As pointed out by @DSM, it may be more efficient (especially if you're just doing this for one value) to just use in directly on the values:
In [31]: s.values
Out[31]: array(['a', 'b', 'c'], dtype=object)
In [32]: 'a' in s.values
Out[32]: True
|
{
"url": "https://codedump.io/share/MgQIVRYcUaX7/1/how-to-determine-whether-a-pandas-column-contains-a-particular-value",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "26887",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:N47P32TGAETHLOZQX3NSRMIDZ7DTJ4G2",
"WARC-Concurrent-To": "<urn:uuid:246b6597-245d-441d-9010-a51e9ed20006>",
"WARC-Date": "2017-04-27T09:36:54Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FSK2UZC22YLGYAC2VT7FOVT2ZAHHHOL6",
"WARC-Record-ID": "<urn:uuid:7d4c36d7-af26-4033-9d53-d91518bb099a>",
"WARC-Target-URI": "https://codedump.io/share/MgQIVRYcUaX7/1/how-to-determine-whether-a-pandas-column-contains-a-particular-value",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9baf33e-68fe-48d9-bb91-abd2151b3d60>"
},
"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,
34,
50,
51,
120,
121,
244,
245,
262,
355,
370,
388,
393,
473,
492,
753,
754,
761,
762,
819,
820,
856,
857,
868,
878,
885,
892,
899,
913,
914,
930,
944,
945,
963,
978,
979,
1026,
1027,
1047,
1093,
1094,
1121,
1135,
1136,
1153,
1154,
1170,
1195,
1196,
1219,
1233,
1234,
1375,
1376,
1394,
1440,
1441,
1466
],
"line_end_idx": [
34,
50,
51,
120,
121,
244,
245,
262,
355,
370,
388,
393,
473,
492,
753,
754,
761,
762,
819,
820,
856,
857,
868,
878,
885,
892,
899,
913,
914,
930,
944,
945,
963,
978,
979,
1026,
1027,
1047,
1093,
1094,
1121,
1135,
1136,
1153,
1154,
1170,
1195,
1196,
1219,
1233,
1234,
1375,
1376,
1394,
1440,
1441,
1466,
1479
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1479,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0.0013522700173780322,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3616504967212677,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02669903077185154,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34708738327026367,
"rps_doc_frac_unique_words": 0.516853928565979,
"rps_doc_mean_word_length": 3.805243492126465,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.473281383514404,
"rps_doc_word_count": 267,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04133858159184456,
"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.011811019852757454,
"rps_doc_frac_chars_top_3gram": 0.04724409058690071,
"rps_doc_frac_chars_top_4gram": 0.04724409058690071,
"rps_doc_books_importance": -180.2249298095703,
"rps_doc_books_importance_length_correction": -173.1007537841797,
"rps_doc_openwebtext_importance": -125.22022247314453,
"rps_doc_openwebtext_importance_length_correction": -125.22022247314453,
"rps_doc_wikipedia_importance": -71.66777801513672,
"rps_doc_wikipedia_importance_length_correction": -61.017215728759766
},
"fasttext": {
"dclm": 0.05506289005279541,
"english": 0.7986919283866882,
"fineweb_edu_approx": 2.1074655055999756,
"eai_general_math": 0.9409922361373901,
"eai_open_web_math": 0.15550565719604492,
"eai_web_code": 0.8936530947685242
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,907,378,300,630,914,600 |
One thing I don’t like about road trips is that even the mighty Google Maps have you playing exit roulette. When you do a search for gas or restaurants the results are based on distance rather than the nearest exit, thus there might be a gas station half a mile from your vehicle, but the next highway exit is 11 miles away! At some point, I used RoadAhead to solve this issue, but the results were less than stellar. If my memory serves me right, the app was clunky and unreliable.
I decided to give RoadAhead another try after a search for reviews of similar apps did not return any clear leader in this category.
The app has not changed much since I last used it a couple of years ago. The last update was on August, 6 of this year. Aesthetically the app won’t win any awards, but usability wise, I found it has improved.
As you can see there are 4 buttons at the bottom: Exits, Categories, Filter and Social (I think this is new, at least for me)
Let’s take a quick tour of each of these buttons.
Exits is the heart and soul of this app. You can select the highway, and make plans before you get on it. You can also tap to see what’s around you and look at different exits.
Categories gives you access to almost anything you might need on the road! There is a total of 28 categories from ATM to Worship. This is in a way similar to the classic GPS offerings.
Filter allows you to be very selective about your results. You can be as specific as you wish.
Social is not really about you, but rather RoadAhead’s social efforts. I initially thought you could share your route or get some kind of social input into your options, but as I pointed out this is a request to follow and like the app on social media outlets.
The information this app offers is quite useful and it should be integrated into the leading map apps. It would make sense for this information to be neatly incorporated into those navigation apps rather than having to leave such apps to try to find this information. During my last road trip this app earned its right to stay on my phone during road trips.
The truth is Apple’s Maps and the competition should be smarter. For instance, why can’t they estimate when I will need gas and suggest nearby gas stations? Personally, I would be willing to enter my car model and typical gas consumption at the beginning of my road trip. I would also enter my favorite restaurants and the app could suggest or alert me to the fact that such restaurant is on x or y exit.
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
|
{
"url": "https://travelisrewarding.com/2017/09/08/an-essential-road-trip-app-that-should-be-part-of-map-apps/",
"source_domain": "travelisrewarding.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "71847",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:66SBAV26X74IPKCY3I2XDNIOS5OS3PAJ",
"WARC-Concurrent-To": "<urn:uuid:db1993f3-1806-4604-8788-690a337f3c95>",
"WARC-Date": "2018-12-19T15:16:37Z",
"WARC-IP-Address": "192.0.78.25",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7MOTRDCU7TEBX3W2AK7WW6PJSJSAH2IG",
"WARC-Record-ID": "<urn:uuid:b890280c-8d01-406c-86b4-39419535b8d5>",
"WARC-Target-URI": "https://travelisrewarding.com/2017/09/08/an-essential-road-trip-app-that-should-be-part-of-map-apps/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6944ca98-8479-42cb-9192-96e31120295a>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-43-183-218.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,
483,
484,
617,
618,
827,
828,
954,
955,
1005,
1006,
1183,
1184,
1369,
1370,
1465,
1466,
1727,
1728,
2086,
2087,
2492,
2493,
2508,
2509,
2523,
2524,
2579,
2580,
2599,
2600,
2673,
2674,
2688,
2689,
2756,
2757,
2773,
2774,
2841,
2842,
2857,
2858,
2926,
2927
],
"line_end_idx": [
483,
484,
617,
618,
827,
828,
954,
955,
1005,
1006,
1183,
1184,
1369,
1370,
1465,
1466,
1727,
1728,
2086,
2087,
2492,
2493,
2508,
2509,
2523,
2524,
2579,
2580,
2599,
2600,
2673,
2674,
2688,
2689,
2756,
2757,
2773,
2774,
2841,
2842,
2857,
2858,
2926,
2927,
2943
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2943,
"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.4730831980705261,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021207179874181747,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12071777880191803,
"rps_doc_frac_unique_words": 0.4737827777862549,
"rps_doc_mean_word_length": 4.331460475921631,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.099017143249512,
"rps_doc_word_count": 534,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0475572794675827,
"rps_doc_frac_chars_dupe_6grams": 0.025940340012311935,
"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.012970170006155968,
"rps_doc_frac_chars_top_3gram": 0.027669690549373627,
"rps_doc_frac_chars_top_4gram": 0.03631646931171417,
"rps_doc_books_importance": -264.1006164550781,
"rps_doc_books_importance_length_correction": -264.1006164550781,
"rps_doc_openwebtext_importance": -145.95188903808594,
"rps_doc_openwebtext_importance_length_correction": -145.95188903808594,
"rps_doc_wikipedia_importance": -136.53482055664062,
"rps_doc_wikipedia_importance_length_correction": -136.53482055664062
},
"fasttext": {
"dclm": 0.023145969957113266,
"english": 0.9616077542304993,
"fineweb_edu_approx": 1.240075945854187,
"eai_general_math": 0.00017291000403929502,
"eai_open_web_math": 0.056385401636362076,
"eai_web_code": -0.000006910000138304895
}
}
|
{
"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": "388.2",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Local transit"
}
}
},
"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": "9",
"label": "Personal/Misc"
}
},
"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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "24",
"label": "User Review"
}
},
"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
|
4,951,534,154,188,219,000 |
通过导入 OpenAPI 定义设置边缘优化的 API - Amazon API Gateway
Amazon Web Services 文档中描述的 Amazon Web Services 服务或功能可能因区域而异。要查看适用于中国区域的差异，请参阅中国的 Amazon Web Services 服务入门
通过导入 OpenAPI 定义设置边缘优化的 API
通过指定相应 API Gateway API 实体的 OpenAPI 定义并将 OpenAPI 定义导入 API Gateway，您可以在 API Gateway 中设置 API。
以下 OpenAPI 定义描述了一个简单 API，该 API 仅公开与后端中 PetStore 网站的 HTTP 终端节点集成的 GET / 方法，并返回 200 OK 响应。
OpenAPI 2.0
{ "swagger": "2.0", "info": { "title": "Simple PetStore (OpenAPI)" }, "schemes": [ "https" ], "paths": { "/pets": { "get": { "responses": { "200": { "description": "200 response" } }, "x-amazon-apigateway-integration": { "responses": { "default": { "statusCode": "200" } }, "uri": "http://petstore-demo-endpoint.execute-api.com/petstore/pets", "passthroughBehavior": "when_no_match", "httpMethod": "GET", "type": "http" } } }, "/pets/{petId}": { "get": { "parameters": [ { "name": "petId", "in": "path", "required": true, "type": "string" } ], "responses": { "200": { "description": "200 response" } }, "x-amazon-apigateway-integration": { "responses": { "default": { "statusCode": "200" } }, "requestParameters": { "integration.request.path.id": "method.request.path.petId" }, "uri": "http://petstore-demo-endpoint.execute-api.com/petstore/pets/{id}", "passthroughBehavior": "when_no_match", "httpMethod": "GET", "type": "http" } } } } }
以下过程介绍如何使用 API Gateway 控制台将这些 OpenAPI 定义导入到 API Gateway 中。
使用 API Gateway 控制台导入简单的 OpenAPI 定义
1. 登录 API Gateway 控制台。
2. 选择 Create API (创建 API)
3. 选择 Import from OpenAPI (从 OpenAPI 中导入)
4. 如果您已将上述 OpenAPI 定义保存在文件中，请选择 Select OpenAPI File (选择 OpenAPI 文件)。此外，您还可以复制 OpenAPI 定义并将其粘贴到导入文本编辑器中。
5. 选择导入以便完成 OpenAPI 定义的导入。
要使用 Amazon CLI 导入 OpenAPI 定义，请将 OpenAPI 定义保存到一个文件中，然后运行以下命令（假设您使用 us-west-2 区域，OpenAPI 文件的绝对路径为 file:///path/to/API_OpenAPI_template.json）：
aws apigateway import-rest-api --body 'file:///path/to/API_OpenAPI_template.json' --region us-west-2
|
{
"url": "https://docs.amazonaws.cn/apigateway/latest/developerguide/create-api-using-swagger.html",
"source_domain": "docs.amazonaws.cn",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "13936",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QYRK63C4MR7GTLUYLTWVYM7Z5UDLPE3N",
"WARC-Concurrent-To": "<urn:uuid:59a07fb7-fe08-4a5c-a122-fd530e5046b2>",
"WARC-Date": "2021-09-23T02:45:27Z",
"WARC-IP-Address": "54.222.17.18",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:NA4TGFTFBWIMXBKJGLHGQOXTHJ5PNXGL",
"WARC-Record-ID": "<urn:uuid:c479bd3f-259e-4676-8b3a-b808b5811b5e>",
"WARC-Target-URI": "https://docs.amazonaws.cn/apigateway/latest/developerguide/create-api-using-swagger.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:081131ea-8adc-48de-82cb-439103e0b7b3>"
},
"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-112\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
48,
154,
155,
182,
183,
274,
275,
364,
365,
377,
1316,
1317,
1376,
1377,
1412,
1413,
1438,
1439,
1467,
1468,
1512,
1513,
1619,
1620,
1649,
1650,
1790,
1791
],
"line_end_idx": [
48,
154,
155,
182,
183,
274,
275,
364,
365,
377,
1316,
1317,
1376,
1377,
1412,
1413,
1438,
1439,
1467,
1468,
1512,
1513,
1619,
1620,
1649,
1650,
1790,
1791,
1891
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1891,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0.022210469469428062,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.026915110647678375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04554865136742592,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6501035094261169,
"rps_doc_frac_unique_words": 0.5860214829444885,
"rps_doc_mean_word_length": 7.177419185638428,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.291644096374512,
"rps_doc_word_count": 186,
"rps_doc_frac_chars_dupe_10grams": 0.13632959127426147,
"rps_doc_frac_chars_dupe_5grams": 0.21273407340049744,
"rps_doc_frac_chars_dupe_6grams": 0.21273407340049744,
"rps_doc_frac_chars_dupe_7grams": 0.13632959127426147,
"rps_doc_frac_chars_dupe_8grams": 0.13632959127426147,
"rps_doc_frac_chars_dupe_9grams": 0.13632959127426147,
"rps_doc_frac_chars_top_2gram": 0.05243445932865143,
"rps_doc_frac_chars_top_3gram": 0.03820224851369858,
"rps_doc_frac_chars_top_4gram": 0.03445693105459213,
"rps_doc_books_importance": -204.70777893066406,
"rps_doc_books_importance_length_correction": -204.7068634033203,
"rps_doc_openwebtext_importance": -155.81536865234375,
"rps_doc_openwebtext_importance_length_correction": -155.81536865234375,
"rps_doc_wikipedia_importance": -70.56137084960938,
"rps_doc_wikipedia_importance_length_correction": -70.56137084960938
},
"fasttext": {
"dclm": 0.9994720816612244,
"english": 0.08577343821525574,
"fineweb_edu_approx": 1.3163366317749023,
"eai_general_math": 0.00016337999841198325,
"eai_open_web_math": 0.057580649852752686,
"eai_web_code": 0.9728363156318665
}
}
|
{
"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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,456,967,548,030,709,000 |
DirectionSelectionMixin
Maps direction semantics to selection semantics
Overview
Purpose: maps direction semantics (e.g., up or down) to selection semantics (e.g., select previous or select next).
This mixin works in the middle of the Elix render pipeline:
events → methodsmethods → setState → render → update DOM
Expects the component to provide:
• selectNext, selectPrevious, selectLast, selectFirst methods.
Provides the component with:
• internal.canGoLeft, internal.canGoRight properties.
• internal.goDown, internal.goUp, internal.goLeft, internal.goRight methods.
Usage
import DirectionSelectionMixin from 'elix/src/DirectionSelectionMixin.js';
class MyElement extends DirectionSelectionMixin(HTMLElement) {}
This mixin is designed to complement input mixins that map input events to directions, including ArrowDirectionMixin, KeyboardDirectionMixin, and TouchSwipeMixin. Those mixins can focus exclusively on direction instead of selection. You can use DirectionSelectionMixin to map those directions to selection operations. The level of abstraction provided by DirectionSelectionMixin allows the input mixins to be used that don't deal with selection, and want to interpret direction semantics in other ways.
Mapping direction semantics to selection semantics
When a direction method with a standard identifier is invoked, a corresponding selection method is invoked:
*If the component has a rightToLeft property that is true, the mapping of left/right to previous/next is reversed. That is, going left means going to the next item, not the previous one. You can define such a rightToLeft property with LanguageDirectionMixin.
A common use of DirectionSelectionMixin will be to connect the KeyboardMixin and KeyboardDirectionMixin above to the Elix SingleSelectionMixin. This effectively creates a chain of actions that convert keyboard events to changes in selection.
Example: a press of the Down arrow key can be handled in the following steps:
1. KeyboardMixin receives the keydown event for the Down arrow key and invokes the component's internal.keydown method.
2. KeyboardDirectionMixin handles internal.keydown for the key, and invokes internal.goDown.
3. DirectionSelectionMixin handles internal.goDown and invokes selectNext.
4. SingleSelectionMixin handles selectNext and updates the selection.
This sequence may seem circuitous, but factoring the behaviors this way allows other forms of interaction. E.g., a separate mixin to handle touch gestures only has to map a "swipe left" gesture to a direction method like goRight in order to patch into this chain. This saves the touch logic from having to know anything about selection.
API
Used by classes AutoCompleteComboBox, Carousel, CarouselSlideshow, CarouselWithThumbnails, FilterComboBox, FilterListBox, ListBox, ListComboBox, ListWithSearch, Menu, SlideshowWithPlayControls, SlidingPages, and TabStrip.
[internal.goDown]() method
Invokes selectNext to select the next item.
[internal.goEnd]() method
Invokes selectLast to select the next item.
[internal.goLeft]() method
Invokes selectPrevious to select the previous item.
If the element has a rightToLeft property and it is true, then this selects the next item.
[internal.goNext]() method
Invokes selectNext to select the next item.
[internal.goPrevious]() method
Invokes selectPrevious to select the previous item.
[internal.goRight]() method
Invokes selectNext to select the next item.
If the element has a rightToLeft property and it is true, then this selects the previous item.
[internal.goStart]() method
Invokes selectFirst to select the first item.
[internal.goUp]() method
Invokes selectPrevious to select the previous item.
|
{
"url": "https://component.kitchen/elix/DirectionSelectionMixin",
"source_domain": "component.kitchen",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "32472",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXXTXJHEVCRX4LUTP7IN4UOQFZ3JFKS7",
"WARC-Concurrent-To": "<urn:uuid:cfe8ee4a-e83b-46bb-b9ab-5d5cf959829e>",
"WARC-Date": "2020-01-27T05:36:10Z",
"WARC-IP-Address": "52.203.255.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YHM73BYZIZ5HHOJ3CVMR5TP6HNB75KOL",
"WARC-Record-ID": "<urn:uuid:3b33f513-db7e-4f51-985b-3345e70bfa2a>",
"WARC-Target-URI": "https://component.kitchen/elix/DirectionSelectionMixin",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5dde531-7988-48b5-8066-5070253bcc23>"
},
"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-48.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,
24,
25,
73,
74,
83,
84,
200,
201,
261,
262,
319,
320,
354,
355,
420,
421,
450,
451,
507,
586,
587,
593,
594,
669,
733,
734,
1237,
1238,
1289,
1290,
1398,
1399,
1658,
1659,
1901,
1902,
1980,
1981,
2103,
2198,
2275,
2347,
2348,
2685,
2686,
2690,
2691,
2913,
2914,
2941,
2942,
2986,
2987,
3013,
3014,
3058,
3059,
3086,
3087,
3139,
3140,
3231,
3232,
3259,
3260,
3304,
3305,
3336,
3337,
3389,
3390,
3418,
3419,
3463,
3464,
3559,
3560,
3588,
3589,
3635,
3636,
3661,
3662
],
"line_end_idx": [
24,
25,
73,
74,
83,
84,
200,
201,
261,
262,
319,
320,
354,
355,
420,
421,
450,
451,
507,
586,
587,
593,
594,
669,
733,
734,
1237,
1238,
1289,
1290,
1398,
1399,
1658,
1659,
1901,
1902,
1980,
1981,
2103,
2198,
2275,
2347,
2348,
2685,
2686,
2690,
2691,
2913,
2914,
2941,
2942,
2986,
2987,
3013,
3014,
3058,
3059,
3086,
3087,
3139,
3140,
3231,
3232,
3259,
3260,
3304,
3305,
3336,
3337,
3389,
3390,
3418,
3419,
3463,
3464,
3559,
3560,
3588,
3589,
3635,
3636,
3661,
3662,
3713
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3713,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0.0005386500270105898,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29439252614974976,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006230529863387346,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22118380665779114,
"rps_doc_frac_unique_words": 0.41908714175224304,
"rps_doc_mean_word_length": 6.275933742523193,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.773649215698242,
"rps_doc_word_count": 482,
"rps_doc_frac_chars_dupe_10grams": 0.044958680868148804,
"rps_doc_frac_chars_dupe_5grams": 0.16495868563652039,
"rps_doc_frac_chars_dupe_6grams": 0.13355371356010437,
"rps_doc_frac_chars_dupe_7grams": 0.13355371356010437,
"rps_doc_frac_chars_dupe_8grams": 0.13355371356010437,
"rps_doc_frac_chars_dupe_9grams": 0.044958680868148804,
"rps_doc_frac_chars_top_2gram": 0.034380171447992325,
"rps_doc_frac_chars_top_3gram": 0.02909090928733349,
"rps_doc_frac_chars_top_4gram": 0.01983471028506756,
"rps_doc_books_importance": -324.7935791015625,
"rps_doc_books_importance_length_correction": -324.7935791015625,
"rps_doc_openwebtext_importance": -169.0307159423828,
"rps_doc_openwebtext_importance_length_correction": -169.0307159423828,
"rps_doc_wikipedia_importance": -182.59744262695312,
"rps_doc_wikipedia_importance_length_correction": -182.59744262695312
},
"fasttext": {
"dclm": 0.4530424475669861,
"english": 0.7702476978302002,
"fineweb_edu_approx": 2.1628494262695312,
"eai_general_math": 0.46042871475219727,
"eai_open_web_math": 0.09739071130752563,
"eai_web_code": 0.7270593643188477
}
}
|
{
"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": "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": "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
|
-2,703,290,483,180,883,000 |
FMXAttachTAnimation (C++)
From RAD Studio Code Examples
Jump to: navigation, search
Description
This example demonstrates how the AnimationType and Interpolation properties affect the rate at which the value of a property changes under their control. This is illustrated by controlling the X and Y of a TRectangle with TFloatAnimation instances.
The Interpolation properties on the TFloatAnimation objects are set to Linear, making the change of X and Y constant over time. The Interpolation and AnimationType properties of the TFloatAnimation instance can be set in the Object Inspector to any TInterpolationType and any TAnimationType.
Drawing of the path is done using the DrawLine method of the form's Canvas. Points are collected and drawn using a TPointF array in the animation's OnProcess event handler and then redrawn in the form's OnPaint event handler.
The TFloatAnimation instances have to be created as children of the TRectangle. Many of the TFloatAnimation properties can be set at design time.
To replicate this example, create a Multi-Device Application - C++ and add the following components to the form:
Rename the buttons to MoveRect and ReturnRect. Using the Object Inspector, add event handlers for the Form1.OnCreate, MoveRect.OnClick, ReturnRect.OnClick, FloatAnimation1.OnProcess, and Form1.OnPaint events. Fill in with the sample code below.
The form should look like the following image.
Inital form.png
After clicking the MoveRect button, the rectangle moves according to the selected options, drawing a line from its upper-left corner.
A linear animation:
Linear animation.png
An elastic animation, with the rectangle moved:
Elasticinterpolation.png
Code
float saveX, saveY;
TPointF* oldPos = new TPointF;
TPointF posArray[3000];
int next;
// ---------------------------------------------------------------------------
void __fastcall TForm2::FloatAnimation1Process(TObject *Sender) {
int i;
TPointF* newPos;
newPos = new TPointF(Rectangle1->Position->X, Rectangle1->Position->Y);
if ((oldPos->X != newPos->X) || (oldPos->Y != newPos->Y)) {
posArray[++next] = (*newPos);
oldPos = newPos;
Invalidate();
}
}
// ---------------------------------------------------------------------------
void __fastcall TForm2::FormCreate(TObject *Sender) {
int i;
String s;
// Populate the ComboBox items with possible values for Interpolation
for (i = TInterpolationType::Linear;
i <= TInterpolationType::Bounce; i++) {
s = GetEnumName(__delphirtti(TInterpolationType), i);
ComboBox1->ListBox->Items->Add(s);
}
ComboBox1->ItemIndex = 0;
// Populate the ComboBox items with possible values for AnimationType
for (i = TAnimationType::atIn; i <= TAnimationType::InOut; i++) {
s = GetEnumName(__delphirtti(TAnimationType), i);
ComboBox2->ListBox->Items->Add(s);
}
ComboBox2->ItemIndex = 0;
saveX = Rectangle1->Position->X;
saveY = Rectangle1->Position->Y;
oldPos->X = Rectangle1->Position->X;
oldPos->Y = Rectangle1->Position->Y;
next = 0;
posArray[next] = (*oldPos);
this->Fill->Color = claSilver;
// Attach the FloatAnimations to the Rectangle's positio
FloatAnimation1->Parent = Rectangle1;
FloatAnimation1->PropertyName = "Position.X";
FloatAnimation1->StopValue = Rectangle1->Position->X + 200;
FloatAnimation1->Duration = 5;
FloatAnimation1->AnimationType = TAnimationType::atIn;
FloatAnimation1->Interpolation = TInterpolationType::Linear;
FloatAnimation1->StartFromCurrent = true;
FloatAnimation2->Parent = Rectangle1;
FloatAnimation2->PropertyName = "Position.Y";
FloatAnimation2->StopValue = Rectangle1->Position->Y - 200;
FloatAnimation2->Duration = 5;
FloatAnimation2->AnimationType = TAnimationType::atIn;
FloatAnimation2->Interpolation = TInterpolationType::Linear;
FloatAnimation2->StartFromCurrent = true;
}
// ---------------------------------------------------------------------------
void __fastcall TForm2::ReturnRectClick(TObject *Sender) {
// Returns the rectangle to the starting position
Rectangle1->Position->X = saveX;
Rectangle1->Position->Y = saveY;
oldPos->X = saveX;
oldPos->Y = saveY;
MoveRect->Enabled = true;
ReturnRect->Enabled = false;
}
// ---------------------------------------------------------------------------
void __fastcall TForm2::MoveRectClick(TObject *Sender) {
TAnimationType AniType;
TInterpolationType InterpType;
unsigned int ComboBoxIndex;
ComboBoxIndex = ComboBox2->ItemIndex;
AniType = TAnimationType(ComboBoxIndex);
FloatAnimation2->AnimationType = AniType;
ComboBoxIndex = ComboBox1->ItemIndex;
InterpType = TInterpolationType(ComboBoxIndex);
FloatAnimation2->Interpolation = InterpType;
FloatAnimation1->Start();
FloatAnimation2->Start();
MoveRect->Enabled = false;
ReturnRect->Enabled = true;
}
// ---------------------------------------------------------------------------
void __fastcall TForm2::FormPaint(TObject *Sender, TCanvas *Canvas,
const TRectF &ARect)
{
int i;
Canvas->BeginScene();
Canvas->StrokeThickness = 4;
Canvas->Fill->Color = claBlack;
Canvas->FillEllipse(RectF(FloatAnimation1->StopValue - 2,
FloatAnimation2->StopValue - 2, FloatAnimation1->StopValue + 2,
FloatAnimation2->StopValue + 2), 100);
Canvas->FillEllipse(RectF(saveX - 2, saveY - 2, saveX + 2, saveY + 2), 100);
Canvas->FillEllipse(RectF(Rectangle1->Position->X - 2,
Rectangle1->Position->Y - 2, Rectangle1->Position->X + 2,
Rectangle1->Position->Y + 2), 100);
for (i = 0; i < next; i++) {
if ((posArray[i].X != FloatAnimation1->StopValue) &&
(posArray[i].Y != FloatAnimation2->StopValue)) {
Canvas->DrawLine(posArray[i], posArray[i + 1], 1.0);
}
}
Canvas->EndScene();
}
// ---------------------------------------------------------------------------
Uses
See Also
|
{
"url": "http://docwiki.embarcadero.com/CodeExamples/XE8/en/FMXAttachTAnimation_(C%2B%2B)",
"source_domain": "docwiki.embarcadero.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "53617",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EXY6NSD5QFQNX2CMVGCSYTMDWLBE523B",
"WARC-Concurrent-To": "<urn:uuid:d69c940c-7e29-4905-8220-696987783a52>",
"WARC-Date": "2021-02-25T03:24:08Z",
"WARC-IP-Address": "204.61.221.122",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HVECL3HF2KJ4A6VM74QSAWP7IKZT7M3D",
"WARC-Record-ID": "<urn:uuid:6772e1d2-435e-41e5-9ed0-c9c54659ae76>",
"WARC-Target-URI": "http://docwiki.embarcadero.com/CodeExamples/XE8/en/FMXAttachTAnimation_(C%2B%2B)",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c49f719-102f-4737-9067-b8a471ecc37c>"
},
"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-119.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,
26,
27,
57,
85,
86,
98,
99,
349,
350,
642,
643,
869,
870,
1016,
1017,
1130,
1131,
1376,
1377,
1424,
1425,
1441,
1442,
1576,
1577,
1597,
1598,
1619,
1620,
1668,
1669,
1694,
1695,
1700,
1701,
1721,
1752,
1776,
1786,
1865,
1866,
1932,
1940,
1958,
2031,
2092,
2124,
2143,
2159,
2162,
2163,
2165,
2244,
2245,
2299,
2307,
2318,
2397,
2435,
2476,
2532,
2569,
2572,
2599,
2600,
2678,
2745,
2797,
2834,
2837,
2864,
2898,
2932,
2970,
3008,
3019,
3048,
3057,
3096,
3097,
3162,
3201,
3248,
3309,
3341,
3397,
3459,
3502,
3503,
3542,
3589,
3650,
3682,
3738,
3800,
3843,
3845,
3924,
3925,
3984,
4042,
4076,
4110,
4130,
4150,
4177,
4207,
4209,
4288,
4289,
4346,
4371,
4403,
4432,
4471,
4513,
4556,
4595,
4644,
4690,
4717,
4744,
4772,
4801,
4803,
4882,
4883,
4951,
4973,
4974,
4976,
4984,
5007,
5037,
5070,
5129,
5195,
5236,
5314,
5370,
5430,
5468,
5498,
5553,
5605,
5661,
5665,
5668,
5689,
5690,
5692,
5771,
5772,
5777,
5778,
5779
],
"line_end_idx": [
26,
27,
57,
85,
86,
98,
99,
349,
350,
642,
643,
869,
870,
1016,
1017,
1130,
1131,
1376,
1377,
1424,
1425,
1441,
1442,
1576,
1577,
1597,
1598,
1619,
1620,
1668,
1669,
1694,
1695,
1700,
1701,
1721,
1752,
1776,
1786,
1865,
1866,
1932,
1940,
1958,
2031,
2092,
2124,
2143,
2159,
2162,
2163,
2165,
2244,
2245,
2299,
2307,
2318,
2397,
2435,
2476,
2532,
2569,
2572,
2599,
2600,
2678,
2745,
2797,
2834,
2837,
2864,
2898,
2932,
2970,
3008,
3019,
3048,
3057,
3096,
3097,
3162,
3201,
3248,
3309,
3341,
3397,
3459,
3502,
3503,
3542,
3589,
3650,
3682,
3738,
3800,
3843,
3845,
3924,
3925,
3984,
4042,
4076,
4110,
4130,
4150,
4177,
4207,
4209,
4288,
4289,
4346,
4371,
4403,
4432,
4471,
4513,
4556,
4595,
4644,
4690,
4717,
4744,
4772,
4801,
4803,
4882,
4883,
4951,
4973,
4974,
4976,
4984,
5007,
5037,
5070,
5129,
5195,
5236,
5314,
5370,
5430,
5468,
5498,
5553,
5605,
5661,
5665,
5668,
5689,
5690,
5692,
5771,
5772,
5777,
5778,
5779,
5787
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5787,
"ccnet_original_nlines": 156,
"rps_doc_curly_bracket": 0.0034560200292617083,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15047618746757507,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03238094970583916,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41904762387275696,
"rps_doc_frac_unique_words": 0.496957391500473,
"rps_doc_mean_word_length": 8.054766654968262,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.093443870544434,
"rps_doc_word_count": 493,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022664319723844528,
"rps_doc_frac_chars_dupe_6grams": 0.022664319723844528,
"rps_doc_frac_chars_dupe_7grams": 0.022664319723844528,
"rps_doc_frac_chars_dupe_8grams": 0.022664319723844528,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006295640021562576,
"rps_doc_frac_chars_top_3gram": 0.002518259920179844,
"rps_doc_frac_chars_top_4gram": 0.012087640352547169,
"rps_doc_books_importance": -410.6572265625,
"rps_doc_books_importance_length_correction": -410.6572265625,
"rps_doc_openwebtext_importance": -241.13038635253906,
"rps_doc_openwebtext_importance_length_correction": -241.13038635253906,
"rps_doc_wikipedia_importance": -242.468017578125,
"rps_doc_wikipedia_importance_length_correction": -242.468017578125
},
"fasttext": {
"dclm": 0.9584015011787415,
"english": 0.529772937297821,
"fineweb_edu_approx": 3.2933218479156494,
"eai_general_math": 0.9068032503128052,
"eai_open_web_math": 0.09285659343004227,
"eai_web_code": 0.6909323334693909
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-4,324,162,611,337,938,000 |
Trial Sbp 2007 Mm2
2,386
-1
Published on
Published in: Travel, Sports
0 Comments
0 Likes
Statistics
Notes
• Be the first to comment
• Be the first to like this
No Downloads
Views
Total Views
2,386
On Slideshare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
132
Comments
0
Likes
0
Embeds 0
No embeds
No notes for slide
Trial Sbp 2007 Mm2
1. 1. ppr maths nbk SULIT 1449/2 1449/2 NAMA : Matematik Kertas 2 TINGKATAN : Ogos 2007 1 2 jam 2 SEKTOR SEKOLAH BERASRAMA PENUH BAHAGIAN SEKOLAH KEMENTERIAN PELAJARAN MALAYSIA PEPERIKSAAN PERCUBAAN SELARAS SBP SIJIL PELAJARAN MALAYSIA 2007 Pemeriksa MATEMATIK Markah Markah Bahagian Soalan Kertas 2 Penuh Diperoleh Dua jam tiga puluh minit 1 4 2 4 3 3 JANGAN BUKA KERTAS SOALAN INI 4 4 SEHINGGA DIBERITAHU 5 5 A 1. Kertas soalan ini mengandungi dua bahagian : 6 4 Bahagian A dan Bahagian B. Jawab semua soalan daripada Bahagian A dan empat soalan 7 6 dalam Bahagian B. 8 5 2. Jawapan hendaklah ditulis dengan jelas dalam 9 5 ruang yang disediakan dalam kertas soalan. 10 6 Tunjukkan langkah-langkah penting. Ini boleh membantu anda untuk mendapatkan markah. 11 6 12 12 3. Rajah yang mengiringi soalan tidak dilukis mengikut skala kecuali dinyatakan. 13 12 B 14 12 4. Satu senarai rumus disediakan di halaman 2 & 3. 15 12 16 12 5. Anda dibenarkan menggunakan kalkulator saintifik yang tidak boleh diprogram. Jumlah Kertas soalan ini mengandungi 26 halaman bercetak. 1449/2 © 2007 Hak Cipta Sektor SBP [Lihat sebelah SULIT
2. 2. SULIT 1449/2 Untuk Kegunaan Pemeriksa MATHEMATICAL FORMULAE The following formulae may be helpful in answering the questions. The symbols given are the ones commonly used. RELATIONS 1 am x an = a m+ n 2 am ÷ an = a m – n 3 ( am )n = a mn 1 ⎛ d − b⎞ 4 A-1 = ⎜ ⎜−c a ⎟⎟ ad − bc ⎝ ⎠ n( A) 5 P(A)= n( S ) 6 P ( A′ ) = 1 − P(A) 7 Distance = ( x1 − x2 )2 + ( y1 − y2 ) 2 ⎛ x + x 2 y1 + y 2 ⎞ 8 Midpoint, ( x, y ) = ⎜ 1 , ⎟ ⎝ 2 2 ⎠ 9 Average speed = distance travelled time taken 10 Mean = sum of data number of data 11 Mean = sum of (class mark × frequency) sum of frequencies 12 Pythagoras Theorem c2 = a2 + b2 y 2 − y1 13 m= x 2 − x1 y -intercept 14 m=− x-intercept 1449/2 2 SULIT
3. 3. SULIT 1449/2 Untuk Kegunaan Pemeriksa SHAPES AND SPACE 1 1 Area of trapezium = × sum of parallel sides × height 2 2 Circumference of circle = πd = 2πr 3 Area of circle = πr2 4 Curved surface area of cylinder = 2πrh 5 Surface area of sphere = 4πr2 6 Volume of right prism = cross sectional area × length 7 Volume of cylinder = πr2h 1 2 8 Volume of cone = πr h 3 4 3 9 Volume of sphere = πr 3 1 10 Volume of right pyramid = × base area× height 3 11 Sum of interior angles of a polygon = ( n – 2) × 180˚ arc length angle subtended at centre 12 = circumference of circle 360o area of sector angle subtended at centre 13 = area of circle 360o PA' 14 Scale factor , k = PA 15 Area of image = k 2 × area of object 1449/2 3 [Lihat sebelah SULIT
4. 4. SULIT 1449/2 Untuk Section A Kegunaan [52 marks] Pemeriksa Answer all questions in this section. 3 1 Solve the quadratic equation 5 − = 4x − 2 . [4 marks] 2x Answer : 1449/2 4 SULIT
5. 5. SULIT 1449/2 Untuk 2 Calculate the value of x and y that satisfy the following simultaneous linear equations: Kegunaan Pemeriksa 5 x − 3 y = −8 1 x+ y =5 2 [4 marks] Answer : 1449/2 5 [Lihat sebelah SULIT
6. 6. SULIT 1449/2 Untuk Kegunaan 3 On the graph in the answer space, shade the region which satisfies the three inequalities Pemeriksa 2y ≥ x – 4, y ≤ 2x + 1 and y < 1. [3 marks] Answer : y y = 2x + 1 2y = x - 4 x O 1449/2 6 SULIT
7. 7. SULIT 1449/2 4 Diagram 1 shows a right prism with a horizontal rectangular base JKLM. Trapezium JKQP Untuk is the uniform cross-section of the prism. The rectangular surface QRLK is inclined. Kegunaan Pemeriksa S 5 cm R P Q 8 cm L M 12 cm J K DIAGRAM 1 Calculate the angle between the plane RSJ and the vertical plane RSML. [4 marks] Answer : 1449/2 7 [Lihat sebelah SULIT
8. 8. SULIT 1449/2 Untuk 5 In Diagram 2, O is the origin. JK, KL and LM are straight lines. JK is parallel to LM and KL is Kegunaan parallel to the x-axis. Pemeriksa y M L K x O 2 J(−3, −2) DIAGRAM 2 The equation of LM is 2y = x + 4. (a) State the equation of the straight line KL. (b) Find the equation of the straight line JK and hence, state its y-intercept. [5 marks] Answer : (a) (b) 1449/2 8 SULIT
9. 9. SULIT 1449/2 6 Diagram 3 shows a solid that is a combination of a pyramid VPQRS and a semi cylinder Untuk 22 with diameter 7 cm. VS = 8 cm, PS = QR = 6 cm. Using π = , find the volume, in cm 3 Kegunaan Pemeriksa 7 of the solid. P Q S V R DIAGRAM 3 [4 marks] Answer : 1449/2 9 [Lihat sebelah SULIT
10. 10. SULIT 1449/2 Untuk 7 Diagram 4 shows two semicirles AOBCE and OBCD, with the centre O and B respectively. Kegunaan Pemeriksa F A O B C D E DIAGRAM 4 BFC is a sector with the centre B. AOBC is a straight line and AO = 2OB. 22 BC = 3.5 cm and ∠ FBC = ∠ AOE = 60°. Using π = , calculate 7 (a) the perimeter, in cm, of the whole diagram, (b) the area, in cm 2 , of the shaded region. [6 marks] Answer: (a) (b) 1449/2 10 SULIT
11. 11. SULIT 1449/2 Untuk 8 (a) Determine whether the following sentence is a statement. Kegunaan Pemeriksa “ 7 is not a factor of 40 “ (b) Write two implications from the following statement. “ P ⊂ R if and only if P ∩ R = P ” (c) Make a general conclusion by induction for the following number pattern. 5 = 4(1) + 13 16 = 4(2) + 23 37 = 4(3) + 33 80 = 4(4) + 43 ……………… [5 marks] Answer : (a) …………………………………………………………………………….. (b) Implication 1 : …………………………………………………………….. ……………………………………………………………. Implication 2 : ……………………………………………………………. ……………………………………… ……………………. (c) Conclusion : ……………………………………………………………… 1449/2 11 [Lihat sebelah SULIT
12. 12. SULIT 1449/2 Untuk 9 Table 1 shows the results of a survey. The survey is on the mode of transport to SMK Kegunaan Shahbandar on a particular day involving 200 students. Pemeriksa Boys Girls Bus 60 30 Car 28 36 Bicycle 32 14 TABLE 1 (a) If a student is picked at random, find the probability that the student went to school by car. (b) If two boys are picked at random, find the probability that both boys went to school by bus. [5 marks] Answer : (a) (b) 1449/2 12 SULIT
13. 13. SULIT 1449/2 10 Diagram 5 shows the speed-time graph of a particle for a period of 10 seconds. Given that Untuk the total distance travelled in the first 6 seconds is twice of the total distance travelled in Kegunaan the last 4 seconds. Pemeriksa Speed (ms −1 ) v 4 Time (s) 0 6 10 DIAGRAM 5 (a) Calculate the value of v. (b) Calculate the rate of change of speed, in ms-2, in the first 3 seconds. [6 marks] Answer : (a) (b) 1449/2 13 [Lihat sebelah SULIT
14. 14. SULIT 1449/2 1 ⎛ 1 − 3 ⎞⎛ 4 p ⎞ ⎛ 1 0 ⎞ Untuk 11 (a) Given that ⎜ ⎟⎜ ⎟=⎜ ⎟ . Find the value of k and p. Kegunaan Pemeriksa k ⎜ 2 4 ⎟⎜ − 2 1 ⎟ ⎜ 0 1 ⎟ ⎝ ⎠⎝ ⎠ ⎝ ⎠ (b) Write the following simultaneous equations as a matrix equation: m − 3n = −6 2m + 4n = 3 Hence, using matrices, calculate the value of m and n. [6 marks] Answer : (a) (b) 1449/2 14 SULIT
15. 15. SULIT 1449/2 Untuk Section B Kegunaan [48 marks] Pemeriksa Answer any four questions in this section. 12 (a) Complete Table 2 in the answer space for the equation y = x 3 − 4 x − 2 . [2 marks] (b) For this part of question, use the graph paper provided on page 16. You may use a flexible curve ruler. By using a scale of 2 cm to 1 unit on the x-axis and 2 cm to 5 units on the y-axis, draw the graph of y = x 3 − 4 x − 2 for −2⋅5 ≤ x ≤ 4. [4 marks] (c) From your graph, find (i) the value of x when y = 5 (ii) the value of y when x = 3.3 [2 marks] (d) Draw a suitable straight line on your graph to find the positive values of x which satisfy the equation x3 − 10 x + 3 = 0 for – 2⋅5 ≤ x ≤ 4. State the values of x. [4 marks] Answer : (a) x −2.5 −2 −1 0.5 1 2 3 4 y −2 1 – 3.9 −5 13 46 TABLE 2 (b) Refer graph on page 16 (i) y = …………………………………… (ii) x = …………………………………… (c) x = ………………………………… , ………………………………… 1449/2 15 [Lihat sebelah SULIT
16. 16. SULIT 1449/2 Graph for Question 12 Untuk Kegunaan Pemeriksa 1449/2 16 SULIT
17. 17. SULIT 1449/2 Untuk 13 (a) Transformation R is a rotation 90 o anticlockwise at (5, 5) and transformation T is a Kegunaan Pemeriksa ⎛ 4⎞ translation ⎜ ⎟ . ⎜ 2⎟ ⎝ ⎠ State the coordinates of the image of point (1, 4) under each of the following transformations: (i) Translation T, (ii) Combined transformations TR. [3 marks] (b) Diagram 6 shows three quadrilaterals, JKLM, PQRS and TUVW drawn on a Cartesian plane. 16 V 14 W 12 R S 10 8 P Q 6 T U 4 J M 2 K L 0 2 4 6 8 DIAGRAM 6 1449/2 17 [Lihat sebelah SULIT
18. 18. SULIT 1449/2 Untuk PQRS is the image of JKLM under transformation Q. Kegunaan TUVW is the image of PQRS under transformation M. Pemeriksa (i) Describe in full the transformation: (a) Q, (b) M. [6 marks] (ii) Given that quadrilateral JKLM represents a region of area 343 cm2. Calculate the area, in cm2, of the shaded region. [3 marks] Answer : (a) (i) (ii) (b) (i) (a) Q: (b) M: (ii) 1449/2 18 SULIT
19. 19. SULIT 1449/2 14 The data in Diagram 7 shows the number of telephone calls made by 40 students in a Untuk month. Kegunaan Pemeriksa 28 22 34 26 22 37 35 38 23 20 22 33 39 17 45 28 21 39 35 14 38 24 27 35 19 34 31 26 40 32 28 44 30 32 29 27 32 40 33 30 DIAGRAM 7 (a) Using data in Diagram 7 and a class interval of 5 telephone calls, complete Table 3 in the answer space. [4 marks] (b) For this part of the question, use the graph paper provided on page 21. By using a scale of 2 cm to 5 telephone calls on the horizontal axis and 2 cm to 5 students on the vertical axis, draw an ogive based on Table 3. [5 marks] (c) Find the interquartile range from your ogive in (b), [3 marks] 1449/2 19 [Lihat sebelah SULIT
20. 20. SULIT 1449/2 Untuk Answer : Kegunaan Pemeriksa (a) Cumulative Number of telephone Upper Frequency Frequency calls Boundary 6 – 10 10.5 0 0 11 – 15 16 – 20 TABLE 3 (b) Refer graph on page 21 (c) 1449/2 20 SULIT
21. 21. SULIT 1449/2 Graph for Question 14 Untuk Kegunaan Pemeriksa 1449/2 21 [Lihat sebelah SULIT
22. 22. SULIT 1449/2 Untuk Kegunaan 15 You are not allowed to use graph paper to answer this question. Pemeriksa (a) Diagram 8(i) shows a solid right prism with rectangular base PQMN on a horizontal table.The surface PSTN is its uniform cross-section. The rectangle RSTU is an inclined plane. The edges UM, TN , SP and RQ are vertical edges. U R S 5 cm T Q 3 cm P M 3 cm 6 cm N X DIAGRAM 8(i) Draw to full scale, the elevation of the solid on a vertical plane parallel to MN as viewed from X. [4 marks] Answers : 15 (a) 1449/2 22 SULIT
23. 23. SULIT 1449/2 Untuk (b) Another solid right prism is joined to the solid in the Diagram 8 (i) at the vertical plane Kegunaan MNWVU to form a combined solid as shown in Diagram 8 (ii). Pemeriksa The surface DEFGJ is its uniform cross-section and GFNW is an inclined plane. The rectangle DJKL is a horizontal plane. The base EFNPQM is on a horizontal plane. DE and JG are vertical. JG = KW = 5 cm. L 3 cm K U R V S D T J Q 3 cm W M P 7 cm 3 cm N G E 5 cm 6 cm Y F DIAGRAM 8 (ii) Draw to full scale, (i) the elevation of the combined solid on a vertical plane parallel to FP as viewed from Y, [4 marks] (ii) the plan of the combined solid. [4 marks] 1449/2 23 [Lihat sebelah SULIT
24. 24. SULIT 1449/2 Untuk Answer : Kegunaan Pemeriksa (b) (i) (ii) 1449/2 24 SULIT
25. 25. SULIT 1449/2 16 Diagram 9 shows five points, A (63o S , 125o W), B, C, D and E , on the surface of the Untuk earth. AB is the diameter of the earth. X is the centre of parallel of latitude passing Kegunaan through B and ∠ BXC = 300. Pemeriksa N X B C O A D E S DIAGRAM 9 (a) Find the position of points B and C. [3 marks] (b) Calculate the shortest distance, in nautical miles, from A to E measured along the surface of the earth. [3 marks] (c) Calculate the distance, in nautical miles, from B to C, measured along the parallel of latitude. [2 marks] (d) An aeroplane took off from B and flew due south towards E, along the surface of the earth, and then flew due west towards D along the parallel of latitude with an average speed of 510 knots. Calculate the total time taken, in hours, for the whole flight. [4 marks] 1449/2 25 [Lihat sebelah SULIT
26. 26. SULIT 1449/2 Untuk Answer: Kegunaan Pemeriksa (a) (b) (c) (d) END OF QUESTION PAPER 1449/2 26 SULIT
×
|
{
"url": "http://www.slideshare.net/norainisaser/trial-sbp-2007-mm2",
"source_domain": "www.slideshare.net",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "127254",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IOLT2VTUDYUYPAB25YB2DOLKEE3O7SLT",
"WARC-Concurrent-To": "<urn:uuid:ec46fb63-7e0f-4a4c-9cb7-1083dfbee4b3>",
"WARC-Date": "2015-11-30T03:44:52Z",
"WARC-IP-Address": "108.174.10.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:E7DWVU4UZ6WJC6IPCIB6TSTGW32DFFNL",
"WARC-Record-ID": "<urn:uuid:8b3ba50e-866a-43bb-9809-bee108a044d3>",
"WARC-Target-URI": "http://www.slideshare.net/norainisaser/trial-sbp-2007-mm2",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef0de42a-ca73-43de-808d-aa1eb402cb85>"
},
"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,
19,
20,
26,
29,
30,
43,
44,
73,
84,
92,
103,
109,
137,
138,
168,
169,
182,
188,
200,
206,
220,
222,
234,
236,
253,
255,
263,
270,
272,
282,
286,
295,
297,
303,
305,
314,
324,
325,
344,
345,
364,
365,
1489,
2174,
2919,
3109,
3322,
3556,
3937,
4343,
4648,
5080,
5720,
6202,
6668,
7030,
7977,
8063,
8580,
8990,
9710,
9930,
10031,
10569,
11256,
11342,
12204,
12314,
12315
],
"line_end_idx": [
19,
20,
26,
29,
30,
43,
44,
73,
84,
92,
103,
109,
137,
138,
168,
169,
182,
188,
200,
206,
220,
222,
234,
236,
253,
255,
263,
270,
272,
282,
286,
295,
297,
303,
305,
314,
324,
325,
344,
345,
364,
365,
1489,
2174,
2919,
3109,
3322,
3556,
3937,
4343,
4648,
5080,
5720,
6202,
6668,
7030,
7977,
8063,
8580,
8990,
9710,
9930,
10031,
10569,
11256,
11342,
12204,
12314,
12315,
12316
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12316,
"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.19824890792369843,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09068167954683304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.433083176612854,
"rps_doc_frac_unique_words": 0.24382208287715912,
"rps_doc_mean_word_length": 3.7174630165100098,
"rps_doc_num_sentences": 153,
"rps_doc_symbol_to_word_ratio": 0.06410256028175354,
"rps_doc_unigram_entropy": 5.500568389892578,
"rps_doc_word_count": 2428,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1124529093503952,
"rps_doc_frac_chars_dupe_6grams": 0.06880123913288116,
"rps_doc_frac_chars_dupe_7grams": 0.03811211884021759,
"rps_doc_frac_chars_dupe_8grams": 0.014624419622123241,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028805669397115707,
"rps_doc_frac_chars_top_3gram": 0.02825172059237957,
"rps_doc_frac_chars_top_4gram": 0.007201420143246651,
"rps_doc_books_importance": -1458.165283203125,
"rps_doc_books_importance_length_correction": -1458.165283203125,
"rps_doc_openwebtext_importance": -856.4993896484375,
"rps_doc_openwebtext_importance_length_correction": -856.4993896484375,
"rps_doc_wikipedia_importance": -551.49560546875,
"rps_doc_wikipedia_importance_length_correction": -551.49560546875
},
"fasttext": {
"dclm": 0.27565544843673706,
"english": 0.5659259557723999,
"fineweb_edu_approx": 1.590932846069336,
"eai_general_math": 0.9605643153190613,
"eai_open_web_math": 0.6129180192947388,
"eai_web_code": 0.0641670823097229
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
-980,664,410,592,177,900 |
Portal biznesowy – Wiadomości / Informacje / Porady
Firma Wideo
Jak wygląda znak większości i mniejszości
znaki mniejszości i większości
Poniższy opis wskazuje na to jak wygląda znak większości i jak wygląda znak mniejszości oraz kiedy mają one zastosowanie
Zapraszamy do obejrzenia poniższego filmu wideo pokazującego jak wyglądają symbole poszczególnych znaków.
Jak wygląda znak większości
znak większościZnak większości – wskazuje on, która liczba jest większa i jest oznaczany symbolem >
Przykład: Liczna 5 jest większa od liczby 2, dlatego za pomocą symbolu oznaczymy je w ten sposób 5>2.
Inaczej, znak większości jest wtedy kiedy „dzióbek” zamyka się po prawej stronie, jak wskazuje na to ilustracja.
Jak wygląda znak mniejszości
znak mniejszościZnak mniejszości – wskazuje on, która liczba jest mniejsza i wyrażany jest za pomocą symbolu <
Przykład: Liczba 2 jest mniejsza od liczby 5, dlatego wyrażenie to wyrazimy symbolem 2<5.
Inaczej, znak mniejszości jest wtedy kiedy „dzióbek” zamyka się po lewej stronie, podobnie jak widać to na ilustracji.
W matematyce istnieje także znak równości określany jako symbol = ( równa się ).
Symbole wymienione powyżej mają zastosowanie tylko w matematyce.
Znak równości wyraża poniższa ilustracja:
znak mniejszości i większości
Powiązane artykuły
Jak i gdzie zgłosić narodziny dziecka przez internet?
teoriabiznesu.pl
Ile tygodni ma rok? A ile dni, godzin i sekund?
teoriabiznesu.pl
Oprogramowanie sklepu internetowego – wybór, cena i RODO
teoriabiznesu.pl
|
{
"url": "https://teoriabiznesu.pl/firma/znak-wiekszosci-i-mniejszosci/",
"source_domain": "teoriabiznesu.pl",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "189555",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FTPUKUVMPSQHLWG5QFTDUYR6DRD3BTZI",
"WARC-Concurrent-To": "<urn:uuid:2b3db27c-c235-4ce2-8564-ed67bf9958f6>",
"WARC-Date": "2024-02-29T18:57:16Z",
"WARC-IP-Address": "195.78.66.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F2JJPUAL4WVA24K652J3PZDAIMPLHT3X",
"WARC-Record-ID": "<urn:uuid:18e9f6e4-6772-499e-b629-b025c2a686cf>",
"WARC-Target-URI": "https://teoriabiznesu.pl/firma/znak-wiekszosci-i-mniejszosci/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bacd6ac-ce4a-4127-bbe4-0c0318a927ab>"
},
"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-31\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
52,
64,
65,
107,
108,
139,
140,
261,
262,
368,
369,
397,
398,
500,
501,
603,
604,
717,
718,
747,
748,
859,
860,
950,
951,
1070,
1071,
1152,
1217,
1218,
1260,
1261,
1292,
1293,
1312,
1313,
1367,
1368,
1385,
1386,
1434,
1435,
1452,
1453,
1510,
1511
],
"line_end_idx": [
52,
64,
65,
107,
108,
139,
140,
261,
262,
368,
369,
397,
398,
500,
501,
603,
604,
717,
718,
747,
748,
859,
860,
950,
951,
1070,
1071,
1152,
1217,
1218,
1260,
1261,
1292,
1293,
1312,
1313,
1367,
1368,
1385,
1386,
1434,
1435,
1452,
1453,
1510,
1511,
1527
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1527,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07421875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01171875,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1953125,
"rps_doc_frac_unique_words": 0.5352112650871277,
"rps_doc_mean_word_length": 6.173708915710449,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.438657283782959,
"rps_doc_word_count": 213,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1384030431509018,
"rps_doc_frac_chars_dupe_6grams": 0.09581749141216278,
"rps_doc_frac_chars_dupe_7grams": 0.05475284904241562,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.041825100779533386,
"rps_doc_frac_chars_top_3gram": 0.057034220546483994,
"rps_doc_frac_chars_top_4gram": 0.061596959829330444,
"rps_doc_books_importance": -125.85922241210938,
"rps_doc_books_importance_length_correction": -115.01538848876953,
"rps_doc_openwebtext_importance": -64.84737396240234,
"rps_doc_openwebtext_importance_length_correction": -64.84737396240234,
"rps_doc_wikipedia_importance": -69.79080200195312,
"rps_doc_wikipedia_importance_length_correction": -56.802791595458984
},
"fasttext": {
"dclm": 0.025727450847625732,
"english": 0.00009539999882690609,
"fineweb_edu_approx": 0.8737990856170654,
"eai_general_math": 0.000010009999641624745,
"eai_open_web_math": 0.9133381247520447,
"eai_web_code": 0.48287737369537354
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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,585,314,619,206,934,000 |
Web template system
From Wikipedia, the free encyclopedia
(Redirected from Template engine (web))
Jump to navigation Jump to search
The basic process for a server-side web templating system: content (from a database), and "presentation specifications" (in a web template), are combined (through the template engine) to mass-produce web documents.
A web template system in web publishing lets web designers and developers work with web templates to automatically generate custom web pages, such as the results from a search. This reuses static web page elements while defining dynamic elements based on web request parameters. Web templates support static content, providing basic structure and appearance. Developers can implement templates from content management systems, web application frameworks, and HTML editors.
Overview[edit]
A web template system is composed of the following:
The template and content resources are processed and combined by the template engine to mass-produce web documents. For purposes of this article, web documents include any of various output formats for transmission over the web via HTTP, or another Internet protocol.
Motivations and typical uses[edit]
Applications[edit]
Web developers can use templates from any individual or organization to set up a website. Once they purchase or download a template, they replace all generic information in the web template with their personal, organizational, or product information. Templates are commonly used to:
• Display personal information or daily activities as in a blog
• Sell products online
• Display information about a company or organization
• Display family history
• Display a gallery of photos
• Place music files such as MP3 files on-line for play through a web browser
• Place videos online for public viewing
• Set up a private login area online
Mass-production[edit]
Various agencies and organizations use web template systems to mass-produce content when slower production methods are less feasible.[citation needed]
For an introductory overview, take a news website as an example. Consider a "static website", where all web pages are static, built by a web designer. It would be very repetitive work to change individual pages as often as the news changes. A typical strategy to automate the web designer's "repetitive work" using templates could be as follows:
1. choose a web template system to maintain the website;
2. group news items with different presentation needs;
3. specify the "presentation standards" through web templates, for each group of news;
4. specify a content resource to generate or update the content of each news item.
Style standardization[edit]
Separation of concerns[edit]
A common goal among experienced web developers is to develop and deploy applications that are flexible and easily maintainable. An important consideration in reaching this goal is the separation of business logic from presentation logic.[2] Developers use web template systems (with varying degrees of success) to maintain this separation.[2]
For the web designer, when each web page comes from a web template, they can think about a modular web page structured with components that can be modified independently of each other. These components may include a header, footer, global navigation bar (GNB), local navigation bar and content such as articles, images, videos etc.
For programmers the template language offers a more restricted logic, only for presentation adaptations and decisions, not for complex (business model) algorithms.[citation needed]
For other members of the "site team", a template system frees webmasters to focus on technical maintenance, content suppliers to focus on content, and gives all of them more reliability.
Moreover, it has the following advantages to its use:
• Ease of design change: presentation variations on templates are "content invariant", meaning a web designer can update the presentation without wider infrastructural preoccupations.[citation needed]
• Ease of interface localization: menus and other presentation standards are easy to make uniform, for users browsing on the site. Using Breadcrumb (navigation) makes any website more user friendly and flexible.[3]
• Possibility to work separately on design and code by different people at the same time. It can be perform while all the codes in a templates are clean design and every block or section of the websites are write with individual commenting system.[citation needed]
• Responsive web design is now a mandatory factor for any website. Everything must be performed without any change in responsive design.
• Ease of documentation a handy documentation saves more time to understand the whole template and also accelerate the modification process. Professional website designers highly emphasize documentation.
One difficulty in evaluating separation of concerns is the lack of well-defined formalisms to measure when and how well it is actually met.[2] There are, however, fairly standard heuristics that have been borrowed from the domain of software engineering. These include 'inheritance' (based on principles of object-oriented programming); and 'templating and generative programming', (consistent with the principles of MVC separation).[4] The precise difference between the various guidelines is subject to some debate, and some aspects of the different guidelines share a degree of similarity.[5]
Flexible presentation[edit]
One major rationale behind "effective separation" is the need for maximum flexibility in the code and resources dedicated to the presentation logic.[4] Client demands, changing customer preferences and desire to present a "fresh face" for pre-existing content often result in the need to dramatically modify the public appearance of web content without disrupting the underlying infrastructure as little as possible.
The distinction between "presentation" (front end) and "business logic" (infrastructure) is important, because:
• Presentation source code language can differ from other code assets.
• Developers often make application components at separate times and locations.
• Workers skill sets don't always include both presentation skills and business logic coding ability.
• Code assets are easier to read and maintain when the system keeps various component types separate and loosely coupled[4]
Reusability[edit]
Not all potential web templates user can hire developers to design a system. Additionally, some may wish to use the Web but have little technical proficiency. Thus, a number of developers and vendors have released web templates specifically for non-technical people to use. Web template reusability is also important for even highly skilled and technically experienced developers—but it is especially critical to those who rely on simplicity and "ready-made" web solutions.
Such "ready-made" web templates are sometimes free, and easily made by an individual domestically. However, specialized web templates are sometimes sold online. Although there are numerous commercial sites that offer web templates for a licensing fee, there are also free and "open-source" sources as well.
Example[edit]
With the model typically held in a relational database, the remaining components of the MVC architecture are the control and view. In the simplest of systems these two are not separated. However, adapting the separation of concerns principle one can completely decouple the relationships.
For example, the view template may look like this:
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head><title>Sites</title></head>
<body><h1 data-xp="title"><!-- placeholder --></h1></body>
</html>
Then, the control template loads the view, and then uses xpath addressing[original research?] to insert components from a database, for instance:
<?php
$doc = new DOMDocument;
$doc->preserveWhiteSpace = false;
$doc->Load('view.html');
$titlenode = $doc->createTextNode("Like this");
$xpath = new DOMXPath($doc);
$xpath->registerNamespace("h","http://www.w3.org/1999/xhtml");
$query="//h:*[@data-xp='title']/comment()";
$entries = $xpath->query($query);
foreach ($entries as $entry) { $entry->parentNode->replaceChild($titlenode, $entry); }
echo $doc->saveXML();
?>
Kinds of template systems[edit]
A web browser and web server are a client–server architecture. Sites often also use a web cache to improve performance. Five templating system types are classified based on when they replace placeholders with real content and assemble pages.
• Server-side - run-time substitution happens on the web server
• Client-side - run-time substitution happens in the web browser
• Edge-side - run-time substitution happens on a proxy between web server and browser
• Outside server - static web pages are produced offline and uploaded to the web server; no run-time substitution
• Distributed - run-time substitution happens on multiple servers
Template languages may be:
• Embedded or event-driven.
• Simple, iterable, programmable, or complex.
• Defined by a consortium, privately defined, or de facto defined by an open implementation. Ownership influences the stability and credibility of a specification. However, in most jurisdictions, language specification cannot be copyrighted, so control is seldom absolute.
The source code of the template engine can be proprietary or open source.
Many template systems are a component of a larger programming platform or framework. They are referred to as the "platform's template system". Some template systems have the option of substituting a different template language or engine.[citation needed]
Programming languages such as Perl, Ruby, C, and Java support template processing either natively, or through add-on libraries and modules. JavaServer Pages (JSP), PHP, and Active Server Pages (ASP with VBScript, JScript or other languages) are examples, themselves, of web template engines. These technologies are typically used in server-side templating systems, but could be adapted for use on a "edge-side" proxy or for static page generation.
Static site generators[edit]
Outside server template system architecture.
HTML editors often use web template systems to produce only static web pages. These can be viewed as a ready-made web design, used to mass-produce "cookie-cutter" websites for rapid deployment. They also commonly include themes in place of CSS styles. In general, the template language is used only with the editor's software.[6]
FrontPage and Dreamweaver were once the most popular editors with template sub-systems. A Flash web template uses Macromedia Flash to create visually interactive sites.
System label/name Platform/editor Notes
Dreamweaver Macromedia HTML authoring. Embedded iterable language.
Contribute Macromedia Client authoring.
Flash Macromedia Flash authoring.
FrontPage Microsoft HTML authoring. Embedded iterable language.
Nvu Linux/Nvu HTML authoring.
Website Meta Language Unix-like
Many server-side template systems have an option to publish output pages on the server, where the published pages are static. This is common on content management systems, like Vignette, but is not considered out-server generation. In the majority of cases, this "publish option" doesn't interfere with the template system, and it can be made by external software, as Wget.
Server-side systems[edit]
Server-side template system
People began to use server-side dynamic pages generated from templates with pre-existent software adapted for this task. This early software was the preprocessors and macro languages, adapted for the web use, running on CGI. Next, a simple but relevant technology was the direct execution made on extension modules, started with SSI.
Many template systems are typically used as server-side template systems:
System label/name Platform/framework Notes
CheetahTemplate Python Public. Embedded complex language.
Django Python Use the "Django template language".
FreeMarker Java Public.
Facelets Java EE Public. Part of JavaServer Faces
Genshi Python Public
Haml Ruby or Other Public.
Hamlets Java Public.
Jinja2 Python Public. Embedded complex language.
Kid Python
Lasso LassoSoft, LLC Proprietary. Interpreted Programming Language and Server
Mustache ActionScript, C++, Clojure, CoffeeScript, ColdFusion, D, Erlang, Fantom, Go, Java, server-side JavaScript, Lua, .NET, Objective-C, ooc,[7] Perl, PHP, Python, Ruby, Scala, Tcl Public.
Basic Server Side Includes (SSI) The basic directives fix a "standard". Embedded simple language, if exclude exec directive.
Smarty PHP Public. Embedded complex language.
Template Toolkit Perl Public. Embedded complex language.
Template Attribute Language (TAL) Zope, Python, Java, Perl, PHP, XSLT Public; a.k.a. Zope Page Templates (ZPT); see also TAL Expression Syntax (TALES), Macro Expansion TAL (METAL)
Tiles Java Public. Supports multiple template languages (JSP, Velocity, Freemarker, Mustache) from various frameworks (servlet, portlets, struts, spring).
Thymeleaf Java Public.
Topsite Python Public. "As of 2008-02-20, this project is no longer under active development."[8]
Twig PHP
PHPlib PHPlib Public. Embedded iterable language.
WebMacro Java Public. Embedded iterable language.
WebObjects Java Use the WebObjects Builder as engine.
Velocity (Jakarta/Apache) Java Public. Use VTL - Velocity Template Language.
Vignette Proprietary. Commercial solution. Embedded complex language.
VlibTemplate PHP Public.
XSLT (standard language) Any with an XSLT parser Standard. Event-driven programmable language.
XQuery (standard language) Any with an XQuery parser Standard. Embedded programmable language.
Technically, the methodology of embedding programming languages within HTML (or XML, etc.), used in many "server-side included script languages" are also templates. All of them are Embedded complex languages.
System label/name Notes
Active Server Pages (ASP) Proprietary (Microsoft platform). See also: VBScript, Javascript, PerlScript, etc. extensions for ASP.
eRuby Public (Ruby).
ColdFusion Markup Language (CFM) Public (Lucee, Railo, OpenBD). Proprietary (Adobe ColdFusion).
JavaServer Pages (JSP) Public, Java platform.
Active Perl Public.
PHP Public.
OpenACS Public (Tcl).
There are also preprocessors used as server-side template engines. Examples:
Preprocessor Notes
C preprocessor Public. Embedded iterable language.
M4 Public. Embedded complex language.
Edge-side systems[edit]
Edge-Side template and inclusion systems. "Edge-side" refers to web servers that reside in the space between the client (browser) and the originating server. They are often referred to as "reverse-proxy" servers. These servers are generally tasked with reducing the load and traffic on originating servers by caching content such as images and page fragments, and delivering this to the browser in an efficient manner.
Basic Edge Side Includes (ESI) is an SSI-like language. ESI has been implemented for content delivery networks. The ESI template language may also be implemented in web browsers using JavaScript and Ajax, or via a browser "plug-in".
Client-side systems[edit]
Client-side and distributed (decentralized) template system.
Many web browsers can apply an XSLT stylesheet to XML data that transforms the data into an XHTML document, thereby providing template functionality in the browser itself.
Other systems implement template functionality in the browser using JavaScript or another client-side scripting language, including:
Distributed systems[edit]
The most simple form is transclusions (HTML frames). In other cases dynamic web pages are needed.
Examples:
See also[edit]
Concepts: Standards:
• UIML (User Interface Markup Language)
• XSLT (Extensible Stylesheet Language Transformations)
Software:
References[edit]
1. ^ "Template engine". phpwact.org wiki. Archived from the original on December 4, 2012. Retrieved 7 January 2013.
2. ^ a b c Parr, Terence John (2004). Enforcing strict model-view separation in template engines. Proceedings of the 13th international conference on World Wide Web. ISBN 1-58113-844-X.
3. ^ [1]
4. ^ a b c Paragon Corporation (2003-07-19). "Separation of Business Logic from Presentation Logic in Web Applications".
5. ^ MVC vs OOP
6. ^ MacDonald, Matthew (2015). Creating a Website: The Missing Manual. Chapter 8 > Putting the Same Content on Multiple Pages > Web Templates > Note box: O'Reilly Media, Inc. ISBN 9781491936177. Retrieved 19 January 2016.
7. ^ "{{mustache}}". Retrieved 15 October 2013.
8. ^ jodyburns. "Topsite Templating System". Retrieved 15 October 2013.
External links[edit]
|
{
"url": "https://en.wikipedia.org/wiki/Template_engine_(web)",
"source_domain": "en.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "101065",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3YZ4YYJJOMQB3CIOGEHBCIXIM3HTLHTA",
"WARC-Concurrent-To": "<urn:uuid:bd90708e-2d2d-4c07-864d-abd221a05075>",
"WARC-Date": "2019-12-14T23:40:44Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:25GAWDGXMZFIP2P4THWZGFYZFRUVKJDW",
"WARC-Record-ID": "<urn:uuid:350e058c-cd21-4f65-9779-9582a8c5f036>",
"WARC-Target-URI": "https://en.wikipedia.org/wiki/Template_engine_(web)",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e39becf1-ccac-45fb-9199-a7d7139c744a>"
},
"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-99.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,
20,
21,
59,
101,
135,
350,
351,
824,
825,
840,
841,
893,
894,
1162,
1163,
1198,
1199,
1218,
1219,
1502,
1503,
1569,
1594,
1650,
1677,
1709,
1788,
1831,
1870,
1871,
1893,
1894,
2045,
2046,
2392,
2393,
2452,
2509,
2598,
2683,
2684,
2712,
2713,
2742,
2743,
3086,
3087,
3419,
3420,
3601,
3602,
3789,
3790,
3844,
3845,
4048,
4265,
4532,
4671,
4877,
4878,
5474,
5475,
5503,
5504,
5921,
5922,
6034,
6035,
6108,
6190,
6294,
6420,
6421,
6439,
6440,
6914,
6915,
7222,
7223,
7237,
7238,
7527,
7528,
7579,
7580,
7596,
7640,
7677,
7739,
7747,
7748,
7894,
7895,
7901,
7925,
7959,
7984,
8032,
8061,
8125,
8169,
8203,
8290,
8312,
8315,
8316,
8348,
8349,
8591,
8592,
8658,
8725,
8813,
8929,
8997,
8998,
9025,
9026,
9056,
9104,
9379,
9380,
9454,
9455,
9710,
9711,
10159,
10160,
10189,
10190,
10235,
10236,
10566,
10567,
10736,
10737,
10777,
10844,
10884,
10918,
10982,
11012,
11044,
11045,
11419,
11420,
11446,
11447,
11475,
11476,
11810,
11811,
11885,
11886,
11929,
11987,
12037,
12061,
12111,
12132,
12159,
12180,
12229,
12240,
12318,
12510,
12635,
12681,
12738,
12918,
13073,
13096,
13194,
13203,
13253,
13303,
13357,
13434,
13504,
13529,
13624,
13719,
13720,
13929,
13930,
13954,
14083,
14104,
14200,
14246,
14266,
14278,
14300,
14301,
14378,
14379,
14398,
14449,
14487,
14488,
14512,
14513,
14932,
14933,
15166,
15167,
15193,
15194,
15255,
15256,
15428,
15561,
15562,
15588,
15589,
15687,
15688,
15698,
15699,
15714,
15715,
15742,
15784,
15842,
15858,
15859,
15876,
15877,
15995,
16183,
16194,
16317,
16335,
16560,
16610,
16684,
16685,
16686
],
"line_end_idx": [
20,
21,
59,
101,
135,
350,
351,
824,
825,
840,
841,
893,
894,
1162,
1163,
1198,
1199,
1218,
1219,
1502,
1503,
1569,
1594,
1650,
1677,
1709,
1788,
1831,
1870,
1871,
1893,
1894,
2045,
2046,
2392,
2393,
2452,
2509,
2598,
2683,
2684,
2712,
2713,
2742,
2743,
3086,
3087,
3419,
3420,
3601,
3602,
3789,
3790,
3844,
3845,
4048,
4265,
4532,
4671,
4877,
4878,
5474,
5475,
5503,
5504,
5921,
5922,
6034,
6035,
6108,
6190,
6294,
6420,
6421,
6439,
6440,
6914,
6915,
7222,
7223,
7237,
7238,
7527,
7528,
7579,
7580,
7596,
7640,
7677,
7739,
7747,
7748,
7894,
7895,
7901,
7925,
7959,
7984,
8032,
8061,
8125,
8169,
8203,
8290,
8312,
8315,
8316,
8348,
8349,
8591,
8592,
8658,
8725,
8813,
8929,
8997,
8998,
9025,
9026,
9056,
9104,
9379,
9380,
9454,
9455,
9710,
9711,
10159,
10160,
10189,
10190,
10235,
10236,
10566,
10567,
10736,
10737,
10777,
10844,
10884,
10918,
10982,
11012,
11044,
11045,
11419,
11420,
11446,
11447,
11475,
11476,
11810,
11811,
11885,
11886,
11929,
11987,
12037,
12061,
12111,
12132,
12159,
12180,
12229,
12240,
12318,
12510,
12635,
12681,
12738,
12918,
13073,
13096,
13194,
13203,
13253,
13303,
13357,
13434,
13504,
13529,
13624,
13719,
13720,
13929,
13930,
13954,
14083,
14104,
14200,
14246,
14266,
14278,
14300,
14301,
14378,
14379,
14398,
14449,
14487,
14488,
14512,
14513,
14932,
14933,
15166,
15167,
15193,
15194,
15255,
15256,
15428,
15561,
15562,
15588,
15589,
15687,
15688,
15698,
15699,
15714,
15715,
15742,
15784,
15842,
15858,
15859,
15876,
15877,
15995,
16183,
16194,
16317,
16335,
16560,
16610,
16684,
16685,
16686,
16706
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16706,
"ccnet_original_nlines": 239,
"rps_doc_curly_bracket": 0.0003591499989852309,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24518166482448578,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02274882048368454,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24296997487545013,
"rps_doc_frac_unique_words": 0.3668103516101837,
"rps_doc_mean_word_length": 5.765517234802246,
"rps_doc_num_sentences": 198,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.918818950653076,
"rps_doc_word_count": 2320,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.040819380432367325,
"rps_doc_frac_chars_dupe_6grams": 0.012410289607942104,
"rps_doc_frac_chars_dupe_7grams": 0.006279900204390287,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010690789669752121,
"rps_doc_frac_chars_top_3gram": 0.010316990315914154,
"rps_doc_frac_chars_top_4gram": 0.010840309783816338,
"rps_doc_books_importance": -1219.7860107421875,
"rps_doc_books_importance_length_correction": -1219.7860107421875,
"rps_doc_openwebtext_importance": -946.4911499023438,
"rps_doc_openwebtext_importance_length_correction": -946.4911499023438,
"rps_doc_wikipedia_importance": -616.1743774414062,
"rps_doc_wikipedia_importance_length_correction": -616.1743774414062
},
"fasttext": {
"dclm": 0.08586609363555908,
"english": 0.8123953342437744,
"fineweb_edu_approx": 2.9712507724761963,
"eai_general_math": 0.13709837198257446,
"eai_open_web_math": 0.046983059495687485,
"eai_web_code": 0.5346850752830505
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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
|
-2,456,969,084,318,281,700 |
找回密码
骑士注册
QQ登录
微博登录
搜索
❏ 站外平台：
GCC 内联汇编 HOWTO
作者： Sandeep.S 译者： LCTT cposture
| 2016-08-16 17:43 评论: 7 收藏: 4
v0.1, 01 March 2003.
本 HOWTO 文档将讲解 GCC 提供的内联汇编特性的用途和用法。对于阅读这篇文章，这里只有两个前提要求，很明显，就是 x86 汇编语言和 C 语言的基本认识。
1. 简介
1.1 版权许可
Copyright (C) 2003 Sandeep S.
本文档自由共享；你可以重新发布它，并且/或者在遵循自由软件基金会发布的 GNU 通用公共许可证下修改它；也可以是该许可证的版本 2 或者（按照你的需求）更晚的版本。
发布这篇文档是希望它能够帮助别人，但是没有任何担保；甚至不包括可售性和适用于任何特定目的的担保。关于更详细的信息，可以查看 GNU 通用许可证。
1.2 反馈校正
请将反馈和批评一起提交给 Sandeep.S 。我将感谢任何一个指出本文档中错误和不准确之处的人；一被告知，我会马上改正它们。
1.3 致谢
我对提供如此棒的特性的 GNU 人们表示真诚的感谢。感谢 Mr.Pramode C E 所做的所有帮助。感谢在 Govt Engineering College 和 Trichur 的朋友们的精神支持和合作，尤其是 Nisha Kurur 和 Sakeeb S 。 感谢在 Gvot Engineering College 和 Trichur 的老师们的合作。
另外，感谢 Phillip , Brennan Underwood 和 [email protected] ；这里的许多东西都厚颜地直接取自他们的工作成果。
2. 概览
在这里，我们将学习 GCC 内联汇编。这里内联inline表示的是什么呢？
我们可以要求编译器将一个函数的代码插入到调用者代码中函数被实际调用的地方。这样的函数就是内联函数。这听起来和宏差不多？这两者确实有相似之处。
内联函数的优点是什么呢？
这种内联方法可以减少函数调用开销。同时如果所有实参的值为常量，它们的已知值可以在编译期允许简化，因此并非所有的内联函数代码都需要被包含进去。代码大小的影响是不可预测的，这取决于特定的情况。为了声明一个内联函数，我们必须在函数声明中使用 inline 关键字。
现在我们正处于一个猜测内联汇编到底是什么的点上。它只不过是一些写为内联函数的汇编程序。在系统编程上，它们方便、快速并且极其有用。我们主要集中学习（GCC）内联汇编函数的基本格式和用法。为了声明内联汇编函数，我们使用 asm 关键词。
内联汇编之所以重要，主要是因为它可以操作并且使其输出通过 C 变量显示出来。正是因为此能力， "asm" 可以用作汇编指令和包含它的 C 程序之间的接口。
3. GCC 汇编语法
Linux上的 GNU C 编译器 GCC ，使用 AT&T / UNIX 汇编语法。在这里，我们将使用 AT&T 语法 进行汇编编码。如果你对 AT&T 语法不熟悉的话，请不要紧张，我会教你的。AT&T 语法和 Intel 语法的差别很大。我会给出主要的区别。
1. 源操作数和目的操作数顺序
AT&T 语法的操作数方向和 Intel 语法的刚好相反。在Intel 语法中，第一操作数为目的操作数，第二操作数为源操作数，然而在 AT&T 语法中，第一操作数为源操作数，第二操作数为目的操作数。也就是说，
Intel 语法中的 Op-code dst src 变为 AT&T 语法中的 Op-code src dst
2. 寄存器命名
寄存器名称有 % 前缀，即如果必须使用 eax，它应该用作 %eax
3. 立即数
AT&T 立即数以 $ 为前缀。静态 "C" 变量也使用 $ 前缀。在 Intel 语法中，十六进制常量以 h 为后缀，然而 AT&T 不使用这种语法，这里我们给常量添加前缀 0x。所以，对于十六进制，我们首先看到一个 $，然后是 0x，最后才是常量。
4. 操作数大小
在 AT&T 语法中，存储器操作数的大小取决于操作码名字的最后一个字符。操作码后缀 ’b’ 、’w’、’l’ 分别指明了字节byte（8位）、word（16位）、长型long（32位）存储器引用。Intel 语法通过给存储器操作数添加 byte ptrword ptrdword ptr 前缀来实现这一功能。
因此，Intel的 mov al, byte ptr foo 在 AT&T 语法中为 movb foo, %al
5. 存储器操作数
在 Intel 语法中，基址寄存器包含在 [] 中，然而在 AT&T 中，它们变为 ()。另外，在 Intel 语法中， 间接内存引用为
section:[base + index*scale + disp]，在 AT&T中变为 section:disp(base, index, scale)
需要牢记的一点是，当一个常量用于 disp 或 scale，不能添加 $ 前缀。
现在我们看到了 Intel 语法和 AT&T 语法之间的一些主要差别。我仅仅写了它们差别的一部分而已。关于更完整的信息，请参考 GNU 汇编文档。现在为了更好地理解，我们可以看一些示例。
+------------------------------+------------------------------------+
| Intel Code | AT&T Code |
+------------------------------+------------------------------------+
| mov eax,1 | movl $1,%eax |
| mov ebx,0ffh | movl $0xff,%ebx |
| int 80h | int $0x80 |
| mov ebx, eax | movl %eax, %ebx |
| mov eax,[ecx] | movl (%ecx),%eax |
| mov eax,[ebx+3] | movl 3(%ebx),%eax |
| mov eax,[ebx+20h] | movl 0x20(%ebx),%eax |
| add eax,[ebx+ecx*2h] | addl (%ebx,%ecx,0x2),%eax |
| lea eax,[ebx+ecx] | leal (%ebx,%ecx),%eax |
| sub eax,[ebx+ecx*4h-20h] | subl -0x20(%ebx,%ecx,0x4),%eax |
+------------------------------+------------------------------------+
4. 基本内联
基本内联汇编的格式非常直接了当。它的基本格式为
asm("汇编代码");
示例
asm("movl %ecx %eax"); /* 将 ecx 寄存器的内容移至 eax */
__asm__("movb %bh (%eax)"); /* 将 bh 的一个字节数据 移至 eax 寄存器指向的内存 */
你可能注意到了这里我使用了 asm__asm__。这两者都是有效的。如果关键词 asm 和我们程序的一些标识符冲突了，我们可以使用 __asm__。如果我们的指令多于一条，我们可以每个一行，并用双引号圈起，同时为每条指令添加 ’\n’ 和 ’\t’ 后缀。这是因为 gcc 将每一条当作字符串发送给 as（GAS）（LCTT 译注： GAS 即 GNU 汇编器），并且通过使用换行符/制表符发送正确格式化后的行给汇编器。
示例
__asm__ ("movl %eax, %ebx\n\t"
"movl $56, %esi\n\t"
"movl %ecx, $label(%edx,%ebx,$4)\n\t"
"movb %ah, (%ebx)");
如果在代码中，我们涉及到一些寄存器（即改变其内容），但在没有恢复这些变化的情况下从汇编中返回，这将会导致一些意想不到的事情。这是因为 GCC 并不知道寄存器内容的变化，这会导致问题，特别是当编译器做了某些优化。在没有告知 GCC 的情况下，它将会假设一些寄存器存储了一些值——而我们可能已经改变却没有告知 GCC——它会像什么事都没发生一样继续运行（LCTT 译注：什么事都没发生一样是指GCC不会假设寄存器装入的值是有效的，当退出改变了寄存器值的内联汇编后，寄存器的值不会保存到相应的变量或内存空间）。我们所可以做的是使用那些没有副作用的指令，或者当我们退出时恢复这些寄存器，要不就等着程序崩溃吧。这是为什么我们需要一些扩展功能，扩展汇编给我们提供了那些功能。
5. 扩展汇编
在基本内联汇编中，我们只有指令。然而在扩展汇编中，我们可以同时指定操作数。它允许我们指定输入寄存器、输出寄存器以及修饰寄存器列表。GCC 不强制用户必须指定使用的寄存器。我们可以把头疼的事留给 GCC ，这可能可以更好地适应 GCC 的优化。不管怎么说，基本格式为：
asm ( 汇编程序模板
: 输出操作数 /* 可选的 */
: 输入操作数 /* 可选的 */
: 修饰寄存器列表 /* 可选的 */
);
汇编程序模板由汇编指令组成。每一个操作数由一个操作数约束字符串所描述，其后紧接一个括弧括起的 C 表达式。冒号用于将汇编程序模板和第一个输出操作数分开，另一个（冒号）用于将最后一个输出操作数和第一个输入操作数分开（如果存在的话）。逗号用于分离每一个组内的操作数。总操作数的数目限制在 10 个，或者机器描述中的任何指令格式中的最大操作数数目，以较大者为准。
如果没有输出操作数但存在输入操作数，你必须将两个连续的冒号放置于输出操作数原本会放置的地方周围。
示例：
asm ("cld\n\t"
"rep\n\t"
"stosl"
: /* 无输出寄存器 */
: "c" (count), "a" (fill_value), "D" (dest)
: "%ecx", "%edi"
);
现在来看看这段代码是干什么的？以上的内联汇编是将 fill_value 值连续 count 次拷贝到寄存器 edi 所指位置（LCTT 译注：每执行 stosl 一次，寄存器 edi 的值会递增或递减，这取决于是否设置了 direction 标志，因此以上代码实则初始化一个内存块）。 它也告诉 gcc 寄存器 ecxedi 一直无效（LCTT 译注：原文为 eax ，但代码修饰寄存器列表中为 ecx，因此这可能为作者的纰漏。）。为了更加清晰地说明，让我们再看一个示例。
int a=10, b;
asm ("movl %1, %%eax;
movl %%eax, %0;"
:"=r"(b) /* 输出 */
:"r"(a) /* 输入 */
:"%eax" /* 修饰寄存器 */
);
这里我们所做的是使用汇编指令使 ’b’ 变量的值等于 ’a’ 变量的值。一些有意思的地方是：
• "b" 为输出操作数，用 %0 引用，并且 "a" 为输入操作数，用 %1 引用。
• "r" 为操作数约束。之后我们会更详细地了解约束（字符串）。目前，"r" 告诉 GCC 可以使用任一寄存器存储操作数。输出操作数约束应该有一个约束修饰符 "=" 。这修饰符表明它是一个只读的输出操作数。
• 寄存器名字以两个 % 为前缀。这有利于 GCC 区分操作数和寄存器。操作数以一个 % 为前缀。
• 第三个冒号之后的修饰寄存器 %eax 用于告诉 GCC %eax 的值将会在 "asm" 内部被修改，所以 GCC 将不会使用此寄存器存储任何其他值。
当 “asm” 执行完毕， "b" 变量会映射到更新的值，因为它被指定为输出操作数。换句话说， “asm” 内 "b" 变量的修改应该会被映射到 “asm” 外部。
现在，我们可以更详细地看看每一个域。
5.1 汇编程序模板
汇编程序模板包含了被插入到 C 程序的汇编指令集。其格式为：每条指令用双引号圈起，或者整个指令组用双引号圈起。同时每条指令应以分界符结尾。有效的分界符有换行符（\n）和分号（;）。\n 可以紧随一个制表符（\t）。我们应该都明白使用换行符或制表符的原因了吧（LCTT 译注：就是为了排版和分隔）？和 C 表达式对应的操作数使用 %0、%1 ... 等等表示。
5.2 操作数
C 表达式用作 “asm” 内的汇编指令操作数。每个操作数前面是以双引号圈起的操作数约束。对于输出操作数，在引号内还有一个约束修饰符，其后紧随一个用于表示操作数的 C 表达式。即，“操作数约束”（C 表达式）是一个通用格式。对于输出操作数，还有一个额外的修饰符。约束字符串主要用于决定操作数的寻址方式，同时也用于指定使用的寄存器。
如果我们使用的操作数多于一个，那么每一个操作数用逗号隔开。
在汇编程序模板中，每个操作数用数字引用。编号方式如下。如果总共有 n 个操作数（包括输入和输出操作数），那么第一个输出操作数编号为 0 ，逐项递增，并且最后一个输入操作数编号为 n - 1 。操作数的最大数目在前一节我们讲过。
输出操作数表达式必须为左值。输入操作数的要求不像这样严格。它们可以为表达式。扩展汇编特性常常用于编译器所不知道的机器指令 ;-)。如果输出表达式无法直接寻址（即，它是一个位域），我们的约束字符串必须给定一个寄存器。在这种情况下，GCC 将会使用该寄存器作为汇编的输出，然后存储该寄存器的内容到输出。
正如前面所陈述的一样，普通的输出操作数必须为只写的； GCC 将会假设指令前的操作数值是死的，并且不需要被（提前）生成。扩展汇编也支持输入-输出或者读-写操作数。
所以现在我们来关注一些示例。我们想要求一个数的5次方结果。为了计算该值，我们使用 lea 指令。
asm ("leal (%1,%1,4), %0"
: "=r" (five_times_x)
: "r" (x)
);
这里我们的输入为 x。我们不指定使用的寄存器。 GCC 将会选择一些输入寄存器，一个输出寄存器，来做我们预期的工作。如果我们想要输入和输出放在同一个寄存器里，我们也可以要求 GCC 这样做。这里我们使用那些读-写操作数类型。这里我们通过指定合适的约束来实现它。
asm ("leal (%0,%0,4), %0"
: "=r" (five_times_x)
: "0" (x)
);
现在输出和输出操作数位于同一个寄存器。但是我们无法得知是哪一个寄存器。现在假如我们也想要指定操作数所在的寄存器，这里有一种方法。
asm ("leal (%%ecx,%%ecx,4), %%ecx"
: "=c" (x)
: "c" (x)
);
在以上三个示例中，我们并没有在修饰寄存器列表里添加任何寄存器，为什么？在头两个示例， GCC 决定了寄存器并且它知道发生了什么改变。在最后一个示例，我们不必将 'ecx' 添加到修饰寄存器列表（LCTT 译注： 原文修饰寄存器列表这个单词拼写有错，这里已修正），gcc 知道它表示 x。因此，因为它可以知道 ecx 的值，它就不被当作修饰的（寄存器）了。
5.3 修饰寄存器列表
一些指令会破坏一些硬件寄存器内容。我们不得不在修饰寄存器中列出这些寄存器，即汇编函数内第三个 ’:’ 之后的域。这可以通知 gcc 我们将会自己使用和修改这些寄存器，这样 gcc 就不会假设存入这些寄存器的值是有效的。我们不用在这个列表里列出输入、输出寄存器。因为 gcc 知道 “asm” 使用了它们（因为它们被显式地指定为约束了）。如果指令隐式或显式地使用了任何其他寄存器，（并且寄存器没有出现在输出或者输出约束列表里），那么就需要在修饰寄存器列表中指定这些寄存器。
如果我们的指令可以修改条件码寄存器（cc），我们必须将 "cc" 添加进修饰寄存器列表。
如果我们的指令以不可预测的方式修改了内存，那么需要将 "memory" 添加进修饰寄存器列表。这可以使 GCC 不会在汇编指令间保持缓存于寄存器的内存值。如果被影响的内存不在汇编的输入或输出列表中，我们也必须添加 volatile 关键词。
我们可以按我们的需求多次读写修饰寄存器。参考一下模板内的多指令示例；它假设子例程 _foo 接受寄存器 eaxecx 里的参数。
asm ("movl %0,%%eax;
movl %1,%%ecx;
call _foo"
: /* no outputs */
: "g" (from), "g" (to)
: "eax", "ecx"
);
5.4 Volatile ...?
如果你熟悉内核源码或者类似漂亮的代码，你一定见过许多声明为 volatile 或者 __volatile__的函数，其跟着一个 asm 或者 __asm__。我之前提到过关键词 asm__asm__。那么什么是 volatile 呢？
如果我们的汇编语句必须在我们放置它的地方执行（例如，不能为了优化而被移出循环语句），将关键词 volatile 放置在 asm 后面、()的前面。以防止它被移动、删除或者其他操作，我们将其声明为 asm volatile ( ... : ... : ... : ...);
如果担心发生冲突，请使用 __volatile__
如果我们的汇编只是用于一些计算并且没有任何副作用，不使用 volatile 关键词会更好。不使用 volatile 可以帮助 gcc 优化代码并使代码更漂亮。
在“一些实用的诀窍”一节中，我提供了多个内联汇编函数的例子。那里我们可以了解到修饰寄存器列表的细节。
6. 更多关于约束
到这个时候，你可能已经了解到约束和内联汇编有很大的关联。但我们对约束讲的还不多。约束用于表明一个操作数是否可以位于寄存器和位于哪种寄存器；操作数是否可以为一个内存引用和哪种地址；操作数是否可以为一个立即数和它可能的取值范围（即值的范围），等等。
6.1 常用约束
在许多约束中，只有小部分是常用的。我们来看看这些约束。
1. 寄存器操作数约束（r）
当使用这种约束指定操作数时，它们存储在通用寄存器（GPR）中。请看下面示例：
asm ("movl %%eax, %0\n" :"=r"(myval));
这里，变量 myval 保存在寄存器中，寄存器 eax 的值被复制到该寄存器中，并且 myval 的值从寄存器更新到了内存。当指定 "r" 约束时， gcc 可以将变量保存在任何可用的 GPR 中。要指定寄存器，你必须使用特定寄存器约束直接地指定寄存器的名字。它们为：
+---+--------------------+
| r | Register(s) |
+---+--------------------+
| a | %eax, %ax, %al |
| b | %ebx, %bx, %bl |
| c | %ecx, %cx, %cl |
| d | %edx, %dx, %dl |
| S | %esi, %si |
| D | %edi, %di |
+---+--------------------+
2. 内存操作数约束（m）
当操作数位于内存时，任何对它们的操作将直接发生在内存位置，这与寄存器约束相反，后者首先将值存储在要修改的寄存器中，然后将它写回到内存位置。但寄存器约束通常用于一个指令必须使用它们或者它们可以大大提高处理速度的地方。当需要在 “asm” 内更新一个 C 变量，而又不想使用寄存器去保存它的值，使用内存最为有效。例如，IDTR 寄存器的值存储于内存位置 loc 处：
asm("sidt %0\n" : :"m"(loc));
3. 匹配（数字）约束
在某些情况下，一个变量可能既充当输入操作数，也充当输出操作数。可以通过使用匹配约束在 "asm" 中指定这种情况。
asm ("incl %0" :"=a"(var):"0"(var));
在操作数那一节中，我们也看到了一些类似的示例。在这个匹配约束的示例中，寄存器 "%eax" 既用作输入变量，也用作输出变量。 var 输入被读进 %eax，并且等递增后更新的 %eax 再次被存储进 var。这里的 "0" 用于指定与第 0 个输出变量相同的约束。也就是，它指定 var 输出实例应只被存储在 "%eax" 中。该约束可用于：
• 在输入从变量读取或变量修改后且修改被写回同一变量的情况
• 在不需要将输入操作数实例和输出操作数实例分开的情况
使用匹配约束最重要的意义在于它们可以有效地使用可用寄存器。
其他一些约束：
1. "m" : 允许一个内存操作数，可以使用机器普遍支持的任一种地址。
2. "o" : 允许一个内存操作数，但只有当地址是可偏移的。即，该地址加上一个小的偏移量可以得到一个有效地址。
3. "V" : 一个不允许偏移的内存操作数。换言之，任何适合 "m" 约束而不适合 "o" 约束的操作数。
4. "i" : 允许一个（带有常量）的立即整形操作数。这包括其值仅在汇编时期知道的符号常量。
5. "n" : 允许一个带有已知数字的立即整形操作数。许多系统不支持汇编时期的常量，因为操作数少于一个字宽。对于此种操作数，约束应该使用 'n' 而不是'i'。
6. "g" : 允许任一寄存器、内存或者立即整形操作数，不包括通用寄存器之外的寄存器。
以下约束为 x86 特有。
1. "r" : 寄存器操作数约束，查看上面给定的表格。
2. "q" : 寄存器 a、b、c 或者 d。
3. "I" : 范围从 0 到 31 的常量（对于 32 位移位）。
4. "J" : 范围从 0 到 63 的常量（对于 64 位移位）。
5. "K" : 0xff。
6. "L" : 0xffff。
7. "M" : 0、1、2 或 3 （lea 指令的移位）。
8. "N" : 范围从 0 到 255 的常量（对于 out 指令）。
9. "f" : 浮点寄存器
10. "t" : 第一个（栈顶）浮点寄存器
11. "u" : 第二个浮点寄存器
12. "A" : 指定 ad 寄存器。这主要用于想要返回 64 位整形数，使用 d 寄存器保存最高有效位和 a 寄存器保存最低有效位。
6.2 约束修饰符
当使用约束时，对于更精确的控制超过了对约束作用的需求，GCC 给我们提供了约束修饰符。最常用的约束修饰符为：
1. "=" : 意味着对于这条指令，操作数为只写的；旧值会被忽略并被输出数据所替换。
2. "&" : 意味着这个操作数为一个早期改动的操作数，其在该指令完成前通过使用输入操作数被修改了。因此，这个操作数不可以位于一个被用作输出操作数或任何内存地址部分的寄存器。如果在旧值被写入之前它仅用作输入而已，一个输入操作数可以为一个早期改动操作数。
上述的约束列表和解释并不完整。示例可以让我们对内联汇编的用途和用法更好的理解。在下一节，我们会看到一些示例，在那里我们会发现更多关于修饰寄存器列表的东西。
7. 一些实用的诀窍
现在我们已经介绍了关于 GCC 内联汇编的基础理论，现在我们将专注于一些简单的例子。将内联汇编函数写成宏的形式总是非常方便的。我们可以在 Linux 内核代码里看到许多汇编函数。（usr/src/linux/include/asm/*.h）。
1. 首先我们从一个简单的例子入手。我们将写一个两个数相加的程序。
int main(void)
{
int foo = 10, bar = 15;
__asm__ __volatile__("addl %%ebx,%%eax"
:"=a"(foo)
:"a"(foo), "b"(bar)
);
printf("foo+bar=%d\n", foo);
return 0;
}
这里我们要求 GCC 将 foo 存放于 %eax，将 bar 存放于 %ebx，同时我们也想要在 %eax 中存放结果。'=' 符号表示它是一个输出寄存器。现在我们可以以其他方式将一个整数加到一个变量。
__asm__ __volatile__(
" lock ;\n"
" addl %1,%0 ;\n"
: "=m" (my_var)
: "ir" (my_int), "m" (my_var)
: /* 无修饰寄存器列表 */
);
这是一个原子加法。为了移除原子性，我们可以移除指令 'lock'。在输出域中，"=m" 表明 myvar 是一个输出且位于内存。类似地，"ir" 表明 myint 是一个整型，并应该存在于其他寄存器（回想我们上面看到的表格）。没有寄存器位于修饰寄存器列表中。
2. 现在我们将在一些寄存器/变量上展示一些操作，并比较值。
__asm__ __volatile__( "decl %0; sete %1"
: "=m" (my_var), "=q" (cond)
: "m" (my_var)
: "memory"
);
这里，my_var 的值减 1 ，并且如果结果的值为 0，则变量 cond 置 1。我们可以通过将指令 "lock;\n\t" 添加为汇编模板的第一条指令以增加原子性。
以类似的方式，为了增加 my_var，我们可以使用 "incl %0" 而不是 "decl %0"。
这里需要注意的地方是（i）my_var 是一个存储于内存的变量。（ii）cond 位于寄存器 eax、ebx、ecx、edx 中的任何一个。约束 "=q" 保证了这一点。（iii）同时我们可以看到 memory 位于修饰寄存器列表中。也就是说，代码将改变内存中的内容。
3. 如何置 1 或清 0 寄存器中的一个比特位。作为下一个诀窍，我们将会看到它。
__asm__ __volatile__( "btsl %1,%0"
: "=m" (ADDR)
: "Ir" (pos)
: "cc"
);
这里，ADDR 变量（一个内存变量）的 'pos' 位置上的比特被设置为 1。我们可以使用 'btrl' 来清除由 'btsl' 设置的比特位。pos 的约束 "Ir" 表明 pos 位于寄存器，并且它的值为 0-31（x86 相关约束）。也就是说，我们可以设置/清除 ADDR 变量上第 0 到 31 位的任一比特位。因为条件码会被改变，所以我们将 "cc" 添加进修饰寄存器列表。
4. 现在我们看看一些更为复杂而有用的函数。字符串拷贝。
static inline char * strcpy(char * dest,const char *src)
{
int d0, d1, d2;
__asm__ __volatile__( "1:\tlodsb\n\t"
"stosb\n\t"
"testb %%al,%%al\n\t"
"jne 1b"
: "=&S" (d0), "=&D" (d1), "=&a" (d2)
: "0" (src),"1" (dest)
: "memory");
return dest;
}
源地址存放于 esi，目标地址存放于 edi，同时开始拷贝，当我们到达 0 时，拷贝完成。约束 "&S"、"&D"、"&a" 表明寄存器 esi、edi 和 eax 早期修饰寄存器，也就是说，它们的内容在函数完成前会被改变。这里很明显可以知道为什么 "memory" 会放在修饰寄存器列表。
我们可以看到一个类似的函数，它能移动双字块数据。注意函数被声明为一个宏。
#define mov_blk(src, dest, numwords) \
__asm__ __volatile__ ( \
"cld\n\t" \
"rep\n\t" \
"movsl" \
: \
: "S" (src), "D" (dest), "c" (numwords) \
: "%ecx", "%esi", "%edi" \
)
这里我们没有输出，寄存器 ecx、esi和 edi 的内容发生了改变，这是块移动的副作用。因此我们必须将它们添加进修饰寄存器列表。
5. 在 Linux 中，系统调用使用 GCC 内联汇编实现。让我们看看如何实现一个系统调用。所有的系统调用被写成宏（linux/unistd.h）。例如，带有三个参数的系统调用被定义为如下所示的宏。
type name(type1 arg1,type2 arg2,type3 arg3) \
{ \
long __res; \
__asm__ volatile ( "int $0x80" \
: "=a" (__res) \
: "0" (__NR_##name),"b" ((long)(arg1)),"c" ((long)(arg2)), \
"d" ((long)(arg3))); \
__syscall_return(type,__res); \
}
无论何时调用带有三个参数的系统调用，以上展示的宏就会用于执行调用。系统调用号位于 eax 中，每个参数位于 ebx、ecx、edx 中。最后 "int 0x80" 是一条用于执行系统调用的指令。返回值被存储于 eax 中。
每个系统调用都以类似的方式实现。Exit 是一个单一参数的系统调用，让我们看看它的代码看起来会是怎样。它如下所示。
{
asm("movl $1,%%eax; /* SYS_exit is 1 */
xorl %%ebx,%%ebx; /* Argument is in ebx, it is 0 */
int $0x80" /* Enter kernel mode */
);
}
Exit 的系统调用号是 1，同时它的参数是 0。因此我们分配 eax 包含 1，ebx 包含 0，同时通过 int $0x80 执行 exit(0)。这就是 exit 的工作原理。
8. 结束语
这篇文档已经将 GCC 内联汇编过了一遍。一旦你理解了基本概念，你就可以按照自己的需求去使用它们了。我们看了许多例子，它们有助于理解 GCC 内联汇编的常用特性。
GCC 内联是一个极大的主题，这篇文章是不完整的。更多关于我们讨论过的语法细节可以在 GNU 汇编器的官方文档上获取。类似地，要获取完整的约束列表，可以参考 GCC 的官方文档。
当然，Linux 内核大量地使用了 GCC 内联。因此我们可以在内核源码中发现许多各种各样的例子。它们可以帮助我们很多。
如果你发现任何的错别字，或者本文中的信息已经过时，请告诉我们。
9. 参考
1. Brennan’s Guide to Inline Assembly
2. Using Assembly Language in Linux
3. Using as, The GNU Assembler
4. Using and Porting the GNU Compiler Collection (GCC)
5. Linux Kernel Source
via: http://www.ibiblio.org/gferg/ldp/GCC-Inline-Assembly-HOWTO.html
作者：Sandeep.S 译者：cposture 校对：wxy
本文由 LCTT 原创翻译，Linux中国 荣誉推出
LCTT 译者
cposture 🌟🌟🌟
共计翻译： 9.2 篇 | 共计贡献： 362
贡献时间：2015-12-31 -> 2016-12-27
访问我的 LCTT 主页 | 在 GitHub 上关注我
收藏
最新评论
我也要发表评论
[1]
chenjintao_ii [Firefox 47.0|Fedora] 发表于 2016-08-18 15:45 的评论：
昨天两遍，今天又看了一遍，还是没看明白。我是不是不适合做程序猿了？
linux [Chrome 52.0|Mac 10.11] 2016-08-19 23:50 回复
我觉得用不到的人看不懂也没啥。。
[1]
来自北京的 Chrome 45.0|Windows 7 用户 发表于 2016-08-17 10:45 的评论：
这文章？baidu机器翻译的？
linux [Chrome 52.0|Mac 10.11] 2016-08-17 21:44 回复
你家百度翻译真厉害。
[1]
来自北京的 Chrome 45.0|Windows 7 用户 发表于 2016-08-17 10:45 的评论：
这文章？baidu机器翻译的？
来自广东深圳的 Firefox 47.0|Windows 7 用户 2016-08-17 11:16 2 回复
哪里像百度翻译。。
zansy [Firefox 48.0|Windows 10] 2016-08-17 00:26 回复
赞，了解了
hello_linux [Chrome 46.0|Windows 7] 2016-08-16 17:47 回复
可以，看看
返回顶部
分享到微信
打开微信，点击顶部的“╋”，
使用“扫一扫”将网页分享至微信。
|
{
"url": "https://linux.cn/article-7688-1.html?utm_source=search&utm_medium=sitemap",
"source_domain": "linux.cn",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "81038",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BB3GOL44CCQR4EOACYGGIMX2JZ3CYXTO",
"WARC-Concurrent-To": "<urn:uuid:79275ac5-05ce-40b5-85c5-b482ce0f83ee>",
"WARC-Date": "2018-09-24T16:13:00Z",
"WARC-IP-Address": "211.157.2.93",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:553L4KPY77EUXJ25V4CA2MUWUCC2BRPO",
"WARC-Record-ID": "<urn:uuid:2e4c9de3-21e6-474c-a873-7633675655b7>",
"WARC-Target-URI": "https://linux.cn/article-7688-1.html?utm_source=search&utm_medium=sitemap",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b158b53-5ce6-4681-b33b-5700034cd74f>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-101-251-106.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,
6,
12,
13,
18,
19,
24,
25,
28,
36,
37,
52,
53,
85,
86,
123,
124,
145,
146,
228,
229,
235,
236,
245,
246,
276,
277,
360,
361,
434,
435,
444,
445,
509,
510,
517,
518,
699,
700,
775,
776,
782,
783,
821,
822,
893,
894,
907,
908,
1038,
1039,
1156,
1157,
1235,
1236,
1248,
1249,
1381,
1382,
1400,
1401,
1510,
1511,
1571,
1572,
1583,
1584,
1623,
1624,
1633,
1634,
1765,
1766,
1777,
1778,
1937,
1938,
1999,
2000,
2012,
2013,
2086,
2087,
2170,
2171,
2216,
2217,
2311,
2312,
2382,
2452,
2522,
2595,
2668,
2741,
2811,
2881,
2952,
3022,
3092,
3162,
3232,
3302,
3303,
3311,
3312,
3336,
3337,
3350,
3351,
3354,
3355,
3404,
3467,
3468,
3679,
3680,
3683,
3684,
3715,
3745,
3792,
3822,
3823,
4155,
4156,
4164,
4165,
4299,
4300,
4314,
4354,
4393,
4429,
4436,
4437,
4616,
4617,
4666,
4667,
4671,
4672,
4687,
4702,
4715,
4735,
4784,
4807,
4815,
4816,
5053,
5054,
5067,
5090,
5113,
5143,
5173,
5206,
5221,
5222,
5269,
5270,
5316,
5422,
5474,
5554,
5555,
5638,
5639,
5658,
5659,
5670,
5671,
5851,
5852,
5860,
5861,
6027,
6028,
6058,
6059,
6173,
6174,
6324,
6325,
6407,
6408,
6457,
6458,
6484,
6511,
6527,
6535,
6536,
6667,
6668,
6694,
6721,
6737,
6745,
6746,
6811,
6812,
6847,
6863,
6879,
6887,
6888,
7066,
7067,
7079,
7080,
7316,
7317,
7362,
7363,
7484,
7485,
7550,
7551,
7572,
7593,
7610,
7634,
7662,
7682,
7690,
7691,
7709,
7710,
7828,
7829,
7966,
7967,
7993,
7994,
8074,
8075,
8126,
8127,
8137,
8138,
8261,
8262,
8271,
8272,
8300,
8301,
8318,
8319,
8362,
8363,
8406,
8407,
8546,
8547,
8578,
8609,
8640,
8671,
8702,
8733,
8764,
8795,
8826,
8857,
8862,
8878,
8879,
9065,
9066,
9100,
9101,
9115,
9116,
9178,
9179,
9220,
9221,
9397,
9398,
9432,
9464,
9465,
9499,
9500,
9508,
9509,
9548,
9607,
9664,
9714,
9798,
9845,
9846,
9860,
9861,
9892,
9919,
9957,
9995,
10012,
10031,
10065,
10104,
10121,
10146,
10167,
10238,
10239,
10249,
10250,
10305,
10306,
10352,
10482,
10483,
10561,
10562,
10573,
10574,
10696,
10697,
10733,
10734,
10753,
10759,
10795,
10848,
10892,
10945,
10981,
11022,
11044,
11050,
11055,
11056,
11163,
11164,
11190,
11235,
11280,
11322,
11378,
11452,
11480,
11485,
11486,
11620,
11621,
11654,
11655,
11701,
11755,
11796,
11832,
11860,
11865,
11866,
11955,
11956,
12011,
12012,
12151,
12152,
12196,
12197,
12238,
12278,
12317,
12350,
12379,
12384,
12385,
12582,
12583,
12614,
12615,
12676,
12682,
12702,
12745,
12784,
12833,
12869,
12931,
12980,
13018,
13035,
13041,
13046,
13047,
13197,
13198,
13239,
13240,
13283,
13353,
13423,
13493,
13563,
13633,
13703,
13773,
13802,
13807,
13808,
13878,
13879,
13982,
13983,
14033,
14041,
14059,
14097,
14136,
14219,
14266,
14302,
14308,
14313,
14314,
14430,
14431,
14493,
14494,
14500,
14560,
14634,
14698,
14717,
14723,
14728,
14729,
14825,
14826,
14833,
14834,
14916,
14917,
15007,
15008,
15069,
15070,
15102,
15103,
15109,
15110,
15150,
15188,
15221,
15278,
15303,
15304,
15373,
15374,
15406,
15407,
15434,
15435,
15443,
15456,
15480,
15510,
15539,
15540,
15543,
15544,
15545,
15550,
15551,
15559,
15560,
15564,
15626,
15660,
15710,
15727,
15731,
15788,
15804,
15854,
15865,
15869,
15926,
15942,
15998,
16008,
16060,
16066,
16122,
16128,
16133,
16134,
16140,
16141,
16156
],
"line_end_idx": [
6,
12,
13,
18,
19,
24,
25,
28,
36,
37,
52,
53,
85,
86,
123,
124,
145,
146,
228,
229,
235,
236,
245,
246,
276,
277,
360,
361,
434,
435,
444,
445,
509,
510,
517,
518,
699,
700,
775,
776,
782,
783,
821,
822,
893,
894,
907,
908,
1038,
1039,
1156,
1157,
1235,
1236,
1248,
1249,
1381,
1382,
1400,
1401,
1510,
1511,
1571,
1572,
1583,
1584,
1623,
1624,
1633,
1634,
1765,
1766,
1777,
1778,
1937,
1938,
1999,
2000,
2012,
2013,
2086,
2087,
2170,
2171,
2216,
2217,
2311,
2312,
2382,
2452,
2522,
2595,
2668,
2741,
2811,
2881,
2952,
3022,
3092,
3162,
3232,
3302,
3303,
3311,
3312,
3336,
3337,
3350,
3351,
3354,
3355,
3404,
3467,
3468,
3679,
3680,
3683,
3684,
3715,
3745,
3792,
3822,
3823,
4155,
4156,
4164,
4165,
4299,
4300,
4314,
4354,
4393,
4429,
4436,
4437,
4616,
4617,
4666,
4667,
4671,
4672,
4687,
4702,
4715,
4735,
4784,
4807,
4815,
4816,
5053,
5054,
5067,
5090,
5113,
5143,
5173,
5206,
5221,
5222,
5269,
5270,
5316,
5422,
5474,
5554,
5555,
5638,
5639,
5658,
5659,
5670,
5671,
5851,
5852,
5860,
5861,
6027,
6028,
6058,
6059,
6173,
6174,
6324,
6325,
6407,
6408,
6457,
6458,
6484,
6511,
6527,
6535,
6536,
6667,
6668,
6694,
6721,
6737,
6745,
6746,
6811,
6812,
6847,
6863,
6879,
6887,
6888,
7066,
7067,
7079,
7080,
7316,
7317,
7362,
7363,
7484,
7485,
7550,
7551,
7572,
7593,
7610,
7634,
7662,
7682,
7690,
7691,
7709,
7710,
7828,
7829,
7966,
7967,
7993,
7994,
8074,
8075,
8126,
8127,
8137,
8138,
8261,
8262,
8271,
8272,
8300,
8301,
8318,
8319,
8362,
8363,
8406,
8407,
8546,
8547,
8578,
8609,
8640,
8671,
8702,
8733,
8764,
8795,
8826,
8857,
8862,
8878,
8879,
9065,
9066,
9100,
9101,
9115,
9116,
9178,
9179,
9220,
9221,
9397,
9398,
9432,
9464,
9465,
9499,
9500,
9508,
9509,
9548,
9607,
9664,
9714,
9798,
9845,
9846,
9860,
9861,
9892,
9919,
9957,
9995,
10012,
10031,
10065,
10104,
10121,
10146,
10167,
10238,
10239,
10249,
10250,
10305,
10306,
10352,
10482,
10483,
10561,
10562,
10573,
10574,
10696,
10697,
10733,
10734,
10753,
10759,
10795,
10848,
10892,
10945,
10981,
11022,
11044,
11050,
11055,
11056,
11163,
11164,
11190,
11235,
11280,
11322,
11378,
11452,
11480,
11485,
11486,
11620,
11621,
11654,
11655,
11701,
11755,
11796,
11832,
11860,
11865,
11866,
11955,
11956,
12011,
12012,
12151,
12152,
12196,
12197,
12238,
12278,
12317,
12350,
12379,
12384,
12385,
12582,
12583,
12614,
12615,
12676,
12682,
12702,
12745,
12784,
12833,
12869,
12931,
12980,
13018,
13035,
13041,
13046,
13047,
13197,
13198,
13239,
13240,
13283,
13353,
13423,
13493,
13563,
13633,
13703,
13773,
13802,
13807,
13808,
13878,
13879,
13982,
13983,
14033,
14041,
14059,
14097,
14136,
14219,
14266,
14302,
14308,
14313,
14314,
14430,
14431,
14493,
14494,
14500,
14560,
14634,
14698,
14717,
14723,
14728,
14729,
14825,
14826,
14833,
14834,
14916,
14917,
15007,
15008,
15069,
15070,
15102,
15103,
15109,
15110,
15150,
15188,
15221,
15278,
15303,
15304,
15373,
15374,
15406,
15407,
15434,
15435,
15443,
15456,
15480,
15510,
15539,
15540,
15543,
15544,
15545,
15550,
15551,
15559,
15560,
15564,
15626,
15660,
15710,
15727,
15731,
15788,
15804,
15854,
15865,
15869,
15926,
15942,
15998,
16008,
16060,
16066,
16122,
16128,
16133,
16134,
16140,
16141,
16156,
16172
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16172,
"ccnet_original_nlines": 496,
"rps_doc_curly_bracket": 0.0004946800181642175,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03926483169198036,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03731551021337509,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7671957612037659,
"rps_doc_frac_unique_words": 0.605431318283081,
"rps_doc_mean_word_length": 8.459264755249023,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0.0025062700733542442,
"rps_doc_unigram_entropy": 6.188875675201416,
"rps_doc_word_count": 1252,
"rps_doc_frac_chars_dupe_10grams": 0.011141539551317692,
"rps_doc_frac_chars_dupe_5grams": 0.011141539551317692,
"rps_doc_frac_chars_dupe_6grams": 0.011141539551317692,
"rps_doc_frac_chars_dupe_7grams": 0.011141539551317692,
"rps_doc_frac_chars_dupe_8grams": 0.011141539551317692,
"rps_doc_frac_chars_dupe_9grams": 0.011141539551317692,
"rps_doc_frac_chars_top_2gram": 0.007270319852977991,
"rps_doc_frac_chars_top_3gram": 0.00141629995778203,
"rps_doc_frac_chars_top_4gram": 0.004909830167889595,
"rps_doc_books_importance": -1751.1280517578125,
"rps_doc_books_importance_length_correction": -1751.1280517578125,
"rps_doc_openwebtext_importance": -992.2804565429688,
"rps_doc_openwebtext_importance_length_correction": -992.2804565429688,
"rps_doc_wikipedia_importance": -768.96630859375,
"rps_doc_wikipedia_importance_length_correction": -768.96630859375
},
"fasttext": {
"dclm": 0.7799400091171265,
"english": 0.0032349000684916973,
"fineweb_edu_approx": 1.5987657308578491,
"eai_general_math": 0.007894040085375309,
"eai_open_web_math": 0.5196371078491211,
"eai_web_code": 0.4146040678024292
}
}
|
{
"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": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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,333,763,918,701,612,000 |
react-native-cz-scroll-tab
npm install react-native-cz-scroll-tab --save
Usage no npm install needed!
<script type="module">
import reactNativeCzScrollTab from 'https://cdn.skypack.dev/react-native-cz-scroll-tab';
</script>
README
Manual installation
npm install react-native-cz-scroll-tab --save
Usage
1.引入组件
import ScrollTab from 'react-native-cz-scroll-tab';
<ScrollTab
isScroll={false}
style={{height: 50}}
list={[{'name': 'Tab1'}, {'name': 'Tab2', 'redCount': 22}]}
normalTextStyles={{color: 'blue', fontSize: 18}}
selectedTextStyles={{color: 'red', fontSize: 22}}
selectItemAtIndex={this._selectItemAtIndex}
evaluateView={ (scrollTab) => {this.scrollTab = scrollTab}}
/>
2.属性:
type: 1.默认类型，目前只支持1
isScroll: 是否可滚动；如果滚动，则根据文本排列，如果不滚动，则根据屏幕平分。默认不可滚动
style: 主视图样式：{'height': 50}；高度必须要有
list: 列表数据源: {'name': 'Tab1', 'redCount': '3'} name: 显示名称 redCount: 红点数量
currentIndex: 当前选中索引值，默认第一个
clickSame: 如果点击一样的Tab，是否也触发selectItemAtIndex方法。默认不触发
lineColor: 当type=1的时候，底部横线的颜色
normalTextStyles: 未选中时样式：{fontSize: 15, color: 'red'}
selectedTextStyles: 选中时样式：{fontSize: 18, color: 'red'}
3.属性方法:
/*
* 赋值当前视图
* */
evaluateView
/*
* 点击某个Item事件
* item：当前选中对象
* index：对应索引值
* */
selectItemAtIndex(item, index)
4.供外部调用的方法:
|
{
"url": "https://www.skypack.dev/view/react-native-cz-scroll-tab",
"source_domain": "www.skypack.dev",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "38846",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KEINRKGW6EGHBZIBZUCFIBAOV2V7GLDK",
"WARC-Concurrent-To": "<urn:uuid:06ca4c26-41d5-4152-9b65-fe278fa47958>",
"WARC-Date": "2021-10-16T12:21:55Z",
"WARC-IP-Address": "76.76.21.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HY65TNVNJB533RSD3O4ARLJL77PH3AOP",
"WARC-Record-ID": "<urn:uuid:4106ca97-bc69-4703-9354-791d947cd045>",
"WARC-Target-URI": "https://www.skypack.dev/view/react-native-cz-scroll-tab",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e18ccb12-df06-4028-a07b-25ca2e3748d5>"
},
"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-13\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
28,
74,
75,
104,
105,
128,
219,
229,
230,
237,
238,
258,
259,
305,
306,
312,
313,
320,
321,
373,
374,
386,
408,
434,
499,
553,
608,
656,
720,
723,
724,
730,
731,
751,
801,
836,
909,
937,
990,
1020,
1074,
1129,
1130,
1138,
1139,
1142,
1151,
1156,
1169,
1172,
1185,
1199,
1213,
1218,
1249,
1250
],
"line_end_idx": [
27,
28,
74,
75,
104,
105,
128,
219,
229,
230,
237,
238,
258,
259,
305,
306,
312,
313,
320,
321,
373,
374,
386,
408,
434,
499,
553,
608,
656,
720,
723,
724,
730,
731,
751,
801,
836,
909,
937,
990,
1020,
1074,
1129,
1130,
1138,
1139,
1142,
1151,
1156,
1169,
1172,
1185,
1199,
1213,
1218,
1249,
1250,
1261
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1261,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0.026962729170918465,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.030201340094208717,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003355700056999922,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6241610646247864,
"rps_doc_frac_unique_words": 0.7083333134651184,
"rps_doc_mean_word_length": 9.53125,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.092256546020508,
"rps_doc_word_count": 96,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08961749076843262,
"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.03278689086437225,
"rps_doc_frac_chars_top_3gram": 0.06994535773992538,
"rps_doc_frac_chars_top_4gram": 0.07868851721286774,
"rps_doc_books_importance": -177.0817108154297,
"rps_doc_books_importance_length_correction": -177.0817108154297,
"rps_doc_openwebtext_importance": -118.1937484741211,
"rps_doc_openwebtext_importance_length_correction": -118.1937484741211,
"rps_doc_wikipedia_importance": -108.02521514892578,
"rps_doc_wikipedia_importance_length_correction": -108.02521514892578
},
"fasttext": {
"dclm": 0.7510168552398682,
"english": 0.11748083680868149,
"fineweb_edu_approx": 1.3858875036239624,
"eai_general_math": 0.002405760111287236,
"eai_open_web_math": 0.12112963199615479,
"eai_web_code": 0.6291333436965942
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "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
|
8,840,617,341,484,312,000 |
Linux: I/O Redirection for DevOps
5.0
12 個評分
提供方
Coursera Project Network
在此指導項目中，您將：
Understand how i/o (input/output) and redirection works in Linux
Use Linux redirection operators with commands to manipulate and redirect data
Clock2 hours
Intermediate中級
Cloud無需下載
Video分屏視頻
Comment Dots英語（English）
Laptop僅限桌面
In this 1-hour long project-based course on Linux i/o redirection for DevOps you will be working entirely on the command line and using powerful Linux commands and redirection operators to learn how input and output redirection works in Linux. You will get experience of taking control of what happens to the stdin and stdout of all your commands and no longer be confused about the details on how piping and redirection works in Linux. This course is designed for any person working or who intends to work with Linux, from Linux system administrators to developers and DevOps practitioners. Or even if you are a student who is curious to get comfortable with Linux this course is for you also. By the end of this course, you will have used all of the redirection operators to redirect data and you will be comfortable to do so with ease going forward. This will also allow you to possess one of the important foundations of Bash scripting. This is an intermediate level course and is designed for an individual who has a beginner's knowledge of Linux command line and crud practices in computer science. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.
您要培養的技能
• Linux
• I/O
分步進行學習
在與您的工作區一起在分屏中播放的視頻中，您的授課教師將指導您完成每個步驟：
1. Task 1 - I/O redirection - What is IO, stdin, stdout and stderr?
2. Task 2 - Redirection Operators - Standard Output: (>, >>)
3. Task 3 - Redirection Operators - Standard Error: (2>, 2>>, &>)
4. Task 4 - Redirecting to std-in and heredocs (<, <<)
5. Task 5 - Redirection through piping (|)
指導項目工作原理
您的工作空間就是瀏覽器中的雲桌面，無需下載
在分屏視頻中，您的授課教師會為您提供分步指導
審閱
來自LINUX: I/O REDIRECTION FOR DEVOPS的熱門評論
查看所有評論
常見問題
常見問題
還有其他問題嗎？請訪問 學生幫助中心
|
{
"url": "https://zh-tw.coursera.org/projects/rudi-hinds-linux-io-redirection-for-devops",
"source_domain": "zh-tw.coursera.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "675375",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JTQVVFSOJFJZDWRKKFBTVAWQHHFQYFEH",
"WARC-Concurrent-To": "<urn:uuid:0395b479-4cd9-4aa8-9dfe-b2e66e359565>",
"WARC-Date": "2021-12-02T01:29:11Z",
"WARC-IP-Address": "18.67.76.37",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HK7OHCMGXSHWBGAKEEUCVTNFWPDKNQTR",
"WARC-Record-ID": "<urn:uuid:c80967d2-94d6-43ea-a745-ce149ff228c0>",
"WARC-Target-URI": "https://zh-tw.coursera.org/projects/rudi-hinds-linux-io-redirection-for-devops",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8e317a87-3b8c-4a78-af3f-d0f0d3ece12a>"
},
"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-166\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
39,
46,
50,
75,
87,
88,
153,
154,
232,
233,
246,
261,
271,
281,
305,
316,
317,
1582,
1583,
1591,
1592,
1602,
1610,
1611,
1618,
1619,
1657,
1658,
1728,
1729,
1792,
1793,
1861,
1862,
1919,
1920,
1965,
1966,
1975,
1976,
1998,
1999,
2022,
2023,
2026,
2027,
2068,
2069,
2076,
2077,
2082,
2083,
2088,
2089
],
"line_end_idx": [
34,
35,
39,
46,
50,
75,
87,
88,
153,
154,
232,
233,
246,
261,
271,
281,
305,
316,
317,
1582,
1583,
1591,
1592,
1602,
1610,
1611,
1618,
1619,
1657,
1658,
1728,
1729,
1792,
1793,
1861,
1862,
1919,
1920,
1965,
1966,
1975,
1976,
1998,
1999,
2022,
2023,
2026,
2027,
2068,
2069,
2076,
2077,
2082,
2083,
2088,
2089,
2107
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2107,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34567901492118835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03209877014160156,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25432097911834717,
"rps_doc_frac_unique_words": 0.49221184849739075,
"rps_doc_mean_word_length": 5.190031051635742,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.673887252807617,
"rps_doc_word_count": 321,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06362544745206833,
"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.06002400815486908,
"rps_doc_frac_chars_top_3gram": 0.028811519965529442,
"rps_doc_frac_chars_top_4gram": 0.04141657054424286,
"rps_doc_books_importance": -188.0742645263672,
"rps_doc_books_importance_length_correction": -188.0742645263672,
"rps_doc_openwebtext_importance": -98.07286834716797,
"rps_doc_openwebtext_importance_length_correction": -98.07286834716797,
"rps_doc_wikipedia_importance": -69.7729263305664,
"rps_doc_wikipedia_importance_length_correction": -69.7729263305664
},
"fasttext": {
"dclm": 0.03925782069563866,
"english": 0.7270669937133789,
"fineweb_edu_approx": 1.9529547691345215,
"eai_general_math": 0.034232500940561295,
"eai_open_web_math": 0.10206878185272217,
"eai_web_code": 0.054823338985443115
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "17",
"label": "Product Page"
}
},
"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
|
4,754,781,455,838,679,000 |
[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]
Bug#752133: debian-cd: Use cpu autodetection by default on amd64-i386 CDs
Hi Vagrant!
On Thu, Jun 19, 2014 at 06:39:45PM -0700, Vagrant Cascadian wrote:
>Package: debian-cd
>Version: 3.1.15
>Severity: wishlist
>
>With a multi-arch CD containing both amd64 and i386, the default boot menu
>entry appears to install 32 bit, and the user has to explicitly select the 64
>bit installation option.
>
>Unless you first go to the help menu, and then "hit ENTER to boot:"...
>Then it autodetects weather you're running amd64 or i386, and runs the
>appropriate one. So most of the code is already there...
>
>Wouldn't it make more sense to default to autodetection, and allow the user to
>select 32 or 64 bit explicitly (maye even hidden away in an "Advanced"
>sub-menu)?
Oh, bugger. We've explicitly enabled the auto-detect in the past. I
wasn't aware it had stopped working, to be honest. :-( Looks like
there's a bug that's crept in here.
>Is there concern that autodetection might fail too often to be worth it?
>I've seen hundreds of computers per year work just fine of a fairly random
>distribution in hardware at a computer recycling facility, and I cannot recall
>ifcpu64 failing me even once... that said it was mostly 3-7 year old
>hardware.
>
>I could dig a little deeper and possibly write a patch, if there wasn't
>opposition to the general idea...
Please, by all means!
--
Steve McIntyre, Cambridge, UK. [email protected]
"The problem with defending the purity of the English language is that
English is about as pure as a cribhouse whore. We don't just borrow words; on
occasion, English has pursued other languages down alleyways to beat them
unconscious and rifle their pockets for new vocabulary." -- James D. Nicoll
Reply to:
|
{
"url": "https://lists.debian.org/debian-cd/2014/06/msg00032.html",
"source_domain": "lists.debian.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "7554",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AEWYU5AAYU6TCOL2S7Z6SW73GLAXKHI3",
"WARC-Concurrent-To": "<urn:uuid:3d30e3f6-547d-4c74-8365-d99f000c9d06>",
"WARC-Date": "2021-01-22T07:43:29Z",
"WARC-IP-Address": "82.195.75.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3FWJI46ZN2PEYXKK56TV5MH65EPZTQGK",
"WARC-Record-ID": "<urn:uuid:3cc18361-86eb-42dd-9926-ff5196907616>",
"WARC-Target-URI": "https://lists.debian.org/debian-cd/2014/06/msg00032.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a8e3691-b875-4392-af65-ea76d6d87432>"
},
"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-246.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,
1,
79,
80,
154,
155,
156,
157,
169,
170,
237,
257,
274,
294,
296,
372,
451,
477,
479,
551,
623,
681,
683,
763,
835,
847,
848,
916,
982,
1018,
1019,
1093,
1169,
1249,
1319,
1330,
1332,
1405,
1440,
1441,
1463,
1464,
1468,
1547,
1618,
1697,
1772,
1850,
1851,
1852
],
"line_end_idx": [
1,
79,
80,
154,
155,
156,
157,
169,
170,
237,
257,
274,
294,
296,
372,
451,
477,
479,
551,
623,
681,
683,
763,
835,
847,
848,
916,
982,
1018,
1019,
1093,
1169,
1249,
1319,
1330,
1332,
1405,
1440,
1441,
1463,
1464,
1468,
1547,
1618,
1697,
1772,
1850,
1851,
1852,
1861
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1861,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3107476532459259,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02102803997695446,
"rps_doc_frac_lines_end_with_ellipsis": 0.05999999865889549,
"rps_doc_frac_no_alph_words": 0.28738316893577576,
"rps_doc_frac_unique_words": 0.6813559532165527,
"rps_doc_mean_word_length": 4.698305130004883,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.011682240292429924,
"rps_doc_unigram_entropy": 5.059194564819336,
"rps_doc_word_count": 295,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010101010091602802,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -180.33583068847656,
"rps_doc_books_importance_length_correction": -180.26976013183594,
"rps_doc_openwebtext_importance": -91.09722900390625,
"rps_doc_openwebtext_importance_length_correction": -91.09722900390625,
"rps_doc_wikipedia_importance": -51.95743179321289,
"rps_doc_wikipedia_importance_length_correction": -51.95738983154297
},
"fasttext": {
"dclm": 0.1316918134689331,
"english": 0.9313192963600159,
"fineweb_edu_approx": 1.7009992599487305,
"eai_general_math": 0.1475081443786621,
"eai_open_web_math": 0.12345833331346512,
"eai_web_code": 0.036754071712493896
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "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": "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
|
-4,243,981,677,207,275,500 |
Simple Network Management Protocol (SNMP)
Reference Manual
Version 5.8.0.1
Table of Contents
snmp_pdus
Module
snmp_pdus
Module Summary
Encode and Decode Functions for SNMP PDUs
Description
RFC1157, RFC1905 and/or RFC2272 should be studied carefully before using this module, snmp_pdus.
The module snmp_pdus contains functions for encoding and decoding of SNMP protocol data units (PDUs). In short, this module converts a list of bytes to Erlang record representations and vice versa. The record definitions can be found in the file snmp/include/snmp_types.hrl. If snmpv3 is used, the module that includes snmp_types.hrl must define the constant SNMP_USE_V3 before the header file is included. Example:
-define(SNMP_USE_V3, true).
-include_lib("snmp/include/snmp_types.hrl").
Encoding and decoding must be done explicitly when writing your own Net if process.
Types
Message = #message
Decodes a list of bytes into an SNMP Message. Note, if there is a v3 message, the msgSecurityParameters are not decoded. They must be explicitly decoded by a call to a security model specific decoding function, e.g. dec_usm_security_parameters/1. Also note, if the scopedPDU is encrypted, the OCTET STRING encoded encryptedPDU will be present in the data field.
Types
Message = #message
Decodes a list of bytes into an SNMP Message, but does not decode the data part of the Message. That means, data is still a list of bytes, normally an encoded PDU (v1 and V2) or an encoded and possibly encrypted scopedPDU (v3).
Types
Pdu = #pdu
Decodes a list of bytes into an SNMP Pdu.
Types
ScopedPdu = #scoped_pdu
Decodes a list of bytes into an SNMP ScopedPdu.
Types
ScopedPduData = #scoped_pdu | EncryptedPDU
EncryptedPDU = [byte()]
Decodes a list of bytes into either a scoped pdu record, or - if the scoped pdu was encrypted - to a list of bytes.
Types
UsmSecParams = #usmSecurityParameters
Decodes a list of bytes into an SNMP UsmSecurityParameters
Types
Message = #message
Encodes a message record to a list of bytes.
Types
Message = #message
Message is a record where the data field is assumed to be encoded (a list of bytes). If there is a v1 or v2 message, the data field is an encoded PDU, and if there is a v3 message, data is an encoded and possibly encrypted scopedPDU.
Types
Pdu = #pdu
Encodes an SNMP Pdu into a list of bytes.
Types
ScopedPdu = #scoped_pdu
Encodes an SNMP ScopedPdu into a list of bytes, which can be encrypted, and after encryption, encoded with a call to enc_encrypted_scoped_pdu/1; or it can be used as the data field in a message record, which then can be encoded with enc_message_only/1.
Types
UsmSecParams = #usmSecurityParameters
Encodes SNMP UsmSecurityParameters into a list of bytes.
|
{
"url": "https://www.erlang.org/docs/23/man/snmp_pdus",
"source_domain": "www.erlang.org",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "81450",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TN3SDMPKVP6UKANXOB65PJY4VXPKOSDL",
"WARC-Concurrent-To": "<urn:uuid:7b62d689-b86d-45c8-bf55-02a8d94aba7b>",
"WARC-Date": "2024-04-22T15:41:24Z",
"WARC-IP-Address": "54.161.234.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R3VCDXUOFUR36RMWPSOOAV66PNJ465UX",
"WARC-Record-ID": "<urn:uuid:af5206cb-2c63-4e90-99de-3e09d9f8317f>",
"WARC-Target-URI": "https://www.erlang.org/docs/23/man/snmp_pdus",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b251a038-f33f-4c0b-a2e5-217c819c7ae0>"
},
"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-242\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,
42,
43,
60,
61,
77,
78,
96,
97,
107,
108,
115,
116,
126,
127,
142,
143,
185,
186,
198,
199,
296,
297,
713,
714,
742,
791,
792,
876,
877,
883,
884,
903,
904,
1266,
1267,
1273,
1274,
1293,
1294,
1522,
1523,
1529,
1530,
1541,
1542,
1584,
1585,
1591,
1592,
1616,
1617,
1665,
1666,
1672,
1673,
1716,
1740,
1741,
1857,
1858,
1864,
1865,
1903,
1904,
1963,
1964,
1970,
1971,
1990,
1991,
2036,
2037,
2043,
2044,
2063,
2064,
2298,
2299,
2305,
2306,
2317,
2318,
2360,
2361,
2367,
2368,
2392,
2393,
2646,
2647,
2653,
2654,
2692,
2693
],
"line_end_idx": [
42,
43,
60,
61,
77,
78,
96,
97,
107,
108,
115,
116,
126,
127,
142,
143,
185,
186,
198,
199,
296,
297,
713,
714,
742,
791,
792,
876,
877,
883,
884,
903,
904,
1266,
1267,
1273,
1274,
1293,
1294,
1522,
1523,
1529,
1530,
1541,
1542,
1584,
1585,
1591,
1592,
1616,
1617,
1665,
1666,
1672,
1673,
1716,
1740,
1741,
1857,
1858,
1864,
1865,
1903,
1904,
1963,
1964,
1970,
1971,
1990,
1991,
2036,
2037,
2043,
2044,
2063,
2064,
2298,
2299,
2305,
2306,
2317,
2318,
2360,
2361,
2367,
2368,
2392,
2393,
2646,
2647,
2653,
2654,
2692,
2693,
2749
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2749,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3208955228328705,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03917910158634186,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2014925330877304,
"rps_doc_frac_unique_words": 0.339712917804718,
"rps_doc_mean_word_length": 5.1052632331848145,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.02052238956093788,
"rps_doc_unigram_entropy": 4.392266750335693,
"rps_doc_word_count": 418,
"rps_doc_frac_chars_dupe_10grams": 0.05154639109969139,
"rps_doc_frac_chars_dupe_5grams": 0.1991565078496933,
"rps_doc_frac_chars_dupe_6grams": 0.1743205189704895,
"rps_doc_frac_chars_dupe_7grams": 0.09231489896774292,
"rps_doc_frac_chars_dupe_8grams": 0.09231489896774292,
"rps_doc_frac_chars_dupe_9grams": 0.05154639109969139,
"rps_doc_frac_chars_top_2gram": 0.03280225023627281,
"rps_doc_frac_chars_top_3gram": 0.045923151075839996,
"rps_doc_frac_chars_top_4gram": 0.07872539758682251,
"rps_doc_books_importance": -289.04083251953125,
"rps_doc_books_importance_length_correction": -289.04083251953125,
"rps_doc_openwebtext_importance": -198.62973022460938,
"rps_doc_openwebtext_importance_length_correction": -198.62973022460938,
"rps_doc_wikipedia_importance": -100.26432800292969,
"rps_doc_wikipedia_importance_length_correction": -100.26432800292969
},
"fasttext": {
"dclm": 0.8823309540748596,
"english": 0.7497693300247192,
"fineweb_edu_approx": 3.235861301422119,
"eai_general_math": 0.843909502029419,
"eai_open_web_math": 0.04310619831085205,
"eai_web_code": 0.9736323952674866
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,815,236,313,567,438,000 |
These are simple step by step code snippets to allow you learn JavaFX.
Example 1: Color
Study the following code:
Step 1: Create Project
1. Open your favorite Java IDE.
2. In the menu go to File --> Create New Project.
Step 2: Dependencies
No dependencies are needed for this project.
Step 3: Write Code
Our code will comprise the following java files:
• ColorExample.java
1. In your editor or IDE, create a file known as ColorExample.java.
2. Then add the following code:
(a). ColorExample.java
After creating our class, the first thing is to define imports. Such imports are ready made classes that inject more functionalities into our project.
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.layout.Background;
import javafx.scene.layout.BackgroundFill;
import javafx.scene.layout.Pane;
import javafx.scene.layout.VBox;
import javafx.scene.paint.Color;
import javafx.stage.Stage;
Through inheritance we will be able to derive properties from a parent class. However we have to extend that parent class. So we do that using the extends keyword.
public class ColorExample extends Application {
Our class will have the following methods:
• void main(String[] args)
• void start(Stage primaryStage)
For our Java program to run we need a main method. Add it as shown below:
public static void main(String[] args) {
Here is the full code:
package com.jenkov.javafx.color;
import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.layout.Background;
import javafx.scene.layout.BackgroundFill;
import javafx.scene.layout.Pane;
import javafx.scene.layout.VBox;
import javafx.scene.paint.Color;
import javafx.stage.Stage;
public class ColorExample extends Application {
public static void main(String[] args) {
launch(args);
}
public void start(Stage primaryStage) {
double red = 1.0;
double green = 0.8;
double blue = 0.6;
double alpha = 1.0;
Color color = new Color(red, green, blue, alpha);
Color color1 = Color.web("#ff00ff");
Color color1_1 = Color.web("hsl(270,100%,100%)");
Color color2 = Color.web("#ff00ff", 0.5);
Color color3 = Color.rgb(255, 0, 255);
Color color4 = Color.rgb(255, 0, 255, 0.5);
Color color5 = Color.grayRgb(255);
Color color6 = Color.grayRgb(255, 0.5);
Color color7 = Color.hsb(1.0, 0.5, 0.8);
Color color8 = Color.hsb(1.0, 0.5, 0.8, 0.5);
Color color9 = Color.color(1.0, 0.0, 1.0);
Color color10 = Color.color(1.0, 0.0, 1.0, 0.5);
Pane pane = new Pane();
pane.setPrefWidth(300);
pane.setPrefHeight(300);
Background background = new Background(new BackgroundFill(color1_1, null, null));
pane.setBackground(background);
VBox vBox = new VBox(pane);
Scene scene = new Scene(vBox);
primaryStage.setScene(scene);
primaryStage.show();
}
}
Download
Download the code using the below links:
Number Link
1. Download Example
2. Follow code author
3. Code: Apache 2.0 License
|
{
"url": "https://camposha.info/javafx-examples/color/",
"source_domain": "camposha.info",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "64573",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MSNI56XARCXIUMYFHLUIA5J6ZZVI7VU2",
"WARC-Concurrent-To": "<urn:uuid:b5deb9c2-be1e-4226-99ce-60d8b2341bc1>",
"WARC-Date": "2022-07-01T22:59:01Z",
"WARC-IP-Address": "172.67.179.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YZF2PI5L7IKGBQIHWKRR67OJGGOYOZJ3",
"WARC-Record-ID": "<urn:uuid:25cedb16-8b6d-47e0-b219-8eb95dc04c38>",
"WARC-Target-URI": "https://camposha.info/javafx-examples/color/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6dd603c8-1d36-4d77-8873-e1da1fd45712>"
},
"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-103\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,
71,
72,
89,
90,
116,
117,
140,
141,
175,
227,
228,
249,
250,
295,
296,
315,
316,
365,
366,
388,
458,
492,
493,
516,
517,
668,
669,
708,
735,
774,
817,
850,
883,
916,
943,
944,
1108,
1109,
1157,
1158,
1201,
1202,
1231,
1266,
1267,
1341,
1342,
1387,
1388,
1411,
1412,
1445,
1446,
1485,
1512,
1551,
1594,
1627,
1660,
1693,
1720,
1721,
1769,
1770,
1815,
1837,
1843,
1844,
1888,
1889,
1917,
1945,
1973,
2001,
2002,
2061,
2107,
2166,
2217,
2265,
2318,
2362,
2411,
2461,
2516,
2568,
2625,
2626,
2658,
2690,
2723,
2724,
2814,
2854,
2855,
2891,
2930,
2931,
2969,
2970,
2999,
3005,
3007,
3008,
3017,
3018,
3059,
3060,
3072,
3092,
3114
],
"line_end_idx": [
71,
72,
89,
90,
116,
117,
140,
141,
175,
227,
228,
249,
250,
295,
296,
315,
316,
365,
366,
388,
458,
492,
493,
516,
517,
668,
669,
708,
735,
774,
817,
850,
883,
916,
943,
944,
1108,
1109,
1157,
1158,
1201,
1202,
1231,
1266,
1267,
1341,
1342,
1387,
1388,
1411,
1412,
1445,
1446,
1485,
1512,
1551,
1594,
1627,
1660,
1693,
1720,
1721,
1769,
1770,
1815,
1837,
1843,
1844,
1888,
1889,
1917,
1945,
1973,
2001,
2002,
2061,
2107,
2166,
2217,
2265,
2318,
2362,
2411,
2461,
2516,
2568,
2625,
2626,
2658,
2690,
2723,
2724,
2814,
2854,
2855,
2891,
2930,
2931,
2969,
2970,
2999,
3005,
3007,
3008,
3017,
3018,
3059,
3060,
3072,
3092,
3114,
3141
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3141,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0.002546960022300482,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10659187287092209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0028050499968230724,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4516128897666931,
"rps_doc_frac_unique_words": 0.48991355299949646,
"rps_doc_mean_word_length": 6.285302639007568,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0.0028050499968230724,
"rps_doc_unigram_entropy": 4.832387924194336,
"rps_doc_word_count": 347,
"rps_doc_frac_chars_dupe_10grams": 0.20999540388584137,
"rps_doc_frac_chars_dupe_5grams": 0.2751031517982483,
"rps_doc_frac_chars_dupe_6grams": 0.20999540388584137,
"rps_doc_frac_chars_dupe_7grams": 0.20999540388584137,
"rps_doc_frac_chars_dupe_8grams": 0.20999540388584137,
"rps_doc_frac_chars_dupe_9grams": 0.20999540388584137,
"rps_doc_frac_chars_top_2gram": 0.022008249536156654,
"rps_doc_frac_chars_top_3gram": 0.024759279564023018,
"rps_doc_frac_chars_top_4gram": 0.05135259032249451,
"rps_doc_books_importance": -332.635986328125,
"rps_doc_books_importance_length_correction": -332.635986328125,
"rps_doc_openwebtext_importance": -195.94277954101562,
"rps_doc_openwebtext_importance_length_correction": -195.94277954101562,
"rps_doc_wikipedia_importance": -189.1300811767578,
"rps_doc_wikipedia_importance_length_correction": -189.1300811767578
},
"fasttext": {
"dclm": 0.9744434356689453,
"english": 0.5370181798934937,
"fineweb_edu_approx": 3.1727774143218994,
"eai_general_math": 0.5298176407814026,
"eai_open_web_math": 0.01684075966477394,
"eai_web_code": 0.3672131299972534
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13324",
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,973,519,629,074,925,000 |
Ex 7.1, 9 - Write natural numbers from 102 to 113 What fraction
Ex 7.1, 9 - Chapter 7 Class 6 Fractions - Part 2
Ex 7.1, 9 - Chapter 7 Class 6 Fractions - Part 3
Transcript
Ex 7.1, 9 Write the natural numbers from 102 to 113. What fraction of them are prime numbers? Prime numbers Numbers which have only 2 factors – 1 & the number itself Eg: 2, 3, 5, 7……. Natural numbers from 102 to 113 = Finding prime numbers 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113 Divisible by 2 Number ending with 2, 4, 6, 8, 0 are divisible by 2 So, 102, 104, 106, 108, 110, 112 are not prime. Divisible by 3 If sum of digits is divisible by 3, It is divisible by 3 So, 105, 111 are not prime Rest all numbers are not divisible by 5, 7, 11 ∴ 103, 107, 109, 113 are prime Therefore, Total numbers = 12 Number of prime numbers = 4 ∴ Fraction = 𝟒/𝟏𝟐
Go Ad-free
Davneet Singh's photo - Co-founder, Teachoo
Made by
Davneet Singh
Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 14 years. He provides courses for Maths, Science, Social Science, Physics, Chemistry, Computer Science at Teachoo.
|
{
"url": "https://www.teachoo.com/7924/2466/Ex-7.1--9/category/Ex-7.1/",
"source_domain": "www.teachoo.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "134675",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VLSAEBFSJ75OEBP5NO2FGSJGQXRCMKOY",
"WARC-Concurrent-To": "<urn:uuid:550278c1-cf1f-4c24-b3c1-b90d36c466e0>",
"WARC-Date": "2024-09-17T01:23:40Z",
"WARC-IP-Address": "52.21.227.162",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2BJBXK3DNWA4GRFRVUCGJNVG6QRPLU33",
"WARC-Record-ID": "<urn:uuid:5db8e832-75e0-4552-9978-7ac719cef51b>",
"WARC-Target-URI": "https://www.teachoo.com/7924/2466/Ex-7.1--9/category/Ex-7.1/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d40f3d07-a8ee-457b-a80e-87b7ddaff723>"
},
"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-98\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,
64,
65,
114,
163,
164,
166,
167,
168,
179,
180,
847,
848,
859,
903,
904,
912,
913,
927,
928
],
"line_end_idx": [
64,
65,
114,
163,
164,
166,
167,
168,
179,
180,
847,
848,
859,
903,
904,
912,
913,
927,
928,
1156
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1156,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16723549365997314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003412970108911395,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5017064809799194,
"rps_doc_frac_unique_words": 0.4858490526676178,
"rps_doc_mean_word_length": 4.014151096343994,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.00682594021782279,
"rps_doc_unigram_entropy": 4.391937732696533,
"rps_doc_word_count": 212,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.19506463408470154,
"rps_doc_frac_chars_dupe_6grams": 0.19506463408470154,
"rps_doc_frac_chars_dupe_7grams": 0.16451233625411987,
"rps_doc_frac_chars_dupe_8grams": 0.16451233625411987,
"rps_doc_frac_chars_dupe_9grams": 0.07520563900470734,
"rps_doc_frac_chars_top_2gram": 0.0775558203458786,
"rps_doc_frac_chars_top_3gram": 0.02350175939500332,
"rps_doc_frac_chars_top_4gram": 0.0740305483341217,
"rps_doc_books_importance": -161.41757202148438,
"rps_doc_books_importance_length_correction": -161.41757202148438,
"rps_doc_openwebtext_importance": -83.25993347167969,
"rps_doc_openwebtext_importance_length_correction": -81.23843383789062,
"rps_doc_wikipedia_importance": -65.72857666015625,
"rps_doc_wikipedia_importance_length_correction": -65.72857666015625
},
"fasttext": {
"dclm": 0.711728572845459,
"english": 0.8923673629760742,
"fineweb_edu_approx": 1.9556115865707397,
"eai_general_math": 0.9760977029800415,
"eai_open_web_math": 0.1264263391494751,
"eai_web_code": 0.0076231397688388824
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"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": "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
|
3,082,967,805,890,425,000 |
BBBCSIO
SPIPort Example Code
About the SPIPort Class
The SPIPort class writes to and reads from the one of the two SPI bus On Chip Peripheral (OCP) devices integrated into the Beaglebone Black CPU. In the Linux operating system there are two ways of accessing the SPI devices; the first, called SPIDev, is the standard and approved Linux technique. SPIDev is a device driver and if the existence of a SPI port is detected during boot time, the device driver interface will be exposed as a file in the /dev directory of the Beaglebone Black file system. The SPI ports will only be detected if that port is appropriately configured in the Device Tree.
The second type of access is called Memory Mapped access and this treats the Beaglebone Black's RAM memory as if it were a file. The SPI port is manipulated as if it were a bit at an offset in a virtual file. The BBBCSIO library does not, at this time, provide a class which utilizes Memory Mapped access to the SPI port - the file system based SPIDev class named SPIPortFS is the only one available.
There are two SPI ports on a Beaglebone Black. If these ports have been correctly configured in the Device Tree, the SPIDev device driver for that port will be accessible via a file in the /dev directory. This file will have names in the format spidev<spiport+1>.<ssline> where <spiport+1> is one greater (nobody knows why) than the number of the spi port and the <ssline> is the number of the slave select (also known as the chip select) line. Thus the file /dev/spidev1.0 is the interface for the SPIDev device driver on SPI port 0 and slave select line 0. If you do not see the spidev* file in the /dev directory this means that the SPI device is not correctly configured in the Device Tree. By the way, these files are not the sort of files you can open and write text to in order control the port (like you do with the SYSFS GPIO subsystem). The spidev files are true device files and if you want them to do anything you have to use an ioctl() call.
Each device on an SPI bus has its own enable/disable line called the Slave Select (or sometimes Chip Select) line and the Beaglebone Black functions as the SPI bus master. Each of the two OCP SPI devices on the Beaglebone Black can theoretically control up to 4 Slave Select lines, however only 2 of the lines (CS0 and CS1) are made available to the CPU's PinMux sub-system. Effectively this means that, using the SPI ports dedicated slave select lines, it is only possible to have 2 slave devices per SPI port. Even worse, it appears that the cpu pin controlling CS1 of SPI0 has not been made visible on the I/O headers by the designers of the Beaglebone Black and so the SPI0 port can only interact with one slave device if one uses the dedicated CS lines of the SPI port. Using the nomeclature of the above SPIDev device filenames, only the files /dev/spidev1.0, /dev/spidev1.1, /dev/spidev2.0 and /dev/spidev2.1 can ever be possibly be present and even then the slave select line for the /dev/spidev1.1 device (SPI0, CS1) cannot be used. However, not to worry, the SPIPortFS class has additional functionality which enables GPIO ports to be used as slave select lines and hence quite a large number of SPI bus devices are possible. In addition, be aware that the MOSI, MISO, CLK and slave select lines used by the SPI1 port are also the GPIO's used by the HDMI subsystem (just a different MuxMode). To use SPI1 you will need to disable HDMI first - which is why you will probably never see it configured in the Beaglebone Black Device Tree by default.
Please note that for the SPIPortFS class you cannot mix and match GPIO based slave select lines and the SPI ports chip select lines. If you use one GPIO based slave select line then all lines must be GPIO based on that port. This is because the chip select lines are tied to the SPIDev device file. Once the spidev* file is opened (and it needs to be in order to write anything at all to the device) the SPI port will always activate the dedicated chip select line for each write and there is no way to stop it doing this. The best you can do is ignore the dedicated chip select line (by leaving it unconnected and floating electrically) and using the GPIO based slave selects to activate each device.
Warnings - READ THIS!!!
The SPI port used in the examples below is SPI0 - this must be configured in the Device Tree in order for it to be available for use.
The second example code below uses GPIOs 48 and 49 which are exposed as pin 15 and 23 on the P9 header. You CAN NOT assume that these pins are available as GPIO's on your Beaglebone Black and even if they are GPIO's you still cannot assume they are set as GPIO outputs (as opposed to being an inputs). Any one GPIO can be used for any of about half a dozen different peripherals (UART, PWM, A/D, HDMI, EMMC etc.) and it is not a given that a GPIO used in these examples or any specific GPIO is available. The GPIO's used in these examples may be used for other things on your Beaglebone Black.
Before using a GPIO as a slave select line on any SPIPort class you will need to ensure that the GPIOs are configured as outputs in exactly the same way as if you were going to use them with one of the OutputPort classes. There is no code you can call in the BBBCSIO library which does this. You MUST configure the GPIOs externally prior to running your executable - usually this is done by editing the device tree.
The armhf Linux running on the Beaglebone Black is not a real-time operating system. However, an OCP peripheral such as the SPIPort has its own internal clock and so, once the information is given to the port, it will be transmitted and received at the configured port speed with no interruptions. However, transfers made via multiple calls to the SPI port can, and will, have variable gaps between transmissions as the process is pre-emptively swapped in and out by the kernel.
Also note it is possible to set the transmission speed for the SPI Port as a default on the port and also to specifically override that speed individually for a slave device. For the SPIPortFS class it is much faster, by a factor of about 10, to set the port speed on the port and let the slave device use it as a default than to set it individually on each device. This is true even if the slave device speed is set to the exact same speed as the global SPI port default value. There is something in the SPIDev device driver that has to activate internally on each transmission (one or more ioctl() calls probably) to override the SPI port default speed for an individual device and this is time consuming. It is far better to set the speed on the SPI port rather than the slave device unless you really need to have different speeds for each device.
There are two examples below. The first shows a write and read from a SPI slave device using the internal CS0 line. The second example illustrates the use of two GPIO base slave select lines to control two different SPI slave devices.
Example 1, SPIPort Usage to Write and Read
The code below illustrates how to use the SPIPortFS class to write and read the a memory location in a slave SPI device and to output that value to the console.
/// +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=
/// <summary>
/// Writes to and reads from an SPI port. SPIDev version. This version
/// uses the internal slave select SPI_SLAVEDEVICE_CS0 for the chip
/// select line. The SPI device being accessed is an Arduino Gameduino v1.2
/// VGA shield. At its most basic, it is read from by sending two address bytes
/// and then a follow up byte of 0x00 to clock in the byte at that address.
///
/// NOTE:
/// This code assumes that the SPI port associated with the spiID has been
/// properly configured in the device tree. If it is not
/// then the port may not work correctly. See the associated documentation
///
/// NOTE:
/// Make sure you are aware of how SPI buses work and properly
/// configure the MISO, MOSI, CLK and CS lines.
///
/// </summary>
/// <param name="spiID">The spi port ID</param>
/// <history>
/// 21 Dec 14 Cynic - Originally written
/// </history>
public void SPIPortFSTest(SPIPortEnum spiID)
{
// open the port
SPIPortFS spiPort = new SPIPortFS(spiID);
// open the slave device
SPISlaveDeviceHandle ssHandle = spiPort.EnableSPISlaveDevice(SPISlaveDeviceEnum.SPI_SLAVEDEVICE_CS0);
if (ssHandle == null)
{
throw new Exception("ssHandle == null");
}
// set the mode
spiPort.SetMode(SPIModeEnum.SPI_MODE_0);
// just for testing, get the mode, not really necessary
SPIModeEnum spiMode = spiPort.GetMode();
Console.WriteLine("spi mode=" + spiMode.ToString());
// set our speed
spiPort.SetDefaultSpeedInHz(5000000);
// set up our transmit and receive buffers
int bufLen = 3;
byte[] txByteBuf = new byte[bufLen];
byte[] rxByteBuf = new byte[bufLen];
// we wish to read the byte at address 0x0001 which is
// the Gameduino's major and minor version number
// populate the transmit buffer with data, we send
// two bytes of address and a 0x00 to clock in the
// returning information
txByteBuf[0] = 0x00;
txByteBuf[1] = 0x01;
txByteBuf[2] = 0x00;
// transfer the data
spiPort.SPITransfer(ssHandle, txByteBuf, rxByteBuf, bufLen);
// report the received data, the first two bytes will
// be random values as the Gameduino was still receiving
// the address at that time. The third byte will have
// the major and minor revision number in each nibble.
Console.Write("Received data as hex:");
for(int i=0; i < bufLen; i++)
{
Console.Write(" "+ rxByteBuf[i].ToString("x2"));
}
Console.Write("\n");
// close the port
spiPort.ClosePort();
spiPort.Dispose();
}
In the above code, the spiID is passed in when the function was called. This value is a member of the SPIPortEnum class which lists all possible SPI ports which can be present on the Beaglebone Black. The above code is called via a line which looks like:
SPIPortFSTest(SPIPortEnum.SPIPORT_0);
Example 2, SPIPort Usage with GPIO's as Slave Select Lines
The code below illustrates how to use the SPIPortFS class to use GPIO pins as slave select lines and how to write values to those devices.
/// +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=
/// <summary>
/// Writes to an SPI port. SPIDev version. This version uses two GPIO pins
/// as slave select lines for the SPI devices.
///
/// The device being written to is a Sparkfun 7-Segment Serial Display
/// which has an SPI interface but which cannot write back any information
/// on the SPI bus - it is write only. The basic mode of operation is just
/// to write the ASCII values of the four characters you wish to display
/// to the device. With two devices we have 8 digits.
///
/// NOTE:
/// This code assumes that the SPI port associated with the spiID has been
/// properly configured in the device tree. If it is not then the port
/// may not work correctly. In addition, the two GPIOs (GPIO_48 and GPIO_49)
/// must also be configured as outputs.
///
/// NOTE:
/// Make sure you are aware of how SPI buses work and properly
/// configure the MISO, MOSI, CLK and CS lines.
///
/// </summary>
/// <param name="spiID">The spi port ID</param>
/// <history>
/// 21 Dec 14 Cynic - Originally written
/// </history>
public void SPIPortFSGPOISSTest(SPIPortEnum spiID)
{
// open the port
SPIPortFS spiPort = new SPIPortFS(spiID);
// open the slave devices. We are using GPIO_48 and GPIO_49 as slave selects
// but we always have to open CS0 or CS1 in order to get access to the SPI
// device itself - but we cannot use this slave select line and it must
// not be electrically connected to anything.
SPISlaveDeviceHandle ssHandleCS1 = spiPort.EnableSPISlaveDevice(SPISlaveDeviceEnum.SPI_SLAVEDEVICE_CS1);
if (ssHandleCS1 == null)
{
throw new Exception("ssHandleCS1 == null");
}
SPISlaveDeviceHandle ssHandleGPIO48 = spiPort.EnableSPIGPIOSlaveDevice(GpioEnum.GPIO_48);
if (ssHandleGPIO48 == null)
{
throw new Exception("ssHandleGPIO48 == null");
}
SPISlaveDeviceHandle ssHandleGPIO49 = spiPort.EnableSPIGPIOSlaveDevice(GpioEnum.GPIO_49);
if (ssHandleGPIO49 == null)
{
throw new Exception("ssHandleGPIO48 == null");
}
// set the mode
spiPort.SetMode(SPIModeEnum.SPI_MODE_0);
// set our speed
spiPort.SetDefaultSpeedInHz(25000);
// set up our transmit and receive buffers
int bufLen = 4;
byte[] txByteBuf = new byte[bufLen];
byte[] rxByteBuf = new byte[bufLen];
// populate the transmit buffer with data "1234"
txByteBuf[0] = 0x31;
txByteBuf[1] = 0x32;
txByteBuf[2] = 0x33;
txByteBuf[3] = 0x34;
// NOTE that other than opening ssHandleCS1 we do not write to it. The pin
// where the CS1 appears should not be electrically attached to any SPI device
// When using GPIO based slave selects lines all SPI devices must use them
// when using the internal CS0 or CS1 lines all devices must use those. You
// cannot mix and match GPIO and CS* slave select lines.
// transfer the data to the device listening on GPIO48
spiPort.SPITransfer(ssHandleGPIO48, txByteBuf, rxByteBuf, bufLen);
// populate the transmit buffer with new data "5678"
txByteBuf[0] = 0x35;
txByteBuf[1] = 0x36;
txByteBuf[2] = 0x37;
txByteBuf[3] = 0x38;
// transmit the new data to the device listening on GPIO49
spiPort.SPITransfer(ssHandleGPIO49, txByteBuf, rxByteBuf, bufLen);
// close the port
spiPort.ClosePort();
spiPort.Dispose();
}
In the above code, the spiID is passed in when the function was called. This value is a member of the SPIPortEnum class which lists all possible SPI ports which can be present on the Beaglebone Black. The above code is called via a line which looks like:
SPIPortFSGPOISSTest(SPIPortEnum.SPIPORT_0);
|
{
"url": "http://www.ofitselfso.com/BBBCSIO/Help/BBBCSIOHelp_SPIPortExample.html",
"source_domain": "www.ofitselfso.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "18175",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NRYVLSKYH47PRR6D6NE26N5ICFR3C46P",
"WARC-Concurrent-To": "<urn:uuid:ac0be5d1-f607-4114-8619-69a0f3745fc9>",
"WARC-Date": "2017-10-20T06:51:53Z",
"WARC-IP-Address": "91.197.229.113",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KFZRYBTTUMD2ZLALTWKYDO5T43BOD4PZ",
"WARC-Record-ID": "<urn:uuid:29f95da5-42f0-4789-8d04-48ffc1e70cf8>",
"WARC-Target-URI": "http://www.ofitselfso.com/BBBCSIO/Help/BBBCSIOHelp_SPIPortExample.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:efb0af42-ac3b-4bed-a0b6-21693d6b5bf4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-166-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
8,
9,
30,
31,
33,
34,
58,
59,
656,
657,
1058,
1059,
2014,
2015,
3571,
3572,
4274,
4275,
4299,
4300,
4434,
4435,
5029,
5030,
5446,
5447,
5926,
5927,
6779,
6780,
7015,
7016,
7059,
7060,
7221,
7222,
7307,
7329,
7408,
7485,
7570,
7658,
7743,
7756,
7775,
7861,
7928,
8013,
8026,
8044,
8118,
8177,
8190,
8213,
8269,
8291,
8344,
8367,
8420,
8430,
8459,
8513,
8526,
8563,
8677,
8711,
8725,
8782,
8796,
8797,
8825,
8878,
8946,
8999,
9064,
9065,
9094,
9144,
9145,
9200,
9228,
9277,
9326,
9327,
9394,
9456,
9457,
9520,
9583,
9620,
9653,
9686,
9719,
9726,
9759,
9832,
9833,
9899,
9968,
10034,
10101,
10153,
10195,
10209,
10274,
10288,
10332,
10333,
10363,
10396,
10427,
10437,
10692,
10730,
10731,
10790,
10791,
10930,
10931,
11016,
11038,
11122,
11178,
11191,
11270,
11353,
11436,
11517,
11579,
11592,
11611,
11697,
11778,
11865,
11916,
11929,
11947,
12021,
12080,
12093,
12116,
12172,
12194,
12247,
12270,
12329,
12339,
12368,
12422,
12426,
12515,
12603,
12687,
12745,
12862,
12899,
12913,
12973,
12987,
13089,
13129,
13143,
13206,
13220,
13322,
13362,
13376,
13439,
13453,
13454,
13482,
13535,
13536,
13565,
13613,
13614,
13669,
13697,
13746,
13795,
13796,
13857,
13890,
13923,
13956,
13989,
13990,
14077,
14168,
14255,
14343,
14412,
14413,
14480,
14559,
14560,
14625,
14658,
14691,
14724,
14757,
14758,
14829,
14908,
14909,
14939,
14972,
15003,
15013,
15268,
15312,
15313
],
"line_end_idx": [
8,
9,
30,
31,
33,
34,
58,
59,
656,
657,
1058,
1059,
2014,
2015,
3571,
3572,
4274,
4275,
4299,
4300,
4434,
4435,
5029,
5030,
5446,
5447,
5926,
5927,
6779,
6780,
7015,
7016,
7059,
7060,
7221,
7222,
7307,
7329,
7408,
7485,
7570,
7658,
7743,
7756,
7775,
7861,
7928,
8013,
8026,
8044,
8118,
8177,
8190,
8213,
8269,
8291,
8344,
8367,
8420,
8430,
8459,
8513,
8526,
8563,
8677,
8711,
8725,
8782,
8796,
8797,
8825,
8878,
8946,
8999,
9064,
9065,
9094,
9144,
9145,
9200,
9228,
9277,
9326,
9327,
9394,
9456,
9457,
9520,
9583,
9620,
9653,
9686,
9719,
9726,
9759,
9832,
9833,
9899,
9968,
10034,
10101,
10153,
10195,
10209,
10274,
10288,
10332,
10333,
10363,
10396,
10427,
10437,
10692,
10730,
10731,
10790,
10791,
10930,
10931,
11016,
11038,
11122,
11178,
11191,
11270,
11353,
11436,
11517,
11579,
11592,
11611,
11697,
11778,
11865,
11916,
11929,
11947,
12021,
12080,
12093,
12116,
12172,
12194,
12247,
12270,
12329,
12339,
12368,
12422,
12426,
12515,
12603,
12687,
12745,
12862,
12899,
12913,
12973,
12987,
13089,
13129,
13143,
13206,
13220,
13322,
13362,
13376,
13439,
13453,
13454,
13482,
13535,
13536,
13565,
13613,
13614,
13669,
13697,
13746,
13795,
13796,
13857,
13890,
13923,
13956,
13989,
13990,
14077,
14168,
14255,
14343,
14412,
14413,
14480,
14559,
14560,
14625,
14658,
14691,
14724,
14757,
14758,
14829,
14908,
14909,
14939,
14972,
15003,
15013,
15268,
15312,
15313,
15314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15314,
"ccnet_original_nlines": 212,
"rps_doc_curly_bracket": 0.0009141999762505293,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3739779591560364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050479911267757416,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20689654350280762,
"rps_doc_frac_unique_words": 0.23233255743980408,
"rps_doc_mean_word_length": 4.797690391540527,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.325311183929443,
"rps_doc_word_count": 2165,
"rps_doc_frac_chars_dupe_10grams": 0.12804466485977173,
"rps_doc_frac_chars_dupe_5grams": 0.23134687542915344,
"rps_doc_frac_chars_dupe_6grams": 0.19081543385982513,
"rps_doc_frac_chars_dupe_7grams": 0.15326851606369019,
"rps_doc_frac_chars_dupe_8grams": 0.15326851606369019,
"rps_doc_frac_chars_dupe_9grams": 0.13613170385360718,
"rps_doc_frac_chars_top_2gram": 0.012708189897239208,
"rps_doc_frac_chars_top_3gram": 0.011552900075912476,
"rps_doc_frac_chars_top_4gram": 0.012130550108850002,
"rps_doc_books_importance": -1435.649658203125,
"rps_doc_books_importance_length_correction": -1435.649658203125,
"rps_doc_openwebtext_importance": -745.059326171875,
"rps_doc_openwebtext_importance_length_correction": -745.059326171875,
"rps_doc_wikipedia_importance": -559.1770629882812,
"rps_doc_wikipedia_importance_length_correction": -559.1770629882812
},
"fasttext": {
"dclm": 0.06955593824386597,
"english": 0.8714326024055481,
"fineweb_edu_approx": 2.9063832759857178,
"eai_general_math": 0.826491117477417,
"eai_open_web_math": 0.207136869430542,
"eai_web_code": 0.8536837697029114
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,846,960,200,555,476,000 |
MentoringManagement
Not logged in - Log In / Register
This document describes an obsolete feature. Mentoring was removed in late September 2009
Executive summary
Launchpad now gives you a simple but effective framework to manage mentorship within your free software community. You can:
Introduction to the Launchpad Mentoring System
Launchpad helps you arrange mentoring within your community. Many open source communities want to provide a simple way to guide new participants towards work that will be a useful contribution and for which mentoring is available, and the Launchpad mentoring system is designed to deliver exactly this capability. It allows existing members of the community to indicate which bugs or blueprints they are willing to provide some mentorship for, and then creates lists of these items organised by project and by team. It makes for a very lightweight but useful framework to which newcomers can be pointed.
First, let's clarify some useful concepts and terminology.
That's all you need to know about Launchpad in order to use the mentoring system.
Offering mentorship
Anybody who is a member of at least one team can offer mentorship.
Why do you need to be a member of a team? Well, each offer of mentorship is associated with a team that will benefit most by having that particular bug fixed, or blueprint implemented. When you make the offer to mentor someone trying to do this work, you choose which of the teams you participate in as the "beneficiary". For that reason, only people who participate in a team can offer to provide mentorship.
So, first make sure that you are actually a member of a team. Login to Launchpad and click on your name in the top-right corner of any page in the system - you will go to your own home page. You may have to click on the "Overview" tab in order to see a summary of your account. Are you a member of one or more teams? If so, perfect, you can offer mentorship to people who wish to become members of those same teams.
Now find a bug or a blueprint which you think is a good candidate for mentorship. This means that:
1. it's a relatively straightforward piece of work for someone who wants to be a member of one of your teams.
2. you know how it should be done, and are confident that if its done that way the work will actually be accepted by the relevant project, rather than being rejected and discouraging the person from contributing further.
3. you are willing to be responsive to questions from someone trying to do the work.
4. you think it is relevant work to one of the teams of which you are a member.
If the bug or blueprint is not yet implemented or fixed, you will see a link on the page to "Offer mentorship". Click on the link, and you will be presented with a very simple form. Choose the team in which you participate and which you think will most benefit by this work being done, or for which you think this work would be a very good "entrance test", and click "Continue".
That's it! Your name will appear on the bug or blueprint page as a mentor, so people can contact you directly to discuss the work further. Also, your offer will show up on the relevant project mentorship page. See, for example, the Ubuntu mentorship offers page. On your own Launchpad home page, you will see a link to a page that lists all the offers of mentorship you are currently extending.
Retracting offers of mentorship
If you are unable to meet the commitment of mentorship, it would be best to retract your offer.
Go to the page of the bug or blueprint concerned. Your name should be in the list of mentors on the page. In the actions menu you will see a link to "Retract mentoring". Click on this, and then confirm your decision by clicking on the "Retrack" button presented to you.
When you retract an offer of mentoring it will disappear immediately from all the lists where it was previously displayed.
Note that you can only retract such an offer while the bug or blueprint is incomplete. Once the bug is completely fixed, or the blueprint is implemented, you can't make or retract an offer of mentorship.
Completed items
Listings of mentorship offers include only those items which are currently incomplete. As bugs get fixed and blueprints get implemented the corresponding offers of mentorship are automatically removed from the relevant listings. A listing only includes unfinished items where work will make a real contribution.
Project listings
You can see the offers of mentoring that are relevant to any project, distribution or group of projects in Launchpad. For example, here is a list of mentoring relevant to the Ubuntu project and another one that shows mentoring relevant to the Bazaar version control system.
Note that a bug can be associated with multiple projects, because the same code might be used in multiple places. For example, a bug in an upstream project might also show up in an Ubuntu package and a Gentoo package, and so mentorship for that bug would be relevant to the upstream, to Ubuntu and to Gentoo. For this reason, mentoring offers on these bugs can show up in multiple places.
Team mentoring
Each offer of mentorship is associated with a particular team. Multiple people can all offer to mentor someone working on the same bug or blueprint, and each of them can "assign" that mentorship to be relevant to a different team, of which they are a member. The net result is that the same item of work can show up in the listings for multiple teams. That's fine! in fact, we'd urge you to encourage people to offer to mentor any bug or blueprint they think they can provide a good level of feedback on to make it as easy as possible for newcomers to the community to start making a real contribution.
MentoringManagement (last edited 2009-10-08 18:14:58 by pool-71-178-242-15)
|
{
"url": "https://help.launchpad.net/MentoringManagement",
"source_domain": "help.launchpad.net",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "20436",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OQ5RB2CHVECHL6WDOU3Z54U6LYHE76W2",
"WARC-Concurrent-To": "<urn:uuid:a48b2fe0-f516-4ee5-b5f6-208446e32b47>",
"WARC-Date": "2022-12-03T12:42:30Z",
"WARC-IP-Address": "91.189.91.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z3Y6TJIKEEXMJXE3SGXYNX6USDBXJ4HV",
"WARC-Record-ID": "<urn:uuid:30d9bbf8-ab7e-433f-b246-6297a727346f>",
"WARC-Target-URI": "https://help.launchpad.net/MentoringManagement",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a7014dc-f703-42be-9ce9-e07b85be3e3b>"
},
"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-177\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
23,
24,
58,
59,
149,
150,
168,
169,
293,
294,
341,
342,
946,
947,
1006,
1007,
1089,
1090,
1110,
1111,
1178,
1179,
1589,
1590,
2006,
2007,
2106,
2107,
2219,
2442,
2529,
2611,
2612,
2991,
2992,
3387,
3388,
3420,
3421,
3517,
3518,
3788,
3789,
3912,
3913,
4117,
4118,
4134,
4135,
4447,
4448,
4465,
4466,
4740,
4741,
5130,
5131,
5146,
5147,
5750,
5751
],
"line_end_idx": [
2,
3,
23,
24,
58,
59,
149,
150,
168,
169,
293,
294,
341,
342,
946,
947,
1006,
1007,
1089,
1090,
1110,
1111,
1178,
1179,
1589,
1590,
2006,
2007,
2106,
2107,
2219,
2442,
2529,
2611,
2612,
2991,
2992,
3387,
3388,
3420,
3421,
3517,
3518,
3788,
3789,
3912,
3913,
4117,
4118,
4134,
4135,
4447,
4448,
4465,
4466,
4740,
4741,
5130,
5131,
5146,
5147,
5750,
5751,
5826
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5826,
"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.5078125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0008680599858053029,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1215277835726738,
"rps_doc_frac_unique_words": 0.2967359125614166,
"rps_doc_mean_word_length": 4.592482566833496,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.982047080993652,
"rps_doc_word_count": 1011,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04479862004518509,
"rps_doc_frac_chars_dupe_6grams": 0.023691579699516296,
"rps_doc_frac_chars_dupe_7grams": 0.01636872999370098,
"rps_doc_frac_chars_dupe_8grams": 0.01636872999370098,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02067629061639309,
"rps_doc_frac_chars_top_3gram": 0.018091749399900436,
"rps_doc_frac_chars_top_4gram": 0.014645700342953205,
"rps_doc_books_importance": -583.6400756835938,
"rps_doc_books_importance_length_correction": -583.6400756835938,
"rps_doc_openwebtext_importance": -353.5788269042969,
"rps_doc_openwebtext_importance_length_correction": -353.5788269042969,
"rps_doc_wikipedia_importance": -210.6343536376953,
"rps_doc_wikipedia_importance_length_correction": -210.6343536376953
},
"fasttext": {
"dclm": 0.039803680032491684,
"english": 0.9536386728286743,
"fineweb_edu_approx": 1.461619257926941,
"eai_general_math": 0.3025892972946167,
"eai_open_web_math": 0.12375569343566895,
"eai_web_code": 0.6292862892150879
}
}
|
{
"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.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,068,838,386,387,987,000 |
Who Needs Architects? Because YAGNI Doesn’t Scale
If you choose not to decide
You still have made a choice
Rush – “Free Will”
Bumper sticker philosophies (sayings that are short, pithy, attractive to some, and so lacking in nuance as to be dangerous) are pet peeves of mine. YAGNI (“You Ain’t Gonna Need It”) is right at the top of my list. I find it particularly dangerous because it contains a kernel of truth, but expressed in a manner that makes it very easy to get in trouble. This is particularly the case when it’s paired with other ones like “the simplest thing that could possibly work” and “defer decisions to the last responsible moment”.
Much has already been written (including some from me) about why it’s a bad idea to implement speculative features just because you think you might need them. The danger there is so easy to see that it’s not worth reiterating here. What some seem to miss, however, is that there is a difference in implementing something you think you might need and implementing something that you know (or should know) you will need. This is where “the simplest thing that could possibly work” can cause problems.
In his post “Yagni”, Martin Fowler detailed a scenario where there’s a temptation to implement features that are planned for the future but not yet ready to be used by customers:
Let’s imagine I’m working with a startup in Minas Tirith selling insurance for the shipping business. Their software system is broken into two main components: one for pricing, and one for sales. The dependencies are such that they can’t usefully build sales software until the relevant pricing software is completed.
At the moment, the team is working on updating the pricing component to add support for risks from storms. They know that in six months time, they will need to also support pricing for piracy risks. Since they are currently working on the pricing engine they consider building the presumptive feature [2] for piracy pricing now, since that way the pricing service will be complete before they start working on the sales software.
Even knowing that a feature is planned is not enough to jump the gun and implement it ahead of time. As Fowler points out, there are carrying costs and opportunity costs involved in doing so, not to mention the risk that the feature drops off the radar or its details change. That being said, there is a difference between prudently waiting to implement the feature until it’s time and ignoring it altogether:
Now we understand why yagni is important we can dig into a common confusion about yagni. Yagni only applies to capabilities built into the software to support a presumptive feature, it does not apply to effort to make the software easier to modify. Yagni is only a viable strategy if the code is easy to modify, so expending effort on refactoring isn’t a violation of yagni because refactoring makes the code more malleable. Similar reasoning applies for practices like SelfTestingCode and ContinuousDelivery. These are enabling practices for evolutionary design, without them yagni turns from a beneficial practice into a curse.
In other words, while it makes sense to defer the implementation of the planned feature, it’s also smart to insure that there’s sufficient flexibility in the design so that the upcoming feature won’t cause refactoring to the extent that it’s almost a rewrite. Deferring the decision to do necessary work now is a decision to incur unnecessary rework later. Likewise, techniques implemented to ameliorate failure (circuit breakers in distributed systems, feature flags, etc.) should not be given the YAGNI treatment, even when you hope they’re never needed. The “simplest thing that could possibly work” may well be completely inadequate for the messy world the system inhabits.
It’s probably impossible to architect a system that is perfect, since the definition of perfection changes. It is possible, however, to architect systems that deal gracefully with change. That requires thought, not adherence to simplistic slogans.
Advertisements
6 thoughts on “Who Needs Architects? Because YAGNI Doesn’t Scale
1. Pingback: Who Needs Architects? Because Complexity Emerges | Form Follows Function
2. Pingback: Who Needs Architects? Because YAGNI Doesn't Sca...
3. Pingback: Form Follows Function on SPaMCast 357 | Form Follows Function
4. Pingback: Who Needs Architects? Well, Nobody Needs this Kind | Form Follows Function
5. Pingback: Form Follows Function on SPaMCast 361 | Form Follows Function
6. Pingback: Let’s Talk Value (Who Needs Architects?) | Form Follows Function
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 )
w
Connecting to %s
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://genehughson.wordpress.com/2015/07/31/who-needs-architects-because-yagni-doesnt-scale/",
"source_domain": "genehughson.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "94808",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I2MPL4US3E76BYWS6N75YDGEZION5PME",
"WARC-Concurrent-To": "<urn:uuid:217deeea-dcbf-4eb3-b0b1-28ec23d53cfd>",
"WARC-Date": "2018-06-18T11:39:11Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TT7K2ZAIJRXWH4U2U2FG3X7VLELJ6VY4",
"WARC-Record-ID": "<urn:uuid:b125032f-359f-4160-a8da-432182c81ba0>",
"WARC-Target-URI": "https://genehughson.wordpress.com/2015/07/31/who-needs-architects-because-yagni-doesnt-scale/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e221cd03-7145-4922-b829-ef7dff3de369>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-91-167-62.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,
50,
51,
79,
108,
109,
128,
129,
653,
654,
1153,
1154,
1333,
1334,
1652,
1653,
2083,
2084,
2494,
2495,
3125,
3126,
3804,
3805,
4053,
4054,
4069,
4070,
4135,
4136,
4224,
4225,
4291,
4292,
4369,
4370,
4460,
4461,
4538,
4539,
4619,
4620,
4634,
4635,
4690,
4691,
4710,
4711,
4784,
4785,
4799,
4800,
4867,
4868,
4884,
4885,
4952,
4953,
4968,
4969,
5037,
5038,
5040,
5041,
5058,
5059
],
"line_end_idx": [
50,
51,
79,
108,
109,
128,
129,
653,
654,
1153,
1154,
1333,
1334,
1652,
1653,
2083,
2084,
2494,
2495,
3125,
3126,
3804,
3805,
4053,
4054,
4069,
4070,
4135,
4136,
4224,
4225,
4291,
4292,
4369,
4370,
4460,
4461,
4538,
4539,
4619,
4620,
4634,
4635,
4690,
4691,
4710,
4711,
4784,
4785,
4799,
4800,
4867,
4868,
4884,
4885,
4952,
4953,
4968,
4969,
5037,
5038,
5040,
5041,
5058,
5059,
5139
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5139,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4056224822998047,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007028109859675169,
"rps_doc_frac_lines_end_with_ellipsis": 0.015151520259678364,
"rps_doc_frac_no_alph_words": 0.15863454341888428,
"rps_doc_frac_unique_words": 0.4740024209022522,
"rps_doc_mean_word_length": 4.995163440704346,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0010040199849754572,
"rps_doc_unigram_entropy": 5.440810203552246,
"rps_doc_word_count": 827,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11643669754266739,
"rps_doc_frac_chars_dupe_6grams": 0.07020092010498047,
"rps_doc_frac_chars_dupe_7grams": 0.018881630152463913,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018639549612998962,
"rps_doc_frac_chars_top_3gram": 0.03219559043645859,
"rps_doc_frac_chars_top_4gram": 0.02033405937254429,
"rps_doc_books_importance": -440.5676574707031,
"rps_doc_books_importance_length_correction": -440.5676574707031,
"rps_doc_openwebtext_importance": -241.4228515625,
"rps_doc_openwebtext_importance_length_correction": -241.4228515625,
"rps_doc_wikipedia_importance": -176.2523651123047,
"rps_doc_wikipedia_importance_length_correction": -176.2523651123047
},
"fasttext": {
"dclm": 0.05080223083496094,
"english": 0.9300137758255005,
"fineweb_edu_approx": 1.6845943927764893,
"eai_general_math": 0.00454962020739913,
"eai_open_web_math": 0.2053505778312683,
"eai_web_code": 0.000133039997308515
}
}
|
{
"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.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
67,563,755,612,291,600 |
PC 및 모바일
BIOS 가이드: CPU 오버클럭 방법
PC를 켜고 전원 켜기 화면이 나타나면 해당 키를 눌러 BIOS 설정에 액세스할 수 있습니다. 이것은 일반적으로 "삭제" 키이지만 일부 시스템에서는 기능 키 중 하나를 대신 사용합니다. 무엇을 눌러야 할지 잘 모르겠다면 정보가 여기에 간략하게 표시되는 경우가 많으니 화면을 주시하세요.
BIOS 가이드: CPU 오버클럭 방법
거의 모든 PC는 아래에서 볼 수 있는 것과 유사한 BIOS 인터페이스를 제공하지만 정확한 레이아웃과 사용되는 용어는 마더보드마다 다릅니다. 우리의 예를 정확히 따를 수 없다면 마더보드와 함께 제공된 설명서를 참조하십시오.
여기에서 보여드리는 오버클러킹 설정은 일반적으로 데스크탑 마더보드에서만 사용할 수 있습니다. 랩톱에서는 다양한 BIOS 설정을 구성할 수 있지만 일반적으로 오버클러킹은 사용할 수 없습니다. CPU 및 보드 조합에 따라 표시되는 모든 설정을 사용할 수 없거나 효과가 없을 수 있습니다.
의도하지 않은 설정을 변경하면 언제든지 BIOS를 종료하고 변경 사항을 취소하거나 기본 설정으로 되돌릴 수 있습니다. 자세한 내용은 202호의 첨부된 기능을 참조하십시오. PC 프로 잡지.
AMD BIOS: 메인 메뉴
AMD BIOS: 메인 메뉴
이것은 MSI 소켓 AM3 마더보드의 기본 BIOS 메뉴입니다. 이와 같은 보드에서 "Cell Menu"를 선택하고 Return 키를 눌러 오버클러킹에 사용되는 설정에 액세스할 수 있습니다. 다른 제조업체의 보드에서는 옵션이 "CPU 설정", "주파수 제어", "Ai Tweaker" 또는 "MB Intelligent Tweaker"와 같이 다른 이름을 가질 수 있습니다.
AMD 바이오스: CPU 설정
AMD 바이오스: CPU 설정
여기에서 다양한 CPU 설정을 볼 수 있습니다. 상단에는 현재 적용된 설정(기본 클럭 200MHz 및 승수 18, CPU 주파수 3.6GHz 제공)을 보여주는 요약이 있습니다. 승수는 여기에서 "비율"이라고 하며 기본적으로 CPU에서 허용하는 가장 빠른 승수를 선택하는 "자동"으로 설정됩니다.
AMD BIOS: 승수 옵션
AMD BIOS: 승수 옵션
"자동" 설정을 선택하면(아래로 이동하고 Return 키를 눌러) 다양한 옵션을 볼 수 있습니다. 이 예에서는 4GHz의 유효 속도를 위해 승수를 20으로 변경합니다. 잠금 해제된 칩을 사용하면 이 수치를 원하는 만큼 높일 수 있습니다. 이 보드는 5GHz를 초과하는 속도를 지원하지만 어떤 CPU도 이 속도로 안정적으로 실행될 가능성은 거의 없습니다. CPU가 잠금 해제되지 않은 경우 승수는 기본 설정 이상으로 올라가지 않습니다. BIOS에서 더 높은 설정을 지정할 수 있지만 효과가 없습니다.
AMD BIOS: 새로운 CPU 주파수
AMD BIOS: 새로운 CPU 주파수
선택한 승수를 선택하고 Return 키를 눌렀습니다. 이제 CPU 설정 페이지로 돌아갑니다. 커서 아래의 그림은 새 CPU 주파수가 될 것임을 보여줍니다. 페이지 상단의 숫자는 변경되지 않았습니다. 새 설정은 변경 사항을 저장하고 BIOS를 종료할 때만 적용됩니다. 새 설정을 시도하려면 지금 수행할 수 있습니다(키 명령은 화면 하단에 표시됨). 실수한 경우 변경 사항을 저장하지 않고 BIOS를 종료하기만 하면 삭제됩니다.
AMD BIOS: 기본 클럭
AMD BIOS: 기본 클럭
CPU가 잠겨 있으면 승수 대신 기본 클럭을 올릴 수 있습니다. 이 보드에서 기본 클럭은 FSB(전면 버스)라고 합니다. 일반 승수 설정인 18로 돌아갔지만 기본 클럭을 20MHz(10% 증가) 높였습니다. 이것은 우리에게 3,960MHz의 효과적인 CPU 속도를 제공하지만 NB(노스 브리지) 주파수를 10%까지 높입니다. AMD 보드에서 HyperTransport라고 하는 노스 브리지는 CPU를 메모리 및 그래픽 카드와 같은 고속 구성 요소에 연결하는 것입니다. 2.0GHz만 실행하도록 설계되었으므로 이러한 방식으로 오버클럭하면 문제가 발생할 수 있습니다.
AMD BIOS: 노스 브리지 승수
AMD BIOS: 노스 브리지 승수
우리는 노스 브리지 승수를 줄임으로써 이를 보상할 수 있습니다. 일반적으로 이 버스는 기본 클럭의 10배 속도로 실행되지만 CPU 배율을 변경한 것과 같은 방식으로 해당 배율을 변경할 수 있습니다. 9x로 낮추면 CPU 주파수를 4GHz에 가깝게 유지하면서 의도한 2GHz 속도에 매우 근접할 수 있습니다. 이 작업을 완료하면 BIOS를 종료하고 새 설정을 시도할 수 있습니다.
인텔 BIOS: 주 메뉴
인텔 BIOS: 주 메뉴
Gigabyte Sandy Bridge 마더보드의 메인 BIOS 화면입니다. 이와 같은 보드에서 "MB Intelligent Tweaker"를 선택하고 Return 키를 눌러 오버클러킹에 사용되는 설정에 액세스할 수 있습니다. 다른 제조업체의 보드에서 옵션은 "CPU 설정", "주파수 제어", "Ai Tweaker" 또는 위와 같이 "셀 메뉴"와 같이 다른 이름을 가질 수 있습니다.
인텔 BIOS: 주 메뉴
인텔 BIOS: 주 메뉴
Gigabyte Sandy Bridge 마더보드의 메인 BIOS 화면입니다. 이와 같은 보드에서 "MB Intelligent Tweaker"를 선택하고 Return 키를 눌러 오버클러킹에 사용되는 설정에 액세스할 수 있습니다. 다른 제조업체의 보드에서 옵션은 "CPU 설정", "주파수 제어", "Ai Tweaker" 또는 위와 같이 "셀 메뉴"와 같이 다른 이름을 가질 수 있습니다.
인텔 BIOS: CPU 설정
인텔 BIOS: CPU 설정
변경하려는 설정은 주파수 설정입니다. 마더보드가 CPU 메뉴에 직접 표시하지 않는 경우 여기와 같이 하위 메뉴에 있을 수 있습니다. 이 페이지에서 100MHz의 기본 클럭을 포함하여 현재 CPU 설정 중 일부를 볼 수도 있습니다(실제로는 매우 약간 낮지만 중요하지 않음).
인텔 BIOS: 고급 주파수 설정
인텔 BIOS: 고급 주파수 설정
고급 주파수 설정 페이지에서 CPU의 기본 속도가 100MHz의 기본 클록에서 33의 승수로 설정되어 3.3GHz의 유효 주파수를 제공하는 것을 볼 수 있습니다. Turbo Boost가 있는 Intel 프로세서에서는 CPU 코어 설정으로 이동하여 승수 설정을 찾아야 할 수 있습니다. 오래된 칩에서는 승수를 직접 변경할 수 있습니다.
인텔 BIOS: 승수 조정
인텔 BIOS: 승수 조정
샘플 CPU는 Turbo Boost를 사용합니다. 따라서 사용 중인 코어 수에 따라 다른 승수를 적용합니다. 여기에서 1, 2, 3, 4 코어를 사용할 때 사용할 최대 승수를 선택할 수 있습니다. 또한 전력 제한을 설정할 수 있습니다. 이 제한은 CPU가 전력 소비와 발열을 유지하기 위해 자동으로 자체 속도를 줄이기 전에 이러한 코어가 얼마나 열심히 작동할 수 있는지를 결정합니다.
인텔 BIOS: 기본 클럭 조정
인텔 BIOS: 기본 클럭 조정
승수 대신 기본 클럭을 조정하려면 기본 주파수 설정 페이지에서 조정할 수 있습니다. 이 보드를 사용하면 미세 조정을 위해 0.1MHz 간격으로 기본 클럭(줄여서 BCLK)을 조정할 수 있습니다. 그러나 Sandy Bridge 보드에서 이것을 수정하는 것은 권장하지 않습니다. CPU뿐만 아니라 오버클럭된 경우 제대로 작동하지 않을 다른 많은 구성 요소에 영향을 미치기 때문입니다.
변경 사항에 만족하면 BIOS를 종료하고 설정을 저장하여 시도해 볼 수 있습니다. 주요 명령은 화면 하단에 표시됩니다.
|
{
"url": "https://hikaricreative.net/1539-bios-guide-how-to-overclock-your-cpu",
"source_domain": "hikaricreative.net",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "49542",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P6WZWS3Q4NPBLJCGX4HCQGHYLS6IJVHY",
"WARC-Concurrent-To": "<urn:uuid:908e17eb-1b60-406c-ac3c-20008381fc9c>",
"WARC-Date": "2021-12-06T02:52:35Z",
"WARC-IP-Address": "172.67.180.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4ATIRM2USFKF6ONS4LBOKAUZOX5WOUGF",
"WARC-Record-ID": "<urn:uuid:f1f45669-4e2b-4460-807a-e0384a4df8a0>",
"WARC-Target-URI": "https://hikaricreative.net/1539-bios-guide-how-to-overclock-your-cpu",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:389b977d-685b-4294-88a2-fdfe9c6587ac>"
},
"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-155\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,
9,
10,
32,
33,
193,
194,
216,
217,
342,
343,
502,
503,
609,
610,
626,
627,
643,
644,
853,
854,
871,
872,
889,
890,
1055,
1056,
1072,
1073,
1089,
1090,
1369,
1370,
1392,
1393,
1415,
1416,
1654,
1655,
1671,
1672,
1688,
1689,
2005,
2006,
2026,
2027,
2047,
2048,
2260,
2261,
2275,
2276,
2290,
2291,
2507,
2508,
2522,
2523,
2537,
2538,
2754,
2755,
2771,
2772,
2788,
2789,
2942,
2943,
2962,
2963,
2982,
2983,
3170,
3171,
3186,
3187,
3202,
3203,
3418,
3419,
3437,
3438,
3456,
3457,
3670,
3671
],
"line_end_idx": [
9,
10,
32,
33,
193,
194,
216,
217,
342,
343,
502,
503,
609,
610,
626,
627,
643,
644,
853,
854,
871,
872,
889,
890,
1055,
1056,
1072,
1073,
1089,
1090,
1369,
1370,
1392,
1393,
1415,
1416,
1654,
1655,
1671,
1672,
1688,
1689,
2005,
2006,
2026,
2027,
2047,
2048,
2260,
2261,
2275,
2276,
2290,
2291,
2507,
2508,
2522,
2523,
2537,
2538,
2754,
2755,
2771,
2772,
2788,
2789,
2942,
2943,
2962,
2963,
2982,
2983,
3170,
3171,
3186,
3187,
3202,
3203,
3418,
3419,
3437,
3438,
3456,
3457,
3670,
3671,
3737
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3737,
"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,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08932039141654968,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8650485277175903,
"rps_doc_frac_unique_words": 0.5029308199882507,
"rps_doc_mean_word_length": 6.679953098297119,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5333147048950195,
"rps_doc_word_count": 853,
"rps_doc_frac_chars_dupe_10grams": 0.13373112678527832,
"rps_doc_frac_chars_dupe_5grams": 0.19024218618869781,
"rps_doc_frac_chars_dupe_6grams": 0.14566515386104584,
"rps_doc_frac_chars_dupe_7grams": 0.13952264189720154,
"rps_doc_frac_chars_dupe_8grams": 0.13373112678527832,
"rps_doc_frac_chars_dupe_9grams": 0.13373112678527832,
"rps_doc_frac_chars_top_2gram": 0.058968059718608856,
"rps_doc_frac_chars_top_3gram": 0.017199020832777023,
"rps_doc_frac_chars_top_4gram": 0.021060019731521606,
"rps_doc_books_importance": -424.701904296875,
"rps_doc_books_importance_length_correction": -424.701904296875,
"rps_doc_openwebtext_importance": -259.9507141113281,
"rps_doc_openwebtext_importance_length_correction": -259.9507141113281,
"rps_doc_wikipedia_importance": -209.2596435546875,
"rps_doc_wikipedia_importance_length_correction": -209.2596435546875
},
"fasttext": {
"dclm": 0.9603962898254395,
"english": 0.000010120000297320075,
"fineweb_edu_approx": 2.8133862018585205,
"eai_general_math": 0.000006440000106522348,
"eai_open_web_math": 0.0408739410340786,
"eai_web_code": 0.7031453251838684
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,030,224,791,377,655,000 |
Features / Supported Formats /
Converting JPC to XPM
JPC is a successor or the JPEG format and provides a series of additional features, such as more color depths and color spaces. JPC is also known as a JPEG2000, being part of a larger group of formats that bring various upgrades to the original JPEG format, including J2C, JPM or J2K.
The XPM (X PixMap) format serves primarily at creating icon or cursor pixmaps in the X Windows System. It was created in 1989 using the XBM syntax which is shaped in the C programming language. XPMs store black-and-white, gray-scale or color images and can be easily edited with any text editor.
So, how to change JPC into XPM?
The quick and simple way to handle your files is to get a quality piece of software, such as reaConverter. Although it is fast, this software is extremely efficient in managing a wide range of conversions. As you will soon realize, reaConverter will help you avoid spending countless hours trying to figure out how to convert JPCs. But at the same time, it will allow you to apply a wide range of editing options.
Download and Install reaConverter
reaConverter is quick to download, install and launch, and you don't need to be an IT specialist in order to understand in a few minutes how it operates.
reaConverter
Install reaConverter
Load JPC Files
Start reaConverter and load all the .jpc files you intend to convert into .xpm because, as opposed to most free online converters, reaConverter supports batch conversion. So you can save the time and energy you would lose with doing repetitive operations.
Select JPCs from a folder or by drag-and-dropping them directly into the reaConverter window.
Choose Output Folder
Go to the Saving options tab and decide where you want to save new .xpm files. You can also spend a few more moments to apply additional editing to the images prepared for conversion.
Select XPM as Output Format
Then pick the XPM as output format. To help you do this, a series of buttons is conveniently placed at the bottom of the reaConverter window, so you can simply press on the one you need or click Plus button to add new options.
Then simply press the Start button and your conversion will begin in no time!
Try Free Trial Version
Video tutorial
Command-line interface
Advanced users can convert JPC to XPM via command-line interface in manual or automated mode. You are welcome to contact our technical support when you have any questions about reaConverter.
Download reaConverter Pro with CLI
Share
reaConverter
Highly efficient batch JPC to XPM converter that makes it easy to handle huge number of files and folders in a few simple operations.
Try for Free!
|
{
"url": "https://www.reaconverter.com/convert/jpc_to_xpm.html",
"source_domain": "www.reaconverter.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "14206",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MRZEEVTNV22PVNS6LZNHGRIWBL7MSPIH",
"WARC-Concurrent-To": "<urn:uuid:554a54a0-65b7-477b-a7fa-176889981cdc>",
"WARC-Date": "2019-05-21T17:58:21Z",
"WARC-IP-Address": "104.131.160.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BOA4LYQXP2J2KSXA23UXNASTZOZP4BNJ",
"WARC-Record-ID": "<urn:uuid:ec2cddfc-39d4-4451-8f34-b8546ba2a32a>",
"WARC-Target-URI": "https://www.reaconverter.com/convert/jpc_to_xpm.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13b4dd92-3fcf-4791-adef-14577627f1a8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-171-192-21.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,
35,
36,
58,
59,
344,
345,
641,
642,
674,
675,
1089,
1090,
1124,
1125,
1279,
1280,
1293,
1314,
1315,
1330,
1331,
1587,
1588,
1682,
1683,
1704,
1705,
1889,
1890,
1918,
1919,
2146,
2147,
2225,
2226,
2249,
2250,
2265,
2266,
2289,
2290,
2481,
2482,
2517,
2518,
2524,
2525,
2538,
2539,
2673,
2674
],
"line_end_idx": [
35,
36,
58,
59,
344,
345,
641,
642,
674,
675,
1089,
1090,
1124,
1125,
1279,
1280,
1293,
1314,
1315,
1330,
1331,
1587,
1588,
1682,
1683,
1704,
1705,
1889,
1890,
1918,
1919,
2146,
2147,
2225,
2226,
2249,
2250,
2265,
2266,
2289,
2290,
2481,
2482,
2517,
2518,
2524,
2525,
2538,
2539,
2673,
2674,
2687
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2687,
"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.39768341183662415,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.050193049013614655,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10617761313915253,
"rps_doc_frac_unique_words": 0.49561405181884766,
"rps_doc_mean_word_length": 4.708333492279053,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.971653461456299,
"rps_doc_word_count": 456,
"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.006986489985138178,
"rps_doc_frac_chars_top_3gram": 0.011178390122950077,
"rps_doc_frac_chars_top_4gram": 0.011178390122950077,
"rps_doc_books_importance": -214.98060607910156,
"rps_doc_books_importance_length_correction": -214.98060607910156,
"rps_doc_openwebtext_importance": -125.22431182861328,
"rps_doc_openwebtext_importance_length_correction": -125.22431182861328,
"rps_doc_wikipedia_importance": -107.46440124511719,
"rps_doc_wikipedia_importance_length_correction": -107.46440124511719
},
"fasttext": {
"dclm": 0.03140192851424217,
"english": 0.9018885493278503,
"fineweb_edu_approx": 1.563664436340332,
"eai_general_math": 0.14762228727340698,
"eai_open_web_math": 0.11603950709104538,
"eai_web_code": 0.021306749433279037
}
}
|
{
"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": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
9,112,951,946,005,714,000 |
Take the 2-minute tour ×
Ask Ubuntu is a question and answer site for Ubuntu users and developers. It's 100% free, no registration required.
I was playing around in Unity 2D, and I messed up my configuration. How can I reset it, preferably without losing other config files? (such as Empathy config, Firefox/Chrome config, etc)
share|improve this question
@type: That restarts - I want to reset. For Unity, a simple unity --reset will do the trick - I want the equivalent for Unity 2D. – jrg Sep 9 '11 at 18:49
@jrg - can you clarify what you mean "messed up my configuration" - what is wrong? Can you post a picture in your question? – fossfreedom Sep 9 '11 at 21:49
@fossfreedom It's a hypothetical question - similar to How do I reset my Unity configuration and How do I reset GNOME? - it's a legitimate question though. – jrg Sep 10 '11 at 0:48
Purge unity-2D and reinstall it – Tachyons Oct 27 '12 at 4:09
1
@tachyons That answer has been given on several occasions, but it doesn't remove user specific configuration. – jrg Oct 27 '12 at 16:38
4 Answers 4
Although this link may seem off topic, it covers some of the information I believe you are looking for.
Edit: Whoops, I see fossfreedom was already on the case.
Changing Unity Default Settings
User: fossfreedom points out,
The list of sessions is described in the directory:
/usr/share/xsessions
For unity-2d the session file is called:
ubuntu-2d.desktop
fossfreedom goes on to explain how to reset this to default. Hopefully, this method would leave your files intact.
Regards, SomaComa
share|improve this answer
if the close, maximize and minimize disapeared, try this:
1. press Ctrl+Shift+F2;
2. Login with your username and password;
3. type this command: sudo restart lightdm
share|improve this answer
I think you mean Ctrl+_Alt_+F2. Your solution will simply restart the login manager, which a reboot will also do. – Ramchandra Apte Dec 18 '13 at 13:01
Open a terminal and type
dconf reset -f /
to reset Unity 2D to defaults, or IMPORTANT - THIS RESETS EVERYTHING NOT JUST UNITY-2D
unity --reset
to reset Unity (3D).
If default Ubuntu Nautilus theme is also missing, close all instances and type
rm -R ~/.gconf/apps/nautilus
share|improve this answer
2
THIS RESETS EVERYTHING - do not use this on a casual basis! – fossfreedom Dec 17 '11 at 17:04
To reset unity type the following in the terminal:
unity --reset
To reset the unity icons type:
unity --reset-icons
To reset Compiz type (NOTE: this will reset ALL compiz settings):
gconftool-2 --recursive-unset /apps/compiz-1
unity --reset
The above command will reset the respective elements back to their default configuration.
share|improve this answer
1
Nope, that's for normal Unity. This is for Unity 2D, not 3D. Thanks for the answer though, it's already documented here – jrg Sep 9 '11 at 16:38
Also, resetting compiz doesn't apply here, since Unity 2D uses metacity - Unity 3D is just a giant compiz plugin. – jrg Sep 9 '11 at 16:45
Yes. I wasn't thinking at the time I guess ;) – Adam Thompson Sep 10 '11 at 4:34
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://askubuntu.com/questions/60715/can-i-reset-unity-2d?answertab=active",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "91762",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z47OKIH3YV4A5Y32M63KIKIW2H54SP3W",
"WARC-Concurrent-To": "<urn:uuid:ac6628d7-d48b-4d11-bc70-a9741d18bedc>",
"WARC-Date": "2015-04-27T17:33:39Z",
"WARC-IP-Address": "104.16.16.44",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3MA6E5IPKDOQLJFF63RIHAFWCSCWU6BT",
"WARC-Record-ID": "<urn:uuid:6cb61977-3c4c-4eff-8840-30b59750e61c>",
"WARC-Target-URI": "http://askubuntu.com/questions/60715/can-i-reset-unity-2d?answertab=active",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:700680fa-c7a8-4baf-ad33-257ef2a9d1bb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
141,
142,
329,
330,
358,
363,
519,
524,
682,
687,
869,
874,
937,
941,
1078,
1079,
1091,
1092,
1196,
1197,
1254,
1255,
1287,
1288,
1318,
1319,
1371,
1372,
1393,
1394,
1435,
1436,
1454,
1455,
1570,
1571,
1589,
1590,
1616,
1617,
1675,
1676,
1702,
1746,
1791,
1817,
1822,
1975,
1976,
2001,
2002,
2019,
2020,
2107,
2108,
2122,
2123,
2144,
2145,
2224,
2225,
2254,
2280,
2284,
2379,
2380,
2431,
2432,
2446,
2447,
2478,
2479,
2499,
2500,
2566,
2567,
2615,
2629,
2630,
2720,
2721,
2747,
2751,
2897,
2902,
3042,
3047,
3129,
3130,
3142,
3143,
3145,
3153,
3154,
3232,
3233
],
"line_end_idx": [
25,
141,
142,
329,
330,
358,
363,
519,
524,
682,
687,
869,
874,
937,
941,
1078,
1079,
1091,
1092,
1196,
1197,
1254,
1255,
1287,
1288,
1318,
1319,
1371,
1372,
1393,
1394,
1435,
1436,
1454,
1455,
1570,
1571,
1589,
1590,
1616,
1617,
1675,
1676,
1702,
1746,
1791,
1817,
1822,
1975,
1976,
2001,
2002,
2019,
2020,
2107,
2108,
2122,
2123,
2144,
2145,
2224,
2225,
2254,
2280,
2284,
2379,
2380,
2431,
2432,
2446,
2447,
2478,
2479,
2499,
2500,
2566,
2567,
2615,
2629,
2630,
2720,
2721,
2747,
2751,
2897,
2902,
3042,
3047,
3129,
3130,
3142,
3143,
3145,
3153,
3154,
3232,
3233,
3323
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3323,
"ccnet_original_nlines": 97,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27223721146583557,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.051212940365076065,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29110512137413025,
"rps_doc_frac_unique_words": 0.46422016620635986,
"rps_doc_mean_word_length": 4.596330165863037,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.063611030578613,
"rps_doc_word_count": 545,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.014371260069310665,
"rps_doc_frac_chars_dupe_6grams": 0.014371260069310665,
"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.019560879096388817,
"rps_doc_frac_chars_top_3gram": 0.011177640408277512,
"rps_doc_frac_chars_top_4gram": 0.012774449773132801,
"rps_doc_books_importance": -358.25689697265625,
"rps_doc_books_importance_length_correction": -358.25689697265625,
"rps_doc_openwebtext_importance": -191.03443908691406,
"rps_doc_openwebtext_importance_length_correction": -191.03443908691406,
"rps_doc_wikipedia_importance": -155.77401733398438,
"rps_doc_wikipedia_importance_length_correction": -155.77401733398438
},
"fasttext": {
"dclm": 0.15669244527816772,
"english": 0.8439640402793884,
"fineweb_edu_approx": 1.2762091159820557,
"eai_general_math": 0.0018115000566467643,
"eai_open_web_math": 0.09935075044631958,
"eai_web_code": -0.00000810999972600257
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "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
|
5,354,126,973,731,711,000 |
How to create 3D Pie charts
Read comments...
Summary
A guide for creating 3D Pie charts. The 3D effect is achieved by using the canvas scale function to increase the horizontal size of the canvas
Note: As of August 2015 there's much better 3D support in RGraph.
[No canvas support]
By using the scale() function to transform the canvas (ie stretch it horizontally) you achieve a 3D Pie chart effect. Because of the stretching effect the text will look larger too and also some dynamic features are unlikely to work correctly - though as you can see on the right tooltips do work)
<script>
window.onload = (function ()
{
var pie = new RGraph.Pie({
id: 'cvs',
data: [4,5,5,7,5,8,4,9],
options: {
strokestyle: 'rgba(0,0,0,0)',
linewidth: 1,
shadowBlur: 5,
shadowOffsety: 15,
shadowOffsetx: 0,
shadowColor: '#aaa',
radius: 80,
tooltips: ['Mavis','Kevin','Luis','June','Olga','Luis','Pete','Bridget'],
tooltipsCoordsPage: true,
labels: ['Mavis','Kevin','Luis','June','Olga','Luis','Pete','Bridget'],
textAccessible: false,
labelsSpaced: true,
labelsSticksColors: ['black','black','black','black','black','black','black','black']
}
})
// This is the factor that the canvas is scaled by
var factor = 1.5;
// Set the transformation of the canvas - a scale up by the factor (which is 1.5 and a
// simultaneous translate so that the Pie appears in the center of the canvas
pie.context.setTransform(factor,0,0,1,((pie.canvas.width * factor) - pie.canvas.width) * -0.5,0);
//pie.draw();
pie.roundRobin({frames:30});
})
</script>
If you like RGraph please share it:
|
{
"url": "https://www.rgraph.net/canvas/docs/howto-create-3d-pie-charts.html",
"source_domain": "www.rgraph.net",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "19307",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4ZETQ6UHXC6YFPUEA5ITSN3JDQMY7YU5",
"WARC-Concurrent-To": "<urn:uuid:116e7491-55e0-48ee-b876-18b890e7584d>",
"WARC-Date": "2017-03-30T08:42:23Z",
"WARC-IP-Address": "217.160.0.49",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FK5Q3LTAD3LI3L5PTXODZDJKW4D3UH63",
"WARC-Record-ID": "<urn:uuid:acc1c019-aa0a-47fe-9091-b9b8a4fd2a14>",
"WARC-Target-URI": "https://www.rgraph.net/canvas/docs/howto-create-3d-pie-charts.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bedda4c3-f0fe-4eaa-a58b-2d5c43044081>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
31,
32,
51,
52,
60,
203,
204,
270,
271,
291,
292,
590,
591,
592,
601,
634,
640,
675,
698,
735,
758,
804,
834,
865,
900,
934,
971,
999,
1089,
1131,
1219,
1258,
1294,
1396,
1410,
1421,
1429,
1487,
1512,
1513,
1607,
1692,
1797,
1798,
1819,
1856,
1863,
1873
],
"line_end_idx": [
2,
3,
31,
32,
51,
52,
60,
203,
204,
270,
271,
291,
292,
590,
591,
592,
601,
634,
640,
675,
698,
735,
758,
804,
834,
865,
900,
934,
971,
999,
1089,
1131,
1219,
1258,
1294,
1396,
1410,
1421,
1429,
1487,
1512,
1513,
1607,
1692,
1797,
1798,
1819,
1856,
1863,
1873,
1908
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1908,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0.004192870110273361,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19121447205543518,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015503879636526108,
"rps_doc_frac_lines_end_with_ellipsis": 0.019607840105891228,
"rps_doc_frac_no_alph_words": 0.42635658383369446,
"rps_doc_frac_unique_words": 0.624365508556366,
"rps_doc_mean_word_length": 5.7208123207092285,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.005167960189282894,
"rps_doc_unigram_entropy": 4.51707649230957,
"rps_doc_word_count": 197,
"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.04791482165455818,
"rps_doc_frac_chars_top_3gram": 0.02928127907216549,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -197.08529663085938,
"rps_doc_books_importance_length_correction": -197.08523559570312,
"rps_doc_openwebtext_importance": -96.95218658447266,
"rps_doc_openwebtext_importance_length_correction": -96.95218658447266,
"rps_doc_wikipedia_importance": -39.44355773925781,
"rps_doc_wikipedia_importance_length_correction": -39.44355773925781
},
"fasttext": {
"dclm": 0.4738105535507202,
"english": 0.6736546158790588,
"fineweb_edu_approx": 2.3620259761810303,
"eai_general_math": 0.3509604334831238,
"eai_open_web_math": 0.22105258703231812,
"eai_web_code": 0.7124931216239929
}
}
|
{
"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": "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": "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
|
2,906,073,779,664,365,000 |
Mark Rogov Mark Rogov - 1 year ago 94
Node.js Question
s3.getObject inside lambda doesn't return anything
I have the following code, inside a lambda function, which is an Amazon echo skill:
"AMAZON.HelpIntent": function (intent, session, response) {
var speechOutput ="Start";
// Try S3
var s3 = new AWS.S3({httpOptions: { timeout: 2000 }});
var params = {
Bucket: 'bucket',
Key: 'file',
};
s3.getObject(params, function (err, data) {
if (err) {
// console.log(err, err.stack);
speechOutput += "inside error";
speechOutput += "Did not get it!" + err + ":===:" + err.stack;
}
else {
speechOutput += "inside success";
// console.log(data);
speechOutput += "Got it! :" + data.Body.toString('ascii');
}
});
speechOutput += " End. ";
var repromptText = "Help reprompt.";
response.ask(speechOutput, repromptText);
},
seems pretty straight forward... however, when the skill is executed, the response is this:
{
"version": "1.0",
"response": {
"outputSpeech": {
"type": "PlainText",
"text": "Start End. "
},
"shouldEndSession": false,
"reprompt": {
"outputSpeech": {
"type": "PlainText",
"text": "Help reprompt."
}
}
},
"sessionAttributes": {}
}
In other words, s3.getObject doesn't throw any errors, and doesn't run.
The lamda function has 'lambda_basic_execution' role, which in IAM is defined to have full access to the S3:
{
"Version": "2012-10-17",
"Statement": [
{
"Effect": "Allow",
"Action": "s3:*",
"Resource": "*"
}
]
}
Inside S3, there is a bucket (named 'bucket') and file (named 'file'). File is accessible from CLI, and the web. Permissions on the bucket and file are set to be "everyone".
Please help.
Answer Source
You aren't waiting for the S3 call to complete. The last 3 lines in your code are executing before the s3.getObject() callback has been called. Try changing your code by moving those last 3 lines into the callback, like this:
"AMAZON.HelpIntent": function (intent, session, response) {
var speechOutput ="Start";
// Try S3
var s3 = new AWS.S3({httpOptions: { timeout: 2000 }});
var params = {
Bucket: 'bucket',
Key: 'file',
};
s3.getObject(params, function (err, data) {
if (err) {
// console.log(err, err.stack);
speechOutput += "inside error";
speechOutput += "Did not get it!" + err + ":===:" + err.stack;
}
else {
speechOutput += "inside success";
// console.log(data);
speechOutput += "Got it! :" + data.Body.toString('ascii');
}
speechOutput += " End. ";
var repromptText = "Help reprompt.";
response.ask(speechOutput, repromptText);
});
},
|
{
"url": "https://codedump.io/share/DSJl7Wp3tkNq/1/s3getobject-inside-lambda-doesn39t-return-anything",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "43235",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7C3EWCTGOIAD7IYFPD5FWLBRIWXS5GFU",
"WARC-Concurrent-To": "<urn:uuid:56e8e0dd-aa3a-478c-b430-7ac8b3093479>",
"WARC-Date": "2017-10-19T23:59:28Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EN2RTVC6SGV66WB5BG76SECREGDNSJGL",
"WARC-Record-ID": "<urn:uuid:2fc8d8fb-1f37-41fc-b3b0-ee6e7b2e728c>",
"WARC-Target-URI": "https://codedump.io/share/DSJl7Wp3tkNq/1/s3getobject-inside-lambda-doesn39t-return-anything",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:30422839-eb8e-48ea-9f51-4d24d0575fd8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-152-37-148.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
38,
55,
56,
107,
108,
192,
193,
253,
280,
281,
291,
346,
361,
379,
392,
395,
396,
440,
451,
483,
515,
578,
580,
587,
621,
643,
702,
704,
708,
709,
735,
736,
773,
815,
818,
819,
820,
912,
913,
915,
933,
947,
965,
986,
1008,
1011,
1038,
1052,
1070,
1091,
1116,
1118,
1120,
1123,
1147,
1149,
1150,
1151,
1223,
1224,
1333,
1334,
1336,
1361,
1376,
1378,
1397,
1415,
1431,
1433,
1435,
1437,
1438,
1439,
1613,
1614,
1627,
1628,
1642,
1643,
1869,
1870,
1930,
1959,
1960,
1972,
2029,
2046,
2068,
2085,
2090,
2091,
2137,
2152,
2190,
2228,
2297,
2303,
2314,
2354,
2382,
2447,
2453,
2454,
2455,
2485,
2486,
2527,
2573,
2579
],
"line_end_idx": [
38,
55,
56,
107,
108,
192,
193,
253,
280,
281,
291,
346,
361,
379,
392,
395,
396,
440,
451,
483,
515,
578,
580,
587,
621,
643,
702,
704,
708,
709,
735,
736,
773,
815,
818,
819,
820,
912,
913,
915,
933,
947,
965,
986,
1008,
1011,
1038,
1052,
1070,
1091,
1116,
1118,
1120,
1123,
1147,
1149,
1150,
1151,
1223,
1224,
1333,
1334,
1336,
1361,
1376,
1378,
1397,
1415,
1431,
1433,
1435,
1437,
1438,
1439,
1613,
1614,
1627,
1628,
1642,
1643,
1869,
1870,
1930,
1959,
1960,
1972,
2029,
2046,
2068,
2085,
2090,
2091,
2137,
2152,
2190,
2228,
2297,
2303,
2314,
2354,
2382,
2447,
2453,
2454,
2455,
2485,
2486,
2527,
2573,
2579,
2581
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2581,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0.017047660425305367,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1326860785484314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022653719410300255,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4789643883705139,
"rps_doc_frac_unique_words": 0.48620688915252686,
"rps_doc_mean_word_length": 5.844827651977539,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0016181200044229627,
"rps_doc_unigram_entropy": 4.676291465759277,
"rps_doc_word_count": 290,
"rps_doc_frac_chars_dupe_10grams": 0.47905606031417847,
"rps_doc_frac_chars_dupe_5grams": 0.47905606031417847,
"rps_doc_frac_chars_dupe_6grams": 0.47905606031417847,
"rps_doc_frac_chars_dupe_7grams": 0.47905606031417847,
"rps_doc_frac_chars_dupe_8grams": 0.47905606031417847,
"rps_doc_frac_chars_dupe_9grams": 0.47905606031417847,
"rps_doc_frac_chars_top_2gram": 0.04247787967324257,
"rps_doc_frac_chars_top_3gram": 0.03539822995662689,
"rps_doc_frac_chars_top_4gram": 0.0436578206717968,
"rps_doc_books_importance": -327.6238708496094,
"rps_doc_books_importance_length_correction": -327.6238708496094,
"rps_doc_openwebtext_importance": -161.17681884765625,
"rps_doc_openwebtext_importance_length_correction": -161.17681884765625,
"rps_doc_wikipedia_importance": -120.68473815917969,
"rps_doc_wikipedia_importance_length_correction": -120.68473815917969
},
"fasttext": {
"dclm": 0.9650700688362122,
"english": 0.5796971321105957,
"fineweb_edu_approx": 1.9408742189407349,
"eai_general_math": 0.17118549346923828,
"eai_open_web_math": 0.09092587232589722,
"eai_web_code": 0.5761570334434509
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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,015,809,749,081,264,000 |
The Artima Developer Community
Sponsored Link
Weblogs Forum
A Career in Computing
24 replies on 2 pages. Most recent reply: Nov 15, 2009 10:34 AM by Mianzhan Lin
Welcome Guest
Sign In
Go back to the topic listing Back to Topic List Click to reply to this topic Reply to this Topic Click to search messages in this forum Search Forum Click for a threaded view of the topic Threaded View
Previous Topic Next Topic
Flat View: This topic has 24 replies on 2 pages [ 1 2 | » ]
Bruce Eckel
Posts: 875
Nickname: beckel
Registered: Jun, 2003
A Career in Computing (View in Weblogs)
Posted: Jun 2, 2009 1:55 AM
Reply to this message Reply
Summary
I regularly receive requests for career advice, and I've tried to capture the answers in this blog, and in a follow-on. For those of you who asked but never got an answer, I apologize. Your questions stimulated me to work on this, and it's taken awhile.
Advertisement
The question that people ask is usually the wrong one: "should I learn C++ or Java?" In this essay, I shall try to lay out my view of the true issues involved in choosing a career in computing.
Note that I am not talking here to the people who already know it is their calling. You're going to do it regardless of what anyone says, because it's in your blood and you can't get away from it. You know the answer already: C++ AND Java AND shell scripting AND Python AND a host of other languages and technologies that you'll learn as a matter of course. You already know several of these languages, even if you're only 14.
The person who asks me this question may be coming from another career. Or perhaps they are coming from a field like web development and they've figured out that HTML is only kind of like programming, and they'd like to try building something more substantial. But I especially hope that, if you are asking this question, you've realized that to be successful in computing, you need to teach yourself how to learn, and never stop learning.
The more I do this, the more it seems to me that software is more akin to writing than anything else. And we haven't figured out what makes a good writer, we only know when we like what someone writes. This is not some kind of engineering where all we have to do is put something in one end and turn the crank. It is tempting to think of software as deterministic -- that's what we want it to be, and that's the reason that we keep coming up with tools to help us produce the behavior we desire. But my experience keeps indicating the opposite, that it is more about people than processes, and the fact that it runs on a deterministic machine becomes less and less of an influence, just like the Heisenberg principle doesn't affect things on a human scale.
My father built custom homes, and in my youth I would occasionally work for him, mostly doing grunt labor and sometimes hanging sheet rock. He and his lead carpenter would tell me that they gave me these jobs for my own good -- so that I wouldn't go into the business. It worked.
So I can also use the analogy that building software is like building a house. We don't refer to everyone who works on a house as if they were exactly the same. There are concrete masons, roofers, plumbers, electricians, sheet rockers, plasterers, tile setters, laborers, rough carpenters, finish carpenters, and of course, general contractors. Each of these requires a different set of skills, which requires a different amount of time and effort to acquire. House-building is also subject to boom and bust cycles, like programming. If you want to get in quick, you might take a job as a laborer or a sheet rocker, where you can start getting paid without much of a learning curve. As long as demmand is strong, you have steady work, and your pay might even go up if there aren't enough people to do the work. But as soon as there's a downturn, carpenters and even the general contractor can hang the sheet rock themselves.
When the Internet was first booming, all you had to do was spend some time learning HTML and you could get a job and earn some pretty good money. When things turned down, however, it rapidly becomes clear that there is a hierarchy of desirable skills, and the HTML programmers (like the laborers and sheet rockers) go first, while the highly-skilled code smiths and carpenters are retained.
What I'm trying to say here is that you don't want to go into this business unless you are ready to commit to lifelong learning. Sometimes it seems like programming is a well-paying, reliable job -- but the only way you can make sure of this is if you are always making yourself more valuable.
Of course you can find exceptions. There are always those people who learn one language and are just competent enough and perhaps savvy enough to stay employed without doing much to expand their abilities. But they are surviving by luck, and they are ultimately vulnerable. To make yourself less vulnerable, you need to continuously improve your abilities, by reading, going to user groups, conferences, and seminars. The more depth you have in this field, the more valuable you will be, which means you have more stable job prospects and can command higher salaries.
Another approach is to look at the field in general, and find a place where you already have talents. For example, my brother is interested in software, and dabbles with it, but his business is in installing computers, fixing them and upgrading them. He's always been meticulous, so when he installs or fixes your computer you know that it will be in excellent shape when he's done; not just the software, but all the way down to the cables, which will be bundled neat and out of the way. He's always had more work than he could do, and he never noticed the dot-com bust. And needless to say, his work cannot be offshored.
I stayed in college a long time, and managed to get by in various ways. I even began a Ph.D. program at UCLA, which was mercifully cut short -- I say mercifully because I no longer loved being in college, and the reason I stayed in college for so long was because I enjoyed it so much. But what I enjoyed was typically the off-track stuff. Art and dance classes, working on the college newspaper, and even the handful of computer programming classes that I took (which were off-track because I was a physics undergrad and a computer engineering graduate student). Although I was far from exceptional academically (a delightful irony is that many colleges that would not have accepted me as a student now use my books in their courses!), I really enjoyed the life of the college student, and had I finished a Ph.D. I probably would have taken the easy path and ended up a professor.
But as it turns out, some of the greatest value that I got from college was from those same off-track courses, the ones that expanded my mind beyond "stuff we already know." I think this is especially true in computing because you are always programming to support some other goal, and the more you know about that goal the better you'll perform (I've encountered some European graduate programs that require the study of computing in combination with some other specialty, and you build your thesis by solving a domain-specific problem in that other specialty).
I also think that knowing more than just programming vastly improves your problem-solving skills (just as knowing more than one programming language vastly improves your programming skills). On multiple occasions I have encountered people, trained only in computer science, who seem to have more limits in their thinking than those who come from some other background, like math or physics, which requires more rigorous thinking and is less prone to "it works for me" solutions.
In one session a conference that I organized, one of the topics was to come up with a list of features for the ideal job candidate:
• Learning as a lifestyle. For example, you should know more than one language; nothing opens your eyes more to the strengths and limitations of a language than learning another one.
• Know where and how to get new knowledge.
• Study prior art.
• We are tool users.
• Learn to do the simplest thing.
• Understand the business (Read magazines. Start with Fast Company, which has very short and interesting articles. Then you can see if you want to read others)
• You are personally responsible for errors. "It works for me" is not an acceptable strategy. Find your own bugs.
• Become a leader: someone who communicates and inspires.
• Who are you serving?
• There is no right answer ... and always a better way. Show and discuss your code, without emotional attachment. You are not your code.
• It's an asymptotic journey towards perfection.
Take whatever risks you can -- the best risks are the scary ones, but in trying you will feel more alive than you can imagine. It's best if you don't plan for a particular outcome, because you will often miss the true possibilities if you're too attached to a result. My best adventures have been ones that have started with "lets do a little experiment and see where it takes us.
Some people will be disappointed by this answer, and reply "yes, that's all very interesting and useful. But really, what should I learn? C++ or Java?" I'll fend these off by repeating here: I know it seems like all the ones and zeroes should make everything deterministic, so that such questions should have a simple answer, but they don't. It's not about making one choice and being done with it. It's about continuous learning and sometimes, bold choices. Trust me, your life will be more exciting this way.
Further Reading
Here's an earlier piece I wrote on how I got started in programming.
I found all these to be interesting and stimulating takes on the same subject:
In a future article (I'll post the link here when it's done), I will talk about the importance of understanding management and business issues, whether or not you ever plan to be a manager, and in that article I'll include a list of books that (even though they're about management) you should read to prepare yourself for your career.
Roman Belous
Posts: 1
Nickname: rorick
Registered: Jun, 2009
Re: A Career in Computing Posted: Jun 2, 2009 5:51 AM
Reply to this message Reply
This topic excited me) When I was 14 I "programmed" Windows bat-files on sheets of paper. Thanks for a good article.
Patrick Bourke
Posts: 2
Nickname: pbourke
Registered: Apr, 2006
Re: A Career in Computing Posted: Jun 3, 2009 1:12 AM
Reply to this message Reply
Thanks for an interesting article, Bruce. I agree with most of your points, especially those about a commitment to lifelong self-directed learning. That's obviously a key component of success in this field.
I'm curious, though, why you think that software development cannot be like engineering. I definitely will not argue that it is not like engineering, but why can't it be?
It seems to me that incorporating more engineering-like processes and attitudes into the typical software development team would lead to more successful outcomes. Why is it that this industry has so many spectacular, ridiculous failures and boondoggles? There is certainly no technical reason for nearly all of these failures - they're all due to a breakdown in the way that people assemble complex systems. Isn't this the kind of thing that engineering addresses?
Oliver Plohmann
Posts: 13
Nickname: olli
Registered: Jun, 2008
Re: A Career in Computing Posted: Jun 3, 2009 5:09 AM
Reply to this message Reply
Hi Bruce,
I like your article and I agree mostly about what you say. It assumes that the best qualified guy survives in the end. This was also for a long time my assumption and "business model". However, I got meanwhile scared from what I have seen in the last projects. People that can just do some Java coding, write some JSP pages, that actually write preatty procedural code, make the big bucks, because they know JSF, hibernate, Spring. Once you have those skills you play in the first league. General understanding of OOP, software development as such has little importance. During my studies I worked as a student assistant for the Fraunhofer institute in town on some software research project. Thought that would look good on my CV. But it didn't help at all in finding a job. If I had spent my time learning Struts instead I could have chosen between many job offers. I feel like software development work in the age of web development has become a mass product and skills beyond the basic ones to get some web app up and running are not in demand. This is what makes me think.
So I write my own little open source software (well, mostly for the fun of it), hoping somewhen someone when I apply for a job will realize that I can do more than just coding JSP pages. But I feel like that is an illusion. I will just be asked whether I know JSF, hibernate and Spring. What surely earns you credits is being accepted to some "famous" open source project from Apache. But then you really have to spend most of your spare time with those open source projects and there definitely is no time for kids or wife.
Cheers, Olli
Raoul Duke
Posts: 127
Nickname: raoulduke
Registered: Apr, 2006
Re: A Career in Computing Posted: Jun 3, 2009 5:36 PM
Reply to this message Reply
> I will just be asked whether I know JSF, hibernate and
> Spring.
Ollie, when I land my angel funding, you are so hired.
James Watson
Posts: 2024
Nickname: watson
Registered: Sep, 2005
Re: A Career in Computing Posted: Jun 4, 2009 8:56 AM
Reply to this message Reply
> I'm curious, though, why you think that software
> development cannot be like engineering. I definitely will
> not argue that it is not like engineering, but why
> can't it be?
Consider what he wrote:
"This is not some kind of engineering where all we have to do is put something in one end and turn the crank."
Based on this quote, I would say that Bruce doesn't have the slightest idea what engineers do. The idea that engineering isn't creative is ludicrous.
James Watson
Posts: 2024
Nickname: watson
Registered: Sep, 2005
Re: A Career in Computing Posted: Jun 4, 2009 9:08 AM
Reply to this message Reply
> General understanding of OOP, software development as such
> has little importance. During my studies I worked as a
> student assistant for the Fraunhofer institute in town on
> some software research project. Thought that would look
> good on my CV. But it didn't help at all in finding a job.
> If I had spent my time learning Struts instead I could have
> chosen between many job offers. I feel like software
> development work in the age of web development has become
> a mass product and skills beyond the basic ones to get
> some web app up and running are not in demand. This is
> what makes me think.
I share your pain. Personally I think we are in a weird pocket of time when deep computer skills (including programming) have actually been decreasing.
My theory is that during the dot-com bubble, talent became scarce and a lot tools were designed with the idea of making under-qualified people able to produce software. Along with these tools came a marketing message that no only did you not need really talented developers, but that they were more trouble than they were worth.
This has become ingrained. Management would rather have 12 developers who do repetitive typing and clicking instead of 1 really good developer who produces just as much (or more) but in ways they don't understand.
My hope is that we are on the tail end of this. It seems inevitable that this kind of thinking must go away. As a world, we are more dependent upon computers and software than ever before but I don't see a lot of young people wanting to understand how they really work. It must come to a head.
Bruce Eckel
Posts: 875
Nickname: beckel
Registered: Jun, 2003
Re: A Career in Computing Posted: Jun 4, 2009 3:03 PM
Reply to this message Reply
> Consider what he wrote:
>
> "This is not some kind of engineering where all we have to
> do is put something in one end and turn the crank."
>
> Based on this quote, I would say that Bruce doesn't have
> the slightest idea what engineers do. The idea that
> engineering isn't creative is ludicrous.
Clearly not enough emphasis on "some kind." My BS was in applied physics (a physics degree + mechanical and electrical engineering; would have been a double major if I could have focused on one) and my MS was in computer engineering. Before becoming a consultant, I worked several years as an engineer. I even designed and built solar distillers.
However, there are some kinds of engineering which end up being "apply numbers and turn the crank." There are also jobs in programming which are not terribly creative -- my point is that these are day jobs but not career-quality jobs.
James Watson
Posts: 2024
Nickname: watson
Registered: Sep, 2005
Re: A Career in Computing Posted: Jun 4, 2009 3:52 PM
Reply to this message Reply
> Clearly not enough emphasis on "some kind." My BS was in
> applied physics (a physics degree + mechanical and
> electrical engineering; would have been a double major if
> I could have focused on one) and my MS was in computer
> engineering. Before becoming a consultant, I worked
> several years as an engineer. I even designed and built
> solar distillers.
I am glad you cleared that up. I think a lot of engineers would be insulted by that.
> However, there are some kinds of engineering which end up
> being "apply numbers and turn the crank." There are also
> jobs in programming which are not terribly creative -- my
> point is that these are day jobs but not career-quality
> jobs.
What frustrates me is that we have programmers that do things that could be done by computer programs. It's such a waste of resources.
Mark Thornton
Posts: 275
Nickname: mthornton
Registered: Oct, 2005
Re: A Career in Computing Posted: Jun 4, 2009 5:17 PM
Reply to this message Reply
> I'm curious, though, why you think that software
> development cannot be like engineering. I definitely will
> not argue that it is not like engineering, but why
> can't it be?
Try comparing engineering projects and software projects of similar complexity and proximity to the bleeding edge. I suspect you will then find that the development budget for the engineering project is usually much higher.
Software development for life critical systems does seem to more closely approach physical engineering processes (and is typically very expensive). For regular software that approach seems to take too long and cost too much; the other guy whose software is merely good enough gets the business.
Patrick Bourke
Posts: 2
Nickname: pbourke
Registered: Apr, 2006
Re: A Career in Computing Posted: Jun 4, 2009 6:01 PM
Reply to this message Reply
> Software development for life critical systems does seem
> to more closely approach physical engineering processes
> (and is typically very expensive). For regular software
> that approach seems to take too long and cost too much;
> the other guy whose software is merely good enough gets
> the business.
This is what I'm trying to understand - why do people think that an engineering approach to software is more costly than a non-engineering approach? A good many software projects arrive 100% over budget and deadline. That doesn't even include the cost incurred after the launch of a system which doesn't deliver adequate value and imposes an ongoing operational/maintenance burden.
I didn't mean to derail this into a discussion of engineering vs. software development, however as someone planning where to go next in my career, I find it relevant.
James Watson
Posts: 2024
Nickname: watson
Registered: Sep, 2005
Re: A Career in Computing Posted: Jun 4, 2009 8:39 PM
Reply to this message Reply
> This is what I'm trying to understand - why do people
> think that an engineering approach to software is more
> costly than a non-engineering approach?
I attempted to address this above. There is this accepted idea that creating software is easy. How hard is it to throw together a app in Access or VB? I often tell people that anyone can write software that works when everything goes right. It's writing software that handles problems well that we get paid for. The problem is that a whole lot of people don't really understand this or even consider what could go wrong.
I'm being very abstract here so let me give you an example. I was recently explaining the need for a poison message queue in a message oriented architecture. The head of production support wanted a list of every possible error code and what could go wrong. I told him that was not possible and he thought I was full of shit. He didn't understand my design handled unexpected errors. Even Joel Spolsky doesn't understand exceptions and he's seen as an expert in some circles.
Frankly there are a lot of hacks and charlatans in the software and IT rackets and not enough people in management that understand software.
Vincent O'Sullivan
Posts: 724
Nickname: vincent
Registered: Nov, 2002
Re: A Career in Computing Posted: Jun 5, 2009 8:29 AM
Reply to this message Reply
Personally, I think that software development and engineering (i.e. hardware development) are very closely similar. The biggest difference, I feel, is that the average quality of project control is much, much higher for hardware than software.
Engineering products are - generally - better designed, better developed, better tested and better delivered because the people who manage the processes are themselves experienced engineers who understand what it is that the grunts are doing and what it is that they should be doing.
In the software world, there is generally a dichotomy (with notable exceptions) between those giving the orders and those carrying them out. Most managers, in my experience, don't understand the software development process and those that do understand it seem to have a quite different understanding to that of software developers, and see it only from a management theory point of view.
Too many software developers, on the other hand, are just hackers with little or no understanding of what they are developing. Oh, they understand the code right enough but they think that "quality" and "unit tests" are the same thing and don't have any real empathy for the product or the market or the users, nor any useful understanding of the commercial realities that underpin their jobs and careers.
Kay Schluehr
Posts: 302
Nickname: schluehk
Registered: Jan, 2005
Re: A Career in Computing Posted: Jun 5, 2009 9:22 AM
Reply to this message Reply
> Oh, they understand the code right enough but
> they think that "quality" and "unit tests" are the same
> thing and don't have any real empathy for the product or
> the market or the users, nor any useful understanding of
> the commercial realities that underpin their jobs and
> careers.
I'm not entirely sure how much a chip designer shows empathy, cares for the users, the market, the commercial realities and so on. It's true though that my instinctive reaction to programmers who start to talk about professionalism, business needs, enterprise software etc. is to show me the code.
But anyway I worked in big corporations for long as a SW developer and they had quality management, large testing staff and the employees were well informed about business needs. Unit tests were practised sparingly though ...
I also don't know what "hacker" means these days? Many things to many people I guess. When Paul Graham talks about hackers it's a way of life, when process guys talk about them they become an uncontrollable variable and a strawman for everything that doesn't fit, when Hollywood shows them they are eccentric, often evil minded people with close to magical powers and when media cover them they are some sort of burglars with computers.
Bill Pyne
Posts: 165
Nickname: billpyne
Registered: Jan, 2007
Re: A Career in Computing Posted: Jun 5, 2009 11:10 AM
Reply to this message Reply
My advice to people thinking about coming into the field, whether as a change of careers or a student, is to figure out where you fit. Our field is expansive.
Not everyone enjoys thinking out solutions to problems and expressing the solution in code. There is still plenty of room. However, your choice of organizations becomes more narrow.
Small companies cannot have the overhead of specialization so splitting the developer role into business analyst, architect, project manager, sys admin, DBA, etc. cannot happen. In a small company and particularly a startup, you need to be a developer doing analysis, design, project management, etc. In these companies, time to market is generally more important than a high degree of correctness - ie. 80% is good enough. Software development is usually done rapidly with sketchy requirements and lots of refactoring. These organizations attract people who like to wear lots of hats, have lots of autonomy, and do rapid development.
Larger organizations allow for more specialization, so if writing code doesn't suit you, plenty of room for you to be an analyst, project manager, computer operator, and so on. However, you need to understand that many large organizations value weigh in from different departments so communication is a large overhead that often slows down development. Usually, the "Waterfall" practice suits these organizations better. (It's not a guarantee though. Certain industries move too rapidly.)
You need to figure out what suits you better. If, at the start of a project, booking > 50% of your time to meetings makes you agitated, stay away from organizations that foster group decision making. If being on call year round is not to your liking, startups should be avoided.
Don't get involved in ideology. Neither Waterfall nor Agile methods guarantee good software. It's about what methodology works better in your organization and ultimately having people committed to making a great product.
Bruce's advice on learning as a lifestyle cannot be overemphasized. Learning might be along the lines of new languages that allow greater abstraction or refactoring business processes for business improvement or tools for end users to produce their own reports or .... Always be curious.
Flat View: This topic has 24 replies on 2 pages [ 1 2 | » ]
Topic: Clearing caches Previous Topic Next Topic Topic: We No Longer Need Power
Sponsored Links
Google
Web Artima.com
Copyright © 1996-2015 Artima, Inc. All Rights Reserved. - Privacy Policy - Terms of Use - Advertise with Us
|
{
"url": "http://www.artima.com/forums/flat.jsp?forum=106&thread=259358",
"source_domain": "www.artima.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "75798",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PLMQSVBFV6FWYRYOKCY36VJYOUTTESTI",
"WARC-Concurrent-To": "<urn:uuid:d73f21e3-a1eb-4683-9b48-1159f1364bd1>",
"WARC-Date": "2015-01-29T20:23:04Z",
"WARC-IP-Address": "207.223.251.219",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S56IKMUCHQPYRK7K7EQ23H66N7SQGYQN",
"WARC-Record-ID": "<urn:uuid:e26da58a-f1a2-41f8-b859-95d481ddec8c>",
"WARC-Target-URI": "http://www.artima.com/forums/flat.jsp?forum=106&thread=259358",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dc50a14-ad82-4514-9c53-da52bd9f7dbc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 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,
31,
46,
47,
61,
83,
84,
164,
165,
179,
189,
190,
399,
427,
487,
499,
500,
511,
528,
550,
551,
591,
619,
647,
655,
909,
923,
924,
1118,
1119,
1546,
1547,
1987,
1988,
2745,
2746,
3026,
3027,
3952,
3953,
4344,
4345,
4639,
4640,
5208,
5209,
5832,
5833,
6715,
6716,
7279,
7280,
7759,
7760,
7892,
7893,
8078,
8123,
8144,
8167,
8203,
8365,
8481,
8541,
8566,
8705,
8756,
8757,
9138,
9139,
9650,
9651,
9667,
9668,
9737,
9738,
9817,
9818,
10154,
10155,
10156,
10169,
10170,
10179,
10196,
10218,
10219,
10273,
10301,
10418,
10419,
10434,
10435,
10444,
10462,
10484,
10485,
10539,
10567,
10774,
10775,
10946,
10947,
11412,
11413,
11429,
11430,
11440,
11455,
11477,
11478,
11532,
11560,
11570,
11571,
12649,
12650,
13175,
13176,
13189,
13190,
13201,
13202,
13213,
13233,
13255,
13256,
13310,
13338,
13395,
13405,
13406,
13461,
13462,
13475,
13476,
13488,
13505,
13527,
13528,
13582,
13610,
13661,
13721,
13774,
13789,
13790,
13814,
13815,
13926,
13927,
14077,
14078,
14091,
14092,
14104,
14121,
14143,
14144,
14198,
14226,
14287,
14344,
14404,
14462,
14523,
14585,
14640,
14700,
14757,
14814,
14837,
14838,
14990,
14991,
15320,
15321,
15535,
15536,
15830,
15831,
15843,
15844,
15855,
15872,
15894,
15895,
15949,
15977,
16003,
16005,
16066,
16120,
16122,
16181,
16235,
16278,
16279,
16626,
16627,
16862,
16863,
16876,
16877,
16889,
16906,
16928,
16929,
16983,
17011,
17070,
17123,
17183,
17240,
17294,
17352,
17372,
17373,
17458,
17459,
17519,
17578,
17638,
17696,
17704,
17705,
17840,
17841,
17855,
17856,
17867,
17887,
17909,
17910,
17964,
17992,
18043,
18103,
18156,
18171,
18172,
18396,
18397,
18692,
18693,
18708,
18709,
18718,
18736,
18758,
18759,
18813,
18841,
18900,
18958,
19016,
19074,
19132,
19148,
19149,
19531,
19532,
19699,
19700,
19713,
19714,
19726,
19743,
19765,
19766,
19820,
19848,
19904,
19961,
20003,
20004,
20425,
20426,
20901,
20902,
21043,
21044,
21063,
21064,
21075,
21093,
21115,
21116,
21170,
21198,
21442,
21443,
21727,
21728,
22117,
22118,
22524,
22525,
22538,
22539,
22550,
22569,
22591,
22592,
22646,
22674,
22722,
22780,
22839,
22898,
22954,
22965,
22966,
23264,
23265,
23491,
23492,
23929,
23930,
23940,
23941,
23952,
23971,
23993,
23994,
24049,
24077,
24236,
24237,
24419,
24420,
25055,
25056,
25545,
25546,
25825,
25826,
26047,
26048,
26336,
26337,
26398,
26480,
26481,
26482,
26498,
26499,
26500,
26501,
26508,
26528,
26529
],
"line_end_idx": [
31,
46,
47,
61,
83,
84,
164,
165,
179,
189,
190,
399,
427,
487,
499,
500,
511,
528,
550,
551,
591,
619,
647,
655,
909,
923,
924,
1118,
1119,
1546,
1547,
1987,
1988,
2745,
2746,
3026,
3027,
3952,
3953,
4344,
4345,
4639,
4640,
5208,
5209,
5832,
5833,
6715,
6716,
7279,
7280,
7759,
7760,
7892,
7893,
8078,
8123,
8144,
8167,
8203,
8365,
8481,
8541,
8566,
8705,
8756,
8757,
9138,
9139,
9650,
9651,
9667,
9668,
9737,
9738,
9817,
9818,
10154,
10155,
10156,
10169,
10170,
10179,
10196,
10218,
10219,
10273,
10301,
10418,
10419,
10434,
10435,
10444,
10462,
10484,
10485,
10539,
10567,
10774,
10775,
10946,
10947,
11412,
11413,
11429,
11430,
11440,
11455,
11477,
11478,
11532,
11560,
11570,
11571,
12649,
12650,
13175,
13176,
13189,
13190,
13201,
13202,
13213,
13233,
13255,
13256,
13310,
13338,
13395,
13405,
13406,
13461,
13462,
13475,
13476,
13488,
13505,
13527,
13528,
13582,
13610,
13661,
13721,
13774,
13789,
13790,
13814,
13815,
13926,
13927,
14077,
14078,
14091,
14092,
14104,
14121,
14143,
14144,
14198,
14226,
14287,
14344,
14404,
14462,
14523,
14585,
14640,
14700,
14757,
14814,
14837,
14838,
14990,
14991,
15320,
15321,
15535,
15536,
15830,
15831,
15843,
15844,
15855,
15872,
15894,
15895,
15949,
15977,
16003,
16005,
16066,
16120,
16122,
16181,
16235,
16278,
16279,
16626,
16627,
16862,
16863,
16876,
16877,
16889,
16906,
16928,
16929,
16983,
17011,
17070,
17123,
17183,
17240,
17294,
17352,
17372,
17373,
17458,
17459,
17519,
17578,
17638,
17696,
17704,
17705,
17840,
17841,
17855,
17856,
17867,
17887,
17909,
17910,
17964,
17992,
18043,
18103,
18156,
18171,
18172,
18396,
18397,
18692,
18693,
18708,
18709,
18718,
18736,
18758,
18759,
18813,
18841,
18900,
18958,
19016,
19074,
19132,
19148,
19149,
19531,
19532,
19699,
19700,
19713,
19714,
19726,
19743,
19765,
19766,
19820,
19848,
19904,
19961,
20003,
20004,
20425,
20426,
20901,
20902,
21043,
21044,
21063,
21064,
21075,
21093,
21115,
21116,
21170,
21198,
21442,
21443,
21727,
21728,
22117,
22118,
22524,
22525,
22538,
22539,
22550,
22569,
22591,
22592,
22646,
22674,
22722,
22780,
22839,
22898,
22954,
22965,
22966,
23264,
23265,
23491,
23492,
23929,
23930,
23940,
23941,
23952,
23971,
23993,
23994,
24049,
24077,
24236,
24237,
24419,
24420,
25055,
25056,
25545,
25546,
25825,
25826,
26047,
26048,
26336,
26337,
26398,
26480,
26481,
26482,
26498,
26499,
26500,
26501,
26508,
26528,
26529,
26636
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 26636,
"ccnet_original_nlines": 351,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4363569915294647,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02999267913401127,
"rps_doc_frac_lines_end_with_ellipsis": 0.002840910106897354,
"rps_doc_frac_no_alph_words": 0.17099487781524658,
"rps_doc_frac_unique_words": 0.2563367784023285,
"rps_doc_mean_word_length": 4.63213586807251,
"rps_doc_num_sentences": 234,
"rps_doc_symbol_to_word_ratio": 0.0005486499867402017,
"rps_doc_unigram_entropy": 6.028948783874512,
"rps_doc_word_count": 4537,
"rps_doc_frac_chars_dupe_10grams": 0.22849257290363312,
"rps_doc_frac_chars_dupe_5grams": 0.26294252276420593,
"rps_doc_frac_chars_dupe_6grams": 0.2607061266899109,
"rps_doc_frac_chars_dupe_7grams": 0.2430529147386551,
"rps_doc_frac_chars_dupe_8grams": 0.24167300760746002,
"rps_doc_frac_chars_dupe_9grams": 0.241482675075531,
"rps_doc_frac_chars_top_2gram": 0.009944800287485123,
"rps_doc_frac_chars_top_3gram": 0.007280169986188412,
"rps_doc_frac_chars_top_4gram": 0.014560329727828503,
"rps_doc_books_importance": -2307.942626953125,
"rps_doc_books_importance_length_correction": -2307.942626953125,
"rps_doc_openwebtext_importance": -1351.7310791015625,
"rps_doc_openwebtext_importance_length_correction": -1351.7310791015625,
"rps_doc_wikipedia_importance": -1169.187744140625,
"rps_doc_wikipedia_importance_length_correction": -1169.187744140625
},
"fasttext": {
"dclm": 0.023993490263819695,
"english": 0.9737717509269714,
"fineweb_edu_approx": 1.9026355743408203,
"eai_general_math": 0.3337000608444214,
"eai_open_web_math": 0.28215527534484863,
"eai_web_code": 0.0335313081741333
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"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": "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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,578,177,487,669,930,000 |
Glassdoor google software engineer
glassdoor google software engineer photo - 1
The glassdoor google software engineer is developing at a frantic pace. New versions of the software should be released several times a quarter and even several times a month.
Update for glassdoor google software engineer.
There are several reasons for this dynamic:
First, new technologies are emerging, as a result, the equipment is being improved and that, in turn, requires software changes.
Secondly, the needs of users are growing, requirements are increasing and the needs are changing for glassdoor google software engineer.
Therefore, it is necessary to monitor changes in the glassdoor google software engineer and to update it in a timely manner.
/ If you do not update in time, you can become a victim of viruses and scammers, which can lead to irreversible consequences. Be careful!/
There are many sources for obtaining information on software.
|
{
"url": "https://ricksnursery.com/glassdoor-google-software-engineer/",
"source_domain": "ricksnursery.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "49470",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IMH5Q2YB7LVFDURYGMURGHLZD6NMR2PT",
"WARC-Concurrent-To": "<urn:uuid:423417f0-4ffd-4f32-98a1-702dbc42413d>",
"WARC-Date": "2021-07-30T23:22:23Z",
"WARC-IP-Address": "148.251.49.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DG7R7KXPT42XQ7S3IR6QZNUNGB2DSASA",
"WARC-Record-ID": "<urn:uuid:6ecc9328-ea44-4e05-aee6-d436e4966829>",
"WARC-Target-URI": "https://ricksnursery.com/glassdoor-google-software-engineer/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ac2a5508-e662-4fb7-ab24-aca67d429c45>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-157.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
35,
36,
81,
82,
258,
259,
306,
307,
351,
480,
617,
742,
743,
882,
883
],
"line_end_idx": [
35,
36,
81,
82,
258,
259,
306,
307,
351,
480,
617,
742,
743,
882,
883,
944
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 944,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4047619104385376,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1369047611951828,
"rps_doc_frac_unique_words": 0.5410959124565125,
"rps_doc_mean_word_length": 5.2602739334106445,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.076951026916504,
"rps_doc_word_count": 146,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1770833283662796,
"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.1171875,
"rps_doc_frac_chars_top_3gram": 0.1796875,
"rps_doc_frac_chars_top_4gram": 0.2421875,
"rps_doc_books_importance": -53.94789505004883,
"rps_doc_books_importance_length_correction": -53.94789505004883,
"rps_doc_openwebtext_importance": -30.972267150878906,
"rps_doc_openwebtext_importance_length_correction": -18.31600570678711,
"rps_doc_wikipedia_importance": -24.263315200805664,
"rps_doc_wikipedia_importance_length_correction": -24.263315200805664
},
"fasttext": {
"dclm": 0.3071190118789673,
"english": 0.9596056342124939,
"fineweb_edu_approx": 2.5789544582366943,
"eai_general_math": 0.5852890014648438,
"eai_open_web_math": 0.304969847202301,
"eai_web_code": 0.018583420664072037
}
}
|
{
"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.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,413,712,632,285,515,000 |
I haven’t installed Windows 98 in a LONG time but my Libretto is a Pentium 75MHz so Windows 98 is a reasonable choice of an operating system for it since thus far I’ve been unable to make a modern Linux distribution work with the system. I wanted to how well Windows 98 stacks up to a modern operating system.
I have a pair of Libretto 50CT’s. Both of which have adapters so I can use Compact Flash cards as hard drives instead of the noisy and power-hungry 810mb drives that ship with them. This allows me to swap out drives quickly and easily. Since the Libretto won’t boot of the pcmcia CD-ROM drive and I no longer have the Windows 98 startup floppy, I simply placed the Compact Flash card in a different ancient system for installation purposes. That worked out just fine and the install went smoothly. Before I put the card into the Libretto, I did the smart thing and copied the win98 directory off of the CD-ROM onto the hard drive for future reference. The reason for this follows…
Windows 98 has some idiosyncrasies compared to a more modern OS like XP. Pretty much every time you sneeze on some configuration parameter, you are required to insert the Windows 98 CD, copy files off of it and reboot the system. Yes, this is archaic and annoying but back in 98′s heyday, hard drives were MUCH smaller so you wouldn’t have wanted to waste a bunch of disk space storing all of the CAB(cabinet) files. People complain how XP and newer systems are so bloated, this is one reason that they are… The CAB files are on the hard disk AND they have MANY MANY more drivers preloaded so that many hardware devices are covered on at least some level.
After I got Windows 98 installed and the CAB files copied over, I swapped the Compact Flash card into the Libretto. As expected, when it first booted up, it updated drivers for the Libretto’s hardware configuration. It needed to go through a couple of reboots to get it right but they were soft reboots. An advantage of Windows 98 was that it was built on MS-DOS so it had the ability to soft-reboot where it would just kill the GUI and go down to the DOS level and restart from there. This saves you the pain of the POST sequence and ram count. After it was booted up and running, I was surprised and impressed that ALL the hardware seemed to be working perfectly. I was expecting to have to track down Windows 98 drivers for the screen and sound but the Windows 98 second edition seems to have the Libretto 50CT covered perfectly.
Next, I wanted to get some wifi working so I found a SMC 2632W 16-bit PCMCIA wifi card in my stash. First I’ll mention the bad… WEP only. As far as I know, there are no 16-bit PCMCIA wifi cards that support WPA/WPA2. No surprises here. I have a sandboxed access point to connect WEP devices to anyways so no worries here. On the good note, SMC still has the Windows 98 driver for this particular card available on their website. I copied the driver onto another CF card on my MacBook and put it in an adapter in the PCMCIA slot in the Libretto, after I copied it to the system, I remembered something else… No built in unzipping tool. Back to the web I found an old pkunzip.exe file somewhere and copied that onto the Libretto. I put pkunzip in the C:\windows directory and associated it to zip files and ran into another failure. Pkunzip doesn’t respect directory structure of the zip files by default so I found the dialog to edit file associations and added a “-d” parameter to the pkunzip command. This fixed the issues and I was able to move on with the installation.
I inserted the card and then pointed the hardware wizard at the desktop where I had unzipped the SMC drivers. This went fine but the driver is REALLY kludgy. There is no way to perform a scan of available access points(something else we take for granted). Obviously I knew the AP I wanted to connect to but it took a reboot before it was all working properly. After the reboot, I tried a ping…. SUCCESS! So then I tried internet explorer and the home page it was set to actually crashed it. I opened it back up and stopped the page from loading and then hit up google. OUCH! Surfing modern sites on this thing is SLOOOOOWWWW. Oddly, surfing web 1.0 sites is just fine though.
The next thing I tried to do is Windows Update. I went to the page and was informed that support had stopped in 2006 and only the updates to that date would be available. Unfortunately, this did not prove to be true. It appears that Microsoft has finally shut down the Windows 98 update servers entirely. Not that I blame them but it would have been nice if they just scaled them down to one old server or something. Oh well, I won’t be using this thing outside of a firewall anytime soon.
The last thing I did was put a keyboard banger program on this system for my son to mess around with. He got a kick out of it and played with it for a good 45 minutes. I think he likes this system because it’s so small. His 2.5 year old fingers are probably the perfect size for touch typing on a Libretto. :-)
If you like the content on this site, please support it by using this link to order from Amazon. You know you were going to go there and buy stuff anyhow so why not help me pay the hosting bill.
|
{
"url": "http://www.notanon.com/retro/installing-windows-98-on-my-libretto-50ct/2010/09/24/",
"source_domain": "www.notanon.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "49642",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7ZOGL5ZMISOMZLLUCMGE4ODVX2TTXJPC",
"WARC-Concurrent-To": "<urn:uuid:2ae9e198-54bf-4a9a-9266-cc0a84abba98>",
"WARC-Date": "2014-12-23T03:40:25Z",
"WARC-IP-Address": "192.232.223.67",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:H7KFA4G3DBBHDD4OOFP3UBXH3P3BBMK7",
"WARC-Record-ID": "<urn:uuid:20ee07ae-252f-4af0-b05c-7047f35cac77>",
"WARC-Target-URI": "http://www.notanon.com/retro/installing-windows-98-on-my-libretto-50ct/2010/09/24/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f2c4205-b37f-42e9-98da-d5bbd58273e9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 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,
311,
312,
999,
1000,
1660,
1661,
2500,
2501,
3585,
3586,
4272,
4273,
4768,
4769,
5084,
5085,
5086,
5087
],
"line_end_idx": [
311,
312,
999,
1000,
1660,
1661,
2500,
2501,
3585,
3586,
4272,
4273,
4768,
4769,
5084,
5085,
5086,
5087,
5281
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5281,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45356178283691406,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07213705778121948,
"rps_doc_frac_lines_end_with_ellipsis": 0.05263157933950424,
"rps_doc_frac_no_alph_words": 0.11541929841041565,
"rps_doc_frac_unique_words": 0.4094165861606598,
"rps_doc_mean_word_length": 4.249743938446045,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.004508569836616516,
"rps_doc_unigram_entropy": 5.302789211273193,
"rps_doc_word_count": 977,
"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.02601156011223793,
"rps_doc_frac_chars_top_3gram": 0.01445087045431137,
"rps_doc_frac_chars_top_4gram": 0.009152219630777836,
"rps_doc_books_importance": -608.3644409179688,
"rps_doc_books_importance_length_correction": -608.3644409179688,
"rps_doc_openwebtext_importance": -278.2012023925781,
"rps_doc_openwebtext_importance_length_correction": -278.2012023925781,
"rps_doc_wikipedia_importance": -186.42605590820312,
"rps_doc_wikipedia_importance_length_correction": -186.42605590820312
},
"fasttext": {
"dclm": 0.01961660012602806,
"english": 0.9373710751533508,
"fineweb_edu_approx": 1.1245532035827637,
"eai_general_math": 0.599016010761261,
"eai_open_web_math": 0.27053743600845337,
"eai_web_code": 0.06273108720779419
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,848,155,782,726,736,000 |
show-branch: use commit-slab for commit-name instead of commit->util
[git/git.git] / object.h
... / ...
CommitLineData
1#ifndef OBJECT_H
2#define OBJECT_H
3
4struct object_list {
5 struct object *item;
6 struct object_list *next;
7};
8
9struct object_array {
10 unsigned int nr;
11 unsigned int alloc;
12 struct object_array_entry {
13 struct object *item;
14 /*
15 * name or NULL. If non-NULL, the memory pointed to
16 * is owned by this object *except* if it points at
17 * object_array_slopbuf, which is a static copy of the
18 * empty string.
19 */
20 char *name;
21 char *path;
22 unsigned mode;
23 } *objects;
24};
25
26#define OBJECT_ARRAY_INIT { 0, 0, NULL }
27
28#define TYPE_BITS 3
29/*
30 * object flag allocation:
31 * revision.h: 0---------10 26
32 * fetch-pack.c: 0----5
33 * walker.c: 0-2
34 * upload-pack.c: 4 11----------------19
35 * builtin/blame.c: 12-13
36 * bisect.c: 16
37 * bundle.c: 16
38 * http-push.c: 16-----19
39 * commit.c: 16-----19
40 * sha1-name.c: 20
41 * list-objects-filter.c: 21
42 * builtin/fsck.c: 0--3
43 * builtin/index-pack.c: 2021
44 * builtin/pack-objects.c: 20
45 * builtin/reflog.c: 10--12
46 * builtin/unpack-objects.c: 2021
47 */
48#define FLAG_BITS 27
49
50/*
51 * The object type is stored in 3 bits.
52 */
53struct object {
54 unsigned parsed : 1;
55 unsigned type : TYPE_BITS;
56 unsigned flags : FLAG_BITS;
57 struct object_id oid;
58};
59
60extern const char *type_name(unsigned int type);
61extern int type_from_string_gently(const char *str, ssize_t, int gentle);
62#define type_from_string(str) type_from_string_gently(str, -1, 0)
63
64/*
65 * Return the current number of buckets in the object hashmap.
66 */
67extern unsigned int get_max_object_index(void);
68
69/*
70 * Return the object from the specified bucket in the object hashmap.
71 */
72extern struct object *get_indexed_object(unsigned int);
73
74/*
75 * This can be used to see if we have heard of the object before, but
76 * it can return "yes we have, and here is a half-initialised object"
77 * for an object that we haven't loaded/parsed yet.
78 *
79 * When parsing a commit to create an in-core commit object, its
80 * parents list holds commit objects that represent its parents, but
81 * they are expected to be lazily initialized and do not know what
82 * their trees or parents are yet. When this function returns such a
83 * half-initialised objects, the caller is expected to initialize them
84 * by calling parse_object() on them.
85 */
86struct object *lookup_object(const unsigned char *sha1);
87
88extern void *create_object(const unsigned char *sha1, void *obj);
89
90void *object_as_type(struct object *obj, enum object_type type, int quiet);
91
92/*
93 * Returns the object, having parsed it to find out what it is.
94 *
95 * Returns NULL if the object is missing or corrupt.
96 */
97struct object *parse_object(const struct object_id *oid);
98
99/*
100 * Like parse_object, but will die() instead of returning NULL. If the
101 * "name" parameter is not NULL, it is included in the error message
102 * (otherwise, the hex object ID is given).
103 */
104struct object *parse_object_or_die(const struct object_id *oid, const char *name);
105
106/* Given the result of read_sha1_file(), returns the object after
107 * parsing it. eaten_p indicates if the object has a borrowed copy
108 * of buffer and the caller should not free() it.
109 */
110struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p);
111
112/** Returns the object, with potentially excess memory allocated. **/
113struct object *lookup_unknown_object(const unsigned char *sha1);
114
115struct object_list *object_list_insert(struct object *item,
116 struct object_list **list_p);
117
118int object_list_contains(struct object_list *list, struct object *obj);
119
120/* Object array handling .. */
121void add_object_array(struct object *obj, const char *name, struct object_array *array);
122void add_object_array_with_path(struct object *obj, const char *name, struct object_array *array, unsigned mode, const char *path);
123
124/*
125 * Returns NULL if the array is empty. Otherwise, returns the last object
126 * after removing its entry from the array. Other resources associated
127 * with that object are left in an unspecified state and should not be
128 * examined.
129 */
130struct object *object_array_pop(struct object_array *array);
131
132typedef int (*object_array_each_func_t)(struct object_array_entry *, void *);
133
134/*
135 * Apply want to each entry in array, retaining only the entries for
136 * which the function returns true. Preserve the order of the entries
137 * that are retained.
138 */
139void object_array_filter(struct object_array *array,
140 object_array_each_func_t want, void *cb_data);
141
142/*
143 * Remove from array all but the first entry with a given name.
144 * Warning: this function uses an O(N^2) algorithm.
145 */
146void object_array_remove_duplicates(struct object_array *array);
147
148/*
149 * Remove any objects from the array, freeing all used memory; afterwards
150 * the array is ready to store more objects with add_object_array().
151 */
152void object_array_clear(struct object_array *array);
153
154void clear_object_flags(unsigned flags);
155
156/*
157 * Clear the specified object flags from all in-core commit objects.
158 */
159extern void clear_commit_marks_all(unsigned int flags);
160
161#endif /* OBJECT_H */
|
{
"url": "https://git.uis.cam.ac.uk/x/uis/git/git.git/blame_incremental/60855a5343d4fb7b232ee7ed1e0aee18f312b9ec:/object.h",
"source_domain": "git.uis.cam.ac.uk",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "35752",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O263P3QIGIGR4ETF5ERQSS4DISSMVFJ2",
"WARC-Concurrent-To": "<urn:uuid:4ca308e1-676e-4b64-928f-9836975f22ce>",
"WARC-Date": "2021-03-07T00:07:51Z",
"WARC-IP-Address": "131.111.9.100",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:5ADBQCV4ROYOGAJJ3MH4DUJ3VSPJHENT",
"WARC-Record-ID": "<urn:uuid:0ced3c4c-d547-4e2f-916d-b651da9ae44b>",
"WARC-Target-URI": "https://git.uis.cam.ac.uk/x/uis/git/git.git/blame_incremental/60855a5343d4fb7b232ee7ed1e0aee18f312b9ec:/object.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f5a3bfd3-c2ae-43f4-961c-43c15235064e>"
},
"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-215.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,
69,
94,
104,
119,
137,
155,
157,
179,
202,
230,
234,
236,
259,
279,
302,
333,
357,
363,
417,
471,
528,
547,
553,
568,
583,
601,
616,
621,
624,
667,
670,
692,
697,
726,
759,
785,
804,
847,
875,
893,
911,
939,
964,
985,
1016,
1042,
1074,
1106,
1136,
1172,
1178,
1201,
1204,
1209,
1251,
1257,
1275,
1299,
1329,
1360,
1385,
1390,
1393,
1444,
1520,
1588,
1591,
1596,
1661,
1667,
1717,
1720,
1725,
1797,
1803,
1861,
1864,
1869,
1941,
2013,
2067,
2072,
2139,
2210,
2279,
2350,
2423,
2463,
2469,
2528,
2531,
2599,
2602,
2680,
2683,
2688,
2754,
2759,
2814,
2820,
2880,
2883,
2888,
2962,
3034,
3081,
3088,
3174,
3178,
3247,
3317,
3370,
3377,
3516,
3520,
3593,
3661,
3665,
3728,
3762,
3766,
3841,
3845,
3879,
3971,
4106,
4110,
4116,
4193,
4267,
4341,
4357,
4364,
4428,
4432,
4513,
4517,
4523,
4595,
4668,
4693,
4700,
4756,
4807,
4811,
4817,
4884,
4939,
4946,
5014,
5018,
5024,
5101,
5173,
5180,
5236,
5240,
5284,
5288,
5294,
5366,
5373,
5432,
5436
],
"line_end_idx": [
69,
94,
104,
119,
137,
155,
157,
179,
202,
230,
234,
236,
259,
279,
302,
333,
357,
363,
417,
471,
528,
547,
553,
568,
583,
601,
616,
621,
624,
667,
670,
692,
697,
726,
759,
785,
804,
847,
875,
893,
911,
939,
964,
985,
1016,
1042,
1074,
1106,
1136,
1172,
1178,
1201,
1204,
1209,
1251,
1257,
1275,
1299,
1329,
1360,
1385,
1390,
1393,
1444,
1520,
1588,
1591,
1596,
1661,
1667,
1717,
1720,
1725,
1797,
1803,
1861,
1864,
1869,
1941,
2013,
2067,
2072,
2139,
2210,
2279,
2350,
2423,
2463,
2469,
2528,
2531,
2599,
2602,
2680,
2683,
2688,
2754,
2759,
2814,
2820,
2880,
2883,
2888,
2962,
3034,
3081,
3088,
3174,
3178,
3247,
3317,
3370,
3377,
3516,
3520,
3593,
3661,
3665,
3728,
3762,
3766,
3841,
3845,
3879,
3971,
4106,
4110,
4116,
4193,
4267,
4341,
4357,
4364,
4428,
4432,
4513,
4517,
4523,
4595,
4668,
4693,
4700,
4756,
4807,
4811,
4817,
4884,
4939,
4946,
5014,
5018,
5024,
5101,
5173,
5180,
5236,
5240,
5284,
5288,
5294,
5366,
5373,
5432,
5436,
5460
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5460,
"ccnet_original_nlines": 164,
"rps_doc_curly_bracket": 0.001831499976105988,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18353909254074097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014814809896051884,
"rps_doc_frac_lines_end_with_ellipsis": 0.006060610059648752,
"rps_doc_frac_no_alph_words": 0.4502057731151581,
"rps_doc_frac_unique_words": 0.5524568557739258,
"rps_doc_mean_word_length": 5.345285415649414,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.007407410070300102,
"rps_doc_unigram_entropy": 5.564319610595703,
"rps_doc_word_count": 753,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02186335064470768,
"rps_doc_frac_chars_dupe_6grams": 0.02186335064470768,
"rps_doc_frac_chars_dupe_7grams": 0.02186335064470768,
"rps_doc_frac_chars_dupe_8grams": 0.02186335064470768,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02236025035381317,
"rps_doc_frac_chars_top_3gram": 0.01689440943300724,
"rps_doc_frac_chars_top_4gram": 0.008944099768996239,
"rps_doc_books_importance": -570.2540283203125,
"rps_doc_books_importance_length_correction": -570.2540283203125,
"rps_doc_openwebtext_importance": -326.07958984375,
"rps_doc_openwebtext_importance_length_correction": -326.07958984375,
"rps_doc_wikipedia_importance": -236.0779266357422,
"rps_doc_wikipedia_importance_length_correction": -236.0779266357422
},
"fasttext": {
"dclm": 0.7861534357070923,
"english": 0.6294571757316589,
"fineweb_edu_approx": 2.315887689590454,
"eai_general_math": 0.23445391654968262,
"eai_open_web_math": 0.0734826922416687,
"eai_web_code": 0.956749677658081
}
}
|
{
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,696,201,727,536,106,000 |
Introduction
In 1991, the first documented version of the request-response HTTP (HTTP 0.9) protocol was introduced. Since then, the web has drastically expanded and, 24 years later, the most recent version of HyperText Transfer Protocol (HTTP/2) was released in 2015, introducing a multitude of possible benefits to site performance when correctly implemented.
This article is aimed at SEOs wishing to implement HTTP/2 as part of their page speed optimisation initiatives.
HTTP/2 is an extremely rich topic which could be discussed in great detail. There is a wealth of online information discussing HTTP/2 and it’s wider benefits for end-users and developers, but before you find yourself immersed in the wealth of information around HTTP/2, make certain you’re getting the information that you need. This begins with asking the right questions:
1. How will this directly impact search engine optimisation and/or page speed?
2. Can a recommendation be made off of the insight?
3. Can the recommendation realistically be carried out?
These questions help you to ask “is what I am doing effective and valuable?” and ultimately put you in a better position to evaluate how HTTP/2 can help improve a website.
Due to the broad nature of the topic, there is a large amount of knowledge around HTTP/2 that is not needed when trying to understand the importance to SEO. The core benefit of HTTP/2 for SEO is Page Speed.
To help you navigate through the wealth of online information, here is an introduction to HTTP/2, describing the evolution from HTTP 1.1 through to Google’s HTTP compatible Spdy and eventually to HTTP/2.
Understanding how the web has evolved will help highlight the improvements that have been made to it as a consequence of the addition of the HTTP/2 protocol.
How does Google evaluate Page Speed?
To look at how Google evaluates Page Speed look no further than the Chrome User Experience Reports. These reports provide user experience metrics for how users are experiencing popular destinations across the web. This is powered using key user engagement metrics (First Paint, First Contentful Paint, First Meaningful Paint, Time to Interactive) and is further supported via common tools such as Page Speed Insights, Public Google Big Query Project, Lighthouse, and Web Page Test. Utilising these metrics and tools can help make possible improvements around Page Speed.
Introduction to HTTP/2
HTTP 1.1
By 2015, HTTP 1.1 had become outdated. Gone were the days where web pages/sites were built/relied on basic HTML, CSS, and JavaScript, and numerous resources and different frameworks. The pre-2015 era was based on the idea that you were limited to one request per TCP connection. This led to situations where web clients had multiple resources queuing for download, causing congestion of the network and slow page loading times.
HTTP/2 was designed to target three main areas of improvement to alleviate the issues discussed above:
• Simplicity
• High Performance
• Robustness
SEO Benefits for HTTP/2
Page Speed is probably the primary reason that SEOs would consider implementing HTTP/2 across either their own or their client's websites. Page Speed/ Performance is a set of metrics which have been a ranking factor since 2010 for Desktop queries. Due to the rise of mobile device usage, in July 2018 Google officially announced that Page Speed would become a ranking factor for Mobile.
HTTP/2 provides 3 main functionalities which can be utilised when optimising sites for Page Speed:
1. Multiplexing
2. Server Push
3. Stream Prioritisation
Multiplexing
Multiplexing allows a web client to include multiple requests within one single TCP connection, resulting in lower server load and reducing network congestion.
Modern web clients (Chrome, Firefox, Safari and Opera) utilising the older HTTP 1/1.1 protocols have a default limit on the number of simultaneous TCP connections per hostname. Therefore, a web client utilising HTTP 1/1.1 can easily have difficulty with TCP congestion. With modern web clients, this issue is resolved using multiplexing, which can give some of the most significant improvements to page speed.
Demonstrated below is the benefit of Multiplexing using a comparison of HTTP/1.1 and HTTP/2, showing typical behaviour for when HTTP/2 multiplexing is and is not enabled.
(WebpageTest, HTTP/1.1, No Multiplexing Demonstrated)
(WebpageTest, HTTP/2, Multiplexing Demonstrated)
In the images above a performance-based waterfall is used to demonstrate the loading of resources between a user (who requests the resources) and the server (who responds with the resources) of a webpage. Typically, page resources include HTML, JavaScript, CSS and images. The performance-based waterfall demonstrates the exact point as to when a specific resource is called, downloaded and rendered within the client which is critical in discovering, evaluating and analysing page speed issues on a site. As demonstrated by the image above “HTTP/2”, all resources begin downloading concurrently without any resources beginning to load at a different point. As HTTP/2 utilises multiplexing and no longer relies on sending only 1 request over a single TCP connection, multiple resources can be downloaded at the same time seen above. In contrast, as demonstrated by image “HTTP/1.1”, resources do not download concurrently as they are unable to utilise the multiplexing functionality. The average modern browser under HTTP/1.1 is able to concurrently have 6 connections, but the benefit for implementing HTTP/2 is that a TCP handshake is not needed for every request whereas no matter how many connections can concurrently run with HTTP/1.1 an initial connection process must be completed every time. Therefore they are beginning to download at different points thus causing a longer page load for the user.
(Upwork HTTP/1.1 vs HTTP/2 Diagram)
Search crawlers such as Google and Bing do not directly benefit from HTTP/2 implementation. As described above the major benefit from these optimisations could potentially be for Page Speed. Therefore although HTTP/2 implementation may not affect the search crawler directly, it can impact Page Speed which is a direct ranking factor for Google for Desktop queries since 2010 and Mobile queries since July 2018. As a result, it's critical that websites are not delivering a slow experience to users, as Google may suppress performance by impacting rankings, or more recently, flagging to users that your site may be slow.
Server Push
Server Push allows the specific server or edge network to send resources to web clients when they have not been requested by the client. For an understanding of how server push functions, it’s first important to understand the request-response pattern that a website follows. A user requests a page from a website, and the server responds with the requested content/resource.
Hypothetically, think about a site which has all of its styles defined in an external style sheet called styles.css. When the user requests the HTML skeleton for the page (let’s say in this case index.html) server push can “push” the CSS to the user right after beginning to send a response to index.html.
(Smashing Magazine, Server Push)
Before understanding how Server Push can help improve Page Speed it is important to understand how a browser works with different resources such as images, CSS, and JavaScript to appear within your browser. You see, the browser sends instructions for how to download images, CSS, and JavaScript resources. When first visiting a website you usually make a GET request, which is the .html file. Once this .html file is received, the browser scans through it to understand it and then may make additional GET requests depending on what is contained within the HTML file.
How does Server Push help improve Page Speed?
Through the use of Server Push, the number of GET requests needed from the browser (round trips) are reduced and delays in rendering that cause increased page load times are avoided. This can dramatically help improve the rendering time for the web client, which helps the webpage appear quicker for users thereby providing them with a far better experience.
While Server Push does not directly impact how Googlebot crawls your site, or indeed other crawlers, the SEO benefit is gained through improvements to user-centric factors such as First Paint and First Meaningful Content.
Utilising Web Page Test, Lighthouse, Page Speed Insights, and the Chrome User Experience Report, you can determine how a site/page is performing in comparison to competitors within the same industries. Below are two images demonstrating implementation without (Image 1) and with Server Push (Image 2).
(WebpageTest, Without Server Push)
(WebpageTest, HTTP/1.1, With Server Push)
With server push, the server can be configured so that it always sends any additional page components (such as CSS files, JavaScript and images) if it is asked to send over the .html file containing them.
In the waterfalls above we can see that push.php uses four CSS files.
Without server push, the browser needs to receive the push.php file, parse the HTML and then make specific requests for each additional CSS file. Only once it’s received all CSS files can it start using them in the rendering process.
When server push is enabled, the request for push.php automatically triggers the server to send over the four CSS files. The browser receives them and can start using them in the rendering process much earlier. This means the browser can start rendering the page content much sooner, which results in better page speed metrics.
HTTP/2 Prioritisation
HTTP/2 Prioritisation hands control of the order in which resources are loaded, back to site owners. Done properly, Prioritisation benefits user experience and Page/Site speed by delivering page resources in an optimised order, thus creating a “fast” user experience.
If we look at HTTP/2’s predecessor HTTP/1.1, the web client controlled the order of when resources would be loaded. As discussed above this was due to the fact that each TCP connection was only able to support one resource at a time. It is up to the browser to schedule requests by deciding what resources to choose and how many connections to open in parallel.
Before getting into how it’s done, it is important to understand why we would want to use Prioritisation for our resources.
If we have an image at the top of a page and an image at the bottom of the page, logically we would want to make sure the image at the top loads before the image at the bottom. This concept helps demonstrate the importance and impact of HTTP/2 Prioritisation can bring. HTTP/2 prioritisation allows us to specify which resources should be delivered first and load before others (whether they are JavaScript, CSS, or images), thus ensuring the fastest load time for the page.
While the browser can now request multiple resources simultaneously over a single TCP connection using multiplexing, it can now also specify priority information with each request to help determine when/how the resource should be delivered. If both the server and the browser supports HTTP/2 Prioritisation the browser should define the rules for prioritisation utilising full bandwidth without having resources competing with each other. In order to better understand how the prioritisation process functions it’s important to discuss three parameters which are important for HTTP/2 Prioritisation:
Stream: This is a bidirectional flow of bytes within an established connection which may carry one or messages.
Parent Stream: This is a stream which the resources are dependent on
Child Stream: This is a dependent stream of the parent stream. They share the same parent and thus are known as child stream
Weight: This is a number allocated between 1 and 256 which identifies how much bandwidth to allocate to stream if multiple streams are sharing a connection. Bandwidth is allocated relative to the weights of all other active streams.
Exclusive Bit: This is a flag indicating that the stream should be downloaded without sharing bandwidth with any other streams.
Headers Frame: This is the identification for the stream to which frame it belongs to
Binary Framing Layer: This is how HTTP messages are encapsulated and transferred between client and server
An example below demonstrates an example of the above:
(Google Developers HTTP/2 Stream Prioritisation)
In order to carry out HTTP/2 Prioritisation, you will need to add prioritisation information within the Headers Frame located within the new HTTP/2 Binary Framing Layer. The parent stream and dependency/non-dependency on other child streams will determine the priority/weighting and thus the delivery to the web client of the resource.
Although HTTP/2 prioritisation is now supported across numerous platforms, many CDNs and hosting providers do not support HTTP/2 prioritisation. It is therefore important to make sure that you are utilising a CDN/hosting provider that does support HTTP/2 prioritisation if you wish to use this optimisation technique. Below is a table describing which CDN/hosting/servers are able and unable to support HTTP/2 Prioritisation.
HTTP/2 Prioritisation - Common Server/Hosting/CDNs Compatibility
This comparison was correct on 02/01/2020, but it’s worth checking if potential service providers have improved their compatibility before making your decision about which to choose.
It is also important to look at specific browsers critically because unfortunately not all browsers support HTTP/2 prioritisation and prioritise differently due to being different web clients. Below is a table describing which web clients are able to support HTTP/2 Prioritisation.
HTTP/2 Prioritisation Web Client Compatibility
HTTP/2 Prioritisation can significantly improve a user’s perception of Page/Site Speed and will positively impact the data accumulated within the Chrome User Experience Report. While this optimisation has no impact on search crawlers such as Googlebot, tools such as Lighthouse and Page Speed Insights will help you assess the impact of HTTP/2 Prioritisation on page speed performance from a user’s perspective.
By correctly configuring the stream weight with both server and client utilising an HTTP/2 supported CDN/host, you’ll be able to drastically improve your page speed metrics for your client.
What are the prerequisites for HTTP/2
Before you’re able to take advantage of the speed benefits of HTTP/2, make certain that you’re able to utilise it. There are a few prerequisites that need to be taken into account:
1. It’s important to make certain that HTTPS is enabled.
2. Utilise a TLS certificate from an authenticated authority and activate and install the certificate.
3. Make certain that your Web Server software such as Nginx, Apache, and IIS supports HTTP/2. A full authenticated list for support can be found at http://ayi.ma/browsershttp2 which will show browser support for HTTP/2. If you’re looking for HTTP/2 support for CDN’s/Hosting please refer to http://ayi.ma/serverhosting
Common Pitfalls / Things That Must Change with the Introduction of HTTP/2
Due to the limitations of the earlier HTTP 1.0 and HTTP 1.1 protocols, developers and SEOs have strived to find ways around the multitude of issues that these limitations presented for page speed performance and security.
Eventually, they were able to find “hacks” to side-step some of these limitations, but many of these methods caused developers even more work. What are some of these hacks you may ask? Here are some of the most common hacks you’ll see on sites which can be resolved through the correct implementation of HTTP/2.
Avoid Domain Sharding
Surprisingly, a multitude of sites still use this hack although they have HTTP/2 correctly implemented. When HTTP/2 is enabled it will be important to avoid utilising domain sharding. Domain Sharding is the technique of splitting resources across different hostnames, thus allowing more resources to be served simultaneously.
Thanks to the updated HTTP/2 protocol, Domain Sharding is no longer needed and in fact, causes more issues than it resolves. If HTTP/2 is correctly configured and enabled for your site and you also use Domain Sharding, you are actually counteracting some of the benefits of HTTP/2 since the browser will be unable to benefit from multiplexing and downloads across multiple hostnames.
Furthermore, through Domain Sharding you are actually breaking Stream Prioritisation and your resources will not be able to be loaded to get the most out of Page Speed.
Properly Utilise Server Push
Server Push has some drawbacks that you should be aware of. Server Push can, in fact, be overused and you should be selective when choosing when to use it. You do not necessarily want to push too many resources since this could cause the web client to download not only HTML but everything that it is “pushed” with. This means that the page might actually take longer to load and render (increasing user-centric metrics that are focused on by Google such as Time to Interactive).
A second common pitfall for server push is figuring out how to not push resources that the web client already has. This can be controlled through numerous methods. One method is to choose to not push resources to returning users and therefore allow the returned users to utilise their cached assets. This is by far the easiest implementation. This can simply be done by checking the cache headers for the resources making sure that the headers do not overlap with the server push implementation.
Real-Life Tests under HTTP/2
Theoretical knowledge is always important for laying the foundation to understanding HTTP/2 and its benefits. Once the concepts are grasped and understood though it’s important to test these theories in order to measure the impact HTTP/2 can make to Page Speed.
Part 2 of this Page Speed series HTTP/2 In Real Life - using Website Tests & Analysis will discuss the true benefit of HTTP/2 in regard to Page Speed and value for SEO, so don't miss out!
What about HTTP/3?
Although HTTP/3 demonstrates clear potential as the successor protocol to HTTP/2, it does not and should not signal the end of HTTP/2 for SEO’s across the web. As with every new major development to the worldwide web, it will go through a normal rollout phase and it will probably take time for a site to adopt the new protocol and before it becomes a de-facto standard within the SEO industry. HTTP/2 implementation still represents a beneficial and simple gain that when implemented correctly can help improve your site's performance.
Learn about our free, personalised insights club
More Insights
The Future of SEO: Key SEO Trends
13 January 2022
Digital Marketing Roundup of 2021
07 January 2022
The impact of ad blockers on your digital marketing
09 December 2021
|
{
"url": "https://www.ayima.com/uk/insights/an-introduction-to-http-2-page-speed.html",
"source_domain": "www.ayima.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "80472",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6NNIUKNKSDOZK3WI3WZJTFYKTDQI6U6K",
"WARC-Concurrent-To": "<urn:uuid:a27fc80a-85b7-4ef3-bd21-ef3d465a0b3c>",
"WARC-Date": "2022-01-19T11:37:26Z",
"WARC-IP-Address": "172.66.40.80",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y7ZZGC2WB5TFWFYJD5FGB2VVQBUH6QUP",
"WARC-Record-ID": "<urn:uuid:a1557aef-7ca3-4cc6-b7fe-c63f1920a0f3>",
"WARC-Target-URI": "https://www.ayima.com/uk/insights/an-introduction-to-http-2-page-speed.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8456a605-a98f-4e21-90da-b29c6a128b57>"
},
"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-11\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,
13,
14,
362,
363,
475,
476,
850,
851,
932,
986,
1044,
1045,
1217,
1218,
1426,
1427,
1632,
1633,
1792,
1793,
1830,
1831,
2402,
2403,
2426,
2427,
2436,
2437,
2866,
2867,
2970,
2971,
2986,
3007,
3022,
3023,
3047,
3048,
3438,
3439,
3538,
3539,
3557,
3574,
3601,
3602,
3615,
3616,
3776,
3777,
4189,
4190,
4361,
4362,
4416,
4417,
4466,
4467,
5875,
5876,
5912,
5913,
6536,
6537,
6549,
6550,
6927,
6928,
7235,
7236,
7269,
7270,
7838,
7839,
7885,
7886,
8246,
8247,
8469,
8470,
8772,
8773,
8808,
8809,
8851,
8852,
9057,
9058,
9129,
9130,
9364,
9365,
9693,
9694,
9716,
9717,
9985,
9986,
10349,
10350,
10475,
10476,
10951,
10952,
11552,
11553,
11665,
11666,
11735,
11736,
11861,
11862,
12095,
12096,
12225,
12226,
12313,
12314,
12421,
12422,
12477,
12478,
12527,
12528,
12865,
12866,
13292,
13293,
13358,
13359,
13542,
13543,
13825,
13826,
13873,
13874,
14286,
14287,
14478,
14479,
14517,
14518,
14700,
14701,
14760,
14866,
15187,
15188,
15262,
15263,
15487,
15488,
15800,
15801,
15823,
15824,
16151,
16152,
16537,
16538,
16708,
16709,
16738,
16739,
17220,
17221,
17717,
17718,
17747,
17748,
18010,
18011,
18199,
18200,
18219,
18220,
18758,
18759,
18808,
18809,
18823,
18824,
18858,
18859,
18875,
18876,
18910,
18911,
18927,
18928,
18980,
18981
],
"line_end_idx": [
13,
14,
362,
363,
475,
476,
850,
851,
932,
986,
1044,
1045,
1217,
1218,
1426,
1427,
1632,
1633,
1792,
1793,
1830,
1831,
2402,
2403,
2426,
2427,
2436,
2437,
2866,
2867,
2970,
2971,
2986,
3007,
3022,
3023,
3047,
3048,
3438,
3439,
3538,
3539,
3557,
3574,
3601,
3602,
3615,
3616,
3776,
3777,
4189,
4190,
4361,
4362,
4416,
4417,
4466,
4467,
5875,
5876,
5912,
5913,
6536,
6537,
6549,
6550,
6927,
6928,
7235,
7236,
7269,
7270,
7838,
7839,
7885,
7886,
8246,
8247,
8469,
8470,
8772,
8773,
8808,
8809,
8851,
8852,
9057,
9058,
9129,
9130,
9364,
9365,
9693,
9694,
9716,
9717,
9985,
9986,
10349,
10350,
10475,
10476,
10951,
10952,
11552,
11553,
11665,
11666,
11735,
11736,
11861,
11862,
12095,
12096,
12225,
12226,
12313,
12314,
12421,
12422,
12477,
12478,
12527,
12528,
12865,
12866,
13292,
13293,
13358,
13359,
13542,
13543,
13825,
13826,
13873,
13874,
14286,
14287,
14478,
14479,
14517,
14518,
14700,
14701,
14760,
14866,
15187,
15188,
15262,
15263,
15487,
15488,
15800,
15801,
15823,
15824,
16151,
16152,
16537,
16538,
16708,
16709,
16738,
16739,
17220,
17221,
17717,
17718,
17747,
17748,
18010,
18011,
18199,
18200,
18219,
18220,
18758,
18759,
18808,
18809,
18823,
18824,
18858,
18859,
18875,
18876,
18910,
18911,
18927,
18928,
18980,
18981,
18997
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18997,
"ccnet_original_nlines": 192,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3879072368144989,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03727222979068756,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1695196032524109,
"rps_doc_frac_unique_words": 0.2695011794567108,
"rps_doc_mean_word_length": 5.160026550292969,
"rps_doc_num_sentences": 160,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.7438273429870605,
"rps_doc_word_count": 2987,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02802829071879387,
"rps_doc_frac_chars_dupe_6grams": 0.014273669570684433,
"rps_doc_frac_chars_dupe_7grams": 0.004541620146483183,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015765909105539322,
"rps_doc_frac_chars_top_3gram": 0.003892820095643401,
"rps_doc_frac_chars_top_4gram": 0.004476740024983883,
"rps_doc_books_importance": -1732.8846435546875,
"rps_doc_books_importance_length_correction": -1732.8846435546875,
"rps_doc_openwebtext_importance": -1019.0997314453125,
"rps_doc_openwebtext_importance_length_correction": -1019.0997314453125,
"rps_doc_wikipedia_importance": -790.977294921875,
"rps_doc_wikipedia_importance_length_correction": -790.977294921875
},
"fasttext": {
"dclm": 0.05773628130555153,
"english": 0.9082390069961548,
"fineweb_edu_approx": 2.5850799083709717,
"eai_general_math": 0.2724722623825073,
"eai_open_web_math": 0.18014949560165405,
"eai_web_code": 0.6761603355407715
}
}
|
{
"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": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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
|
-666,176,847,787,688,000 |
【for MAC】ATOMエディタで使える便利なショートカット１０選！！！
Programing
「ATOMエディタで使えるショートカットを知りたい」
「便利に使いたいんだけど、なにかないかな」
今回、こんなお悩みにお答えします。
便利なショートカットを覚えて、サクサクプログミングを進めましょう！！
数多くある中でも良く使う物をまとめました！！
スポンサードサーチ
コピーアンドペースト
shift + command + D
行をshift + → or ←で選択して上記コマンドを入力すると、同じ下の行に複製。
コメントアウト
command + /
特定の行をコメントアウトして無効にしたい時に、入力。
スポンサードサーチ
デベロッパーツール（chrome）
command + option + i
特定のファイルをchromeでデベロッパーツールを開く。
スクリーンショット
shift + command + 4
画面のスクリーンショットを撮る。
スポンサードサーチ
改行
shift + Enter
改行は段落ないで文章と文章の間にスペースを空けたい時に使用。
これを２回を使うといい感じに改行が出来る。
段落分け
Enter
スポンサードサーチ
選択している行を上、下に移動させる
command + control + ↑
command + control + ↓
タブを閉じる
command + W
行の先頭、末尾へ移動
行の先頭へ
command + ←
行の末尾へ
command + →
カーソルを先頭や末尾に一発で移動したい時に使用。
特定の文字列を検索する
command + F
まとめ
いかがでしたか？
今回は10個だけでしたが、ショートカットはほかにもたくさんあります。
よく使うものだけを厳選してご紹介しました。これを使って快適なプログラミング人生をお送りください。
|
{
"url": "https://napoblog.com/sortcut/",
"source_domain": "napoblog.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "67757",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AVOVGAH2NTF3HM27A625MRESZ72GY7XY",
"WARC-Concurrent-To": "<urn:uuid:c94746dd-7488-4062-9f6e-e029816293e1>",
"WARC-Date": "2024-04-13T19:41:49Z",
"WARC-IP-Address": "59.106.13.168",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WELDHQBHEY7H7R2BJEL4TMZ4EAXIRZJE",
"WARC-Record-ID": "<urn:uuid:2910bba0-3389-4b0a-9a4d-840841733877>",
"WARC-Target-URI": "https://napoblog.com/sortcut/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:77e8d1df-f4c7-497c-aa67-a9bb1f64b7a9>"
},
"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-180\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,
38,
39,
50,
51,
78,
79,
101,
102,
120,
121,
156,
179,
180,
190,
191,
202,
203,
223,
224,
268,
269,
277,
278,
290,
291,
318,
319,
329,
330,
348,
349,
370,
371,
400,
401,
411,
412,
432,
433,
450,
451,
461,
462,
465,
466,
480,
481,
512,
534,
535,
540,
541,
547,
548,
558,
559,
577,
578,
579,
601,
602,
603,
625,
626,
633,
634,
646,
647,
658,
659,
665,
677,
678,
679,
685,
697,
698,
723,
724,
736,
737,
749,
750,
754,
755,
764,
765,
800,
801
],
"line_end_idx": [
38,
39,
50,
51,
78,
79,
101,
102,
120,
121,
156,
179,
180,
190,
191,
202,
203,
223,
224,
268,
269,
277,
278,
290,
291,
318,
319,
329,
330,
348,
349,
370,
371,
400,
401,
411,
412,
432,
433,
450,
451,
461,
462,
465,
466,
480,
481,
512,
534,
535,
540,
541,
547,
548,
558,
559,
577,
578,
579,
601,
602,
603,
625,
626,
633,
634,
646,
647,
658,
659,
665,
677,
678,
679,
685,
697,
698,
723,
724,
736,
737,
749,
750,
754,
755,
764,
765,
800,
801,
849
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 849,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02380952052772045,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0476190485060215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7539682388305664,
"rps_doc_frac_unique_words": 0.7384615540504456,
"rps_doc_mean_word_length": 11.600000381469727,
"rps_doc_num_sentences": 1,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.620145082473755,
"rps_doc_word_count": 65,
"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.03183024004101753,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -75.94400787353516,
"rps_doc_books_importance_length_correction": -75.94400787353516,
"rps_doc_openwebtext_importance": -41.06648254394531,
"rps_doc_openwebtext_importance_length_correction": -38.39852523803711,
"rps_doc_wikipedia_importance": -44.45222473144531,
"rps_doc_wikipedia_importance_length_correction": -44.45222473144531
},
"fasttext": {
"dclm": 0.9998760223388672,
"english": 0.00003963999915868044,
"fineweb_edu_approx": 2.859856367111206,
"eai_general_math": 0.9992755055427551,
"eai_open_web_math": 0.8060597777366638,
"eai_web_code": 0.028046490624547005
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"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,954,647,124,343,406,800 |
aboutsummaryrefslogtreecommitdiffstats
path: root/fusearchive.py
diff options
context:
space:
mode:
authorSteve Slaven <[email protected]>2009-07-28 17:04:22 (GMT)
committerSteve Slaven <[email protected]>2009-07-28 17:04:22 (GMT)
commit1d90b688c485fa1421db7103926af73cc2b6b6b1 (patch)
treedeb84bf20c46d60a7ffe0cc00568867128e53bdf /fusearchive.py
parente359815f31d40f3f7f8c6ed4b225a0181e6c2b8d (diff)
downloadfusearchive-1d90b688c485fa1421db7103926af73cc2b6b6b1.zip
fusearchive-1d90b688c485fa1421db7103926af73cc2b6b6b1.tar.gz
fusearchive-1d90b688c485fa1421db7103926af73cc2b6b6b1.tar.bz2
Bug fixes to extend via seek(), properly setting dirty flag and not trying
to pull up block -1
Diffstat (limited to 'fusearchive.py')
-rwxr-xr-xfusearchive.py16
1 files changed, 12 insertions, 4 deletions
diff --git a/fusearchive.py b/fusearchive.py
index 1c8cfb6..8573176 100755
--- a/fusearchive.py
+++ b/fusearchive.py
@@ -654,12 +654,20 @@ class FuseArchive(Fuse):
while index > len( self.chunks ):
logging.debug( "Not enough chunks " + str( len( self.chunks ) ) + ", need " +
str( index ) + ", extending" )
- self.chunk_index = -1
- while self.chunk_index < index:
- self._load_chunk( self.chunk_index + 1 )
+ this_index = -1
+ while this_index < index:
+ self._load_chunk( this_index + 1 )
fill_null = self.chunk_size - len(self.chunk)
- logging.debug( "Filling this chunk with null, bytes: " + fill_null )
+ logging.debug( "Filling this chunk with null, bytes: " + str( fill_null ) )
self.chunk += "\0" * fill_null
+ self.chunk_modified = True
+
+ # Now check if this chunk needs to be extended
+ if len( self.chunk ) < rest:
+ fill_null = rest - len(self.chunk)
+ logging.debug( "Filling final chunk with null, bytes: " + str( fill_null ) )
+ self.chunk += "\0" * fill_null
+ self.chunk_modified = True
buf_offset = 0
buf_len = len(buf)
|
{
"url": "https://git.hoopajoo.net/cgit/fusearchive/commit/fusearchive.py?id=1d90b688c485fa1421db7103926af73cc2b6b6b1",
"source_domain": "git.hoopajoo.net",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "9408",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VEUADXXYA7EZCZOSBOINM6N7RUHQJTO6",
"WARC-Concurrent-To": "<urn:uuid:693b2c52-d732-4039-b033-2dafebea1fe0>",
"WARC-Date": "2022-10-01T11:14:04Z",
"WARC-IP-Address": "67.210.196.70",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UYT26PC53QBTH3BH4M3CIJZGMNFKXK3K",
"WARC-Record-ID": "<urn:uuid:613ae41e-f625-453e-96e1-01ace5a3c5ae>",
"WARC-Target-URI": "https://git.hoopajoo.net/cgit/fusearchive/commit/fusearchive.py?id=1d90b688c485fa1421db7103926af73cc2b6b6b1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b3d4e2fb-caca-4575-94c9-10b43fd07676>"
},
"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-28\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,
39,
65,
78,
87,
94,
100,
163,
229,
284,
345,
399,
464,
524,
585,
660,
680,
719,
746,
790,
835,
865,
886,
907,
954,
988,
1066,
1097,
1121,
1155,
1198,
1216,
1244,
1281,
1327,
1398,
1476,
1507,
1536,
1538,
1587,
1618,
1655,
1734,
1767,
1796,
1811
],
"line_end_idx": [
39,
65,
78,
87,
94,
100,
163,
229,
284,
345,
399,
464,
524,
585,
660,
680,
719,
746,
790,
835,
865,
886,
907,
954,
988,
1066,
1097,
1121,
1155,
1198,
1216,
1244,
1281,
1327,
1398,
1476,
1507,
1536,
1538,
1587,
1618,
1655,
1734,
1767,
1796,
1811,
1829
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1829,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10311751067638397,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004796159919351339,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5347721576690674,
"rps_doc_frac_unique_words": 0.5874999761581421,
"rps_doc_mean_word_length": 8.543749809265137,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.0023980799596756697,
"rps_doc_unigram_entropy": 4.356771945953369,
"rps_doc_word_count": 160,
"rps_doc_frac_chars_dupe_10grams": 0.09948793053627014,
"rps_doc_frac_chars_dupe_5grams": 0.14630578458309174,
"rps_doc_frac_chars_dupe_6grams": 0.14630578458309174,
"rps_doc_frac_chars_dupe_7grams": 0.14630578458309174,
"rps_doc_frac_chars_dupe_8grams": 0.09948793053627014,
"rps_doc_frac_chars_dupe_9grams": 0.09948793053627014,
"rps_doc_frac_chars_top_2gram": 0.041697148233652115,
"rps_doc_frac_chars_top_3gram": 0.028529629111289978,
"rps_doc_frac_chars_top_4gram": 0.03950256109237671,
"rps_doc_books_importance": -204.0514678955078,
"rps_doc_books_importance_length_correction": -202.43470764160156,
"rps_doc_openwebtext_importance": -124.10266876220703,
"rps_doc_openwebtext_importance_length_correction": -124.10266876220703,
"rps_doc_wikipedia_importance": -70.75199127197266,
"rps_doc_wikipedia_importance_length_correction": -70.74627685546875
},
"fasttext": {
"dclm": 0.9497383236885071,
"english": 0.4887223541736603,
"fineweb_edu_approx": 1.167988896369934,
"eai_general_math": 0.16161596775054932,
"eai_open_web_math": 0.5130869746208191,
"eai_web_code": 0.35401487350463867
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-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": "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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.