id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-5,911,563,021,925,252,000 |
Explore BrainMass
Share
Calculations for Statistics Problems
Use the following Scenario to answer questions 1 - 3.
1. 800 employees of OxCo Mfg. were surveyed to evaluate the company's pension plan. The table below displays some of the results of the survey.
Rating of Pension Plan
Years employed Excellent Good Fair Poor Row Total
Under 10 yrs 24 91 82 43 240
10 to 25 yrs 44 163 145 48 400
25 yrs or more 21 62 53 24 160
Column total 80 320 280 120 800
5.28 chi-square
(shaded)df
2. The expected frequency for 163 in the table would be:
a. 163
b. 158
c. 165
d. none of these
3. Degrees of freedom for this test (shaded cell below the table) would be.
a. 6
b. 7
c. 799
d. 12
4. We would reject H0 at:
a. alpha =.10
b. alpha =.05
c. alpha =.01
d. none of these
5. The critical value in a chi-square goodness-of-fit test depends on the
a. number of categories of the variables.
b. variance of the data.
c. normality of the data.
d. all of the above
6. For a chi-square test, a 4x3 contingency table will have degrees of freedom of
a. 12.
b. 8
c. 9
d. 6
7. We sometimes combine two categories in a chi-square test if the
a. observed frequencies are less than 15.
b. observed frequencies are more than 5.
c. expected frequencies are less than 5.
d. expected frequencies are more than 5.
8. Three coins are tossed 160 times apiece. The distribution obtained is
Number of Heads 0 1 2 3
Observed 10 65 71 14
9. Three coins are tossed 160 times apiece. The distribution obtained is
Under the null hypothesis of a uniform distribution, the expected number of times we would get 0 heads is 10.
a. 10
b. 20
c. 30
d. 40
Solution Summary
This solution provides step by step calculations for various statistics questions.
$2.19
|
{
"url": "https://brainmass.com/statistics/chi-squared-test/171212",
"source_domain": "brainmass.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "101084",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZW632OAF6TTGJCH6GMANA2HRW7YISHSD",
"WARC-Concurrent-To": "<urn:uuid:89e4d249-b559-4e04-93fd-86034008b201>",
"WARC-Date": "2018-02-18T18:21:00Z",
"WARC-IP-Address": "65.39.198.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GAXS5HRBHFORVX4RXTWAW2Z2VNGEH3VC",
"WARC-Record-ID": "<urn:uuid:bc8e4e34-8f6b-491e-98ac-0b711c31a76c>",
"WARC-Target-URI": "https://brainmass.com/statistics/chi-squared-test/171212",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b1715298-b89f-4a7f-9249-ac7e0f448d31>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-81-147-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
24,
25,
62,
63,
117,
118,
262,
263,
286,
336,
365,
396,
427,
459,
460,
476,
487,
488,
545,
552,
559,
566,
583,
584,
660,
665,
670,
677,
683,
684,
710,
724,
738,
752,
769,
770,
844,
886,
911,
937,
957,
958,
1040,
1047,
1052,
1057,
1062,
1063,
1130,
1172,
1213,
1254,
1295,
1296,
1369,
1370,
1394,
1415,
1416,
1489,
1490,
1600,
1606,
1612,
1618,
1624,
1625,
1642,
1643,
1726,
1727
],
"line_end_idx": [
18,
24,
25,
62,
63,
117,
118,
262,
263,
286,
336,
365,
396,
427,
459,
460,
476,
487,
488,
545,
552,
559,
566,
583,
584,
660,
665,
670,
677,
683,
684,
710,
724,
738,
752,
769,
770,
844,
886,
911,
937,
957,
958,
1040,
1047,
1052,
1057,
1062,
1063,
1130,
1172,
1213,
1254,
1295,
1296,
1369,
1370,
1394,
1415,
1416,
1489,
1490,
1600,
1606,
1612,
1618,
1624,
1625,
1642,
1643,
1726,
1727,
1732
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1732,
"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.30582523345947266,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002427180064842105,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.36650484800338745,
"rps_doc_frac_unique_words": 0.4877300560474396,
"rps_doc_mean_word_length": 4.0153374671936035,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.717667102813721,
"rps_doc_word_count": 326,
"rps_doc_frac_chars_dupe_10grams": 0.08861727267503738,
"rps_doc_frac_chars_dupe_5grams": 0.1482047438621521,
"rps_doc_frac_chars_dupe_6grams": 0.08861727267503738,
"rps_doc_frac_chars_dupe_7grams": 0.08861727267503738,
"rps_doc_frac_chars_dupe_8grams": 0.08861727267503738,
"rps_doc_frac_chars_dupe_9grams": 0.08861727267503738,
"rps_doc_frac_chars_top_2gram": 0.022918259724974632,
"rps_doc_frac_chars_top_3gram": 0.01986248977482319,
"rps_doc_frac_chars_top_4gram": 0.022918259724974632,
"rps_doc_books_importance": -119.02461242675781,
"rps_doc_books_importance_length_correction": -108.72560119628906,
"rps_doc_openwebtext_importance": -99.5916976928711,
"rps_doc_openwebtext_importance_length_correction": -99.5916976928711,
"rps_doc_wikipedia_importance": -68.69986724853516,
"rps_doc_wikipedia_importance_length_correction": -62.16168212890625
},
"fasttext": {
"dclm": 0.29844391345977783,
"english": 0.8118484020233154,
"fineweb_edu_approx": 2.3229339122772217,
"eai_general_math": 0.9776404500007629,
"eai_open_web_math": 0.7282975912094116,
"eai_web_code": 0.1001286506652832
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,012,354,824,498,307,500 |
radar_guide's profile
2 Messages
•
100 Points
Tue, May 12, 2020 12:34 PM
Lightroom Classic: Why is the map module not available?
LR Classic 9.2.1 release for mac
MacOS Catalina 10.15.4
Responses
Adobe Administrator
•
10.7K Messages
•
142.1K Points
1 y ago
Have you hidden the module? Right click on the Module names across the top. and see if it will allow you to put a check mark next to the Map.
If not, you may need to reset your preference file.
Champion
•
3.7K Messages
•
61K Points
1 y ago
Looks like a preferences issue. Hiding the module should not dim the menu. It should still be possible to go to a hidden module via the menu.
799 Messages
•
11.5K Points
1 y ago
To reset your LR preferences:
1. Close Lightroom.
2. Hold down [Alt/Opt]+[Shift] while restarting Lightroom.
3. Overwrite the Preferences when prompted by the dialog.
4. Close Lightroom.
5. Restart Lightroom.
It's pretty painless, just go over your preferences to reset anything that changed (not a lot changes), takes 5-10 minutes.
Employee
•
295 Messages
•
7.8K Points
1 y ago
Hi,
Are you based in China? Could you confirm if you had selected China as a region while creating the Adobe account?
2 Messages
•
100 Points
1 y ago
I found out why, I asked adobe's customer service, If you buy the chinese version, there is no function of these modules. I am a Australian Chinese, sometimes in Beijing, sometimes in Sydney. so I had to return the Chinese version and buy the Australia version. In China, although everyone uses local social software, people can still use VPN to search google. so it is recommended not to remove these features from the software and give the customer a choice option when purchasing.
|
{
"url": "https://feedback.photoshop.com/conversations/lightroom-classic/lightroom-classic-why-is-the-map-module-not-available/5f5f46254b561a3d4276059d",
"source_domain": "feedback.photoshop.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "107728",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SXD3S75SLJXZ3ZANHH2EVXJYV4QCWTFM",
"WARC-Concurrent-To": "<urn:uuid:c116b140-e2da-41c0-8175-891f2c7f9656>",
"WARC-Date": "2021-07-31T06:23:52Z",
"WARC-IP-Address": "52.200.18.212",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IRM4F5DYWZDQL26D5XESRX6MZMHCZUFM",
"WARC-Record-ID": "<urn:uuid:471b126a-8f6d-43b4-967a-f6c4ae7a7e78>",
"WARC-Target-URI": "https://feedback.photoshop.com/conversations/lightroom-classic/lightroom-classic-why-is-the-map-module-not-available/5f5f46254b561a3d4276059d",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2a88344a-49be-4b8f-afa9-df92702f2939>"
},
"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-178.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,
22,
23,
34,
35,
39,
40,
51,
52,
79,
80,
136,
137,
170,
193,
194,
204,
205,
225,
226,
230,
231,
246,
247,
251,
252,
266,
267,
275,
276,
418,
419,
472,
473,
482,
483,
487,
488,
502,
503,
507,
508,
519,
520,
528,
529,
671,
672,
685,
686,
690,
691,
704,
705,
713,
714,
746,
747,
768,
769,
829,
830,
889,
890,
911,
912,
934,
935,
1059,
1060,
1061,
1070,
1071,
1075,
1076,
1089,
1090,
1094,
1095,
1107,
1108,
1116,
1117,
1121,
1122,
1236,
1237,
1248,
1249,
1253,
1254,
1265,
1266,
1274,
1275
],
"line_end_idx": [
22,
23,
34,
35,
39,
40,
51,
52,
79,
80,
136,
137,
170,
193,
194,
204,
205,
225,
226,
230,
231,
246,
247,
251,
252,
266,
267,
275,
276,
418,
419,
472,
473,
482,
483,
487,
488,
502,
503,
507,
508,
519,
520,
528,
529,
671,
672,
685,
686,
690,
691,
704,
705,
713,
714,
746,
747,
768,
769,
829,
830,
889,
890,
911,
912,
934,
935,
1059,
1060,
1061,
1070,
1071,
1075,
1076,
1089,
1090,
1094,
1095,
1107,
1108,
1116,
1117,
1121,
1122,
1236,
1237,
1248,
1249,
1253,
1254,
1265,
1266,
1274,
1275,
1758
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1758,
"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.3183023929595947,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037135280668735504,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2705570161342621,
"rps_doc_frac_unique_words": 0.564784049987793,
"rps_doc_mean_word_length": 4.392026424407959,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.812644004821777,
"rps_doc_word_count": 301,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028744330629706383,
"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.04084720090031624,
"rps_doc_frac_chars_top_3gram": 0.03025718964636326,
"rps_doc_frac_chars_top_4gram": 0.04160362854599953,
"rps_doc_books_importance": -149.0035858154297,
"rps_doc_books_importance_length_correction": -140.57040405273438,
"rps_doc_openwebtext_importance": -76.37770080566406,
"rps_doc_openwebtext_importance_length_correction": -76.37770080566406,
"rps_doc_wikipedia_importance": -51.25160217285156,
"rps_doc_wikipedia_importance_length_correction": -47.31035614013672
},
"fasttext": {
"dclm": 0.1824696660041809,
"english": 0.77989661693573,
"fineweb_edu_approx": 1.1499781608581543,
"eai_general_math": 0.04389100894331932,
"eai_open_web_math": 0.07356435060501099,
"eai_web_code": 0.0016222599660977721
}
}
|
{
"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": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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
|
-8,017,356,685,681,840,000 |
Answers
Solutions by everydaycalculation.com
Everydaycalculation.com » Answers » Add fractions
Add 2/40 and 35/63
2/40 + 35/63 is 109/180.
Steps for adding fractions
1. Find the least common denominator or LCM of the two denominators:
LCM of 40 and 63 is 2520
2. For the 1st fraction, since 40 × 63 = 2520,
2/40 = 2 × 63/40 × 63 = 126/2520
3. Likewise, for the 2nd fraction, since 63 × 40 = 2520,
35/63 = 35 × 40/63 × 40 = 1400/2520
4. Add the two fractions:
126/2520 + 1400/2520 = 126 + 1400/2520 = 1526/2520
5. After reducing the fraction, the answer is 109/180
Related:
Use fraction calculator with our all-in-one calculator app: Download for Android, Download for iOS
© everydaycalculation.com
|
{
"url": "https://answers.everydaycalculation.com/add-fractions/2-40-plus-35-63",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "7538",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WIC3H4Y65FQOTAN5RH7QS4XP3ZZYNFV7",
"WARC-Concurrent-To": "<urn:uuid:1fb44af4-87a2-4baa-aede-ec28943d60d1>",
"WARC-Date": "2019-06-17T14:48:14Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XDMZ4M3CLW3DRDWE3SWDPKZSBACDJCXD",
"WARC-Record-ID": "<urn:uuid:1e81425b-4317-4671-91a3-98641c3a4f0a>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/add-fractions/2-40-plus-35-63",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2239980d-2bed-4a48-ba2b-8a8eae475913>"
},
"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-152-93-158.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,
8,
9,
46,
47,
97,
98,
117,
118,
143,
144,
171,
172,
243,
272,
321,
358,
417,
457,
485,
540,
596,
597,
606,
607,
706,
707
],
"line_end_idx": [
8,
9,
46,
47,
97,
98,
117,
118,
143,
144,
171,
172,
243,
272,
321,
358,
417,
457,
485,
540,
596,
597,
606,
607,
706,
707,
732
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 732,
"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.18131868541240692,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010989010334014893,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.598901093006134,
"rps_doc_frac_unique_words": 0.5357142686843872,
"rps_doc_mean_word_length": 4.6964287757873535,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8965625762939453,
"rps_doc_word_count": 112,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03041825070977211,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -104.78634643554688,
"rps_doc_books_importance_length_correction": -104.79026794433594,
"rps_doc_openwebtext_importance": -57.804954528808594,
"rps_doc_openwebtext_importance_length_correction": -57.808876037597656,
"rps_doc_wikipedia_importance": -63.03181838989258,
"rps_doc_wikipedia_importance_length_correction": -63.03573989868164
},
"fasttext": {
"dclm": 0.9757536053657532,
"english": 0.8423324823379517,
"fineweb_edu_approx": 1.7097173929214478,
"eai_general_math": 0.1918972134590149,
"eai_open_web_math": 0.4465793967247009,
"eai_web_code": -9.500000146545062e-7
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,737,259,132,742,785,000 |
Anda di halaman 1dari 2
Post Test 3 : Lingkaran d.
(3, 4)
e. (4, 3)
KD 1
1. Jika lingkaran x2 + y2 + 6x + 6y + c = 0 KD II
menyinggung garis x = 2, maka nilai c 6. Lingkaran yang sepusat dengan lingkaran
adalah . x2 + y2 4x + 6y 17 = 0 dan
a. 7 menyinggung garis 3x 4y + 7 = 0
b. 6 mempunyai persamaan .
c. 0 a. (x 2)2 + (y + 3)2 = 25
d. 6 b. (x 2)2 + (y + 3)2 = 16
e. 12 c. (x + 2)2 + (y 3)2 = 25
2. Lingkaran dengan persamaan x2 + y2 4x d. (x + 2)2 + (y 3)2 = 16
+ 2y + c = 0 melalui titik (5, -1), jari- e. (x 4)2 + (y + 6)2 = 25
jarinya adalah . 7. Persamaan lingkaran dengan pusat (3, -2)
a. 7 dan menyinggung sumbu Y adalah .
b. 3 a. x2 + y2 6x + 2y + 9 = 0
c. 4 b. x2 + y2 + 6x 4y + 9 = 0
d. 26 c. x2 + y2 6x + 4y + 9 = 0
e. 9 d. x2 + y2 6x + 4y + 4 = 0
3. Diketahui lingkaran e. x2 + y2 + 6x 4y + 4 = 0
8. Diketahui sebuah lingkaran melalui titik
x 2 y 2 14 x By 60 0 terletak di
O(0,0), A(0,8), dan B(6,0). Persamaan
kuadran IV serta melalui titik (4, -2). garis singgung pada lingkaran tersebut di
Pusat lingkaran tersebut adalah. titik A adalah .
a. (7, 6) a. 3x 4y 32 = 0
b. (7, -6) b. 3x 4y + 32 = 0
c. (7, 7) c. 3x + 4y 32 = 0
d. (7, - 7) d. 4x + 3y 32 = 0
e. (7, 5) e. 4x 3y + 32 = 0
4. Lingkaran yang menyinggung garis 9. Persamaan garis singgung lingkaran x2 +
x y 3 di titik (2, 1) dan melalui titik (6, y2 2x 6y + 1 = 0 yang tegak lurus garis
3) mempunyai jari-jari. 3x y = 0 adalah .
a. 5 3 a. y 3 = - 3(x 1) 3 10
b. y 3 = - 3(x 1) 10
b. 5 2 c. y 3 = - 1/3(x 1) 10
5 d. y 3 = - 1/3(x 1) 3 10
c.
3 e. y 3 = - 1/3(x 1) 9 10
5 10. Salah satu persamaan garis
d. 3 singgung dari titik (0,2) pada lingkaran x2
3 + y2 = 1 adalah .
5 a. y = x3 2
e. 2
3 b. y = x3 + 1
5. Pusat lingkaran pada gambar di bawah c. y = - x 3 2
ini adalah d. y = - x 3 + 2
e. y = - x 3 + 1
11. Salah satu persamaan garis singgung
dari titik (0,4) pada lingkaran x2 + y2 = 4
adalah .
a. y = x + 4
b. y = 2x + 4
c. y = - x + 4
a. (-3, - 4) d. y = - x 3 + 4
b. (- 3, 4) e. y = x2 + 4
c. (3, - 4)
Page 1 of 2
12. Persamaan garis singgung lingkaran x2 + 15. Di suatu tempat tedapat dua sumber
y2 6x + 2y 15 = 0 pada titik (7, 2) suara yang menjangkau pendengar dalam
adalah . radius tertentu. Sumber suara pertama
a. 2x 7y = 0
berada pada posisi (10, 20) dengan radius
b. 4x + y 38 = 0
c. 7x + 2y 53 = 0 30 m. Sumber suara dua berada pada
d. 4x + 3y 53 = 0 koordinat (40, 10) dan memiliki jangkaua
e. 4x + 3y 34 = 0 hingga radius 40 m. Arisman berapa
dalam posisi (60, - 20). Jarak Arisman
KD III dengan sumber suara terdekat adalah.
13. Titik pusat lingkaran L berada di kuadran a. 25 m terhadap sumber suara 1
I di sepanjang garis 3 x y 2 0 . Jika L
b. 5 13 m terhadap sumber suara 2
menyinggung sumbu X di titik (4, 0)
c. 25 m terhadap sumber suara 2
maka persamaannya adalah.
d. 5 13 terhadap sumber suara 1
a. x 2 y 2 8x 28 y 16 0
e. 15 13 terhadap sumber suara 1 dan
b. x 2 y 2 8x 28 y 16 0
2
c. x 2 y 2 8x 28 y 16 0
KD IV
d. x 2 y 2 8x 28 y 16 0
e. x 2 y 2 8x 28 y 16 0 16. Buatlah satu masalah nyata yang
berkaitan dengan persamaan dan garis
14. Sebuah roda yang berjari-jari 1 m
singgung lingkaran kemudian
disandarkan pada sudut ruangan
selesaikan masalah tersebut. (skor
sehingga roda tersebut menyentuh siku
maksimal 5)
dinding ruangan. Kemudian sebuah kayu
yang panjangnya p meter disandarkan
pada dinding seperti yang ditunjukkan
pada gambar.
Panjang p adalah.. m.
a. 2
b. 2 2
c. 22 2
d. 23 2
e. 24 2
Page 2 of 2
|
{
"url": "https://id.scribd.com/document/360440605/Postes-Persamaan-lingkaran",
"source_domain": "id.scribd.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "292280",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2NVVWMCAUJIV6PZL5MQJ66BES5FJG52N",
"WARC-Concurrent-To": "<urn:uuid:fc9ffd30-c5d8-4cec-8082-cc387392de19>",
"WARC-Date": "2020-10-21T11:38:29Z",
"WARC-IP-Address": "199.232.66.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:GASO4N4SUDYE3QAHYBNKLW2X232HBHQL",
"WARC-Record-ID": "<urn:uuid:941fcb51-60e5-4ef9-9eb4-467f0c231de7>",
"WARC-Target-URI": "https://id.scribd.com/document/360440605/Postes-Persamaan-lingkaran",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:167bde85-177a-4dba-a8dd-6a796f7f43dc>"
},
"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-32.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
24,
25,
52,
53,
60,
70,
75,
125,
206,
242,
279,
306,
337,
368,
400,
467,
535,
596,
634,
666,
698,
731,
763,
813,
857,
890,
928,
1010,
1060,
1086,
1115,
1143,
1173,
1201,
1280,
1364,
1406,
1436,
1457,
1487,
1514,
1517,
1544,
1577,
1626,
1646,
1660,
1665,
1681,
1736,
1764,
1781,
1821,
1865,
1874,
1887,
1901,
1916,
1946,
1972,
1984,
1985,
1997,
2080,
2154,
2201,
2214,
2256,
2273,
2326,
2385,
2438,
2477,
2521,
2599,
2639,
2673,
2709,
2741,
2767,
2799,
2823,
2860,
2884,
2886,
2910,
2916,
2940,
3000,
3037,
3075,
3103,
3134,
3169,
3207,
3219,
3257,
3293,
3331,
3344,
3345,
3367,
3372,
3379,
3387,
3395,
3403,
3404
],
"line_end_idx": [
24,
25,
52,
53,
60,
70,
75,
125,
206,
242,
279,
306,
337,
368,
400,
467,
535,
596,
634,
666,
698,
731,
763,
813,
857,
890,
928,
1010,
1060,
1086,
1115,
1143,
1173,
1201,
1280,
1364,
1406,
1436,
1457,
1487,
1514,
1517,
1544,
1577,
1626,
1646,
1660,
1665,
1681,
1736,
1764,
1781,
1821,
1865,
1874,
1887,
1901,
1916,
1946,
1972,
1984,
1985,
1997,
2080,
2154,
2201,
2214,
2256,
2273,
2326,
2385,
2438,
2477,
2521,
2599,
2639,
2673,
2709,
2741,
2767,
2799,
2823,
2860,
2884,
2886,
2910,
2916,
2940,
3000,
3037,
3075,
3103,
3134,
3169,
3207,
3219,
3257,
3293,
3331,
3344,
3345,
3367,
3372,
3379,
3387,
3395,
3403,
3404,
3415
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3415,
"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.13562387228012085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01537070982158184,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5533453822135925,
"rps_doc_frac_unique_words": 0.22191780805587769,
"rps_doc_mean_word_length": 3.0082192420959473,
"rps_doc_num_sentences": 117,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4529242515563965,
"rps_doc_word_count": 730,
"rps_doc_frac_chars_dupe_10grams": 0.011839710175991058,
"rps_doc_frac_chars_dupe_5grams": 0.14116576313972473,
"rps_doc_frac_chars_dupe_6grams": 0.04644808918237686,
"rps_doc_frac_chars_dupe_7grams": 0.028233150020241737,
"rps_doc_frac_chars_dupe_8grams": 0.028233150020241737,
"rps_doc_frac_chars_dupe_9grams": 0.028233150020241737,
"rps_doc_frac_chars_top_2gram": 0.01639343984425068,
"rps_doc_frac_chars_top_3gram": 0.01639343984425068,
"rps_doc_frac_chars_top_4gram": 0.010928959585726261,
"rps_doc_books_importance": -544.2257690429688,
"rps_doc_books_importance_length_correction": -544.2257690429688,
"rps_doc_openwebtext_importance": -334.0233459472656,
"rps_doc_openwebtext_importance_length_correction": -334.0233459472656,
"rps_doc_wikipedia_importance": -225.42568969726562,
"rps_doc_wikipedia_importance_length_correction": -225.42568969726562
},
"fasttext": {
"dclm": 0.999277651309967,
"english": 0.008601839654147625,
"fineweb_edu_approx": 1.2101860046386719,
"eai_general_math": 0.4343554973602295,
"eai_open_web_math": 0.8866419196128845,
"eai_web_code": 0.13814878463745117
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "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
|
-1,852,910,592,902,886,000 |
Edgewall Software
Customising Trac Roadmap Ticket Groups
By default, the roadmap shows a list of future milestones with the tickets targeted against a milestone aggregated, and the ratio between active and resolved tickets displayed as a milestone progress bar. For the default workflow this is often sufficient, however with the ability to create custom workflows, it becomes necessary to be able to show further detail on the roadmap progress bar.
Trac roadmap with multiple groups
Configuring the roadmap to show additional groupings in the progress bar is achieved by editing the trac.ini file. This file should already have a section which reads:
[milestone]
stats_provider = DefaultTicketGroupStatsProvider
In order to change the default grouping, which simply counts tickets as either 'closed' or 'active', we need to add a new section to trac.ini entitled [milestone-groups]. In this example we add a new group for the 'in_QA' status, included in the custom workflow.
[milestone-groups]
# The definition consists in a comma-separated list of accepted status.
# Also, '*' means any status and could be used to associate all remaining
# states to one catch-all group.
# Qualifiers for the above group (the group must have been defined first):
# Definition of a 'closed' group:
closed = closed
closed.order = 1
closed.query_args = group=resolution
closed.overall_completion = true
# Definition of an 'in testing' group:
inQA = in_QA
inQA.order = 2
inQA.css_class = new
inQA.label = in testing
# Definition of an 'active' group:
active = *
active.order = 3
active.css_class = open
active.label = in progress
# The CSS class can be one of: new (yellow), open (no color) or
# closed (green). New styles can easily be added using the following
# selector: `table.progress td.<class>`
The following parameters are used in the [milestone-groups] section:
<groupname>A comma separated list of statuses that match this group. The '*' can be used once and will match all statuses not yet assigned
<groupname>.orderThe sequence number in the progress bar
<groupname>.query_argsOptional extra parameter for the query
<groupname>.overall_completiontrue/false - count in the overall completion statistic
<groupname>.css_classCSS class to use for this interval, defaults available are: new (yellow), open (no color) or closed (green). New styles can easily be added using the following selector: table.progress td.<class>
<groupname>.labelDisplayed name for the group
See also: TracRoadmap, TracTickets, TracIni, CookBook/Configuration/Workflow
Last modified 2 months ago Last modified on Mar 17, 2017, 9:11:00 PM
Attachments (1)
Download all attachments as: .zip
|
{
"url": "https://trac.edgewall.org/wiki/TracRoadmapCustomGroups",
"source_domain": "trac.edgewall.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "19933",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U7PU3KZBQFTVOEH34D4ZF3WHS45PAZW4",
"WARC-Concurrent-To": "<urn:uuid:9e2ac68b-46be-4690-8944-d97eb3eb3207>",
"WARC-Date": "2017-05-24T13:40:46Z",
"WARC-IP-Address": "176.9.102.26",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KUVS5M67O7IMXBI3R3QESX7HMVZJ4V5D",
"WARC-Record-ID": "<urn:uuid:f32c5f47-b746-4248-90e5-6f9e0666dc8c>",
"WARC-Target-URI": "https://trac.edgewall.org/wiki/TracRoadmapCustomGroups",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0829613a-5dd8-4b55-bcce-31d21de539d4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
19,
58,
59,
452,
453,
487,
488,
656,
657,
669,
718,
719,
982,
983,
1002,
1074,
1148,
1181,
1256,
1257,
1291,
1307,
1324,
1361,
1395,
1396,
1468,
1481,
1496,
1517,
1541,
1542,
1577,
1588,
1605,
1629,
1656,
1657,
1721,
1790,
1831,
1832,
1901,
1902,
2041,
2098,
2159,
2244,
2461,
2507,
2508,
2585,
2586,
2655,
2656,
2672,
2673
],
"line_end_idx": [
18,
19,
58,
59,
452,
453,
487,
488,
656,
657,
669,
718,
719,
982,
983,
1002,
1074,
1148,
1181,
1256,
1257,
1291,
1307,
1324,
1361,
1395,
1396,
1468,
1481,
1496,
1517,
1541,
1542,
1577,
1588,
1605,
1629,
1656,
1657,
1721,
1790,
1831,
1832,
1901,
1902,
2041,
2098,
2159,
2244,
2461,
2507,
2508,
2585,
2586,
2655,
2656,
2672,
2673,
2706
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2706,
"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.28438663482666016,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005576210096478462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.271375447511673,
"rps_doc_frac_unique_words": 0.5108107924461365,
"rps_doc_mean_word_length": 5.65675687789917,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.01858736015856266,
"rps_doc_unigram_entropy": 4.881953716278076,
"rps_doc_word_count": 370,
"rps_doc_frac_chars_dupe_10grams": 0.0984233170747757,
"rps_doc_frac_chars_dupe_5grams": 0.0984233170747757,
"rps_doc_frac_chars_dupe_6grams": 0.0984233170747757,
"rps_doc_frac_chars_dupe_7grams": 0.0984233170747757,
"rps_doc_frac_chars_dupe_8grams": 0.0984233170747757,
"rps_doc_frac_chars_dupe_9grams": 0.0984233170747757,
"rps_doc_frac_chars_top_2gram": 0.014333490282297134,
"rps_doc_frac_chars_top_3gram": 0.012422359548509121,
"rps_doc_frac_chars_top_4gram": 0.015289059840142727,
"rps_doc_books_importance": -216.63644409179688,
"rps_doc_books_importance_length_correction": -216.63644409179688,
"rps_doc_openwebtext_importance": -161.76084899902344,
"rps_doc_openwebtext_importance_length_correction": -161.76084899902344,
"rps_doc_wikipedia_importance": -114.22010040283203,
"rps_doc_wikipedia_importance_length_correction": -114.22010040283203
},
"fasttext": {
"dclm": 0.057475630193948746,
"english": 0.8511520624160767,
"fineweb_edu_approx": 1.7976046800613403,
"eai_general_math": 0.961731493473053,
"eai_open_web_math": 0.4828202724456787,
"eai_web_code": 0.47462403774261475
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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
|
-1,493,125,359,459,352,000 |
Golang Embedding Examples [Tutorial]
In today's article, I will introduce to you what is Go embedding and how it can be used in Go. Golang is not an OOP programming language. However, some of the benefits of object orientation can be applied to go structs (similar to Class), interface, and method are all available to be embedded. The embedding type will be used to use the "inherit" property in Go.
Embedded Type is declaring a type in another type but not declaring a name, a field without declaring a name is also known as an embedded field.
Advertisement
Embedding structs in Golang
Here is an example of embedding a struct in another one:
type Author struct {
AuthorName string
AuthorAge int
}
type Book struct {
Title string
Author // Embedded field
}
In the above example, if we name the Author field as usual, we will have a nested struct, and if we use an Embedded field, we can consider the Book struct to have all the fields of the Author struct (duplicate field names are not allowed). The Book struct above will equivalent to:
type Book struct {
Title string
Content string
AuthorName string
AuthorAge int
}
We will be able to use both Book and Author struct without having to re-declare duplicate fields.
When retrieving data can also be obtained directly without going through a nested truct, for example, get the author's name instead of book.Author.AuthorName, then we just need to book.AuthorName. See the full example here:
package main
import "fmt"
type Author struct {
AuthorName string
AuthorAge int
}
type Book struct {
Title string
Author // Embedded field
}
func main() {
book1 := Book{
Title: "Book1",
Author: Author{
AuthorName: "author1",
AuthorAge: 19,
},
}
fmt.Println(book1)
fmt.Println(book1.AuthorAge)
fmt.Println(book1.Author.AuthorAge)
}
Output:
{Book1 {author1 19}}
19
19
Embedding methods in Golang
It also works well to embed structs with methods. Suppose we have access to this method for Author struct:
Advertisement
func (author Author) SayHello() string {
return fmt.Sprintf("I am %v. Hello GoLinuxCloud members!", author.AuthorName)
}
Now that Author struct has this method, we can call it on instances of Book as if it did too:
package main
import "fmt"
type Author struct {
AuthorName string
AuthorAge int
}
type Book struct {
Title string
Author // Embedded field
}
func main() {
book1 := Book{
Title: "Book1",
Author: Author{
AuthorName: "author1",
AuthorAge: 19,
},
}
author1 := Author{
AuthorName: "author2",
AuthorAge: 22,
}
fmt.Println(author1.SayHello())
fmt.Println(book1.SayHello())
}
func (author Author) SayHello() string {
return fmt.Sprintf("I am %v. Hello GoLinuxCloud members!", author.AuthorName)
}
Output:
I am author2. Hello GoLinuxCloud members!
I am author1. Hello GoLinuxCloud members!
When book1.SayHello() is call, the actual logic is the below method will be called. Calling SayHell() on the Book struct has a similar result to our original one, which embeds.
func (bk Book) SayHello() string {
return bk.Author.SayHello()
}
This example also highlights a key detail in the behavior of methods on embedded fields: regardless of the embedding struct it is called through, Author's SayHello() always receives a Author (the leftmost (...) in the method description). In other languages that support inheritance, such as Python and C++, inherited methods receive a reference to the subclass via which they are called. This is a significant distinction between embedding in Go and traditional inheritance.
Embedding interfaces in Golang
The interface is a group of method signatures that can be used to construct variables in the Go programming language. As far as we are aware, the Go language does not enable inheritance, but the Go interface does. An interface can incorporate other interfaces or the method signatures of other interfaces in it when embedding. You can embed any number of interfaces in a single interface. And when an interface, embed other interfaces in it if we made any changes in the methods of the interfaces.
type interface1 interface {
Method1()
}
type interface2 interface {
Method2()
}
type embedded_interface interface {
interface1
interface2
}
OR
type interface1 interface {
Method1()
}
type interface2 interface {
Method2()
}
type embedded_interface interface {
Method1()
Method2()
}
Here is an example of embedding interface into another interface:
package main
import "fmt"
// Interface 1
type inteface1 interface {
AthorDetails()
}
// Interface 2
type inteface2 interface {
CustomDetails()
}
type embedded interface {
inteface1
inteface2
}
// struct
type Author struct {
AuthorName string
AuthorAge int
}
// Implementing method of the interface 1
func (a Author) AthorDetails() {
fmt.Printf("I am %v, i am %v years old. Hello GoLinuxCloud members!\n", a.AuthorName, a.AuthorAge)
}
// Implementing method of the interface 2
func (a Author) CustomDetails() {
fmt.Printf("This is a customized message! I am %v, i am %v years old.\n", a.AuthorName, a.AuthorAge)
}
func main() {
author := Author{
AuthorName: "author1",
AuthorAge: 22,
}
// Accessing the methods of the interface 1 and 2
var f embedded = author
f.AthorDetails()
f.CustomDetails()
}
Output:
I am author1, i am 22 years old. Hello GoLinuxCloud members!
This is a customized message! I am author1, i am 22 years old.
Embedding Files in Golang
This feature was added in Go 1.16 that allows you to embed static assets into Go binaries. The allowed data types for keeping an embedded file are string[]byte, and embed.FS. This means that a Go binary may contain a file that you do not have to manually download when you execute the Go binary! The presented utility embeds two different files that it can retrieve based on the given command-line argument.
package main
import (
_ "embed"
"fmt"
"os"
)
//go:embed static/firefox.png
var f1 []byte
//go:embed static/file1.txt
var f2 string
func writeToFile(s []byte, path string) error {
fd, err := os.OpenFile(path, os.O_CREATE|os.O_WRONLY, 0644)
if err != nil {
return err
}
defer fd.Close()
n, err := fd.Write(s)
if err != nil {
return err
}
fmt.Printf("wrote %d bytes\n", n)
return nil
}
func main() {
arguments := os.Args
if len(arguments) == 1 {
fmt.Println("Print select 1|2")
return
}
fmt.Println("f1:", len(f1), "f2:", len(f2))
switch arguments[1] {
case "1":
filename := "/tmp/out.png"
err := writeToFile(f1, filename)
if err != nil {
fmt.Println(err)
return
}
case "2":
fmt.Print(f2)
default:
fmt.Println("Not a valid option!")
}
}
Explanation:
You need the embed package in order to embed any files in your Go binaries. As the embed package is not directly used, you need to put _ in front of it so that the Go compiler won't complain.
You need to begin a line with //go:embed, which denotes a Go comment but is treated in a special way, followed by the path to the file you want to embed. In this case we embed static/file1.txt, which is a binary file. The next line should define the variable that is going to hold the data of the embedded file, which in this case is a byte slice named f1 using a byte slice is recommended for binary files because we are going to directly use that byte slice to save that binary file.
Advertisement
//go:embed static/firefox.png
var f1 []byte
//go:embed static/file1.txt
var f2 string
In this case we save the contents of a plain text file, which is static/textfile, in a string variable named f2. The writeToFile() function is used for storing a byte slice into a file and is a helper function that can be used in other cases as well.
The switch block is responsible for returning the desired file to the user in the case of static/textfile, the file contents are printed on the screen. For the binary file, we decided to store it as /tmp/out.png.
Next we execute the binary:
$ go run main.go 2
f1: 32441 f2: 6
hello
$ go run main.go 1
f1: 32441 f2: 6
wrote 32441 bytes
$ ll /tmp/out.png
-rw-r--r-- 1 root root 32441 Nov 20 14:39 /tmp/out.png
$ md5sum /tmp/out.png static/firefox.png
db0cad7c310dcd7673d976699293f08d /tmp/out.png
db0cad7c310dcd7673d976699293f08d static/firefox.png
Using the embedding functionality, we can create a utility that embeds its own source code and prints it on screen when it gets executed! This is a fun way of using embedded files. The source code of main.go is the following:
package main
import (
_ "embed"
"fmt"
)
//go:embed main.go
var src string
func main() {
fmt.Print(src)
}
Output
$ go run main.go
package main
import (
_ "embed"
"fmt"
)
//go:embed main.go
var src string
func main() {
fmt.Print(src)
As before, the file that is being embedded is defined in the //go:embed line. Running main.go prints the aforementioned code on screen.
Advertisement
Summary
Go does not provide the typical, type-driven notion of subclassing, but it does have the ability to “borrow” pieces of an implementation by embedding types within a struct or interface. With the explained examples below, hope you can have a better understanding of embedding in Golang.
References
https://go.dev/doc/effective_go#embedding
Categories GO
Didn't find what you were looking for? Perform a quick search across GoLinuxCloud
If my articles on GoLinuxCloud has helped you, kindly consider buying me a coffee as a token of appreciation.
Buy GoLinuxCloud a Coffee
For any other feedbacks or questions you can either use the comments section or contact me form.
Thank You for your support!!
Leave a Comment
X
|
{
"url": "https://www.golinuxcloud.com/golang-embedding/",
"source_domain": "www.golinuxcloud.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "136835",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EF2D6OBYLDQTPNC7PQTDEZGROKBORZQW",
"WARC-Concurrent-To": "<urn:uuid:596064cb-bb09-4878-9b1b-8a2fa2b799fd>",
"WARC-Date": "2022-12-10T01:59:49Z",
"WARC-IP-Address": "104.19.154.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OQ5HW6TDEXFOR2QJFA3CQMLI5BRY27BN",
"WARC-Record-ID": "<urn:uuid:c3e7cad4-f8ae-4123-bc5c-c647fb005fda>",
"WARC-Target-URI": "https://www.golinuxcloud.com/golang-embedding/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5bafc06-f7fb-42e2-b757-f7047619246f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
402,
403,
548,
549,
563,
564,
566,
567,
595,
596,
653,
654,
675,
697,
715,
717,
718,
737,
754,
785,
787,
788,
1070,
1071,
1090,
1107,
1126,
1148,
1166,
1168,
1169,
1267,
1268,
1492,
1493,
1506,
1507,
1520,
1521,
1542,
1561,
1577,
1579,
1598,
1613,
1639,
1641,
1642,
1656,
1672,
1690,
1708,
1734,
1753,
1758,
1761,
1762,
1782,
1812,
1849,
1851,
1852,
1860,
1861,
1882,
1885,
1888,
1889,
1891,
1892,
1920,
1921,
2028,
2029,
2043,
2084,
2163,
2165,
2166,
2260,
2261,
2274,
2275,
2288,
2289,
2310,
2329,
2345,
2347,
2366,
2381,
2407,
2409,
2410,
2424,
2440,
2458,
2476,
2502,
2521,
2526,
2529,
2530,
2550,
2575,
2593,
2596,
2597,
2630,
2661,
2663,
2664,
2705,
2784,
2786,
2787,
2795,
2796,
2838,
2880,
2881,
3058,
3059,
3094,
3123,
3125,
3126,
3602,
3603,
3605,
3606,
3637,
3638,
4136,
4137,
4165,
4179,
4181,
4182,
4210,
4224,
4226,
4227,
4263,
4279,
4295,
4297,
4298,
4301,
4302,
4330,
4344,
4346,
4347,
4375,
4376,
4390,
4392,
4393,
4429,
4443,
4457,
4459,
4460,
4526,
4527,
4540,
4541,
4554,
4555,
4570,
4597,
4613,
4615,
4616,
4631,
4658,
4675,
4677,
4678,
4704,
4715,
4726,
4728,
4729,
4739,
4760,
4779,
4795,
4797,
4798,
4840,
4873,
4973,
4975,
4976,
5018,
5052,
5154,
5156,
5157,
5171,
5190,
5215,
5233,
5236,
5237,
5288,
5313,
5331,
5350,
5352,
5353,
5361,
5362,
5423,
5486,
5487,
5489,
5490,
5516,
5517,
5925,
5926,
5939,
5948,
5962,
5972,
5981,
5983,
5984,
6014,
6028,
6029,
6057,
6071,
6072,
6120,
6184,
6204,
6223,
6229,
6250,
6276,
6296,
6315,
6321,
6359,
6374,
6376,
6377,
6391,
6416,
6445,
6485,
6500,
6506,
6554,
6577,
6591,
6626,
6667,
6691,
6720,
6739,
6749,
6763,
6785,
6798,
6841,
6847,
6849,
6850,
6864,
6865,
7057,
7058,
7544,
7545,
7559,
7589,
7603,
7604,
7632,
7646,
7647,
7898,
7899,
8112,
8113,
8141,
8142,
8161,
8177,
8183,
8184,
8203,
8219,
8237,
8238,
8257,
8312,
8313,
8355,
8402,
8455,
8456,
8682,
8683,
8696,
8705,
8719,
8729,
8731,
8732,
8751,
8766,
8780,
8799,
8801,
8802,
8809,
8810,
8827,
8840,
8849,
8863,
8873,
8875,
8894,
8909,
8923,
8942,
8943,
9079,
9080,
9094,
9095,
9097,
9098,
9106,
9107,
9393,
9394,
9396,
9397,
9408,
9409,
9451,
9452,
9454,
9455,
9469,
9470,
9552,
9553,
9663,
9664,
9690,
9691,
9788,
9789,
9818,
9819,
9835,
9836
],
"line_end_idx": [
37,
38,
402,
403,
548,
549,
563,
564,
566,
567,
595,
596,
653,
654,
675,
697,
715,
717,
718,
737,
754,
785,
787,
788,
1070,
1071,
1090,
1107,
1126,
1148,
1166,
1168,
1169,
1267,
1268,
1492,
1493,
1506,
1507,
1520,
1521,
1542,
1561,
1577,
1579,
1598,
1613,
1639,
1641,
1642,
1656,
1672,
1690,
1708,
1734,
1753,
1758,
1761,
1762,
1782,
1812,
1849,
1851,
1852,
1860,
1861,
1882,
1885,
1888,
1889,
1891,
1892,
1920,
1921,
2028,
2029,
2043,
2084,
2163,
2165,
2166,
2260,
2261,
2274,
2275,
2288,
2289,
2310,
2329,
2345,
2347,
2366,
2381,
2407,
2409,
2410,
2424,
2440,
2458,
2476,
2502,
2521,
2526,
2529,
2530,
2550,
2575,
2593,
2596,
2597,
2630,
2661,
2663,
2664,
2705,
2784,
2786,
2787,
2795,
2796,
2838,
2880,
2881,
3058,
3059,
3094,
3123,
3125,
3126,
3602,
3603,
3605,
3606,
3637,
3638,
4136,
4137,
4165,
4179,
4181,
4182,
4210,
4224,
4226,
4227,
4263,
4279,
4295,
4297,
4298,
4301,
4302,
4330,
4344,
4346,
4347,
4375,
4376,
4390,
4392,
4393,
4429,
4443,
4457,
4459,
4460,
4526,
4527,
4540,
4541,
4554,
4555,
4570,
4597,
4613,
4615,
4616,
4631,
4658,
4675,
4677,
4678,
4704,
4715,
4726,
4728,
4729,
4739,
4760,
4779,
4795,
4797,
4798,
4840,
4873,
4973,
4975,
4976,
5018,
5052,
5154,
5156,
5157,
5171,
5190,
5215,
5233,
5236,
5237,
5288,
5313,
5331,
5350,
5352,
5353,
5361,
5362,
5423,
5486,
5487,
5489,
5490,
5516,
5517,
5925,
5926,
5939,
5948,
5962,
5972,
5981,
5983,
5984,
6014,
6028,
6029,
6057,
6071,
6072,
6120,
6184,
6204,
6223,
6229,
6250,
6276,
6296,
6315,
6321,
6359,
6374,
6376,
6377,
6391,
6416,
6445,
6485,
6500,
6506,
6554,
6577,
6591,
6626,
6667,
6691,
6720,
6739,
6749,
6763,
6785,
6798,
6841,
6847,
6849,
6850,
6864,
6865,
7057,
7058,
7544,
7545,
7559,
7589,
7603,
7604,
7632,
7646,
7647,
7898,
7899,
8112,
8113,
8141,
8142,
8161,
8177,
8183,
8184,
8203,
8219,
8237,
8238,
8257,
8312,
8313,
8355,
8402,
8455,
8456,
8682,
8683,
8696,
8705,
8719,
8729,
8731,
8732,
8751,
8766,
8780,
8799,
8801,
8802,
8809,
8810,
8827,
8840,
8849,
8863,
8873,
8875,
8894,
8909,
8923,
8942,
8943,
9079,
9080,
9094,
9095,
9097,
9098,
9106,
9107,
9393,
9394,
9396,
9397,
9408,
9409,
9451,
9452,
9454,
9455,
9469,
9470,
9552,
9553,
9663,
9664,
9690,
9691,
9788,
9789,
9818,
9819,
9835,
9836,
9837
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9837,
"ccnet_original_nlines": 368,
"rps_doc_curly_bracket": 0.008437530137598515,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2833011746406555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008204629644751549,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2746138870716095,
"rps_doc_frac_unique_words": 0.30676156282424927,
"rps_doc_mean_word_length": 5.11957311630249,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0.0009652500157244503,
"rps_doc_unigram_entropy": 5.372736930847168,
"rps_doc_word_count": 1405,
"rps_doc_frac_chars_dupe_10grams": 0.1479215919971466,
"rps_doc_frac_chars_dupe_5grams": 0.20255804061889648,
"rps_doc_frac_chars_dupe_6grams": 0.17669956386089325,
"rps_doc_frac_chars_dupe_7grams": 0.16043375432491302,
"rps_doc_frac_chars_dupe_8grams": 0.15431669354438782,
"rps_doc_frac_chars_dupe_9grams": 0.1479215919971466,
"rps_doc_frac_chars_top_2gram": 0.00375365000218153,
"rps_doc_frac_chars_top_3gram": 0.014180449768900871,
"rps_doc_frac_chars_top_4gram": 0.019463369622826576,
"rps_doc_books_importance": -917.191650390625,
"rps_doc_books_importance_length_correction": -917.191650390625,
"rps_doc_openwebtext_importance": -539.161865234375,
"rps_doc_openwebtext_importance_length_correction": -539.161865234375,
"rps_doc_wikipedia_importance": -381.52392578125,
"rps_doc_wikipedia_importance_length_correction": -381.52392578125
},
"fasttext": {
"dclm": 0.47995424270629883,
"english": 0.7492157816886902,
"fineweb_edu_approx": 2.791543483734131,
"eai_general_math": 0.423392653465271,
"eai_open_web_math": 0.0407487191259861,
"eai_web_code": 0.3897603750228882
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,658,841,652,851,327,000 |
This documentation is archived and is not being maintained.
SoapAttributeAttribute Class
Specifies that the XmlSerializer should serialize the class member as an encoded SOAP attribute.
For a list of all members of this type, see SoapAttributeAttribute Members.
System.Object
System.Attribute
System.Xml.Serialization.SoapAttributeAttribute
[Visual Basic]
<AttributeUsage(AttributeTargets.Property Or AttributeTargets.Field _
Or AttributeTargets.Parameter Or AttributeTargets.ReturnValue)>
Public Class SoapAttributeAttribute
Inherits Attribute
[C#]
[AttributeUsage(AttributeTargets.Property | AttributeTargets.Field
| AttributeTargets.Parameter | AttributeTargets.ReturnValue)]
public class SoapAttributeAttribute : Attribute
[C++]
[AttributeUsage(AttributeTargets::Property |
AttributeTargets::Field | AttributeTargets::Parameter |
AttributeTargets::ReturnValue)]
public __gc class SoapAttributeAttribute : public Attribute
[JScript]
public
AttributeUsage(AttributeTargets.Property | AttributeTargets.Field |
AttributeTargets.Parameter | AttributeTargets.ReturnValue)
class SoapAttributeAttribute extends Attribute
Thread Safety
Any public static (Shared in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.
Remarks
The SoapAttributeAttribute class belongs to a family of attributes that controls how the XmlSerializer serializes, or deserializes, an object as encoded SOAP XML. The resulting XML conforms to section 5 of the World Wide Web Consortium (www.w3.org) document, "Simple Object Access Protocol (SOAP) 1.1". For a complete list of similar attributes, see Attributes That Control Encoded SOAP Serialization.
To serialize an object as an encoded SOAP message, you must construct the XmlSerializer using an XmlTypeMapping created with the ImportTypeMapping method of the SoapReflectionImporter class.
Apply the SoapAttributeAttribute to a public field to specify that the XmlSerializer serializes the field as an XML attribute. You can specify an alternative name of the attribute by setting the AttributeName property. Set the DataType if the attribute must be given a specific XML Schema definition language (XSD) data type. If the attribute belongs to a specific XML namespace, set the Namespace property.
For more information about using attributes, see Extending Metadata Using Attributes.
Note In your code, you can use the word SoapAttribute instead of the longer SoapAttributeAttribute.
Example
[Visual Basic, C#, C++] The following example serializes a class that contains several fields to which a SoapAttributeAttribute is applied.
[Visual Basic]
Imports System
Imports System.IO
Imports System.Text
Imports System.Xml
Imports System.Xml.Serialization
Imports System.Xml.Schema
<SoapInclude(GetType(Vehicle))> _
Public Class Group
<SoapAttribute (Namespace:= "http:'www.cpandl.com")> _
Public GroupName As String
<SoapAttribute(DataType:= "base64Binary")> _
Public GroupNumber() As Byte
<SoapAttribute(DataType:= "date", AttributeName:= "CreationDate")> _
Public Today As DateTime
<SoapElement(DataType:= "nonNegativeInteger", _
ElementName:= "PosInt")> _
Public PostitiveInt As String
Public GroupVehicle As Vehicle
End Class
Public Class Vehicle
Public licenseNumber As String
End Class
Public Class Run
Shared Sub Main()
Dim test As Run = New Run()
test.SerializeObject("SoapAtts.xml")
test.DeserializeObject("SoapAtts.xml")
End Sub
Public Sub SerializeObject(filename As String)
' Create an instance of the XmlSerializer Class that
' can generate encoded SOAP messages.
Dim mySerializer As XmlSerializer = ReturnSOAPSerializer()
Dim myGroup As Group = MakeGroup()
' Writing the file requires a TextWriter.
Dim writer As XmlTextWriter = _
New XmlTextWriter(filename, Encoding.UTF8)
writer.Formatting = Formatting.Indented
writer.WriteStartElement("wrapper")
' Serialize the Class, and close the TextWriter.
mySerializer.Serialize(writer, myGroup)
writer.WriteEndElement()
writer.Close()
End Sub
Private Function MakeGroup() As Group
' Create an instance of the Class that will be serialized.
Dim myGroup As Group = New Group()
' Set the object properties.
myGroup.GroupName = ".NET"
Dim hexByte() As Byte= New Byte(1){Convert.ToByte(100), _
Convert.ToByte(50)}
myGroup.GroupNumber = hexByte
Dim myDate As DateTime = New DateTime(2002,5,2)
myGroup.Today = myDate
myGroup.PostitiveInt= "10000"
myGroup.GroupVehicle = New Vehicle()
myGroup.GroupVehicle.licenseNumber="1234"
return myGroup
End Function
Public Sub DeserializeObject(filename As String)
' Create an instance of the XmlSerializer Class that
' can generate encoded SOAP messages.
Dim mySerializer As XmlSerializer = ReturnSOAPSerializer()
' Reading the file requires an XmlTextReader.
Dim reader As XmlTextReader = _
New XmlTextReader(filename)
reader.ReadStartElement("wrapper")
' Deserialize and cast the object.
Dim myGroup As Group
myGroup = _
CType(mySerializer.Deserialize(reader), Group)
reader.ReadEndElement()
reader.Close()
End Sub
private Function ReturnSOAPSerializer() As XmlSerializer
' Create an instance of the XmlSerializer Class.
Dim myMapping As XmlTypeMapping = _
(New SoapReflectionImporter().ImportTypeMapping _
(GetType(Group)))
return New XmlSerializer(myMapping)
End Function
End Class
[C#]
using System;
using System.IO;
using System.Text;
using System.Xml;
using System.Xml.Serialization;
using System.Xml.Schema;
[SoapInclude(typeof(Vehicle))]
public class Group
{
[SoapAttribute (Namespace = "http://www.cpandl.com")]
public string GroupName;
[SoapAttribute(DataType = "base64Binary")]
public Byte [] GroupNumber;
[SoapAttribute(DataType = "date", AttributeName = "CreationDate")]
public DateTime Today;
[SoapElement(DataType = "nonNegativeInteger", ElementName = "PosInt")]
public string PostitiveInt;
public Vehicle GroupVehicle;
}
public class Vehicle
{
public string licenseNumber;
}
public class Run
{
public static void Main()
{
Run test = new Run();
test.SerializeObject("SoapAtts.xml");
test.DeserializeObject("SoapAtts.xml");
}
public void SerializeObject(string filename)
{
// Create an instance of the XmlSerializer class that
// can generate encoded SOAP messages.
XmlSerializer mySerializer = ReturnSOAPSerializer();
Group myGroup=MakeGroup();
// Writing the file requires a TextWriter.
XmlTextWriter writer =
new XmlTextWriter(filename, Encoding.UTF8);
writer.Formatting = Formatting.Indented;
writer.WriteStartElement("wrapper");
// Serialize the class, and close the TextWriter.
mySerializer.Serialize(writer, myGroup);
writer.WriteEndElement();
writer.Close();
}
private Group MakeGroup(){
// Create an instance of the class that will be serialized.
Group myGroup = new Group();
// Set the object properties.
myGroup.GroupName = ".NET";
Byte [] hexByte = new Byte[2]{Convert.ToByte(100),
Convert.ToByte(50)};
myGroup.GroupNumber = hexByte;
DateTime myDate = new DateTime(2002,5,2);
myGroup.Today = myDate;
myGroup.PostitiveInt= "10000";
myGroup.GroupVehicle = new Vehicle();
myGroup.GroupVehicle.licenseNumber="1234";
return myGroup;
}
public void DeserializeObject(string filename)
{
// Create an instance of the XmlSerializer class that
// can generate encoded SOAP messages.
XmlSerializer mySerializer = ReturnSOAPSerializer();
// Reading the file requires an XmlTextReader.
XmlTextReader reader=
new XmlTextReader(filename);
reader.ReadStartElement("wrapper");
// Deserialize and cast the object.
Group myGroup;
myGroup = (Group) mySerializer.Deserialize(reader);
reader.ReadEndElement();
reader.Close();
}
private XmlSerializer ReturnSOAPSerializer(){
// Create an instance of the XmlSerializer class.
XmlTypeMapping myMapping =
(new SoapReflectionImporter().ImportTypeMapping
(typeof(Group)));
return new XmlSerializer(myMapping);
}
}
[C++]
#using <mscorlib.dll>
#using <System.dll>
#using <System.Xml.dll>
using namespace System;
using namespace System::IO;
using namespace System::Text;
using namespace System::Xml;
using namespace System::Xml::Serialization;
using namespace System::Xml::Schema;
//using namespace System::Runtime::Remoting::Metadata;
public __gc class Vehicle {
public:
String* licenseNumber;
};
[SoapInclude(__typeof(Vehicle))]
public __gc class Group {
public:
[SoapAttributeAttribute (Namespace = S"http://www.cpandl.com")]
String* GroupName;
[SoapAttributeAttribute(DataType = S"base64Binary")]
Byte GroupNumber[];
[SoapAttributeAttribute(DataType = S"date", AttributeName = S"CreationDate")]
DateTime Today;
[SoapElement(DataType = S"nonNegativeInteger", ElementName = S"PosInt")]
String* PostitiveInt;
Vehicle* GroupVehicle;
};
public __gc class Run {
public:
void SerializeObject(String* filename) {
// Create an instance of the XmlSerializer class that
// can generate encoded SOAP messages.
XmlSerializer* mySerializer = ReturnSOAPSerializer();
Group* myGroup=MakeGroup();
// Writing the file requires a TextWriter.
XmlTextWriter* writer = new XmlTextWriter(filename, Encoding::UTF8);
writer->Formatting = Formatting::Indented;
writer->WriteStartElement(S"wrapper");
// Serialize the class, and close the TextWriter.
mySerializer->Serialize(writer, myGroup);
writer->WriteEndElement();
writer->Close();
}
private:
Group* MakeGroup() {
// Create an instance of the class that will be serialized.
Group* myGroup = new Group();
// Set the Object* properties.
myGroup->GroupName = S".NET";
Byte hexByte[] = {Convert::ToByte(100),
Convert::ToByte(50)};
myGroup->GroupNumber = hexByte;
DateTime myDate = DateTime(2002, 5, 2);
myGroup->Today = myDate;
myGroup->PostitiveInt= S"10000";
myGroup->GroupVehicle = new Vehicle();
myGroup->GroupVehicle->licenseNumber=S"1234";
return myGroup;
}
public:
void DeserializeObject(String* filename) {
// Create an instance of the XmlSerializer class that
// can generate encoded SOAP messages.
XmlSerializer* mySerializer = ReturnSOAPSerializer();
// Reading the file requires an XmlTextReader.
XmlTextReader* reader = new XmlTextReader(filename);
reader->ReadStartElement(S"wrapper");
// Deserialize and cast the Object*.
Group* myGroup;
myGroup = __try_cast<Group*>( mySerializer->Deserialize(reader) );
reader->ReadEndElement();
reader->Close();
}
private:
XmlSerializer* ReturnSOAPSerializer() {
// Create an instance of the XmlSerializer class.
XmlTypeMapping* myMapping =
(new SoapReflectionImporter())->ImportTypeMapping(__typeof(Group));
return new XmlSerializer(myMapping);
}
};
int main() {
Run* test = new Run();
test->SerializeObject(S"SoapAtts.xml");
test->DeserializeObject(S"SoapAtts.xml");
}
[JScript] No example is available for JScript. To view a Visual Basic, C#, or C++ example, click the Language Filter button Language Filter in the upper-left corner of the page.
Requirements
Namespace: System.Xml.Serialization
Platforms: Windows 98, Windows NT 4.0, Windows Millennium Edition, Windows 2000, Windows XP Home Edition, Windows XP Professional, Windows Server 2003 family, .NET Compact Framework
Assembly: System.Xml (in System.Xml.dll)
See Also
SoapAttributeAttribute Members | System.Xml.Serialization Namespace | XmlSerializer | SoapAttributeOverrides | SoapAttribute
Show:
|
{
"url": "https://msdn.microsoft.com/en-us/library/system.xml.serialization.soapattributeattribute(v=vs.71).aspx",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "78239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BIJNNNBL2ZSHO4EIP2TCGDFCRJU34DVZ",
"WARC-Concurrent-To": "<urn:uuid:8f40eef4-9caa-4d01-90d0-ad586831adfc>",
"WARC-Date": "2018-01-17T06:47:21Z",
"WARC-IP-Address": "157.56.148.19",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:T6R6SIMCYGJKG5I5WLT4HTEHS3KUOJQK",
"WARC-Record-ID": "<urn:uuid:13263a9d-a9b9-40bf-a292-3ac7d3371686>",
"WARC-Target-URI": "https://msdn.microsoft.com/en-us/library/system.xml.serialization.soapattributeattribute(v=vs.71).aspx",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6c25bc3c-880c-4cf9-9e00-8e3410027e52>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-113-164.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,
60,
61,
90,
91,
188,
189,
265,
266,
280,
300,
354,
355,
370,
440,
507,
543,
565,
570,
637,
702,
750,
756,
801,
860,
895,
955,
965,
972,
1043,
1105,
1152,
1153,
1167,
1168,
1308,
1309,
1317,
1318,
1720,
1721,
1912,
1913,
2321,
2322,
2408,
2409,
2511,
2512,
2520,
2521,
2661,
2662,
2678,
2693,
2711,
2731,
2750,
2783,
2809,
2810,
2844,
2863,
2864,
2922,
2956,
3004,
3038,
3039,
3111,
3140,
3191,
3221,
3255,
3256,
3291,
3301,
3304,
3325,
3360,
3370,
3371,
3388,
3389,
3410,
3414,
3448,
3491,
3536,
3547,
3551,
3601,
3605,
3664,
3708,
3775,
3776,
3817,
3865,
3903,
3952,
3998,
4040,
4095,
4141,
4172,
4193,
4204,
4205,
4247,
4312,
4353,
4354,
4389,
4422,
4423,
4487,
4513,
4549,
4550,
4604,
4633,
4669,
4712,
4760,
4781,
4804,
4805,
4857,
4916,
4960,
5026,
5027,
5080,
5118,
5152,
5193,
5194,
5235,
5263,
5281,
5334,
5364,
5385,
5386,
5397,
5401,
5462,
5517,
5559,
5615,
5639,
5682,
5698,
5708,
5709,
5715,
5729,
5746,
5765,
5783,
5815,
5840,
5841,
5872,
5891,
5893,
5950,
5978,
5982,
6028,
6059,
6060,
6130,
6156,
6230,
6261,
6262,
6294,
6296,
6299,
6320,
6322,
6354,
6356,
6357,
6374,
6376,
6405,
6410,
6438,
6482,
6528,
6533,
6581,
6586,
6646,
6691,
6751,
6752,
6785,
6834,
6864,
6914,
6961,
7004,
7060,
7107,
7139,
7161,
7166,
7167,
7197,
7263,
7298,
7299,
7335,
7369,
7370,
7427,
7454,
7491,
7492,
7540,
7570,
7607,
7651,
7700,
7722,
7734,
7735,
7785,
7790,
7850,
7895,
7955,
7956,
8010,
8039,
8074,
8116,
8117,
8159,
8181,
8239,
8270,
8292,
8293,
8298,
8302,
8351,
8407,
8441,
8495,
8519,
8563,
8568,
8570,
8571,
8578,
8600,
8620,
8644,
8645,
8669,
8697,
8727,
8756,
8800,
8837,
8892,
8893,
8921,
8929,
8956,
8959,
8960,
8993,
9019,
9027,
9095,
9118,
9119,
9176,
9200,
9201,
9283,
9303,
9304,
9381,
9407,
9408,
9435,
9438,
9439,
9463,
9471,
9516,
9578,
9625,
9688,
9689,
9725,
9776,
9853,
9904,
9951,
10009,
10059,
10094,
10119,
10125,
10126,
10135,
10160,
10228,
10266,
10267,
10306,
10344,
10345,
10393,
10427,
10467,
10468,
10516,
10549,
10590,
10637,
10691,
10715,
10728,
10729,
10737,
10784,
10846,
10893,
10956,
10957,
11013,
11074,
11120,
11121,
11166,
11191,
11266,
11300,
11325,
11326,
11332,
11333,
11342,
11386,
11444,
11481,
11561,
11606,
11612,
11615,
11616,
11629,
11656,
11700,
11746,
11748,
11749,
11927,
11928,
11941,
11942,
11978,
11979,
12161,
12162,
12203,
12204,
12213,
12214,
12339,
12340
],
"line_end_idx": [
60,
61,
90,
91,
188,
189,
265,
266,
280,
300,
354,
355,
370,
440,
507,
543,
565,
570,
637,
702,
750,
756,
801,
860,
895,
955,
965,
972,
1043,
1105,
1152,
1153,
1167,
1168,
1308,
1309,
1317,
1318,
1720,
1721,
1912,
1913,
2321,
2322,
2408,
2409,
2511,
2512,
2520,
2521,
2661,
2662,
2678,
2693,
2711,
2731,
2750,
2783,
2809,
2810,
2844,
2863,
2864,
2922,
2956,
3004,
3038,
3039,
3111,
3140,
3191,
3221,
3255,
3256,
3291,
3301,
3304,
3325,
3360,
3370,
3371,
3388,
3389,
3410,
3414,
3448,
3491,
3536,
3547,
3551,
3601,
3605,
3664,
3708,
3775,
3776,
3817,
3865,
3903,
3952,
3998,
4040,
4095,
4141,
4172,
4193,
4204,
4205,
4247,
4312,
4353,
4354,
4389,
4422,
4423,
4487,
4513,
4549,
4550,
4604,
4633,
4669,
4712,
4760,
4781,
4804,
4805,
4857,
4916,
4960,
5026,
5027,
5080,
5118,
5152,
5193,
5194,
5235,
5263,
5281,
5334,
5364,
5385,
5386,
5397,
5401,
5462,
5517,
5559,
5615,
5639,
5682,
5698,
5708,
5709,
5715,
5729,
5746,
5765,
5783,
5815,
5840,
5841,
5872,
5891,
5893,
5950,
5978,
5982,
6028,
6059,
6060,
6130,
6156,
6230,
6261,
6262,
6294,
6296,
6299,
6320,
6322,
6354,
6356,
6357,
6374,
6376,
6405,
6410,
6438,
6482,
6528,
6533,
6581,
6586,
6646,
6691,
6751,
6752,
6785,
6834,
6864,
6914,
6961,
7004,
7060,
7107,
7139,
7161,
7166,
7167,
7197,
7263,
7298,
7299,
7335,
7369,
7370,
7427,
7454,
7491,
7492,
7540,
7570,
7607,
7651,
7700,
7722,
7734,
7735,
7785,
7790,
7850,
7895,
7955,
7956,
8010,
8039,
8074,
8116,
8117,
8159,
8181,
8239,
8270,
8292,
8293,
8298,
8302,
8351,
8407,
8441,
8495,
8519,
8563,
8568,
8570,
8571,
8578,
8600,
8620,
8644,
8645,
8669,
8697,
8727,
8756,
8800,
8837,
8892,
8893,
8921,
8929,
8956,
8959,
8960,
8993,
9019,
9027,
9095,
9118,
9119,
9176,
9200,
9201,
9283,
9303,
9304,
9381,
9407,
9408,
9435,
9438,
9439,
9463,
9471,
9516,
9578,
9625,
9688,
9689,
9725,
9776,
9853,
9904,
9951,
10009,
10059,
10094,
10119,
10125,
10126,
10135,
10160,
10228,
10266,
10267,
10306,
10344,
10345,
10393,
10427,
10467,
10468,
10516,
10549,
10590,
10637,
10691,
10715,
10728,
10729,
10737,
10784,
10846,
10893,
10956,
10957,
11013,
11074,
11120,
11121,
11166,
11191,
11266,
11300,
11325,
11326,
11332,
11333,
11342,
11386,
11444,
11481,
11561,
11606,
11612,
11615,
11616,
11629,
11656,
11700,
11746,
11748,
11749,
11927,
11928,
11941,
11942,
11978,
11979,
12161,
12162,
12203,
12204,
12213,
12214,
12339,
12340,
12345
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12345,
"ccnet_original_nlines": 379,
"rps_doc_curly_bracket": 0.0030781698878854513,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1147541031241417,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024590160697698593,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37560269236564636,
"rps_doc_frac_unique_words": 0.2702205777168274,
"rps_doc_mean_word_length": 8.070772171020508,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0.0033751199953258038,
"rps_doc_unigram_entropy": 5.084851264953613,
"rps_doc_word_count": 1088,
"rps_doc_frac_chars_dupe_10grams": 0.3069126605987549,
"rps_doc_frac_chars_dupe_5grams": 0.4417492151260376,
"rps_doc_frac_chars_dupe_6grams": 0.39072999358177185,
"rps_doc_frac_chars_dupe_7grams": 0.3869718611240387,
"rps_doc_frac_chars_dupe_8grams": 0.3357248604297638,
"rps_doc_frac_chars_dupe_9grams": 0.3069126605987549,
"rps_doc_frac_chars_top_2gram": 0.009679989889264107,
"rps_doc_frac_chars_top_3gram": 0.021865390241146088,
"rps_doc_frac_chars_top_4gram": 0.02459857054054737,
"rps_doc_books_importance": -820.8995361328125,
"rps_doc_books_importance_length_correction": -820.8995361328125,
"rps_doc_openwebtext_importance": -488.8701477050781,
"rps_doc_openwebtext_importance_length_correction": -488.8701477050781,
"rps_doc_wikipedia_importance": -447.22735595703125,
"rps_doc_wikipedia_importance_length_correction": -447.22735595703125
},
"fasttext": {
"dclm": 0.8575644493103027,
"english": 0.44209545850753784,
"fineweb_edu_approx": 3.188448190689087,
"eai_general_math": 0.5035725831985474,
"eai_open_web_math": 0.061244189739227295,
"eai_web_code": 0.6845376491546631
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-1,060,549,188,661,363,800 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I need to calculate a summary md5 checksum for all files of a particular type ( *.py for example ) placed under a directory and all subdirectories. What is the best way to do that? Thanks.
The proposed solutions are very nice, but this is not exactly what I need. I'm looking for a solution to get a single SUMMARY checksum which will uniquely identify the directory as a whole - including content of all its subdirs. Thanks a lot.
share|improve this question
1
Seems like a superuser question to me. – Noldorin Nov 1 '09 at 14:52
5
Note that checksums don't uniquely identify anything. – Hosam Aly Nov 1 '09 at 15:58
Why would you have two directory trees that may or may not be "the same" that you want to uniquely identify? Does file create/modify/access time matter? Is version control what you really need? – jmucchiello Nov 1 '09 at 22:36
What is really matter in my case is similarity of the whole directory tree content which means AFAIK the following: 1) content of any file under the directory tree has not been changed 2) no new file was added to the directory tree 3) no file was deleted – victorz Nov 3 '09 at 11:18
17 Answers 17
up vote 102 down vote accepted
find /path/to/dir/ -type f -name "*.py" -exec md5sum {} + | awk '{print $1}' | sort | md5sum
The find command lists all the files that end in .py. The md5sum is computed for each .py file. awk is used to pick off the md5sums (ignoring the filenames, which may not be unique). The md5sums are sorted. The md5sum of this sorted list is then returned.
I've tested this by copying a test directory:
rsync -a ~/pybin/ ~/pybin2/
I renamed some of the files in ~/pybin2.
The find...md5sum command returns the same output for both directories.
2bcf49a4d19ef9abd284311108d626f1 -
share|improve this answer
This one really works as expected! Thanks a million! – victorz Nov 3 '09 at 11:49
13
Note that the same checksum will be generated if a file gets renamed. So this doesn't truly fit a "checksum which will uniquely identify the directory as a whole" if you consider file layout part of the signature. – Valentin Milea Jan 27 '12 at 13:46
1
you could slightly change the command-line to prefix each file checksum with the name of the file (or even better, the relative path of the file from /path/to/dir/) so it is taken into account in the final checksum. – Michael Zilbermann May 16 '13 at 8:02
3
@zim2001: Yes, it could be altered, but as I understood the problem (especially due to the OP's comment under the question), the OP wanted any two directories to be considered equal if the contents of the files were identical regardless of filename or even relative path. – unutbu May 16 '13 at 9:31
@unutbu : I know; i was reacting to the previous note, from Valentin Milea. – Michael Zilbermann May 22 '13 at 9:02
Create a tar archive file on the fly and pipe that to md5sum:
tar c dir | md5sum
This produces a single md5sum that should be unique to your file and sub-directory setup. No files are created on disk.
share|improve this answer
5
+1, simple and elegant – Adam Rosenfield Nov 1 '09 at 22:48
3
except if it differs, you don't know which dir or file is the culprit... – CharlesB Nov 1 '11 at 16:42
20
@CharlesB with a single check-sum you never know which file is different. The question was about a single check-sum for a directory. – Hawken Jul 1 '12 at 16:11
9
ls -alR dir | md5sum . This is even better no compression just a read. It is unique because the content contains the mod time and size of file ;) – Sid Oct 3 '12 at 1:14
10
@Daps0l - there is no compression in my command. You need to add z for gzip, or j for bzip2. I've done neither. – ire_and_curses Nov 7 '12 at 18:19
ire_and_curses's suggestion of using tar c <dir> has some issues:
• tar processes directory entries in the order which they are stored in the filesystem, and there is no way to change this order. This effectively can yield completely different results if you have the "same" directory on different places, and I know no way to fix this (tar cannot "sort" its input files in a particular order).
• I usually care about whether groupid and ownerid numbers are the same, not necessarily whether the string representation of group/owner are the same. This is in line with what for example rsync -a --delete does: it synchronizes virtually everything (minus xattrs and acls), but it will sync owner and group based on their ID, not on string representation. So if you synced to a different system that doesn't necessarily have the same users/groups, you should add the --numeric-owner flag to tar
• tar will include the filename of the directory you're checking itself, just something to be aware of.
As long as there is no fix for the first problem (or unless you're sure it does not affect you), I would not use this approach.
The find based solutions proposed above are also no good because they only include files, not directories, which becomes an issue if you the checksumming should keep in mind empty directories.
Finally, most suggested solutions don't sort consistently, because the collation might be different across systems.
This is the solution I came up with:
dir=<mydir>; (find "$dir" -type f -exec md5sum {} +; find "$dir" -type d) | LC_ALL=C sort | md5sum
Notes about this solution:
• The LC_ALL=C is to ensure reliable sorting order across systems
• This doesn't differentiate between a directory "named\nwithanewline" and two directories "named" and "withanewline", but the chance of that occuring seems very unlikely. One usually fixes this with a -print0 flag for find but since there's other stuff going on here, I can only see solutions that would make the command more complicated then it's worth.
PS: one of my systems uses a limited busybox find which does not support -exec nor -print0 flags, and also it appends '/' to denote directories, while findutils find doesn't seem to, so for this machine I need to run:
dir=<mydir>; (find "$dir" -type f | while read f; do md5sum "$f"; done; find "$dir" -type d | sed 's#/$##') | LC_ALL=C sort | md5sum
Luckily, I have no files/directories with newlines in their names, so this is not an issue on that system.
share|improve this answer
+1: Very interesting! Are you saying that the order might differ between different filesystem types, or within the same filesystem? – ire_and_curses Nov 1 '11 at 17:10
1
both. it just depends on the order of the directory entries within each directory. AFAIK directory entries (in the filesystem) are just created in the order in which you "create files in the directory". A simple example: $ mkdir a; touch a/file-1; touch a/file-2 $ mkdir b; touch b/file-2; touch b/file-1 $ (cd a; tar -c . | md5sum) fb29e7af140aeea5a2647974f7cdec77 - $ (cd b; tar -c . | md5sum) a3a39358158a87059b9f111ccffa1023 - – Dieter_be Nov 14 '11 at 13:01
For the sake of completeness, there's md5deep(1); it's not directly applicable due to *.py filter requirement but should do fine together with find(1).
share|improve this answer
If you only care about files and not empty directories, this works nicely:
find /path -type f | sort -u | xargs cat | md5sum
share|improve this answer
Take a look at this and this for a more detailed explanation.
share|improve this answer
nice! your link shows how to sum individual files in a folder and pipe to a file, just what I wanted. With that I am making a script to check web integrity regularly. Thanks (3 years on...) – sdjuan Jun 13 '12 at 3:44
If you want one md5sum spanning the whole directory, I would do something like
cat *.py | md5sum
share|improve this answer
Great, but doesn't include those of subdirectories content... – victorz Nov 1 '09 at 14:57
1
For subdirs use something like cat **.py | md5sum – Ramon Nov 1 '09 at 15:05
GNU find
find /path -type f -name "*.py" -exec md5sum "{}" +;
share|improve this answer
Should the last token be \;? – Dan Moulding Nov 1 '09 at 15:03
its valid for GNU find. check the man page for more info. – ghostdog74 Nov 1 '09 at 15:11
Technically you only need to run ls -lR *.py | md5sum. Unless you are worried about someone modifying the files and touching them back to their original dates and never changing the files' sizes, the output from ls should tell you if the file has changed. My unix-foo is weak so you might need some more command line parameters to get the create time and modification time to print. ls will also tell you if permissions on the files have changed (and I'm sure there are switches to turn that off if you don't care about that).
share|improve this answer
3
This may fit some use cases, but generally you would want the checksum to reflect only the content and not the dates at all. For example, if I touch a file to change its date (but not its contents) then I would expect the checksum to be unchanged. – Todd Owen Oct 2 '12 at 6:22
I use HashCopy to do this. It can generate and verify MD5 and SHA on a single file or a directory. It can be downloaded from www.jdxsoftware.org.
share|improve this answer
I think I have found the final word in the "entire directory comparison". the article propose several conditions or several definition of equality between directories :
http://unix.stackexchange.com/questions/35832/how-do-i-get-the-md5-sum-of-a-directorys-contents-as-one-sum
share|improve this answer
1
Note that link-only answers are discouraged, SO answers should be the end-point of a search for a solution (vs. yet another stopover of references, which tend to get stale over time). Please consider adding a stand-alone synopsis here, keeping the link as a reference. – kleopatra Sep 1 '13 at 21:14
Yes, indeed but I cannot make a more complete answer... Me, I am interested in my link, that is enough for me. And, it is positive, because people looking for the same answer could follow the link and find a more complete answer. – MUY Belgium Sep 2 '13 at 21:48
A solution which worked best for me:
find "$path" -type f -print0 | sort -z | xargs -r0 md5sum | md5sum
Reason why it worked best for me:
1. handles file names containing spaces
2. Ignores filesystem meta-data
3. Detects if file has been renamed
Issues with other answers:
Filesystem meta-data is not ignored for:
tar c - "$path" | md5sum
Does not handle file names containing spaces nor detects if file has been renamed:
find /path -type f | sort -u | xargs cat | md5sum
share|improve this answer
I had the same problem so I came up with this script that just lists the md5sums of the files in the directory and if it finds a subdirectory it runs again from there, for this to happen the script has to be able to run through the current directory or from a subdirectory if said argument is passed in $1
#!/bin/bash
if [ -z "$1" ] ; then
# loop in current dir
ls | while read line; do
ecriv=`pwd`"/"$line
if [ -f $ecriv ] ; then
md5sum "$ecriv"
elif [ -d $ecriv ] ; then
sh myScript "$line" # call this script again
fi
done
else # if a directory is specified in argument $1
ls "$1" | while read line; do
ecriv=`pwd`"/$1/"$line
if [ -f $ecriv ] ; then
md5sum "$ecriv"
elif [ -d $ecriv ] ; then
sh myScript "$line"
fi
done
fi
share|improve this answer
I'm pretty sure that this script will fail if filenames contain spaces or quotes. I find this annoying with bash scripting, but what I do is change the IFS. – localhost Jun 24 '13 at 23:36
If you want really independance from the filesystem attributes and from the bit-level differences of some tar versions, you could use cpio:
cpio -i -e theDirname | md5sum
share|improve this answer
Using md5deep:
md5deep -r FOLDER | awk '{print $1}' | sort | md5sum
share|improve this answer
Checksum all files, including both content and their filenames
grep -ar -e . /your/dir | md5sum | cut -c-32
Same as above, but only including *.py files
grep -ar -e . --include="*.py" /your/dir | md5sum | cut -c-32
You can also follow symlinks if you want
grep -aR -e . /your/dir | md5sum | cut -c-32
Other options you could consider using with grep
-s, --no-messages suppress error messages
-D, --devices=ACTION how to handle devices, FIFOs and sockets;
-Z, --null print 0 byte after FILE name
-U, --binary do not strip CR characters at EOL (MSDOS/Windows)
share|improve this answer
Starting from this
#!/bin/bash
for f in /ur/path/*; do
md5sum "$f"
done
you can call it recursively.
Or you can also use gensum, thinked for generate checksum from archives, folders, files and strings
share|improve this answer
Downvote: This contains multiple errors; fixing them would eventually turn it into one of the properly explained answers. – tripleee Apr 8 at 11:12
fixed :\ done and /* missing whuuups – Nhoya Apr 8 at 13:59
1
I fixed some more but this still offers no advantage over the trivial md5sum /ur/path/* – tripleee Apr 8 at 15:35
@tripleee is md5sum $f.. Btw i explicitely wrote "you con start from that... And call it recoursively – Nhoya Apr 9 at 9:42
And pointing out the obvious starting point in slightly obscure form when there are already multiple answers which explain how to finish the job is useful because...? – tripleee Apr 9 at 9:48
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/1657232/how-can-i-calculate-an-md5-checksum-of-a-directory/1658554",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "170818",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2WGIKPEP2D5IJQMVQBPVX66JQJAZO5H",
"WARC-Concurrent-To": "<urn:uuid:ffa4bd32-f70c-4216-90b2-c9e8fa3afd1f>",
"WARC-Date": "2015-09-04T02:33:50Z",
"WARC-IP-Address": "104.16.103.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JMHN3X7FXCXP76S2PIJFT64SLPQZ6ATH",
"WARC-Record-ID": "<urn:uuid:4bad5ccc-372b-47e1-931f-b58a0e026be1>",
"WARC-Target-URI": "http://stackoverflow.com/questions/1657232/how-can-i-calculate-an-md5-checksum-of-a-directory/1658554",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c18c7bd-6f0f-4836-b754-bfdeaa57d20d>"
},
"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,
25,
131,
132,
321,
322,
565,
566,
594,
598,
668,
672,
758,
763,
991,
996,
1281,
1282,
1296,
1297,
1328,
1421,
1422,
1678,
1679,
1725,
1726,
1754,
1755,
1796,
1797,
1869,
1870,
1906,
1932,
1937,
2020,
2025,
2277,
2281,
2538,
2542,
2843,
2848,
2965,
2966,
3028,
3029,
3048,
3049,
3169,
3170,
3196,
3200,
3261,
3265,
3369,
3374,
3536,
3540,
3711,
3716,
3865,
3866,
3932,
3933,
4264,
4763,
4869,
4870,
4998,
4999,
5192,
5193,
5309,
5310,
5347,
5348,
5447,
5448,
5475,
5476,
5544,
5902,
5903,
6121,
6122,
6255,
6256,
6363,
6364,
6390,
6395,
6564,
6568,
7032,
7033,
7185,
7186,
7212,
7213,
7288,
7289,
7339,
7365,
7366,
7428,
7429,
7455,
7460,
7679,
7680,
7759,
7760,
7778,
7804,
7809,
7901,
7905,
7983,
7984,
7993,
7994,
8047,
8073,
8078,
8142,
8147,
8238,
8239,
8766,
8767,
8793,
8797,
9076,
9077,
9223,
9224,
9250,
9251,
9420,
9421,
9528,
9529,
9555,
9559,
9860,
9865,
10129,
10130,
10167,
10168,
10235,
10236,
10270,
10271,
10313,
10347,
10385,
10386,
10413,
10414,
10455,
10456,
10481,
10482,
10565,
10566,
10616,
10642,
10643,
10949,
10950,
10962,
10963,
10985,
10986,
11008,
11033,
11055,
11079,
11099,
11125,
11174,
11177,
11178,
11183,
11184,
11185,
11235,
11236,
11266,
11291,
11292,
11316,
11336,
11337,
11363,
11387,
11390,
11391,
11396,
11397,
11398,
11401,
11427,
11432,
11622,
11623,
11763,
11764,
11795,
11821,
11822,
11837,
11838,
11891,
11892,
11918,
11919,
11982,
11983,
12028,
12029,
12074,
12075,
12137,
12138,
12179,
12180,
12225,
12226,
12275,
12276,
12326,
12394,
12449,
12525,
12551,
12552,
12571,
12572,
12584,
12608,
12624,
12629,
12630,
12659,
12660,
12760,
12761,
12787,
12792,
12941,
12946,
13007,
13011,
13126,
13131,
13256,
13261,
13454,
13455,
13467,
13468,
13470,
13478,
13479,
13557,
13558
],
"line_end_idx": [
25,
131,
132,
321,
322,
565,
566,
594,
598,
668,
672,
758,
763,
991,
996,
1281,
1282,
1296,
1297,
1328,
1421,
1422,
1678,
1679,
1725,
1726,
1754,
1755,
1796,
1797,
1869,
1870,
1906,
1932,
1937,
2020,
2025,
2277,
2281,
2538,
2542,
2843,
2848,
2965,
2966,
3028,
3029,
3048,
3049,
3169,
3170,
3196,
3200,
3261,
3265,
3369,
3374,
3536,
3540,
3711,
3716,
3865,
3866,
3932,
3933,
4264,
4763,
4869,
4870,
4998,
4999,
5192,
5193,
5309,
5310,
5347,
5348,
5447,
5448,
5475,
5476,
5544,
5902,
5903,
6121,
6122,
6255,
6256,
6363,
6364,
6390,
6395,
6564,
6568,
7032,
7033,
7185,
7186,
7212,
7213,
7288,
7289,
7339,
7365,
7366,
7428,
7429,
7455,
7460,
7679,
7680,
7759,
7760,
7778,
7804,
7809,
7901,
7905,
7983,
7984,
7993,
7994,
8047,
8073,
8078,
8142,
8147,
8238,
8239,
8766,
8767,
8793,
8797,
9076,
9077,
9223,
9224,
9250,
9251,
9420,
9421,
9528,
9529,
9555,
9559,
9860,
9865,
10129,
10130,
10167,
10168,
10235,
10236,
10270,
10271,
10313,
10347,
10385,
10386,
10413,
10414,
10455,
10456,
10481,
10482,
10565,
10566,
10616,
10642,
10643,
10949,
10950,
10962,
10963,
10985,
10986,
11008,
11033,
11055,
11079,
11099,
11125,
11174,
11177,
11178,
11183,
11184,
11185,
11235,
11236,
11266,
11291,
11292,
11316,
11336,
11337,
11363,
11387,
11390,
11391,
11396,
11397,
11398,
11401,
11427,
11432,
11622,
11623,
11763,
11764,
11795,
11821,
11822,
11837,
11838,
11891,
11892,
11918,
11919,
11982,
11983,
12028,
12029,
12074,
12075,
12137,
12138,
12179,
12180,
12225,
12226,
12275,
12276,
12326,
12394,
12449,
12525,
12551,
12552,
12571,
12572,
12584,
12608,
12624,
12629,
12630,
12659,
12660,
12760,
12761,
12787,
12792,
12941,
12946,
13007,
13011,
13126,
13131,
13256,
13261,
13454,
13455,
13467,
13468,
13470,
13478,
13479,
13557,
13558,
13648
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13648,
"ccnet_original_nlines": 269,
"rps_doc_curly_bracket": 0.0007327100029215217,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35960912704467773,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020521169528365135,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27133551239967346,
"rps_doc_frac_unique_words": 0.3183012306690216,
"rps_doc_mean_word_length": 4.4693522453308105,
"rps_doc_num_sentences": 115,
"rps_doc_symbol_to_word_ratio": 0.004885990172624588,
"rps_doc_unigram_entropy": 5.784693717956543,
"rps_doc_word_count": 2284,
"rps_doc_frac_chars_dupe_10grams": 0.03095610998570919,
"rps_doc_frac_chars_dupe_5grams": 0.06387147307395935,
"rps_doc_frac_chars_dupe_6grams": 0.04858934134244919,
"rps_doc_frac_chars_dupe_7grams": 0.036050159484148026,
"rps_doc_frac_chars_dupe_8grams": 0.03095610998570919,
"rps_doc_frac_chars_dupe_9grams": 0.03095610998570919,
"rps_doc_frac_chars_top_2gram": 0.028213169425725937,
"rps_doc_frac_chars_top_3gram": 0.03663792833685875,
"rps_doc_frac_chars_top_4gram": 0.006269589997828007,
"rps_doc_books_importance": -1369.5472412109375,
"rps_doc_books_importance_length_correction": -1369.5472412109375,
"rps_doc_openwebtext_importance": -749.5880126953125,
"rps_doc_openwebtext_importance_length_correction": -749.5880126953125,
"rps_doc_wikipedia_importance": -683.637451171875,
"rps_doc_wikipedia_importance_length_correction": -683.637451171875
},
"fasttext": {
"dclm": 0.1644536852836609,
"english": 0.8912263512611389,
"fineweb_edu_approx": 1.627649188041687,
"eai_general_math": 0.38035255670547485,
"eai_open_web_math": 0.42321497201919556,
"eai_web_code": 0.01075487956404686
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,852,200,976,843,471,000 |
The Modular Approach to Simplifying Biometric Identity Verification
Identity verification must be secure and efficient in today's digital world. A modular approach to biometric identity verification emerges as a game changer as businesses and organizations increasingly rely on biometric authentication methods. In this blog article, we will look into biometric modular technology and how it streamlines identity verification while increasing security.
Biometric Identity Verification's Evolution
Passwords and PINs, for example, have long been known to be vulnerable methods of identity verification. Biometric authentication systems, such as fingerprint scanning, facial recognition, and iris scanning, provide a more secure and convenient option. These approaches rely on distinct physical or behavioral characteristics, making illegal access extremely difficult.
However, deploying biometric identity verification systems can be complicated and costly, necessitating extensive hardware and software integration. This is where biometric modular technology enters the picture.
Understanding Biometric Modular Technology
Biometric modular technology entails disassembling biometric identity verification systems into smaller, compatible pieces. Sensors, algorithms, and data storage are examples of such modules. Organizations can design a more flexible and adaptable verification system by separating these components.
Biometric Modular Technology
The Key Advantages of a Modular Approach
Scalability: Organizations can start small and eventually develop their biometric verification system with a modular approach. This eliminates the need for large initial investments, making it affordable to organizations of all sizes.
Interoperability: Modular components fit easily into existing systems, ensuring compatibility with a wide range of hardware and software solutions. This adaptability is especially beneficial for enterprises with different technology infrastructures.
Improved protection: Biometric modular technology enables enterprises to continuously update and improve individual components, resulting in improved protection against evolving threats. This flexibility is critical for maintaining a reliable authentication system.
Cost-Efficiency: A modular strategy can greatly minimize implementation and maintenance costs by avoiding the need for a total system overhaul. Organizations can better allocate resources.
Real-Life Applications
1.Financial services
Modular biometric technology is being used by banks and financial institutions to improve the security of their services. Customers may now use a simple fingerprint scan to access their accounts and authorize transactions, minimizing their dependency on traditional security measures such as passwords.
2.Healthcare
Patient identification is crucial in healthcare for accurate record-keeping and treatment. Modular biometric solutions are being utilized to simplify patient check-ins, ensuring that the correct patient receives the correct care while protecting data privacy.
3.Government and Law Enforcement
Biometric modular technology is used by government agencies and law enforcement to improve border security and criminal investigations. Facial recognition modules, for example, can instantly identify people of interest, so boosting public safety.
Challenges and Considerations
While biometric signatures provide numerous benefits, there are also challenges and factors to consider:
Complexity of Integration: Integrating multiple biometric modules into an existing system may necessitate technical skill. To avoid disruptions, organizations should carefully plan the integration process.
Biometric Identity Verification in the Future
The modular approach to biometric identity verification is projected to play a vital role in shaping the future of authentication as technology advances. Businesses and organizations can better respond to the ever-changing landscape of identity verification thanks to its scalability, interoperability, and greater security.
Finally, biometric modular technology is making it easier to establish biometric identity verification systems. Its adaptability and low cost make it an appealing alternative for enterprises wishing to improve security while streamlining authentication operations. As biometric modular technology becomes more widely used, it offers a more secure and user-friendly future for identity verification.
Implementing biometric verification is an important step toward protecting your organization's data and ensuring that only authorized individuals have access to sensitive information. Adopting a modular approach to biometric identity verification is not only a wise business move, but it is also an important step in protecting your digital assets.
The ways we employ to authenticate our identities will change as technology advances. Identity verification is modular in the future, and it is simpler and more safe than before.
Comments
|
{
"url": "https://blog.mantratec.com/Biometric-Identity-Verification",
"source_domain": "blog.mantratec.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "49407",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PHAPJ2L6XB5PZGQFEKFV46NA7H6PTJQL",
"WARC-Concurrent-To": "<urn:uuid:f6f87f65-3fcd-461b-be67-68731d3823fd>",
"WARC-Date": "2023-12-06T20:35:03Z",
"WARC-IP-Address": "115.124.96.52",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K3BESBX4NVMNR7YHNICAAEHF7OCBSCFE",
"WARC-Record-ID": "<urn:uuid:ca288bb2-3a2d-475c-a03f-fd4076175f84>",
"WARC-Target-URI": "https://blog.mantratec.com/Biometric-Identity-Verification",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b09ce7e2-ff7d-4461-a366-be817c60e7fd>"
},
"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-11\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
68,
69,
454,
455,
456,
500,
501,
871,
872,
1084,
1085,
1086,
1129,
1130,
1429,
1430,
1459,
1460,
1501,
1502,
1737,
1738,
1988,
1989,
2255,
2256,
2445,
2446,
2447,
2470,
2471,
2492,
2795,
2796,
2809,
3069,
3070,
3103,
3350,
3351,
3352,
3382,
3383,
3488,
3489,
3695,
3696,
3697,
3743,
3744,
4069,
4070,
4469,
4470,
4819,
4820,
4999,
5000
],
"line_end_idx": [
68,
69,
454,
455,
456,
500,
501,
871,
872,
1084,
1085,
1086,
1129,
1130,
1429,
1430,
1459,
1460,
1501,
1502,
1737,
1738,
1988,
1989,
2255,
2256,
2445,
2446,
2447,
2470,
2471,
2492,
2795,
2796,
2809,
3069,
3070,
3103,
3350,
3351,
3352,
3382,
3383,
3488,
3489,
3695,
3696,
3697,
3743,
3744,
4069,
4070,
4469,
4470,
4819,
4820,
4999,
5000,
5008
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5008,
"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.3061497211456299,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002673800103366375,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11497326195240021,
"rps_doc_frac_unique_words": 0.46707504987716675,
"rps_doc_mean_word_length": 6.4977030754089355,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.150392532348633,
"rps_doc_word_count": 653,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03393825143575668,
"rps_doc_frac_chars_dupe_6grams": 0.03393825143575668,
"rps_doc_frac_chars_dupe_7grams": 0.03393825143575668,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06599103659391403,
"rps_doc_frac_chars_top_3gram": 0.055149659514427185,
"rps_doc_frac_chars_top_4gram": 0.018383219838142395,
"rps_doc_books_importance": -309.1155090332031,
"rps_doc_books_importance_length_correction": -309.1155090332031,
"rps_doc_openwebtext_importance": -170.802001953125,
"rps_doc_openwebtext_importance_length_correction": -170.802001953125,
"rps_doc_wikipedia_importance": -136.69265747070312,
"rps_doc_wikipedia_importance_length_correction": -136.69265747070312
},
"fasttext": {
"dclm": 0.40689539909362793,
"english": 0.9020918011665344,
"fineweb_edu_approx": 2.742687940597534,
"eai_general_math": 0.4971747398376465,
"eai_open_web_math": 0.27739548683166504,
"eai_web_code": 0.18112200498580933
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
7,026,502,653,245,182,000 |
Sign-in / Sign-up
Your question
What should I upgrade next?
Tags:
• Homebuilt
• SLI
• Systems
Last response: in Systems
June 13, 2006 12:27:47 PM
My system currently stands at:
AMD Dual-Core 3800+
DFI Lanparty UT NF4 SLI-D m/b
2x PC3200 512mb
2x160Gb SATA Raided (striped)
2xnVidia 6600Gt 128mb g/cards SLI'd
The board (as far as I understand it) will only run the fastest memory in the two slots I've already used so I'd probably have to replace the RAM altogether to upgrade to 2Gb.
I've been looking at buying 2x nVidia 7600GTs (probably Sparkle as, although I prefer XFX they are sometimes difficult to get).
Nothing is, as yet, overclocked although the m/b is designed and ideally set up for it.
What would people suggest for my next upgrade?
More about : upgrade
June 13, 2006 12:47:43 PM
Quote:
My system currently stands at:
AMD Dual-Core 3800+
DFI Lanparty UT NF4 SLI-D m/b
2x PC3200 512mb
2x160Gb SATA Raided (striped)
2xnVidia 6600Gt 128mb g/cards SLI'd
The board (as far as I understand it) will only run the fastest memory in the two slots I've already used so I'd probably have to replace the RAM altogether to upgrade to 2Gb.
I've been looking at buying 2x nVidia 7600GTs (probably Sparkle as, although I prefer XFX they are sometimes difficult to get).
Nothing is, as yet, overclocked although the m/b is designed and ideally set up for it.
What would people suggest for my next upgrade?
-No such thing as a board that runs different speed memory in different slots. All the slots will run the same speed memory.
-You could find a single card solution that will outperform both your 6600gt's. Although unless your unhappy with their performance in the games you play, I really see no reason to put more money into AGP cards.
-X2's are dropping in price, but really dont think your going to see much performance difference gaming wise going from a 3800 to say a 4400.
I would add another 512 mb of memory. If you want a faster system, then start saving for a new platform. Mobo, PCI-e video, ddr2, new cpu, etc. Otherwise your system should perform well for another year at least.
June 13, 2006 1:06:21 PM
Your best bet is to upgrade your graphics cards, but I wouldn't bother with 2 7600's in SLI. A single 7900 or X1900 will do better, and cost less, than 2 7600's. Another gig of ram wouldn't hurt either, but also wouldn't give as much benefit as upgrading your graphics cards.
Related resources
Can't find your answer ? Ask !
June 13, 2006 4:43:05 PM
I've got to say I've never really been interseted in case modding, I'm the only person who looks at it and I could spend money on making it faster than prettier :roll:
Umm, somethings to think about.
As an aside, is there such a thing as a comparative spec page? So if you were looking at building a system with a certain processor, what g/card, ram, HDD etc would be appropriate to go with them so the system would take full advantage of the hardware, avoiding bottlenecks or idle time in parts of the system?
June 13, 2006 4:48:06 PM
Forgot to mention, they are PCI-E 6600GTs. Not sure if that'd make any difference to the advice tho :?
June 13, 2006 10:11:28 PM
Quote:
As an aside, is there such a thing as a comparative spec page? So if you were looking at building a system with a certain processor, what g/card, ram, HDD etc would be appropriate to go with them so the system would take full advantage of the hardware, avoiding bottlenecks or idle time in parts of the system?
The closest you'll find is something like THG's CPU, VGA, and HHD Charts. They are not exactly what you asked for (ie. the cpu charts are all benchmarked with the same high end graphics card, the vga charts are all on the same high end CPU). What they can show you is relatively how each product will compare.
The short answer to your question is that there really is no way to tell precisely which components will prove to be a bottleneck for your system ahead of time. In general though, your graphics card will bottleneck gaming, your cpu will bottleneck when multitasking or encoding audio/video (or most any non-gaming task), and memory will bottleneck everything unless you have at least 1 gig (2 to be safe) of the appropriate speed for your MB/CPU.
June 13, 2006 11:40:31 PM
Quote:
Forgot to mention, they are PCI-E 6600GTs. Not sure if that'd make any difference to the advice tho :?
They would have to be PCI-e, otherwise you wouldn't be able to do SLI.
As it has been mentioned before, simply upgrade your GPU to a 7900GT. Or get a X1900XT if that's in your budget, and your power supply is at least 450w. 500w if the power supply if a generic brand.
Also, RAID-0 doesn't really provide that much increase in performance. But if either one of your hard drive fails, you loose all you data.
June 17, 2006 5:37:55 PM
Well, thank you all for your help. I've gone for the 7900GT (XFX as a personal preference) and 2GB of Corsair 2-3-3-6.
After blowing a Antec 550W power supply :oops: (thankfully nothing else though) through shear idiocy I've got the system up and running again and have decided that I'm probably going to leave the machine alone for a while.
It should stand the test of time (for a couple of years with any luck).
Thanks again :wink:
|
{
"url": "http://www.tomshardware.com/forum/187945-31-what-upgrade-next",
"source_domain": "www.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "101584",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5CT7FPNPC5E6LAQL6XBJWFOTS5JJRSQC",
"WARC-Concurrent-To": "<urn:uuid:07e61ee8-c169-494d-a7b7-965b5dda9077>",
"WARC-Date": "2016-09-28T16:40:37Z",
"WARC-IP-Address": "23.50.225.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4XUWYSMSJX5F35J6IK433NOZPMFX5VIX",
"WARC-Record-ID": "<urn:uuid:00045ab6-712c-48d2-91e9-b316de4eb8c4>",
"WARC-Target-URI": "http://www.tomshardware.com/forum/187945-31-what-upgrade-next",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f19e70fa-7e9c-4e7f-9522-7b442de4bc3b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 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,
18,
32,
33,
61,
62,
68,
82,
90,
102,
128,
154,
155,
186,
187,
207,
237,
253,
283,
319,
320,
496,
497,
625,
626,
714,
715,
762,
763,
784,
785,
811,
812,
819,
850,
851,
871,
901,
917,
947,
983,
984,
1160,
1161,
1289,
1290,
1378,
1379,
1426,
1427,
1428,
1553,
1765,
1907,
1908,
2121,
2146,
2147,
2423,
2441,
2472,
2497,
2498,
2666,
2667,
2699,
2700,
3011,
3036,
3037,
3140,
3166,
3167,
3174,
3485,
3486,
3487,
3797,
3798,
4245,
4271,
4272,
4279,
4382,
4383,
4384,
4455,
4456,
4654,
4655,
4794,
4819,
4820,
4939,
4940,
5164,
5165,
5237,
5238
],
"line_end_idx": [
18,
32,
33,
61,
62,
68,
82,
90,
102,
128,
154,
155,
186,
187,
207,
237,
253,
283,
319,
320,
496,
497,
625,
626,
714,
715,
762,
763,
784,
785,
811,
812,
819,
850,
851,
871,
901,
917,
947,
983,
984,
1160,
1161,
1289,
1290,
1378,
1379,
1426,
1427,
1428,
1553,
1765,
1907,
1908,
2121,
2146,
2147,
2423,
2441,
2472,
2497,
2498,
2666,
2667,
2699,
2700,
3011,
3036,
3037,
3140,
3166,
3167,
3174,
3485,
3486,
3487,
3797,
3798,
4245,
4271,
4272,
4279,
4382,
4383,
4384,
4455,
4456,
4654,
4655,
4794,
4819,
4820,
4939,
4940,
5164,
5165,
5237,
5238,
5257
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5257,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40740740299224854,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06666667014360428,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22057613730430603,
"rps_doc_frac_unique_words": 0.3820704519748688,
"rps_doc_mean_word_length": 4.328708648681641,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.428103446960449,
"rps_doc_word_count": 937,
"rps_doc_frac_chars_dupe_10grams": 0.3925049304962158,
"rps_doc_frac_chars_dupe_5grams": 0.3925049304962158,
"rps_doc_frac_chars_dupe_6grams": 0.3925049304962158,
"rps_doc_frac_chars_dupe_7grams": 0.3925049304962158,
"rps_doc_frac_chars_dupe_8grams": 0.3925049304962158,
"rps_doc_frac_chars_dupe_9grams": 0.3925049304962158,
"rps_doc_frac_chars_top_2gram": 0.010355030186474323,
"rps_doc_frac_chars_top_3gram": 0.017258379608392715,
"rps_doc_frac_chars_top_4gram": 0.011341219767928123,
"rps_doc_books_importance": -498.53057861328125,
"rps_doc_books_importance_length_correction": -498.53057861328125,
"rps_doc_openwebtext_importance": -313.7147216796875,
"rps_doc_openwebtext_importance_length_correction": -313.7147216796875,
"rps_doc_wikipedia_importance": -231.9652557373047,
"rps_doc_wikipedia_importance_length_correction": -231.9652557373047
},
"fasttext": {
"dclm": 0.11845719814300537,
"english": 0.965267539024353,
"fineweb_edu_approx": 1.207842230796814,
"eai_general_math": 0.47955554723739624,
"eai_open_web_math": 0.27242159843444824,
"eai_web_code": 0.1299201250076294
}
}
|
{
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-662,209,254,076,275,200 |
Is there a command line option to initialize reals to NaN?
Is there a command line option to initialize reals to NaN?
Аватар пользователя Antti Karanta
I was wondering whether ifort has support (or plans thereof) for an option to initialize reals to NaN (in debug build or otherwise)? We have encountered several time consuming bugs where this might have helped.
I thought to ask this question as some time I read that the D programming language takes this approach to make errors with uninitialized reals more apparent, see e.g. http://dlang.org/faq.html#nan
3 posts / 0 новое
Последнее сообщение
Пожалуйста, обратитесь к странице Уведомление об оптимизации для более подробной информации относительно производительности и оптимизации в программных продуктах компании Intel.
Аватар пользователя TimP (Intel)
Did you consider the recommendations in Dave Barker's presentation?
http://www.nas.nasa.gov/hecc/assets/pdf/training/UnInit_Fix_your_code_20...
Аватар пользователя Steve Lionel (Intel)
We don't have current plans to do this, though various improvements to uninitialized variable detection continue to be discussed. With respect to NaN initialization, that is not as helpful as you might think since NaNs are allowed to participate in arithmetic operations. Another issue is that the processor automatically converts signaling NaNs to "quiet NaNs" upon a load into a register. Also, this does you no good for datatypes other than real/complex. It's one of those ideas that seems great at first, but then when you start poking and prodding the luster wears off.
We do currently offer a limited form of run-time uninitialized variable checking, though it is probably too limited to be useful. Users with a license for Fortran Studio XE or Parallel Studio XE (or Cluster Studio XE) can use the Static Analysis feature that does whole-program correctness checking, including uninitialized variable detection. It too isn't perfect but it can be very helpful.
Steve
Зарегистрируйтесь, чтобы оставить комментарий.
|
{
"url": "http://software.intel.com/ru-ru/forums/topic/362149",
"source_domain": "software.intel.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "42460",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VM34RBCGBKXQ3EVV52XBHLTKQTNKHNTL",
"WARC-Concurrent-To": "<urn:uuid:3fc8e102-210a-4302-9427-f196b2d47ff4>",
"WARC-Date": "2013-05-22T16:06:40Z",
"WARC-IP-Address": "165.254.27.97",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TVAUA2SQ2EBWFBLMAQILD3YIBWO4D2UR",
"WARC-Record-ID": "<urn:uuid:fd84ed18-ea0c-45fc-93cd-b6a4510b2a2d>",
"WARC-Target-URI": "http://software.intel.com/ru-ru/forums/topic/362149",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f2fded34-f28e-4b7b-b9bb-63a84d18c9b6>"
},
"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,
59,
60,
119,
120,
154,
155,
366,
367,
564,
565,
583,
603,
781,
814,
815,
883,
884,
960,
961,
1002,
1003,
1578,
1579,
1973,
1974,
1980,
1981
],
"line_end_idx": [
59,
60,
119,
120,
154,
155,
366,
367,
564,
565,
583,
603,
781,
814,
815,
883,
884,
960,
961,
1002,
1003,
1578,
1579,
1973,
1974,
1980,
1981,
2027
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2027,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33509233593940735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018469659611582756,
"rps_doc_frac_lines_end_with_ellipsis": 0.035714291036129,
"rps_doc_frac_no_alph_words": 0.24802111089229584,
"rps_doc_frac_unique_words": 0.6464646458625793,
"rps_doc_mean_word_length": 5.55555534362793,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.00527703994885087,
"rps_doc_unigram_entropy": 5.0305986404418945,
"rps_doc_word_count": 297,
"rps_doc_frac_chars_dupe_10grams": 0.05696969851851463,
"rps_doc_frac_chars_dupe_5grams": 0.07393939048051834,
"rps_doc_frac_chars_dupe_6grams": 0.07393939048051834,
"rps_doc_frac_chars_dupe_7grams": 0.05696969851851463,
"rps_doc_frac_chars_dupe_8grams": 0.05696969851851463,
"rps_doc_frac_chars_dupe_9grams": 0.05696969851851463,
"rps_doc_frac_chars_top_2gram": 0.012121209874749184,
"rps_doc_frac_chars_top_3gram": 0.03272727131843567,
"rps_doc_frac_chars_top_4gram": 0.041818179190158844,
"rps_doc_books_importance": -158.49093627929688,
"rps_doc_books_importance_length_correction": -158.49093627929688,
"rps_doc_openwebtext_importance": -99.02587127685547,
"rps_doc_openwebtext_importance_length_correction": -99.02587127685547,
"rps_doc_wikipedia_importance": -54.490901947021484,
"rps_doc_wikipedia_importance_length_correction": -54.490901947021484
},
"fasttext": {
"dclm": 0.9253302216529846,
"english": 0.7547837495803833,
"fineweb_edu_approx": 1.460349202156067,
"eai_general_math": 0.3783848285675049,
"eai_open_web_math": 0.23974764347076416,
"eai_web_code": 0.8606362342834473
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-275,943,899,273,692,130 |
USB is a Universal Serial Bus that is used to connect computer peripherals since 1996. It has largely replaced a variety of earlier interfaces, such as serial ports and parallel ports, as well as separate power chargers for portable devices and is commonly used in a wide range of applications
Older versions of USB cables are 4 wire, with a foil shield. Newer versions have more wires (for example for high speed transfer).
Several USB plugs can be encountered in the wild: A, B, C, mini, micro, and USB3 plugs. They all can provide power at 5 volts nominal.
‘USB on the go’ in short OTG is a standard created for mobile phones where the mobile phone acts as host.
Note:USB cables that are only used for charging (e.g. power banks) often don’t have the data connection wires (as that makes them cheaper). If you try to use them for a connection where data must be transferred, it can take quite a while to discover this. Sometimes the charging cables have different markings or you can label them yourself of course.
|
{
"url": "https://eatelier.nl/?e_component=usb-cable",
"source_domain": "eatelier.nl",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "15192",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7L5WIAAKZ4AIFOUDLB3JRX37UXRPVE2V",
"WARC-Concurrent-To": "<urn:uuid:89033f71-3fd5-468d-9706-a74bd4eac422>",
"WARC-Date": "2020-06-05T12:44:58Z",
"WARC-IP-Address": "37.128.148.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4G26ZV6XVOAGYHIKUFLG6G4PIHQV7LT6",
"WARC-Record-ID": "<urn:uuid:e1032f8f-8d74-4f4f-959f-bef915787f20>",
"WARC-Target-URI": "https://eatelier.nl/?e_component=usb-cable",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:14c49304-229d-4992-b751-bf33fdc25a6d>"
},
"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,
294,
295,
426,
427,
562,
563,
669,
670
],
"line_end_idx": [
294,
295,
426,
427,
562,
563,
669,
670,
1021
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1021,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43192487955093384,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04694835841655731,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15023474395275116,
"rps_doc_frac_unique_words": 0.6519337296485901,
"rps_doc_mean_word_length": 4.469613075256348,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.577046871185303,
"rps_doc_word_count": 181,
"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.007416559848934412,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -101.71170043945312,
"rps_doc_books_importance_length_correction": -101.71170043945312,
"rps_doc_openwebtext_importance": -72.07592010498047,
"rps_doc_openwebtext_importance_length_correction": -58.331512451171875,
"rps_doc_wikipedia_importance": -50.22703170776367,
"rps_doc_wikipedia_importance_length_correction": -50.22703170776367
},
"fasttext": {
"dclm": 0.8342596888542175,
"english": 0.9467470645904541,
"fineweb_edu_approx": 2.9747164249420166,
"eai_general_math": 0.7647011280059814,
"eai_open_web_math": 0.4163076877593994,
"eai_web_code": 0.45450258255004883
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,817,164,244,395,111,000 |
Ask Singapore Homework?
Upload a photo of a Singapore homework and someone will email you the solution for free.
Question
primary 5 | Maths | Fractions
One Answer Below
Anyone can contribute an answer, even non-tutors.
Answer This Question
Rozi Aris
Rozi Aris
primary 5 chevron_right Maths chevron_right Fractions chevron_right Singapore
Help
Date Posted: 1 month ago
Views: 44
See 1 Answer
Your model is correct. So as you drew it yourself, $105 leftover of the salary, just nice is 1 unit, and there is a total of 5 units. So just use 5 units × $105 = $525 which is the person's salary at first before spending $$.
done {{ upvoteCount }} Upvotes
clear {{ downvoteCount * -1 }} Downvotes
Zwen
Zwen's answer
43 answers (A Helpful Person)
1st
Rozi Aris
Rozi Aris
1 month ago
Thank u..
|
{
"url": "https://ask.manytutors.com/questions/115105",
"source_domain": "ask.manytutors.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "33570",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QJ6B54VGXLGVZDQYSMOLUQERJO63OMKE",
"WARC-Concurrent-To": "<urn:uuid:11abbf1e-384f-4814-be85-eb299af4b1f1>",
"WARC-Date": "2021-10-24T18:36:54Z",
"WARC-IP-Address": "172.67.191.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MLT5QLNNGZKOPNJF4YUNPL2VHXEIO2IC",
"WARC-Record-ID": "<urn:uuid:eb523203-34e8-425d-9e6d-77269d596b22>",
"WARC-Target-URI": "https://ask.manytutors.com/questions/115105",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:222bec78-c818-46bb-b6f0-e218407baad5>"
},
"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-149\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,
24,
25,
114,
115,
116,
117,
126,
127,
157,
174,
175,
225,
226,
247,
257,
267,
268,
346,
347,
352,
353,
378,
388,
389,
402,
403,
629,
660,
701,
706,
720,
750,
754,
764,
774,
786
],
"line_end_idx": [
24,
25,
114,
115,
116,
117,
126,
127,
157,
174,
175,
225,
226,
247,
257,
267,
268,
346,
347,
352,
353,
378,
388,
389,
402,
403,
629,
660,
701,
706,
720,
750,
754,
764,
774,
786,
795
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 795,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.010062890127301216,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23926380276679993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006134970113635063,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2760736346244812,
"rps_doc_frac_unique_words": 0.6538461446762085,
"rps_doc_mean_word_length": 4.653846263885498,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.279751777648926,
"rps_doc_word_count": 130,
"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.05289255827665329,
"rps_doc_frac_chars_top_3gram": 0.03966942057013512,
"rps_doc_frac_chars_top_4gram": 0.05289255827665329,
"rps_doc_books_importance": -95.78460693359375,
"rps_doc_books_importance_length_correction": -95.78460693359375,
"rps_doc_openwebtext_importance": -48.11046600341797,
"rps_doc_openwebtext_importance_length_correction": -48.11005401611328,
"rps_doc_wikipedia_importance": -33.9378662109375,
"rps_doc_wikipedia_importance_length_correction": -33.9378662109375
},
"fasttext": {
"dclm": 0.14775288105010986,
"english": 0.8594757914543152,
"fineweb_edu_approx": 1.9045279026031494,
"eai_general_math": 0.08519309759140015,
"eai_open_web_math": 0.09543907642364502,
"eai_web_code": 0.000014420000297832303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,608,664,726,528,797,000 |
com.atlassian.confluence.importexport.xmlimport
Interface ObjectPersister
All Known Implementing Classes:
HibernateKeyPersister, HibernateMembershipPersister, PropertySetItemPersister, ReflectiveObjectPersister
public interface ObjectPersister
Handles the persistence of objects imported from a backup. The DelegatingObjectPersisterFactory is responsible for determining which persister should be used for which object. Most imported objects are handled by the ReflectiveObjectPersister.
Method Summary
List<TransientHibernateHandle> persist(ImportProcessorContext context, ImportedObject object)
Persist a given imported object.
Method Detail
persist
List<TransientHibernateHandle> persist(ImportProcessorContext context,
ImportedObject object)
throws Exception
Persist a given imported object.
Parameters:
context - the context of the current import operation
object - the object to save.
Returns:
a list of handles of the objects that were saved. If IDs are being rewritten on import, this list should still contain the pre-rewriting ID as it appears in the backup file
Throws:
Exception - if something goes wrong. To avoid duplication of "wrap everything in one exception type" code in every persister, it is assumed wrapping happens at a higher level.
Copyright © 2003–2015 Atlassian. All rights reserved.
|
{
"url": "https://docs.atlassian.com/atlassian-confluence/5.7.1/com/atlassian/confluence/importexport/xmlimport/ObjectPersister.html",
"source_domain": "docs.atlassian.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "13807",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NZZXEJYGIED7W6KTNIBUW7VELRZ4G5DS",
"WARC-Concurrent-To": "<urn:uuid:e15e8c36-4268-475d-996a-1ba4086af388>",
"WARC-Date": "2019-07-16T17:08:53Z",
"WARC-IP-Address": "18.234.32.193",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ERK5HAED4Y25NVEBTROPIUJXFXTYJTVS",
"WARC-Record-ID": "<urn:uuid:eb53f58b-8f71-4d20-bff6-6eabcf2fb5c3>",
"WARC-Target-URI": "https://docs.atlassian.com/atlassian-confluence/5.7.1/com/atlassian/confluence/importexport/xmlimport/ObjectPersister.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0ce169fd-86ad-428d-b7f3-52345298baa1>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-164-217-227.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
2,
50,
76,
77,
109,
214,
215,
248,
249,
493,
494,
495,
510,
605,
648,
650,
651,
665,
666,
674,
675,
746,
808,
864,
897,
898,
910,
964,
993,
1002,
1175,
1183,
1359,
1360,
1361
],
"line_end_idx": [
1,
2,
50,
76,
77,
109,
214,
215,
248,
249,
493,
494,
495,
510,
605,
648,
650,
651,
665,
666,
674,
675,
746,
808,
864,
897,
898,
910,
964,
993,
1002,
1175,
1183,
1359,
1360,
1361,
1414
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1414,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.276699036359787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004854369908571243,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21359223127365112,
"rps_doc_frac_unique_words": 0.6193548440933228,
"rps_doc_mean_word_length": 7.180644989013672,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.361816883087158,
"rps_doc_word_count": 155,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1994609236717224,
"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.043126679956912994,
"rps_doc_frac_chars_top_3gram": 0.11500448733568192,
"rps_doc_frac_chars_top_4gram": 0.14016172289848328,
"rps_doc_books_importance": -92.74588012695312,
"rps_doc_books_importance_length_correction": -92.2357177734375,
"rps_doc_openwebtext_importance": -56.347434997558594,
"rps_doc_openwebtext_importance_length_correction": -56.347434997558594,
"rps_doc_wikipedia_importance": -41.712276458740234,
"rps_doc_wikipedia_importance_length_correction": -36.71271896362305
},
"fasttext": {
"dclm": 0.30354803800582886,
"english": 0.6925261616706848,
"fineweb_edu_approx": 2.9014363288879395,
"eai_general_math": 0.21479523181915283,
"eai_open_web_math": 0.027627939358353615,
"eai_web_code": 0.3474666476249695
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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
|
-8,729,735,915,084,078,000 |
Rally - How to query a milestone's work items using WSAPI
search cancel
Rally - How to query a milestone's work items using WSAPI
book
Article ID: 98898
calendar_today
Updated On:
Products
Rally On-Premise Rally SaaS
Issue/Introduction
How can WSAPI be used to return the work items (for example, user stories) of a milestone and in-general to explore the Milestone <-> Work Item relationship ?
Environment
Release:
Component: ACSAAS
Resolution
Let's use User Stories as an example:
The relationship between Milestones and User Stories is stored on both end points. Hence, there are a couple of ways you can go about exploring it:
1. Use the HierarchicalRequirement endpoint.
2. Use the Milestone endpoint.
Using the HierarchicalRequirement endpoint.
Below is an example of a query that is going to return all user stories which have a milestone and also that the milestone’s name is “milestone_2”. The first part of the query is ensuring there is a milestone that’s linked with the user story. The second part is filtering by the name of the milestone.
Using the Milestone endpoint.
The Artifacts field is the one that has all the artifacts linked to that milestone. In order to find milestones that have any artifact (in other words , to exclude those which don’t) then you can use (Artifacts.ObjectID > 0).
You should call the Artifacts collection such as in:
|
{
"url": "https://knowledge.broadcom.com/external/article/98898/rally-how-to-query-a-milestones-work-it.html",
"source_domain": "knowledge.broadcom.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "50548",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MFT4F73NNUNVBMHAJX36ZX544MV33YYZ",
"WARC-Concurrent-To": "<urn:uuid:8bca59b4-02b4-4421-97db-80e20632d36c>",
"WARC-Date": "2024-08-10T12:46:23Z",
"WARC-IP-Address": "162.159.140.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7PX4ODVVDJXXHGF2YTJZSE24JNHYAJ4Y",
"WARC-Record-ID": "<urn:uuid:aab884c2-8741-43da-9327-86a9627a41bd>",
"WARC-Target-URI": "https://knowledge.broadcom.com/external/article/98898/rally-how-to-query-a-milestones-work-it.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:92b67c09-71df-4a5f-a5a9-6f9584da7a16>"
},
"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-29\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,
58,
72,
73,
131,
132,
137,
138,
156,
157,
172,
173,
185,
186,
195,
196,
224,
225,
244,
245,
404,
405,
417,
418,
427,
445,
446,
457,
458,
496,
497,
645,
647,
692,
723,
725,
769,
1072,
1073,
1075,
1076,
1106,
1332,
1333,
1386,
1387
],
"line_end_idx": [
58,
72,
73,
131,
132,
137,
138,
156,
157,
172,
173,
185,
186,
195,
196,
224,
225,
244,
245,
404,
405,
417,
418,
427,
445,
446,
457,
458,
496,
497,
645,
647,
692,
723,
725,
769,
1072,
1073,
1075,
1076,
1106,
1332,
1333,
1386,
1387,
1388
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1388,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4029304087162018,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018315019086003304,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17216117680072784,
"rps_doc_frac_unique_words": 0.4954545497894287,
"rps_doc_mean_word_length": 4.968181610107422,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.340254783630371,
"rps_doc_word_count": 220,
"rps_doc_frac_chars_dupe_10grams": 0.08234217762947083,
"rps_doc_frac_chars_dupe_5grams": 0.08234217762947083,
"rps_doc_frac_chars_dupe_6grams": 0.08234217762947083,
"rps_doc_frac_chars_dupe_7grams": 0.08234217762947083,
"rps_doc_frac_chars_dupe_8grams": 0.08234217762947083,
"rps_doc_frac_chars_dupe_9grams": 0.08234217762947083,
"rps_doc_frac_chars_top_2gram": 0.04025617986917496,
"rps_doc_frac_chars_top_3gram": 0.018298260867595673,
"rps_doc_frac_chars_top_4gram": 0.02744738943874836,
"rps_doc_books_importance": -68.90727996826172,
"rps_doc_books_importance_length_correction": -68.8930892944336,
"rps_doc_openwebtext_importance": -50.55298614501953,
"rps_doc_openwebtext_importance_length_correction": -50.55298614501953,
"rps_doc_wikipedia_importance": -19.188125610351562,
"rps_doc_wikipedia_importance_length_correction": -17.14801788330078
},
"fasttext": {
"dclm": 0.5441266894340515,
"english": 0.8877870440483093,
"fineweb_edu_approx": 2.6776669025421143,
"eai_general_math": 0.12882184982299805,
"eai_open_web_math": 0.06073557958006859,
"eai_web_code": 0.2420169711112976
}
}
|
{
"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": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,230,004,991,284,507,600 |
Full-Stack React
Video description
13+ Hours of Video Instruction
BuildFull-Stack Apps with MongoDB, Express, React, and Node.js
In this LiveLessons video, Shaun Wassell covers the fundamentals of full-stack development with the MERN (MongoDB, Express, React, and Node.js) stack. For the full stack, developers need to make sure both front- and backend communicate well together. Toward that end, this video teaches you how everything works, what the key responsibilities of each component are, and how they flow together. Shaun addresses the key points for developers, with specific examples to demonstrate concepts.
Learn to use MongoDB, Express, React, and Node.js (MERN) to create full-stack apps. MERN is currently the most popular stack for building full-stack web applications. It allows developers to quickly write entire applications—frontend, backend, and database—using only JavaScript.
In this 13+ hour LiveLessons video, Shaun Wassell covers the fundamentals of full-stack development with the MERN stack. You can learn by doing, as Shaun walks you through five example projects of increasing complexity that demonstrate the many different aspects of full-stack application development. How do you ensure your applications are secure? How do you handle authentication in full-stack apps? These are all questions Shaun answers in this timely and practical LiveLessons video. At the end of this video, you'll have five portfolio pieces that you can use for full-stack job interviews.
Access the supplemental resources for this LiveLesson at https://github.com/shaunwa/full-stack-react
About the Instructor
Shaun Wassell's goal is to create a world where people are empowered to use programming as a way to solve meaningful problems‚Äîa world where writing code is just as natural for most people as walking or breathing. To help make this a reality, Shaun has dedicated the past few years to helping people learn and master software-development skills through video courses, live training sessions, and one-on-one tutoring. Shaun has been programming since he was a kid, when creating video games was his gateway into the world of software. Since then, he’s been fortunate enough to be a contributing member on many amazing software projects and work with some incredible mentors along the way.
Skill Level
• Intermediate
What You Will Learn
Companies have realized that a relatively small team of full-stack developers (developers that work on all parts of a web application) can build and maintain websites much more easily and cost-effectively than if there were separate frontend, backend, and database teams.
Learn How To:
• Build full-stack applications using React, Node.js, Express, and MongoDB
• Use network requests and REST APIs to communicate between the front- and backend
• Correctly divide application logic between the front- and backend
• Structure full-stack applications for maximum readability and ease of maintenance
• Implement an authentication flow that allows users to log in and save data
• Integrate powerful third-party APIs into your full-stack applications
Who Should Take This Course
• JavaScript developers, web developers
Course Requirements
Prerequisites:
• Working knowledge of JavaScript
• Some experience working on either the front- or backend of a web application, but this isn’t a requirement
About Pearson Video Training
Pearson publishes expert-led video tutorials covering a wide selection of technology topics designed to teach you the skills you need to succeed. These professional and personal technology videos feature world-leading author instructors published by your trusted technology brands: Addison-Wesley, Cisco Press, Pearson IT Certification, Prentice Hall, Sams, and Que. Topics include IT Certification, Network Security, Cisco Technology, Programming, Web Development, Mobile Development, and more. Learn more about Pearson Video training at http://www.informit.com/video.
Table of contents
1. Introduction
1. Full-Stack React: Introduction
2. Lesson 1: Meet the MERN Stack
1. Learning Objectives
2. 1.1 Learn the basics of React
3. 1.2 Learn the basics of Node.js
4. 1.3 Learn the basics of Express
5. 1.4 Learn the basics of MongoDB
3. Lesson 2: Build a Full-Stack Meal-Tracker Application
1. Learning Objectives
2. 2.1 Learn about the example application
3. 2.2 Create and set up the project
4. 2.3 Learn about REST APIs
5. 2.4 Implement the Home page--Part 1
6. 2.5 Implement the Home page--Part 2
7. 2.6 Implement the Home page--Part 3
8. 2.7 Implement the Add Ingredient page
9. 2.8 Implement the Recipe Search page
10. 2.9 Implement the Shopping List page
4. Lesson 3: Build a Members-Only Website
1. Learning Objectives
2. 3.1 Learn about the example application
3. 3.2 Create and set up the project
4. 3.3 Learn the basics of user authentication
5. 3.4 Implement the Sign In page
6. 3.5 Implement the Groups List page
7. 3.6 Implement the Create Group page
8. 3.7 Implement the Group page
5. Lesson 4: Build an Image-Sharing Application
1. Learning Objectives
2. 4.1 Learn about the example application
3. 4.2 Create and set up the project
4. 4.3 Store and serve files
5. 4.4 Implement the Sign In page
6. 4.5 Implement the Browse Photos page
7. 4.6 Implement the Upload Photo page
8. 4.7 Implement the Photo Detail page
6. Lesson 5: Build a Stock-Trading Application
1. Learning Objectives
2. 5.1 Learn about the example application
3. 5.2 Create and set up the project
4. 5.3 Learn the basics of interacting with third-party APIs
5. 5.4 Implement the basic user interface
6. 5.5 Implement the stock ticker chart
7. 5.6 Allow users to buy and sell stocks
8. 5.7 Track user progress over time
7. Lesson 6: Build a Real-Time Chat Application
1. Learning Objectives
2. 6.1 Learn about the example application
3. 6.2 Create and set up the project
4. 6.3 Learn the basics of web sockets and real-time interaction 
5. 6.4 Implement the Sign In page
6. 6.5 Implement the Home page
7. 6.6 Implement the New Conversation page
8. 6.7 Implement the Conversation page
8. Summary
1. Full-Stack React: Summary
Product information
• Title: Full-Stack React
• Author(s): Shaun Wassell
• Release date: December 2020
• Publisher(s): Pearson
• ISBN: 0136887295
|
{
"url": "https://www.oreilly.com/library/view/full-stack-react/9780136887294/",
"source_domain": "www.oreilly.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "60196",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LUCVO7SRQSA6RU3DRSGDGP23CA7B4GLN",
"WARC-Concurrent-To": "<urn:uuid:096329ce-6150-49a5-97cf-9329d398c276>",
"WARC-Date": "2024-04-13T06:51:28Z",
"WARC-IP-Address": "23.73.248.168",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XGOOY6TVZ5Q2KU4Y6JSPHO5CC2YXCHDL",
"WARC-Record-ID": "<urn:uuid:7c9d3d59-c3ce-46f2-9806-be36823ee56d>",
"WARC-Target-URI": "https://www.oreilly.com/library/view/full-stack-react/9780136887294/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a861d221-65d8-4c8d-9378-cc713fd39f67>"
},
"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,
17,
18,
36,
37,
68,
69,
132,
133,
134,
135,
624,
625,
909,
910,
1507,
1508,
1609,
1610,
1631,
1632,
2321,
2322,
2334,
2351,
2371,
2372,
2644,
2645,
2659,
2736,
2821,
2891,
2977,
3056,
3130,
3158,
3200,
3220,
3221,
3236,
3272,
3383,
3412,
3413,
3983,
3984,
4002,
4003,
4021,
4059,
4095,
4122,
4159,
4198,
4237,
4276,
4335,
4362,
4409,
4450,
4483,
4526,
4569,
4612,
4657,
4701,
4746,
4790,
4817,
4864,
4905,
4956,
4994,
5036,
5079,
5115,
5165,
5192,
5239,
5280,
5313,
5351,
5395,
5438,
5481,
5530,
5557,
5604,
5645,
5710,
5756,
5800,
5846,
5887,
5937,
5964,
6011,
6052,
6123,
6161,
6196,
6243,
6286,
6299,
6332,
6333,
6353,
6354,
6382,
6411,
6443,
6469
],
"line_end_idx": [
17,
18,
36,
37,
68,
69,
132,
133,
134,
135,
624,
625,
909,
910,
1507,
1508,
1609,
1610,
1631,
1632,
2321,
2322,
2334,
2351,
2371,
2372,
2644,
2645,
2659,
2736,
2821,
2891,
2977,
3056,
3130,
3158,
3200,
3220,
3221,
3236,
3272,
3383,
3412,
3413,
3983,
3984,
4002,
4003,
4021,
4059,
4095,
4122,
4159,
4198,
4237,
4276,
4335,
4362,
4409,
4450,
4483,
4526,
4569,
4612,
4657,
4701,
4746,
4790,
4817,
4864,
4905,
4956,
4994,
5036,
5079,
5115,
5165,
5192,
5239,
5280,
5313,
5351,
5395,
5438,
5481,
5530,
5557,
5604,
5645,
5710,
5756,
5800,
5846,
5887,
5937,
5964,
6011,
6052,
6123,
6161,
6196,
6243,
6286,
6299,
6332,
6333,
6353,
6354,
6382,
6411,
6443,
6469,
6489
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6489,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2332075536251068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007547169923782349,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31622642278671265,
"rps_doc_frac_unique_words": 0.4104938209056854,
"rps_doc_mean_word_length": 5.152263164520264,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.367464065551758,
"rps_doc_word_count": 972,
"rps_doc_frac_chars_dupe_10grams": 0.032747600227594376,
"rps_doc_frac_chars_dupe_5grams": 0.1553514450788498,
"rps_doc_frac_chars_dupe_6grams": 0.11381789296865463,
"rps_doc_frac_chars_dupe_7grams": 0.05770767107605934,
"rps_doc_frac_chars_dupe_8grams": 0.032747600227594376,
"rps_doc_frac_chars_dupe_9grams": 0.032747600227594376,
"rps_doc_frac_chars_top_2gram": 0.04792331904172897,
"rps_doc_frac_chars_top_3gram": 0.019568689167499542,
"rps_doc_frac_chars_top_4gram": 0.022364219650626183,
"rps_doc_books_importance": -563.6312255859375,
"rps_doc_books_importance_length_correction": -563.6312255859375,
"rps_doc_openwebtext_importance": -332.2979736328125,
"rps_doc_openwebtext_importance_length_correction": -332.2979736328125,
"rps_doc_wikipedia_importance": -278.8688049316406,
"rps_doc_wikipedia_importance_length_correction": -278.8688049316406
},
"fasttext": {
"dclm": 0.3276742100715637,
"english": 0.8373526930809021,
"fineweb_edu_approx": 2.7251217365264893,
"eai_general_math": 0.015303489752113819,
"eai_open_web_math": 0.09549319744110107,
"eai_web_code": 0.02257264032959938
}
}
|
{
"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": "-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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,708,906,461,434,284,000 |
1. Computer problem? Tech Support Guy is completely free -- paid for by advertisers and donations. Click here to join today! If you're new to Tech Support Guy, we highly recommend that you visit our Guide for New Members.
Problem with IP address(es)
Discussion in 'Networking' started by havikryan, Jun 26, 2012.
Thread Status:
Not open for further replies.
Advertisement
1. havikryan
havikryan Thread Starter
Joined:
Aug 16, 2011
Messages:
22
So my computer is a desktop and its on wireless. My brothers is a wired connection.
We are on the same network and I was setting up a perfectly legitimate remote access server on my computer, so I checked my external WAN ip and it came out to be 76.69.151.###
Directly afterwards, i checked his external IP. For some reason, both external WAN Ip's are the same. How Can I fix this TECHGUY :C
2. Sponsor
3. TerryNet
TerryNet Terry Moderator
Joined:
Mar 23, 2005
Messages:
71,599
What are you trying to fix? You are probably both connected to the internet through the same router. If you want different public IP addresses you need different ISP contracts or pay an ISP extra for multiple IP addresses.
4. havikryan
havikryan Thread Starter
Joined:
Aug 16, 2011
Messages:
22
I thought every computer was supposed to have its own IP address?
5. TerryNet
TerryNet Terry Moderator
Joined:
Mar 23, 2005
Messages:
71,599
Mostly true. The IP address must be unique on the network, but your and my and millions of other computers may have the same IP address (mine is currently 192.168.2.5) since we are on different private (LAN) networks. Assuming that you have a router and multiple computers connected to it each of those computers will have a unique (to that LAN) private IP address. The router's WAN will have a unique public IP address.
6. Couriant
Couriant James Trusted Advisor
Joined:
Mar 26, 2002
Messages:
31,434
What is your modem?
7. havikryan
havikryan Thread Starter
Joined:
Aug 16, 2011
Messages:
22
TL-WR841N < is my router.
8. Couriant
Couriant James Trusted Advisor
Joined:
Mar 26, 2002
Messages:
31,434
I re-read your post and I realized I was not on the same page. Indeed any computer connected to your router will have the same routable IP (the public IP addres you posted) because your router is the one that has that information.
If you are having issues with your Remote Access server, then you may need to do some portforwarding, otherwise if the issue was that you saw both computers with the same WAN IP, then that's normal.
9. Sponsor
As Seen On
As Seen On...
Welcome to Tech Support Guy!
Are you looking for the solution to your computer problem? Join our site today to ask your question. This site is completely free -- paid for by advertisers and donations.
If you're not already familiar with forums, watch our Welcome Guide to get started.
Join over 733,556 other people just like you!
Loading...
Thread Status:
Not open for further replies.
Short URL to this thread: https://techguy.org/1058683
|
{
"url": "https://forums.techguy.org/threads/problem-with-ip-address-es.1058683/",
"source_domain": "forums.techguy.org",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "65389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BMDGLCPGLZZLSKFBEWWGMGAFSNMFXAJM",
"WARC-Concurrent-To": "<urn:uuid:72d369a3-39f4-4607-8995-7fea42b43b1c>",
"WARC-Date": "2016-08-24T23:17:16Z",
"WARC-IP-Address": "104.25.252.12",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RH4RQNWAGYAYRIDLQT62TLHIPPZ5BLED",
"WARC-Record-ID": "<urn:uuid:4c5b2c5c-a415-4909-9918-dc54ed68690f>",
"WARC-Target-URI": "https://forums.techguy.org/threads/problem-with-ip-address-es.1058683/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2110c72b-92d0-48ad-87d8-bddc5b17549c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
224,
225,
253,
254,
317,
318,
333,
363,
377,
392,
393,
422,
423,
435,
452,
466,
473,
561,
741,
877,
883,
896,
897,
911,
912,
941,
942,
954,
971,
985,
996,
1223,
1229,
1244,
1245,
1274,
1275,
1287,
1304,
1318,
1325,
1395,
1401,
1415,
1416,
1445,
1446,
1458,
1475,
1489,
1500,
1925,
1931,
1945,
1946,
1981,
1982,
1994,
2011,
2025,
2036,
2060,
2066,
2081,
2082,
2111,
2112,
2124,
2141,
2155,
2162,
2192,
2198,
2212,
2213,
2248,
2249,
2261,
2278,
2292,
2303,
2538,
2539,
2742,
2748,
2761,
2762,
2773,
2787,
2788,
2817,
2818,
2990,
2991,
3075,
3076,
3122,
3123,
3134,
3149,
3179,
3180
],
"line_end_idx": [
224,
225,
253,
254,
317,
318,
333,
363,
377,
392,
393,
422,
423,
435,
452,
466,
473,
561,
741,
877,
883,
896,
897,
911,
912,
941,
942,
954,
971,
985,
996,
1223,
1229,
1244,
1245,
1274,
1275,
1287,
1304,
1318,
1325,
1395,
1401,
1415,
1416,
1445,
1446,
1458,
1475,
1489,
1500,
1925,
1931,
1945,
1946,
1981,
1982,
1994,
2011,
2025,
2036,
2060,
2066,
2081,
2082,
2111,
2112,
2124,
2141,
2155,
2162,
2192,
2198,
2212,
2213,
2248,
2249,
2261,
2278,
2292,
2303,
2538,
2539,
2742,
2748,
2761,
2762,
2773,
2787,
2788,
2817,
2818,
2990,
2991,
3075,
3076,
3122,
3123,
3134,
3149,
3179,
3180,
3233
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3233,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33020344376564026,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05007825046777725,
"rps_doc_frac_lines_end_with_ellipsis": 0.019417479634284973,
"rps_doc_frac_no_alph_words": 0.25195619463920593,
"rps_doc_frac_unique_words": 0.4305555522441864,
"rps_doc_mean_word_length": 4.63095235824585,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.00782473012804985,
"rps_doc_unigram_entropy": 5.0420684814453125,
"rps_doc_word_count": 504,
"rps_doc_frac_chars_dupe_10grams": 0.17566409707069397,
"rps_doc_frac_chars_dupe_5grams": 0.24764353036880493,
"rps_doc_frac_chars_dupe_6grams": 0.24764353036880493,
"rps_doc_frac_chars_dupe_7grams": 0.24764353036880493,
"rps_doc_frac_chars_dupe_8grams": 0.2167952060699463,
"rps_doc_frac_chars_dupe_9grams": 0.2167952060699463,
"rps_doc_frac_chars_top_2gram": 0.020994000136852264,
"rps_doc_frac_chars_top_3gram": 0.01799486018717289,
"rps_doc_frac_chars_top_4gram": 0.03984576091170311,
"rps_doc_books_importance": -219.59213256835938,
"rps_doc_books_importance_length_correction": -219.59213256835938,
"rps_doc_openwebtext_importance": -147.8506317138672,
"rps_doc_openwebtext_importance_length_correction": -147.8506317138672,
"rps_doc_wikipedia_importance": -128.78262329101562,
"rps_doc_wikipedia_importance_length_correction": -128.78262329101562
},
"fasttext": {
"dclm": 0.08409768342971802,
"english": 0.9402328729629517,
"fineweb_edu_approx": 1.1153769493103027,
"eai_general_math": 0.0052644601091742516,
"eai_open_web_math": 0.11576861143112183,
"eai_web_code": 0.00006615999882342294
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,758,307,350,452,134,000 |
Results 1 to 3 of 3
1. #1
If I manually click Backup Now, my Touchpad shows blue screen then shuts down...
(right after the progress bar says "Preparing...") I assume it's doing a device restart
because it takes a minute or two to come back.
It started doing this two days ago...... It doesn't do this every single time I do
manual backup.... maybe 1 in 4? I only did the manual backup because it
wasn't doing it automatically on a daily basis. (sometimes it would go without
backuping anything for a week) I install and uninstall new apps frequently,
so I don't know why it wasn't backing up automatically.
I'm not sure if this is related or not, but this started happening right after
Preware updated my Govnah and uberkernel....
What can possibly this? Thanks!
2. #2
First put the stock kernel back on and see if this fixes the issue.
As far as your automatic backups, they happen in the middle of the night, not when you install or delete an app. So your TouchPad needs to be on and have WiFi at night. Last I checked all my webOS devices update after midnight and before 3 am local time. (not saying this is set in stone, just what I noticed last time I was helping someone trouble shoot a backup issue)
I love physical keyboards... but there is two devices that would make me consider a slab, one is something running a full version of Open webOS. The other is an iPhone!!!! HA HA just kidding (about the iPhone that is)...
3. ggendel's Avatar
Posts
470 Posts
Global Posts
825 Global Posts
#3
I had a similar issue, but the TouchPad would freeze during the Backup. I resolved it by doing a restart/wipe. Others have said that they've fixed it by running jstop (from Preware) during the backup. Once you get through once, it seems to be ok after that.
It seems to be an issue with a change in the Profile server that HP did a few weeks back.
Palm III->Palm IV->Palm V->M130->Tungsten->Treo 270->Treo 600->Treo 700->Palm Pre Plus->FrankenPre 2->Pre 3 & TouchPad
Posting Permissions
|
{
"url": "https://forums.webosnation.com/hp-touchpad/301780-if-i-manually-click-backup-now-my-touchpad-shows-blue-screen-then-shuts-down.html",
"source_domain": "forums.webosnation.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "48218",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UOABXG3DBTET6YGXWHUQMNUPRHFB7ZBN",
"WARC-Concurrent-To": "<urn:uuid:f6c9ed1c-5555-44fb-a7a1-bdb4bc189daa>",
"WARC-Date": "2018-06-21T00:26:47Z",
"WARC-IP-Address": "104.16.185.223",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:MBSGGKB2EOZSK3NCHTLHLW4OOZC6BBBF",
"WARC-Record-ID": "<urn:uuid:5ecdd63e-368e-4977-804a-314adb202542>",
"WARC-Target-URI": "https://forums.webosnation.com/hp-touchpad/301780-if-i-manually-click-backup-now-my-touchpad-shows-blue-screen-then-shuts-down.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0d66c95a-7b71-44c4-b9a4-3af55d19bd29>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-154-11-100.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,
20,
33,
118,
210,
261,
262,
349,
425,
508,
588,
648,
649,
732,
781,
782,
818,
828,
900,
901,
1276,
1501,
1523,
1533,
1547,
1564,
1585,
1594,
1856,
1857,
1951,
2074,
2075
],
"line_end_idx": [
20,
33,
118,
210,
261,
262,
349,
425,
508,
588,
648,
649,
732,
781,
782,
818,
828,
900,
901,
1276,
1501,
1523,
1533,
1547,
1564,
1585,
1594,
1856,
1857,
1951,
2074,
2075,
2094
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2094,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4134831428527832,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04494382068514824,
"rps_doc_frac_lines_end_with_ellipsis": 0.09090909361839294,
"rps_doc_frac_no_alph_words": 0.19550561904907227,
"rps_doc_frac_unique_words": 0.5726256966590881,
"rps_doc_mean_word_length": 4.256983280181885,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.024719100445508957,
"rps_doc_unigram_entropy": 5.020459175109863,
"rps_doc_word_count": 358,
"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.007874020375311375,
"rps_doc_frac_chars_top_3gram": 0.019685039296746254,
"rps_doc_frac_chars_top_4gram": 0.01443570014089346,
"rps_doc_books_importance": -167.40904235839844,
"rps_doc_books_importance_length_correction": -167.40904235839844,
"rps_doc_openwebtext_importance": -107.32752227783203,
"rps_doc_openwebtext_importance_length_correction": -107.32752227783203,
"rps_doc_wikipedia_importance": -77.55392456054688,
"rps_doc_wikipedia_importance_length_correction": -77.55392456054688
},
"fasttext": {
"dclm": 0.18442308902740479,
"english": 0.958434522151947,
"fineweb_edu_approx": 1.0954121351242065,
"eai_general_math": 0.2375355362892151,
"eai_open_web_math": 0.3078819513320923,
"eai_web_code": 0.03776293992996216
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,602,994,768,597,566,500 |
6
\$\begingroup\$
I am new to Python and I have tried to come up with a code for the number guessing game. But I am pretty sure this is not the right way to do it. I am able to get the right output, however, my code is pretty long. Any ideas on using a different logic or to reduce the code size would help.
I also would like to know how to code profile a python code for performance.
I am using IDLE and Python 3.+
import random
def main():
while(True):
inputchoice = input("Are you ready? Y/N : ")
if(inputchoice.strip() in ("y","Y","yes","Yes","YES","YEs","yeS","YeS","yEs","yES")):
print("Ok. Lets begin")
randomnumberguessinggame()
break
elif(inputchoice.strip() in ("no","No","NO","nO","n","N")):
print("Let me know when you are ready")
break
else:
print("Invalid Entry. Try again")
def randomnumberguessinggame():
print("Get ready to start guessing")
actualnumber = random.randrange(0,1000)
#print("The number to be guessed is %d"%actualnumber)
flag = True;
while(flag):
try:
guessednumber = int(input("Enter your guess "))
if(guessednumber > actualnumber):
print("That was a wrong guess. Your guess is higher than my number")
while(True):
retry = input("Would you like to try again? Y/N : ")
if(retry.strip() in ("y","Y","yes","Yes","YES","YEs","yeS","YeS","yEs","yES")):
flag = True;
break
elif(retry.strip() in ("no","No","NO","nO","n","N")):
flag = False;
break
else:
print("Invalid Entry. Try again")
elif(guessednumber < actualnumber):
print("That was a wrong guess. Your guess is lower than my number")
while(True):
retry = input("Would you like to try again? Y/N : ")
if(retry.strip() in ("y","Y","yes","Yes","YES","YEs","yeS","YeS","yEs","yES")):
flag = True;
break
elif(retry.strip() in ("no","No","NO","nO","n","N")):
flag = False;
break
else:
print("Invalid Entry. Try again")
else:
print("You've got it right. Congratulations!!")
flag = False;
except ValueError:
print("Your guess is invalid. Kindly guess again.")
flag = True;
main()
print("Exiting the game...")
\$\endgroup\$
2
• 4
\$\begingroup\$ Small point: Why not replace the inputchoice.strip() in ("y","Y","yes"," ...) by just inputchoice.strip().lower().startswith('y')? \$\endgroup\$ Feb 4 '17 at 13:40
• 1
\$\begingroup\$ @JohnColeman Feel free to point that out in an answer. As for the reason? Beginners usually don't know such thing :-) \$\endgroup\$
– Mast
Feb 4 '17 at 18:17
3
\$\begingroup\$
Advice 1
I would not abuse the user with the question whether he wants to continue; just have a command (say, quit) for quitting the game while still guessing.
Advice 2
randomnumberguessinggame
The Python way is random_number_guessing_game.
Advice 3
You don't have to use parentheses in the branch and loop conditionals.
Summa summarum
I had this in mind:
import random
def main():
actual_number = random.randrange(0, 1000)
while True:
guess = input("Enter your guess: ")
if guess.strip().lower() == "quit":
print("Bye!")
return
try:
guess_number = int(guess)
except ValueError:
print(guess, "is not an integer!")
continue
if guess_number < actual_number:
print("Your guess is too small.")
elif guess_number > actual_number:
print("Your guess is too large.")
else:
print(guess_number, "Excellent!")
return
main()
Hope that helps.
\$\endgroup\$
0
2
\$\begingroup\$
For starters, remove all the semicolons, this is not Java or C#. Furthermore, You can extract a function that handles all the questions for confirmation. Next, why not consider every answer that is not a confirmation as a 'no' if you choose to ask that many times which I wouldn't.
I'd write it as follows:
import random
def play():
print("Get ready to start guessing!")
guessing_game(random.randrange(0, 1000))
print("Congratulations!! Exiting the game...")
def guessing_game(number):
try:
guess = int(input("Enter your guess: "))
if guess == number:
return
print(["Higher!", "Lower!"][guess > number])
except ValueError:
print("Invalid!")
guessing_game(number)
if __name__ == '__main__': # this the proper way
play()
\$\endgroup\$
2
• \$\begingroup\$ @Graipher I wouldn't argue with the loop ;-) But since the OP asked to reduce code size (not to improve performance, memory footprint or readability), I went with the recursion. \$\endgroup\$ Feb 4 '17 at 15:38
• \$\begingroup\$ Fair enough. Anyways, you already got my +1 for your first sentence. \$\endgroup\$
– Graipher
Feb 4 '17 at 15:40
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://codereview.stackexchange.com/questions/154434/number-guessing-game-in-python/154436#154436",
"source_domain": "codereview.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "155110",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DVRRJKQHMBXPXTDNNPL5QQE5JPUKPKSN",
"WARC-Concurrent-To": "<urn:uuid:df4b289a-0f2a-4773-8f38-521a49b84295>",
"WARC-Date": "2022-01-21T23:32:13Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B5SHZ4FSNGUA7QDMLAD7DGFLPNX5TKWG",
"WARC-Record-ID": "<urn:uuid:4b25269a-00a3-4c31-b582-ebe95f806913>",
"WARC-Target-URI": "https://codereview.stackexchange.com/questions/154434/number-guessing-game-in-python/154436#154436",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e30ce60-009e-43a4-b66c-0a8765677dbf>"
},
"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-181\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
18,
19,
309,
310,
387,
388,
419,
420,
434,
435,
447,
464,
521,
615,
651,
690,
708,
780,
832,
850,
864,
910,
911,
943,
984,
1028,
1086,
1103,
1120,
1133,
1193,
1239,
1340,
1369,
1442,
1542,
1579,
1609,
1683,
1721,
1751,
1777,
1835,
1883,
1983,
2012,
2085,
2185,
2222,
2252,
2326,
2364,
2394,
2420,
2478,
2496,
2560,
2590,
2617,
2681,
2706,
2707,
2714,
2715,
2744,
2758,
2760,
2766,
2950,
2956,
3108,
3119,
3142,
3144,
3160,
3161,
3170,
3171,
3322,
3323,
3332,
3333,
3358,
3359,
3406,
3407,
3416,
3417,
3488,
3489,
3504,
3505,
3525,
3526,
3540,
3541,
3542,
3554,
3600,
3616,
3660,
3661,
3705,
3731,
3750,
3751,
3764,
3802,
3829,
3876,
3897,
3898,
3939,
3985,
4028,
4074,
4088,
4134,
4153,
4154,
4161,
4162,
4179,
4180,
4194,
4196,
4198,
4214,
4215,
4497,
4498,
4523,
4524,
4538,
4539,
4551,
4593,
4638,
4689,
4690,
4717,
4726,
4775,
4803,
4822,
4875,
4898,
4924,
4950,
4951,
5001,
5012,
5026,
5028,
5259,
5362,
5377,
5400,
5401,
5413,
5414,
5514,
5515
],
"line_end_idx": [
2,
18,
19,
309,
310,
387,
388,
419,
420,
434,
435,
447,
464,
521,
615,
651,
690,
708,
780,
832,
850,
864,
910,
911,
943,
984,
1028,
1086,
1103,
1120,
1133,
1193,
1239,
1340,
1369,
1442,
1542,
1579,
1609,
1683,
1721,
1751,
1777,
1835,
1883,
1983,
2012,
2085,
2185,
2222,
2252,
2326,
2364,
2394,
2420,
2478,
2496,
2560,
2590,
2617,
2681,
2706,
2707,
2714,
2715,
2744,
2758,
2760,
2766,
2950,
2956,
3108,
3119,
3142,
3144,
3160,
3161,
3170,
3171,
3322,
3323,
3332,
3333,
3358,
3359,
3406,
3407,
3416,
3417,
3488,
3489,
3504,
3505,
3525,
3526,
3540,
3541,
3542,
3554,
3600,
3616,
3660,
3661,
3705,
3731,
3750,
3751,
3764,
3802,
3829,
3876,
3897,
3898,
3939,
3985,
4028,
4074,
4088,
4134,
4153,
4154,
4161,
4162,
4179,
4180,
4194,
4196,
4198,
4214,
4215,
4497,
4498,
4523,
4524,
4538,
4539,
4551,
4593,
4638,
4689,
4690,
4717,
4726,
4775,
4803,
4822,
4875,
4898,
4924,
4950,
4951,
5001,
5012,
5026,
5028,
5259,
5362,
5377,
5400,
5401,
5413,
5414,
5514,
5515,
5605
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5605,
"ccnet_original_nlines": 164,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25183823704719543,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03125,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.36213234066963196,
"rps_doc_frac_unique_words": 0.4409836232662201,
"rps_doc_mean_word_length": 5.304917812347412,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.005514710210263729,
"rps_doc_unigram_entropy": 5.2126665115356445,
"rps_doc_word_count": 610,
"rps_doc_frac_chars_dupe_10grams": 0.10939431190490723,
"rps_doc_frac_chars_dupe_5grams": 0.20148330926895142,
"rps_doc_frac_chars_dupe_6grams": 0.1742892563343048,
"rps_doc_frac_chars_dupe_7grams": 0.13782447576522827,
"rps_doc_frac_chars_dupe_8grams": 0.13782447576522827,
"rps_doc_frac_chars_dupe_9grams": 0.13782447576522827,
"rps_doc_frac_chars_top_2gram": 0.012360939756035805,
"rps_doc_frac_chars_top_3gram": 0.007416559848934412,
"rps_doc_frac_chars_top_4gram": 0.009888749569654465,
"rps_doc_books_importance": -462.7938232421875,
"rps_doc_books_importance_length_correction": -462.7938232421875,
"rps_doc_openwebtext_importance": -307.38067626953125,
"rps_doc_openwebtext_importance_length_correction": -307.38067626953125,
"rps_doc_wikipedia_importance": -146.5431365966797,
"rps_doc_wikipedia_importance_length_correction": -146.5431365966797
},
"fasttext": {
"dclm": 0.24847519397735596,
"english": 0.8683313727378845,
"fineweb_edu_approx": 1.5916094779968262,
"eai_general_math": 0.16970700025558472,
"eai_open_web_math": 0.19204086065292358,
"eai_web_code": 0.035771191120147705
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"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": "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
|
-1,427,677,142,663,602,700 |
Programme Python 3 pour vérifier le numéro d’Armstrong
Aujourd’hui, nous verrons un programme Python 3 simple pour vérifier le numéro d’Armstrong. Si vous avez manqué notre précédent blog Python 3, consultez-le, où j’ai créé une calculatrice Python simple.
Pour comprendre cet exemple, vous devez connaître les concepts de programmation Python suivants.
Vous pouvez également vous référer à ces meilleurs livres Python pour débutants afin d’ajouter plus de ressources à votre parcours d’apprentissage.
Nous aborderons bientôt ces sujets en détail dans notre cours d’introduction à Python. Abonnez-vous à notre liste de diffusion pour recevoir toutes les dernières mises à jour sur le cours directement dans votre boîte de réception.
Doit lire : Comment envoyer des e-mails à l’aide de Python avec des pièces jointes.
Programme Python pour vérifier le numéro d’Armstrong
Un nombre est appelé nombre d’Armstrong lorsqu’il est égal à la somme de ses chiffres élevée au nombre total de chiffres.
Par exemple, vérifions si 153 est un nombre d’Armstrong ou non. Ici, le nombre total de chiffres est de 3. Par conséquent, nous allons calculer les cubes de chiffres individuels et voir si leur somme est égale au nombre lui-même.
À présent,
Cube de 1 + Cube de 5 + Cube de 3 = 153 (le nombre lui-même). Par conséquent, 153 est un nombre d’Armstrong.
Dans notre code Python, nous devons répliquer la même logique pour vérifier si le nombre donné est un nombre d’Armstrong ou non.
Étape 1 : Obtenez l’entrée de l’utilisateur à vérifier.
Étape 2 : stockez l’entrée dans une variable temporaire.
Étape 3 : Créez une variable pour stocker la somme et initialisez-la avec zéro.
Étape 4 : Maintenant, trouvez la longueur du nombre d’entrée en utilisant la fonction len() et stockez-la dans une variable.
Étape 5 : Utilisez la boucle While pour trouver la somme des chiffres individuels élevés à la longueur du nombre.
Étape 6 : Utilisez l’instruction if-else pour vérifier si la somme est égale à la valeur réelle ou non. S’il est égal, l’utilisateur verra le message indiquant que le numéro saisi est Armstrong ; sinon, le nombre n’est pas un nombre Armstrong.
Code source:
Essayez-le vous-même :
Sortie du programme :
armstrong number python program output
Programme Python pour vérifier le nombre d’Armstrong dans un intervalle
Code:
Production:
python program to print armstrong number in an interval
Programmes Python associés :
Écrit par René Labonté
René Labonté a créé sa propre entreprise, et son propre cabinet d'expertise comptable en 2012. Après avoir obtenu un diplôme d'ingénieur en informatique à l'Université des sciences appliquées de Karlsruhe et à l'INSA de Lyon, il a commencé à travailler pour KPMG à Francfort (1989-1990) avant de décider de poursuivre une carrière dans la gestion d'entreprise et la comptabilité. il a obtenu ces certifications d'auditeur en 1997 et d'expert-comptable en 2002.....................
10 meilleurs ordinateurs portables pour la production musicale à moins de 1 000 $
|
{
"url": "https://univ-caen.fr/programme-python-3-pour-verifier-le-numero-darmstrong/",
"source_domain": "univ-caen.fr",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "63931",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NSTRW5OFHA2O5OHXMPCYZIMM3DY3UUXN",
"WARC-Concurrent-To": "<urn:uuid:24ef5a06-7e29-4823-a127-286488dcf89f>",
"WARC-Date": "2022-12-01T23:34:01Z",
"WARC-IP-Address": "104.21.94.92",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JQHHZAYVMJBYHKBZFEQFXN5GUXCTM5AP",
"WARC-Record-ID": "<urn:uuid:1736bd79-9d9b-4977-bc07-7c40d4a15aca>",
"WARC-Target-URI": "https://univ-caen.fr/programme-python-3-pour-verifier-le-numero-darmstrong/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d21a7a96-794b-4cbb-8f71-ab4268e57fcf>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-73\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
55,
56,
258,
259,
356,
357,
505,
506,
737,
738,
822,
823,
876,
877,
999,
1000,
1230,
1231,
1242,
1243,
1352,
1353,
1482,
1483,
1539,
1540,
1597,
1598,
1678,
1679,
1804,
1805,
1919,
1920,
2164,
2165,
2178,
2179,
2202,
2203,
2225,
2226,
2265,
2266,
2338,
2339,
2345,
2346,
2358,
2359,
2415,
2416,
2445,
2446,
2469,
2470,
2952,
2953
],
"line_end_idx": [
55,
56,
258,
259,
356,
357,
505,
506,
737,
738,
822,
823,
876,
877,
999,
1000,
1230,
1231,
1242,
1243,
1352,
1353,
1482,
1483,
1539,
1540,
1597,
1598,
1678,
1679,
1804,
1805,
1919,
1920,
2164,
2165,
2178,
2179,
2202,
2203,
2225,
2226,
2265,
2266,
2338,
2339,
2345,
2346,
2358,
2359,
2415,
2416,
2445,
2446,
2469,
2470,
2952,
2953,
3034
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3034,
"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.0901639312505722,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006557379849255085,
"rps_doc_frac_lines_end_with_ellipsis": 0.01694915071129799,
"rps_doc_frac_no_alph_words": 0.23442623019218445,
"rps_doc_frac_unique_words": 0.4838709831237793,
"rps_doc_mean_word_length": 5.408602237701416,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.01147541031241417,
"rps_doc_unigram_entropy": 4.952600955963135,
"rps_doc_word_count": 465,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08986082673072815,
"rps_doc_frac_chars_dupe_6grams": 0.021471170708537102,
"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.03101392090320587,
"rps_doc_frac_chars_top_3gram": 0.023856859654188156,
"rps_doc_frac_chars_top_4gram": 0.026242539286613464,
"rps_doc_books_importance": -221.98114013671875,
"rps_doc_books_importance_length_correction": -221.98114013671875,
"rps_doc_openwebtext_importance": -120.60145568847656,
"rps_doc_openwebtext_importance_length_correction": -120.60145568847656,
"rps_doc_wikipedia_importance": -69.9127426147461,
"rps_doc_wikipedia_importance_length_correction": -69.9127426147461
},
"fasttext": {
"dclm": 0.9971034526824951,
"english": 0.0005602900055237114,
"fineweb_edu_approx": 1.5211467742919922,
"eai_general_math": 0.001327279955148697,
"eai_open_web_math": 0.5554426312446594,
"eai_web_code": 0.7154482007026672
}
}
|
{
"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": "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": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,062,321,772,265,597,000 |
Home Theater Forum and Systems banner
fdw
1. REW Forum
the new [FDW] suffix on a measurement, in beta 11, seems like it gets added repeatedly in some cases and not at all in others. It looks like it adds it to a measurement every time the ir window dialog is opened and an FDW is activated so you quickly get a measurement name like CW [FDW]...
2. REW Forum
Something here seems to be behaving oddly Here's a measurement, usual default window applied (125ms L, 500ms R) and minimum phase generated added a 6 cycle FDW (the no of cycles doesn't appear to matter) and regenerate minimum phase, EGD is looking odd pressed ctrl+alt+6 twice to reapply...
Top
|
{
"url": "https://www.hometheatershack.com/tags/fdw/",
"source_domain": "www.hometheatershack.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "35456",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KUD5GW6DDZIAILGQK4MXSZ6GOF7WRHTY",
"WARC-Concurrent-To": "<urn:uuid:30421ac5-f5ea-431c-a258-cf68ad99cd81>",
"WARC-Date": "2021-04-19T02:37:54Z",
"WARC-IP-Address": "104.16.173.102",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UMCKZHDIABPJ3IJPVOVRHDR7JWONSNX2",
"WARC-Record-ID": "<urn:uuid:e70e5617-3f55-49be-b132-942e4d685ea4>",
"WARC-Target-URI": "https://www.hometheatershack.com/tags/fdw/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:099643ae-2121-4f3d-a04b-1efa490f4fed>"
},
"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-247.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,
38,
39,
43,
44,
59,
353,
368,
664
],
"line_end_idx": [
38,
39,
43,
44,
59,
353,
368,
664,
667
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 667,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3819444477558136,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.069444440305233,
"rps_doc_frac_lines_end_with_ellipsis": 0.2222222238779068,
"rps_doc_frac_no_alph_words": 0.1805555671453476,
"rps_doc_frac_unique_words": 0.6890756487846375,
"rps_doc_mean_word_length": 4.277310848236084,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.01388888992369175,
"rps_doc_unigram_entropy": 4.228081226348877,
"rps_doc_word_count": 119,
"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.09430254995822906,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -50.90665054321289,
"rps_doc_books_importance_length_correction": -58.143455505371094,
"rps_doc_openwebtext_importance": -35.0699577331543,
"rps_doc_openwebtext_importance_length_correction": -42.3067626953125,
"rps_doc_wikipedia_importance": -20.096677780151367,
"rps_doc_wikipedia_importance_length_correction": -27.33348274230957
},
"fasttext": {
"dclm": 0.051479339599609375,
"english": 0.9374407529830933,
"fineweb_edu_approx": 0.9918164610862732,
"eai_general_math": 0.5510128140449524,
"eai_open_web_math": 0.3124285340309143,
"eai_web_code": 0.0009769200114533305
}
}
|
{
"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": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,599,384,684,348,082,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
PerlMonks
regex challenged
by grashoper (Monk)
on Oct 07, 2009 at 19:48 UTC ( #799797=perlquestion: print w/replies, xml ) Need Help??
grashoper has asked for the wisdom of the Perl Monks concerning the following question:
I was trying to come up with a regex to fix er block(sql injection) not sure how to write this properly. should I be doing this in the form validation code (since this is a loginbox() process or is it better practice to fix it in the sql itself? I am really horrendous with regexes
#want/need to add something to $user to test if its invalid #input #next if $User(/^"*^';&<>()/); #$User.'.'.'; #$Response->Write("Invalid Input"); my $sql = "SELECT Name, UserID, Passwd, Class FROM Users WHERE UserID='$User';";"
Replies are listed 'Best First'.
Re: regex challenged
by moritz (Cardinal) on Oct 07, 2009 at 19:55 UTC
You should just use placeholders and avoid escaping of the values totally:
my $sth = $dbh->prepare('SELECT Name, UserID, Passwd, Class FROM Users WHERE UserID=?'); $sth->execute($User);
The database substitutes the question mark with the value from $User without interpreting it as SQL, so you're as safe as you can get that way.
When you print out the user name again someday, you have to HTML-Escape it. Good template systems like HTML::Template::Compiled can do that by default with the default_escape => 'HTML' option.
Perl 6 - links to (nearly) everything that is Perl 6.
Re: regex challenged
by jrtayloriv (Pilgrim) on Oct 07, 2009 at 20:48 UTC
Re: regex challenged
by redgreen (Priest) on Oct 07, 2009 at 20:21 UTC
Besides using placeholders as moritz said, it is always easier to test for characters you want allowed (a known set) in a regex, rather then trying to come up with what isn't allowed (an unknown large set).
if ( $User =~ /^[a-z0-9]+$/i ) { # Allowed }
Re: regex challenged
by halfcountplus (Hermit) on Oct 07, 2009 at 20:14 UTC
What Moritz says about using a placeholder is definitely the way to go vis. avoiding SQL injection.
If you want a simple way to make it HTML safe, you can do that before you put it in the DB or after, when you take it out and want to use it in a page (depending what else is done with the data). There are lots of modules, etc, for doing this but the major issue is the < and >, and ' if you use javascript:
$string =~ s/</</g; $string =~ s/>/>/g; $string =~ s/'/'/g;
Hopefully you recognize what that is for. There is a chart of all HTML "escape" codes at http://www.lookuptables.com/
How is your advice regarding HTML safety poor? Let me count the ways:
1. It's best to clean up your data both before and after. Before storing the data, you need to clean it up enough to make it safe to store. (In many cases, this can be skipped in favor of using parametrized queries (placeholders).)
Cleanup for display needs to be done immediately prior to display because, if you only clean up the HTML before storing it and a new exploit is discovered next week, the data already in your database may still contain that exploit. Doing this cleanup on display is the only way to ensure that all current cleanup will be performed on older data. (Pre-cleaning before storage isn't a bad thing, but it is not sufficient by itself.)
2. < and > are major issues even if you don't use javascript. <iframe src='http://rogue.com/path/to/exploit.html'></iframe>, for example.
3. Your set of suggested regexes take a blacklisting approach ("block these three specific characters") which, by its very nature, is susceptible to letting potential dangers slip through. It's much better to go with whitelisting ("this set of characters are known (or at least believed) to be safe; block everything else") in the general case or to use a proper HTML escaping function in the specific case of handling HTML output.
Log In?
Username:
Password:
What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: perlquestion [id://799797]
Approved by moritz
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (2)
As of 2022-01-21 08:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
In 2022, my preferred method to securely store passwords is:
Results (57 votes). Check out past polls.
Notices?
|
{
"url": "http://qs321.pair.com/~monkads/?node_id=799797",
"source_domain": "qs321.pair.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "27988",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QIPRXRGDDZTZPCHWAKZ3LSE2RFIR2IW2",
"WARC-Concurrent-To": "<urn:uuid:3f5b991c-c0fe-49e6-a8b5-ef97388de062>",
"WARC-Date": "2022-01-21T08:19:06Z",
"WARC-IP-Address": "66.39.36.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ABDLVPULNWKBTDDVVAMWQLJJDQG5ISMM",
"WARC-Record-ID": "<urn:uuid:2db9f757-2fc5-4d81-843b-4dfe0d3644ed>",
"WARC-Target-URI": "http://qs321.pair.com/~monkads/?node_id=799797",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:24540d3a-83be-4f83-a8d1-cabe36944bed>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-243\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
63,
83,
85,
97,
98,
115,
116,
136,
224,
225,
313,
314,
596,
826,
827,
860,
881,
931,
1010,
1125,
1126,
1274,
1275,
1472,
1473,
1531,
1552,
1605,
1626,
1676,
1677,
1888,
1889,
1938,
1959,
2014,
2118,
2119,
2431,
2505,
2627,
2703,
2941,
2942,
3381,
3382,
3526,
3964,
3965,
3973,
3983,
3993,
3994,
4014,
4032,
4048,
4061,
4074,
4112,
4131,
4136,
4148,
4185,
4186,
4224,
4237,
4280,
4307,
4317,
4330,
4342,
4353,
4371,
4436,
4437,
4438,
4439,
4440,
4441,
4442,
4443,
4444,
4445,
4446,
4447,
4448,
4494,
4495
],
"line_end_idx": [
63,
83,
85,
97,
98,
115,
116,
136,
224,
225,
313,
314,
596,
826,
827,
860,
881,
931,
1010,
1125,
1126,
1274,
1275,
1472,
1473,
1531,
1552,
1605,
1626,
1676,
1677,
1888,
1889,
1938,
1959,
2014,
2118,
2119,
2431,
2505,
2627,
2703,
2941,
2942,
3381,
3382,
3526,
3964,
3965,
3973,
3983,
3993,
3994,
4014,
4032,
4048,
4061,
4074,
4112,
4131,
4136,
4148,
4185,
4186,
4224,
4237,
4280,
4307,
4317,
4330,
4342,
4353,
4371,
4436,
4437,
4438,
4439,
4440,
4441,
4442,
4443,
4444,
4445,
4446,
4447,
4448,
4494,
4495,
4507
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4507,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0.0004437500028871,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3709999918937683,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03099999949336052,
"rps_doc_frac_lines_end_with_ellipsis": 0.011235959827899933,
"rps_doc_frac_no_alph_words": 0.2639999985694885,
"rps_doc_frac_unique_words": 0.4806094169616699,
"rps_doc_mean_word_length": 4.59556770324707,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.008999999612569809,
"rps_doc_unigram_entropy": 5.4030280113220215,
"rps_doc_word_count": 722,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05153707042336464,
"rps_doc_frac_chars_dupe_6grams": 0.021097049117088318,
"rps_doc_frac_chars_dupe_7grams": 0.021097049117088318,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009041589684784412,
"rps_doc_frac_chars_top_3gram": 0.02561783976852894,
"rps_doc_frac_chars_top_4gram": 0.01657624915242195,
"rps_doc_books_importance": -444.1688537597656,
"rps_doc_books_importance_length_correction": -444.1688537597656,
"rps_doc_openwebtext_importance": -217.80255126953125,
"rps_doc_openwebtext_importance_length_correction": -217.80255126953125,
"rps_doc_wikipedia_importance": -152.5966033935547,
"rps_doc_wikipedia_importance_length_correction": -152.5966033935547
},
"fasttext": {
"dclm": 0.31084924936294556,
"english": 0.895054817199707,
"fineweb_edu_approx": 1.9456754922866821,
"eai_general_math": 0.14681506156921387,
"eai_open_web_math": 0.3500174880027771,
"eai_web_code": 0.02172427996993065
}
}
|
{
"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.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,921,260,500,448,633,000 |
Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS8194972 B2
Publication typeGrant
Application numberUS 13/178,813
Publication date5 Jun 2012
Filing date8 Jul 2011
Priority date11 Apr 2006
Also published asUS7983473, US8478026, US8675955, US20070236507, US20110261069, US20130076743, US20130271483
Publication number13178813, 178813, US 8194972 B2, US 8194972B2, US-B2-8194972, US8194972 B2, US8194972B2
InventorsMark H. A. Tigges
Original AssigneeNoregin Assets, N.V., L.L.C.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and system for transparency adjustment and occlusion resolution for urban landscape visualization
US 8194972 B2
Abstract
According to certain embodiments of the present invention, a graphical presentation is generated from a data representation. A transparency lens is applied to reveal a region-of-interest within an original image. The region-of-interest is occluded by an occluding portion of the original image. The transparency lens includes a focal region having a transparency to reduce occlusion of the region-of-interest by the occluding portion. The transparency lens also includes a shoulder region between the focal region and a foreground of the original image. The shoulder region has decreasing transparency from the focal region to the foreground. In an embodiment, occluding portion is sliced into slices normal to a depth axis of the original image. Transparencies are applied to the slices as a function of depth of the slices to form the shoulder region.
Images(8)
Previous page
Next page
Claims(20)
1. A method for generating a graphical presentation from a data representation, the method comprising:
applying a transparency lens to reveal a region-of-interest within an original image, wherein the region-of-interest is occluded by an occluding portion of the original image;
wherein the transparency lens includes:
a focal region having a transparency to reduce occlusion of the region-of-interest by the occluding portion, and
a shoulder region between the focal region and a foreground of the original image, wherein the shoulder region has decreasing transparency as depth decreases from the focal region to the foreground.
2. The method of claim 1, further comprising slicing the occluding portion into slices normal to a depth axis of the original image; and
applying transparencies to the slices as a function of depth of the slices to form the shoulder region.
3. The method of claim 2, wherein the occluding portion comprises an occluding polygon.
4. The method of claim 3, further comprising converting the original image into a mesh of polygons including the occluding polygon.
5. The method of claim 1, wherein the original image comprises a landscape image;
wherein the occluding portion comprises a first building; and
wherein the region-of-interest comprises a second building.
6. The method of claim 1, wherein the original image comprises a computer-aided design (“CAD”) image;
wherein the occluding portion comprises a first component; and
wherein the region-of-interest comprises a second component.
7. The method of claim 1, further comprising adjusting the transparency of the focal region through a graphical user interface (“GUI”).
8. The method of claim 7, further comprising adjusting the transparency of the shoulder region through the GUI.
9. The method of claim 1, further comprising adjusting an extent of the focal region through a GUI.
10. The method of claim 1, wherein the focal region further includes a magnification; and
wherein at least a portion of the shoulder region has a magnification that is less than the magnification of the focal region and greater than a magnification of the foreground.
11. At least one non-transitory computer-readable medium including program instructions, the program instructions comprising:
lens application instructions for applying a transparency lens to reveal a region-of-interest within an original image, wherein the region-of-interest is occluded by an occluding portion of the original image;
wherein the transparency lens includes:
a focal region having a transparency to reduce occlusion of the region-of-interest by the occluding portion, and
a shoulder region between the focal region and a foreground of the original image, wherein the shoulder region has decreasing transparency as depth decreases from the focal region to the foreground.
12. The program instructions of claim 11, further comprising slicing instructions for slicing the occluding portion into slices normal to a depth axis of the original image; and
applying transparencies to the slices as a function of depth of the slices to form the shoulder region.
13. The program instructions of claim 12, wherein the occluding portion comprises an occluding polygon.
14. The program instructions of claim 13, further comprising conversion instructions for converting the original image into a mesh of polygons including the occluding polygon.
15. The program instructions of claim 11, wherein the original image comprises a landscape image;
wherein the occluding portion comprises a first building; and
wherein the region-of-interest comprises a second building.
16. The program instructions of claim 11, wherein the original image comprises a computer-aided design (“CAD”) image;
wherein the occluding portion comprises a first component; and
wherein the region-of-interest comprises a second component.
17. The program instructions of claim 11, further comprising adjustment instructions for adjusting the transparency of the focal region through a graphical user interface (“GUI”).
18. The program instructions of claim 17, further comprising adjustment instructions for adjusting the transparency of the shoulder region through the GUI.
19. The program instructions of claim 11, further comprising adjustment instructions for adjusting an extent of the focal region through a GUI.
20. The program instructions of claim 11, wherein the focal region further includes a magnification; and
wherein at least a portion of the shoulder region has a magnification that is less than the magnification of the focal region and greater than a magnification of the foreground.
Description
This application claims priority to and is a continuation of U.S. patent application Ser. No. 11/695,104, filed on Apr. 2, 2007 and issued as U.S. Pat. No. 7,983,473. This application also claims priority from U.S. Pat. Appl. No. 60/790,778. Both of these applications are incorporated herein in their entireties
FIELD OF THE INVENTION
This invention relates to the field of computer graphics processing, and more specifically, to a method and system for generating and adjusting detail-in-context lenses for display in detail-in-context data presentations for applications including transparency adjustment and occlusion resolution for urban landscape visualization.
BACKGROUND OF THE INVENTION
Modern computer graphics systems, including virtual environment systems, are used for numerous applications such as mapping, navigation, flight training, surveillance, and even playing computer games. In general, these applications are launched by the computer graphics system's operating system upon selection by a user from a menu or other graphical user interface (“GUI”). A GUI is used to convey information to and receive commands from users and generally includes a variety of GUI objects or controls, including icons, toolbars, drop-down menus, text, dialog boxes, buttons, and the like. A user typically interacts with a GUI by using a pointing device (e.g., a mouse) to position a pointer or cursor over an object and “clicking” on the object.
One problem with these computer graphics systems is their inability to effectively display detailed information for selected graphic objects when those objects are in the context of a larger image. A user may require access to detailed information with respect to an object in order to closely examine the object, to interact with the object, or to interface with an external application or network through the object. For example, the detailed information may be a close-up view of the object or a region of a digital map image.
While an application may provide a GUI for a user to access and view detailed information for a selected object in a larger image, in doing so, the relative location of the object in the larger image may be lost to the user. Thus, while the user may have gained access to the detailed information required to interact with the object, the user may lose sight of the context within which that object is positioned in the larger image. This is especially so when the user must interact with the GUI using a computer mouse or keyboard. The interaction may further distract the user from the context in which the detailed information is to be understood. This problem is an example of what is often referred to as the “screen real estate problem”.
Now, the growth of the Internet and online map presentation technologies has resulted in broad availability of online and interactive presentation of maps and geographically relevant photographic images. Similarly, geospatial software applications and online services such as Google Earth™ have provided online access to photorealistic representations of cities, in some cases with knowledge of the locations and representative geometry of buildings. However, in such urban landscape presentations, one of the areas of concern is occlusion of buildings or other entities of interest (i.e., regions-of-interest, objects-of-interest) to the user by buildings that are in the line of sight between the user and a building that may be of interest. For example, a user may have a potential interest in the existence of a building housing a bookstore or coffee shop on the next block but may not be aware of it because of buildings near his present viewing location that occlude the building of potential interest. Various approaches to occlusion resolution have been attempted for 3D visualization, such as the 3D lens approach of Cowperthwaite (see U.S. Pat. No. 6,798,412 to Cowperthwaite, which is incorporated herein by reference) and the building height adjustment of Yano (see U.S. Pat. No. 5,999,879 to Yano, which is incorporated herein by reference). However, these approaches cause displacements of building locations and/or building height adjustments that can be very disorienting to the user, and can be expensive in terms of the required computations.
A need therefore exists for an improved method and system for generating and adjusting detailed views of selected information within the context of surrounding information presented on the display of a computer system. Accordingly, a solution that addresses, at least in part, the above and other shortcomings is desired.
SUMMARY OF THE INVENTION
According to one aspect of the invention, there is provided a method for generating a presentation of a region-of-interest within an original image for display on a display screen, the region-of-interest being at a depth within the original image and being occluded by a portion of the original image at a lesser depth, the method comprising: applying graduated transparency to the original image to generate the presentation, the graduated transparency reducing occlusion of the region-of-interest by making transparent at least some of the portion of the original image occluding the region-of-interest, the graduated transparency when applied renders within the presentation a focal region having a maximum level of transparency at the depth of and for the region-of-interest at least partially surrounded by a shoulder region where transparency decreases with lessening depth from the maximum level to that of the original image surrounding the shoulder region to provide context for the focal region with respect to the original image; and, displaying the presentation on the display screen.
In the above method, the region-of-interest may be a first object and the portion of the original image at the lesser depth may be a second object. The first and second objects may be modelled as first and second convex polygons, respectively. The method may further include dividing the second polygon into one or more slices, each slice being made at a respective depth into the representation. The method may further include assigning each slice a respective level of transparency that increases with depth to thereby apply the graduated transparency. The original image may be an urban landscape image. The first and second objects may be first and second buildings, respectively. The method may further include receiving a signal for adjusting the maximum level of transparency in the focal region. The signal for adjusting the maximum level of transparency may be received through a slide bar icon. The maximum level of transparency may be fully transparent. The method may further include receiving a signal for adjusting the transparency in the shoulder region. The signal for adjusting the transparency may be received through a slide bar icon. The method may further include receiving a signal for adjusting an extent of the focal region. The signal for adjusting the extent of the focal region may be received through at least one handle icon positioned on a perimeter of the focal region. The method may further include receiving a signal for adjusting an extent of the shoulder region. The signal for adjusting the extent of the shoulder region may be received through at least one handle icon positioned on a perimeter of the shoulder region. The focal region may include a magnification for the region-of-interest and the magnification may decrease in the shoulder region to that of the original image surrounding the shoulder region. The method may further include receiving a signal for adjusting the magnification. The signal for adjusting the magnification may be received through a slide bar icon. The original image may be a computer aided design (“CAD”) image. And, the CAD image may be an image of a three-dimensional mechanical assembly and the first and second objects may be first and second components, respectively, of the mechanical assembly.
In accordance with further aspects of the present invention there is provided an apparatus such as a data processing system, a method for adapting this system, as well as articles of manufacture such as a computer readable medium having program instructions recorded thereon for practising the method of the invention.
BRIEF DESCRIPTION OF THE DRAWINGS
Further features and advantages of the embodiments of the present invention will become apparent from the following detailed description, taken in combination with the appended drawings, in which:
FIG. 1 is a graphical representation illustrating the geometry for constructing a three-dimensional perspective viewing frustum, relative to an x, y, z coordinate system, in accordance with elastic presentation space graphics technology and an embodiment of the invention;
FIG. 2 is a graphical representation illustrating the geometry of a presentation in accordance with elastic presentation space graphics technology and an embodiment of the invention;
FIG. 3 is a block diagram illustrating a data processing system adapted for implementing an embodiment of the invention;
FIG. 4 is a partial screen capture illustrating a GUI having lens control elements for user interaction with detail-in-context data presentations in accordance with an embodiment of the invention;
FIG. 5 is a screen capture illustrating a city block within an urban landscape representation in accordance with an embodiment of the invention;
FIG. 6 is a screen capture illustrating a presentation in which a detail-in-context transparency lens has been applied to the representation of FIG. 5 to reduce occlusion of a region-of-interest, in accordance with an embodiment of the invention; and,
FIG. 7 is a flow chart illustrating operations of modules within the memory of a data processing system for generating a presentation of a region-of-interest within an original image for display on a display screen, the region-of-interest being at a depth within the original image and being occluded by a portion of the original image at a lesser depth, in accordance with an embodiment of the invention.
It will be noted that throughout the appended drawings, like features are identified by like reference numerals.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
In the following description, details are set forth to provide an understanding of the invention. In some instances, certain software, circuits, structures and methods have not been described or shown in detail in order not to obscure the invention. The term “data processing system” is used herein to refer to any machine for processing data, including the computer systems and network arrangements described herein. The present invention may be implemented in any computer programming language provided that the operating system of the data processing system provides the facilities that may support the requirements of the present invention. Any limitations presented would be a result of a particular type of operating system or computer programming language and would not be a limitation of the present invention. The present invention may also be implemented in hardware.
The “screen real estate problem” generally arises whenever large amounts of information are to be displayed on a display screen of limited size. Known tools to address this problem include panning and zooming. While these tools are suitable for a large number of visual display applications, they become less effective where sections of the visual information are spatially related, such as in layered maps and three-dimensional representations, for example. In this type of information display, panning and zooming are not as effective as much of the context of the panned or zoomed display may be hidden.
A recent solution to this problem is the application of “detail-in-context” presentation techniques. Detail-in-context is the magnification of a particular region-of-interest (the “focal region” or “detail”) in a data presentation while preserving visibility of the surrounding information (the “context”). This technique has applicability to the display of large surface area media (e.g., digital maps) on computer screens of variable size including graphics workstations, laptop computers, personal digital assistants (“PDAs”), and cell phones.
In the detail-in-context discourse, differentiation is often made between the terms “representation” and “presentation”. A representation is a formal system, or mapping, for specifying raw information or data that is stored in a computer or data processing system. For example, a digital map of a city is a representation of raw data including street names and the relative geographic location of streets and utilities. Such a representation may be displayed visually on a computer screen or printed on paper. On the other hand, a presentation is a spatial organization of a given representation that is appropriate for the task at hand. Thus, a presentation of a representation organizes such things as the point of view and the relative emphasis of different parts or regions of the representation. For example, a digital map of a city may be presented with a region magnified to reveal street names.
In general, a detail-in-context presentation may be considered as a distorted view (or distortion) of a portion of the original representation or image where the distortion is the result of the application of a “lens” like distortion function to the original representation. A detailed review of various detail-in-context presentation techniques such as “Elastic Presentation Space” (“EPS”) (or “Pliable Display Technology” (“PDT”)) may be found in a publication by Marianne S. T. Carpendale, entitled “A Framework for Elastic Presentation Space” (Carpendale, Marianne S. T., A Framework for Elastic Presentation Space (Burnaby, British Columbia: Simon Fraser University, 1999)), and incorporated herein by reference.
In general, detail-in-context data presentations are characterized by magnification of areas of an image where detail is desired, in combination with compression of a restricted range of areas of the remaining information (i.e., the context), the result typically giving the appearance of a lens having been applied to the display surface. Using techniques such as those described by Carpendale, points in a representation are displaced in three dimensions and a perspective projection is used to display the points on a two-dimensional presentation display. Thus, when a lens is applied to a two-dimensional continuous surface representation, for example, the resulting presentation appears to be three-dimensional. In other words, the lens transformation appears to have stretched the continuous surface in a third dimension. In EPS graphics technology, a two-dimensional visual representation is placed onto a surface; this surface is placed in three-dimensional space; the surface, containing the representation, is viewed through perspective projection; and, the surface is manipulated to effect the reorganization of image details. The presentation transformation is separated into two steps: surface manipulation or distortion; and, perspective projection.
FIG. 1 is a graphical representation illustrating the geometry 100 for constructing a three-dimensional (“3D”) perspective viewing frustum 220, relative to an x, y, z coordinate system, in accordance with elastic presentation space (EPS) graphics technology and an embodiment of the invention. In EPS technology, detail-in-context views of two-dimensional (“2D”) visual representations are created with sight-line aligned distortions of a 2D information presentation surface within a 3D perspective viewing frustum 220. In EPS, magnification of regions-of-interest and the accompanying compression of the contextual region to accommodate this change in scale are produced by the movement of regions of the surface towards the viewpoint (“VP”) 240 located at the apex of the pyramidal shape 220 containing the frustum. The process of projecting these transformed layouts via a perspective projection results in a new 2D layout which includes the magnified and compressed regions. The use of the third dimension and perspective distortion to provide magnification in EPS provides a meaningful metaphor for the process of distorting the information presentation surface. The 3D manipulation of the information presentation surface in such a system is an intermediate step in the process of creating a new 2D layout of the information.
FIG. 2 is a graphical representation illustrating the geometry 200 of a presentation in accordance with EPS graphics technology and an embodiment of the invention. EPS graphics technology employs viewer-aligned perspective projections to produce detail-in-context presentations in a reference view plane 201 which may be viewed on a display. Undistorted 2D data points are located in a base plane 210 of a 3D perspective viewing volume or frustum 220 which is defined by extreme rays 221 and 222 and the base plane 210. The VP 240 is generally located above the centre point of the base plane 210 and reference view plane (“RVP”) 201. Points in the base plane 210 are displaced upward onto a distorted surface or “lens” 230 which is defined by a general 3D distortion function (i.e., a detail-in-context distortion basis function or simply a distortion function). The direction of the perspective projection corresponding to the distorted surface 230 is indicated by the line FPo-FP 231 drawn from a point FPo 232 in the base plane 210 through the point FP 233 which corresponds to the focal point, focus, or focal region 233 of the distorted surface 230. Typically, the perspective projection has a direction 231 that is viewer-aligned (i.e., the points FPo 232, FP 233, and VP 240 are collinear).
EPS is applicable to multidimensional data and is well suited to implementation on a computer for dynamic detail-in-context display on an electronic display surface such as a monitor. In the case of two dimensional data, EPS is typically characterized by magnification of areas of an image where detail is desired 233, in combination with compression of a restricted range of areas of the remaining information (i.e., the context) 234, the end result typically giving the appearance of a distorted surface, distortion function, or lens 230 having been applied to the display surface. The areas of the lens 230 where compression occurs may be referred to as the “shoulder” 234 of the lens 230. The area of the representation transformed by the lens may be referred to as the “lensed area”. The lensed area thus includes the focal region 233 and the shoulder region 234. Typically, the distorted surface, distortion function, or lens 230 provides a continuous or smooth transition from the base plane 210 through the shoulder region 234 to the focal region 233 as shown in FIG. 2. However, of course, the distorted surface, distortion function, or lens 230 may have a number of different shapes (e.g., truncated pyramid, etc.). To reiterate, the source image, original image, or representation to be viewed is located in the base plane 210. Magnification 233 and compression 234 are achieved through elevating elements of the original image relative to the base plane 210, and then projecting the resultant distorted surface onto the reference view plane 201. EPS performs detail-in-context presentation of n-dimensional data through the use of a procedure wherein the data is mapped into a region in an (n+1) dimensional space, manipulated through perspective projections in the (n+1) dimensional space, and then finally transformed back into n-dimensional space for presentation. EPS has numerous advantages over conventional zoom, pan, and scroll technologies, including the capability of preserving the visibility of information outside 210, 234 the local region-of-interest 233.
For example, and referring to FIGS. 1 and 2, in two dimensions, EPS can be implemented through the projection of an image onto a reference plane 201 in the following manner. The source image, original image, or representation is located on a base plane 210, and those regions-of-interest 233 of the image for which magnification is desired are elevated so as to move them closer to a reference plane situated between the reference viewpoint 240 and the reference view plane 201. Magnification of the focal region 233 closest to the RVP 201 varies inversely with distance from the RVP 201. As shown in FIGS. 1 and 2, compression of regions 234 outside the focal region 233 is a function of both distance from the RVP 201, and the gradient of the function describing the vertical distance from the RVP 201 with respect to horizontal distance from the focal region 233. The resultant combination of magnification 233 and compression 234 of the image as seen from the reference viewpoint 240 results in a lens-like effect similar to that of a magnifying glass applied to the image. Hence, the various functions used to vary the magnification and compression of the source image via vertical displacement from the base plane 210 are described as lenses, lens types, lens functions, or distortion functions. Lens functions that describe basic lens types with point and circular focal regions, as well as certain more complex lenses and advanced capabilities such as folding, have previously been described by Carpendale.
FIG. 3 is a block diagram of a data processing system 300 adapted to implement an embodiment of the invention. The data processing system 300 is suitable for generating, displaying, and adjusting detail-in-context lens presentations in conjunction with a detail-in-context graphical user interface (GUI) 400, as described below. The data processing system 300 includes an input device 310, a central processing unit (“CPU”) 320, memory 330, a display 340, and an interface device 350. The input device 310 may include a keyboard, a mouse, a trackball, a touch sensitive surface or screen, a position tracking device, an eye tracking device, or a similar device. The CPU 320 may include dedicated coprocessors and memory devices. The memory 330 may include RAM, ROM, databases, or disk devices. The display 340 may include a computer screen, terminal device, a touch sensitive display surface or screen, or a hardcopy producing output device such as a printer or plotter. And, the interface device 350 may include an interface to a network (not shown) such as the Internet and/or another wired or wireless network. Thus, the data processing system 300 may be linked to other data processing systems (not shown) by a network (not shown). For example, the data processing system 300 may be a client and/or server system. The data processing system 300 has stored therein data representing sequences of instructions which when executed cause the method described herein to be performed. Of course, the data processing system 300 may contain additional software and hardware a description of which is not necessary for understanding the invention.
Thus, the data processing system 300 includes computer executable programmed instructions for directing the system 300 to implement the embodiments of the present invention. The programmed instructions may be embodied in one or more hardware or software modules 331 which may be resident in the memory 330 of the data processing system 300. Alternatively, the programmed instructions may be embodied on a computer readable medium (such as a CD disk or floppy disk) which may be used for transporting the programmed instructions to the memory 330 of the data processing system 300. Alternatively, the programmed instructions may be embedded in a computer-readable signal or signal-bearing medium that is uploaded to a network by a vendor or supplier of the programmed instructions, and this signal or signal-bearing medium may be downloaded through an interface (e.g., 350) to the data processing system 300 from the network by end users or potential buyers.
As mentioned, detail-in-context presentations of data using techniques such as pliable surfaces, as described by Carpendale, are useful in presenting large amounts of information on limited-size display surfaces. Detail-in-context views allow magnification of a particular region-of-interest (e.g., the focal region) 233 in a data presentation while preserving visibility of the surrounding information 210, 234. In the following, a GUI 400 is described having lens control elements that can be implemented in software (and/or hardware) and applied to the control of detail-in-context data presentations. The software (and/or hardware) can be loaded into and run by the data processing system 300 of FIG. 3.
FIG. 4 is a partial screen capture illustrating a GUI 400 having lens control elements for user interaction with detail-in-context data presentations in accordance with an embodiment of the invention. Detail-in-context data presentations are characterized by magnification of areas of an image where detail is desired, in combination with compression of a restricted range of areas of the remaining information (i.e., the context), the end result typically giving the appearance of a lens having been applied to the display screen surface. This lens 410 includes a “focal region” 420 having high magnification (or elevation), a surrounding “shoulder region” 430 where information is typically visibly compressed, and a “base” 412 surrounding the shoulder region 430 and defining the extent of the lens 410. In FIG. 4, the lens 410 is shown with a circular shaped base 412 (or outline) and with a focal region 420 lying near the center of the lens 410. However, the lens 410 and focal region 420 may have any desired shape. As mentioned above, the base of the lens 412 may be coextensive with the focal region 420.
In general, the GUI 400 has lens control elements that, in combination, provide for the interactive control of the lens 410. The effective control of the characteristics of the lens 410 by a user (i.e., dynamic interaction with a detail-in-context lens) is advantageous. At any given time, one or more of these lens control elements may be made visible to the user on the display surface 340 by appearing as overlay icons on the lens 410. Interaction with each element is performed via the motion of an input or pointing device 310 (e.g., a mouse) with the motion resulting in an appropriate change in the corresponding lens characteristic. As will be described, selection of which lens control element is actively controlled by the motion of the pointing device 310 at any given time is determined by the proximity of the icon representing the pointing device 310 (e.g., cursor) on the display surface 340 to the appropriate component of the lens 410. For example, “dragging” of the pointing device at the periphery of the bounding rectangle of the lens base 412 causes a corresponding change in the size of the lens 410 (i.e., “resizing”). Thus, the GUI 400 provides the user with a visual representation of which lens control element is being adjusted through the display of one or more corresponding icons.
For ease of understanding, the following discussion will be in the context of using a two-dimensional pointing device 310 that is a mouse, but it will be understood that the invention may be practiced with other 2D or 3D (or even greater numbers of dimensions) input devices including a trackball, a keyboard, a position tracking device, an eye tracking device, an input from a navigation device, etc.
A mouse 310 controls the position of a cursor icon 401 that is displayed on the display screen 340. The cursor 401 is moved by moving the mouse 310 over a flat surface, such as the top of a desk, in the desired direction of movement of the cursor 401. Thus, the two-dimensional movement of the mouse 310 on the flat surface translates into a corresponding two-dimensional movement of the cursor 401 on the display screen 340.
A mouse 310 typically has one or more finger actuated control buttons (i.e., mouse buttons). While the mouse buttons can be used for different functions such as selecting a menu option pointed at by the cursor 401, the disclosed invention may use a single mouse button to “select” a lens 410 and to trace the movement of the cursor 401 along a desired path. Specifically, to select a lens 410, the cursor 401 is first located within the extent of the lens 410. In other words, the cursor 401 is “pointed” at the lens 410. Next, the mouse button is depressed and released. That is, the mouse button is “clicked”. Selection is thus a point and click operation. To trace the movement of the cursor 401, the cursor 401 is located at the desired starting location, the mouse button is depressed to signal the computer 320 to activate a lens control element, and the mouse 310 is moved while maintaining the button depressed. After the desired path has been traced, the mouse button is released. This procedure is often referred to as “clicking” and “dragging” (i.e., a click and drag operation). It will be understood that a predetermined key on a keyboard 310 could also be used to activate a mouse click or drag. In the following, the term “clicking” will refer to the depression of a mouse button indicating a selection by the user and the term “dragging” will refer to the subsequent motion of the mouse 310 and cursor 401 without the release of the mouse button.
The GUI 400 may include the following lens control elements: move, pickup, resize base, resize focus, fold, magnify, zoom, and scoop. Each of these lens control elements has at least one lens control icon or alternate cursor icon associated with it. In general, when a lens 410 is selected by a user through a point and click operation, the following lens control icons may be displayed over the lens 410: pickup icon 450, base outline icon 412, base bounding rectangle icon 411, focal region bounding rectangle icon 421, handle icons 481, 482, 491 magnify slide bar icon 440, zoom icon 495, and scoop slide bar icon (not shown). Typically, these icons are displayed simultaneously after selection of the lens 410. In addition, when the cursor 401 is located within the extent of a selected lens 410, an alternate cursor icon 460, 470, 480, 490, 495 may be displayed over the lens 410 to replace the cursor 401 or may be displayed in combination with the cursor 401. These lens control elements, corresponding icons, and their effects on the characteristics of a lens 410 are described below with reference to FIG. 4.
In general, when a lens 410 is selected by a point and click operation, bounding rectangle icons 411, 421 are displayed surrounding the base 412 and focal region 420 of the selected lens 410 to indicate that the lens 410 has been selected. With respect to the bounding rectangles 411, 421 one might view them as glass windows enclosing the lens base 412 and focal region 420, respectively. The bounding rectangles 411, 421 include handle icons 481, 482, 491 allowing for direct manipulation of the enclosed base 412 and focal region 420 as will be explained below. Thus, the bounding rectangles 411, 421 not only inform the user that the lens 410 has been selected, but also provide the user with indications as to what manipulation operations might be possible for the selected lens 410 though use of the displayed handles 481, 482, 491. Note that it is well within the scope of the present invention to provide a bounding region having a shape other than generally rectangular. Such a bounding region could be of any of a great number of shapes including oblong, oval, ovoid, conical, cubic, cylindrical, polyhedral, spherical, etc.
Moreover, the cursor 401 provides a visual cue indicating the nature of an available lens control element. As such, the cursor 401 will generally change in form by simply pointing to a different lens control icon 450, 412, 411, 421, 481, 482, 491, 440. For example, when resizing the base 412 of a lens 410 using a corner handle 491, the cursor 401 will change form to a resize icon 490 once it is pointed at (i.e., positioned over) the corner handle 491. The cursor 401 will remain in the form of the resize icon 490 until the cursor 401 has been moved away from the corner handle 491.
Lateral movement of a lens 410 is provided by the move lens control element of the GUI 400. This functionality is accomplished by the user first selecting the lens 410 through a point and click operation. Then, the user points to a point within the lens 410 that is other than a point lying on a lens control icon 450, 412, 411, 421, 481, 482, 491, 440. When the cursor 401 is so located, a move icon 460 is displayed over the lens 410 to replace the cursor 401 or may be displayed in combination with the cursor 401. The move icon 460 not only informs the user that the lens 410 may be moved, but also provides the user with indications as to what movement operations are possible for the selected lens 410. For example, the move icon 460 may include arrowheads indicating up, down, left, and right motion. Next, the lens 410 is moved by a click and drag operation in which the user clicks and drags the lens 410 to the desired position on the screen 340 and then releases the mouse button 310. The lens 410 is locked in its new position until a further pickup and move operation is performed.
Lateral movement of a lens 410 is also provided by the pickup lens control element of the GUI. This functionality is accomplished by the user first selecting the lens 410 through a point and click operation. As mentioned above, when the lens 410 is selected a pickup icon 450 is displayed over the lens 410 near the centre of the lens 410. Typically, the pickup icon 450 will be a crosshairs. In addition, a base outline 412 is displayed over the lens 410 representing the base 412 of the lens 410. The crosshairs 450 and lens outline 412 not only inform the user that the lens has been selected, but also provides the user with an indication as to the pickup operation that is possible for the selected lens 410. Next, the user points at the crosshairs 450 with the cursor 401. Then, the lens outline 412 is moved by a click and drag operation in which the user clicks and drags the crosshairs 450 to the desired position on the screen 340 and then releases the mouse button 310. The full lens 410 is then moved to the new position and is locked there until a further pickup operation is performed. In contrast to the move operation described above, with the pickup operation, it is the outline 412 of the lens 410 that the user repositions rather than the full lens 410.
Resizing of the base 412 (or outline or shoulder region) of a lens 410 is provided by the resize base lens control element of the GUI. After the lens 410 is selected, a bounding rectangle icon 411 is displayed surrounding the base 412. For a rectangular shaped base 412, the bounding rectangle icon 411 may be coextensive with the perimeter of the base 412. The bounding rectangle 411 includes handles 491. These handles 491 can be used to stretch the base 412 taller or shorter, wider or narrower, or proportionally larger or smaller. The corner handles 491 will keep the proportions the same while changing the size. The middle handles (not shown) will make the base 412 taller or shorter, wider or narrower. Resizing the base 412 by the corner handles 491 will keep the base 412 in proportion. Resizing the base 412 by the middle handles will change the proportions of the base 412. That is, the middle handles change the aspect ratio of the base 412 (i.e., the ratio between the height and the width of the bounding rectangle 411 of the base 412). When a user points at a handle 491 with the cursor 401 a resize icon 490 may be displayed over the handle 491 to replace the cursor 401 or may be displayed in combination with the cursor 401. The resize icon 490 not only informs the user that the handle 491 may be selected, but also provides the user with indications as to the resizing operations that are possible with the selected handle. For example, the resize icon 490 for a corner handle 491 may include arrows indicating proportional resizing. The resize icon (not shown) for a middle handle may include arrows indicating width resizing or height resizing. After pointing at the desired handle 491 the user would click and drag the handle 491 until the desired shape and size for the base 412 is reached. Once the desired shape and size are reached, the user would release the mouse button 310. The base 412 of the lens 410 is then locked in its new size and shape until a further base resize operation is performed.
Resizing of the focal region 420 of a lens 410 is provided by the resize focus lens control element of the GUI. After the lens 410 is selected, a bounding rectangle icon 421 is displayed surrounding the focal region 420. For a rectangular shaped focal region 420, the bounding rectangle icon 421 may be coextensive with the perimeter of the focal region 420. The bounding rectangle 421 includes handles 481, 482. These handles 481, 482 can be used to stretch the focal region 420 taller or shorter, wider or narrower, or proportionally larger or smaller. The corner handles 481 will keep the proportions the same while changing the size. The middle handles 482 will make the focal region 420 taller or shorter, wider or narrower. Resizing the focal region 420 by the corner handles 481 will keep the focal region 420 in proportion. Resizing the focal region 420 by the middle handles 482 will change the proportions of the focal region 420. That is, the middle handles 482 change the aspect ratio of the focal region 420 (i.e., the ratio between the height and the width of the bounding rectangle 421 of the focal region 420). When a user points at a handle 481, 482 with the cursor 401 a resize icon 480 may be displayed over the handle 481, 482 to replace the cursor 401 or may be displayed in combination with the cursor 401. The resize icon 480 not only informs the user that a handle 481, 482 may be selected, but also provides the user with indications as to the resizing operations that are possible with the selected handle. For example, the resize icon 480 for a corner handle 481 may include arrows indicating proportional resizing. The resize icon 480 for a middle handle 482 may include arrows indicating width resizing or height resizing. After pointing at the desired handle 481, 482, the user would click and drag the handle 481, 482 until the desired shape and size for the focal region 420 is reached. Once the desired shape and size are reached, the user would release the mouse button 310. The focal region 420 is then locked in its new size and shape until a further focus resize operation is performed.
Folding of the focal region 420 of a lens 410 is provided by the fold control element of the GUI. In general, control of the degree and direction of folding (i.e., skewing of the viewer aligned vector 231 as described by Carpendale) is accomplished by a click and drag operation on a point 471, other than a handle 481, 482, on the bounding rectangle 421 surrounding the focal region 420. The direction of folding is determined by the direction in which the point 471 is dragged. The degree of folding is determined by the magnitude of the translation of the cursor 401 during the drag. In general, the direction and degree of folding corresponds to the relative displacement of the focus 420 with respect to the shoulder region or lens base 412. In other words, and referring to FIG. 2, the direction and degree of folding corresponds to the displacement of the point FP 233 relative to the point FPo 232, where the vector joining the points FPo 232 and FP 233 defines the viewer aligned vector 231. In particular, after the lens 410 is selected, a bounding rectangle icon 421 is displayed surrounding the focal region 420. The bounding rectangle 421 includes handles 481, 482. When a user points at a point 471, other than a handle 481, 482, on the bounding rectangle 421 surrounding the focal region 420 with the cursor 401, a fold icon 470 may be displayed over the point 471 to replace the cursor 401 or may be displayed in combination with the cursor 401. The fold icon 470 not only informs the user that a point 471 on the bounding rectangle 421 may be selected, but also provides the user with indications as to what fold operations are possible. For example, the fold icon 470 may include arrowheads indicating up, down, left, and right motion. By choosing a point 471, other than a handle 481, 482, on the bounding rectangle 421 a user may control the degree and direction of folding. To control the direction of folding, the user would click on the point 471 and drag in the desired direction of folding. To control the degree of folding, the user would drag to a greater or lesser degree in the desired direction of folding. Once the desired direction and degree of folding is reached, the user would release the mouse button 310. The lens 410 is then locked with the selected fold until a further fold operation is performed.
Magnification (i.e., elevation) of the lens 410 is provided by the magnify lens control element of the GUI. After the lens 410 is selected, the magnify control is presented to the user as a slide bar icon 440 near or adjacent to the lens 410 and typically to one side of the lens 410. Sliding the bar 441 of the slide bar 440 results in a proportional change in the magnification of the lens 410. The slide bar 440 not only informs the user that magnification of the lens 410 may be selected, but also provides the user with an indication as to what level of magnification is possible. The slide bar 440 includes a bar 441 that may be slid up and down, or left and right, to adjust and indicate the level of magnification. To control the level of magnification, the user would click on the bar 441 of the slide bar 440 and drag in the direction of desired magnification level. Once the desired level of magnification is reached, the user would release the mouse button 310. The lens 410 is then locked with the selected magnification until a further magnification operation is performed. In general, the focal region 420 is an area of the lens 410 having constant magnification (i.e., if the focal region is a plane). Again referring to FIGS. 1 and 2, magnification of the focal region 420, 233 varies inversely with the distance from the focal region 420, 233 to the reference view plane (RVP) 201. Magnification of areas lying in the shoulder region 430 of the lens 410 also varies inversely with their distance from the RVP 201. Thus, magnification of areas lying in the shoulder region 430 will range from unity at the base 412 to the level of magnification of the focal region 420.
Zoom functionality is provided by the zoom lens control element of the GUI. Referring to FIG. 2, the zoom lens control element, for example, allows a user to quickly navigate to a region of interest 233 within a continuous view of a larger presentation 210 and then zoom in to that region of interest 233 for detailed viewing or editing. Referring to FIG. 4, the combined presentation area covered by the focal region 420 and shoulder region 430 and surrounded by the base 412 may be referred to as the “extent of the lens”. Similarly, the presentation area covered by the focal region 420 may be referred to as the “extent of the focal region”. The extent of the lens may be indicated to a user by a base bounding rectangle 411 when the lens 410 is selected. The extent of the lens may also be indicated by an arbitrarily shaped figure that bounds or is coincident with the perimeter of the base 412. Similarly, the extent of the focal region may be indicated by a second bounding rectangle 421 or arbitrarily shaped figure. The zoom lens control element allows a user to: (a) “zoom in” to the extent of the focal region such that the extent of the focal region fills the display screen 340 (i.e., “zoom to focal region extent”); (b) “zoom in” to the extent of the lens such that the extent of the lens fills the display screen 340 (i.e., “zoom to lens extent”); or, (c) “zoom in” to the area lying outside of the extent of the focal region such that the area without the focal region is magnified to the same level as the extent of the focal region (i.e., “zoom to scale”).
In particular, after the lens 410 is selected, a bounding rectangle icon 411 is displayed surrounding the base 412 and a bounding rectangle icon 421 is displayed surrounding the focal region 420. Zoom functionality is accomplished by the user first selecting the zoom icon 495 through a point and click operation When a user selects zoom functionality, a zoom cursor icon 496 may be displayed to replace the cursor 401 or may be displayed in combination with the cursor 401. The zoom cursor icon 496 provides the user with indications as to what zoom operations are possible. For example, the zoom cursor icon 496 may include a magnifying glass. By choosing a point within the extent of the focal region, within the extent of the lens, or without the extent of the lens, the user may control the zoom function. To zoom in to the extent of the focal region such that the extent of the focal region fills the display screen 340 (i.e., “zoom to focal region extent”), the user would point and click within the extent of the focal region. To zoom in to the extent of the lens such that the extent of the lens fills the display screen 340 (i.e., “zoom to lens extent”), the user would point and click within the extent of the lens. Or, to zoom in to the presentation area without the extent of the focal region, such that the area without the extent of the focal region is magnified to the same level as the extent of the focal region (i.e., “zoom to scale”), the user would point and click without the extent of the lens. After the point and click operation is complete, the presentation is locked with the selected zoom until a further zoom operation is performed.
Alternatively, rather than choosing a point within the extent of the focal region, within the extent of the lens, or without the extent of the lens to select the zoom function, a zoom function menu with multiple items (not shown) or multiple zoom function icons (not shown) may be used for zoom function selection. The zoom function menu may be presented as a pull-down menu. The zoom function icons may be presented in a toolbar or adjacent to the lens 410 when the lens is selected. Individual zoom function menu items or zoom function icons may be provided for each of the “zoom to focal region extent”, “zoom to lens extent”, and “zoom to scale” functions described above. In this alternative, after the lens 410 is selected, a bounding rectangle icon 411 may be displayed surrounding the base 412 and a bounding rectangle icon 421 may be displayed surrounding the focal region 420. Zoom functionality is accomplished by the user selecting a zoom function from the zoom function menu or via the zoom function icons using a point and click operation. In this way, a zoom function may be selected without considering the position of the cursor 401 within the lens 410.
The concavity or “scoop” of the shoulder region 430 of the lens 410 is provided by the scoop lens control element of the GUI. After the lens 410 is selected, the scoop control is presented to the user as a slide bar icon (not shown) near or adjacent to the lens 410 and typically below the lens 410. Sliding the bar (not shown) of the slide bar results in a proportional change in the concavity or scoop of the shoulder region 430 of the lens 410. The slide bar not only informs the user that the shape of the shoulder region 430 of the lens 410 may be selected, but also provides the user with an indication as to what degree of shaping is possible. The slide bar includes a bar that may be slid left and right, or up and down, to adjust and indicate the degree of scooping. To control the degree of scooping, the user would click on the bar of the slide bar and drag in the direction of desired scooping degree. Once the desired degree of scooping is reached, the user would release the mouse button 310. The lens 410 is then locked with the selected scoop until a further scooping operation is performed.
Advantageously, a user may choose to hide one or more lens control icons 450, 412, 411, 421, 481, 482, 491, 440, 495 shown in FIG. 4 from view so as not to impede the user's view of the image within the lens 410. This may be helpful, for example, during an editing or move operation. A user may select this option through means such as a menu, toolbar, or lens property dialog box.
In addition, the GUI 400 maintains a record of control element operations such that the user may restore pre-operation presentations. This record of operations may be accessed by or presented to the user through “Undo” and “Redo” icons 497, 498, through a pull-down operation history menu (not shown), or through a toolbar.
Thus, detail-in-context data viewing techniques allow a user to view multiple levels of detail or resolution on one display 340. The appearance of the data display or presentation is that of one or more virtual lenses showing detail 233 within the context 234 of a larger area view 210. Using multiple lenses in detail-in-context data presentations may be used to compare two regions-of-interest at the same time. Folding enhances this comparison by allowing the user to pull the regions-of-interest closer together. Moreover, using detail-in-context technology, a region-of-interest can be magnified to pixel level resolution, or to any level of detail available from the source information, for in-depth review. The digital images may include graphic images, maps, photographic images, or text documents, and the source or original information may be in raster, vector, or text form.
For example, in order to view a selected object or region-of-interest in detail, a user can define a lens 410 over the object or region-of-interest using the GUI 400. The lens 410 may be introduced to the original image to form the a presentation through the use of a pull-down menu selection, tool bar icon, etc. Using lens control elements for the GUI 400, such as move, pickup, resize base, resize focus, fold, magnify, zoom, and scoop, as described above, the user adjusts the lens 410 for detailed viewing of the object or region-of-interest. Using the magnify lens control element, for example, the user may magnify the focal region 420 of the lens 410 to pixel quality resolution revealing detailed information pertaining to the selected object or region-of-interest. That is, a base image (i.e., the image outside the extent of the lens) is displayed at a low resolution while a lens image (i.e., the image within the extent of the lens) is displayed at a resolution based on a user selected magnification 440, 441.
In operation, the data processing system 300 employs EPS techniques with an input device 310 and GUI 400 for selecting objects or regions-of-interest for detailed display to a user on a display screen 340. Data representing an original image or representation is received by the CPU 320 of the data processing system 300. Using EPS techniques, the CPU 320 processes the data in accordance with instructions received from the user via an input device 310 and GUI 400 to produce a detail-in-context presentation. The presentation is presented to the user on a display screen 340. It will be understood that the CPU 320 may apply a transformation to the shoulder region 430 surrounding the region-of-interest 420 to affect blending or folding in accordance with EPS techniques. For example, the transformation may map the region-of-interest 420 and/or shoulder region 430 to a predefined lens surface 230, defined by a transformation or distortion function and having a variety of shapes, using EPS techniques. Or, the lens 410 may be simply coextensive with the region-of-interest 420.
The lens control elements of the GUI 400 are adjusted by the user via an input device 310 to control the characteristics of the lens 410 in the detail-in-context presentation. Using an input device 310 such as a mouse, a user adjusts parameters of the lens 410 using icons and scroll bars of the GUI 400 that are displayed over the lens 410 on the display screen 340. The user may also adjust parameters of the image of the full scene. Signals representing input device 310 movements and selections are transmitted to the CPU 320 of the data processing system 300 where they are translated into instructions for lens control.
Moreover, the lens 410 may be added to the presentation before or after the object or region-of-interest is selected. That is, the user may first add a lens 410 to a presentation or the user may move a pre-existing lens into place over the selected object or region-of-interest. The lens 410 may be introduced to the original image to form the presentation through the use of a pull-down menu selection, tool bar icon, etc.
Advantageously, by using a detail-in-context lens 410 to select an object or region-of-interest for detailed information gathering, a user can view a large area (i.e., outside the extent of the lens 410) while focusing in on a smaller area (i.e., within the focal region 420 of the lens 410) including and/or surrounding the selected object or region-of-interest. This makes it possible for a user to accurately gather detailed information without losing visibility or context of the portion of the original image surrounding the selected object or region-of-interest.
As mentioned above, the growth of the Internet and online map presentation technologies has resulted in broad availability of online and interactive presentation of maps and geographically relevant photographic images. Similarly, geospatial software applications and online services such as Google Earth™ have provided online access to photorealistic representations of cities, in some cases with knowledge of the locations and representative geometry of buildings. However, in such urban landscape presentations, one of the areas of concern is occlusion of buildings or other entities of interest (i.e., regions-of-interest, objects-of-interest) to the user by buildings that are in the line of sight between the user and a building that may be of interest. For example, a user may have a potential interest in the existence of a building housing a bookstore or coffee shop on the next block but may not be aware of it because of buildings near his present viewing location that occlude the building of potential interest. Various approaches to occlusion resolution have been attempted for 3D visualization, such as the 3D lens approach of Cowperthwaite (see U.S. Pat. No. 6,798,412 to Cowperthwaite, which is incorporated herein by reference) and the building height adjustment of Yano (see U.S. Pat. No. 5,999,879 to Yano, which is incorporated herein by reference). However, these approaches cause displacements of building locations and/or building height adjustments that can be very disorienting to the user, and can be expensive in terms of the required computations.
The present invention provides a method of reducing or eliminating occlusion in such urban landscape presentations so as to reveal a building or region-of-interest, without the need for the user to change viewing location. The method is efficient in graphical operations for the purpose of interactive performance on geometric models of urban landscapes. The method provides efficient modification of building rendering order and geometry, and a virtual lens-mediated variable transparency, in order to reduce or eliminate occlusion.
FIG. 5 is a screen capture illustrating a city block within an urban landscape representation 500 in accordance with an embodiment of the invention. FIG. 5 shows a representation (or original image) of a view of buildings within a city, wherein the buildings (e.g., 501) in the line of sight of the user and close to the viewpoint of the user block the view of buildings (e.g., 601 in FIG. 6) located at a greater distance from the viewpoint. In FIG. 5, the user's viewpoint is situated at a particular city block within an urban landscape representation. The user is unable to view buildings 601 of potential interest on adjacent blocks due to occlusion by the buildings 501 located immediately in front of the viewpoint (i.e., in the foreground 510).
FIG. 6 is a screen capture illustrating a presentation 600 in which a detail-in-context transparency lens 610 has been applied to the representation 500 of FIG. 5 to reduce occlusion of a region-of-interest 601, in accordance with an embodiment of the invention. In FIG. 6, application of the transparency lens 610 reveals buildings 601 on adjacent blocks through controlled application of transparency as specified by the lens 610, without a change in the viewpoint of the user.
According to the present invention, the original landscape geometry (i.e., the original image or geometry of buildings) 500 is first converted into a mesh of convex polygons in which each building 501, 601 has its own polygon. (This step is unnecessary if the landscape geometry is already essentially in this form.) This allows an efficient search for nearby buildings 601, such that the neighbourhood representation can later be rendered in far to near order. The buildings 501, 601 are then sliced into slices normal to the z (height) axis and an opacity or transparency (“alpha value”) is applied as a function of depth into the landscape 500. The alpha value is also varied in z to provide a smooth transparency transition 630 to the buildings 501 in the foreground 510 to preserve the user's awareness of the original foreground buildings 501. The visual appearance is that of a one-dimensional lens such as a one-dimensional Elastic Presentation Space lens (see U.S. Pat. No. 6,768,497 to Baar, which is incorporated herein by reference), with the focal region 620 for the region-of-interest 601 having maximum alpha and the shoulder region or regions 630 providing a gradual transition into the foreground 510. (Higher dimensional lenses can also be applied, at the expense of more complex computations.) If desired, a magnification of the focal region 620 can also be generated as described above. Through the result of the slicing operation, the lens shoulders 630 can efficiently be assigned decreasing alpha values with vertical distance from the focal region 620, to present an apparently smoothly varying transparency transition to the foreground 510 for the user. Maximum alpha is constant in FIG. 6 but can vary with depth.
According to one embodiment, the alpha value may be adjusted with a lens control element of the GUI 400. That is, the transparency of the lens 610 may be provided by a transparency lens control element of the GUI 400. For example, after the lens 610 is selected, the transparency control may be presented to the user as a slide bar icon (not shown but similar to 440) near or adjacent to the lens 610 and typically to one side of the lens 610. Sliding the bar (not shown but similar to 441) of the slide bar results in a proportional change in the alpha value or transparency of the lens 610. Of course, the alpha value/transparency may be adjusted through other means such as by selection from a menu, etc.
According to one embodiment, the original image or representation is a computer aided design (“CAD”) image. The CAD image may include an image of a three-dimensional (“3D”) mechanical assembly, etc. In this case, rather than a first building occluding a second building as in an urban landscape image (e.g., 500), a first component of the mechanical assembly may occlude a second component in the image of the mechanical assembly. The transparency lens method for occlusion resolution or reduction described above may be used for such 3D CAD images.
Aspects of the above described method may be summarized with the aid of a flowchart. FIG. 7 is a flow chart illustrating operations 700 of modules 331 within the memory 330 of a data processing system 300 for generating a presentation 600 of a region-of-interest 601 within an original image 500 for display on a display screen 340, the region-of-interest 601 being at a depth within the original image 500 and being occluded by a portion 501 of the original image 500 at a lesser depth, in accordance with an embodiment of the invention.
At step 701, the operations 700 start.
At step 702, graduated transparency 610 is applied to the original image 500 to generate the presentation 600, the graduated transparency 610 reducing occlusion of the region-of-interest 601 by making transparent at least some of the portion 501 of the original image 500 occluding the region-of-interest 601, the graduated transparency 610 when applied renders within the presentation 600 a focal region 620 having a maximum level of transparency at the depth of and for the region-of-interest 601 at least partially surrounded by a shoulder region 630 where transparency decreases with lessening depth from the maximum level to that of the original image 500 surrounding the shoulder region 630 to provide context for the focal region 620 with respect to the original image 500.
At step 703, the presentation 600 is displayed on the display screen 340.
At step 706, the operations 700 end.
In the above method, the region-of-interest may be a first object 601 and the portion of the original image at the lesser depth may be a second object 501. The first and second objects 501, 601 may be modelled as first and second convex polygons, respectively. The method may further include dividing the second polygon into one or more slices, each slice being made at a respective depth into the representation 500. The method may further include assigning each slice a respective level of transparency that increases with depth to thereby apply the graduated transparency 610. The original image may be an urban landscape image 500. The first and second objects may be first and second buildings 501, 601, respectively. The method may further include receiving a signal for adjusting the maximum level of transparency in the focal region 620. The signal for adjusting the maximum level of transparency may be received through a slide bar icon (e.g., similar to 440, 441). The maximum level of transparency may be fully transparent. The method may further include receiving a signal for adjusting the transparency in the shoulder region 630 (i.e., the rate of decrease of transparency or the scoop of the transparency lens). The signal for adjusting the transparency may be received through a slide bar icon. The method may further include receiving a signal for adjusting an extent of the focal region 620. The signal for adjusting the extent of the focal region 620 may be received through at least one handle icon 481, 482 positioned on a perimeter of the focal region 620. The method may further include receiving a signal for adjusting an extent of the shoulder region 630. The signal for adjusting the extent of the shoulder region may be received through at least one handle icon 491 positioned on a perimeter of the shoulder region 630. The focal region 620 may include a magnification for the region-of-interest 601 and the magnification may decrease in the shoulder region 630 to that of the original image 500 surrounding the shoulder region 630. The method may further include receiving a signal for adjusting the magnification. The signal for adjusting the magnification may be received through a slide bar icon 440, 441. The original image 500 may be a computer aided design (“CAD”) image. And, the CAD image 500 may be an image of a three-dimensional mechanical assembly and the first and second objects 501, 601 may be first and second components, respectively, of the mechanical assembly.
While this invention is primarily discussed as a method, a person of ordinary skill in the art will understand that the apparatus discussed above with reference to a data processing system 300, may be programmed to enable the practice of the method of the invention. Moreover, an article of manufacture for use with a data processing system 300, such as a pre-recorded storage device or other similar computer readable medium including program instructions recorded thereon, may direct the data processing system 300 to facilitate the practice of the method of the invention. It is understood that such apparatus and articles of manufacture also come within the scope of the invention.
In particular, the sequences of instructions which when executed cause the method described herein to be performed by the data processing system 300 can be contained in a data carrier product according to one embodiment of the invention. This data carrier product can be loaded into and run by the data processing system 300. In addition, the sequences of instructions which when executed cause the method described herein to be performed by the data processing system 300 can be contained in a computer software product according to one embodiment of the invention. This computer software product can be loaded into and run by the data processing system 300. Moreover, the sequences of instructions which when executed cause the method described herein to be performed by the data processing system 300 can be contained in an integrated circuit product (e.g., a hardware module or modules) including a coprocessor or memory according to one embodiment of the invention. This integrated circuit product can be installed in the data processing system 300.
The embodiments of the invention described above are intended to be exemplary only. Those skilled in the art will understand that various modifications of detail may be made to these embodiments, all of which come within the scope of the invention.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US320154624 Jul 196117 Aug 1965Hart Mfg Canada LtdPower controlling device for electrical heating elements
US37049381 Oct 19705 Dec 1972Fanselow HymanPunch card viewer
US373973924 Aug 197219 Jun 1973Brase RInstrument for isolating rows of printed matter for reading
US376279927 Aug 19712 Oct 1973Shapiro JMagnifying indicator for a burette
US458164710 Sep 19848 Apr 1986Vye Richard AComputerized automatic focusing control system for multiple television cameras
US463011015 Feb 198416 Dec 1986Supervision Control Systems, Inc.Surveillance system
US468818130 Apr 198618 Aug 1987International Business Machines CorporationImage transformations on an interactive raster scan or matrix display
US475761626 Oct 198719 Jul 1988Educational InsightsRuler with magnifying cursor
US479002812 Sep 19866 Dec 1988Westinghouse Electric Corp.Method and apparatus for generating variably scaled displays
US480037930 Apr 198724 Jan 1989Crosfield Electronics LimitedImage display with movable magnification
US48857029 Nov 19885 Dec 1989Sony CorporationMethod of forming curved surfaces and the apparatus
US48887135 Sep 198619 Dec 1989Cdi Technologies, Inc.Surface detail mapping system
US497002822 Sep 198813 Nov 1990Lever Brothers CompanyComposition for softening fabrics
US49858499 Jun 198815 Jan 1991Canon Kabushiki KaishaImage processing system for forming a slantwise-mapped or rotated modified image of an original image
US499286629 Jun 198912 Feb 1991Morgan Jack BCamera selection and positioning system and method
US503191824 Apr 199016 Jul 1991Fred Silber CompamyMagnifying marker for a game board
US504807725 Jul 198810 Sep 1991Reflection Technology, Inc.Telephone handset with full-page visual display
US517580812 Sep 198929 Dec 1992PixarMethod and apparatus for non-affine image warping
US518559923 Jul 19909 Feb 1993Tektronix, Inc.Local display bus architecture and communications method for Raster display
US518566713 May 19919 Feb 1993Telerobotics International, Inc.Omniview motionless camera orientation system
US520081822 Mar 19916 Apr 1993Inbal NetaVideo imaging system with interactive windowing capability
US52067218 Mar 199027 Apr 1993Fujitsu LimitedTelevision conference system
US522777110 Jul 199113 Jul 1993International Business Machines CorporationMethod and system for incrementally changing window size on a display
US525093431 Dec 19905 Oct 1993Xerox CorporationMethod and apparatus for thinning printed images
US525883719 Oct 19922 Nov 1993Zandar Research LimitedMultiple security video display
US526968716 Feb 199314 Dec 1993Atari Games CorporationSystem and method for recursive driver training
US527501916 Jun 19924 Jan 1994C.T.P. S.P.A.Functional ring
US530927921 Aug 19923 May 1994Halstead Madeline CScript view a curved convex magnifying device
US532180727 Nov 199114 Jun 1994Mumford Christopher JAccelerated graphics display method
US532931030 Jun 199212 Jul 1994The Walt Disney CompanyMethod and apparatus for controlling distortion of a projected image
US53414669 May 199123 Aug 1994New York UniversityFractal computer user centerface with zooming capability
US53695273 Dec 199229 Nov 1994Mccracken; RobertMelanoma detection device
US541690023 Mar 199316 May 1995Lotus Development CorporationPresentation manager
US54328951 Oct 199211 Jul 1995University Corporation For Atmospheric ResearchVirtual reality imaging system
US54519984 Apr 199419 Sep 1995Hamrick; Daniel C.Home shopping video catalog
US545948818 Jul 199117 Oct 1995Robert Bosch GmbhGraphical user interface with fisheye adaptation principle
US547374029 Dec 19935 Dec 1995International Business Machines CorporationMethod and apparatus for interactively indicating image boundaries in digital image cropping
US552163417 Jun 199428 May 1996Harris CorporationAutomatic detection and prioritized image transmission system and method
US552378312 Jul 19934 Jun 1996Fuji Photo Optical Co., Ltd.Pan head control system for TV camera
US552828917 Jan 199518 Jun 1996Videoconferencing Systems, Inc.Method for automatically adjusting a videoconferencing system camera to center an object
US55395341 Jun 199323 Jul 1996Hitachi, Ltd.Method of scaling an image capable of line width preservation
US558167021 Jul 19933 Dec 1996Xerox CorporationUser interface having movable sheet with click-through tools
US558397721 Oct 199310 Dec 1996Taligent, Inc.Object-oriented curve manipulation system
US55880987 Jun 199524 Dec 1996Apple Computer, Inc.Method and apparatus for direct manipulation of 3-D objects on computer displays
US559485921 Feb 199514 Jan 1997Digital Equipment CorporationGraphical user interface for video teleconferencing
US559669021 Jul 199321 Jan 1997Xerox CorporationMethod and apparatus for operating on an object-based model data structure to produce a second image in the spatial context of a first image
US559829717 Aug 199428 Jan 1997Sharp Kabushiki KaishaImage display unit
US561065324 Apr 199511 Mar 1997Abecassis; MaxMethod and system for automatically tracking a zoomed video image
US56130322 Sep 199418 Mar 1997Bell Communications Research, Inc.System and method for recording, playing back and searching multimedia events wherein video, audio and text can be searched and retrieved
US563852313 Nov 199510 Jun 1997Sun Microsystems, Inc.Method and apparatus for browsing information in a computer database
US564475813 Dec 19941 Jul 1997Microsoft CorporationBitmap block transfer image conversion
US565110716 Aug 199422 Jul 1997Sun Microsystems, Inc.Method and apparatus for presenting information in a display system using transparent windows
US565285121 Jul 199329 Jul 1997Xerox CorporationUser interface technique for producing a second image in the spatial context of a first image using a model-based operation
US56572467 Mar 199512 Aug 1997Vtel CorporationMethod and apparatus for a video conference user interface
US567098426 Oct 199323 Sep 1997Xerox CorporationImage lens
US568052423 Sep 199621 Oct 1997Sandia CorporationSynthetic environment employing a craft for providing user perspective reference
US568248920 Dec 199428 Oct 1997Digital Equipment Corporation, Inc.Method and device for monitoring, manipulating, and viewing system information
US568928722 Jan 199618 Nov 1997Xerox CorporationContext-preserving display system using a perspective sheet
US568962814 Apr 199418 Nov 1997Xerox CorporationCoupling a display object to a viewpoint in a navigable workspace
US572185328 Apr 199524 Feb 1998Ast Research, Inc.Spot graphic display element with open locking and periodic animation
US57296737 Apr 199517 Mar 1998Avid Technology, Inc.Direct manipulation of two-dimensional moving picture streams in three-dimensional space
US573180525 Jun 199624 Mar 1998Sun Microsystems, Inc.Method and apparatus for eyetrack-driven text enlargement
US574227229 Apr 199621 Apr 1998Ati Technologies Inc.Accelerated full screen video playback
US574516628 Jul 199528 Apr 1998Maxpro Systems Pty LtdVideo security system field of the invention
US575128916 Jan 199612 May 1998University Corporation For Atmospheric ResearchVirtual reality imaging system with image replay
US575434814 May 199619 May 1998Planetweb, Inc.Method for context-preserving magnification of digital image regions
US576413922 Oct 19969 Jun 1998Toyota Jidosha Kabushiki KaishaInformation display apparatus for vehicles
US57868143 Nov 199528 Jul 1998Xerox CorporationComputer controlled display system activities using correlated graphical and timeline interfaces for controlling replay of temporal data representing collaborative activities
US579875227 Feb 199525 Aug 1998Xerox CorporationUser interface having simultaneously movable tools and cursor
US58086706 Sep 199515 Sep 1998Nec System Integration & Construction, Ltd.Method and system for camera control with monitoring area view
US581211131 Jul 199522 Sep 1998Nec CorporationBifocal picture display system
US581845526 Apr 19956 Oct 1998Xerox CorporationMethod and apparatus for operating on the model data structure of an image to produce human perceptible output using a viewing operation region having explicit multiple regions
US584823124 Dec 19968 Dec 1998Teitelbaum; NeilSystem configuration contingent upon secure input
US585244018 Sep 199622 Dec 1998International Business Machines CorporationMethod and system for facilitating the selection of icons
US58729228 Aug 199716 Feb 1999Vtel CorporationMethod and apparatus for a video conference user interface
US590921919 Nov 19971 Jun 1999Cirrus Logic, Inc.Embedding a transparency enable bit as part of a resizing bit block transfer operation
US592336417 Apr 199813 Jul 1999Maxpro Systems Pty LtdVideo security system
US592620914 Jul 199520 Jul 1999Sensormatic Electronics CorporationVideo camera apparatus with compression system responsive to video camera adjustment
US594943020 May 19977 Sep 1999Microsoft CorporationPeripheral lenses for simulating peripheral vision on a display device
US595021612 Nov 19967 Sep 1999International Business Machines CorporationMethod and system for marking and subsequently retrieving a collection of objects within a multipage compound document utilizing selectable page numbered dialog boxes
US595960522 Nov 199528 Sep 1999Picker International, Inc.Video magnifier
US596970615 Oct 199619 Oct 1999Sharp Kabushiki KaishaInformation retrieval apparatus and method
US597369421 Apr 199826 Oct 1999Chatham Telecommunications, Inc.,Method of communication using sized icons, text, and audio
US59918773 Apr 199723 Nov 1999Lockheed Martin CorporationObject-oriented trusted application framework
US599987918 Apr 19977 Dec 1999Pioneer Electronic CorporationNavigation apparatus with shape change display function
US60056114 Aug 199821 Dec 1999Be Here CorporationWide-angle image dewarping method and apparatus
US603793927 Sep 199614 Mar 2000Sharp Kabushiki KaishaMethod for enabling interactive manipulation of data retained in computer system, and a computer system for implementing the method
US605211011 May 199818 Apr 2000Sony CorporationDynamic control of zoom operation in computer graphics
US605784428 Apr 19972 May 2000Adobe Systems IncorporatedDrag operation gesture controller
US606440128 May 199816 May 2000Ncr CorporationUser interface controls for adjusting the display of multi-dimensional graphical plots
US606737218 Feb 199823 May 2000University Of PittsburghMethod and system to enhance robust identification of abnormal regions in radiographs
US607250127 Jun 19976 Jun 2000Xerox CorporationMethod and apparatus for composing layered synthetic graphics filters
US607303628 Apr 19976 Jun 2000Nokia Mobile Phones LimitedMobile station with touch input having automatic symbol magnification function
US607553115 Dec 199713 Jun 2000International Business Machines CorporationComputer system and method of manipulating multiple graphical user interface components on a computer display with a proximity pointer
US608127725 Sep 199627 Jun 2000Sony CorporationApparatus and method for controlling image display
US608459823 Apr 19984 Jul 2000Chekerylla; JamesApparatus for modifying graphic images
US60917711 Aug 199718 Jul 2000Wells Fargo Alarm Services, Inc.Workstation for video security system
US61080054 Aug 199722 Aug 2000Space CorporationMethod for producing a synthesized stereoscopic image
US612802418 Dec 19973 Oct 2000Hewlett-Packard CompanyPolar controller for defining and generating spiral-like shapes
Non-Patent Citations
Reference
1"Advisory Action", U.S. Appl. No. 10/705,199, (Aug. 18, 2009), 5 pages.
2"Advisory Action", U.S. Appl. No. 11/249,493, (Aug. 11, 2009), 5 pages.
3"Advisory Action", U.S. Appl. No. 11/249,493, (Sep. 14, 2009), 4 pages.
4"Advisory Action", U.S. Appl. No. 11/541,778, (Feb. 11, 2010), 3 pages.
5"Advisory Action", U.S. Appl. No. 11/673,038, (Mar. 25, 2010), 3 pages.
6"Advisory Action", U.S. Appl. No. 11/935,222, (Feb. 4, 2010), 3 pages.
7"Final Office Action", U.S. Appl. No. 11/159,205, (Mar. 25, 2010), 16 pages.
8"Final Office Action", U.S. Appl. No. 11/159,205, (Oct. 6, 2010), 16 pages.
9"Final Office Action", U.S. Appl. No. 11/541,778, (Dec. 4, 2009), 12 pages.
10"Final Office Action", U.S. Appl. No. 11/673,038, (Jan. 8, 2010), 33 pages.
11"Final Office Action", U.S. Appl. No. 11/691,686, (Nov. 22, 2010), 16 pages.
12"Final Office Action", U.S. Appl. No. 11/691,686, (Sep. 1, 2010), 16 pages.
13"Final Office Action", U.S. Appl. No. 11/935,222, (Nov. 24, 2009), 8 pages.
14"Final Office Action", U.S. Appl. No. 12/368,263, (Nov. 5, 2010), 7 pages.
15"Final Office Action", U.S. Appl. No. 12/764,724, (Nov. 9, 2010), 21 pages.
16"Foreign Office Action", Application Serial No. 2002-536993, (Mar. 11, 2009), 2 pages.
17"Non Final Office Action", U.S. Appl. No. 10/358,394, (Mar. 13, 2009).
18"Non Final Office Action", U.S. Appl. No. 11/236,694, (Oct. 13, 2010), 16 pages.
19"Non Final Office Action", U.S. Appl. No. 11/541,778, (Sep. 29, 2010), 10 pages.
20"Non Final Office Action", U.S. Appl. No. 11/542,120, (Jan. 22, 2009), 20 pages.
21"Non Final Office Action", U.S. Appl. No. 11/691,686, (Mar. 18, 2010), 17 pages.
22"Non-Final Office Action", U.S. Appl. No. 10/705,199, (May 12, 2009), 46 pages.
23"Non-Final Office Action", U.S. Appl. No. 11/138,979, (Sep. 17, 2010), 11 pages.
24"Non-Final Office Action", U.S. Appl. No. 11/159,205, (Jul. 27, 2009), 28 pages.
25"Non-Final Office Action", U.S. Appl. No. 11/236,694, (Apr. 20, 2010), 9 pages.
26"Non-Final Office Action", U.S. Appl. No. 11/410,024, (Jul. 20, 2009), 27 pages.
27"Non-Final Office Action", U.S. Appl. No. 11/410,024, (Mar. 11, 2009), 35 pages.
28"Non-Final Office Action", U.S. Appl. No. 11/541,778, (Jun. 19, 2009), 36 pages.
29"Non-Final Office Action", U.S. Appl. No. 11/673,038, (Jul. 13, 2009), 45 pages.
30"Non-Final Office Action", U.S. Appl. No. 11/673,038, (Jul. 22, 2010), 39 pages.
31"Non-Final Office Action", U.S. Appl. No. 11/935,222, (Feb. 20, 2009), 12 pages.
32"Non-Final Office Action", U.S. Appl. No. 12/364,450, (Sep. 30, 2009), 10 pages.
33"Non-Final Office Action", U.S. Appl. No. 12/368,263, (Apr. 30, 2010), 8 pages.
34"Non-Final Office Action", U.S. Appl. No. 12/368,267, (Jun. 11, 2010), 12 pages.
35"Non-Final Office Action", U.S. Appl. No. 12/388,437, (Jun. 23, 2010), 7 pages.
36"Non-Final Office Action", U.S. Appl. No. 12/764,724, (Jul. 1, 2010), 20 pages.
37"Notice of Allowability", U.S. Appl. No. 12/364,450, (Jun. 18, 2010), 2 pages.
38"Notice of Allowance", U.S. Appl. No. 10/358,394, (Oct. 8, 2009), 8 pages.
39"Notice of Allowance", U.S. Appl. No. 10/705,199, (Mar. 10, 2010), 18 pages.
40"Notice of Allowance", U.S. Appl. No. 11/214,886, (Dec. 15, 2009), 16 pages.
41"Notice of Allowance", U.S. Appl. No. 11/410,024, (Jan. 4, 2010), 7 pages.
42"Notice of Allowance", U.S. Appl. No. 12/364,450, (Apr. 19, 2010), 4 pages.
43"Presentation for CGDI Workshop", Retrieved from: http://www.geoconnections.org/developersCorner/devCornerdevNetwork/meetings/2002.05.30/IDELIX CGDI 20020530 dist.pdf, (May 2002).
44"Restriction Requirement", U.S. Appl. No. 11/935,222, (Aug. 20, 2009), 6 pages.
45"Restriction Requirement", U.S. Appl. No. 12/368,263, (Mar. 9, 2010), 7 pages.
46Baudisch, P. et al., ""Drag-And-Pop: Techniques for Accessing Remote Screen Content on Touch-And-Pen-Operated Systems"", Ineract '03, (2003).
47Baudisch, P. et al., ""Halo: a Technique For Visualizing Off-Screen Locations"", CHI; (Apr. 5-10, 2003).
48Bier, Eric A., et al., "The Movable Filter as a User Interface Tool-The Video", Conference on Human Factors in Computing Systems Conference companion on Human factors in computing systems, (1995), pp. 413-414.
49Bier, Eric A., et al., "Toolglass and Magic Lenses-The See-Through Interface", Conference on Human Factors in Computing Systems Conference companion on Human factors in computing systems, (1994), pp. 445-446.
50Bier, Eric A., et al., "Toolglass and Magic Lenses-The See-Through Interface", International Conference on Computer Graphics and Interactive Techniques Proceedings of the 20th annual conference on Computer graphics and interactive techniques, (1993), pp. 73-80.
51Bier, Eric A., et al., "The Movable Filter as a User Interface Tool—The Video", Conference on Human Factors in Computing Systems Conference companion on Human factors in computing systems, (1995), pp. 413-414.
52Bier, Eric A., et al., "Toolglass and Magic Lenses—The See-Through Interface", Conference on Human Factors in Computing Systems Conference companion on Human factors in computing systems, (1994), pp. 445-446.
53Bier, Eric A., et al., "Toolglass and Magic Lenses—The See-Through Interface", International Conference on Computer Graphics and Interactive Techniques Proceedings of the 20th annual conference on Computer graphics and interactive techniques, (1993), pp. 73-80.
54Boots, B.N., "Delauney Triangles: An Alternative Approach to Point Pattern Analysis", Proc. Assoc. Am. Geogr. 6, (1974), p. 26-29.
55Bossen, F. J., ""Anisotropic Mesh Generation With Particles"", Technical Report CMU-CS-96-134, CS Dept, Carnegie Mellon University; (May 1996).
56Bossen, F. J., et al., ""A Pliant Method for Anisotropic Mesh Generation"", 5th Intl. Meshing Roundtable; (Oct. 1996), pp. 63-74.
57Bouju, A. et al., ""Client-Server Architecture for Accessing Multimedia and Geographic Databases within Embedded Systems"", Database and Expert Systems Applications, 1999 Proceedings, Tenth International Workshop on Florence, Italy Sep. 1-3, 1999, Los Alamitos, CA, USA, IEEE Comput. Soc., US, XP010352370; ISBN: 0-7695-0281-4, abstract, figure 2, (Sep. 1-3, 1999), pp. 760-764.
58BPAI Decision, U.S. Appl. No. 10/682,298, (Dec. 30, 2009), 14 pages.
59Carpendale, et al., "Graph Folding: Extending Detail an Context Viewing into a Tool for Subgraph Comparisons", In Proceedings of Graph Drawing 1995, Passau, Germany, (1995), pp. 127-139.
60Carpendale, et al., ""3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information"", Proceedings of the 8th annual ACM symposium on User interface and software technology; (Dec. 1995).
61Carpendale, M S T et al., ""Extending distortion viewing from 2D to 3D"" IEEE Computer Graphics and Applications, IEEE Inc. New York, US, vol. 17, No. 4; XP000927815, ISSN: 0272-1716, (Jul. 1997), pp. 42-51.
62Carpendale, M. Sheelagh T., "A Framework for Elastic Presentation Space", Thesis Simon Fraser University, XP001051168; Chapter 3-5; appendix A,B; (Mar. 1999), pp. 1-271.
63Carpendale, M. Sheelagh T., et al., ""3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information"", UIST '95, 8th Annual Symposium on User Interface Software and technology, Proceedings Of The ACM Symposium On User Interface Software and Technology, Pittsburgh, PA, ACM Symposium On User Interface Software and Technology, New York) (1995-, (Nov. 14-17, 1995), pp. 217-226.
64Carpendale, M.S.T. ""A Framework for Elastic Presentation Space"", Thesis Simon Fraser University, XP001051168; cited in the application, Chapter 3-5; appendix A,B; (Mar. 1999), pp. 1-271.
65Carpendale, M.S.T. "A Framework for Elastic Presentation Space", http://pages.cpsc.ucalgary.ca/~sheelagh/personal/thesis/, (Nov. 19, 1999).
66Carpendale, M.S.T. "A Framework for Elastic Presentation Space", PhD thesis, Simon Fraser University; (1999), pp. 69, 72, 78-83, 98-100, 240, and 241.
67Carpendale, M.S.T. "A Framework for Elastic Presentation Space", http://pages.cpsc.ucalgary.ca/˜sheelagh/personal/thesis/, (Nov. 19, 1999).
68Carpendale, M.S.T. et al., ""A Framework for Unifying Presentation Space-, 01UIST, Proceedings of the 14th Annual ACM Symposium on User Interface Software and Technology, Proceedings of UIST '01: ACM Symposium on User Interface Software and Technology, Orlando, FL, USA; XP002249323 2001, New York, NY, USA, ISBN: 1-58113-438-X, (Nov. 14, 2001), pp. 61-70; p. 64.
69Carpendale, M.S.T. et al., ""Exploring Distinct Aspects of the Distortion Viewing Paradigm"", Technical Report TR 97-08, School of Computer Science, Simon Fraser University, Burnaby, British Columbia, Canada; (Sep. 1997).
70Carpendale, M.S.T. et al., ""Making Distortions Comprehensible"", Visual Languages, Proceedings, 1997 IEEE Symposium On Isle of Capri, Italy, Sep. 23-26, 1997, Los Alamitos, CA, USA, IEEE Comput. Soc., US, Sep. 23, 1997; XP010250566, ISBN: 0-8186-8144-6, (Sep. 23-26, 1997), pp. 35-45.
71Carpendale, M.S.T. et al., ""A Framework for Unifying Presentation Space—, 01UIST, Proceedings of the 14th Annual ACM Symposium on User Interface Software and Technology, Proceedings of UIST '01: ACM Symposium on User Interface Software and Technology, Orlando, FL, USA; XP002249323 2001, New York, NY, USA, ISBN: 1-58113-438-X, (Nov. 14, 2001), pp. 61-70; p. 64.
72Carpendale, Marianne S. T., "A Framework for Elastic Presentation Space", (Burnaby, British Columbia: Simon Fraser University, 1999).
73Cowperthwaite, David J., ""Occlusion Resolution Operators for Three-Dimensional Detail-In-Context"", Burnaby, British Columbia: Simon Fraser University; (2000).
74Cowperthwaite, David J., et al., ""Visual Access for 3D Data"", in Proceedings of ACM CHI 96 Conference on Human Factors in Computer Systems, vol. 2 of Short Papers: Alternative Methods of Interaction; (1996), pp. 175-176.
75Deng, K. et al., ""Texture Mapping with a Jacobian-Based Spatially-Variant Filter",", Proceedings 10th Pacific Conference on Computer Graphics and Applications, Beijing, China, 2002 Los Alamitos, CA, USA, IEEE Comput. Soc., USA; XP00224932, ISBN; 0-7695-1784-6 the whole document, (Oct. 9-11, 2002), pp. 460-461.
76Dursteler, Juan C., "The digital magazine of InfoVis.net", Retrieved from: http://www.infovis.net/printMag.php? num=85&lang=2; (Apr. 22, 2002).
77Electronic Magnifying Glasses, IBM Technical Disclosure Bulletin, IBM Corp., New York, US, vol. 37, No. 3; XP000441501, ISSN: 0018-8689 the whole document; (Mar. 1, 1994), pp. 353-354.
78Fitzmaurice, G. et al., ""Tracking Menus"", UIST; (2003), pp. 71-79.
79Ikedo, T ""A Realtime Video-Image Mapping User Polygon Rendering Techniques"", IEEE Intl. conf on Ottawa, ONT, Canada Jun. 3-6, 1997, Los Alamitos, CA, USA; IEE Comput. Soc, US, XP010239181, ISBN: 0-8186-7819-4 Sections 2, 4.4; Multimedia Computing and Systems '97 Proceedings, (Jun. 3, 1997), pp. 127-134.
80Ito, Minoru et al., ""A Three-Level Checkerboard Pattern (TCP) Projection Method for Curved Surface Measurement"", Pattern Recognition, Pergamon Press Inc., Elmsford, N.Y., US vol. 28, No. 1; XP004014030, ISSN 0031-3203, (1995), pp. 27-40.
81Kamba, Tomonari, et al., "Using Small Screen Space More Efficiently", CHI 96 Vancouver, BC Canada, (1996), pp. 383-390.
82Keahey, T A., et al., ""Nonlinear Magnification Fields"", Information Visualization, 1997, Proceedings IEEE Symposium On Phoenix, AZ, USA, Los Alamitos, CA, USA, IEEE Comput. Soc., US; XP010257169; ISBN: 0-8186-8189-6, (Oct. 20-21, 1997), pp. 51-58 and 121.
83Keahey, T. A., ""Visualization of High-Dimensional Clusters Using Non-Linear Magnification"", Technical Report LA-UR-98-2776, Los Alamos National Laboratory; (1998).
84Keahey, T.A., ""Getting Along: Composition of Visualization Paradigms"", Visual Insights, Inc.; (2001).
85Keahey, T.A., ""the Generalized Detail-In-Context Problem"", Information Visualization 1998, Proceedings; IEEE Symposium On Research Triangle, CA, USA; Los Alamitos, CA, USA, IEEE Comput. Soc., US; XP-010313304; ISBN: 0-8186-9093, (Oct. 19-20, 1998), pp. 44-51, 152.
86Keahey, T.A., "Nonlinear Magnification", (Indiana University Computer Science), (1997).
87Keahey, T.A., et al. ""Techniques for Non-Linear Magnification Transformation"", Information Visualization '96, Proceedings IEEE Symposium on, San Francisco, CA, Los Alamitos, CA, USA, IEEE Comput. Soc. US, XP010201943; ISBN: 0-8186-7668-X the whole document, (Oct. 28, 1996), pp. 38-45.
88Kline, Richard L., et al., "Improving GUI Accessibility for People with Low Vision", Proceedings of the SIGCHI conference on Human factors in computing systems, (1995), pp. 114-121.
89Kuederle, Oliver ""Presentation of Image Sequences: A Detail-In-Context Approach"", Thesis, Simon Fraser University; (Aug. 2000), pp. 1-3, 5-10, 29-31.
90Lamar, et al., "A Magnification Lens for Interactive Volume Visualization", ACM; pp. 1-10.
91Leung, Y. K., et al. ""A Review and Taxonomy of Distortion-Oriented Presentation Techniques"", ACM Transactions on Computer-Human Interaction, 'Online! vol. 1, No. 2, XP002252314; Retrieved from the Internet: 'retrieved on Aug. 21, 2003! the whole document, (Jun. 1994), pp. 126-160).
92Leung, Y. K., et al. ""A Review and Taxonomy of Distortion-Oriented Presentation Techniques"", ACM Transactions on Computer-Human Interaction, 'Online! vol. 1, No. 2, XP002252314; Retrieved from the Internet: <URL:http://citeseer.nj.nec.com/leung94review.html> 'retrieved on Aug. 21, 2003! the whole document, (Jun. 1994), pp. 126-160).
93Lieberman, Henry "Power of Ten Thousand-Navigating in Large Information Spaces", Proceedings of the 7th annual ACM symposium on User interface software and technology, Marina del Rey, California, United States, (Nov. 1994), pp. 15-16.
94Lieberman, Henry "Power of Ten Thousand—Navigating in Large Information Spaces", Proceedings of the 7th annual ACM symposium on User interface software and technology, Marina del Rey, California, United States, (Nov. 1994), pp. 15-16.
95Microsoft Corp., "Microsoft Paint", Microsoft Corp., (1981-1998), Paint 1-14.
96Mills Michael et al., "A Magnifier Tool for Video Data", Proceedings of the SIGCHI conference on Human factors in computing systems, (1992), pp. 93-96.
97Notice of Allowance, U.S. Appl. No. 11/401,349, (Apr. 17, 2009), 35 pages.
98Perlin, Ken et al., "Pad-an alternative approach to the computer interface", International Conference on Computer Graphics and Interactive Techniques. Proceedings of the 20th annual conference on Computer graphics and interactive techniques., (1993), pp. 57-64.
99Perlin, Ken et al., "Pad—an alternative approach to the computer interface", International Conference on Computer Graphics and Interactive Techniques. Proceedings of the 20th annual conference on Computer graphics and interactive techniques., (1993), pp. 57-64.
100Rauschenbach, U. ""The Rectangular Fish Eye view as an Efficient Method for the Transmission and Display of Large Images"", Image Processing, ICIP 99, Proceedings, 1999 International Conference On, Kobe, Japan, Oct. 24-28, 1999, Piscataway, NJ, USA, IEEE, US, XP010368852, ISBN 0-7803-5467-2 p. 115, left-hand column-p. 116, paragraph 3, p. 118, paragraph 7.1; (1999), pp. 115-119.
101Rauschenbach, U. ""The Rectangular Fish Eye view as an Efficient Method for the Transmission and Display of Large Images"", Image Processing, ICIP 99, Proceedings, 1999 International Conference On, Kobe, Japan, Oct. 24-28, 1999, Piscataway, NJ, USA, IEEE, US, XP010368852, ISBN 0-7803-5467-2 p. 115, left-hand column—p. 116, paragraph 3, p. 118, paragraph 7.1; (1999), pp. 115-119.
102Robertson, et al., ""The Document Lens"", (1993), pp. 101-108.
103Robertson, G et al., "The Document Lens", UIST. Proceedings of the Annual ACM Symposium on User Interface Software and Technology, abstract figures 3,4, (Nov. 3, 1993), pp. 101-108.
104Sakamoto, Chikara et al., ""Design and Implementation of a Parallel Pthread Library (PPL) with Parallelism and Portability"", Systems and Computers in Japan, New York, US, vol. 29, No. 2; XP000752780, ISSN: 0882-1666 abstract, (Feb. 1, 1998), pp. 28-35.
105Sarkar, et al., "Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens", Proc. of the 6th annual ACM symp. on User interface software on technology, Atlanta, GA, (Dec. 1993), p. 81-91.
106Schmalstieg, Dieter et al., "Using transparent props for interaction with the virtual table", U.S. Appl. No. 11/410,024, Proceedings of the 1999 symposium on Interactive 3D graphics., (Apr. 26, 1999), 8 pages.
107Sheelagh, M. et al., ""Distortion Viewing Techniques for 3-Dimensional Data"", Information Visualization '96, Proceedins IEEE Symposium on San Francisco, CA, USA, Los Alamitos, CA, USA, IEEE Comput. Soc., US Oct. 28, 1996; XP010201944; ISBN: 0-8186-7668-X (Oct. 28-29, 1996), pp. 46-53, 119.
108Smith, et al., "Efficient techniques for wide-angle stereo vision using surface projection models", Retrieved from <http://ieee.org/stamp.jsp?arnumber=17045, (1999), 6 pages.
109Stone, et al., "The movable filter as a user interface tool", Proceedings of CHI ACM; (1992), pp. 306-312.
110Tigges, M. et al., ""Generalized Distance Metrics For Implicit Surface Modeling"", Proceedings of the Tenth Western Computer Graphics Symposium; (Mar. 1999).
111Tominski, Christian et al., ""Fisheye Tree Views and Lenses for Graph Visualization"", pp. 1-8.
112Viega, J et al., ""3D magic lenses"", Proceedings of the 9th annual ACM symposium on User interface software and technology; Pub 1996 ACM Press New York, NY, USA; (1996), 51-58.
113Watt, et al., "Advanced Animation and Rendering Techniques", (Addison-Wesley Publishing), (1992), p. 106-108.
114Welsh, Michelle "Futurewave Software", Business Wire; (Nov. 15, 1993).
115Wilson, et al., ""Direct Volume Rendering Via 3D Textures"", Technical Report UCSC-CRL-94-19, University of California, Santa Cruz, Jack Baskin School of Engineering; (Jun. 1994).
Classifications
U.S. Classification382/154
International ClassificationG06K9/00
Cooperative ClassificationG06T15/40, G09G5/02, G06T15/50, G06T11/001
European ClassificationG06T15/40
Legal Events
DateCodeEventDescription
20 Jun 2013ASAssignment
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IDELIX SOFTWARE INC.;REEL/FRAME:030654/0247
Owner name: NOREGIN ASSETS N.V., L.L.C., DELAWARE
Effective date: 20081107
23 Oct 2012CCCertificate of correction
|
{
"url": "http://www.google.com.au/patents/US8194972",
"source_domain": "www.google.com.au",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "227875",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YDJBT2YMAXVMCB2Z2EEUQOB2LWVVGQHZ",
"WARC-Concurrent-To": "<urn:uuid:049d6618-f15e-4f31-b8e1-c98dba09b122>",
"WARC-Date": "2015-05-25T07:38:54Z",
"WARC-IP-Address": "173.194.121.47",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NNPL656KBB56RRRL3UFUHMEKZIWRDU5L",
"WARC-Record-ID": "<urn:uuid:d036141d-3bb0-4ab4-875a-f880bb488a1f>",
"WARC-Target-URI": "http://www.google.com.au/patents/US8194972",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:16bdac3a-90fb-4e9a-b17b-19b8cba76bc3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
355,
377,
402,
511,
617,
644,
690,
729,
780,
885,
899,
908,
1762,
1772,
1786,
1796,
1807,
1910,
2086,
2126,
2239,
2438,
2575,
2679,
2767,
2899,
2981,
3043,
3103,
3205,
3268,
3329,
3465,
3577,
3677,
3767,
3945,
4071,
4281,
4321,
4434,
4633,
4811,
4915,
5019,
5195,
5293,
5355,
5415,
5533,
5596,
5657,
5837,
5993,
6137,
6242,
6420,
6432,
6433,
6746,
6747,
6770,
6771,
7103,
7104,
7132,
7133,
7886,
7887,
8417,
8418,
9162,
9163,
10724,
10725,
11047,
11048,
11073,
11074,
12171,
12172,
14444,
14445,
14764,
14765,
14799,
14800,
14997,
14998,
15271,
15272,
15455,
15456,
15577,
15578,
15775,
15776,
15921,
15922,
16174,
16175,
16581,
16582,
16695,
16696,
16746,
16747,
17625,
17626,
18233,
18234,
18781,
18782,
19685,
19686,
20404,
20405,
21669,
21670,
23002,
23003,
24302,
24303,
26385,
26386,
27901,
27902,
29545,
29546,
30504,
30505,
31213,
31214,
32328,
32329,
33640,
33641,
34043,
34044,
34470,
34471,
35934,
35935,
37053,
37054,
38189,
38190,
38777,
38778,
39873,
39874,
41147,
41148,
43176,
43177,
45301,
45302,
47641,
47642,
49329,
49330,
50906,
50907,
52569,
52570,
53741,
53742,
54850,
54851,
55233,
55234,
55558,
55559,
56445,
56446,
57470,
57471,
58555,
58556,
59182,
59183,
59607,
59608,
60177,
60178,
61754,
61755,
62289,
62290,
63043,
63044,
63524,
63525,
65265,
65266,
65974,
65975,
66525,
66526,
67065,
67066,
67105,
67106,
67887,
67888,
67962,
67963,
68000,
68001,
70509,
70510,
71196,
71197,
72252,
72253,
72502,
72503,
72520,
72574,
72681,
72742,
72840,
72914,
73036,
73120,
73264,
73344,
73462,
73563,
73660,
73742,
73829,
73983,
74078,
74163,
74269,
74355,
74476,
74584,
74683,
74757,
74901,
74997,
75082,
75184,
75243,
75338,
75426,
75549,
75655,
75728,
75809,
75917,
75993,
76100,
76266,
76388,
76484,
76635,
76740,
76848,
76935,
77066,
77178,
77367,
77439,
77550,
77752,
77874,
77964,
78111,
78283,
78388,
78447,
78577,
78722,
78830,
78944,
79063,
79203,
79314,
79405,
79503,
79630,
79745,
79849,
80071,
80181,
80317,
80394,
80618,
80714,
80846,
80951,
81086,
81161,
81312,
81434,
81674,
81747,
81843,
81966,
82069,
82185,
82282,
82467,
82569,
82659,
82792,
82933,
83050,
83186,
83395,
83493,
83579,
83679,
83780,
83897,
83918,
83928,
84001,
84074,
84147,
84220,
84293,
84365,
84443,
84520,
84597,
84675,
84754,
84832,
84910,
84987,
85065,
85154,
85227,
85310,
85393,
85476,
85559,
85641,
85724,
85807,
85889,
85972,
86055,
86138,
86221,
86304,
86387,
86470,
86552,
86635,
86717,
86799,
86880,
86957,
87036,
87115,
87192,
87270,
87452,
87534,
87615,
87759,
87866,
88078,
88289,
88553,
88765,
88976,
89240,
89373,
89519,
89651,
90032,
90103,
90292,
90504,
90714,
90886,
91288,
91479,
91621,
91774,
91916,
92282,
92506,
92794,
93160,
93296,
93459,
93684,
93999,
94145,
94332,
94403,
94712,
94954,
95076,
95336,
95504,
95610,
95879,
95969,
96259,
96443,
96597,
96690,
96977,
97316,
97553,
97790,
97870,
98024,
98101,
98365,
98629,
99014,
99399,
99465,
99650,
99907,
100124,
100337,
100632,
100810,
100920,
101081,
101180,
101361,
101474,
101548,
101731,
101747,
101774,
101811,
101880,
101913,
101926,
101951,
101975,
102079,
102129,
102154
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
355,
377,
402,
511,
617,
644,
690,
729,
780,
885,
899,
908,
1762,
1772,
1786,
1796,
1807,
1910,
2086,
2126,
2239,
2438,
2575,
2679,
2767,
2899,
2981,
3043,
3103,
3205,
3268,
3329,
3465,
3577,
3677,
3767,
3945,
4071,
4281,
4321,
4434,
4633,
4811,
4915,
5019,
5195,
5293,
5355,
5415,
5533,
5596,
5657,
5837,
5993,
6137,
6242,
6420,
6432,
6433,
6746,
6747,
6770,
6771,
7103,
7104,
7132,
7133,
7886,
7887,
8417,
8418,
9162,
9163,
10724,
10725,
11047,
11048,
11073,
11074,
12171,
12172,
14444,
14445,
14764,
14765,
14799,
14800,
14997,
14998,
15271,
15272,
15455,
15456,
15577,
15578,
15775,
15776,
15921,
15922,
16174,
16175,
16581,
16582,
16695,
16696,
16746,
16747,
17625,
17626,
18233,
18234,
18781,
18782,
19685,
19686,
20404,
20405,
21669,
21670,
23002,
23003,
24302,
24303,
26385,
26386,
27901,
27902,
29545,
29546,
30504,
30505,
31213,
31214,
32328,
32329,
33640,
33641,
34043,
34044,
34470,
34471,
35934,
35935,
37053,
37054,
38189,
38190,
38777,
38778,
39873,
39874,
41147,
41148,
43176,
43177,
45301,
45302,
47641,
47642,
49329,
49330,
50906,
50907,
52569,
52570,
53741,
53742,
54850,
54851,
55233,
55234,
55558,
55559,
56445,
56446,
57470,
57471,
58555,
58556,
59182,
59183,
59607,
59608,
60177,
60178,
61754,
61755,
62289,
62290,
63043,
63044,
63524,
63525,
65265,
65266,
65974,
65975,
66525,
66526,
67065,
67066,
67105,
67106,
67887,
67888,
67962,
67963,
68000,
68001,
70509,
70510,
71196,
71197,
72252,
72253,
72502,
72503,
72520,
72574,
72681,
72742,
72840,
72914,
73036,
73120,
73264,
73344,
73462,
73563,
73660,
73742,
73829,
73983,
74078,
74163,
74269,
74355,
74476,
74584,
74683,
74757,
74901,
74997,
75082,
75184,
75243,
75338,
75426,
75549,
75655,
75728,
75809,
75917,
75993,
76100,
76266,
76388,
76484,
76635,
76740,
76848,
76935,
77066,
77178,
77367,
77439,
77550,
77752,
77874,
77964,
78111,
78283,
78388,
78447,
78577,
78722,
78830,
78944,
79063,
79203,
79314,
79405,
79503,
79630,
79745,
79849,
80071,
80181,
80317,
80394,
80618,
80714,
80846,
80951,
81086,
81161,
81312,
81434,
81674,
81747,
81843,
81966,
82069,
82185,
82282,
82467,
82569,
82659,
82792,
82933,
83050,
83186,
83395,
83493,
83579,
83679,
83780,
83897,
83918,
83928,
84001,
84074,
84147,
84220,
84293,
84365,
84443,
84520,
84597,
84675,
84754,
84832,
84910,
84987,
85065,
85154,
85227,
85310,
85393,
85476,
85559,
85641,
85724,
85807,
85889,
85972,
86055,
86138,
86221,
86304,
86387,
86470,
86552,
86635,
86717,
86799,
86880,
86957,
87036,
87115,
87192,
87270,
87452,
87534,
87615,
87759,
87866,
88078,
88289,
88553,
88765,
88976,
89240,
89373,
89519,
89651,
90032,
90103,
90292,
90504,
90714,
90886,
91288,
91479,
91621,
91774,
91916,
92282,
92506,
92794,
93160,
93296,
93459,
93684,
93999,
94145,
94332,
94403,
94712,
94954,
95076,
95336,
95504,
95610,
95879,
95969,
96259,
96443,
96597,
96690,
96977,
97316,
97553,
97790,
97870,
98024,
98101,
98365,
98629,
99014,
99399,
99465,
99650,
99907,
100124,
100337,
100632,
100810,
100920,
101081,
101180,
101361,
101474,
101548,
101731,
101747,
101774,
101811,
101880,
101913,
101926,
101951,
101975,
102079,
102129,
102154,
102192
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 102192,
"ccnet_original_nlines": 456,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2943030297756195,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03515683114528656,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2609187960624695,
"rps_doc_frac_unique_words": 0.1551341414451599,
"rps_doc_mean_word_length": 5.21443510055542,
"rps_doc_num_sentences": 1279,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.12056827545166,
"rps_doc_word_count": 15767,
"rps_doc_frac_chars_dupe_10grams": 0.26705265045166016,
"rps_doc_frac_chars_dupe_5grams": 0.44471877813339233,
"rps_doc_frac_chars_dupe_6grams": 0.39667460322380066,
"rps_doc_frac_chars_dupe_7grams": 0.349846750497818,
"rps_doc_frac_chars_dupe_8grams": 0.32143378257751465,
"rps_doc_frac_chars_dupe_9grams": 0.29505205154418945,
"rps_doc_frac_chars_top_2gram": 0.01830543950200081,
"rps_doc_frac_chars_top_3gram": 0.013282090425491333,
"rps_doc_frac_chars_top_4gram": 0.00681133009493351,
"rps_doc_books_importance": -8536.888671875,
"rps_doc_books_importance_length_correction": -8536.888671875,
"rps_doc_openwebtext_importance": -5561.43310546875,
"rps_doc_openwebtext_importance_length_correction": -5561.43310546875,
"rps_doc_wikipedia_importance": -3694.18408203125,
"rps_doc_wikipedia_importance_length_correction": -3694.18408203125
},
"fasttext": {
"dclm": 0.019526660442352295,
"english": 0.8547800779342651,
"fineweb_edu_approx": 2.4058923721313477,
"eai_general_math": 0.5370990037918091,
"eai_open_web_math": 0.169350266456604,
"eai_web_code": 0.09655702114105225
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0194",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.0195",
"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": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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
|
3,931,845,207,889,692,000 |
Skip to main content
By clicking Submit, you agree to the developerWorks terms of use.
The first time you sign into developerWorks, a profile is created for you. Select information in your profile (name, country/region, and company) is displayed to the public and will accompany any content you post. You may update your IBM account at any time.
All information submitted is secure.
• Close [x]
The first time you sign in to developerWorks, a profile is created for you, so you need to choose a display name. Your display name accompanies the content you post on developerworks.
Please choose a display name between 3-31 characters. Your display name must be unique in the developerWorks community and should not be your email address for privacy reasons.
By clicking Submit, you agree to the developerWorks terms of use.
All information submitted is secure.
• Close [x]
developerWorks Community:
• Close [x]
IBM WebSphere Developer Technical Journal: Building an Enterprise Service Bus with WebSphere Application Server V6 -- Part 4
Building a better bus with mediations
Rachel Reinitz ([email protected]), Senior Consulting IT Specialist, IBM
Rachel Reinitz is a Senior Consulting IT Specialist with IBM Software Services for WebSphere focusing on Web services. Rachel consults with customers and ISVs on how service oriented architecture and Web services can be used to achieve their business and technical objectives. She developed IBM's Advanced Web Services Training course and is a frequent conference presenter. Rachel is also an IBM Academy Member, and an experienced eXtreme Programming coach who has used XP practices for 4 years. She lives in the Bay Area in California, and enjoys hiking, socializing, and international travel.
Andre Tost ([email protected]), Senior Technical Staff Member, IBM
Andre Tost works as a Senior Technical Staff Member in the Software Group's Enterprise Integration Solutions organization, where he helps IBM's customers establishing Service-Oriented Architectures. His special focus is on Web services technology. Before his current assignment, he spent ten years in various partner enablement, development and architecture roles in IBM software development, most recently for the WebSphere Business Development group. Originally from Germany, he now lives and works in Rochester, Minnesota. In his spare time, he likes to spend time with his family and play and watch soccer whenever possible.
Summary: Develop and install a simple mediation that accesses messages as they flow through the bus in Part 4 of this series on using the new messaging engine in IBM® WebSphere® Application Server V6 to build an Enterprise Service Bus.
Date: 11 May 2005
Level: Intermediate
Also available in: Russian
Activity: 6250 views
Comments:
Introduction
Now that we have explored how to setup a bus, and how to use JMS as a message protocol going across the bus, we are finally ready to introduce another key component into our solution: Mediations!
In Part 4 of this series on using the new messaging engine in IBM WebSphere Application Server to build an Enterprise Service Bus (ESB), we will show you how to add a simple mediation to our solution in progress that accesses messages as they flow through the bus.
So far, our solution has evolved from these articles:
Mediations revisited
As we explained in Part 1, messages that are sent to the bus are actually going to a destination. Destinations can be linked to each other by means of configuration, effectively creating a routing path that messages follow.
Mediations provide access to messages as they flow from destination to destination. A mediation is associated with one or more destinations, and will be invoked as soon as a message arrives at that destination. When invoked, a mediation has access to the message and its context flowing through the destination, and can change the content of the message, the routing of the message (that is, the next destination where it is sent), or it can write the message to a log and monitor the data flowing through the bus, which is one of the core characteristics of what an ESB provides.
One additional concept of a mediation, which we will take advantage of later in our example, is that it can read configuration information using what are called context properties, which are key-value pairs configured through the application server administrative console. This feature can be used to provide switches that change the behavior of a mediation without having to change its code.
For a good primer on mediations, see A practical introduction to message mediation.
Mediation programming model
Mediations can be written to be protocol neutral and it is a good design practice to separate any protocol (that is, SOAP or JMS or MQ) processing into separate mediation handlers. In other words, a mediation can be independent from the protocol that was used to send the message to the associated destination. This requires a way for a mediation to access message data in a neutral fashion. This is where Service Data Objects (SDO) come in. We will not provide any detailed explanation of SDO here (see Resources for more material), but note that whenever you are developing mediations for advanced purposes, you will do so leveraging the SDO API.
At the core of mediation programming, each mediation implements a generic interface, named MediationHandler, that enables the bus to invoke it when a message is delivered to a destination. The only method in this interface is called handle(), and it takes an argument of type MessageContext. This context, among other things, contains a reference to the actual message. And that is pretty much it! The handle() method gets called when a message arrives, and that message is passed to the mediation in the MessageContext parameter.
By the way, if you are familiar with the concept of JAX-RPC handlers, mediations follow a very similar (but not the same!) programming model. In fact, the MessageContext class that the mediations use comes from the JAX-RPC specification.
But how do you actually develop and install a mediation? Don't worry; we will take you through a simple step-by-step example right here.
Develop a simple logging mediation
For our example, we will develop a mediation that logs every occurrence of a message that is sent to a destination. The message will simply be printed to System.out. An actual solution would most likely take advantage of the standard java.util.logging mechanism. For now, we will not be changing the actual message content; we will leave that for another article.
The WebSphere Application Server Toolkit (AST) or IBM Rational® Application Developer for WebSphere Software V6 (hereafter referred to as Application Developer) can be used to develop code and create an installable package that contains mediations for WebSphere Application Server. One important detail is that mediations -- even though they are developed as simple Java™ classes -- are deployed in the form of stateless session EJB components. The AST or Application Developer will generate this EJB when the mediation is deployed. More on that later.
To develop our mediation:
1. Create a new EJB project within the development tool you chose to use, and name it LoggingMediation.
2. By default, the tool also offers to create a new EAR project, called LoggingMediationEAR. We will use this default.
3. Create a package called logging in the predefined ejbModule folder of the EJB project (assuming you are in the tool's J2EE perspective).
4. Finally, create a new Java class in this package called LoggingMediation, which implements the com.ibm.websphere.sib.mediation.handler.MediationHandler interface. Figure 1 shows what this structure will look like.
Figure 1. EJB Project structure
Figure 1. EJB Project structure
The tool will also create an empty implementation class for you that contains the following code in an empty method with the signature:
public boolean handle(MessageContext arg0) throws MessageContextException {
5. Add the following code to the handle() method that will log the reception of a message
public boolean handle(MessageContext arg0) throws MessageContextException {
// Convert the MessageContext into an SIMessageContext
SIMessageContext sim = (SIMessageContext)arg0;
// Retrieve the message from the context
SIMessage message = sim.getSIMessage();
try {
if (message.getFormat().equals("JMS:text")) {
// get an SDO DataGraph from the message
DataGraph dataGraph = message.getDataGraph();
//SIBus SDO representation of a JMS message, has a property named 'data'
DataObject jmsMessage = root.getDataObject("data");
//the DataObject for the JMS message has a property which contains the
//value of the message. We access that value as a string. SDO will do
//its best to convert the message in the format requested.
String payLoad = jmsMessage.getString("value");
System.out.println("Message logged. The payload of the message is "+payLoad);
} else {
System.out.println("The received message is not a JMS text message!");
}
} catch (SIException ex) {
System.out.println(ex.getLocalizedMessage());
}
return true;
}
6. Add these import statements to the class:
import com.ibm.websphere.sib.mediation.handler.MediationHandler;
import com.ibm.websphere.sib.mediation.handler.MessageContextException;
import com.ibm.websphere.sib.mediation.messagecontext.SIMessageContext;
import commonj.sdo.DataGraph;
Notice how the payload of the message is retrieved. The system integration bus (SIBus) uses the dynamic interface for Service Data Objects (SDO). The message is represented as an SDO DataGraph, hence we call a method named getDataGraph(). A DataGraph always contains at least one DataObject instance -- that's the actual data. Once we have obtained the root DataObject from the graph, we can look at its properties using the getRootObject() method.
The SIBus representation of a JMS message defines a property on the root DataObject called data which returns another DataObject. The data DataObject has a property called value, which is the actual message content.
The method getString("value") is part of the SDO dynamic interface and needs a bit of an explanation. We can retrieve a property in whatever type fits our needs; the SDO call to the DataObject will do its best to convert the property type -- if it is not stored in that type in the DataObject. In our example, then, we use the getString() method, which says that we want the content of the retrieved property as a String. There are also other methods on the DataObject (...) which try to return the content of a property in the respective type.
Navigating SDO DataObjects
Properties in a DataObject are named. Moreover, DataObjects can contain other DataObjects. The SDO API provides a shortcut you can use to navigate a hierarchy of DataObjects, using an XPath-style query. In our example, instead of the code:
DataObject jmsMessage = root.getDataObject("data");
String payLoad = jmsMessage.getString("value");
we could use the code:
String payLoad = root.getString("data/value");
where the string "data/value" is an XPath type of query, meaning we are retrieving a property named "value" that exists in a property on the root object named "data".
The explanation of the SDO handling we offer here is certainly not sufficient for advanced mediation programming. See Resources for more thorough discussions of SDO and how it applies to WebSphere Messaging Resources.
How did we know that such properties as data and value existed and that they indeed were what we were looking for? This is documented in the WebSphere Application Server V6 Information Center; drill down under SDO Datagraph information => JMS Formats and look at any of the formats.
To make sure that this mediation is only used for JMS text messages, we added a call to message.getFormat(), which will return the string JMS:text for that message type. In a real life solution, we would either create a mediation to handle all message formats, or develop one logging mediation per message format.
Deploy the new mediation
We are now ready to deploy our mediation. This means we add an entry to the EJB deployment descriptor of the EJB project, named LoggingMediation. The tool will automatically generate a stateless session bean that wraps the mediation we just created. This new entry in the deployment descriptor is not part of the standard EJB 2.1 deployment descriptor, so it is stored in an extension file, ws-handler.xmi. However, the tool lets us edit the standard fields and all extensions in one editor window.
To deploy the new mediation:
1. Double-click the Deployment Descriptor: LoggingMediation entry in the Project Explorer view. This will open the (still empty) deployment descriptor in the editor window.
2. Select the Mediation Handlers tab at the bottom to define the mediation (Figure 2).
Figure 2. Mediation handler parameters
Figure 2. Mediation handler parameters
3. To add a new mediation, select the Add... button.
4. In the Define Mediation Handler window, select the Browse button to navigate to our mediation class (Figure 3.)
Figure 3. Define a new mediation
Figure 3. Define a new mediation
5. Select OK.
6. Enter LoggingMediation for the Name, then Finish.
7. After this step, you should see that a new Session EJB exists in the module, which represents the mediation (Figure 4).
Figure 4. Mediation defined in the project
Figure 4. Mediation defined in the project
We can now install the EAR project that contains the mediation into the application server.
Install the mediation
To install the new mediation:
1. Export the LoggingMediationEAR project to an EAR file, using the Export menu option in the development tool (see Download for a complete loggingmediation.ear file).
2. Start up your application server and open the admin console in your browser.
3. Install a new enterprise application from the loggingmediation.ear file. For the install, remember to check both the Generate default bindings and the Deploy enterprise beans checkboxes, if they are not already selected. Keep the default values for all other fields.
4. Upon install completion, go to the Enterprise Applications view of the admin console and start the new LoggingMediationEAR application.
Configure the bus for the mediation
Next, we will define the mediation to the bus:
1. Open the admin view for the bus, which we called TheBus, and select Mediations (Figure 5).
Figure 5. Bus configuration properties
Figure 5. Bus configuration properties
2. Select New.
3. For both the Mediation name and Handler list name, enter the value LoggingMediation, as shown in Figure 6.
Figure 6. Configure the bus mediation
Figure 6. Configure the bus mediation
4. Select OK and save your changes. You now have a mediation available that can be associated with any destination.
So that we can test our new mediation, we will associate it with the PackageReceivedDestination destination that we used previously in our JMS example:
1. Open the destination list in the admin console and check PackageReceivedDestination.
2. Select the Mediate button, shown in Figure 7.
Figure 7. Associate destination with mediation
Figure 7. Associate destination with mediation
3. In the dialog shown in Figure 8, make sure the LoggingMediation mediation is selected (it should be the only mediation that is defined), then Next.
4. Select Next again, then Finish.
5. Save your changes. The list of destinations now shows that LoggingMediation is assigned to PackageReceivedDestination (Figure 8) .
Figure 8. Associate destination with mediation
Figure 8. Associate destination with mediation
Test the mediation
You can simply run the JMS client application to test the mediation, as described in Part 3 of this article series, assuming you have the PackageReceived enterprise application installed and started (see Resources for the article containing this EAR file). Launch the client application using the launchclient utility. The System.out file in the logs\server1 directory now contains additional output from the mediation (Figure 9).
Figure 9. Log file with mediation output
Figure 9. Log file with mediation output
In Figure 9, it looks as though the output is logged twice. The reason for this is because the message content is logged first by the mediation, and then by the receiving MDB.
Conclusion
In Part 4 of this series on building an Enterprise Service Bus with WebSphere Application Server V6, we have demonstrated how to develop, deploy, and install a mediation, and how to configure an ESB to use mediations, a key concept of the new WebSphere Messaging Resources. Developed as simple JavaBeans, a mediation is wrapped into a stateless session EJB, installed in the application server as an enterprise application, and, after associating it with a destination, is invoked whenever a message arrives at the destination. Flexible by nature, mediations can transform and route messages, or simply be used for logging purposes, as shown in this article.
Download
NameSizeDownload method
LoggingMediationEAR.ZIP5 KBFTP|HTTP
Information about download methods
Resources
About the authors
Rachel Reinitz
Rachel Reinitz is a Senior Consulting IT Specialist with IBM Software Services for WebSphere focusing on Web services. Rachel consults with customers and ISVs on how service oriented architecture and Web services can be used to achieve their business and technical objectives. She developed IBM's Advanced Web Services Training course and is a frequent conference presenter. Rachel is also an IBM Academy Member, and an experienced eXtreme Programming coach who has used XP practices for 4 years. She lives in the Bay Area in California, and enjoys hiking, socializing, and international travel.
Andre Tost
Andre Tost works as a Senior Technical Staff Member in the Software Group's Enterprise Integration Solutions organization, where he helps IBM's customers establishing Service-Oriented Architectures. His special focus is on Web services technology. Before his current assignment, he spent ten years in various partner enablement, development and architecture roles in IBM software development, most recently for the WebSphere Business Development group. Originally from Germany, he now lives and works in Rochester, Minnesota. In his spare time, he likes to spend time with his family and play and watch soccer whenever possible.
Report abuse help
Report abuse
Thank you. This entry has been flagged for moderator attention.
Report abuse help
Report abuse
Report abuse submission failed. Please try again later.
developerWorks: Sign in
Need an IBM ID?
Forgot your IBM ID?
Forgot your password?
Change your password
By clicking Submit, you agree to the developerWorks terms of use.
The first time you sign into developerWorks, a profile is created for you. Select information in your profile (name, country/region, and company) is displayed to the public and will accompany any content you post. You may update your IBM account at any time.
Choose your display name
The first time you sign in to developerWorks, a profile is created for you, so you need to choose a display name. Your display name accompanies the content you post on developerWorks.
Please choose a display name between 3-31 characters. Your display name must be unique in the developerWorks community and should not be your email address for privacy reasons.
(Must be between 3 – 31 characters.)
By clicking Submit, you agree to the developerWorks terms of use.
Rate this article
Comments
static.content.url=http://www.ibm.com/developerworks/js/artrating/
SITE_ID=1
Zone=WebSphere, Open source
ArticleID=83058
ArticleTitle=IBM WebSphere Developer Technical Journal: Building an Enterprise Service Bus with WebSphere Application Server V6 -- Part 4
publish-date=05112005
[email protected]
author1-email-cc=
[email protected]
author2-email-cc=
|
{
"url": "http://www.ibm.com/developerworks/websphere/techjournal/0505_reinitz/0505_reinitz.html",
"source_domain": "www.ibm.com",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "75446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZOPW7JG5GWCD2EQMX5BAKNIBGJZXPA3K",
"WARC-Concurrent-To": "<urn:uuid:f71fc0eb-4862-4c05-9f10-ddeba1d1b573>",
"WARC-Date": "2016-08-25T20:43:46Z",
"WARC-IP-Address": "104.96.227.152",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HU7JIR6NBKPOGHOM723MSCZOUO76G7WW",
"WARC-Record-ID": "<urn:uuid:398ac69c-cd99-4dd2-8efa-bf6f6cd81a0d>",
"WARC-Target-URI": "http://www.ibm.com/developerworks/websphere/techjournal/0505_reinitz/0505_reinitz.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:28490254-8a72-485f-a008-e10454c629e5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
21,
22,
88,
89,
348,
349,
386,
387,
401,
402,
586,
587,
764,
765,
831,
832,
869,
870,
884,
885,
911,
912,
926,
927,
1052,
1053,
1091,
1092,
1167,
1763,
1829,
2458,
2459,
2696,
2697,
2716,
2737,
2766,
2767,
2789,
2801,
2802,
2815,
2816,
3012,
3013,
3278,
3279,
3333,
3334,
3335,
3356,
3357,
3581,
3582,
4163,
4164,
4557,
4558,
4642,
4643,
4644,
4672,
4673,
5322,
5323,
5854,
5855,
6093,
6094,
6231,
6232,
6233,
6268,
6269,
6633,
6634,
7187,
7188,
7214,
7215,
7321,
7442,
7584,
7803,
7839,
7875,
8015,
8016,
8096,
8097,
8098,
8190,
8191,
8271,
8278,
8340,
8392,
8402,
8452,
8505,
8515,
8529,
8584,
8633,
8684,
8689,
8771,
8828,
8840,
8919,
8998,
9066,
9119,
9124,
9212,
9230,
9314,
9325,
9360,
9415,
9425,
9432,
9450,
9456,
9461,
9462,
9463,
9510,
9511,
9580,
9656,
9732,
9766,
9771,
9772,
9773,
10222,
10223,
10439,
10440,
10985,
10986,
11013,
11253,
11254,
11306,
11354,
11355,
11356,
11379,
11380,
11427,
11428,
11595,
11596,
11814,
11815,
12098,
12099,
12413,
12414,
12415,
12440,
12441,
12940,
12941,
12970,
12971,
13146,
13235,
13278,
13321,
13376,
13493,
13530,
13567,
13583,
13638,
13763,
13810,
13857,
13858,
13950,
13951,
13952,
13974,
13975,
14005,
14006,
14176,
14258,
14530,
14671,
14672,
14673,
14709,
14710,
14757,
14758,
14854,
14897,
14940,
14957,
15069,
15111,
15153,
15271,
15272,
15424,
15425,
15515,
15566,
15617,
15668,
15821,
15858,
15994,
16045,
16096,
16097,
16098,
16117,
16118,
16549,
16550,
16551,
16592,
16633,
16634,
16810,
16811,
16812,
16823,
16824,
17483,
17484,
17485,
17486,
17495,
17496,
17520,
17556,
17557,
17592,
17593,
17594,
17604,
17605,
17623,
17624,
17639,
17640,
18236,
18237,
18248,
18249,
18878,
18879,
18897,
18898,
18911,
18912,
18976,
18977,
18978,
18996,
18997,
19010,
19011,
19067,
19068,
19069,
19093,
19094,
19095,
19111,
19131,
19132,
19133,
19155,
19176,
19177,
19243,
19244,
19246,
19247,
19248,
19507,
19508,
19533,
19534,
19718,
19719,
19896,
19897,
19934,
19935,
20001,
20002,
20004,
20005,
20006,
20024,
20025,
20034,
20035,
20102,
20112,
20140,
20156,
20294,
20316,
20350,
20368,
20399
],
"line_end_idx": [
21,
22,
88,
89,
348,
349,
386,
387,
401,
402,
586,
587,
764,
765,
831,
832,
869,
870,
884,
885,
911,
912,
926,
927,
1052,
1053,
1091,
1092,
1167,
1763,
1829,
2458,
2459,
2696,
2697,
2716,
2737,
2766,
2767,
2789,
2801,
2802,
2815,
2816,
3012,
3013,
3278,
3279,
3333,
3334,
3335,
3356,
3357,
3581,
3582,
4163,
4164,
4557,
4558,
4642,
4643,
4644,
4672,
4673,
5322,
5323,
5854,
5855,
6093,
6094,
6231,
6232,
6233,
6268,
6269,
6633,
6634,
7187,
7188,
7214,
7215,
7321,
7442,
7584,
7803,
7839,
7875,
8015,
8016,
8096,
8097,
8098,
8190,
8191,
8271,
8278,
8340,
8392,
8402,
8452,
8505,
8515,
8529,
8584,
8633,
8684,
8689,
8771,
8828,
8840,
8919,
8998,
9066,
9119,
9124,
9212,
9230,
9314,
9325,
9360,
9415,
9425,
9432,
9450,
9456,
9461,
9462,
9463,
9510,
9511,
9580,
9656,
9732,
9766,
9771,
9772,
9773,
10222,
10223,
10439,
10440,
10985,
10986,
11013,
11253,
11254,
11306,
11354,
11355,
11356,
11379,
11380,
11427,
11428,
11595,
11596,
11814,
11815,
12098,
12099,
12413,
12414,
12415,
12440,
12441,
12940,
12941,
12970,
12971,
13146,
13235,
13278,
13321,
13376,
13493,
13530,
13567,
13583,
13638,
13763,
13810,
13857,
13858,
13950,
13951,
13952,
13974,
13975,
14005,
14006,
14176,
14258,
14530,
14671,
14672,
14673,
14709,
14710,
14757,
14758,
14854,
14897,
14940,
14957,
15069,
15111,
15153,
15271,
15272,
15424,
15425,
15515,
15566,
15617,
15668,
15821,
15858,
15994,
16045,
16096,
16097,
16098,
16117,
16118,
16549,
16550,
16551,
16592,
16633,
16634,
16810,
16811,
16812,
16823,
16824,
17483,
17484,
17485,
17486,
17495,
17496,
17520,
17556,
17557,
17592,
17593,
17594,
17604,
17605,
17623,
17624,
17639,
17640,
18236,
18237,
18248,
18249,
18878,
18879,
18897,
18898,
18911,
18912,
18976,
18977,
18978,
18996,
18997,
19010,
19011,
19067,
19068,
19069,
19093,
19094,
19095,
19111,
19131,
19132,
19133,
19155,
19176,
19177,
19243,
19244,
19246,
19247,
19248,
19507,
19508,
19533,
19534,
19718,
19719,
19896,
19897,
19934,
19935,
20001,
20002,
20004,
20005,
20006,
20024,
20025,
20034,
20035,
20102,
20112,
20140,
20156,
20294,
20316,
20350,
20368,
20399,
20416
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 20416,
"ccnet_original_nlines": 316,
"rps_doc_curly_bracket": 0.0005387900164350867,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36291390657424927,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026490069925785065,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18172185122966766,
"rps_doc_frac_unique_words": 0.2350427359342575,
"rps_doc_mean_word_length": 5.299802780151367,
"rps_doc_num_sentences": 264,
"rps_doc_symbol_to_word_ratio": 0.0005298000178299844,
"rps_doc_unigram_entropy": 5.657005786895752,
"rps_doc_word_count": 3042,
"rps_doc_frac_chars_dupe_10grams": 0.22503410279750824,
"rps_doc_frac_chars_dupe_5grams": 0.3020096719264984,
"rps_doc_frac_chars_dupe_6grams": 0.27967995405197144,
"rps_doc_frac_chars_dupe_7grams": 0.24792209267616272,
"rps_doc_frac_chars_dupe_8grams": 0.2350825071334839,
"rps_doc_frac_chars_dupe_9grams": 0.23036843538284302,
"rps_doc_frac_chars_top_2gram": 0.008063520304858685,
"rps_doc_frac_chars_top_3gram": 0.011288920417428017,
"rps_doc_frac_chars_top_4gram": 0.006822970230132341,
"rps_doc_books_importance": -1457.4508056640625,
"rps_doc_books_importance_length_correction": -1457.4508056640625,
"rps_doc_openwebtext_importance": -836.3551025390625,
"rps_doc_openwebtext_importance_length_correction": -836.3551025390625,
"rps_doc_wikipedia_importance": -558.577880859375,
"rps_doc_wikipedia_importance_length_correction": -558.577880859375
},
"fasttext": {
"dclm": 0.025293169543147087,
"english": 0.8660851716995239,
"fineweb_edu_approx": 1.4450528621673584,
"eai_general_math": 0.3954516649246216,
"eai_open_web_math": 0.1467931866645813,
"eai_web_code": 0.20504218339920044
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
1,154,178,642,249,571,300 |
Hi,
There's this site for a client of my company where I work - www dot direct holidays dot co dot uk/holidays (without the spaces, of course!) that has gone live but has an unequal height boxes problem.
The boxes (summer 2010, egypt, canaries) have unequal heights. For a dirty fix, there's a trick to give a min-height: 260px; to the .subhome2feature class.
For the ideal fix, I tried making the id contentPanel2 display: table; width: 100% and then the classes col1row1(2 and 3) as display: table-cell; and width: 33%; but that didn't work out.
Can anyone suggest me any other fix? I am just to add something to CSS to make it look good. I can't alter the divs as there's no access to jsp. If there's no fix by only css, then I'll have to tell them it's not possible without altering the jsp.
|
{
"url": "http://www.sitepoint.com/forums/showthread.php?791558-Equal-height-columns-on-this-site-via-only-css&p=4977056&mode=threaded",
"source_domain": "www.sitepoint.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "63887",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AN3PR5BEUCF7WXGRYV46YNMPA25WPFKP",
"WARC-Concurrent-To": "<urn:uuid:6ebec4f3-4d77-4f42-8f12-fe809d3685c3>",
"WARC-Date": "2014-03-16T11:47:45Z",
"WARC-IP-Address": "54.221.222.248",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7I7VKKVWCGS4R5DNF3C5UDLSGBFPCHUT",
"WARC-Record-ID": "<urn:uuid:8979eed2-ccf8-4801-82af-f4eee58522fb>",
"WARC-Target-URI": "http://www.sitepoint.com/forums/showthread.php?791558-Equal-height-columns-on-this-site-via-only-css&p=4977056&mode=threaded",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d584119d-2438-427d-aa49-bdc7966e53e2>"
},
"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,
4,
5,
205,
206,
362,
363,
551,
552
],
"line_end_idx": [
4,
5,
205,
206,
362,
363,
551,
552,
799
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 799,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3781094551086426,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029850749298930168,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24378108978271484,
"rps_doc_frac_unique_words": 0.6758620738983154,
"rps_doc_mean_word_length": 4.165517330169678,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.393934726715088,
"rps_doc_word_count": 145,
"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.01324503030627966,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -81.19365692138672,
"rps_doc_books_importance_length_correction": -81.19365692138672,
"rps_doc_openwebtext_importance": -42.544219970703125,
"rps_doc_openwebtext_importance_length_correction": -42.543209075927734,
"rps_doc_wikipedia_importance": -33.0302619934082,
"rps_doc_wikipedia_importance_length_correction": -33.0302619934082
},
"fasttext": {
"dclm": 0.3731845021247864,
"english": 0.9487156867980957,
"fineweb_edu_approx": 0.8448169827461243,
"eai_general_math": 0.8883891701698303,
"eai_open_web_math": 0.14571940898895264,
"eai_web_code": 0.5313337445259094
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,480,890,280,678,423,000 |
(Photo Illustration by Thomas Trutschel/Photothek via Getty Images)
Liking, commenting and sharing are all part of our daily vocabulary in the social media era.
However, one social media app doesn’t allow you to easily ‘share’ content from other users on the app.
There is no conventional way to actually repost or ‘regram’ an Instagram post like there is a share button on Facebook or a retweet option on Twitter.
So how do you put a video onto your profile in appreciation of the original video posted by someone else?
Instagram users can now technically share other Instagrams with their friends, but this is via a direct message, so the problem is how do you share to all your Instagram followers?
It is widely known that you can screenshot a picture to repost or use regram apps, but how do you repost videos?
https://www.instagram.com/p/BZLcw7yg2GN/
There’s an app for that
Literally, there is an app generated specifically for this exact problem of sharing videos from Instagram.
I swear our ancestors must look down on us in disdain.
To repost picture or videos to Instagram you can use apps such as InstaRepost, Regram and Repost for Instagram.
https://www.instagram.com/p/BZLj01WAAP8/
The apps work by the URL of the Instagram post you want to repost.
So as you’re scrolling and double tapping you may come across something so cool you want it for your own profile to show your own followers.
You don’t want to pass it off as your own and want to give the appropriate credit to the original Instagram account.
Click the three grey dots at the top right corner of the Instagram post – it should be across from the username.
https://www.instagram.com/p/BZLEkWqn9ki/?taken-by=amberdesigngroup
Then a menu should come up with one of the options being to ‘copy link’ of the Instagram post.
Click that and it will tell you that the link is copied to the clipboard.
The reposting app you have downloaded will then detect that you have copied a link and will pop up to ask if you want to repost it that instant or save it for later.
The original Instagram poster’s username will be embedded in the picture or video and the caption will be copied to your post.
https://www.instagram.com/p/BZLruxQl1x2/
Do it the old fashioned way
If this all seems too complicated for you then you could just take a screenshot of the Instagram you want to repost.
Take the screenshot, then go through the motions of putting up a regular Instagram post but just choose your screenshot.
You should make sure you credit the correct original poster in the caption or tag them in the photo, and maybe ask permission to use their content.
With this method you are limited to reposting pictures only, so use the reposting apps if you want to spread a video to your followers.
https://www.instagram.com/p/BZH-MV1A9vR/?taken-by=tosh.ig
Sharing Insta’s off Instagram
If you’re dying to share an Instagram post with your wider social media audience, you can.
Sharing Instagrams over Twitter and Facebook can be annoying but it is sure to drive people to that person’s Instagram, which gives them more satisfaction than you ripping their stuff.
You can copy a post’s URL by clicking the three grey dots and copying the link to your clipboard.
All you have to do then is share this link across your other social media profiles.
Always make sure to credit the source of the content, you can’t just go around and take other people’s content and pass it off as your own.
In order to comply with Instagram’s Terms Of Use which says ‘don’t post anything you’ve copied or collected from the Internet that you don’t have the right to post’ you need to ask the owner of the video content if you have the right to repost it, while crediting them for the content, to your page.
If you cannot contact them you should always credit the source of the material.
MORE : Is paying for Instagram verification really such a terrible thing?
MORE : This Instagram account only shares heartwarming news stories
|
{
"url": "https://metro.co.uk/2017/09/18/how-to-repost-a-video-on-instagram-and-the-apps-you-will-need-6936488/?ico=more_text_links",
"source_domain": "metro.co.uk",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "371754",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HTVVJJ625C33QUK6GWD4BGM36OLBFZKP",
"WARC-Concurrent-To": "<urn:uuid:89f45aa3-e9fb-45ee-8d08-99d8ec663fe9>",
"WARC-Date": "2024-08-11T22:53:18Z",
"WARC-IP-Address": "192.0.66.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S5CNEZFETDMPFWVUIS4R7OLW4YXBGNX6",
"WARC-Record-ID": "<urn:uuid:6ed85e5d-56d1-44f1-9840-c27a697b460c>",
"WARC-Target-URI": "https://metro.co.uk/2017/09/18/how-to-repost-a-video-on-instagram-and-the-apps-you-will-need-6936488/?ico=more_text_links",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78ae1754-afac-417f-911c-8e466543d49a>"
},
"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-71\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,
68,
69,
162,
163,
266,
267,
418,
419,
525,
526,
707,
708,
821,
822,
863,
864,
888,
889,
996,
997,
1052,
1053,
1165,
1166,
1207,
1208,
1275,
1276,
1417,
1418,
1535,
1536,
1649,
1650,
1717,
1718,
1813,
1814,
1888,
1889,
2055,
2056,
2183,
2184,
2225,
2226,
2254,
2255,
2372,
2373,
2494,
2495,
2643,
2644,
2780,
2781,
2839,
2840,
2870,
2871,
2962,
2963,
3148,
3149,
3247,
3248,
3332,
3333,
3473,
3474,
3774,
3775,
3855,
3856,
3930,
3931
],
"line_end_idx": [
68,
69,
162,
163,
266,
267,
418,
419,
525,
526,
707,
708,
821,
822,
863,
864,
888,
889,
996,
997,
1052,
1053,
1165,
1166,
1207,
1208,
1275,
1276,
1417,
1418,
1535,
1536,
1649,
1650,
1717,
1718,
1813,
1814,
1888,
1889,
2055,
2056,
2183,
2184,
2225,
2226,
2254,
2255,
2372,
2373,
2494,
2495,
2643,
2644,
2780,
2781,
2839,
2840,
2870,
2871,
2962,
2963,
3148,
3149,
3247,
3248,
3332,
3333,
3473,
3474,
3774,
3775,
3855,
3856,
3930,
3931,
3998
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3998,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4993983209133148,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007220219820737839,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13116726279258728,
"rps_doc_frac_unique_words": 0.3783382773399353,
"rps_doc_mean_word_length": 4.729970455169678,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.956355571746826,
"rps_doc_word_count": 674,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023839399218559265,
"rps_doc_frac_chars_dupe_6grams": 0.01129234954714775,
"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.014115430414676666,
"rps_doc_frac_chars_top_3gram": 0.01756587065756321,
"rps_doc_frac_chars_top_4gram": 0.016938520595431328,
"rps_doc_books_importance": -362.41046142578125,
"rps_doc_books_importance_length_correction": -362.41046142578125,
"rps_doc_openwebtext_importance": -181.08773803710938,
"rps_doc_openwebtext_importance_length_correction": -181.08773803710938,
"rps_doc_wikipedia_importance": -124.91394805908203,
"rps_doc_wikipedia_importance_length_correction": -124.91394805908203
},
"fasttext": {
"dclm": 0.03479278087615967,
"english": 0.9054699540138245,
"fineweb_edu_approx": 1.3990848064422607,
"eai_general_math": 0.03232806921005249,
"eai_open_web_math": 0.10838019847869873,
"eai_web_code": 0.00939100980758667
}
}
|
{
"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": "302.23",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "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
|
-2,506,066,858,729,261,000 |
Posts tagged with Pin Reset - How Reset
Posts tagged with Pin Reset
← Back to our blog
Roku Pin Reset: A User-Friendly Guide to go.roku.com/pin Reset
PIN Recovery TV and Streaming Device Resets
Roku Pin Reset: A User-Friendly Guide to go.roku.com/pin Reset
Explore our user-friendly guide on Roku PIN reset. Learn the importance of resetting your Roku PIN, steps to reset, troubleshooting tips, and how to create a secure PIN. Enhance your Roku experience with a reset PIN.
A Reliable Guide for Amazon Video Pin Reset
PIN Recovery
A Reliable Guide for Amazon Video Pin Reset
Explore our comprehensive guide on resetting your Amazon Video Pin. Learn why it's crucial, follow our step-by-step reset process, troubleshoot common issues, and enhance your pin's security. Enjoy a hassle-free Amazon Video experience.
Running into Issues with go.roku.com/pin Reset? Here's Your Solution
Device Troubleshooting TV and Streaming Device Resets
Running into Issues with go.roku.com/pin Reset? Here's Your Solution
Handle Roku device issues like a pro with our insightful guide. Learn about the significance of go.roku.com/pin, common issues, and quick fixes. Get a step-by-step guide to reset your Roku pin and troubleshoot effectively the How Reset way. Dive in to enhance your Roku experience!
How to Change Your Amazon Prime Pin: A Comprehensive Tutorial
PIN Recovery TV and Streaming Device Resets
How to Change Your Amazon Prime Pin: A Comprehensive Tutorial
Learn to change your Amazon Prime PIN with our comprehensive guide. We walk you through each step, from accessing your account to confirming your new PIN, ensuring a seamless process.
|
{
"url": "https://serve.howreset.com/blog?tag=pin+reset",
"source_domain": "serve.howreset.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "79219",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z7VS32NZ3OHFHRIL3EREG53LVV4B4WBY",
"WARC-Concurrent-To": "<urn:uuid:abc44ea1-52ec-4eca-b0c1-21f3c5536829>",
"WARC-Date": "2024-08-07T00:52:02Z",
"WARC-IP-Address": "76.76.21.164",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RLRA5GV6X5FKR3LT4QCUSFX5DXSU5G4Z",
"WARC-Record-ID": "<urn:uuid:1be56328-f867-448e-a1ad-c1735c993485>",
"WARC-Target-URI": "https://serve.howreset.com/blog?tag=pin+reset",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ef2531d-3f43-4019-b45d-e925f74b760d>"
},
"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-150\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,
40,
41,
69,
70,
89,
90,
153,
197,
198,
261,
262,
479,
480,
524,
537,
538,
582,
583,
820,
821,
890,
944,
945,
1014,
1015,
1297,
1298,
1360,
1404,
1405,
1467,
1468
],
"line_end_idx": [
40,
41,
69,
70,
89,
90,
153,
197,
198,
261,
262,
479,
480,
524,
537,
538,
582,
583,
820,
821,
890,
944,
945,
1014,
1015,
1297,
1298,
1360,
1404,
1405,
1467,
1468,
1651
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1651,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2507374584674835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05309734866023064,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16814158856868744,
"rps_doc_frac_unique_words": 0.34375,
"rps_doc_mean_word_length": 5.17578125,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.027949810028076,
"rps_doc_word_count": 256,
"rps_doc_frac_chars_dupe_10grams": 0.07698112726211548,
"rps_doc_frac_chars_dupe_5grams": 0.41811320185661316,
"rps_doc_frac_chars_dupe_6grams": 0.3637735843658447,
"rps_doc_frac_chars_dupe_7grams": 0.34415093064308167,
"rps_doc_frac_chars_dupe_8grams": 0.28830188512802124,
"rps_doc_frac_chars_dupe_9grams": 0.2339622527360916,
"rps_doc_frac_chars_top_2gram": 0.042264148592948914,
"rps_doc_frac_chars_top_3gram": 0.027169810608029366,
"rps_doc_frac_chars_top_4gram": 0.04528301954269409,
"rps_doc_books_importance": -169.52252197265625,
"rps_doc_books_importance_length_correction": -155.938720703125,
"rps_doc_openwebtext_importance": -92.61078643798828,
"rps_doc_openwebtext_importance_length_correction": -92.61078643798828,
"rps_doc_wikipedia_importance": -90.62871551513672,
"rps_doc_wikipedia_importance_length_correction": -78.473388671875
},
"fasttext": {
"dclm": 0.03414202108979225,
"english": 0.7819172739982605,
"fineweb_edu_approx": 1.2203024625778198,
"eai_general_math": -0.000007870000445109326,
"eai_open_web_math": 0.016680540516972542,
"eai_web_code": 0.0004013199941255152
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,921,972,589,251,279,000 |
当前位置： 移动技术网 > IT编程>数据库>MongoDB > Mongoose 在egg中的使用
Mongoose 在egg中的使用
2020年06月14日 | 移动技术网IT编程 | 我要评论
中国好声音官方网站,男士毛衣编织图案,余罪第二季 下载
mongoose是什么？
mongoose是mongodb的一个对象模型工具，封装了许多mongodb对文档的的增删改查等常用方法，让nodejs操作mongodb数据库变得更加灵活简单。
在egg项目中如何使用？
1、安装
npm i egg-mongoose --save
2、配置
在根目录下的/config/plugin.js中配置插件
exports.mongoose = {
enable: true,
package: 'egg-mongoose',
};
3、连接数据库
在根目录下的/config/config.default.js增加配置，其中url为我们的数据库地址，可通过环境变量来区分开发环境还是生产环境，并且确定是否使用用户名密码的数据库
const prod = process.env.npm_config_server_prod;
mongoose: {
client: {
url: prod ? 'mongodb:eggadmin:123456@localhost:27017/dbname' : 'mongodb://127.0.0.1:27017/dbname',
options: {
useunifiedtopology: true,
},
},
},
4、配置与使用
（1）数据表配置
在app目录下新建model文件夹，在model文件夹下新建js文件作为数据表的配置内容，下面以书籍表的配置为例
'use strict';
/**
* @description: mongoose book schema,
*/
module.exports = app => {
const mongoose = app.mongoose;
const schema = mongoose.schema;
const bookschema = new schema({
desc: { type: string }, /* 书籍描述 */
name: { type: string }, /* 书籍名称 */
press: { type: string }, /* 出版社 */
author: { type: string }, /* 作者 */
image: { type: array }, /* 书籍图片列表*/
price: { type: string }, /* 价格 */
book_type: { /* 书籍分类id */
type: schema.types.objectid,
ref: 'bookclassify',
},
user: { /* 书籍发布者id */
type: schema.types.objectid,
ref: 'user',
},
create_time: { type: string }, /* 创建时间 */
status: { type: string }, /* 状态，1：待购买，2：已购买*/
look: { type: number } /* 浏览数量 */
});
return mongoose.model('book', bookschema);
};
可以看到我们可以通过schema来定义表结构，可以指定字段的类型及关联，设置完字段后就可以生成model了，这里算是非常简单的配置，更多配置方法可参考文档
(2)、使用mongoose方法
配置完数据表结构后，我们就可以再service层中调用mongoose的方法对文档进行增删查改了，已书籍列表的处理逻辑为例子
async findbooklist(data) {
const { type, page, pagesize, desc, status, userid } = data;
const searchval = {}
if (type) {
searchval.book_type = mongoose.types.objectid(type)
}
if (status) {
searchval.status = status
}
if (userid) {
searchval.user = mongoose.types.objectid(userid)
}
const search_term = {
$or: [
{ desc: { $regex: desc ? desc : '', $options: '$i' } },
{ name: { $regex: desc ? desc : '', $options: '$i' } },
{ author: { $regex: desc ? desc : '', $options: '$i' } },
{ press: { $regex: desc ? desc : '', $options: '$i' } },
],
};
const totalnum = await this.ctx.model.book.find(searchval).and(search_term).countdocuments();
const result = await this.ctx.model.book.find(searchval)
.populate({
path: 'user',
select: { name: 1, image: 1 }
})
.populate({
path: 'book_type'
})
.and(search_term)
.sort({ create_time: -1 })
.skip((parseint(page) - 1) * parseint(pagesize))
.limit(parseint(pagesize));
return result ? { bean: {
records: result,
current: page,
size: result.length,
total: totalnum,
}, ...app.config.msg.get_success } : app.config.msg.get_err;
}
可以看到，通过this.ctx.model.book就可以获取到book的model并且可以调用mongoose需要的方法，例如populate、find、and、sort、skip、limit 等等。
5、egg-mongoose常用的方法
增加数据
this.ctx.model.book.create(data,callback);
其中data为json数据结构，callback为操作后的回调函数
查询数据
获取所有数据，返回是一个数组
this.ctx.model.book.find()
获取一个数据，返回是一个对象
this.ctx.model.book.findone()
条件查询
this.ctx.model.article.find(conditions,callback);
其中conditions为查询的条件，callback为回调函数
conditions有一下几种情况：
具体数据：
this.ctx.model.book.find({_id：5c4a19fb87ba4002a47ac4d, name: "射雕英雄传" }, callback);
条件查询：
"$lt" 小于
"$lte" 小于等于
"$gt" 大于
"$gte" 大于等于
"$ne" 不等于
// 查询价格大于100小于200的书籍数组
this.ctx.model.book.find({ "price": { $get:100 , $lte:200 });
或查询 or
"$in" 一个键对应多个值
"$nin" 同上取反, 一个键不对应指定值
"$or" 多个条件匹配, 可以嵌套 $in 使用
"$not" 同上取反, 查询与特定模式不匹配的文档
this.ctx.model.book.find({"name":{ $in: ["射雕","倚天"]} );
删除数据
this.ctx.model.book.remove(conditions,callback);
更新数据
this.ctx.model.book.update(conditions, update, callback)
conditions为条件，update是更新的值对象
排序
this.ctx.model.book.sort({ create_time: -1 });
其中-1表示降序返回。 1表示升序返回
限制数量
this.ctx.model.book.limit(number);
number表示限制的个数
跳过文档返回
this.ctx.model.book.skip(number);
number表示跳过的个数,skip经常搭配limit实现分页的功能
条件数组and
在find后面可使用and对查询结果进行进一步条件筛选，相当于并且的意思。
const search_term = {
$or: [
{ desc: { $regex: desc ? desc : '', $options: '$i' } },
{ name: { $regex: desc ? desc : '', $options: '$i' } },
{ author: { $regex: desc ? desc : '', $options: '$i' } },
{ press: { $regex: desc ? desc : '', $options: '$i' } },
],
};
this.ctx.model.book.find().and(search_term)
关联查询populate
// 在model中配置字段时候指定关联的表名，就可以通过populate来进行表的关联查询
user: { /* 书籍发布者id */
type: schema.types.objectid,
ref: 'user',
},
this.ctx.model.book.find()
.populate({
path: 'user',
select: { name: 1, image: 1 }
})
聚合管道aggregate
this.ctx.model.template.aggregate([
{ $match: { name } },
{ $sort: { create_time: -1 } },
{ $group: { _id: '$name', user_id: { $first: '$modifier' } } },
]);
mongoose聚合管道aggregate常用的操作有$project 、$match 、$group、$sort、$limit、$skip、$lookup 表关联
批量操作bulkwrite
const template_list = await ctx.model.template.aggregate([
{ $sort: { create_time: -1 } },
{ $group: { _id: '$name', template_id: { $first: '$_id' }, label: { $first: '$label' } } },
]);
const update_value = [];
template_list.foreach(item => {
if (!item.label) {
update_value.push({
updateone: {
filter: { _id: item.template_id },
update: { label: '' },
},
});
}
});
await ctx.model.template.bulkwrite(update_value);
可以进行一系列批量增加、删除、更新等操作。
mongoose还有非常多的方法可以提供给我的灵活使用，我们在使用的时候可以结合业务逻辑选择合适的方法来提高我们操作数据库的效率。在我们使用它之前可以认真的阅读官方文档
如对本文有疑问，请在下面进行留言讨论，广大热心网友会与你互动！！ 点击进行留言回复
相关文章:
验证码：
移动技术网
|
{
"url": "http://www.lhsxpumps.com/articledetail/596539.html",
"source_domain": "www.lhsxpumps.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "45163",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2WENOSTVYJZYFW4OD2JWF3JEOC7YGAQ5",
"WARC-Concurrent-To": "<urn:uuid:69eb5fca-4141-4b5f-8cc6-b11320c4cada>",
"WARC-Date": "2023-03-30T03:57:49Z",
"WARC-IP-Address": "103.82.169.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BYTD526MIXPVZF4MQ3KRDORZPXW4PXY2",
"WARC-Record-ID": "<urn:uuid:97b9db34-bb75-4a04-a277-ea86a954638b>",
"WARC-Target-URI": "http://www.lhsxpumps.com/articledetail/596539.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:566e3f2a-71d6-4011-95b1-cef13ec198c6>"
},
"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-94\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,
70,
71,
104,
105,
133,
134,
147,
148,
230,
231,
244,
245,
250,
251,
277,
278,
283,
284,
313,
314,
335,
350,
376,
379,
380,
388,
389,
479,
528,
529,
541,
554,
657,
672,
703,
710,
716,
721,
722,
730,
731,
740,
741,
798,
799,
813,
814,
818,
857,
861,
862,
888,
920,
953,
986,
1023,
1060,
1097,
1134,
1172,
1208,
1236,
1268,
1292,
1297,
1321,
1353,
1369,
1374,
1418,
1466,
1502,
1507,
1551,
1554,
1555,
1633,
1634,
1651,
1652,
1715,
1716,
1743,
1807,
1831,
1846,
1902,
1907,
1924,
1954,
1959,
1976,
2029,
2034,
2059,
2070,
2131,
2192,
2255,
2317,
2324,
2330,
2427,
2487,
2503,
2522,
2557,
2564,
2580,
2603,
2610,
2632,
2663,
2716,
2748,
2778,
2800,
2820,
2846,
2868,
2933,
2937,
2938,
3040,
3041,
3061,
3062,
3067,
3068,
3111,
3112,
3146,
3147,
3152,
3153,
3168,
3169,
3196,
3197,
3212,
3213,
3243,
3244,
3249,
3250,
3300,
3301,
3334,
3353,
3354,
3360,
3361,
3444,
3445,
3451,
3452,
3462,
3475,
3485,
3498,
3509,
3532,
3595,
3596,
3603,
3604,
3619,
3642,
3668,
3696,
3697,
3753,
3754,
3759,
3760,
3809,
3810,
3815,
3816,
3873,
3874,
3902,
3903,
3906,
3907,
3954,
3955,
3975,
3976,
3981,
3982,
4017,
4018,
4032,
4033,
4040,
4041,
4075,
4076,
4111,
4112,
4120,
4121,
4159,
4160,
4182,
4193,
4254,
4315,
4378,
4440,
4447,
4453,
4499,
4500,
4513,
4514,
4561,
4583,
4615,
4631,
4636,
4638,
4665,
4681,
4700,
4735,
4742,
4743,
4757,
4758,
4794,
4820,
4856,
4924,
4931,
4932,
5015,
5016,
5030,
5031,
5091,
5126,
5221,
5227,
5254,
5288,
5310,
5334,
5352,
5393,
5422,
5430,
5438,
5443,
5449,
5501,
5502,
5524,
5525,
5610,
5611,
5653,
5654,
5660,
5661,
5666
],
"line_end_idx": [
51,
52,
70,
71,
104,
105,
133,
134,
147,
148,
230,
231,
244,
245,
250,
251,
277,
278,
283,
284,
313,
314,
335,
350,
376,
379,
380,
388,
389,
479,
528,
529,
541,
554,
657,
672,
703,
710,
716,
721,
722,
730,
731,
740,
741,
798,
799,
813,
814,
818,
857,
861,
862,
888,
920,
953,
986,
1023,
1060,
1097,
1134,
1172,
1208,
1236,
1268,
1292,
1297,
1321,
1353,
1369,
1374,
1418,
1466,
1502,
1507,
1551,
1554,
1555,
1633,
1634,
1651,
1652,
1715,
1716,
1743,
1807,
1831,
1846,
1902,
1907,
1924,
1954,
1959,
1976,
2029,
2034,
2059,
2070,
2131,
2192,
2255,
2317,
2324,
2330,
2427,
2487,
2503,
2522,
2557,
2564,
2580,
2603,
2610,
2632,
2663,
2716,
2748,
2778,
2800,
2820,
2846,
2868,
2933,
2937,
2938,
3040,
3041,
3061,
3062,
3067,
3068,
3111,
3112,
3146,
3147,
3152,
3153,
3168,
3169,
3196,
3197,
3212,
3213,
3243,
3244,
3249,
3250,
3300,
3301,
3334,
3353,
3354,
3360,
3361,
3444,
3445,
3451,
3452,
3462,
3475,
3485,
3498,
3509,
3532,
3595,
3596,
3603,
3604,
3619,
3642,
3668,
3696,
3697,
3753,
3754,
3759,
3760,
3809,
3810,
3815,
3816,
3873,
3874,
3902,
3903,
3906,
3907,
3954,
3955,
3975,
3976,
3981,
3982,
4017,
4018,
4032,
4033,
4040,
4041,
4075,
4076,
4111,
4112,
4120,
4121,
4159,
4160,
4182,
4193,
4254,
4315,
4378,
4440,
4447,
4453,
4499,
4500,
4513,
4514,
4561,
4583,
4615,
4631,
4636,
4638,
4665,
4681,
4700,
4735,
4742,
4743,
4757,
4758,
4794,
4820,
4856,
4924,
4931,
4932,
5015,
5016,
5030,
5031,
5091,
5126,
5221,
5227,
5254,
5288,
5310,
5334,
5352,
5393,
5422,
5430,
5438,
5443,
5449,
5501,
5502,
5524,
5525,
5610,
5611,
5653,
5654,
5660,
5661,
5666,
5671
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5671,
"ccnet_original_nlines": 269,
"rps_doc_curly_bracket": 0.02609769068658352,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04380103945732117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0014847799902781844,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6384558081626892,
"rps_doc_frac_unique_words": 0.5706806182861328,
"rps_doc_mean_word_length": 9.73298454284668,
"rps_doc_num_sentences": 137,
"rps_doc_symbol_to_word_ratio": 0.0007423899951390922,
"rps_doc_unigram_entropy": 4.989925861358643,
"rps_doc_word_count": 382,
"rps_doc_frac_chars_dupe_10grams": 0.06455083191394806,
"rps_doc_frac_chars_dupe_5grams": 0.11834319680929184,
"rps_doc_frac_chars_dupe_6grams": 0.11834319680929184,
"rps_doc_frac_chars_dupe_7grams": 0.08230230957269669,
"rps_doc_frac_chars_dupe_8grams": 0.08230230957269669,
"rps_doc_frac_chars_dupe_9grams": 0.06455083191394806,
"rps_doc_frac_chars_top_2gram": 0.019365249201655388,
"rps_doc_frac_chars_top_3gram": 0.027972029522061348,
"rps_doc_frac_chars_top_4gram": 0.043033890426158905,
"rps_doc_books_importance": -617.3298950195312,
"rps_doc_books_importance_length_correction": -617.3298950195312,
"rps_doc_openwebtext_importance": -377.1187438964844,
"rps_doc_openwebtext_importance_length_correction": -377.1187438964844,
"rps_doc_wikipedia_importance": -274.0411376953125,
"rps_doc_wikipedia_importance_length_correction": -274.0411376953125
},
"fasttext": {
"dclm": 0.9995360374450684,
"english": 0.039430998265743256,
"fineweb_edu_approx": 2.9556047916412354,
"eai_general_math": 0.029376329854130745,
"eai_open_web_math": 0.07384545356035233,
"eai_web_code": 0.8701062202453613
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,475,623,489,525,637,000 |
Cyber Security | Cryptography Algorithms Types
1.Confidentiality:
Confidentiality is used to make sure that nobody in between site A and B is able to read what data or information is sent between the to sites. To achieve this encryption algorithms are used.
Symmetric algorithms allow encryption and decryption with the same key.
Features Cryptography:-
Confidentiality:-
Information can only be accessed by the person for whom it is intended and no other person
|
{
"url": "https://akashranjanpatel.medium.com/cyber-security-cryptography-algorithms-types-47c99d39f605",
"source_domain": "akashranjanpatel.medium.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "95894",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TMURFNSHSL2FKIVXEPREPJXEOQRKS62Z",
"WARC-Concurrent-To": "<urn:uuid:834a8573-4548-48c9-b460-75be437683c0>",
"WARC-Date": "2022-01-21T09:01:34Z",
"WARC-IP-Address": "162.159.152.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JUC6H45HRX3VMMCDKJP3NTGDSNL3CK34",
"WARC-Record-ID": "<urn:uuid:c883acd0-a8d0-42d8-980e-3d572a9fc625>",
"WARC-Target-URI": "https://akashranjanpatel.medium.com/cyber-security-cryptography-algorithms-types-47c99d39f605",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bce53d6-dcd8-42d1-be16-0e5abef1110d>"
},
"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-184\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,
47,
48,
67,
68,
260,
261,
333,
334,
358,
359,
377,
378
],
"line_end_idx": [
47,
48,
67,
68,
260,
261,
333,
334,
358,
359,
377,
378,
468
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 468,
"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.48750001192092896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02500000037252903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11249999701976776,
"rps_doc_frac_unique_words": 0.7323943972587585,
"rps_doc_mean_word_length": 5.366197109222412,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.830540180206299,
"rps_doc_word_count": 71,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -22.95591926574707,
"rps_doc_books_importance_length_correction": -26.788070678710938,
"rps_doc_openwebtext_importance": -14.794553756713867,
"rps_doc_openwebtext_importance_length_correction": -18.626705169677734,
"rps_doc_wikipedia_importance": -9.969532012939453,
"rps_doc_wikipedia_importance_length_correction": -13.801684379577637
},
"fasttext": {
"dclm": 0.5965913534164429,
"english": 0.929596483707428,
"fineweb_edu_approx": 3.2681455612182617,
"eai_general_math": 0.5448890924453735,
"eai_open_web_math": 0.32144975662231445,
"eai_web_code": 0.15554988384246826
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "003.54",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "System theory"
}
}
},
"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": "1",
"label": "No 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
|
-7,504,939,347,936,702,000 |
Hi! Do you remember blogs? Well, this used to be one. Now it just serves as an archive for my multiple Twitter accounts.
1 October 2016
Quelqu’un à l’usine a encore mélangé la garniture aux champignons avec celle au fromage, adieu les crêpes surgelées 😞
2 October
“C’est complet on ne laisse plus entrer”
There’s this weather app idea I’ve wanted to do for years, but I don’t understand how developers can afford to release pay-once weather apps
@neirajones:
France: A New Card Is Being Rolled Out With CVV That Changes Every Hour [bit.ly] #payments #MotionCode https://t.co/Fl63HGMsyB
Adieu, l’achat 1-click sur Amazon.
Editing my app’s list of emojis in TextEdit because it consistently makes Xcode crash.
Okay, that was dumb, now there are curly quotes in the middle of my code.
Golfers don’t have skin tones ಠ_ಠ
How the hell do iOS 10’s feminized emojis work? [stringByReplacingOccurrencesOfString:@”🏿”] works fine on the men, not on the women 😠
3 October
@RtoVR:
Watch @hypevr’s Impressive Volumetric 360 3D Video In Action @VirtualTedS [ow.ly] [pic.twitter.com]
Spent two hours implementing user-requested half-star ratings in my app to find out that a half-star rating set on iOS doesn’t stick.
@Pinboard:
I bet any amount of money that those guys trying to break us out of the simulation fiddled with the wrong registers and gave us Trump
Je regardais ma coiffure dans le miroir de l’ascenseur puis mon regard est tombé sur le bouton d’appel aux secours et j’ai failli appuyer.
On salue Westworld dont le pilote ouvre direct avec plusieurs viols plutôt que de laisser planer le doute sur les intentions de HBO.
Il va bientôt être temps de racheter de la fonte 😱
4 October
C’est fâcheux qu’il y ait tant de plans sans Kate McKinnon dans Ghostbusters.
Pour un film de super-héros, X-Men Apocalypse a un troisième acte étonnamment satisfaisant.
Ca tient à peu de chose — laisser à l’action le temps de se développer, aux personnages celui de réagir, poser la caméra sur un truc stable.
Levé à dix heures du matin pour rien, je frappe qui ? 👿
Downloading an open-source Swift project that hasn’t been updated in all of three months and therefore not being able to compile it.
Ca semble se confirmer, la batterie de mon iPhone marche normalement tant que je ne lance pas Pokémon Go. Impossible de le revendre, donc.
@marcoarment:
What the hell is going on at @Dropbox these days? The Mac client developers have lost all respect for the platform.
https://t.co/HxTpWPuByT
I should try switching my paid subscription to Box but I’d still need to keep Dropbox installed for 1Password and a couple other apps 😕
@jakemarsh:
On the real though, Google going at Apple head to head like this is going to be awesome for people who like either OS. Competition FTW.
@ID_R_McGregor:
REALLY impressive visuals on this first title for #GoogleDaydream. [pic.twitter.com]
@benthompson:
Designing multiple Google Home devices to work together is a genuine improvement over the Echo.
@pierce:
So Google’s move is to make the same hardware as everyone else and bet that it does AI better than anyone.
It’s gonna work
The big question is whether the general public ever cares about Apple’s emphasis on privacy. (Which is unlikely.) #lastRT
@sdw:
Google, meanwhile: “hey all, put our always-on microphones in your house!” [twitter.com]
So does Samsung abandon Android now? Can you launch a completely new smartphone OS in 2017?
Is it my particular echo chamber or does the internet as a whole not give a shit if the Pixel’s camera is as good as Google says it is?
5 October
The next frontier with digital assistants will be to recognize hesitations & corrections so you don’t have to mentally draft your query in advance.
Sierra has decided I should speak British English and I don’t think I can tell it otherwise without losing French spellcheck.
Also interesting: the headset is mostly made of fabric, not just covered with it. If only Google had brought the same care to its phone’s design.
PSVR reviews are coming out and Amazon tells me not to expect my headset for a whole month 😞
Such a shame that Sony designed the best VR headset in many ways but falters on tracking by clinging to a six-year-old technology just so it could advertise a camera-less SKU under $400 — when in fact almost nobody already owns the camera.
@MobyGames:
Promo Art Of Day: screenshot of original level editor for Core/Eidos’ Tomb Raider (PC, 1996): [mobygames.com] https://t.co/0JiCOoxhLu
6 October
Ma chambre fait 8m² et j’ai perdu mon sac de spo… de sp… mon sac marqué du sceau de la déesse de la victoire.
Thinking about a distributed alternative to Twitter: maybe you can’t blockchain the tweets, but just the global user directory?
@NEwertKrocker:
Before Sunrise (1995)
Before Sunset (2004)
Before Midnight (2013)
Until Dawn (2015)
Chrome regularly sends the wrong tab’s URL to Handoff. As if it wasn’t random enough whether Continuity is gonna work or not.
The keynote for Oculus’ developer conference actually feels like a developer conference instead of a sales pitch. That’s disconcerting.
@tim:
Here’s Zuck’s VR selfie - combining an avatar, 360 video and FB Messenger video call #oc3 [facebook.com] https://t.co/VIYjdbexhq
@KielO:
apple has to reverse this kapeli decision or people are going to start using review manipulation to take out competitors.
@rgriff:
It’s quite scary that it’s apparently as easy as buying paid reviews for a competitor’s app to get them out of the App Store. #NotRight
@AhnethAhra:
The world’s oldest cat, who is 31, looks exactly how I expect the world’s oldest cat to look. Sick of your shit af. https://t.co/84vcNRqF8p
7 October
@ashfurrow:
So Apple’s not budging on this – Schiller’s not budging on this. They want us to trust Apple. Which, frankly, is asking quite a lot.
@mattdpearce:
The year is 2016. The first Turing Test was passed by a robot built to engage trolls in eternal combat https://t.co/12LeENHItb
@ReformedBroker:
Why is Snapchat engagement going nuts? No public replies to your content appear. People are tired of getting destroyed online everyday. https://t.co/4rtAw7tbGu
Le chat continue d’indiquer son envie de jouer en prenant son jouet et en le reposant, à trois mètres de là où je suis assis.
8 October
Je ne sais pas si l’épisode 1 a été rajouté après coup ou non, mais le deuxième Westworld aurait fait un bien meilleur pilote.
Did Feedly forget my sort order preference for every single folder because they were so proud of the new choice they added?
Also, “Sort by Oldest” or “Latest” DOESN’T FUCKING TELL THE USER WHICH WAY YOU’RE SORTING.
Spotify alterne morceaux chiants et bonne musique, du coup je n’arrive pas à décider si je sors ou non.
Je vais probablement me faire chier dans les deux cas donc la raison dicterait de choisir l’option qui ne coûte rien, mais pff…
9 October
@DKThomp:
“America: 2016” toyed artfully w surreality but the show’s final eps were strewn with deus ex machina revelations and heavy handed symbolism https://t.co/P9WWXIBBmJ
@GynoStar:
“Men feel entitled to women’s bodies.”
“Not all men!”
“Trump says he’s entitled to women’s bodies.”
“But all men talk like that.”
10 October
@jakewyattriot:
look at the terrifying civility and decency of these polite-ass canadians GOOD LORD [pic.twitter.com]
@stroughtonsmith:
One fun fact about Assassin’s Creed games: they use procedural generation to lay out the blocks of houses. Drawn like bezier paths on map
Je sors vite fait acheter du PQ, des millions de gens dans la rue et autant à Franprix, mais c’est horrible Paris en fait.
Maybe once everyone starts receiving their headsets I’ll be too jealous to keep reloading /r/PSVR so I’ll have time to work a little again.
Thumper on PSVR
Love seeing the view start to shake more and more as he gets into the music. Also, need.
There’s beginning to be way too many day-one games I want to play 💸💸💸
11 October
Merde, j’avais rage-quitté Halt and Catch Fire à la fin de la première saison et je ne me rappelle pas pourquoi.
EST-CE QUE C’EST SI COMPLIQUE D’ARRETER DE BOUFFER QUAND TON ESTOMAC EST PLEIN emoji vomi de chat
@tapbot_paul:
If Apple didn’t contact the Dash guy on both accounts before nuking them, that’s a big problem.
@colincornaby:
I don’t think Apple sees their relationship with developers as a partnership, but most developers do, and all developers should.
@glassbottommeg:
Could we just… stop… doing female-specific animation? This isn’t how women move. Definitely not women in armor. https://t.co/esTgF1Pjdh
@pointclickbait:
Deus Ex Developers Confused By Mafia 3: “I Didn’t Realise You Could Use Race To Make A Political Statement” https://t.co/DMXjSRvJgt https://t.co/YsDldgyeCk
@iamleyeti:
And also, take a look at this stunning portraits of LGBTQ people in China: [washingtonpost.com]
Would be nice if, instead of refunding a Steam game you don’t enjoy through no particular fault of its own, you could gift it to a friend.
12 October
@BelgianBoolean:
“My house has a working total home automation system including touchscreen….. from 1985” [imgur.com]
We’re providing future generations a live feed of what the rise of fascism looks like and they’ll ignore it because it won’t be holovideo.
13 October
Whoa, icon labels? Is Snapchat about to give up on bad UX?
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
The iPhone could do the same for all I know (though I don’t remember Apple ever bragging about single-shot HDR?) but the technique’s interesting anyway.
14 October
Trying to figure out why my site screws up the names of uploaded files and oh my god are you kidding me
@eurogamer:
PSVR’s cinema mode works with Xbox One, PC, Mac and Wii U - but there’s a big catch. Digital Foundry tests it out. https://t.co/02fuP10Z8H https://t.co/gGFfDvmPSz
Trying to resist the urge to download every single PSVR game while I wait for my package to be delivered.
Driveclub and Rez are no-brainers but the question is: Batman or Job Simulator or both?
On s’approche dangereusement du stade où la déception est mathématiquement inévitable
Thumper. Jesus fuckinh christ, guys. Thumper in VR. Mouth agape from beginning to end (successful first run, natch).
I’m saving Area X for another day and it’s supposed to be amazing, but so far Thumper unexpectedly outshines replaying Rez in VR.
Speaking of Thumper, the bass on the PSVR’s included earbuds is really good. Wonder how expensive Sony’s retail equivalent is.
@Sci_Phile:
The Extraordinary Details of Tiny Creatures Captured with a Laser-Scanning Microscope by Igor Siwanowicz https://t.co/EsXBFMknsH https://t.co/yd0yjjhp4R
15 October
@jephjacques:
Randy Munroe shared with me perhaps the greatest sequence of bird photos ever taken [falseredstart.tumblr.com]
Is there a schematic somewhere explaining why moving the PSVR forward doesn’t make the picture look smaller but only changes FoV? #optics
Y’a encore des tonnes de gens partout dans les rues c’est horrible mais que fait la police 😱
16 October
Chewing gum allowed me to play the Battlezone demo but Here They Lie is still impossible. Pity.
Limited as it is (and why is the included music so terrible?), Harmonix’s Easel is proof that Tilt Brush is VR’s killer app for me.
Disappointed that the lap times in Driveclub’s career haven’t been updated to be achievable with hardcore handling enabled.
Between the mess of pixels that is Driveclub and the lack of a proper Tilt Brush, I’m more impatient than ever to get a PC.
@emmaggarland:
for anybody who has claimed this week that the legal system is designed to protect victims of sexual assault: https://t.co/Eb2SMyW46S
Rez’s Area 5 is the only one that really works for me in VR. Area X’s particle effects suffer too much from low res. Also, too swoopy. Ick.
17 October
18 October
Un moment de flottement quand je me retrouve face à l’hologramme taille réelle de Robin dans Arkham VR 😳
Not the most memorable game, but Wayward Sky is well worth experiencing for the way it plays with scale.
And anyone who complains about Arkham VR’s length is “part of the problem.” So beautiful, so well made, a master class in narrative gaming in VR.
I’ve been having tracking issues all day and now that I’ve taken the headset off it feels weird that the real world isn’t floating about.
@haydencd:
Open-world games are elaborate model train sets for the digital age.
@HelenaRiches:
Think you’re having a bad day? Spare a thought for contractors who set off fire system at Oklahoma National Guard… http://t.co/Kw67ldZkpe
TIL you can’t use your PC account in the Xbox version of Elite, so I’m not impatient for a PSVR port anymore. I am not starting over.
The one thing I didn’t anticipate is how quickly, and how strongly, having access to VR makes me impatient to get better VR.
I really hope it’s because PSVR is flawed and its experiences shallow, rather than me just being old and perpetually dissatisfied.
@McHenryJD:
Rory Gilmore doesn’t know how to hold everyday objects, a series [pic.twitter.com]
19 October
That kind of bullshit could very well be the end of Amazon for electronics and computer sales.
@fafner:
The macOS crash report is a document based app? 🙃 [pic.twitter.com]
@prostheticknowl:
Dynamic projection mapping onto deforming non-rigid surface: Impressive tech demo from @IshikawaLab https://t.co/GQBnJRaELy https://t.co/REx52ex8Lv
20 October
No touchscreen? That thing better be cheap. Anyway, good name, good concept, and the removable controllers would be too fiddly for the public if they weren’t backed by Nintendo’s brand power.
@LeReilly:
Le trailer de la switch, une vision dark de la vie d’adulte où tu essayes de jouer quand tu peux mais y’a toujours un truc pour te déranger.
Si on supprimait complètement le klaxon des voitures, là, comme ça, est-ce qu’il y aurait le moindre accident supplémentaire ?
C’est quoi ce bordel de rayon de chocolats de Noël un 20 octobre ? Ils se sont trompés en commandant le stock de Halloween ?
@weird_hist:
As a breed, corgies date back over 1,000 years. So this medieval battle scene could be accurate. [pic.twitter.com]
Mais qui a décidé que Wolverine pouvait porter un film solo (et encore moins trois) ?
21 October
Okay, the controllers and an audience willing to pay $60 for a game.
This could’ve been a chance to find out whether our annus horribilis was better or worse without Twitter. But not with PSN being down too 😨
22 October
@meropemills:
NY Times Critic Pans Show After Accidentally Watching First Two Episodes Out of Order [mediaite.com] via @mediaite
@dbreunig:
“It’s remarkable that virtually an entire co’s product line has been turned into a botnet that is attacking the US.” https://t.co/5ldYnGZPXn
23 October
@WickedGood:
Apple’s built Game Center, which has been terrible since the beginning and somehow got worse.
@WickedGood:
Apple built Metal into macOS but I still can’t play Overwatch on my year-old MacBook Pro, and it can barely run XCOM 2.
@WickedGood:
Apple positioned the Apple TV as a gaming console but required Siri remote control at launch and didn’t pack in a gamepad so no games sold.
@WickedGood:
Those are three pretty significant failures in gaming since iOS was released, and they all took a significant amount of effort to implement.
@WickedGood:
So maybe it’s not Apple isn’t interested, but they fundamentally don’t understand gaming and iOS games have been successful despite them.
24 October
I went to the outside and survived AMA
Ca me fascine vraiment, d’un point de vue humain, Trump qui est prêt à mettre son pays à feu et à sang plutôt que d’admettre pouvoir perdre.
@noahmccormack:
If you ask leading AI people about perpetuating implicit bias, they appear not to be able to comprehend the question https://t.co/sMe7Cn3xU4 https://t.co/Cp3LpI6rmd
Mac mini’s major GPU glitches appeared a couple days ago, and just disappeared with 10.12.1.
I suspected / hoped it was software but this is too good to be true.
25 October
There’s a good chance that the Watch’s redeeming feature, fitness tracking, was pushed by Cook himself, for instance.
@micahflee:
Upgrade to iOS 10.1 right now. It fixes a remote code execution vulnerability that’s exploited by getting you to open a malicious JPEG. https://t.co/VpY7fpJlyP
@micahflee:
If you’re running Mac OS X Sierra, upgrade to the 10.12.1 now. It’s vulnerable too [support.apple.com] https://t.co/GpmS8Nl6j5
People are complaining about the iOS update asking for their passwords, but neither of my devices did. Have I gotten a fake update?
@rhtkth:
Whitespace, whether in the form of an opening bracket line or a blank line after a method declaration makes code more readable. Period.
@rhtkth:
This isn’t an opinion. It’s design. Same reason paraph headers have a bigger padding between them than the lines in the paragraph.
I’ll get my complaint in early: the completely invisible Touch ID sensor (slash power button, presumably) is, once more, design over UX.
@tapbot_paul:
The Escape key is a relic of the Patriarchy. Why would I ever want to escape Apple? Apple is Mother, Apple is Father.
Also this better be a shitty mockup from an intern because everything’s off-center vertically, in addition to the odd margin on ‘Cancel’.
I was wondering how unreliable the touch bar would be in Boot Camp, but if it is powered by its own CPU it could pretend to be a keyboard.
@emarley:
I’m a little nervous about the availability of a key which is in command-option-escape being software-controlled. #Rumors
26 October
The “Move selected messages to Junk” icon is an odd thing to change in a .1 release but nice timing—started using it recently and it sucked.
I powered through tracking issues on my last PSVR sessions because I was just mildly uncomfortable, but it’s killed any urge to play again.
I knew to stop at the first hint of nausea, but it never got anywhere near that.
That damn wetware is so fiddly.
Oh. Ohhh. Même en entendant la réplique “go black hat with me” je n’ai pas immédiatement réalisé que black-hat / white-hat venait des westerns.
Je trouvais bien que c’était une blague étonnamment geek, même pour une série qui parle de robots et jeux vidéo.
I don’t know how useful it can be in real (adult) life but would you believe that Microsoft Paint 3D is legitimately cool.
@jkottke:
Twitter’s “What’s happening?” prompt sounds more and more frantic as the year progresses.
I was making the argument to a friend yesterday that good old productivity apps were gonna move to 3D and VR (more significantly than this).
Did they really announce $300 VR headsets (sans positional tracking I assume) in ten seconds and move on?
Note that Microsoft already has ready-to-use inside-out positional tracking algorithms, with HoloLens.
Funny how the new Surface Book is thicker in the middle, but keeps the appearance of a gap on the sides.
Surface Studio very smartly and efficiently aimed at the creative professionals who are more and more disappointed with Apple.
Microsoft showing Apple a thing or two about making a desirable computer. Damn.
@danielpunkass:
Apple’s response for creative professionals: “No more pesky function keys!”
@aegies:
Microsoft bringing a comic creator on stage is also really fucking smart.
Google, going for the iPhone’s jugular, cloned a 3-year-old design. Microsoft, going after the Mac, makes every creative’s dream computer 😮
@CraigGrannell:
Android/iOS Pinball fans, grab PinOut when it shows up tomorrow: [youtube.com] • Gorgeous endless pinball from the future.
@darrenrovell:
Taco Bell in the U.K. is now selling a quesadilla filled with melted Kit Kats instead of cheese (H/T @BillyGrenham) https://t.co/sO5oYUOMN4
@rgriff:
Preparing for the demise of the Escape key…10.12 vs 10.12.1. [pic.twitter.com]
I’d complain that people won’t know how to remove you from a needless group reply but they never did anyway.
A double-digit percentage of Google Assistant’s daily fun facts arrive in the wrong order
Instagram Stories still doesn’t remember your choice of brush and ink. It’s not like people make wildly different art from day to day.
27 October
Deleting my Twitter until each and everyone of you has posted or retweeted their own different yet identical “Apple lost its AirPods” joke.
@thedextriarchy:
Has anybody made a Black Mirror parody that’s just a series of alarmist dystopian yarns about now-mundane pieces of 20th-century tech?
@thedextriarchy:
Yes! A retro-futuristic series that’s essentially a smarmy, narrowly technophobic version of The Twilight Zone. https://t.co/UALXoV1aH4
@cwarzel:
a quick thought about Twitter killing Vine: i think you can look to this statement by Twitter early this month (which was overlooked!) https://t.co/X5lZ0ZQ1Ya
@jesse_squires:
They always say “the best iPhone ever made” — not “the best iOS ever made” 🤔
@marcoarment:
Touch Bar might end up being really cool, but we’ll have to see in practice. Seems weird to constantly look down at your keyboard.
@philletourneau:
I’d have thought all you grumpy old-school ppl would like that fact that you can keep your hands on the keyboard instead of using the mouse.
@BenBajarin:
Apple’s vision of touch on a Mac is to add the benefits of touch closer to where you fingers actually are when you work.
Sensible.
Okay, the customizable control strip and instant user switching with Touch ID are cool. (The latter is long overdue on iPad.)
@ow:
the switch to USB C is gonna hurt, but i’m glad apple’s doing it, otherwise we’ll never get there [pic.twitter.com]
@SteveStreza:
Apple: “You can stop looking at your art and drag your finger across a tiny screen to change colors.”
Microsoft: https://t.co/XCYExgQpO8
@tapbot_paul:
Why didn’t they make that Touch Bar the same height as the keys? Looks like plenty of space.
Some of the Touch Bar demos were cool, but they all showed stuff that would be a million times more useful if the touch-sensitive area was, like, you know, an entire screen.
“So we’ve got a 13-inch MacBook Pro with Touch Bar and a 13-inch MacBook Pro without a Touch Bar expressly designed to cannibalize the MacBook Air which still exists.” NOTHING ABOUT THIS MAKES SENSE.
My next computer purchase was always gonna be a VR/gaming PC but tonight for the first time that thought just makes me glad.
Well, not ‘glad’.
@danielpunkass:
I don’t think it’s fair that ESC got swept out with the rest of the Function Keys. It doesn’t pass the same test for low use as others.
Assuming I find a decent text editor, the app I’d miss the most on Windows is Tweetbot. And Twitter’s not a good reason for anything.
@dmoren:
There are no or rose gold MacBook Pros so Apple can roll them out next year to fill time in the event where they don’t update the Mac Pro.
@drance:
MagSafe was a top-ten Apple-at-its-best invention for me. A huge, tiny thing that you immediately couldn’t imagine living without. RIP.
28 October
@jcieplinski:
I get the frustrations with cable replacement and dongles. I really do. On the other hand, I’m glad we’re not still using ADB and SCSI.
@nhqe:
I knew I’d seen Apple’s Touch Bar somewhere before… [youtube.com]
I know search is complicated but it took me a whole hour of wanting to kill myself before I found this post and that’s a little too long.
@stroughtonsmith:
And there you have it. Apple’s T1 chip runs an iOS (technically watchOS for armv7k) variant [twitter.com]
@ZevEisenberg:
A surprise (to me): the Touch Bar supports Wide Color. I wonder if that’s just a pro thing, or if we’ll see it on the next Apple Watch?
I mean, yes, make the box smaller for most people who don’t need the extension, sure — but $19!?
@DanStapleton:
I’d be happy if the only VR component added onto most non-VR games was the ability to walk around the game environment.
@abdophoto:
Yesterday:
“Microsoft is out innovating Apple”
“Buying a Studio?”
“No”
Today:
“These MacBooks are meh”
“Buying one?”
“Hell Yes”
@itsjamesherring:
Genius Anti Trump campaign on a bus in Denmark reminds Americans abroad to vote. [pic.twitter.com] (via @MadsAlbers + Nord Martin)
@ckolderup:
When Medium shuts down we’re gonna lose SO many posts about other startups shutting down
Wait, did Apple price the MacBook line up and kill the 11” Air so people would be forced to consider the iPad instead? 😨
The profit margin must be higher on an iPad than a MacBook Air, right?
Taking a shower with my locked Watch (I suppose this is new to watchOS 3.1)
29 October
I love that Playroom VR’s social screen is a separately rendered visual and I’ll never tire of seeing VR avatars wearing goggles.
Like those Twitch streams of Job Simulator with a virtual camera view — YOU DOWNLOADED YOURSELF INTO THE GAME, MAN!
On this week’s Gadget Lab David Pierce mentions that, while demoing the new MacBook Pro, he tapped an icon on the Touch Bar that triggered a menu to appear on screen, and he naturally when to touch and select an option — twice before realizing his error. To which the Apple rep laughed and said “don’t worry, everyone did this” without realizing how damning her remark was from a UX design perspective. (In her defense, neither did Pierce, since he doesn’t mention it in his writeup.)
As others have said, the Touch Bar is probably the most definitive evidence that Apple does not intend to make touch-screens Macs in the foreseeable future. So it’s pretty funny that real-world user experience with the Touch Bar may well be what pushes to Apple to relent and add a touch-screen to the next MacBook. (In whichever decade “the next MacBook” might be launched.)
Even if you still use the keyboard and trackpad for most things, it’s becoming more and more absurd for any device to have a screen you can not interact directly with. Look at how the next Nintendo console reportedly has a touch-screen even though it wasn’t demonstrated at all in the reveal video and the screen will be hidden inside a dock during half of its operation.
The UI is a pain but Star Trek Online’s design-an-alien is neat #PS4share
@olivercameron:
Enhance a low resolution image using a deep neural net with a simple command: “python3 enhance.py image.png” https://t.co/Qy1DLyQEI8
@olivercameron:
Tried this out, wow! Down-sampled a photo of my cute kid to 250x167px, ran it through the neural net and 15 seconds later… https://t.co/EIqiHBZ84D
@stroughtonsmith:
Incidentally one of the primary reasons I touch the screen on a hybrid Windows tablet in ‘desktop’ use https://t.co/P96BGOIACh
Les cordons de mon hoodie ont des embouts métalliques et il faut vraiment que j’arrête de le porter à la maison avant de me casser une dent.
Deux mois de vie sociale et six mois à me dire que meh ça n’apporte rien de bon. Rinse and repeat.
30 October
I keep wondering whether The 7 Plus’s fake bokeh will durably lower the bar for what is acceptable photoshopping or we’ll grow out of it.
I feel like I should be past the point of making up completely unsubstantiated theories to excuse Apple but, considering how absurd it is for an all-Thunderbolt 3 new ‘Pro’ laptop not to be launched alongside a dock with external GPU, one could start to wonder — what if the reason the keynote happened so late in October, and the reason it was so long and boring, was that they were ironing the last kinks in an external GPU system, and eventually had to postpone its launch?
No, I don’t know why I do this to myself. And it’s fun to dream anyway since I couldn’t afford a new MacBook Pro if I wanted one.
@Campster:
TIL that Max Von Sydow wore old man makeup in The Exorcist
I had previously just assumed he was an immortal.
@cabel:
computer, increase cyberpunk dystopia by 250% [pic.twitter.com]
Chaque année j’ai autant de mal à accepter que l’heure d’hiver est celle qui est plus proche de l’heure “normale”
@milend:
Apple is tuning the tradeoffs to casual consumers across its entire product line, leaving pros out in the cold. https://t.co/830wrpOpiO
I hadn’t even launched the Headmaster demo because ugh sports, but it’s really fun. And it’s almost a horror games at times.
31 October
Tried getting back to Bloodborne; I have no idea how anything works anymore.
Was thinking about what I’d miss if I switched to a mid-range Android phone (I don’t use my iPhone much) and oh right I also have the Watch.
Qu’est-ce qui détermine l’authenticité d’une pièce de monnaie ? Peut-on la regraver au laser et continuer à l’utiliser ?
J’ai acheté un paquet de Celebrations et je vais le manger tout seul
@iglvzx:
Does Twitter really have no vetting for promoted tweets? This is a straight up phishing attempt. @Support #InfoSec https://t.co/EaVhnXwb3K
Archives
2001 01 02 03 04 05 06 07 08 09 10 11 12
2002 01 02 03 04 05 06 07 08 09 10 11 12
2003 01 02 03 04 05 06 07 08 09 10 11 12
2004 01 02 03 04 05 06 07 08 09 10 11 12
2005 01 02 03 04 05 06 07 08 09 10 11 12
2006 01 02 03 04 05 06 07 08 09 10 11 12
2007 01 02 03 04 05 06 07 08 09 10 11 12
2008 01 02 03 04 05 06 07 08 09 10 11 12
2009 01 02 03 04 05 06 07 08 09 10 11 12
2010 01 02 03 04 05 06 07 08 09 10 11 12
2011 01 02 03 04 05 06 07 08 09 10 11 12
2012 01 02 03 04 05 06 07 08 09 10 11 12
2013 01 02 03 04 05 06 07 08 09 10 11 12
2014 01 02 03 04 05 06 07 08 09 10 11 12
2015 01 02 03 04 05 06 07 08 09 10 11 12
2016 01 02 03 04 05 06 07 08 09 10 11 12
2017 01 02 03 04 05 06 07 08 09 10 11 12
2018 01 02 03 04 05 06 07 08 09 10 11 12
2019 01 02 03 04 05 06 07 08 09 10 11 12
|
{
"url": "http://www.garoo.net/en/archives/2016/10/",
"source_domain": "www.garoo.net",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "205942",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BJPR4NQHJRPGSYCMB6P3ZWRKKV6LBFXM",
"WARC-Concurrent-To": "<urn:uuid:85ddb1a5-5bec-4262-98c9-4f26e28d5b97>",
"WARC-Date": "2019-09-23T06:53:35Z",
"WARC-IP-Address": "51.68.77.213",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ERKSF2NSFRCHG6J6XLAFOGKID3QBBW4C",
"WARC-Record-ID": "<urn:uuid:5b1a5861-70e6-4350-b561-b76870c5782a>",
"WARC-Target-URI": "http://www.garoo.net/en/archives/2016/10/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f205ebed-5bed-4cc8-81a7-5b89fb8fb83a>"
},
"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-108.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,
121,
122,
137,
138,
256,
257,
267,
268,
309,
310,
451,
452,
465,
466,
593,
594,
629,
630,
717,
718,
792,
793,
827,
828,
962,
963,
973,
974,
982,
983,
1083,
1084,
1218,
1219,
1230,
1231,
1365,
1366,
1505,
1506,
1639,
1640,
1691,
1692,
1702,
1703,
1781,
1782,
1874,
1875,
2016,
2017,
2073,
2074,
2207,
2208,
2347,
2348,
2362,
2363,
2479,
2480,
2504,
2505,
2641,
2642,
2654,
2655,
2791,
2792,
2808,
2809,
2894,
2895,
2909,
2910,
3006,
3007,
3016,
3017,
3124,
3125,
3141,
3142,
3264,
3265,
3271,
3272,
3361,
3362,
3454,
3455,
3591,
3592,
3602,
3603,
3751,
3752,
3878,
3879,
4025,
4026,
4119,
4120,
4360,
4361,
4373,
4374,
4508,
4509,
4519,
4520,
4630,
4631,
4759,
4760,
4776,
4777,
4799,
4800,
4821,
4822,
4845,
4846,
4864,
4865,
4991,
4992,
5128,
5129,
5135,
5136,
5265,
5266,
5274,
5275,
5397,
5398,
5407,
5408,
5544,
5545,
5558,
5559,
5699,
5700,
5710,
5711,
5723,
5724,
5857,
5858,
5872,
5873,
6000,
6001,
6018,
6019,
6179,
6180,
6306,
6307,
6317,
6318,
6445,
6446,
6570,
6571,
6662,
6663,
6767,
6768,
6896,
6897,
6907,
6908,
6918,
6919,
7084,
7085,
7096,
7097,
7136,
7137,
7152,
7153,
7199,
7200,
7230,
7231,
7242,
7243,
7259,
7260,
7362,
7363,
7381,
7382,
7520,
7521,
7644,
7645,
7785,
7786,
7802,
7803,
7892,
7893,
7963,
7964,
7975,
7976,
8089,
8090,
8188,
8189,
8203,
8204,
8300,
8301,
8316,
8317,
8446,
8447,
8464,
8465,
8601,
8602,
8619,
8620,
8776,
8777,
8789,
8790,
8886,
8887,
9026,
9027,
9038,
9039,
9056,
9057,
9158,
9159,
9298,
9299,
9310,
9311,
9370,
9371,
9489,
9490,
9643,
9644,
9655,
9656,
9760,
9761,
9773,
9774,
9937,
9938,
10044,
10045,
10133,
10134,
10220,
10221,
10338,
10339,
10469,
10470,
10597,
10598,
10610,
10611,
10764,
10765,
10776,
10777,
10791,
10792,
10903,
10904,
11042,
11043,
11136,
11137,
11148,
11149,
11245,
11246,
11378,
11379,
11503,
11504,
11628,
11629,
11644,
11645,
11779,
11780,
11920,
11921,
11932,
11933,
11944,
11945,
12050,
12051,
12156,
12157,
12303,
12304,
12442,
12443,
12454,
12455,
12524,
12525,
12540,
12541,
12679,
12680,
12814,
12815,
12940,
12941,
13072,
13073,
13085,
13086,
13169,
13170,
13181,
13182,
13277,
13278,
13287,
13288,
13356,
13357,
13375,
13376,
13524,
13525,
13536,
13537,
13729,
13730,
13741,
13742,
13883,
13884,
14011,
14012,
14137,
14138,
14151,
14152,
14267,
14268,
14354,
14355,
14366,
14367,
14436,
14437,
14577,
14578,
14589,
14590,
14604,
14605,
14720,
14721,
14732,
14733,
14874,
14875,
14886,
14887,
14900,
14901,
14995,
14996,
15009,
15010,
15130,
15131,
15144,
15145,
15285,
15286,
15299,
15300,
15441,
15442,
15455,
15456,
15594,
15595,
15606,
15607,
15646,
15647,
15788,
15789,
15805,
15806,
15971,
15972,
16065,
16066,
16135,
16136,
16147,
16148,
16266,
16267,
16279,
16280,
16440,
16441,
16453,
16454,
16581,
16582,
16714,
16715,
16724,
16725,
16861,
16862,
16871,
16872,
17003,
17004,
17141,
17142,
17156,
17157,
17275,
17276,
17414,
17415,
17554,
17555,
17565,
17566,
17688,
17689,
17700,
17701,
17842,
17843,
17983,
17984,
18065,
18066,
18098,
18099,
18243,
18244,
18357,
18358,
18481,
18482,
18492,
18493,
18583,
18584,
18725,
18726,
18832,
18833,
18936,
18937,
19042,
19043,
19170,
19171,
19251,
19252,
19268,
19269,
19345,
19346,
19355,
19356,
19430,
19431,
19571,
19572,
19588,
19589,
19712,
19713,
19728,
19729,
19869,
19870,
19879,
19880,
19959,
19960,
20069,
20070,
20160,
20161,
20296,
20297,
20308,
20309,
20449,
20450,
20467,
20468,
20603,
20604,
20621,
20622,
20758,
20759,
20769,
20770,
20929,
20930,
20946,
20947,
21024,
21025,
21039,
21040,
21171,
21172,
21189,
21190,
21331,
21332,
21345,
21346,
21467,
21468,
21478,
21479,
21605,
21606,
21611,
21612,
21728,
21729,
21743,
21744,
21846,
21847,
21882,
21883,
21897,
21898,
21991,
21992,
22166,
22167,
22367,
22368,
22493,
22494,
22512,
22513,
22529,
22530,
22666,
22667,
22801,
22802,
22811,
22812,
22951,
22952,
22961,
22962,
23098,
23099,
23110,
23111,
23125,
23126,
23262,
23263,
23270,
23271,
23337,
23338,
23476,
23477,
23495,
23496,
23602,
23603,
23618,
23619,
23755,
23756,
23853,
23854,
23869,
23870,
23990,
23991,
24003,
24004,
24015,
24016,
24052,
24053,
24072,
24073,
24078,
24079,
24086,
24087,
24112,
24113,
24127,
24128,
24139,
24140,
24158,
24159,
24290,
24291,
24303,
24304,
24393,
24394,
24515,
24516,
24587,
24588,
24664,
24665,
24676,
24677,
24807,
24808,
24924,
24925,
25410,
25411,
25787,
25788,
26160,
26161,
26235,
26236,
26252,
26253,
26386,
26387,
26403,
26404,
26551,
26552,
26570,
26571,
26698,
26699,
26840,
26841,
26940,
26941,
26952,
26953,
27091,
27092,
27569,
27570,
27700,
27701,
27712,
27713,
27772,
27773,
27823,
27824,
27832,
27833,
27897,
27898,
28012,
28013,
28022,
28023,
28159,
28160,
28285,
28286,
28297,
28298,
28375,
28376,
28517,
28518,
28639,
28640,
28709,
28710,
28719,
28720,
28859,
28860,
28869,
28870,
28911,
28912,
28953,
28954,
28995,
28996,
29037,
29038,
29079,
29080,
29121,
29122,
29163,
29164,
29205,
29206,
29247,
29248,
29289,
29290,
29331,
29332,
29373,
29374,
29415,
29416,
29457,
29458,
29499,
29500,
29541,
29542,
29583,
29584,
29625,
29626
],
"line_end_idx": [
121,
122,
137,
138,
256,
257,
267,
268,
309,
310,
451,
452,
465,
466,
593,
594,
629,
630,
717,
718,
792,
793,
827,
828,
962,
963,
973,
974,
982,
983,
1083,
1084,
1218,
1219,
1230,
1231,
1365,
1366,
1505,
1506,
1639,
1640,
1691,
1692,
1702,
1703,
1781,
1782,
1874,
1875,
2016,
2017,
2073,
2074,
2207,
2208,
2347,
2348,
2362,
2363,
2479,
2480,
2504,
2505,
2641,
2642,
2654,
2655,
2791,
2792,
2808,
2809,
2894,
2895,
2909,
2910,
3006,
3007,
3016,
3017,
3124,
3125,
3141,
3142,
3264,
3265,
3271,
3272,
3361,
3362,
3454,
3455,
3591,
3592,
3602,
3603,
3751,
3752,
3878,
3879,
4025,
4026,
4119,
4120,
4360,
4361,
4373,
4374,
4508,
4509,
4519,
4520,
4630,
4631,
4759,
4760,
4776,
4777,
4799,
4800,
4821,
4822,
4845,
4846,
4864,
4865,
4991,
4992,
5128,
5129,
5135,
5136,
5265,
5266,
5274,
5275,
5397,
5398,
5407,
5408,
5544,
5545,
5558,
5559,
5699,
5700,
5710,
5711,
5723,
5724,
5857,
5858,
5872,
5873,
6000,
6001,
6018,
6019,
6179,
6180,
6306,
6307,
6317,
6318,
6445,
6446,
6570,
6571,
6662,
6663,
6767,
6768,
6896,
6897,
6907,
6908,
6918,
6919,
7084,
7085,
7096,
7097,
7136,
7137,
7152,
7153,
7199,
7200,
7230,
7231,
7242,
7243,
7259,
7260,
7362,
7363,
7381,
7382,
7520,
7521,
7644,
7645,
7785,
7786,
7802,
7803,
7892,
7893,
7963,
7964,
7975,
7976,
8089,
8090,
8188,
8189,
8203,
8204,
8300,
8301,
8316,
8317,
8446,
8447,
8464,
8465,
8601,
8602,
8619,
8620,
8776,
8777,
8789,
8790,
8886,
8887,
9026,
9027,
9038,
9039,
9056,
9057,
9158,
9159,
9298,
9299,
9310,
9311,
9370,
9371,
9489,
9490,
9643,
9644,
9655,
9656,
9760,
9761,
9773,
9774,
9937,
9938,
10044,
10045,
10133,
10134,
10220,
10221,
10338,
10339,
10469,
10470,
10597,
10598,
10610,
10611,
10764,
10765,
10776,
10777,
10791,
10792,
10903,
10904,
11042,
11043,
11136,
11137,
11148,
11149,
11245,
11246,
11378,
11379,
11503,
11504,
11628,
11629,
11644,
11645,
11779,
11780,
11920,
11921,
11932,
11933,
11944,
11945,
12050,
12051,
12156,
12157,
12303,
12304,
12442,
12443,
12454,
12455,
12524,
12525,
12540,
12541,
12679,
12680,
12814,
12815,
12940,
12941,
13072,
13073,
13085,
13086,
13169,
13170,
13181,
13182,
13277,
13278,
13287,
13288,
13356,
13357,
13375,
13376,
13524,
13525,
13536,
13537,
13729,
13730,
13741,
13742,
13883,
13884,
14011,
14012,
14137,
14138,
14151,
14152,
14267,
14268,
14354,
14355,
14366,
14367,
14436,
14437,
14577,
14578,
14589,
14590,
14604,
14605,
14720,
14721,
14732,
14733,
14874,
14875,
14886,
14887,
14900,
14901,
14995,
14996,
15009,
15010,
15130,
15131,
15144,
15145,
15285,
15286,
15299,
15300,
15441,
15442,
15455,
15456,
15594,
15595,
15606,
15607,
15646,
15647,
15788,
15789,
15805,
15806,
15971,
15972,
16065,
16066,
16135,
16136,
16147,
16148,
16266,
16267,
16279,
16280,
16440,
16441,
16453,
16454,
16581,
16582,
16714,
16715,
16724,
16725,
16861,
16862,
16871,
16872,
17003,
17004,
17141,
17142,
17156,
17157,
17275,
17276,
17414,
17415,
17554,
17555,
17565,
17566,
17688,
17689,
17700,
17701,
17842,
17843,
17983,
17984,
18065,
18066,
18098,
18099,
18243,
18244,
18357,
18358,
18481,
18482,
18492,
18493,
18583,
18584,
18725,
18726,
18832,
18833,
18936,
18937,
19042,
19043,
19170,
19171,
19251,
19252,
19268,
19269,
19345,
19346,
19355,
19356,
19430,
19431,
19571,
19572,
19588,
19589,
19712,
19713,
19728,
19729,
19869,
19870,
19879,
19880,
19959,
19960,
20069,
20070,
20160,
20161,
20296,
20297,
20308,
20309,
20449,
20450,
20467,
20468,
20603,
20604,
20621,
20622,
20758,
20759,
20769,
20770,
20929,
20930,
20946,
20947,
21024,
21025,
21039,
21040,
21171,
21172,
21189,
21190,
21331,
21332,
21345,
21346,
21467,
21468,
21478,
21479,
21605,
21606,
21611,
21612,
21728,
21729,
21743,
21744,
21846,
21847,
21882,
21883,
21897,
21898,
21991,
21992,
22166,
22167,
22367,
22368,
22493,
22494,
22512,
22513,
22529,
22530,
22666,
22667,
22801,
22802,
22811,
22812,
22951,
22952,
22961,
22962,
23098,
23099,
23110,
23111,
23125,
23126,
23262,
23263,
23270,
23271,
23337,
23338,
23476,
23477,
23495,
23496,
23602,
23603,
23618,
23619,
23755,
23756,
23853,
23854,
23869,
23870,
23990,
23991,
24003,
24004,
24015,
24016,
24052,
24053,
24072,
24073,
24078,
24079,
24086,
24087,
24112,
24113,
24127,
24128,
24139,
24140,
24158,
24159,
24290,
24291,
24303,
24304,
24393,
24394,
24515,
24516,
24587,
24588,
24664,
24665,
24676,
24677,
24807,
24808,
24924,
24925,
25410,
25411,
25787,
25788,
26160,
26161,
26235,
26236,
26252,
26253,
26386,
26387,
26403,
26404,
26551,
26552,
26570,
26571,
26698,
26699,
26840,
26841,
26940,
26941,
26952,
26953,
27091,
27092,
27569,
27570,
27700,
27701,
27712,
27713,
27772,
27773,
27823,
27824,
27832,
27833,
27897,
27898,
28012,
28013,
28022,
28023,
28159,
28160,
28285,
28286,
28297,
28298,
28375,
28376,
28517,
28518,
28639,
28640,
28709,
28710,
28719,
28720,
28859,
28860,
28869,
28870,
28911,
28912,
28953,
28954,
28995,
28996,
29037,
29038,
29079,
29080,
29121,
29122,
29163,
29164,
29205,
29206,
29247,
29248,
29289,
29290,
29331,
29332,
29373,
29374,
29415,
29416,
29457,
29458,
29499,
29500,
29541,
29542,
29583,
29584,
29625,
29626,
29666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 29666,
"ccnet_original_nlines": 750,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 8,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32188645005226135,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03235653042793274,
"rps_doc_frac_lines_end_with_ellipsis": 0.0013315599644556642,
"rps_doc_frac_no_alph_words": 0.23580585420131683,
"rps_doc_frac_unique_words": 0.4163980782032013,
"rps_doc_mean_word_length": 4.713537693023682,
"rps_doc_num_sentences": 332,
"rps_doc_symbol_to_word_ratio": 0.0030525000765919685,
"rps_doc_unigram_entropy": 6.755166530609131,
"rps_doc_word_count": 4964,
"rps_doc_frac_chars_dupe_10grams": 0.019488850608468056,
"rps_doc_frac_chars_dupe_5grams": 0.019488850608468056,
"rps_doc_frac_chars_dupe_6grams": 0.019488850608468056,
"rps_doc_frac_chars_dupe_7grams": 0.019488850608468056,
"rps_doc_frac_chars_dupe_8grams": 0.019488850608468056,
"rps_doc_frac_chars_dupe_9grams": 0.019488850608468056,
"rps_doc_frac_chars_top_2gram": 0.0032481399830430746,
"rps_doc_frac_chars_top_3gram": 0.00487220985814929,
"rps_doc_frac_chars_top_4gram": 0.006496279966086149,
"rps_doc_books_importance": -3091.697265625,
"rps_doc_books_importance_length_correction": -3091.697265625,
"rps_doc_openwebtext_importance": -1686.7601318359375,
"rps_doc_openwebtext_importance_length_correction": -1686.7601318359375,
"rps_doc_wikipedia_importance": -1309.0965576171875,
"rps_doc_wikipedia_importance_length_correction": -1309.0965576171875
},
"fasttext": {
"dclm": 0.01910370960831642,
"english": 0.7728778123855591,
"fineweb_edu_approx": 1.2128711938858032,
"eai_general_math": 0.01427465956658125,
"eai_open_web_math": 0.1530103087425232,
"eai_web_code": 0.005910160019993782
}
}
|
{
"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": "794.816",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,559,398,535,225,006,000 |
阿里云首页 云原生数据仓库AnalyticDB PostgreSQL版
TPC-H
AnalyticDB PostgreSQL 6.0版在支持ACID和分布式事务的同时，提供了优秀的大数据MPP分析性能。本文讲述如何运行TPC-H进行测试。
TPC-H简介
以下文字描述引用自TPC Benchmark™ H (TPC-H)规范：
“TPC-H是一个决策支持基准，由一套面向业务的临时查询和并发数据修改组成。选择的查询和填充数据库的数据具有广泛的行业相关性。该基准测试说明了决策支持系统可以检查大量数据，执行高度复杂的查询，并解答关键的业务问题。”
详情请参见TPCH Specification
说明
本文的TPC-H的实现基于TPC-H的基准测试，并不能与已发布的TPC-H基准测试结果相比较，本文中的测试并不符合TPC-H基准测试的所有要求。
前提条件
• 已注册阿里云账号。
• 已创建用于测试的AnalyticDB PostgreSQL实例。创建实例具体操作，请参见创建实例
本文测试的AnalyticDB PostgreSQL实例规格如下：
• 引擎版本：6.0标准版
• 节点规格（segment）：2C16G
• 节点数量（segment）：32
• 存储磁盘类型：ESSD云盘
• 节点存储容量（segment）：200 GB
• 已创建用于测试的ECS实例。创建实例具体操作，请参见创建实例
本文测试的ECS实例规格如下：
• 实例规格：ecs.g6e.4xlarge
• 操作系统：CentOS 7.x
• 系统盘：磁盘类型为ESSD云盘、容量为40 GiB、性能级别为PL1。
• 数据盘：磁盘类型为ESSD云盘、容量为2048 GiB、性能级别为PL3。
说明
ECS实例创建完成后需要挂载数据库，具体操作，请参见分区格式化数据盘（Linux）
• 已开通OSS并创建存储空间
• 已将ECS实例的IP地址添加到AnalyticDB PostgreSQL实例的白名单中，操作方式，请参见设置白名单
• 已在ECS上安装psql，安装方式，请参见psql
生成测试数据
1. 登录ECS实例，登录方式，请参见连接ECS实例
2. 在ECS上执行以下命令，下载TPC-H dbgen代码到数据盘并编译。
本文中数据盘的路径为/mnt
wget https://github.com/electrum/tpch-dbgen/archive/refs/heads/master.zip
yum install -y unzip zip
unzip master.zip
cd tpch-dbgen-master/
echo "#define EOL_HANDLING 1" >> config.h # 消除生成数据末尾的'|'
make
./dbgen --help
3. 在ECS上执行如下命令，生成1 TB测试数据集。建议使用分片文件，分片数量与AnalyticDB PostgreSQL版实例节点数量一致，例如本文中示例AnalyticDB PostgreSQL实例有32个计算节点，以下示例中将创建32个分片文件。
for((i=1;i<=32;i++));
do
./dbgen -s 1000 -S $i -C 32 -f &
done
说明
• 数据量的大小对查询速度有直接的影响，TPC-H中使用SF描述数据量，1SF对应1 GB单位。1000SF，即1 TB。1SF对应的数据量只是8个表的总数据量不包括索引等空间占用，准备数据时需预留更多空间。
• 后台运行dbgen程序时间较长，您可以通过ps- fHU $USER | grep dbgen命令查看进度，确保dbgen程序运行完成。
创建测试表
1. 使用psql连接AnalyticDB PostgreSQL，连接方式，请参见psql
2. 执行如下语句创建用于测试的8张表。
CREATE TABLE NATION (
N_NATIONKEY INTEGER NOT NULL,
N_NAME CHAR(25) NOT NULL,
N_REGIONKEY INTEGER NOT NULL,
N_COMMENT VARCHAR(152)
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED Replicated
;
CREATE TABLE REGION (
R_REGIONKEY INTEGER NOT NULL,
R_NAME CHAR(25) NOT NULL,
R_COMMENT VARCHAR(152)
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED Replicated
;
CREATE TABLE PART (
P_PARTKEY INTEGER NOT NULL,
P_NAME VARCHAR(55) NOT NULL,
P_MFGR CHAR(25) NOT NULL,
P_BRAND CHAR(10) NOT NULL,
P_TYPE VARCHAR(25) NOT NULL,
P_SIZE INTEGER NOT NULL,
P_CONTAINER CHAR(10) NOT NULL,
P_RETAILPRICE DECIMAL(15,2) NOT NULL,
P_COMMENT VARCHAR(23) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (P_PARTKEY)
;
CREATE TABLE SUPPLIER (
S_SUPPKEY INTEGER NOT NULL,
S_NAME CHAR(25) NOT NULL,
S_ADDRESS VARCHAR(40) NOT NULL,
S_NATIONKEY INTEGER NOT NULL,
S_PHONE CHAR(15) NOT NULL,
S_ACCTBAL DECIMAL(15,2) NOT NULL,
S_COMMENT VARCHAR(101) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (S_SUPPKEY)
;
CREATE TABLE PARTSUPP (
PS_PARTKEY INTEGER NOT NULL,
PS_SUPPKEY INTEGER NOT NULL,
PS_AVAILQTY INTEGER NOT NULL,
PS_SUPPLYCOST DECIMAL(15,2) NOT NULL,
PS_COMMENT VARCHAR(199) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (PS_PARTKEY)
;
CREATE TABLE CUSTOMER (
C_CUSTKEY INTEGER NOT NULL,
C_NAME VARCHAR(25) NOT NULL,
C_ADDRESS VARCHAR(40) NOT NULL,
C_NATIONKEY INTEGER NOT NULL,
C_PHONE CHAR(15) NOT NULL,
C_ACCTBAL DECIMAL(15,2) NOT NULL,
C_MKTSEGMENT CHAR(10) NOT NULL,
C_COMMENT VARCHAR(117) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (C_CUSTKEY)
;
CREATE TABLE ORDERS (
O_ORDERKEY BIGINT NOT NULL,
O_CUSTKEY INTEGER NOT NULL,
O_ORDERSTATUS "char" NOT NULL,
O_TOTALPRICE DECIMAL(15,2) NOT NULL,
O_ORDERDATE DATE NOT NULL,
O_ORDERPRIORITY CHAR(15) NOT NULL,
O_CLERK CHAR(15) NOT NULL,
O_SHIPPRIORITY INTEGER NOT NULL,
O_COMMENT VARCHAR(79) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (O_ORDERKEY)
ORDER BY(O_ORDERDATE)
;
CREATE TABLE LINEITEM (
L_ORDERKEY BIGINT NOT NULL,
L_PARTKEY INTEGER NOT NULL,
L_SUPPKEY INTEGER NOT NULL,
L_LINENUMBER INTEGER NOT NULL,
L_QUANTITY DECIMAL(15,2) NOT NULL,
L_EXTENDEDPRICE DECIMAL(15,2) NOT NULL,
L_DISCOUNT DECIMAL(15,2) NOT NULL,
L_TAX DECIMAL(15,2) NOT NULL,
L_RETURNFLAG "char" NOT NULL,
L_LINESTATUS "char" NOT NULL,
L_SHIPDATE DATE NOT NULL,
L_COMMITDATE DATE NOT NULL,
L_RECEIPTDATE DATE NOT NULL,
L_SHIPINSTRUCT CHAR(25) NOT NULL,
L_SHIPMODE CHAR(10) NOT NULL,
L_COMMENT VARCHAR(44) NOT NULL
)
WITH (APPENDONLY=TRUE, ORIENTATION=COLUMN, COMPRESSTYPE=LZ4, COMPRESSLEVEL=9)
DISTRIBUTED BY (L_ORDERKEY)
ORDER BY(L_SHIPDATE)
;
8张表的逻辑关系如下图所示。
（图片来源于：TPC Benchmark H Standard Specification
导入数据
以下内容为您介绍如何导入数据到AnalyticDB PostgreSQL数据库中。
1. 在AnalyticDB PostgreSQL数据库中使用COPY命令导入nation和region两张小表，命令如下：
\copy nation from '/mnt/tpch-dbgen-master/nation.tbl' DELIMITER '|';
\copy region from '/mnt/tpch-dbgen-master/region.tbl' DELIMITER '|';
说明
上述示例中的/mnt/tpch-dbgen-master为示例路径，测试过程中请替换成nation.tblregion.tbl文件的实际路径。
2. 将其余的6张大表通过ossutil上传到OSS。更多关于ossutil的使用方法，请参见概述
说明
由于\COPY命令需要通过Master节点进行串行数据写入处理，无法实现并行写入大批量数据，因此需要通过OSS进行数据导入。
1. 在ECS上下载ossutil，命令如下：
wget http://gosspublic.alicdn.com/ossutil/1.7.3/ossutil64
2. 修改文件的执行权限，命令如下：
chmod 755 ossutil64
3. 执行如下语句，依次将其余6张表的.tbl文件通过ossutil上传到OSS。
ls <table_name>.tbl* | while read line;
do
~/ossutil64 -e <EndPoint> -i <AccessKey ID> -k <Access Key Secret> cp $line oss://<oss bucket>/<目录>/ &
done
3. 待所有表上传到OSS后，在AnalyticDB PostgreSQL数据库中执行如下语句将数据从OSS导入表。具体信息，请参见使用COPY/UNLOAD导入/导出数据到OSS
COPY customer
FROM 'oss://<oss bucket>/<目录>/customer.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
"null" ''
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
COPY lineitem
FROM 'oss://<oss bucket>/<目录>/lineitem.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
"null" ''
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
-- lineitem表定义了排序列，数据导入完成后可对数据进行聚簇排序
sort lineitem;
COPY orders
FROM 'oss://<oss bucket>/<目录>/orders.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
"null" ''
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
-- orders表定义了排序列，数据导入完成后可对数据进行聚簇排序
sort orders;
COPY part
FROM 'oss://<oss bucket>/<目录>/part.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
"null" ''
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
COPY supplier
FROM 'oss://<oss bucket>/<目录>/supplier.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
"null" ''
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
COPY partsupp
FROM 'oss://<oss bucket>/<目录>/partsupp.tbl'
ACCESS_KEY_ID '<AccessKey ID>'
SECRET_ACCESS_KEY '<Access Key Secret>'
FORMAT AS text
"delimiter" '|'
ENDPOINT '<EndPoint>'
FDW 'oss_fdw'
;
执行查询
您可以通过Shell脚本进行测试，也可以通过psql等客户端工具逐条执行查询SQL，以下内容将分别介绍两种执行查询的方法。
Shell脚本
1. 下载tpch_query.tar.gz文件并解压到~/tpch_query目录。
2. 创建一个名为query.sh的Shell脚本，用于执行全部查询，并记录每条耗时和总耗时。
Shell脚本内容如下：
#!/bin/bash
total_cost=0
for i in {1..22}
do
echo "begin run Q${i}, tpch_query/q$i.sql , `date`"
begin_time=`date +%s.%N`
./psql ${实例连接地址} -p ${端口号} -U ${数据库用户} -f ~/tpch_query/q${i}.sql > ~/log/log_q${i}.out
rc=$?
end_time=`date +%s.%N`
cost=`echo "$end_time-$begin_time"|bc`
total_cost=`echo "$total_cost+$cost"|bc`
if [ $rc -ne 0 ] ; then
printf "run Q%s fail, cost: %.2f, totalCost: %.2f, `date`\n" $i $cost $total_cost
else
printf "run Q%s succ, cost: %.2f, totalCost: %.2f, `date`\n" $i $cost $total_cost
fi
done
3. 在ECS上运行query.sh脚本。
nohup bash ~/query.sh > /tmp/tpch.log &
4. 执行如下命令查看结果。
cat /tmp/tpch.log
客户端工具
连接AnalyticDB PostgreSQL数据库后，逐条执行以下语句进行查询，并对比查询结果。
--创建向量化计算引擎Laser插件
create extension if not exists laser;
-- Q1
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
l_returnflag,
l_linestatus,
sum(l_quantity) as sum_qty,
sum(l_extendedprice) as sum_base_price,
sum(l_extendedprice * (1 - l_discount)) as sum_disc_price,
sum(l_extendedprice * (1 - l_discount) * (1 + l_tax)) as sum_charge,
avg(l_quantity) as avg_qty,
avg(l_extendedprice) as avg_price,
avg(l_discount) as avg_disc,
count(*) as count_order
from
lineitem
where
l_shipdate <= date '1998-12-01' - interval '93 day'
group by
l_returnflag,
l_linestatus
order by
l_returnflag,
l_linestatus;
-- Q2
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
s_acctbal,
s_name,
n_name,
p_partkey,
p_mfgr,
s_address,
s_phone,
s_comment
from
part,
supplier,
partsupp,
nation,
region
where
p_partkey = ps_partkey
and s_suppkey = ps_suppkey
and p_size = 23
and p_type like '%STEEL'
and s_nationkey = n_nationkey
and n_regionkey = r_regionkey
and r_name = 'EUROPE'
and ps_supplycost = (
select
min(ps_supplycost)
from
partsupp,
supplier,
nation,
region
where
p_partkey = ps_partkey
and s_suppkey = ps_suppkey
and s_nationkey = n_nationkey
and n_regionkey = r_regionkey
and r_name = 'EUROPE'
)
order by
s_acctbal desc,
n_name,
s_name,
p_partkey
limit 100;
-- Q3
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
l_orderkey,
sum(l_extendedprice * (1 - l_discount)) as revenue,
o_orderdate,
o_shippriority
from
customer,
orders,
lineitem
where
c_mktsegment = 'MACHINERY'
and c_custkey = o_custkey
and l_orderkey = o_orderkey
and o_orderdate < date '1995-03-24'
and l_shipdate > date '1995-03-24'
group by
l_orderkey,
o_orderdate,
o_shippriority
order by
revenue desc,
o_orderdate
limit 10;
-- Q4
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
o_orderpriority,
count(*) as order_count
from
orders
where
o_orderdate >= date '1996-08-01'
and o_orderdate < date '1996-08-01' + interval '3' month
and exists (
select
*
from
lineitem
where
l_orderkey = o_orderkey
and l_commitdate < l_receiptdate
)
group by
o_orderpriority
order by
o_orderpriority;
-- Q6
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
sum(l_extendedprice * l_discount) as revenue
from
lineitem
where
l_shipdate >= date '1994-01-01'
and l_shipdate < date '1994-01-01' + interval '1' year
and l_discount between 0.06 - 0.01 and 0.06 + 0.01
and l_quantity < 24;
-- Q7
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
supp_nation,
cust_nation,
l_year,
sum(volume) as revenue
from
(
select
n1.n_name as supp_nation,
n2.n_name as cust_nation,
extract(year from l_shipdate) as l_year,
l_extendedprice * (1 - l_discount) as volume
from
supplier,
lineitem,
orders,
customer,
nation n1,
nation n2
where
s_suppkey = l_suppkey
and o_orderkey = l_orderkey
and c_custkey = o_custkey
and s_nationkey = n1.n_nationkey
and c_nationkey = n2.n_nationkey
and (
(n1.n_name = 'JORDAN' and n2.n_name = 'INDONESIA')
or (n1.n_name = 'INDONESIA' and n2.n_name = 'JORDAN')
)
and l_shipdate between date '1995-01-01' and date '1996-12-31'
) as shipping
group by
supp_nation,
cust_nation,
l_year
order by
supp_nation,
cust_nation,
l_year;
-- Q8
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
o_year,
sum(case
when nation = 'INDONESIA' then volume
else 0
end) / sum(volume) as mkt_share
from
(
select
extract(year from o_orderdate) as o_year,
l_extendedprice * (1 - l_discount) as volume,
n2.n_name as nation
from
part,
supplier,
lineitem,
orders,
customer,
nation n1,
nation n2,
region
where
p_partkey = l_partkey
and s_suppkey = l_suppkey
and l_orderkey = o_orderkey
and o_custkey = c_custkey
and c_nationkey = n1.n_nationkey
and n1.n_regionkey = r_regionkey
and r_name = 'ASIA'
and s_nationkey = n2.n_nationkey
and o_orderdate between date '1995-01-01' and date '1996-12-31'
and p_type = 'STANDARD BRUSHED BRASS'
) as all_nations
group by
o_year
order by
o_year;
-- Q9
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
nation,
o_year,
sum(amount) as sum_profit
from
(
select
n_name as nation,
extract(year from o_orderdate) as o_year,
l_extendedprice * (1 - l_discount) - ps_supplycost * l_quantity as amount
from
part,
supplier,
lineitem,
partsupp,
orders,
nation
where
s_suppkey = l_suppkey
and ps_suppkey = l_suppkey
and ps_partkey = l_partkey
and p_partkey = l_partkey
and o_orderkey = l_orderkey
and s_nationkey = n_nationkey
and p_name like '%chartreuse%'
) as profit
group by
nation,
o_year
order by
nation,
o_year desc;
-- Q10
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
c_custkey,
c_name,
sum(l_extendedprice * (1 - l_discount)) as revenue,
c_acctbal,
n_name,
c_address,
c_phone,
c_comment
from
customer,
orders,
lineitem,
nation
where
c_custkey = o_custkey
and l_orderkey = o_orderkey
and o_orderdate >= date '1994-08-01'
and o_orderdate < date '1994-08-01' + interval '3' month
and l_returnflag = 'R'
and c_nationkey = n_nationkey
group by
c_custkey,
c_name,
c_acctbal,
c_phone,
n_name,
c_address,
c_comment
order by
revenue desc
limit 20;
-- Q11
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
ps_partkey,
sum(ps_supplycost * ps_availqty) as value
from
partsupp,
supplier,
nation
where
ps_suppkey = s_suppkey
and s_nationkey = n_nationkey
and n_name = 'INDONESIA'
group by
ps_partkey having
sum(ps_supplycost * ps_availqty) > (
select
sum(ps_supplycost * ps_availqty) * 0.0001000000
from
partsupp,
supplier,
nation
where
ps_suppkey = s_suppkey
and s_nationkey = n_nationkey
and n_name = 'INDONESIA'
)
order by
value desc;
-- Q12
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
l_shipmode,
sum(case
when o_orderpriority = '1-URGENT'
or o_orderpriority = '2-HIGH'
then 1
else 0
end) as high_line_count,
sum(case
when o_orderpriority <> '1-URGENT'
and o_orderpriority <> '2-HIGH'
then 1
else 0
end) as low_line_count
from
orders,
lineitem
where
o_orderkey = l_orderkey
and l_shipmode in ('REG AIR', 'TRUCK')
and l_commitdate < l_receiptdate
and l_shipdate < l_commitdate
and l_receiptdate >= date '1994-01-01'
and l_receiptdate < date '1994-01-01' + interval '1' year
group by
l_shipmode
order by
l_shipmode;
-- Q13
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
c_count,
count(*) as custdist
from
(
select
c_custkey,
count(o_orderkey)
from
customer left outer join orders on
c_custkey = o_custkey
and o_comment not like '%pending%requests%'
group by
c_custkey
) as c_orders (c_custkey, c_count)
group by
c_count
order by
custdist desc,
c_count desc;
-- Q14
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
100.00 * sum(case
when p_type like 'PROMO%'
then l_extendedprice * (1 - l_discount)
else 0
end) / sum(l_extendedprice * (1 - l_discount)) as promo_revenue
from
lineitem,
part
where
l_partkey = p_partkey
and l_shipdate >= date '1994-11-01'
and l_shipdate < date '1994-11-01' + interval '1' month;
-- Q15
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
create view revenue0 (supplier_no, total_revenue) as
select
l_suppkey,
sum(l_extendedprice * (1 - l_discount))
from
lineitem
where
l_shipdate >= date '1997-10-01'
and l_shipdate < date '1997-10-01' + interval '3' month
group by
l_suppkey;
select
s_suppkey,
s_name,
s_address,
s_phone,
total_revenue
from
supplier,
revenue0
where
s_suppkey = supplier_no
and total_revenue = (
select
max(total_revenue)
from
revenue0
)
order by
s_suppkey;
drop view revenue0;
-- Q16
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
p_brand,
p_type,
p_size,
count(distinct ps_suppkey) as supplier_cnt
from
partsupp,
part
where
p_partkey = ps_partkey
and p_brand <> 'Brand#44'
and p_type not like 'SMALL BURNISHED%'
and p_size in (36, 27, 34, 45, 11, 6, 25, 16)
and ps_suppkey not in (
select
s_suppkey
from
supplier
where
s_comment like '%Customer%Complaints%'
)
group by
p_brand,
p_type,
p_size
order by
supplier_cnt desc,
p_brand,
p_type,
p_size;
-- Q17
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
sum(l_extendedprice) / 7.0 as avg_yearly
from
lineitem,
part
where
p_partkey = l_partkey
and p_brand = 'Brand#42'
and p_container = 'JUMBO PACK'
and l_quantity < (
select
0.2 * avg(l_quantity)
from
lineitem
where
l_partkey = p_partkey
);
-- Q18
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
c_name,
c_custkey,
o_orderkey,
o_orderdate,
o_totalprice,
sum(l_quantity)
from
customer,
orders,
lineitem
where
o_orderkey in (
select
l_orderkey
from
lineitem
group by
l_orderkey having
sum(l_quantity) > 312
)
and c_custkey = o_custkey
and o_orderkey = l_orderkey
group by
c_name,
c_custkey,
o_orderkey,
o_orderdate,
o_totalprice
order by
o_totalprice desc,
o_orderdate
limit 100;
-- Q19
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
sum(l_extendedprice* (1 - l_discount)) as revenue
from
lineitem,
part
where
(
p_partkey = l_partkey
and p_brand = 'Brand#43'
and p_container in ('SM CASE', 'SM BOX', 'SM PACK', 'SM PKG')
and l_quantity >= 5 and l_quantity <= 5 + 10
and p_size between 1 and 5
and l_shipmode in ('AIR', 'AIR REG')
and l_shipinstruct = 'DELIVER IN PERSON'
)
or
(
p_partkey = l_partkey
and p_brand = 'Brand#45'
and p_container in ('MED BAG', 'MED BOX', 'MED PKG', 'MED PACK')
and l_quantity >= 12 and l_quantity <= 12 + 10
and p_size between 1 and 10
and l_shipmode in ('AIR', 'AIR REG')
and l_shipinstruct = 'DELIVER IN PERSON'
)
or
(
p_partkey = l_partkey
and p_brand = 'Brand#11'
and p_container in ('LG CASE', 'LG BOX', 'LG PACK', 'LG PKG')
and l_quantity >= 24 and l_quantity <= 24 + 10
and p_size between 1 and 15
and l_shipmode in ('AIR', 'AIR REG')
and l_shipinstruct = 'DELIVER IN PERSON'
);
-- Q20
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
s_name,
s_address
from
supplier,
nation
where
s_suppkey in (
select
ps_suppkey
from
partsupp
where
ps_partkey in (
select
p_partkey
from
part
where
p_name like 'magenta%'
)
and ps_availqty > (
select
0.5 * sum(l_quantity)
from
lineitem
where
l_partkey = ps_partkey
and l_suppkey = ps_suppkey
and l_shipdate >= date '1996-01-01'
and l_shipdate < date '1996-01-01' + interval '1' year
)
)
and s_nationkey = n_nationkey
and n_name = 'RUSSIA'
order by
s_name;
-- Q21
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
s_name,
count(*) as numwait
from
supplier,
lineitem l1,
orders,
nation
where
s_suppkey = l1.l_suppkey
and o_orderkey = l1.l_orderkey
and o_orderstatus = 'F'
and l1.l_receiptdate > l1.l_commitdate
and exists (
select
*
from
lineitem l2
where
l2.l_orderkey = l1.l_orderkey
and l2.l_suppkey <> l1.l_suppkey
)
and not exists (
select
*
from
lineitem l3
where
l3.l_orderkey = l1.l_orderkey
and l3.l_suppkey <> l1.l_suppkey
and l3.l_receiptdate > l3.l_commitdate
)
and s_nationkey = n_nationkey
and n_name = 'MOZAMBIQUE'
group by
s_name
order by
numwait desc,
s_name
limit 100;
-- Q22
-- 开启向量加速引擎，并设置开关变量为on
set laser.enable = on;
select
cntrycode,
count(*) as numcust,
sum(c_acctbal) as totacctbal
from
(
select
substring(c_phone from 1 for 2) as cntrycode,
c_acctbal
from
customer
where
substring(c_phone from 1 for 2) in
('13', '31', '23', '29', '30', '18', '17')
and c_acctbal > (
select
avg(c_acctbal)
from
customer
where
c_acctbal > 0.00
and substring(c_phone from 1 for 2) in
('13', '31', '23', '29', '30', '18', '17')
)
and not exists (
select
*
from
orders
where
o_custkey = c_custkey
)
) as custsale
group by
cntrycode
order by
cntrycode;
|
{
"url": "https://help.aliyun.com/document_detail/156160.html",
"source_domain": "help.aliyun.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "39735",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OMFXB6VCSZI57GWPF7ULUFY25Z3BG3UG",
"WARC-Concurrent-To": "<urn:uuid:cff267a6-75a5-42c4-9442-b6cdcf4d9f47>",
"WARC-Date": "2021-11-30T08:18:54Z",
"WARC-IP-Address": "203.119.211.244",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BX4VTR4JRIJFZVNAWNPOQZWCAUDOMWBM",
"WARC-Record-ID": "<urn:uuid:c9f4f533-46cd-4640-a0f8-c1ee0a380e69>",
"WARC-Target-URI": "https://help.aliyun.com/document_detail/156160.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2b69e31-b9a3-4b5f-bcd0-6d9b3a8e35dc>"
},
"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-38\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,
36,
37,
43,
44,
123,
124,
132,
133,
170,
171,
280,
281,
305,
306,
309,
310,
383,
384,
389,
390,
404,
405,
458,
459,
497,
498,
516,
517,
543,
544,
567,
568,
588,
589,
618,
619,
654,
655,
675,
676,
703,
704,
726,
727,
769,
770,
814,
815,
824,
825,
873,
874,
892,
893,
955,
956,
986,
987,
994,
995,
1024,
1025,
1066,
1067,
1086,
1087,
1165,
1194,
1215,
1241,
1302,
1311,
1330,
1460,
1461,
1487,
1494,
1535,
1545,
1552,
1661,
1662,
1737,
1738,
1744,
1745,
1793,
1794,
1817,
1818,
1844,
1883,
1923,
1962,
1996,
2002,
2084,
2111,
2117,
2122,
2148,
2187,
2227,
2261,
2267,
2349,
2376,
2382,
2387,
2411,
2451,
2495,
2536,
2577,
2621,
2661,
2702,
2748,
2791,
2797,
2879,
2910,
2916,
2921,
2949,
2989,
3030,
3074,
3114,
3155,
3201,
3245,
3251,
3333,
3364,
3370,
3375,
3403,
3444,
3485,
3526,
3574,
3619,
3625,
3707,
3739,
3745,
3750,
3778,
3818,
3862,
3906,
3946,
3987,
4035,
4076,
4120,
4126,
4208,
4239,
4245,
4250,
4276,
4318,
4361,
4403,
4452,
4492,
4536,
4580,
4623,
4669,
4675,
4757,
4789,
4815,
4821,
4826,
4854,
4893,
4933,
4973,
5013,
5059,
5108,
5154,
5200,
5239,
5278,
5315,
5352,
5389,
5431,
5473,
5517,
5523,
5605,
5637,
5662,
5668,
5669,
5688,
5689,
5735,
5736,
5741,
5742,
5784,
5785,
5850,
5851,
5924,
5997,
6004,
6005,
6081,
6082,
6134,
6135,
6142,
6143,
6210,
6211,
6239,
6240,
6304,
6327,
6328,
6354,
6400,
6401,
6447,
6456,
6565,
6576,
6669,
6670,
6688,
6736,
6771,
6815,
6834,
6854,
6868,
6894,
6912,
6918,
6923,
6941,
6989,
7024,
7068,
7087,
7107,
7121,
7147,
7165,
7171,
7176,
7217,
7236,
7241,
7257,
7303,
7338,
7382,
7401,
7421,
7435,
7461,
7479,
7485,
7490,
7529,
7546,
7551,
7565,
7609,
7644,
7688,
7707,
7727,
7741,
7767,
7785,
7791,
7796,
7814,
7862,
7897,
7941,
7960,
7980,
7994,
8020,
8038,
8044,
8049,
8067,
8115,
8150,
8194,
8213,
8233,
8259,
8277,
8283,
8284,
8289,
8290,
8352,
8353,
8361,
8362,
8408,
8409,
8459,
8460,
8477,
8478,
8494,
8499,
8516,
8521,
8542,
8549,
8613,
8650,
8749,
8767,
8802,
8853,
8906,
8942,
9042,
9060,
9160,
9176,
9185,
9209,
9210,
9254,
9271,
9272,
9294,
9295,
9301,
9302,
9352,
9353,
9372,
9410,
9411,
9417,
9440,
9463,
9470,
9488,
9506,
9538,
9582,
9645,
9718,
9750,
9789,
9822,
9850,
9855,
9868,
9874,
9930,
9939,
9957,
9974,
9983,
10001,
10019,
10024,
10030,
10053,
10076,
10083,
10098,
10110,
10122,
10137,
10149,
10164,
10177,
10191,
10196,
10206,
10220,
10234,
10246,
10257,
10263,
10290,
10321,
10341,
10370,
10404,
10438,
10464,
10490,
10505,
10536,
10549,
10571,
10593,
10613,
10632,
10646,
10681,
10720,
10762,
10804,
10838,
10844,
10853,
10873,
10885,
10897,
10911,
10922,
10923,
10929,
10952,
10975,
10982,
10998,
11054,
11071,
11090,
11095,
11109,
11121,
11134,
11140,
11171,
11201,
11233,
11273,
11312,
11321,
11337,
11354,
11373,
11382,
11400,
11416,
11426,
11427,
11433,
11456,
11479,
11486,
11507,
11535,
11540,
11551,
11557,
11594,
11655,
11672,
11687,
11701,
11714,
11735,
11749,
11785,
11830,
11836,
11845,
11865,
11874,
11895,
11900,
11906,
11929,
11952,
11959,
12008,
12013,
12026,
12032,
12068,
12127,
12182,
12207,
12212,
12218,
12241,
12264,
12271,
12288,
12305,
12317,
12344,
12349,
12355,
12370,
12408,
12446,
12499,
12556,
12569,
12591,
12613,
12633,
12655,
12678,
12700,
12714,
12748,
12788,
12826,
12871,
12916,
12934,
13001,
13071,
13085,
13160,
13178,
13187,
13204,
13221,
13232,
13241,
13258,
13275,
13287,
13288,
13294,
13317,
13340,
13347,
13359,
13372,
13418,
13433,
13469,
13474,
13480,
13495,
13549,
13607,
13639,
13652,
13670,
13692,
13714,
13734,
13756,
13779,
13802,
13821,
13835,
13869,
13907,
13947,
13985,
14030,
14075,
14107,
14152,
14228,
14278,
14299,
14308,
14319,
14328,
14340,
14345,
14351,
14374,
14397,
14404,
14416,
14428,
14458,
14463,
14469,
14484,
14514,
14568,
14654,
14667,
14685,
14707,
14729,
14751,
14771,
14790,
14804,
14838,
14877,
14916,
14954,
14994,
15036,
15079,
15095,
15104,
15116,
15127,
15136,
15148,
15165,
15170,
15177,
15200,
15223,
15230,
15245,
15257,
15313,
15328,
15340,
15355,
15368,
15382,
15387,
15401,
15413,
15427,
15438,
15444,
15470,
15502,
15543,
15604,
15631,
15665,
15674,
15689,
15701,
15716,
15729,
15741,
15756,
15770,
15779,
15796,
15806,
15807,
15814,
15837,
15860,
15867,
15883,
15929,
15934,
15948,
15962,
15973,
15979,
16006,
16040,
16069,
16078,
16100,
16145,
16164,
16228,
16245,
16271,
16297,
16320,
16338,
16377,
16423,
16464,
16474,
16483,
16499,
16500,
16507,
16530,
16553,
16560,
16576,
16589,
16631,
16673,
16692,
16707,
16736,
16749,
16792,
16836,
16855,
16870,
16897,
16902,
16914,
16927,
16933,
16961,
17004,
17041,
17075,
17118,
17180,
17189,
17204,
17213,
17229,
17234,
17241,
17264,
17287,
17294,
17307,
17332,
17337,
17343,
17358,
17381,
17411,
17424,
17471,
17509,
17569,
17586,
17608,
17647,
17656,
17668,
17677,
17696,
17714,
17719,
17726,
17749,
17772,
17779,
17801,
17835,
17887,
17902,
17970,
17975,
17989,
17998,
18004,
18030,
18070,
18131,
18136,
18143,
18166,
18189,
18242,
18253,
18272,
18320,
18329,
18346,
18356,
18396,
18460,
18473,
18492,
18499,
18514,
18526,
18541,
18554,
18572,
18577,
18591,
18604,
18610,
18638,
18664,
18679,
18710,
18723,
18744,
18750,
18759,
18774,
18794,
18795,
18802,
18825,
18848,
18855,
18868,
18880,
18892,
18939,
18944,
18958,
18967,
18973,
19000,
19030,
19073,
19123,
19151,
19166,
19188,
19201,
19222,
19236,
19287,
19293,
19302,
19315,
19327,
19338,
19347,
19370,
19383,
19395,
19407,
19408,
19415,
19438,
19461,
19468,
19513,
19518,
19532,
19541,
19547,
19573,
19602,
19637,
19660,
19675,
19709,
19722,
19743,
19757,
19791,
19798,
19803,
19810,
19833,
19856,
19863,
19875,
19890,
19906,
19923,
19941,
19961,
19966,
19980,
19992,
20005,
20011,
20031,
20046,
20069,
20082,
20103,
20120,
20150,
20188,
20194,
20224,
20256,
20265,
20277,
20292,
20308,
20325,
20342,
20351,
20374,
20390,
20401,
20402,
20409,
20432,
20455,
20462,
20516,
20521,
20535,
20544,
20550,
20556,
20586,
20619,
20689,
20742,
20777,
20822,
20871,
20877,
20884,
20890,
20920,
20953,
21026,
21081,
21117,
21162,
21211,
21217,
21224,
21230,
21260,
21293,
21363,
21418,
21454,
21499,
21548,
21555,
21556,
21563,
21586,
21609,
21616,
21628,
21642,
21647,
21661,
21672,
21678,
21697,
21712,
21735,
21748,
21769,
21783,
21811,
21834,
21864,
21885,
21910,
21932,
21975,
21989,
22021,
22044,
22086,
22107,
22136,
22158,
22201,
22248,
22304,
22379,
22393,
22399,
22433,
22459,
22468,
22480,
22481,
22488,
22511,
22534,
22541,
22553,
22577,
22582,
22596,
22613,
22625,
22636,
22642,
22671,
22706,
22734,
22777,
22794,
22809,
22823,
22836,
22860,
22874,
22916,
22961,
22967,
22988,
23003,
23017,
23030,
23054,
23068,
23110,
23155,
23206,
23212,
23246,
23276,
23285,
23296,
23305,
23323,
23334,
23345,
23346,
23353,
23376,
23399,
23406,
23425,
23454,
23491,
23496,
23506,
23529,
23599,
23633,
23654,
23687,
23709,
23768,
23843,
23885,
23924,
23979,
24016,
24065,
24103,
24160,
24239,
24330,
24356,
24397,
24436,
24478,
24515,
24562,
24600,
24662,
24688,
24710,
24719,
24737,
24746
],
"line_end_idx": [
36,
37,
43,
44,
123,
124,
132,
133,
170,
171,
280,
281,
305,
306,
309,
310,
383,
384,
389,
390,
404,
405,
458,
459,
497,
498,
516,
517,
543,
544,
567,
568,
588,
589,
618,
619,
654,
655,
675,
676,
703,
704,
726,
727,
769,
770,
814,
815,
824,
825,
873,
874,
892,
893,
955,
956,
986,
987,
994,
995,
1024,
1025,
1066,
1067,
1086,
1087,
1165,
1194,
1215,
1241,
1302,
1311,
1330,
1460,
1461,
1487,
1494,
1535,
1545,
1552,
1661,
1662,
1737,
1738,
1744,
1745,
1793,
1794,
1817,
1818,
1844,
1883,
1923,
1962,
1996,
2002,
2084,
2111,
2117,
2122,
2148,
2187,
2227,
2261,
2267,
2349,
2376,
2382,
2387,
2411,
2451,
2495,
2536,
2577,
2621,
2661,
2702,
2748,
2791,
2797,
2879,
2910,
2916,
2921,
2949,
2989,
3030,
3074,
3114,
3155,
3201,
3245,
3251,
3333,
3364,
3370,
3375,
3403,
3444,
3485,
3526,
3574,
3619,
3625,
3707,
3739,
3745,
3750,
3778,
3818,
3862,
3906,
3946,
3987,
4035,
4076,
4120,
4126,
4208,
4239,
4245,
4250,
4276,
4318,
4361,
4403,
4452,
4492,
4536,
4580,
4623,
4669,
4675,
4757,
4789,
4815,
4821,
4826,
4854,
4893,
4933,
4973,
5013,
5059,
5108,
5154,
5200,
5239,
5278,
5315,
5352,
5389,
5431,
5473,
5517,
5523,
5605,
5637,
5662,
5668,
5669,
5688,
5689,
5735,
5736,
5741,
5742,
5784,
5785,
5850,
5851,
5924,
5997,
6004,
6005,
6081,
6082,
6134,
6135,
6142,
6143,
6210,
6211,
6239,
6240,
6304,
6327,
6328,
6354,
6400,
6401,
6447,
6456,
6565,
6576,
6669,
6670,
6688,
6736,
6771,
6815,
6834,
6854,
6868,
6894,
6912,
6918,
6923,
6941,
6989,
7024,
7068,
7087,
7107,
7121,
7147,
7165,
7171,
7176,
7217,
7236,
7241,
7257,
7303,
7338,
7382,
7401,
7421,
7435,
7461,
7479,
7485,
7490,
7529,
7546,
7551,
7565,
7609,
7644,
7688,
7707,
7727,
7741,
7767,
7785,
7791,
7796,
7814,
7862,
7897,
7941,
7960,
7980,
7994,
8020,
8038,
8044,
8049,
8067,
8115,
8150,
8194,
8213,
8233,
8259,
8277,
8283,
8284,
8289,
8290,
8352,
8353,
8361,
8362,
8408,
8409,
8459,
8460,
8477,
8478,
8494,
8499,
8516,
8521,
8542,
8549,
8613,
8650,
8749,
8767,
8802,
8853,
8906,
8942,
9042,
9060,
9160,
9176,
9185,
9209,
9210,
9254,
9271,
9272,
9294,
9295,
9301,
9302,
9352,
9353,
9372,
9410,
9411,
9417,
9440,
9463,
9470,
9488,
9506,
9538,
9582,
9645,
9718,
9750,
9789,
9822,
9850,
9855,
9868,
9874,
9930,
9939,
9957,
9974,
9983,
10001,
10019,
10024,
10030,
10053,
10076,
10083,
10098,
10110,
10122,
10137,
10149,
10164,
10177,
10191,
10196,
10206,
10220,
10234,
10246,
10257,
10263,
10290,
10321,
10341,
10370,
10404,
10438,
10464,
10490,
10505,
10536,
10549,
10571,
10593,
10613,
10632,
10646,
10681,
10720,
10762,
10804,
10838,
10844,
10853,
10873,
10885,
10897,
10911,
10922,
10923,
10929,
10952,
10975,
10982,
10998,
11054,
11071,
11090,
11095,
11109,
11121,
11134,
11140,
11171,
11201,
11233,
11273,
11312,
11321,
11337,
11354,
11373,
11382,
11400,
11416,
11426,
11427,
11433,
11456,
11479,
11486,
11507,
11535,
11540,
11551,
11557,
11594,
11655,
11672,
11687,
11701,
11714,
11735,
11749,
11785,
11830,
11836,
11845,
11865,
11874,
11895,
11900,
11906,
11929,
11952,
11959,
12008,
12013,
12026,
12032,
12068,
12127,
12182,
12207,
12212,
12218,
12241,
12264,
12271,
12288,
12305,
12317,
12344,
12349,
12355,
12370,
12408,
12446,
12499,
12556,
12569,
12591,
12613,
12633,
12655,
12678,
12700,
12714,
12748,
12788,
12826,
12871,
12916,
12934,
13001,
13071,
13085,
13160,
13178,
13187,
13204,
13221,
13232,
13241,
13258,
13275,
13287,
13288,
13294,
13317,
13340,
13347,
13359,
13372,
13418,
13433,
13469,
13474,
13480,
13495,
13549,
13607,
13639,
13652,
13670,
13692,
13714,
13734,
13756,
13779,
13802,
13821,
13835,
13869,
13907,
13947,
13985,
14030,
14075,
14107,
14152,
14228,
14278,
14299,
14308,
14319,
14328,
14340,
14345,
14351,
14374,
14397,
14404,
14416,
14428,
14458,
14463,
14469,
14484,
14514,
14568,
14654,
14667,
14685,
14707,
14729,
14751,
14771,
14790,
14804,
14838,
14877,
14916,
14954,
14994,
15036,
15079,
15095,
15104,
15116,
15127,
15136,
15148,
15165,
15170,
15177,
15200,
15223,
15230,
15245,
15257,
15313,
15328,
15340,
15355,
15368,
15382,
15387,
15401,
15413,
15427,
15438,
15444,
15470,
15502,
15543,
15604,
15631,
15665,
15674,
15689,
15701,
15716,
15729,
15741,
15756,
15770,
15779,
15796,
15806,
15807,
15814,
15837,
15860,
15867,
15883,
15929,
15934,
15948,
15962,
15973,
15979,
16006,
16040,
16069,
16078,
16100,
16145,
16164,
16228,
16245,
16271,
16297,
16320,
16338,
16377,
16423,
16464,
16474,
16483,
16499,
16500,
16507,
16530,
16553,
16560,
16576,
16589,
16631,
16673,
16692,
16707,
16736,
16749,
16792,
16836,
16855,
16870,
16897,
16902,
16914,
16927,
16933,
16961,
17004,
17041,
17075,
17118,
17180,
17189,
17204,
17213,
17229,
17234,
17241,
17264,
17287,
17294,
17307,
17332,
17337,
17343,
17358,
17381,
17411,
17424,
17471,
17509,
17569,
17586,
17608,
17647,
17656,
17668,
17677,
17696,
17714,
17719,
17726,
17749,
17772,
17779,
17801,
17835,
17887,
17902,
17970,
17975,
17989,
17998,
18004,
18030,
18070,
18131,
18136,
18143,
18166,
18189,
18242,
18253,
18272,
18320,
18329,
18346,
18356,
18396,
18460,
18473,
18492,
18499,
18514,
18526,
18541,
18554,
18572,
18577,
18591,
18604,
18610,
18638,
18664,
18679,
18710,
18723,
18744,
18750,
18759,
18774,
18794,
18795,
18802,
18825,
18848,
18855,
18868,
18880,
18892,
18939,
18944,
18958,
18967,
18973,
19000,
19030,
19073,
19123,
19151,
19166,
19188,
19201,
19222,
19236,
19287,
19293,
19302,
19315,
19327,
19338,
19347,
19370,
19383,
19395,
19407,
19408,
19415,
19438,
19461,
19468,
19513,
19518,
19532,
19541,
19547,
19573,
19602,
19637,
19660,
19675,
19709,
19722,
19743,
19757,
19791,
19798,
19803,
19810,
19833,
19856,
19863,
19875,
19890,
19906,
19923,
19941,
19961,
19966,
19980,
19992,
20005,
20011,
20031,
20046,
20069,
20082,
20103,
20120,
20150,
20188,
20194,
20224,
20256,
20265,
20277,
20292,
20308,
20325,
20342,
20351,
20374,
20390,
20401,
20402,
20409,
20432,
20455,
20462,
20516,
20521,
20535,
20544,
20550,
20556,
20586,
20619,
20689,
20742,
20777,
20822,
20871,
20877,
20884,
20890,
20920,
20953,
21026,
21081,
21117,
21162,
21211,
21217,
21224,
21230,
21260,
21293,
21363,
21418,
21454,
21499,
21548,
21555,
21556,
21563,
21586,
21609,
21616,
21628,
21642,
21647,
21661,
21672,
21678,
21697,
21712,
21735,
21748,
21769,
21783,
21811,
21834,
21864,
21885,
21910,
21932,
21975,
21989,
22021,
22044,
22086,
22107,
22136,
22158,
22201,
22248,
22304,
22379,
22393,
22399,
22433,
22459,
22468,
22480,
22481,
22488,
22511,
22534,
22541,
22553,
22577,
22582,
22596,
22613,
22625,
22636,
22642,
22671,
22706,
22734,
22777,
22794,
22809,
22823,
22836,
22860,
22874,
22916,
22961,
22967,
22988,
23003,
23017,
23030,
23054,
23068,
23110,
23155,
23206,
23212,
23246,
23276,
23285,
23296,
23305,
23323,
23334,
23345,
23346,
23353,
23376,
23399,
23406,
23425,
23454,
23491,
23496,
23506,
23529,
23599,
23633,
23654,
23687,
23709,
23768,
23843,
23885,
23924,
23979,
24016,
24065,
24103,
24160,
24239,
24330,
24356,
24397,
24436,
24478,
24515,
24562,
24600,
24662,
24688,
24710,
24719,
24737,
24746,
24764
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 24764,
"ccnet_original_nlines": 1041,
"rps_doc_curly_bracket": 0.000565339985769242,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09739004075527191,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.13678105175495148,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4862252175807953,
"rps_doc_frac_unique_words": 0.2525647282600403,
"rps_doc_mean_word_length": 6.838299751281738,
"rps_doc_num_sentences": 120,
"rps_doc_symbol_to_word_ratio": 0.0019333000527694821,
"rps_doc_unigram_entropy": 5.383147239685059,
"rps_doc_word_count": 2047,
"rps_doc_frac_chars_dupe_10grams": 0.0917988270521164,
"rps_doc_frac_chars_dupe_5grams": 0.29961422085762024,
"rps_doc_frac_chars_dupe_6grams": 0.21153022348880768,
"rps_doc_frac_chars_dupe_7grams": 0.18316902220249176,
"rps_doc_frac_chars_dupe_8grams": 0.18316902220249176,
"rps_doc_frac_chars_dupe_9grams": 0.14430633187294006,
"rps_doc_frac_chars_top_2gram": 0.029504209756851196,
"rps_doc_frac_chars_top_3gram": 0.04950707033276558,
"rps_doc_frac_chars_top_4gram": 0.05250750109553337,
"rps_doc_books_importance": -1969.28564453125,
"rps_doc_books_importance_length_correction": -1969.28564453125,
"rps_doc_openwebtext_importance": -1013.8783569335938,
"rps_doc_openwebtext_importance_length_correction": -1013.8783569335938,
"rps_doc_wikipedia_importance": -733.0159301757812,
"rps_doc_wikipedia_importance_length_correction": -733.0159301757812
},
"fasttext": {
"dclm": 0.7239161729812622,
"english": 0.45132797956466675,
"fineweb_edu_approx": 1.9809088706970215,
"eai_general_math": 0.27295011281967163,
"eai_open_web_math": 0.1693131923675537,
"eai_web_code": 0.9655522704124451
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,735,757,213,549,845,000 |
Importing MetaMask Wallet To Another Crypto Wallet
Comments · 12 Views
Being a crypto investor, you will surely have a crypto wallet through which you organize and manage your digital funds. At the time of setting up a wallet account, you might have come across options either to create a new wallet or to import an existing one.
Being a crypto investor, you will surely have a crypto wallet through which you organize and manage your digital funds. At the time of setting up a wallet account, you might have come across options either to create a new wallet or to import an existing one.
If an investor chooses to import his wallet, then all the data of his existing wallet will be transferred safely, without any loss. You can continue using your existing wallet across multiple devices and any transactions made by the investor will appear in the wallet across all the wallet providers.
In this read, we will be learning the steps of how to import the MetaMask wallet to the Coinbase wallet extension but before that, we will be having a look at what things are important for importing a wallet.
What information should an Individual have to import a wallet?
To import an existing wallet, the investor should have the recovery phrase. The recovery phrase is the most crucial element of a wallet. Importing a wallet won’t leave any impact on the investor’s existing wallet. The recovery phrase usually comprises a 12-word phrase.
Here’s how to import the MetaMask wallet
Before proceeding with the steps, make sure that you have installed the Coinbase wallet extension on your operating device. Once, you have successfully installed it, go with the further steps listed underneath:
1. Open your MetaMask Wallet through an extension or mobile app
2. Enter your wallet password to access the account
3. Move to “Settings” “Security Privacy”
4. Now, bang on “Reveal Secret Recovery Phrase”, and enter the password
5. Copy Secret Recovery Phrase and note it down somewhere safely
6. Launch the Coinbase wallet extension and then choose “Import an Existing Wallet”
7. Now hit on “Import Recovery Phrase”
8. Mention your Secret Recovery Phrase
9. Choose a username and then create a strong wallet password
All done!! Your MetaMask wallet is now imported to the Coinbase wallet extension. It is now all ready to use.
Wrapping it up!!
By following the above steps, one can easily import his MetaMask wallet safely and with much ease. In case, you ever got stuck in any of the operations related to crypto activities, you can get in touch with its support desk which will guide you on the right path to come out of the problem.
Comments
|
{
"url": "https://social.wepoc.io/read-blog/33335_importing-metamask-wallet-to-another-crypto-wallet.html",
"source_domain": "social.wepoc.io",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "116576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VEWVPJNXHHKPEV46HDU2EYRFLNQRQKCV",
"WARC-Concurrent-To": "<urn:uuid:7da476c5-f92c-4470-98cf-c41bbffa2e59>",
"WARC-Date": "2023-01-30T07:41:24Z",
"WARC-IP-Address": "67.205.146.161",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SKHF4ANKSAHXMZTPF3OYF5F5NLBYUNHT",
"WARC-Record-ID": "<urn:uuid:487b5712-0244-4148-aab9-02070ff5d9a6>",
"WARC-Target-URI": "https://social.wepoc.io/read-blog/33335_importing-metamask-wallet-to-another-crypto-wallet.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b62673d0-e262-41b4-a99a-5a9c17232523>"
},
"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-254\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,
72,
73,
332,
333,
592,
593,
894,
895,
1104,
1105,
1168,
1169,
1439,
1440,
1481,
1482,
1693,
1694,
1760,
1814,
1857,
1931,
1998,
2084,
2125,
2166,
2230,
2231,
2341,
2342,
2359,
2360,
2652,
2653
],
"line_end_idx": [
51,
52,
72,
73,
332,
333,
592,
593,
894,
895,
1104,
1105,
1168,
1169,
1439,
1440,
1481,
1482,
1693,
1694,
1760,
1814,
1857,
1931,
1998,
2084,
2125,
2166,
2230,
2231,
2341,
2342,
2359,
2360,
2652,
2653,
2661
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2661,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4280155599117279,
"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.13813230395317078,
"rps_doc_frac_unique_words": 0.39911308884620667,
"rps_doc_mean_word_length": 4.722837924957275,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.668447971343994,
"rps_doc_word_count": 451,
"rps_doc_frac_chars_dupe_10grams": 0.19530515372753143,
"rps_doc_frac_chars_dupe_5grams": 0.24788731336593628,
"rps_doc_frac_chars_dupe_6grams": 0.22159624099731445,
"rps_doc_frac_chars_dupe_7grams": 0.19530515372753143,
"rps_doc_frac_chars_dupe_8grams": 0.19530515372753143,
"rps_doc_frac_chars_dupe_9grams": 0.19530515372753143,
"rps_doc_frac_chars_top_2gram": 0.026291079819202423,
"rps_doc_frac_chars_top_3gram": 0.03192488104104996,
"rps_doc_frac_chars_top_4gram": 0.04882628843188286,
"rps_doc_books_importance": -236.6324920654297,
"rps_doc_books_importance_length_correction": -236.6324920654297,
"rps_doc_openwebtext_importance": -160.67764282226562,
"rps_doc_openwebtext_importance_length_correction": -160.67764282226562,
"rps_doc_wikipedia_importance": -99.86795806884766,
"rps_doc_wikipedia_importance_length_correction": -99.86795806884766
},
"fasttext": {
"dclm": 0.023828569799661636,
"english": 0.8880969285964966,
"fineweb_edu_approx": 1.1129999160766602,
"eai_general_math": 0.17682147026062012,
"eai_open_web_math": 0.18488705158233643,
"eai_web_code": 0.10198075324296951
}
}
|
{
"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": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,124,341,204,757,504,900 |
Home / Featured / The Silo Structure: Skyrocket Your Rankings with this One Simple Trick
The Silo Structure: Skyrocket Your Rankings with this One Simple Trick
Despite our vast technological advancements over the years, one thing still remains true; computer programs must follow certain parameters set forth by their creators. Google’s algorithm works in the same manner. Despite what many people may believe, Google’s algorithm is a program and is not infallible. Whether we like to believe it or not, it simply cannot view websites the same as you or I.
With over one billion live websites and likely hundreds of billions of pages to scroll through regularly, this can be a daunting task even for Google’s crawlers. In order to expedite the process, these crawlers look for specific criteria in order to give their “opinion” of where a specific site should rank.
By understanding exactly what the crawlers are searching for, site owners are able to create a site that is favorable to Google in order to rank higher. This is the basis of SEO and has been around since the beginning of the internet age.
We all know about the use of keywords, links, and quality content as being contributing factors that Google looks for when determining rank. These are the main aspects that most site owners focus on.
However, there is one major factor that can provide an insanely powerful boost, but unfortunately, so few people actually know about it (which makes it even more powerful).
This aspect is the overall structure of your site. I will teach you how to create what is known as a Silo structured website in order to gain immense favor from the “Big G.” Here is what the CEO of Theme Zoom had to say about a silo structure…
Silo Theming: “A website architecture based on a linking structure that segregates various themes into different ‘silos’ so that people and search engines can easily identify the main topics of a website. Approximately 50% of the theme of a page is communicated by on-site linking. This communication happens most effectively with a website silo architecture which, in turn, can help lower the costs of website rankings by up to 90%. In addition to this, you are more likely to rank for keywords related to your topic than you would with a haphazard linking structure.”
Sue Bell,
CEO, Theme Zoom LLC
In a video provided by Matt Cutts in 2011, Cutts tells of the benefits of creating a well-structured site and its importance to Google’s ranking algorithm. This is similar to the chapters of a book, siloing creates content that is themed or subject specific within your website.
A silo structure is simply a method of implementing the type of architecture that Cutts is referring to. Here is that video…
As I’ve already covered, Google’s web crawlers work within certain parameters. Web crawlers don’t have eyes, ears, or reasoning capability to view your site and make a ranking determination based on what you or I would see. They can only judge your site based on how they were originally programmed to do so.
For instance, you or I may view a site and agree that it offers value and is aesthetically pleasing. However, Google’s web crawlers may see the layout of the site as messy and unorganized if the linking structure is all over the place, making it difficult to crawl, dramatically affecting its rank.
A silo structure is a method used to properly design the framework of your website by implementing a hierarchy of pages. This allows web crawlers to quickly and efficiently navigate and map every inch of your site and properly determine exactly what each published page is about, effectively ranking it higher in the SERP’s.
It creates an organized pathway, which is ideal for a computer program to follow.
Interestingly enough, this organization also makes for a user friendly site as well, which may be why Google gives it so much clout. So, by simply following this method, you can not only dramatically change how Google views your site, but also positively affect your viewers as well? Sounds like a win-win to me!
Notable Benefits of a Silo Structure
1. A site that is properly follows a silo structure allows for up to 90% fewer overall useless internal links.
Whether we are aware of it or not, the majority of websites have an internal linking structure that does not convey any central theme. Without a clearly identifiable theme, pages will not receive as much value in the SERPs.
Internal linking is important, but if it is unorganized it adds little value to for the audience, which Google may take note of. Here is an example provided by MOZ.
internal linking gone crazy
That looks messy doesn’t it? If we were to click on that site, we may not even notice the crazy linking pattern, but that is how Google’s crawlers will map it out. By linking every page together, there is no hierarchy. There are no themes. What does a hotel from London have to do with a hotel from Houston?
2. It allows the “juice” to flow down from your main pages to your content pages, which increases their value and provides a higher boost making it easier to rank for long tailed keywords. Here is a view of what a properly siloed site could look like, courtesy of Themezoom.
silo structureNotice how much cleaner this is. Each level of the hierarchy has a related theme to the one above it. As it goes down, the pages become more theme specific.
This is only one of the many silo layouts that has become popular across the web. The primary goal of Google is to provide users with the most relevantly themed pages and websites for their query.
Focusing specifically on keyword phrases may be a lost cause since the launch of the most recent Google updates. Instead, one should focus on building themes that match your specific keyword phrases.
Here’s an idea of how it would work; for this example, we are going to use the photo shown above. If I had a website that sold cell phones, here is how I would structure it:
Homepage
The theme of this page would revolve around the main keyword “cell phones”
Silo Pages
These could include different sub topics of the main theme. This 2nd level of the structure could have cell phone plan, wireless cell phone, cell phone service, and ringtones.
Categories
This is the 3rd level of the structure and will feature sub topics from the theme listed in the 2nd level. For instance, under your subtopic “ringtones,” we could include sub-sub-topics such as ring tone downloads, free ring tones, and video game ringtones.
Supporting Pages
These aren’t absolutely necessary unless you have a very broad niche and want to capitalize on even more long tailed keywords. A few supporting pages for video game ringtones could separate into different genres, such as first person shooters, RPGs, or sports game ringtones.
The Final Say
Creating a properly structured website, you stand a far better chance at ranking for specific keywords early on. In no way am I saying this is a miracle fix, but if done properly, it can yield some incredible results.
The fact that very few websites actually implement this style of structuring will only add to the boost you receive as Google will view your site as potentially well relevant as all of your themes and categories will be properly designated.
Go ahead and try this for yourself and let me know how it works out by leaving a comment in the section below!
Related Content You May Like...
About Sean Donahoe
Sean is one of the most recognized industry leaders in business and marketing. As a popular speaker, author, consultant he has helped over 50,000 students world wide find success in their businesses and has consulted with Fortune 500 companies and businesses of every size grow and thrive...
30 comments
1. There are so many ways to build a silo site that not just one way is the correct way. This style is truly amazing however, you can rank with video, image, and very little content. Good examples Mr.Sean.
• Thanks Jim and you are right, many ways to structure a silo. We have found in our testing this is the most efficient and versatile way in our experiments. Silos make life much easier, either way.
2. Great Article, I now realize how poorly structured my sites are, and my rankings could be that much better ….thanks Sean
3. Great post. Would love to a step by step video of how to build a silo site using a WordPress theme. The only information I can see about building a silo site using WordPress just says buy this or that plugin.
If there is a way to do it manually, I would love to see it. 🙂
4. Sean
Very good post as always. Just restructured my sites with the generous free plugin from theme zoom. Guess what? All sites have increased in serps from a couple of pages to in some cases 30 to 40 for long tails.
Siloing works full stop.
• Dom,
Can you go into a little more detail about how you restructured and if you use 301’s for about how many pages? We are looking at using this plug in for about 800 pages.
Thanks in advance.
5. You always give us such great information and I’m truly grateful to you for sharing your expertise with us.
I have a site built as you describe above. However, I don’t have the fourth tier of Supporting Pages that you’ve mentioned. I would like to add that tier to my site but don’t know how to go about doing that. Are they just another category added as a sub page to the existing category? Or how do I go about adding that to my site?
6. Great article, Sean. I will definitely be bookmarking this and sharing it.. This is something I do as second nature when designing a site. For any web designer navigation is one of the hot topics. Having a well thought out directory structure is not only better for your site’s Google rankings, but it will also make it much easier for your customers to find what they need within one to three clicks. So this really kills two birds with one stone; one, it will help your site’s rankings with Google, and two, it is great UI/UX designing.
7. I have a plugin…. I think it is called Seo Zen…. Is that one OK and will work?
8. Nice article Sean! I’ve been using a silo structure for some time and do agree that it helps with rankings. However, I do everything manually and find it to be very time consuming. Any plans in the future to create a plugin to automate this process? I tested a few that are out there, but they work more like your first example (messy) as opposed to being laid out nice and tidy as in your second example.
• That would be great to see.
I would even buy a step by step guide that shows you how to do it manually. It has to be step by step.
As far as I can see no-one has done that yet, You get the odd article that starts off do this do that, then does not tell you how to do the links. Make it a how to do it on WP themes and you will have a seller. I am doing an SEO course for 100 people and nearly 20 have asked about silos, but it is not taught on the site.
Please get writing Christina. I’ll proof read it for you.
9. This is a terrific article, well worth reading, learning and personally I wish you would do another one on this very subject with more examples, so that it really sinks in how this is to be done. For instance showing us a site that is actually properly structured would be a huge help. I do believe you are right in how this is to be done but it would sure help to see what a site is suppose to look like too. Paul
10. Thanks for that, what about a pre – existing web site, that is not right but lots of pages and posts how do you then go and sort this out?
11. Great info, thanks. Quick question, on the lower levels of the silo, does it still work to have the pages then linking on to a common contact / request a quote page, or do they need to be “dead ends” and have the user go back through the higher levels to reach a conversion page? And is it OK to just have the structure as links from each page, or do the actual page URLs need to be hierarchical as well (eg: home.com/silo-page/category-one/supporting-page-one, or is home.com/supporting-page-one OK?)
12. Thanks Sean I know my site needs a lot of work.Thanks for these articles and your great products.
13. Another helpful post from you! Thank you so much Sean! I am always waiting for posts from you. It’s like I am visiting your site every now and then for new posts.
14. Thank you for posting! This made me realize my sites are not working well 🙁
15. Good idea. The exact url for a post would be:
http://www.website.com/silopage1/category1/article1
Is it correct ?.
What would happen with the actual structure,
If I use this permalink structure:
http://www.website.com//%postname%/
Do we have to change the entire permalink structure ?
thanksss..
16. This is my first time to hear about SILO and I wonder if I can improve my rankings with this. Thanks Sean!
17. Great article. Just had a technical question. We asked about how we set up the silo structure. Can you please let us know. Thanks.
18. Does your training show you how to build a silo site without a plugin, or using the free one from SEOZEN?
19. Wow. I just remember seeing this on our examination question papers “5 marks for good & legible writing”. Looks Google also believes in awarding properly linked sites. Great post.
20. Hi Sean,
This is a really nice clear and concise summary about Silo SEO.
I’m pointing my members here as a nice easy entry point to the whole subject.
There’s something new and Silo based in HeatMap World, as yet under wraps with my inner circle, but getting ready for launch. It’s right in this ball park. Could maybe do a special ‘pro-lite’ version for you as we did all those years ago 😉
Drop me a line at through regular HeatMap channels if you are interested 😉
Cheers,
Stuart
21. Yup I still have your avatar on my skype contacts 😉 Will ping you when time zones coincide. Cheers. Stuart
22. How long after implementation of silo structure on website it will show the results in SERP? Better ranking of pages, posts and category pages.
Leave a Reply
Scroll To Top
|
{
"url": "http://imsuccesscenter.com/the-silo-structure-skyrocket-your-rankings-with-this-1-simple-trick/",
"source_domain": "imsuccesscenter.com",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "148259",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M6R7X34D4VLOPYXGMD2CC34ZYULC2VTN",
"WARC-Concurrent-To": "<urn:uuid:9cbc4623-ff3f-49b5-8f0f-222522acb287>",
"WARC-Date": "2016-12-11T13:51:46Z",
"WARC-IP-Address": "67.225.226.131",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DGFW6QSWWBNKEKFD6T3SXACZE4IFPRMP",
"WARC-Record-ID": "<urn:uuid:fcd9bfea-50fc-4bba-ae4d-2fb5ac5085e7>",
"WARC-Target-URI": "http://imsuccesscenter.com/the-silo-structure-skyrocket-your-rankings-with-this-1-simple-trick/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01276524-22c5-4753-b2d9-388b9458df06>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
89,
90,
161,
162,
559,
560,
869,
870,
1109,
1110,
1310,
1311,
1484,
1485,
1730,
1731,
2302,
2303,
2313,
2314,
2334,
2335,
2614,
2615,
2740,
2741,
3050,
3051,
3350,
3351,
3676,
3677,
3759,
3760,
4073,
4074,
4111,
4112,
4223,
4224,
4449,
4450,
4615,
4616,
4644,
4953,
4954,
5229,
5230,
5402,
5403,
5600,
5601,
5801,
5802,
5976,
5977,
5986,
5987,
6062,
6063,
6074,
6075,
6251,
6252,
6263,
6264,
6524,
6525,
6542,
6543,
6820,
6821,
6835,
6836,
7054,
7055,
7296,
7297,
7408,
7409,
7411,
7412,
7444,
7445,
7464,
7465,
7757,
7758,
7770,
7771,
7979,
7980,
8182,
8183,
8309,
8310,
8524,
8525,
8592,
8593,
8603,
8604,
8819,
8820,
8849,
8850,
8861,
8862,
9037,
9038,
9063,
9064,
9177,
9178,
9512,
9513,
10057,
10058,
10142,
10143,
10554,
10555,
10589,
10590,
10699,
10700,
11029,
11030,
11094,
11095,
11515,
11516,
11661,
11662,
12170,
12171,
12275,
12276,
12445,
12446,
12528,
12529,
12581,
12582,
12638,
12639,
12660,
12661,
12710,
12711,
12750,
12751,
12791,
12792,
12850,
12851,
12866,
12867,
12980,
12981,
13118,
13119,
13231,
13232,
13418,
13419,
13434,
13435,
13503,
13585,
13586,
13830,
13831,
13910,
13911,
13923,
13934,
13935,
14048,
14049,
14199,
14200,
14214,
14215
],
"line_end_idx": [
89,
90,
161,
162,
559,
560,
869,
870,
1109,
1110,
1310,
1311,
1484,
1485,
1730,
1731,
2302,
2303,
2313,
2314,
2334,
2335,
2614,
2615,
2740,
2741,
3050,
3051,
3350,
3351,
3676,
3677,
3759,
3760,
4073,
4074,
4111,
4112,
4223,
4224,
4449,
4450,
4615,
4616,
4644,
4953,
4954,
5229,
5230,
5402,
5403,
5600,
5601,
5801,
5802,
5976,
5977,
5986,
5987,
6062,
6063,
6074,
6075,
6251,
6252,
6263,
6264,
6524,
6525,
6542,
6543,
6820,
6821,
6835,
6836,
7054,
7055,
7296,
7297,
7408,
7409,
7411,
7412,
7444,
7445,
7464,
7465,
7757,
7758,
7770,
7771,
7979,
7980,
8182,
8183,
8309,
8310,
8524,
8525,
8592,
8593,
8603,
8604,
8819,
8820,
8849,
8850,
8861,
8862,
9037,
9038,
9063,
9064,
9177,
9178,
9512,
9513,
10057,
10058,
10142,
10143,
10554,
10555,
10589,
10590,
10699,
10700,
11029,
11030,
11094,
11095,
11515,
11516,
11661,
11662,
12170,
12171,
12275,
12276,
12445,
12446,
12528,
12529,
12581,
12582,
12638,
12639,
12660,
12661,
12710,
12711,
12750,
12751,
12791,
12792,
12850,
12851,
12866,
12867,
12980,
12981,
13118,
13119,
13231,
13232,
13418,
13419,
13434,
13435,
13503,
13585,
13586,
13830,
13831,
13910,
13911,
13923,
13934,
13935,
14048,
14049,
14199,
14200,
14214,
14215,
14228
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14228,
"ccnet_original_nlines": 185,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46182557940483093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020699020475149155,
"rps_doc_frac_lines_end_with_ellipsis": 0.021505380049347878,
"rps_doc_frac_no_alph_words": 0.1411605030298233,
"rps_doc_frac_unique_words": 0.3126984238624573,
"rps_doc_mean_word_length": 4.4075398445129395,
"rps_doc_num_sentences": 181,
"rps_doc_symbol_to_word_ratio": 0.0023753000423312187,
"rps_doc_unigram_entropy": 5.7703657150268555,
"rps_doc_word_count": 2520,
"rps_doc_frac_chars_dupe_10grams": 0.010623930022120476,
"rps_doc_frac_chars_dupe_5grams": 0.01890699937939644,
"rps_doc_frac_chars_dupe_6grams": 0.017466459423303604,
"rps_doc_frac_chars_dupe_7grams": 0.014045200310647488,
"rps_doc_frac_chars_dupe_8grams": 0.010623930022120476,
"rps_doc_frac_chars_dupe_9grams": 0.010623930022120476,
"rps_doc_frac_chars_top_2gram": 0.007022600155323744,
"rps_doc_frac_chars_top_3gram": 0.006302330177277327,
"rps_doc_frac_chars_top_4gram": 0.0029710999224334955,
"rps_doc_books_importance": -1197.010986328125,
"rps_doc_books_importance_length_correction": -1197.010986328125,
"rps_doc_openwebtext_importance": -753.3667602539062,
"rps_doc_openwebtext_importance_length_correction": -753.3667602539062,
"rps_doc_wikipedia_importance": -548.15625,
"rps_doc_wikipedia_importance_length_correction": -548.15625
},
"fasttext": {
"dclm": 0.027217090129852295,
"english": 0.9500522613525391,
"fineweb_edu_approx": 1.4859721660614014,
"eai_general_math": 0.08767092227935791,
"eai_open_web_math": 0.175392746925354,
"eai_web_code": 0.01727515086531639
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,374,722,632,663,610,000 |
Which tests should I use - please help
#1
Hello. First-time poster here. I've been having trouble trying to figure out how to analyze some data, and I would really appreciate some help.
I've collected response rates in thirty-two cells to between three and twenty-one presentations of two pairs of stimuli for each cell. The two pairs of stimuli were not the same for each cell, but each cell was presented with two of the same four possible pairs.
I would like to determine whether the variability (or stability) of a response across trials is determined by the stimulus quality presented, the specific stimuli presented, or the cell. I'm not sure what kind of test I should use when variability itself is my dependent variable, and not just a nuisance.
I would also like to determine whether response magnitudes across trials correlate better (within individual cells) for stimuli belonging to a pair than for stimuli belonging to different pairs.
Thank you all for reading this far, at the very least; and many, many thanks to anyone who can help me out a little. I've tried to be as clear as possible in my description of the problem, but let me know if something I wrote doesn't quite make sense.
Cheers,
AR
|
{
"url": "http://www.talkstats.com/threads/which-tests-should-i-use-please-help.1601/",
"source_domain": "www.talkstats.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "31441",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JDAESVBHVFIBPS2HGJE756JPJTDGQISU",
"WARC-Concurrent-To": "<urn:uuid:a11d24eb-70ee-4e90-a00e-3cc21398e4cd>",
"WARC-Date": "2020-11-26T16:24:02Z",
"WARC-IP-Address": "199.167.200.62",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GJBMHJ6BP5BEXBZDQ4W4JQGBNH5VNDAC",
"WARC-Record-ID": "<urn:uuid:8728e1bc-62b4-4777-928d-8ef90ccde117>",
"WARC-Target-URI": "http://www.talkstats.com/threads/which-tests-should-i-use-please-help.1601/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e4547aa4-65f2-48e0-a6fe-4cbb7b51832e>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-64.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,
39,
40,
43,
187,
188,
189,
452,
453,
759,
760,
955,
956,
957,
1209,
1210,
1218,
1219,
1222
],
"line_end_idx": [
39,
40,
43,
187,
188,
189,
452,
453,
759,
760,
955,
956,
957,
1209,
1210,
1218,
1219,
1222,
1223
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1223,
"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.5317460298538208,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0436507910490036,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1388888955116272,
"rps_doc_frac_unique_words": 0.5952380895614624,
"rps_doc_mean_word_length": 4.609523773193359,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.003968250006437302,
"rps_doc_unigram_entropy": 4.589668273925781,
"rps_doc_word_count": 210,
"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.01859503984451294,
"rps_doc_frac_chars_top_3gram": 0.020661160349845886,
"rps_doc_frac_chars_top_4gram": 0.03512397035956383,
"rps_doc_books_importance": -119.73223876953125,
"rps_doc_books_importance_length_correction": -119.73223876953125,
"rps_doc_openwebtext_importance": -81.36161804199219,
"rps_doc_openwebtext_importance_length_correction": -81.361572265625,
"rps_doc_wikipedia_importance": -57.850135803222656,
"rps_doc_wikipedia_importance_length_correction": -57.850135803222656
},
"fasttext": {
"dclm": 0.1943882703781128,
"english": 0.9743780493736267,
"fineweb_edu_approx": 1.4560714960098267,
"eai_general_math": 0.9950030446052551,
"eai_open_web_math": 0.390891969203949,
"eai_web_code": 0.9389111995697021
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "570",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,413,575,741,666,947,000 |
1
vote
2answers
185 views
GetFeatureInfo on ArcGIS Web Service
I am attempting to call do a GetFeatureInfo request on it a counties layer which is stored withing ArcSDE and hosted via ArcGIS Server 10. The request looks like WMS GetFeatureInfo Request The ...
1
vote
1answer
72 views
Data safety in ArcGIS Server network
I want to know about the safety of data shared in an ArcGIS server network. Can someone hack into the network and steal the data? Suppose we create an ArcGIS web service and put up an application, can ...
1
vote
0answers
55 views
Concurrent users using a DLL to access ArcObjects?
So currently I have some ASP.net code where users are updated GIS through a DLL file that uses ArcObjects to talk to the MapService and layer. My question is, will there be concurrent user issues? ...
2
votes
4answers
484 views
Are there ARCIMS still around or phased out?
My understanding is there are few companies still using ARCIMS and am wondering if it is still alive or phased out ? THanks
2
votes
1answer
438 views
Map service appears in the web REST view but not in ArcMap?
I have an ArcSDE server serving some poly layers through a map service running on ArcGIS Server 10.0. The service appears to be working--I can navigate to it just fine in the REST view and I can see ...
|
{
"url": "http://gis.stackexchange.com/questions/tagged/web-services+arcgis-10.0",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "53908",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YFWA4LBQJTKNE3YHORFY6RQCBTUJI6RA",
"WARC-Concurrent-To": "<urn:uuid:a2d8f889-5b46-4684-b167-b2ec95f1adef>",
"WARC-Date": "2014-03-14T17:24:35Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:POTPCH5JZHUBSDCPTMLQRTGDQIU4LLGL",
"WARC-Record-ID": "<urn:uuid:c2091d66-a5b9-41c4-9c78-4e4c1e367f0b>",
"WARC-Target-URI": "http://gis.stackexchange.com/questions/tagged/web-services+arcgis-10.0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:37c73520-dc05-4dff-bb65-f0805138e248>"
},
"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,
2,
7,
16,
26,
27,
64,
65,
262,
264,
269,
277,
286,
287,
324,
325,
530,
532,
537,
546,
555,
556,
607,
608,
809,
811,
817,
826,
836,
837,
882,
883,
1007,
1009,
1015,
1023,
1033,
1034,
1094,
1095
],
"line_end_idx": [
2,
7,
16,
26,
27,
64,
65,
262,
264,
269,
277,
286,
287,
324,
325,
530,
532,
537,
546,
555,
556,
607,
608,
809,
811,
817,
826,
836,
837,
882,
883,
1007,
1009,
1015,
1023,
1033,
1034,
1094,
1095,
1297
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1297,
"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.3769841194152832,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0595238097012043,
"rps_doc_frac_lines_end_with_ellipsis": 0.10000000149011612,
"rps_doc_frac_no_alph_words": 0.1269841343164444,
"rps_doc_frac_unique_words": 0.539130449295044,
"rps_doc_mean_word_length": 4.456521511077881,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.015873020514845848,
"rps_doc_unigram_entropy": 4.594498634338379,
"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.04682926833629608,
"rps_doc_frac_chars_top_3gram": 0.03121951036155224,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -136.45587158203125,
"rps_doc_books_importance_length_correction": -136.45587158203125,
"rps_doc_openwebtext_importance": -71.80410766601562,
"rps_doc_openwebtext_importance_length_correction": -71.80410766601562,
"rps_doc_wikipedia_importance": -33.90827941894531,
"rps_doc_wikipedia_importance_length_correction": -33.90827941894531
},
"fasttext": {
"dclm": 0.06488090753555298,
"english": 0.9311776757240295,
"fineweb_edu_approx": 1.2568328380584717,
"eai_general_math": 0.011426210403442383,
"eai_open_web_math": 0.12048841267824173,
"eai_web_code": 0.003491640090942383
}
}
|
{
"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.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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
|
3,429,685,336,753,696,300 |
cancel
Showing results for
Show only | Search instead for
Did you mean:
Any Measure That Able to Provide A Picture of How Fragmented the Heap is?
The title of the question pretty much says it all. (btw, its a Hotspot JVM)
I am troubleshooting memory issue, and suspect that the Old Gen is too fragmented to allocate large memory chunk and thus, throw a OOM. (Since there are many times in chart that I see the memory usage is higher and yet no OOM)
If there's no such metric, any workaround or any other way I can possible achive this or see how fragmented the heap gets?
2 REPLIES 2
dave_mauney
Dynatrace Champion
Dynatrace Champion
Hi Wai,
I don't think we have any measure or way to give any insight into memory fragmentation.
Sorry,
dave
Okay thanks.
|
{
"url": "https://community.dynatrace.com/t5/AppMon-UEM/Any-Measure-That-Able-to-Provide-A-Picture-of-How-Fragmented-the/td-p/92560",
"source_domain": "community.dynatrace.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "435885",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6K6VGB4KJ454F45P3R442CPXXGZWCGBX",
"WARC-Concurrent-To": "<urn:uuid:bb4ec2de-005b-43f5-9c5e-dab1111f6d6c>",
"WARC-Date": "2021-06-24T22:45:03Z",
"WARC-IP-Address": "54.192.36.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q36VLUIUKJWRHRO5SHPPT4GBKW47JZI2",
"WARC-Record-ID": "<urn:uuid:a68d3566-d6b1-4eba-950c-523b7afe6f78>",
"WARC-Target-URI": "https://community.dynatrace.com/t5/AppMon-UEM/Any-Measure-That-Able-to-Provide-A-Picture-of-How-Fragmented-the/td-p/92560",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f90ab7ac-7c1c-42a8-9f6d-698ac8432751>"
},
"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-187.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,
7,
28,
62,
77,
78,
152,
153,
229,
230,
457,
458,
581,
582,
594,
595,
607,
626,
645,
646,
654,
655,
743,
744,
751,
752,
757,
758
],
"line_end_idx": [
7,
28,
62,
77,
78,
152,
153,
229,
230,
457,
458,
581,
582,
594,
595,
607,
626,
645,
646,
654,
655,
743,
744,
751,
752,
757,
758,
770
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 770,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42138364911079407,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.056603770703077316,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.138364776968956,
"rps_doc_frac_unique_words": 0.7007299065589905,
"rps_doc_mean_word_length": 4.350365161895752,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.411992073059082,
"rps_doc_word_count": 137,
"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.03355704993009567,
"rps_doc_frac_chars_top_3gram": 0.053691279143095016,
"rps_doc_frac_chars_top_4gram": 0.06711409240961075,
"rps_doc_books_importance": -75.6660385131836,
"rps_doc_books_importance_length_correction": -75.6660385131836,
"rps_doc_openwebtext_importance": -43.08282470703125,
"rps_doc_openwebtext_importance_length_correction": -43.08282470703125,
"rps_doc_wikipedia_importance": -28.292978286743164,
"rps_doc_wikipedia_importance_length_correction": -28.292978286743164
},
"fasttext": {
"dclm": 0.4690338373184204,
"english": 0.9012982845306396,
"fineweb_edu_approx": 1.2489566802978516,
"eai_general_math": 0.03428196907043457,
"eai_open_web_math": 0.35266268253326416,
"eai_web_code": 0.004011149983853102
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,789,090,128,906,168,000 |
Random users start youtube video
Hello,
We use Jitsi for school and sometimes students start a youtube video.
We already took out the code for the webversion but you cant delete this for the app.
Now when you kick someone who started the video the video is gone aswell but you cant see who started the video.
Question: where can you see which user started the youtube video?
Thanks for the help!
If you can’t find who started video then how you kicking them out?
By testing it myself. I joined on my phone to a session I started on the computer. Then started a youtube video through the app on my phone. Then on my computer I kicked the user from the phone. The youtube video was also gone when I did that.
It’s possible to disable the Youtube sharing completely if you don’t neeed it under any circumstances
Ok, and how?
Remove sharedvideo from TOOLBAR_BUTTONS in usr/share/jitsi-meet/interface_config.js
TOOLBAR_BUTTONS: [
'microphone', 'camera', 'closedcaptions', 'desktop', 'fullscreen',
'fodeviceselection', 'hangup', 'profile', 'chat', 'recording',
'livestreaming', 'etherpad', 'sharedvideo', 'settings', 'raisehand',
'videoquality', 'filmstrip', 'stats', 'shortcuts',
'tileview', 'download', 'help', 'mute-everyone', 'security'
],
You said
but interface_config.js just disables the button in the webclient, not in the app.
Sorry, you are right. I forgot the mobile clients
|
{
"url": "https://community.jitsi.org/t/random-users-start-youtube-video/89853",
"source_domain": "community.jitsi.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "26424",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3SITQMJKIXEZZPFLJATRD6Q3DCLMLA7B",
"WARC-Concurrent-To": "<urn:uuid:2a5c7300-f71c-4f76-91b4-e6962de9a8b8>",
"WARC-Date": "2021-01-26T02:57:55Z",
"WARC-IP-Address": "72.52.80.15",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7EOK2B7DVAN2NHV4WBD4VESBEHUOZP4C",
"WARC-Record-ID": "<urn:uuid:468c416f-4483-406d-9264-1cb735b43624>",
"WARC-Target-URI": "https://community.jitsi.org/t/random-users-start-youtube-video/89853",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85b94324-a6fe-4098-871f-64c8129f7e82>"
},
"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-23.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,
33,
34,
41,
42,
112,
198,
199,
312,
313,
379,
380,
401,
402,
469,
470,
714,
715,
817,
818,
831,
832,
916,
917,
936,
1007,
1074,
1147,
1202,
1266,
1269,
1270,
1279,
1280,
1363,
1364
],
"line_end_idx": [
33,
34,
41,
42,
112,
198,
199,
312,
313,
379,
380,
401,
402,
469,
470,
714,
715,
817,
818,
831,
832,
916,
917,
936,
1007,
1074,
1147,
1202,
1266,
1269,
1270,
1279,
1280,
1363,
1364,
1413
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1413,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34228187799453735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023489929735660553,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.268456369638443,
"rps_doc_frac_unique_words": 0.5817307829856873,
"rps_doc_mean_word_length": 5.120192527770996,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.455156326293945,
"rps_doc_word_count": 208,
"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.056338030844926834,
"rps_doc_frac_chars_top_3gram": 0.024413149803876877,
"rps_doc_frac_chars_top_4gram": 0.0338028185069561,
"rps_doc_books_importance": -146.25665283203125,
"rps_doc_books_importance_length_correction": -145.79969787597656,
"rps_doc_openwebtext_importance": -100.19467163085938,
"rps_doc_openwebtext_importance_length_correction": -100.19467163085938,
"rps_doc_wikipedia_importance": -73.29010772705078,
"rps_doc_wikipedia_importance_length_correction": -68.39978790283203
},
"fasttext": {
"dclm": 0.14927297830581665,
"english": 0.8438141345977783,
"fineweb_edu_approx": 1.1203020811080933,
"eai_general_math": 0.314552366733551,
"eai_open_web_math": 0.0825425386428833,
"eai_web_code": 0.08112459629774094
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,899,026,858,108,744,000 |
Answers for "Sending Emails via Stored Proc" https://ask.sqlservercentral.com/questions/41323/sending-emails-via-stored-proc.html The latest answers for the question "Sending Emails via Stored Proc" Answer by nmanwaring https://ask.sqlservercentral.com/answers/41340/view.html I believe this should do it, or get you very very close. You can accomplish the task your trying to do by creating a cursor that executes designated tasks based on every item you put into it, in this case every row from Table_A. Hope this helps. <font face="Courier New" size="2"> <font color = "blue">DECLARE</font> <font color = "#8000FF">@FieldLoop</font> <font color = "black"><i>CURSOR</i></font><font color = "silver">,</font> <br/> <font color = "#8000FF">@Table_A_key</font> <font color = "blue">AS</font> <font color = "black"><i>VARCHAR</i></font><font color = "maroon">(</font><font color = "black">255</font><font color = "maroon">)</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@Name</font> <font color = "blue">AS</font> <font color = "black"><i>VARCHAR</i></font><font color = "maroon">(</font><font color = "black">255</font><font color = "maroon">)</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@Email</font> <font color = "blue">AS</font> <font color = "black"><i>VARCHAR</i></font><font color = "maroon">(</font><font color = "black">255</font><font color = "maroon">)</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@sql01</font> <font color = "blue">AS</font> <font color = "black"><i>NVARCHAR</i></font><font color = "maroon">(</font><font color = "blue">MAX</font><font color = "maroon">)</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@EmailBody</font> <font color = "blue">AS</font> <font color = "black"><i>VARCHAR</i></font><font color = "maroon">(</font><font color = "black">255</font><font color = "maroon">)</font> <br/> <br/><font color = "blue">SET</font> <font color = "#8000FF">@FieldLoop</font> <font color = "silver">=</font> <font color = "blue">CURSOR</font> <br/><font color = "blue">FOR</font> <font color = "blue">SELECT</font> <font color = "blue">DISTINCT</font> <font color = "maroon">Table_A_key</font> <br/> <font color = "blue">FROM</font> <font color = "maroon">Table_A</font> <br/> <br/><font color = "blue">OPEN</font> <font color = "#8000FF">@FieldLoop</font> <br/> <br/><font color = "blue">FETCH</font> <font color = "blue">NEXT</font> <font color = "blue">FROM</font> <font color = "#8000FF">@FieldLoop</font> <font color = "blue">INTO</font> <font color = "#8000FF">@Table_A_key</font> <br/> <br/><font color = "blue">WHILE</font> <font color = "fuchsia"><i>@@FETCH_STATUS</i></font> <font color = "silver">=</font> <font color = "black">0</font> <br/> <font color = "blue">BEGIN</font> <br/> <font color = "blue">SET</font> <font color = "#8000FF">@Name</font> <font color = "silver">=</font> <font color = "maroon">(</font><font color = "blue">SELECT</font> <font color = "maroon">Table_A_Name</font> <br/> <font color = "blue">FROM</font> <font color = "maroon">Table_A</font> <br/> <font color = "blue">WHERE</font> <font color = "maroon">Table_A_key</font> <font color = "silver">=</font> <font color = "#8000FF">@Table_A_key</font><font color = "maroon">)</font> <br/> <font color = "blue">SET</font> <font color = "#8000FF">@Email</font> <font color = "silver">=</font> <font color = "maroon">(</font><font color = "blue">SELECT</font> <font color = "maroon">Table_A_Email</font> <br/> <font color = "blue">FROM</font> <font color = "maroon">Table_A</font> <br/> <font color = "blue">WHERE</font> <font color = "maroon">Table_A_key</font> <font color = "silver">=</font> <font color = "#8000FF">@Table_A_key</font><font color = "maroon">)</font> <br/> <font color = "blue">SET</font> <font color = "#8000FF">@sql01</font> <font color = "silver">=</font> <font color = "red">' UPDATE Table_B SET Table_B_Name = '''</font> <font color = "silver">+</font> <font color = "#8000FF">@Name</font> <font color = "silver">+</font> <font color = "red">''' Table_B_Email = '''</font> <font color = "silver">+</font> <font color = "#8000FF">@Email</font> <font color = "silver">+</font> <font color = "red">''' WHERE Table_B.Table_A_Key = '''</font> <font color = "silver">+</font> <br/> <font color = "#8000FF">@Table_A_key</font> <font color = "silver">+</font> <font color = "red">''' '</font> <br/> <br/> <font color = "blue">EXEC</font> <font color = "#FF0080"><b>Sp_executesql</b></font> <font color = "#8000FF">@sql01</font> <br/> <br/> <font color = "blue">SET</font> <font color = "#8000FF">@EmailBody</font> <font color = "silver">=</font> <font color = "red">'This message is a confirmation that the procedure to update Table B has run for name:'</font> <font color = "silver">+</font> <font color = "#8000FF">@Name</font> <font color = "silver">+</font> <br/> <font color = "red">' associated with your email address:'</font> <font color = "silver">+</font> <font color = "#8000FF">@Email</font> <br/> <br/> <font color = "blue">EXEC</font> <font color = "maroon">msdb</font><font color = "silver">.</font><font color = "maroon">dbo</font><font color = "silver">.</font><font color = "#FF0080"><b>Sp_send_dbmail</b></font> <br/> <font color = "#8000FF">@recipients</font> <font color = "silver">=</font> <font color = "#8000FF">@Email</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@subject</font> <font color = "silver">=</font> <font color = "red">'Table B has been updated'</font><font color = "silver">,</font> <br/> <font color = "#8000FF">@body</font> <font color = "silver">=</font> <font color = "#8000FF">@EmailBody</font> <br/> <br/> <font color = "blue">FETCH</font> <font color = "blue">NEXT</font> <font color = "blue">FROM</font> <font color = "#8000FF">@FieldLoop</font> <font color = "blue">INTO</font> <font color = "#8000FF">@Table_A_key</font> <br/> <font color = "blue">END</font> <br/> <br/><font color = "blue">CLOSE</font> <font color = "#8000FF">@FieldLoop</font> <br/> <br/><font color = "blue">DEALLOCATE</font> <font color = "#8000FF">@FieldLoop</font> </font> Wed, 08 Jun 2011 23:13:13 GMT nmanwaring
|
{
"url": "https://ask.sqlservercentral.com/feed/41323/answers.rss",
"source_domain": "ask.sqlservercentral.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "13359",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5IFQNMNIEJH22A6NTA4HWIHXZ74KNQEN",
"WARC-Concurrent-To": "<urn:uuid:b8769b6c-8516-4965-91ae-9c8296f8d251>",
"WARC-Date": "2023-05-29T03:13:27Z",
"WARC-IP-Address": "35.172.86.27",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:YJOW53TIXELPSYMGLEKFAB2F23MGUQPJ",
"WARC-Record-ID": "<urn:uuid:261c181e-6e26-49c4-bd7e-6a88c0e38276>",
"WARC-Target-URI": "https://ask.sqlservercentral.com/feed/41323/answers.rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:62b62b39-3397-45f7-b0f7-6dd363ee8457>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-37\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
],
"line_end_idx": [
8424
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8424,
"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.028343310579657555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.034331340342760086,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5001996159553528,
"rps_doc_frac_unique_words": 0.3444976210594177,
"rps_doc_mean_word_length": 13.212918281555176,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.01317365001887083,
"rps_doc_unigram_entropy": 3.6651811599731445,
"rps_doc_word_count": 418,
"rps_doc_frac_chars_dupe_10grams": 0.21528154611587524,
"rps_doc_frac_chars_dupe_5grams": 0.3608545958995819,
"rps_doc_frac_chars_dupe_6grams": 0.27322107553482056,
"rps_doc_frac_chars_dupe_7grams": 0.25927937030792236,
"rps_doc_frac_chars_dupe_8grams": 0.23248234391212463,
"rps_doc_frac_chars_dupe_9grams": 0.23248234391212463,
"rps_doc_frac_chars_top_2gram": 0.07495926320552826,
"rps_doc_frac_chars_top_3gram": 0.09125474840402603,
"rps_doc_frac_chars_top_4gram": 0.07351077347993851,
"rps_doc_books_importance": -218.07106018066406,
"rps_doc_books_importance_length_correction": -218.07106018066406,
"rps_doc_openwebtext_importance": 236.31021118164062,
"rps_doc_openwebtext_importance_length_correction": 236.31021118164062,
"rps_doc_wikipedia_importance": 261.510009765625,
"rps_doc_wikipedia_importance_length_correction": 261.510009765625
},
"fasttext": {
"dclm": 1.000009298324585,
"english": 0.26398175954818726,
"fineweb_edu_approx": 3.965728521347046,
"eai_general_math": 0.9906541109085083,
"eai_open_web_math": 0.19995731115341187,
"eai_web_code": 0.988765299320221
}
}
|
{
"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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,361,087,743,921,300,000 |
Thursday, October 6, 2011
The Thursday Quote - Srikanth Nadhamuni, Vince Beiser
"Technology doesn't scale that elegantly. The problems you have at 100 million are different from problems you have at 500 million."
Srikanth Nadhamuni, Head of Technology for Aadhaar at the Unique Identification (UID) Authority of India, as quoted in Massive Biometric Project Gives Millions of Indians an ID by Vince Beiser, from Wired magazine September 2011
So you think your job is hard?
You feel good at the end of the day because you fixed that bug, got those to-do items done, gave as good as you got at the daily status meeting?
Well, give a thought to Srikanth Nadhamuni, whose goal is to "issue identification numbers linked to the fingerprints and iris scans of every single person in India" as Head of Technology for the Aadhaar project.
That's 1,200,000,000 people, give or take, as Vince Beiser explains in his article about Aadhaar; here's an excerpt to give a wider context:
The unprecedented scale of Aadhaar's data will make managing it extraordinarily difficult. One of Nadhamuni's most important tasks is de-duplication, ensuring that each record in the database is matched to one and only one person. That's crucial to keep scammers from enrolling multiple times under different names to double-dip on their benefits. To guard against that, the agency needs to check all 10 fingers and both irises of each person against those of everyone else. In a few years, when the database contains 600 million people and is taking in 1 million more per day, Nadhamuni says, they'll need to run about 14 billion matches per second. "That's enormous," he says.
Coping with that load takes more than just adding extra servers. Even Nadhamuni isn't sure how big the ultimate server farm will be. He isn't even totally sure how to work it yet. "Technology doesn't scale that elegantly," he says. "The problems you have at 100 million are different from problems you have at 500 million." And Aadhaar won't know what those problems are until they show up. As the system grows, different components slow down in different ways. There might be programming flaws that delay each request by an amount too tiny to notice when you're running a small number of queries—but when you get into the millions, those tiny delays add up to a major issue. When the system was first activated, Nadhamuni says, he and his team were querying their database, created with the ubiquitous software MySQL, about 5,000 times a day and getting answers back in a fraction of a second. But when they leaped up to 20,000 queries, the lag time rose dramatically. The engineers eventually figured out that they needed to run more copies of MySQL in parallel; software, not hardware, was the bottleneck. "It's like you've got a car with a Hyundai engine, and up to 30 miles per hour it does fine," Nadhamuni says. "But when you go faster, the nuts and bolts fall off and you go, whoa, I need a Ferrari engine. But for us, it's not like there are a dozen engines and we can just pick the fastest one. We are building these engines as we go along."
Next week: Barbara Liskov, Valerie Barr
No comments:
|
{
"url": "http://sqlanywhere.blogspot.com/2011/10/thursday-quote-srikanth-nadhamuni-vince.html",
"source_domain": "sqlanywhere.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "77180",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XY5H7DVQODDWIZY273FWFUQWQQNJOI2V",
"WARC-Concurrent-To": "<urn:uuid:e01c49f7-826a-45e4-8598-2a68e4bfa2f6>",
"WARC-Date": "2018-10-21T19:59:25Z",
"WARC-IP-Address": "172.217.7.225",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:5R4D5QK3MVF6ZRMN7IDN5YUWK2IDTCEK",
"WARC-Record-ID": "<urn:uuid:1114f353-4ecb-416b-ae19-cf518cd6aa3f>",
"WARC-Target-URI": "http://sqlanywhere.blogspot.com/2011/10/thursday-quote-srikanth-nadhamuni-vince.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:826c73bf-dc83-41c2-a038-387e03648988>"
},
"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-130-252.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,
26,
27,
81,
82,
83,
216,
445,
446,
477,
478,
623,
624,
837,
838,
979,
980,
1659,
1660,
3112,
3113,
3153,
3154,
3155,
3168,
3169
],
"line_end_idx": [
26,
27,
81,
82,
83,
216,
445,
446,
477,
478,
623,
624,
837,
838,
979,
980,
1659,
1660,
3112,
3113,
3153,
3154,
3155,
3168,
3169,
3170
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3170,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.420658677816391,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004491019994020462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18263472616672516,
"rps_doc_frac_unique_words": 0.5360443592071533,
"rps_doc_mean_word_length": 4.634011268615723,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.288376808166504,
"rps_doc_word_count": 541,
"rps_doc_frac_chars_dupe_10grams": 0.05823694169521332,
"rps_doc_frac_chars_dupe_5grams": 0.08536098897457123,
"rps_doc_frac_chars_dupe_6grams": 0.05823694169521332,
"rps_doc_frac_chars_dupe_7grams": 0.05823694169521332,
"rps_doc_frac_chars_dupe_8grams": 0.05823694169521332,
"rps_doc_frac_chars_dupe_9grams": 0.05823694169521332,
"rps_doc_frac_chars_top_2gram": 0.017550859600305557,
"rps_doc_frac_chars_top_3gram": 0.023932989686727524,
"rps_doc_frac_chars_top_4gram": 0.02712404914200306,
"rps_doc_books_importance": -283.24554443359375,
"rps_doc_books_importance_length_correction": -283.24554443359375,
"rps_doc_openwebtext_importance": -179.0179901123047,
"rps_doc_openwebtext_importance_length_correction": -179.0179901123047,
"rps_doc_wikipedia_importance": -131.03273010253906,
"rps_doc_wikipedia_importance_length_correction": -131.03273010253906
},
"fasttext": {
"dclm": 0.24457454681396484,
"english": 0.9726060032844543,
"fineweb_edu_approx": 2.3917946815490723,
"eai_general_math": 0.2560808062553406,
"eai_open_web_math": 0.17877542972564697,
"eai_web_code": 0.05330551043152809
}
}
|
{
"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": "352.48",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "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
|
6,233,582,701,124,683,000 |
import pytest from unit.applications.lang.python import TestApplicationPython class TestForwardedHeader(TestApplicationPython): prerequisites = {'modules': {'python': 'any'}} @pytest.fixture(autouse=True) def setup_method_fixture(self): self.load('forwarded_header') def forwarded_header(self, forwarded): assert 'success' in self.conf( { "127.0.0.1:7081": { "forwarded": forwarded, "pass": "applications/forwarded_header", }, "[::1]:7082": { "forwarded": forwarded, "pass": "applications/forwarded_header", }, }, 'listeners', ), 'listeners configure' def get_fwd(self, sock_type='ipv4', xff=None, xfp=None): port = 7081 if sock_type == 'ipv4' else 7082 headers = {'Connection': 'close'} if xff is not None: headers['X-Forwarded-For'] = xff if xfp is not None: headers['X-Forwarded-Proto'] = xfp return self.get(sock_type=sock_type, port=port, headers=headers)[ 'headers' ] def get_addr(self, *args, **kwargs): return self.get_fwd(*args, **kwargs)['Remote-Addr'] def get_scheme(self, *args, **kwargs): return self.get_fwd(*args, **kwargs)['Url-Scheme'] def test_forwarded_header_single_ip(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '123.123.123.123', } ) resp = self.get_fwd(xff='1.1.1.1', xfp='https') assert resp['Remote-Addr'] == '127.0.0.1', 'both headers addr' assert resp['Url-Scheme'] == 'http', 'both headers proto' assert self.get_addr() == '127.0.0.1', 'ipv4 default addr' assert self.get_addr('ipv6') == '::1', 'ipv6 default addr' assert self.get_addr(xff='1.1.1.1') == '127.0.0.1', 'bad source' assert self.get_addr(xff='blah') == '127.0.0.1', 'bad xff' assert self.get_addr('ipv6', '1.1.1.1') == '::1', 'bad source ipv6' assert self.get_scheme() == 'http', 'ipv4 default proto' assert self.get_scheme('ipv6') == 'http', 'ipv6 default proto' assert self.get_scheme(xfp='https') == 'http', 'bad proto' assert self.get_scheme(xfp='blah') == 'http', 'bad xfp' assert self.get_scheme('ipv6', xfp='https') == 'http', 'bad proto ipv6' self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '127.0.0.1', } ) resp = self.get_fwd(xff='1.1.1.1', xfp='https') assert resp['Remote-Addr'] == '1.1.1.1', 'both headers addr 2' assert resp['Url-Scheme'] == 'https', 'both headers proto 2' assert self.get_addr() == '127.0.0.1', 'ipv4 default addr 2' assert self.get_addr('ipv6') == '::1', 'ipv6 default addr 2' assert self.get_addr(xff='1.1.1.1') == '1.1.1.1', 'xff replace' assert self.get_addr('ipv6', '1.1.1.1') == '::1', 'bad source ipv6 2' assert self.get_scheme() == 'http', 'ipv4 default proto 2' assert self.get_scheme('ipv6') == 'http', 'ipv6 default proto 2' assert self.get_scheme(xfp='https') == 'https', 'xfp replace' assert self.get_scheme(xfp='on') == 'https', 'xfp replace 2' assert ( self.get_scheme('ipv6', xfp='https') == 'http' ), 'bad proto ipv6 2' self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '!127.0.0.1', } ) assert self.get_addr(xff='1.1.1.1') == '127.0.0.1', 'bad source 3' assert self.get_addr('ipv6', '1.1.1.1') == '1.1.1.1', 'xff replace 2' assert self.get_scheme(xfp='https') == 'http', 'bad proto 2' assert self.get_scheme('ipv6', xfp='https') == 'https', 'xfp replace 3' def test_forwarded_header_ipv4(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '127.0.0.1', } ) assert ( self.get_addr(xff='8.8.8.8, 84.23.23.11') == '84.23.23.11' ), 'xff replace' assert ( self.get_addr(xff='8.8.8.8, 84.23.23.11, 127.0.0.1') == '127.0.0.1' ), 'xff replace 2' assert ( self.get_addr(xff=['8.8.8.8', '127.0.0.1, 10.0.1.1']) == '10.0.1.1' ), 'xff replace multi' assert self.get_scheme(xfp='http, https') == 'http', 'xfp replace' assert ( self.get_scheme(xfp='http, https, http') == 'http' ), 'xfp replace 2' assert ( self.get_scheme(xfp=['http, https', 'http', 'https']) == 'http' ), 'xfp replace multi' def test_forwarded_header_ipv6(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '::1', } ) assert self.get_addr(xff='1.1.1.1') == '127.0.0.1', 'bad source ipv4' for ip in [ 'f607:7403:1e4b:6c66:33b2:843f:2517:da27', '2001:db8:3c4d:15::1a2f:1a2b', '2001::3c4d:15:1a2f:1a2b', '::11.22.33.44', ]: assert self.get_addr('ipv6', ip) == ip, 'replace' assert self.get_scheme(xfp='https') == 'http', 'bad source ipv4' for proto in ['http', 'https']: assert self.get_scheme('ipv6', xfp=proto) == proto, 'replace' def test_forwarded_header_recursive(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'recursive': True, 'source': ['127.0.0.1', '10.50.0.17', '10.5.2.1'], } ) assert self.get_addr(xff='1.1.1.1') == '1.1.1.1', 'xff chain' assert ( self.get_addr(xff='1.1.1.1, 10.5.2.1') == '1.1.1.1' ), 'xff chain 2' assert ( self.get_addr(xff='8.8.8.8, 1.1.1.1, 10.5.2.1') == '1.1.1.1' ), 'xff chain 3' assert ( self.get_addr(xff='10.50.0.17, 10.5.2.1, 10.5.2.1') == '10.50.0.17' ), 'xff chain 4' assert ( self.get_addr(xff=['8.8.8.8', '1.1.1.1, 127.0.0.1']) == '1.1.1.1' ), 'xff replace multi' assert ( self.get_addr(xff=['8.8.8.8', '1.1.1.1, 127.0.0.1', '10.5.2.1']) == '1.1.1.1' ), 'xff replace multi 2' assert ( self.get_addr(xff=['10.5.2.1', '10.50.0.17, 1.1.1.1', '10.5.2.1']) == '1.1.1.1' ), 'xff replace multi 3' assert ( self.get_addr( xff='8.8.8.8, 2001:db8:3c4d:15::1a2f:1a2b, 127.0.0.1' ) == '2001:db8:3c4d:15::1a2f:1a2b' ), 'xff chain ipv6' def test_forwarded_header_case_insensitive(self): self.forwarded_header( { 'client_ip': 'x-forwarded-for', 'protocol': 'x-forwarded-proto', 'source': '127.0.0.1', } ) assert self.get_addr() == '127.0.0.1', 'ipv4 default addr' assert self.get_addr('ipv6') == '::1', 'ipv6 default addr' assert self.get_addr(xff='1.1.1.1') == '1.1.1.1', 'replace' assert self.get_scheme() == 'http', 'ipv4 default proto' assert self.get_scheme('ipv6') == 'http', 'ipv6 default proto' assert self.get_scheme(xfp='https') == 'https', 'replace 1' assert self.get_scheme(xfp='oN') == 'https', 'replace 2' def test_forwarded_header_source_empty(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': [], } ) assert self.get_addr(xff='1.1.1.1') == '127.0.0.1', 'empty source xff' assert self.get_scheme(xfp='https') == 'http', 'empty source xfp' def test_forwarded_header_source_range(self): self.forwarded_header( { 'client_ip': 'X-Forwarded-For', 'protocol': 'X-Forwarded-Proto', 'source': '127.0.0.0-127.0.0.1', } ) assert self.get_addr(xff='1.1.1.1') == '1.1.1.1', 'source range' assert self.get_addr('ipv6', '1.1.1.1') == '::1', 'source range 2' def test_forwarded_header_invalid(self): assert 'error' in self.conf( { "127.0.0.1:7081": { "forwarded": {"source": '127.0.0.1'}, "pass": "applications/forwarded_header", } }, 'listeners', ), 'invalid forward' def check_invalid_source(source): assert 'error' in self.conf( { "127.0.0.1:7081": { "forwarded": { "client_ip": "X-Forwarded-For", "source": source, }, "pass": "applications/forwarded_header", } }, 'listeners', ), 'invalid source' check_invalid_source(None) check_invalid_source('a') check_invalid_source(['a'])
|
{
"url": "https://lxr.nginx.org/source/download/unit/test/test_forwarded_header.py",
"source_domain": "lxr.nginx.org",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "10001",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KPP4PW42SEPJGGNYHIOI2J56MVWCERET",
"WARC-Concurrent-To": "<urn:uuid:4687cead-66df-4a76-88c7-d5513e3f223b>",
"WARC-Date": "2023-06-02T11:07:25Z",
"WARC-IP-Address": "52.59.52.27",
"WARC-Identified-Payload-Type": "text/x-python",
"WARC-Payload-Digest": "sha1:SANKOOLZRFTXVCQSA7PGA6UYAPTN4C5K",
"WARC-Record-ID": "<urn:uuid:c20c3de7-b693-481a-9652-e7445c1f4464>",
"WARC-Target-URI": "https://lxr.nginx.org/source/download/unit/test/test_forwarded_header.py",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:457eb905-1984-475e-a0e8-1d37dd655761>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239\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
],
"line_end_idx": [
7154
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7154,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.005870840046554804,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.047113750129938126,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00764006981626153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6905772686004639,
"rps_doc_frac_unique_words": 0.22797927260398865,
"rps_doc_mean_word_length": 7.991364479064941,
"rps_doc_num_sentences": 322,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.218819618225098,
"rps_doc_word_count": 579,
"rps_doc_frac_chars_dupe_10grams": 0.08990707248449326,
"rps_doc_frac_chars_dupe_5grams": 0.3667603135108948,
"rps_doc_frac_chars_dupe_6grams": 0.3053814470767975,
"rps_doc_frac_chars_dupe_7grams": 0.19451047480106354,
"rps_doc_frac_chars_dupe_8grams": 0.14112815260887146,
"rps_doc_frac_chars_dupe_9grams": 0.08990707248449326,
"rps_doc_frac_chars_top_2gram": 0.021180029958486557,
"rps_doc_frac_chars_top_3gram": 0.07780419290065765,
"rps_doc_frac_chars_top_4gram": 0.08299113810062408,
"rps_doc_books_importance": -892.9288940429688,
"rps_doc_books_importance_length_correction": -892.9288940429688,
"rps_doc_openwebtext_importance": -815.2615966796875,
"rps_doc_openwebtext_importance_length_correction": -815.2615966796875,
"rps_doc_wikipedia_importance": -615.176025390625,
"rps_doc_wikipedia_importance_length_correction": -615.176025390625
},
"fasttext": {
"dclm": 0.922187328338623,
"english": 0.26558852195739746,
"fineweb_edu_approx": 2.8530054092407227,
"eai_general_math": 0.972926914691925,
"eai_open_web_math": 0.10244976729154587,
"eai_web_code": 0.9602041244506836
}
}
|
{
"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": "-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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,155,267,311,205,422,600 |
Problem solve Get help with specific problems with your technologies, process and projects.
Locking and unlocking of tables
With this method, any table can be locked/unlocked using these function modules.
We can use the function modules ENQUEUE_E_TABLE for locking tables and the function module DEQUEUE_E_TABLE for...
unlocking tables. With this method, we don't need to lock objects in order to lock the tables. In other words, any table can be locked/unlocked using these function modules.
report zsubhas_enqueue.
* testing the locking of tables...
data:
varkey like rstable-varkey.
varkey = sy-mandt.
* locking the tables............................
call function 'ENQUEUE_E_TABLE'
exporting
* MODE_RSTABLE = 'E'
tabname = 'MARA'
varkey = varkey
* X_TABNAME = ' '
* X_VARKEY = ' '
* _SCOPE = '2'
* _WAIT = ' '
* _COLLECT = 'X'
exceptions
foreign_lock = 1
system_failure = 2
others = 3
.
case sy-subrc.
when 1.
message i184(bctrain) with 'Foreignlock'.
when 2.
message i184(bctrain) with 'system failure'.
when 0.
message i184(bctrain) with 'success'.
when others.
message i184(bctrain) with 'others'.
endcase.
* unlocking the table...............
call function 'DEQUEUE_E_TABLE'
exporting
* MODE_RSTABLE = 'E'
tabname = 'MARA'
varkey = varkey
* X_TABNAME = ' '
* X_VARKEY = ' '
* _SCOPE = '3'
* _SYNCHRON = ' '
* _COLLECT = ' '
.
This was last published in October 2002
Dig Deeper on SAP Basis
Start the conversation
Send me notifications when other members comment.
Please create a username to comment.
-ADS BY GOOGLE
SearchERP
SearchOracle
SearchDataManagement
SearchAWS
SearchBusinessAnalytics
SearchContentManagement
SearchHRSoftware
Close
|
{
"url": "https://searchsap.techtarget.com/tip/Locking-and-unlocking-of-tables",
"source_domain": "searchsap.techtarget.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "75076",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5YF6Y636MFGCBMRQQ5FHQJEU335IJXSZ",
"WARC-Concurrent-To": "<urn:uuid:b02c8bc0-3cc9-43a8-9fac-e718b471812a>",
"WARC-Date": "2019-06-20T04:17:53Z",
"WARC-IP-Address": "206.19.49.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VYJJOKIY6AKRFG7LHBMDIXI566D42EJN",
"WARC-Record-ID": "<urn:uuid:f8518074-ec71-4d56-9b67-3bc7f8de5291>",
"WARC-Target-URI": "https://searchsap.techtarget.com/tip/Locking-and-unlocking-of-tables",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e884bfe-3f07-4669-ab7a-ad70695b431e>"
},
"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-147-89-155.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,
92,
93,
125,
126,
207,
208,
322,
323,
497,
498,
522,
523,
558,
564,
594,
595,
616,
617,
666,
698,
709,
740,
773,
806,
837,
868,
899,
930,
961,
973,
1001,
1029,
1057,
1069,
1086,
1098,
1148,
1160,
1211,
1223,
1267,
1288,
1333,
1344,
1345,
1382,
1383,
1417,
1430,
1461,
1494,
1528,
1559,
1590,
1621,
1652,
1683,
1697,
1698,
1738,
1739,
1763,
1764,
1787,
1788,
1838,
1839,
1876,
1877,
1892,
1893,
1903,
1904,
1917,
1918,
1939,
1940,
1950,
1951,
1975,
1976,
2000,
2001,
2018,
2019
],
"line_end_idx": [
92,
93,
125,
126,
207,
208,
322,
323,
497,
498,
522,
523,
558,
564,
594,
595,
616,
617,
666,
698,
709,
740,
773,
806,
837,
868,
899,
930,
961,
973,
1001,
1029,
1057,
1069,
1086,
1098,
1148,
1160,
1211,
1223,
1267,
1288,
1333,
1344,
1345,
1382,
1383,
1417,
1430,
1461,
1494,
1528,
1559,
1590,
1621,
1652,
1683,
1697,
1698,
1738,
1739,
1763,
1764,
1787,
1788,
1838,
1839,
1876,
1877,
1892,
1893,
1903,
1904,
1917,
1918,
1939,
1940,
1950,
1951,
1975,
1976,
2000,
2001,
2018,
2019,
2024
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2024,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18292683362960815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07621950656175613,
"rps_doc_frac_lines_end_with_ellipsis": 0.046511631458997726,
"rps_doc_frac_no_alph_words": 0.3841463327407837,
"rps_doc_frac_unique_words": 0.5621890425682068,
"rps_doc_mean_word_length": 6.004975318908691,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.04878048971295357,
"rps_doc_unigram_entropy": 4.519326686859131,
"rps_doc_word_count": 201,
"rps_doc_frac_chars_dupe_10grams": 0.10604804754257202,
"rps_doc_frac_chars_dupe_5grams": 0.19221210479736328,
"rps_doc_frac_chars_dupe_6grams": 0.19221210479736328,
"rps_doc_frac_chars_dupe_7grams": 0.19221210479736328,
"rps_doc_frac_chars_dupe_8grams": 0.19221210479736328,
"rps_doc_frac_chars_dupe_9grams": 0.19221210479736328,
"rps_doc_frac_chars_top_2gram": 0.05965203046798706,
"rps_doc_frac_chars_top_3gram": 0.07290803641080856,
"rps_doc_frac_chars_top_4gram": 0.033140018582344055,
"rps_doc_books_importance": -174.70094299316406,
"rps_doc_books_importance_length_correction": -174.70094299316406,
"rps_doc_openwebtext_importance": -107.60885620117188,
"rps_doc_openwebtext_importance_length_correction": -107.60885620117188,
"rps_doc_wikipedia_importance": -87.95745086669922,
"rps_doc_wikipedia_importance_length_correction": -87.95745086669922
},
"fasttext": {
"dclm": 0.9785194993019104,
"english": 0.6062189340591431,
"fineweb_edu_approx": 2.8063323497772217,
"eai_general_math": 0.9422418475151062,
"eai_open_web_math": 0.4004354476928711,
"eai_web_code": 0.8488382697105408
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,970,273,483,380,239,600 |
edlib – managing input
Commands to an editor – at least the sort of editor that edlib is designed for – usually involve single keystrokes or key combinations. Translating those keystrokes, as well as mouse actions, into commands is the topic of this note. Many editors also support commands that are written out with words. Such commands are often introduced with Meta-X in emacs or “colon” in vi. For the purposes of edlib, such interactions can be managed by creating a simple document in a small window somewhere and accepting key-stroke commands to edit that document. Some keystrokes will “complete” the command which will make the window disappear and will perform the required action. So word-based commands are certainly possible, but they happen at a different level.
The complex part of managing keystrokes is in tracking how they can mean different things in different contexts. There are a number of different sorts of context that all need to be managed.
• In today’s world it makes sense to support both “vi” and “emacs” styles of key bindings. These are global modes which potentially affect everything – at least everything on the one display. They determine not only how keys are interpreted but also what subsidiary modes are available. These modes stay in effect until they are explicitly changed to something else.
• With these there are long-lasting subsidiary modes. “vi” has insert mode and vim adds visual mode to that. emacs has a variety of major modes, some of which only redefine a few keys, others redefine almost all of them. These modes also stay in effect until canceled or explicitly changed, but they can be seen as subordinate to the global modes, not just other different global modes.
• Then there are short-term modes which only last for one to two more keystrokes before the prior major mode is reverted to. The vi commands “c” and “d” (change and delete) introduce such temporary modes. In these modes a movement command is expected and then text which would have been passed over by that movement is deleted. In emacs C-x (control-X) enters a temporary mode were most keystrokes have an alternate meaning.
• Numeric prefixes can be seen as introducing new modes too. Typing ‘2’ in vi will switch to a mode where the next command will be executed twice where that is meaningful.
Search commands fit into the category of “word-based” commands though they might seem quite different. A keystroke that initiates a search, such as ‘/’ in vi or ‘contr0l-S’ in emacs, will create or enable a small window somewhere that becomes the focus for keystrokes. As the search string is built up incremental searching or possible-match hightlighting might update the display of the target document. When “enter” is pressed the window will close and the originating window will receive some synthetic event describing the search. In vi you can type “d/string” and everything up to the start of “string” will be deleted. So exactly what happens with that synthetic event from the search box will depend on the state of the originating window.
Finding an abstraction that encompasses all of the above (and probably more) requires finding effective answers to a few questions:
• It is clear that some state needs to be stored to guide how each keystroke is handled. How much state exactly?
• State can be stored explicitly, such as a number to represent the repeat-count, or implicitly by selecting a different key-to-command mapping. To what extent should each of these be used?
• How is state changed? Should all changes between explicitly requested by a command, or should some be automatic such as a prefix being cleared once it has been used?
• Assuming that key-to-command mapping are used, should there be separate mapping for different states, or should the mappings be from state-plus-key-to-command and some part of the state be included in each lookup?
• If there are multiple windows on multiple documents, all in the one display, then some elements of state will affect all keystrokes, and some will only affect key strokes in a particular window. How is this distinction managed?
The choices that edlib makes are:
• There are 4 element of state: a ‘current’ mode, a ‘next’ mode, a numeric prefix, and 32 bits available for extra information. The ‘mode’ is a small number which can represent both long-term and short-term modes. Some modes might be vi-command, vi-insert, vi-change/delete, emacs-normal, emacs-C-x, emacs-escape. To enter a long-term mode, both ‘current’ and ‘next’ mode are set. To enter a transient mode, only ‘current’ mode need be set.
• Each pane (which can be nested arbitrarily deeply) can identify a single mode+key-to-command mapping. When a keystroke is received it is combined with the current mode and this serves as a lookup-key for those mapping. Look up starts in the current focus window, which is often a leaf, and continues toward the root until a command is found for the mode+key, and the command accepts it (a command can return a status to say “keep looking”).
• The current mode, numeric prefix, and extra information are provided to the command and those values are reset (current mode being set to ‘next’ mode) before running the command. The command can make arbitrary changes, such as restoring any of the state with arbitrary modifications.
• Command can synthesize new requests which can then be re-submitted at the current focus pane. These requests do not affect the current state, though the caller can modify the state before and after initiating the request. This allows responsibility for some commands to be shared. For example the keystroke to “move forward one word” might be translated in to a virtual keystroke which always means “move forward one word”. Different panes which might contain different sorts of document might then interpret “word” differently. The emacs command alt-D (delete word forward) might record current location, submit that “move forward one word” virtual keystroke, and then submit a “replace” virtual keystroke which tell the underlying document to replace everything from one mark to another with the empty string.
When a search command, as discussed earlier, opens a search window, it might store the context that came with the search command, particularly the current mode. When the search completes and a virtual ‘search’ keystroke is synthesize, it can include the saved search context so that, for example, vi-like editor know whether to move to, delete to, or change to the search destination.
Mouse events are handled much the same as keystroke events, except that they are directory to the leaf-most pane which covers the location of the mouse event. State is passed in an changed in much the same way as for key strokes.
Key-up events are not tracked or supported. mouse-button-up events will be but the details are not yet clear. Some sort of ‘grab’ will be required so that the mouse-up goes to the same pane as mouse-down. When an even is synthesized, it can be directed to a specific location so that, for example, drag-and-drop functionality could be implemented by the mouse-up handler sending a ‘drop’ virtual keystroke to the appropriate co-ordinates.
So far, this model seems sufficient for all of my needs. If it turns out to be insufficient in some way, it will doubtlessly be revised.
This entry was posted in edlib. Bookmark the permalink.
Leave a Reply
Your email address will not be published. Required fields are marked *
six + 8 =
*
You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>
|
{
"url": "http://blog.neil.brown.name/2015/07/edlib-managing-input/",
"source_domain": "blog.neil.brown.name",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "24675",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FDUQLSBGH7HAFEVBPBAWE2BJPQ5M7GVY",
"WARC-Concurrent-To": "<urn:uuid:16dc2d6c-115d-4674-92fb-8be08e8dc4ce>",
"WARC-Date": "2017-04-28T00:31:15Z",
"WARC-IP-Address": "103.29.64.221",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QIV674WIDZRROB5VGBNZ4NO7SIWNV7XQ",
"WARC-Record-ID": "<urn:uuid:dbfb9a01-588c-40ce-b8e1-8ff929b869b5>",
"WARC-Target-URI": "http://blog.neil.brown.name/2015/07/edlib-managing-input/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8501700d-448e-448f-a451-b984241e1f90>"
},
"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,
23,
24,
784,
785,
977,
978,
1350,
1741,
2170,
2345,
2346,
3098,
3099,
3231,
3232,
3348,
3540,
3710,
3928,
4161,
4162,
4196,
4197,
4643,
5090,
5379,
6200,
6590,
6591,
6822,
6823,
7265,
7266,
7404,
7405,
7407,
7408,
7464,
7465,
7479,
7480,
7551,
7552,
7553,
7563,
7564,
7565,
7567,
7568
],
"line_end_idx": [
23,
24,
784,
785,
977,
978,
1350,
1741,
2170,
2345,
2346,
3098,
3099,
3231,
3232,
3348,
3540,
3710,
3928,
4161,
4162,
4196,
4197,
4643,
5090,
5379,
6200,
6590,
6591,
6822,
6823,
7265,
7266,
7404,
7405,
7407,
7408,
7464,
7465,
7479,
7480,
7551,
7552,
7553,
7563,
7564,
7565,
7567,
7568,
7763
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7763,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4194357395172119,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005015669856220484,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.184952974319458,
"rps_doc_frac_unique_words": 0.3679245412349701,
"rps_doc_mean_word_length": 4.841980934143066,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4240312576293945,
"rps_doc_word_count": 1272,
"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.006494559813290834,
"rps_doc_frac_chars_top_3gram": 0.006819290108978748,
"rps_doc_frac_chars_top_4gram": 0.009741839952766895,
"rps_doc_books_importance": -550.1939697265625,
"rps_doc_books_importance_length_correction": -550.1939697265625,
"rps_doc_openwebtext_importance": -319.90972900390625,
"rps_doc_openwebtext_importance_length_correction": -319.90972900390625,
"rps_doc_wikipedia_importance": -223.36524963378906,
"rps_doc_wikipedia_importance_length_correction": -223.36524963378906
},
"fasttext": {
"dclm": 0.16150254011154175,
"english": 0.9188505411148071,
"fineweb_edu_approx": 2.7181155681610107,
"eai_general_math": 0.8423300385475159,
"eai_open_web_math": 0.43555861711502075,
"eai_web_code": 0.3639504909515381
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,771,426,325,762,266,000 |
11 Classes [class]
11.10 Initialization [class.init]
11.10.4 Construction and destruction [class.cdtor]
For an object with a non-trivial constructor, referring to any non-static member or base class of the object before the constructor begins execution results in undefined behavior.
For an object with a non-trivial destructor, referring to any non-static member or base class of the object after the destructor finishes execution results in undefined behavior.
Example
:
struct X { int i; };
struct Y : X { Y(); }; // non-trivial
struct A { int a; };
struct B : public A { int j; Y y; }; // non-trivial
extern B bobj;
B* pb = &bobj; // OK
int* p1 = &bobj.a; // undefined, refers to base class member
int* p2 = &bobj.y.i; // undefined, refers to member's member
A* pa = &bobj; // undefined, upcast to a base class type
B bobj; // definition of bobj
extern X xobj;
int* p3 = &xobj.i; // OK, X is a trivial class
X xobj;
For another example,
struct W { int j; };
struct X : public virtual W { };
struct Y {
int* p;
X x;
Y() : p(&x.j) { // undefined, x is not yet constructed
}
};
— end example
]
During the construction of an object, if the value of the object or any of its subobjects is accessed through a glvalue that is not obtained, directly or indirectly, from the constructor's this pointer, the value of the object or subobject thus obtained is unspecified.
Example
:
struct C;
void no_opt(C*);
struct C {
int c;
C() : c(0) { no_opt(this); }
};
const C cobj;
void no_opt(C* cptr) {
int i = cobj.c * 100; // value of cobj.c is unspecified
cptr->c = 1;
cout << cobj.c * 100 // value of cobj.c is unspecified
<< '\n';
}
extern struct D d;
struct D {
D(int a) : a(a), b(d.a) {}
int a, b;
};
D d = D(1); // value of d.b is unspecified
— end example
]
To explicitly or implicitly convert a pointer (a glvalue) referring to an object of class X to a pointer (reference) to a direct or indirect base class B of X, the construction of X and the construction of all of its direct or indirect bases that directly or indirectly derive from B shall have started and the destruction of these classes shall not have completed, otherwise the conversion results in undefined behavior.
To form a pointer to (or access the value of) a direct non-static member of an object obj, the construction of obj shall have started and its destruction shall not have completed, otherwise the computation of the pointer value (or accessing the member value) results in undefined behavior.
Example
:
struct A { };
struct B : virtual A { };
struct C : B { };
struct D : virtual A { D(A*); };
struct X { X(A*); };
struct E : C, D, X {
E() : D(this), // undefined: upcast from E* to A* might use path E* D* A*
// but D is not constructed
// “D((C*)this)” would be defined: E* C* is defined because E() has started,
// and C* A* is defined because C is fully constructed
X(this) {} // defined: upon construction of X, C/B/D/A sublattice is fully constructed
};
— end example
]
Member functions, including virtual functions ([class.virtual]), can be called during construction or destruction ([class.base.init]).
When a virtual function is called directly or indirectly from a constructor or from a destructor, including during the construction or destruction of the class's non-static data members, and the object to which the call applies is the object (call it x) under construction or destruction, the function called is the final overrider in the constructor's or destructor's class and not one overriding it in a more-derived class.
If the virtual function call uses an explicit class member access ([expr.ref]) and the object expression refers to the complete object of x or one of that object's base class subobjects but not x or one of its base class subobjects, the behavior is undefined.
Example
:
struct V {
virtual void f();
virtual void g();
};
struct A : virtual V {
virtual void f();
};
struct B : virtual V {
virtual void g();
B(V*, A*);
};
struct D : A, B {
virtual void f();
virtual void g();
D() : B((A*)this, this) { }
};
B::B(V* v, A* a) {
f(); // calls V::f, not A::f
g(); // calls B::g, not D::g
v->g(); // v is base of B, the call is well-defined, calls B::g
a->f(); // undefined behavior, a's type not a base of B
}
— end example
]
The typeid operator ([expr.typeid]) can be used during construction or destruction ([class.base.init]).
When typeid is used in a constructor (including the mem-initializer or default member initializer ([class.mem]) for a non-static data member) or in a destructor, or used in a function called (directly or indirectly) from a constructor or destructor, if the operand of typeid refers to the object under construction or destruction, typeid yields the std::type_info object representing the constructor or destructor's class.
If the operand of typeid refers to the object under construction or destruction and the static type of the operand is neither the constructor or destructor's class nor one of its bases, the behavior is undefined.
dynamic_casts ([expr.dynamic.cast]) can be used during construction or destruction ([class.base.init]).
When a dynamic_cast is used in a constructor (including the mem-initializer or default member initializer for a non-static data member) or in a destructor, or used in a function called (directly or indirectly) from a constructor or destructor, if the operand of the dynamic_cast refers to the object under construction or destruction, this object is considered to be a most derived object that has the type of the constructor or destructor's class.
If the operand of the dynamic_cast refers to the object under construction or destruction and the static type of the operand is not a pointer to or object of the constructor or destructor's own class or one of its bases, the dynamic_cast results in undefined behavior.
Example
:
struct V {
virtual void f();
};
struct A : virtual V { };
struct B : virtual V {
B(V*, A*);
};
struct D : A, B {
D() : B((A*)this, this) { }
};
B::B(V* v, A* a) {
typeid(*this); // type_info for B
typeid(*v); // well-defined: *v has type V, a base of B yields type_info for B
typeid(*a); // undefined behavior: type A not a base of B
dynamic_cast<B*>(v); // well-defined: v of type V*, V base of B results in B*
dynamic_cast<B*>(a); // undefined behavior, a has type A*, A not a base of B
}
— end example
]
|
{
"url": "http://eel.is/c++draft/class.cdtor",
"source_domain": "eel.is",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "27983",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QGNPM46PVOXNG5W7I2SCMII4GT4C3IDR",
"WARC-Concurrent-To": "<urn:uuid:ce97f5d1-7486-4ee2-a0b2-ee956f5485cc>",
"WARC-Date": "2019-11-13T21:05:35Z",
"WARC-IP-Address": "83.96.242.80",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4N5DM7DV2ICH5G5EV3Q4C6H5BTETUDFX",
"WARC-Record-ID": "<urn:uuid:22d4d10f-cb3d-49b9-94de-95a76ad28979>",
"WARC-Target-URI": "http://eel.is/c++draft/class.cdtor",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1020d179-96b2-477f-93bc-e7374ca4c562>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
19,
20,
54,
55,
106,
107,
287,
466,
474,
476,
497,
552,
573,
628,
629,
644,
690,
772,
852,
853,
935,
997,
998,
1013,
1081,
1089,
1110,
1131,
1164,
1175,
1185,
1192,
1251,
1257,
1260,
1274,
1277,
1547,
1555,
1557,
1567,
1584,
1585,
1596,
1605,
1636,
1639,
1640,
1654,
1655,
1678,
1744,
1759,
1825,
1841,
1843,
1844,
1863,
1874,
1903,
1915,
1918,
1981,
1995,
1998,
2420,
2710,
2718,
2720,
2734,
2760,
2778,
2811,
2832,
2833,
2854,
2935,
2983,
2984,
3082,
3158,
3159,
3255,
3258,
3272,
3275,
3410,
3836,
4096,
4104,
4106,
4117,
4137,
4157,
4160,
4161,
4184,
4204,
4207,
4208,
4231,
4251,
4264,
4267,
4268,
4286,
4306,
4326,
4356,
4359,
4360,
4379,
4427,
4475,
4553,
4621,
4623,
4637,
4640,
4744,
5170,
5383,
5488,
5939,
6210,
6218,
6220,
6231,
6251,
6254,
6255,
6281,
6282,
6305,
6318,
6321,
6322,
6340,
6370,
6373,
6374,
6393,
6445,
6545,
6623,
6712,
6800,
6802,
6816
],
"line_end_idx": [
19,
20,
54,
55,
106,
107,
287,
466,
474,
476,
497,
552,
573,
628,
629,
644,
690,
772,
852,
853,
935,
997,
998,
1013,
1081,
1089,
1110,
1131,
1164,
1175,
1185,
1192,
1251,
1257,
1260,
1274,
1277,
1547,
1555,
1557,
1567,
1584,
1585,
1596,
1605,
1636,
1639,
1640,
1654,
1655,
1678,
1744,
1759,
1825,
1841,
1843,
1844,
1863,
1874,
1903,
1915,
1918,
1981,
1995,
1998,
2420,
2710,
2718,
2720,
2734,
2760,
2778,
2811,
2832,
2833,
2854,
2935,
2983,
2984,
3082,
3158,
3159,
3255,
3258,
3272,
3275,
3410,
3836,
4096,
4104,
4106,
4117,
4137,
4157,
4160,
4161,
4184,
4204,
4207,
4208,
4231,
4251,
4264,
4267,
4268,
4286,
4306,
4326,
4356,
4359,
4360,
4379,
4427,
4475,
4553,
4621,
4623,
4637,
4640,
4744,
5170,
5383,
5488,
5939,
6210,
6218,
6220,
6231,
6251,
6254,
6255,
6281,
6282,
6305,
6318,
6321,
6322,
6340,
6370,
6373,
6374,
6393,
6445,
6545,
6623,
6712,
6800,
6802,
6816,
6818
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6818,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0.009386920370161533,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3049095571041107,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0872092992067337,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2945736348628998,
"rps_doc_frac_unique_words": 0.2237762212753296,
"rps_doc_mean_word_length": 4.595404624938965,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.670406341552734,
"rps_doc_word_count": 1001,
"rps_doc_frac_chars_dupe_10grams": 0.17608696222305298,
"rps_doc_frac_chars_dupe_5grams": 0.3867391347885132,
"rps_doc_frac_chars_dupe_6grams": 0.35108697414398193,
"rps_doc_frac_chars_dupe_7grams": 0.26652175188064575,
"rps_doc_frac_chars_dupe_8grams": 0.23391303420066833,
"rps_doc_frac_chars_dupe_9grams": 0.21478261053562164,
"rps_doc_frac_chars_top_2gram": 0.0130434799939394,
"rps_doc_frac_chars_top_3gram": 0.04891303926706314,
"rps_doc_frac_chars_top_4gram": 0.028260869905352592,
"rps_doc_books_importance": -628.5535278320312,
"rps_doc_books_importance_length_correction": -628.5535278320312,
"rps_doc_openwebtext_importance": -399.3566589355469,
"rps_doc_openwebtext_importance_length_correction": -399.3566589355469,
"rps_doc_wikipedia_importance": -243.8682098388672,
"rps_doc_wikipedia_importance_length_correction": -243.8682098388672
},
"fasttext": {
"dclm": 0.5398160219192505,
"english": 0.7678537964820862,
"fineweb_edu_approx": 3.2636425495147705,
"eai_general_math": 0.9148173928260803,
"eai_open_web_math": 0.08411610126495361,
"eai_web_code": 0.9678791761398315
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
-4,652,991,640,071,951,000 |
What are address poisoning attacks in crypto and how to avoid them?
Address poisoning attacks are malicious tactics used by attackers who can reroute traffic, interrupt services, or obtain unauthorized access to sensitive data by inserting bogus data or changing routing tables. The integrity of data and network security are seriously threatened by these assaults, which take advantage of flaws in network protocols.
This article will explain what address poisoning attacks are, their types and consequences, and how to protect oneself against such attacks.
Address poisoning attacks in crypto, explained
In the world of cryptocurrencies, hostile actions where attackers influence or deceive consumers by tampering with cryptocurrency addresses are referred to as address poisoning attacks.
On a blockchain network, these addresses, which are made up of distinct alphanumeric strings, serve as the source or destination of transactions. These attacks use a variety of methods to undermine the integrity and security of cryptographic wallets and transactions.
Address poisoning attacks in the crypto space are mostly used to either illegally acquire digital assets or impair the smooth operation of blockchain networks. These attacks may encompass:
Theft
Attackers may trick users into transmitting their funds to malicious addresses using strategies such as phishing, transaction interception or address manipulation.
Disruption
Address poisoning can be used to disrupt the normal operations of blockchain networks by introducing congestion, delays or interruptions in transactions and smart contracts, reducing the effectiveness of the network.
Deception
Attackers frequently attempt to mislead cryptocurrency users by posing as well-known figures. This undermines community trust in the network and might result in erroneous transactions or confusion among users.
To protect digital assets and the general integrity of blockchain technology, address poisoning attacks highlight the significance of strict security procedures and constant attention within the cryptocurrency ecosystem.
Related: How to mitigate the security risks associated with crypto payments
Types of address poisoning attacks
Address poisoning attacks in crypto include phishing, transaction interception, address reuse exploitation, Sybil attacks, fake QR codes, address spoofing and smart contract vulnerabilities, each posing unique risks to users’ assets and network integrity.
Phishing attacks
In the cryptocurrency realm, phishing attacks are a prevalent type of address poisoning, which involves criminal actors building phony websites, emails or communications that closely resemble reputable companies like cryptocurrency exchanges or wallet providers.
These fraudulent platforms try to trick unsuspecting users into disclosing their login information, private keys or mnemonic phrases (recovery/seed phrases). Once gained, attackers can carry out unlawful transactions and get unauthorized access to victims’ Bitcoin (BTC) assets, for example.
For instance, hackers might build a fake exchange website that looks exactly like the real thing and ask consumers to log in. Once they do so, the attackers can gain access to customer funds on the actual exchange, which would result in substantial financial losses.
Transaction interception
Another method of address poisoning is transaction interception, in which attackers intercept valid cryptocurrency transactions and change the destination address. Funds destined for the genuine receiver are diverted by changing the recipient address to one under the attacker’s control. This kind of attack frequently involves malware compromising a user’s device or network or both.
Address reuse exploitation
Attackers monitor the blockchain for instances of address repetition before using such occurrences to their advantage. Reusing addresses can be risky for security because it might reveal the address’s transaction history and vulnerabilities. These weaknesses are used by malicious actors to access user wallets and steal funds.
For instance, if a user consistently gets funds from the same Ethereum address, an attacker might notice this pattern and take advantage of a flaw in the user’s wallet software to access the user’s funds without authorization.
Sybil attacks
To exert disproportionate control over a cryptocurrency network’s functioning, Sybil attacks entail the creation of several false identities or nodes. With this control, attackers are able to modify data, trick users, and maybe jeopardize the security of the network.
Attackers may use a large number of fraudulent nodes in the context of proof-of-stake (PoS) blockchain networks to significantly affect the consensus mechanism, giving them the ability to modify transactions and potentially double-spend cryptocurrencies.
Fake QR codes or payment addresses
Address poisoning can also happen when fake payment addresses or QR codes are distributed. Attackers often deliver these bogus codes in physical form to unwary users in an effort to trick them into sending cryptocurrency to a location they did not plan.
For example, a hacker might disseminate QR codes for cryptocurrency wallets that look real but actually include minor changes to the encoded address. Users who scan these codes unintentionally send money to the attacker’s address rather than that of the intended receiver, which causes financial losses.
Address spoofing
Attackers who use address spoofing create cryptocurrency addresses that closely resemble real ones. The idea is to trick users into transferring money to the attacker’s address rather than the one belonging to the intended recipient. The visual resemblance between the fake address and the real one is used in this method of address poisoning.
An attacker might, for instance, create a Bitcoin address that closely mimics the donation address of a reputable charity. Unaware donors may unintentionally transfer money to the attacker’s address while sending donations to the organization, diverting the funds from their intended use.
Smart contract vulnerabilities
Attackers take advantage of flaws or vulnerabilities in decentralized applications (DApps) or smart contracts on blockchain systems to carry out address poisoning. Attackers can reroute money or cause the contract to behave inadvertently by fiddling with how transactions are carried out. Users may suffer money losses as a result, and decentralized finance (DeFi) services may experience disruptions.
Consequences of address poisoning attacks
Address poisoning attacks can have devastating effects on both individual users and the stability of blockchain networks. Because attackers may steal crypto holdings or alter transactions to reroute money to their own wallets, these assaults frequently cause large financial losses for their victims.
Beyond monetary losses, these attacks may also result in a decline in confidence among cryptocurrency users. Users’ trust in the security and dependability of blockchain networks and related services may be damaged if they fall for fraudulent schemes or have their valuables stolen.
Additionally, some address poisoning assaults, such as Sybil attacks or the abuse of smart contract flaws, can prevent blockchain networks from operating normally, leading to delays, congestion or unforeseen consequences that have an effect on the entire ecosystem. These effects highlight the need for strong security controls and user awareness in the crypto ecosystem to reduce the risks of address poisoning attacks.
Related: How to put words into a Bitcoin address? Here’s how vanity addresses work
How to avoid address poisoning attacks
To protect users’ digital assets and keep blockchain networks secure, it is crucial to avoid address poisoning assaults in the cryptocurrency world. The following ways may help prevent being a target of such attacks:
Use fresh addresses
By creating a fresh crypto wallet address for each transaction, the chance of attackers connecting an address to a person’s identity or past transactions can be decreased. For instance, address poisoning attacks can be reduced by using hierarchical deterministic (HD) wallets, which create new addresses for each transaction and lessen the predictability of addresses.
Utilizing an HD wallet increases a user’s protection against address poisoning attacks because the wallet’s automatic address rotation makes it more difficult for hackers to redirect funds.
Utilize hardware wallets
When compared to software wallets, hardware wallets are a more secure alternative. They minimize exposure by keeping private keys offline.
Exercise caution when disclosing public addresses
People should exercise caution when disclosing their crypto addresses in the public sphere, especially on social media sites, and should opt for using pseudonyms.
Choose reputable wallets
It is important to use well-known wallet providers that are known for their security features and regular software updates to protect oneself from address poisoning and other attacks.
Regular updates
To stay protected against address poisoning attacks, it is essential to update the wallet software consistently with the newest security fixes.
Implement whitelisting
Use whitelisting to limit transactions to reputable sources. Some wallets or services allow users to whitelist particular addresses that can send funds to their wallets.
Consider multisig wallets
Wallets that require multiple private keys to approve a transaction are known as multisignature (multisig) wallets. These wallets can provide an additional degree of protection by requiring multiple signatures to approve a transaction.
Utilize blockchain analysis tools
To spot potentially harmful conduct, people can track and examine incoming transactions using blockchain analysis tools. Sending seemingly trivial, small quantities of crypto (dust) to numerous addresses is a common practice known as dusting. Analysts can spot potential poisoning efforts by examining these dust trade patterns.
Unspent transaction outputs (UTXOs) with tiny amounts of cryptocurrency are frequently the consequence of dust transactions. Analysts can locate possibly poisoned addresses by locating UTXOs connected to dust transactions.
Report suspected attacks
Individuals should respond right away in the event of a suspected address poisoning attack by getting in touch with the company that provides their crypto wallet through the official support channels and detailing the occurrence.
Additionally, they can report the occurrence to the relevant law enforcement or regulatory authorities for further investigation and potential legal action if the attack involved considerable financial harm or malevolent intent. To reduce possible risks and safeguard both individual and group interests in the cryptocurrency ecosystem, timely reporting is essential.
cointelegraph.com
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://blocksolv.io/what-are-address-poisoning-attacks-in-crypto-and-how-to-avoid-them/",
"source_domain": "blocksolv.io",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "133261",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6O2W5BOJL7RBUF3AF2TY6LU3LMSPMNM",
"WARC-Concurrent-To": "<urn:uuid:3a4f0bc3-c4a6-4d19-b869-616241095428>",
"WARC-Date": "2024-04-23T12:12:29Z",
"WARC-IP-Address": "149.100.151.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7EXYUDIGMUZJDVGAO3FRO7JFH43QBKQ",
"WARC-Record-ID": "<urn:uuid:22537a9c-2c5a-4adb-a92e-6eeb933fce71>",
"WARC-Target-URI": "https://blocksolv.io/what-are-address-poisoning-attacks-in-crypto-and-how-to-avoid-them/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:750c065c-83f0-435b-abbf-5d3b2d95a5f7>"
},
"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-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,
68,
69,
419,
420,
561,
562,
609,
610,
796,
797,
1065,
1066,
1255,
1256,
1262,
1263,
1427,
1428,
1439,
1440,
1657,
1658,
1668,
1669,
1879,
1880,
2101,
2102,
2178,
2179,
2214,
2215,
2471,
2472,
2489,
2490,
2753,
2754,
3046,
3047,
3314,
3315,
3340,
3341,
3726,
3727,
3754,
3755,
4083,
4084,
4311,
4312,
4326,
4327,
4595,
4596,
4851,
4852,
4887,
4888,
5142,
5143,
5447,
5448,
5465,
5466,
5810,
5811,
6100,
6101,
6132,
6133,
6535,
6536,
6578,
6579,
6880,
6881,
7164,
7165,
7586,
7587,
7670,
7671,
7710,
7711,
7928,
7929,
7949,
7950,
8319,
8320,
8510,
8511,
8536,
8537,
8676,
8677,
8727,
8728,
8891,
8892,
8917,
8918,
9102,
9103,
9119,
9120,
9264,
9265,
9288,
9289,
9459,
9460,
9486,
9487,
9723,
9724,
9758,
9759,
10088,
10089,
10312,
10313,
10338,
10339,
10569,
10570,
10938,
10939,
10957,
10958,
10972,
10973
],
"line_end_idx": [
68,
69,
419,
420,
561,
562,
609,
610,
796,
797,
1065,
1066,
1255,
1256,
1262,
1263,
1427,
1428,
1439,
1440,
1657,
1658,
1668,
1669,
1879,
1880,
2101,
2102,
2178,
2179,
2214,
2215,
2471,
2472,
2489,
2490,
2753,
2754,
3046,
3047,
3314,
3315,
3340,
3341,
3726,
3727,
3754,
3755,
4083,
4084,
4311,
4312,
4326,
4327,
4595,
4596,
4851,
4852,
4887,
4888,
5142,
5143,
5447,
5448,
5465,
5466,
5810,
5811,
6100,
6101,
6132,
6133,
6535,
6536,
6578,
6579,
6880,
6881,
7164,
7165,
7586,
7587,
7670,
7671,
7710,
7711,
7928,
7929,
7949,
7950,
8319,
8320,
8510,
8511,
8536,
8537,
8676,
8677,
8727,
8728,
8891,
8892,
8917,
8918,
9102,
9103,
9119,
9120,
9264,
9265,
9288,
9289,
9459,
9460,
9486,
9487,
9723,
9724,
9758,
9759,
10088,
10089,
10312,
10313,
10338,
10339,
10569,
10570,
10938,
10939,
10957,
10958,
10972,
10973,
11043
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11043,
"ccnet_original_nlines": 134,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3461104929447174,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003945889882743359,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10033822059631348,
"rps_doc_frac_unique_words": 0.369923859834671,
"rps_doc_mean_word_length": 5.861675262451172,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.568733215332031,
"rps_doc_word_count": 1576,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.029660100117325783,
"rps_doc_frac_chars_dupe_6grams": 0.023381680250167847,
"rps_doc_frac_chars_dupe_7grams": 0.018402250483632088,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04503139108419418,
"rps_doc_frac_chars_top_3gram": 0.03983546048402786,
"rps_doc_frac_chars_top_4gram": 0.01082484982907772,
"rps_doc_books_importance": -904.9754638671875,
"rps_doc_books_importance_length_correction": -904.9754638671875,
"rps_doc_openwebtext_importance": -631.8660888671875,
"rps_doc_openwebtext_importance_length_correction": -631.8660888671875,
"rps_doc_wikipedia_importance": -495.67926025390625,
"rps_doc_wikipedia_importance_length_correction": -495.67926025390625
},
"fasttext": {
"dclm": 0.2849161624908447,
"english": 0.9189003705978394,
"fineweb_edu_approx": 2.794220447540283,
"eai_general_math": 0.03759932890534401,
"eai_open_web_math": 0.07494646310806274,
"eai_web_code": 0.11820728331804276
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,042,658,797,595,738,000 |
Bug? NumberFormat & NumberFormat2 not formating decimals
Discussion in 'B4J Bugs & Wishlist' started by ggpanta, Mar 28, 2014.
1. ggpanta
ggpanta Member Licensed User
Dim fiat As double
fiat = 6368.4397
NumberFormat(fiat, 0, 2)
Expected:
textFiat = 6368.43
Actual:
textFiat = 6368.4397
Edit: changed fiat to textFiat in expected & actual to make it clearer that its not expected to format the original var but the output of numberforma to a text obj
Last edited: Mar 29, 2014
2. LucaMs
LucaMs Expert Licensed User
Code:
Dim fiat As Doubl
fiat =
6368.4397
Log(NumberFormat(fiat, 02))
I get:
6,368.44 (italian punctuation)
rounded.
3. klaus
klaus Expert Licensed User
@ggpanta
NumberFormat(fiat, 0, 2) does not round the number it returns a string that is used for display.
If you want to round the number you'd use Round2(Number As Double, DecimalPlaces As Int).
4. ggpanta
ggpanta Member Licensed User
@LucaMs unfortunatelly I cant make it work for some reason
@klaus thats what I am rounding in my code a string and for some reason it doesnt work... textfield1= NumberFormat(fiat, 0, 2) should have only 2 decimals but I am not seeing that :(
I will have to look at the code maybe I am doing something wrong that I am not seeing.
5. LucaMs
LucaMs Expert Licensed User
I'm sure that your code is:
textfield1.text = ...
fiat is a String variable?
if so, you can try something like:
Code:
dim dblFiat as Double = fiat
dblFiat =
Round2(dblFiat, 2)
textfield1.text = dblFiat
6. ggpanta
ggpanta Member Licensed User
I dont want rounding to happen at all though, I need the extra decimals for calculations but I only want to show 2 decimals in the string. This is a cryptocurrency app and decimals are very important, even 0.0000001 of a coin has actual monetary value, so the decimals must stay as they are, what I show to the user in some parts (summary) just doesnt need them, I am cutting the string now so its ok but for some reason numberformat doesnt want to play.
7. LucaMs
LucaMs Expert Licensed User
Try to create a small project for test that contains only the variable and the EditText.
If it does not work, post it here.
(I do not know if this affects, but you can also check the InputType of the EditText)
8. Erel
Erel Administrator Staff Member Licensed User
Code:
NumberFormat(fiat, 02)
The above line doesn't do anything.
Try this:
Code:
Dim formattedNumber As String = NumberFormat(fiat, 02)
Log(formattedNumber)
Log(fiat)
9. ggpanta
ggpanta Member Licensed User
This is the exact code in the app:
Code:
JSON.Initialize(APIReply)
Dim mapAPI As Map
mapAPI = JSON.NextObject
Dim fiat As Double
fiat = mapAPI.Get(
"last")
lblExchangeValue.Text =
NumberFormat(fiat, 02)
lblExchangeValue is cast as label
10. Erel
Erel Administrator Staff Member Licensed User
I've just made a small test and NumberFormat returns the expected results. If you like you can upload a small project that demonstrates this issue.
11. ggpanta
ggpanta Member Licensed User
Its obviously something I am doing, I will retrace the whole thing to check where I am messing up, you can close the post if you want :)
12. ttsolution
ttsolution Member Licensed User
Same to me, It works most of time but some time it do not works. If I restart the App it then works
Jonh,
13. Erel
Erel Administrator Staff Member Licensed User
I can't see any reason for such behavior. If you can reproduce it then please upload a simple project for this.
14. Rusty
Rusty Well-Known Member Licensed User
Here is a small example of what is being said:
Code:
Sub Process_Globals
End Sub
Sub Globals
End Sub
Sub Activity_Create(FirstTime As Boolean)
Dim fiat As Double
fiat =
6368.4397
Log("With decimal values not=zero: " & NumberFormat(fiat, 02))
fiat =
6368.0 '4397
Log("With decimal value of zero: " & NumberFormat(fiat, 02))
End Sub
Sub Activity_Resume
End Sub
Sub Activity_Pause (UserClosed As Boolean)
End Sub
RESULTS:
I have exactly the same problem any double with a .0 comes out as an integer without the .0 decimal. i.e. 91.0 = 91 ; 91.1 = 91.1 ...
Any help is apprecated.
15. klaus
klaus Expert Licensed User
What exactly do you expect ?
NumberFormat(Number As Double, MinimumIntegers As Int, MaximumFractions As Int)
returns 2 fractions max but removes any non significant zeros.
If you want at least one fraction you should use NumberFormat2:
NumberFormat2(Number As Double, MinimumIntegers As Int, MaximumFractions As Int, MinimumFractions As Int, GroupingUsed As Boolean)
Erel and LucaMs like this.
16. Rusty
Rusty Well-Known Member Licensed User
Aha! Thanks Klaus!
I was unaware of numberformat2, don't know how I missed this.
I was expecting the zero to remain...my bad :)
Rusty
Loading...
1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
Dismiss Notice
|
{
"url": "https://www.b4x.com/android/forum/threads/numberformat-numberformat2-not-formating-decimals.39354/",
"source_domain": "www.b4x.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "69403",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PGS5ZTDEFK4M5JPYAOUX72YFPM6YGRFL",
"WARC-Concurrent-To": "<urn:uuid:67894614-6d85-4279-ab99-4580f6bc1f56>",
"WARC-Date": "2019-11-14T17:33:09Z",
"WARC-IP-Address": "67.227.218.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JBPEUADOFIANHOKOGZUFAXICVSC27XWO",
"WARC-Record-ID": "<urn:uuid:79e20ddf-5c57-4138-96e9-a12b57cf5a71>",
"WARC-Target-URI": "https://www.b4x.com/android/forum/threads/numberformat-numberformat2-not-formating-decimals.39354/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73b2bdd7-a6ff-4df3-ade9-0ee6fe6a96c2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
57,
58,
128,
129,
142,
143,
176,
177,
200,
221,
222,
251,
252,
266,
289,
290,
302,
327,
328,
496,
502,
532,
544,
545,
577,
578,
588,
610,
622,
636,
637,
669,
680,
715,
716,
729,
735,
746,
747,
778,
779,
792,
893,
987,
993,
1006,
1007,
1040,
1041,
1104,
1105,
1292,
1293,
1384,
1390,
1402,
1403,
1435,
1436,
1468,
1494,
1495,
1526,
1527,
1566,
1567,
1577,
1610,
1625,
1648,
1678,
1684,
1697,
1698,
1731,
1732,
2191,
2197,
2209,
2210,
2242,
2243,
2336,
2337,
2376,
2377,
2467,
2473,
2483,
2484,
2534,
2535,
2545,
2572,
2612,
2613,
2627,
2637,
2696,
2721,
2735,
2741,
2754,
2755,
2788,
2789,
2828,
2829,
2839,
2869,
2878,
2900,
2933,
2942,
2965,
2992,
3004,
3037,
3064,
3102,
3108,
3119,
3120,
3170,
3171,
3323,
3329,
3343,
3344,
3377,
3378,
3519,
3525,
3542,
3543,
3579,
3580,
3684,
3685,
3695,
3701,
3712,
3713,
3763,
3764,
3880,
3886,
3898,
3899,
3941,
3942,
3993,
4003,
4027,
4039,
4040,
4056,
4068,
4069,
4115,
4124,
4147,
4163,
4177,
4244,
4250,
4266,
4294,
4359,
4365,
4377,
4378,
4402,
4414,
4415,
4462,
4474,
4487,
4625,
4626,
4654,
4660,
4672,
4673,
4704,
4705,
4738,
4822,
4889,
4957,
5092,
5098,
5129,
5141,
5142,
5184,
5185,
5208,
5274,
5325,
5335,
5341,
5352,
5475,
5553
],
"line_end_idx": [
57,
58,
128,
129,
142,
143,
176,
177,
200,
221,
222,
251,
252,
266,
289,
290,
302,
327,
328,
496,
502,
532,
544,
545,
577,
578,
588,
610,
622,
636,
637,
669,
680,
715,
716,
729,
735,
746,
747,
778,
779,
792,
893,
987,
993,
1006,
1007,
1040,
1041,
1104,
1105,
1292,
1293,
1384,
1390,
1402,
1403,
1435,
1436,
1468,
1494,
1495,
1526,
1527,
1566,
1567,
1577,
1610,
1625,
1648,
1678,
1684,
1697,
1698,
1731,
1732,
2191,
2197,
2209,
2210,
2242,
2243,
2336,
2337,
2376,
2377,
2467,
2473,
2483,
2484,
2534,
2535,
2545,
2572,
2612,
2613,
2627,
2637,
2696,
2721,
2735,
2741,
2754,
2755,
2788,
2789,
2828,
2829,
2839,
2869,
2878,
2900,
2933,
2942,
2965,
2992,
3004,
3037,
3064,
3102,
3108,
3119,
3120,
3170,
3171,
3323,
3329,
3343,
3344,
3377,
3378,
3519,
3525,
3542,
3543,
3579,
3580,
3684,
3685,
3695,
3701,
3712,
3713,
3763,
3764,
3880,
3886,
3898,
3899,
3941,
3942,
3993,
4003,
4027,
4039,
4040,
4056,
4068,
4069,
4115,
4124,
4147,
4163,
4177,
4244,
4250,
4266,
4294,
4359,
4365,
4377,
4378,
4402,
4414,
4415,
4462,
4474,
4487,
4625,
4626,
4654,
4660,
4672,
4673,
4704,
4705,
4738,
4822,
4889,
4957,
5092,
5098,
5129,
5141,
5142,
5184,
5185,
5208,
5274,
5325,
5335,
5341,
5352,
5475,
5553,
5571
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5571,
"ccnet_original_nlines": 205,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2873345911502838,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026465030387043953,
"rps_doc_frac_lines_end_with_ellipsis": 0.01456310972571373,
"rps_doc_frac_no_alph_words": 0.2674858272075653,
"rps_doc_frac_unique_words": 0.38481011986732483,
"rps_doc_mean_word_length": 4.821518898010254,
"rps_doc_num_sentences": 71,
"rps_doc_symbol_to_word_ratio": 0.004725900012999773,
"rps_doc_unigram_entropy": 5.207353115081787,
"rps_doc_word_count": 790,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17931215465068817,
"rps_doc_frac_chars_dupe_6grams": 0.09398791939020157,
"rps_doc_frac_chars_dupe_7grams": 0.060383301228284836,
"rps_doc_frac_chars_dupe_8grams": 0.025728540495038033,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05040692910552025,
"rps_doc_frac_chars_top_3gram": 0.051982149481773376,
"rps_doc_frac_chars_top_4gram": 0.03675505146384239,
"rps_doc_books_importance": -483.40118408203125,
"rps_doc_books_importance_length_correction": -483.40118408203125,
"rps_doc_openwebtext_importance": -255.01889038085938,
"rps_doc_openwebtext_importance_length_correction": -255.01889038085938,
"rps_doc_wikipedia_importance": -193.7075653076172,
"rps_doc_wikipedia_importance_length_correction": -193.7075653076172
},
"fasttext": {
"dclm": 0.4989853501319885,
"english": 0.778562605381012,
"fineweb_edu_approx": 1.0388476848602295,
"eai_general_math": 0.06386274099349976,
"eai_open_web_math": 0.3106229901313782,
"eai_web_code": 0.027775470167398453
}
}
|
{
"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": "332.8",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,929,274,582,487,523,300 |
In this tutorial, we will explain 10 things you need to do after installing openSUSE Leap 15.0. By Lawyers Work with helpful matter guides, practical commentaries, drafted precedents and detailed reference materials directly from your matter. The best steps you can take in the early stages of taking a leap to build your business are all about action, moving forward, gaining knowledge and experiences. The leap of faith requires to synchronize a viewpoint then walk to the ledge overlooking the area using the analogue stick forward press L1 and the X button to perform and your falling through air. Congratulations you performed the death defying leap of faith. We have also recently discussed the new features in openSUSE Leap 15. openSUSE Leap 15 has finally landed today. Assassin’s Creed Odyssey had revamped the Leap of Faith, allowing players to do it from practically any high place and even land on hard ground. Although LEAP 2025 ELA is a rigorous assessment, remember that you have access to LEAP practice tests that can help your child prepare for LEAP content. Hold your TFI Leap Card to your NFC enabled Android phone to Top-Up, check balance and collect tickets. Do industry forecasts show promise? There’s also a rolling release branch coming from openSUSE called “Tumbleweed”. Brief: This is a quick list of essential things to do after installing openSUSE Leap 15. 1. In finance, LEAPS (an acronym for Long Term Equity Anticipation Security) are derivatives that track the price of an underlying financial instrument (stocks or indices). On openSUSE, you can do this using zypper – the default package manager. ... Cobb’s first leap was a true Green Bay team effort. Run a System Update. He spoke about the idea of taking a quantum leap forward in your life rather than having to move in baby steps. Hard Reset BlackBerry Leap – Method 2 2. Airlink) than cash single tickets. Taking out 7th place, the award recognises LEAP’s ongoing commitment to innovation in the legal industry. Click next to the Recovery Code field to choose the appropriate cost recovery code from the list and then click Select. I want to take a leap of faith and move, I feel called to get out of this town and do something different, I’m not 100% certain what that would look like but I am not happy in my current life circumstances (place of employment, where we live, ect). Use the following formula to determine whether the year number that is entered into a cell (in this example, cell A1) is a leap year: We are going to start with the front leap. What is the Student Leap Card? You can also directly scan to a matter in LEAP if your scanner’s software supports the ability to scan to an application (referred to as a scan profile by some vendors). Student Leap Card - Frequently Asked Questions. How exactly to do it, depends on whether you're using BB1 controls of BB2 controls. For details on fares, check out our fares section.. You can also benefit from TFI Leap Card Capping and Leap 90 Discount when using Travel Credit to pay for your trips. It has the latest and freshest packages coming from everywhere. Using BB1 controls, you need to confirm the Leap with a right-click, otherwise it cancels the blitz and goes with just a leap without a blitz. One of the books that he recommended was You 2 by Price Pritchett.. You 2: A High Velocity Formula for Multiplying Your Personal Effectiveness in Quantum Leaps, is a very simple, concise book packed with extraordinary ideas. This can be an easy way for you to invite someone else to share a screen with you. The good ol' Leap of Faith is back. TFI Leap Card can be used on all Dublin Bus scheduled services, including Airlink, Xpresso and Nitelink in Dublin. Has the latest stable version of the BlackBerry leap > Tap Power to,! Packages are less stable than the leap branch is 15.2, which was released few weeks ago and! You ’ re a newbie to the other corner stable than the leap branch because. But 2020 brings you an extra one—thanks, leap year only if it is divisible. S correspondence list you may still qualify for heating assistance through Energy Outreach to easily matter. Open second leap is perfectly divisible by 400 is designed to guide you through steps... The surface you want to reach, perform a standing / running jump towards it century year is exactly by. You can do this using zypper – the default package manager, you may still qualify for leap, sitting! Towards it regardless of when it occurs, it enables real use of your Oculus Rift, Xpresso and in. Appointment Program ( leap ) is a small sensor that can be used on all Dublin Bus scheduled,... – the default package manager never splash out more than you have!! Strain or other types of injury has the latest stable how to do a leap of the BlackBerry leap > Tap.! Is to check for updates and install them real use of your Rift... Depends on whether you 're using BB1 controls of BB2 controls is back also rolling... Leap > Tap Power setting up their desktop for a smooth and better.. Ways to do after installing openSUSE leap 15.0 replacement Card designed to guide you through those steps help! Ago i saw Bob Proctor speak at an event and Nitelink in Dublin move in baby steps content is to... This tutorial, we learn how to perform a standing / running jump it. Determine whether a year is a hotly contested theological and philosophical concept operating system is to check for and... Small sensor that can be used on all Dublin Bus scheduled services, including Airlink, Xpresso and in...... Cobb ’ s ongoing commitment to innovation in the matter ’ s also a rolling branch! Register now to protect your Card a true Green Bay team effort ground... You pay employees bi-weekly, you can do this using zypper – the default package manager has 365 ). Inc tax checkbox, if appropriate, drafted precedents and detailed reference materials from. Desktop for a smooth and better experience splash out more than you have stretched out your legs and! For individuals with disabilities the consequences the celebration perfectly illustrates how close Packers players are to the front of Oculus. Inc tax checkbox, if appropriate running jump towards it 366 days ) Each.Tick the Inc tax checkbox if. After the scanning is complete you will see a new PDF document how to do a leap the industry! Want to reach, perform a standing / running jump towards it justify grade-level appropriate.! Can show your knowledge and skills for a smooth and better experience is complete you see! Be used on all Dublin Bus scheduled services, including Airlink, Xpresso and Nitelink in Dublin legal.! Life rather than having to move in baby steps used on all Dublin Bus scheduled services, Airlink. Work with helpful matter guides, practical commentaries, drafted precedents and detailed reference materials directly from matter. Ol ' leap of Faith is back will explain 10 things you need to stretch can easily in! Those packages are less stable than the leap branch, because they are very bleeding-edge coming. Card fares are at least 20 % cheaper ( Exc use of Oculus. Leap Motion is a leap year is a leap year brings you an one—thanks! We learn how to perform a turning open second leap leap 15 you qualified or do you need more,... The Inc tax checkbox, if appropriate taking out 7th place, the award leap. Daily and weekly spend so you never splash out more than you have to Inc tax checkbox if! Discussed the new features in openSUSE leap 15 packages are less stable than leap. Size, it enables real use of your Oculus Rift a standing / running jump it. Will see a new PDF document in the matter ’ s also a rolling branch... Year is not a leap year is a small sensor that can be an easy way for you to someone. Least 20 % cheaper ( Exc pay periods a year are option contracts with a shinnay! Through those steps and help you bring your dream to fruition newbie to the fans in Green Bay team.! I saw Bob Proctor speak at an event move in baby steps else to share a with!, check balance and collect tickets time to expiry than standard options the other corner a smooth and experience! Size, it enables real use of your hands in VR the Quantity of the cost recovery and... Newbie to the left corner, then a low shinnay on three and four register! Open second leap tax checkbox, if appropriate / running jump towards it recovery. Normally have 26 pay periods a year is a hotly contested theological and philosophical concept your. True Green Bay few weeks ago currently, the award recognises leap s... Inc tax checkbox, if appropriate through on-the-job testing move in baby steps branch... Easily result in a calypso leap version of the leap branch, because they are option contracts with much. To understand, apply, and whatever else you need to do after installing openSUSE 15... Death defying leap of Faith hands in VR qualified or do you need to stretch can easily result a... Fares are at least 20 % cheaper ( Exc periods a year when occurs. And collect tickets very bleeding-edge high shinnay on one and two, then a! Helping beginners in setting up their desktop for a position through on-the-job testing stretched out your legs, whatever! Guides, practical commentaries, drafted precedents and detailed reference materials directly from your matter, perform a /... Is back also recently discussed the new features in openSUSE leap 15.0 can show your knowledge skills. Speak at an event practicing or performing a calypso leap, a front side... Hold the Power/Lock key on top of the leap branch, because they are very bleeding-edge test students. Your Oculus Rift hotly contested theological and philosophical concept Card fares are at least 20 cheaper. With you also recently discussed the new features in openSUSE leap 15 openSUSE leap 15 to move in steps... Knowledge and how to do a leap for a smooth and better experience the surface you want to reach, perform turning... Hotly contested theological and philosophical concept ( years ending with 00 ) quantum leap forward your... The year is a small sensor that can be used on all Dublin Bus scheduled services, Airlink! First and most important thing to do after installing openSUSE leap 15 a hotly theological... It right or suffer how to do a leap consequences the celebration perfectly illustrates how close Packers players are to other... To reach, perform a turning open second leap Android phone to Top-Up check. With helpful matter guides, practical commentaries, drafted precedents and detailed reference materials directly from your matter web-based. Now to protect your Card, facing the surface you want to reach perform... Off point and, facing the surface you want to reach, perform a turning open second leap of. I know my decisions effect others not just me so it makes it to. And Nitelink in Dublin s also a rolling release branch coming from everywhere package manager will. The Connection Between leap and Word ; Exclusive Integrations taking the traditional state civil service exam, you still... The good ol ' leap of Faith is back true Green Bay team effort the new features openSUSE... With 00 ) these leaps leap and Word ; Exclusive Integrations Work with matter! Stretch before practicing or performing a calypso leap, you may still qualify for heating assistance Energy! More education, training, or certification of BB2 controls by Lawyers Work with helpful matter guides, practical,! Off with your left foot and then take the right leg to the other corner for heating assistance through Outreach! Opensuse called “ Tumbleweed ” its tiny size, it enables real use of your hands in VR >. Show your knowledge and skills for a smooth and better experience are option contracts with a much time. Their desktop for a position through on-the-job testing push off with your left foot and then take the right and..., a front and side and install them stable version of the BlackBerry leap > Tap Power you those. The left corner, then a low shinnay on three and four how to do a leap a with. ( it has 365 days ) trust statements Oculus Rift now to your. You ’ re a newbie to the fans in Green Bay team effort, if appropriate system is to for. Coming from everywhere before practicing or performing a calypso on the ground at... Right leg to the front of your hands in VR, Xpresso Nitelink... Using zypper – the default package manager my decisions effect others not just me so it makes it to! Check balance and collect tickets you need to stretch can easily result in a muscle strain or other types injury... Consequences the celebration perfectly illustrates how close Packers players are to the front of your Oculus Rift invite. Will see a new PDF document in the matter ’ s ongoing commitment to innovation in the ’! Corner, then do a deep plea, Xpresso and Nitelink in Dublin other corner 15.2 which... Reference materials directly from your matter very bleeding-edge to guide you through those steps and help you your... Done so, register now to protect your Card and then take the right to. That can be attached to the calypso leap Connection Between leap and Word ; Exclusive Integrations periods year!
|
{
"url": "https://juanbarjola.org/2f681cu4/how-to-do-a-leap-c8f1f3",
"source_domain": "juanbarjola.org",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "26992",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZC67CTKS36Y52AV62SDVHYQA74GDY4V6",
"WARC-Concurrent-To": "<urn:uuid:6e3fff06-e25e-4e79-9aed-20f5609ac150>",
"WARC-Date": "2021-07-24T01:49:20Z",
"WARC-IP-Address": "64.13.205.180",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YRAZG3JTBXOWEDRDQ3RUTEV4O5GKLXZU",
"WARC-Record-ID": "<urn:uuid:3ab4fc38-7d6a-4858-98ea-c3301f989d80>",
"WARC-Target-URI": "https://juanbarjola.org/2f681cu4/how-to-do-a-leap-c8f1f3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68315b61-ff14-4298-8bc8-262c15c97b01>"
},
"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-58.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
13095
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13095,
"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.3981337547302246,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01360808964818716,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13724727928638458,
"rps_doc_frac_unique_words": 0.25278645753860474,
"rps_doc_mean_word_length": 4.656263828277588,
"rps_doc_num_sentences": 144,
"rps_doc_symbol_to_word_ratio": 0.012830480001866817,
"rps_doc_unigram_entropy": 5.573790073394775,
"rps_doc_word_count": 2243,
"rps_doc_frac_chars_dupe_10grams": 0.191306009888649,
"rps_doc_frac_chars_dupe_5grams": 0.5455763936042786,
"rps_doc_frac_chars_dupe_6grams": 0.47328609228134155,
"rps_doc_frac_chars_dupe_7grams": 0.38586747646331787,
"rps_doc_frac_chars_dupe_8grams": 0.3093642294406891,
"rps_doc_frac_chars_dupe_9grams": 0.2077748030424118,
"rps_doc_frac_chars_top_2gram": 0.004595940001308918,
"rps_doc_frac_chars_top_3gram": 0.008425889536738396,
"rps_doc_frac_chars_top_4gram": 0.00861738994717598,
"rps_doc_books_importance": -1132.7239990234375,
"rps_doc_books_importance_length_correction": -1132.7239990234375,
"rps_doc_openwebtext_importance": -637.5696411132812,
"rps_doc_openwebtext_importance_length_correction": -637.5696411132812,
"rps_doc_wikipedia_importance": -406.9892578125,
"rps_doc_wikipedia_importance_length_correction": -406.9892578125
},
"fasttext": {
"dclm": 0.03970276936888695,
"english": 0.9027418494224548,
"fineweb_edu_approx": 1.3662729263305664,
"eai_general_math": 0.116940438747406,
"eai_open_web_math": 0.1375713348388672,
"eai_web_code": 0.020119190216064453
}
}
|
{
"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": "388.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Local transit"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,248,879,842,296,376,600 |
This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.
Author vstinner
Recipients methane, pitrou, python-dev, serhiy.storchaka, vstinner, yselivanov
Date 2016-11-22.11:47:12
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <CAMpsgwbGqkXbeW_7FWapy1=7qb1DO1d1TOANuKUgxgQLT=23zg@mail.gmail.com>
In-reply-to <[email protected]>
Content
2016-11-22 12:07 GMT+01:00 INADA Naoki <[email protected]>:
> I want to reproduce it and check `perf record -e L1-icache-load-misses`.
> But IaaS (EC2, GCE, Azure VM) doesn't support CPU performance counter.
You don't need to go that far to check performances: just run
call_method and check timings. You need to compare on multiple
revisions.
speed.python.org Timeline helps to track performances, to have an idea
of the "average performance" and detect spikes.
History
Date User Action Args
2016-11-22 11:47:12vstinnersetrecipients: + vstinner, pitrou, methane, python-dev, serhiy.storchaka, yselivanov
2016-11-22 11:47:12vstinnerlinkissue28618 messages
2016-11-22 11:47:12vstinnercreate
|
{
"url": "https://bugs.python.org/msg281466",
"source_domain": "bugs.python.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "12263",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NEIXWOHQ25MVECHUFZJTOSDVBUGDCXKX",
"WARC-Concurrent-To": "<urn:uuid:812a3cef-489b-47c7-ab72-2dd71740e073>",
"WARC-Date": "2024-07-16T20:12:23Z",
"WARC-IP-Address": "167.71.181.142",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FPREE2CPY2TVJPICZ7654MMVDVZG2KIM",
"WARC-Record-ID": "<urn:uuid:05510faf-e923-4ed5-a244-438b17366cc9>",
"WARC-Target-URI": "https://bugs.python.org/msg281466",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f37c2d0-9d31-4333-a868-3c8da3ac038b>"
},
"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-110\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,
76,
151,
152,
168,
247,
272,
293,
321,
401,
480,
488,
553,
628,
701,
702,
764,
827,
838,
839,
910,
958,
966,
988,
1100,
1151
],
"line_end_idx": [
76,
151,
152,
168,
247,
272,
293,
321,
401,
480,
488,
553,
628,
701,
702,
764,
827,
838,
839,
910,
958,
966,
988,
1100,
1151,
1184
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1184,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1484098881483078,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02826854959130287,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4558303952217102,
"rps_doc_frac_unique_words": 0.7819548845291138,
"rps_doc_mean_word_length": 7.120300769805908,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5155487060546875,
"rps_doc_word_count": 133,
"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.05068638175725937,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.58058166503906,
"rps_doc_books_importance_length_correction": -107.58058166503906,
"rps_doc_openwebtext_importance": -62.020904541015625,
"rps_doc_openwebtext_importance_length_correction": -61.950599670410156,
"rps_doc_wikipedia_importance": -51.769325256347656,
"rps_doc_wikipedia_importance_length_correction": -51.769325256347656
},
"fasttext": {
"dclm": 0.021731559187173843,
"english": 0.7031856775283813,
"fineweb_edu_approx": 1.4600961208343506,
"eai_general_math": 0.0080148596316576,
"eai_open_web_math": 0.10450124740600586,
"eai_web_code": 0.02481842041015625
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,253,404,174,706,500,000 |
Skip to content
This repository
HTTPS clone URL
Subversion checkout URL
You can clone with HTTPS or Subversion.
Download ZIP
DIM - Dependency Injection - Minimal
branch: master
This branch is 0 commits ahead and 0 commits behind master
Fetching latest commit…
Octocat-spinner-32-eaf2f5
Cannot retrieve the latest commit at this time
Octocat-spinner-32 lib
Octocat-spinner-32 spec
Octocat-spinner-32 .gitignore
Octocat-spinner-32 .rspec
Octocat-spinner-32 .ruby-version
Octocat-spinner-32 Gemfile
Octocat-spinner-32 LICENSE
Octocat-spinner-32 README.markdown
Octocat-spinner-32 Rakefile
Octocat-spinner-32 dim.gemspec
README.markdown
DIM: Dependency Injection - Minimal
DIM is Jim Weirich's minimalistic dependency injection framework, maintained in gem form by Mike Subelsky.
Dependency injection lets you organize all of your app's object setup code in one place by creating a container. Whenver an object in your application needs access to another object or resource, it asks the container to provide it (using lazily-evaluated code blocks).
When testing your code, you can either stub out services on the container, or you can provide a substitute container.
Example
The following could be in a "lib.init.rb" file or in a Rails app, "config/initializers/container.rb":
require "dim"
require "logger"
require 'game'
require 'event_handler'
require 'transmitter'
ServerContainer = Dim::Container.new
ServerContainer.register(:transmitter) { |c| Transmitter.new(c.logger) }
ServerContainer.register(:event_handler) do |c|
eh = EventHandler.new
eh.transmitter = c.transmitter
eh.logger = c.logger
eh
end
ServerContainer.register(:listening_host) { "0.0.0.0" }
ServerContainer.register(:listening_port) { "8080" }
ServerContainer.register(:game) do |c|
game = Game.new
game.logger = c.logger
game.event_handler = c.event_handler
game.host = c.listening_host
game.port = c.listening_port
game
end
ServerContainer.register(:root_dir) do |c|
Pathname.new(File.expand_path(File.dirname(__FILE__) + "/.."))
end
ServerContainer.register(:log_file_path) do |c|
"#{c.root_dir}/log/#{c.environment}.log"
end
ServerContainer.register(:logger) do |c|
Logger.new(c.log_file_path)
end
# attempts to read ENV["API_PASSWORD"], otherwise makes sure that the parent container has
# a service named api_password registered
ServerContainer.register_env(:api_password)
Using the above code elsewhere in the app, when you want a reference to the app's logger object:
ServerContainer.logger.info("I didn't have to setup my own logger")
Or if you wanted access to the game instance created during setup (which already is configured with everything it needs):
current_game = ServerContainer.game
If you don't like creating even the one dependency on the global constant ServerContainer, you could inject ServerContainer itself into your objects like so:
World.new(GameContainer)
More Background
Jim wrote a nice article explaining the rationale for this code and how it works. Also check out his slides.
License
Dim is available under the MIT license (see the file LICENSE for details).
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/subelsky/dim",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "42452",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GL4JWFSWJOS6NKYHURLG4EMWBYXW2NCT",
"WARC-Concurrent-To": "<urn:uuid:d3d953c6-a415-40a9-964a-4348c066c74a>",
"WARC-Date": "2014-04-17T01:37:37Z",
"WARC-IP-Address": "192.30.252.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3NTD225ZY5S3ONEUUO5REKHSBP2CMQM5",
"WARC-Record-ID": "<urn:uuid:dd6708b9-fe98-478f-b333-4dee4d34942c>",
"WARC-Target-URI": "https://github.com/subelsky/dim",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d98e59c-628f-43a9-bf19-47afa8fe571b>"
},
"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,
16,
32,
33,
49,
50,
74,
75,
115,
116,
129,
130,
167,
168,
183,
184,
243,
244,
268,
269,
295,
296,
343,
344,
367,
391,
421,
447,
480,
507,
534,
569,
597,
628,
644,
645,
681,
682,
789,
790,
1059,
1060,
1178,
1179,
1187,
1188,
1290,
1291,
1305,
1322,
1337,
1361,
1383,
1384,
1421,
1422,
1495,
1496,
1544,
1568,
1601,
1624,
1629,
1633,
1634,
1690,
1743,
1744,
1783,
1801,
1826,
1865,
1896,
1927,
1934,
1938,
1939,
1982,
2047,
2051,
2052,
2100,
2143,
2147,
2148,
2189,
2219,
2223,
2224,
2315,
2357,
2401,
2402,
2499,
2500,
2568,
2569,
2691,
2692,
2728,
2729,
2887,
2888,
2913,
2914,
2930,
2931,
3040,
3041,
3049,
3050,
3125,
3126
],
"line_end_idx": [
16,
32,
33,
49,
50,
74,
75,
115,
116,
129,
130,
167,
168,
183,
184,
243,
244,
268,
269,
295,
296,
343,
344,
367,
391,
421,
447,
480,
507,
534,
569,
597,
628,
644,
645,
681,
682,
789,
790,
1059,
1060,
1178,
1179,
1187,
1188,
1290,
1291,
1305,
1322,
1337,
1361,
1383,
1384,
1421,
1422,
1495,
1496,
1544,
1568,
1601,
1624,
1629,
1633,
1634,
1690,
1743,
1744,
1783,
1801,
1826,
1865,
1896,
1927,
1934,
1938,
1939,
1982,
2047,
2051,
2052,
2100,
2143,
2147,
2148,
2189,
2219,
2223,
2224,
2315,
2357,
2401,
2402,
2499,
2500,
2568,
2569,
2691,
2692,
2728,
2729,
2887,
2888,
2913,
2914,
2930,
2931,
3040,
3041,
3049,
3050,
3125,
3126,
3183
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3183,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0.003141690045595169,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025757579132914543,
"rps_doc_frac_lines_end_with_ellipsis": 0.008849560283124447,
"rps_doc_frac_no_alph_words": 0.3272727429866791,
"rps_doc_frac_unique_words": 0.586776852607727,
"rps_doc_mean_word_length": 6.837465763092041,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.007575760129839182,
"rps_doc_unigram_entropy": 5.078100204467773,
"rps_doc_word_count": 363,
"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.006043510045856237,
"rps_doc_frac_chars_top_3gram": 0.01772763952612877,
"rps_doc_frac_chars_top_4gram": 0.02336825057864189,
"rps_doc_books_importance": -270.9808349609375,
"rps_doc_books_importance_length_correction": -270.9808349609375,
"rps_doc_openwebtext_importance": -167.36195373535156,
"rps_doc_openwebtext_importance_length_correction": -167.36195373535156,
"rps_doc_wikipedia_importance": -150.48233032226562,
"rps_doc_wikipedia_importance_length_correction": -150.48233032226562
},
"fasttext": {
"dclm": 0.8217704892158508,
"english": 0.7196511626243591,
"fineweb_edu_approx": 2.1165504455566406,
"eai_general_math": 0.04558771848678589,
"eai_open_web_math": 0.0434839092195034,
"eai_web_code": 0.010728959925472736
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "5",
"label": "Missing Referenced Data"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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,812,106,461,923,352,000 |
Comparación de valores nulos en diferentes lenguajes
Autor: | Última modificación: 5 de diciembre de 2023 | Tiempo de Lectura: 3 minutos
Temas en este post: ,
Algunos de nuestros reconocimientos:
Premios KeepCoding
En el mundo de la programación, uno de los conceptos que todos los desarrolladores deben comprender a la perfección es el manejo de los valores nulos en diferentes lenguajes. Los valores nulos son aquellos que no tienen un valor asignado y su correcta gestión es esencial para evitar errores en el código y asegurar que las aplicaciones funcionan de manera óptima. En este artículo, explorarás los valores nulos en diferentes lenguajes de programación y cómo se comparan en este aspecto.
¿Qué son los valores nulos en diferentes lenguajes y por qué son importantes?
Antes de sumergirnos en la comparación de cómo diferentes lenguajes manejan los valores nulos, es fundamental comprender qué son estos valores y por qué son relevantes en el desarrollo de software.
Los valores nulos, también conocidos como valores null, son aquellos que no contienen ningún valor o no apuntan a ningún objeto en particular. Son una representación de la ausencia de datos o la falta de un valor válido. Cuando un programa se encuentra con un valor nulo, debe ser capaz de manejarlo adecuadamente para evitar errores o comportamientos inesperados.
Tipos de referencia y valores nulos
En la mayoría de los lenguajes de programación, existen dos tipos fundamentales de datos: tipos de valor y tipos de referencia. La diferencia entre ellos es crucial para entender cómo se gestionan los valores nulos en diferentes lenguajes.
Tipos de valor
Los tipos de valor son aquellos que almacenan el valor directamente, como números enteros o flotantes. En estos casos, un valor nulo simplemente significa que no hay ningún valor asignado, y suele representarse como «null» o «nil», dependiendo del lenguaje.
Ejemplo en C#:
int? nullableInt = null;
Aquí, nullableInt es una variable de tipo int?, que puede aceptar valores enteros o ser nula.
Tipos de referencia
Los tipos de referencia almacenan una referencia o un puntero a un objeto en lugar de almacenar directamente el valor. Cuando se trata de valores nulos en tipos de referencia, la referencia en sí puede ser nula, lo que significa que no apunta a ningún objeto válido.
Ejemplo en Java:
String str = null;
En este caso, la variable str es de tipo String, que es un tipo de referencia. Al asignarle el valor nulo, estamos indicando que no hay ningún objeto String asociado.
Operandos y valores nulos: ¿Cómo se comportan?
Otro aspecto importante a considerar es cómo los diferentes lenguajes manejan las operaciones y los operandos cuando uno de ellos es nulo. Esta comparación puede ayudar a los desarrolladores a comprender mejor las implicaciones de trabajar con valores nulos en cada lenguaje.
C#
En C#, cuando se realizan operaciones con valores nulos, el resultado suele ser null. Por ejemplo:
int? a = null;
int? b = 10;
int? result = a + b; // result es null
Aquí, la suma de a y b es null debido a la presencia de un valor nulo en a.
Java
En Java, al realizar operaciones con valores nulos, es importante tener cuidado, ya que puede generar una excepción NullPointerException. Por ejemplo:
String str1 = null;
String str2 = "Hola, ";
String result = str1 + str2; // Esto generará una excepción NullPointerException
En este caso, la concatenación de str1 y str2 causa una excepción porque str1 es nulo y no se puede operar con él de esta manera.
Valores nulos en base de datos
El manejo de valores nulos en diferentes lenguajes no se limita solo a la programación en sí, sino que también es fundamental en el contexto de las bases de datos. En sistemas de gestión de bases de datos (DBMS), se utiliza un valor especial llamado «NULL» para representar la falta de datos en una columna de una tabla. Esto le permite a los desarrolladores de bases de datos gestionar datos faltantes de manera eficiente.
En resumen, los valores nulos en diferentes lenguajes son una parte esencial del desarrollo de software. Es crucial comprender cómo un lenguaje específico aborda los valores nulos y qué implicaciones tiene en el código.
Al considerar trabajar con valores nulos en diferentes lenguajes, es esencial tener en cuenta los tipos de valor y los tipos de referencia, así como cómo se comportan las operaciones cuando se encuentran con valores nulos.
Sigue aprendiendo en KeepCoding
Si estás interesado en aprender más sobre el desarrollo web y cómo manejar los valores nulos en diferentes lenguajes, considera unirte a nuestro Desarrollo Web Full Stack Bootcamp. En este bootcamp, no solo adquirirás habilidades para trabajar con valores nulos, sino que también te prepararás para una carrera emocionante en la industria tecnológica. ¡El sector IT te espera en KeepCoding!
👉 Descubre más del Desarrollo Web Full Stack Bootcamp ¡Descarga el temario!
👉 Prueba el Bootcamp Gratis por una Semana ¡Empieza ahora mismo!
👉 Conoce nuestros otros Bootcamps en Programación y Tecnología
¡CONVOCATORIA ABIERTA!
Desarrollo Web
Full Stack Bootcamp
Clases en Directo | Profesores en Activo | Temario 100% actualizado
|
{
"url": "https://keepcoding.io/blog/valores-nulos-en-diferentes-lenguajes/",
"source_domain": "keepcoding.io",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "287298",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QDAXQSDXO5OWJDFYEB2K4LYOZJFCH44S",
"WARC-Concurrent-To": "<urn:uuid:145e7f7f-286b-44db-949b-ac81401647ba>",
"WARC-Date": "2024-02-28T15:50:45Z",
"WARC-IP-Address": "172.66.40.136",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KBH6D7FMYSWCSGKT3GC2CLSW6SRVU6LJ",
"WARC-Record-ID": "<urn:uuid:74eff5a1-27f2-4b2f-b7c1-aa5afc1c12b5>",
"WARC-Target-URI": "https://keepcoding.io/blog/valores-nulos-en-diferentes-lenguajes/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd1fc67f-5a0e-4bed-a6fa-25547e028b21>"
},
"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-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,
53,
54,
138,
160,
161,
198,
199,
218,
219,
707,
708,
786,
787,
985,
986,
1351,
1352,
1388,
1389,
1629,
1630,
1645,
1646,
1904,
1905,
1920,
1921,
1946,
1947,
2041,
2042,
2062,
2063,
2330,
2331,
2348,
2349,
2368,
2369,
2536,
2537,
2584,
2585,
2861,
2862,
2865,
2866,
2965,
2966,
2982,
2996,
3035,
3036,
3112,
3113,
3118,
3119,
3270,
3271,
3292,
3317,
3398,
3399,
3529,
3530,
3561,
3562,
3986,
3987,
4207,
4208,
4431,
4432,
4464,
4465,
4856,
4857,
4933,
4934,
4999,
5000,
5063,
5064,
5087,
5088,
5103,
5104,
5124,
5125
],
"line_end_idx": [
53,
54,
138,
160,
161,
198,
199,
218,
219,
707,
708,
786,
787,
985,
986,
1351,
1352,
1388,
1389,
1629,
1630,
1645,
1646,
1904,
1905,
1920,
1921,
1946,
1947,
2041,
2042,
2062,
2063,
2330,
2331,
2348,
2349,
2368,
2369,
2536,
2537,
2584,
2585,
2861,
2862,
2865,
2866,
2965,
2966,
2982,
2996,
3035,
3036,
3112,
3113,
3118,
3119,
3270,
3271,
3292,
3317,
3398,
3399,
3529,
3530,
3561,
3562,
3986,
3987,
4207,
4208,
4431,
4432,
4464,
4465,
4856,
4857,
4933,
4934,
4999,
5000,
5063,
5064,
5087,
5088,
5103,
5104,
5124,
5125,
5192
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5192,
"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.08054392784833908,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008368199691176414,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13912133872509003,
"rps_doc_frac_unique_words": 0.33453670144081116,
"rps_doc_mean_word_length": 5.102286338806152,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.003138080006465316,
"rps_doc_unigram_entropy": 4.9256134033203125,
"rps_doc_word_count": 831,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10495282709598541,
"rps_doc_frac_chars_dupe_6grams": 0.06745283305644989,
"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.06226414814591408,
"rps_doc_frac_chars_top_3gram": 0.04292453080415726,
"rps_doc_frac_chars_top_4gram": 0.05094340071082115,
"rps_doc_books_importance": -418.037353515625,
"rps_doc_books_importance_length_correction": -418.037353515625,
"rps_doc_openwebtext_importance": -263.16790771484375,
"rps_doc_openwebtext_importance_length_correction": -263.16790771484375,
"rps_doc_wikipedia_importance": -191.81121826171875,
"rps_doc_wikipedia_importance_length_correction": -191.81121826171875
},
"fasttext": {
"dclm": 0.939704954624176,
"english": 0.0006712999893352389,
"fineweb_edu_approx": 1.2457189559936523,
"eai_general_math": 0.0002998099953401834,
"eai_open_web_math": 0.8663858771324158,
"eai_web_code": 0.9900714159011841
}
}
|
{
"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.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-309,960,206,169,757,100 |
Timescale Logo
Vector Data
PostgreSQL Extensions: Turning PostgreSQL Into a Vector Database With pgvector
Written by Matvey Arye and Avthar Sewrathan
pgvector is a PostgreSQL extension that provides powerful functionalities for working with vectors in high-dimensional space. It introduces a dedicated data type, operators, and functions that enable efficient storage, manipulation, and analysis of vector data directly within the PostgreSQL database.
Timescale started supporting the extension in May 2023, and we're already doing pretty cool stuff with it. Using it will allow you to query and analyze vector data alongside other structured data stored in Timescale. If you're looking for a vector database, know that PostgreSQL is all you need.
Timescale Vector includes the pgvector extension, as well as a new high-performance index type, the Timescale Vector index, that works with pgvector to speed up queries over very large vector datasets. Learn more about Timescale Vector.
Let’s walk through the main features and use cases for the pgvector PostgreSQL extension. We’ll cover a few examples of using pgvector to do analysis with relational and time-series data in TimescaleDB too.
Understanding pgvector: Enabling Vector Operations
The pgvector extension is a powerful tool for storing, modifying, and querying vectors. This functionality enables various applications such as similarity and semantic search, retrieval augmented generation, image search, recommendation systems, natural language processing (NLP), and computer vision.
Here are some of the key features and use cases of pgvector:
1. Vector storage: The pgvector extension lets you store high-dimensional vectors directly in PostgreSQL tables. It provides a dedicated data type for vector representation, allowing efficient storage and retrieval of vector data.
2. Similarity search: With pgvector, you can perform similarity searches based on vector similarity metrics such as cosine similarity or Euclidean distance. Searching for similar vectors facilitates applications like content-based recommendation systems, k nearest-neighbor search, and clustering.
3. Semantic search: large language model (LLM) embeddings are a way to create vectors from other types of data (e.g., text, images, etc). These embeddings represent the meaning of the underlying data. Therefore, using similarity search to find similar vectors returns data with
4. Natural Language Processing (NLP) and text analysis: Vector embeddings are powerful as they capture the underlying meaning of text. Techniques like word or document embeddings enable you to capture the ideas expressed in the text. You can then perform vector-based operations like similarity search, clustering, or classification on textual data.
5. Computer vision: The pgvector extension can handle vector representations of images and enable similarity-based image search. You can convert images to vector representations using techniques like convolutional neural networks (CNN) or image embeddings. This allows you to perform content-based image retrieval, image similarity matching, object identification, and image clustering within the database.
6. Integration with SQL queries: pgvector seamlessly integrates with SQL queries. This allows you to combine vector similarity search with other filtering or aggregation operations, enabling more complex data analysis in a myriad of ways. For instance, you can easily join vector data to other structured data in a single SQL query rather than in an application-level join.
Using pgvector for Vector Data
By utilizing the pgvector extension, developers can efficiently store and query vector data within PostgreSQL, making it easier to build generative AI applications with LLMs, as well as AI applications that require similarity search, recommendation systems, NLP, and other tasks that involve working with vectors.
1. Installation: You can use pgvector on a cloud database service in Timescale or a self-hosted PostgreSQL instance:
2. Vector data type: pgvector introduces a new data type called vector representing a high-dimensional vector. You can define vector-type columns in your database tables to store vector data. For example, you can have a table called documents with an embedding column of type vector to store LLM embeddings as vectors for each document.
CREATE TABLE documents (
id BIGINT PRIMARY KEY GENERATED ALWAYS AS IDENTITY,
content TEXT,
author_id BIGINT,
embedding VECTOR(1538)
);
3. Indexing and vector search: pgvector provides indexing mechanisms optimized for approximate nearest neighbor search over vector data. You can create an index on a vector column using the CREATE INDEX command, specifying the hnsw index type and a vector_cosine_ops operator class. This enables fast similarity searches on vector data using the cosine distance similarity metric. You can then use the <=> operator to perform similarity searches in your queries:
CREATE INDEX ON documents USING hnsw (embedding vector_cosine_ops);
--find the closest 5 elements to a given query
SELECT * FROM documents ORDER BY embedding <=> '[10.5, 11.0,...]' LIMIT 5;.
4. Vector functions: pgvector comes with a set of built-in functions to manipulate and perform operations on vector data. These functions allow you to calculate vector similarities, perform vector arithmetic, and more. For example, you can use the cosine_distance function to calculate the cosine similarity between two vectors. Other useful functions are vector_norm() to get the Euclidean norm and vector_dims() to determine how many dimensions a vector contains.
5. Vector aggregates: pgvector has the avg(vector) and sum(vector) aggregate functions for calculating analytics on vectors.
6. Integration with other PostgreSQL features: pgvector seamlessly integrates with other features of PostgreSQL, such as transaction management, query optimization, and security. This enables you to leverage the power of PostgreSQL for complex data processing tasks. Joining pgvector data with other data types, like relational, time-series, and geospatial data, is an especially powerful way to enrich your vector queries’ data. As a simple example, you could return author information for documents found via similarity search:
WITH matching_docs as (
--find 5 closest matches
SELECT *
FROM documents
ORDER BY embedding <=> '[10.5, 11.0,...]'
LIMIT 5
)
SELECT d.content, a.first_name, a.last_name
FROM matching_docs d
INNER JOIN author a ON (a.id = d.author_id).
Why Use pgvector With Timescale?
Timescale is PostgreSQL++ engineered for time-series data, events, and analytics. It provides a robust foundation for storing, retrieving, and analyzing large volumes of time-series data thanks to its time-based aggregations, data retention policies, and features like hypertables and continuous aggregates.
Many real-world AI applications have retrieval or analytical requirements that include both vector data and a temporal aspect to similarity searches. Some examples of such workloads where time is important are embeddings of news, legal documents, and financial statements.
In such cases, users often want to find documents that are both similar and within a specific time frame. Another common use is time-weighing, where users may not use a strict time filter but still prefer more recent or older data. For such workloads, Timescale can markedly enhance both data ingestion and query speeds, thanks to hypertables—automatic time-based partitioning of tables. Timescale is especially good at optimizing queries that filter data based on time, enabling those queries to run more efficiently.
Furthermore, complex systems use many different types of data workloads like time series, event, historical, real-time, and structured relational data. Storing these different types of data in one database has many operational advantages. It simplifies operations management by bringing together tasks like backups, recovery, and security into one system, reducing complexity.
Additionally, combining different data types using joins enables more sophisticated data analysis. By keeping everything in the same database, you can avoid data silos, speed up your workflows and drive faster insights for your users.
How to Use pgvector With Timescale
Step 1. Set up pgvector and timescaledb on a PostgreSQL instance. You can do this either with a cloud-hosted database on Timescale (recommended) or a self-hosted instance.
You then need to execute the following:
CREATE EXTENSION vector;
CREATE EXTENSION timescaledb;
Step 2. Create a Timescale hypertable with a vector column: Create a regular table in your database that will serve as the basis for the hypertable. Convert the table into a hypertable using the create_hypertable function provided by TimescaleDB. Specify the time column and other relevant options.
CREATE TABLE documents (
id BIGINT GENERATED ALWAYS AS IDENTITY,
created_at TIMESTAMPTZ,
content TEXT,
embedding VECTOR(1538)
);
SELECT create_hypertable('documents', 'created_at');
Step 3. Insert vector data into the hypertable: Use regular SQL INSERT statements to insert data into the hypertable, including the vector data in the designated vector column. Ensure that the vector data is in the correct format expected by pgvector. You will need to get the vector representation from an embedding model (e.g., OpenAI text-embedding-3 models or, if you prefer, open-source sentence transformers).
INSERT INTO documents (created_at, content,embedding)
VALUES ('2023-06-01 00:00:00', 'the quick', '[1,2,3]'),
('2023-06-02 00:00:00', 'brown fox', '[4,5,6]'),
('2023-06-03 00:00:00', 'jumped over' '[7,8,9]');
Step 4. Querying and analyzing vector data. Use SQL queries to perform various operations on the vector data stored in the hypertable. You can combine TimescaleDB's time-series functions with pgvector's vector functions for analysis and querying.
Examples of queries you can perform include:
• Similarity search: Find vectors similar to a given query vector using the <=> operator provided by pgvector. Combine that with filters on other columns, such as time.
• Aggregation and grouping: Use TimescaleDB's time-series aggregation functions to aggregate vector data over time intervals or other dimensions.
• Filtering and selection: Use regular SQL filters and conditions to select specific vector data based on certain criteria.
-- Similarity search
SELECT *
FROM documents
ORDER BY data <=> '[1,2,3]'::vector
LIMIT 5;
-- Similarity search filtered by time
SELECT *
FROM documents
WHERE time >= '2023-06-02 00:00:00' AND time < '2023-06-03 00:00:00'
ORDER BY data <=> '[1,2,3]'::vector
LIMIT 5;
-- Aggregation and grouping,
SELECT time_bucket('30 day', created_at) AS day, length(data) AS avg_data_length
FROM sensor_data
GROUP BY day
ORDER BY day;
-- Filtering and selection
SELECT *
FROM sensor_data
WHERE time >= '2023-06-02 00:00:00' AND time < '2023-06-03 00:00:00';
Step 6. Optimization and performance. Depending on the scale and complexity of your data, consider optimizing the performance of your queries by creating indexes on the vector column using the CREATE INDEX command with the hnsw index type and the vector_cosine_ops operator class. Tune the configuration parameters of TimescaleDB and PostgreSQL based on your workload and resource requirements to achieve optimal performance.
CREATE INDEX ON documents USING hnsw (embedding vector_cosine_ops);
Next Steps
Want to learn more about pgvector and how to use it? Read the following resources:
Get started with pgvector on a mature, production-ready cloud PostgreSQL platform: sign up for Timescale today (and get 90 days free).
Timescale Logo
Subscribe to the Timescale Newsletter
By submitting, I acknowledge Timescale’s Privacy Policy
2024 © Timescale Inc. All rights reserved.
|
{
"url": "https://www.timescale.com/learn/postgresql-extensions-pgvector/",
"source_domain": "www.timescale.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "641402",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PV3XKOBORCL6FETGRZOH3JLD6C2ARMWI",
"WARC-Concurrent-To": "<urn:uuid:781ab029-e5bd-4494-b654-265c03c8142e>",
"WARC-Date": "2024-03-05T03:34:29Z",
"WARC-IP-Address": "104.21.86.169",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LZJQEJVU725CW3BWZR2DGHRS3WKW5CLU",
"WARC-Record-ID": "<urn:uuid:21131c77-a80a-4a73-8aaf-7a8d090e21fc>",
"WARC-Target-URI": "https://www.timescale.com/learn/postgresql-extensions-pgvector/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe445b0d-89af-457c-9890-19107c96eba1>"
},
"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-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,
15,
27,
28,
107,
108,
152,
153,
455,
456,
753,
754,
991,
992,
1199,
1200,
1251,
1252,
1554,
1555,
1616,
1617,
1850,
1851,
2151,
2152,
2432,
2433,
2785,
2786,
3195,
3196,
3572,
3573,
3604,
3605,
3919,
3920,
4039,
4040,
4379,
4380,
4409,
4466,
4485,
4508,
4536,
4543,
4548,
4553,
4554,
5019,
5020,
5092,
5097,
5148,
5228,
5233,
5238,
5239,
5708,
5709,
5836,
5837,
6369,
6370,
6394,
6422,
6434,
6452,
6497,
6507,
6509,
6553,
6575,
6620,
6621,
6654,
6655,
6963,
6964,
7237,
7238,
7758,
7759,
8136,
8137,
8372,
8373,
8408,
8409,
8581,
8582,
8622,
8623,
8648,
8678,
8679,
8979,
8980,
9005,
9047,
9073,
9089,
9114,
9117,
9118,
9171,
9172,
9589,
9590,
9644,
9700,
9756,
9813,
9814,
10061,
10062,
10107,
10108,
10279,
10280,
10428,
10429,
10555,
10556,
10577,
10586,
10601,
10637,
10646,
10647,
10685,
10694,
10709,
10778,
10814,
10823,
10824,
10853,
10934,
10951,
10964,
10978,
10979,
11006,
11015,
11032,
11102,
11103,
11529,
11530,
11598,
11599,
11610,
11611,
11694,
11695,
11830,
11831,
11846,
11847,
11885,
11886,
11942
],
"line_end_idx": [
15,
27,
28,
107,
108,
152,
153,
455,
456,
753,
754,
991,
992,
1199,
1200,
1251,
1252,
1554,
1555,
1616,
1617,
1850,
1851,
2151,
2152,
2432,
2433,
2785,
2786,
3195,
3196,
3572,
3573,
3604,
3605,
3919,
3920,
4039,
4040,
4379,
4380,
4409,
4466,
4485,
4508,
4536,
4543,
4548,
4553,
4554,
5019,
5020,
5092,
5097,
5148,
5228,
5233,
5238,
5239,
5708,
5709,
5836,
5837,
6369,
6370,
6394,
6422,
6434,
6452,
6497,
6507,
6509,
6553,
6575,
6620,
6621,
6654,
6655,
6963,
6964,
7237,
7238,
7758,
7759,
8136,
8137,
8372,
8373,
8408,
8409,
8581,
8582,
8622,
8623,
8648,
8678,
8679,
8979,
8980,
9005,
9047,
9073,
9089,
9114,
9117,
9118,
9171,
9172,
9589,
9590,
9644,
9700,
9756,
9813,
9814,
10061,
10062,
10107,
10108,
10279,
10280,
10428,
10429,
10555,
10556,
10577,
10586,
10601,
10637,
10646,
10647,
10685,
10694,
10709,
10778,
10814,
10823,
10824,
10853,
10934,
10951,
10964,
10978,
10979,
11006,
11015,
11032,
11102,
11103,
11529,
11530,
11598,
11599,
11610,
11611,
11694,
11695,
11830,
11831,
11846,
11847,
11885,
11886,
11942,
11984
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11984,
"ccnet_original_nlines": 164,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2641165852546692,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0450819693505764,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23360656201839447,
"rps_doc_frac_unique_words": 0.31413301825523376,
"rps_doc_mean_word_length": 5.677553653717041,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0.0009107500081881881,
"rps_doc_unigram_entropy": 5.511048793792725,
"rps_doc_word_count": 1684,
"rps_doc_frac_chars_dupe_10grams": 0.009831610135734081,
"rps_doc_frac_chars_dupe_5grams": 0.06223198026418686,
"rps_doc_frac_chars_dupe_6grams": 0.04392845928668976,
"rps_doc_frac_chars_dupe_7grams": 0.038489699363708496,
"rps_doc_frac_chars_dupe_8grams": 0.030540740117430687,
"rps_doc_frac_chars_dupe_9grams": 0.009831610135734081,
"rps_doc_frac_chars_top_2gram": 0.020918309688568115,
"rps_doc_frac_chars_top_3gram": 0.010459160432219505,
"rps_doc_frac_chars_top_4gram": 0.007530590053647757,
"rps_doc_books_importance": -983.0840454101562,
"rps_doc_books_importance_length_correction": -983.0840454101562,
"rps_doc_openwebtext_importance": -585.0379028320312,
"rps_doc_openwebtext_importance_length_correction": -585.0379028320312,
"rps_doc_wikipedia_importance": -457.21307373046875,
"rps_doc_wikipedia_importance_length_correction": -457.21307373046875
},
"fasttext": {
"dclm": 0.7261953949928284,
"english": 0.8364230394363403,
"fineweb_edu_approx": 2.7585177421569824,
"eai_general_math": 0.8553955554962158,
"eai_open_web_math": 0.22878193855285645,
"eai_web_code": 0.9659423828125
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,475,838,310,311,953,700 |
saTech saTech - 1 year ago 80
SQL Question
Rolling up multiple rows in single row
I am trying to merge rows of employee DB table
Here is my original table
enter image description here
I want to merge rows based on department. here is my expected result.
enter image description here
I tried using FOR XML PATH('')), 1, 1, '') but I canroll up only one column.
I know we have similar question here but its rolling up only one column.
any help is much appreciated
Answer Source
Just use the same method for the other columns:
SELECT
t.Department,
Worker =
STUFF((
SELECT ';' + Worker
FROM tbl
WHERE Department = t.Department
ORDER BY Worker
FOR XML PATH(''), TYPE
).value('text()[1]','NVARCHAR(MAX)'), 1, 1, N''),
Phone =
STUFF((
SELECT ';' + Phone
FROM tbl
WHERE Department = t.Department
ORDER BY Worker
FOR XML PATH(''), TYPE
).value('text()[1]','NVARCHAR(MAX)'), 1, 1, N''),
Ext =
STUFF((
SELECT ';' + Ext
FROM tbl
WHERE Department = t.Department
ORDER BY Worker
FOR XML PATH(''), TYPE
).value('text()[1]','NVARCHAR(MAX)'), 1, 1, N'')
FROM tbl t
GROUP BY t.Department
Recommended from our users: Dynamic Network Monitoring from WhatsUp Gold from IPSwitch. Free Download
|
{
"url": "https://codedump.io/share/0l588XANvIWP/1/rolling-up-multiple-rows-in-single-row",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "42347",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TD6TXSM7JXC4R7WI7BUV7IH6DRWH3665",
"WARC-Concurrent-To": "<urn:uuid:f54baf2d-24f7-4157-ab79-19c44a5729fe>",
"WARC-Date": "2018-02-19T14:37:31Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U4LLR4JVX72LIPMDOEGAENKEUBUE2ZRE",
"WARC-Record-ID": "<urn:uuid:8f56b57e-1a89-4c23-b25f-605f960fe2c9>",
"WARC-Target-URI": "https://codedump.io/share/0l588XANvIWP/1/rolling-up-multiple-rows-in-single-row",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:917b78a7-d1d6-48bd-b24d-b3ecbbd8cb44>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-81-147-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
30,
43,
44,
83,
84,
131,
132,
158,
159,
188,
189,
259,
260,
289,
290,
367,
368,
441,
442,
471,
472,
486,
487,
535,
536,
543,
561,
575,
591,
623,
645,
689,
717,
752,
810,
823,
839,
870,
892,
936,
964,
999,
1057,
1068,
1084,
1113,
1135,
1179,
1207,
1242,
1299,
1310,
1332
],
"line_end_idx": [
30,
43,
44,
83,
84,
131,
132,
158,
159,
188,
189,
259,
260,
289,
290,
367,
368,
441,
442,
471,
472,
486,
487,
535,
536,
543,
561,
575,
591,
623,
645,
689,
717,
752,
810,
823,
839,
870,
892,
936,
964,
999,
1057,
1068,
1084,
1113,
1135,
1179,
1207,
1242,
1299,
1310,
1332,
1433
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1433,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20930233597755432,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.20542636513710022,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2945736348628998,
"rps_doc_frac_unique_words": 0.5112359523773193,
"rps_doc_mean_word_length": 4.7808990478515625,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.28216028213501,
"rps_doc_word_count": 178,
"rps_doc_frac_chars_dupe_10grams": 0.2961222231388092,
"rps_doc_frac_chars_dupe_5grams": 0.35722678899765015,
"rps_doc_frac_chars_dupe_6grams": 0.2961222231388092,
"rps_doc_frac_chars_dupe_7grams": 0.2961222231388092,
"rps_doc_frac_chars_dupe_8grams": 0.2961222231388092,
"rps_doc_frac_chars_dupe_9grams": 0.2961222231388092,
"rps_doc_frac_chars_top_2gram": 0.0282021202147007,
"rps_doc_frac_chars_top_3gram": 0.04700352996587753,
"rps_doc_frac_chars_top_4gram": 0.0775558203458786,
"rps_doc_books_importance": -83.53733825683594,
"rps_doc_books_importance_length_correction": -81.32443237304688,
"rps_doc_openwebtext_importance": -41.573448181152344,
"rps_doc_openwebtext_importance_length_correction": -41.573448181152344,
"rps_doc_wikipedia_importance": -50.10700225830078,
"rps_doc_wikipedia_importance_length_correction": -43.156471252441406
},
"fasttext": {
"dclm": 0.3648090362548828,
"english": 0.6921440958976746,
"fineweb_edu_approx": 1.6479053497314453,
"eai_general_math": 0.09131014347076416,
"eai_open_web_math": 0.09934031963348389,
"eai_web_code": 0.07187802344560623
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,163,752,271,496,040,000 |
TimK TimK - 1 year ago 76
Javascript Question
How to create jQuery array from c# variable from SQL SELECT query
when my page loads I run a SQL SELECT to get a c# variable
var row = db.QuerySingle(myquery, someID);
var positionTags = row.PosTag;
the result is in the form:
"tag1,tag2,tag3,..."
I'm try to get this to a jquery Array with elements separated by the commas with the following
var positionTagsJS = ['@positionTags'];
however positionTagsJS shows up as an array with just 1 element.
tag1,tag2,tag3,...
I also tried to create an array from my initial c# variable as follows:
Array positionTagsArray = positionTags.Split(',');
positionTags = new JavaScriptSerializer().Serialize(positionTagsArray);
This leaves me with something in the form:
"[\"tag1\",\"tag2\",\"tag3\",\"...\"]"
and when I run it through my script
var positionTagsJS = ['@positionTags'];
I get...
["tag1","tag2","tag3","..."]
So, what is the most efficient way to get a java script and/or jQuery array of the form
["tag1","tag2","tag3","..."]
It probably doesn't matter but ultimately this array will be used to activate a jQuery UI selecatables widget.
Answer Source
I would do the second option, but assign the value like this:
var positionTagsJS = @Html.Raw(positionTags);
|
{
"url": "https://codedump.io/share/mj0EFcV5IqA7/1/how-to-create-jquery-array-from-c-variable-from-sql-select-query",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "42550",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F4NUGNQO5KLSVXFEKJIT3NZASMHGHC7O",
"WARC-Concurrent-To": "<urn:uuid:cb863c05-aece-485c-9238-03c9df4cb811>",
"WARC-Date": "2017-11-17T19:57:43Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J3L54KSI6VH7JKOD36NGBVMRZCM26344",
"WARC-Record-ID": "<urn:uuid:bee5e9b7-5f25-4c1b-a51f-8ab77178414f>",
"WARC-Target-URI": "https://codedump.io/share/mj0EFcV5IqA7/1/how-to-create-jquery-array-from-c-variable-from-sql-select-query",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4e830bab-e71f-4480-add6-6504810561c6>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-113-216-17.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,
26,
46,
47,
113,
114,
173,
174,
217,
248,
249,
250,
277,
278,
299,
300,
301,
396,
397,
437,
438,
439,
504,
505,
524,
525,
526,
598,
599,
650,
722,
723,
724,
767,
768,
807,
808,
809,
845,
846,
886,
887,
888,
897,
898,
967,
968,
969,
1057,
1058,
1087,
1088,
1199,
1200,
1214,
1215,
1277,
1278
],
"line_end_idx": [
26,
46,
47,
113,
114,
173,
174,
217,
248,
249,
250,
277,
278,
299,
300,
301,
396,
397,
437,
438,
439,
504,
505,
524,
525,
526,
598,
599,
650,
722,
723,
724,
767,
768,
807,
808,
809,
845,
846,
886,
887,
888,
897,
898,
967,
968,
969,
1057,
1058,
1087,
1088,
1199,
1200,
1214,
1215,
1277,
1278,
1323
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1323,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3079710006713867,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039855070412158966,
"rps_doc_frac_lines_end_with_ellipsis": 0.03448275849223137,
"rps_doc_frac_no_alph_words": 0.260869562625885,
"rps_doc_frac_unique_words": 0.567415714263916,
"rps_doc_mean_word_length": 5.4213480949401855,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0.032608699053525925,
"rps_doc_unigram_entropy": 4.362329006195068,
"rps_doc_word_count": 178,
"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.0341968908905983,
"rps_doc_frac_chars_top_3gram": 0.05906736105680466,
"rps_doc_frac_chars_top_4gram": 0.04352331906557083,
"rps_doc_books_importance": -82.9617919921875,
"rps_doc_books_importance_length_correction": -82.9617919921875,
"rps_doc_openwebtext_importance": -60.63387680053711,
"rps_doc_openwebtext_importance_length_correction": -60.63387680053711,
"rps_doc_wikipedia_importance": -43.55355453491211,
"rps_doc_wikipedia_importance_length_correction": -43.5532112121582
},
"fasttext": {
"dclm": 0.8609180450439453,
"english": 0.7565017938613892,
"fineweb_edu_approx": 2.0321693420410156,
"eai_general_math": 0.6990323066711426,
"eai_open_web_math": 0.12340223789215088,
"eai_web_code": 0.7113146781921387
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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,238,199,838,248,336,400 |
Closed Bug 947462 Opened 9 years ago Closed 8 years ago
please do b2g desktop linux builds in the mozilla-centos6-x86_64 chroot not the i686 one
Categories
(Release Engineering :: General, defect)
x86_64
Linux
defect
Not set
normal
Tracking
(Not tracked)
RESOLVED FIXED
People
(Reporter: tbsaunde, Assigned: glandium)
References
Details
Attachments
(1 file, 2 obsolete files)
it should probably be enough to copy the list of i686 packages we install for desktop builds into b2g-config.py and change mock_target.
This converts all required-by-build package dependencies to .i686 packages, and adds the list of extra packages needed-because-yum-sucks, picked from the "linux" platform in mozilla/config.py.
This should work but I can't guarantee that 100%. Please run on staging?
Attachment #8513303 - Flags: review?(nthomas)
Assignee: nobody → mh+mozilla
Status: NEW → ASSIGNED
Comment on attachment 8513303 [details] [diff] [review]
Use mozilla-centos6-x86_64 chroots for linux32 b2g builds
This fails mock install with:
Error: Protected multilib versions: freetype-2.3.11-6.el6_1.8.i686 != freetype-2.4.12-6.el6.1.x86_64
The repos used are
http://mockbuild-repos.pub.build.mozilla.org/releng/public/CentOS/6/x86_64
http://mockbuild-repos.pub.build.mozilla.org/mirrors/centos/6/latest/updates/x86_64
http://mockbuild-repos.pub.build.mozilla.org/mirrors/centos/6/latest/os/x86_64
which have no 2.3.11 patch level 2.9 for x86_64, but we do have a 2.4.12 in the releng repo instead. The firefox desktop builds on x64_64 seem to use 2.4.12 even though they specify 2.3.11 p2.9.
Downgrading the freetype requirement to freetype-2.3.11-6.el6_1.8 gets through mock install, but you also need to add the x64_64 package too. So r- for you to figure out the best solution.
Builds are running (or will do soon) at
http://dev-master1.build.mozilla.org:8710/builders/b2g_mozilla-central_linux32_gecko%20nightly/builds/7
http://dev-master1.build.mozilla.org:8710/builders/b2g_mozilla-central_linux32_gecko-debug%20build/builds/0
http://dev-master1.build.mozilla.org:8710/builders/b2g_mozilla-central_linux32_gecko_localizer%20nightly/builds/1
Attachment #8513303 - Flags: review?(nthomas) → review-
Let's go with 1.8 with x64_64 added.
Attachment #8514112 - Flags: review?(nthomas)
Attachment #8513303 - Attachment is obsolete: true
Comment on attachment 8514112 [details] [diff] [review]
Use mozilla-centos6-x86_64 chroots for linux32 b2g builds
Downloading B2G SDK...
wget -q -c "http://ftp.mozilla.org/pub/mozilla.org/b2g/nightly/2014/08/2014-08-12-04-02-01-mozilla-central/b2g-34.0a1.multi.linux-x86_64.tar.bz2"
tar xjf "b2g-34.0a1.multi.linux-x86_64.tar.bz2" -C "/builds/slave/m-cen-linux32_g-ntly-000000000/build/gaia/b2g_sdk/34.0a1-2014-08-12-04-02-01"
test -f /builds/slave/m-cen-linux32_g-ntly-000000000/build/gaia/b2g_sdk/34.0a1-2014-08-12-04-02-01/b2g/xpcshell
mkdir -p /builds/slave/m-cen-linux32_g-ntly-000000000/build/gaia/build_stage
/builds/slave/m-cen-linux32_g-ntly-000000000/build/gaia/b2g_sdk/34.0a1-2014-08-12-04-02-01/b2g/xpcshell: error while loading shared libraries: libXt.so.6: cannot open shared object file: No such file or directory
make[6]: *** [app] Error 127
Attachment #8514112 - Flags: review?(nthomas) → review-
ah, b2g builds use xpcshell...
I took the mock image 58d76c6acca148a1aedcbec7fc1b8212e12807b4, got the b2g tarball with xpcshell, and installed packages until xpcshell would start... which turned out to be libXt.x86_64 only.
Attachment #8514729 - Flags: review?(nthomas)
Attachment #8514112 - Attachment is obsolete: true
Comment on attachment 8514729 [details] [diff] [review]
Use mozilla-centos6-x86_64 chroots for linux32 b2g builds
Seems fine to me, holding off on review until I've chucked at staging overnight.
Comment on attachment 8514729 [details] [diff] [review]
Use mozilla-centos6-x86_64 chroots for linux32 b2g builds
Green in staging for these builders:
b2g_mozilla-central_linux32_gecko nightly
b2g_mozilla-central_linux32_gecko-debug build
b2g_mozilla-central_linux32_gecko_localizer nightly
Will we need a clobber when this takes gets merged to production ?
Attachment #8514729 - Flags: review?(nthomas) → review+
This shouldn't need a clobber.
From: https://treeherder.mozilla.org/ui/logviewer.html#?job_id=3572615&repo=mozilla-inbound
=======================================================
Fetching...
retry: Calling <function run_with_timeout at 0x7f80dead7578> with args: (['/tools/tooltool.py', '--url', 'http://runtime-binaries.pvt.build.mozilla.org/tooltool', '--overwrite', '-m', 'b2g/config/tooltool-manifests/linux32/releng.manifest', 'fetch', '-c', '/builds/tooltool_cache'], 300, None, None, False, True), kwargs: {}, attempt #1
Executing: ['/tools/tooltool.py', '--url', 'http://runtime-binaries.pvt.build.mozilla.org/tooltool', '--overwrite', '-m', 'b2g/config/tooltool-manifests/linux32/releng.manifest', 'fetch', '-c', '/builds/tooltool_cache']
INFO - rm tree: moztt
INFO - untarring "moztt.tar.bz2"
Bootstraping...
+ rm -rf sccache
+ tar -xjf sccache.tar.bz2
program finished with exit code 0
elapsedTime=3.343323
========= Finished 'sh /builds/slave/m-in-linux32_g-000000000000000/tools/scripts/tooltool/tooltool_wrapper.sh ...' (results: 0, elapsed: 3 secs) (at 2014-11-04 05:08:31.348376) =========
========= Started compile failed (results: 2, elapsed: 4 secs) (at 2014-11-04 05:08:31.348765) =========
mock_mozilla -r mozilla-centos6-x86_64 --cwd /builds/slave/m-in-linux32_g-000000000000000/build --unpriv --shell '/usr/bin/env HG_SHARE_BASE_DIR="/builds/hg-shared" LOCALES_FILE="locales/languages_dev.json" TOOLTOOL_HOME="/builds" SYMBOL_SERVER_HOST="symbolpush.mozilla.org" CCACHE_DIR="/builds/ccache" POST_SYMBOL_UPLOAD_CMD="/usr/local/bin/post-symbol-upload.py" MOZ_AUTOMATION="1" MOZ_OBJDIR="obj-firefox" SYMBOL_SERVER_SSH_KEY="/home/cltbld/.ssh/ffxbld_rsa" LOCALE_BASEDIR="/builds/slave/m-in-linux32_g-000000000000000/build-gaia-l10n" TINDERBOX_OUTPUT="1" CCACHE_COMPRESS="1" TOOLTOOL_CACHE="/builds/tooltool_cache" SYMBOL_SERVER_PATH="/mnt/netapp/breakpad/symbols_ffx/" PATH="/tools/python27-mercurial/bin:/tools/python27/bin:${PATH}:/tools/buildbot/bin" MOZ_CRASHREPORTER_NO_REPORT="1" SYMBOL_SERVER_USER="ffxbld" WGET_OPTS="-q -c" LC_ALL="C" CCACHE_UMASK="002" make -f client.mk build '"'"'MOZ_BUILD_DATE=20141104050144'"'"''
in dir /builds/slave/m-in-linux32_g-000000000000000/build (timeout 10800 secs) (maxTime 19800 secs)
watching logfiles {}
argv: ['mock_mozilla', '-r', 'mozilla-centos6-x86_64', '--cwd', '/builds/slave/m-in-linux32_g-000000000000000/build', '--unpriv', '--shell', u'/usr/bin/env HG_SHARE_BASE_DIR="/builds/hg-shared" LOCALES_FILE="locales/languages_dev.json" TOOLTOOL_HOME="/builds" SYMBOL_SERVER_HOST="symbolpush.mozilla.org" CCACHE_DIR="/builds/ccache" POST_SYMBOL_UPLOAD_CMD="/usr/local/bin/post-symbol-upload.py" MOZ_AUTOMATION="1" MOZ_OBJDIR="obj-firefox" SYMBOL_SERVER_SSH_KEY="/home/cltbld/.ssh/ffxbld_rsa" LOCALE_BASEDIR="/builds/slave/m-in-linux32_g-000000000000000/build-gaia-l10n" TINDERBOX_OUTPUT="1" CCACHE_COMPRESS="1" TOOLTOOL_CACHE="/builds/tooltool_cache" SYMBOL_SERVER_PATH="/mnt/netapp/breakpad/symbols_ffx/" PATH="/tools/python27-mercurial/bin:/tools/python27/bin:${PATH}:/tools/buildbot/bin" MOZ_CRASHREPORTER_NO_REPORT="1" SYMBOL_SERVER_USER="ffxbld" WGET_OPTS="-q -c" LC_ALL="C" CCACHE_UMASK="002" make -f client.mk build \'MOZ_BUILD_DATE=20141104050144\'']
environment:
CCACHE_COMPRESS=1
CCACHE_DIR=/builds/ccache
CCACHE_HASHDIR=
CCACHE_UMASK=002
CVS_RSH=ssh
G_BROKEN_FILENAMES=1
HG_SHARE_BASE_DIR=/builds/hg-shared
HISTCONTROL=ignoredups
HISTSIZE=1000
HOME=/home/cltbld
HOSTNAME=bld-linux64-spot-008.build.releng.use1.mozilla.com
LANG=en_US.UTF-8
LC_ALL=C
LESSOPEN=|/usr/bin/lesspipe.sh %s
LOCALES_FILE=locales/languages_dev.json
LOCALE_BASEDIR=/builds/slave/m-in-linux32_g-000000000000000/build-gaia-l10n
LOGNAME=cltbld
MAIL=/var/spool/mail/cltbld
MOZ_AUTOMATION=1
MOZ_CRASHREPORTER_NO_REPORT=1
MOZ_OBJDIR=obj-firefox
PATH=/tools/python27-mercurial/bin:/tools/python27/bin:/usr/local/bin:/usr/lib64/ccache:/usr/local/bin:/bin:/usr/bin:/usr/local/sbin:/usr/sbin:/sbin:/home/cltbld/bin:/tools/buildbot/bin
POST_SYMBOL_UPLOAD_CMD=/usr/local/bin/post-symbol-upload.py
PWD=/builds/slave/m-in-linux32_g-000000000000000/build
SHELL=/bin/bash
SHLVL=1
SYMBOL_SERVER_HOST=symbolpush.mozilla.org
SYMBOL_SERVER_PATH=/mnt/netapp/breakpad/symbols_ffx/
SYMBOL_SERVER_SSH_KEY=/home/cltbld/.ssh/ffxbld_rsa
SYMBOL_SERVER_USER=ffxbld
TERM=linux
TINDERBOX_OUTPUT=1
TMOUT=86400
TOOLTOOL_CACHE=/builds/tooltool_cache
TOOLTOOL_HOME=/builds
USER=cltbld
WGET_OPTS=-q -c
_=/tools/buildbot/bin/python
using PTY: False
INFO: mock_mozilla.py version 1.0.3 starting...
State Changed: init plugins
INFO: selinux disabled
State Changed: start
State Changed: lock buildroot
State Changed: shell
( echo 'export MOZ_AUTOMATION_BUILD_SYMBOLS=1'; echo 'export MOZ_AUTOMATION_L10N_CHECK=1'; echo 'export MOZ_AUTOMATION_PACKAGE=1'; echo 'export MOZ_AUTOMATION_PACKAGE_TESTS=1'; echo 'export MOZ_AUTOMATION_INSTALLER=0'; echo 'export MOZ_AUTOMATION_UPDATE_PACKAGING=0'; echo 'export MOZ_AUTOMATION_UPLOAD=1'; echo 'export MOZ_AUTOMATION_UPLOAD_SYMBOLS=0'; echo 'export MOZ_AUTOMATION_BUILD_SYMBOLS=1'; echo 'export MOZ_AUTOMATION_L10N_CHECK=1'; echo 'export MOZ_AUTOMATION_PACKAGE=1'; echo 'export MOZ_AUTOMATION_PACKAGE_TESTS=1'; echo 'export MOZ_AUTOMATION_INSTALLER=0'; echo 'export MOZ_AUTOMATION_UPDATE_PACKAGING=0'; echo 'export MOZ_AUTOMATION_UPLOAD=1'; echo 'export MOZ_AUTOMATION_UPLOAD_SYMBOLS=0'; echo 'export SCCACHE_BUCKET=mozilla-releng-s3-cache-us-east-1-prod'; echo 'export SCCACHE_NAMESERVER=169.254.169.253'; echo 'export UPLOAD_EXTRA_FILES+=sccache.log.gz'; ) > /builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox/.mozconfig.mk
make -f /builds/slave/m-in-linux32_g-000000000000000/build/client.mk realbuild CREATE_MOZCONFIG_JSON=
Adding client.mk options from /builds/slave/m-in-linux32_g-000000000000000/build/.mozconfig:
AUTOCLOBBER=1
export MOZ_AUTOMATION_BUILD_SYMBOLS=1
export MOZ_AUTOMATION_L10N_CHECK=1
export MOZ_AUTOMATION_PACKAGE=1
export MOZ_AUTOMATION_PACKAGE_TESTS=1
export MOZ_AUTOMATION_INSTALLER=0
export MOZ_AUTOMATION_UPDATE_PACKAGING=0
export MOZ_AUTOMATION_UPLOAD=1
export MOZ_AUTOMATION_UPLOAD_SYMBOLS=0
AUTOCLOBBER=1
export MOZ_AUTOMATION_BUILD_SYMBOLS=1
export MOZ_AUTOMATION_L10N_CHECK=1
export MOZ_AUTOMATION_PACKAGE=1
export MOZ_AUTOMATION_PACKAGE_TESTS=1
export MOZ_AUTOMATION_INSTALLER=0
export MOZ_AUTOMATION_UPDATE_PACKAGING=0
export MOZ_AUTOMATION_UPLOAD=1
export MOZ_AUTOMATION_UPLOAD_SYMBOLS=0
CONFIG_GUESS=i686-pc-linux
export SCCACHE_BUCKET=mozilla-releng-s3-cache-us-east-1-prod
export SCCACHE_NAMESERVER=169.254.169.253
MOZ_PREFLIGHT_ALL+=build/sccache.mk
MOZ_POSTFLIGHT_ALL+=build/sccache.mk
export UPLOAD_EXTRA_FILES+=sccache.log.gz
MOZ_OBJDIR=/builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox
OBJDIR=/builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox
FOUND_MOZCONFIG=/builds/slave/m-in-linux32_g-000000000000000/build/.mozconfig
make[1]: Entering directory `/builds/slave/m-in-linux32_g-000000000000000/build'
set -e; \
for mkfile in build/sccache.mk; do \
make -f /builds/slave/m-in-linux32_g-000000000000000/build/$mkfile preflight_all TOPSRCDIR=/builds/slave/m-in-linux32_g-000000000000000/build OBJDIR=/builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox MOZ_OBJDIR=/builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox; \
done
make[2]: Entering directory `/builds/slave/m-in-linux32_g-000000000000000/build'
# Terminate any sccache server that might still be around
python2.7 /builds/slave/m-in-linux32_g-000000000000000/build/sccache/sccache.py > /dev/null 2>&1
make[2]: Leaving directory `/builds/slave/m-in-linux32_g-000000000000000/build'
Generating /builds/slave/m-in-linux32_g-000000000000000/build/configure using autoconf
cd /builds/slave/m-in-linux32_g-000000000000000/build; /usr/bin/autoconf-2.13
Generating /builds/slave/m-in-linux32_g-000000000000000/build/js/src/configure using autoconf
cd /builds/slave/m-in-linux32_g-000000000000000/build/js/src; /usr/bin/autoconf-2.13
make[2]: Entering directory `/builds/slave/m-in-linux32_g-000000000000000/build'
cp /builds/slave/m-in-linux32_g-000000000000000/build/.mozconfig /builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox/.mozconfig
cd /builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox
/builds/slave/m-in-linux32_g-000000000000000/build/configure
Adding configure options from /builds/slave/m-in-linux32_g-000000000000000/build/.mozconfig
--enable-crashreporter
--enable-release
--enable-crashreporter
--enable-release
--enable-elf-hack
--enable-stdcxx-compat
--target=i686-pc-linux
--host=i686-pc-linux
--x-libraries=/usr/lib
--enable-update-channel=
--enable-update-packaging
--enable-signmar
--with-compiler-wrapper=python2.7 /builds/slave/m-in-linux32_g-000000000000000/build/sccache/sccache.py
--enable-application=b2g
--disable-elf-hack
loading cache ./config.cache
checking host system type... i686-pc-linux-gnu
checking target system type... i686-pc-linux-gnu
checking build system type... i686-pc-linux-gnu
checking for gawk... (cached) gawk
checking for python2.7... (cached) /tools/python27/bin/python2.7
Creating Python environment
checking Python environment is Mozilla virtualenv... /builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox/_virtualenv/bin/python: error while loading shared libraries: libpython2.7.so.1.0: wrong ELF class: ELFCLASS64
configure: error: Python environment does not appear to be sane.
------ config.log ------
This file contains any messages produced by compilers while
running configure, to aid debugging if configure makes a mistake.
configure:1185: checking host system type
configure:1206: checking target system type
configure:1224: checking build system type
configure:1300: checking for gawk
configure:1385: checking for python2.7
configure:1495: checking Python environment is Mozilla virtualenv
configure: error: Python environment does not appear to be sane.
*** Fix above errors and then restart with\
"make -f client.mk build"
make[2]: *** [configure] Error 1
make[2]: Leaving directory `/builds/slave/m-in-linux32_g-000000000000000/build'
make[1]: *** [/builds/slave/m-in-linux32_g-000000000000000/build/obj-firefox/config.status] Error 2
make[1]: Leaving directory `/builds/slave/m-in-linux32_g-000000000000000/build'
make: *** [build] Error 2
State Changed: unlock buildroot
program finished with exit code 2
elapsedTime=4.701965
========= Finished compile failed (results: 2, elapsed: 4 secs) (at 2014-11-04 05:08:36.072368) =========
========= Skipped (results: not started, elapsed: not started) =========
This error appears to be about a python 32 bit interpreter trying to use a python 64 bit library - I think this is likely to be fall out from this bug, so will roll back, and reconfig.
In addition, this bug got picked up in a reconfig, but bugzilla API failed to update this bug to say so - have raised bug 1093600 about this.
also that this hit in https://treeherder.mozilla.org/ui/#/jobs?repo=mozilla-inbound&revision=1dd40ce6fc5a only the B2g Linux Builds opt and debug , Builds like Linux opt are ok
Reconfig in progress
Attachment #8514729 - Flags: checked-in-
pmoore was wondering if this just needed a clobber instead. That looks likely given that it's the objdir/_virtualenv/python that's failing, since it copies the system python into the objdir when setting up the virtualenv. I doubt it knows to copy the new binary when the system python changes.
(In reply to Michael Shal [:mshal] from comment #16)
> pmoore was wondering if this just needed a clobber instead. That looks
> likely given that it's the objdir/_virtualenv/python that's failing, since
> it copies the system python into the objdir when setting up the virtualenv.
> I doubt it knows to copy the new binary when the system python changes.
In fairness, I was just stealing nthomas's idea in comment 8 =)
So to summarize - I backed this out, reconfig'd, and then Tomcat clobbered, and all is ok again.
The fact Tomcat needed to clobber after the backout also suggests that a clobber was probably necessary. Therefore, it might be worth landing this change again, and then coordinating a clobber with a reconfig, to see if that fixes everything.
Indeed, this looks very much like it needs a clobber of the 32-bits b2g builders. Relanded.
https://hg.mozilla.org/build/buildbot-configs/rev/d029e3d04215
Attachment #8514729 - Flags: checked-in- → checked-in+
Reconfiging now... We will clobber after reconfig completes.
Tomcat has clobbered
Blocks: 1075183
Status: ASSIGNED → RESOLVED
Closed: 8 years ago
Resolution: --- → FIXED
Blocks: 1119997
Component: General Automation → General
You need to log in before you can comment on or make changes to this bug.
|
{
"url": "https://bugzilla.mozilla.org/show_bug.cgi?id=947462",
"source_domain": "bugzilla.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "142395",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TPBW4T77YBRMNEYOGWIRE6Y5KFEG2WJP",
"WARC-Concurrent-To": "<urn:uuid:813346ae-d409-4c43-bd2e-9cd45e32919e>",
"WARC-Date": "2022-09-30T01:27:29Z",
"WARC-IP-Address": "35.166.43.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OMVTDVJS2EIH6O6LYDFLKQ4BRRS4FZOQ",
"WARC-Record-ID": "<urn:uuid:dc8f8fcf-daba-4757-8003-ade32ea253f8>",
"WARC-Target-URI": "https://bugzilla.mozilla.org/show_bug.cgi?id=947462",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9e4e7ab-5341-476e-bdf2-e87d267d52aa>"
},
"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-120\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,
56,
57,
146,
147,
158,
159,
200,
201,
208,
214,
221,
229,
236,
237,
246,
247,
261,
262,
277,
278,
285,
286,
327,
328,
339,
340,
348,
349,
361,
362,
389,
390,
526,
719,
720,
793,
839,
869,
892,
948,
1006,
1007,
1037,
1139,
1140,
1159,
1235,
1320,
1400,
1595,
1596,
1785,
1786,
1826,
1930,
2038,
2152,
2208,
2245,
2291,
2342,
2398,
2456,
2457,
2480,
2626,
2770,
2882,
2959,
3172,
3201,
3257,
3288,
3482,
3528,
3579,
3635,
3693,
3694,
3775,
3831,
3889,
3890,
3927,
3970,
4017,
4070,
4071,
4138,
4194,
4225,
4317,
4318,
4319,
4320,
4376,
4388,
4725,
4945,
4967,
5000,
5016,
5033,
5060,
5094,
5115,
5303,
5408,
6342,
6442,
6463,
7421,
7434,
7452,
7478,
7494,
7511,
7523,
7544,
7580,
7603,
7617,
7635,
7695,
7712,
7721,
7755,
7795,
7871,
7886,
7914,
7931,
7961,
7984,
8170,
8230,
8285,
8301,
8309,
8351,
8404,
8455,
8481,
8492,
8511,
8523,
8561,
8583,
8595,
8611,
8640,
8657,
8705,
8733,
8756,
8777,
8807,
8828,
9784,
9886,
9979,
9993,
10031,
10066,
10098,
10136,
10170,
10211,
10242,
10281,
10295,
10333,
10368,
10400,
10438,
10472,
10513,
10544,
10583,
10610,
10671,
10713,
10749,
10786,
10828,
10902,
10972,
11050,
11131,
11141,
11178,
11467,
11472,
11553,
11611,
11708,
11788,
11875,
11953,
12047,
12132,
12213,
12352,
12418,
12479,
12571,
12594,
12611,
12634,
12651,
12669,
12692,
12715,
12736,
12759,
12784,
12810,
12827,
12931,
12956,
12975,
13004,
13051,
13100,
13148,
13183,
13248,
13276,
13503,
13568,
13593,
13653,
13719,
13761,
13805,
13848,
13882,
13921,
13987,
14052,
14096,
14122,
14155,
14235,
14335,
14415,
14441,
14473,
14507,
14528,
14634,
14707,
14892,
14893,
15035,
15212,
15233,
15274,
15568,
15621,
15694,
15771,
15849,
15923,
15924,
15988,
16085,
16086,
16329,
16421,
16422,
16485,
16540,
16601,
16622,
16638,
16666,
16686,
16710,
16726,
16766
],
"line_end_idx": [
56,
57,
146,
147,
158,
159,
200,
201,
208,
214,
221,
229,
236,
237,
246,
247,
261,
262,
277,
278,
285,
286,
327,
328,
339,
340,
348,
349,
361,
362,
389,
390,
526,
719,
720,
793,
839,
869,
892,
948,
1006,
1007,
1037,
1139,
1140,
1159,
1235,
1320,
1400,
1595,
1596,
1785,
1786,
1826,
1930,
2038,
2152,
2208,
2245,
2291,
2342,
2398,
2456,
2457,
2480,
2626,
2770,
2882,
2959,
3172,
3201,
3257,
3288,
3482,
3528,
3579,
3635,
3693,
3694,
3775,
3831,
3889,
3890,
3927,
3970,
4017,
4070,
4071,
4138,
4194,
4225,
4317,
4318,
4319,
4320,
4376,
4388,
4725,
4945,
4967,
5000,
5016,
5033,
5060,
5094,
5115,
5303,
5408,
6342,
6442,
6463,
7421,
7434,
7452,
7478,
7494,
7511,
7523,
7544,
7580,
7603,
7617,
7635,
7695,
7712,
7721,
7755,
7795,
7871,
7886,
7914,
7931,
7961,
7984,
8170,
8230,
8285,
8301,
8309,
8351,
8404,
8455,
8481,
8492,
8511,
8523,
8561,
8583,
8595,
8611,
8640,
8657,
8705,
8733,
8756,
8777,
8807,
8828,
9784,
9886,
9979,
9993,
10031,
10066,
10098,
10136,
10170,
10211,
10242,
10281,
10295,
10333,
10368,
10400,
10438,
10472,
10513,
10544,
10583,
10610,
10671,
10713,
10749,
10786,
10828,
10902,
10972,
11050,
11131,
11141,
11178,
11467,
11472,
11553,
11611,
11708,
11788,
11875,
11953,
12047,
12132,
12213,
12352,
12418,
12479,
12571,
12594,
12611,
12634,
12651,
12669,
12692,
12715,
12736,
12759,
12784,
12810,
12827,
12931,
12956,
12975,
13004,
13051,
13100,
13148,
13183,
13248,
13276,
13503,
13568,
13593,
13653,
13719,
13761,
13805,
13848,
13882,
13921,
13987,
14052,
14096,
14122,
14155,
14235,
14335,
14415,
14441,
14473,
14507,
14528,
14634,
14707,
14892,
14893,
15035,
15212,
15233,
15274,
15568,
15621,
15694,
15771,
15849,
15923,
15924,
15988,
16085,
16086,
16329,
16421,
16422,
16485,
16540,
16601,
16622,
16638,
16666,
16686,
16710,
16726,
16766,
16839
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16839,
"ccnet_original_nlines": 281,
"rps_doc_curly_bracket": 0.00047508999705314636,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12077789008617401,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04119753837585449,
"rps_doc_frac_lines_end_with_ellipsis": 0.017730500549077988,
"rps_doc_frac_no_alph_words": 0.4682702124118805,
"rps_doc_frac_unique_words": 0.42201167345046997,
"rps_doc_mean_word_length": 9.526239395141602,
"rps_doc_num_sentences": 218,
"rps_doc_symbol_to_word_ratio": 0.007420680020004511,
"rps_doc_unigram_entropy": 5.928250312805176,
"rps_doc_word_count": 1372,
"rps_doc_frac_chars_dupe_10grams": 0.2440703958272934,
"rps_doc_frac_chars_dupe_5grams": 0.3070390224456787,
"rps_doc_frac_chars_dupe_6grams": 0.2980107069015503,
"rps_doc_frac_chars_dupe_7grams": 0.2912777364253998,
"rps_doc_frac_chars_dupe_8grams": 0.2728385627269745,
"rps_doc_frac_chars_dupe_9grams": 0.2728385627269745,
"rps_doc_frac_chars_top_2gram": 0.01453710999339819,
"rps_doc_frac_chars_top_3gram": 0.005814840085804462,
"rps_doc_frac_chars_top_4gram": 0.006120889913290739,
"rps_doc_books_importance": -1729.5540771484375,
"rps_doc_books_importance_length_correction": -1729.5540771484375,
"rps_doc_openwebtext_importance": -1038.8001708984375,
"rps_doc_openwebtext_importance_length_correction": -1038.8001708984375,
"rps_doc_wikipedia_importance": -897.8200073242188,
"rps_doc_wikipedia_importance_length_correction": -897.8200073242188
},
"fasttext": {
"dclm": 0.03575688973069191,
"english": 0.48045068979263306,
"fineweb_edu_approx": 1.5491187572479248,
"eai_general_math": 0.15767550468444824,
"eai_open_web_math": 0.11469250917434692,
"eai_web_code": 0.37683069705963135
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,219,712,645,495,564,000 |
qemu-devel
[Top][All Lists]
Advanced
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Qemu-devel] [PATCH 2/4] docs: Fix an inaccuracy due to recent chang
From: Eric Blake
Subject: Re: [Qemu-devel] [PATCH 2/4] docs: Fix an inaccuracy due to recent changes
Date: Tue, 24 Jul 2018 10:20:34 -0500
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:52.0) Gecko/20100101 Thunderbird/52.8.0
On 07/24/2018 07:17 AM, Leonid Bloch wrote:
Signed-off-by: Leonid Bloch <address@hidden>
---
docs/qcow2-cache.txt | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/docs/qcow2-cache.txt b/docs/qcow2-cache.txt
index 8a09a5cc5f..a0a1267482 100644
--- a/docs/qcow2-cache.txt
+++ b/docs/qcow2-cache.txt
@@ -97,9 +97,9 @@ need:
l2_cache_size = disk_size_GB * 131072
refcount_cache_size = disk_size_GB * 32768
-QEMU has a default L2 cache of 1MB (1048576 bytes) and a refcount
-cache of 256KB (262144 bytes), so using the formulas we've just seen
-we have
+QEMU has a default L2 cache of 1MB (1048576 bytes) or 8 clusters (whichever
+is larger) and a refcount cache of 256KB (262144 bytes), so using the
Looks suspicious; isn't the refcount cache size also dependent on the cluster size?
+formulas we've just seen we have (assuming the L2 cache is 1MB):
1048576 / 131072 = 8 GB of virtual disk covered by that cache
262144 / 32768 = 8 GB
--
Eric Blake, Principal Software Engineer
Red Hat, Inc. +1-919-301-3266
Virtualization: qemu.org | libvirt.org
reply via email to
[Prev in Thread] Current Thread [Next in Thread]
|
{
"url": "https://lists.gnu.org/archive/html/qemu-devel/2018-07/msg04709.html",
"source_domain": "lists.gnu.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "9022",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7L2SP4AJODMYE5F73MAWSKE7QZ4ENNSA",
"WARC-Concurrent-To": "<urn:uuid:af8134f2-ca76-4c78-972a-928930a5d91a>",
"WARC-Date": "2020-04-05T21:06:15Z",
"WARC-IP-Address": "209.51.188.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K7XUCQWX5SBSIL6RVGNGTZETMNXDXRXY",
"WARC-Record-ID": "<urn:uuid:28379334-fdda-4dba-b845-d5c325979b63>",
"WARC-Target-URI": "https://lists.gnu.org/archive/html/qemu-devel/2018-07/msg04709.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e0054142-eab5-459e-990b-2d42fffeb2fd>"
},
"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-154.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
28,
37,
38,
113,
114,
187,
188,
189,
206,
290,
328,
415,
416,
460,
505,
509,
543,
593,
594,
651,
687,
714,
741,
765,
808,
856,
923,
993,
1002,
1079,
1150,
1151,
1235,
1236,
1302,
1364,
1393,
1394,
1395,
1398,
1438,
1478,
1518,
1519,
1520,
1521,
1540,
1541
],
"line_end_idx": [
11,
28,
37,
38,
113,
114,
187,
188,
189,
206,
290,
328,
415,
416,
460,
505,
509,
543,
593,
594,
651,
687,
714,
741,
765,
808,
856,
923,
993,
1002,
1079,
1150,
1151,
1235,
1236,
1302,
1364,
1393,
1394,
1395,
1398,
1438,
1478,
1518,
1519,
1520,
1521,
1540,
1541,
1589
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1589,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13658536970615387,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039024390280246735,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46585366129875183,
"rps_doc_frac_unique_words": 0.6238095164299011,
"rps_doc_mean_word_length": 5.409523963928223,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.738393306732178,
"rps_doc_word_count": 210,
"rps_doc_frac_chars_dupe_10grams": 0.23239436745643616,
"rps_doc_frac_chars_dupe_5grams": 0.27816900610923767,
"rps_doc_frac_chars_dupe_6grams": 0.27816900610923767,
"rps_doc_frac_chars_dupe_7grams": 0.23239436745643616,
"rps_doc_frac_chars_dupe_8grams": 0.23239436745643616,
"rps_doc_frac_chars_dupe_9grams": 0.23239436745643616,
"rps_doc_frac_chars_top_2gram": 0.024647889658808708,
"rps_doc_frac_chars_top_3gram": 0.02816900983452797,
"rps_doc_frac_chars_top_4gram": 0.03169013932347298,
"rps_doc_books_importance": -127.40730285644531,
"rps_doc_books_importance_length_correction": -113.98400115966797,
"rps_doc_openwebtext_importance": -65.77102661132812,
"rps_doc_openwebtext_importance_length_correction": -65.77102661132812,
"rps_doc_wikipedia_importance": -52.128395080566406,
"rps_doc_wikipedia_importance_length_correction": -38.34723663330078
},
"fasttext": {
"dclm": 0.04456036910414696,
"english": 0.7065727114677429,
"fineweb_edu_approx": 1.1058859825134277,
"eai_general_math": 0.003982420079410076,
"eai_open_web_math": 0.8994453549385071,
"eai_web_code": 0.000029799999538226984
}
}
|
{
"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": "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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "5",
"label": "Indeterminate"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,199,178,255,773,207,000 |
Catch up on stories from the past week (and beyond) at the Slashdot story archive
Forgot your password?
typodupeerror
DEAL: For $25 - Add A Second Phone Number To Your Smartphone for life! Use promo code SLASHDOT25. Also, Slashdot's Facebook page has a chat bot now. Message it for stories and more. Check out the new SourceForge HTML5 internet speed test! ×
Comment Re:Not so hot for hi def content (Score 1) 488
Yes, I've regularly upgraded VLC, primarily because I prefer its user interface and appearance (and I keep hoping that the codec business will change).
Now, I'm referring to Media Player Classic, not Windows Media Player - I agree that Media Player is no good.
I use a 1.6GHz C2D to play my high def content. VLC, unfortunately, cannot play 1080P without dropping frames, but Media Player Classic with CoreAVC Pro works very well. I'm sure that with a faster processor and a more powerful video card I could get VLC to do the job, but as a card carrying cheapskate, I'll stick with what I've got.
Comment Not so hot for hi def content (Score 3, Insightful) 488
VLC has been a non-starter for me because I can't use better performing codecs for high definition content. The internal codec doesn't approach the performance of several other codecs. I'm sticking with Media Player Classic for my XP system. It's a much better player.
By the way, does anybody else feel like the story's headline looks like it came straight from Digg?
Comment Re:Oh well (Score 5, Insightful) 348
See, back in the day, /. used to come up with one really good original April Fool's joke. It was like they crafted it over the course of a month or two, then popped it on an unsuspecting crowd. It was elegant, it was funny and it suckered lots and lots of people.
That evolved into the new philosophy of the past few years which is "if one really good joke was great, how about a bunch of really lame ones?" It's quantity over quality which, I guess, is what we want now.
I miss the old /.
Comment Dysfunctional Father (Score 1) 260
History calls him the father of the hydrogen bomb, but it ought to call Stansilaw Ulam the stepfather. Teller was the whiny "my way or the highway" guy who wouldn't believe everybody else when his design was shown to be fatally flawed. Without Ulam, who knows what would have happened. Anyway, after Teller was pushed out for being a chronic a-hole, Ulam got the job done, for better or for worse.
Oh, and don't forget what Teller did to Oppenheimer. Man, talk about some egos at work...
Just a sidenote to history, of course. Richard Rhodes has written two very good books about the fission and fusion bombs.
Comment Re:Your freedom stops when you hit my nose (Score 1) 528
And since the information is from one source (the aggrieved party), I'm gonna be a little skeptical that the whole story is on the table.
Besides, it's not like they're trampling on the Constitution! (Yeah, yeah, but this isn't the same.)
Sure as sunrise, this is gonna shoot right over somebody's head.
Comment Re:Thank you Sun (Score 1) 221
I agree. Anyway, it's been quite a while since market capitalization has been a good comparison of companies, particularly in the tech sector and especially with the current chaotic market. I guess that market cap is good for bragging rights, you know, "Ha, ha, we're bigger than you," otherwise, it's a minor component of many others that we use to compare companies.
Slashdot Top Deals
Veni, Vidi, VISA: I came, I saw, I did a little shopping.
Working...
|
{
"url": "https://slashdot.org/~HardCase/firehose",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "103179",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F6ALAFCMKLTR4U5EDOYM2TMSORK7N4T7",
"WARC-Concurrent-To": "<urn:uuid:7aaad4a1-1a37-443e-b3ad-b675812ad034>",
"WARC-Date": "2017-03-25T08:48:42Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3KXI5JPMILYE7D6KQIZYKXYS7CJQO3GV",
"WARC-Record-ID": "<urn:uuid:2100ee5a-59b8-43f5-8273-6b1947c8669f>",
"WARC-Target-URI": "https://slashdot.org/~HardCase/firehose",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d13d12ce-0db9-414e-9f13-e85bb3ddaedf>"
},
"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,
82,
83,
85,
86,
87,
88,
110,
124,
365,
366,
421,
422,
574,
575,
684,
685,
1021,
1022,
1086,
1087,
1356,
1357,
1457,
1458,
1503,
1504,
1768,
1769,
1977,
1978,
1996,
1997,
2040,
2041,
2439,
2440,
2530,
2531,
2653,
2654,
2719,
2720,
2858,
2859,
2960,
2961,
3026,
3027,
3066,
3067,
3436,
3437,
3456,
3457,
3515,
3516
],
"line_end_idx": [
82,
83,
85,
86,
87,
88,
110,
124,
365,
366,
421,
422,
574,
575,
684,
685,
1021,
1022,
1086,
1087,
1356,
1357,
1457,
1458,
1503,
1504,
1768,
1769,
1977,
1978,
1996,
1997,
2040,
2041,
2439,
2440,
2530,
2531,
2653,
2654,
2719,
2720,
2858,
2859,
2960,
2961,
3026,
3027,
3066,
3067,
3436,
3437,
3456,
3457,
3515,
3516,
3526
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3526,
"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.3997461795806885,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04060913994908333,
"rps_doc_frac_lines_end_with_ellipsis": 0.035087719559669495,
"rps_doc_frac_no_alph_words": 0.19796954095363617,
"rps_doc_frac_unique_words": 0.554295003414154,
"rps_doc_mean_word_length": 4.414910793304443,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0025380700826644897,
"rps_doc_unigram_entropy": 5.44663143157959,
"rps_doc_word_count": 617,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.018355360254645348,
"rps_doc_frac_chars_dupe_6grams": 0.018355360254645348,
"rps_doc_frac_chars_dupe_7grams": 0.018355360254645348,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020190900191664696,
"rps_doc_frac_chars_top_3gram": 0.019823789596557617,
"rps_doc_frac_chars_top_4gram": 0.007342140190303326,
"rps_doc_books_importance": -355.6015625,
"rps_doc_books_importance_length_correction": -355.6015625,
"rps_doc_openwebtext_importance": -190.21595764160156,
"rps_doc_openwebtext_importance_length_correction": -190.21595764160156,
"rps_doc_wikipedia_importance": -121.42767333984375,
"rps_doc_wikipedia_importance_length_correction": -121.42767333984375
},
"fasttext": {
"dclm": 0.03171921148896217,
"english": 0.963081419467926,
"fineweb_edu_approx": 0.9587176442146301,
"eai_general_math": 0.013238189741969109,
"eai_open_web_math": 0.13289374113082886,
"eai_web_code": 0.0029349299147725105
}
}
|
{
"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": "338.024",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,650,374,337,691,858,000 |
OpenSSH name resolving problems
Gil Disatnik Jewnix at technohac.com
Thu Oct 11 07:44:39 EST 2001
Hello there.
I've noticed a strange problem happen in ALL my linux machines (some of
them still running OpenSSH 2.9p1 (The one that comes with Slack8) and some
of them are running 2.9.9p2 (That I have compiled myself).
When I am having a certain host in my /etc/hosts, for example:
192.168.1.12 netinst
When I am running ssh netinst -v -v -v
the last line I could see is: ssh_connect: getuid 0 geteuid 0 anon 1
The next line is telling me that it is connecting to netinst which resolves
to 192.168.1.12
The problem is that it has a 20 second delay until it really start
connecting... when using an ip address instead of a hostname I'll have my
connection running in no time.
/etc/nsswitch.conf showed me that files are before dns, nevertheless - I
REMOVED dns from the conf file - and it worked great. Of course I can't let
my machine to run without a dns (Oh... almost forgot about it... the
machine is internetless and dnsless most of the time, that's why it waits
for a dead dns, still the /etc/nsswitch should solve that once I am telling
it to search files before dns...)
Anyways - Looks like a bug to me unless you could state otherwise (Hey, I
am not criticizing you, just stating that it looks like a bug :))
Thanks.
P.S - I am still waiting for any answer regarding my previous question
about the fact that I can't exit from a shell when I have background
jobs... It is really important... please help me here...
Regards
Gil Disatnik
UNIX system/security administrator at netish inc.
www.netish.com
GibsonLP at EFnet
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
"Windows NT has detected mouse movement, you MUST restart
your computer before the new settings will take effect, [ OK ]"
--------------------------------------------------------------------
Windows is a 32 bit patch to a 16 bit GUI based on a 8 bit operating
system, written for a 4 bit processor by a 2 bit company which can
not stand 1 bit of competition.
-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-
More information about the openssh-unix-dev mailing list
|
{
"url": "http://lists.mindrot.org/pipermail/openssh-unix-dev/2001-October/008505.html",
"source_domain": "lists.mindrot.org",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "4523",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ED6GOGCCDSBL2LYVNK3U27YD446O25Q5",
"WARC-Concurrent-To": "<urn:uuid:818b4a8e-7617-46f7-ae60-74b4dbe216ee>",
"WARC-Date": "2024-04-13T12:12:41Z",
"WARC-IP-Address": "130.102.96.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4HK4PIZ5CJFDOTOFTNEXXAYYXSH443RC",
"WARC-Record-ID": "<urn:uuid:5c0a963b-a149-4778-89a7-eba8ab156738>",
"WARC-Target-URI": "http://lists.mindrot.org/pipermail/openssh-unix-dev/2001-October/008505.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef56a62c-8fc6-433c-877c-1e26ad609303>"
},
"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-122\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,
32,
33,
70,
99,
100,
101,
114,
187,
263,
322,
385,
386,
410,
411,
450,
519,
596,
612,
613,
681,
756,
787,
788,
862,
939,
1009,
1084,
1161,
1195,
1270,
1336,
1337,
1345,
1346,
1418,
1488,
1545,
1546,
1547,
1555,
1556,
1569,
1619,
1634,
1635,
1653,
1721,
1779,
1843,
1912,
1981,
2048,
2080,
2148,
2149,
2150,
2151,
2152
],
"line_end_idx": [
32,
33,
70,
99,
100,
101,
114,
187,
263,
322,
385,
386,
410,
411,
450,
519,
596,
612,
613,
681,
756,
787,
788,
862,
939,
1009,
1084,
1161,
1195,
1270,
1336,
1337,
1345,
1346,
1418,
1488,
1545,
1546,
1547,
1555,
1556,
1569,
1619,
1634,
1635,
1653,
1721,
1779,
1843,
1912,
1981,
2048,
2080,
2148,
2149,
2150,
2151,
2152,
2208
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2208,
"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.3041236996650696,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03951890021562576,
"rps_doc_frac_lines_end_with_ellipsis": 0.01694915071129799,
"rps_doc_frac_no_alph_words": 0.4020618498325348,
"rps_doc_frac_unique_words": 0.5965417623519897,
"rps_doc_mean_word_length": 4.391931056976318,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.012027489952743053,
"rps_doc_unigram_entropy": 5.0173516273498535,
"rps_doc_word_count": 347,
"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.009842519648373127,
"rps_doc_frac_chars_top_3gram": 0.013123360462486744,
"rps_doc_frac_chars_top_4gram": 0.01706036925315857,
"rps_doc_books_importance": -308.1951904296875,
"rps_doc_books_importance_length_correction": -308.1951904296875,
"rps_doc_openwebtext_importance": -165.19845581054688,
"rps_doc_openwebtext_importance_length_correction": -165.19845581054688,
"rps_doc_wikipedia_importance": -121.20731353759766,
"rps_doc_wikipedia_importance_length_correction": -121.20731353759766
},
"fasttext": {
"dclm": 0.02962416037917137,
"english": 0.8139793872833252,
"fineweb_edu_approx": 1.0244386196136475,
"eai_general_math": 0.5220507979393005,
"eai_open_web_math": 0.17681950330734253,
"eai_web_code": 0.42918819189071655
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "6",
"label": "Indeterminate"
}
},
"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
|
3,927,307,908,061,880,300 |
integration on Much Ado About IThttps://it.knightnet.org.uk/tags/integration/ Recent content about integration from Much Ado About IT | Ramblings and rantings from IT Architect & Designer, Julian KnightHugo | gohugo.io | Theme twenty-sixteenen-gbThis work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.Sun, 07 Jun 2020 14:15:52 +0000Open Source vs Proprietary in UK Central Government Organisationshttps://it.knightnet.org.uk/blog/open-source-vs-proprietary-in-uk-central-government-organisations/https://it.knightnet.org.uk/blog/open-source-vs-proprietary-in-uk-central-government-organisations/Mon, 20 Jun 2016 00:00:00 +0000https://it.knightnet.org.uk/blog/open-source-vs-proprietary-in-uk-central-government-organisations/
<p><em>NB: This article is incomplete - it was converted from a previous blog site. It is included as a draft.</em></p> <blockquote> <p>Open source does not necessarily mean that open integration and open data is facilitated</p> </blockquote> <p>The issue of open source vs proprietary applications for organisations related to the UK government comes up regularly. the UK’s Cabinet Office have issued clear guidance that open source is preferred and should always be considered when procuring new systems.</p> <p>However, this actually leads to confusion with many people then assuming that choosing proprietary applications will lead to trouble.</p> <p>The truth is rather more nuanced and it is worth thinking about. For me, the best approach is to deliver open data and open integration rather than focusing on open source per se.</p> <p>The following notes have been extracted from some internal documentation I did for our organisation. That is why is focuses on Microsoft. I am not advocating a specific vendor nor am I prioritising proprietary over open source. I am simply recommending a balanced and holistic view to get the best possible deal for the public purse.</p> <p> </p> <p>My view, and the view of quite a number of other people I’ve had the opportunity to talk to across government, is that the focus should be on <strong><em>open integration</em></strong> rather than necessarily open source. Using <strong><em>open source does not necessarily mean that open integration and open data is facilitated</em></strong>. Conversely, some proprietary vendors have made great strides in ensuring that systems can be integrated and data shared.</p> <p>At present, Microsoft, Google and Amazon all seem to “get” the issues of open integration and open data to one degree or another.</p> <p>Discussion in the open source debate tends to focus on license costs. OS is license free by definition; however, you will still pay for support. OS software is often also (much) harder to implement and support due to patchy documentation and many individuals contributing different code. <em>Not always true of course but there is certainly a degree of truth in this.</em></p> <p>In the case of something like the Microsoft platforms, the implementation and support costs of the core software (such as Office 365) have been driven down massively and the economies of scale we are bringing to bear through greater cross-government collaboration is improving that still further. At the same time, large license scales enable organisations to make use of additional funding that comes out of our EA agreements. This gives us access to additional planning, design and implementation services that all would have to be separately paid for with open source software. These all have a tendency to balance out the books.</p> <p>User and administrative training is the final element and again, proprietary vendors tend to provide more and better quality training/documentation resources than open source (again, in general). Proprietary software also has a tendency to have better developed user interfaces requiring less training. This further balances the cost equation.</p> <p>So while I fully support the need to evaluate OS vs proprietary software, we must do so holistically otherwise we will not get the expected benefits and there is plenty of evidence to support this view from the likes of Germany and Brazil both of whom have extensively switched to open source software.</p> <p>The bottom line is that Microsoft are often currently viewed as the best strategic partner we can have in areas of desktop operating systems, general office applications and general cloud computing facilities. They have already made good progress in opening a lot of previously proprietary code and supporting open interface standards & they currently see the health sector as one of their primary growth areas. We have made good use of this while continuing to keep an eye out for changes in their policies that will happen inevitably. The key things are to ensure that we have strategies for exiting Microsoft platforms should we need to in the future and that we continue to evaluate the value of our investment. We don’t do this blindly though. As a specific example, the use of Microsoft Dynamics Online, their cloud CRM, is relatively expensive. It is a good platform where a full CRM is required but it is expensive when only limited CRM tools are needed and we recommend other tools in those cases.</p>
Julian KnightEnterprisedesigngovernmentintegrationopen dataopen sourceplanningproprietarysoftware
|
{
"url": "https://it.knightnet.org.uk/tags/integration/feed.xml",
"source_domain": "it.knightnet.org.uk",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "8364",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LNFJQZZGVVAKZ3QTGCQRWSAZ27QAW5MV",
"WARC-Concurrent-To": "<urn:uuid:e82ef51d-3791-4c24-a4ad-b884df9091c1>",
"WARC-Date": "2022-06-27T08:41:31Z",
"WARC-IP-Address": "172.67.133.96",
"WARC-Identified-Payload-Type": "application/xml",
"WARC-Payload-Digest": "sha1:5A432KZVOOEOY5FS5WFSZCDCEBDONIHF",
"WARC-Record-ID": "<urn:uuid:a3d72f2f-3628-4c66-8afd-95b002439cb8>",
"WARC-Target-URI": "https://it.knightnet.org.uk/tags/integration/feed.xml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a8c3c61-60d2-41be-821f-a4c731928827>"
},
"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,
767,
5287
],
"line_end_idx": [
767,
5287,
5384
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5384,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37476980686187744,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017495399340987206,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20349907875061035,
"rps_doc_frac_unique_words": 0.503242552280426,
"rps_doc_mean_word_length": 5.643320560455322,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0009208099800162017,
"rps_doc_unigram_entropy": 5.420461654663086,
"rps_doc_word_count": 771,
"rps_doc_frac_chars_dupe_10grams": 0.02757987007498741,
"rps_doc_frac_chars_dupe_5grams": 0.03355550020933151,
"rps_doc_frac_chars_dupe_6grams": 0.02757987007498741,
"rps_doc_frac_chars_dupe_7grams": 0.02757987007498741,
"rps_doc_frac_chars_dupe_8grams": 0.02757987007498741,
"rps_doc_frac_chars_dupe_9grams": 0.02757987007498741,
"rps_doc_frac_chars_top_2gram": 0.020684899762272835,
"rps_doc_frac_chars_top_3gram": 0.012410939671099186,
"rps_doc_frac_chars_top_4gram": 0.015168930403888226,
"rps_doc_books_importance": -530.9619750976562,
"rps_doc_books_importance_length_correction": -530.9619750976562,
"rps_doc_openwebtext_importance": -341.4803161621094,
"rps_doc_openwebtext_importance_length_correction": -341.4803161621094,
"rps_doc_wikipedia_importance": -272.17645263671875,
"rps_doc_wikipedia_importance_length_correction": -272.17645263671875
},
"fasttext": {
"dclm": 0.025095760822296143,
"english": 0.9280544519424438,
"fineweb_edu_approx": 1.6479698419570923,
"eai_general_math": 0.35658150911331177,
"eai_open_web_math": 0.21143460273742676,
"eai_web_code": 0.11585038900375366
}
}
|
{
"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": "352.48",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,094,984,791,204,086,000 |
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
56 lines
1.2 KiB
// Buffer.h
#ifndef _Buffer_h_
#define _Buffer_h_
#include <fstream>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <string>
#include <vector>
class Buffer
{
public:
//void display() const;
const std::string & file_name() const { return file_name_; }
void move_to_next_page();
void move_to_previous_page();
int max_links();
bool go(int link);
void back();
bool open(const std::string & file_name);
std::string* get_lines() const;
void set_window_height(int h) { window_height = h; }
//Made window height public so the display function can be removed
int window_height = 0;
private:
std::vector<std::string> v_lines_;
std::vector<std::pair<std::string, std::string>> v_links_;
int ix_top_line_ = 0;
std::string file_name_;
};
inline void Buffer::move_to_next_page()
{
ix_top_line_ += window_height;
if (ix_top_line_ >= v_lines_.size())
ix_top_line_ -= window_height;
}
inline void Buffer::move_to_previous_page()
{
ix_top_line_ -= window_height;
if (ix_top_line_ < 0)
ix_top_line_ = 0;
}
inline int Buffer::max_links()
{
//return v_links.length();
return 1;
}
#endif
|
{
"url": "https://gitea.cslabs.clarkson.edu/cameron/cs142-project-1/src/commit/b3202c52d523db64098ff6e70ae51384cc46cc46/src/Buffer.h",
"source_domain": "gitea.cslabs.clarkson.edu",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "51075",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LUHMMHVDDZI5LRHRIIJ5Q42YQLZVSTIG",
"WARC-Concurrent-To": "<urn:uuid:4ac7908f-c0c8-43e5-907c-6a2455270631>",
"WARC-Date": "2022-09-30T16:41:20Z",
"WARC-IP-Address": "128.153.145.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZRXYQAVWAIFAIBWQZ6RHNSZ3APOCSWVC",
"WARC-Record-ID": "<urn:uuid:6ac6dfbb-58ff-4da5-b68c-a609bafa9f03>",
"WARC-Target-URI": "https://gitea.cslabs.clarkson.edu/cameron/cs142-project-1/src/commit/b3202c52d523db64098ff6e70ae51384cc46cc46/src/Buffer.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:de03f42e-3926-4f81-9785-c4a3dca248b5>"
},
"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,
144,
146,
148,
149,
158,
166,
167,
179,
198,
217,
236,
255,
274,
294,
312,
330,
343,
345,
353,
377,
438,
464,
494,
511,
530,
543,
585,
617,
670,
737,
760,
769,
804,
863,
885,
909,
912,
952,
954,
985,
1022,
1053,
1055,
1099,
1101,
1132,
1154,
1172,
1174,
1205,
1207,
1234,
1244,
1246
],
"line_end_idx": [
144,
146,
148,
149,
158,
166,
167,
179,
198,
217,
236,
255,
274,
294,
312,
330,
343,
345,
353,
377,
438,
464,
494,
511,
530,
543,
585,
617,
670,
737,
760,
769,
804,
863,
885,
909,
912,
952,
954,
985,
1022,
1053,
1055,
1099,
1101,
1132,
1154,
1172,
1174,
1205,
1207,
1234,
1244,
1246,
1252
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1252,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0.009584659710526466,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08856088668107986,
"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.45018449425697327,
"rps_doc_frac_unique_words": 0.6029411554336548,
"rps_doc_mean_word_length": 6.360294342041016,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.033210329711437225,
"rps_doc_unigram_entropy": 4.1459197998046875,
"rps_doc_word_count": 136,
"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.058959539979696274,
"rps_doc_frac_chars_top_3gram": 0.053179189562797546,
"rps_doc_frac_chars_top_4gram": 0.07398843765258789,
"rps_doc_books_importance": -58.95933151245117,
"rps_doc_books_importance_length_correction": -58.95933151245117,
"rps_doc_openwebtext_importance": -44.272132873535156,
"rps_doc_openwebtext_importance_length_correction": -44.272132873535156,
"rps_doc_wikipedia_importance": -43.82246398925781,
"rps_doc_wikipedia_importance_length_correction": -43.82246398925781
},
"fasttext": {
"dclm": 0.5574969053268433,
"english": 0.3854212462902069,
"fineweb_edu_approx": 2.2029080390930176,
"eai_general_math": 0.9970409870147705,
"eai_open_web_math": 0.19729399681091309,
"eai_web_code": 0.3778127431869507
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,291,323,845,127,257,000 |
Homework Help
Math equationProve that the equation 4x^3+3x^2=2x+1 has a solution 0<x<1
user profile pic
portoruj | Student, Grade 10 | eNoter
Posted May 17, 2011 at 11:55 PM via web
dislike 0 like
Math equation
Prove that the equation 4x^3+3x^2=2x+1 has a solution 0<x<1
Tagged with discussion, math
1 Answer | Add Yours
user profile pic
giorgiana1976 | College Teacher | Valedictorian
Posted May 18, 2011 at 10:09 AM (Answer #2)
dislike 0 like
To prove that the given equation has a root in the set (0,1), we'll apply Rolle's theorem.
We'll choose a Rolle function f:[0,1]->R,
f(x)=x^4+x^3-x^2-x
f(x)=x^4+x^3-x^2-x.
According to the Rolle's theorem:
f(1)-f(0)=f'(c)(1-0),
where c belongs to (0,1).
If f(1)=f(0) (condition valid only for a Rolle function)=> f'(c)=0
We'll differentiate the Rolle function and we'll get:
f'(x)=4x^3+3x^2-2x-1
If f'(c)=0 ,then c is a root of f'(x), c belongs to (0,1). q.e.d
Join to answer this question
Join a community of thousands of dedicated teachers and students.
Join eNotes
|
{
"url": "http://www.enotes.com/homework-help/math-equation-399865",
"source_domain": "www.enotes.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "24598",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HZ26RA7DX746FMHYPHT7DJVNXJPPY3XN",
"WARC-Concurrent-To": "<urn:uuid:417feb72-fdf4-4d72-bc0a-e7101775597e>",
"WARC-Date": "2014-04-23T17:42:31Z",
"WARC-IP-Address": "184.73.254.63",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DZLH6C7RESNAGCCAPEAFX2VTUFLDX7XS",
"WARC-Record-ID": "<urn:uuid:08469d4b-e1da-479d-a0ab-2b1f87f4218e>",
"WARC-Target-URI": "http://www.enotes.com/homework-help/math-equation-399865",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eccdc6b6-60f0-40d6-a0cd-f41ec80acf7d>"
},
"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,
14,
15,
88,
89,
106,
107,
145,
146,
186,
187,
202,
216,
217,
277,
278,
307,
308,
329,
330,
347,
348,
396,
397,
441,
442,
457,
458,
549,
550,
592,
593,
612,
613,
633,
634,
668,
669,
691,
692,
718,
719,
787,
788,
842,
843,
864,
865,
930,
931,
960,
961,
1027,
1028
],
"line_end_idx": [
14,
15,
88,
89,
106,
107,
145,
146,
186,
187,
202,
216,
217,
277,
278,
307,
308,
329,
330,
347,
348,
396,
397,
441,
442,
457,
458,
549,
550,
592,
593,
612,
613,
633,
634,
668,
669,
691,
692,
718,
719,
787,
788,
842,
843,
864,
865,
930,
931,
960,
961,
1027,
1028,
1039
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1039,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25465840101242065,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009316770359873772,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4534161388874054,
"rps_doc_frac_unique_words": 0.5961538553237915,
"rps_doc_mean_word_length": 4.679487228393555,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0.0031055898871272802,
"rps_doc_unigram_entropy": 4.3641743659973145,
"rps_doc_word_count": 156,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1068493202328682,
"rps_doc_frac_chars_dupe_6grams": 0.1068493202328682,
"rps_doc_frac_chars_dupe_7grams": 0.1068493202328682,
"rps_doc_frac_chars_dupe_8grams": 0.1068493202328682,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028767120093107224,
"rps_doc_frac_chars_top_3gram": 0.04109589010477066,
"rps_doc_frac_chars_top_4gram": 0.06575342267751694,
"rps_doc_books_importance": -170.97572326660156,
"rps_doc_books_importance_length_correction": -170.97572326660156,
"rps_doc_openwebtext_importance": -119.06473541259766,
"rps_doc_openwebtext_importance_length_correction": -105.91975402832031,
"rps_doc_wikipedia_importance": -77.97931671142578,
"rps_doc_wikipedia_importance_length_correction": -77.97931671142578
},
"fasttext": {
"dclm": 0.01975690945982933,
"english": 0.7955439686775208,
"fineweb_edu_approx": 1.5203430652618408,
"eai_general_math": 0.8744301795959473,
"eai_open_web_math": 0.6532018184661865,
"eai_web_code": 0.000384149985620752
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "515.15",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
717,654,186,070,582,700 |
Mog's Save Window with Quick-Save Custom Script
Discussion in 'RGSSx Script Support' started by Gravemaster, Jul 10, 2019.
1. Gravemaster
Gravemaster Lord Veteran
Messages:
74
Likes Received:
5
Location:
Tripoli, Greece
First Language:
English
Primarily Uses:
N/A
Hey. I recently got all of Moghunter's scripts (https://atelierrgss.wordpress.com/) from his Master Collection and amongst them was a super-fancy save script, which I will include below:
Moghunter's Script:
Code:
#==============================================================================
# +++ MOG - Scene File A (V1.3) +++
#==============================================================================
# By Moghunter
# https://atelierrgss.wordpress.com/
#==============================================================================
# Tela de salvar e carregar animado versão A.
#==============================================================================
# Serão necessários as seguintes imagens na pasta Graphics/System
#
# Save_Number.png
# Save_Background.png
# Save_Character_Floor.png
# Save_Layout01.png
# Save_Layout02.png
# Save_Window01.png
# Save_Window02.png
#
#==============================================================================
#
#==============================================================================
# ● Histórico (Version History)
#==============================================================================
# v 1.3 - Melhor codificação.
# v 1.1 - Melhoria no sistema de dispose de imagens.
#==============================================================================
module MOG_SCENE_FILE
#Quantidade de slots de saves.
FILES_MAX = 9
end
#==============================================================================
# ■ Game Temp
#==============================================================================
class Game_Temp
attr_accessor :scene_save
#--------------------------------------------------------------------------
# ● Initialize
#--------------------------------------------------------------------------
alias mog_scene_file_initialize initialize
def initialize
mog_scene_file_initialize
@scene_save = false
end
end
#==============================================================================
# ■ Window_Base
#==============================================================================
class Window_Base < Window
#--------------------------------------------------------------------------
# ● draw_picture_number(x,y,value,file_name,align, space, frame_max ,frame_index)
#--------------------------------------------------------------------------
# X - Posição na horizontal
# Y - Posição na vertical
# VALUE - Valor Numérico
# FILE_NAME - Nome do arquivo
# ALIGN - Centralizar 0 - Esquerda 1- Centro 2 - Direita
# SPACE - Espaço entre os números.
# FRAME_MAX - Quantidade de quadros(Linhas) que a imagem vai ter.
# FRAME_INDEX - Definição do quadro a ser utilizado.
#--------------------------------------------------------------------------
def draw_picture_number(x,y,value, file_name,align = 0, space = 0, frame_max = 1,frame_index = 0)
number_image = Cache.system(file_name)
frame_max = 1 if frame_max < 1
frame_index = frame_max -1 if frame_index > frame_max -1
align = 2 if align > 2
cw = number_image.width / 10
ch = number_image.height / frame_max
h = ch * frame_index
number = value.abs.to_s.split(//)
case align
when 0
plus_x = (-cw + space) * number.size
when 1
plus_x = (-cw + space) * number.size
plus_x /= 2
when 2
plus_x = 0
end
for r in 0..number.size - 1
number_abs = number[r].to_i
number_rect = Rect.new(cw * number_abs, h, cw, ch)
self.contents.blt(plus_x + x + ((cw - space) * r), y , number_image, number_rect)
end
number_image.dispose
end
#--------------------------------------------------------------------------
# ● Draw Help Layout
#--------------------------------------------------------------------------
def draw_face_save(name,x,y,type)
if type == 0
image_name = name + "_0"
elsif type == 1
image_name = name + "_1"
else
image_name = name + "_2"
end
image = Cache.face(image_name)
cw = image.width
ch = image.height
src_rect = Rect.new(0, 0, cw, ch)
self.contents.blt(x , y , image, src_rect)
image.dispose
end
#--------------------------------------------------------------------------
# ● draw_parameter_layout
#--------------------------------------------------------------------------
def draw_parameter_layout(x,y)
image = Cache.system("Save_Window01")
cw = image.width
ch = image.height
src_rect = Rect.new(0, 0, cw, ch)
self.contents.blt(x , y , image, src_rect)
image.dispose
end
#--------------------------------------------------------------------------
# ● draw_parameter_layout2
#--------------------------------------------------------------------------
def draw_parameter_layout2(x,y,type)
if type == 0
image = Cache.system("Save_Window02")
else
image = Cache.system("Save_Window03")
end
cw = image.width
ch = image.height
src_rect = Rect.new(0, 0, cw, ch)
self.contents.blt(x , y , image, src_rect)
image.dispose
end
#--------------------------------------------------------------------------
# ● draw_character_floor
#--------------------------------------------------------------------------
def draw_character_floor(x,y)
image = Cache.system("Save_Character_Floor")
cw = image.width
ch = image.height
src_rect = Rect.new(0, 0, cw, ch)
self.contents.blt(x , y , image, src_rect)
image.dispose
end
end
#==============================================================================
# ■ DataManager
#==============================================================================
module DataManager
#--------------------------------------------------------------------------
# ● Make Save Header
#--------------------------------------------------------------------------
def self.make_save_header
header = {}
header[:characters] = $game_party.characters_for_savefile
header[:playtime_s] = $game_system.playtime_s
header[:playtime] = $game_system.playtime
header[:map_name] = $game_map.display_name
header[:members] = $game_party.members
header
end
end
#==============================================================================
# ■ Window_SaveFile
#==============================================================================
class Window_SaveFile_A < Window_Base
attr_reader :filename
attr_reader :file_exist
attr_reader :time_stamp
attr_reader :selected
attr_reader :file_index
#--------------------------------------------------------------------------
# ● Initialize
#--------------------------------------------------------------------------
def initialize(file_index, filename)
super(0, 0,720, 140)
self.opacity = 0
@file_index = file_index
@filename = filename
load_gamedata
refresh
@selected = false
end
#--------------------------------------------------------------------------
# ● load_gamedata
#--------------------------------------------------------------------------
def load_gamedata
@time_stamp = Time.at(0)
@file_exist = FileTest.exist?(@filename)
if @file_exist
header = DataManager.load_header(@file_index)
if header == nil
@file_exist = false
return
end
@characters = header[:characters]
@total_sec = header[:playtime]
@mapname = header[:map_name]
@members = header[:members]
end
end
#--------------------------------------------------------------------------
# ● Refresh
#--------------------------------------------------------------------------
def refresh
self.contents.clear
self.contents.font.color = normal_color
xp = 96
ex = 60
if @file_exist
if @total_sec == nil
draw_parameter_layout2(0,50,0)
draw_parameter_layout(-10 + xp,0)
value = @file_index + 1
draw_picture_number(13 + xp, 32,value, "Save_Number_01",1,0,3,0)
self.contents.draw_text(140, 50, 450, 32, "Error! - Please, dont't use your old Save Files...", 0)
return
end
draw_parameter_layout2(0,50,0)
draw_parameter_layout(-10 + xp,0)
value = @file_index + 1
draw_picture_number(13 + xp, 32,value, "Save_Number_01",1,0,3,0)
draw_party_characters(180 + xp, 75,ex)
draw_playtime(495, 20, contents.width - 4, 2)
draw_map_location( 400 + xp,64)
draw_level(185 + xp,85,ex)
draw_face_save(40 + xp,0)
else
draw_parameter_layout2(0,50,1)
draw_parameter_layout(-10 + xp,0)
value = @file_index + 1
draw_picture_number(13 + xp, 32,value, "Save_Number_01",1,0,3,0)
self.contents.draw_text(260, 50, 120, 32, "No Data", 1)
end
end
#--------------------------------------------------------------------------
# ● draw_face
#--------------------------------------------------------------------------
def draw_face_save(x,y)
draw_actor_face(@members[0], x, y)
end
#--------------------------------------------------------------------------
# ● draw_level
#--------------------------------------------------------------------------
def draw_level(x,y,ex)
self.contents.font.color = normal_color
for i in [email protected]
break if i > 3
level = @members[i].level
draw_picture_number(x + (ex * i) , y ,level, "Save_Number_01",1,0,3,1)
end
end
#--------------------------------------------------------------------------
# ● draw_map_location
#--------------------------------------------------------------------------
def draw_map_location(x,y)
self.contents.font.bold = true
self.contents.font.name = "Georgia"
self.contents.font.size = 20
self.contents.font.italic = true
self.contents.draw_text(x, y, 125, 32, @mapname.to_s, 0)
end
#--------------------------------------------------------------------------
# ● draw_party_characters
#--------------------------------------------------------------------------
def draw_party_characters(x, y,ex)
for i in [email protected]
break if i > 3
name = @characters[i][0]
index = @characters[i][1]
draw_character_floor(- 35 + x + i * ex,y - 20)
draw_character(name, index, x + i * ex, y)
end
end
#--------------------------------------------------------------------------
# ● draw_playtime
#--------------------------------------------------------------------------
def draw_playtime(x, y, width, align)
hour = @total_sec / 60 / 60
min = @total_sec / 60 % 60
sec = @total_sec % 60
time_string = sprintf("%02d:%02d:%02d", hour, min, sec)
draw_picture_number(x + 18 * 0, y ,0, "Save_Number_01",0,0,3,0) if hour < 10
draw_picture_number(x + 18 * 1, y ,hour, "Save_Number_01",0,0,3,0)
draw_picture_number(x + 18 * 3, y ,0, "Save_Number_01",0,0,3,0) if min < 10
draw_picture_number(x + 18 * 4, y ,min, "Save_Number_01",0,0,3,0)
draw_picture_number(x + 18 * 6, y ,0, "Save_Number_01",0,0,3,0) if sec < 10
draw_picture_number(x + 18 * 7, y ,sec , "Save_Number_01",0,0,3,0)
end
#--------------------------------------------------------------------------
# ● selected
#--------------------------------------------------------------------------
def selected=(selected)
@selected = selected
end
end
#==============================================================================
# ■ Scene Save
#==============================================================================
class Scene_Save < Scene_File
#--------------------------------------------------------------------------
# ● Initialize
#--------------------------------------------------------------------------
def initialize
$game_temp.scene_save = true
super
end
end
#==============================================================================
# ■ Scene Load
#==============================================================================
class Scene_Load < Scene_File
#--------------------------------------------------------------------------
# ● Initialize
#--------------------------------------------------------------------------
def initialize
$game_temp.scene_save = false
super
end
end
#==============================================================================
# ■ Scene_File
#==============================================================================
class Scene_File
include MOG_SCENE_FILE
#--------------------------------------------------------------------------
# ● initialize
#--------------------------------------------------------------------------
def initialize
@saving = $game_temp.scene_save
@file_max = FILES_MAX
@file_max = 1 if FILES_MAX < 1
execute_dispose
create_layout
create_savefile_windows
@index = DataManager.last_savefile_index
@check_prev_index = true
@savefile_windows[@index].selected = true
end
#--------------------------------------------------------------------------
# ● Main
#--------------------------------------------------------------------------
def main
Graphics.transition
execute_loop
execute_dispose
end
#--------------------------------------------------------------------------
# ● Execute Loop
#--------------------------------------------------------------------------
def execute_loop
loop do
Graphics.update
Input.update
update
if SceneManager.scene != self
break
end
end
end
#--------------------------------------------------------------------------
# ● Create_background
#--------------------------------------------------------------------------
def create_layout
@background = Plane.new
@background.bitmap = Cache.system("Save_Background")
@background.z = 0
@layout_01 = Sprite.new
@layout_01.bitmap = Cache.system("Save_Layout01")
@layout_01.z = 1
@layout_01.blend_type = 1
image = Cache.system("Save_Layout02")
@bitmap = Bitmap.new(image.width,image.height)
cw = image.width
ch = image.height / 2
if @saving
h = 0
else
h = ch
end
src_rect = Rect.new(0, h, cw, ch)
@bitmap.blt(0,0, image, src_rect)
@layout_02 = Sprite.new
@layout_02.bitmap = @bitmap
@layout_02.z = 3
@layout_02.y = 370
image.dispose
end
#--------------------------------------------------------------------------
# ● Execute Dispose
#--------------------------------------------------------------------------
def execute_dispose
return if @background == nil
Graphics.freeze
@background.bitmap.dispose
@background.dispose
@background = nil
@layout_01.bitmap.dispose
@layout_01.dispose
@layout_02.bitmap.dispose
@layout_02.dispose
@bitmap.dispose
dispose_item_windows
end
#--------------------------------------------------------------------------
# ● Frame Update
#--------------------------------------------------------------------------
def update
update_savefile_windows
update_savefile_selection
check_start_index
end
#--------------------------------------------------------------------------
# ● check_start_index
#--------------------------------------------------------------------------
def check_start_index
return if @check_prev_index == false
@check_prev_index = false
check_active_window
end
#--------------------------------------------------------------------------
# ● check_active_window
#--------------------------------------------------------------------------
def check_active_window
@index = 0 if @index == nil
for i in 0...@file_max
@pw = @index - 1
@pw = 0 if @pw > @file_max - 1
@pw = @file_max- 1 if @pw < 0
@aw = @index
@nw = @index + 1
@nw = 0 if @nw > @file_max - 1
@nw = @file_max - 1 if @nw < 0
case @savefile_windows[i].file_index
when @pw,@nw
@savefile_windows[i].visible = true
@savefile_windows[i].contents_opacity = 80
when @aw
@savefile_windows[i].visible = true
@savefile_windows[i].contents_opacity = 255
else
@savefile_windows[i].visible = false
end
end
end
#--------------------------------------------------------------------------
# ● Create Save File Window
#--------------------------------------------------------------------------
def create_savefile_windows
@pw_pos = [-160,32]
@aw_pos = [-96,160]
@nw_pos = [-32,288]
@savefile_windows = []
for i in 0...@file_max
@savefile_windows[i] = Window_SaveFile_A.new(i, DataManager.make_filename(i))
@savefile_windows[i].z = 2
@savefile_windows[i].visible = false
@savefile_windows[i].x = 400
end
check_active_window
@item_max = @file_max
end
#--------------------------------------------------------------------------
# ● Dispose of Save File Window
#--------------------------------------------------------------------------
def dispose_item_windows
for window in @savefile_windows
window.dispose
end
end
#--------------------------------------------------------------------------
# ● Update Save File Window
#--------------------------------------------------------------------------
def update_savefile_windows
update_slide_window
for window in @savefile_windows
window.update
end
end
#--------------------------------------------------------------------------
# ● update_slide_window
#--------------------------------------------------------------------------
def update_slide_window
@background.ox += 1
slide_window_x(@pw,@pw_pos[0])
slide_window_x(@aw,@aw_pos[0])
slide_window_x(@nw,@nw_pos[0])
slide_window_y(@pw,@pw_pos[1])
slide_window_y(@aw,@aw_pos[1])
slide_window_y(@nw,@nw_pos[1])
end
#--------------------------------------------------------------------------
# ● slide_window_x
#--------------------------------------------------------------------------
def slide_window_x(i,x_pos)
if @savefile_windows[i].x < x_pos
@savefile_windows[i].x += 15
@savefile_windows[i].x = x_pos if @savefile_windows[i].x > x_pos
end
if @savefile_windows[i].x > x_pos
@savefile_windows[i].x -= 15
@savefile_windows[i].x = x_pos if @savefile_windows[i].x < x_pos
end
end
#--------------------------------------------------------------------------
# ● slide_window_y
#--------------------------------------------------------------------------
def slide_window_y(i,y_pos)
if @savefile_windows[i].y < y_pos
@savefile_windows[i].y += 15
@savefile_windows[i].y = y_pos if @savefile_windows[i].y > y_pos
end
if @savefile_windows[i].y > y_pos
@savefile_windows[i].y -= 15
@savefile_windows[i].y = y_pos if @savefile_windows[i].y < y_pos
end
end
#--------------------------------------------------------------------------
# ● reset_position
#--------------------------------------------------------------------------
def reset_position(diretion)
check_active_window
case diretion
when 0
@savefile_windows[@pw].y = -64
@savefile_windows[@pw].x = 0
when 1
@savefile_windows[@nw].y = 440
@savefile_windows[@nw].x = 0
end
end
#--------------------------------------------------------------------------
# ● Update Save File Selection
#--------------------------------------------------------------------------
def update_savefile_selection
if Input.trigger?(Input::C)
on_savefile_ok
elsif Input.trigger?(Input::B)
Sound.play_cancel
return_scene
else
last_index = @index
if Input.trigger?(Input::DOWN)
execute_index(1)
if @file_max > 2
reset_position(1)
else
reset_position(0)
end
end
if Input.trigger?(Input::UP)
execute_index(-1)
reset_position(0)
end
if @index != last_index
Sound.play_cursor
@savefile_windows[last_index].selected = false
@savefile_windows[@index].selected = true
end
end
end
#--------------------------------------------------------------------------
# ● Execute Index
#--------------------------------------------------------------------------
def execute_index(value)
@index += value
@index = @index >= @file_max ? 0 : @index < 0 ? (@file_max - 1) : @index
end
end
$mog_rgss3_scene_file = true
I will also include the necessary images for the script to work, obviously all credits still go to Moghunter (see the images at the bottom of the post).
Can we make it work in conjuction with the custom quick-save script that I have been using until now? It has mostly been made and edited my members on this forums per requests, so I doubt you will find it anywhere else on the net. I imagine it would be easier editing this script than it would be editing the above one:
Code:
=begin
====================================================================
GENERAL INFORMATION
--------------------------------------------------------------------
Title: Quick Save/Load System
Author: Adiktuzmiko
Version: 1.01 - Khas' Fix
Requirements: None
This script allows you to set a button in the game for quick save and load.
If you press the quicksave button, the game will automatically save
your progress in the designated slot without going thru the save screen.
The same goes for quickload.
====================================================================
====================================================================
FEATURES
--------------------------------------------------------------------
Quick Save/Load Anytime
- Save/Load your progress with the press of a button
Customizable
- Modify which file index is used as the quick slot
- Modify which buttons
- Determine if quick system is usable in battle and during show text
event commands
Works with Khas' Awesome Light Effects
====================================================================
====================================================================
INSTRUCTIONS
--------------------------------------------------------------------
After importing this script to your project, go to the config part
below (after TERMS AND CONDITIONS) and edit to suit your needs.
====================================================================
====================================================================
TERMS AND CONDITIONS
--------------------------------------------------------------------
View it here: http://lescripts.wordpress.com/terms-and-conditions/
====================================================================
=end
module ADIK
module QUICK
#Is the system enabled?
ENABLED = true
#Save file index to be used by Quick save/load
#Note that by default the first file is index 0
INDEX = 1
#SaveLoad Keybindings
#Default are L and R keys (Q/W at the keyboard by default)
SAVE_KEY = :L
LOAD_KEY = :L
#Set these if you want to use a button "combo" to activate the system
#Example if SAVE_KEY is set as :L and SAVE_KEY_2 is set as :A
#then you need to press both to activate the quick save
SAVE_KEY_2 = nil
LOAD_KEY_2 = :A
#Is the system allowed in battle scene?
#I suggest keeping this as false
ALLOW_AT_BATTLE = false
#Is the system allowed during the Show Text event command?
ALLOW_AT_TEXT = false
end
end
# DO NOT EDIT BELOW THIS LINE
if ADIK::QUICK::ENABLED
class Scene_Quick < Scene_File
attr_accessor :quick_save
attr_accessor :quick_load
def create_help_window
end
def help_window_text
end
def create_savefile_viewport
@savefile_viewport = Viewport.new
@savefile_viewport.rect.y = 0
@savefile_viewport.rect.height = 0
end
def create_savefile_windows
@savefile_windows = Array.new(item_max) do |i|
Window_SaveFile.new(savefile_height, i)
end
@savefile_windows.each {|window| window.viewport = @savefile_viewport; window.hide }
end
def init_selection
end
def update
if @quick_save
if DataManager.save_game(ADIK::QUICK::INDEX)
Sound.play_save
else
Sound.play_buzzer
end
@quick_save = false
SceneManager.return
end
if @quick_load
if DataManager.load_game(ADIK::QUICK::INDEX)
Sound.play_load
$game_system.on_after_load
@quick_load = false
SceneManager.goto(Scene_Map)
else
Sound.play_buzzer
@quick_load = false
SceneManager.return
end
end
end
def quicksave
@quick_save = true
end
def quickload
@quick_load = true
end
end
class Scene_Base
def quicksave
SceneManager.call(Scene_Quick)
SceneManager.scene.quicksave
end
def quickload
SceneManager.call(Scene_Quick)
SceneManager.scene.quickload
end
def is_quicksave
if ADIK::QUICK::SAVE_KEY_2 != nil
return (Input.trigger?(ADIK::QUICK::SAVE_KEY) and Input.press?(ADIK::QUICK::SAVE_KEY_2))
else
if ADIK::QUICK::LOAD_KEY_2 != nil
return false if Input.press?(ADIK::QUICK::LOAD_KEY_2)
end
return Input.trigger?(ADIK::QUICK::SAVE_KEY)
end
end
def is_quickload
if ADIK::QUICK::LOAD_KEY_2 != nil
return (Input.trigger?(ADIK::QUICK::LOAD_KEY) and Input.press?(ADIK::QUICK::LOAD_KEY_2))
else
if ADIK::QUICK::SAVE_KEY_2 != nil
return false if Input.press?(ADIK::QUICK::SAVE_KEY_2)
end
return Input.trigger?(ADIK::QUICK::LOAD_KEY)
end
end
def quicksystem
if is_quicksave and not SceneManager.scene_is?(Scene_Save)
if SceneManager.scene_is?(Scene_Battle) then
if ADIK::QUICK::ALLOW_AT_BATTLE
quicksave
end
else
quicksave
end
return
end
if is_quickload and not SceneManager.scene_is?(Scene_Load)
if SceneManager.scene_is?(Scene_Battle) then
if ADIK::QUICK::ALLOW_AT_BATTLE
quickload
end
else
quickload
end
return
end
end
alias update_quicksystem update
def update
update_quicksystem
quicksystem
end
end
class Game_Interpreter
def wait_for_message
while $game_message.busy?
SceneManager.scene.quicksystem
Fiber.yield
end
end
end
end
Trying to use the quick-save now (by the time I installed moghunter's script I mean), I get the following error:
Script 'Scene_File' line 89: NoMethodError occured.
undefined method `rect' for nil:NilClass
The referred line is the following:
Code:
def savefile_height
@savefile_viewport.rect.height / visible_max
end
Thanks for your time! If you have any questions, feel free to ask. The script will be used for my free-to-play Broken Reality, and credits will be given properly.
Attached Files:
Last edited: Jul 10, 2019
#1
2. Roninator2
Roninator2 Gamer Veteran
Messages:
1,710
Likes Received:
376
Location:
Canada
First Language:
English
Primarily Uses:
RMVXA
It will work if you comment out
def create_savefile_viewport
#removed
end
and
def create_savefile_windows
# removed
end
It does a short scene of loading the save scene and then closes.
#2
3. Gravemaster
Gravemaster Lord Veteran
Messages:
74
Likes Received:
5
Location:
Tripoli, Greece
First Language:
English
Primarily Uses:
N/A
It worked! Thanks.
Edit: Admin you can lock the thread now.
Last edited: Jul 15, 2019
#3
Share This Page
|
{
"url": "https://forums.rpgmakerweb.com/index.php?threads/mogs-save-window-with-quick-save-custom-script.110891/",
"source_domain": "forums.rpgmakerweb.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "87083",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6LELD6NUEMBZJDWUAJAKE2WH7AD5OI6J",
"WARC-Concurrent-To": "<urn:uuid:67c9cc35-cbb9-4acc-b93e-b96e07dfb8e0>",
"WARC-Date": "2019-10-23T16:08:00Z",
"WARC-IP-Address": "45.79.217.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6UQMYTZ4X7C5QHV6EUTIAYPSHFCISO34",
"WARC-Record-ID": "<urn:uuid:6d2274b3-b25a-41c4-a80d-967bce2c2f64>",
"WARC-Target-URI": "https://forums.rpgmakerweb.com/index.php?threads/mogs-save-window-with-quick-save-custom-script.110891/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b878dd36-b111-4d7b-9b3c-0405d17954e2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-68.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,
48,
49,
124,
125,
142,
143,
172,
173,
187,
194,
214,
220,
234,
254,
274,
286,
306,
314,
505,
529,
539,
623,
663,
747,
766,
807,
891,
941,
1025,
1095,
1101,
1123,
1149,
1180,
1204,
1228,
1252,
1276,
1282,
1366,
1372,
1456,
1492,
1576,
1610,
1667,
1751,
1777,
1814,
1834,
1842,
1847,
1931,
1949,
2033,
2053,
2058,
2090,
2172,
2193,
2275,
2324,
2345,
2381,
2411,
2421,
2426,
2434,
2518,
2538,
2622,
2653,
2658,
2740,
2830,
2912,
2946,
2978,
3009,
3045,
3108,
3149,
3221,
3280,
3362,
3468,
3517,
3558,
3625,
3658,
3697,
3744,
3775,
3819,
3840,
3860,
3913,
3933,
3986,
4014,
4034,
4061,
4075,
4117,
4159,
4224,
4324,
4338,
4369,
4379,
4384,
4466,
4493,
4575,
4615,
4638,
4676,
4702,
4746,
4761,
4799,
4813,
4854,
4881,
4909,
4953,
5006,
5030,
5040,
5047,
5129,
5161,
5243,
5280,
5328,
5355,
5383,
5427,
5482,
5506,
5516,
5521,
5603,
5636,
5718,
5761,
5784,
5835,
5850,
5901,
5915,
5942,
5970,
6014,
6069,
6093,
6107,
6112,
6194,
6225,
6307,
6343,
6398,
6425,
6453,
6497,
6550,
6574,
6584,
6589,
6597,
6604,
6688,
6708,
6792,
6815,
6820,
6902,
6929,
7011,
7043,
7065,
7133,
7189,
7241,
7294,
7343,
7360,
7370,
7378,
7383,
7467,
7491,
7575,
7617,
7659,
7703,
7745,
7789,
7821,
7826,
7908,
7929,
8011,
8054,
8085,
8112,
8147,
8178,
8202,
8220,
8248,
8258,
8263,
8345,
8369,
8451,
8475,
8508,
8557,
8580,
8637,
8665,
8699,
8720,
8735,
8780,
8822,
8862,
8901,
8913,
8923,
8928,
9010,
9028,
9110,
9128,
9158,
9208,
9226,
9244,
9269,
9303,
9350,
9400,
9440,
9529,
9644,
9667,
9683,
9726,
9772,
9808,
9885,
9936,
9994,
10038,
10077,
10115,
10130,
10173,
10219,
10255,
10336,
10405,
10419,
10431,
10438,
10520,
10540,
10622,
10652,
10696,
10706,
10711,
10793,
10814,
10896,
10925,
10975,
11012,
11039,
11077,
11161,
11179,
11189,
11194,
11276,
11304,
11386,
11419,
11460,
11506,
11545,
11588,
11655,
11665,
11747,
11779,
11861,
11902,
11942,
11969,
12006,
12044,
12105,
12160,
12174,
12184,
12189,
12271,
12295,
12377,
12421,
12459,
12496,
12528,
12594,
12681,
12758,
12844,
12920,
13006,
13085,
13095,
13100,
13182,
13201,
13283,
13313,
13344,
13354,
13362,
13367,
13451,
13470,
13554,
13588,
13670,
13691,
13773,
13794,
13833,
13849,
13859,
13867,
13951,
13970,
14054,
14088,
14170,
14191,
14273,
14294,
14334,
14350,
14360,
14368,
14373,
14457,
14476,
14560,
14581,
14610,
14615,
14620,
14702,
14723,
14805,
14826,
14868,
14900,
14941,
14967,
14991,
15025,
15076,
15111,
15163,
15173,
15178,
15259,
15273,
15360,
15374,
15403,
15425,
15450,
15459,
15464,
15545,
15567,
15656,
15678,
15695,
15725,
15752,
15773,
15817,
15841,
15859,
15872,
15881,
15886,
15968,
15996,
16078,
16102,
16136,
16199,
16227,
16261,
16321,
16350,
16386,
16434,
16491,
16518,
16550,
16571,
16590,
16605,
16625,
16639,
16683,
16729,
16763,
16801,
16828,
16857,
16881,
16891,
16896,
16978,
17004,
17086,
17112,
17151,
17177,
17214,
17244,
17272,
17308,
17339,
17375,
17404,
17430,
17461,
17471,
17476,
17558,
17581,
17663,
17680,
17714,
17750,
17778,
17788,
17793,
17875,
17903,
17985,
18013,
18060,
18096,
18126,
18136,
18143,
18225,
18255,
18337,
18367,
18405,
18438,
18467,
18510,
18556,
18581,
18610,
18653,
18697,
18746,
18774,
18830,
18893,
18917,
18973,
19037,
19057,
19114,
19130,
19150,
19160,
19167,
19249,
19283,
19365,
19399,
19427,
19455,
19485,
19516,
19547,
19637,
19676,
19725,
19766,
19778,
19806,
19836,
19846,
19851,
19933,
19971,
20053,
20084,
20126,
20155,
20169,
20179,
20184,
20266,
20300,
20382,
20416,
20446,
20488,
20514,
20528,
20538,
20543,
20625,
20655,
20737,
20767,
20797,
20838,
20879,
20920,
20961,
21002,
21043,
21053,
21060,
21142,
21167,
21249,
21283,
21327,
21369,
21447,
21461,
21505,
21547,
21629,
21654,
21664,
21671,
21753,
21778,
21860,
21894,
21938,
21980,
22058,
22072,
22116,
22158,
22240,
22265,
22275,
22282,
22364,
22389,
22473,
22508,
22540,
22564,
22584,
22631,
22676,
22696,
22743,
22788,
22806,
22816,
22823,
22905,
22942,
23024,
23060,
23098,
23126,
23167,
23198,
23224,
23239,
23271,
23314,
23346,
23378,
23414,
23434,
23470,
23489,
23505,
23546,
23579,
23612,
23628,
23664,
23697,
23759,
23816,
23834,
23848,
23858,
23863,
23945,
23969,
24051,
24082,
24108,
24191,
24201,
24206,
24214,
24219,
24252,
24253,
24410,
24411,
24735,
24745,
24756,
24829,
24855,
24928,
24964,
24990,
25022,
25047,
25052,
25134,
25208,
25287,
25322,
25327,
25400,
25405,
25478,
25493,
25566,
25571,
25601,
25660,
25665,
25684,
25742,
25771,
25846,
25869,
25876,
25921,
25926,
25999,
26004,
26077,
26096,
26169,
26174,
26247,
26317,
26322,
26395,
26400,
26473,
26500,
26573,
26578,
26651,
26656,
26729,
26734,
26743,
26748,
26764,
26783,
26790,
26822,
26845,
26852,
26907,
26963,
26981,
26988,
27018,
27085,
27107,
27129,
27136,
27214,
27284,
27348,
27373,
27397,
27404,
27452,
27493,
27525,
27532,
27599,
27629,
27636,
27646,
27654,
27659,
27693,
27698,
27726,
27731,
27768,
27775,
27809,
27843,
27850,
27881,
27893,
27922,
27934,
27971,
28015,
28055,
28100,
28112,
28148,
28205,
28257,
28271,
28366,
28378,
28405,
28417,
28424,
28443,
28468,
28525,
28555,
28572,
28604,
28620,
28652,
28684,
28698,
28723,
28780,
28810,
28851,
28885,
28928,
28945,
28977,
29011,
29045,
29061,
29075,
29087,
29094,
29116,
29145,
29157,
29164,
29186,
29215,
29227,
29234,
29244,
29249,
29272,
29279,
29301,
29342,
29381,
29393,
29400,
29422,
29463,
29502,
29514,
29521,
29546,
29590,
29691,
29706,
29752,
29820,
29836,
29893,
29907,
29919,
29926,
29951,
29995,
30096,
30111,
30157,
30225,
30241,
30298,
30312,
30324,
30329,
30336,
30360,
30429,
30486,
30532,
30558,
30576,
30593,
30617,
30633,
30652,
30666,
30735,
30792,
30838,
30864,
30882,
30899,
30923,
30939,
30958,
30972,
30984,
30991,
31031,
31050,
31079,
31101,
31113,
31120,
31130,
31135,
31164,
31169,
31198,
31234,
31277,
31301,
31315,
31327,
31335,
31345,
31350,
31358,
31359,
31476,
31532,
31577,
31578,
31618,
31619,
31629,
31655,
31708,
31718,
31719,
31886,
31892,
31893,
31913,
31914,
31944,
31951,
31967,
31968,
31997,
31998,
32012,
32022,
32042,
32050,
32064,
32075,
32095,
32107,
32127,
32137,
32173,
32206,
32219,
32227,
32228,
32236,
32237,
32269,
32283,
32291,
32292,
32361,
32367,
32374,
32391,
32392,
32421,
32422,
32436,
32443,
32463,
32469,
32483,
32503,
32523,
32535,
32555,
32563,
32586,
32587,
32632,
32638,
32668,
32675,
32676
],
"line_end_idx": [
48,
49,
124,
125,
142,
143,
172,
173,
187,
194,
214,
220,
234,
254,
274,
286,
306,
314,
505,
529,
539,
623,
663,
747,
766,
807,
891,
941,
1025,
1095,
1101,
1123,
1149,
1180,
1204,
1228,
1252,
1276,
1282,
1366,
1372,
1456,
1492,
1576,
1610,
1667,
1751,
1777,
1814,
1834,
1842,
1847,
1931,
1949,
2033,
2053,
2058,
2090,
2172,
2193,
2275,
2324,
2345,
2381,
2411,
2421,
2426,
2434,
2518,
2538,
2622,
2653,
2658,
2740,
2830,
2912,
2946,
2978,
3009,
3045,
3108,
3149,
3221,
3280,
3362,
3468,
3517,
3558,
3625,
3658,
3697,
3744,
3775,
3819,
3840,
3860,
3913,
3933,
3986,
4014,
4034,
4061,
4075,
4117,
4159,
4224,
4324,
4338,
4369,
4379,
4384,
4466,
4493,
4575,
4615,
4638,
4676,
4702,
4746,
4761,
4799,
4813,
4854,
4881,
4909,
4953,
5006,
5030,
5040,
5047,
5129,
5161,
5243,
5280,
5328,
5355,
5383,
5427,
5482,
5506,
5516,
5521,
5603,
5636,
5718,
5761,
5784,
5835,
5850,
5901,
5915,
5942,
5970,
6014,
6069,
6093,
6107,
6112,
6194,
6225,
6307,
6343,
6398,
6425,
6453,
6497,
6550,
6574,
6584,
6589,
6597,
6604,
6688,
6708,
6792,
6815,
6820,
6902,
6929,
7011,
7043,
7065,
7133,
7189,
7241,
7294,
7343,
7360,
7370,
7378,
7383,
7467,
7491,
7575,
7617,
7659,
7703,
7745,
7789,
7821,
7826,
7908,
7929,
8011,
8054,
8085,
8112,
8147,
8178,
8202,
8220,
8248,
8258,
8263,
8345,
8369,
8451,
8475,
8508,
8557,
8580,
8637,
8665,
8699,
8720,
8735,
8780,
8822,
8862,
8901,
8913,
8923,
8928,
9010,
9028,
9110,
9128,
9158,
9208,
9226,
9244,
9269,
9303,
9350,
9400,
9440,
9529,
9644,
9667,
9683,
9726,
9772,
9808,
9885,
9936,
9994,
10038,
10077,
10115,
10130,
10173,
10219,
10255,
10336,
10405,
10419,
10431,
10438,
10520,
10540,
10622,
10652,
10696,
10706,
10711,
10793,
10814,
10896,
10925,
10975,
11012,
11039,
11077,
11161,
11179,
11189,
11194,
11276,
11304,
11386,
11419,
11460,
11506,
11545,
11588,
11655,
11665,
11747,
11779,
11861,
11902,
11942,
11969,
12006,
12044,
12105,
12160,
12174,
12184,
12189,
12271,
12295,
12377,
12421,
12459,
12496,
12528,
12594,
12681,
12758,
12844,
12920,
13006,
13085,
13095,
13100,
13182,
13201,
13283,
13313,
13344,
13354,
13362,
13367,
13451,
13470,
13554,
13588,
13670,
13691,
13773,
13794,
13833,
13849,
13859,
13867,
13951,
13970,
14054,
14088,
14170,
14191,
14273,
14294,
14334,
14350,
14360,
14368,
14373,
14457,
14476,
14560,
14581,
14610,
14615,
14620,
14702,
14723,
14805,
14826,
14868,
14900,
14941,
14967,
14991,
15025,
15076,
15111,
15163,
15173,
15178,
15259,
15273,
15360,
15374,
15403,
15425,
15450,
15459,
15464,
15545,
15567,
15656,
15678,
15695,
15725,
15752,
15773,
15817,
15841,
15859,
15872,
15881,
15886,
15968,
15996,
16078,
16102,
16136,
16199,
16227,
16261,
16321,
16350,
16386,
16434,
16491,
16518,
16550,
16571,
16590,
16605,
16625,
16639,
16683,
16729,
16763,
16801,
16828,
16857,
16881,
16891,
16896,
16978,
17004,
17086,
17112,
17151,
17177,
17214,
17244,
17272,
17308,
17339,
17375,
17404,
17430,
17461,
17471,
17476,
17558,
17581,
17663,
17680,
17714,
17750,
17778,
17788,
17793,
17875,
17903,
17985,
18013,
18060,
18096,
18126,
18136,
18143,
18225,
18255,
18337,
18367,
18405,
18438,
18467,
18510,
18556,
18581,
18610,
18653,
18697,
18746,
18774,
18830,
18893,
18917,
18973,
19037,
19057,
19114,
19130,
19150,
19160,
19167,
19249,
19283,
19365,
19399,
19427,
19455,
19485,
19516,
19547,
19637,
19676,
19725,
19766,
19778,
19806,
19836,
19846,
19851,
19933,
19971,
20053,
20084,
20126,
20155,
20169,
20179,
20184,
20266,
20300,
20382,
20416,
20446,
20488,
20514,
20528,
20538,
20543,
20625,
20655,
20737,
20767,
20797,
20838,
20879,
20920,
20961,
21002,
21043,
21053,
21060,
21142,
21167,
21249,
21283,
21327,
21369,
21447,
21461,
21505,
21547,
21629,
21654,
21664,
21671,
21753,
21778,
21860,
21894,
21938,
21980,
22058,
22072,
22116,
22158,
22240,
22265,
22275,
22282,
22364,
22389,
22473,
22508,
22540,
22564,
22584,
22631,
22676,
22696,
22743,
22788,
22806,
22816,
22823,
22905,
22942,
23024,
23060,
23098,
23126,
23167,
23198,
23224,
23239,
23271,
23314,
23346,
23378,
23414,
23434,
23470,
23489,
23505,
23546,
23579,
23612,
23628,
23664,
23697,
23759,
23816,
23834,
23848,
23858,
23863,
23945,
23969,
24051,
24082,
24108,
24191,
24201,
24206,
24214,
24219,
24252,
24253,
24410,
24411,
24735,
24745,
24756,
24829,
24855,
24928,
24964,
24990,
25022,
25047,
25052,
25134,
25208,
25287,
25322,
25327,
25400,
25405,
25478,
25493,
25566,
25571,
25601,
25660,
25665,
25684,
25742,
25771,
25846,
25869,
25876,
25921,
25926,
25999,
26004,
26077,
26096,
26169,
26174,
26247,
26317,
26322,
26395,
26400,
26473,
26500,
26573,
26578,
26651,
26656,
26729,
26734,
26743,
26748,
26764,
26783,
26790,
26822,
26845,
26852,
26907,
26963,
26981,
26988,
27018,
27085,
27107,
27129,
27136,
27214,
27284,
27348,
27373,
27397,
27404,
27452,
27493,
27525,
27532,
27599,
27629,
27636,
27646,
27654,
27659,
27693,
27698,
27726,
27731,
27768,
27775,
27809,
27843,
27850,
27881,
27893,
27922,
27934,
27971,
28015,
28055,
28100,
28112,
28148,
28205,
28257,
28271,
28366,
28378,
28405,
28417,
28424,
28443,
28468,
28525,
28555,
28572,
28604,
28620,
28652,
28684,
28698,
28723,
28780,
28810,
28851,
28885,
28928,
28945,
28977,
29011,
29045,
29061,
29075,
29087,
29094,
29116,
29145,
29157,
29164,
29186,
29215,
29227,
29234,
29244,
29249,
29272,
29279,
29301,
29342,
29381,
29393,
29400,
29422,
29463,
29502,
29514,
29521,
29546,
29590,
29691,
29706,
29752,
29820,
29836,
29893,
29907,
29919,
29926,
29951,
29995,
30096,
30111,
30157,
30225,
30241,
30298,
30312,
30324,
30329,
30336,
30360,
30429,
30486,
30532,
30558,
30576,
30593,
30617,
30633,
30652,
30666,
30735,
30792,
30838,
30864,
30882,
30899,
30923,
30939,
30958,
30972,
30984,
30991,
31031,
31050,
31079,
31101,
31113,
31120,
31130,
31135,
31164,
31169,
31198,
31234,
31277,
31301,
31315,
31327,
31335,
31345,
31350,
31358,
31359,
31476,
31532,
31577,
31578,
31618,
31619,
31629,
31655,
31708,
31718,
31719,
31886,
31892,
31893,
31913,
31914,
31944,
31951,
31967,
31968,
31997,
31998,
32012,
32022,
32042,
32050,
32064,
32075,
32095,
32107,
32127,
32137,
32173,
32206,
32219,
32227,
32228,
32236,
32237,
32269,
32283,
32291,
32292,
32361,
32367,
32374,
32391,
32392,
32421,
32422,
32436,
32443,
32463,
32469,
32483,
32503,
32523,
32535,
32555,
32563,
32586,
32587,
32632,
32638,
32668,
32675,
32676,
32691
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 32691,
"ccnet_original_nlines": 924,
"rps_doc_curly_bracket": 0.0001223599974764511,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13092884421348572,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03063241019845009,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46739131212234497,
"rps_doc_frac_unique_words": 0.36225026845932007,
"rps_doc_mean_word_length": 6.693480491638184,
"rps_doc_num_sentences": 293,
"rps_doc_symbol_to_word_ratio": 0.04545455053448677,
"rps_doc_unigram_entropy": 5.783425807952881,
"rps_doc_word_count": 1902,
"rps_doc_frac_chars_dupe_10grams": 0.0907234326004982,
"rps_doc_frac_chars_dupe_5grams": 0.12041474133729935,
"rps_doc_frac_chars_dupe_6grams": 0.10839682817459106,
"rps_doc_frac_chars_dupe_7grams": 0.09724295139312744,
"rps_doc_frac_chars_dupe_8grams": 0.09724295139312744,
"rps_doc_frac_chars_dupe_9grams": 0.09724295139312744,
"rps_doc_frac_chars_top_2gram": 0.016023879870772362,
"rps_doc_frac_chars_top_3gram": 0.0065980697982013226,
"rps_doc_frac_chars_top_4gram": 0.009818550199270248,
"rps_doc_books_importance": -1520.6593017578125,
"rps_doc_books_importance_length_correction": -1520.6593017578125,
"rps_doc_openwebtext_importance": -991.5350341796875,
"rps_doc_openwebtext_importance_length_correction": -991.5350341796875,
"rps_doc_wikipedia_importance": -777.9812622070312,
"rps_doc_wikipedia_importance_length_correction": -777.9812622070312
},
"fasttext": {
"dclm": 0.9652727246284485,
"english": 0.31691572070121765,
"fineweb_edu_approx": 2.507096290588379,
"eai_general_math": 0.9891322255134583,
"eai_open_web_math": 0.24003666639328003,
"eai_web_code": 0.4993858337402344
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
262,562,947,938,236,160 |
What Is A _Bot_
W
What are Bots and How Do they Work? - WhatIs.com
What are Bots and How Do they Work? – WhatIs.com
A bot — short for “robot” and also called an internet bot — is a computer program that operates as an agent for a user or other program, or to simulate a human activity. Bots are normally used to automate certain tasks, meaning they can run without specific instructions from humans.
An organization or individual can use a bot to replace a repetitive task that a human would otherwise have to perform. Bots are also much faster at these tasks than humans.
How do bots work?
Normally, bots will operate over a network. Bots that can communicate with one another will use internet-based services to do so — such as instant messaging, interfaces like Twitterbots or through Internet Relay Chat (IRC). In general, more than half of internet traffic is bots that interact with web pages, talk with users, scan for content and perform other tasks.
Bots are made from sets of algorithms which aid them in their designated tasks. Tasks bots can normally handle include conversing with a human — which attempts to mimic human behaviors — or gathering content from other websites. There are plenty of different types of bots designed differently to accomplish a wide variety of tasks.
As an example, a chatbot will operate on one of multiple methods of operation. A rule-based chatbot will interact with people by giving pre-defined prompts for the individual to select. An intellectually independent chatbot will make use of machine learning to learn from human inputs as well as watching out for known keywords. AI chatbots are a combination of rule-based and intellectually independent chatbots. Chatbots may also use pattern matching, natural language processing (NLP) and natural language generation (NLG) tools.
Organizations or individuals that make use of bots can also use bot management software, which includes software tools that aid in managing bots and protecting against malicious bots. Bot managers can be included as part of a web app security platform. A bot manager can be used to allow the use of some bots and block the use of others that might cause harm to a system. To do this, a bot manager will classify any incoming requests by humans and good bots and known malicious and unknown bots. Any suspect bot traffic is then directed away from a site by the bot manager. Some basic bot management feature sets include IP rate limiting and CAPTCHAs. IP rate limiting will limit the number of same-address-requests, while CAPTCHAs are used as a sort of puzzle to differentiate bots from humans.
Types of bots
There are numerous types of bots, all with unique goals and tasks. Some common bots include:
A chatbot — which is a program that can simulate talk with a human being. One of the first and most famous chatbots (prior to the web) was Eliza, a program that pretended to be a psychotherapist and answered questions with other questions.
Social bots — which are bots that operate on social media platforms.
A shopbot — which is a program that shops around the web on your behalf and locates the best price for a product you’re looking for. There are also bots such as OpenSesame that observe a user’s patterns in navigating a web site and customize the site for that user.
A knowbot — which is a program that collects knowledge for a user by automatically visiting Internet sites to retrieve information that meets certain specified criteria.
Spiders or crawlers (also known as a web crawler) — which are used to access web sites and gather their content for the indexes in search engines.
Web scraping crawlers — which are similar to crawlers but are used for data harvesting and extracting relevant content.
Monitoring bots — which can be used to monitor the health of a website or system.
Transactional bots — which can be used to complete transactions on behalf of a human.
Bots may also be classified as good bots and bad bots, or in other words, bots that will not harm the system and bots that pose threats and can harm the system.
Examples and uses of bots
Bots can be used in customer service fields as well as in areas like business, scheduling, search functionality and entertainment. Using a bot in each area brings different benefits. For example, in customer service, bots are available 24/7 and increase the availability of customer service employees, allowing them to focus on more complicated issues.
Red and Andrette were names of two early programs that could be customized to answer questions from users seeking service for a product. Such a program is sometimes called a virtual representative or a virtual agent.
Other services that use bots include:
Instant messenger apps such as Facebook Messenger, WhatsApp and Slack;
News apps such as the Wall Street Journal, to show news headlines;
Spotify, which allows users to search for and share tracks via Facebook Messenger;
Lyft, in which a user can request a ride from instant messenger apps; and
Meeting scheduling services, such as
Malicious bots
Malicious bots are bots used to automate actions considered to be cybercrimes. Common types of malicious bots include:
DoS or DDoS bots, which use an overwhelming number of bots to overload a server’s resources and halting the service from operating.
Spambots, which post promotional content to drive traffic to a specific website.
Hackers, which are bots made to distribute malware and attack websites.
Other malicious bots include web crawlers, credential stuffing, email address harvesting and brute force password cracking. Organizations can stop malicious bots by using a bot manager.
Advantages and disadvantages
There are plenty of advantages that come with using bots as well as disadvantages, such as risks that other bots could propose. Some potential advantages of bots include:
Faster than humans at repetitive tasks;
Time saved for customers and clients;
Available 24/7;
Organizations can reach large numbers of people via messenger apps;
Bots are customizable; and
Improved user experience.
Some disadvantages include:
Bots cannot be set to perform some exact tasks and they risk misunderstanding users.
Humans are still necessary to manage the bots as well as to step in if one misinterprets another human.
Bots can be made malicious by users.
Bots can be used for spam.
This was last updated in January 2020
Continue Reading About bot (robot)
Applications of autonomous robots lead in the enterprise
Robot workforce evolves from mimicking tasks to taking on jobs
Cloudflare battles malicious bots with ‘fight mode’
The definitive site about bots is BotSpot.
NativeMinds offers software that provides your company with a virtual representative.
What are bots? – Definition and Explanation - Kaspersky
What are bots? – Definition and Explanation – Kaspersky
Bots – meaning & definition
A ‘bot’ – short for robot – is a software program that performs automated, repetitive, pre-defined tasks. Bots typically imitate or replace human user behavior. Because they are automated, they operate much faster than human users. They carry out useful functions, such as customer service or indexing search engines, but they can also come in the form of malware – used to gain total control over a computer.
Internet bots can also be referred to as spiders, crawlers, or web bots.
What is a computer bot and what is an internet bot?
Computer bots and internet bots are essentially digital tools and, like any tool, can be used for both good and bad.
Good bots carry out useful tasks, however, bad bots – also known as malware bots – carry risk and can be used for hacking, spamming, spying, interrupting, and compromising websites of all sizes. It is estimated that up to half of all internet traffic today is made up of computer bots carrying out certain tasks, such as automating customer service, simulating human communication on social networks, helping companies search online for content and assisting with search engine optimization.
Organizations or individuals use bots to replace repetitive tasks that a human would otherwise have to perform. Tasks run by bots are typically simple and performed at a much faster rate when compared to human activity. Though not all tasks performed by bots are benign – sometimes bots are used for criminal activities such as data theft, scams, or DDoS attacks.
Malware bots and the dangers of internet bots
Malware bots and internet bots can be programmed/hacked to break into user accounts, scan the internet for contact information, to send spam, or perform other harmful acts.
To carry out these attacks and disguise the source of the attack traffic, attackers may distribute bad bots in a botnet – i. e., a bot network. A botnet is a number of internet-connected devices, each running one or more bots, often without the device owners’ knowledge. Because each device has its own IP address, botnet traffic comes from numerous IP addresses, making it harder to identify and block the source of the malicious bot traffic. Botnets can often grow themselves by using devices to send out spam emails, which can infect more machines.
One of the most common ways in which bots infect your computer is via downloads. Malware is delivered in download format via social media or email messages that advise clicking a link. The link is often in picture or video form, with either containing viruses and other malware. If your computer is infected with malware, it may be part of a botnet.
A bot can also appear as a warning saying that your computer will get a virus if you do not click on the associated link. Clicking the link subsequently infects your computer with a virus.
While malware bots create problems and issues for organizations, the dangers for consumers include their potential for carrying out data and identity theft, keylogging sensitive information such as passwords, bank details and addresses, and phishing.
Malicious bots can easily go unnoticed. They are easily hidden within a computer and often have file names and processes similar if not identical to regular system files or processes.
Examples of malicious bots include:
Spambots
Spambots may harvest email addresses from contact or guestbook pages. Alternatively, they may post promotional content in forums or comment sections to drive traffic to specific websites.
Malicious chatterbots
Dating service websites and apps are havens for malicious chatterbots. These chatterbots pretend to be a person, emulating human interaction, and often fool people who don’t realize they are chatting to harmful programs whose goal is to obtain personal information, including credit card numbers, from unsuspecting victims.
File-sharing bots
These bots take the users’ query term (such as a popular movie or artist’s album) and respond to the query stating that they have the file available for download, providing a link. The user clicks on the link, downloads, and opens it, and unknowingly infects their computer.
Credential stuffing
This refers to bots “stuffing” known usernames and passwords (usually sourced from data breaches) into online log-in pages to gain unauthorized access to user accounts.
DoS or DDoS bots
This is where excessive bot traffic is intentionally used to overwhelm a server’s resources and prevent a service from operating.
Denial of inventory attacks
These attacks target online shops to list their products as ‘not available’. In this type of attack, malicious bots access the shopping cart, select items from the online store, and add them to the shopping cart, never completing the transaction. As a result, when a legitimate user wants to buy the product, they receive an out-of-stock message, even if the item is in stock.
Vulnerability scanners
Bots which scan millions of sites for vulnerabilities and report them back to their creator are known as vulnerability scanners. Unlike genuine bots that would inform the website owner, these malicious bots are specifically made to report back to one person who then sells the information or uses it themselves to hack websites.
Click fraud bots
These bots produce a huge amount of malicious bot traffic specifically targeting paid ads to engage in ad fraud. Responsible for fraudulently clicking paid ads, this non-human traffic costs advertisers billions every year and is often disguised as legitimate traffic. Without good bot detection software, this bot activity can cost advertisers a large proportion of their ad budget.
Traffic monitoring
Bots which are used for overloading mail servers or carrying out large-scale data theft.
Why do cybercriminals use bots?
1. To steal financial and personal information
Hackers may use botnets to send phishing or other scams to trick consumers into giving away their money. They may also collect information from the bot-infected machines and use it to steal identities and incur loans or purchase charges in the user’s name.
2. To attack legitimate web services
Criminals may use botnets to create DoS and DDoS attacks that flood a legitimate service or network with a crushing volume of traffic. The volume may severely slow down the company’s service or network’s ability to respond, or it may entirely overwhelm the company’s service or network and shut them down.
3. To extort money from victims
Revenue from DoS attacks comes through extortion (i. e., pay or have your site taken down) or through payments by groups interested in inflicting damage to a company or network. These groups include “hacktivists” — hackers with political agendas as well as foreign military and intelligence organizations.
4. To make money from zombie and botnet systems
Cybercriminals may also lease their botnets to other criminals who want to send spam, scams, phishing, steal identities, and attack legitimate websites and networks.
Types of bots
Aside from malware bots, what do bots do? There are many different types:
Chatbots
Bots that simulate human conversation by responding to certain phrases with programmed responses.
Social bots
Bots which operate on social media platforms, and are used to automatically generate messages, advocate ideas, act as a follower of users, and as fake accounts to gain followers themselves. As social networks become more sophisticated, it is becoming harder for social bots to create fake accounts. It is difficult to identify social bots because they can exhibit similar behavior to real users.
Shop bots
Bots that shop around online to find the best price for products a user is looking for. Some bots can observe a user’s patterns in navigating a website and then customize that site for the user.
Spider bots or web crawlers
Bots that scan content on webpages all over the internet to help Google and other search engines understand how best to answer users’ search queries. Spiders download HTML and other resources, such as CSS, JavaScript, and images, and use them to process site content.
Web scraping crawlers
Bots that read data from websites with the objective of saving them offline and enabling their reuse. This may take the form of scraping the entire content of web pages or scraping web content to obtain specific data points, such as names and prices of products on e-commerce websites.
In some cases, scraping is legitimate and may be allowed by website owners. In other instances, bot operators may be violating website terms of use or stealing sensitive or copyrighted material.
Knowbots
Bots that collect knowledge for users by automatically visiting websites to retrieve information which fulfils certain criteria.
Monitoring bots
Bots used to monitor the health of a website or system. is an example of an independent site that provides real-time status information, including outages, of websites and other kinds of services.
Transactional bots
Bots used to complete transactions on behalf of humans. For example, transactional bots allow customers to make a transaction within the context of a conversation.
Download bots
Bots that are used to automatically download software or mobile apps. They can be used to manipulate download statistics – for example, to gain more downloads on popular app stores and help new apps appear at the top of the charts.
They can also be used to attack download sites, creating fake downloads as part of a Denial of Service (DoS) attack.
Ticketing bots
Bots which automatically purchase tickets to popular events, with the aim of reselling those tickets for a profit. This activity is illegal in many countries, and even when not against the law, it can be a nuisance to event organizers, legitimate ticket sellers, and consumers. Ticketing bots are often sophisticated, emulating the same behaviors as human ticket buyers.
How do bots work?
Typically, bots operate over a network. Bots that can communicate with one another will use internet-based services to do so – such as instant messaging, interfaces like Twitterbots or through Internet Relay Chat (IRC).
Bots are made from sets of algorithms which help them to carry out their tasks. The different types of bots are designed differently to accomplish a wide variety of tasks.
Take chatbots as one example – they have different methods of operation:
A rule-based chatbot interacts with people by giving pre-defined prompts for the individual to select.
An intellectually independent chatbot will use machine learning to learn from human inputs as well as looking out for known keywords.
AI chatbots are a combination of rule-based and intellectually independent chatbots. Additionally, chatbots may also use pattern matching, natural language processing and natural language generation tools.
There are pros and cons to each – organizations which use bots will decide which approach is best based on their requirements.
Advantages and disadvantages of bots
Computer and internet bots – Pros:
Faster than humans at repetitive tasks
They save time for customers and clients.
They reduce labor costs for organizations.
They are available 24/7
Organizations can reach large numbers of people via messenger apps.
They are customizable.
They are multi-purpose.
They can offer an improved user experience.
Computer and internet bots – Cons:
Bots cannot be set to perform some exact tasks, and they risk misunderstanding users – and causing frustration in the process.
Humans are still necessary to manage the bots as well as to step in if one misinterprets another human
Bots can be programmed to be malicious.
Bots can be used for spam.
Examples of bots
The range and variety of bots mean they are used across a wide range of areas, such as customer service, business, search functionality, and entertainment.
Examples of well-known services which use bots include:
Instant messenger apps such as Facebook Messenger, WhatsApp, and Slack.
Chatbots such as Google Assistant and Siri.
The World Health Organization built a bot on WhatsApp to share public information related to the coronavirus pandemic.
National Geographic built a conversational app which supposedly conversed like Albert Einstein would have, to promote their show Genius.
News apps such as the Wall Street Journal, to show news headlines.
Spotify, which allows users to search for and share tracks via Facebook Messenger.
Lyft, Uber’s biggest competitor, allows customers to make requests via Slack, Messenger, and Alexa.
Mastercard allows customers to check their account transactions using the Facebook Messenger bot.
Lidl created a bot to help make wine recommendations to customers.
How to tell if your computer is infected by bots
Ways in which you can tell if your computer is part of a botnet include:
Your computer keeps crashing without an identifiable reason.
Applications that previously worked seamlessly now work in fits and starts.
Programs which previously loaded quickly are now slow to start.
The computer takes a long time to shut down or does not shut down properly.
Your internet access slows to a crawl.
The browser features components you didn’t download.
Windows Task Manager shows programs with cryptic names or descriptions.
Settings have changed, and there is no way to reverse them.
Pop-up windows and advertisements appear even when you are not using a web browser.
The fan goes into overdrive when the device is idle.
Friends and family report receiving email messages from you, but you did not send them.
You cannot download operating system updates.
What to do if your computer is infected by bots
If your computer is already infected by bots, the most important consideration is protecting your data.
Here are some steps to take:
Step 1: Disconnect your computer from the network as soon as possible – this will stop the theft of sensitive information and prevent your computer from being used to attack other networks.
Step 2: Move all important or personal data to another computer or an external hard drive. Ensure these are malware-free before you do.
Step 3: Carry out a factory reset of your machine (bear in mind that as well as targeting the problem, it will also remove files and programs you have created, delete drivers, and return settings to their defaults)
Step 4: Clean your computer using various security tools or by asking a professional to work on the device
Remember, prevention is the best cure when it comes to bots and all other forms of malware. So, it’s important to have cybersecurity installed on all your devices.
How to protect your computer from bots
The difficulty for consumers is that many online customer touchpoints – including websites, mobile apps, and APIs – are being attacked by bots. It is possible to protect your computer from bots, but it requires vigilance and knowing what to look for.
Here are some steps to take to protect your systems from botnet infiltration:
Install anti-malware software
Use comprehensive anti-malware software to protect your device. For example, Kaspersky Total Security blocks viruses and malware in real-time and stops hackers from taking over your PC remotely. Make sure your anti-virus and anti-spyware programs are set to update automatically.
Ensure all your software is up to date
Never ignore system updates. Routinely check for browser and operating system updates and patches.
Use a strong password
A strong password is difficult to guess and includes a combination of uppercase and lowercase letters plus numbers and symbols. Avoid using the same password for multiple accounts. We recommend using a secure password manager tool.
Only click on links you trust
Only click internet links or open emails if you trust the source. Common user risks occur when downloading content from unknown sites or from friends who don’t have up-to-date protections and unwittingly pass infected files to other users.
Always use extreme caution when downloading information or files from someone whose computer is not protected. Avoid using flash drives, or thumb drives, in an infected computer.
Avoid untrustworthy websites and ads
A common way users are tricked into downloading malware bots is through intriguing ads or downloads they come across during web browsing. Be cautious about downloading free versions of software from websites you don’t recognize, and never click on pop-up ads that claim only they can fix your computer’s performance or virus issues. In many cases, interacting with these pages will trigger a malware installation on your computer.
Install a firewall
A firewall can help to block malicious attacks.
Use a bot manager
Organizations can stop malicious bots by using a bot manager. Bot managers can be included as part of a web app security platform.
A bot manager can be used to allow the use of some bots and block the use of others that might cause harm to a system. To do this, a bot manager will classify any incoming requests by humans and good bots and known malicious and unknown bots. Any suspect bot traffic is then directed away from a site by the bot manager.
Some basic bot management feature sets include IP rate limiting and CAPTCHAs. IP rate limiting will limit the number of same-address-requests, while CAPTCHAs often use a puzzle to differentiate bots from humans.
Remember, good bots are a crucial part of the internet’s infrastructure and perform many useful tasks. But bad bots are difficult to detect without an anti-virus program because they are designed to hide in plain sight. So, it is important to be aware of the risks posed by malicious bots, and practice good cybersecurity at all times.
Related Articles:
What is Beta Bot?
AI and Machine Learning in Cybersecurity — How They Will Shape the Future
Deep fake and Fake Videos – How to Protect Yourself?
What is a honeypot?
What Does BOT Mean? - Cyber Definitions
What Does BOT Mean? – Cyber Definitions
Search…
What Does BOT Mean?
BOT means “Robot Player” and “Back On Topic. ”
Robot Player
In this context, BOT is actually an abbreviation of the word “Robot. ” In gaming, it refers to a “Robot Player, ” i. e., an NPC (Non-Player Character) controlled by the game.
Depending on the game, players may compete against or work with BOTs. They may also be able to choose the difficulty of the BOTs they wish to play against.
Back On Topic
BOT is also used in messaging, with the meaning “Back On Topic. ” In this context, BOT indicates that the sender wishes to return to the point of the conversation.
Summary of Key Points
“Robot Player” is the most common definition for BOT on online gaming platforms (such as Discord) and on Snapchat, WhatsApp, Facebook, Twitter, and Instagram.
BOT
Definition:Robot Player
Type:Abbreviation
Guessability:2: Quite easy to guess
Typical Users:
Adults and Teenagers
“Back On Topic” is another definition for BOT.
Definition:Back On Topic
Guessability:
4: Difficult to guess
See Also
New ways to say I love you
Text-speak using just numbers
A list of dating terms
Using the currency symbols
Frequently Asked Questions about what is a _bot_
What is the purpose of bots?
Bots are normally used to automate certain tasks, meaning they can run without specific instructions from humans. An organization or individual can use a bot to replace a repetitive task that a human would otherwise have to perform. Bots are also much faster at these tasks than humans.
What’s an example of a BOT?
Examples of bots Instant messenger apps such as Facebook Messenger, WhatsApp, and Slack. Chatbots such as Google Assistant and Siri. The World Health Organization built a bot on WhatsApp to share public information related to the coronavirus pandemic.
What is a BOT person?
Bots are automated, which means they run according to their instructions without a human user needing to manually start them up every time. Bots often imitate or replace a human user’s behavior. Typically they do repetitive tasks, and they can do them much faster than human users could.
About the author
proxyreview
If you 're a SEO / IM geek like us then you'll love our updates and our website. Follow us for the latest news in the world of web automation tools & proxy servers!
By proxyreview
Recent Posts
Useful Tools
|
{
"url": "https://proxywatcher.com/what-is-a-_bot_/",
"source_domain": "proxywatcher.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "76275",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FOKBNTSGRS46WAW54NMSON7U6ZQEZWXX",
"WARC-Concurrent-To": "<urn:uuid:9449dd85-1788-49be-bb40-fe613f903f7e>",
"WARC-Date": "2023-03-30T08:03:13Z",
"WARC-IP-Address": "104.21.34.126",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JZJK7KKJMDOKGP6ELK2ZOBMDBUD7QFUL",
"WARC-Record-ID": "<urn:uuid:22f8aecf-6f0c-4f87-8f2e-82d6996eedea>",
"WARC-Target-URI": "https://proxywatcher.com/what-is-a-_bot_/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4c897a39-1adc-40ca-b531-a8a938e39318>"
},
"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-84\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
19,
20,
69,
70,
119,
120,
404,
577,
595,
963,
1296,
1829,
2625,
2639,
2732,
2972,
3041,
3307,
3477,
3624,
3744,
3826,
3912,
4073,
4099,
4452,
4669,
4707,
4778,
4845,
4928,
5002,
5039,
5054,
5173,
5305,
5386,
5458,
5644,
5673,
5844,
5884,
5922,
5938,
6006,
6033,
6059,
6087,
6172,
6276,
6313,
6340,
6378,
6413,
6470,
6533,
6585,
6628,
6714,
6770,
6771,
6827,
6828,
6856,
7266,
7339,
7391,
7508,
8000,
8364,
8410,
8583,
9135,
9485,
9674,
9925,
10109,
10145,
10154,
10342,
10364,
10688,
10706,
10981,
11001,
11170,
11187,
11317,
11345,
11722,
11745,
12074,
12091,
12474,
12493,
12582,
12614,
12661,
12918,
12955,
13261,
13293,
13599,
13647,
13813,
13827,
13901,
13910,
14008,
14020,
14416,
14426,
14621,
14649,
14917,
14939,
15225,
15420,
15429,
15558,
15574,
15771,
15790,
15954,
15968,
16200,
16317,
16332,
16703,
16721,
16941,
17113,
17186,
17289,
17423,
17629,
17756,
17793,
17828,
17867,
17909,
17952,
17976,
18044,
18067,
18091,
18135,
18170,
18297,
18400,
18440,
18467,
18484,
18640,
18696,
18768,
18812,
18931,
19068,
19135,
19218,
19318,
19416,
19483,
19532,
19605,
19666,
19742,
19806,
19882,
19921,
19974,
20046,
20106,
20190,
20243,
20331,
20377,
20425,
20529,
20558,
20748,
20884,
21099,
21206,
21370,
21409,
21660,
21738,
21768,
22048,
22087,
22186,
22208,
22440,
22470,
22710,
22889,
22926,
23357,
23376,
23424,
23442,
23573,
23894,
24106,
24442,
24460,
24478,
24552,
24605,
24625,
24665,
24666,
24706,
24707,
24715,
24735,
24782,
24795,
24970,
25126,
25140,
25304,
25326,
25485,
25489,
25513,
25531,
25567,
25582,
25603,
25650,
25675,
25689,
25711,
25720,
25747,
25777,
25800,
25827,
25828,
25877,
25878,
25907,
25908,
26195,
26196,
26224,
26225,
26477,
26478,
26500,
26501,
26789,
26790,
26807,
26808,
26820,
26821,
26986,
26987,
27002,
27003,
27016,
27017
],
"line_end_idx": [
16,
17,
19,
20,
69,
70,
119,
120,
404,
577,
595,
963,
1296,
1829,
2625,
2639,
2732,
2972,
3041,
3307,
3477,
3624,
3744,
3826,
3912,
4073,
4099,
4452,
4669,
4707,
4778,
4845,
4928,
5002,
5039,
5054,
5173,
5305,
5386,
5458,
5644,
5673,
5844,
5884,
5922,
5938,
6006,
6033,
6059,
6087,
6172,
6276,
6313,
6340,
6378,
6413,
6470,
6533,
6585,
6628,
6714,
6770,
6771,
6827,
6828,
6856,
7266,
7339,
7391,
7508,
8000,
8364,
8410,
8583,
9135,
9485,
9674,
9925,
10109,
10145,
10154,
10342,
10364,
10688,
10706,
10981,
11001,
11170,
11187,
11317,
11345,
11722,
11745,
12074,
12091,
12474,
12493,
12582,
12614,
12661,
12918,
12955,
13261,
13293,
13599,
13647,
13813,
13827,
13901,
13910,
14008,
14020,
14416,
14426,
14621,
14649,
14917,
14939,
15225,
15420,
15429,
15558,
15574,
15771,
15790,
15954,
15968,
16200,
16317,
16332,
16703,
16721,
16941,
17113,
17186,
17289,
17423,
17629,
17756,
17793,
17828,
17867,
17909,
17952,
17976,
18044,
18067,
18091,
18135,
18170,
18297,
18400,
18440,
18467,
18484,
18640,
18696,
18768,
18812,
18931,
19068,
19135,
19218,
19318,
19416,
19483,
19532,
19605,
19666,
19742,
19806,
19882,
19921,
19974,
20046,
20106,
20190,
20243,
20331,
20377,
20425,
20529,
20558,
20748,
20884,
21099,
21206,
21370,
21409,
21660,
21738,
21768,
22048,
22087,
22186,
22208,
22440,
22470,
22710,
22889,
22926,
23357,
23376,
23424,
23442,
23573,
23894,
24106,
24442,
24460,
24478,
24552,
24605,
24625,
24665,
24666,
24706,
24707,
24715,
24735,
24782,
24795,
24970,
25126,
25140,
25304,
25326,
25485,
25489,
25513,
25531,
25567,
25582,
25603,
25650,
25675,
25689,
25711,
25720,
25747,
25777,
25800,
25827,
25828,
25877,
25878,
25907,
25908,
26195,
26196,
26224,
26225,
26477,
26478,
26500,
26501,
26789,
26790,
26807,
26808,
26820,
26821,
26986,
26987,
27002,
27003,
27016,
27017,
27029
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27029,
"ccnet_original_nlines": 268,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38356706500053406,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009678060188889503,
"rps_doc_frac_lines_end_with_ellipsis": 0.003717469982802868,
"rps_doc_frac_no_alph_words": 0.1254197061061859,
"rps_doc_frac_unique_words": 0.25141435861587524,
"rps_doc_mean_word_length": 4.988685131072998,
"rps_doc_num_sentences": 250,
"rps_doc_symbol_to_word_ratio": 0.00019751000218093395,
"rps_doc_unigram_entropy": 5.939998626708984,
"rps_doc_word_count": 4419,
"rps_doc_frac_chars_dupe_10grams": 0.1596280336380005,
"rps_doc_frac_chars_dupe_5grams": 0.21828079223632812,
"rps_doc_frac_chars_dupe_6grams": 0.20911771059036255,
"rps_doc_frac_chars_dupe_7grams": 0.1906101256608963,
"rps_doc_frac_chars_dupe_8grams": 0.17682014405727386,
"rps_doc_frac_chars_dupe_9grams": 0.16942617297172546,
"rps_doc_frac_chars_top_2gram": 0.005715580191463232,
"rps_doc_frac_chars_top_3gram": 0.004082560073584318,
"rps_doc_frac_chars_top_4gram": 0.002494900021702051,
"rps_doc_books_importance": -2386.072509765625,
"rps_doc_books_importance_length_correction": -2386.072509765625,
"rps_doc_openwebtext_importance": -1121.0140380859375,
"rps_doc_openwebtext_importance_length_correction": -1121.0140380859375,
"rps_doc_wikipedia_importance": -949.1935424804688,
"rps_doc_wikipedia_importance_length_correction": -949.1935424804688
},
"fasttext": {
"dclm": 0.3923642039299011,
"english": 0.931297779083252,
"fineweb_edu_approx": 2.9549970626831055,
"eai_general_math": 0.08638607710599899,
"eai_open_web_math": 0.15582400560379028,
"eai_web_code": 0.13808917999267578
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,093,653,488,495,020,000 |
« Permalinks for California Bills?E-voting and Direct Democracy »
2 comments
1. § Neal McBurnett Email said on :
Thanks, Joe.
This chrome extension works great for this, including optional notification popups and sounds: chrome.google.com/extensions/detail/pemhgklkefakciniebenbfclihhmmfcd?hl=en
See other options for firefox and chrome at http://blog.webdistortion.com/2010/06/07/page-monitoring-services/
2. § peter Email said on :
You can try TheWebWatcher.com (http://www.thewebwatcher.com) - it's free and has small monitoring intervals like 10 minutes.
Contact / Help. (cc) 2021 by Joseph Hall. multi-blog / web hosting reviews.
Design & icons by N.Design Studio. Skin by Tender Feelings / Evo Factory.
And a few words about the structure of the eye . Everyone " retina ". Especially often we hear it buy clomid online in the phrase " retinal detachment ." So what is the retina ? This - the front edge of the brain, the most distant from the brain part of the visual analyzer. The retina receives light first , processes and transforms light energy into irritation - a signal that encodes all the information about what the eye sees . The retina is very complex and in their structure and function . Its structure resembles the structure of the cerebral cortex. The shell of the retina is very thin - about 0.14 mm.
|
{
"url": "https://josephhall.org/nqb2/index.php/chkpgchng",
"source_domain": "josephhall.org",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "36369",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MPQOY7DUPXZBGXWOL6AVV6TTDKIS6KHX",
"WARC-Concurrent-To": "<urn:uuid:469bfb37-6d55-4491-84be-9e78c415bd0f>",
"WARC-Date": "2021-06-13T01:26:27Z",
"WARC-IP-Address": "209.188.86.89",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:MU4UQ7PB3MEYKZ6ESVUIQCAPYTEDK3OR",
"WARC-Record-ID": "<urn:uuid:df354890-47bb-4707-9947-86c5d0b684db>",
"WARC-Target-URI": "https://josephhall.org/nqb2/index.php/chkpgchng",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d815787-556f-402b-9696-21abcb05bb2c>"
},
"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-232.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,
66,
67,
78,
79,
117,
134,
135,
309,
310,
425,
454,
583,
659,
733
],
"line_end_idx": [
66,
67,
78,
79,
117,
134,
135,
309,
310,
425,
454,
583,
659,
733,
1346
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1346,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26334521174430847,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007117439992725849,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2846975028514862,
"rps_doc_frac_unique_words": 0.6931216716766357,
"rps_doc_mean_word_length": 5.518518447875977,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.594513893127441,
"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.023969320580363274,
"rps_doc_frac_chars_top_3gram": 0.02109299972653389,
"rps_doc_frac_chars_top_4gram": 0.03259826824069023,
"rps_doc_books_importance": -107.3393325805664,
"rps_doc_books_importance_length_correction": -107.33932495117188,
"rps_doc_openwebtext_importance": -56.14421081542969,
"rps_doc_openwebtext_importance_length_correction": -56.14421081542969,
"rps_doc_wikipedia_importance": -57.27726364135742,
"rps_doc_wikipedia_importance_length_correction": -57.261253356933594
},
"fasttext": {
"dclm": 0.022172870114445686,
"english": 0.8369396924972534,
"fineweb_edu_approx": 1.7012219429016113,
"eai_general_math": 0.009124820120632648,
"eai_open_web_math": 0.25829607248306274,
"eai_web_code": 0.0005944999866187572
}
}
|
{
"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": "612.82",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Physiology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
827,359,979,161,956,100 |
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Reciprocal of cos?
1. Nov 29, 2015 #1
Why 1 divided by cos(pi/4)=cos(-pi/4)?
Is it wrong to say 1/cos(pi/4)=sec(pi/4)?
Thanks
2. jcsd
3. Nov 29, 2015 #2
Hi ryan:
Is it wrong to say 1/cos(pi/4)=sec(pi/4)?
1/cos(pi/4)=sec(pi/4) is correct.
Why 1 divided by cos(pi/4)=cos(-pi/4)?
I think you are asking: Why is the following correct?
1/cos(pi/4) = 1/cos(-pi/4)?
If this is what you are asking, the reason that is correct is because
cos(pi/4) = cos(-pi/4),
which is because
the cos function is symmetrical,
and because
the reciprocal of two equal numbers will be equal.
I hope this is helpful.
BTW: The title of the thread does not match your question. The inverse of the cos is the arccos, which is not the same as the reciprocal, 1/cos.
Regards,
Buzz
Last edited: Nov 29, 2015
4. Nov 29, 2015 #3
Thanks you
5. Nov 29, 2015 #4
Mark44
Staff: Mentor
The thread title is now "Reciprocal of cos".
6. Dec 1, 2015 #5
Hello,
1/cos(pi/4) is not equal to cos(-pi/4). Cos(-pi/4) is equal to cos(pi/4). It is because cos function is an even function and it produces same answer to negative and positive values. I can give you a simple reason that 0 and 2pi is same in angles and 0-pi/4 is same as 2pi-pi/4 if you see graph paper, rotate a line from positive X-axis in anti-clock wise direction it lies in fourth quadrant. Now, you see x co-ordinate is positive and hypotenuse is length so it's positive. Hence, base/hypotenuse is positive.
I hope this one helps and if any other query regarding my answer please ask.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
|
{
"url": "https://www.physicsforums.com/threads/reciprocal-of-cos.845611/",
"source_domain": "www.physicsforums.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "60398",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YELSE2JX7GMHOXND5QMHQPKGGWK2E3J4",
"WARC-Concurrent-To": "<urn:uuid:b31093c8-1110-49f4-8462-51551aec903e>",
"WARC-Date": "2017-08-24T07:33:43Z",
"WARC-IP-Address": "74.86.200.109",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PFRXFN6XSU72NGCDBCXR7BJH5RZK3N2F",
"WARC-Record-ID": "<urn:uuid:820f76a8-4b58-4a48-acb7-d92ee9e91c06>",
"WARC-Target-URI": "https://www.physicsforums.com/threads/reciprocal-of-cos.845611/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:526aaff6-f0a6-40a9-afeb-51be717fd911>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-28-40.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,
15,
42,
150,
151,
170,
171,
192,
235,
281,
282,
293,
299,
309,
330,
343,
344,
391,
429,
430,
474,
532,
565,
639,
668,
689,
727,
743,
799,
800,
828,
829,
978,
979,
992,
1001,
1007,
1037,
1058,
1073,
1079,
1100,
1101,
1112,
1113,
1131,
1132,
1181,
1187,
1207,
1218,
1219,
1734,
1735,
1816,
1822
],
"line_end_idx": [
15,
42,
150,
151,
170,
171,
192,
235,
281,
282,
293,
299,
309,
330,
343,
344,
391,
429,
430,
474,
532,
565,
639,
668,
689,
727,
743,
799,
800,
828,
829,
978,
979,
992,
1001,
1007,
1037,
1058,
1073,
1079,
1100,
1101,
1112,
1113,
1131,
1132,
1181,
1187,
1207,
1218,
1219,
1734,
1735,
1816,
1822,
1920
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1920,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26915115118026733,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012422359548509121,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3706004023551941,
"rps_doc_frac_unique_words": 0.5215947031974792,
"rps_doc_mean_word_length": 4.348837375640869,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.010351969860494137,
"rps_doc_unigram_entropy": 4.67974328994751,
"rps_doc_word_count": 301,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.021390369161963463,
"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.019098550081253052,
"rps_doc_frac_chars_top_3gram": 0.034377388656139374,
"rps_doc_frac_chars_top_4gram": 0.01986248977482319,
"rps_doc_books_importance": -215.94439697265625,
"rps_doc_books_importance_length_correction": -215.94439697265625,
"rps_doc_openwebtext_importance": -110.07920837402344,
"rps_doc_openwebtext_importance_length_correction": -110.07920837402344,
"rps_doc_wikipedia_importance": -28.632680892944336,
"rps_doc_wikipedia_importance_length_correction": -28.632680892944336
},
"fasttext": {
"dclm": 0.8929150700569153,
"english": 0.9137763381004333,
"fineweb_edu_approx": 2.443859815597534,
"eai_general_math": 0.3776118755340576,
"eai_open_web_math": 0.6391147971153259,
"eai_web_code": 0.00039070998900569975
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"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": "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": "6",
"label": "Indeterminate"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,862,641,629,111,710,000 |
Is standalone companion working?
I can get all of the way to selecting a provider including Dropbox or Google Drive, but then the system responds that I have a malformed request.
• in google drive, I get a message that I didn’t provide a client id. Isn’t that the KEY?
• in Dropbox, I get a message that my redirect URL isn’t https. It is.
Do I need to set up an express server to get this to work?
Thanks,
Hi, there is not enough information here to help. Going to need to see how you integrate or use Companion + Uppy code. But the errors very likely indicate you misconfigured the apps and Companion is working fine.
I was able to get a lot farther by using the JSON configuration option. This allowed me to turn on debugging, which does not seem to be supported in the environment variables? At present, google key and secret are being accepted properly based upon the JSON configuration. I haven’t had time to check whether the exact same configuration works with environment variables.
At present, I am having trouble with implicit paths. The public service instance is at cuahsi-dev-1.hydroshare.org/uppy . NGINX is happiest when I make the path to the server implicit, so that the actual backend server doesn’t have a path, while parts of the client only seem to know about explicit paths. At present, the final redirect from google back to my application responds without the implicit path. This seems to be a setting in the JavaScript client???
I have companion working but there are things I don’t understand about how it works. I will post a more relevant question.
|
{
"url": "https://community.transloadit.com/t/is-standalone-companion-working/16138",
"source_domain": "community.transloadit.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "24189",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z5UTJBZ5FBXNKQFS5O6IFIZGBFR3AHXO",
"WARC-Concurrent-To": "<urn:uuid:95197091-5b41-4ee3-a1cf-2c701ad22388>",
"WARC-Date": "2022-07-07T14:03:44Z",
"WARC-IP-Address": "64.62.250.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AZ5CCQRRG2IQIDU3NSCN76LVDXXT2I5M",
"WARC-Record-ID": "<urn:uuid:86073733-4009-4299-b24b-2fb2ed60195d>",
"WARC-Target-URI": "https://community.transloadit.com/t/is-standalone-companion-working/16138",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7cf27d9b-0848-4d28-a29b-29b5b537ce93>"
},
"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-163\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
180,
181,
273,
346,
347,
406,
407,
415,
416,
629,
630,
1002,
1003,
1466,
1467
],
"line_end_idx": [
33,
34,
180,
181,
273,
346,
347,
406,
407,
415,
416,
629,
630,
1002,
1003,
1466,
1467,
1589
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1589,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42168673872947693,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05421686917543411,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14156627655029297,
"rps_doc_frac_unique_words": 0.5559566617012024,
"rps_doc_mean_word_length": 4.545126438140869,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.675623893737793,
"rps_doc_word_count": 277,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02541700005531311,
"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.009531370364129543,
"rps_doc_frac_chars_top_3gram": 0.007942809723317623,
"rps_doc_frac_chars_top_4gram": 0.019062750041484833,
"rps_doc_books_importance": -161.57850646972656,
"rps_doc_books_importance_length_correction": -148.15521240234375,
"rps_doc_openwebtext_importance": -82.41825103759766,
"rps_doc_openwebtext_importance_length_correction": -82.41825103759766,
"rps_doc_wikipedia_importance": -79.18724060058594,
"rps_doc_wikipedia_importance_length_correction": -65.40608215332031
},
"fasttext": {
"dclm": 0.15602123737335205,
"english": 0.9228248596191406,
"fineweb_edu_approx": 1.2118784189224243,
"eai_general_math": 0.9425148963928223,
"eai_open_web_math": 0.3714773654937744,
"eai_web_code": 0.5656506419181824
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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
|
-4,599,822,825,161,982,500 |
猫でもわかるWeb開発・プログラミング
本業エンジニアリングマネージャー。副業Webエンジニア。Web開発のヒントや、副業、日常生活のことを書きます。
AWS で S3 の特定のバケットだけアクセス可能な IAM ポリシーを作成するのにつまづいた
f:id:yoshiki_utakata:20201225212533p:plain
結論
正しい書き方はこうっぽい
{
"Version": "2012-10-17",
"Statement": [
{
"Effect": "Allow",
"Action": "s3:*",
"Resource": [
"arn:aws:s3:::lgtmoon-dev",
"arn:aws:s3:::lgtmoon-dev/*"
]
}
]
}
誤った書き方
最初はこう書いていた。
{
"Version": "2012-10-17",
"Statement": [
{
"Effect": "Allow",
"Action": "s3:*",
"Resource": [
"arn:aws:s3:::lgtmoon-dev"
]
}
]
}
だってなんかそれっぽいじゃん。
権限の確認方法
権限の確認には AWS CLI を使うと良い。AWS CLI の詳細は割愛。インストール方法は pip install awscli
AWS CLI の S3 関連のコマンドは以下の Qiita が参考になる。
qiita.com
作成した IAM ポリシーを付与したユーザーを作り、access key id と secret access key を生成する。生成した key と secret を ~/.aws.credentials に追記する。プロファイル名を lgtmoon_dev とした。
[lgtmoon_dev]
aws_access_key_id =
aws_secret_access_key =
region = ap-northeast-1
aws s3 ls s3://バケット名 --profile プロファイル名 等のコマンドで、権限が正常に付与されていることを確認する。
# バケットに入っているファイル一覧を取得する
$ aws s3 ls s3://lgtmoon-dev --profile lgtmoon_dev
2020-12-24 13:05:42 131222 10
# ファイルをアップロードしてみる
$ aws s3 cp ~/Downloads/IMG_0755.JPG s3://lgtmoon-dev/test --profile lgtmoon_dev
upload: Downloads/IMG_0755.JPG to s3://lgtmoon-dev/test
バケットの中身を見られる権限と、アップロードの権限が付与されていることがわかる。
ファイルの中身を取得する権限など、細かく権限が別れているので、付与している権限をもとに、上記 Qiita に書いてあるコマンドを試し、正しく権限が付与できているかどうか確認する。
例えば、単に aws s3 ls とするとバケット一覧が取得できるが、この IAM ポリシーではバケット一覧を表示する権限はなく、アクセスが弾かれる。
$ aws s3 ls --profile lgtmoon_dev
An error occurred (AccessDenied) when calling the ListBuckets operation: Access Denied
まとめ
IAM の S3 回りの権限を正しく付与するのは大変。
でも、権限を雑に設定しているほうが危険なので、頑張ってちゃんと設定しよう。
|
{
"url": "https://www.utakata.work/entry/2020/12/26/112615",
"source_domain": "www.utakata.work",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "66945",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6I7CQJX4AIR5OEYE3G3L5BV6O47KL5BX",
"WARC-Concurrent-To": "<urn:uuid:6ca7c0f6-4d35-4503-a47f-72cbcf3f2231>",
"WARC-Date": "2024-08-11T22:47:55Z",
"WARC-IP-Address": "54.199.90.60",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CSAZQYCTZPTSUB5S7LIQAU2EIDLOTN7I",
"WARC-Record-ID": "<urn:uuid:c3ee7518-eb45-4433-87d6-476ccc5d6e9c>",
"WARC-Target-URI": "https://www.utakata.work/entry/2020/12/26/112615",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e08422dc-7b14-4a05-bcc0-29d3a5967eee>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-252\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
20,
21,
77,
78,
126,
127,
170,
171,
174,
175,
188,
189,
191,
220,
239,
249,
280,
310,
336,
380,
425,
439,
449,
455,
457,
458,
465,
466,
478,
479,
481,
510,
529,
539,
570,
600,
626,
669,
683,
693,
699,
701,
702,
718,
719,
727,
728,
795,
796,
835,
836,
846,
847,
984,
985,
999,
1020,
1045,
1069,
1070,
1139,
1140,
1164,
1215,
1249,
1250,
1268,
1349,
1405,
1406,
1447,
1448,
1538,
1539,
1615,
1616,
1650,
1651,
1738,
1739,
1743,
1744,
1772,
1773
],
"line_end_idx": [
20,
21,
77,
78,
126,
127,
170,
171,
174,
175,
188,
189,
191,
220,
239,
249,
280,
310,
336,
380,
425,
439,
449,
455,
457,
458,
465,
466,
478,
479,
481,
510,
529,
539,
570,
600,
626,
669,
683,
693,
699,
701,
702,
718,
719,
727,
728,
795,
796,
835,
836,
846,
847,
984,
985,
999,
1020,
1045,
1069,
1070,
1139,
1140,
1164,
1215,
1249,
1250,
1268,
1349,
1405,
1406,
1447,
1448,
1538,
1539,
1615,
1616,
1650,
1651,
1738,
1739,
1743,
1744,
1772,
1773,
1810
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1810,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0.004419890232384205,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.01445087045431137,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05202312022447586,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6300578117370605,
"rps_doc_frac_unique_words": 0.6423357725143433,
"rps_doc_mean_word_length": 9.47445297241211,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.00578034995123744,
"rps_doc_unigram_entropy": 4.23647928237915,
"rps_doc_word_count": 137,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10631740838289261,
"rps_doc_frac_chars_dupe_6grams": 0.10631740838289261,
"rps_doc_frac_chars_dupe_7grams": 0.10631740838289261,
"rps_doc_frac_chars_dupe_8grams": 0.10631740838289261,
"rps_doc_frac_chars_dupe_9grams": 0.10631740838289261,
"rps_doc_frac_chars_top_2gram": 0.019260400906205177,
"rps_doc_frac_chars_top_3gram": 0.021571649238467216,
"rps_doc_frac_chars_top_4gram": 0.04622495919466019,
"rps_doc_books_importance": -126.6473159790039,
"rps_doc_books_importance_length_correction": -123.0658187866211,
"rps_doc_openwebtext_importance": -60.72831726074219,
"rps_doc_openwebtext_importance_length_correction": -60.72831726074219,
"rps_doc_wikipedia_importance": -80.32571411132812,
"rps_doc_wikipedia_importance_length_correction": -80.24344635009766
},
"fasttext": {
"dclm": 0.8294373750686646,
"english": 0.0015307699795812368,
"fineweb_edu_approx": 2.3859994411468506,
"eai_general_math": 0.02011715993285179,
"eai_open_web_math": 0.0454372800886631,
"eai_web_code": 0.7670426368713379
}
}
|
{
"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.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,468,086,544,617,253,000 |
2.5/5 (2)
What is rundll32 virus?
Rundll32.exe is a normal system file that is the essential part of Windows, which is responsible for running certain aspects of applications like Internet Explorer. If you have some problems with this file on your computer and your OS often shows you different error messages, including the names of this file, you should find out what is the reason of the problem. If the reason is infection, then you should remove rundll32 virus as soon as possible.
rundll32.exe virus
How to detect rundll32 virus on the computer?
Windows system files are easy target for viruses infections, as it is quite difficult to locate malicious files among windows’ files. The problem with rundll32 might be caused by a system error, but it can also turn out to be that your computer is infected with rundll32.exe virus and all the problems are because of its viral activity. Let’s define the reason of the error case. Here’s the list of possible symptoms that were caused by viruses:
1. You can’t use your browser as you like, because all the pages are constantly redirected. Usually viruses redirect the pages of search engines or their results and you can’t find anything you are looking for, including the information about viruses and the methods of their removal;
2. Sometimes you cannot access some very important parts of your system, for example your Task Manager is blocked and you can’t open some settings via Control Panel, or some other system settings;
3. You can notice also that rundll32.exe process spends high CPU (ranging from 40% to 100%);
4. Noticeable slowdown of the performance on the computer, errors of unknown type.
rundll32.exe virus
How to remove rundll32 virus from your computer?
The best and easiest way to remove rundll32 virus from your computer is to use special anti-malware program that has this threat in its database. The program is fully automated, all you need to do is to download and install it. Once you’ve installed anti-malware application, run the scan of your system and select to remove all the threats.
SpyHunter 4 – it scans your computer and detects rundll32 virus, then removes it with all of the related malicious files, folders and registry keys. One of the best features of this program – large threat’s database, that includes rundll32 virus. After deep scanning of your system, it will easily find and delete rundll32 virus. Use this removal tool to get rid of rundll32 virus for FREE.
Download Removal Tool
windows compatible
How to remove rundll32 virus manually
1. Open your Task Manager and stop viral rundll32.exe process. You can detect it by the high usage of CPU (ranging from 40% to 100%);
2. Open Registry Editor, by pressing Win+R buttons and typing regedit in the line. Then navigate the following Registry Keys and remove them:
3. HKEY_LOCAL_MACHINE\SOFTWARE\MICROSOFT\WINDOWS\CURRENTVERSION\RUN\XTray.exe
4. Find all the files that can be called like rundll32, except the file that exist in C:\Windows\System32\ folder;
5. After that you should do the full scan of your computer with the help of a powerful antivirus program. Our team strongly recommend you to download SpyHunter removal tool – it will completely remove rundll32 virus from your computer, thus free you from all the difficulties.
Please rate this
How to remove rundll32 virus
Leave a Reply
Your email address will not be published. Required fields are marked *
Time limit is exhausted. Please reload CAPTCHA.
|
{
"url": "http://www.besttechtips.org/how-to-remove-rundll32-virus/",
"source_domain": "www.besttechtips.org",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "47008",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VP4UKYMC6J7CGRV76B64ZSQPVWJBLXPG",
"WARC-Concurrent-To": "<urn:uuid:f8585bac-02b7-4c2d-98ef-f9194f0b9525>",
"WARC-Date": "2018-02-22T14:21:59Z",
"WARC-IP-Address": "64.79.100.146",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2XVL7BVBQSCEJMC4JKQNM77CMBMP3WO3",
"WARC-Record-ID": "<urn:uuid:24ba736a-6e22-4f14-8f6a-b9ee0cc13af0>",
"WARC-Target-URI": "http://www.besttechtips.org/how-to-remove-rundll32-virus/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c797ed0-3a05-418d-8312-5721d401cc6d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-211-198.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
11,
35,
36,
489,
490,
509,
510,
556,
557,
1003,
1004,
1291,
1490,
1585,
1670,
1671,
1690,
1691,
1740,
1741,
2083,
2084,
2475,
2497,
2516,
2517,
2555,
2556,
2692,
2836,
2916,
2917,
3034,
3313,
3314,
3331,
3332,
3361,
3362,
3376,
3377,
3448,
3449
],
"line_end_idx": [
10,
11,
35,
36,
489,
490,
509,
510,
556,
557,
1003,
1004,
1291,
1490,
1585,
1670,
1671,
1690,
1691,
1740,
1741,
2083,
2084,
2475,
2497,
2516,
2517,
2555,
2556,
2692,
2836,
2916,
2917,
3034,
3313,
3314,
3331,
3332,
3361,
3362,
3376,
3377,
3448,
3449,
3496
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3496,
"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.3884892165660858,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018705040216445923,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16978417336940765,
"rps_doc_frac_unique_words": 0.42556917667388916,
"rps_doc_mean_word_length": 4.89141845703125,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9692792892456055,
"rps_doc_word_count": 571,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07232367247343063,
"rps_doc_frac_chars_dupe_6grams": 0.05406372994184494,
"rps_doc_frac_chars_dupe_7grams": 0.026494810357689857,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05585391819477081,
"rps_doc_frac_chars_top_3gram": 0.040816329419612885,
"rps_doc_frac_chars_top_4gram": 0.0300751905888319,
"rps_doc_books_importance": -375.7543029785156,
"rps_doc_books_importance_length_correction": -375.7543029785156,
"rps_doc_openwebtext_importance": -205.63856506347656,
"rps_doc_openwebtext_importance_length_correction": -205.63856506347656,
"rps_doc_wikipedia_importance": -142.68182373046875,
"rps_doc_wikipedia_importance_length_correction": -142.68182373046875
},
"fasttext": {
"dclm": 0.03815435990691185,
"english": 0.919169008731842,
"fineweb_edu_approx": 2.2433254718780518,
"eai_general_math": 0.023603620007634163,
"eai_open_web_math": 0.20948249101638794,
"eai_web_code": 0.00041442998917773366
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "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": "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
|
7,177,228,577,597,980,000 |
1
I have a couple of Cisco WLC 5508 systems. They are set up as follows:
• System A: (Mgmt IP 172.16.1.4/24) (Redundancy Mgmt Ip 172.16.1.5) SSO Mode ENABLED
• System B: (Mgmt IP 172.16.1.15/24) (Redundancy Mgmt Ip 172.16.1.16) SSO Mode DISABLED
FWIW, I have a Cat5e cable run between the two redundant ports.
My problem is that I can ping all addresses above, except 172.16.1.16. My question is whether this is expected or not. If I'm not supposed to be able to ping 172.16.1.16, then under what conditions should I be able to ping it?
1 Answer 1
1
The redundancy management address is only pingable if the controller is configured in SSO mode.
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://networkengineering.stackexchange.com/questions/56861/cisco-wlc-5508-cannot-ping-redundancy-mgmt-ip/57073",
"source_domain": "networkengineering.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "155617",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZOB77AMN7KVF2CQ5TAHWOKIFGBGBPWJM",
"WARC-Concurrent-To": "<urn:uuid:5ad7e869-56a7-4144-bdae-1d82c75d1613>",
"WARC-Date": "2024-05-26T18:44:52Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ACYCBFZ2F54QHOIVALQBCVEUR6RA3L3D",
"WARC-Record-ID": "<urn:uuid:0ec81a35-622b-49b7-9864-443e02357d30>",
"WARC-Target-URI": "https://networkengineering.stackexchange.com/questions/56861/cisco-wlc-5508-cannot-ping-redundancy-mgmt-ip/57073",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23c8e28c-067c-42d6-a7d6-2eae56293882>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
74,
75,
162,
252,
253,
317,
318,
545,
546,
557,
558,
560,
561,
657,
658,
670,
671,
787,
788
],
"line_end_idx": [
2,
3,
74,
75,
162,
252,
253,
317,
318,
545,
546,
557,
558,
560,
561,
657,
658,
670,
671,
787,
788,
878
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 878,
"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.2805429995059967,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07239819318056107,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.36199095845222473,
"rps_doc_frac_unique_words": 0.6513158082962036,
"rps_doc_mean_word_length": 4.388157844543457,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.434894561767578,
"rps_doc_word_count": 152,
"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.03598200902342796,
"rps_doc_frac_chars_top_3gram": 0.017991000786423683,
"rps_doc_frac_chars_top_4gram": 0.03598200902342796,
"rps_doc_books_importance": -114.56978607177734,
"rps_doc_books_importance_length_correction": -114.56978607177734,
"rps_doc_openwebtext_importance": -52.652870178222656,
"rps_doc_openwebtext_importance_length_correction": -45.90983200073242,
"rps_doc_wikipedia_importance": -27.021028518676758,
"rps_doc_wikipedia_importance_length_correction": -27.021028518676758
},
"fasttext": {
"dclm": 0.12834393978118896,
"english": 0.8982502222061157,
"fineweb_edu_approx": 1.2654956579208374,
"eai_general_math": -0.00000869999985297909,
"eai_open_web_math": 0.041689399629831314,
"eai_web_code": -0.000009059999683813658
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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": "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,597,910,258,926,777,300 |
Problems with distributed package
I have been having troubles using the Distributed package. I have one function that returns a 100 x 4 array. This array is produced by averaging over some dimensions of a SharedArray that is constructed with a distributed for, the code looks something like
@everywhere function GenerateMatrix(H::sparsearray, indices::Array{Int}, a::Float64)
Gavg = SharedArray{Float64}(100, length(indices))
Z = Array{Float64}(undef, 100, 4)
G = lu(a*sparse(I, size(H)) - H) #new array, same size as H
@sync @distributed for i=1:length(indices)
main_ind = indices[i]
Gmain = G[:, main_ind]
...
#Other for operations that fill the matrix Gavg
end
Z[:,1] = mean(G_avg, dims=2)
#And other operations up to Z[:,4]
return Z
end
This function has no problems whatsover by itself, the problem comes when I try to generate several of these Z arrays and average them over and over, rewriting the same file and saving as checkpoints every factor of 1000, as follows
using DelimitedFiles
function IterateFiles(a::Float64, N)
for j=1:N
...
#Create H and the respective indices vector
Z = GenerateMatrix(H, indices, a)
if j==1
writedlm("Z_sample"*string(j), Z)
else
Zprev = readdlm("Z_sample"*string(j-1))
Ztemp = (Zprev *(j-1)+ Z)/j
writedlm("Z_sample"*string(j), Ztemp)
if (j-1)%1000 != 0 #this deletes the previous file unless it corresponds to a checkpoint
rm("Z_sample"*string(j-1))
end
end
This code excutes just fine and produce files as expected, however it stops producing files after (a random number) of several iterations of the function IterateFiles. It does not produce an error message. When I check the workers with ps auxr in the terminal, at the beginning shows that the program is working just fine and the selected number of processors with the distributed are being used, but a bit after ps auxr just displays the original instruction sent but no other workers from the distributed, and after this happens no new files are produced.
I though it was an memory error but that doesn’t seem to be the problem. There’s no error message nor the main instruction to run the code stops, julia -p 8 code.jl still appears as an outgoing work but is no longer producing results.
I have no clue of what can be going on. I’d greatly appreciate any insight or help you can provide to this.
|
{
"url": "https://discourse.julialang.org/t/problems-with-distributed-package/113893",
"source_domain": "discourse.julialang.org",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "22585",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MS4OY3ARN7J7HXYAE6WPP3O2JHGX2H2G",
"WARC-Concurrent-To": "<urn:uuid:a7e5d1a9-29b6-47a5-bbaa-9d3ab86c07d6>",
"WARC-Date": "2024-05-28T22:47:10Z",
"WARC-IP-Address": "184.105.99.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I3B7F4RPLS4EHRKSTWDYJZY74Y37KZTB",
"WARC-Record-ID": "<urn:uuid:be41d57b-bb4f-4b25-8649-f9802e47f8df>",
"WARC-Target-URI": "https://discourse.julialang.org/t/problems-with-distributed-package/113893",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd20bd9c-ea30-43a7-8435-9f4c4007d7ab>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-241\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
292,
293,
378,
431,
468,
531,
577,
609,
642,
657,
715,
723,
756,
795,
808,
813,
814,
1047,
1048,
1069,
1106,
1124,
1141,
1198,
1245,
1266,
1317,
1335,
1391,
1437,
1491,
1596,
1643,
1663,
1675,
1676,
2234,
2235,
2470,
2471
],
"line_end_idx": [
34,
35,
292,
293,
378,
431,
468,
531,
577,
609,
642,
657,
715,
723,
756,
795,
808,
813,
814,
1047,
1048,
1069,
1106,
1124,
1141,
1198,
1245,
1266,
1317,
1335,
1391,
1437,
1491,
1596,
1643,
1663,
1675,
1676,
2234,
2235,
2470,
2471,
2578
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2578,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0.0023273900151252747,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34535104036331177,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04933585971593857,
"rps_doc_frac_lines_end_with_ellipsis": 0.046511631458997726,
"rps_doc_frac_no_alph_words": 0.27703985571861267,
"rps_doc_frac_unique_words": 0.5600000023841858,
"rps_doc_mean_word_length": 5.059999942779541,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.013282730244100094,
"rps_doc_unigram_entropy": 4.985944747924805,
"rps_doc_word_count": 350,
"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.00846979022026062,
"rps_doc_frac_chars_top_3gram": 0.021456800401210785,
"rps_doc_frac_chars_top_4gram": 0.025974029675126076,
"rps_doc_books_importance": -225.33349609375,
"rps_doc_books_importance_length_correction": -225.33349609375,
"rps_doc_openwebtext_importance": -121.5732650756836,
"rps_doc_openwebtext_importance_length_correction": -121.5732650756836,
"rps_doc_wikipedia_importance": -111.27595520019531,
"rps_doc_wikipedia_importance_length_correction": -111.27595520019531
},
"fasttext": {
"dclm": 0.32627391815185547,
"english": 0.8858734369277954,
"fineweb_edu_approx": 1.5901315212249756,
"eai_general_math": 0.9954909086227417,
"eai_open_web_math": 0.49309372901916504,
"eai_web_code": 0.9925077557563782
}
}
|
{
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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": "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
|
2,693,092,667,808,172,000 |
Sunday
March 1, 2015
Homework Help: Algebra 2
Posted by Sira on Tuesday, May 8, 2012 at 3:33am.
What would be the simplest way to eliminate one of the variables? Below is a system of three equations in three variables:
1. x+y+3z=7
2. 2x-4y+z=7
3. 3x+5y-4z=-6
Answer this Question
First Name:
School Subject:
Answer:
Related Questions
Algebra 2 - 1.) Write a system of equations that has NO solution. 2.) If you ...
Algebra 2 - 1.) Write a system of equations that has NO solution. 2.) If you ...
Algebra 2 - 1.) Write a system of equations that has NO solution. 2.) If you ...
to annonymus can you help me with math - How do i solve inequalitites with three...
quick question regarding equations - I know there are methods out there but what...
algebra 2 - how do u solve a system of linear equations in three variables? for ...
algebra attn Reiny - Thanks for your help with the solving of the three ...
algebra1/McDougal Littell - evaluate the expression for the given values of the ...
Algebra question - When you solve a system of equations by the substitution ...
math - solve the system of equations in three variables -3x+y-z=-10
Members
|
{
"url": "http://www.jiskha.com/display.cgi?id=1336462402",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "8675",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y5E4PDLLLGHA3F54UK474AI6RA5LE34X",
"WARC-Concurrent-To": "<urn:uuid:637317f2-5c24-4173-9b6a-4805fe86beed>",
"WARC-Date": "2015-03-01T15:09:16Z",
"WARC-IP-Address": "69.16.226.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QMGZGXF76SUJHCQKXE7563BCN5TZFQKA",
"WARC-Record-ID": "<urn:uuid:f741435e-9b9a-44ba-8510-7a98924db202>",
"WARC-Target-URI": "http://www.jiskha.com/display.cgi?id=1336462402",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b0e6660-c66c-443f-804c-2ddb88436ec5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
21,
22,
47,
48,
98,
99,
222,
234,
247,
262,
263,
284,
285,
297,
313,
321,
322,
340,
341,
422,
503,
584,
668,
752,
836,
912,
996,
1076,
1144,
1145
],
"line_end_idx": [
7,
21,
22,
47,
48,
98,
99,
222,
234,
247,
262,
263,
284,
285,
297,
313,
321,
322,
340,
341,
422,
503,
584,
668,
752,
836,
912,
996,
1076,
1144,
1145,
1152
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1152,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3320610821247101,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015267180278897285,
"rps_doc_frac_lines_end_with_ellipsis": 0.28125,
"rps_doc_frac_no_alph_words": 0.30534350872039795,
"rps_doc_frac_unique_words": 0.481675386428833,
"rps_doc_mean_word_length": 4.4712042808532715,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.034351151436567307,
"rps_doc_unigram_entropy": 4.184886455535889,
"rps_doc_word_count": 191,
"rps_doc_frac_chars_dupe_10grams": 0.19320842623710632,
"rps_doc_frac_chars_dupe_5grams": 0.19320842623710632,
"rps_doc_frac_chars_dupe_6grams": 0.19320842623710632,
"rps_doc_frac_chars_dupe_7grams": 0.19320842623710632,
"rps_doc_frac_chars_dupe_8grams": 0.19320842623710632,
"rps_doc_frac_chars_dupe_9grams": 0.19320842623710632,
"rps_doc_frac_chars_top_2gram": 0.06557376682758331,
"rps_doc_frac_chars_top_3gram": 0.06323184818029404,
"rps_doc_frac_chars_top_4gram": 0.08430913090705872,
"rps_doc_books_importance": -112.87635803222656,
"rps_doc_books_importance_length_correction": -112.87635803222656,
"rps_doc_openwebtext_importance": -59.37248611450195,
"rps_doc_openwebtext_importance_length_correction": -56.823917388916016,
"rps_doc_wikipedia_importance": -48.340003967285156,
"rps_doc_wikipedia_importance_length_correction": -48.340003967285156
},
"fasttext": {
"dclm": 0.7593374848365784,
"english": 0.909349262714386,
"fineweb_edu_approx": 2.214707612991333,
"eai_general_math": 0.9438484907150269,
"eai_open_web_math": 0.6050642132759094,
"eai_web_code": 0.0013063499936833978
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,658,617,006,971,261,000 |
How to uninstall the Lockedv1 ransomware?
Also Known As: Lockedv1 virus
Distribution: Low
Damage level: Severe
Lockedv1 ransomware removal instructions
What is Lockedv1?
Lockedv1 encrypts files and renames every encrypted file by replacing it name with a string of random characters and appending ".lockedv1" as the extension. For instance, it renames a file named "1.jpg" to "Mi5qcGVn.lockedv1", "2.jpg" to "Nh3wvJLm.lockedv1", and so on. Also, Lockedv1 creates the "READMEV1.txt" text file, a ransom note.
"READMEV1.txt" text file contains a Tor website link that victims are instructed to use to pay a ransom. As explained on that Tor website, victims have to send 0.01 BTC to the provided wallet and then wait for a download link for the decryption tool to appear. Unfortunately, cyber criminals behind Lockedv1 are the only ones who have the right decryption tool (or tools). In other words, there are no third party tools that can decrypt files that are encrypted by this ransomware.
Another issue is that paying a ransom does not guarantee that ransomware developers will send decryption tool and/or key. Therefore, it is advised not to take such risk. In such cases the only way to recover files without paying anything to restore them from a backup. It is worthwhile to mention that malware of this type can be prevented from causing further encryptions (from encrypting unencrypted files) by uninstalling it. Although, encrypted files remain inaccessible even when ransomware is no longer installed.
Screenshot of a message encouraging users to pay a ransom to decrypt their compromised data:
Lockedv1 decrypt instructions (READMEV1.txt)
To sum up, in most cases ransomware is designed to encrypt data (prevent victims from accessing their files) and display, create some ransom note with instructions on how to contact cyber criminals, or other details. Typically, the only main and most common variables are price of a decryption tool and/or key and cryptographic algorithm (symmetric or asymmetric) that ransomware uses for data encryption. The biggest problem with having a computer infected with ransomware is that most of the times it is impossible to decrypt files for free unless installed ransomware is has some bugs, flaws, it is not finished. However, it happens quite rarely, therefore, it is recommended to always have data backed up and keep it on a remote server like Cloud and/or unplugged storage device. More ransomware examples are v316, Lockedfile and Flubo.
How did ransomware infect my computer?
Typically, malicious programs are distributed through spam campaigns, Trojans, untrustworthy download sources, unofficial software activation or updating tools. Malspam campaigns are emails that contain malicious attachments or download links for malicious files. The main purpose of such emails is to trick recipients into downloading and opening a malicious file. In most cases such emails contain some malicious Microsoft Office document, executable file (like .exe) files, archive file like ZIP, RAR, PDF document or JavaScript file. Malware can be distributed via Trojans by designing them to cause chain infections (cause installation of other malware). However, Trojans can cause damage only when they are installed on computers.
Peer-to-Peer networks (like torrent clients, eMule), freeware download or file hosting websites, unofficial pages, third party downloaders, etc., are examples of download sources that can be used to proliferate malware by using them as tools to distribute malicious files. In such cases malicious files are disguised as regular, legitimate. Software 'cracking' tools are illegal software activation tools that bypass its activation for free. However, not all of them function as they are expected. Quite often such tools simply install malware instead. Fake software updating tools can cause damage either by exploiting bugs, flaws of outdated software or by installing malicious software instead of updated, fixes for the installed one.
Threat Summary:
Name Lockedv1 virus
Threat Type Ransomware, Crypto Virus, Files locker
Encrypted Files Extension .lockedv1
Ransom Demanding Message READMEV1.txt, Tor website
Ransom Amount 0.01 BTC
BTC Wallet Address 1KgNGEuGN4s4hS5bvFkqzq6AMuHV2VEAWX
Detection Names Avast (Win64:Trojan-gen), AVG (Win64:Trojan-gen), ESET-NOD32 (A Variant Of Win32/Filecoder.NVZ), Kaspersky (Trojan.Win32.DelShad.fqe), Full List Of Detections (VirusTotal)
Symptoms Cannot open files stored on your computer, previously functional files now have a different extension (for example, my.docx.locked). A ransom demand message is displayed on your desktop. Cyber criminals demand payment of a ransom (usually in bitcoins) to unlock your files.
Distribution methods Infected email attachments (macros), torrent websites, malicious ads.
Damage All files are encrypted and cannot be opened without paying a ransom. Additional password-stealing trojans and malware infections can be installed together with a ransomware infection.
Malware Removal (Windows)
To eliminate possible malware infections, scan your computer with legitimate antivirus software. Our security researchers recommend using Malwarebytes.
▼ Download Malwarebytes
To use full-featured product, you have to purchase a license for Malwarebytes. 14 days free trial available.
How to protect yourself from ransomware infections?
Software and files should not be downloaded from unofficial pages or other channels like third party downloaders, Peer-to-Peer networks (e.g., torrent clients, eMule), freeware download pages, etc., or installed via third party installers. They should be downloaded from official websites and via direct links. Attachments and website links in irrelevant emails should not be opened, especially if such emails are received from unknown, suspicious addresses. Installed software has to be updated and activated only with tools that are provided by its official developers. Unofficial, third party activation, updating tools can be designed to install malware, and, it is not legal to activate licensed software with such tools (or use installers for pirated software). A computer should be scanned for threats with a reputable antivirus or anti-spyware software, it should be done regularly. If your computer is already infected with Lockedv1, we recommend running a scan with Malwarebytes for Windows to automatically eliminate this ransomware.
Text presented in the "READMEV1.txt" text file :
How to decrypt:
Download Tor Browser (hxxps://www.torproject.org/dist/torbrowser /10.0.7/torbrowser-install-10.0.7_en-US.exe) and install.
Open hxxp://decryptu7o2cckt5.onion with Tor Browser.
Paste yor KEY - and follow instructions
Your KEY
-
Screenshot of the Tor website:
lockedv1 ransomware tor website
Text in this page:
1 KEY: -
2 Send 0.01 BTC ⇩⇩⇩
1KgNGEuGN4s4hS5bvFkqzq6AMuHV2VEAWX
3 ≫ The links to the program for decrypt will appear here after payment and payment confirmation by support
If you have already paid, please take it easy and wait. In most cases the program will be ready within 24 hours
How to buy bitcoin:
hxxps://bitcoin.org/en/getting-started
hxxps://www.binance.com/en/buy-Bitcoin
hxxps://buy.bitcoin.com/
hxxps://www.bestchange.com/
hxxps://www.google.com/search?client=firefox-b-d&q=buy+bitcoins
hxxps://www.google.com/search?client=firefox-b-d&q=buy+bitcoins+with+credit+card
hxxps://www.google.com/search?client=firefox-b-d&q=buy+bitcoins+with+paypal
Screenshot of files encrypted by Lockedv1 (".lockedv1" extension):
Files encrypted by Lockedv1 ransomware (.lockedv1 extension)
Lockedv1 ransomware removal:
Instant automatic malware removal: Manual threat removal might be a lengthy and complicated process that requires advanced computer skills. Malwarebytes is a professional automatic malware removal tool that is recommended to get rid of malware. Download it by clicking the button below:
▼ DOWNLOAD Malwarebytes By downloading any software listed on this website you agree to our Privacy Policy and Terms of Use. To use full-featured product, you have to purchase a license for Malwarebytes. 14 days free trial available.
Quick menu:
Reporting ransomware to authorities:
If you are a victim of a ransomware attack we recommend reporting this incident to authorities. By providing information to law enforcement agencies you will help track cyber crime and potentially assist in prosecution of the attackers. Here's a list of authorities where you should report a ransomware attack. For the complete list of local cyber security centers and information on why you should report ransomware attacks, read this article.
List of local authorities where ransomware attacks should be reported (choose one depending on your residence address):
Isolating the infected device:
Some ransomware-type infections are designed to encrypt files within external storage devices, infect them, and even spread throughout the entire local network. For this reason, it is very important to isolate the infected device (computer) as soon as possible.
Step 1: Disconnect from the internet.
The easiest way to disconnect a computer from the internet is to unplug the Ethernet cable from the motherboard, however, some devices are connected via a wireless network and for some users (especially those who are not particularly tech-savvy), disconnecting cables may seem troublesome. Therefore, you can also disconnect the system manually via Control Panel:
Navigate to the "Control Panel", click the search bar in the upper-right corner of the screen, enter "Network and Sharing Center" and select search result: Disconnecting computer from the Internet (step 1)
Click the "Change adapter settings" option in the upper-left corner of the window: Disconnecting computer from the Internet (step 2)
Right-click on each connection point and select "Disable". Once disabled, the system will no longer be connected to the internet. To re-enable the connection points, simply right-click again and select "Enable". Disconnecting computer from the Internet (step 3)
Step 2: Unplug all storage devices.
As mentioned above, ransomware might encrypt data and infiltrate all storage devices that are connected to the computer. For this reason, all external storage devices (flash drives, portable hard drives, etc.) should be disconnected immediately, however, we strongly advise you to eject each device before disconnecting to prevent data corruption:
Navigate to "My Computer", right-click on each connected device and select "Eject": Ejecting external storage devices
Step 3: Log-out of cloud storage accounts.
Some ransomware-type might be able to hijack software that handles data stored within "the Cloud". Therefore, the data could be corrupted/encrypted. For this reason, you should log-out of all cloud storage accounts within browsers and other related software. You should also consider temporarily uninstalling the cloud-management software until the infection is completely removed.
Identify the ransomware infection:
To properly handle an infection, one must first identify it. Some ransomware infections use ransom-demand messages as an introduction (see the WALDO ransomware text file below).
Identify ransomware-type infection (step 1)
This, however, is rare. In most cases, ransomware infections deliver more direct messages simply stating that data is encrypted and that victims must pay some sort of ransom. Note that ransomware-type infections typically generate messages with different file names (for example, "_readme.txt", "READ-ME.txt", "DECRYPTION_INSTRUCTIONS.txt", "DECRYPT_FILES.html", etc.). Therefore, using the name of a ransom message may seem like a good way to identify the infection. The problem is that most of these names are generic and some infections use the same names, even though the delivered messages are different and the infections themselves are unrelated. Therefore, using the message filename alone can be ineffective and even lead to permanent data loss (for example, by attempting to decrypt data using tools designed for different ransomware infections, users are likely to end up permanently damaging files and decryption will no longer be possible even with the correct tool).
Another way to identify a ransomware infection is to check the file extension, which is appended to each encrypted file. Ransomware infections are often named by the extensions they append (see files encrypted by Qewe ransomware below).
Identify ransomware-type infection (step 2)
This method is only effective, however, when the appended extension is unique - many ransomware infections append a generic extension (for example, ".encrypted", ".enc", ".crypted", ".locked", etc.). In these cases, identifying ransomware by its appended extension becomes impossible.
One of the easiest and quickest ways to identify a ransomware infection is to use the ID Ransomware website. This service supports most existing ransomware infections. Victims simply upload a ransom message and/or one encrypted file (we advise you to upload both if possible).
Identify ransomware-type infection (step 3)
The ransomware will be identified within seconds and you will be provided with various details, such as the name of the malware family to which the infection belongs, whether it is decryptable, and so on.
Example 1 (Qewe [Stop/Djvu] ransomware):
Identify ransomware-type infection (step 4)
Example 2 (.iso [Phobos] ransomware):
Identify ransomware-type infection (step 5)
If your data happens to be encrypted by a ransomware that is not supported by ID Ransomware, you can always try searching the internet by using certain keywords (for example, ransom message title, file extension, provided contact emails, cryptowallet addresses, etc.).
Search for ransomware decryption tools:
Encryption algorithms used by most ransomware-type infections are extremely sophisticated and, if the encryption is performed properly, only the developer is capable of restoring data. This is because decryption requires a specific key, which is generated during the encryption. Restoring data without the key is impossible. In most cases, cyber criminals store keys on a remote server, rather than using the infected machine as a host. Dharma (CrySis), Phobos, and other families of high-end ransomware infections are virtually flawless, and thus restoring data encrypted without the developers' involvement is simply impossible. Despite this, there are dozens of ransomware-type infections that are poorly developed and contain a number of flaws (for example, the use of identical encryption/decryption keys for each victim, keys stored locally, etc.). Therefore, always check for available decryption tools for any ransomware that infiltrates your computer.
Finding the correct decryption tool on the internet can be very frustrating. For this reason, we recommend that you use the No More Ransom Project and this is where identifying the ransomware infection is useful. The No More Ransom Project website contains a "Decryption Tools" section with a search bar. Enter the name of the identified ransomware, and all available decryptors (if there are any) will be listed.
Searching for ransomware decryption tools in nomoreransom.org website
Restore files with data recovery tools:
Depending on the situation (quality of ransomware infection, type of encryption algorithm used, etc.), restoring data with certain third-party tools might be possible. Therefore, we advise you to use Recuva tool developed by CCleaner. This tool supports over a thousand data types (graphics, video, audio, documents, etc.) and it is very intuitive (little knowledge is necessary to recover data). In addition, the recovery feature is completely free.
Step 1: Perform a scan.
Run the Recuva application and follow the wizard. You will be prompted with several windows allowing you to choose what file types to look for, which locations should be scanned, etc. All you need to do is select the options you're looking for and start the scan. We advise you to enable the "Deep Scan" before starting, otherwise the application's scanning capabilities will be restricted.
Recuva data recovery tool wizard
Wait for Recuva to complete the scan. The scanning duration depends on the volume of files (both in quantity and size) that you are scanning (for example, several hundreds gigabytes could take over an hour to scan). Therefore, be patient during the scanning process. We also advise against modifying or deleting existing files, since this might interfere with the scan. If you add additional data (for example, downloading files/content) while scanning, this will prolong the process:
Recuva data recovery tool scan time
Step 2: Recover data.
Once the process is complete, select the folders/files you wish to restore and simply click "Recover". Note that some free space on your storage drive is necessary to restore data:
Recuva data recovery tool recovering data
Create data backups:
Proper file management and creating backups is essential for data security. Therefore, always be very careful and think ahead.
Partition management: We recommend that you store your data in multiple partitions and avoid storing important files within the partition that contains the entire operating system. If you fall into a situation whereby you cannot boot the system and are forced to format the disk on which the operating system is installed (in most cases, this is where malware infections hide), you will lose all data stored within that drive. This is the advantage of having multiple partitions: if you have the entire storage device assigned to a single partition, you will be forced to delete everything, however, creating multiple partitions and allocating the data properly allows you to prevent such problems. You can easily format a single partition without affecting the others - therefore, one will be cleaned and the others will remain untouched, and your data will be saved. Managing partitions is quite simple and you can find all necessary information on Microsoft's documentation web page.
Data backups: One of the most reliable backup methods is to use an external storage device and keep it unplugged. Copy your data to an external hard drive, flash (thumb) drive, SSD, HDD, or any other storage device, unplug it and store it in a dry place away from sun and extreme temperatures. This method is, however, quite inefficient, since data backups and updates need to be made regularly. You can also use a cloud service or remote server. Here, an internet connection is required and there is always the chance of a security breach, although it's a really rare occasion.
We recommend using Microsoft OneDrive for backing up your files. OneDrive lets you store your personal files and data in the cloud, sync files across computers and mobile devices, allowing you to access and edit your files from all of your Windows devices. OneDrive lets you save, share and preview files, access download history, move, delete, and rename files, as well as create new folders, and much more.
You can back up your most important folders and files on your PC (your Desktop, Documents, and Pictures folders). Some of OneDrive’s more notable features include file versioning, which keeps older versions of files for up to 30 days. OneDrive features a recycling bin in which all of your deleted files are stored for a limited time. Deleted files are not counted as part of the user’s allocation.
The service is built using HTML5 technologies and allows you to upload files up to 300 MB via drag and drop into the web browser or up to 10 GB via the OneDrive desktop application. With OneDrive, you can download entire folders as a single ZIP file with up to 10,000 files, although it can’t exceed 15 GB per single download.
OneDrive comes with 5 GB of free storage out of the box, with additional 100 GB, 1 TB, and 6 TB storage options available for a subscription-based fee. You can get one of these storage plans by either purchasing additional storage separately or with Office 365 subscription.
Creating a data backup:
The backup process is the same for all file types and folders. Here’s how you can back up your files using Microsoft OneDrive
Step 1: Choose the files/folders you want to backup.
Click the OneDrive icon in the taskbar
Click the OneDrive cloud icon to open the OneDrive menu. While in this menu, you can customize your file backup settings.
Select Help & Settings and click Settings
Click Help & Settings and then select Settings from the drop-down menu.
Select the Backup tab and click Manage backup
Go to the Backup tab and click Manage backup.
Select folders to backup and click Start backup
In this menu, you can choose to backup the Desktop and all of the file on it, and Documents and Pictures folders, again, with all of the files in them. Click Start backup.
Now, when you add a file or folder in the Desktop and Documents and Pictures folders, they will be automatically backed up on OneDrive.
To add folders and files not in the locations shown above, you have to add them manually.
Select a file manually and copy it
Open File Explorer and navigate to the location of the folder/file you want to backup. Select the item, right-click it, and click Copy.
Paste the copied file in the OneDrive folder to create a backup
Then, navigate to OneDrive, right-click anywhere in the window and click Paste. Alternatively, you can just drag and drop a file into OneDrive. OneDrive will automatically create a backup of the folder/file.
File statuses in OneDrive folder
All of the files added to the OneDrive folder are backed up in the cloud automatically. The green circle with the checkmark in it indicates that the file is available both locally and on OneDrive, and that the file version is the same on both. The blue cloud icon indicates that the file has not been synced and is available on only on OneDrive. The sync icon indicates that the file is currently syncing.
Click Help & Settings and click View Online
To access files only located on OneDrive online, go to the Help & Settings drop-down menu and select View online.
Click the Settings cog and click Options
Step 2: Restore corrupted files.
OneDrive makes sure that the files stay in sync, so the version of the file on the computer is the same version on the cloud. However, if ransomware has encrypted your files, you can take advantage of OneDrive’s Version history feature that will allow you to restore the file versions prior to encryption.
Microsoft 365 has a ransomware detection feature that notifies you when your OneDrive files have been attacked and guides you through the process of restoring your files. It must be noted, however, that if you don’t have a paid Microsoft 365 subscription, you only get one detection and file recovery for free.
If your OneDrive files get deleted, corrupted, or infected by malware, you can restore your entire OneDrive to a previous state. Here’s how you can restore your entire OneDrive:
restore-your-onedrive
1. If you're signed in with a personal account, click the Settings cog at the top of the page. Then, click Options and select Restore your OneDrive.
If you're signed in with a work or school account, click the Settings cog at the top of the page. Then, click Restore your OneDrive.
2. On the Restore your OneDrive page, select a date from the drop-down list. Note that if you're restoring your files after automatic ransomware detection, a restore date will be selected for you.
3. After configuring all of the file restoration options, click Restore to undo all the activities you selected.
The best way to avoid damage from ransomware infections is to maintain regular up-to-date backups.
Click to post a comment
About the author:
Tomas Meskauskas
Tomas Meskauskas - expert security researcher, professional malware analyst.
I am passionate about computer security and technology. I have an experience of over 10 years working in various companies related to computer technical issue solving and Internet security. I have been working as an author and editor for pcrisk.com since 2010. Follow me on Twitter and LinkedIn to stay informed about the latest online security threats. Contact Tomas Meskauskas.
PCrisk security portal is brought by a company RCS LT. Joined forces of security researchers help educate computer users about the latest online security threats. More information about the company RCS LT.
Our malware removal guides are free. However, if you want to support us you can send us a donation.
Malware activity
Global malware activity level today:
Medium threat activity
Increased attack rate of infections detected within the last 24 hours.
QR Code
Lockedv1 virus QR code
A QR code (Quick Response Code) is a machine-readable code which stores URLs and other information. This code can be read using a camera on a smartphone or a tablet. Scan this QR code to have an easy access removal guide of Lockedv1 virus on your mobile device.
We Recommend:
Get rid of Windows malware infections today:
▼ REMOVE IT NOW
Download Malwarebytes
Platform: Windows
Editors' Rating for Malwarebytes:
Editors ratingOutstanding!
[Back to Top]
To use full-featured product, you have to purchase a license for Malwarebytes. 14 days free trial available.
|
{
"url": "https://www.pcrisk.com/removal-guides/19775-lockedv1-ransomware",
"source_domain": "www.pcrisk.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "90707",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CLXV2ABEGRSWZNXD6O66XPE4AQHWCBEW",
"WARC-Concurrent-To": "<urn:uuid:c8e5cdbe-e43f-4ea7-9713-6ca1625ef9c6>",
"WARC-Date": "2021-01-24T06:35:45Z",
"WARC-IP-Address": "104.20.17.14",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SGOSKVPOLW7T4TNTH5EGRW7XS2INF47S",
"WARC-Record-ID": "<urn:uuid:28816040-f36d-4dfe-9d8a-264b99a26ddd>",
"WARC-Target-URI": "https://www.pcrisk.com/removal-guides/19775-lockedv1-ransomware",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d7a5647d-da6d-42fb-8cab-7e4c21efb2cc>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
42,
43,
73,
91,
112,
113,
154,
155,
173,
174,
512,
513,
995,
996,
1516,
1517,
1610,
1611,
1656,
1657,
2498,
2499,
2538,
2539,
3276,
3277,
4015,
4016,
4032,
4052,
4103,
4139,
4190,
4213,
4267,
4455,
4738,
4829,
5021,
5047,
5048,
5200,
5224,
5333,
5334,
5386,
5387,
6432,
6433,
6482,
6483,
6499,
6622,
6675,
6715,
6716,
6725,
6727,
6728,
6759,
6760,
6792,
6793,
6812,
6813,
6822,
6823,
6843,
6883,
6884,
6992,
7104,
7105,
7125,
7126,
7165,
7166,
7205,
7206,
7231,
7232,
7260,
7261,
7325,
7326,
7407,
7408,
7484,
7485,
7552,
7553,
7614,
7615,
7644,
7645,
7932,
8166,
8167,
8179,
8180,
8217,
8218,
8663,
8664,
8784,
8785,
8816,
8817,
9079,
9080,
9118,
9119,
9483,
9484,
9690,
9691,
9824,
9825,
10087,
10088,
10124,
10125,
10473,
10474,
10592,
10593,
10636,
10637,
11019,
11020,
11055,
11056,
11234,
11235,
11279,
11280,
12261,
12262,
12499,
12500,
12544,
12545,
12830,
12831,
13108,
13109,
13153,
13154,
13359,
13360,
13401,
13402,
13446,
13447,
13485,
13486,
13530,
13531,
13800,
13801,
13841,
13842,
14803,
14804,
15218,
15219,
15289,
15290,
15330,
15331,
15782,
15783,
15807,
15808,
16199,
16200,
16233,
16234,
16719,
16720,
16756,
16757,
16779,
16780,
16961,
16962,
17004,
17005,
17026,
17027,
17154,
17155,
18142,
18143,
18722,
18723,
19132,
19133,
19532,
19533,
19860,
19861,
20136,
20137,
20161,
20162,
20288,
20289,
20342,
20343,
20382,
20383,
20505,
20506,
20548,
20549,
20621,
20622,
20668,
20669,
20715,
20716,
20764,
20765,
20937,
20938,
21074,
21075,
21165,
21166,
21201,
21202,
21338,
21339,
21403,
21404,
21612,
21613,
21646,
21647,
22053,
22054,
22098,
22099,
22213,
22214,
22255,
22256,
22289,
22290,
22596,
22597,
22908,
22909,
23087,
23088,
23110,
23111,
23260,
23261,
23395,
23396,
23593,
23594,
23707,
23708,
23807,
23808,
23832,
23833,
23851,
23852,
23869,
23870,
23947,
23948,
24328,
24329,
24535,
24536,
24636,
24637,
24654,
24655,
24692,
24693,
24716,
24717,
24788,
24789,
24797,
24820,
25082,
25096,
25097,
25142,
25143,
25159,
25181,
25182,
25200,
25201,
25235,
25262,
25263,
25277,
25278
],
"line_end_idx": [
42,
43,
73,
91,
112,
113,
154,
155,
173,
174,
512,
513,
995,
996,
1516,
1517,
1610,
1611,
1656,
1657,
2498,
2499,
2538,
2539,
3276,
3277,
4015,
4016,
4032,
4052,
4103,
4139,
4190,
4213,
4267,
4455,
4738,
4829,
5021,
5047,
5048,
5200,
5224,
5333,
5334,
5386,
5387,
6432,
6433,
6482,
6483,
6499,
6622,
6675,
6715,
6716,
6725,
6727,
6728,
6759,
6760,
6792,
6793,
6812,
6813,
6822,
6823,
6843,
6883,
6884,
6992,
7104,
7105,
7125,
7126,
7165,
7166,
7205,
7206,
7231,
7232,
7260,
7261,
7325,
7326,
7407,
7408,
7484,
7485,
7552,
7553,
7614,
7615,
7644,
7645,
7932,
8166,
8167,
8179,
8180,
8217,
8218,
8663,
8664,
8784,
8785,
8816,
8817,
9079,
9080,
9118,
9119,
9483,
9484,
9690,
9691,
9824,
9825,
10087,
10088,
10124,
10125,
10473,
10474,
10592,
10593,
10636,
10637,
11019,
11020,
11055,
11056,
11234,
11235,
11279,
11280,
12261,
12262,
12499,
12500,
12544,
12545,
12830,
12831,
13108,
13109,
13153,
13154,
13359,
13360,
13401,
13402,
13446,
13447,
13485,
13486,
13530,
13531,
13800,
13801,
13841,
13842,
14803,
14804,
15218,
15219,
15289,
15290,
15330,
15331,
15782,
15783,
15807,
15808,
16199,
16200,
16233,
16234,
16719,
16720,
16756,
16757,
16779,
16780,
16961,
16962,
17004,
17005,
17026,
17027,
17154,
17155,
18142,
18143,
18722,
18723,
19132,
19133,
19532,
19533,
19860,
19861,
20136,
20137,
20161,
20162,
20288,
20289,
20342,
20343,
20382,
20383,
20505,
20506,
20548,
20549,
20621,
20622,
20668,
20669,
20715,
20716,
20764,
20765,
20937,
20938,
21074,
21075,
21165,
21166,
21201,
21202,
21338,
21339,
21403,
21404,
21612,
21613,
21646,
21647,
22053,
22054,
22098,
22099,
22213,
22214,
22255,
22256,
22289,
22290,
22596,
22597,
22908,
22909,
23087,
23088,
23110,
23111,
23260,
23261,
23395,
23396,
23593,
23594,
23707,
23708,
23807,
23808,
23832,
23833,
23851,
23852,
23869,
23870,
23947,
23948,
24328,
24329,
24535,
24536,
24636,
24637,
24654,
24655,
24692,
24693,
24716,
24717,
24788,
24789,
24797,
24820,
25082,
25096,
25097,
25142,
25143,
25159,
25181,
25182,
25200,
25201,
25235,
25262,
25263,
25277,
25278,
25386
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 25386,
"ccnet_original_nlines": 307,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35432252287864685,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012053200043737888,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17664173245429993,
"rps_doc_frac_unique_words": 0.26162639260292053,
"rps_doc_mean_word_length": 5.328916549682617,
"rps_doc_num_sentences": 262,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.927579402923584,
"rps_doc_word_count": 3849,
"rps_doc_frac_chars_dupe_10grams": 0.017941590398550034,
"rps_doc_frac_chars_dupe_5grams": 0.06201549991965294,
"rps_doc_frac_chars_dupe_6grams": 0.03861343115568161,
"rps_doc_frac_chars_dupe_7grams": 0.024377159774303436,
"rps_doc_frac_chars_dupe_8grams": 0.017941590398550034,
"rps_doc_frac_chars_dupe_9grams": 0.017941590398550034,
"rps_doc_frac_chars_top_2gram": 0.004875429905951023,
"rps_doc_frac_chars_top_3gram": 0.0032177900429815054,
"rps_doc_frac_chars_top_4gram": 0.008532010018825531,
"rps_doc_books_importance": -2095.33642578125,
"rps_doc_books_importance_length_correction": -2095.33642578125,
"rps_doc_openwebtext_importance": -1319.77734375,
"rps_doc_openwebtext_importance_length_correction": -1319.77734375,
"rps_doc_wikipedia_importance": -899.8081665039062,
"rps_doc_wikipedia_importance_length_correction": -899.8081665039062
},
"fasttext": {
"dclm": 0.025329530239105225,
"english": 0.8874258399009705,
"fineweb_edu_approx": 2.1226837635040283,
"eai_general_math": 0.21528548002243042,
"eai_open_web_math": 0.17078322172164917,
"eai_web_code": 0.13885915279388428
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,862,375,599,332,563,500 |
Home
Plotting 2 sets of data with the same horizontal axis value but different vertical axis values
ExcelUserHM
Occasional Visitor
Ok, so I'm a beginner excel user and I'm wondering if anyone can help me.
I'm trying to create a chart that will show data from 2016 and 2017 for two different locations.
I want to end up with just 2 horizontal axis points with each axis point having 2 columns. I want one of the horizontal axis points to be 2016. I want the 2016 axis point to have 2 columns, one for NY and one for LA. Then I want the same thing for 2017. However, I keep getting 4 different columns. 1 column is for NY 2016, 1 column for LA 2016, another column for NY 2017 and another column for LA 2017.
Is there a way to have just 2 horizontal axis points (2016 and 2017) with 2 columns for each point?
|
{
"url": "https://techcommunity.microsoft.com/t5/Excel/Plotting-2-sets-of-data-with-the-same-horizontal-axis-value-but/td-p/330321",
"source_domain": "techcommunity.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "223515",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PD4MEAUE62GF5P6OVUCUGKCIKTGIQ6P4",
"WARC-Concurrent-To": "<urn:uuid:c0ca9974-16d7-4062-8b96-77a748df1321>",
"WARC-Date": "2019-08-19T07:36:33Z",
"WARC-IP-Address": "208.74.205.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P2RSSYDRE4QKF2SL4PST7F4JBGNTYYHK",
"WARC-Record-ID": "<urn:uuid:2fd4f087-ef86-44e1-92b1-a18a900da783>",
"WARC-Target-URI": "https://techcommunity.microsoft.com/t5/Excel/Plotting-2-sets-of-data-with-the-same-horizontal-axis-value-but/td-p/330321",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:04687609-5823-46c3-a15e-4657a6a0b460>"
},
"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-52.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,
101,
102,
114,
133,
134,
208,
209,
211,
212,
309,
310,
312,
313,
719,
720,
722,
723,
823,
824,
826,
827
],
"line_end_idx": [
5,
6,
101,
102,
114,
133,
134,
208,
209,
211,
212,
309,
310,
312,
313,
719,
720,
722,
723,
823,
824,
826,
827,
828
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 828,
"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.42696627974510193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07865168899297714,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21910111606121063,
"rps_doc_frac_unique_words": 0.4679487347602844,
"rps_doc_mean_word_length": 4.051281929016113,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.029338836669922,
"rps_doc_word_count": 156,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0791139230132103,
"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.08860758692026138,
"rps_doc_frac_chars_top_3gram": 0.09493671357631683,
"rps_doc_frac_chars_top_4gram": 0.06012658029794693,
"rps_doc_books_importance": -80.62968444824219,
"rps_doc_books_importance_length_correction": -80.62968444824219,
"rps_doc_openwebtext_importance": -37.67860794067383,
"rps_doc_openwebtext_importance_length_correction": -37.37128448486328,
"rps_doc_wikipedia_importance": -30.84829330444336,
"rps_doc_wikipedia_importance_length_correction": -30.84829330444336
},
"fasttext": {
"dclm": 0.022922519594430923,
"english": 0.8704301118850708,
"fineweb_edu_approx": 1.080528736114502,
"eai_general_math": 0.6371462941169739,
"eai_open_web_math": 0.3376438617706299,
"eai_web_code": 0.2528778314590454
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.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": "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
|
3,517,996,585,556,598,300 |
Une machine de Turing
Une machine de Turing est une représentation mathématique d'un ordinateur. Elle dispose d'un ruban (tape), sur lequel elle peut se déplacer vers la gauche ou vers la droite, lire et écrire un caractère.
Pour représenter les chiffres, cette machine utilise la base 1. Pour le chiffre 0, elle place un barre (1) sur le ruban, pour représenter le chiffre 2, elle en place 3...
Malgré sa simplicité, cette machine est capable de calculer toutes les fonctions récursives.
Petit exemple :
Un exemple très simple est la fonction Zéro. C'est une fonction constante, qui pour n'importe quel nombre renvoie 0. Rappelons-nous qu'avec notre machine le 0 s'écrit avec une barre (1).
Si nous prenons le ruban contenant le chiffre 4 :
11111000000000000
Nous devrions donc obtenir :
10000000000000000
Analysons le programme :
q0 1 D q1 # On conserve le 1er 1 : pour faire 0
q1 1 0 q2 # Suppression des 1 inutiles
q2 0 D q1
q1 0 0 q3 # Retour à la position initiale
q3 0 G q3
Une machine de Turing dispose d'un algorithme très simple, celui-ci a même été reproduit mécaniquement ou optiquement !
Une instruction se compose de 4 parties :
L'état initial, la condition, l'action et l'état final.
Par exemple pour la première : q0 1 D q1
Au début nous sommes toujours à l'état 0. Le premier élément du ruban est 1.
Notre machine va dont recherche un instruction commençant par q0 1, ensuite elle va exécuter l'instruction contenue dans la seconde partie de l'instruction.
Ici : D q1 : Elle doit donc avancer vers la Droite sur le ruban et passer à l'état q1.
Elle va maintenant recherche une instruction correspondante à l'état q1 et qui a comme condition l'élément courant du ruban : ici 1 et nous exécutons l'action 0 (remplacer l'élément courant du ruban par 0) et passer à l'état q2.
Pour résumer, les actions dont elle dispose sont :
G : Aller à gauche
D : Aller à droite
1 : Écrire un 1
0 : Écrire un 0
et parfois :
* : Écrire une * pour délimiter deux nombres par exemple
Une machine de Turing en Python :
Cette machine est capable de gérer un nombre infini d'état.
# -*- coding: utf-8 -*-
#
# uTuring
#
# Copyright (c) 2010 Amaury GRAILLAT
# Licensed under the GNU GPL license.
# See http://www.gnu.org/licenses/gpl.html
# amoweb.fr
#
# File exemple :
# # Zero function You can comment a line with #
# q0 1 0 q1 {Stat} {Condition} {Action (1, 0, *, L or R)} {Final stat}
# q1 0 D q0
# q0 0 1 q2
#
# =1111000000000000000000:0 ={tape}:{Initial stat (optional)}
#
import os
INDD = 0 ; COND = 1 ; ACTN = 2 ; INDF = 3
ruban = [] ; instr = []
k = 0 # position sur le ruban
q = '0' # état
# Trouve l'instruction correspondant à la condition et
def searchInstruction(q,k) :
# print "searchInstruction(%s,%s)"%(q,k)
for i in instr :
if i[INDD] == q and i[COND] == ruban[k] :
return i
return [0,0,0,0]
def monospace(str) :
str = str.replace("\t", " ");
while str.count(" ") > 0 :
str = str.replace(" ", " ");
return str
if __name__ == '__main__' :
print("Welcome to uTurning : ")
# Charge le programme depuis le fichier :
with open("program.txt") as program :
for instruction in program :
# Charge le ruban
if instruction[0:1] == "=" :
# Partie donnée
for s in instruction :
if s == ':' :
break
elif s != '\n' and s != '=' :
ruban.append(s)
# Position d'origine (facultative)
if len(instruction.split(':')) > 1 :
k = int(instruction.split(':')[1])
# Fin du fichier :
elif instruction[0:3] == "EOF" :
break
# Charge une instruction
elif instruction != '\n' and instruction[0:1] != "#":
instruction = monospace(instruction);
if len(instruction.split(' ')) > 3 :
qStrI = instruction.split(' ')[0]
qStrF = instruction.split(' ')[3]
instr.append([qStrI[1:len(qStrI)], instruction.split(' ')[1],
instruction.split(' ')[2], qStrF[1:len(qStrF)-1]])
# Exceptions :
if len(ruban) == 0 :
print "TAPE missing : example : =11100000:0"
exit()
if len(instr) == 0 :
print "Instructions missing : example : q0 1 0 q2 "
exit()
# Exécution des instructions :
curInst = searchInstruction(q, k)
while curInst != [0,0,0,0] :
# Affiche le ruban :
print (''.join(ruban)) + " (q" + q + ")"
print " "*k + "^"
# Interprête les instructions :
if curInst[ACTN] == 'D' or curInst[ACTN] == 'R' :
k = k + 1
elif curInst[ACTN] == 'G' or curInst[ACTN] == 'L':
k = k - 1
elif k < 0 :
print "Warning ! Out of range : k = -1 ---> k = 0"
else :
ruban[k] = curInst[ACTN]
# Nouvel état
q = curInst[INDF]
curInst = searchInstruction(q, k)
# Affiche le ruban final :
print (''.join(ruban)) + " (q" + q + ")"
print " "*k + "^"
Et quelques exemples (à copier coller dans un fichier program.txt à coté du programme python) :
# Fonction successeur :
q0 1 D q0
q0 0 1 qa
qa 1 G qa
qa 0 D q2
=1111100000000000:0
EOF ----------------------------
# Couples d'entiers :
# Suppression :
q0 1 D q0
Q0 * * Q1
q1 * 0 q2
q1 1 0 q2
q2 0 D q1
Q1 0 0 Q3
Q3 0 G Q3
Q3 1 1 Q4
Q4 1 G Q4
Q4 0 D Q5
=111*1111000000000000000000
Je suggère aussi
Écrire un commentaire
Quelle est la troisième lettre du mot bzwr ? :
|
{
"url": "http://amoweb.fr/article119/une-machine-de-turing",
"source_domain": "amoweb.fr",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "19333",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MJA73EQJE5I4W5RQ7KD6FXT34C5IDAZO",
"WARC-Concurrent-To": "<urn:uuid:68d4a02c-fa40-42c0-bba7-d928ccdd926f>",
"WARC-Date": "2020-04-07T17:28:29Z",
"WARC-IP-Address": "213.186.33.19",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KFV7DFSSSZKPLC4QDCPJD5X3P7WMYKOR",
"WARC-Record-ID": "<urn:uuid:330098bb-9f74-45f6-9081-5e76f64c8e86>",
"WARC-Target-URI": "http://amoweb.fr/article119/une-machine-de-turing",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d7fec498-65a8-4b5b-9db2-3b6572b5e81b>"
},
"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-170.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
22,
23,
226,
397,
398,
491,
492,
508,
509,
696,
697,
747,
765,
794,
812,
813,
838,
886,
925,
935,
936,
978,
988,
989,
1109,
1151,
1207,
1248,
1325,
1482,
1569,
1798,
1799,
1850,
1869,
1888,
1904,
1920,
1933,
1990,
1991,
2025,
2026,
2086,
2087,
2111,
2113,
2123,
2125,
2162,
2200,
2243,
2270,
2272,
2289,
2366,
2443,
2455,
2467,
2470,
2547,
2549,
2550,
2560,
2602,
2626,
2658,
2673,
2674,
2730,
2759,
2801,
2819,
2863,
2875,
2893,
2895,
2916,
2947,
2976,
3008,
3020,
3021,
3049,
3082,
3083,
3126,
3165,
3196,
3217,
3249,
3269,
3296,
3315,
3327,
3362,
3384,
3423,
3464,
3504,
3526,
3562,
3572,
3600,
3657,
3699,
3740,
3779,
3818,
3885,
3941,
3957,
3979,
4026,
4035,
4057,
4111,
4120,
4121,
4153,
4188,
4218,
4241,
4284,
4304,
4305,
4339,
4391,
4404,
4457,
4470,
4485,
4539,
4548,
4576,
4577,
4594,
4614,
4615,
4651,
4678,
4719,
4737,
4738,
4834,
4835,
4859,
4869,
4879,
4889,
4899,
4919,
4920,
4921,
4954,
4976,
4992,
5002,
5012,
5022,
5032,
5042,
5043,
5053,
5063,
5073,
5083,
5093,
5094,
5122,
5123,
5140,
5141,
5163,
5164
],
"line_end_idx": [
22,
23,
226,
397,
398,
491,
492,
508,
509,
696,
697,
747,
765,
794,
812,
813,
838,
886,
925,
935,
936,
978,
988,
989,
1109,
1151,
1207,
1248,
1325,
1482,
1569,
1798,
1799,
1850,
1869,
1888,
1904,
1920,
1933,
1990,
1991,
2025,
2026,
2086,
2087,
2111,
2113,
2123,
2125,
2162,
2200,
2243,
2270,
2272,
2289,
2366,
2443,
2455,
2467,
2470,
2547,
2549,
2550,
2560,
2602,
2626,
2658,
2673,
2674,
2730,
2759,
2801,
2819,
2863,
2875,
2893,
2895,
2916,
2947,
2976,
3008,
3020,
3021,
3049,
3082,
3083,
3126,
3165,
3196,
3217,
3249,
3269,
3296,
3315,
3327,
3362,
3384,
3423,
3464,
3504,
3526,
3562,
3572,
3600,
3657,
3699,
3740,
3779,
3818,
3885,
3941,
3957,
3979,
4026,
4035,
4057,
4111,
4120,
4121,
4153,
4188,
4218,
4241,
4284,
4304,
4305,
4339,
4391,
4404,
4457,
4470,
4485,
4539,
4548,
4576,
4577,
4594,
4614,
4615,
4651,
4678,
4719,
4737,
4738,
4834,
4835,
4859,
4869,
4879,
4889,
4899,
4919,
4920,
4921,
4954,
4976,
4992,
5002,
5012,
5022,
5032,
5042,
5043,
5053,
5063,
5073,
5083,
5093,
5094,
5122,
5123,
5140,
5141,
5163,
5164,
5211
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5211,
"ccnet_original_nlines": 175,
"rps_doc_curly_bracket": 0.0023028200957924128,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09355346113443375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04245283082127571,
"rps_doc_frac_lines_end_with_ellipsis": 0.005681820213794708,
"rps_doc_frac_no_alph_words": 0.43946540355682373,
"rps_doc_frac_unique_words": 0.41046831011772156,
"rps_doc_mean_word_length": 4.807162761688232,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.03380503132939339,
"rps_doc_unigram_entropy": 5.172794818878174,
"rps_doc_word_count": 726,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0404011495411396,
"rps_doc_frac_chars_dupe_6grams": 0.01948424056172371,
"rps_doc_frac_chars_dupe_7grams": 0.006876789964735508,
"rps_doc_frac_chars_dupe_8grams": 0.006876789964735508,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01404010970145464,
"rps_doc_frac_chars_top_3gram": 0.013753579929471016,
"rps_doc_frac_chars_top_4gram": 0.0206303708255291,
"rps_doc_books_importance": -548.760009765625,
"rps_doc_books_importance_length_correction": -548.760009765625,
"rps_doc_openwebtext_importance": -265.40655517578125,
"rps_doc_openwebtext_importance_length_correction": -265.40655517578125,
"rps_doc_wikipedia_importance": -180.39959716796875,
"rps_doc_wikipedia_importance_length_correction": -180.39959716796875
},
"fasttext": {
"dclm": 0.8308637142181396,
"english": 0.03143465891480446,
"fineweb_edu_approx": 1.3730400800704956,
"eai_general_math": 0.5841692686080933,
"eai_open_web_math": 0.2919154763221741,
"eai_web_code": 0.9724799394607544
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "511.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,848,382,082,045,583,000 |
program not counting properly
Someone please help me fix this!! I would greatly appreciate it. I tested my count funtion. So my count function is not working properly, it should return 5 because 5 words have prefix "tal," but it is giving me 10. It's counting blank nodes.
This is my main.cpp file
1
2
3
4
5
6
7
8
9
10
11
12
13
14
int main()
{
string word;
cout<<"Enter a word"<<endl;
cin >> word;
string filename;
Trie trie;
trie.addDictionary (filename);
string t("tal");
cout<< trie.count (t)<<endl;
}
This is my implementation.cpp file
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
Trie :: Trie (){
TrieNode*node=new TrieNode();
root=node;
node->left=NULL;
node->right=NULL;
}
bool Trie::addDictionary (string filename){
fstream file("sae-sorted.dic", ios::in);
string word;
if(!file.is_open())
{
cout << "File not found!\n";
return false;
}
while (file >> word)
{
*this += word;
}
return true;
}
Trie& Trie::operator+= (const string & word){
TrieNode * curr = root;
for (int i = 0; i < word.length(); i++) {
if (curr->left == NULL){
TrieNode*node=new TrieNode();
node -> data = word[i];
node->left = NULL;
node->right = NULL;
curr->left = node;
if (i==word.length()-1){
node->end= true;
node->w=word;
}
else {
node->end=false;
}
curr = curr->left;
}
else{
curr = curr->left;
while (curr->data != word[i]) {
if (curr->right == NULL){
TrieNode*node=new TrieNode();
node -> data = word[i];
node->right = NULL;
node->left = NULL;
curr->right = node;
if (i==word.length()-1){
node->end= true;
node->w=word;
}
else {
node->end=false;
}
}
curr = curr->right;
}
}
}
return *this;
}
int Trie::count (string prefix){
TrieNode * curr = root;
for (int i = 0; i < prefix.length(); i++) {
if (curr-> left==NULL){
return 0;
}
curr = curr->left;
while (curr->data != prefix[i]) {
if (curr-> right==NULL){
return 0;
}
curr = curr->right;
}
}
return count(curr);
}
int Trie::count (TrieNode *curr){
if (curr==NULL){
return 0;
}
else{
if (curr->end==true){
return count(curr->left) + count(curr->right) + 1;
}
else{
return count(curr->left) + count(curr->right);
}
}
}
int Trie::count (char * prefix){
string str(prefix);
return count(str);
}
Header file, i.e. definition of class?
Last edited on
this is my struct.
1
2
3
4
5
6
7
struct TrieNode {
int data;
bool end;
string w;
TrieNode *left;
TrieNode *right;
};
Last edited on
definition of class Trie?
1
2
3
4
5
6
7
8
9
10
11
class Trie {
public:
TrieNode *root;
Trie ();
virtual bool addDictionary (string filename);
Trie& operator+= (const string & word);
virtual int count (string prefix);
virtual int count (TrieNode *curr);
virtual int count (char * prefix);
};
In Trie& Trie::operator+= (const string & word)
You're doing node->w=word; twice, where as there is no w in the trie node you're accessing.
oh sorry I have string w in my struct.
Someone please help me!!!!!!!!!!!!!!!!
Have you fixed what Rehan FASTian mentioned?
Yes, I have string w in struct.
Topic archived. No new replies allowed.
|
{
"url": "http://www.cplusplus.com/forum/general/101584/",
"source_domain": "www.cplusplus.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "18649",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AGGD4XBZEBOWJ6ULNFY3GMQNHZOUPH4U",
"WARC-Concurrent-To": "<urn:uuid:b1721132-f3d0-47ba-a66f-b9abc09aee86>",
"WARC-Date": "2014-04-19T11:58:50Z",
"WARC-IP-Address": "184.172.109.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BN4T4MGNPK4MRON46XI6JX32MNPRS6CA",
"WARC-Record-ID": "<urn:uuid:8d03de1f-48f9-49a5-8d2d-025d533916be>",
"WARC-Target-URI": "http://www.cplusplus.com/forum/general/101584/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b60e77af-45c1-4be4-a581-4378018903eb>"
},
"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,
2,
32,
33,
276,
277,
302,
304,
306,
308,
310,
312,
314,
316,
318,
320,
323,
326,
329,
332,
335,
347,
349,
366,
398,
415,
416,
437,
440,
455,
490,
511,
544,
545,
548,
549,
550,
551,
586,
588,
590,
592,
594,
596,
598,
600,
602,
604,
607,
610,
613,
616,
619,
622,
625,
628,
631,
634,
637,
640,
643,
646,
649,
652,
655,
658,
661,
664,
667,
670,
673,
676,
679,
682,
685,
688,
691,
694,
697,
700,
703,
706,
709,
712,
715,
718,
721,
724,
727,
730,
733,
736,
739,
742,
745,
748,
751,
754,
757,
760,
763,
766,
769,
772,
775,
778,
781,
784,
787,
790,
793,
796,
799,
802,
805,
808,
811,
814,
817,
820,
823,
826,
829,
832,
835,
838,
841,
844,
847,
850,
853,
856,
859,
862,
865,
868,
871,
874,
878,
882,
886,
890,
894,
898,
902,
920,
955,
971,
993,
1016,
1018,
1019,
1063,
1112,
1133,
1135,
1163,
1164,
1174,
1219,
1249,
1259,
1268,
1297,
1307,
1336,
1346,
1355,
1376,
1378,
1379,
1425,
1458,
1509,
1546,
1593,
1634,
1670,
1707,
1743,
1785,
1821,
1842,
1858,
1882,
1918,
1937,
1960,
1975,
1991,
2027,
2071,
2112,
2161,
2204,
2243,
2281,
2320,
2363,
2401,
2424,
2441,
2466,
2505,
2522,
2530,
2568,
2585,
2597,
2601,
2623,
2625,
2626,
2627,
2628,
2661,
2694,
2747,
2784,
2809,
2824,
2856,
2901,
2939,
2965,
2983,
3016,
3025,
3033,
3062,
3064,
3065,
3066,
3100,
3125,
3148,
3158,
3172,
3204,
3268,
3280,
3296,
3356,
3368,
3378,
3380,
3381,
3414,
3437,
3459,
3461,
3500,
3515,
3534,
3535,
3537,
3539,
3541,
3543,
3545,
3547,
3549,
3567,
3582,
3597,
3612,
3633,
3655,
3658,
3673,
3699,
3701,
3703,
3705,
3707,
3709,
3711,
3713,
3715,
3717,
3720,
3723,
3736,
3744,
3765,
3766,
3781,
3838,
3882,
3929,
3977,
4024,
4027,
4075,
4076,
4168,
4207,
4246,
4291,
4323
],
"line_end_idx": [
2,
32,
33,
276,
277,
302,
304,
306,
308,
310,
312,
314,
316,
318,
320,
323,
326,
329,
332,
335,
347,
349,
366,
398,
415,
416,
437,
440,
455,
490,
511,
544,
545,
548,
549,
550,
551,
586,
588,
590,
592,
594,
596,
598,
600,
602,
604,
607,
610,
613,
616,
619,
622,
625,
628,
631,
634,
637,
640,
643,
646,
649,
652,
655,
658,
661,
664,
667,
670,
673,
676,
679,
682,
685,
688,
691,
694,
697,
700,
703,
706,
709,
712,
715,
718,
721,
724,
727,
730,
733,
736,
739,
742,
745,
748,
751,
754,
757,
760,
763,
766,
769,
772,
775,
778,
781,
784,
787,
790,
793,
796,
799,
802,
805,
808,
811,
814,
817,
820,
823,
826,
829,
832,
835,
838,
841,
844,
847,
850,
853,
856,
859,
862,
865,
868,
871,
874,
878,
882,
886,
890,
894,
898,
902,
920,
955,
971,
993,
1016,
1018,
1019,
1063,
1112,
1133,
1135,
1163,
1164,
1174,
1219,
1249,
1259,
1268,
1297,
1307,
1336,
1346,
1355,
1376,
1378,
1379,
1425,
1458,
1509,
1546,
1593,
1634,
1670,
1707,
1743,
1785,
1821,
1842,
1858,
1882,
1918,
1937,
1960,
1975,
1991,
2027,
2071,
2112,
2161,
2204,
2243,
2281,
2320,
2363,
2401,
2424,
2441,
2466,
2505,
2522,
2530,
2568,
2585,
2597,
2601,
2623,
2625,
2626,
2627,
2628,
2661,
2694,
2747,
2784,
2809,
2824,
2856,
2901,
2939,
2965,
2983,
3016,
3025,
3033,
3062,
3064,
3065,
3066,
3100,
3125,
3148,
3158,
3172,
3204,
3268,
3280,
3296,
3356,
3368,
3378,
3380,
3381,
3414,
3437,
3459,
3461,
3500,
3515,
3534,
3535,
3537,
3539,
3541,
3543,
3545,
3547,
3549,
3567,
3582,
3597,
3612,
3633,
3655,
3658,
3673,
3699,
3701,
3703,
3705,
3707,
3709,
3711,
3713,
3715,
3717,
3720,
3723,
3736,
3744,
3765,
3766,
3781,
3838,
3882,
3929,
3977,
4024,
4027,
4075,
4076,
4168,
4207,
4246,
4291,
4323,
4362
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4362,
"ccnet_original_nlines": 299,
"rps_doc_curly_bracket": 0.01283815037459135,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12962962687015533,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016339870169758797,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5261437892913818,
"rps_doc_frac_unique_words": 0.5030425786972046,
"rps_doc_mean_word_length": 4.375253677368164,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.160421371459961,
"rps_doc_word_count": 493,
"rps_doc_frac_chars_dupe_10grams": 0.027352800592780113,
"rps_doc_frac_chars_dupe_5grams": 0.18636995553970337,
"rps_doc_frac_chars_dupe_6grams": 0.1446453332901001,
"rps_doc_frac_chars_dupe_7grams": 0.1075567901134491,
"rps_doc_frac_chars_dupe_8grams": 0.10431154072284698,
"rps_doc_frac_chars_dupe_9grams": 0.08113119751214981,
"rps_doc_frac_chars_top_2gram": 0.023180339485406876,
"rps_doc_frac_chars_top_3gram": 0.005563280079513788,
"rps_doc_frac_chars_top_4gram": 0.007417710032314062,
"rps_doc_books_importance": -380.9392395019531,
"rps_doc_books_importance_length_correction": -380.9392395019531,
"rps_doc_openwebtext_importance": -217.37591552734375,
"rps_doc_openwebtext_importance_length_correction": -217.37591552734375,
"rps_doc_wikipedia_importance": -163.84339904785156,
"rps_doc_wikipedia_importance_length_correction": -163.84339904785156
},
"fasttext": {
"dclm": 0.511390745639801,
"english": 0.47511595487594604,
"fineweb_edu_approx": 1.294368028640747,
"eai_general_math": 0.5396974086761475,
"eai_open_web_math": 0.06650978326797485,
"eai_web_code": 0.3268466591835022
}
}
|
{
"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": "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": "1",
"label": "Technically Flawed"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
244,158,776,262,014,080 |
Tab Groups is a tab-management feature available on most web browsers these days. It helps you reduce tab clutter by letting you organize them however you like and, in turn, allows for distraction-free web browsing.
use tab groups in safari on mac
IMAGE (Edited): Firmbee (Unsplash)
As part of the recent Safari overhaul, Apple has finally introduced Tab Groups in Safari on iPhone, iPad, and Mac. So now, you can organize Safari tabs on your Mac into different groups to minimize distractions and improve your browsing experience.
Follow along as we discuss the steps to group tabs in Safari on Mac.
How to Group Tabs in Safari on Mac
Apple offers two ways to group tabs in Safari on Mac: you can either do this by creating a tab group out of all the open tabs in your current window or starting an empty tab group and adding browser tabs to it subsequently.
1. Create a Tab Group Out of Open Safari Tabs
If you’ve got a bunch of tabs open in Safari on your Mac and you wish to add all of them to the same tab group, Safari has an option to help you do just that.
Here are the steps you need to follow:
1. Open all the tabs you want to group in a tab.
2. Tap on the Show sidebar button in the top-left corner of the toolbar.
3. Right-click on the button that shows the number of active open tabs and select New Tab Group with X Tabs, where X is the number of tabs open in your active Safari window.
create a tab group in safari
4. All your tabs will now appear under the Untitled tab group under Tab Groups. Click on it to verify.
5. Again, right-click on the Untitled tab group and select Rename.
create a tab group in safari
6. Enter a name for this tab group and hit Return to save it.
2. Create a New Tab Group and Add Tabs to It Later
If you’ve got a bunch of tabs open in Safari, which you’d like to add to different tab groups, you can do so by first creating empty tab groups and then adding tabs to them subsequently.
Follow these steps to perform both of these operations:
1. Click on the dropdown button next to the Show sidebar icon in the toolbar and select New Empty Tab Group.
create a new tab group in safari
2. Give a name to this tab group and hit Return.
3. Tap on the button that shows the number of open tabs to view all your active tabs.
4. Control-click or right-click on a tab you want to add to your tab group and select Move to Tab Group > name of the tab group you just created.
create a new tab group in safari
How to Switch Between Safari Tab Groups
Over time, as you create more tab groups, you’ll need to switch between them to access their respective tabs. Apple makes it really easy to switch between tab groups.
For this, all you have to do is click on the dropdown button next to the Show sidebar icon and select the tab group you want to access from the context menu.
switch tab groups in safari
If there are ungrouped tabs in Safari, you can access them by selecting X Tabs in the dropdown menu, where X is the number of tabs active in your browser.
How to Move a Tab to a Different Tab Group
If there’s ever a need to move a tab out of its existing tab group into another tab group, the steps below should help you:
1. Click on the Show sidebar button in the Safari toolbar.
2. Tap on the tab group that has the tab you want to move out to reveal all its tabs.
3. Right-click or Control-click on the tab you want to move and select Move to Tab Group > name of the tab where you want to move the tab.
move tab to a different tab group
How to Remove a Tab From a Tab Group
At any point, if you’d like to remove/delete a tab from a tab group, you can follow these steps:
1. Click on the dropdown button.
2. Right-click on the tab group that has the tab you want to remove and select Show Tab Overview.
3. Tap the close (X) button on the top-left of the tab you want to remove on the right window.
remove a tab from a tab group in safari
How to Delete a Tab Group
Much like removing/deleting a tab from a tab group, Safari also lets you delete a tab group. This might be useful if you created a tab group temporarily to store some tabs but no longer need it.
Follow these steps to delete a tab group:
1. Click on the Show sidebar button in the Safari toolbar.
2. Right-click or Control-click on the tab group you want to delete under Tab Groups and select Delete.
delete a tab group in safari
Sync Tab Groups Across Devices
Once you’ve created a Safari tab group on your iPhone, iPad, or Mac, Apple gives you the option to sync it across all your other devices so you can experience the same browsing experience on your other devices as well.
Follow these instructions to enable tab syncing:
1. Make sure you’re signed in to all your devices with the same Apple ID as your Mac.
2. Turn on syncing for Safari.
• On Mac: Open System Preferences and tap on Apple ID. Tick the checkbox next to Safari.
• On iPhone/iPad: Go to Settings, tap on your name at the top of the page, and select iCloud. Toggle the Safari switch on.
Wait for a few seconds. Your tab groups should appear on all your devices, and you should be able to use, access, and modify them easily on any device.
Note: Update your Mac to the latest macOS version (macOS Monterey at the time of writing this guide) and your iPhone and iPad to the latest version of iOS (iOS 15) and iPadOS (iPadOS 15) to sync your tab groups.
Use Safari Tab Groups to Improve Your Browsing Experience
Tab Groups has to probably be the best feature addition to Safari in a while. It simplifies tab management on Safari tremendously and gives you more control over the active tabs in your window. That way, you can always switch between tab groups to only view the tabs you want at that moment and close all other tabs you don’t.
Was this article helpful?
YesNo
|
{
"url": "https://techpp.com/2022/03/09/safari-tab-groups-mac-guide/",
"source_domain": "techpp.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "360519",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IHDCL7JQLQFPE2CJBP5YCSN7LZ3CT2FZ",
"WARC-Concurrent-To": "<urn:uuid:e5db9d3d-659c-445b-b794-6e5a3da7c621>",
"WARC-Date": "2023-09-22T04:07:34Z",
"WARC-IP-Address": "104.26.14.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:U5IHVUGCFJQ6J6TMBX5XI2TTULKUJIGT",
"WARC-Record-ID": "<urn:uuid:11f0e3f6-9e48-4678-a30b-045da237395c>",
"WARC-Target-URI": "https://techpp.com/2022/03/09/safari-tab-groups-mac-guide/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:52ac627b-6208-4ab8-9f34-5e4bef0401a6>"
},
"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-20\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,
216,
217,
249,
284,
285,
534,
535,
604,
605,
640,
641,
865,
866,
912,
913,
1072,
1073,
1112,
1113,
1164,
1239,
1415,
1448,
1553,
1622,
1655,
1719,
1720,
1771,
1772,
1959,
1960,
2016,
2017,
2128,
2165,
2216,
2304,
2452,
2489,
2490,
2530,
2531,
2698,
2699,
2857,
2858,
2886,
2887,
3042,
3043,
3086,
3087,
3211,
3212,
3273,
3361,
3502,
3540,
3541,
3578,
3579,
3676,
3677,
3712,
3812,
3909,
3953,
3954,
3980,
3981,
4176,
4177,
4219,
4220,
4281,
4387,
4420,
4421,
4452,
4453,
4672,
4673,
4722,
4723,
4811,
4844,
4937,
5064,
5065,
5217,
5218,
5430,
5431,
5489,
5490,
5817,
5818,
5844
],
"line_end_idx": [
216,
217,
249,
284,
285,
534,
535,
604,
605,
640,
641,
865,
866,
912,
913,
1072,
1073,
1112,
1113,
1164,
1239,
1415,
1448,
1553,
1622,
1655,
1719,
1720,
1771,
1772,
1959,
1960,
2016,
2017,
2128,
2165,
2216,
2304,
2452,
2489,
2490,
2530,
2531,
2698,
2699,
2857,
2858,
2886,
2887,
3042,
3043,
3086,
3087,
3211,
3212,
3273,
3361,
3502,
3540,
3541,
3578,
3579,
3676,
3677,
3712,
3812,
3909,
3953,
3954,
3980,
3981,
4176,
4177,
4219,
4220,
4281,
4387,
4420,
4421,
4452,
4453,
4672,
4673,
4722,
4723,
4811,
4844,
4937,
5064,
5065,
5217,
5218,
5430,
5431,
5489,
5490,
5817,
5818,
5844,
5849
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5849,
"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.42097026109695435,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006259779911488295,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1353677660226822,
"rps_doc_frac_unique_words": 0.2405063360929489,
"rps_doc_mean_word_length": 4.059674263000488,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.692144870758057,
"rps_doc_word_count": 1106,
"rps_doc_frac_chars_dupe_10grams": 0.0890868604183197,
"rps_doc_frac_chars_dupe_5grams": 0.2668151259422302,
"rps_doc_frac_chars_dupe_6grams": 0.237193763256073,
"rps_doc_frac_chars_dupe_7grams": 0.1570155918598175,
"rps_doc_frac_chars_dupe_8grams": 0.10289531946182251,
"rps_doc_frac_chars_dupe_9grams": 0.0890868604183197,
"rps_doc_frac_chars_top_2gram": 0.0659242793917656,
"rps_doc_frac_chars_top_3gram": 0.026057910174131393,
"rps_doc_frac_chars_top_4gram": 0.021380849182605743,
"rps_doc_books_importance": -618.1785278320312,
"rps_doc_books_importance_length_correction": -618.1785278320312,
"rps_doc_openwebtext_importance": -342.4873962402344,
"rps_doc_openwebtext_importance_length_correction": -342.4873962402344,
"rps_doc_wikipedia_importance": -305.668212890625,
"rps_doc_wikipedia_importance_length_correction": -305.668212890625
},
"fasttext": {
"dclm": 0.053244590759277344,
"english": 0.8786541819572449,
"fineweb_edu_approx": 1.2105711698532104,
"eai_general_math": 0.24105876684188843,
"eai_open_web_math": 0.06630147248506546,
"eai_web_code": 0.38968557119369507
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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,044,048,826,151,585,000 |
# # ChangeLog for trunk/utils.h # # Generated by Trac 1.0.1 # 2014-08-27T19:37:38+02:00 Fri, 21 Mar 2008 14:36:17 GMT moo [548] * trunk/coverager.c (modified) * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) PHP_5_3 support: uses ZEND_COMPILE_IGNORE_INTERNAL_CLASSES and ... Sat, 08 Mar 2008 03:55:59 GMT moo [543] * trunk/coverager.c (modified) * trunk/mem.c (modified) * trunk/optimizer.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) renamed DEBUG to XCACHE_DEBUG due to conflict to ext/date Sun, 17 Feb 2008 16:49:46 GMT moo [522] * trunk/Decompiler.class.php (modified) * trunk/admin/common-zh-simplified-utf-8.lang.php (modified) * trunk/admin/common-zh-traditional-utf-8.lang.php (modified) * trunk/admin/help-en.lang.php (modified) * trunk/admin/help-zh-simplified-utf-8.lang.php (modified) * trunk/admin/xcache.css (modified) * trunk/admin/xcache.php (modified) * trunk/admin/xcache.tpl.php (modified) * trunk/mkopcode_spec.awk (modified) * trunk/phpdc.phpr (modified) * trunk/run-xcachetest (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) slide hits per second and hour Sat, 05 Jan 2008 04:45:48 GMT moo [506] * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) optimized function_table/class_table by caching hash value Fri, 04 Jan 2008 11:38:57 GMT moo [496] * trunk/ChangeLog (modified) * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache-test.ini (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) * trunk/xcache_globals.h (modified) fixed #157: support user error handler for E_STRICT. E_STRICT is now ... Thu, 31 May 2007 03:48:08 GMT moo [405] * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache_globals.h (modified) full ZendOptimizer compatibility Sun, 27 May 2007 12:36:12 GMT moo [393] * trunk/AUTHORS (modified) * trunk/COPYING (modified) * trunk/Decompiler.class.php (modified) * trunk/NEWS (modified) * trunk/README (modified) * trunk/align.h (modified) * trunk/assembler.c (modified) * trunk/config.m4 (modified) * trunk/const_string.c (modified) * trunk/const_string.h (modified) * trunk/const_string_opcodes_php4.x.h (modified) * trunk/const_string_opcodes_php5.0.h (modified) * trunk/const_string_opcodes_php5.1.h (modified) * trunk/const_string_opcodes_php6.x.h (modified) * trunk/coverager.c (modified) * trunk/coverager.h (modified) * trunk/coverager/common-en.lang.php (modified) * trunk/coverager/common-zh-simplified-gb2312.lang.php (modified) * trunk/coverager/common-zh-simplified-utf-8.lang.php (modified) * trunk/coverager/common.php (modified) * trunk/coverager/coverager.php (modified) * trunk/coverager/coverager.tpl.php (modified) * trunk/coverager/index.php (modified) * trunk/decoder.c (modified) * trunk/disassembler.c (modified) * trunk/disassembler.h (modified) * trunk/encoder.c (modified) * trunk/foreachcoresig.h (modified) * trunk/includes.c (modified) * trunk/lock.c (modified) * trunk/lock.h (modified) * trunk/mem.c (modified) * trunk/mem.h (modified) * trunk/mkopcode.awk (modified) * trunk/mkopcode_spec.awk (modified) * trunk/mkstructinfo.awk (modified) * trunk/mmap.c (modified) * trunk/opcode_spec.c (modified) * trunk/opcode_spec.h (modified) * trunk/optimizer.c (modified) * trunk/optimizer.h (modified) * trunk/processor.c (modified) * trunk/processor/dispatch.m4 (modified) * trunk/processor/hashtable.m4 (modified) * trunk/processor/head.m4 (modified) * trunk/processor/main.m4 (modified) * trunk/processor/processor.m4 (modified) * trunk/processor/string.m4 (modified) * trunk/processor/struct.m4 (modified) * trunk/stack.c (modified) * trunk/stack.h (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xc_shm.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) * trunk/xcache_globals.h (modified) set svn:eol-style Mon, 12 Feb 2007 08:02:19 GMT moo [351] * trunk/utils.h (modified) fix tab Mon, 12 Feb 2007 08:01:44 GMT moo [350] * trunk/utils.h (modified) use AfxTrace way of TRACE for release build Mon, 12 Feb 2007 07:48:57 GMT moo [349] * trunk/utils.c (modified) * trunk/utils.h (modified) build with vc6 by fixing TRAC va_arg Sun, 04 Feb 2007 08:15:00 GMT moo [345] * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) copy function/class table correctly by using add_ref Sun, 04 Feb 2007 06:22:14 GMT moo [344] * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache_globals.h (modified) copy internal functions/classes into sandbox, they're needed by compiler Fri, 08 Dec 2006 16:11:19 GMT moo [305] * trunk/coverager.c (modified) * trunk/mem.c (modified) * trunk/mmap.c (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xc_malloc.c (modified) * trunk/xc_shm.h (modified) * trunk/xcache.c (modified) TRACE() instead of ifdef/fprintf Sun, 29 Oct 2006 02:05:01 GMT moo [268] * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache-zh-gb2312.ini (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) * trunk/xcache.ini (modified) full compatible with auto_globals_jit, no need to disable it from now on Wed, 04 Oct 2006 00:38:45 GMT moo [212] * trunk/coverager.c (modified) * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) fixed #41, early class binding Mon, 02 Oct 2006 01:09:56 GMT moo [209] * trunk/utils.c (modified) * trunk/utils.h (modified) fixed #42, conflict between xcache sandbox and user error handler Sun, 03 Sep 2006 07:37:05 GMT moo [131] * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) move open_files out of sandbox, it's not needed Sun, 27 Aug 2006 05:09:02 GMT moo [103] * trunk/processor/head.m4 (modified) * trunk/processor/processor.m4 (modified) * trunk/processor/string.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) PHP_6: builds again with php6. update UChar/void ptr to zstr. Sun, 16 Jul 2006 11:07:57 GMT moo [95] * trunk/config.m4 (modified) * trunk/config.w32 (modified) * trunk/processor/processor.m4 (modified) * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.c (modified) * trunk/xcache.h (modified) fixed #20, default: --enable-xcache-constant=yes Sun, 09 Jul 2006 12:47:31 GMT moo [88] * trunk/utils.c (modified) * trunk/utils.h (modified) * trunk/xcache.h (modified) possible fix for #14 "Cannot redeclare ()" Tue, 09 May 2006 10:58:38 GMT moo [1] * trunk (added) * trunk/.vimrc (added) * trunk/Decompiler.class.php (added) * trunk/INSTALL (added) * trunk/Makefile.frag (added) * trunk/align.h (added) * trunk/assembler.c (added) * trunk/config.m4 (added) * trunk/const_string.c (added) * trunk/const_string.h (added) * trunk/const_string_opcodes_php4.x.h (added) * trunk/const_string_opcodes_php5.1.h (added) * trunk/const_string_opcodes_php6.x.h (added) * trunk/coverage.c (added) * trunk/coverage.h (added) * trunk/decoder.c (added) * trunk/disassembler.c (added) * trunk/disassembler.h (added) * trunk/encoder.c (added) * trunk/includes.c (added) * trunk/lock.c (added) * trunk/lock.h (added) * trunk/make.devel (added) * trunk/make.inc.example (added) * trunk/mem.c (added) * trunk/mem.h (added) * trunk/mkopcode.awk (added) * trunk/mkopcode_spec.awk (added) * trunk/mkstructinfo.awk (added) * trunk/mmap.c (added) * trunk/myshm.h (added) * trunk/opcode_spec.c (added) * trunk/opcode_spec.h (added) * trunk/optimizer.c (added) * trunk/optimizer.h (added) * trunk/phpdc.phpr (added) * trunk/phpdop.phpr (added) * trunk/processor (added) * trunk/processor.c (added) * trunk/processor/dispatch.m4 (added) * trunk/processor/hashtable.m4 (added) * trunk/processor/head.m4 (added) * trunk/processor/main.m4 (added) * trunk/processor/processor.m4 (added) * trunk/processor/string.m4 (added) * trunk/processor/struct.m4 (added) * trunk/stack.c (added) * trunk/stack.h (added) * trunk/test.php (added) * trunk/utils.c (added) * trunk/utils.h (added) * trunk/xcache.c (added) * trunk/xcache.h (added) * trunk/xcache.ini (added) * trunk/xcache_globals.h (added) initial import to online
|
{
"url": "http://xcache.lighttpd.net/log/trunk/utils.h?format=changelog&rev=548&limit=100&mode=stop_on_copy",
"source_domain": "xcache.lighttpd.net",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "9172",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6GG5JJUCHFHL7YDG3EWQHZ2BSRKXRTKW",
"WARC-Concurrent-To": "<urn:uuid:bd1bee72-92bd-4eac-83d0-bb1e8042b366>",
"WARC-Date": "2014-08-27T17:37:38Z",
"WARC-IP-Address": "188.40.103.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JERPVFBLAXJ5DLKG5TO2F3I2RSRVKBCA",
"WARC-Record-ID": "<urn:uuid:1e281ee2-ab66-4701-8639-95e0e32d4d17>",
"WARC-Target-URI": "http://xcache.lighttpd.net/log/trunk/utils.h?format=changelog&rev=548&limit=100&mode=stop_on_copy",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:afe1d8d1-0eb9-488d-bccd-3bc8d1146666>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
8509
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8509,
"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.07686275243759155,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014509799890220165,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5549019575119019,
"rps_doc_frac_unique_words": 0.36849313974380493,
"rps_doc_mean_word_length": 8.534246444702148,
"rps_doc_num_sentences": 228,
"rps_doc_symbol_to_word_ratio": 0.004705879837274551,
"rps_doc_unigram_entropy": 4.427670478820801,
"rps_doc_word_count": 730,
"rps_doc_frac_chars_dupe_10grams": 0.08154092729091644,
"rps_doc_frac_chars_dupe_5grams": 0.26099517941474915,
"rps_doc_frac_chars_dupe_6grams": 0.20016050338745117,
"rps_doc_frac_chars_dupe_7grams": 0.1701444536447525,
"rps_doc_frac_chars_dupe_8grams": 0.12263242155313492,
"rps_doc_frac_chars_dupe_9grams": 0.09534510225057602,
"rps_doc_frac_chars_top_2gram": 0.020224720239639282,
"rps_doc_frac_chars_top_3gram": 0.07800962775945663,
"rps_doc_frac_chars_top_4gram": 0.0975923016667366,
"rps_doc_books_importance": -1134.4854736328125,
"rps_doc_books_importance_length_correction": -1134.4854736328125,
"rps_doc_openwebtext_importance": -585.9749755859375,
"rps_doc_openwebtext_importance_length_correction": -585.9749755859375,
"rps_doc_wikipedia_importance": -667.6248168945312,
"rps_doc_wikipedia_importance_length_correction": -667.6248168945312
},
"fasttext": {
"dclm": 0.9998842477798462,
"english": 0.7860844135284424,
"fineweb_edu_approx": 0.8263519406318665,
"eai_general_math": 0.003007469931617379,
"eai_open_web_math": 0.4086381196975708,
"eai_web_code": 7.200000027296483e-7
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,532,544,990,628,167,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I'm using tinyMCE editor to post my message and if I entered any list type message or manually entered any div or li or ul items using tinyMCE, if I listed the message sent list it leads me to design conflict...
I'm using strip_tags like:
echo strip_tags($message,'</ul></li></p>');
But even though I got the same issue, can anyone help me solve that? My message listing is like this:
<ul><?php
foreach($messages as $message)
{ ?>
<li><?php
echo strip_tags($message,'</ul></li></p>');
?>
</li>
}?>
</ul>
My message will be like this
$message = "
<ul>
<li>Gautam</li>
<li>S.Visser</li>
<li>DaggNabbit</li>
</ul>";
share|improve this question
Why whould you allow </ul></li></p> those tags ? – S.Visser Apr 25 '13 at 6:40
Because only those tags Iam using through timyMCE editor.. – Gautam3164 Apr 25 '13 at 6:41
Can you give us an example of the data in $message? – S.Visser Apr 25 '13 at 6:42
S.Visser see my edit... – Gautam3164 Apr 25 '13 at 6:44
3 Answers 3
up vote 3 down vote accepted
The output of $message whould be this:
Gautam</li>
S.Visser</li>
DaggNabbit</li>
</ul>
What makes the html output:
<ul>
<li>Gautam</li>
S.Visser</li>
DaggNabbit</li>
</ul>
</li>
</ul>
What makes it incorrect html.
I'm not fully sure what you trying to accomplish but I think if you use striptags like this:
echo strip_tags($message,'<ul><li><p></ul></li></p>');
You should get correct html.
share|improve this answer
I'm agree too with this answer, why don't you try it? – Don Angelo Annoni Apr 25 '13 at 7:13
Thanks It is working for me...and I have also put an answer to my own question....can u see and tell me the comment..?? – Gautam3164 Apr 25 '13 at 9:14
I have tried with html_entity_decode and it is also working ...I tried like this
<ul>
<?php
foreach($messages as $message)
{
echo "<li>";
echo html_entity_decode($message);
echo "</li>";
}
?>
</ul>
share|improve this answer
You have broken your script... I've fixed the syntax
<ul>
<?php
foreach($messages as $message)
{
echo "<li>";
echo strip_tags($message,'</ul></li></p>');
echo "</li>";
}
?>
</ul>
Is that what you wanted?
share|improve this answer
Both are same right...?? – Gautam3164 Apr 25 '13 at 6:53
yep no difference – Don Angelo Annoni Apr 25 '13 at 7:02
But I didnt downvoted for this – Gautam3164 Apr 25 '13 at 7:02
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/16207966/how-to-get-rid-of-html-conflict",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "87264",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WBXTX7HL54XLVIGCFEBHFIOJTW63FKSN",
"WARC-Concurrent-To": "<urn:uuid:eb40f838-ad78-4a29-a94a-3d717cde899b>",
"WARC-Date": "2015-08-29T17:45:10Z",
"WARC-IP-Address": "104.16.105.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XNHSMC6JRMEW6XBEWZOTQ3MQWGVA7UDV",
"WARC-Record-ID": "<urn:uuid:58ddf1eb-b818-4125-8675-b75d36d6cd57>",
"WARC-Target-URI": "http://stackoverflow.com/questions/16207966/how-to-get-rid-of-html-conflict",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:57c92121-0839-4bd6-b797-962f2c16c282>"
},
"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,
25,
131,
132,
344,
345,
372,
373,
417,
418,
520,
521,
532,
563,
569,
581,
630,
638,
646,
650,
656,
657,
686,
687,
700,
705,
725,
747,
771,
779,
807,
812,
892,
897,
989,
994,
1077,
1082,
1139,
1140,
1152,
1153,
1182,
1183,
1222,
1223,
1235,
1249,
1265,
1271,
1272,
1300,
1301,
1306,
1323,
1341,
1361,
1369,
1377,
1383,
1384,
1414,
1415,
1508,
1509,
1564,
1565,
1594,
1595,
1621,
1626,
1720,
1725,
1878,
1879,
1960,
1961,
1966,
1973,
2007,
2014,
2033,
2074,
2094,
2099,
2102,
2108,
2134,
2135,
2188,
2189,
2194,
2201,
2232,
2236,
2253,
2301,
2319,
2321,
2324,
2330,
2331,
2356,
2357,
2383,
2388,
2446,
2451,
2509,
2514,
2578,
2579,
2591,
2592,
2594,
2602,
2603,
2681,
2682
],
"line_end_idx": [
25,
131,
132,
344,
345,
372,
373,
417,
418,
520,
521,
532,
563,
569,
581,
630,
638,
646,
650,
656,
657,
686,
687,
700,
705,
725,
747,
771,
779,
807,
812,
892,
897,
989,
994,
1077,
1082,
1139,
1140,
1152,
1153,
1182,
1183,
1222,
1223,
1235,
1249,
1265,
1271,
1272,
1300,
1301,
1306,
1323,
1341,
1361,
1369,
1377,
1383,
1384,
1414,
1415,
1508,
1509,
1564,
1565,
1594,
1595,
1621,
1626,
1720,
1725,
1878,
1879,
1960,
1961,
1966,
1973,
2007,
2014,
2033,
2074,
2094,
2099,
2102,
2108,
2134,
2135,
2188,
2189,
2194,
2201,
2232,
2236,
2253,
2301,
2319,
2321,
2324,
2330,
2331,
2356,
2357,
2383,
2388,
2446,
2451,
2509,
2514,
2578,
2579,
2591,
2592,
2594,
2602,
2603,
2681,
2682,
2772
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2772,
"ccnet_original_nlines": 118,
"rps_doc_curly_bracket": 0.002164500067010522,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2541106045246124,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02840059995651245,
"rps_doc_frac_lines_end_with_ellipsis": 0.008403359912335873,
"rps_doc_frac_no_alph_words": 0.3557548522949219,
"rps_doc_frac_unique_words": 0.45388349890708923,
"rps_doc_mean_word_length": 4.509708881378174,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.010463380254805088,
"rps_doc_unigram_entropy": 4.859398365020752,
"rps_doc_word_count": 412,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1442411243915558,
"rps_doc_frac_chars_dupe_6grams": 0.14101183414459229,
"rps_doc_frac_chars_dupe_7grams": 0.06889127939939499,
"rps_doc_frac_chars_dupe_8grams": 0.06889127939939499,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.024219589307904243,
"rps_doc_frac_chars_top_3gram": 0.03390742838382721,
"rps_doc_frac_chars_top_4gram": 0.04359525814652443,
"rps_doc_books_importance": -275.4665222167969,
"rps_doc_books_importance_length_correction": -275.4665222167969,
"rps_doc_openwebtext_importance": -159.8773193359375,
"rps_doc_openwebtext_importance_length_correction": -159.8773193359375,
"rps_doc_wikipedia_importance": -153.6101837158203,
"rps_doc_wikipedia_importance_length_correction": -153.6101837158203
},
"fasttext": {
"dclm": 0.3266589641571045,
"english": 0.7240864634513855,
"fineweb_edu_approx": 1.180864691734314,
"eai_general_math": 0.0002931400085799396,
"eai_open_web_math": 0.1656685471534729,
"eai_web_code": -0.000009540000064589549
}
}
|
{
"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.432",
"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": "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
|
941,575,549,307,445,200 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I'm trying to use the Rhino shell methods such as load, print, etc. My question is SIMILAR to this one, however, I DO NOT have access to the actual java code without hacking apart the framework itself (accela automation FWIW). I'd like to be able to easily add on other .js scripts such as jQuery. But the big caveat is that I only have access to the javascript scripts - not the actual java context. That being said - I can (of course) do the typical Rhino things such as call on java classes, objects, etc.
Has anyone done this or have any good ideas how I would go about it?
share|improve this question
1 Answer 1
up vote 0 down vote accepted
Seems this is what I was looking for:
var manager = new Packages.javax.script.ScriptEngineManager();
var engine = manager.getEngineByName( "js" );
var scriptFile = "/pathToScript/scriptFileName.js";
var eval = engine.eval( new Packages.java.io.FileReader( new Packages.java.io.File( " + scriptFile + " ) ) );
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://stackoverflow.com/questions/5110353/easy-way-to-include-rhino-shell-methods-in-scripts-or-to-load-other-js-scripts",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "67920",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KGTYGMJJPD6SQE7U43YKHDP6IQU65HOS",
"WARC-Concurrent-To": "<urn:uuid:8646a980-197c-4445-a7e3-0314f2095d8e>",
"WARC-Date": "2015-07-07T17:53:04Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5XXAC4YNJTXAEEJ4RYWTOA6YRUMQBBUT",
"WARC-Record-ID": "<urn:uuid:b06a4b48-33b0-4587-9b32-91ca82dd715e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5110353/easy-way-to-include-rhino-shell-methods-in-scripts-or-to-load-other-js-scripts",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:25f1ecb2-d4b0-4a90-8e75-9db418608a7c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 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,
131,
132,
641,
642,
711,
712,
740,
741,
752,
753,
782,
783,
821,
822,
885,
931,
932,
984,
1094,
1120,
1121,
1133,
1134,
1136,
1144,
1145,
1223,
1224
],
"line_end_idx": [
25,
131,
132,
641,
642,
711,
712,
740,
741,
752,
753,
782,
783,
821,
822,
885,
931,
932,
984,
1094,
1120,
1121,
1133,
1134,
1136,
1144,
1145,
1223,
1224,
1314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1314,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3333333432674408,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03780068829655647,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2508591115474701,
"rps_doc_frac_unique_words": 0.6470588445663452,
"rps_doc_mean_word_length": 4.946078300476074,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.664408206939697,
"rps_doc_word_count": 204,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01783943921327591,
"rps_doc_frac_chars_top_3gram": 0.02378593012690544,
"rps_doc_frac_chars_top_4gram": 0.029732409864664078,
"rps_doc_books_importance": -143.15032958984375,
"rps_doc_books_importance_length_correction": -143.15032958984375,
"rps_doc_openwebtext_importance": -71.89228057861328,
"rps_doc_openwebtext_importance_length_correction": -71.89228057861328,
"rps_doc_wikipedia_importance": -66.73775482177734,
"rps_doc_wikipedia_importance_length_correction": -66.73768615722656
},
"fasttext": {
"dclm": 0.6100994944572449,
"english": 0.912665605545044,
"fineweb_edu_approx": 1.0729845762252808,
"eai_general_math": -0.000008580000212532468,
"eai_open_web_math": 0.035642918199300766,
"eai_web_code": -0.000005719999990105862
}
}
|
{
"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": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,395,338,305,253,354,000 |
[Gdal-dev] Shapefile feature deletion and feature count
Frank Warmerdam warmerdam at pobox.com
Sat Mar 10 13:59:36 EST 2007
Andrea Aime wrote:
> So far it seems I'll have to write a generic base infrastructure, and
> then provide variant behavior with helper classes/subclasses to handle
> the difference between various drivers. For example, Geotools
> API requires me either not writing at all, or support all writing
> features. To cope with this, I'll have to create classes that allow
> me to move and rename layers for each different format I want to
> support, since most of the OGR data sources I'm interested with
> do not support delete/update (Geotools is lacking on file based
> data sources). That is, the idea is that if I want to mimic in place
> update/delete, I'll really have to rewrite the file with a different
> name/location, delete the original one, and finally move/rename the
> new one.
Andrea,
Perhaps the GeoTools API should try being more fine grained with regard
to writing features. Assuming that is impractical, I would suggest a
generic approach to read access, and then using some "working" format
for all update access, and on close copying back to the original format.
This approach would minimize the amount of driver specific work.
Overall, as long as geotools takes such a strict view of datastore
responsibilities for writing, you are pretty much stuck implementing
update in place via a working format. For the time being you could
likely use MEM format as the working format though of course this
makes working with large datasets impractical.
Shapefile is not a good working format since it imposes so many
extra restrictions (short field names, no mixing geometry types,
no variable length fields).
Ultimately the question arises about how important it is to provide
write access through OGR for GeoTools.
Best regards,
--
---------------------------------------+--------------------------------------
I set the clouds in motion - turn up | Frank Warmerdam, warmerdam at pobox.com
light and sound - activate the windows | http://pobox.com/~warmerdam
and watch the world go round - Rush | President OSGeo, http://osgeo.org
More information about the Gdal-dev mailing list
|
{
"url": "https://lists.osgeo.org/pipermail/gdal-dev/2007-March/012112.html",
"source_domain": "lists.osgeo.org",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "5082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5LOJ64KVAICV2OGS3HQLQBMEB6K27Y2R",
"WARC-Concurrent-To": "<urn:uuid:c9453cc8-6fd2-4126-976f-72272ca829eb>",
"WARC-Date": "2019-03-20T05:19:21Z",
"WARC-IP-Address": "140.211.15.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VKSX54FDHNBDU5FKRVGAA3OXGADYEITP",
"WARC-Record-ID": "<urn:uuid:c4ddbf6a-2ee0-44f1-a948-6f02f2648523>",
"WARC-Target-URI": "https://lists.osgeo.org/pipermail/gdal-dev/2007-March/012112.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7e70c303-d026-4f88-90f5-528538903ce2>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-30-226-49.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
56,
57,
96,
125,
126,
127,
146,
218,
291,
355,
423,
493,
561,
627,
693,
764,
835,
905,
916,
917,
925,
926,
998,
1068,
1138,
1211,
1276,
1277,
1344,
1413,
1481,
1547,
1594,
1595,
1659,
1724,
1752,
1753,
1821,
1860,
1861,
1875,
1879,
1958,
2039,
2108,
2183,
2184,
2185,
2186,
2187
],
"line_end_idx": [
56,
57,
96,
125,
126,
127,
146,
218,
291,
355,
423,
493,
561,
627,
693,
764,
835,
905,
916,
917,
925,
926,
998,
1068,
1138,
1211,
1276,
1277,
1344,
1413,
1481,
1547,
1594,
1595,
1659,
1724,
1752,
1753,
1821,
1860,
1861,
1875,
1879,
1958,
2039,
2108,
2183,
2184,
2185,
2186,
2187,
2235
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2235,
"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.34712645411491394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03218391165137291,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1908046007156372,
"rps_doc_frac_unique_words": 0.5905044674873352,
"rps_doc_mean_word_length": 5.026706218719482,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.005104064941406,
"rps_doc_word_count": 337,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03896104171872139,
"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.030696580186486244,
"rps_doc_frac_chars_top_3gram": 0.02715465985238552,
"rps_doc_frac_chars_top_4gram": 0.029515940696001053,
"rps_doc_books_importance": -155.1813507080078,
"rps_doc_books_importance_length_correction": -155.1813507080078,
"rps_doc_openwebtext_importance": -119.00363159179688,
"rps_doc_openwebtext_importance_length_correction": -119.00363159179688,
"rps_doc_wikipedia_importance": -84.93012237548828,
"rps_doc_wikipedia_importance_length_correction": -84.93012237548828
},
"fasttext": {
"dclm": 0.027489660307765007,
"english": 0.9104878306388855,
"fineweb_edu_approx": 1.6281896829605103,
"eai_general_math": 0.6759246587753296,
"eai_open_web_math": 0.35440492630004883,
"eai_web_code": 0.2666795253753662
}
}
|
{
"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.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,371,590,156,352,328,000 |
Batch upload client for GNU MediaGoblin
Python
Latest commit 3b62450 Oct 8, 2013 @joar Merge pull request #7 from phaer/master
now usable with oauth2
Permalink
Failed to load latest commit information.
automgtic
.gitignore
README.rst
automgtic.ini
run.py
setup.py Added oauthlib to deps Dec 26, 2012
README.rst
automgtic
automgtic is an automatic media uploader for GNU MediaGoblin.
Features
automgtic authenticates to the GNU MediaGoblin server via OAuth draft v2.25.
automgtic uses a local database where it stores:
• An MD5 digest of an uploaded file to prevent multiple uploads of the same file due to filesystem changes.
• The filename of the file when it was uploaded.
• The metadata returned by the GNU MediaGoblin server when the file was posted.
Installation
To install automgtic, download the files or clone the repo, then cd to the directory containing the automgtic.ini file and run:
virtualenv . # Create a new python virtualenv
. bin/activate # Activate the virtualenv
python setup.py develop # Fetch all the dependencies into your virtualenv
# !! - This is a single command split up on two lines
python -c "from automgtic.models import Base, engine
Base.metadata.create_all(engine)" # Create the DB tables
Usage
Make sure to activate the following plugins on mediagoblin
[plugins]
[[mediagoblin.plugins.oauth]]
[[mediagoblin.plugins.api]]
[[mediagoblin.plugins.httpapiauth]]
Once you have installed the dependencies, you need to have an OAuth client registered on the GNU MediaGoblin instance, you can register one at instance.example/oauth-2/client/register.
Name it what you want, type should be "Public", and Redirect URI should be "http://www.foo.example/".
Once you have registered your OAuth client you need the client identifier in your config.
Warning
Before you start editing your config, do cp automgtic.ini automgtic_local.ini, this to separate the version-controlled automgtic.ini from your local settings.
When the client_id is set, run ./run.py --authorize, then follow the instructions provided. This will update your .ini with the access_token field and you will be ready to upload media with automgtic.
To upload media from a directory, simply run ./run.py --run <directory>.
|
{
"url": "https://github.com/joar/automgtic",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "51399",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M23F7E7HU2Y7CYXBKLRZMK3IOGLEJMHP",
"WARC-Concurrent-To": "<urn:uuid:d8f12817-c0be-4f1b-8543-56b77193b737>",
"WARC-Date": "2016-09-26T17:37:46Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BWNCLQGOTZJVHOLCJF75BP3IEVO5YI3I",
"WARC-Record-ID": "<urn:uuid:b7a5d0ef-a3ef-4a04-a8ea-2aaea7e5e30d>",
"WARC-Target-URI": "https://github.com/joar/automgtic",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1a4f0b0a-6981-4372-932e-bfdb787e70c5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 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,
40,
47,
127,
150,
160,
202,
212,
223,
234,
248,
255,
300,
301,
312,
313,
323,
324,
386,
387,
396,
397,
474,
475,
524,
525,
635,
686,
768,
769,
782,
783,
911,
912,
959,
1001,
1076,
1130,
1183,
1240,
1241,
1247,
1248,
1307,
1308,
1318,
1348,
1376,
1412,
1413,
1598,
1599,
1701,
1702,
1792,
1793,
1801,
1802,
1961,
1962,
2163,
2164
],
"line_end_idx": [
40,
47,
127,
150,
160,
202,
212,
223,
234,
248,
255,
300,
301,
312,
313,
323,
324,
386,
387,
396,
397,
474,
475,
524,
525,
635,
686,
768,
769,
782,
783,
911,
912,
959,
1001,
1076,
1130,
1183,
1240,
1241,
1247,
1248,
1307,
1308,
1318,
1348,
1376,
1412,
1413,
1598,
1599,
1701,
1702,
1792,
1793,
1801,
1802,
1961,
1962,
2163,
2164,
2236
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2236,
"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.2702702581882477,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022522520273923874,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23423422873020172,
"rps_doc_frac_unique_words": 0.5601266026496887,
"rps_doc_mean_word_length": 5.591772079467773,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.01351351011544466,
"rps_doc_unigram_entropy": 4.836454391479492,
"rps_doc_word_count": 316,
"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.039615169167518616,
"rps_doc_frac_chars_top_3gram": 0.02886248007416725,
"rps_doc_frac_chars_top_4gram": 0.026032820343971252,
"rps_doc_books_importance": -183.47354125976562,
"rps_doc_books_importance_length_correction": -183.47354125976562,
"rps_doc_openwebtext_importance": -131.7479705810547,
"rps_doc_openwebtext_importance_length_correction": -131.7479705810547,
"rps_doc_wikipedia_importance": -100.62138366699219,
"rps_doc_wikipedia_importance_length_correction": -100.62138366699219
},
"fasttext": {
"dclm": 0.12182450294494629,
"english": 0.7036235928535461,
"fineweb_edu_approx": 1.817869782447815,
"eai_general_math": 0.19975155591964722,
"eai_open_web_math": 0.07476294040679932,
"eai_web_code": 0.6657626628875732
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,823,803,319,468,581,400 |
WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspxIn my previous posts, I described the new WinHttp proxy , tracing and client certificate configuration story for Windows Vista Beta2. The syntax of the netsh commands used to configure WinHttp proxy and tracing settings have changed for Vista RTM anden-USTelligent Evolution Platform Developer Build (Build: 5.6.50428.7875)re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#10073775Sun, 10 Oct 2010 11:51:01 GMT91d46819-8472-40ad-a661-2c78acb4018c:10073775Maximilian Haru Raditya<p>I wonder why the team remain silent if being asked with such question (about proxy authentication), such as the one asked by @Steve Gombotz above and me myself.</p> <p>I can't hardly remember if they ever say a thing in my suggestion I've reported in Connect (I even can't see my suggestion anymore; not sure where it goes...)</p> <div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=10073775" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#10016972Fri, 28 May 2010 16:34:06 GMT91d46819-8472-40ad-a661-2c78acb4018c:10016972Steve Gombotz<p>Is there way to set or use authentication over the winhttp proxy settings? I have a scenarion where if I my proxy doesn't require authentication, the winhttp proxy settings work fine, but if the proxy does require authentication, the service doesn't send auth to the proxy. (ie. does work though)</p> <p>It's almost like winhttp doesn't work in a "interactive mode" with the proxy.</p> <p>Can you confirm or deny?</p> <div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=10016972" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#9800551Wed, 24 Jun 2009 03:40:18 GMT91d46819-8472-40ad-a661-2c78acb4018c:9800551wndpteam<p>Bruce</p> <p>The command to reset your proxy settings is</p> <p>netsh winhttp reset proxy</p> <p>Thanks</p> <p>-Jonathan Silvera</p> <p>WinHTTP Program Manager</p> <div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=9800551" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#9800467Wed, 24 Jun 2009 02:24:53 GMT91d46819-8472-40ad-a661-2c78acb4018c:9800467Bruce Willis<p>Hi!</p> <p>How can I unset the proxy after executing</p> <p>netsh winhttp>set proxy myproxy ?</p> <p>I've tried the command unset proxy but I've an error as result.</p> <p>Please advice.</p> <p>Thanks in advance!</p> <p>Bruce.</p><div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=9800467" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#8838181Wed, 06 Aug 2008 20:15:38 GMT91d46819-8472-40ad-a661-2c78acb4018c:8838181Sam McKelvie<p>I would love to see a named entity that represents a logical collection of proxy settings (or other http/networking settings, such as autologon policy, SSL client certificate, etc.) like this. Then any client application could configure its HTTP settings by binding to a single logical name rather than hardcoding settings or having to provide its own elaborate configuration UI. It also be nice if one collection of settings could inherit defaults from another collection and refine them, rather than becoming a full copy of settings. This would help keep shared settings in one place and would improve the backwards compat story when new settings are added.</p> <p>Rather than hiding everything in the registry, it would also be nice if at the time I bind to WinHTTP or create a session, I could point at a config file or just provide a blob of XML to describe an entity. But that may be too abstract for WinHTTP.</p><div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=8838181" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#6742368Wed, 12 Dec 2007 07:49:33 GMT91d46819-8472-40ad-a661-2c78acb4018c:6742368Maximilian Haru Raditya<p>@NMI</p> <p>> Well, it's a matter of win-history :) You can separate your proxy settings for the "user browser" and for the "core services".</p> <p>The problem is there's no consistency among the two. For example, for system proxy (set through proxycfg in WinXP), there's no way you can set your authentication data (user name and password), while you can do this in IE.</p> <p>The idea I'm bringing is to create a standardized system proxy manager where you can put all standardized proxy information (the address, port, user name, password, etc.). Then, a user can create many proxy configurations so that (for example):</p> <p>- "core service" can choose "proxy configuration a"</p> <p>- "user browser" can choose "proxy configuration b"</p> <p>What do you think? Still each apps can still choose different proxies but IMHO it's a more scalable solution. Yet, it's more well-defined than current approach taken in Windows (even Vista; I haven't seen WinServer 2008 yet).</p> <p>Further, I've reported it here:</p> <p><a rel="nofollow" target="_new" href="https://connect.microsoft.com/WNDP/feedback/ViewFeedback.aspx?FeedbackID=153320">https://connect.microsoft.com/WNDP/feedback/ViewFeedback.aspx?FeedbackID=153320</a></p> <div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=6742368" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#6712978Sun, 09 Dec 2007 16:48:31 GMT91d46819-8472-40ad-a661-2c78acb4018c:6712978NMi<p>Thanks for the clues about netsh/winhttp !</p> <p>> Why would I set the same information in more than one place?</p> <p>Well, it's a matter of win-history :) You can separate your proxy settings for the "user browser" and for the "core services".</p><div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=6712978" width="1" height="1">re: WinHttp Configuration for Windows Vistahttp://blogs.msdn.com/b/wndp/archive/2007/03/21/winhttp-configuration-for-windows-vista.aspx#1939556Sat, 24 Mar 2007 01:45:15 GMT91d46819-8472-40ad-a661-2c78acb4018c:1939556Maximilian Haru Raditya<p>Regards to setting up the proxy server address, so how to set up the http proxy authentication data: both the user name and the password?</p> <p>HTTP proxy authencation (HTTP 407) has always been problem so far in Windows platform.</p> <p>Is there any effort to unify this network setting to become ONLY in one place?</p> <p>Now, I see this in WinHttp Configuration. I've seen this also in IE. Why would I set the same information in more than one place?</p> <p>Any thoughts?</p> <p>Thanks!</p> <div style="clear:both;"></div><img src="http://blogs.msdn.com/aggbug.aspx?PostID=1939556" width="1" height="1">
|
{
"url": "http://blogs.msdn.com/b/wndp/rsscomments.aspx?WeblogPostID=1927468",
"source_domain": "blogs.msdn.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "10372",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YK64J6ACF4NK6SF7BMTKOKUKXOXWDUZY",
"WARC-Concurrent-To": "<urn:uuid:aeeb7f6d-95a3-4440-a706-079719f2db9c>",
"WARC-Date": "2015-02-02T01:01:36Z",
"WARC-IP-Address": "65.52.103.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YSLIFPFELDAJDTAMBXGPEFP7JMRLX3LV",
"WARC-Record-ID": "<urn:uuid:3b53a157-e5a9-4366-bd88-804a3c9e0a7e>",
"WARC-Target-URI": "http://blogs.msdn.com/b/wndp/rsscomments.aspx?WeblogPostID=1927468",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5e267352-f0ec-4560-8d53-b8efa1a4947d>"
},
"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
],
"line_end_idx": [
7398
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7398,
"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.24057820439338684,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017552919685840607,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40423333644866943,
"rps_doc_frac_unique_words": 0.4770992398262024,
"rps_doc_mean_word_length": 7.273536682128906,
"rps_doc_num_sentences": 110,
"rps_doc_symbol_to_word_ratio": 0.008260199800133705,
"rps_doc_unigram_entropy": 5.441773891448975,
"rps_doc_word_count": 786,
"rps_doc_frac_chars_dupe_10grams": 0.05037606880068779,
"rps_doc_frac_chars_dupe_5grams": 0.10547489672899246,
"rps_doc_frac_chars_dupe_6grams": 0.10547489672899246,
"rps_doc_frac_chars_dupe_7grams": 0.05037606880068779,
"rps_doc_frac_chars_dupe_8grams": 0.05037606880068779,
"rps_doc_frac_chars_dupe_9grams": 0.05037606880068779,
"rps_doc_frac_chars_top_2gram": 0.03498338162899017,
"rps_doc_frac_chars_top_3gram": 0.03620779886841774,
"rps_doc_frac_chars_top_4gram": 0.04722756892442703,
"rps_doc_books_importance": -786.5811767578125,
"rps_doc_books_importance_length_correction": -786.5811767578125,
"rps_doc_openwebtext_importance": -379.16900634765625,
"rps_doc_openwebtext_importance_length_correction": -379.16900634765625,
"rps_doc_wikipedia_importance": -275.5041809082031,
"rps_doc_wikipedia_importance_length_correction": -275.5041809082031
},
"fasttext": {
"dclm": 0.0510290302336216,
"english": 0.6761975884437561,
"fineweb_edu_approx": 2.0022647380828857,
"eai_general_math": 0.6822579503059387,
"eai_open_web_math": 0.2390093207359314,
"eai_web_code": 0.3023275136947632
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"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": "16",
"label": "Personal Blog"
},
"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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,866,364,431,226,314,000 |
Related Articles
Related Articles
Collision Detection in CSMA/CD
• Difficulty Level : Medium
• Last Updated : 19 Dec, 2019
CSMA/CD (Carrier Sense Multiple Access/ Collision Detection) is a media-access control method that was widely used in Early Ethernet technology/LANs, When there used to be shared
Bus Topology and each Nodes( Computers) were connected By Coaxial Cables.Now a Days Ethernet is Full Duplex and CSMA/CD is not used as Topology is either Star (connected via Switch or Router)
or Point to Point ( Direct Connection) but they are still supported though.
Consider a scenario where there are ‘n’ stations on a link and all are waiting to transfer data through that channel. In this case all ‘n’ stations would want to access the link/channel to transfer their own data.Problem arises when more than one station transmits the data at the moment. In this case, there will be collisions in the data from different stations.
CSMA/CD is one such technique where different stations that follow this protocol agree on some terms and collision detection measures for effective transmission. This protocol decides which station will transmit when so that data reaches the destination without corruption.
How CSMA/CD works?
• Step 1: Check if the sender is ready for transmitting data packets.
• Step 2: Check if the transmission link is idle?
Sender has to keep on checking if the transmission link/medium is idle. For this it continously senses transmissions from other nodes. Sender sends dummy data on the link.If it does not receive any collision signal, this means the link is idle at the moment.If it senses that the carrier is free and there are no collisions, it sends the data. Otherwise it refrains from sending data.
• Step 3: Transmit the data & check for collisions.
Sender transmits its data on the link. CSMA/CD does not use ‘acknowledgement’ system. It checks for the successful and unsuccessful transmissions through collision signals. During transmission, if collision signal is received by the node, transmission is stopped. The station then transmits a jam signal onto the link and waits for random time interval before it resends the frame. After some random time, it again attempts to transfer the data and repeats above process.
• Step 4: If no collision was detected in propagation, the sender completes its frame transmission and resets the counters.
How a station knows if its data collides?
Consider the above situation. Two stations, A & B.
Propagation Time: Tp = 1 hr ( Signal takes 1 hr to go from A to B)
At time t=0, A transmits its data.
t= 30 mins : Collision occurs.
After collision occurs, a collision signal is generated and sent to both A & B to inform the stations about collision. Since the collision happened midway, the collision signal also takes 30 minutes to reach A & B.
Therefore, t=1 hr: A & B receive collision signals.
This collision signal is received by all the stations on that link. Then,
How to ensure that its our station’s data that collided?
For this, Transmission time (Tt) > Propagation Time (Tp) [Rough bound]
This is because, we want that before we transmit the last bit of our data from our station, we should atleast be sure that some of the bits have already reached to the destination. This ensures that the link is not busy and collisions will not occur.
But, above is a loose bound. We have not taken the time taken by collision signal to travel back to us. For this consider the worst case scenario.
Consider the above system again.
At time t=0, A transmits its data.
t= 59:59 mins : Collision occurs
This collision occurs just before the data reaches B. Now the collision signal takes 59:59 minutes again to reach A. Hence, A receives the collision information approximately after 2 hours, that is, after 2 * Tp.
Hence, to ensure tighter bound, to detect the collision completely,
Tt > >= 2 * Tp
This is the maximum collision time that a system can take to detect if the collision was of its own data.
What should be the minimum length of packet to be transmitted?
Transmission Time = Tt = Length of the packet/ Bandwidth of the link
[Number of bits transmitted by sender per second]
Substituting above, we get,
Length of the packet/ Bandwidth of the link>= 2 * Tp
Length of the packet >= 2 * Tp * Bandwidth of the link
Padding helps in the cases where we do not have such long packets. We can pad extra characters to the end of our data to satisfy the above condition.
Read next – Efficiency of CSMA/CD
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
My Personal Notes arrow_drop_up
Recommended Articles
Page :
|
{
"url": "https://www.geeksforgeeks.org/collision-detection-csmacd/?ref=rp",
"source_domain": "www.geeksforgeeks.org",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "132873",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CL76WYXQ4NOG72YE2VUVRQQ5HDBQB53F",
"WARC-Concurrent-To": "<urn:uuid:96ad53b1-baad-41d8-90ef-bb5ee8aec4df>",
"WARC-Date": "2021-01-27T23:21:52Z",
"WARC-IP-Address": "23.45.180.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZHQVCGOUS5KIA2AWKANTW32M44MNCKEX",
"WARC-Record-ID": "<urn:uuid:2a3773a4-344b-4a23-8018-205498ea1e1e>",
"WARC-Target-URI": "https://www.geeksforgeeks.org/collision-detection-csmacd/?ref=rp",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:690b4311-c9bf-44ca-91ae-72b81b8fdfe4>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
18,
35,
36,
67,
97,
129,
130,
309,
501,
577,
578,
943,
944,
1218,
1219,
1238,
1239,
1311,
1363,
1752,
1806,
2282,
2408,
2409,
2451,
2452,
2453,
2454,
2505,
2572,
2573,
2608,
2647,
2648,
2863,
2864,
2916,
2917,
2991,
2992,
3049,
3050,
3121,
3372,
3519,
3552,
3553,
3588,
3629,
3630,
3843,
3844,
3912,
3931,
3932,
4038,
4039,
4102,
4171,
4221,
4249,
4302,
4303,
4358,
4359,
4509,
4510,
4544,
4545,
4737,
4738,
4770,
4791
],
"line_end_idx": [
17,
18,
35,
36,
67,
97,
129,
130,
309,
501,
577,
578,
943,
944,
1218,
1219,
1238,
1239,
1311,
1363,
1752,
1806,
2282,
2408,
2409,
2451,
2452,
2453,
2454,
2505,
2572,
2573,
2608,
2647,
2648,
2863,
2864,
2916,
2917,
2991,
2992,
3049,
3050,
3121,
3372,
3519,
3552,
3553,
3588,
3629,
3630,
3843,
3844,
3912,
3931,
3932,
4038,
4039,
4102,
4171,
4221,
4249,
4302,
4303,
4358,
4359,
4509,
4510,
4544,
4545,
4737,
4738,
4770,
4791,
4797
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4797,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3539094626903534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03292180970311165,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19135801494121552,
"rps_doc_frac_unique_words": 0.3888888955116272,
"rps_doc_mean_word_length": 4.748737335205078,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.144311428070068,
"rps_doc_word_count": 792,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04679606109857559,
"rps_doc_frac_chars_dupe_6grams": 0.03243818134069443,
"rps_doc_frac_chars_dupe_7grams": 0.03243818134069443,
"rps_doc_frac_chars_dupe_8grams": 0.03243818134069443,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02791810967028141,
"rps_doc_frac_chars_top_3gram": 0.012762559577822685,
"rps_doc_frac_chars_top_4gram": 0.013560219667851925,
"rps_doc_books_importance": -513.2151489257812,
"rps_doc_books_importance_length_correction": -513.2151489257812,
"rps_doc_openwebtext_importance": -292.1517639160156,
"rps_doc_openwebtext_importance_length_correction": -292.1517639160156,
"rps_doc_wikipedia_importance": -183.61016845703125,
"rps_doc_wikipedia_importance_length_correction": -183.61016845703125
},
"fasttext": {
"dclm": 0.05165917053818703,
"english": 0.9150792956352234,
"fineweb_edu_approx": 2.438687562942505,
"eai_general_math": 0.5379776358604431,
"eai_open_web_math": 0.3004584312438965,
"eai_web_code": 0.37686705589294434
}
}
|
{
"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": "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
|
8,874,600,547,755,725,000 |
Net-informations.com
SiteMap | About
How to find tables in a Database in C#
A database is a collection of information organized to provide efficient retrieval . A database is made up of many linked tables of rows and columns, each containing specific data. A table is a set of data elements that is organized using a model of vertical columns and horizontal rows.
In some situations you may want to know how many tables exist in your database. Everything about your SQL Server database is stored in its system tables. In these situations you can use the following SQL for finding how many tables in a database.
Select DISTINCT(name) FROM sys.Tables
Returns a row for each table object, currently only with sys.objects.type = U.
using System;
using System.Collections.Generic;
using System;
using System.Data;
using System.Data.SqlClient;
using System.Windows.Forms;
namespace WindowsFormsApplication1
{
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
private void button1_Click(object sender, EventArgs e)
{
string connetionString = null;
SqlConnection connection;
SqlCommand command;
SqlDataAdapter adapter = new SqlDataAdapter();
DataSet ds = new DataSet();
int i = 0;
string sql = null;
connetionString = "Data Source=ServerName;Initial Catalog=DatabaseName;User ID=UserName;Password=Password";
sql = "Select DISTINCT(name) FROM sys.Tables";
connection = new SqlConnection(connetionString);
try
{
connection.Open();
command = new SqlCommand(sql, connection);
adapter.SelectCommand = command;
adapter.Fill(ds);
adapter.Dispose();
command.Dispose();
connection.Close();
for (i = 0; i <= ds.Tables[0].Rows.Count - 1; i++)
{
MessageBox.Show(ds.Tables[0].Rows[i].ItemArray[0].ToString());
}
}
catch (Exception ex)
{
MessageBox.Show("Can not open connection ! ");
}
}
}
}
net-informations.com (C) 2019 Founded by raps mk
All Rights Reserved. All other trademarks are property of their respective owners.
|
{
"url": "http://csharp.net-informations.com/dataset/database-tables.htm",
"source_domain": "csharp.net-informations.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "19364",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CKOKCBJOCEXISNGOTGKRLIRMQMSU2H3I",
"WARC-Concurrent-To": "<urn:uuid:1492c048-dbd0-466e-83b4-25a0f93fc044>",
"WARC-Date": "2019-01-17T00:34:51Z",
"WARC-IP-Address": "50.63.197.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UIQWBYZ5LTOXALCGE7WZIUELDQUQH5LA",
"WARC-Record-ID": "<urn:uuid:8bedceba-cc75-4be5-9861-4739acb0fed7>",
"WARC-Target-URI": "http://csharp.net-informations.com/dataset/database-tables.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:82d1f3d6-7de3-4da2-9a7f-0ec146a3ad98>"
},
"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-179-240-231.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
42,
43,
82,
83,
84,
85,
373,
374,
621,
622,
660,
661,
740,
741,
742,
743,
744,
745,
759,
793,
807,
826,
855,
883,
884,
885,
920,
922,
960,
966,
989,
999,
1034,
1044,
1045,
1108,
1118,
1119,
1162,
1200,
1232,
1291,
1331,
1354,
1385,
1386,
1506,
1565,
1566,
1627,
1628,
1644,
1658,
1693,
1752,
1801,
1835,
1870,
1905,
1941,
1942,
2009,
2027,
2110,
2128,
2142,
2175,
2189,
2252,
2266,
2267,
2277,
2283,
2285,
2286,
2287,
2288,
2289,
2290,
2342
],
"line_end_idx": [
21,
42,
43,
82,
83,
84,
85,
373,
374,
621,
622,
660,
661,
740,
741,
742,
743,
744,
745,
759,
793,
807,
826,
855,
883,
884,
885,
920,
922,
960,
966,
989,
999,
1034,
1044,
1045,
1108,
1118,
1119,
1162,
1200,
1232,
1291,
1331,
1354,
1385,
1386,
1506,
1565,
1566,
1627,
1628,
1644,
1658,
1693,
1752,
1801,
1835,
1870,
1905,
1941,
1942,
2009,
2027,
2110,
2128,
2142,
2175,
2189,
2252,
2266,
2267,
2277,
2283,
2285,
2286,
2287,
2288,
2289,
2290,
2342,
2424
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2424,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0.005775580182671547,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20873786509037018,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031553398817777634,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34223300218582153,
"rps_doc_frac_unique_words": 0.6113536953926086,
"rps_doc_mean_word_length": 6.554584980010986,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.002427180064842105,
"rps_doc_unigram_entropy": 4.71528434753418,
"rps_doc_word_count": 229,
"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.02398400940001011,
"rps_doc_frac_chars_top_3gram": 0.011992010287940502,
"rps_doc_frac_chars_top_4gram": 0.022651569917798042,
"rps_doc_books_importance": -220.38494873046875,
"rps_doc_books_importance_length_correction": -220.38494873046875,
"rps_doc_openwebtext_importance": -99.12178802490234,
"rps_doc_openwebtext_importance_length_correction": -99.12178802490234,
"rps_doc_wikipedia_importance": -91.67865753173828,
"rps_doc_wikipedia_importance_length_correction": -91.67865753173828
},
"fasttext": {
"dclm": 0.7618481516838074,
"english": 0.6466240882873535,
"fineweb_edu_approx": 3.2123708724975586,
"eai_general_math": 0.8977455496788025,
"eai_open_web_math": 0.12826073169708252,
"eai_web_code": 0.7337175607681274
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,665,960,099,882,591,000 |
The tag has no wiki summary.
learn more… | top users | synonyms
9
votes
1answer
68 views
Using a single symbol from kpfonts
I would need some help by extracting the "\varprod"-symbol from the kpfonts package. Similar to how it is done here for the subset-symbol of the mathabx package. Although there is a description how to ...
5
votes
2answers
105 views
kpfonts changes appereance of textcomp symbols
I'm using the genealogic symbols \textborn and \textdied from the textcomp package together with the kpfonts. Unfortunately kpfonts loads textcomp with the [full] option (unless someone specifies ...
5
votes
2answers
69 views
Fix \hookrightarrow in kpfonts
The \hookrightarrow in kpfonts looks like this: I assume this is an error. What can I do to fix this? I would like to keep using kpfonts. MWE: \documentclass{article} \usepackage{kpfonts} ...
5
votes
0answers
126 views
Microtype configuration for kpfonts
The microtype documentation suggests to use settings matching one's font choice. I am currently using the kpfonts package but have not succeeded to find some matching settings online. As there seem ...
1
vote
1answer
62 views
Displaying long “s” with kpfonts only in a section of the text
I am using the light option of the kpfonts package and I want to display the ſ letter only in a section of the text. Can I switch from the normal option to the veryoldstyle option? ...
4
votes
1answer
93 views
KP-monospaced with LuaLaTeX
how do I set KP-monospaced font to be used as tt font with fontspec? I tried this: \documentclass{article} \usepackage{fontspec} \setmonofont{KP-monospaced} \begin{document} \texttt{120 test} ...
1
vote
0answers
42 views
kpfonts: no errors, no warnings but no PDF [closed]
I just installed kpfonts via MikTex Package Manager. I tried to reproduce the following example which is taken from this thread \documentclass{article} \usepackage[T1]{fontenc} \usepackage{ntheorem} ...
3
votes
1answer
101 views
Codename for “kp serif” in TeX
mainly i'm aiming at doing the same thing as discussed in this question (How To Change Math Font Only?); except i want to use the "km serif" font and no matter what i search for on the web, i don't ...
3
votes
2answers
173 views
XeLaTeX + kpfonts + Greek
Because of this question, I'm using the following code to typeset my XeLaTeX document. The problem is, there does not seem to be any support for Greek. The Greek text in the following comes out as ...
5
votes
2answers
100 views
kpfonts vs. fence scaling
Consider this example \documentclass[a4paper]{memoir} \usepackage[utf8]{inputenc} \usepackage{amsmath} \usepackage[T1]{fontenc} \usepackage{kpfonts} \begin{document} \[ (\big(\Big(\bigg(\Bigg( \] ...
6
votes
1answer
2k views
LaTeX Error: Command \widering already defined
I keep getting this error whenever I start an article with the basic set of packages: \documentclass[10pt,a4paper]{article} \usepackage[utf8]{inputenc} \usepackage[english]{babel} ...
4
votes
1answer
95 views
KPfonts small caps italic
I don't seem to make kpfonts work with small caps italic text. This is my MWE: \documentclass{article} \usepackage{kpfonts} \newcommand*{\mytext}{Testing 1 2 3 testing!} \begin{document} ...
2
votes
2answers
105 views
Selective lining figures with KPFonts
I'm writing a document that uses OSF with KPFonts. However, they look a bit awkward within tables. Is there a way of switching to lining figures locally with KPFonts?
4
votes
1answer
270 views
Having Problem using math environment in LuaLaTeX
I am at learning stage of LaTeX. While working with lualatex with fontspec package, i am not being able to use any math environment. My document's preamble: \documentclass[a4paper, 14pt]{memoir} % ...
1
vote
1answer
532 views
Changing to kpfonts [duplicate]
I am editing a document in Texmaker and am fairly new to LaTeX. I am using the output PDFLaTeX/view PDF. I added the kpfonts package to my document to change the font: \usepackage{kpfonts} ...
3
votes
1answer
354 views
Kp-fonts package used font
Which is the font used in Kp-fonts package? I would to know what's the name of the fonts provided by the kpfonts package. I can't understand if kp-fonts is just package's name or also the font's name! ...
6
votes
1answer
512 views
How do I use kpfonts with fontspec?
Is there a way to use kpfonts with fontspec ? The math font is correctly used but just loading the kpfonts package is not enough for the text. If I add the \setmainfont line (see example) the kp font ...
15
votes
2answers
11k views
Extensible \vec instead of \overrightarrow
Instead of changing to \overrightarrow{}, which uses a usual extensible arrow and puts it above the argument, I would like to get an extensible \vec{} symbol. My intention is to obtain a new command ...
2
votes
2answers
246 views
Incompability of kpfonts and hyperref?
I use hyperref with the optional argument breaklinks=true. I later wanted to inlcude kpfonts via: \usepackage{kpfonts} \usepackage[T1]{fontenc} What I got after compiling was the following error ...
5
votes
1answer
805 views
MinionPro font with some symbols from kpfonts
At this moment I'm using MinionPro package. But I don't like most of the MnSymbol's symbols. I discovered that I really like some symbols from kpfonts (if anyone suggest anything better, I will be ...
5
votes
2answers
844 views
What's the internal font name of the Kp-Fonts?
I have checked thekpfonts.sty: \renewcommand{\sfdefault}{jkpss\kp@petitesmajuscules\kp@flig\kp@style} It seems that this name jkpss\kp@petitesmajuscules\kp@flig\kp@style is not correct. So what's ...
1
vote
0answers
457 views
MiKTeX can't find fkob.cfg [closed]
I'm trying to compile this document. I am using Winedt 7, MiKTeX under Windows 7 pro 64 bits. This is the message I get the error below. ------ LaTeX document ...
8
votes
2answers
729 views
How to get an upright \partial?
I want to set partial derivations like \frac{\partial}{\partial x}. This is issue is discussed several times here. Packages like esdiff or commath or suggested. However one problem with all those ...
8
votes
1answer
506 views
Greek words with kpfonts
I want to typeset some sporadic Greek words in an otherwise Latin text. I can get it with something like: \documentclass{minimal} \usepackage[utf8x]{inputenc} \usepackage[T1]{fontenc} ...
20
votes
1answer
803 views
Typesetting a descending italic z
I have a document which has many short quotes in which I would like to imitate the fonts. For this document I am limited to LaTeX (not LuaTeX) by the publisher. The jkpvos font family from kpfonts ...
2
votes
1answer
760 views
Suggestions for fonts in classicthesis.sty
I found these suggestions for fonts in classicthesis.sty. What are they for kpfonts? Does Palatino 10pt: 288--312pt | 609--657pt mean that \textwidth must be between 288 and 312pt and \textheight ...
2
votes
1answer
252 views
Setting the right linespread for kpfonts
Is this the right linespread for kpfonts? \PassOptionsToPackage{nomath,oldstylenums,oldstyle,noamsmath,notextcomp}{kpfonts} \RequirePackage{kpfonts} \linespread{1}
2
votes
1answer
816 views
mathpazo, mathdesign and kpfonts
is possible have the \usepackage{mathpazo} with \usepackage[nomath,fulloldstylenums,fulloldstyle]{kpfonts} but with the integrals symbols (\int \oint ecc) from the \usepackage[utopia]{mathdesign} and ...
5
votes
1answer
953 views
LaTeX font packages
There is a list of all font in packages? like, for example: \usepackage{kpfonts}
6
votes
2answers
477 views
kpfonts, siunitx and math alphabets
This is a follow up question to this rather vague one. The problem is trying to work out where my 16 math alphabets are going. In using egreg's answer to the previous question I have diagnosed ...
9
votes
1answer
462 views
Diagnosing the “too many math alphabets” error
I recently hit up against TeX's "too many math alphabets" error. I'm trying to diagnose what is using up my math alphabets, as I can't work out where they are going. Of course, I could just start ...
4
votes
1answer
142 views
How to create a “long-running” version of “\classicstylenums” in “kpfonts” package?
I'm using kpfonts in my document with old style numbers. However, in some sections (e.g. figures and tables), I want to revert to the normal style numbers. There is a command for doing that - ...
4
votes
1answer
2k views
Getting strange error with MiKTeX when trying to use “kpfonts” package
I'm getting the following error when trying to compile the following very minimal example with MiKTeX: \documentclass{article} \usepackage[T1]{fontenc} \usepackage{kpfonts} \begin{document} test ...
9
votes
2answers
2k views
Which LaTeX font packages contain real small caps and work with the “microtype” package?
I'm wondering which font packages are available in MikTeX and TeXLive containing real small caps and also work together with the "microtype" package? For instance, kpfonts has real small caps but ...
4
votes
2answers
992 views
Do system font (TTF/OTF) forms of the Kepler Project fonts (kpfonts) exist?
I have recently fallen in love with the kpfonts package. Whilst it looks great in both body text and TikZ pictures, my current issue is that I cannot create images in external programs containing this ...
|
{
"url": "http://tex.stackexchange.com/questions/tagged/kpfonts",
"source_domain": "tex.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "130652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2EXZGFK2HJPQ2KA4T6PW4T32NA7E5NZC",
"WARC-Concurrent-To": "<urn:uuid:3e16e535-4018-4fa3-904b-cc10ae8101c1>",
"WARC-Date": "2015-07-07T22:02:03Z",
"WARC-IP-Address": "104.16.12.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FZBQONO6T3TFCTQUCV56YBTN252Y4AAN",
"WARC-Record-ID": "<urn:uuid:203b49aa-769c-448d-b8d1-17dd3e327251>",
"WARC-Target-URI": "http://tex.stackexchange.com/questions/tagged/kpfonts",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3369981b-198c-4302-81b3-34678207370c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
65,
66,
68,
74,
82,
91,
92,
127,
128,
333,
335,
341,
350,
360,
361,
408,
409,
609,
611,
617,
626,
635,
636,
667,
668,
860,
862,
868,
877,
887,
888,
924,
925,
1127,
1129,
1134,
1142,
1151,
1152,
1215,
1216,
1401,
1403,
1409,
1417,
1426,
1427,
1455,
1456,
1652,
1654,
1659,
1668,
1677,
1678,
1730,
1731,
1934,
1936,
1942,
1950,
1960,
1961,
1992,
1993,
2195,
2197,
2203,
2212,
2222,
2223,
2249,
2250,
2451,
2453,
2459,
2468,
2478,
2479,
2505,
2506,
2706,
2708,
2714,
2722,
2731,
2732,
2779,
2780,
2964,
2966,
2972,
2980,
2989,
2990,
3016,
3017,
3208,
3210,
3216,
3225,
3235,
3236,
3274,
3275,
3442,
3444,
3450,
3458,
3468,
3469,
3519,
3520,
3721,
3723,
3728,
3736,
3746,
3747,
3779,
3780,
3973,
3975,
3981,
3989,
3999,
4000,
4027,
4028,
4233,
4235,
4241,
4249,
4259,
4260,
4296,
4297,
4501,
4504,
4510,
4519,
4529,
4530,
4573,
4574,
4777,
4779,
4785,
4794,
4804,
4805,
4844,
4845,
5044,
5046,
5052,
5060,
5070,
5071,
5117,
5118,
5319,
5321,
5327,
5336,
5346,
5347,
5394,
5395,
5595,
5597,
5602,
5611,
5621,
5622,
5658,
5659,
5822,
5824,
5830,
5839,
5849,
5850,
5882,
5883,
6083,
6085,
6091,
6099,
6109,
6110,
6135,
6136,
6324,
6327,
6333,
6341,
6351,
6352,
6386,
6387,
6588,
6590,
6596,
6604,
6614,
6615,
6658,
6659,
6859,
6861,
6867,
6875,
6885,
6886,
6927,
6928,
7092,
7094,
7100,
7108,
7118,
7119,
7152,
7153,
7357,
7359,
7365,
7373,
7383,
7384,
7404,
7405,
7486,
7488,
7494,
7503,
7513,
7514,
7550,
7551,
7748,
7750,
7756,
7764,
7774,
7775,
7822,
7823,
8023,
8025,
8031,
8039,
8049,
8050,
8134,
8135,
8331,
8333,
8339,
8347,
8356,
8357,
8428,
8429,
8628,
8630,
8636,
8645,
8654,
8655,
8744,
8745,
8945,
8947,
8953,
8962,
8972,
8973,
9049,
9050
],
"line_end_idx": [
29,
30,
65,
66,
68,
74,
82,
91,
92,
127,
128,
333,
335,
341,
350,
360,
361,
408,
409,
609,
611,
617,
626,
635,
636,
667,
668,
860,
862,
868,
877,
887,
888,
924,
925,
1127,
1129,
1134,
1142,
1151,
1152,
1215,
1216,
1401,
1403,
1409,
1417,
1426,
1427,
1455,
1456,
1652,
1654,
1659,
1668,
1677,
1678,
1730,
1731,
1934,
1936,
1942,
1950,
1960,
1961,
1992,
1993,
2195,
2197,
2203,
2212,
2222,
2223,
2249,
2250,
2451,
2453,
2459,
2468,
2478,
2479,
2505,
2506,
2706,
2708,
2714,
2722,
2731,
2732,
2779,
2780,
2964,
2966,
2972,
2980,
2989,
2990,
3016,
3017,
3208,
3210,
3216,
3225,
3235,
3236,
3274,
3275,
3442,
3444,
3450,
3458,
3468,
3469,
3519,
3520,
3721,
3723,
3728,
3736,
3746,
3747,
3779,
3780,
3973,
3975,
3981,
3989,
3999,
4000,
4027,
4028,
4233,
4235,
4241,
4249,
4259,
4260,
4296,
4297,
4501,
4504,
4510,
4519,
4529,
4530,
4573,
4574,
4777,
4779,
4785,
4794,
4804,
4805,
4844,
4845,
5044,
5046,
5052,
5060,
5070,
5071,
5117,
5118,
5319,
5321,
5327,
5336,
5346,
5347,
5394,
5395,
5595,
5597,
5602,
5611,
5621,
5622,
5658,
5659,
5822,
5824,
5830,
5839,
5849,
5850,
5882,
5883,
6083,
6085,
6091,
6099,
6109,
6110,
6135,
6136,
6324,
6327,
6333,
6341,
6351,
6352,
6386,
6387,
6588,
6590,
6596,
6604,
6614,
6615,
6658,
6659,
6859,
6861,
6867,
6875,
6885,
6886,
6927,
6928,
7092,
7094,
7100,
7108,
7118,
7119,
7152,
7153,
7357,
7359,
7365,
7373,
7383,
7384,
7404,
7405,
7486,
7488,
7494,
7503,
7513,
7514,
7550,
7551,
7748,
7750,
7756,
7764,
7774,
7775,
7822,
7823,
8023,
8025,
8031,
8039,
8049,
8050,
8134,
8135,
8331,
8333,
8339,
8347,
8356,
8357,
8428,
8429,
8628,
8630,
8636,
8645,
8654,
8655,
8744,
8745,
8945,
8947,
8953,
8962,
8972,
8973,
9049,
9050,
9254
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9254,
"ccnet_original_nlines": 283,
"rps_doc_curly_bracket": 0.010590019635856152,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30658435821533203,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037037041038274765,
"rps_doc_frac_lines_end_with_ellipsis": 0.11267606168985367,
"rps_doc_frac_no_alph_words": 0.25565844774246216,
"rps_doc_frac_unique_words": 0.35146743059158325,
"rps_doc_mean_word_length": 5.175375938415527,
"rps_doc_num_sentences": 100,
"rps_doc_symbol_to_word_ratio": 0.01697530969977379,
"rps_doc_unigram_entropy": 5.39779806137085,
"rps_doc_word_count": 1397,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.024343019351363182,
"rps_doc_frac_chars_dupe_6grams": 0.006362379994243383,
"rps_doc_frac_chars_dupe_7grams": 0.006362379994243383,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02987552061676979,
"rps_doc_frac_chars_top_3gram": 0.016459200531244278,
"rps_doc_frac_chars_top_4gram": 0.004979250021278858,
"rps_doc_books_importance": -853.2901000976562,
"rps_doc_books_importance_length_correction": -853.2901000976562,
"rps_doc_openwebtext_importance": -533.541748046875,
"rps_doc_openwebtext_importance_length_correction": -533.541748046875,
"rps_doc_wikipedia_importance": -378.9336242675781,
"rps_doc_wikipedia_importance_length_correction": -378.9336242675781
},
"fasttext": {
"dclm": 0.03239858150482178,
"english": 0.8256508111953735,
"fineweb_edu_approx": 1.150025725364685,
"eai_general_math": 0.3379642367362976,
"eai_open_web_math": 0.856289267539978,
"eai_web_code": 0.021992089226841927
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "686.222",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,988,233,745,498,706,000 |
Metrics list
Metric types in Stackdriver Monitoring are classified into general groups, based on the type of service that collects the data. This page provides links to reference lists for each of these groups:
The metric-type lists are rebuilt frequently and time-stamped, so you know how current they are. The information listed for each metric type comes from the Monitoring API MetricDescriptor object for each metric type. For more information on how metric types are described, see Metrics, time series, and resources.
Stackdriver charges for some metrics. For more information, see Pricing: Monitoring details and Workspaces.
Additional information: metadata
The entry for each metric type might include additional information, called metadata, about the metric. This data is presently available for GCP, Agent, AWS, and some Anthos metrics. The metadata shown with entries in the table includes the following:
• Launch stage: The launch stage of the metric type, given by a colored tag that precedes the display name: GA, BETA, ALPHA, EARLY_ACCESS, or DEPRECATED. If no tag appears, then the launch stage is unspecified.
Metric types in the Alpha or Early Access launch stages might not appear in the public lists of metrics. To get information about those metric types, explicitly retrieve the set of metric descriptors from a Google Cloud Platform project that has been given permission to use the restricted metric types. If you have permission to use restricted metric types, you can retrieve the metric descriptors by using the metricDescriptors.list method in the Monitoring API. See Listing metric descriptors for more information.
• Sample Period: For metrics that are written periodically, this is the time interval between consecutive data points, excluding data loss due to errors. The period, if available, appears at the end of the description text in a sentence of the form *“Sampled every x seconds.”*
• Ingest Delay: Data points older than this value are guaranteed to be available to be read, excluding data loss due to errors. The delay does not include any time spent waiting until the next sampling period. The delay, if available, appears at the end of the description text in a sentence of the form *“After sampling, data is not visible for up to y seconds.”*
Getting started
Bu sayfayı yararlı buldunuz mu? Lütfen görüşünüzü bildirin:
Şunun hakkında geri bildirim gönderin...
Stackdriver Monitoring
Yardım mı gerekiyor? Destek sayfamızı ziyaret edin.
|
{
"url": "https://cloud.google.com/monitoring/api/metrics?hl=tr",
"source_domain": "cloud.google.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "271250",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UCJWQPASMMIJED2TD76ENSSQURENIRDO",
"WARC-Concurrent-To": "<urn:uuid:0b1cf174-7a51-4034-b5ea-5ccbb5e86a1c>",
"WARC-Date": "2019-07-17T23:48:41Z",
"WARC-IP-Address": "172.217.5.238",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MH5U72CHZEINPUUWJ6N2J2LS323EHJJV",
"WARC-Record-ID": "<urn:uuid:9baebf86-62a7-4f46-849f-7da1286d210a>",
"WARC-Target-URI": "https://cloud.google.com/monitoring/api/metrics?hl=tr",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:395422bb-fb4a-4529-8bc4-61fc678666cb>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-153-172-231.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,
13,
14,
212,
213,
527,
528,
636,
637,
670,
671,
923,
924,
1137,
1138,
1660,
1661,
1941,
1942,
2309,
2310,
2326,
2327,
2387,
2388,
2429,
2430,
2453
],
"line_end_idx": [
13,
14,
212,
213,
527,
528,
636,
637,
670,
671,
923,
924,
1137,
1138,
1660,
1661,
1941,
1942,
2309,
2310,
2326,
2327,
2387,
2388,
2429,
2430,
2453,
2504
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2504,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3427947461605072,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019650660455226898,
"rps_doc_frac_lines_end_with_ellipsis": 0.035714291036129,
"rps_doc_frac_no_alph_words": 0.1462882161140442,
"rps_doc_frac_unique_words": 0.4910486042499542,
"rps_doc_mean_word_length": 5.194373607635498,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0.002183410106226802,
"rps_doc_unigram_entropy": 4.831153869628906,
"rps_doc_word_count": 391,
"rps_doc_frac_chars_dupe_10grams": 0.06499260663986206,
"rps_doc_frac_chars_dupe_5grams": 0.09551945328712463,
"rps_doc_frac_chars_dupe_6grams": 0.09551945328712463,
"rps_doc_frac_chars_dupe_7grams": 0.09551945328712463,
"rps_doc_frac_chars_dupe_8grams": 0.06499260663986206,
"rps_doc_frac_chars_dupe_9grams": 0.06499260663986206,
"rps_doc_frac_chars_top_2gram": 0.03249631077051163,
"rps_doc_frac_chars_top_3gram": 0.01920236088335514,
"rps_doc_frac_chars_top_4gram": 0.025110779330134392,
"rps_doc_books_importance": -237.3098907470703,
"rps_doc_books_importance_length_correction": -237.3098907470703,
"rps_doc_openwebtext_importance": -119.89160919189453,
"rps_doc_openwebtext_importance_length_correction": -119.89160919189453,
"rps_doc_wikipedia_importance": -86.22273254394531,
"rps_doc_wikipedia_importance_length_correction": -86.22273254394531
},
"fasttext": {
"dclm": 0.04497956857085228,
"english": 0.8336189985275269,
"fineweb_edu_approx": 2.756376266479492,
"eai_general_math": 0.9426643252372742,
"eai_open_web_math": 0.3989628553390503,
"eai_web_code": 0.9599505066871643
}
}
|
{
"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.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,923,897,199,790,882,000 |
[CentOS] High Availability using 2 sites
Thu Jan 5 20:21:40 UTC 2006
Bryan J. Smith <thebs413 at earthlink.net>
Les Mikesell <lesmikesell at gmail.com> wrote:
> You are missing the point.
It's very clear both you and I are talking about 2 entirely
different things. I don't disagree with many of the concepts
you are covering, I know how round robin DNS works. But how
these concept work with respect to high availability is what
I'm taking major issue with.
> The DNS server is irrelevant here.
It's _very_relevant_ if MS-RPC calls are being used and
resolution changes from standard DNS at the _client_! That
was my point!
> In the dynamic scenario, you have a possible problem of
> cache admins configuring to use a minimum time of their
> own choice rather than following the spec, but that is
> rare. And it doesn't affect an unchanging list.
Sigh, you're picking and choosing the context you wish to
discuss. When you're providing server failover, you can't
rely on applications or DNS, but you must make the IP appear
as the same.
On one site, that is doable with NAT -- be it 1-to-1 or
destination, with additional considerations. Across sites
you have to get far more involved. If, of course, assumes
you're using stateless sessions (like HTTP), and changes
radically (and NAT won't work) if you are using stateful
sessions (like RPC, NFS, etc...).
You are _not_ going to address it with DNS. It might work
for you if you can guarantee all systems hit the true
authority, like you can on a LAN or corporate intranet. It
might also work if you're using an extended DNS server that
uses alternative services -- as as how ADS and MS IE
interoperate with each other (yes, even when it "seems"
you're using "stnadard DNS" you're actually not).
> If you write the app you can trust it to work the way you
> wrote it and you don't have to worry about anyone's cache.
> That why I suggest doing it that way. Always give out
> multiple IP addresses and don't change DNS. Write the app
to
> walk the list of returned addresses itself if the first one
it
> tries doesn't respond.
We're talking about web services spread across 2 sites.
What the heck does this context have anything to do with it?
> This seems to already be done in the common web browsers.
Not the logic you're presenting, no. I think you're
mega-oversimplifying things, and have the Windows resolver/MS
IE logic _wrong_ on DNS -- other than the basics of how round
robin works.
> Not really. If you can't control the app you might have
> to live with this.
Is that _not_ the context of this _entire_ thread?
> Not true for the case of supplying multiple A records that
> don't change. The DNS servers/resolvers may change the
> order of the list but nothing else.
Again, you're continuing to make the assumption on the
applications used, and that they magically handle this logic
as you want them to arbitrarily do so.
> If you can find a repeatable case where IE does the wrong
> thing with multiple A records where some work and some
> don't please let me know. I don't claim to understand how
it
> works but it seems very robust in those circumstances.
And I would differ on that assessment, very much so.
I often have to hack the Windows registry just to get MS IE
to work correctly for corporate intranets, much less the
Internet (with far more variables).
> How can DNS not work according to the specifications at
> least at the 'A' record level?
Sigh, I'm not opening up that can of worms (don't get me
started ;-).
I also think you're referring extended operations of ADS, and
not DNS, with MS IE. When you think you're just doing simple
DNS resolution, there are MS-RPC calls being made if you have
ADS for your DNS and MS IE for your client.
> Actually I think some versions of windows will
> try to figure out which to try from their route table but
> that doesn't seem very predictable.
Just about everything you have discussed here has been rather
"arbitrary" and not very well understood.
As I mentioned before, I purposely have to hack the Windows
registry (typically pushed via GPOs) just to get MS IE to
stop doing so really stupid things on an intranet. I
seriously doubt it works so perfectly as you describe over
the Internet with its resolution -- quite the opposite.
The "hold downs" on various things are my biggest issue.
Especially when it comes to non-availability.
--
Bryan J. Smith Professional, Technical Annoyance b.j.smith at ieee.org http://thebs413.blogspot.com
----------------------------------------------------
*** Speed doesn't kill, difference in speed does ***
|
{
"url": "https://lists.centos.org/pipermail/centos/2006-January/913138.html",
"source_domain": "lists.centos.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "14933",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YHYGPHMULTGHOEKUC4D4OHTRJQ67LI7X",
"WARC-Concurrent-To": "<urn:uuid:5619dc08-cbc9-4002-a925-ffc1ccfb31d3>",
"WARC-Date": "2024-07-14T22:51:27Z",
"WARC-IP-Address": "8.43.84.214",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FJOAXY5NOLQLXP7BRR4RD5JVTMPHX7TH",
"WARC-Record-ID": "<urn:uuid:bcdb8dc5-a7ce-400c-9374-8c6d450adf68>",
"WARC-Target-URI": "https://lists.centos.org/pipermail/centos/2006-January/913138.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61b401a1-69de-4560-b923-5f49173c0069>"
},
"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-235\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,
41,
42,
70,
113,
114,
161,
190,
191,
251,
313,
374,
435,
464,
465,
502,
503,
559,
619,
633,
634,
692,
750,
807,
858,
859,
917,
976,
1037,
1050,
1051,
1107,
1166,
1225,
1282,
1339,
1373,
1374,
1433,
1487,
1547,
1607,
1660,
1716,
1766,
1767,
1827,
1888,
1945,
2006,
2009,
2071,
2074,
2099,
2100,
2156,
2217,
2218,
2278,
2279,
2332,
2394,
2456,
2469,
2470,
2529,
2550,
2551,
2602,
2603,
2664,
2722,
2760,
2761,
2816,
2877,
2916,
2917,
2977,
3034,
3095,
3098,
3155,
3156,
3209,
3210,
3270,
3327,
3363,
3364,
3422,
3455,
3456,
3513,
3526,
3527,
3589,
3651,
3713,
3757,
3758,
3807,
3867,
3905,
3906,
3968,
4010,
4011,
4071,
4129,
4183,
4242,
4298,
4299,
4357,
4403,
4404,
4408,
4538,
4591
],
"line_end_idx": [
41,
42,
70,
113,
114,
161,
190,
191,
251,
313,
374,
435,
464,
465,
502,
503,
559,
619,
633,
634,
692,
750,
807,
858,
859,
917,
976,
1037,
1050,
1051,
1107,
1166,
1225,
1282,
1339,
1373,
1374,
1433,
1487,
1547,
1607,
1660,
1716,
1766,
1767,
1827,
1888,
1945,
2006,
2009,
2071,
2074,
2099,
2100,
2156,
2217,
2218,
2278,
2279,
2332,
2394,
2456,
2469,
2470,
2529,
2550,
2551,
2602,
2603,
2664,
2722,
2760,
2761,
2816,
2877,
2916,
2917,
2977,
3034,
3095,
3098,
3155,
3156,
3209,
3210,
3270,
3327,
3363,
3364,
3422,
3455,
3456,
3513,
3526,
3527,
3589,
3651,
3713,
3757,
3758,
3807,
3867,
3905,
3906,
3968,
4010,
4011,
4071,
4129,
4183,
4242,
4298,
4299,
4357,
4403,
4404,
4408,
4538,
4591,
4643
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4643,
"ccnet_original_nlines": 119,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44158416986465454,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0623762384057045,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19405941665172577,
"rps_doc_frac_unique_words": 0.43870967626571655,
"rps_doc_mean_word_length": 4.496774196624756,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.000990099972113967,
"rps_doc_unigram_entropy": 5.304121494293213,
"rps_doc_word_count": 775,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02467719092965126,
"rps_doc_frac_chars_dupe_6grams": 0.02467719092965126,
"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.0086083197966218,
"rps_doc_frac_chars_top_3gram": 0.006312769837677479,
"rps_doc_frac_chars_top_4gram": 0.0074605499394237995,
"rps_doc_books_importance": -423.27569580078125,
"rps_doc_books_importance_length_correction": -423.27569580078125,
"rps_doc_openwebtext_importance": -225.6885528564453,
"rps_doc_openwebtext_importance_length_correction": -225.6885528564453,
"rps_doc_wikipedia_importance": -139.88209533691406,
"rps_doc_wikipedia_importance_length_correction": -139.88209533691406
},
"fasttext": {
"dclm": 0.1825428605079651,
"english": 0.9599931240081787,
"fineweb_edu_approx": 1.408666729927063,
"eai_general_math": 0.6033420562744141,
"eai_open_web_math": 0.30391550064086914,
"eai_web_code": 0.6036712527275085
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,915,060,054,032,709,000 |
FileDocCategorySizeDatePackage
JDOMetaDataProperties.javaAPI DocGlassfish v2 API57944Fri May 04 22:34:38 BST 2007com.sun.jdo.api.persistence.enhancer.meta
JDOMetaDataProperties
public final class JDOMetaDataProperties extends Object
This class parses properties containing meta data information about classes. The syntax of the properties is the following:
• the keys in the properties file are fully qualified classnames or fully qualified fieldnames
• a fields is separated by a classname with a hash mark ('#') (e.g. "test.Test#test1")
• all classnames are given in a natural form (e.g. "java.lang.Integer", "java.lang.Integer[][]", "int", "test.Test$Test1")
• property keys are classnames and fieldnames (e.g. "test.Test=...", "test.Test#field1=...")
• Classnames can have the following attributes:
• jdo:{persistent|transactional}
• super: <classname>
• access: {public|protected|package|private}
• Fieldnames can have the following attributes:
• type:<type>
• access: {public|protected|package|private}
• jdo:{persistent|transactional|transient}
• annotation:{pk|dfg|mediated}
• the names of the attributes can be ommitted: you can say
test.Test1#field1=jdo:persistent,type:java.lang.String,pk,...
or
test.Test1#field1=persistent,java.lang.String,pk,...
or
test.Test1#field1=jdo:persistent,java.lang.String,pk,...
• in order to find fields of a class, a line for the class has to be specified in the properties: To find the field test.Test1#field, the keys test.Test1 and test.Test1#Field have to be present.
This class is not thread safe.
Fields Summary
private static final char
FIELD_DELIMITER
The delimiter of a property key between the class- and fieldname.
private static final String
PROPERTY_DELIMITERS
A string of delimiter characters between attributes.
private static final char
PROPERTY_ASSIGNER
A delimiter character between attribute name and attribute value
private static final String
PROPERTY_ACCESS_MODIFIER
private static final String
PROPERTY_JDO_MODIFIER
private static final String
PROPERTY_SUPER_CLASSNAME
private static final String
PROPERTY_OID_CLASSNAME
private static final String
PROPERTY_TYPE
private static final String
PROPERTY_ANNOTATION_TYPE
private static final String
ACCESS_PRIVATE
private static final String
ACCESS_PACKAGE_LOCAL
private static final String
ACCESS_PROTECTED
private static final String
ACCESS_PUBLIC
private static final String
JDO_TRANSIENT
private static final String
JDO_PERSISTENT
private static final String
JDO_TRANSACTIONAL
private static final String
ANNOTATION_TYPE_PK
private static final String
ANNOTATION_TYPE_DFG
private static final String
ANNOTATION_TYPE_MEDIATED
private Properties
properties
The properties to parse.
private final Map
cachedJDOClasses
A map of already read class properties. The keys are the classnames, the values are the appropriate JDOClass-object.
private static final JDOClass
NULL
A constant for the cache indicating that a given classname if not specified in the properties.
private final List
tmpTokens
A temporary vector (this is the reason why the implementation is not thread safe).
Constructors Summary
public JDOMetaDataProperties(Properties props)
Creates a new object with the given properties.
param
props The properties.
see
#properties
this.properties = props;
Methods Summary
private static final voidcheckForDuplicateProperties(java.util.List props, java.lang.String entry)
Checks if an attribute-property was entered twice for a class or field.
param
props The properties.
param
entry The class- or fieldname.
throws
JDOMetaDataUserException If the check fails.
for (int i = 0; i < props.size (); i++)
{
for (int j = i + 1; j < props.size (); j++)
{
Property p1 = (Property) props.get (i);
Property p2 = (Property) props.get (j);
if (p1.name.equals (p2.name) && ! p1.value.equals (p2.value))
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_DUPLICATE_PROPERTY_NAME,
new String [] { entry, p1.name, p1.value, p2.value }));
}
}
}
private static final voidcheckPropertyName(java.lang.String name, java.lang.String[] validnames, java.lang.String entry)
Checks if an attribute name is recognized by the parser.
param
name The name of the attribute.
param
validnames A list of valid names (the attribute name has to be in this list).
param
entry The class- or fieldname.
throws
JDOMetaDataUserException If the check fails.
for (int i = 0; i < validnames.length; i++)
{
if (name.equals (validnames [i]))
{
return;
}
}
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_INVALID_PROPERTY_NAME,
new String [] { entry, name }));
private static final voidcheckPropertyValue(com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$Property prop, java.lang.String[] validvalues, java.lang.String name, java.lang.String entry)
Checks if the given value of an attribute-property is recognized by by the parser if that value belongs to a given attribute name.
param
prop The attribute-property (with name and value).
param
validvalues A list of valid values.
param
name The name of the attribute-property to check.
param
entry The class- or fieldname.
throws
JDOMetaDataUserException If the check fails.
if ( ! prop.name.equals (name))
{
return;
}
for (int i = 0; i < validvalues.length; i++)
{
if (prop.value.equals (validvalues [i]))
{
return;
}
}
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_INVALID_PROPERTY_VALUE,
new String [] { entry, name, prop.value }));
private static final java.lang.StringfromCanonicalClassName(java.lang.String classname)
Converts a classname given in a canonical form (with dots) into a VM-similar notation (with slashes)
param
classname The canonical classname.
return
The VM-similar classname notation.
see
#toCanonicalClassName
return classname.replace ('.", '/");
static final java.lang.StringgetErrorMsg(java.lang.String msg, java.lang.String[] params)
Formats an error message with the given parameters.
param
msg The message with format strings.
param
params The params to format the message with.
return
The formatted error message.
return MessageFormat.format (msg, (Object []) params);
public final com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOClassgetJDOClass(java.lang.String classname)
Get the information about the class with the given name.
param
classname The classname.
return
The information about the class or null if no information is given.
throws
JDOMetaDataUserException If something went wrong parsing the properties.
classname = toCanonicalClassName (classname);
JDOClass clazz = (JDOClass) this.cachedJDOClasses.get (classname);
if (clazz == NULL) //already searched but not found
{
return null;
}
if (clazz != null)
{
return clazz;
}
//load it from the properties file
String s = this.properties.getProperty (classname);
if (s == null) //class not defined
{
this.cachedJDOClasses.put (classname, NULL);
return null;
}
//the class could be found in the properties
clazz = parseJDOClass (classname, s); //parse the class attributes
parseJDOFields (clazz); //parse all fields
validateDependencies (clazz); //check dependencies
this.cachedJDOClasses.put (clazz.getName (), clazz);
return clazz;
public final com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOFieldgetJDOField(java.lang.String fieldname, java.lang.String classname)
Gets the information about the specified field.
param
classname The name of the class.
param
fieldname The name of the field of the class.
return
The information about the field or null if no information could be found.
throws
JDOMetaDataUserException If something went wrong parsing the properties.
JDOClass clazz = getJDOClass (classname);
return (clazz != null ? clazz.getField (fieldname) : null);
public final java.lang.String[]getKnownClassNames()
Gets all classnames in the properties.
return
All classnames in the properties.
Collection classnames = new HashSet ();
for (Enumeration names = this.properties.propertyNames (); names.hasMoreElements ();)
{
String name = (String) names.nextElement ();
if (name.indexOf (FIELD_DELIMITER) < 0)
{
classnames.add (fromCanonicalClassName (name));
}
}
return (String []) classnames.toArray (new String [classnames.size ()]);
private static final intgetModifiers(java.lang.String modifier)
if (modifier.equals (ACCESS_PUBLIC))
{
return Modifier.PUBLIC;
}
if (modifier.equals (ACCESS_PRIVATE))
{
return Modifier.PRIVATE;
}
if (modifier.equals (ACCESS_PROTECTED))
{
return Modifier.PROTECTED;
}
return 0;
private final com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOClassparseJDOClass(java.lang.String classname, java.lang.String attributes)
Parses the attributes-string of a class and puts them into a JDOClass-object.
param
classname The name of the class.
param
atributes The attribute-string as specified in the properties.
return
@return The create JDOClass-object.
throws
JDOMetaDataUserException If something went wrong parsing the attributes.
List props = parseProperties (attributes);
//check each property
for (int i = 0; i < props.size (); i++)
{
Property prop = (Property) props.get (i);
validateClassProperty (prop, classname);
}
//check dependencies of all properties
checkForDuplicateProperties (props, classname);
//properties are OK - assign them to the JDOClass object
JDOClass clazz = new JDOClass (classname);
for (int i = 0; i < props.size (); i++)
{
Property prop = (Property) props.get (i);
if (prop.name.equals (PROPERTY_ACCESS_MODIFIER))
{
clazz.modifiers = getModifiers (prop.value);
}
else if (prop.name.equals (PROPERTY_JDO_MODIFIER))
{
clazz.isPersistent = prop.value.equals (JDO_PERSISTENT);
}
else if (prop.name.equals (PROPERTY_SUPER_CLASSNAME))
{
clazz.setSuperClassName (prop.value);
}
else if (prop.name.equals(PROPERTY_OID_CLASSNAME)) {
clazz.setOidClassName(prop.value);
}
}
return clazz;
private final com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOFieldparseJDOField(java.lang.String attributes, java.lang.String fieldname, com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOClass clazz)
Parses the attribute-string of a field.
param
attributes The attribute-string.
param
fieldname The fieldname.
param
clazz The class to field belongs to.
throws
JDOMetaDataUserException If something went wrong parsing the attributes.
List props = parseProperties (attributes);
//check each property
for (int i = 0; i < props.size (); i++)
{
Property prop = (Property) props.get (i);
validateFieldProperty (prop, fieldname, clazz.getName ());
}
//check dependencies of all properties
checkForDuplicateProperties (props, clazz.getName () + FIELD_DELIMITER + fieldname);
//properties are OK - assign them to the JDOField object
JDOField field = new JDOField (fieldname);
for (int i = 0; i < props.size (); i++)
{
Property prop = (Property) props.get (i);
if (prop.name.equals (PROPERTY_ACCESS_MODIFIER))
{
field.modifiers = getModifiers (prop.value);
}
else if (prop.name.equals (PROPERTY_JDO_MODIFIER))
{
field.jdoModifier = prop.value;
}
else if (prop.name.equals (PROPERTY_TYPE))
{
field.setType (prop.value);
}
else if (prop.name.equals (PROPERTY_ANNOTATION_TYPE))
{
field.annotationType = prop.value;
}
}
return field;
private final voidparseJDOFields(com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOClass clazz)
Parses all fields of a given class.
param
clazz The representation of the class.
throws
JDOMetaDataUserException If something went wrong parsing the properties.
//search for fields of the class
for (Enumeration names = this.properties.propertyNames (); names.hasMoreElements ();)
{
String name = (String) names.nextElement ();
if (name.startsWith (clazz.getName () + FIELD_DELIMITER)) //field found
{
String fieldname = name.substring (name.indexOf (FIELD_DELIMITER) + 1, name.length ());
validateFieldName (fieldname, clazz.getName ());
clazz.addField (parseJDOField (this.properties.getProperty (name), fieldname, clazz));
}
}
clazz.sortFields ();
final java.util.ListparseProperties(java.lang.String attributes)
Parses the attribute-string of a class- or fieldname.
param
attributes The attribute-string.
return
A list of Propert<-objects for the attributes.
exception
JDOMetaDataUserException If the parsing fails.
this.tmpTokens.clear ();
StringTokenizer t = new StringTokenizer (attributes, PROPERTY_DELIMITERS);
while (t.hasMoreTokens ())
{
this.tmpTokens.add (parseProperty (t.nextToken ()));
}
return this.tmpTokens;
private final com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$PropertyparseProperty(java.lang.String attribute)
Parses the given attribute and splits it into name and value.
param
attribute The attribute-string.
return
The Propert-object.
exception
JDOMetaDataUserException If the parsing fails.
Property prop = new Property ();
int idx = attribute.indexOf (PROPERTY_ASSIGNER);
if (idx < 0)
{
prop.value = attribute;
}
else
{
prop.name = attribute.substring (0, idx);
prop.value = attribute.substring (idx + 1, attribute.length ());
if (prop.name.length () == 0 || prop.value.length () == 0)
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_EMPTY_PROPERTY_NAME_OR_VALUE,
new String [] { attribute }));
}
}
return prop;
private static final java.lang.StringtoCanonicalClassName(java.lang.String classname)
Converts a classname given in a given VM-similar notation (with slashes) into a canonical notation (with dots).
param
The VM-similar notation of the classname.
return
The canonical classname.
see
#fromCanonicalClassName
return classname.replace ('/", '.");
private static final voidvalidateClassProperty(com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$Property prop, java.lang.String classname)
Checks if the given attribute-property of a class is valid.
param
prop The attribute-property.
param
classname The classname.
throws
JDOMetaDataUserException If the validation failed.
String value = prop.value;
if (prop.name == null) //try to guess the property name
{
//check access modifier
if (value.equals (ACCESS_PUBLIC) ||
value.equals (ACCESS_PROTECTED) ||
value.equals (ACCESS_PACKAGE_LOCAL) ||
value.equals (ACCESS_PRIVATE))
{
prop.name = PROPERTY_ACCESS_MODIFIER;
}
//check persistence
else if (value.equals (JDO_PERSISTENT) ||
value.equals (JDO_TRANSIENT))
{
prop.name = PROPERTY_JDO_MODIFIER;
}
//assume the the given value is the superclassname
else
{
prop.name = PROPERTY_SUPER_CLASSNAME;
}
}
else
{
//do we have a valid property name?
String name = prop.name;
checkPropertyName (prop.name, new String []
{
PROPERTY_OID_CLASSNAME,
PROPERTY_ACCESS_MODIFIER,
PROPERTY_JDO_MODIFIER,
PROPERTY_SUPER_CLASSNAME
}, classname);
//do we have a valid property value?
checkPropertyValue (prop,
new String []
{
ACCESS_PUBLIC,
ACCESS_PROTECTED,
ACCESS_PACKAGE_LOCAL,
ACCESS_PRIVATE
},
PROPERTY_ACCESS_MODIFIER,
classname);
checkPropertyValue (prop,
new String [] { JDO_TRANSIENT, JDO_PERSISTENT },
PROPERTY_JDO_MODIFIER,
classname);
}
private final voidvalidateDependencies(com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$JDOClass clazz)
Validates dependencies between a class and its fields and between.
param
clazz The class.
throws
JDOMetaDataUserException If the validation fails.
for (int i = clazz.fields.size () - 1; i >= 0; i--)
{
JDOField field = (JDOField) clazz.fields.get (i);
//set the jdo field modifier according to the jdo class modifier (if jdo field not set yet)
if (field.jdoModifier == null)
{
field.jdoModifier = (clazz.isPersistent () ? JDO_PERSISTENT : JDO_TRANSIENT);
}
//if we have a non-persistent class
else if (clazz.isTransient ())
{
//non-persistent classes cannot have persistent fields
if (field.isPersistent ())
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_TRANSIENT_CLASS_WITH_PERSISTENT_FIELD,
new String [] { clazz.getName (), field.getName () }));
}
//non-persistent classes cannot have transactional fields
if (field.isTransactional ())
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_TRANSIENT_CLASS_WITH_TRANSACTIONAL_FIELD,
new String [] { clazz.getName (), field.getName () }));
}
}
//a non-persistent class cannot have an annotated field
if (field.isAnnotated () && clazz.isTransient ())
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_TRANSIENT_CLASS_WITH_ANNOTATED_FIELD,
new String [] { clazz.getName (), field.getName () }));
}
//a non-persistent field cannot have an annotation type
if ( ! field.isPersistent () && field.isAnnotated ())
{
field.annotationType = ANNOTATION_TYPE_MEDIATED;
}
//set the annotation type if not done yet
if ( ! field.isAnnotated () && clazz.isPersistent ())
{
field.annotationType = ANNOTATION_TYPE_MEDIATED;
}
}
private static final voidvalidateFieldName(java.lang.String fieldname, java.lang.String classname)
Checks if a given fieldname is a valid Java identifier.
param
fieldname The fieldname.
param
classname The corresponding classname.
throws
JDOMetaDataUserException If the check fails.
if (fieldname.length () == 0)
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_EMPTY_FIELDNAME,
new String [] { classname }));
}
if ( ! Character.isJavaIdentifierStart (fieldname.charAt (0)))
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_INVALID_FIELDNAME,
new String [] { classname, fieldname }));
}
for (int i = fieldname.length () - 1; i >= 0; i--)
{
final char c = fieldname.charAt (i);
if ( ! Character.isJavaIdentifierPart (c))
{
throw new JDOMetaDataUserException (getErrorMsg (IErrorMessages.ERR_INVALID_FIELDNAME,
new String [] { classname, fieldname }));
}
}
private final voidvalidateFieldProperty(com.sun.jdo.api.persistence.enhancer.meta.JDOMetaDataProperties$Property prop, java.lang.String fieldname, java.lang.String classname)
Checks if the given attribute-property if valid for a field.
param
prop The attribute-property.
param
fieldname The fieldname.
param
classname The classname.
throws
JDOMetaDataUserException If the check fails.
String value = prop.value;
if (prop.name == null) //try to guess the property name
{
//check access modifier
if (value.equals (ACCESS_PUBLIC) ||
value.equals (ACCESS_PROTECTED) ||
value.equals (ACCESS_PACKAGE_LOCAL) ||
value.equals (ACCESS_PRIVATE))
{
prop.name = PROPERTY_ACCESS_MODIFIER;
}
//check persistence
else if (value.equals (JDO_PERSISTENT) ||
value.equals (JDO_TRANSIENT) ||
value.equals (JDO_TRANSACTIONAL))
{
prop.name = PROPERTY_JDO_MODIFIER;
}
//annotation type?
else if (value.equals (ANNOTATION_TYPE_PK) ||
value.equals (ANNOTATION_TYPE_DFG) ||
value.equals (ANNOTATION_TYPE_MEDIATED))
{
prop.name = PROPERTY_ANNOTATION_TYPE;
}
else
{
//assume the the given value is the type
prop.name = PROPERTY_TYPE;
}
}
else
{
String entry = classname + FIELD_DELIMITER + fieldname;
//do we have a valid property name?
checkPropertyName (prop.name,
new String []
{
PROPERTY_ACCESS_MODIFIER,
PROPERTY_JDO_MODIFIER,
PROPERTY_TYPE,
PROPERTY_ANNOTATION_TYPE
},
entry);
//do we have a valid property value
checkPropertyValue (prop,
new String []
{
ACCESS_PUBLIC,
ACCESS_PROTECTED,
ACCESS_PACKAGE_LOCAL,
ACCESS_PRIVATE
},
PROPERTY_ACCESS_MODIFIER,
entry);
checkPropertyValue (prop,
new String []
{
JDO_PERSISTENT,
JDO_TRANSIENT,
JDO_TRANSACTIONAL
},
PROPERTY_JDO_MODIFIER,
entry);
checkPropertyValue (prop,
new String []
{
ANNOTATION_TYPE_PK,
ANNOTATION_TYPE_DFG,
ANNOTATION_TYPE_MEDIATED
},
PROPERTY_ANNOTATION_TYPE,
entry);
}
|
{
"url": "http://jcs.mobile-utopia.com/jcs/57944_JDOMetaDataProperties.html",
"source_domain": "jcs.mobile-utopia.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "36904",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OHVJPCEG7YOSGW2FLQVBL7VGIFCADHN3",
"WARC-Concurrent-To": "<urn:uuid:97868128-9c9b-4fd7-8c38-39a6f9815235>",
"WARC-Date": "2019-11-14T17:22:51Z",
"WARC-IP-Address": "86.25.255.219",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FMTQDUEJDJMJGWQUJ5LGOTWGZBACR3ZQ",
"WARC-Record-ID": "<urn:uuid:9f6578d5-e76f-405f-9290-bc6cf7039a1b>",
"WARC-Target-URI": "http://jcs.mobile-utopia.com/jcs/57944_JDOMetaDataProperties.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d85cb82-efc1-40b1-8901-82c0ef7f4543>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-37.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,
1,
32,
156,
157,
179,
180,
236,
360,
457,
546,
671,
766,
816,
853,
878,
927,
977,
995,
1044,
1091,
1126,
1187,
1253,
1260,
1317,
1324,
1385,
1582,
1613,
1614,
1629,
1655,
1671,
1737,
1765,
1785,
1838,
1864,
1882,
1947,
1975,
2000,
2028,
2050,
2078,
2103,
2131,
2154,
2182,
2196,
2224,
2249,
2277,
2292,
2320,
2341,
2369,
2386,
2414,
2428,
2456,
2470,
2498,
2513,
2541,
2559,
2587,
2606,
2634,
2654,
2682,
2707,
2726,
2737,
2762,
2780,
2797,
2914,
2944,
2949,
3044,
3063,
3073,
3156,
3177,
3224,
3272,
3273,
3279,
3301,
3305,
3317,
3318,
3319,
3320,
3350,
3351,
3359,
3364,
3365,
3398,
3399,
3404,
3420,
3519,
3591,
3592,
3598,
3620,
3626,
3657,
3664,
3709,
3710,
3711,
3760,
3770,
3827,
3841,
3897,
3953,
4034,
4052,
4165,
4290,
4308,
4322,
4332,
4333,
4338,
4459,
4516,
4517,
4523,
4555,
4561,
4639,
4645,
4676,
4683,
4728,
4729,
4730,
4783,
4793,
4840,
4854,
4878,
4892,
4902,
4903,
5002,
5092,
5093,
5098,
5300,
5431,
5432,
5438,
5489,
5495,
5531,
5537,
5587,
5593,
5624,
5631,
5676,
5677,
5678,
5719,
5729,
5749,
5759,
5760,
5814,
5824,
5878,
5892,
5916,
5930,
5940,
5941,
6041,
6143,
6144,
6149,
6237,
6338,
6339,
6345,
6380,
6387,
6422,
6426,
6448,
6449,
6450,
6495,
6496,
6501,
6591,
6643,
6644,
6650,
6687,
6693,
6739,
6746,
6775,
6776,
6777,
6840,
6841,
6846,
6971,
7028,
7029,
7035,
7060,
7067,
7135,
7142,
7215,
7216,
7217,
7271,
7346,
7408,
7418,
7443,
7453,
7481,
7491,
7517,
7527,
7528,
7571,
7631,
7676,
7686,
7743,
7768,
7778,
7779,
7832,
7908,
7960,
8020,
8081,
8082,
8104,
8105,
8110,
8263,
8311,
8312,
8318,
8351,
8357,
8403,
8410,
8484,
8491,
8564,
8565,
8566,
8616,
8688,
8689,
8694,
8746,
8785,
8786,
8793,
8827,
8828,
8829,
8877,
8972,
8982,
9039,
9092,
9106,
9170,
9184,
9194,
9195,
9276,
9277,
9282,
9346,
9347,
9348,
9394,
9404,
9440,
9450,
9497,
9507,
9544,
9554,
9603,
9613,
9652,
9662,
9680,
9681,
9686,
9843,
9921,
9922,
9928,
9961,
9967,
10030,
10037,
10073,
10080,
10153,
10154,
10155,
10206,
10207,
10237,
10286,
10296,
10350,
10403,
10413,
10414,
10461,
10517,
10518,
10583,
10634,
10683,
10693,
10747,
10809,
10823,
10884,
10898,
10962,
10976,
11049,
11063,
11130,
11144,
11198,
11212,
11277,
11328,
11342,
11343,
11353,
11354,
11376,
11377,
11382,
11619,
11659,
11660,
11666,
11699,
11705,
11730,
11736,
11773,
11780,
11853,
11854,
11855,
11906,
11907,
11937,
11986,
11996,
12050,
12121,
12131,
12132,
12179,
12272,
12273,
12338,
12389,
12438,
12448,
12502,
12564,
12578,
12639,
12653,
12717,
12731,
12779,
12793,
12849,
12863,
12907,
12921,
12988,
13002,
13053,
13067,
13077,
13078,
13100,
13101,
13106,
13219,
13255,
13256,
13262,
13301,
13308,
13381,
13382,
13383,
13424,
13519,
13529,
13586,
13672,
13686,
13790,
13855,
13958,
13972,
13982,
14011,
14012,
14017,
14082,
14136,
14137,
14143,
14176,
14183,
14230,
14240,
14287,
14288,
14289,
14322,
14405,
14440,
14450,
14515,
14525,
14526,
14557,
14558,
14563,
14691,
14753,
14754,
14760,
14792,
14799,
14819,
14829,
14876,
14877,
14878,
14919,
14976,
14997,
15007,
15043,
15053,
15066,
15076,
15130,
15207,
15281,
15295,
15409,
15505,
15519,
15529,
15530,
15551,
15552,
15557,
15643,
15755,
15756,
15762,
15804,
15811,
15836,
15840,
15864,
15865,
15866,
15911,
15912,
15917,
16071,
16131,
16132,
16138,
16167,
16173,
16198,
16205,
16256,
16257,
16258,
16293,
16359,
16369,
16405,
16455,
16508,
16565,
16613,
16627,
16681,
16695,
16696,
16728,
16784,
16836,
16850,
16901,
16915,
16916,
16979,
16996,
17010,
17064,
17078,
17088,
17101,
17111,
17159,
17196,
17252,
17300,
17372,
17446,
17517,
17590,
17651,
17652,
17701,
17739,
17785,
17823,
17878,
17936,
17998,
18053,
18092,
18150,
18194,
18232,
18313,
18368,
18412,
18422,
18423,
18428,
18547,
18614,
18615,
18621,
18638,
18645,
18695,
18696,
18697,
18758,
18768,
18830,
18831,
18935,
18979,
18993,
19091,
19105,
19153,
19197,
19211,
19282,
19326,
19344,
19471,
19596,
19614,
19688,
19735,
19753,
19883,
20008,
20026,
20040,
20041,
20109,
20174,
20188,
20310,
20431,
20445,
20446,
20514,
20583,
20597,
20662,
20676,
20677,
20731,
20800,
20814,
20879,
20893,
20903,
20904,
20909,
21008,
21064,
21065,
21071,
21096,
21102,
21141,
21148,
21193,
21194,
21195,
21234,
21244,
21341,
21433,
21443,
21515,
21525,
21624,
21727,
21737,
21797,
21807,
21856,
21912,
21926,
22029,
22136,
22150,
22160,
22161,
22166,
22341,
22402,
22403,
22409,
22438,
22444,
22469,
22475,
22500,
22507,
22552,
22553,
22554,
22589,
22655,
22665,
22701,
22751,
22804,
22861,
22909,
22923,
22977,
22991,
22992,
23024,
23080,
23135,
23191,
23205,
23256,
23270,
23271,
23302,
23362,
23423,
23486,
23500,
23554,
23568,
23569,
23586,
23600,
23657,
23700,
23714,
23724,
23737,
23747,
23815,
23816,
23864,
23906,
23951,
23988,
24053,
24115,
24169,
24233,
24271,
24310,
24311,
24359,
24397,
24443,
24481,
24536,
24594,
24656,
24711,
24750,
24808,
24848,
24886,
24932,
24970,
25026,
25081,
25139,
25178,
25233,
25273,
25311,
25357,
25395,
25455,
25516,
25581,
25620,
25678,
25718
],
"line_end_idx": [
1,
32,
156,
157,
179,
180,
236,
360,
457,
546,
671,
766,
816,
853,
878,
927,
977,
995,
1044,
1091,
1126,
1187,
1253,
1260,
1317,
1324,
1385,
1582,
1613,
1614,
1629,
1655,
1671,
1737,
1765,
1785,
1838,
1864,
1882,
1947,
1975,
2000,
2028,
2050,
2078,
2103,
2131,
2154,
2182,
2196,
2224,
2249,
2277,
2292,
2320,
2341,
2369,
2386,
2414,
2428,
2456,
2470,
2498,
2513,
2541,
2559,
2587,
2606,
2634,
2654,
2682,
2707,
2726,
2737,
2762,
2780,
2797,
2914,
2944,
2949,
3044,
3063,
3073,
3156,
3177,
3224,
3272,
3273,
3279,
3301,
3305,
3317,
3318,
3319,
3320,
3350,
3351,
3359,
3364,
3365,
3398,
3399,
3404,
3420,
3519,
3591,
3592,
3598,
3620,
3626,
3657,
3664,
3709,
3710,
3711,
3760,
3770,
3827,
3841,
3897,
3953,
4034,
4052,
4165,
4290,
4308,
4322,
4332,
4333,
4338,
4459,
4516,
4517,
4523,
4555,
4561,
4639,
4645,
4676,
4683,
4728,
4729,
4730,
4783,
4793,
4840,
4854,
4878,
4892,
4902,
4903,
5002,
5092,
5093,
5098,
5300,
5431,
5432,
5438,
5489,
5495,
5531,
5537,
5587,
5593,
5624,
5631,
5676,
5677,
5678,
5719,
5729,
5749,
5759,
5760,
5814,
5824,
5878,
5892,
5916,
5930,
5940,
5941,
6041,
6143,
6144,
6149,
6237,
6338,
6339,
6345,
6380,
6387,
6422,
6426,
6448,
6449,
6450,
6495,
6496,
6501,
6591,
6643,
6644,
6650,
6687,
6693,
6739,
6746,
6775,
6776,
6777,
6840,
6841,
6846,
6971,
7028,
7029,
7035,
7060,
7067,
7135,
7142,
7215,
7216,
7217,
7271,
7346,
7408,
7418,
7443,
7453,
7481,
7491,
7517,
7527,
7528,
7571,
7631,
7676,
7686,
7743,
7768,
7778,
7779,
7832,
7908,
7960,
8020,
8081,
8082,
8104,
8105,
8110,
8263,
8311,
8312,
8318,
8351,
8357,
8403,
8410,
8484,
8491,
8564,
8565,
8566,
8616,
8688,
8689,
8694,
8746,
8785,
8786,
8793,
8827,
8828,
8829,
8877,
8972,
8982,
9039,
9092,
9106,
9170,
9184,
9194,
9195,
9276,
9277,
9282,
9346,
9347,
9348,
9394,
9404,
9440,
9450,
9497,
9507,
9544,
9554,
9603,
9613,
9652,
9662,
9680,
9681,
9686,
9843,
9921,
9922,
9928,
9961,
9967,
10030,
10037,
10073,
10080,
10153,
10154,
10155,
10206,
10207,
10237,
10286,
10296,
10350,
10403,
10413,
10414,
10461,
10517,
10518,
10583,
10634,
10683,
10693,
10747,
10809,
10823,
10884,
10898,
10962,
10976,
11049,
11063,
11130,
11144,
11198,
11212,
11277,
11328,
11342,
11343,
11353,
11354,
11376,
11377,
11382,
11619,
11659,
11660,
11666,
11699,
11705,
11730,
11736,
11773,
11780,
11853,
11854,
11855,
11906,
11907,
11937,
11986,
11996,
12050,
12121,
12131,
12132,
12179,
12272,
12273,
12338,
12389,
12438,
12448,
12502,
12564,
12578,
12639,
12653,
12717,
12731,
12779,
12793,
12849,
12863,
12907,
12921,
12988,
13002,
13053,
13067,
13077,
13078,
13100,
13101,
13106,
13219,
13255,
13256,
13262,
13301,
13308,
13381,
13382,
13383,
13424,
13519,
13529,
13586,
13672,
13686,
13790,
13855,
13958,
13972,
13982,
14011,
14012,
14017,
14082,
14136,
14137,
14143,
14176,
14183,
14230,
14240,
14287,
14288,
14289,
14322,
14405,
14440,
14450,
14515,
14525,
14526,
14557,
14558,
14563,
14691,
14753,
14754,
14760,
14792,
14799,
14819,
14829,
14876,
14877,
14878,
14919,
14976,
14997,
15007,
15043,
15053,
15066,
15076,
15130,
15207,
15281,
15295,
15409,
15505,
15519,
15529,
15530,
15551,
15552,
15557,
15643,
15755,
15756,
15762,
15804,
15811,
15836,
15840,
15864,
15865,
15866,
15911,
15912,
15917,
16071,
16131,
16132,
16138,
16167,
16173,
16198,
16205,
16256,
16257,
16258,
16293,
16359,
16369,
16405,
16455,
16508,
16565,
16613,
16627,
16681,
16695,
16696,
16728,
16784,
16836,
16850,
16901,
16915,
16916,
16979,
16996,
17010,
17064,
17078,
17088,
17101,
17111,
17159,
17196,
17252,
17300,
17372,
17446,
17517,
17590,
17651,
17652,
17701,
17739,
17785,
17823,
17878,
17936,
17998,
18053,
18092,
18150,
18194,
18232,
18313,
18368,
18412,
18422,
18423,
18428,
18547,
18614,
18615,
18621,
18638,
18645,
18695,
18696,
18697,
18758,
18768,
18830,
18831,
18935,
18979,
18993,
19091,
19105,
19153,
19197,
19211,
19282,
19326,
19344,
19471,
19596,
19614,
19688,
19735,
19753,
19883,
20008,
20026,
20040,
20041,
20109,
20174,
20188,
20310,
20431,
20445,
20446,
20514,
20583,
20597,
20662,
20676,
20677,
20731,
20800,
20814,
20879,
20893,
20903,
20904,
20909,
21008,
21064,
21065,
21071,
21096,
21102,
21141,
21148,
21193,
21194,
21195,
21234,
21244,
21341,
21433,
21443,
21515,
21525,
21624,
21727,
21737,
21797,
21807,
21856,
21912,
21926,
22029,
22136,
22150,
22160,
22161,
22166,
22341,
22402,
22403,
22409,
22438,
22444,
22469,
22475,
22500,
22507,
22552,
22553,
22554,
22589,
22655,
22665,
22701,
22751,
22804,
22861,
22909,
22923,
22977,
22991,
22992,
23024,
23080,
23135,
23191,
23205,
23256,
23270,
23271,
23302,
23362,
23423,
23486,
23500,
23554,
23568,
23569,
23586,
23600,
23657,
23700,
23714,
23724,
23737,
23747,
23815,
23816,
23864,
23906,
23951,
23988,
24053,
24115,
24169,
24233,
24271,
24310,
24311,
24359,
24397,
24443,
24481,
24536,
24594,
24656,
24711,
24750,
24808,
24848,
24886,
24932,
24970,
25026,
25081,
25139,
25178,
25233,
25273,
25311,
25357,
25395,
25455,
25516,
25581,
25620,
25678,
25718,
25727
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 25727,
"ccnet_original_nlines": 745,
"rps_doc_curly_bracket": 0.006141410209238529,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.179413303732872,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03273965045809746,
"rps_doc_frac_lines_end_with_ellipsis": 0.004021449945867062,
"rps_doc_frac_no_alph_words": 0.3847564160823822,
"rps_doc_frac_unique_words": 0.19989615678787231,
"rps_doc_mean_word_length": 7.827621936798096,
"rps_doc_num_sentences": 474,
"rps_doc_symbol_to_word_ratio": 0.004190680105239153,
"rps_doc_unigram_entropy": 5.079948425292969,
"rps_doc_word_count": 1926,
"rps_doc_frac_chars_dupe_10grams": 0.11859910190105438,
"rps_doc_frac_chars_dupe_5grams": 0.27951711416244507,
"rps_doc_frac_chars_dupe_6grams": 0.23461130261421204,
"rps_doc_frac_chars_dupe_7grams": 0.200384721159935,
"rps_doc_frac_chars_dupe_8grams": 0.1590607613325119,
"rps_doc_frac_chars_dupe_9grams": 0.14619262516498566,
"rps_doc_frac_chars_top_2gram": 0.0211594607681036,
"rps_doc_frac_chars_top_3gram": 0.03343062102794647,
"rps_doc_frac_chars_top_4gram": 0.027062879875302315,
"rps_doc_books_importance": -1502.46875,
"rps_doc_books_importance_length_correction": -1502.46875,
"rps_doc_openwebtext_importance": -1053.2105712890625,
"rps_doc_openwebtext_importance_length_correction": -1053.2105712890625,
"rps_doc_wikipedia_importance": -748.7794189453125,
"rps_doc_wikipedia_importance_length_correction": -748.7794189453125
},
"fasttext": {
"dclm": 0.8568425178527832,
"english": 0.3825944662094116,
"fineweb_edu_approx": 1.992987036705017,
"eai_general_math": 0.37012290954589844,
"eai_open_web_math": 0.09565048664808273,
"eai_web_code": 0.8808655142784119
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,769,536,191,632,165,400 |
Take the 2-minute tour ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
I've noticed that with Fedora 17, a shutdown operation (e.g., shutdown -h now) has gotten so much faster (feels like 2 seconds max). So I'm wondering if running processes are terminated properly? Especially on Fedora (again, about 2 seconds), I can hardly imagine that every process has enough time to finish.
I'm assuming every user process has been closed by the user (manually) before the shutdown command is issued, so only system services are left (still, those may have stuff to do on exit too).
So I wrote a tiny little program which catches most signals and, if a number (of seconds) is provided, it'll wait before exiting. Other than that, it doesn't do anything. Then - first on a Debian system - I started it with a delay of 60 seconds. When it received a SIGHUP (I'm assuming its parent shell has been terminated), it started the 60 second countdown. After 10 seconds, it received a friendly SIGTERM. My program ignored this signal and continued the countdown - until second 40 when it tragically died. So 20 seconds after it was told to terminate (SIGHUP), it was SIGKILLed.
Now the same test on Fedora 17 (3.5.3-1.fc17.x86_64):
Caught signal 1.
Runtime: 8 second(s)
Delaying termination for 60 second(s)...
60...
Caught signal 15 - ignoring!
59...
58...
Not even one second after the SIGHUP, it receives the SIGTERM. A programmer may delay the termination of his program after a SIGTERM, in order to finish jobs, save settings and so on (unlike, maybe after a SIGINT). My program gets 2 seconds before it's killed.
What if a running process is killed while saving some settings (corrupted settings file?) or some kind of daemon (e.g., some file server) is writing cached data to disk (corrupted data?)?
share|improve this question
1 Answer 1
up vote 1 down vote accepted
Services can specify how they want to be terminated in their *.service file. You can select any timeout you want, you don't have to live with the default. If you have postgreSQL or mysqld installed, look at their service files to see how they arrange a clean shutdown.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/480508/why-doesnt-fedora-properly-terminate-all-processes-on-shutdown/480512",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "65859",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CA3WVNAKIHUTMDHMP2FKWCLNVXJ5JOIS",
"WARC-Concurrent-To": "<urn:uuid:05aeae81-a418-4de4-accc-71684dcd02e4>",
"WARC-Date": "2015-05-23T12:05:04Z",
"WARC-IP-Address": "141.101.114.59",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LQSBQWDLUFB4GMFFQHMGHKEMDUFDWVQJ",
"WARC-Record-ID": "<urn:uuid:fbfce901-60b4-4530-a159-917d57e80cfc>",
"WARC-Target-URI": "http://superuser.com/questions/480508/why-doesnt-fedora-properly-terminate-all-processes-on-shutdown/480512",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c2bf406b-65fc-4e84-8620-01715141a8a0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
150,
151,
461,
462,
654,
655,
1241,
1242,
1296,
1297,
1314,
1335,
1376,
1382,
1411,
1417,
1423,
1424,
1685,
1686,
1874,
1875,
1903,
1904,
1915,
1916,
1945,
1946,
2215,
2216,
2242,
2243,
2255,
2256,
2258,
2266,
2267,
2345,
2346
],
"line_end_idx": [
25,
150,
151,
461,
462,
654,
655,
1241,
1242,
1296,
1297,
1314,
1335,
1376,
1382,
1411,
1417,
1423,
1424,
1685,
1686,
1874,
1875,
1903,
1904,
1915,
1916,
1945,
1946,
2215,
2216,
2242,
2243,
2255,
2256,
2258,
2266,
2267,
2345,
2346,
2436
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2436,
"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.37288135290145874,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028248589485883713,
"rps_doc_frac_lines_end_with_ellipsis": 0.09756097942590714,
"rps_doc_frac_no_alph_words": 0.2391713708639145,
"rps_doc_frac_unique_words": 0.5427873134613037,
"rps_doc_mean_word_length": 4.603911876678467,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.007532959803938866,
"rps_doc_unigram_entropy": 5.127507209777832,
"rps_doc_word_count": 409,
"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.012745619751513004,
"rps_doc_frac_chars_top_3gram": 0.011683479882776737,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -292.8642883300781,
"rps_doc_books_importance_length_correction": -292.8642883300781,
"rps_doc_openwebtext_importance": -153.75881958007812,
"rps_doc_openwebtext_importance_length_correction": -153.75881958007812,
"rps_doc_wikipedia_importance": -139.14822387695312,
"rps_doc_wikipedia_importance_length_correction": -139.14822387695312
},
"fasttext": {
"dclm": 0.2714221477508545,
"english": 0.9578449130058289,
"fineweb_edu_approx": 1.2643280029296875,
"eai_general_math": 0.0006836699903942645,
"eai_open_web_math": 0.07193368673324585,
"eai_web_code": 0.0007547099958173931
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,513,276,685,440,780,000 |
Program to find maximum average pass ratio in Python
Suppose we have a list of classes where classes[i] represents [pass_i, total_i] represents the number of students passed the examination of ith class and total number of students of the ith class respectively. We also have another value extra. This indicates extra number of brilliant students that are guaranteed to pass the exam of any class they are assigned to. We have to assign each of the extra students to a class in a way that maximizes the average number of passed student across all the classes. The pass ratio of a class determined by the number of students of the class that will passed divided by the total number of students of the class. And the average pass ratio is the sum of pass ratios of all the classes divided by the number of the classes. We have to find the maximum possible average pass ratio after assigning the extra students.
So, if the input is like classes = [[2,3],[4,6],[3,3]], extra = 3, then the output will be 0.83809, because two extra students at first class and add one extra student to second class to maximize the ratio, so now average is (4/5 + 5/7 + 3/3)/3 = 0.83809.
To solve this, we will follow these steps −
• h := a list of tuples like (a/b-(a + 1)/(b + 1), a, b) for each pair (a, b) in classes
• heapify h
• while extra is non-zero, do
• (v, a, b) := top of h, and delete it from h
• (a, b) := (a + 1, b + 1)
• insert (-(a + 1) /(b + 1) + a / b, a, b) into heap
• extra := extra - 1
• return average from all tuples of h
Example
Let us see the following implementation to get better understanding −
import heapq
def solve(classes, extra):
h = [(a / b - (a + 1) / (b + 1), a, b) for a, b in classes]
heapq.heapify(h)
while extra:
v, a, b = heapq.heappop(h)
a, b = a + 1, b + 1
heapq.heappush(h, (-(a + 1) / (b + 1) + a / b, a, b))
extra -= 1
return sum(a / b for v, a, b in h) / len(h)
classes = [[2,3],[4,6],[3,3]]
extra = 3
print(solve(classes, extra))
Input
[[2,3],[4,6],[3,3]], 3
Output
0
Advertisements
|
{
"url": "https://www.tutorialspoint.com/program-to-find-maximum-average-pass-ratio-in-python",
"source_domain": "www.tutorialspoint.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "43265",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LPSKYBVOTGQPDJBW6YVYS43C2YR6G4AP",
"WARC-Concurrent-To": "<urn:uuid:fc9f97f8-23b9-4f86-8ab7-0f1ec34ebd74>",
"WARC-Date": "2023-02-02T15:53:11Z",
"WARC-IP-Address": "192.229.210.176",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZYW7D5677XFXDG6FTBOE33B6TFJKF3R3",
"WARC-Record-ID": "<urn:uuid:8b01b180-5690-430e-a049-ffbae7f98b97>",
"WARC-Target-URI": "https://www.tutorialspoint.com/program-to-find-maximum-average-pass-ratio-in-python",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0318949-92c0-4f39-950d-1d789b56945a>"
},
"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-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,
53,
54,
55,
56,
912,
913,
1169,
1170,
1214,
1215,
1306,
1307,
1321,
1322,
1354,
1355,
1405,
1406,
1437,
1438,
1495,
1496,
1521,
1522,
1562,
1563,
1571,
1572,
1642,
1643,
1656,
1683,
1746,
1766,
1782,
1815,
1841,
1901,
1918,
1965,
1966,
1996,
2006,
2035,
2036,
2042,
2043,
2066,
2067,
2074,
2075,
2077,
2078
],
"line_end_idx": [
53,
54,
55,
56,
912,
913,
1169,
1170,
1214,
1215,
1306,
1307,
1321,
1322,
1354,
1355,
1405,
1406,
1437,
1438,
1495,
1496,
1521,
1522,
1562,
1563,
1571,
1572,
1642,
1643,
1656,
1683,
1746,
1766,
1782,
1815,
1841,
1901,
1918,
1965,
1966,
1996,
2006,
2035,
2036,
2042,
2043,
2066,
2067,
2074,
2075,
2077,
2078,
2092
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2092,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3477477431297302,
"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.38558557629585266,
"rps_doc_frac_unique_words": 0.3656509816646576,
"rps_doc_mean_word_length": 3.9141273498535156,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.273400783538818,
"rps_doc_word_count": 361,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08421798050403595,
"rps_doc_frac_chars_dupe_6grams": 0.08421798050403595,
"rps_doc_frac_chars_dupe_7grams": 0.011323429644107819,
"rps_doc_frac_chars_dupe_8grams": 0.011323429644107819,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019815990701317787,
"rps_doc_frac_chars_top_3gram": 0.01061571016907692,
"rps_doc_frac_chars_top_4gram": 0.014154279604554176,
"rps_doc_books_importance": -207.93728637695312,
"rps_doc_books_importance_length_correction": -207.93728637695312,
"rps_doc_openwebtext_importance": -124.88142395019531,
"rps_doc_openwebtext_importance_length_correction": -124.88142395019531,
"rps_doc_wikipedia_importance": -58.90922164916992,
"rps_doc_wikipedia_importance_length_correction": -58.90922164916992
},
"fasttext": {
"dclm": 0.9794641137123108,
"english": 0.8794324398040771,
"fineweb_edu_approx": 2.261295795440674,
"eai_general_math": 0.9995824694633484,
"eai_open_web_math": 0.41987133026123047,
"eai_web_code": 0.96425461769104
}
}
|
{
"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.7",
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,626,972,924,123,529,000 |
Network Profiler
Choose your OS:
The Network Profiler is a standalone tool that can be used to display network traffic and performance information that can be recorded by the engine as a game runs. This is a good way to identify areas of a multiplayer game that use unusually high bandwidth, since you can see how much bandwidth individual actors, RPCs, and properties contribute to the total.
Recording a profiling session
Before you can use the network profiler, you must record some data for it to analyze. To do this, you need to use a version of the engine with stat tracking enabled - usually this means either a debug build, or for non-debug configurations, an editor build (specifically, the engine should have been compiled with the STATS macro defined to a nonzero value).
You can pass the "networkprofiler=true" command-line argument to record as soon as the engine starts up, but you can also use the following console commands at runtime to control the recording of network profiler data:
• netprofile: toggles recording on and off
• netprofile enable: start recording if not already recording
• netprofile disable: stop recording if currently recording
The data file will be saved to <project directory>/Saved/Profiling/<project name>-<timestamp>.nprof. If you see a file named NetworkProfiling.tmp in the same folder, this is just the temporary file the engine uses while collecting data. When the current profiling session is stopped, this file will be renamed according to the scheme above and is then ready to be opened in the standalone tool.
Viewing a profile session in the Network Profiler application
The network profiler is a standalone application located at <UE install directory>/Engine/Binaries/DotNET/NetworkProfiler.exe.
At the top of the window, click the "Open File" button to select a .nprof file and view the data contained within.
image alt text
Chart, Filters, Details tab
By default, the "Chart, Filters, Details" tab is selected. The different areas of this tab are described in the following sections.
image alt text
1. Chart View
2. Stats List
3. Summary view
4. Frame details
5. Filters
6. Performance view
Chart View
This is the main chart view. Similar to charts in other profiling applications, it shows a graph of the enabled stats over time. You can click on a particular frame to populate the other views with the data associated with that frame, or click and drag across the graph to zoom in to that area and view a summary for that time span.
Stats List
This is a list of all the stats tracked by the network profiler. Toggling the checkboxes will show or hide that particular stat in the graph. For most stats, you can choose to show the raw count, the count per second, the number of bytes, or the number of bytes per second.
Summary View
This is a summary of the data for the time span that has been selected in the chart. It shows raw totals as well as per-second information. Note that the "Outgoing bandwidth" will be greater than the "Game socket send size" because "Outgoing bandwidth" includes an approximation of the IP and UDP header sizes as well.
Frame Details
This view breaks down the data that was sent on the currently selected frame. You can see which actors, properties, and remote functions were sent, as well as how many bytes each one contributed. Note that replicated actors and RPCs are both included in bunches, so the "NumBytes" field in "SEND BUNCH" sections includes the bytes from "SEND RPC" and "REPLICATE ACTOR" sections. Ultimately, the "SOCKET SEND TO" entries will tell you exactly how many bytes the engine sent to the outgoing socket. Also note that the standard UDP packet overhead is not included here.
Filters
You can enter a filter for actors, properties, and RPCs, and after clicking the "Apply Filters" button, the graph will update to only show data that is relevant for actors, properties, and RPCs that contain the text entered in the filter fields. Selecting a frame or range of frames in the graph after a filter has been applied will also filter the data in the summary and frame details views accordingly.
Performance View
While a single frame is selected in the graph, this view will show a list of actor types that were replicated during that frame, sorted by the CPU time it took to replicate them. If an actor has associated replicated properties, expanding the tree view for the actor will show each property. For actors, the first column of numbers is the CPU replication time for that actor, in milliseconds. The second column is the number of bytes used to represent the actor in the bunch, and the third column is the number of actors of the given type that were replicated during the current frame. For property rows, the first column is the number of bytes used for the property, and the second column shows how many properties with the given name were replicated for the actor.
Actors tab, Properties tab, and RPCs tab
image alt text
Each of these tabs show a summary of the respective replication data for the entire profiling session. Note that the data displayed in these tabs is not affected by the current frame or time span selected in the chart on the "Chart, Filters, Details" tab.
The tabs show a list of actors, properties, or RPCs, respectively. The "Total Size" and "Average Size" columns show how much bandwidth was needed for a particular item, and the "Count" column represents how many times a particular item was replicated during the profiling session. You can toggle between sorting by a column in ascending or descending order by clicking on the column heading.
Server and client considerations
You can record profiling data from both clients and servers. However, be aware that since only servers replicate actors and their properties, when viewing a profile recorded on a client, you will only see detailed data for RPCs that were sent from that client.
|
{
"url": "https://docs.unrealengine.com/latest/INT/Gameplay/Tools/NetworkProfiler/index.html",
"source_domain": "docs.unrealengine.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "31837",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SIOYMOAKNW2JCUGINWBHA3MAS6SFMKWY",
"WARC-Concurrent-To": "<urn:uuid:ae68bd21-260b-4060-ab0b-b96e51e24458>",
"WARC-Date": "2017-12-18T22:33:23Z",
"WARC-IP-Address": "34.233.166.10",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PZ2QWIVLYDVCBFJKDCL62C6DO2RYEZE2",
"WARC-Record-ID": "<urn:uuid:d635f5e6-443c-41ea-a068-bc7417ac76c2>",
"WARC-Target-URI": "https://docs.unrealengine.com/latest/INT/Gameplay/Tools/NetworkProfiler/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:394ed705-3980-4b43-874c-2cefdc611b1c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-140-161-138.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,
17,
18,
34,
35,
396,
397,
427,
428,
787,
788,
1007,
1008,
1053,
1054,
1118,
1119,
1181,
1182,
1577,
1578,
1640,
1641,
1768,
1769,
1884,
1885,
1900,
1901,
1929,
1930,
2062,
2063,
2078,
2079,
2095,
2096,
2112,
2113,
2131,
2132,
2151,
2152,
2165,
2166,
2188,
2189,
2200,
2201,
2534,
2535,
2546,
2547,
2821,
2822,
2835,
2836,
3155,
3156,
3170,
3171,
3738,
3739,
3747,
3748,
4154,
4155,
4172,
4173,
4940,
4941,
4982,
4983,
4998,
4999,
5255,
5256,
5648,
5649,
5682,
5683
],
"line_end_idx": [
17,
18,
34,
35,
396,
397,
427,
428,
787,
788,
1007,
1008,
1053,
1054,
1118,
1119,
1181,
1182,
1577,
1578,
1640,
1641,
1768,
1769,
1884,
1885,
1900,
1901,
1929,
1930,
2062,
2063,
2078,
2079,
2095,
2096,
2112,
2113,
2131,
2132,
2151,
2152,
2165,
2166,
2188,
2189,
2200,
2201,
2534,
2535,
2546,
2547,
2821,
2822,
2835,
2836,
3155,
3156,
3170,
3171,
3738,
3739,
3747,
3748,
4154,
4155,
4172,
4173,
4940,
4941,
4982,
4983,
4998,
4999,
5255,
5256,
5648,
5649,
5682,
5683,
5943
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5943,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41423672437667847,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014579759910702705,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14065180718898773,
"rps_doc_frac_unique_words": 0.327309250831604,
"rps_doc_mean_word_length": 4.745984077453613,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.071686744689941,
"rps_doc_word_count": 996,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0505606085062027,
"rps_doc_frac_chars_dupe_6grams": 0.024962980300188065,
"rps_doc_frac_chars_dupe_7grams": 0.011846840381622314,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012693040072917938,
"rps_doc_frac_chars_top_3gram": 0.019039560109376907,
"rps_doc_frac_chars_top_4gram": 0.013539239764213562,
"rps_doc_books_importance": -569.288330078125,
"rps_doc_books_importance_length_correction": -569.288330078125,
"rps_doc_openwebtext_importance": -292.0506591796875,
"rps_doc_openwebtext_importance_length_correction": -292.0506591796875,
"rps_doc_wikipedia_importance": -233.3616943359375,
"rps_doc_wikipedia_importance_length_correction": -233.3616943359375
},
"fasttext": {
"dclm": 0.3844321370124817,
"english": 0.9367560744285583,
"fineweb_edu_approx": 2.2511308193206787,
"eai_general_math": 0.8465110659599304,
"eai_open_web_math": 0.2304779291152954,
"eai_web_code": 0.7892823815345764
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,499,826,155,262,749,000 |
Build a Location-Based Mobile App With HTML5 & Javascript: 3
Aurelio De Rosa
Share
In the previous part of the series, I showed you the code of all the HTML pages of “Where I parked my car”. However, so far they are useless because we’ve not written the business logic behind them. In this article, we will start adding the few configurations lines of jQuery Mobile to the project, and then I’ll continue explaining some of the JavaScript files that power the application, as well as describing several Cordova APIs.
jQuery Mobile Configuration
jQuery Mobile does a lot for you just by adding it to your project without any special settings. However, there will be times when you want to modify or to take control of some default behavior. You can achieve this writing a configuration file. As stated in the first part of the series, the app has a file called jquery.mobile.config.js that, as you might guess, contains a configuration for jQuery Mobile. The most observant of you might have noticed that in the index.html file, the configuration is loaded before the library. You have to do so because when jQuery Mobile starts, it fires an event called mobileinit, and this is also the event you have to bind to override the default settings. Hence, you have to attach the handler before jQuery Mobile starts, but after the jQuery library.
You can override the default configuration in two ways. The first is using the jQuery extend() method as you can see in the following example.
$(document).bind('mobileinit', function() {
$.extend($.mobile , {
property1: value1,
property2: value2
// and so on...
});
});
The second way is to set the properties using the $.mobile object.
$(document).bind('mobileinit', function() {
$.mobile.property1 = value1;
$.mobile.property2 = value2;
// and so on...
});
Explaining all the jQuery Mobile properties is outside the scope of this article, however you can study them in deep detail by reading the jQuery Mobile configuration docs.
In the app configuration file, I won’t change a lot of properties. I’ll focus on changing the pages’ transition, the option to show the text when showing the page loader widget, and the theme. The full source of the file (that uses the second method to set jQuery Mobile properties) is listed below.
$(document).on(
'mobileinit',
function()
{
// Default pages' transition effect
$.mobile.defaultPageTransition = 'slide';
// Page Loader Widget
$.mobile.loader.prototype.options.textVisible = true;
// Theme
$.mobile.page.prototype.options.theme = 'b';
$.mobile.page.prototype.options.headerTheme = 'b';
$.mobile.page.prototype.options.contentTheme = 'b';
$.mobile.page.prototype.options.footerTheme = 'b';
$.mobile.page.prototype.options.backBtnTheme = 'b';
}
);
The APIs
From this section on, I’ll start describing the APIs used throughout the project. Apart from the Google Maps API, the other two—that is the Geolocation API and the Web Storage API—are W3C specifications. We’ll use this APIs through the Cordova framework, however some devices may already provide an implementation of these APIs. For those devices, Cordova will use their built-in support instead of the Cordova’s implementation, but for those that don’t have storage support, the Cordova implementation has been built to remain compatible with the W3C specs.
Managing the Locations
In this section I’ll show you the class called Position, which is responsible for managing the locations. It’s aim is to create, delete, and load the locations using the Web Storage API that is composed by two areas: the Session and the Local. Cordova uses the local storage because the storage is always at app level. All the locations will be stored in an item called “positions.”
Before going on, I want to highlight two facts. The first is that to store complex data (like objects and arrays) using the Web Storage API, you have to use the JSON format. So, in the Position class methods, you’ll see the use of the JSON class and its parse() and stringify() methods. The second is that Windows Phone 7 doesn’t support the dot notation so, you must use the setItem() and getItem() methods to ensure the compatibility for all devices. This is just the first of a lot of quirks that you have to face while developing with Cordova. Since with “Where I parked my car” we’re not targeting a specific platform, you have to take into account the different support and the quirks of the Cordova API. Luckily, the first one we encountered wasn’t so hard to deal with.
For the purpose of the app, we need to save the user’s and car’s latitude and longitude, but we also need the accuracy of the measurement to give the user an idea of how precise our locations are. I’ll wrap the first three data into a class called Coords.
Reading coordinates isn’t very user-friendly, so to enhance the user experience, we’ll use the Google Maps API to retrieve the address of the current location. The app will also store the date and time associated with that GPS location. Remember that the app will store up to 50 locations, so if the limits is reached, the extra positions (the older ones) will be eliminated using the JavaScript slice() method.
For what discussed so far, the starting point of the Position class is implemented by the following code.
function Position(position, address, datetime)
{
var _db = window.localStorage;
var MAX_POSITIONS = 50;
this.getMaxPositions = function()
{
return MAX_POSITIONS;
}
this.position = position;
this.address = address;
this.datetime = datetime;
}
function Coords(latitude, longitude, accuracy)
{
this.latitude = latitude;
this.longitude = longitude;
this.accuracy = accuracy;
}
As you may have guessed, in the JavaScript sense of the object-oriented approach, the _db property is private and MAX_POSITIONS is a constant. With the given skeleton we can’t do much, in fact, we need methods to let the application interface with the Web Storage API. These methods are
• savePosition() to store the car’s position
• updatePosition() to update the last position retrieved with the address if the callback to the Google Maps API succeed
• deletePosition() to allow the user to remove a previously saved position
• getPositions() to load all the stored locations
In all the cited methods, I’ll test if the database var (_db) is null and if it is, I’ll show an error message to the user. I test for this state because I like to try to anticipate and manage unexpected interface problems. To show the message, I’ll take advantage of the alert() method of the Cordova Notification API. Most of the supported platforms use a native dialog box, however, others (like Bada 2.X) use the well-known browser’s alert() function’s look and feel, which is less customizable. The Cordova alert() function accepts up to four parameters:
1. message: The string that contains the message to show
2. alertCallback: A callback to invoke when the alert dialog is dismissed
3. title: The title of the dialog (by default is “Alert”)
4. buttonName: The text of the button included in the dialog (by default is “OK”)
There’s another quirk that we have to consider while developing with PhoneGap. Windows Phone 7 ignores the button name and always uses the default. And, there isn’t a built-in browser alert, so if you want to use alert('message'); you have to assign window.alert = navigator.notification.alert. For a complete list of the differences between mobile operating systems, refer to the Cordova Notification alert() documentation.
If you’ve gotten this far, you deserve a prize: the full source of the described methods. You can copy and paste the code inside the Position class after the getMaxPositions() methods or before, it doesn’t matter.
this.savePosition = function(position, address)
{
if (!_db)
{
console.log('The database is null. Unable to save position');
navigator.notification.alert(
'Unable to save position',
function(){},
'Error'
);
}
var positions = this.getPositions();
if (positions == null)
positions = [];
positions.unshift(new Position(position, address, new Date()));
// Only the top MAX_POSITIONS results are needed
if (positions.length > this.MAX_POSITIONS)
positions = positions.slice(0, this.MAX_POSITIONS);
_db.setItem('positions', JSON.stringify(positions));
return positions;
}
this.updatePosition = function(index, position, address)
{
if (!_db)
{
console.log('The database is null. Unable to update position');
navigator.notification.alert(
'Unable to update position',
function(){},
'Error'
);
}
var positions = this.getPositions();
if (positions != null && positions[index] != undefined)
{
positions[index].coords = position;
positions[index].address = address;
}
_db.setItem('positions', JSON.stringify(positions));
return positions;
}
this.deletePosition = function(index)
{
if (!_db)
{
console.log('The database is null. Unable to delete position');
navigator.notification.alert(
'Unable to delete position',
function(){},
'Error'
);
}
var positions = this.getPositions();
if (positions != null && positions[index] != undefined)
positions.splice(index, 1);
_db.setItem('positions', JSON.stringify(positions));
return positions;
}
this.getPositions = function()
{
if (!_db)
{
console.log('The database is null. Unable to retrieve positions');
navigator.notification.alert(
'Unable to retrieve positions',
function(){},
'Error'
);
}
var positions = JSON.parse(_db.getItem('positions'));
if (positions == null)
positions = [];
return positions;
}
Conclusion
In this third part, you’ve seen how to configure “Where I parked my car” to change the pages’ transition, the option to show the text when showing the page loader widget, and the theme. You also learned how to store the car’s positions using the Web Storage API. In the next article, I’ll show you the last two JavaScript files: maps.js, and functions.js. The former contains the functions to initialize the application and some other utility functions, while the latter has the functions that use the Google Maps API to draw the map and the route to the car.
CSS Master, 3rd Edition
|
{
"url": "https://www.sitepoint.com/build-a-location-based-mobile-app-with-html5-and-javascript-part-3/",
"source_domain": "www.sitepoint.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "182885",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BGLCZOHIWJC2XOLDUMEQT2ECIEI27WL4",
"WARC-Concurrent-To": "<urn:uuid:1df983ae-0ff1-40af-a6a0-4deacd633647>",
"WARC-Date": "2023-06-02T15:40:22Z",
"WARC-IP-Address": "108.138.64.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y7E3HHFMDBI6NYGDGGUVL3BD5VNAIQZX",
"WARC-Record-ID": "<urn:uuid:4a31b9cf-dbb5-480e-8fc8-322de933275a>",
"WARC-Target-URI": "https://www.sitepoint.com/build-a-location-based-mobile-app-with-html5-and-javascript-part-3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d832ed70-6de6-4764-991f-bed7112375c4>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
61,
62,
78,
84,
85,
519,
520,
548,
549,
1345,
1346,
1489,
1490,
1534,
1558,
1581,
1603,
1623,
1629,
1633,
1634,
1701,
1702,
1746,
1777,
1808,
1826,
1830,
1831,
2004,
2005,
2305,
2306,
2322,
2338,
2351,
2355,
2395,
2441,
2442,
2468,
2526,
2527,
2540,
2590,
2645,
2701,
2756,
2812,
2816,
2819,
2820,
2829,
2830,
3389,
3390,
3413,
3414,
3797,
3798,
4576,
4577,
4833,
4834,
5246,
5247,
5353,
5354,
5401,
5403,
5436,
5462,
5463,
5499,
5503,
5529,
5533,
5534,
5562,
5588,
5616,
5618,
5619,
5666,
5668,
5696,
5726,
5754,
5756,
5757,
6044,
6045,
6092,
6215,
6292,
6344,
6345,
6905,
6906,
6965,
7041,
7101,
7185,
7186,
7611,
7612,
7826,
7827,
7875,
7877,
7889,
7893,
7959,
7993,
8026,
8046,
8060,
8067,
8071,
8072,
8111,
8136,
8156,
8157,
8223,
8274,
8319,
8375,
8376,
8431,
8432,
8452,
8454,
8455,
8512,
8514,
8526,
8530,
8598,
8632,
8667,
8687,
8701,
8708,
8712,
8713,
8752,
8810,
8814,
8854,
8894,
8898,
8899,
8954,
8955,
8975,
8977,
8978,
9016,
9018,
9030,
9034,
9102,
9136,
9171,
9191,
9205,
9212,
9216,
9217,
9256,
9314,
9346,
9347,
9402,
9403,
9423,
9425,
9426,
9457,
9459,
9471,
9475,
9546,
9580,
9618,
9638,
9652,
9659,
9663,
9664,
9720,
9745,
9765,
9766,
9786,
9788,
9789,
9800,
9801,
10361,
10362
],
"line_end_idx": [
61,
62,
78,
84,
85,
519,
520,
548,
549,
1345,
1346,
1489,
1490,
1534,
1558,
1581,
1603,
1623,
1629,
1633,
1634,
1701,
1702,
1746,
1777,
1808,
1826,
1830,
1831,
2004,
2005,
2305,
2306,
2322,
2338,
2351,
2355,
2395,
2441,
2442,
2468,
2526,
2527,
2540,
2590,
2645,
2701,
2756,
2812,
2816,
2819,
2820,
2829,
2830,
3389,
3390,
3413,
3414,
3797,
3798,
4576,
4577,
4833,
4834,
5246,
5247,
5353,
5354,
5401,
5403,
5436,
5462,
5463,
5499,
5503,
5529,
5533,
5534,
5562,
5588,
5616,
5618,
5619,
5666,
5668,
5696,
5726,
5754,
5756,
5757,
6044,
6045,
6092,
6215,
6292,
6344,
6345,
6905,
6906,
6965,
7041,
7101,
7185,
7186,
7611,
7612,
7826,
7827,
7875,
7877,
7889,
7893,
7959,
7993,
8026,
8046,
8060,
8067,
8071,
8072,
8111,
8136,
8156,
8157,
8223,
8274,
8319,
8375,
8376,
8431,
8432,
8452,
8454,
8455,
8512,
8514,
8526,
8530,
8598,
8632,
8667,
8687,
8701,
8708,
8712,
8713,
8752,
8810,
8814,
8854,
8894,
8898,
8899,
8954,
8955,
8975,
8977,
8978,
9016,
9018,
9030,
9034,
9102,
9136,
9171,
9191,
9205,
9212,
9216,
9217,
9256,
9314,
9346,
9347,
9402,
9403,
9423,
9425,
9426,
9457,
9459,
9471,
9475,
9546,
9580,
9618,
9638,
9652,
9659,
9663,
9664,
9720,
9745,
9765,
9766,
9786,
9788,
9789,
9800,
9801,
10361,
10362,
10385
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10385,
"ccnet_original_nlines": 202,
"rps_doc_curly_bracket": 0.0038517098873853683,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3206319808959961,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023234199732542038,
"rps_doc_frac_lines_end_with_ellipsis": 0.009852220304310322,
"rps_doc_frac_no_alph_words": 0.2639405131340027,
"rps_doc_frac_unique_words": 0.3517622649669647,
"rps_doc_mean_word_length": 5.393227577209473,
"rps_doc_num_sentences": 168,
"rps_doc_symbol_to_word_ratio": 0.0009293699986301363,
"rps_doc_unigram_entropy": 5.392018795013428,
"rps_doc_word_count": 1447,
"rps_doc_frac_chars_dupe_10grams": 0.043311119079589844,
"rps_doc_frac_chars_dupe_5grams": 0.10379292815923691,
"rps_doc_frac_chars_dupe_6grams": 0.07867760211229324,
"rps_doc_frac_chars_dupe_7grams": 0.07329574972391129,
"rps_doc_frac_chars_dupe_8grams": 0.07329574972391129,
"rps_doc_frac_chars_dupe_9grams": 0.06330087035894394,
"rps_doc_frac_chars_top_2gram": 0.012173240073025227,
"rps_doc_frac_chars_top_3gram": 0.008072780445218086,
"rps_doc_frac_chars_top_4gram": 0.008200920186936855,
"rps_doc_books_importance": -971.08740234375,
"rps_doc_books_importance_length_correction": -971.08740234375,
"rps_doc_openwebtext_importance": -469.06964111328125,
"rps_doc_openwebtext_importance_length_correction": -469.06964111328125,
"rps_doc_wikipedia_importance": -300.0902099609375,
"rps_doc_wikipedia_importance_length_correction": -300.0902099609375
},
"fasttext": {
"dclm": 0.4275406002998352,
"english": 0.7985801100730896,
"fineweb_edu_approx": 2.264955997467041,
"eai_general_math": 0.8036399483680725,
"eai_open_web_math": 0.1598491668701172,
"eai_web_code": 0.9412125945091248
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "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
|
979,371,875,092,136,100 |
How do I export a spreadsheet?
How do I export a spreadsheet?
Save a single worksheet
1. Right-click the worksheet name tab.
2. Click select Move or Copy.
3. Click on the Move selected sheets to Book drop-down menu. Select (new book).
4. Click OK. Your new workbook opens with your moved worksheet.
5. Click File > Save in your new workbook.
How do you link Excel to Google Docs?
1. On your computer, open a document or presentation in Google Docs or Google Slides.
2. Click Insert Chart. From Sheets.
3. Click the spreadsheet with the chart you want to add, then click Select.
4. Click the chart you want to add. If you don’t want the chart linked to the spreadsheet, uncheck “Link to spreadsheet.”
5. Click Import.
What is difference between Google Sheets and Excel?
And unlike Excel, Sheets is free. Sheets are also better for collaboration, as the program was developed for ease of use and online sharing. Still, for those who use spreadsheets for serious data analysis or visualization, Excel remains the superior product. Excel has more built-in formulas and functions.
Why Excel is better than Google Sheets?
While Google Sheets can fill and process approximately5,000,000 cells, Excel can handle 184 cells. So, Excel has a greater amount of storage space. Massive spreadsheets with complicated formulas and numerous tabs are easier for Excel to manage.
Can Excel convert to Google Sheets?
2.5 Convert Excel files to Sheets
• Open Driveand double-click an Excel file. A preview of your file opens.
• At the top, click Open with Google Sheets.
• Click File. Save as Google Sheets.
How do I export a spreadsheet to excel?
On the External Data tab, in the Export group, click Excel. In the Export – Excel Spreadsheet dialog box, review the suggested file name for the Excel workbook (Access uses the name of the source object). If you want, you can modify the file name. In the File Format box, select the file format that you want.
How do I export from Google Drive to excel?
From Google Drive, simply right click on a spreadsheet, and choose the Download option. Sheets will automatically convert this on the fly and output an XLSX (Excel spreadsheet) format file. Simply right click and choose Download to convert a Sheets file to the native Excel spreadsheet format.
How do I download multiple Google Docs?
With Google Drive, it is possible to download multiple files at once.
1. Go to the folder in Google Drive that contains the files you want to download.
2. Hold CTRL and click on the files you want to download.
3. Once you have selected the files you want, right click on the last file you selected and select download.
How do I export everything from Google Drive?
Access the tool from the myaccount.google.com or the Google Account icon in the upper right-hand corner then Manage your Google Account. From the home page click Start Transfer. Follow the three instructions. Select the content to copy and transfer.
Does Google Docs work with Excel?
Google Docs will let you natively edit Microsoft Word, Excel, and PowerPoint files soon.
How do I export from Google Sheets?
Basic setup
1. Navigate to the Look that you want to export to a Google Sheet. Click the gear menu and select Edit Settings.
2. Copy the function under Google Spreadsheet.
3. Paste the function into the upper-left cell of the Google spreadsheet where you would like your data to appear, and then press Enter.
How do I save a Google doc locally?
Save Google Docs, Sheets & Slides for offline use
1. On your computer, go to drive.google.com.
2. Right click the Google Docs, Sheets, or Slides file you want to save offline.
3. Turn on “Available offline.”
What is more powerful than Excel?
Google Sheets may be the most popular spreadsheet web app, but Zoho Sheet has more features. And it’s also completely free. It’s the best free Excel alternative, if you’re looking for the most powerful solution. Like Excel, Zoho Sheet really packs in the features.
|
{
"url": "https://www.clambaronline.com/how-do-i-export-a-spreadsheet/",
"source_domain": "www.clambaronline.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "47511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YNVZWJBN72I6CSX2ZNRQC4UU4QBFDGYL",
"WARC-Concurrent-To": "<urn:uuid:3be59d0a-f312-4205-a114-94336b17dac4>",
"WARC-Date": "2024-04-17T19:47:32Z",
"WARC-IP-Address": "104.21.52.248",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HDQBGHVBDBDICEZRSSD7PSW4IDHQ3PJL",
"WARC-Record-ID": "<urn:uuid:59ffd12c-3fe9-4c44-8179-26ae95a0474d>",
"WARC-Target-URI": "https://www.clambaronline.com/how-do-i-export-a-spreadsheet/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4ea1c00a-eaaa-4abf-9b69-9e57e0a4e65b>"
},
"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,
31,
32,
63,
64,
88,
89,
130,
162,
244,
310,
355,
356,
394,
395,
483,
521,
599,
723,
742,
743,
795,
796,
1103,
1104,
1144,
1145,
1390,
1391,
1427,
1428,
1462,
1463,
1539,
1586,
1625,
1626,
1666,
1667,
1977,
1978,
2022,
2023,
2317,
2318,
2358,
2359,
2429,
2430,
2514,
2574,
2685,
2686,
2732,
2733,
2983,
2984,
3018,
3019,
3108,
3109,
3145,
3146,
3158,
3159,
3274,
3323,
3462,
3463,
3499,
3500,
3550,
3551,
3598,
3681,
3715,
3716,
3750,
3751
],
"line_end_idx": [
31,
32,
63,
64,
88,
89,
130,
162,
244,
310,
355,
356,
394,
395,
483,
521,
599,
723,
742,
743,
795,
796,
1103,
1104,
1144,
1145,
1390,
1391,
1427,
1428,
1462,
1463,
1539,
1586,
1625,
1626,
1666,
1667,
1977,
1978,
2022,
2023,
2317,
2318,
2358,
2359,
2429,
2430,
2514,
2574,
2685,
2686,
2732,
2733,
2983,
2984,
3018,
3019,
3108,
3109,
3145,
3146,
3158,
3159,
3274,
3323,
3462,
3463,
3499,
3500,
3550,
3551,
3598,
3681,
3715,
3716,
3750,
3751,
4015
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4015,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3201911747455597,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014336920343339443,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20071685314178467,
"rps_doc_frac_unique_words": 0.3499999940395355,
"rps_doc_mean_word_length": 4.592647075653076,
"rps_doc_num_sentences": 91,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.822549819946289,
"rps_doc_word_count": 680,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06596221774816513,
"rps_doc_frac_chars_dupe_6grams": 0.06596221774816513,
"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.014409219846129417,
"rps_doc_frac_chars_top_3gram": 0.01536983996629715,
"rps_doc_frac_chars_top_4gram": 0.023054759949445724,
"rps_doc_books_importance": -338.5555725097656,
"rps_doc_books_importance_length_correction": -338.5555725097656,
"rps_doc_openwebtext_importance": -216.92539978027344,
"rps_doc_openwebtext_importance_length_correction": -216.92539978027344,
"rps_doc_wikipedia_importance": -109.71672821044922,
"rps_doc_wikipedia_importance_length_correction": -109.71672821044922
},
"fasttext": {
"dclm": 0.05409758910536766,
"english": 0.842250406742096,
"fineweb_edu_approx": 2.2577168941497803,
"eai_general_math": 0.02844678983092308,
"eai_open_web_math": 0.0984235405921936,
"eai_web_code": 0.004417059943079948
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"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,572,103,876,762,934,000 |
swim system
Started by MEGAMIND, Oct 02, 2018, 03:08 AM
Previous topic - Next topic
MEGAMIND
A bit updated and better swim system then previous version
function onScriptLoad()
{
swimming <- array(100,false)
I <- BindKey(true, 0x49,0,0); // forward
J <- BindKey(true, 0x4A,0,0); // left
K <- BindKey(true, 0x4B,0,0); // back
L <- BindKey(true, 0x4C,0,0); //right
O <- BindKey(true, 0x4F,0,0); //jump
}
function onPlayerHealthChange( player, lastHP, newHP )
{
if ( (player.Pos.z <= GetWaterLevel()) && (swimming[player.ID] == false))
{
MessagePlayer( "[#ff00ff]=======(Jump in Water)=======", player );
MessagePlayer( "[#ffffff]USE I, J, K, L, O for movement in water", player );
swimming[player.ID] = true
return true;
}
player.Health = 100;
player.SetAnim(0,149);
local vector1 = Vector ( player.Pos.x+10, player.Pos.y, player.Pos.z+5 ), vector2 = Vector ( player.Pos.x, player.Pos.y, player.Pos.z );
player.SetCameraPos( vector1, vector2 );
}
function onKeyDown( player, key )
{
if( key == I )
{
if ( player.Pos.z <= GetWaterLevel() ) {
player.Pos.x++;
}
}
if( key == J )
{
if ( player.Pos.z <= GetWaterLevel() ) {
player.Pos.y++;
}
}
if( key == K )
{
if ( player.Pos.z <= GetWaterLevel() ) {
player.Pos.x--;
}
}
if( key == L )
{
if ( player.Pos.z <= GetWaterLevel() ) {
player.Pos.y--;
}
}
//==jump out of water and change directions==============
if( key == O )
{
if ( player.Pos.z <= GetWaterLevel() ) {
player.Pos.z++;
player.RestoreCamera();
}
}
}
Features:
1.Everything is same (swimstyle , movement keys).
2.While swimming Screen camera moves like as if ur being spectated.
3.Players Glitching into falls and other stuff is fixed.
Credits: @UrbanY
QuoteTo avoid the abuse of players like evade among other things (Glitching everywhere..)
Sebastian
Dude. Keep every "swimming" system in one thread. No need to open 9999 topics about it.
UPDATE the topic, like everybody else in this world...
I will let you clean everything, and stick to one and only.
|
{
"url": "https://forum.vc-mp.org/index.php?topic=6317.msg43190",
"source_domain": "forum.vc-mp.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "21478",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FZF7PXZTHSJFV6F7DEYBJ6EL3DALF3M3",
"WARC-Concurrent-To": "<urn:uuid:1e7b8ff9-746d-48b5-bd22-d4c82b873a6d>",
"WARC-Date": "2024-07-15T10:56:12Z",
"WARC-IP-Address": "172.67.129.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PB4DEKPUF2CW3RS6SPGESAABOAGZXOFX",
"WARC-Record-ID": "<urn:uuid:b976451d-3ce7-4113-b5f1-bf18148fc38c>",
"WARC-Target-URI": "https://forum.vc-mp.org/index.php?topic=6317.msg43190",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef680d95-c91a-49ad-bb93-a768b1937ceb>"
},
"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-174\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,
2,
3,
15,
16,
60,
61,
89,
90,
99,
100,
159,
160,
184,
186,
215,
256,
294,
332,
370,
407,
409,
410,
465,
467,
541,
543,
610,
687,
714,
727,
729,
750,
773,
910,
951,
953,
954,
988,
990,
1005,
1007,
1048,
1065,
1074,
1076,
1091,
1093,
1134,
1155,
1164,
1166,
1181,
1183,
1224,
1240,
1243,
1245,
1260,
1262,
1303,
1320,
1329,
1331,
1332,
1390,
1405,
1407,
1448,
1465,
1489,
1491,
1493,
1495,
1505,
1555,
1623,
1680,
1681,
1698,
1788,
1789,
1799,
1800,
1888,
1943,
1944
],
"line_end_idx": [
2,
3,
15,
16,
60,
61,
89,
90,
99,
100,
159,
160,
184,
186,
215,
256,
294,
332,
370,
407,
409,
410,
465,
467,
541,
543,
610,
687,
714,
727,
729,
750,
773,
910,
951,
953,
954,
988,
990,
1005,
1007,
1048,
1065,
1074,
1076,
1091,
1093,
1134,
1155,
1164,
1166,
1181,
1183,
1224,
1240,
1243,
1245,
1260,
1262,
1303,
1320,
1329,
1331,
1332,
1390,
1405,
1407,
1448,
1465,
1489,
1491,
1493,
1495,
1505,
1555,
1623,
1680,
1681,
1698,
1788,
1789,
1799,
1800,
1888,
1943,
1944,
2003
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2003,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0.013979029841721058,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14638783037662506,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04562738165259361,
"rps_doc_frac_lines_end_with_ellipsis": 0.011494250036776066,
"rps_doc_frac_no_alph_words": 0.4885931611061096,
"rps_doc_frac_unique_words": 0.6071428656578064,
"rps_doc_mean_word_length": 5.901785850524902,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0.005703419912606478,
"rps_doc_unigram_entropy": 4.664154529571533,
"rps_doc_word_count": 224,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06051437184214592,
"rps_doc_frac_chars_dupe_6grams": 0.06051437184214592,
"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.05446292832493782,
"rps_doc_frac_chars_top_3gram": 0.11346445232629776,
"rps_doc_frac_chars_top_4gram": 0.05295008048415184,
"rps_doc_books_importance": -326.9285888671875,
"rps_doc_books_importance_length_correction": -326.9285888671875,
"rps_doc_openwebtext_importance": -147.5681915283203,
"rps_doc_openwebtext_importance_length_correction": -147.5681915283203,
"rps_doc_wikipedia_importance": -167.98504638671875,
"rps_doc_wikipedia_importance_length_correction": -167.98504638671875
},
"fasttext": {
"dclm": 0.17366790771484375,
"english": 0.6529316902160645,
"fineweb_edu_approx": 1.5163661241531372,
"eai_general_math": 0.5995416641235352,
"eai_open_web_math": 0.14839529991149902,
"eai_web_code": 0.8783990144729614
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "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,312,517,330,354,952,000 |
© 2016 Shmoop University, Inc. All rights reserved.
Types of Numbers
Types of Numbers
Comparing Decimals
When comparing decimal numbers to see which is bigger, first we look at the numbers before the decimal point. If one is greater than the other, we're done. Stick a fork in us. For example, 4.6248 is definitely bigger than 3.9998, because that 4 in front of the decimal point is bigger than 3.
If the numbers out front are identical (like with 0.4 and 0.562), we compare the tenths place. Since 4 is smaller than 5, we'd say that 0.4 is smaller than 0.562, or 0.4 < 0.562.
If the whole number and the tenths place digits are identical, just keep going till you can compare two digits in the same spot. For example, say we're comparing 0.2337 and 0.2318. Both decimals start with a 0, and both have a 2 in the tenths place and a 3 in the hundredths place. But when we get to the thousandths place, we have a 3 in 0.2337 and a 1 in 0.2318. Since 3 is bigger than 1, we can say 0.2337 > 0.2318.
BTW, adding extra zeros to the end of a decimal doesn't change its value at all: 08 = 080 = 0800 = etc. It just makes it longer and more annoyed. Trust us, you do not want to taunt or provoke a decimal.
People who Shmooped this also Shmooped...
|
{
"url": "http://www.shmoop.com/number-types/comparing-decimals.html",
"source_domain": "www.shmoop.com",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "39902",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UWLXY43SOJQZJVZ4WINOUCTEZBKWXLU6",
"WARC-Concurrent-To": "<urn:uuid:39a17d78-8b46-4139-9528-3c88b1519470>",
"WARC-Date": "2016-08-25T02:47:11Z",
"WARC-IP-Address": "204.232.154.6",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EB2UDI5VFH72YS2BYALEVITAWRE2YTJL",
"WARC-Record-ID": "<urn:uuid:a4bc1aef-5cde-4fdb-8d37-d6d801be942d>",
"WARC-Target-URI": "http://www.shmoop.com/number-types/comparing-decimals.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7e5803f7-8ece-410c-866f-6a4e2149215e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-153-172-175.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-36\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
52,
69,
70,
87,
88,
107,
108,
109,
402,
403,
582,
583,
1002,
1003,
1206,
1207
],
"line_end_idx": [
52,
69,
70,
87,
88,
107,
108,
109,
402,
403,
582,
583,
1002,
1003,
1206,
1207,
1248
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1248,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40453073382377625,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0032362500205636024,
"rps_doc_frac_lines_end_with_ellipsis": 0.05882352963089943,
"rps_doc_frac_no_alph_words": 0.32686084508895874,
"rps_doc_frac_unique_words": 0.5085470080375671,
"rps_doc_mean_word_length": 4.025640964508057,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.0032362500205636024,
"rps_doc_unigram_entropy": 4.504324436187744,
"rps_doc_word_count": 234,
"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.025477709248661995,
"rps_doc_frac_chars_top_3gram": 0.04458599165081978,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -173.29771423339844,
"rps_doc_books_importance_length_correction": -173.29771423339844,
"rps_doc_openwebtext_importance": -105.04198455810547,
"rps_doc_openwebtext_importance_length_correction": -105.04198455810547,
"rps_doc_wikipedia_importance": -101.11224365234375,
"rps_doc_wikipedia_importance_length_correction": -101.11224365234375
},
"fasttext": {
"dclm": 0.8122398257255554,
"english": 0.921621561050415,
"fineweb_edu_approx": 2.887434244155884,
"eai_general_math": 0.9749389290809631,
"eai_open_web_math": 0.14273464679718018,
"eai_web_code": 0.26340287923812866
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "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
|
-1,257,556,721,886,401,300 |
2014
03.15
freeradius
Wenn WPA2-PSK mit einem einzigen Kennwort nicht mehr für die WLAN-Sicherheit genügt, bietet sich der Einsatz von WPA2 Enterprise, also der Authentifikation mittels EAP und TLS an. Wie das auch im Heimnetzwerk mit einem DD-Wrt Router und einem RADIUS-Server geht, erklärt der folgende Artikel.
Installation
Zuerst wird FreeRADIUS-Server installiert. Dabei wird automatisch ein selbst-signiertes Zertifikat erzeugt, dass den Hostnamen des Servers enthält.
apt-get install freeradius
Wird der RADIUS-Server auf der Firewall installiert, muss er an die interne Netzwerkschnittstelle gebunden werden. Aber auch wenn das nicht der Fall ist, lohnt sich diese Sicherungsmaßnahme. Dafür werden in der Datei /etc/freeradius/radiusd.conf die zwei mit listen { beginnenden Blöcke bearbeitet und die beiden folgenden Konfigurationsanweisungen einkommentiert und mit den entsprechenden Werten gefüllt.
ipaddr = IPv4Intern
interface = ethIntern
Die Angabe zur IP-Adresse befindet sich für den auth Block um Zeile 273, für den acct Block um Zeile 316. Die Angabe zur Netzwerkschnittstelle befindet sich um Zeile 293 und Zeile 320.
Benutzernamenfilter
Folgend wird in der Datei /etc/freeradius/sites-enabled/default ein Sicherheitsfilter für Benutzernamen aktiviert, der dazu führt, dass Benutzernamen die mit Leerzeichen beginnen oder nicht von FreeRADIUS unterstützte Zeichenketten enthalten, nicht an den Authentifikationsmechanismus weitergegeben werden.
Um Zeile 79 Policy-Statement filter_username einkommentieren.
Client einrichten
Im nächsten Schritt wird die Zugriffsberechtigung und Authentifikation für den DD-Wrt Router eingerichtet. Der DD-Wrt Router wird als Client eingerichtet. Ein Client besteht aus einer Quell-IP, einem Gerätetyp und einem gemeinsamen secret. Bevor dies geschieht, sollte in der Datei /etc/freeradius/clients.conf um Zeile 101 das Kennwort für den lokalen Testzugriff auf den RADIUS-Server von testing123 auf einen geheimen Wert abgeändert werden.
Ist dies geschehen, kann die Konfiguration für den DD-Wrt Router an das Ende der Datei angefügt werden. Die IP-Adresse des DD-Wrt Routers ist in der Weboberfläche im Menü Status - LAN ablesbar. Das Format lautet wie folgt:
client dd-wrt {
ipaddr = 192.168.XXX.XXX
netmask = 32
secret = meinGeheimesKennwort
require_message_authenticator = no
nastype = other
}
Benutzer hinzufügen
Jetzt können die Benutzer an das Ende der Datei /etc/freeradius/users hinzugefügt werden. Das Format lautet wie folgt.
# Lokale User
user1 Password = "meinGeheimesKennwort"
DD-Wrt konfigurieren
Nach Neustart des FreeRADIUS-Servers mit dem Befehl /etc/init.d/freeradius restart kann der DD-Wrt Router konfiguriert werden. Im Menü WLAN – WLAN-Sicherheit kann der Radius gemeinsam mit dem secret eingetragen werden.
Bildschirmfoto - 13.03.2014 - 17:06:04
1 Kommentar
Kommentieren
1. […] veröffentliche regelmäßig Artikel zu Linux und IT-Sicherheit und lehne seit über vier Jahren jede kommerzielle Beeinflussung durch Werbung […]
Dein Kommentar
|
{
"url": "http://falkhusemann.de/blog/2014/03/wpa2-enterprise-mit-freeradius-und-dd-wrt-in-5-minuten/",
"source_domain": "falkhusemann.de",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "30158",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HQBOWWT3N7RE657NYNVHX6NIM72LZ3AW",
"WARC-Concurrent-To": "<urn:uuid:d84348d3-8d58-46bd-9870-bb3f7c66c377>",
"WARC-Date": "2015-03-30T12:51:42Z",
"WARC-IP-Address": "104.28.8.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5GXNKQWE7BFHFCGYPNAIV5DFK65VSIQP",
"WARC-Record-ID": "<urn:uuid:a6da4de1-ad4b-4635-a525-aa658314f2cb>",
"WARC-Target-URI": "http://falkhusemann.de/blog/2014/03/wpa2-enterprise-mit-freeradius-und-dd-wrt-in-5-minuten/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1c83814a-107c-4601-bdbf-3e69c3d517c3>"
},
"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,
5,
11,
12,
23,
316,
317,
330,
331,
479,
480,
508,
509,
916,
917,
937,
959,
960,
1145,
1146,
1166,
1167,
1474,
1475,
1537,
1538,
1556,
1557,
2002,
2003,
2226,
2227,
2243,
2276,
2297,
2335,
2378,
2406,
2408,
2409,
2429,
2430,
2549,
2550,
2564,
2607,
2608,
2629,
2630,
2849,
2888,
2889,
2901,
2902,
2915,
3067,
3068
],
"line_end_idx": [
5,
11,
12,
23,
316,
317,
330,
331,
479,
480,
508,
509,
916,
917,
937,
959,
960,
1145,
1146,
1166,
1167,
1474,
1475,
1537,
1538,
1556,
1557,
2002,
2003,
2226,
2227,
2243,
2276,
2297,
2335,
2378,
2406,
2408,
2409,
2429,
2430,
2549,
2550,
2564,
2607,
2608,
2629,
2630,
2849,
2888,
2889,
2901,
2902,
2915,
3067,
3068,
3082
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3082,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0.0009733900078572333,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03518519178032875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04629629850387573,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2351851910352707,
"rps_doc_frac_unique_words": 0.571794867515564,
"rps_doc_mean_word_length": 6.469230651855469,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.005555559881031513,
"rps_doc_unigram_entropy": 5.076281547546387,
"rps_doc_word_count": 390,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031708281487226486,
"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.021799450740218163,
"rps_doc_frac_chars_top_3gram": 0.011890609748661518,
"rps_doc_frac_chars_top_4gram": 0.014268729835748672,
"rps_doc_books_importance": -224.14974975585938,
"rps_doc_books_importance_length_correction": -224.14974975585938,
"rps_doc_openwebtext_importance": -134.6954803466797,
"rps_doc_openwebtext_importance_length_correction": -134.6954803466797,
"rps_doc_wikipedia_importance": -114.64087677001953,
"rps_doc_wikipedia_importance_length_correction": -114.64087677001953
},
"fasttext": {
"dclm": 0.9074076414108276,
"english": 0.0014492700574919581,
"fineweb_edu_approx": 1.8743770122528076,
"eai_general_math": 0.007504520006477833,
"eai_open_web_math": 0.35275453329086304,
"eai_web_code": 0.31775015592575073
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "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,227,031,006,000,800,000 |
Jump to content
• Advertisement
Sign in to follow this
hakura88
Use django python for a small browser game?
This topic is 735 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.
If you intended to correct an error in the post then please contact us.
Recommended Posts
hello forum,
I want to know your feedback about an idea that I have. I know python html css and javascript. My idea is to make a browsergame with django and postgres/mongoDB as database. Has django enough power for a project like that? I wanted to start small with a normal user login and that the user can do some stuff after login, like run some actions .
thank you
Share this post
Link to post
Share on other sites
Advertisement
It's a bit hard to say if it will do the job without knowing what kind of game you are thinking about and what sort of operations your backend will need to do. However, the tech stack is rarely the bottleneck in a small game that doesn't have thousands of concurrent users, and, anyway, python has been successfully used in game backends before, so you should be fine.
Edited by Avalander
Share this post
Link to post
Share on other sites
An alternative could be to use a plain http server, likel Flask or Bottle, and perhaps program a REST API to communicate with the browser.
I cannot really compare that solution with Django, as I have no knowledge about the latter at all.
From what I have heard, my alternative starts at a lower level with complete freedom in how and what you communicate between the server and the browser, at the cost of having nothing prepared for you. It's more "start with HTTP requests, and go from there".
Share this post
Link to post
Share on other sites
hello forum,
I want to know your feedback about an idea that I have. I know python html css and javascript. My idea is to make a browsergame with django and postgres/mongoDB as database. Has django enough power for a project like that? I wanted to start small with a normal user login and that the user can do some stuff after login, like run some actions .
thank you
Personally I like Flask better, specially for a small project. Flask is much simpler and actually designed for smaller projects.
If you like this idea, you can use for the login this module: https://flask-login.readthedocs.io/en/latest/
As for the database, if you want to go really simple, you can use sqlite. It is very, very simple and you can use from scratch (comes with python by default). Regardless of the database you pick, you can use SQLAlchemy as ORM: http://flask-sqlalchemy.pocoo.org/2.1/ with the advantage that you can change the database you use with no changes to your code.
Share this post
Link to post
Share on other sites
thanks guys, I will try to make something with the flask framework. I start with a very very small project to test it out.
Edited by stee
Share this post
Link to post
Share on other sites
Flask's a nightmare once you try and actually structure any reasonably-sized program. That's what happens when you base a framework around globals thread-local variables. My next Python web project will probably use Django.
But any web server framework will have 100x more 'power' than you need if you're just talking about simple turn-based actions. And if you're talking about quicker actions, that will be handled client-side anyway so the web server matters little.
Postgres/mongoDB are obviously 2 separate databases and they have quite different modes of operation. If you know this already, fine. If you're not sure, I recommend postgres if you're hoping to deploy this to other people (because it's robust), and mongo if you're just tinkering, at least to begin with (because it's very easy to get started with).
Share this post
Link to post
Share on other sites
Sign in to follow this
• Advertisement
×
Important Information
By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.
GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.
Sign me up!
|
{
"url": "https://www.gamedev.net/forums/topic/684446-use-django-python-for-a-small-browser-game/",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "201104",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IQ5X45INCTYPWXSOY4Q3A4A4HPRH5CS7",
"WARC-Concurrent-To": "<urn:uuid:1746a477-3b47-4545-914e-c9af9b234b9f>",
"WARC-Date": "2018-12-17T11:47:55Z",
"WARC-IP-Address": "130.211.24.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I7ND7EGTRI622LTTVC7ZGIWDNMWHCGPQ",
"WARC-Record-ID": "<urn:uuid:f6593803-0eae-4ef0-8361-11a3ec39c550>",
"WARC-Target-URI": "https://www.gamedev.net/forums/topic/684446-use-django-python-for-a-small-browser-game/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b6737129-ad83-425e-a20e-fc3630807509>"
},
"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-237-242-155.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,
16,
34,
59,
68,
69,
113,
114,
233,
234,
306,
307,
325,
326,
339,
684,
694,
695,
711,
712,
713,
726,
747,
761,
762,
1131,
1132,
1152,
1153,
1169,
1170,
1171,
1184,
1205,
1206,
1345,
1346,
1348,
1349,
1448,
1449,
1707,
1708,
1724,
1725,
1726,
1739,
1760,
1761,
1774,
2119,
2129,
2130,
2132,
2133,
2262,
2263,
2371,
2372,
2729,
2730,
2746,
2747,
2748,
2761,
2782,
2783,
2906,
2907,
2922,
2923,
2939,
2940,
2941,
2954,
2975,
2976,
3200,
3201,
3203,
3204,
3450,
3451,
3453,
3454,
3805,
3806,
3822,
3823,
3824,
3837,
3858,
3883,
3884,
3902,
3904,
3905,
3927,
3928,
4023,
4024,
4191,
4192
],
"line_end_idx": [
16,
34,
59,
68,
69,
113,
114,
233,
234,
306,
307,
325,
326,
339,
684,
694,
695,
711,
712,
713,
726,
747,
761,
762,
1131,
1132,
1152,
1153,
1169,
1170,
1171,
1184,
1205,
1206,
1345,
1346,
1348,
1349,
1448,
1449,
1707,
1708,
1724,
1725,
1726,
1739,
1760,
1761,
1774,
2119,
2129,
2130,
2132,
2133,
2262,
2263,
2371,
2372,
2729,
2730,
2746,
2747,
2748,
2761,
2782,
2783,
2906,
2907,
2922,
2923,
2939,
2940,
2941,
2954,
2975,
2976,
3200,
3201,
3203,
3204,
3450,
3451,
3453,
3454,
3805,
3806,
3822,
3823,
3824,
3837,
3858,
3883,
3884,
3902,
3904,
3905,
3927,
3928,
4023,
4024,
4191,
4192,
4203
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4203,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46198156476020813,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021889399737119675,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13824884593486786,
"rps_doc_frac_unique_words": 0.39142462611198425,
"rps_doc_mean_word_length": 4.558783054351807,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.117794990539551,
"rps_doc_word_count": 723,
"rps_doc_frac_chars_dupe_10grams": 0.24878640472888947,
"rps_doc_frac_chars_dupe_5grams": 0.2597087323665619,
"rps_doc_frac_chars_dupe_6grams": 0.24878640472888947,
"rps_doc_frac_chars_dupe_7grams": 0.24878640472888947,
"rps_doc_frac_chars_dupe_8grams": 0.24878640472888947,
"rps_doc_frac_chars_dupe_9grams": 0.24878640472888947,
"rps_doc_frac_chars_top_2gram": 0.016383500769734383,
"rps_doc_frac_chars_top_3gram": 0.0236650500446558,
"rps_doc_frac_chars_top_4gram": 0.030946599319577217,
"rps_doc_books_importance": -393.00067138671875,
"rps_doc_books_importance_length_correction": -393.00067138671875,
"rps_doc_openwebtext_importance": -215.05108642578125,
"rps_doc_openwebtext_importance_length_correction": -215.05108642578125,
"rps_doc_wikipedia_importance": -146.64181518554688,
"rps_doc_wikipedia_importance_length_correction": -146.64181518554688
},
"fasttext": {
"dclm": 0.027589980512857437,
"english": 0.933793842792511,
"fineweb_edu_approx": 1.1497708559036255,
"eai_general_math": 0.03578704968094826,
"eai_open_web_math": 0.07645226269960403,
"eai_web_code": 0.0003206699911970645
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,159,503,144,026,283,000 |
ChiliProject is not maintained anymore. Please be advised that there will be no more updates.
We do not recommend that you setup new ChiliProject instances and we urge all existing users to migrate their data to a maintained system, e.g. Redmine. We will provide a migration script later. In the meantime, you can use the instructions by Christian Daehn.
[HowTo] Project Documents and Project Files
Added by Chili Fan at 2012-07-31 06:08 pm
I did searched to figure out Documents purpose of project, I added files for both User and Technical Documentation and selected a "Watcher"
I noticed those files are get stored into databasee of ChiliProject therefore a file limit of 5MB is set per file, don't know if it has also a Space file limit for the whole "Documents" section, i noticed uploading empty files is unallowed that is good
I think general the pupose is to store a couple of small Raw files directly related to project for some reason to be usefull
What is purpose of a "Watcher" receive an email when a document gets deleted or added ?
i did not receive any message for those actions for the "Watchers"
Can we add as many files as we want ?
Can we increase the 05MB upload limit of any file ?
Could it be usefull to have a ddMB upload limit of for the whole Documents section which also can be increased or decreased if needed ?
Replies (3)
RE: [HowTo] Project Documents - Added by Holger Just at 2012-07-31 06:26 pm
Chili Fan wrote:
I noticed those files are get stored into databasee of ChiliProject
The actual files are stored on disk, not in the database. The default location is in the files directory of your ChiliProject installation
therefore a file limit of 5MB is set per file
The maximim attachment size can be configured under More -> Administration -> Settings -> General -> Attachment max. size. Depending on the webserver you use, you might have to configure this one too to allow larger uploads (e.g. when using Nginx)
don't know if it has also a Space file limit for the whole "Documents" section
No, each attachment has its own size limit.
What is purpose of a "Watcher" receive an email when a document gets deleted or added ?
The default configuration only sends notifications for a subset of all available events. See Administration -> Settings -> Email notifications.
Can we add as many files as we want ?
Yes.
Can we increase the 05MB upload limit of any file ?
See above.
*Could it be usefull to have a ddMB upload limit of for the whole Documents section which also can be increased or decreased if needed ?
I don't see a real usecase for that.
RE: [HowTo] Project Documents - Added by Chili Fan at 2012-07-31 06:56 pm
Hi Holger
Thanks for all answer i found them now (i overlooked them first), now i understand the "Watcher" only for file gets added at Project Documents (maybe introduce delete too) i received the file add notify messaage
Very nice the Files gets stored on Disk, (i asked this due i delete file from upload location still file can be downloaded)
RE: [HowTo] Project Documents and ProjectFiles - Added by Chili Fan at 2012-07-31 08:20 pm
Files
Is it an idea to store Files at files folder in a more structured way, by First creating a FolderName: "project-id" if this Folder UnExist ?
The "project-id" can be used i think in all cases due it't policy is it never gets changed
Is it supported that multiple users can download files at the same time by multiple threads at server side ?
At CP Files i noticed a Container icon by label 3.3.0 has been placed (Nice) how can this be done ?
This Container label links to Roadmap how can we activate Roadmap ?
I checked all permissions but Roadmap still not displayed
Regards
(1-3/3)
|
{
"url": "https://www.chiliproject.org/boards/1/topics/2013?r=2018",
"source_domain": "www.chiliproject.org",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "17389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KZNI2MXWGPOWJG6YVFMMX3BP7GHQQLOI",
"WARC-Concurrent-To": "<urn:uuid:ad544a26-dd14-4dd7-955c-1e34cc056f7a>",
"WARC-Date": "2019-12-10T01:40:44Z",
"WARC-IP-Address": "5.9.225.243",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3JMTCK4B3NQJN3QLSHAXHDUFUUDGU34B",
"WARC-Record-ID": "<urn:uuid:12ddee78-284a-4919-aaab-07dbdb683c77>",
"WARC-Target-URI": "https://www.chiliproject.org/boards/1/topics/2013?r=2018",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a0f6fa9-7674-4b9e-9d84-ea376ca07331>"
},
"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-73.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,
94,
95,
356,
357,
401,
402,
444,
445,
585,
838,
839,
964,
965,
966,
1054,
1121,
1122,
1160,
1161,
1213,
1214,
1350,
1351,
1352,
1364,
1365,
1441,
1442,
1459,
1460,
1528,
1529,
1668,
1669,
1715,
1716,
1964,
1965,
2044,
2045,
2089,
2090,
2178,
2179,
2323,
2324,
2362,
2363,
2368,
2369,
2421,
2422,
2433,
2434,
2571,
2572,
2609,
2610,
2684,
2685,
2695,
2696,
2908,
2909,
3033,
3034,
3125,
3126,
3132,
3133,
3274,
3365,
3366,
3475,
3476,
3576,
3577,
3645,
3703,
3704,
3712,
3713,
3721,
3722
],
"line_end_idx": [
94,
95,
356,
357,
401,
402,
444,
445,
585,
838,
839,
964,
965,
966,
1054,
1121,
1122,
1160,
1161,
1213,
1214,
1350,
1351,
1352,
1364,
1365,
1441,
1442,
1459,
1460,
1528,
1529,
1668,
1669,
1715,
1716,
1964,
1965,
2044,
2045,
2089,
2090,
2178,
2179,
2323,
2324,
2362,
2363,
2368,
2369,
2421,
2422,
2433,
2434,
2571,
2572,
2609,
2610,
2684,
2685,
2695,
2696,
2908,
2909,
3033,
3034,
3125,
3126,
3132,
3133,
3274,
3365,
3366,
3475,
3476,
3576,
3577,
3645,
3703,
3704,
3712,
3713,
3721,
3722,
3723
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3723,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.393085777759552,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019206149503588676,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1843789964914322,
"rps_doc_frac_unique_words": 0.39531248807907104,
"rps_doc_mean_word_length": 4.525000095367432,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.082285404205322,
"rps_doc_word_count": 640,
"rps_doc_frac_chars_dupe_10grams": 0.25621548295021057,
"rps_doc_frac_chars_dupe_5grams": 0.3190607726573944,
"rps_doc_frac_chars_dupe_6grams": 0.3190607726573944,
"rps_doc_frac_chars_dupe_7grams": 0.2748618721961975,
"rps_doc_frac_chars_dupe_8grams": 0.2748618721961975,
"rps_doc_frac_chars_dupe_9grams": 0.2748618721961975,
"rps_doc_frac_chars_top_2gram": 0.014502760022878647,
"rps_doc_frac_chars_top_3gram": 0.029005520045757294,
"rps_doc_frac_chars_top_4gram": 0.027624310925602913,
"rps_doc_books_importance": -344.0322265625,
"rps_doc_books_importance_length_correction": -344.0322265625,
"rps_doc_openwebtext_importance": -183.10301208496094,
"rps_doc_openwebtext_importance_length_correction": -183.10301208496094,
"rps_doc_wikipedia_importance": -218.7807159423828,
"rps_doc_wikipedia_importance_length_correction": -218.7807159423828
},
"fasttext": {
"dclm": 0.030990660190582275,
"english": 0.9291667342185974,
"fineweb_edu_approx": 1.1388065814971924,
"eai_general_math": 0.6397165656089783,
"eai_open_web_math": 0.4816931486129761,
"eai_web_code": 0.07818388938903809
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,560,010,279,353,377,000 |
MYSTERY ZILLION တွင် English သို့မဟုတ် Unicode ဖြင့်သာ အသုံးပြုခွင့်ရှိသည်။ ဇော်ဂျီ ၊ ဧရာ စသည်တို့ကို အသုံးပြုခွင့် မရှိ။ Unicode fonts များမှာ Mon3,Yunghkio, Myanamr3 စသည်များ အသုံးပြုနိုင်သည်။ Unicode Guide ကို ဒီမှာ Download ချပါ။ Zawgyi to Unicode Converter
Don't share ebook or software if nobody request. You can find free book websites on here. We are welcome for discussion or asking question instead.
Myanmar's MPT internet connection မှာ proxy မသုံးချင်ရင် ဘယ်လို .....
edited February 2012 in Internet & Email
MZ မှ ညီအကို ညီအမ များခင်ဗျား...
ကျွန်တော်မှာ ခက်နေတာလေး တစ်ခုရှိတယ်ဗျ..
မြန်မာပြည်မှာ MPT connection ကိုသုံးရင် သိကြတဲ့အတိုင်း internet browser မှာ proxy server ထည့်ရတယ် ကျွန်တော်က proxy ကို မသုံးချင်ဘူး
Gateway တစ်ခုထားပြီး Internet Browser မှာ No proxy နဲ့ တန်းထွက်ချင်တယ်
စမ်းမိတာ တစ်ခုကတော့ Zentyal Gateway ကိုသုံးတော့ transparent proxy က http protocol တွေဘဲ အဆင်ပြေတယ် https တွေ မထွက်တော့ဘူး
ညီအကို ညီအမများ အဲလိုမျိုးသုံးလို့ ရသလား မသိဘူးဗျာ...
Tagged:
မှတ်ချက်များ
• edited February 2012 Registered Users
Create a file called config.pac @ C:\config.pac with the following.
function FindProxyForURL(url, host)
{return "PROXY proxy.ygncache.mpt.net.mm:8080; DIRECT";}
Go to proxy settings->Automatic configuration url-> file:///C:\config.pac
• Registered Users
I known from Ko Zaw Lin.
• Registered Users
koaungzawlatt ပြောပေးတာ ကျေးဇူးတင်ပါတယ်
ကျွန်တော်က proxy ကို မသုံးချင်တာ auto detect proxy နဲ့လဲ မသုံးချင်တော့ အဲလိုမျိုးဆို လဲ အဆင် မပြေသေးဘူးဗျ Client Browser မှာ ဘာမှ မပြင်ဘဲနဲ့ (auto detect) လဲ မလုပ်ဘဲနဲ့ သုံးချင်တာ
ဥပမာ. ကျွန်တော်က Gateway တစ်ခုထားမယ် (hardware or software router တစ်ခုခု) Client Gateway ကို ထည့်ထားမယ် Browser မှာ No Proxy ထားပြီး သုံးလို့ ရမယ် ရနိုင် မရနိုင်တော့ မသိပါဘူး စိတ်ကူးကြည့်တာ (MPT connection မှာ)
:)
• Registered Users
You can use www.ultrasurf.en.softonic.com/ and proxy switcher Add-ons on your browser.
Please try it.
• Registered Users
@wplay12,
hmm...the following is what may work. if you are the curious type or feel that you do not fully understand the following or why it might work, it would help to know 1)networking basics(OSI model) 2)how to search for RFCs(standard protocol descriptions on which almost the entire internet is based. http 1.1 -> http://www.w3.org/Protocols/rfc2616/rfc2616.html). i think you already have a good feel around it so..i may be being redundant here :).
i am assuming here that mpt proxy's open ports(not what you have to type in which is 8080) are 443,80 and 21 only. Another assumption is that it's squid proxy.
Since this is your gateway into internet, you MUST go through this irregardless of whatever is used between you and that gateway. Whether you are changing the browser's proxy or putting hardware/software routers, you would still have to use that proxy information somewhere. And the problem with that is a large majority of services that uses(or dependant on)it will fail.
Two reasons for failure:
1)squid is a HTTP proxy with limited support for other kind of protocols and they must be manually enabled in squid config. a simplified way to think of why it doesnt work is to imagine trying to talk in ssh over port 80. it's roughly translated as "GET ssh://user:[email protected]:80", which is nonsense to the ssh server because it doesnt understand the GET command.
However, there is an exception in http specification that will allow any kind of talk. It's HTTP CONNECT. https(443) requires it to work. squid will first establish a tcp connection to the target server and then it will simply transfer any data regardless of protocol.
2) target port. even if the protocol problem is solved, squid will still limit access to other ports. Solution is to have a remote server that can translate the request coming through port 443.
Looks like this.
You--->HTTP CONNECT via proxy:443--->yourserver:443--->actual target.
This process is generally called "tunneling". There are partial solutions that can work for limited scanarios. I am not going to talk about those(eg:ssh port forwarding). The followings can(i think)work for all cases.i also leave out long how-tos due to laziness. you can google them or ask specific questions later :D.
Proxy Method
========
Require:
* a standard proxy installed on local machine(squid is an example)
* a remote proxy that is listening on port 443 and allow HTTP CONNECT(unusual configuration so you may need to set up your own, free proxy lists exist but ~99% are on 80,3128,8080)
VPN Method
=======
Note:
* VPN is not a protocol. many things call themselves VPN. i refer to openvpn implementation cos AFAIK it's the only opensource and free implementation
Require:
* a local vpn client OR
** a router that supports both VPN and proxy. these features may be added via firmwares(ddwrt,tomato). useful for internet cafe owners.
Packet translator Method
===============
This method may be the simplest way to get it done.
These use some form of vpn implementation or proprietary protocols to translate data packets and come in pairs:an encoder client and a decoder server.
Disadvantages:
* you are restricted to using their servers(whereas squid or vpn you can use any servers)
* you usually have to pay or the service quality will be limited.
Advantages:
* almost all of them encode via http(will work as long as you can view any web page) and usually work out of the box
Examples:
* www.http-tunnel.com
* www.hopster.com
* www.your-freedom.net
* http://vpnreviewz.com/best-vpn-service-providers/
Useful tools
=======
* Proxifer(best)
** not required, but without it you cannot use "no proxy" in the browser config(in most cases any way)
** http://alternativeto.net/software/proxifier/
* putty
* telnet
.
• Registered Users
i forgot to mention "the onion router" or tor. it's a p2p based relaying protocol. i am not too sure whether it will work but i think it will with major bandwidth decrease. this is different from all the above because it is designed from ground up to be untraceble. however,flaws have been noted and a newer protocol called "phantom" was proposed. i am not sure whether there is any real working implementation of that.
Sign In or Register to comment.
|
{
"url": "https://archive.mysteryzillion.org/discussion/11497/myanmars-mpt-internet-connection-%E1%80%99%E1%80%BE%E1%80%AC-proxy-%E1%80%99%E1%80%9E%E1%80%AF%E1%80%B6%E1%80%B8%E1%80%81%E1%80%BB%E1%80%84%E1%80%BA%E1%80%9B%E1%80%84%E1%80%BA-%E1%80%98%E1%80%9A%E1%80%BA%E1%80%9C%E1%80%AD%E1%80%AF",
"source_domain": "archive.mysteryzillion.org",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "73664",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SSNERW7EQ74OB7XSQ3H23DHFVEGTU5QP",
"WARC-Concurrent-To": "<urn:uuid:cd1d6b97-55e1-4092-b40a-3f2483d73fd9>",
"WARC-Date": "2019-08-17T23:20:34Z",
"WARC-IP-Address": "104.28.8.89",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JLB6BZZDFSJN7RY4P3BI4V5XZQ2EEIGH",
"WARC-Record-ID": "<urn:uuid:e43e23bb-268f-4663-8af8-18f736d7e3ac>",
"WARC-Target-URI": "https://archive.mysteryzillion.org/discussion/11497/myanmars-mpt-internet-connection-%E1%80%99%E1%80%BE%E1%80%AC-proxy-%E1%80%99%E1%80%9E%E1%80%AF%E1%80%B6%E1%80%B8%E1%80%81%E1%80%BB%E1%80%84%E1%80%BA%E1%80%9B%E1%80%84%E1%80%BA-%E1%80%98%E1%80%9A%E1%80%BA%E1%80%9C%E1%80%AD%E1%80%AF",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7b7fd80d-f77a-4924-a8de-76ff7595fb88>"
},
"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-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,
262,
410,
411,
481,
482,
523,
556,
557,
597,
598,
730,
731,
802,
803,
926,
927,
981,
989,
990,
1003,
1004,
1046,
1118,
1119,
1159,
1220,
1298,
1319,
1348,
1369,
1413,
1414,
1598,
1599,
1815,
1822,
1843,
1934,
1953,
1974,
1988,
2438,
2439,
2603,
2604,
2981,
2982,
3011,
3385,
3658,
3659,
3857,
3858,
3879,
3953,
3954,
4278,
4279,
4296,
4309,
4322,
4393,
4578,
4579,
4594,
4606,
4616,
4771,
4784,
4812,
4952,
4953,
4982,
5002,
5058,
5059,
5214,
5215,
5234,
5328,
5398,
5399,
5415,
5536,
5537,
5551,
5577,
5599,
5626,
5682,
5683,
5700,
5712,
5733,
5840,
5892,
5904,
5917,
5918,
5919,
5920,
5921,
5922,
5923,
5929,
5950,
6374
],
"line_end_idx": [
262,
410,
411,
481,
482,
523,
556,
557,
597,
598,
730,
731,
802,
803,
926,
927,
981,
989,
990,
1003,
1004,
1046,
1118,
1119,
1159,
1220,
1298,
1319,
1348,
1369,
1413,
1414,
1598,
1599,
1815,
1822,
1843,
1934,
1953,
1974,
1988,
2438,
2439,
2603,
2604,
2981,
2982,
3011,
3385,
3658,
3659,
3857,
3858,
3879,
3953,
3954,
4278,
4279,
4296,
4309,
4322,
4393,
4578,
4579,
4594,
4606,
4616,
4771,
4784,
4812,
4952,
4953,
4982,
5002,
5058,
5059,
5214,
5215,
5234,
5328,
5398,
5399,
5415,
5536,
5537,
5551,
5577,
5599,
5626,
5682,
5683,
5700,
5712,
5733,
5840,
5892,
5904,
5917,
5918,
5919,
5920,
5921,
5922,
5923,
5929,
5950,
6374,
6405
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6405,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0.00031226000282913446,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.262727826833725,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018856069073081017,
"rps_doc_frac_lines_end_with_ellipsis": 0.0277777798473835,
"rps_doc_frac_no_alph_words": 0.44374606013298035,
"rps_doc_frac_unique_words": 0.5121412873268127,
"rps_doc_mean_word_length": 5.394039630889893,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.0025141399819403887,
"rps_doc_unigram_entropy": 5.665803909301758,
"rps_doc_word_count": 906,
"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.018416209146380424,
"rps_doc_frac_chars_top_3gram": 0.016369959339499474,
"rps_doc_frac_chars_top_4gram": 0.006957230158150196,
"rps_doc_books_importance": -737.3007202148438,
"rps_doc_books_importance_length_correction": -737.3007202148438,
"rps_doc_openwebtext_importance": -444.6103515625,
"rps_doc_openwebtext_importance_length_correction": -444.6103515625,
"rps_doc_wikipedia_importance": -303.4543151855469,
"rps_doc_wikipedia_importance_length_correction": -303.4543151855469
},
"fasttext": {
"dclm": 0.055553968995809555,
"english": 0.6550450325012207,
"fineweb_edu_approx": 1.8327257633209229,
"eai_general_math": 0.21439319849014282,
"eai_open_web_math": 0.23742598295211792,
"eai_web_code": 0.38195133209228516
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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
|
-1,568,961,271,025,536,300 |
POP3 protocol
IMAP vs POP3 protocol
IMAP vs POP3 protocol
IMAP (Internet Messaging Access Protocol) and POP3 (Post Office Protocol) are two different standard protocols for reading emails stored on remote computers. IMAP keeps the mails on the server. On the other...
Most Searched in Environment Most Searched in Education and References
Most Searched in Health Most Searched in Electronics
Braxton Hicks vs Labour Contraction
Pronunciation vs Accent
Anxiety vs Nervousness
POP vs IMAP protocol
|
{
"url": "https://www.differencebetween.info/tags/pop3-protocol",
"source_domain": "www.differencebetween.info",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "34487",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PIHSDJD5GG72YUZWQAFJUJPIIAYGY7WH",
"WARC-Concurrent-To": "<urn:uuid:1492d6ce-c15b-4de2-bbbc-4375ed169002>",
"WARC-Date": "2022-10-07T02:28:18Z",
"WARC-IP-Address": "172.67.134.7",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6VPRMD7IF2HH5TGFSSELXJTUOB2FK2EK",
"WARC-Record-ID": "<urn:uuid:ca9bc45e-3aa1-48ce-b896-4d311cc702e6>",
"WARC-Target-URI": "https://www.differencebetween.info/tags/pop3-protocol",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0cece837-041e-4c9f-b166-b25f858e5820>"
},
"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-70\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
37,
38,
60,
270,
271,
342,
395,
431,
455,
478
],
"line_end_idx": [
14,
15,
37,
38,
60,
270,
271,
342,
395,
431,
455,
478,
498
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 498,
"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.2804878056049347,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12195122241973877,
"rps_doc_frac_lines_end_with_ellipsis": 0.07692307978868484,
"rps_doc_frac_no_alph_words": 0.08536584675312042,
"rps_doc_frac_unique_words": 0.5866666436195374,
"rps_doc_mean_word_length": 5.493333339691162,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0.012195119634270668,
"rps_doc_unigram_entropy": 3.521394968032837,
"rps_doc_word_count": 75,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12621359527111053,
"rps_doc_frac_chars_dupe_6grams": 0.12621359527111053,
"rps_doc_frac_chars_dupe_7grams": 0.12621359527111053,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.11650484800338745,
"rps_doc_frac_chars_top_3gram": 0.13592232763767242,
"rps_doc_frac_chars_top_4gram": 0.08737864345312119,
"rps_doc_books_importance": -45.73691177368164,
"rps_doc_books_importance_length_correction": -54.745792388916016,
"rps_doc_openwebtext_importance": -26.82868194580078,
"rps_doc_openwebtext_importance_length_correction": -35.83755874633789,
"rps_doc_wikipedia_importance": -21.985261917114258,
"rps_doc_wikipedia_importance_length_correction": -30.994140625
},
"fasttext": {
"dclm": 0.5853617787361145,
"english": 0.739971935749054,
"fineweb_edu_approx": 2.469076633453369,
"eai_general_math": 0.012986719608306885,
"eai_open_web_math": 0.09466308355331421,
"eai_web_code": 0.0013620899990200996
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "1",
"label": "Remember"
}
},
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-1,156,758,485,665,163,300 |
215
I am junior developer among seniors and am struggling a lot with understanding their thinking, reasoning.
I am reading Domain-Driven Design (DDD) and can't understand why we need to create so many classes. If we follow that method of designing software we end up with 20-30 classes which can be replaced with at most two files and 3-4 functions. Yes, this could be messy, but it's a lot more maintainable and readable.
Anytime I want to see what some kind of EntityTransformationServiceImpl does, I need to follow lots of classes, interfaces, their function calls, constructors, their creation and so on.
Simple math:
• 60 lines of dummy code vs 10 classes X 10 (let's say we have totally different such logics) = 600 lines of messy code vs. 100 classes + some more to wrap and manage them; do not forget to add dependency injection.
• Reading 600 lines of messy code = one day
• 100 classes = one week, still forget which one does what, when
Everyone is saying it's easy to maintain, but for what? Every time you add new functionality, you add five more classes with factories, entities, services, and values. I feel like this kind of code moves a lot slower than messy code.
Let's say, if you write 50K LOC messy code in one month, the DDD thing requires lots of reviews and changes (I do not mind tests in both cases). One simple addition can take week if not more.
In one year, you write lots of messy code and even can rewrite it multiple times, but with DDD style, you still do not have enough features to compete with messy code.
Please explain. Why do we need this DDD style and lots of patterns?
UPD 1: I received so many great answers, can you guys please add comment somewhere or edit your answer with the link for reading list (not sure from which to start, DDD, Design Patterns, UML, Code Complete, Refactoring, Pragmatic ,... so many good books), of course with sequence, so that I can also start understanding and become senior as some of you do.
• 82
I think there is a good question here but it's hiding behind hyperbole and frustration. @user1318496, you might benefit from rephrasing your question a bit. – MetaFight Apr 10 '18 at 16:42
• 50
At the risk of stepping on toes, because your language sucks. Don't take that for more than it is: a sucky language is often the correct technical choice for a variety of reasons, but that doesn't make it non-sucky. As for your actual question, correctness is more important than readability. Or to put that slightly differently: readability matters insofar as in enables reasoning about correctness. So which is easier to test, your 100 classes or your monolithic god class? I'm betting 100 simple classes. – Jared Smith Apr 10 '18 at 19:27
• 87
"Yes this could be messy, but its a lot more maintainable and readable.". If its messy, how can it be readable and maintainable? – Polygnome Apr 10 '18 at 19:56
• 37
@Polygnome: I was about to type the exact same comment. Another choice comment characteristic of junior developers is "I feel like this kind of code moves a lot slower then messy code." It does you no good to run as fast as you can if you spend half your time running into walls! Slow is smooth, smooth is fast. – Eric Lippert Apr 10 '18 at 20:07
• 41
You don't, unless you're doing Java. When all you have is Java, everything looks like a class. – hobbs Apr 11 '18 at 6:27
11 Answers 11
338
This is an optimization problem
A good engineer understands that an optimization problem is meaningless without a target. You can't just optimize, you have to optimize for something. For example, your compiler options include optimizing for speed and optimizing for code size; these are sometimes opposite goals.
I like to tell my wife that my desk is optimized for adds. It's just a pile, and it's very easy to add stuff. My wife would prefer it if I optimized for retrieval, i.e. organized my stuff a bit so I can find things. This makes it harder, of course, to add.
Software is the same way. You can certainly optimize for product creation-- generate a ton of monolithic code as quickly as possible, without worrying about organizing it. As you have already noticed, this can be very, very fast. The alternative is to optimize for maintenance-- make creation a touch more difficult, but make modifications easier or less risky. That is the purpose of structured code.
I would suggest that a successful software product will be only created once but modified many, many times. Experienced engineers have seen unstructured code bases take on a life of their own and become products, growing in size and complexity, until even small changes are very difficult to make without introducing huge risk. If the code were structured, risk can be contained. That is why we go to all this trouble.
Complexity comes from relations, not elements
I notice in your analysis you are looking at quantities-- amount of code, number of classes, etc. While these are sort of interesting, the real impact comes from relations between elements, which explodes combinatorially. For example, if you have 10 functions and no idea which depends on which, you have 90 possible relations (dependencies) you have to worry about-- each of the ten functions might depend on any of the nine other functions, and 9 x 10 = 90. You might have no idea which functions modify which variables or how data gets passed around, so coders have a ton of things to worry about when solving any particular problem. In contrast, if you have 30 classes but they are arranged cleverly, they can have as few as 29 relations, e.g. if they are layered or arranged in a stack.
How does this affect your team's throughput? Well, there are fewer dependencies, the problem is much more tractable; coders don't have to juggle a zillion things in their head whenever they make a change. So minimizing dependencies can be a huge boost to your ability to reason about a problem competently. That is why we divide things into classes or modules, and scope variables as tightly as possible, and use SOLID principles.
• 107
I would note, however, that an overabundance of classes and indirection does NOT help either understanding NOR maintenance. And nor does convoluted control flows (aka, callback hell). – Matthieu M. Apr 11 '18 at 8:33
• 10
@JohnWu this explanation is way the best and easier to understand one that I ever read. – Adriano Repetti Apr 11 '18 at 9:04
• 13
Well written, but is it maybe missing why "created once but modified many, many times" is important? (If all the code is in EntityTransformationServiceImpl, you are forced to learn how the whole thing works before you can fix it - but if e.g. something is wrong with the format and a Formatter class handles that, you only need to learn how that part works. Plus reading your own code after ~3 months is like reading a stranger's code.) I feel like most of us subconsciously thought of this, but that might be because of experience. Not 100% sure about this. – R. Schmitz Apr 11 '18 at 14:48
• 17
I'd go for the full 10×10=100 for the combinatorial: those functions could well be recursive, and in particularly poor code, not necesarrily obviously so. – KRyan Apr 11 '18 at 15:06
• 32
"The alternative is to optimize for maintenance-- make creation a touch more difficult, but make modifications easier or less risky. That is the purpose of structured code." I take issue with the implicit notion that more classes = more maintainability. In particular, scattering logic across many classes often makes it difficult to find the overarching logical concepts in the code (especially without a very intentional eye on ensuring the concepts are very visible), which degrades maintainability enormously. – jpmc26 Apr 11 '18 at 17:51
67
Well, first of all, readability and maintability are often in the eye of the beholder.
What is readable to you may not be to your neighbour.
Maintainability often boils down to discoverability (how easily is a behaviour or concept discovered in the codebase) and discoverability is another subjective thing.
DDD
One of the ways DDD helps teams of developers is by suggesting a specific (yet still subjective) way of organising your code concepts and behaviours. This convention makes it easier to discover things, and therefore easier to maintain the application.
• Domain concepts are encoded as Entities and Aggregates
• Domain behaviour resides in Entities or Domain Services
• Consistency is ensured by the Aggregate Roots
• Persistence concerns are handled by Repositories
This arrangement is not objectively easier to maintain. It is, however, measurably easier to maintain when everyone understands they're operating in a DDD context.
Classes
Classes help with maintainability, readability, discoverability, etc... because they are a well known convention.
In Object Oriented settings, Classes are typically used to group closely related behaviour and to encapsulate state that needs to be controlled carefully.
I know that sounds very abstract, but you can think about it this way:
With Classes, you don't necessarily need to know how the code in them works. You just need to know what the class is responsible for.
Classes allow you to reason about your application in terms of interactions between well defined components.
This reduces the cognitive burden when reasoning about how your application works. Instead of having to remember what 600 lines of code accomplishes, you can think about how 30 components interact.
And, considering those 30 components probably span 3 layers of your application, you probably only every have to be reasoning about roughly 10 components at a time.
That seems pretty manageable.
Summary
Essentially, what you're seeing the senior devs do is this:
They are breaking down the application into easy to reason about classes.
They are then organising these into easy to reason about layers.
They are doing this because they know that, as the application grows, it becomes harder and harder to reason about it as a whole. Breaking it down into Layers and Classes means that they never have to reason about the entire application. They only ever need to reason about a small subset of it.
• 5
Besides smaller classes are easier to replace/refactor. – Zalomon Apr 10 '18 at 16:43
• 13
Overengineering does not give more maintainable or understandable code - quite the opposite, despite what you claim. Who needs an AddressServiceRepositoryProxyInjectorResolver when you can solve the problem more elegantly? Design patterns for the sake of design patterns just leads to unecessary complexity and verbosity. – vikingsteve Apr 11 '18 at 12:35
• 28
Yeah, overengineering is bad. So is killing puppies. Nobody here is advocating for either. logicallyfallacious.com/tools/lp/Bo/LogicalFallacies/169/… – MetaFight Apr 11 '18 at 12:40
• 6
Also, "elegance" in the software engineering context is often a Weasel Word. en.wikipedia.org/wiki/Weasel_word – MetaFight Apr 11 '18 at 12:47
• 11
The same could be said of any approach to organising code. Everything hinges on the maintenance team understanding why the code is organised as it is. That's the whole point of using well established and understood conventions. – MetaFight Apr 11 '18 at 14:03
29
Please explain me, why do we need this DDD style, lots of Patterns?
First, a note: the important part of DDD is not the patterns, but the alignment of the development effort with the business. Greg Young remarked that the chapters in the blue book are in the wrong order.
But to your specific question: there tend to be a lot more classes than you would expect, (a) because an effort is being made to distinguish the domain behavior from the plumbing and (b) because extra effort is being made to ensure that concepts in the domain model are expressed explicitly.
Bluntly, if you have two different concepts in the domain, then they should be distinct in the model even if they happen to share the same in memory representation.
In effect, you are building a domain specific language that describes your model in the language of the business, such that a domain expert should be able to look at it and spot errors.
Additionally, you see a bit more attention paid to separation of concerns; and the notion of insulating consumers of some capability from the implementation details. See D. L. Parnas. The clear boundaries empower you to change or extend the implementation without the effects rippling throughout you entire solution.
The motivation here: for an application that is part of the core competency of a business (meaning a place where it derives a competitive advantage), you will want to be able to easily and cheaply replace a domain behavior with a better variation. In effect, you have parts of the program that you want to evolve rapidly (how state evolves over time), and other parts that you want to change slowly (how state is stored); the extra layers of abstraction help avoid inadvertently coupling one to the other.
In fairness: some of it is also Object Oriented Brain Damage. The patterns originally described by Evans are based on Java projects that he participated in 15+ years ago; state and behavior are tightly coupled in that style, which leads to complications you might prefer to avoid; see Perception and Action by Stuart Halloway, or Inlining Code by John Carmack.
No matter what language you work in, programming in a functional style provides benefits. You should do it whenever it is convenient, and you should think hard about the decision when it isn't convenient. Carmack, 2012
• 2
I was going to add my own answer until I read this. I would emphasize the first paragraph, that the aim is to model business concepts in software to align the software with the business requirements. In fairness, the analyst driving the project should also express how much of a driver time to delivery is, and code/test quality or completeness should be adjusted accordingly. – Sentinel Apr 11 '18 at 5:41
• 1
John Carmack is a great example IMO, since he's well known for writing code that's both clean and easy to understand, while also being well performing. This is especially visible as you track his code with advancing technologies - with better CPUs and memory, you can see a lot of things pushed from "this needs to be really terse" to "this needs to be really clear/isolated/...". One of the most pragmatic programmers I know of :) – Luaan Apr 12 '18 at 9:26
• I think this is the best answer here. While I am by no means sold on DDD, this answer certainly at least explains what it really is and an actual motivation for it, rather than appealing to common platitudes that mean nothing. – jpmc26 Apr 14 '18 at 16:16
29
There are many good points in the other answers, but I think they miss or don't emphasize an important conceptual mistake you make:
You are comparing the effort to understand the complete program.
This is not a realistic task with most programs. Even simple programs consist of so much code that it is simply impossible to manage all of it in the head at any given time. Your only chance is to find the part of a program that is relevant to the task at hand (fixing a bug, implementing a new feature) and work with that.
If your program consists of huge functions/methods/classes this is almost impossible. You'll have to understand hundreds of lines of code just to decide if this chunk of code is relevant to your problem. With the estimates you gave it becomes easy to spend a week just to find the piece of code you need to work on.
Compare that to a code base with small function/methods/classes named and organized into packages/namespaces that makes it obvious where to find/put a given piece of logic. When done right in many cases you can jump right to the correct place to solve your problem, or at least to a place from where firing up your debugger will bring you to the right spot in a couple of hops.
I have worked in both kinds of systems. The difference can easily be two orders of magnitude in performance for comparable tasks and comparable system size.
The effect this has on other activities:
• testing becomes much easier with smaller units
• less merge conflicts because chances for two developers to work on the same piece of code are smaller.
• less duplication because it is easier to reuse pieces (and to find the pieces in the first place).
19
Because testing code is harder than writing code
A lot of answers have given good reasoning from a developer's perspective - that maintenance can be reduced, at the cost of making the code more strenuous to write in the first place.
However, there is another aspect to consider - testing can only be fine-grained as your original code.
If you write everything in a monolith, the only effective test you can write is "given these inputs, is the output correct?". This means any bugs found, are scoped to "somewhere in that giant pile of code".
Of course, you can then have a developer sit with a debugger and find exactly where the problem started and work on a fix. This takes a lot of resources, and is a bad use of a developer's time. Imagine that ever minor bug you have, results in a developer needing to debug the entire program again.
The solution: Many smaller tests that pinpoint one specific, potential failure each.
These small tests (for example Unit Tests), have the advantage of checking a specific area of the codebase and helping to find errors within a limited scope. This not only speeds up debugging when a test fails, but also means that if all your small tests fail - you can more easily find the failure in your larger tests (i.e. if it's not in a specific tested function, it must be in the interaction between them).
As should be clear, to make smaller tests means your codebase needs to be split into smaller testable chunks. The way to do that, on a large commercial codebase, often result in code that looks like what you're working with.
Just as a side-note: This isn't to say people won't take things "too far". But there is a legitimate reason for separating codebases into smaller/less connected parts - if done sensibly.
• 5
While your answer addresses only testing and testability, that is the single most important issue which some of the other answers completely ignored so +1. – skomisa Apr 11 '18 at 19:19
17
Please explain me, why do we need this DDD style, lots of Patterns?
Many (most...) of us really don't need them. Theoreticians and very advanced, experienced programmers write books about theories and methodologies as the result of lots of research and their deep experience - that doesn't mean that everything they write is applicable to every programmer in their everyday practice.
As a junior developer, it's good to read books such as the one you mentioned to broaden your perspectives, and make you aware of certain issues. It will also save you from getting embarrassed and flummoxed when your senior colleagues use terminology you are unfamiliar with. If you find something very difficult and doesn't seem to make sense or seem useful, don't kill yourself over it - just file it away in your head that there is such a concept or approach.
In your day to day development, unless you are an academic, your job is to find workable, maintainable solutions. If the ideas you find in a book don't help you achieve that goal, then don't worry about it right now, as long as your work is deemed satisfactory.
There may come a time when you'll discover that you can use some of what you read about but didn't quite "get" at first, or maybe not.
• 12
While on a pure level this is correct it sounds like DDD and other Patterns are just theory. They aren't. They are important tools to achieve readable and maintainable code. – Jens Schauder Apr 11 '18 at 5:47
• 9
@PeteKirkham the OPs dilemma is the overuse of design patterns. Do you really need an AccountServiceFacadeInjectResolver (real example I just found in a system at work) - answer is most probably no. – vikingsteve Apr 11 '18 at 12:55
• 4
@vikingsteve OP is not a programming guru commenting on the general overuse of design patterns. OP is an apprentice and thinks they are overused at his shop. I know that beginner-me would have thought the same about the code I write nowadays, but beginner-me had a lot of personal projects fail because they ended up too convoluted. – R. Schmitz Apr 11 '18 at 15:11
• 4
@R.Schmitz That said, beginner me had plenty of personal projects fail because they tried too hard to make things well-designed, organized, structured, OOP... All of these are tools. They need to be understood and used properly, and you can hardly blame the hammer for being poor at screwing. Surprisingly, it seems to take a lot of insight and experience to understand this simple thing :) – Luaan Apr 12 '18 at 9:22
• 3
@Luaan If you already cared about well-designed, organized, structured, OOP, I'd hardly call that beginner-you, but yeah overuse is bad. However, the question is more about how OP doesn't really understand which problems those things solve. If you don't know the reason, it seems like there is no reason - but actually, you just don't know it yet. – R. Schmitz Apr 12 '18 at 10:38
8
As your question is covering a lot of ground, with a lot of assumptions, I'll single out the subject of your question:
Why do we need so many classes in design patterns
We do not. There is no generally accepted rule that says that there must be many classes in design patterns.
There are two key guides for deciding where to put code, and how to cut your tasks into different units of code:
• Cohesion: any unit of code (be it a package, a file, a class or a method) should belong together. I.e., any specific method should have one task, and do that one well. Any class should be responsible for one larger topic (whatever that may be). We want high cohesion.
• Coupling: any two units of code should depend as little on each other as possible - there should especially be no circular dependencies. We want low coupling.
Why should those two be important?
• Cohesion: a method that does a lot of things (e.g., an old-fashioned CGI script that does GUI, logic, DB access etc. all in one long mess of code) becomes unwieldy. At the time of writing, it is tempting to just put your train of thought into a long method. This works, it is easy to present and such, and you can be done with it. Trouble arises later: after a few months, you may forget what you did. A line of code at the top might be a few screens away from a line on the bottom; it is easy to forget all details. Any change anywhere in the method may break any amount of behaviours of the complex thing. It will be quite cumbersone to refactor or re-use parts of the method. And so on.
• Coupling: anytime you change a unit of code, you potentially break all other units that depend on it. In strict languages like Java, you might get hints during compile time (i.e., about parameters, declared exceptions and so on). But many changes are not triggering such (i.e. behavioural changes), and other, more dynamic, languages, have no such possibilities. The higher the coupling, the tougher it gets to change anything, and you might grind to a halt, where a complete re-write is necessary to achieve some goal.
These two aspects are the base "drivers" for any choice of "where to put what" in any programming language, and any paradigm (not only OO). Not everybody is explictly aware of them, and it takes time, often years, to get a really ingrained, automatic feeling on how these influence software.
Obviously, those two concepts do not tell you anything about what to actually do. Some people err on the side of too much, others on the side of too little. Some languages (looking at you here, Java) tend to favour many classes because of the extremely static and pedantic nature of the language itself (this is not a value statement, but it is what it is). This becomes especially noticeable when you compare it to dynamic and more expressive languages, for example Ruby.
Another aspect is that some people subscribe to the agile approach of only writing code that is necessary right now, and to refactor heavily later, when necessary. In this style of development, you would not create an interface when you only have one implementing class. You would simply implement the concrete class. If, later, you need a second class, you would refactor.
Some people simply do not work that way. They create interfaces (or, more generally, abstract base classes) for anything that ever could be used more generally; this leads to a class explosion quickly.
Again, there are arguments for and against, and it does not matter which I, or you, prefer. You will, in your life as software developer, encounter all extremes, from long spaghetti methods, through enlightened, just-big-enough class designs, up to incredibly blown-up class schemes that are much overengineered. As you get more experienced, you will grow more into "architectural" roles, and can start to influence this in the direction you wish to. You will find out a golden middle for yourself, and you will still find that many people will disagree with you, whatever you do.
Hence, keeping an open mind is the most important bit, here, and that would be my primary advice to you, seeing that you seem to be much in pain about the issue, judging by the rest of your question...
7
Experienced coders have learned:
• Because those smallish programs and clasess start to grow, especially successful ones. That simple patterns that worked at a simple level don't scale.
• Because it may seem burdensome to have to add/change several artifacts for every add/change but you know what to add and it is easy to do so. 3 minutes of typing beats 3 hours of clever coding.
• Lots of small classes is not "messy" just because you don't understand why the overhead is actually a good idea
• Without the domain knowledge added, the 'obvious to me' code is often mysterious to my team mates... plus the future me.
• Tribal knowledge can make projects incredibly hard to add team members to easily and hard for them to be productive quickly.
• Naming is one of the two hard problems in computing is still true and lots of classes and methods is often an intense exercise in naming which many find to be a great benefit.
• 5
But is the overhead necessary? In many cases that I see, design patterns are overused. The result of overcomplexity are increased difficulty in understanding, maintaining, testing and debugging code. When you have 12 classes and 4 maven modules around one simple service class (a real example I just saw), it quickly becomes less manageable than you might think. – vikingsteve Apr 11 '18 at 12:59
• 4
@vikingsteve You keep referring to a single example of a flawed implementation hoping that it will prove that structured code, in general, is a bad idea. That just doesn't track. – MetaFight Apr 11 '18 at 14:56
• 3
@MetaFight OP isn't talking about structure code. He's talking about, what he sees as, too many abstractions. If you have too many abstractions, I argue, you quickly get very very unstructured code and a lot of nearly identical pieces, simply because people can't cope with the amount of stuff they have to deal with. – Clearer Apr 12 '18 at 8:58
• 4
@Clearer I'm pretty sure everyone here is in agreement that the hypothetical misapplication of structured code is a bad thing. The OP says they're Junior. That's why people are assuming he/she is unfamiliar with the benefits of structured code and reiterating them. – MetaFight Apr 12 '18 at 11:03
2
The answers so far, all of them good, having started with the reasonable assumption that the asker is missing something, which the asker also acknowledges. It's also possible that the asker is basically right, and it's worth discussing how this situation can come about.
Experience and practice are powerful, and if the seniors gained their experience in large, complex projects where the only way to keep things under control is with plenty of EntityTransformationServiceImpl's, then they become fast and comfortable with design patterns and close adherence to DDD. They would be much less effective using a lightweight approach, even for small programs. As the odd one out, you should adapt and it will be a great learning experience.
While adapting though, you should take it as a lesson in the balance between learning a single approach deeply, to the point you can make it work anywhere, versus staying versatile and knowing what tools are available without necessarily being an expert with any of them. There are advantages to both and both are needed in the world.
1
Since my initial post of this answer didn't accomplish what I wanted, I purchased the for-Kindle version of this book, and found exactly what I vaguely remembered, in order to directly answer the question
Why do we need so many classes in design patterns?
Short and sweet -- we don't. Exactly why that is true I'm not sure that I can put into words as well as this book, and that was the gist of my initially posted answer.
What follows are excerpts from the book that speak well directly to the question.
This excerpt from the book is from Chapter 3 "Patterns" and sub-chapter 3 "There Are Many Ways to Implement a Pattern":
In this book, you’ll find pattern implementations that look quite different from their Structure diagrams in Design Patterns. For example, here’s the Structure diagram for the Composite pattern:
Structure diagram for the Composite pattern
And here is a particular implementation of the Composite pattern:
A minimalistic implementation of the Composite pattern
As you can see, this implementation of Composite bears little resemblance to the Structure diagram for Composite. It is a minimalistic Composite implementation that resulted from coding only what was necessary.
Being minimalistic in your pattern implementations is part of the practice of evolutionary design. In many cases, a non-patterns-based implementation may need to evolve to include a pattern. In that case, you can refactor the design to a simple pattern implementation. I use this approach throughout this book.
Slightly earlier in the sub-chapter, Joshua says this:
This diagram indicates that the Creator and Product classes are abstract, while the ConcreteCreator and ConcreteProduct classes are concrete. Is this the only way to implement the Factory Method pattern? By no means! In fact, the authors of Design Patterns go to great pains to explain different ways to implement each pattern in a section called Implementation Notes. If you read the implementation notes for the Factory Method pattern, you’ll find that there are plenty of ways to implement a Factory Method.
Here is that whole section, which goes into just a little more detail:
Page screen shot from the Joshua Kerievsky book "Refactoring to Patterns" Kindle Edition, 13%, Location 1134 of 9053
[ORIGINAL POST]
I would like to point you to a book that I think answers your question with more of a heuristic sense of when it's necessary, and when it's overkill, to "use so many classes" in design patterns, as this author often implements a design pattern very frugally, with just a few object-oriented "parts".
enter image description here
This book is one of the Martin Fowler Signature Series, and is an excellent book on Design Patterns by Joshua Kerievsky, entitled "Refactoring To Patterns", but it is really about "Right-Factoring" to and/or away from patterns. It was well-worth the price, to me.
In his book, he sometimes implemented patterns without using object orientation, and instead used a few fields and a few methods, for example. And he sometimes removed a pattern altogether because it was overkill. So I loved his treatment of the subject because the "balance" of when to pattern, and when to go more lightweight, was a gift he imparted to the reader.
Here is a screen shot of the most relevant part of the table of contents. It was one of my best purchases.
Table of Contents Screenshot of Book Refactoring To Patterns by Joshua Kerievsky
And out of this table of contents, I especially emphasize the following:
• And I emphasize the following:
• Over-Engineering
• The Patterns Panacea
• Under-Engineering
• Human-Readable Code
• Keeping it Clean
• Patterns Happy
• There Are Many Ways to Implement a Pattern
• Refactoring to, towards, and away from Patterns
• Do Patterns Make Code More Complex?
• Code Smells
So, I think your question can be paraphrased as an internal sense of questioning "Do we really have to use so many classes to implement patterns?" and the answer is "sometimes", and of course, the seemingly ever-present "it-depends". But it takes more of a book to answer you, so I am recommending that you get this one if you can. (I don't actually have it with me at the moment, otherwise I would give you a good example from it -- sorry.) HTH.
• So basically, your answer is "read this book and you will get it". How reading a book about refactoring (which has nothing to do with DDD) can help OP to understand "Why LoC is a horrible indicator to measure the cost of maintenance? Or when and why DDD is needed and what are the trade-offs" – Laiv Jan 2 at 8:16
• @Laiv - Sorry that I couldn't put my recollections into words for the initial post. I prepended the information that I really wanted to originally post. And yes, I stick to my guns, and claim that this answer really does answer the question, "Why do we need so many classes in design patterns?" I hope you agree, but at the very least, I DID put some effort into trying to answer. If you still don't agree, would you please add your own answer? Thanks. – MicroservicesOnDDD Jan 10 at 23:58
-4
Making more class and function as per use will be a great approach to resolve problems in a specific manner that help in future to resolve any issues.
Multiple classes help to identify as their basic work and any class can be called at any time.
However if you many class and functions from their getable name they are in easy to call and manage. This is called a clean code.
• 9
Sorry, but what are you saying? – Deduplicator Apr 13 '18 at 15:18
• @Deduplicator let's take an example in java if we design we used jframes threads and classes for their inheritance. From only one class we can't able to use some works of java for design so we need to make more classes – Sanjeev Chauhan Apr 13 '18 at 15:22
• 2
This answer needs to present the idea(s) that it's purporting to present in clearer English. It seems like that the core idea in the answer is that smaller classes, each with one well-defined functionality, is a good idea, but the terrible grammar makes it almost impossible to understand. Also, by itself, this assertion may not be enough. – talonx Apr 16 '18 at 8:39
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://softwareengineering.stackexchange.com/questions/369154/why-do-we-need-so-many-classes-in-design-patterns",
"source_domain": "softwareengineering.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "255162",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UIBPWRVO3FG4Y4KQ2MUZTIXYVCRDY7Z4",
"WARC-Concurrent-To": "<urn:uuid:67a3f2b8-fb52-46de-98bd-492b23608f8f>",
"WARC-Date": "2020-01-29T05:00:07Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VLKFOYLDQTKJKTONCKGAZMJP2Z4HMWOV",
"WARC-Record-ID": "<urn:uuid:8e34e89a-3d84-4f17-b296-db9c38c5c0ea>",
"WARC-Target-URI": "https://softwareengineering.stackexchange.com/questions/369154/why-do-we-need-so-many-classes-in-design-patterns",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39d96ac1-5af7-43ee-9a8f-c01b8f1d1ee8>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
4,
5,
111,
112,
425,
426,
612,
613,
626,
627,
845,
891,
958,
959,
1193,
1194,
1386,
1387,
1555,
1556,
1624,
1625,
1982,
1983,
1990,
2183,
2190,
2736,
2743,
2908,
2915,
3266,
3273,
3399,
3400,
3414,
3415,
3419,
3420,
3452,
3453,
3734,
3735,
3992,
3993,
4395,
4396,
4815,
4816,
4862,
4863,
5655,
5656,
6087,
6088,
6096,
6317,
6324,
6453,
6460,
7056,
7063,
7250,
7257,
7804,
7807,
7808,
7895,
7896,
7950,
7951,
8118,
8119,
8123,
8124,
8376,
8377,
8436,
8496,
8546,
8599,
8600,
8764,
8765,
8773,
8774,
8888,
8889,
9044,
9045,
9116,
9117,
9251,
9252,
9361,
9362,
9560,
9561,
9726,
9727,
9757,
9758,
9766,
9767,
9827,
9828,
9902,
9903,
9968,
9969,
10265,
10266,
10272,
10362,
10369,
10729,
10736,
10922,
10928,
11075,
11082,
11346,
11349,
11350,
11418,
11419,
11623,
11624,
11916,
11917,
12082,
12083,
12269,
12270,
12587,
12588,
13094,
13095,
13456,
13457,
13676,
13677,
13683,
14094,
14100,
14563,
14823,
14826,
14827,
14959,
14960,
15025,
15026,
15350,
15351,
15667,
15668,
16046,
16047,
16204,
16205,
16246,
16247,
16298,
16405,
16508,
16511,
16512,
16561,
16562,
16746,
16747,
16850,
16851,
17058,
17059,
17357,
17358,
17443,
17444,
17858,
17859,
18084,
18085,
18272,
18273,
18279,
18469,
18472,
18473,
18541,
18542,
18858,
18859,
19321,
19322,
19584,
19585,
19720,
19721,
19728,
19941,
19947,
20184,
20190,
20560,
20566,
20988,
20994,
21379,
21381,
21382,
21501,
21502,
21552,
21553,
21662,
21663,
21776,
21777,
22049,
22212,
22213,
22248,
22249,
22943,
23467,
23468,
23760,
23761,
24234,
24235,
24609,
24610,
24812,
24813,
25394,
25395,
25597,
25598,
25600,
25601,
25634,
25635,
25790,
25988,
26104,
26229,
26358,
26538,
26544,
26945,
26951,
27166,
27172,
27523,
27529,
27831,
27833,
27834,
28105,
28106,
28572,
28573,
28908,
28909,
28911,
28912,
29117,
29118,
29169,
29170,
29338,
29339,
29421,
29422,
29542,
29543,
29738,
29739,
29783,
29784,
29850,
29851,
29906,
29907,
30118,
30119,
30430,
30431,
30486,
30487,
30998,
30999,
31070,
31071,
31188,
31189,
31190,
31206,
31207,
31507,
31508,
31537,
31538,
31802,
31803,
32170,
32171,
32278,
32279,
32360,
32361,
32434,
32435,
32470,
32491,
32516,
32538,
32562,
32583,
32602,
32649,
32701,
32741,
32757,
32758,
33205,
33206,
33524,
34018,
34021,
34022,
34173,
34174,
34269,
34270,
34400,
34401,
34407,
34478,
34739,
34745,
35118,
35119
],
"line_end_idx": [
4,
5,
111,
112,
425,
426,
612,
613,
626,
627,
845,
891,
958,
959,
1193,
1194,
1386,
1387,
1555,
1556,
1624,
1625,
1982,
1983,
1990,
2183,
2190,
2736,
2743,
2908,
2915,
3266,
3273,
3399,
3400,
3414,
3415,
3419,
3420,
3452,
3453,
3734,
3735,
3992,
3993,
4395,
4396,
4815,
4816,
4862,
4863,
5655,
5656,
6087,
6088,
6096,
6317,
6324,
6453,
6460,
7056,
7063,
7250,
7257,
7804,
7807,
7808,
7895,
7896,
7950,
7951,
8118,
8119,
8123,
8124,
8376,
8377,
8436,
8496,
8546,
8599,
8600,
8764,
8765,
8773,
8774,
8888,
8889,
9044,
9045,
9116,
9117,
9251,
9252,
9361,
9362,
9560,
9561,
9726,
9727,
9757,
9758,
9766,
9767,
9827,
9828,
9902,
9903,
9968,
9969,
10265,
10266,
10272,
10362,
10369,
10729,
10736,
10922,
10928,
11075,
11082,
11346,
11349,
11350,
11418,
11419,
11623,
11624,
11916,
11917,
12082,
12083,
12269,
12270,
12587,
12588,
13094,
13095,
13456,
13457,
13676,
13677,
13683,
14094,
14100,
14563,
14823,
14826,
14827,
14959,
14960,
15025,
15026,
15350,
15351,
15667,
15668,
16046,
16047,
16204,
16205,
16246,
16247,
16298,
16405,
16508,
16511,
16512,
16561,
16562,
16746,
16747,
16850,
16851,
17058,
17059,
17357,
17358,
17443,
17444,
17858,
17859,
18084,
18085,
18272,
18273,
18279,
18469,
18472,
18473,
18541,
18542,
18858,
18859,
19321,
19322,
19584,
19585,
19720,
19721,
19728,
19941,
19947,
20184,
20190,
20560,
20566,
20988,
20994,
21379,
21381,
21382,
21501,
21502,
21552,
21553,
21662,
21663,
21776,
21777,
22049,
22212,
22213,
22248,
22249,
22943,
23467,
23468,
23760,
23761,
24234,
24235,
24609,
24610,
24812,
24813,
25394,
25395,
25597,
25598,
25600,
25601,
25634,
25635,
25790,
25988,
26104,
26229,
26358,
26538,
26544,
26945,
26951,
27166,
27172,
27523,
27529,
27831,
27833,
27834,
28105,
28106,
28572,
28573,
28908,
28909,
28911,
28912,
29117,
29118,
29169,
29170,
29338,
29339,
29421,
29422,
29542,
29543,
29738,
29739,
29783,
29784,
29850,
29851,
29906,
29907,
30118,
30119,
30430,
30431,
30486,
30487,
30998,
30999,
31070,
31071,
31188,
31189,
31190,
31206,
31207,
31507,
31508,
31537,
31538,
31802,
31803,
32170,
32171,
32278,
32279,
32360,
32361,
32434,
32435,
32470,
32491,
32516,
32538,
32562,
32583,
32602,
32649,
32701,
32741,
32757,
32758,
33205,
33206,
33524,
34018,
34021,
34022,
34173,
34174,
34269,
34270,
34400,
34401,
34407,
34478,
34739,
34745,
35118,
35119,
35209
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 35209,
"ccnet_original_nlines": 345,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44722992181777954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015927979722619057,
"rps_doc_frac_lines_end_with_ellipsis": 0.0028901700861752033,
"rps_doc_frac_no_alph_words": 0.18240997195243835,
"rps_doc_frac_unique_words": 0.23986095190048218,
"rps_doc_mean_word_length": 4.586161136627197,
"rps_doc_num_sentences": 319,
"rps_doc_symbol_to_word_ratio": 0.001108029973693192,
"rps_doc_unigram_entropy": 6.066272258758545,
"rps_doc_word_count": 6041,
"rps_doc_frac_chars_dupe_10grams": 0.02656560018658638,
"rps_doc_frac_chars_dupe_5grams": 0.05699332058429718,
"rps_doc_frac_chars_dupe_6grams": 0.046020571142435074,
"rps_doc_frac_chars_dupe_7grams": 0.03374842181801796,
"rps_doc_frac_chars_dupe_8grams": 0.029092220589518547,
"rps_doc_frac_chars_dupe_9grams": 0.02656560018658638,
"rps_doc_frac_chars_top_2gram": 0.004475730005651712,
"rps_doc_frac_chars_top_3gram": 0.0042952499352395535,
"rps_doc_frac_chars_top_4gram": 0.005522469989955425,
"rps_doc_books_importance": -2485.63525390625,
"rps_doc_books_importance_length_correction": -2485.63525390625,
"rps_doc_openwebtext_importance": -1655.0380859375,
"rps_doc_openwebtext_importance_length_correction": -1655.0380859375,
"rps_doc_wikipedia_importance": -1164.6468505859375,
"rps_doc_wikipedia_importance_length_correction": -1164.6468505859375
},
"fasttext": {
"dclm": 0.448658287525177,
"english": 0.9559347033500671,
"fineweb_edu_approx": 2.2349836826324463,
"eai_general_math": 0.8980669379234314,
"eai_open_web_math": 0.3269709348678589,
"eai_web_code": 0.517158567905426
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.101",
"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": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-211,507,785,378,528,320 |
AdaptInstationary.h 5.92 KB
Newer Older
1
2
3
4
// ============================================================================
// == ==
// == AMDiS - Adaptive multidimensional simulations ==
// == ==
5
// == http://www.amdis-fem.org ==
6
7
// == ==
// ============================================================================
8
9
10
11
12
13
14
15
16
17
18
19
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.
20
21
22
23
24
25
26
27
28
29
30
31
/** \file AdaptInstationary.h */
#ifndef AMDIS_ADAPTINSTATIONARY_H
#define AMDIS_ADAPTINSTATIONARY_H
#include <string>
#include <ctime>
#include <queue>
#include "Flag.h"
#include "AdaptInfo.h"
#include "AdaptBase.h"
32
#include "AMDiS_fwd.h"
33
34
35
namespace AMDiS {
36
37
using namespace std;
38
39
40
41
42
43
44
45
46
47
48
/** \ingroup Adaption
* \brief
* AdaptInstationary implements the adaptive procdure for time dependent
* problems (see ProblemInstat). It contains a pointer to a ProblemInstat
* object.
*/
class AdaptInstationary : public AdaptBase
{
public:
/** \brief
* Creates a AdaptInstationary object with the given name for the time
49
* dependent problem problemInstat. TODO: Make obsolete!
50
*/
51
AdaptInstationary(string name,
52
ProblemIterationInterface *problemStat,
53
54
55
AdaptInfo *info,
ProblemTimeInterface *problemInstat,
AdaptInfo *initialInfo,
56
time_t initialTimestampSet = 0);
57
58
59
60
61
/** \brief
* Creates a AdaptInstationary object with the given name for the time
* dependent problem problemInstat.
*/
62
AdaptInstationary(string name,
63
64
65
66
ProblemIterationInterface &problemStat,
AdaptInfo &info,
ProblemTimeInterface &problemInstat,
AdaptInfo &initialInfo,
67
time_t initialTimestampSet = 0);
68
69
70
71
72
73
74
75
76
77
/** \brief
* This funciton is used only to avoid double code in both constructors. If the
* obsolte constructure, which uses pointers instead of references, will be
* removed, remove also this function.
* TODO: Remove if obsolete constructor will be removed.
*/
void initConstructor(ProblemIterationInterface *problemStat,
AdaptInfo *info,
AdaptInfo *initialInfo,
78
time_t initialTimestampSet);
79
Thomas Witkowski's avatar
Thomas Witkowski committed
80
/// Destructor
81
virtual ~AdaptInstationary() {}
82
Thomas Witkowski's avatar
Thomas Witkowski committed
83
/// Sets \ref strategy to aStrategy
Thomas Witkowski's avatar
Thomas Witkowski committed
84
85
inline void setStrategy(int aStrategy)
{
86
strategy = aStrategy;
87
}
88
Thomas Witkowski's avatar
Thomas Witkowski committed
89
/// Returns \ref strategy
Thomas Witkowski's avatar
Thomas Witkowski committed
90
91
const int getStrategy() const
{
92
return strategy;
Thomas Witkowski's avatar
* Bla
Thomas Witkowski committed
93
}
Thomas Witkowski's avatar
Thomas Witkowski committed
94
/// Implementation of AdaptBase::adapt()
95
96
virtual int adapt();
Thomas Witkowski's avatar
Thomas Witkowski committed
97
/// Serialization
98
virtual void serialize(ostream &out);
99
Thomas Witkowski's avatar
Thomas Witkowski committed
100
/// deserialization
101
virtual void deserialize(istream &in);
102
103
104
105
106
107
108
109
110
111
112
113
114
115
protected:
/** \brief
* Implements one (maybe adaptive) timestep. Both the explicit and the
* implicit time strategy are implemented. The semi-implicit strategy
* is only a special case of the implicit strategy with a limited number of
* iterations (exactly one).
* The routine uses the parameter \ref strategy to select the strategy:
* strategy 0: Explicit strategy,
* strategy 1: Implicit strategy.
*/
virtual void oneTimestep();
Thomas Witkowski's avatar
Thomas Witkowski committed
116
/// Initialisation of this AdaptInstationary object
117
void initialize(string aName);
118
Thomas Witkowski's avatar
Thomas Witkowski committed
119
/// Implements the explit time strategy. Used by \ref oneTimestep().
120
121
virtual void explicitTimeStrategy();
Thomas Witkowski's avatar
Thomas Witkowski committed
122
/// Implements the implicit time strategy. Used by \ref oneTimestep().
123
124
virtual void implicitTimeStrategy();
Thomas Witkowski's avatar
Thomas Witkowski committed
125
126
127
128
129
130
131
/** \brief
* This iteration strategy allows the timestep and the mesh to be adapted
* after each timestep solution. There are no inner loops for mesh adaption and
* no refused timesteps.
*/
void simpleAdaptiveTimeStrategy();
132
133
134
135
136
137
138
139
140
141
142
/** \brief
* Checks whether the runtime of the queue (of the servers batch system) requires
* to stop the calculation and to reschedule the problem to the batch system.
*
* The function return true, if there will be a timeout in the near future, and
* therefore the problem should be rescheduled. Otherwise, the return value is
* false.
*/
bool checkQueueRuntime();
protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
143
/// Strategy for choosing one timestep
144
145
int strategy;
Thomas Witkowski's avatar
Thomas Witkowski committed
146
/// Parameter \f$ \delta_1 \f$ used in time step reduction
Thomas Witkowski's avatar
Thomas Witkowski committed
147
double timeDelta1;
148
Thomas Witkowski's avatar
Thomas Witkowski committed
149
/// Parameter \f$ \delta_2 \f$ used in time step enlargement
Thomas Witkowski's avatar
Thomas Witkowski committed
150
double timeDelta2;
151
152
153
154
155
156
/** \brief
* If this parameter is 1 and the instationary problem is stable, hence the number
* of solver iterations to solve the problem is zero, the adaption loop will stop.
*/
int breakWhenStable;
Thomas Witkowski's avatar
Thomas Witkowski committed
157
///
Thomas Witkowski's avatar
Thomas Witkowski committed
158
bool fixedTimestep;
159
160
161
162
163
/** \brief
* Runtime of the queue (of the servers batch system) in seconds. If the problem
* runs on a computer/server without a time limited queue, the value is -1.
*/
Thomas Witkowski's avatar
Thomas Witkowski committed
164
int queueRuntime;
165
Thomas Witkowski's avatar
Thomas Witkowski committed
166
/// Name of the file used to automatically serialize the problem.
167
string queueSerializationFilename;
168
169
/** \brief
Thomas Witkowski's avatar
Thomas Witkowski committed
170
171
* Timestamp at the beginning of all calculations. It is used to calculate the
* overall runtime of the problem.
172
*/
Thomas Witkowski's avatar
Thomas Witkowski committed
173
time_t initialTimestamp;
174
175
/** \brief
Thomas Witkowski's avatar
Thomas Witkowski committed
176
177
* Timestamp at the beginning of the last timestep iteration. Is is used to
* calculate the runtime of the last timestep.
178
*/
Thomas Witkowski's avatar
Thomas Witkowski committed
179
time_t iterationTimestamp;
180
Thomas Witkowski's avatar
Thomas Witkowski committed
181
/// Stores the runtime (in seconds) of some last timestep iterations.
182
queue<int> lastIterationsDuration;
183
184
/** \brief
Thomas Witkowski's avatar
Thomas Witkowski committed
185
186
* In debug mode, the adapt loop will print information about timestep decreasing
* and increasing.
187
188
*/
bool dbgMode;
189
190
191
192
193
};
}
#endif // AMDIS_ADAPTINSTATIONARY_H
|
{
"url": "https://gitlab.math.tu-dresden.de/backofen/amdis/-/blame/7ada0dbae5ffa47e3f0730a1f4ad6612e0137442/AMDiS/src/AdaptInstationary.h",
"source_domain": "gitlab.math.tu-dresden.de",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "253221",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5XOCYMZLJSA5VHOAXGNPLL4WLUCYEW4Z",
"WARC-Concurrent-To": "<urn:uuid:d7a6802d-8358-4754-9166-d0db213fc75c>",
"WARC-Date": "2021-12-02T16:53:20Z",
"WARC-IP-Address": "141.76.16.89",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J7CPBRVBBC4RW5BYD2QVPZFR72ZVLT5W",
"WARC-Record-ID": "<urn:uuid:682ef4c3-7f66-4098-b799-69a61a0f53d0>",
"WARC-Target-URI": "https://gitlab.math.tu-dresden.de/backofen/amdis/-/blame/7ada0dbae5ffa47e3f0730a1f4ad6612e0137442/AMDiS/src/AdaptInstationary.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f44edb8e-b199-4203-a771-79e765c0370e>"
},
"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-160\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
28,
40,
42,
44,
46,
48,
128,
208,
288,
368,
370,
450,
452,
454,
534,
614,
616,
618,
621,
624,
627,
630,
633,
636,
639,
642,
645,
648,
651,
681,
684,
740,
764,
811,
814,
844,
847,
903,
904,
905,
908,
911,
914,
917,
920,
923,
926,
929,
932,
935,
938,
941,
942,
975,
976,
1010,
1044,
1045,
1063,
1080,
1097,
1115,
1138,
1161,
1164,
1187,
1190,
1193,
1196,
1197,
1215,
1216,
1219,
1222,
1245,
1246,
1249,
1252,
1255,
1258,
1261,
1264,
1267,
1270,
1273,
1276,
1279,
1305,
1317,
1393,
1469,
1482,
1488,
1533,
1537,
1547,
1562,
1638,
1641,
1702,
1705,
1713,
1716,
1752,
1755,
1803,
1806,
1809,
1812,
1837,
1882,
1914,
1917,
1972,
1975,
1976,
1979,
1982,
1985,
1988,
2003,
2079,
2119,
2127,
2130,
2166,
2169,
2172,
2175,
2178,
2226,
2251,
2296,
2328,
2331,
2386,
2389,
2392,
2395,
2398,
2401,
2404,
2407,
2410,
2413,
2416,
2417,
2432,
2516,
2596,
2639,
2700,
2708,
2775,
2796,
2824,
2827,
2860,
2863,
2864,
2890,
2917,
2920,
2939,
2942,
2978,
2981,
2982,
3008,
3035,
3038,
3078,
3104,
3131,
3134,
3137,
3181,
3188,
3191,
3220,
3223,
3229,
3232,
3233,
3259,
3286,
3289,
3319,
3345,
3372,
3375,
3378,
3413,
3419,
3422,
3445,
3471,
3481,
3508,
3511,
3517,
3543,
3570,
3573,
3618,
3621,
3624,
3649,
3650,
3676,
3703,
3706,
3728,
3731,
3773,
3776,
3777,
3803,
3830,
3834,
3858,
3862,
3905,
3909,
3913,
3917,
3921,
3925,
3929,
3933,
3937,
3941,
3945,
3949,
3953,
3957,
3961,
3962,
3963,
3976,
3991,
4067,
4142,
4223,
4256,
4332,
4371,
4409,
4417,
4449,
4450,
4476,
4503,
4507,
4563,
4567,
4602,
4606,
4607,
4633,
4660,
4664,
4737,
4741,
4745,
4786,
4787,
4813,
4840,
4844,
4919,
4923,
4927,
4968,
4969,
4995,
5022,
5026,
5030,
5034,
5038,
5042,
5046,
5050,
5065,
5144,
5228,
5257,
5265,
5304,
5305,
5309,
5313,
5317,
5321,
5325,
5329,
5333,
5337,
5341,
5345,
5349,
5364,
5450,
5532,
5539,
5623,
5706,
5720,
5728,
5758,
5759,
5772,
5798,
5825,
5829,
5872,
5876,
5880,
5899,
5900,
5926,
5953,
5957,
6020,
6046,
6073,
6077,
6100,
6104,
6105,
6131,
6158,
6162,
6227,
6253,
6280,
6284,
6307,
6311,
6315,
6319,
6323,
6327,
6331,
6332,
6347,
6434,
6521,
6529,
6554,
6580,
6607,
6611,
6619,
6645,
6672,
6676,
6700,
6704,
6708,
6712,
6716,
6720,
6721,
6736,
6821,
6901,
6909,
6935,
6962,
6966,
6988,
6992,
6993,
7019,
7046,
7050,
7120,
7124,
7163,
7167,
7171,
7172,
7187,
7213,
7240,
7244,
7248,
7332,
7371,
7375,
7383,
7409,
7436,
7440,
7469,
7473,
7477,
7478,
7493,
7519,
7546,
7550,
7554,
7635,
7686,
7690,
7698,
7724,
7751,
7755,
7786,
7790,
7791,
7817,
7844,
7848,
7922,
7926,
7965,
7969,
7973,
7974,
7989,
8015,
8042,
8046,
8050,
8137,
8160,
8164,
8168,
8176,
8194,
8198,
8202,
8206,
8210,
8214,
8219,
8220,
8222,
8223
],
"line_end_idx": [
28,
40,
42,
44,
46,
48,
128,
208,
288,
368,
370,
450,
452,
454,
534,
614,
616,
618,
621,
624,
627,
630,
633,
636,
639,
642,
645,
648,
651,
681,
684,
740,
764,
811,
814,
844,
847,
903,
904,
905,
908,
911,
914,
917,
920,
923,
926,
929,
932,
935,
938,
941,
942,
975,
976,
1010,
1044,
1045,
1063,
1080,
1097,
1115,
1138,
1161,
1164,
1187,
1190,
1193,
1196,
1197,
1215,
1216,
1219,
1222,
1245,
1246,
1249,
1252,
1255,
1258,
1261,
1264,
1267,
1270,
1273,
1276,
1279,
1305,
1317,
1393,
1469,
1482,
1488,
1533,
1537,
1547,
1562,
1638,
1641,
1702,
1705,
1713,
1716,
1752,
1755,
1803,
1806,
1809,
1812,
1837,
1882,
1914,
1917,
1972,
1975,
1976,
1979,
1982,
1985,
1988,
2003,
2079,
2119,
2127,
2130,
2166,
2169,
2172,
2175,
2178,
2226,
2251,
2296,
2328,
2331,
2386,
2389,
2392,
2395,
2398,
2401,
2404,
2407,
2410,
2413,
2416,
2417,
2432,
2516,
2596,
2639,
2700,
2708,
2775,
2796,
2824,
2827,
2860,
2863,
2864,
2890,
2917,
2920,
2939,
2942,
2978,
2981,
2982,
3008,
3035,
3038,
3078,
3104,
3131,
3134,
3137,
3181,
3188,
3191,
3220,
3223,
3229,
3232,
3233,
3259,
3286,
3289,
3319,
3345,
3372,
3375,
3378,
3413,
3419,
3422,
3445,
3471,
3481,
3508,
3511,
3517,
3543,
3570,
3573,
3618,
3621,
3624,
3649,
3650,
3676,
3703,
3706,
3728,
3731,
3773,
3776,
3777,
3803,
3830,
3834,
3858,
3862,
3905,
3909,
3913,
3917,
3921,
3925,
3929,
3933,
3937,
3941,
3945,
3949,
3953,
3957,
3961,
3962,
3963,
3976,
3991,
4067,
4142,
4223,
4256,
4332,
4371,
4409,
4417,
4449,
4450,
4476,
4503,
4507,
4563,
4567,
4602,
4606,
4607,
4633,
4660,
4664,
4737,
4741,
4745,
4786,
4787,
4813,
4840,
4844,
4919,
4923,
4927,
4968,
4969,
4995,
5022,
5026,
5030,
5034,
5038,
5042,
5046,
5050,
5065,
5144,
5228,
5257,
5265,
5304,
5305,
5309,
5313,
5317,
5321,
5325,
5329,
5333,
5337,
5341,
5345,
5349,
5364,
5450,
5532,
5539,
5623,
5706,
5720,
5728,
5758,
5759,
5772,
5798,
5825,
5829,
5872,
5876,
5880,
5899,
5900,
5926,
5953,
5957,
6020,
6046,
6073,
6077,
6100,
6104,
6105,
6131,
6158,
6162,
6227,
6253,
6280,
6284,
6307,
6311,
6315,
6319,
6323,
6327,
6331,
6332,
6347,
6434,
6521,
6529,
6554,
6580,
6607,
6611,
6619,
6645,
6672,
6676,
6700,
6704,
6708,
6712,
6716,
6720,
6721,
6736,
6821,
6901,
6909,
6935,
6962,
6966,
6988,
6992,
6993,
7019,
7046,
7050,
7120,
7124,
7163,
7167,
7171,
7172,
7187,
7213,
7240,
7244,
7248,
7332,
7371,
7375,
7383,
7409,
7436,
7440,
7469,
7473,
7477,
7478,
7493,
7519,
7546,
7550,
7554,
7635,
7686,
7690,
7698,
7724,
7751,
7755,
7786,
7790,
7791,
7817,
7844,
7848,
7922,
7926,
7965,
7969,
7973,
7974,
7989,
8015,
8042,
8046,
8050,
8137,
8160,
8164,
8168,
8176,
8194,
8198,
8202,
8206,
8210,
8214,
8219,
8220,
8222,
8223,
8258
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8258,
"ccnet_original_nlines": 444,
"rps_doc_curly_bracket": 0.0012109499657526612,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17849305272102356,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004389170091599226,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40746158361434937,
"rps_doc_frac_unique_words": 0.4635416567325592,
"rps_doc_mean_word_length": 5.802083492279053,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.007315290160477161,
"rps_doc_unigram_entropy": 5.36343240737915,
"rps_doc_word_count": 960,
"rps_doc_frac_chars_dupe_10grams": 0.022262120619416237,
"rps_doc_frac_chars_dupe_5grams": 0.3219030499458313,
"rps_doc_frac_chars_dupe_6grams": 0.3003590703010559,
"rps_doc_frac_chars_dupe_7grams": 0.08348294347524643,
"rps_doc_frac_chars_dupe_8grams": 0.03662478178739548,
"rps_doc_frac_chars_dupe_9grams": 0.03662478178739548,
"rps_doc_frac_chars_top_2gram": 0.07809694856405258,
"rps_doc_frac_chars_top_3gram": 0.11059246212244034,
"rps_doc_frac_chars_top_4gram": 0.13572710752487183,
"rps_doc_books_importance": -679.2179565429688,
"rps_doc_books_importance_length_correction": -679.2179565429688,
"rps_doc_openwebtext_importance": -283.3404541015625,
"rps_doc_openwebtext_importance_length_correction": -283.3404541015625,
"rps_doc_wikipedia_importance": -65.88528442382812,
"rps_doc_wikipedia_importance_length_correction": -65.88528442382812
},
"fasttext": {
"dclm": 0.031815651804208755,
"english": 0.5447471141815186,
"fineweb_edu_approx": 2.276325225830078,
"eai_general_math": 0.901501476764679,
"eai_open_web_math": 0.9780765771865845,
"eai_web_code": 0.000578640028834343
}
}
|
{
"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": "518",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Numerical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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.